FoxIntermediateBackend.Mod 575 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  87. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  291. VAR size: LONGINT;
  292. BEGIN
  293. size := offset - lastUpdated;
  294. IF size > 0 THEN
  295. irv.Emit(Reserve(x.position,size));
  296. END;
  297. irv.Emit(Data(x.position, op));
  298. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  299. END SingleInitialize;
  300. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  301. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  302. BEGIN
  303. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  304. WITH type: SyntaxTree.RecordType DO
  305. baseType := type.baseType;
  306. IF baseType # NIL THEN
  307. baseType := baseType.resolved;
  308. IF baseType IS SyntaxTree.PointerType THEN
  309. baseType := baseType(SyntaxTree.PointerType).pointerBase
  310. END;
  311. Initialize(baseType,NIL, offset);
  312. END;
  313. variable := type.recordScope.firstVariable;
  314. WHILE variable # NIL DO
  315. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  316. variable := variable.nextVariable
  317. END;
  318. | type: SyntaxTree.ArrayType DO
  319. IF type.form = SyntaxTree.Static THEN
  320. baseType := type.arrayBase;
  321. IF TypeNeedsInitialization(baseType) THEN
  322. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  323. FOR i := 0 TO type.staticLength-1 DO
  324. Initialize(baseType,NIL,offset+i*size);
  325. END;
  326. END;
  327. END;
  328. | type: SyntaxTree.MathArrayType DO
  329. IF type.form = SyntaxTree.Open THEN
  330. dim := DynamicDim(type);
  331. baseType := SemanticChecker.ArrayBase(type,dim);
  332. imm := IntermediateCode.Immediate(addressType,dim);
  333. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  334. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  335. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  337. (* flags remain empty (=0) for open array *)
  338. ELSIF type.form = SyntaxTree.Static THEN
  339. baseType := type.arrayBase;
  340. IF TypeNeedsInitialization(baseType) THEN
  341. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  342. ASSERT(type.staticLength < 1024*1024*1024);
  343. FOR i := 0 TO type.staticLength-1 DO
  344. Initialize(baseType,NIL,offset+i*size);
  345. END;
  346. END;
  347. END;
  348. ELSE
  349. IF initializer # NIL THEN
  350. implementationVisitor.Evaluate(initializer, op);
  351. SingleInitialize(op.op, offset);
  352. END;
  353. END;
  354. END Initialize;
  355. BEGIN
  356. IF x.externalName # NIL THEN RETURN END;
  357. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  358. (* code section for variable *)
  359. Global.GetSymbolSegmentedName(x,name);
  360. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  361. irv.SetExported(IsExported(x));
  362. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  363. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  364. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  366. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  367. FOR i := 0 TO DynamicDim(x.type)-1 DO
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. END;
  370. ELSE
  371. lastUpdated:= 0;
  372. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  373. Initialize(x.type, x.initializer, 0);
  374. END;
  375. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  376. IF size > 0 THEN
  377. irv.Emit(Reserve(x.position,size));
  378. END;
  379. IF ~x.fixed THEN
  380. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  381. ELSE
  382. align := x.alignment;
  383. END;
  384. irv.SetPositionOrAlignment(x.fixed, align);
  385. meta.CheckTypeDeclaration(x.type);
  386. END;
  387. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  388. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  389. END;
  390. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  391. END VisitVariable;
  392. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  393. BEGIN
  394. VisitVariable(x)
  395. END VisitProperty;
  396. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  397. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  398. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  399. BEGIN
  400. ASSERT(currentScope IS SyntaxTree.CellScope);
  401. Global.GetSymbolSegmentedName(x,name);
  402. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  403. irv.SetExported(IsExported(x));
  404. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  405. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  406. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  408. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  409. FOR i := 0 TO DynamicDim(x.type)-1 DO
  410. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  411. END;
  412. ELSE
  413. lastUpdated:= 0;
  414. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  415. IF size > 0 THEN
  416. irv.Emit(Reserve(x.position,size));
  417. END;
  418. IF ~x.fixed THEN
  419. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  420. ELSE
  421. align := x.alignment;
  422. END;
  423. irv.SetPositionOrAlignment(x.fixed, align);
  424. meta.CheckTypeDeclaration(x.type);
  425. END;
  426. END VisitParameter;
  427. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  428. BEGIN
  429. Type(x.declaredType); (* => code in objects *)
  430. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  431. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  432. END;
  433. END VisitTypeDeclaration;
  434. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  435. BEGIN
  436. IF (SyntaxTree.Public * x.access # {}) THEN
  437. implementationVisitor.VisitConstant(x);
  438. END;
  439. END VisitConstant;
  440. PROCEDURE Scope(x: SyntaxTree.Scope);
  441. VAR procedure: SyntaxTree.Procedure;
  442. constant: SyntaxTree.Constant;
  443. variable: SyntaxTree.Variable;
  444. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  445. cell: SyntaxTree.CellType;
  446. parameter: SyntaxTree.Parameter;
  447. property: SyntaxTree.Property;
  448. BEGIN
  449. prevScope := currentScope;
  450. currentScope := x;
  451. (* constants treated in implementation visitor *)
  452. WITH x: SyntaxTree.CellScope DO
  453. cell := x.ownerCell;
  454. parameter := cell.firstParameter;
  455. WHILE parameter # NIL DO
  456. VisitParameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. property := cell.firstProperty;
  460. WHILE property # NIL DO
  461. VisitProperty(property);
  462. property := property.nextProperty;
  463. END;
  464. ELSE
  465. END;
  466. typeDeclaration := x.firstTypeDeclaration;
  467. WHILE typeDeclaration # NIL DO
  468. VisitTypeDeclaration(typeDeclaration);
  469. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  470. END;
  471. variable := x.firstVariable;
  472. WHILE variable # NIL DO
  473. VisitVariable(variable);
  474. variable := variable.nextVariable;
  475. END;
  476. procedure := x.firstProcedure;
  477. WHILE procedure # NIL DO
  478. VisitProcedure(procedure);
  479. procedure := procedure.nextProcedure;
  480. END;
  481. constant := x.firstConstant;
  482. WHILE constant # NIL DO
  483. VisitConstant(constant);
  484. constant := constant.nextConstant;
  485. END;
  486. currentScope := prevScope;
  487. END Scope;
  488. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  489. VAR parameter: SyntaxTree.Parameter;
  490. BEGIN
  491. parameter := first;
  492. WHILE parameter # NIL DO
  493. VisitParameter(parameter);
  494. parameter := parameter.nextParameter;
  495. END;
  496. END Parameters;
  497. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  498. VAR scope: SyntaxTree.ProcedureScope;
  499. prevScope: SyntaxTree.Scope;
  500. inline, finalizer: BOOLEAN;
  501. procedureType: SyntaxTree.ProcedureType;
  502. pc: LONGINT;
  503. stackSize: LONGINT;
  504. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  505. null,size,src,dest,fp,res: IntermediateCode.Operand;
  506. cc: LONGINT;
  507. cellType: SyntaxTree.CellType;
  508. registerNumber: LONGINT;
  509. registerParameter: Backend.Registers;
  510. registerParameters: LONGINT;
  511. registerClass: IntermediateCode.RegisterClass;
  512. type: IntermediateCode.Type;
  513. formalParameter: SyntaxTree.Parameter;
  514. recordType: SyntaxTree.RecordType;
  515. isModuleBody: BOOLEAN;
  516. parametersSize: LONGINT;
  517. position: LONGINT;
  518. PROCEDURE Signature;
  519. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  520. BEGIN
  521. procedureType := x.type(SyntaxTree.ProcedureType);
  522. returnType := procedureType.returnType;
  523. IF returnType # NIL THEN
  524. meta.CheckTypeDeclaration(returnType)
  525. END;
  526. parameter := procedureType.firstParameter;
  527. WHILE parameter # NIL DO
  528. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  529. parameter := parameter.nextParameter;
  530. END;
  531. END Signature;
  532. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  533. VAR result: BOOLEAN;
  534. BEGIN
  535. result := FALSE;
  536. IF x = SyntaxTree.invalidExpression THEN
  537. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  538. result := TRUE;
  539. value := x.resolved(SyntaxTree.IntegerValue).value;
  540. ELSE
  541. Error(x.position,"expression is not an integer constant");
  542. END;
  543. RETURN result;
  544. END CheckIntegerValue;
  545. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  546. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  547. BEGIN
  548. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  549. WHILE (this # NIL) & (this.identifier # id) DO
  550. this := this.nextModifier;
  551. END;
  552. IF this # NIL THEN
  553. IF this.expression = NIL THEN
  554. Error(this.position,"expected expression value");
  555. ELSIF CheckIntegerValue(this.expression,value) THEN
  556. END;
  557. RETURN TRUE
  558. ELSE RETURN FALSE
  559. END;
  560. END HasValue;
  561. CONST DefaultDataMemorySize=512;
  562. BEGIN
  563. IF x.externalName # NIL THEN RETURN END;
  564. (*
  565. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  566. *)
  567. (* code section for this procedure *)
  568. position := x.position.start;
  569. scope := x.procedureScope;
  570. prevScope := currentScope;
  571. currentScope := scope;
  572. procedureType := x.type(SyntaxTree.ProcedureType);
  573. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  574. implementationVisitor.temporaries.Init;
  575. implementationVisitor.usedRegisters := NIL;
  576. implementationVisitor.registerUsageCount.Init;
  577. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  578. IF (scope.body # NIL) & (x.isInline) THEN
  579. inline := TRUE;
  580. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  581. ir.SetExported(IsExported(x));
  582. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  583. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  584. IF backend.cellsAreObjects THEN
  585. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  586. ir.SetExported(IsExported(x));
  587. ELSE
  588. RETURN; (* cellnet cannot be compiled for final static hardware *)
  589. END;
  590. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  591. inline := FALSE;
  592. AddBodyCallStub(x);
  593. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  594. ir.SetExported(IsExported(x));
  595. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  596. inline := FALSE;
  597. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  598. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  599. AddBodyCallStub(x);
  600. AddStackAllocation(x,stackSize);
  601. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  602. ir.SetExported(IsExported(x));
  603. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  604. inline := FALSE;
  605. Parameters(procedureType.firstParameter);
  606. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  607. ir.SetExported(IsExported(x));
  608. ELSE
  609. inline := FALSE;
  610. IF x.isEntry OR x.isExit THEN
  611. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  612. ir.SetExported(TRUE);
  613. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  614. ELSE
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  617. END;
  618. END;
  619. cc := procedureType.callingConvention;
  620. IF cc = SyntaxTree.WinAPICallingConvention THEN
  621. parametersSize := ProcedureParametersSize(backend.system,x);
  622. ELSE
  623. parametersSize := 0;
  624. END;
  625. IF scope.body # NIL THEN
  626. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  627. registerNumber := 0;
  628. IF ~inline THEN
  629. IF scope.lastVariable = NIL THEN
  630. stackSize := 0
  631. ELSE
  632. stackSize := scope.lastVariable.offsetInBits;
  633. IF stackSize <0 THEN stackSize := -stackSize END;
  634. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  635. END;
  636. (*
  637. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  638. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  639. *)
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for fill *)
  642. *)
  643. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  644. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  645. IF registerParameter = NIL THEN registerParameters := 0
  646. ELSE registerParameters := LEN(registerParameter)
  647. END;
  648. (* assumption: registers are passed left to right and left parameters are in registers *)
  649. formalParameter := procedureType.firstParameter;
  650. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  651. IF ~PassInRegister(formalParameter) THEN
  652. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  653. ELSE
  654. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  655. IF formalParameter.type.IsRecordType() THEN
  656. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  657. type := addressType;
  658. ELSE
  659. type := GetType(system, formalParameter.type);
  660. END;
  661. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  662. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  663. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  664. implementationVisitor.ReleaseIntermediateOperand(src);
  665. INC(registerNumber);
  666. formalParameter := formalParameter.nextParameter;
  667. END;
  668. END;
  669. END;
  670. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  671. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  672. END;
  673. pc := ir.pc-1;
  674. END;
  675. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  676. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  677. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  678. IF scope.lastVariable # NIL THEN
  679. stackSize := scope.lastVariable.offsetInBits;
  680. IF stackSize <0 THEN stackSize := -stackSize END;
  681. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  682. END;
  683. END;
  684. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  685. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  686. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  687. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  688. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  689. ir.EmitAt(pc,Push(size));
  690. implementationVisitor.StaticCallOperand(result,procedure);
  691. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  692. END;
  693. *)
  694. END;
  695. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  696. IF stackSize > 0 THEN
  697. IF (stackSize MOD system.addressSize = 0) THEN
  698. null := IntermediateCode.Immediate(addressType,0);
  699. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  700. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  701. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  702. ELSE
  703. null := IntermediateCode.Immediate(int8,0);
  704. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  705. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  706. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  707. END;
  708. (*! should potentially be called by backend -- enter might initialize
  709. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  710. *)
  711. END;
  712. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  713. parametersSize := ProcedureParametersSize(backend.system,x);
  714. ELSE
  715. parametersSize := 0;
  716. END;
  717. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  718. finalizer := FALSE;
  719. IF backend.cooperative & x.isFinalizer THEN
  720. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  721. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  722. GetRecordTypeName(recordType,name);
  723. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  724. END;
  725. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  726. IF backend.cooperative THEN
  727. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  728. IF implementationVisitor.profile & ~isModuleBody THEN
  729. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  730. END;
  731. END;
  732. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  733. IF finalizer THEN
  734. IF backend.hasLinkRegister THEN
  735. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  736. END;
  737. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  738. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  739. ir.Emit(Br(x.position,dest));
  740. ELSE
  741. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  742. END;
  743. ELSE
  744. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  745. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  746. END;
  747. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  748. IF backend.cooperative THEN
  749. IF HasPointers (scope) THEN
  750. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  751. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  752. ir.Emit(Result(x.position, res));
  753. ir.Emit(Push(x.position, res));
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. ir.Emit(Pop(x.position, res));
  757. ir.Emit(Return(x.position, res));
  758. ELSE
  759. implementationVisitor.ResetVariables(scope);
  760. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  761. END;
  762. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  763. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  764. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  765. ir.Emit(Result(x.position, res));
  766. ir.Emit(Push(x.position, res));
  767. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  768. ir.Emit(Pop(x.position, res));
  769. ir.Emit(Return(x.position, res));
  770. ELSE
  771. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  772. END;
  773. END;
  774. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  776. ELSE
  777. ir.Emit(Nop(x.position));
  778. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  779. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  780. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  781. END;
  782. END;
  783. END
  784. END;
  785. ELSE (* force body for procedures *)
  786. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  787. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  788. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  789. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  790. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  791. END;
  792. Scope(scope);
  793. Signature;
  794. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  795. currentScope := prevScope;
  796. END Procedure;
  797. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  798. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  799. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  800. BEGIN
  801. ASSERT (bodyProcedure # NIL);
  802. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  803. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  804. procedure.SetScope(bodyProcedure.scope);
  805. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  806. procedure.SetAccess(SyntaxTree.Hidden);
  807. Global.GetSymbolSegmentedName (procedure,name);
  808. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  809. ir.SetExported(TRUE);
  810. ir.SetPriority(InitPriority);
  811. Global.GetSymbolSegmentedName (bodyProcedure,name);
  812. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  813. implementationVisitor.currentScope := module.module.moduleScope;
  814. implementationVisitor.section := ir;
  815. implementationVisitor.PushSelfPointer();
  816. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  817. ELSIF backend.preregisterStatic THEN
  818. implementationVisitor.currentScope := module.module.moduleScope;
  819. implementationVisitor.section := ir;
  820. implementationVisitor.PushSelfPointer();
  821. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  822. ELSE
  823. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  824. ir.Emit(Call(bodyProcedure.position,op, 0));
  825. END;
  826. END AddBodyCallStub;
  827. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  828. VAR name: Basic.SegmentedName;
  829. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  830. BEGIN
  831. Global.GetSymbolSegmentedName (symbol,name);
  832. Basic.RemoveSuffix(name);
  833. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  834. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  835. ir.SetExported(TRUE);
  836. ir.SetPriority(FirstPriority);
  837. IntermediateCode.InitImmediate(op,addressType,initStack);
  838. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  839. END AddStackAllocation;
  840. (** entry function to visit a complete module *)
  841. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  842. VAR
  843. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  844. hasDynamicOperatorDeclarations: BOOLEAN;
  845. operator: SyntaxTree.Operator;
  846. import: SyntaxTree.Import;
  847. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  848. BEGIN
  849. type := type.resolved;
  850. IF type IS SyntaxTree.RecordType THEN
  851. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  852. ELSIF (type IS SyntaxTree.ArrayType) THEN
  853. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  854. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  855. END;
  856. ELSIF type IS SyntaxTree.MathArrayType THEN
  857. WITH type: SyntaxTree.MathArrayType DO
  858. IF type.form = SyntaxTree.Open THEN
  859. RETURN TRUE
  860. ELSIF type.form = SyntaxTree.Static THEN
  861. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  862. END;
  863. END;
  864. END;
  865. RETURN FALSE
  866. END TypeNeedsInitialization;
  867. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  868. VAR variable: SyntaxTree.Variable;
  869. BEGIN
  870. variable := scope.firstVariable;
  871. WHILE variable # NIL DO
  872. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  873. IF variable.initializer # NIL THEN RETURN TRUE END;
  874. variable := variable.nextVariable;
  875. END;
  876. RETURN FALSE
  877. END ScopeNeedsInitialization;
  878. BEGIN
  879. ASSERT(x # NIL); ASSERT(module # NIL);
  880. SELF.module := module;
  881. (* add import names to the generated Sections.Module *)
  882. import := x.moduleScope.firstImport;
  883. WHILE import # NIL DO
  884. import.module.GetName(idstr);
  885. module.imports.AddName(idstr);
  886. import := import.nextImport
  887. END;
  888. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  889. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  890. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  891. moduleSelf.SetType(system.anyType);
  892. moduleSelf.SetScope(x.moduleScope);
  893. moduleSelf.SetUntraced(TRUE);
  894. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  895. ir.SetExported(TRUE);
  896. IntermediateCode.InitImmediate(op,addressType,0);
  897. ir.Emit(Data(Basic.invalidPosition,op));
  898. END;
  899. implementationVisitor.module := module;
  900. implementationVisitor.moduleScope := x.moduleScope;
  901. implementationVisitor.moduleSelf := moduleSelf;
  902. implementationVisitor.canBeLoaded := TRUE;
  903. meta.SetModule(module);
  904. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  905. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  906. END;
  907. IF backend.profile THEN
  908. EnsureBodyProcedure(x.moduleScope);
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  910. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  911. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  912. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  913. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  914. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  915. Global.GetModuleName(module.module,idstr);
  916. implementationVisitor.ProfilerAddModule(idstr);
  917. implementationVisitor.numberProcedures := 0;
  918. END;
  919. implementationVisitor.profile := backend.profile;
  920. (* check if there is at least one dynamic operator locally defined *)
  921. hasDynamicOperatorDeclarations := FALSE;
  922. operator := x.moduleScope.firstOperator;
  923. WHILE operator # NIL DO
  924. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  925. operator := operator.nextOperator
  926. END;
  927. (* add operator initialization code section *)
  928. IF hasDynamicOperatorDeclarations THEN
  929. EnsureBodyProcedure(x.moduleScope);
  930. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  931. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  932. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  933. END;
  934. Scope(x.moduleScope);
  935. IF hasDynamicOperatorDeclarations THEN
  936. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  937. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  938. END;
  939. IF backend.profile THEN
  940. implementationVisitor.ProfilerPatchInit;
  941. END;
  942. END Module;
  943. END DeclarationVisitor;
  944. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  945. RegisterUsageCount*=OBJECT
  946. VAR used: UsedArray; count: LONGINT;
  947. PROCEDURE &Init;
  948. VAR i: LONGINT;
  949. BEGIN
  950. count := 0;
  951. IF used = NIL THEN NEW(used,64); END;
  952. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  953. END Init;
  954. PROCEDURE Grow;
  955. VAR new: UsedArray; size,i: LONGINT;
  956. BEGIN
  957. size := LEN(used)*2;
  958. NEW(new,size);
  959. FOR i := 0 TO LEN(used)-1 DO
  960. new[i].count := used[i].count;
  961. new[i].type := used[i].type;
  962. new[i].map := used[i].map
  963. END;
  964. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  965. used := new
  966. END Grow;
  967. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  968. BEGIN
  969. INC(count);
  970. IF count = LEN(used) THEN Grow END;
  971. used[count].type := type;
  972. used[count].class := class;
  973. used[count].map := count;
  974. RETURN count;
  975. END Next;
  976. PROCEDURE IncUse(register: LONGINT);
  977. BEGIN
  978. INC(used[register].count);
  979. (*
  980. IF (register = 1) & (count > 30) THEN
  981. D.TraceBack;
  982. END;
  983. *)
  984. END IncUse;
  985. PROCEDURE DecUse(register: LONGINT);
  986. BEGIN
  987. DEC(used[register].count);
  988. END DecUse;
  989. PROCEDURE Map(register: LONGINT): LONGINT;
  990. VAR map : LONGINT;
  991. BEGIN
  992. IF register > 0 THEN
  993. map := used[register].map;
  994. WHILE register # map DO register := map; map := used[register].map END;
  995. END;
  996. RETURN register
  997. END Map;
  998. PROCEDURE Use(register: LONGINT): LONGINT;
  999. BEGIN
  1000. IF register< LEN(used) THEN
  1001. RETURN used[register].count
  1002. ELSE
  1003. RETURN 0
  1004. END
  1005. END Use;
  1006. END RegisterUsageCount;
  1007. RegisterEntry = POINTER TO RECORD
  1008. prev,next: RegisterEntry;
  1009. register: LONGINT;
  1010. registerClass: IntermediateCode.RegisterClass;
  1011. type: IntermediateCode.Type;
  1012. END;
  1013. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1014. Variables = OBJECT (Basic.List)
  1015. VAR
  1016. inUse: VariableUse;
  1017. registerIndex: LONGINT;
  1018. nameIndex: LONGINT;
  1019. PROCEDURE & Init;
  1020. VAR i: LONGINT;
  1021. BEGIN
  1022. InitList(16);
  1023. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1024. registerIndex := 1024;
  1025. nameIndex := 0;
  1026. END Init;
  1027. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1028. VAR string: SyntaxTree.IdentifierString ;
  1029. BEGIN
  1030. COPY("@hiddenIRVar",string);
  1031. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1032. RETURN SyntaxTree.NewIdentifier(string);
  1033. END GetUID;
  1034. PROCEDURE GetUsage(VAR use: VariableUse);
  1035. BEGIN
  1036. use := inUse;
  1037. END GetUsage;
  1038. PROCEDURE SetUsage(CONST use: VariableUse);
  1039. BEGIN
  1040. inUse := use;
  1041. END SetUsage;
  1042. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1043. VAR any: ANY;
  1044. BEGIN
  1045. any := Get(i);;
  1046. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1047. END GetVariable;
  1048. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1049. BEGIN
  1050. Set(pos, v);
  1051. END SetVariable;
  1052. PROCEDURE Occupy(pos: LONGINT);
  1053. BEGIN
  1054. INCL(inUse[pos DIV 32], pos MOD 32);
  1055. END Occupy;
  1056. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1057. BEGIN
  1058. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1059. END Occupied;
  1060. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1061. BEGIN
  1062. Occupy(Length());
  1063. Add(v);
  1064. END AddVariable;
  1065. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1066. BEGIN
  1067. t1 := t1.resolved;
  1068. t2 := t2.resolved;
  1069. RETURN t1.SameType(t2);
  1070. (*
  1071. the following needs testing
  1072. RETURN
  1073. (t1.SameType(t2))
  1074. OR
  1075. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1076. OR
  1077. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1078. OR
  1079. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1080. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1081. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1082. OR
  1083. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1084. (DynamicDim(t1) = DynamicDim(t2))
  1085. );
  1086. *)
  1087. END CompatibleType;
  1088. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1089. VAR var : SyntaxTree.Variable; i: LONGINT;
  1090. BEGIN
  1091. pos := Length();
  1092. FOR i := 0 TO pos-1 DO
  1093. IF ~(Occupied(i)) THEN
  1094. var := GetVariable(i);
  1095. IF CompatibleType(type, var.type) & (var.untraced = untraced) & ~(var.type.NeedsTrace()) THEN
  1096. pos := i;
  1097. Occupy(i);
  1098. RETURN var;
  1099. END;
  1100. END;
  1101. END;
  1102. RETURN NIL
  1103. END GetFreeVariable;
  1104. END Variables;
  1105. SymbolMap = POINTER TO RECORD
  1106. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1107. isAddress: BOOLEAN;
  1108. END;
  1109. SymbolMapper = OBJECT
  1110. VAR
  1111. first: SymbolMap;
  1112. PROCEDURE & Init;
  1113. BEGIN
  1114. first := NIL;
  1115. END Init;
  1116. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1117. VAR new: SymbolMap;
  1118. BEGIN
  1119. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1120. new.next := first; first := new;
  1121. END Add;
  1122. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1123. VAR s: SymbolMap;
  1124. BEGIN
  1125. s := first;
  1126. WHILE (s # NIL) & (s.this # this) DO
  1127. s := s.next
  1128. END;
  1129. RETURN s
  1130. END Get;
  1131. END SymbolMapper;
  1132. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1133. VAR
  1134. system: Global.System;
  1135. section: IntermediateCode.Section;
  1136. module: Sections.Module;
  1137. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1138. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1139. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1140. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1141. checker: SemanticChecker.Checker;
  1142. backend: IntermediateBackend;
  1143. meta: MetaDataGenerator;
  1144. position: Position;
  1145. moduleSelf: SyntaxTree.Variable;
  1146. (* variables for hand over of variables / temporary state *)
  1147. currentScope: SyntaxTree.Scope;
  1148. constantDeclaration : SyntaxTree.Symbol;
  1149. result: Operand; (* result of the most recent expression / statement *)
  1150. destination: IntermediateCode.Operand;
  1151. arrayDestinationTag: IntermediateCode.Operand;
  1152. arrayDestinationDimension:LONGINT;
  1153. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1154. conditional: BOOLEAN;
  1155. trueLabel, falseLabel, exitLabel: Label;
  1156. locked: BOOLEAN;
  1157. (*
  1158. usedRegisters: Registers;
  1159. *)
  1160. registerUsageCount: RegisterUsageCount;
  1161. usedRegisters: RegisterEntry;
  1162. (* useful operands and types *)
  1163. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1164. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1165. commentPrintout: Printout.Printer;
  1166. dump: Streams.Writer;
  1167. tagsAvailable : BOOLEAN;
  1168. supportedInstruction: SupportedInstructionProcedure;
  1169. supportedImmediate: SupportedImmediateProcedure;
  1170. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1171. emitLabels: BOOLEAN;
  1172. runtimeModuleName : SyntaxTree.IdentifierString;
  1173. newObjectFile: BOOLEAN;
  1174. indexCounter: LONGINT;
  1175. profile: BOOLEAN;
  1176. profileId, profileInit: IntermediateCode.Section;
  1177. profileInitPatchPosition: LONGINT;
  1178. numberProcedures: LONGINT;
  1179. procedureResultDesignator : SyntaxTree.Designator;
  1180. operatorInitializationCodeSection: IntermediateCode.Section;
  1181. fingerPrinter: FingerPrinter.FingerPrinter;
  1182. temporaries: Variables;
  1183. canBeLoaded : BOOLEAN;
  1184. currentIsInline: BOOLEAN;
  1185. currentMapper: SymbolMapper;
  1186. currentInlineExit: Label;
  1187. moduleBodySection: IntermediateCode.Section;
  1188. NeedDescriptor : BOOLEAN;
  1189. cooperativeSwitches: BOOLEAN;
  1190. lastSwitchPC: LONGINT;
  1191. isUnchecked: BOOLEAN;
  1192. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1193. newObjectFile: BOOLEAN);
  1194. BEGIN
  1195. SELF.system := system;
  1196. SELF.runtimeModuleName := runtime;
  1197. currentScope := NIL;
  1198. hiddenPointerType := NIL;
  1199. delegatePointerType := NIL;
  1200. awaitProcCounter := 0;
  1201. labelId := 0; constId := 0; labelId := 0;
  1202. SELF.checker := checker;
  1203. SELF.backend := backend;
  1204. position := Basic.invalidPosition;
  1205. conditional := FALSE;
  1206. locked := FALSE;
  1207. InitOperand(result,ModeUndefined);
  1208. addressType := IntermediateCode.GetType(system,system.addressType);
  1209. setType := IntermediateCode.GetType(system,system.setType);
  1210. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1211. lenType := IntermediateCode.GetType(system, system.lenType);
  1212. byteType := IntermediateCode.GetType(system, system.byteType);
  1213. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1214. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1215. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1216. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1217. nil := IntermediateCode.Immediate(addressType,0);
  1218. one := IntermediateCode.Immediate(addressType,1);
  1219. IntermediateCode.InitOperand(destination);
  1220. tagsAvailable := TRUE;
  1221. supportedInstruction := supportedInstructionProcedure;
  1222. supportedImmediate := supportedImmediateProcedure;
  1223. inData := FALSE;
  1224. SELF.emitLabels := emitLabels;
  1225. IntermediateCode.InitOperand(arrayDestinationTag);
  1226. bool := IntermediateCode.GetType(system,system.booleanType);
  1227. IntermediateCode.InitImmediate(false,bool,0);
  1228. IntermediateCode.InitImmediate(true,bool,1);
  1229. SELF.newObjectFile := newObjectFile;
  1230. indexCounter := 0;
  1231. NEW(registerUsageCount);
  1232. usedRegisters := NIL;
  1233. procedureResultDesignator := NIL;
  1234. NEW(fingerPrinter);
  1235. NEW(temporaries);
  1236. currentIsInline := FALSE;
  1237. NeedDescriptor := FALSE;
  1238. isUnchecked := backend.noRuntimeChecks;
  1239. END Init;
  1240. TYPE Context = RECORD
  1241. section: IntermediateCode.Section;
  1242. registerUsageCount: RegisterUsageCount;
  1243. usedRegisters: RegisterEntry;
  1244. temporaries: Variables;
  1245. END;
  1246. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1247. VAR context: Context;
  1248. BEGIN
  1249. context.section := section;
  1250. context.registerUsageCount := registerUsageCount;
  1251. context.usedRegisters := usedRegisters;
  1252. context.temporaries := temporaries;
  1253. section := new;
  1254. NEW(registerUsageCount);
  1255. NEW(temporaries);
  1256. usedRegisters := NIL;
  1257. RETURN context;
  1258. END SwitchContext;
  1259. PROCEDURE ReturnToContext(context: Context);
  1260. BEGIN
  1261. section := context.section;
  1262. registerUsageCount := context.registerUsageCount;
  1263. usedRegisters := context.usedRegisters;
  1264. temporaries := context.temporaries;
  1265. END ReturnToContext;
  1266. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1267. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1268. BEGIN
  1269. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1270. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1271. END;
  1272. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1273. section.SetExported(IsExported(syntaxTreeSymbol));
  1274. RETURN section
  1275. END NewSection;
  1276. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1277. VAR new: LONGINT;
  1278. BEGIN
  1279. new := registerUsageCount.Next(type,class);
  1280. UseRegister(new);
  1281. RETURN new
  1282. END AcquireRegister;
  1283. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1284. VAR
  1285. fingerPrint: SyntaxTree.FingerPrint;
  1286. fingerPrintString: ARRAY 32 OF CHAR;
  1287. BEGIN
  1288. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1289. string := "[";
  1290. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1291. Strings.Append(string, fingerPrintString);
  1292. Strings.Append(string, "]");
  1293. END GetFingerprintString;
  1294. (** get the name for the code section that represens a certain symbol
  1295. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1296. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1297. VAR string: ARRAY 32 OF CHAR;
  1298. BEGIN
  1299. Global.GetSymbolSegmentedName(symbol, name);
  1300. (* if the symbol is an operator, then append the fingerprint to the name *)
  1301. IF symbol IS SyntaxTree.Operator THEN
  1302. GetFingerprintString(symbol, string);
  1303. Basic.AppendToSegmentedName(name,string);
  1304. END
  1305. END GetCodeSectionNameForSymbol;
  1306. (** get the name for the code section that represens a certain symbol
  1307. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1308. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1309. VAR string: ARRAY 32 OF CHAR;
  1310. BEGIN
  1311. Global.GetSymbolNameInScope(symbol, scope, name);
  1312. (* if the symbol is an operator, then append the fingerprint to the name *)
  1313. IF symbol IS SyntaxTree.Operator THEN
  1314. GetFingerprintString(symbol, string);
  1315. Strings.Append(name, string);
  1316. END
  1317. END GetCodeSectionNameForSymbolInScope;
  1318. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1319. BEGIN
  1320. IF dump # NIL THEN
  1321. dump.String("enter "); dump.String(s); dump.Ln;
  1322. END;
  1323. END TraceEnter;
  1324. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1325. BEGIN
  1326. IF dump # NIL THEN
  1327. dump.String("exit "); dump.String(s); dump.Ln;
  1328. END;
  1329. END TraceExit;
  1330. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1331. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1332. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1333. VAR i: LONGINT;
  1334. BEGIN
  1335. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1336. IF op.rule # NIL THEN
  1337. FOR i := 0 TO LEN(op.rule)-1 DO
  1338. CheckRegister(op.rule[i])
  1339. END;
  1340. END;
  1341. END CheckRegister;
  1342. BEGIN
  1343. CheckRegister(instruction.op1);
  1344. CheckRegister(instruction.op2);
  1345. CheckRegister(instruction.op3);
  1346. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1347. ELSE section.Emit(instruction);
  1348. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1349. END;
  1350. END Emit;
  1351. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1352. BEGIN
  1353. IF backend.cooperative THEN
  1354. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1355. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1356. ELSE
  1357. Emit(Trap(position,trapNo));
  1358. END;
  1359. END EmitTrap;
  1360. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1361. VAR name: Basic.SegmentedName;
  1362. VAR op1, op2, reg: IntermediateCode.Operand;
  1363. VAR call, nocall: Label;
  1364. VAR parametersSize: LONGINT;
  1365. VAR prevSection: IntermediateCode.Section;
  1366. VAR prevDump: Streams.Writer;
  1367. VAR body: SyntaxTree.Body;
  1368. VAR procedureType: SyntaxTree.ProcedureType;
  1369. BEGIN
  1370. IF procedure # NIL THEN
  1371. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1372. ELSE procedureType := NIL;
  1373. END;
  1374. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1375. prevSection := SELF.section;
  1376. SELF.section := section;
  1377. prevDump := dump;
  1378. dump := section.comments;
  1379. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1380. IF backend.hasLinkRegister THEN
  1381. Emit(Push(Basic.invalidPosition, lr));
  1382. END;
  1383. Emit(Push(Basic.invalidPosition,fp));
  1384. IF procedure # NIL THEN
  1385. body := procedure.procedureScope.body;
  1386. ELSE
  1387. body := NIL;
  1388. END;
  1389. IF backend.cooperative THEN
  1390. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1391. GetCodeSectionNameForSymbol(procedure, name);
  1392. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1393. ELSE
  1394. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1395. END;
  1396. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1397. IntermediateCode.AddOffset(op1, 1);
  1398. Emit(Push(Basic.invalidPosition,op1));
  1399. Emit(Mov(Basic.invalidPosition,fp, sp));
  1400. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1401. NEW(call, section);
  1402. NEW(nocall, section);
  1403. reg := NewRegisterOperand(addressType);
  1404. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1405. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1406. BrltL(call, sp, reg);
  1407. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1408. BrgeL(nocall, sp, op2);
  1409. call.Resolve(section.pc);
  1410. Emit(Push(Basic.invalidPosition, reg));
  1411. ReleaseIntermediateOperand(reg);
  1412. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1413. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1414. Emit(Push(Basic.invalidPosition, op2));
  1415. CallThis(position, "Activities","ExpandStack",2);
  1416. Emit(Result(Basic.invalidPosition, sp));
  1417. nocall.Resolve(section.pc);
  1418. END;
  1419. ELSE
  1420. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1421. Emit(Push(Basic.invalidPosition, one)) ;
  1422. procedureType.SetParametersOffset(1);
  1423. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1424. END;
  1425. Emit(Mov(Basic.invalidPosition, fp, sp));
  1426. END;
  1427. END;
  1428. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1429. SELF.section := prevSection;
  1430. dump := prevDump;
  1431. END EmitEnter;
  1432. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1433. VAR op1,op2: IntermediateCode.Operand;
  1434. VAR instruction: IntermediateCode.Instruction;
  1435. BEGIN
  1436. IntermediateCode.InitNumber(op1,callconv);
  1437. IntermediateCode.InitNumber(op2,varSize);
  1438. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1439. RETURN instruction
  1440. END Enter;
  1441. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1442. VAR op1: IntermediateCode.Operand;
  1443. VAR instruction: IntermediateCode.Instruction;
  1444. BEGIN
  1445. IntermediateCode.InitNumber(op1,callconv);
  1446. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1447. RETURN instruction
  1448. END Leave;
  1449. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1450. VAR prevSection: IntermediateCode.Section;
  1451. VAR op2, size: IntermediateCode.Operand;
  1452. VAR body: SyntaxTree.Body;
  1453. BEGIN
  1454. prevSection := SELF.section;
  1455. SELF.section := section;
  1456. Emit(Leave(position, callconv));
  1457. IF procedure # NIL THEN
  1458. body := procedure.procedureScope.body;
  1459. ELSE
  1460. body := NIL;
  1461. END;
  1462. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1463. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1464. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1465. Emit(Add(position, sp, fp, op2));
  1466. ELSE
  1467. Emit(Mov(position, sp, fp));
  1468. END;
  1469. Emit(Pop(position, fp));
  1470. END;
  1471. SELF.section := prevSection;
  1472. END EmitLeave;
  1473. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1474. VAR m: SymbolMap;
  1475. BEGIN
  1476. position := x.position;
  1477. IF currentIsInline THEN
  1478. m := currentMapper.Get(x);
  1479. IF m # NIL THEN
  1480. (*
  1481. Printout.Info("mapping from", x);
  1482. Printout.Info("mapping to ", m.to);
  1483. *)
  1484. m.to.Accept(SELF);
  1485. op := result;
  1486. IF m.tag # NIL THEN
  1487. ReleaseIntermediateOperand(result.tag);
  1488. m.tag.Accept(SELF);
  1489. op.tag := result.op;
  1490. ReleaseIntermediateOperand(result.tag);
  1491. END;
  1492. RETURN
  1493. END;
  1494. END;
  1495. x.Accept(SELF);
  1496. op := result;
  1497. END Symbol;
  1498. PROCEDURE Expression(x: SyntaxTree.Expression);
  1499. BEGIN
  1500. position := x.position;
  1501. constantDeclaration := NIL;
  1502. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1503. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1504. END;
  1505. IF x.resolved # NIL THEN
  1506. x.resolved.Accept(SELF)
  1507. ELSE
  1508. x.Accept(SELF)
  1509. END;
  1510. (* check this, was commented out in ActiveCells3 *)
  1511. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1512. Error(x.position, "unsupported modifier");
  1513. END;
  1514. END Expression;
  1515. (*
  1516. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1517. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1518. BEGIN
  1519. temporaries.GetUsage(current);
  1520. FOR i := 0 TO LEN(current)-1 DO
  1521. set := current[i] - previous[i];
  1522. IF set # {} THEN
  1523. FOR j := 0 TO MAX(SET)-1 DO
  1524. IF j IN set THEN
  1525. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1526. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1527. Symbol(variable, op);
  1528. MakeMemory(tmp,op.op,addressType,0);
  1529. ReleaseOperand(op);
  1530. Emit(Mov(position,tmp, nil ) );
  1531. ReleaseIntermediateOperand(tmp);
  1532. END;
  1533. END;
  1534. END;
  1535. END;
  1536. END;
  1537. END ResetUsedTemporaries;
  1538. *)
  1539. PROCEDURE Statement(x: SyntaxTree.Statement);
  1540. VAR use: VariableUse;
  1541. BEGIN
  1542. temporaries.GetUsage(use);
  1543. position := x.position;
  1544. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1545. IF commentPrintout # NIL THEN
  1546. commentPrintout.Statement(x);
  1547. dump.Ln;
  1548. (*dump.Update;*)
  1549. END;
  1550. x.Accept(SELF);
  1551. (*
  1552. CheckRegistersFree();
  1553. *)
  1554. (*ResetUsedTemporaries(use);*)
  1555. temporaries.SetUsage(use);
  1556. END Statement;
  1557. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1558. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1559. *)
  1560. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1561. BEGIN
  1562. ASSERT(op.mode # IntermediateCode.Undefined);
  1563. IF op.mode = IntermediateCode.ModeMemory THEN
  1564. ReuseCopy(res,op);
  1565. ELSE
  1566. res := op;
  1567. UseIntermediateOperand(res);
  1568. END;
  1569. IntermediateCode.AddOffset(res,offset);
  1570. IntermediateCode.MakeMemory(res,type);
  1571. END MakeMemory;
  1572. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1573. VAR mem: IntermediateCode.Operand;
  1574. BEGIN
  1575. MakeMemory(mem,res,type,offset);
  1576. ReleaseIntermediateOperand(res);
  1577. res := mem;
  1578. END ToMemory;
  1579. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1580. VAR mem: IntermediateCode.Operand;
  1581. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1582. componentType: SyntaxTree.Type;
  1583. BEGIN
  1584. type := type.resolved;
  1585. IF operand.mode = ModeReference THEN
  1586. IF type IS SyntaxTree.RangeType THEN
  1587. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1588. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1589. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1590. ReleaseOperand(operand);
  1591. operand.op := firstOp;
  1592. operand.tag := lastOp;
  1593. operand.extra := stepOp;
  1594. ELSIF type IS SyntaxTree.ComplexType THEN
  1595. componentType := type(SyntaxTree.ComplexType).componentType;
  1596. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1597. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1598. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1599. ReleaseOperand(operand);
  1600. operand.op := firstOp;
  1601. operand.tag := lastOp
  1602. ELSE
  1603. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1604. ReleaseIntermediateOperand(operand.op);
  1605. operand.op := mem;
  1606. END;
  1607. operand.mode := ModeValue;
  1608. END;
  1609. ASSERT(operand.mode = ModeValue);
  1610. END LoadValue;
  1611. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1612. VAR prevConditional: BOOLEAN;
  1613. BEGIN
  1614. prevConditional := conditional;
  1615. conditional := FALSE;
  1616. InitOperand(result, ModeUndefined);
  1617. Expression(x);
  1618. op := result;
  1619. LoadValue(op,x.type.resolved);
  1620. conditional := prevConditional;
  1621. END Evaluate;
  1622. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1623. VAR prevConditional: BOOLEAN;
  1624. BEGIN
  1625. prevConditional := conditional;
  1626. conditional := FALSE;
  1627. InitOperand(result,ModeUndefined);
  1628. Expression(x);
  1629. op := result;
  1630. (*
  1631. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1632. *)
  1633. conditional := prevConditional;
  1634. END Designate;
  1635. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1636. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1637. BEGIN
  1638. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1639. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1640. conditional := TRUE;
  1641. trueLabel := trueL; falseLabel := falseL;
  1642. Expression(x);
  1643. trueL := trueLabel; falseL := falseLabel;
  1644. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1645. END Condition;
  1646. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1647. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1648. BEGIN
  1649. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1650. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1651. RETURN op
  1652. END NewRegisterOperand;
  1653. PROCEDURE UnuseRegister(register: LONGINT);
  1654. BEGIN
  1655. IF (register > 0) THEN
  1656. register := registerUsageCount.Map(register);
  1657. registerUsageCount.DecUse(register);
  1658. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1659. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1660. END;
  1661. IF registerUsageCount.Use(register)=0 THEN
  1662. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1663. Warning(position, "register cannot be removed");
  1664. END;
  1665. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1666. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1667. END;
  1668. ELSIF registerUsageCount.Use(register)<0 THEN
  1669. Warning(position, "register removed too often");
  1670. IF dump # NIL THEN
  1671. dump.String("register removed too often"); dump.Ln; dump.Update;
  1672. END;
  1673. END;
  1674. END;
  1675. END UnuseRegister;
  1676. PROCEDURE UseRegister(register: LONGINT);
  1677. BEGIN
  1678. IF (register > 0) THEN
  1679. register := registerUsageCount.Map(register);
  1680. registerUsageCount.IncUse(register);
  1681. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1682. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1683. END;
  1684. IF registerUsageCount.Use(register)=1 THEN
  1685. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1686. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1687. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1688. END;
  1689. END;
  1690. END;
  1691. END UseRegister;
  1692. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1693. BEGIN
  1694. UnuseRegister(op.register)
  1695. END ReleaseIntermediateOperand;
  1696. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1697. BEGIN
  1698. UseRegister(op.register)
  1699. END UseIntermediateOperand;
  1700. PROCEDURE ReleaseOperand(CONST op: Operand);
  1701. BEGIN
  1702. UnuseRegister(op.op.register);
  1703. UnuseRegister(op.tag.register);
  1704. UnuseRegister(op.extra.register);
  1705. END ReleaseOperand;
  1706. (* save registers marked in array "markedRegisters" to the stack
  1707. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1708. *)
  1709. PROCEDURE SaveRegisters();
  1710. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1711. BEGIN
  1712. entry := usedRegisters;
  1713. WHILE entry # NIL DO
  1714. type := registerUsageCount.used[entry.register].type;
  1715. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1716. Emit(Push(position,op));
  1717. entry := entry.next;
  1718. END;
  1719. END SaveRegisters;
  1720. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1721. BEGIN
  1722. saved := usedRegisters;
  1723. usedRegisters := NIL;
  1724. END ReleaseUsedRegisters;
  1725. (** remove parameter registers from used queue *)
  1726. PROCEDURE ReleaseParameterRegisters;
  1727. VAR entry,prev,next: RegisterEntry;
  1728. BEGIN
  1729. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1730. WHILE entry # NIL DO
  1731. next := entry.next;
  1732. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1733. registerUsageCount.DecUse(entry.register);
  1734. ASSERT(registerUsageCount.Use(entry.register)=0);
  1735. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1736. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1737. END;
  1738. ELSIF prev = NIL THEN
  1739. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1740. ELSE
  1741. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1742. END;
  1743. entry := next;
  1744. END;
  1745. END ReleaseParameterRegisters;
  1746. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1747. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1748. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1749. BEGIN
  1750. entry := saved;
  1751. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1752. entry := prev;
  1753. WHILE entry # NIL DO
  1754. prev := entry.prev;
  1755. type := entry.type;
  1756. class := entry.registerClass;
  1757. IntermediateCode.InitRegister(op,type,class,entry.register);
  1758. (*
  1759. new := registerUsageCount.Next(type,class);
  1760. registerUsageCount.Remap(entry.register,new);
  1761. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1762. dump.String("remap register "); dump.Int(entry.register,1);
  1763. dump.String("to "); dump.Int(new,1);
  1764. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1765. END;
  1766. entry.register := new;
  1767. *)
  1768. Emit(Pop(position,op));
  1769. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1770. entry := prev;
  1771. END;
  1772. (*
  1773. usedRegisters := saved;
  1774. *)
  1775. END RestoreRegisters;
  1776. PROCEDURE CheckRegistersFree;
  1777. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1778. BEGIN
  1779. IF usedRegisters # NIL THEN
  1780. r := usedRegisters;
  1781. WHILE r # NIL DO
  1782. warning := "register ";
  1783. Strings.AppendInt(warning, r.register);
  1784. Strings.Append(warning, " not released.");
  1785. Warning(position,warning);
  1786. r := r .next;
  1787. END;
  1788. END;
  1789. FOR i := 0 TO registerUsageCount.count-1 DO
  1790. IF registerUsageCount.used[i].count < 0 THEN
  1791. warning := "register ";
  1792. Strings.AppendInt(warning, i);
  1793. Strings.Append(warning, " unused too often.");
  1794. Warning(position,warning);
  1795. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1796. warning := "register ";
  1797. Strings.AppendInt(warning, i);
  1798. Strings.Append(warning, " not unused often enough.");
  1799. Warning(position,warning);
  1800. END;
  1801. END;
  1802. END CheckRegistersFree;
  1803. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1804. Otherwise allocate a new register.
  1805. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1806. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1807. BEGIN
  1808. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1809. UseIntermediateOperand(result);
  1810. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1811. UseIntermediateOperand(result);
  1812. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1813. END;
  1814. END Reuse2;
  1815. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1816. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1817. If not then allocate a new register.
  1818. Does NOT necessarily keep the content of src1 or src2 in result!
  1819. *)
  1820. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1821. BEGIN
  1822. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1823. UseIntermediateOperand(result);
  1824. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1825. UseIntermediateOperand(result);
  1826. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1827. result := alternative; alternative := emptyOperand;
  1828. UseIntermediateOperand(result);
  1829. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1830. END;
  1831. END Reuse2a;
  1832. (* like reuse2 but only one source *)
  1833. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1834. BEGIN
  1835. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1836. UseIntermediateOperand(result);
  1837. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1838. END;
  1839. END Reuse1;
  1840. (* like reuse2a but only one source *)
  1841. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1842. BEGIN
  1843. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1844. UseIntermediateOperand(result);
  1845. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1846. UseIntermediateOperand(result);
  1847. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1848. END;
  1849. END Reuse1a;
  1850. (* like reuse1 but guarantees that content of src1 is in result *)
  1851. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1852. BEGIN
  1853. IF ReusableRegister(src1) THEN
  1854. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1855. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1856. UseIntermediateOperand(result);
  1857. ELSE
  1858. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1859. Emit(Mov(position,result,src1));
  1860. END
  1861. END ReuseCopy;
  1862. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1863. BEGIN
  1864. IF ReusableRegister(src) THEN
  1865. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1866. ELSE
  1867. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1868. Emit(Mov(position,result,src));
  1869. ReleaseIntermediateOperand(src);
  1870. END
  1871. END TransferToRegister;
  1872. (** labels and branches **)
  1873. PROCEDURE NewLabel(): Label;
  1874. VAR label: Label;
  1875. BEGIN
  1876. NEW(label,section); RETURN label;
  1877. END NewLabel;
  1878. PROCEDURE SetLabel(label: Label);
  1879. BEGIN label.Resolve(section.pc);
  1880. END SetLabel;
  1881. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1882. BEGIN
  1883. ASSERT(label # NIL);
  1884. IF label.pc < 0 THEN (* label not yet set *)
  1885. label.AddFixup(section.pc);
  1886. END;
  1887. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1888. END LabelOperand;
  1889. PROCEDURE BrL(label: Label);
  1890. BEGIN
  1891. Emit(Br(position,LabelOperand(label)));
  1892. END BrL;
  1893. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1894. BEGIN
  1895. Emit(Brge(position,LabelOperand(label),left,right));
  1896. END BrgeL;
  1897. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1898. BEGIN
  1899. Emit(Brlt(position,LabelOperand(label),left,right));
  1900. END BrltL;
  1901. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1902. BEGIN
  1903. Emit(Breq(position,LabelOperand(label),left,right));
  1904. END BreqL;
  1905. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1906. BEGIN
  1907. Emit(Brne(position,LabelOperand(label),left,right));
  1908. END BrneL;
  1909. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1910. VAR new: IntermediateCode.Operand;
  1911. BEGIN
  1912. IF Trace THEN TraceEnter("Convert") END;
  1913. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1914. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1915. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1916. & (operand.offset = 0)
  1917. THEN
  1918. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1919. Emit(Conv(position,new,operand));
  1920. ELSE
  1921. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1922. Emit(Conv(position,new,operand));
  1923. ReleaseIntermediateOperand(operand);
  1924. END;
  1925. operand := new;
  1926. 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
  1927. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1928. ELSE
  1929. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1930. Emit(Conv(position,new,operand));
  1931. ReleaseIntermediateOperand(operand);
  1932. operand := new;
  1933. END;
  1934. IF Trace THEN TraceExit("Convert") END;
  1935. END Convert;
  1936. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1937. VAR exit: Label;
  1938. BEGIN
  1939. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1940. exit := NewLabel();
  1941. br(exit,left,right);
  1942. EmitTrap(position,trapNo);
  1943. SetLabel(exit);
  1944. END TrapC;
  1945. (** expressions *)
  1946. (** emit necessary runtime check for set elements **)
  1947. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1948. VAR max: IntermediateCode.Operand;
  1949. BEGIN
  1950. IF isUnchecked THEN RETURN END;
  1951. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1952. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1953. TrapC(BrgeL, max, o, SetElementTrap);
  1954. END;
  1955. END CheckSetElement;
  1956. (** the set that a range represents **)
  1957. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1958. VAR
  1959. operand: Operand;
  1960. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1961. BEGIN
  1962. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1963. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1964. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1965. one := IntermediateCode.Immediate(setType, 1);
  1966. Evaluate(x, operand);
  1967. Convert(operand.op, setType);
  1968. Convert(operand.tag, setType);
  1969. CheckSetElement(operand.op);
  1970. CheckSetElement(operand.tag);
  1971. (* create mask for lower bound
  1972. i.e. shift 11111111 to the left by the value of the lower bound
  1973. *)
  1974. Reuse1(temp, operand.op);
  1975. Emit(Shl(position,temp, allBits, operand.op));
  1976. ReleaseIntermediateOperand(operand.op);
  1977. operand.op := temp;
  1978. (* create mask for upper bound
  1979. i.e. shift 11111111 to the right by the difference between the
  1980. upper bound and the maximum number of set elements
  1981. *)
  1982. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1983. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1984. Reuse1(temp, operand.tag);
  1985. ELSE
  1986. Reuse1(temp, operand.tag);
  1987. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1988. Emit(Sub(position,temp, size, operand.tag));
  1989. END;
  1990. Emit(Shr(position,temp, allBits, operand.tag));
  1991. ReleaseIntermediateOperand(operand.tag);
  1992. operand.tag := temp;
  1993. Reuse2(resultingSet, operand.op, operand.tag);
  1994. (* intersect the two masks *)
  1995. Emit(And(position,resultingSet, operand.op, operand.tag));
  1996. ReleaseOperand(operand);
  1997. RETURN resultingSet
  1998. END SetFromRange;
  1999. PROCEDURE VisitSet(x: SyntaxTree.Set);
  2000. VAR
  2001. res, operand: Operand;
  2002. temp, one, noBits, dest: IntermediateCode.Operand;
  2003. expression: SyntaxTree.Expression;
  2004. i: LONGINT;
  2005. BEGIN
  2006. IF Trace THEN TraceEnter("VisitSet") END;
  2007. dest := destination;
  2008. destination := emptyOperand;
  2009. noBits := IntermediateCode.Immediate(setType, 0);
  2010. one := IntermediateCode.Immediate(setType, 1);
  2011. (* start off with the empty set *)
  2012. InitOperand(res, ModeValue);
  2013. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2014. Emit(Mov(position,res.op, noBits));
  2015. FOR i := 0 TO x.elements.Length() - 1 DO
  2016. expression := x.elements.GetExpression(i);
  2017. IF expression IS SyntaxTree.RangeExpression THEN
  2018. (* range of set elements *)
  2019. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2020. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2021. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2022. ReleaseIntermediateOperand(temp)
  2023. ELSE
  2024. (* singelton element *)
  2025. Evaluate(expression, operand);
  2026. Convert(operand.op, setType);
  2027. CheckSetElement(operand.op);
  2028. (* create subset containing single element *)
  2029. Reuse1(temp, operand.op);
  2030. Emit(Shl(position,temp, one, operand.op));
  2031. ReleaseOperand(operand);
  2032. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2033. ReleaseIntermediateOperand(temp);
  2034. END
  2035. END;
  2036. result := res;
  2037. destination := dest;
  2038. IF Trace THEN TraceExit("VisitSet") END;
  2039. END VisitSet;
  2040. (* math arrays of the form [a,b,c]
  2041. x is a static array and thus does not provide any pointers
  2042. *)
  2043. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2044. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2045. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2046. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2047. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2048. element: SyntaxTree.IntegerValue;
  2049. BEGIN
  2050. numberElements := x.elements.Length();
  2051. expression := index.parameters.GetExpression(dim);
  2052. element := expression(SyntaxTree.IntegerValue);
  2053. FOR i := 0 TO numberElements-1 DO
  2054. expression := x.elements.GetExpression(i);
  2055. element.SetValue(i);
  2056. IF expression IS SyntaxTree.MathArrayExpression THEN
  2057. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2058. ELSE
  2059. Assign(index,expression);
  2060. END;
  2061. END;
  2062. END RecursiveAssignment;
  2063. BEGIN
  2064. (*static math array not providing pointers anyway *)
  2065. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2066. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2067. designator.SetType(variable.type);
  2068. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2069. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2070. FOR i := 0 TO dim-1 DO
  2071. element := SyntaxTree.NewIntegerValue(x.position,0);
  2072. element.SetType(system.longintType);
  2073. index.parameters.AddExpression(element);
  2074. END;
  2075. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2076. RecursiveAssignment(x,0);
  2077. Expression(designator);
  2078. END VisitMathArrayExpression;
  2079. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2080. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2081. BEGIN
  2082. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2083. dest := destination; destination := emptyOperand;
  2084. IF x.operator = Scanner.Not THEN
  2085. IF conditional THEN
  2086. Condition(x.left,falseLabel,trueLabel)
  2087. ELSE
  2088. Evaluate(x.left,operand);
  2089. InitOperand(result,ModeValue);
  2090. Reuse1a(result.op,operand.op,dest);
  2091. Emit(Xor(position,result.op,operand.op,true));
  2092. ReleaseOperand(operand);
  2093. END;
  2094. ELSIF x.operator = Scanner.Minus THEN
  2095. Evaluate(x.left,operand);
  2096. InitOperand(result,ModeValue);
  2097. Reuse1a(result.op,operand.op,dest);
  2098. type := x.left.type.resolved;
  2099. IF type IS SyntaxTree.SetType THEN
  2100. Emit(Not(position,result.op,operand.op));
  2101. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2102. Reuse1(result.tag,operand.tag);
  2103. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2104. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2105. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2106. Emit(Neg(position,result.op,operand.op));
  2107. ELSE HALT(200)
  2108. END;
  2109. ReleaseOperand(operand);
  2110. ELSIF x.operator = Scanner.Address THEN
  2111. Designate(x.left,operand);
  2112. operand.mode := ModeValue;
  2113. t0 := x.left.type.resolved;
  2114. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2115. ReleaseIntermediateOperand(operand.op);
  2116. operand.op := operand.tag;
  2117. IntermediateCode.InitOperand(operand.tag);
  2118. END;
  2119. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2120. result := operand;
  2121. ELSE HALT(100)
  2122. END;
  2123. destination := dest;
  2124. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2125. END VisitUnaryExpression;
  2126. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2127. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2128. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2129. BEGIN
  2130. type := type.resolved;
  2131. originalType := type;
  2132. IF type IS SyntaxTree.PointerType THEN
  2133. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2134. END;
  2135. IF type IS SyntaxTree.ObjectType THEN
  2136. BrL(trueL);
  2137. ELSE
  2138. ASSERT(type IS SyntaxTree.RecordType);
  2139. (*
  2140. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2141. *)
  2142. ReuseCopy(left,tag);
  2143. right := TypeDescriptorAdr(type);
  2144. IF ~newObjectFile THEN
  2145. IntermediateCode.MakeMemory(right,addressType);
  2146. END;
  2147. IF backend.cooperative THEN
  2148. repeatL := NewLabel();
  2149. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2150. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2151. END;
  2152. SetLabel(repeatL);
  2153. BreqL(trueL,left,right);
  2154. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2155. BrneL(repeatL,left,nil);
  2156. ELSIF meta.simple THEN
  2157. level := type(SyntaxTree.RecordType).Level();
  2158. (* get type desc tag of level relative to base tag *)
  2159. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2160. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2161. IntermediateCode.MakeMemory(left,addressType);
  2162. BreqL(trueL,left,right);
  2163. ELSE
  2164. level := type(SyntaxTree.RecordType).Level();
  2165. (* get type desc tag of level relative to base tag *)
  2166. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2167. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2168. IntermediateCode.MakeMemory(left,addressType);
  2169. BreqL(trueL,left,right);
  2170. END;
  2171. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2172. BrL(falseL);
  2173. END;
  2174. END TypeTest;
  2175. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2176. BEGIN
  2177. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2178. IF dump # NIL THEN
  2179. dump.String(s); dump.Ln;
  2180. END;
  2181. END Error;
  2182. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2183. BEGIN
  2184. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2185. IF dump # NIL THEN
  2186. dump.String(s); dump.Ln; dump.Update;
  2187. END;
  2188. END Warning;
  2189. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2190. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2191. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2192. operand:Operand;
  2193. BEGIN
  2194. previousSection := section;
  2195. Global.GetModuleName(mod,name);
  2196. Strings.Append(name,".@Trace");
  2197. Basic.ToSegmentedName(name, pooledName);
  2198. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2199. IF dump # NIL THEN dump := section.comments END;
  2200. IF backend.hasLinkRegister THEN
  2201. Emit(Push(Basic.invalidPosition, lr));
  2202. END;
  2203. variable := mod.moduleScope.firstVariable;
  2204. WHILE variable # NIL DO
  2205. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2206. Symbol(variable, operand);
  2207. register := operand.op;
  2208. CallTraceMethod(register, variable.type);
  2209. ReleaseIntermediateOperand(register);
  2210. END;
  2211. variable := variable.nextVariable;
  2212. END;
  2213. IF backend.hasLinkRegister THEN
  2214. Emit(Pop(Basic.invalidPosition, lr));
  2215. END;
  2216. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2217. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2218. Emit(Br(position,op));
  2219. INC(statCoopTraceModule, section.pc);
  2220. section := previousSection;
  2221. IF dump # NIL THEN dump := section.comments END;
  2222. END CreateTraceModuleMethod;
  2223. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2224. BEGIN
  2225. Emit (Push(position, dst));
  2226. Emit (Push(position, src));
  2227. CallThis(position,"GarbageCollector","Assign", 2);
  2228. END CallAssignPointer;
  2229. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2230. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2231. BEGIN
  2232. IF SemanticChecker.IsPointerType (type) THEN
  2233. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2234. ELSIF type.IsRecordType() THEN
  2235. Emit (Push(position,dst));
  2236. Emit (Push(position,src));
  2237. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2239. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2240. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2241. ELSIF IsStaticArray(type) THEN
  2242. size := StaticArrayNumElements(type);
  2243. base := StaticArrayBaseType(type);
  2244. IF base.IsRecordType() THEN
  2245. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2246. Emit (Push(position, dst));
  2247. Emit (Push(position, src));
  2248. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2251. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2252. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2253. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2254. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2255. Emit (Push(position, dst));
  2256. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2257. Emit (Push(position, src));
  2258. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2259. ELSE
  2260. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2261. Emit (Push(position, dst));
  2262. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2263. Emit (Push(position, src));
  2264. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2265. ASSERT(StaticArrayBaseType(type).IsPointer());
  2266. END;
  2267. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2268. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2269. Emit (Push(position, dst));
  2270. Emit (Push(position, src));
  2271. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2272. ELSE HALT(100); (* missing ? *)
  2273. END;
  2274. END CallAssignMethod;
  2275. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2276. VAR name: Basic.SegmentedName;
  2277. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2278. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2279. context: Context;
  2280. BEGIN
  2281. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2282. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2283. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2284. GetRecordTypeName (recordType,name);
  2285. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2286. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2287. IF dump # NIL THEN dump := section.comments END;
  2288. IF backend.hasLinkRegister THEN
  2289. Emit(Push(Basic.invalidPosition, lr));
  2290. END;
  2291. variable := recordType.recordScope.firstVariable;
  2292. WHILE variable # NIL DO
  2293. IF variable.NeedsTrace() THEN
  2294. dst := NewRegisterOperand (addressType);
  2295. src := NewRegisterOperand (addressType);
  2296. Emit (Mov(position, dst, parameter1));
  2297. Emit (Mov(position, src, parameter2));
  2298. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2299. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2300. CallAssignMethod(dst, src, variable.type);
  2301. ReleaseIntermediateOperand(src);
  2302. ReleaseIntermediateOperand(dst);
  2303. END;
  2304. variable := variable.nextVariable;
  2305. END;
  2306. recordBase := recordType.GetBaseRecord();
  2307. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2308. IF backend.hasLinkRegister THEN
  2309. Emit(Pop(Basic.invalidPosition, lr));
  2310. END;
  2311. GetRecordTypeName (recordBase,name);
  2312. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2313. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2314. Emit(Br(position,op));
  2315. ELSE
  2316. Emit(Exit(position,0,0, 0));
  2317. END;
  2318. IF ~recordType.isObject THEN
  2319. GetRecordTypeName (recordType,name);
  2320. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2321. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2322. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2323. NEW(registerUsageCount);
  2324. usedRegisters := NIL;
  2325. dst := NewRegisterOperand (addressType);
  2326. src := NewRegisterOperand (addressType);
  2327. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2328. Emit(Mov(position, dst, parameter1));
  2329. Emit(Mov(position, src, parameter2));
  2330. label := NewLabel();
  2331. SetLabel(label);
  2332. Emit(Push(position, dst));
  2333. Emit(Push(position, src));
  2334. GetRecordTypeName (recordType,name);
  2335. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2336. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2337. Emit(Call(position, op, 0));
  2338. Emit(Pop(position, src));
  2339. Emit(Pop(position, dst));
  2340. Emit(Add(position, dst, dst, ofs));
  2341. Emit(Add(position, src, src, ofs));
  2342. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2343. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2344. Emit(Exit(position,0,0, 0));
  2345. END;
  2346. INC(statCoopAssignProcedure, section.pc);
  2347. ReturnToContext(context);
  2348. IF dump # NIL THEN dump := section.comments END;
  2349. END CreateAssignProcedure;
  2350. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2351. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2352. BEGIN
  2353. IF IsUnsafePointer (type) THEN
  2354. skip := NewLabel();
  2355. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2356. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2357. BreqL (skip, op, nil);
  2358. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2359. SetLabel (skip);
  2360. ELSIF SemanticChecker.IsPointerType (type) THEN
  2361. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2362. CallThis(position,"GarbageCollector","Mark", 1);
  2363. ELSIF type.IsRecordType() THEN
  2364. Emit (Push(position,register));
  2365. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2367. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2368. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2369. ELSIF IsStaticArray(type) THEN
  2370. size := StaticArrayNumElements(type);
  2371. base := StaticArrayBaseType(type);
  2372. IF base.IsRecordType() THEN
  2373. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2374. Emit (Push(position, register));
  2375. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2377. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2378. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2379. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2380. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2381. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2382. Emit (Push(position, register));
  2383. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2384. ELSE
  2385. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2386. Emit (Push(position, register));
  2387. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2388. ASSERT(base.IsPointer());
  2389. END;
  2390. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2391. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2392. CallThis(position,"GarbageCollector","Mark", 1);
  2393. ELSE HALT(100); (* missing ? *)
  2394. END;
  2395. END CallTraceMethod;
  2396. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2397. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2398. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2399. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2400. BEGIN
  2401. previousSection := section;
  2402. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2403. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2404. GetRecordTypeName (recordType,name);
  2405. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2406. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2407. IF dump # NIL THEN dump := section.comments END;
  2408. IF backend.hasLinkRegister THEN
  2409. Emit(Push(Basic.invalidPosition, lr));
  2410. END;
  2411. variable := recordType.recordScope.firstVariable;
  2412. WHILE variable # NIL DO
  2413. IF variable.NeedsTrace() THEN
  2414. register := NewRegisterOperand (addressType);
  2415. Emit (Mov(position,register,parameter1));
  2416. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2417. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2418. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2419. END;
  2420. CallTraceMethod(register, variable.type);
  2421. ReleaseIntermediateOperand(register);
  2422. END;
  2423. variable := variable.nextVariable;
  2424. END;
  2425. recordBase := recordType.GetBaseRecord();
  2426. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2427. recordBase := recordBase.GetBaseRecord();
  2428. END;
  2429. IF recordBase # NIL THEN
  2430. IF backend.hasLinkRegister THEN
  2431. Emit(Pop(Basic.invalidPosition, lr));
  2432. END;
  2433. GetRecordTypeName (recordBase,name);
  2434. IF HasExplicitTraceMethod (recordBase) THEN
  2435. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2436. ELSE
  2437. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2438. END;
  2439. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2440. Emit(Br(position,op));
  2441. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2442. Emit(Exit(position,0,0,0));
  2443. ELSE
  2444. IF backend.hasLinkRegister THEN
  2445. Emit(Pop(Basic.invalidPosition, lr));
  2446. END;
  2447. IF recordType.isObject THEN
  2448. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2449. ELSE
  2450. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2451. END;
  2452. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2453. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2454. Emit(Br(position,op));
  2455. END;
  2456. IF ~recordType.isObject THEN
  2457. GetRecordTypeName (recordType,name);
  2458. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2459. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2460. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2461. NEW(registerUsageCount);
  2462. usedRegisters := NIL;
  2463. IF dump # NIL THEN dump := section.comments END;
  2464. register := NewRegisterOperand (addressType);
  2465. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2466. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2467. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2468. END;
  2469. Emit (Push(position,register));
  2470. GetRecordTypeName (recordType,name);
  2471. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2472. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2473. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2474. ReleaseIntermediateOperand(register);
  2475. Emit(Exit(position,0,0,0));
  2476. GetRecordTypeName (recordType,name);
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2478. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2479. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2480. NEW(registerUsageCount);
  2481. usedRegisters := NIL;
  2482. register := NewRegisterOperand (addressType);
  2483. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2484. Emit(Mov(position, register, parameter1));
  2485. label := NewLabel();
  2486. SetLabel(label);
  2487. Emit(Push(position, register));
  2488. GetRecordTypeName (recordType,name);
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2490. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2491. Emit(Call(position, op, 0));
  2492. Emit(Pop(position, register));
  2493. Emit(Add(position, register, register, ofs));
  2494. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2495. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2496. Emit(Exit(position,0,0,0));
  2497. END;
  2498. INC(statCoopTraceMethod, section.pc);
  2499. ReturnToContext(context);
  2500. IF dump # NIL THEN dump := section.comments END;
  2501. END CreateTraceMethod;
  2502. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2503. VAR name: Basic.SegmentedName;
  2504. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2505. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2506. context: Context;
  2507. BEGIN
  2508. IF recordType.isObject THEN RETURN END;
  2509. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2510. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2511. GetRecordTypeName (recordType,name);
  2512. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2513. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2514. IF dump # NIL THEN dump := section.comments END;
  2515. IF backend.hasLinkRegister THEN
  2516. Emit(Push(Basic.invalidPosition, lr));
  2517. END;
  2518. variable := recordType.recordScope.firstVariable;
  2519. WHILE variable # NIL DO
  2520. IF variable.NeedsTrace() THEN
  2521. dst := NewRegisterOperand (addressType);
  2522. Emit (Mov(position, dst, parameter1));
  2523. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2524. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2525. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2526. END;
  2527. CallResetProcedure(dst, nil, variable.type);
  2528. ReleaseIntermediateOperand(dst);
  2529. END;
  2530. variable := variable.nextVariable;
  2531. END;
  2532. recordBase := recordType.GetBaseRecord();
  2533. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2534. IF backend.hasLinkRegister THEN
  2535. Emit(Pop(Basic.invalidPosition, lr));
  2536. END;
  2537. GetRecordTypeName (recordBase,name);
  2538. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2539. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2540. Emit(Br(position,op));
  2541. ELSE
  2542. Emit(Exit(position,0,0, 0));
  2543. END;
  2544. GetRecordTypeName (recordType,name);
  2545. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2546. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2547. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2548. NEW(registerUsageCount);
  2549. usedRegisters := NIL;
  2550. dst := NewRegisterOperand (addressType);
  2551. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2552. Emit(Mov(position, dst, parameter1));
  2553. label := NewLabel();
  2554. SetLabel(label);
  2555. Emit(Push(position, dst));
  2556. GetRecordTypeName (recordType,name);
  2557. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2558. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2559. Emit(Call(position, op, 0));
  2560. Emit(Pop(position, dst));
  2561. Emit(Add(position, dst, dst, ofs));
  2562. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2563. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2564. Emit(Exit(position,0,0, 0));
  2565. INC(statCoopResetProcedure, section.pc);
  2566. ReturnToContext(context);
  2567. IF dump # NIL THEN dump := section.comments END;
  2568. END CreateResetProcedure;
  2569. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2570. VAR name: Basic.SegmentedName; context: Context;
  2571. BEGIN
  2572. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2573. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2574. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2575. IF dump # NIL THEN dump := section.comments END;
  2576. IF backend.hasLinkRegister THEN
  2577. Emit(Push(Basic.invalidPosition, lr));
  2578. END;
  2579. Emit(Push(position,fp));
  2580. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2581. ResetVariables(scope);
  2582. Emit(Pop(position,fp));
  2583. Emit(Exit(position,0,0, 0));
  2584. ReturnToContext(context);
  2585. IF dump # NIL THEN dump := section.comments END;
  2586. END CreateResetMethod;
  2587. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2588. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2589. BEGIN
  2590. IF SemanticChecker.IsPointerType (type) THEN
  2591. Emit (Push(position, dest));
  2592. CallThis(position,"GarbageCollector","Reset", 1);
  2593. ELSIF type.IsRecordType() THEN
  2594. Emit (Push(position, dest));
  2595. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2596. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2597. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2598. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2599. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2600. size := GetArrayLength(type, tag);
  2601. base := ArrayBaseType(type);
  2602. IF base.IsRecordType() THEN
  2603. Emit (Push(position, size));
  2604. Emit (Push(position, dest));
  2605. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2606. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2607. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2608. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2609. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2610. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2611. Emit (Push(position, size));
  2612. Emit (Push(position, dest));
  2613. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2614. ELSE
  2615. Emit (Push(position, size));
  2616. Emit (Push(position, dest));
  2617. CallThis(position,"GarbageCollector","ResetArray", 2);
  2618. ASSERT(ArrayBaseType(type).IsPointer());
  2619. END;
  2620. ReleaseIntermediateOperand(size);
  2621. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2622. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2623. Emit (Push(position, dest));
  2624. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2625. ELSE HALT(100); (* missing ? *)
  2626. END;
  2627. END CallResetProcedure;
  2628. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2629. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2630. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2631. VAR operand: Operand;
  2632. BEGIN
  2633. Symbol (symbol, operand);
  2634. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2635. ReleaseOperand(operand);
  2636. END Reset;
  2637. BEGIN
  2638. previousScope := currentScope;
  2639. currentScope := scope;
  2640. pc := section.pc;
  2641. variable := scope.firstVariable;
  2642. WHILE variable # NIL DO
  2643. IF variable.NeedsTrace() THEN
  2644. Reset (variable);
  2645. END;
  2646. variable := variable.nextVariable;
  2647. END;
  2648. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2649. WHILE parameter # NIL DO
  2650. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2651. Reset (parameter);
  2652. END;
  2653. parameter := parameter.nextParameter;
  2654. END;
  2655. INC(statCoopResetVariables, section.pc - pc);
  2656. currentScope := previousScope;
  2657. END ResetVariables;
  2658. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2659. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2660. VAR op: IntermediateCode.Operand; context: Context;
  2661. BEGIN
  2662. previousSection := section;
  2663. GetCodeSectionNameForSymbol(procedure, name);
  2664. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2665. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2666. IF dump # NIL THEN dump := section.comments END;
  2667. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2668. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2669. Emit(Data(position,op));
  2670. Emit(Data(position,nil));
  2671. IF HasPointers (procedure.procedureScope) THEN
  2672. GetCodeSectionNameForSymbol(procedure, name);
  2673. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2674. ELSE
  2675. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2676. END;
  2677. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2678. Emit(Data(position,op));
  2679. ReturnToContext(context);
  2680. IF dump # NIL THEN dump := section.comments END;
  2681. END CreateProcedureDescriptor;
  2682. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2683. VAR import: SyntaxTree.Import;
  2684. s: Basic.MessageString;
  2685. selfName: SyntaxTree.IdentifierString;
  2686. BEGIN
  2687. moduleScope.ownerModule.GetName(selfName);
  2688. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2689. module := moduleScope.ownerModule
  2690. ELSE
  2691. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2692. IF import = NIL THEN
  2693. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2694. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2695. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2696. s := "Module ";
  2697. Strings.Append(s,moduleName);
  2698. Strings.Append(s," cannot be imported.");
  2699. IF force THEN
  2700. Error(position,s);
  2701. ELSIF canBeLoaded THEN
  2702. IF WarningDynamicLoading THEN
  2703. Strings.Append(s, "=> no dynamic linking.");
  2704. Warning(position, s);
  2705. END;
  2706. canBeLoaded := FALSE;
  2707. END;
  2708. RETURN FALSE
  2709. ELSE
  2710. SELF.module.imports.AddName(moduleName)
  2711. END;
  2712. ELSIF import.module = NIL THEN (* already tried *)
  2713. RETURN FALSE
  2714. END;
  2715. module := import.module;
  2716. END;
  2717. RETURN TRUE
  2718. END AddImport;
  2719. (* needed for old binary object file format*)
  2720. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2721. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2722. BEGIN
  2723. IF AddImport(moduleName,module,TRUE) THEN
  2724. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2725. IF procedure = NIL THEN
  2726. s := "Instruction not supported on target, emulation procedure ";
  2727. Strings.Append(s,moduleName);
  2728. Strings.Append(s,".");
  2729. Strings.Append(s,procedureName);
  2730. Strings.Append(s," not present");
  2731. Error(position,s);
  2732. ELSE
  2733. StaticCallOperand(r,procedure);
  2734. ReleaseOperand(r);
  2735. fp := GetFingerprint(procedure);
  2736. END;
  2737. END;
  2738. END EnsureSymbol;
  2739. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2740. VAR exit: Label; trueL,falseL: Label;
  2741. BEGIN
  2742. trueL := NewLabel();
  2743. falseL := NewLabel();
  2744. exit := NewLabel();
  2745. Condition(x,trueL,falseL);
  2746. InitOperand(result,ModeValue);
  2747. SetLabel(trueL);
  2748. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2749. Emit(Mov(position,result.op,true));
  2750. BrL(exit);
  2751. SetLabel(falseL);
  2752. Emit(MovReplace(position,result.op,false));
  2753. SetLabel(exit);
  2754. END ConditionToValue;
  2755. PROCEDURE ValueToCondition(VAR op: Operand);
  2756. BEGIN
  2757. LoadValue(op,system.booleanType);
  2758. BrneL(trueLabel,op.op, false);
  2759. ReleaseOperand(op);
  2760. BrL(falseLabel);
  2761. END ValueToCondition;
  2762. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2763. VAR size: LONGINT;
  2764. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2765. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2766. BEGIN
  2767. ASSERT(type.form = SyntaxTree.Open);
  2768. baseType := type.arrayBase.resolved;
  2769. IF IsOpenArray(baseType) THEN
  2770. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2771. ELSE
  2772. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2773. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2774. END;
  2775. len := tag;
  2776. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2777. IntermediateCode.MakeMemory(len,addressType);
  2778. UseIntermediateOperand(len);
  2779. Reuse2(res,sizeOperand,len);
  2780. Emit(Mul(position,res,sizeOperand,len));
  2781. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2782. RETURN res
  2783. END GetArraySize;
  2784. BEGIN
  2785. type := type.resolved;
  2786. IF IsOpenArray(type) THEN
  2787. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2788. RETURN tag
  2789. ELSE
  2790. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2791. END;
  2792. ELSE
  2793. size := ToMemoryUnits(system,system.SizeOf(type));
  2794. RETURN IntermediateCode.Immediate(addressType,size)
  2795. END;
  2796. END GetDynamicSize;
  2797. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2798. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2799. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2800. BEGIN
  2801. ASSERT(type.form = SyntaxTree.Open);
  2802. baseType := type.arrayBase.resolved;
  2803. IF IsOpenArray(baseType) THEN
  2804. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2805. ELSE
  2806. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2807. END;
  2808. len := tag;
  2809. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2810. IntermediateCode.MakeMemory(len,addressType);
  2811. UseIntermediateOperand(len);
  2812. Reuse2(res,sizeOperand,len);
  2813. Emit(Mul(position,res,sizeOperand,len));
  2814. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2815. RETURN res
  2816. END GetLength;
  2817. BEGIN
  2818. type := type.resolved;
  2819. IF IsOpenArray(type) THEN
  2820. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2821. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2822. ELSIF type IS SyntaxTree.StringType THEN
  2823. RETURN tag;
  2824. ELSE
  2825. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2826. END;
  2827. END GetArrayLength;
  2828. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2829. VAR result: IntermediateCode.Operand;
  2830. BEGIN
  2831. IF backend.cooperative THEN
  2832. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2833. ELSE
  2834. MakeMemory(result, tag, addressType, 0);
  2835. END;
  2836. RETURN result
  2837. END GetSizeFromTag;
  2838. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2839. VAR parameter: SyntaxTree.Parameter;
  2840. BEGIN
  2841. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2842. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2843. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2844. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2845. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2846. END;
  2847. RETURN GetDynamicSize(e.type, tag);
  2848. END GetArrayOfBytesSize;
  2849. (*
  2850. to find imported symbol. not needed ?
  2851. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2852. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2853. BEGIN
  2854. IF AddImport(moduleName,importedModule,FALSE) THEN
  2855. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2856. RETURN symbol
  2857. ELSE
  2858. RETURN NIL
  2859. END
  2860. END SymbolByName;
  2861. *)
  2862. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2863. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2864. BEGIN
  2865. IF AddImport(moduleName,runtimeModule,force) THEN
  2866. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2867. IF procedure = NIL THEN
  2868. s := "Procedure ";
  2869. Strings.Append(s,moduleName);
  2870. Strings.Append(s,".");
  2871. Strings.Append(s,procedureName);
  2872. Strings.Append(s," not present");
  2873. Error(position,s);
  2874. RETURN FALSE
  2875. ELSE
  2876. RETURN TRUE
  2877. END;
  2878. ELSE RETURN FALSE
  2879. END;
  2880. END GetRuntimeProcedure;
  2881. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2882. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2883. s: Basic.MessageString;
  2884. BEGIN
  2885. Basic.InitSegmentedName(name);
  2886. name[0] := Basic.MakeString(moduleName);
  2887. name[1] := Basic.MakeString(typeName);
  2888. name[2] := -1;
  2889. IF AddImport(moduleName,importedModule, FALSE) THEN
  2890. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2891. IF symbol = NIL THEN
  2892. s := "type ";
  2893. Strings.Append(s,moduleName);
  2894. Strings.Append(s,".");
  2895. Strings.Append(s,typeName);
  2896. Strings.Append(s," not present");
  2897. Error(position,s);
  2898. END;
  2899. ELSE symbol := NIL;
  2900. END;
  2901. IF importedModule = moduleScope.ownerModule THEN
  2902. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2903. ELSE
  2904. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2905. END;
  2906. RETURN symbol
  2907. END GetTypeDescriptor;
  2908. (* 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. *)
  2909. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2910. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2911. pooledName: Basic.SegmentedName; size: LONGINT;
  2912. BEGIN
  2913. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2914. StaticCallOperand(result,procedure);
  2915. IF numberParameters < 0 THEN
  2916. size := ProcedureParametersSize(system,procedure);
  2917. ELSE
  2918. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2919. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2920. Error(position,"runtime call parameter count mismatch");
  2921. END;
  2922. END;
  2923. Emit(Call(position, result.op, size));
  2924. ReleaseOperand(result);
  2925. ELSE (* only static linking possible *)
  2926. ASSERT(numberParameters >= 0);
  2927. Basic.InitSegmentedName(pooledName);
  2928. pooledName[0] := Basic.MakeString(moduleName);
  2929. pooledName[1] := Basic.MakeString(procedureName);
  2930. pooledName[2] := -1;
  2931. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2932. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2933. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2934. END;
  2935. END CallThisChecked;
  2936. (* 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. *)
  2937. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2938. BEGIN
  2939. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2940. END CallThis;
  2941. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2942. VAR
  2943. left,right: Operand;
  2944. leftSize, rightSize: IntermediateCode.Operand;
  2945. saved: RegisterEntry;
  2946. reg: IntermediateCode.Operand;
  2947. procedureName: SyntaxTree.IdentifierString;
  2948. BEGIN
  2949. procedureName := "CompareString";
  2950. SaveRegisters();ReleaseUsedRegisters(saved);
  2951. Designate(leftExpression,left);
  2952. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2953. Emit(Push(position,leftSize));
  2954. ReleaseIntermediateOperand(leftSize);
  2955. Emit(Push(position,left.op));
  2956. ReleaseOperand(left);
  2957. Designate(rightExpression,right);
  2958. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2959. Emit(Push(position,rightSize));
  2960. ReleaseIntermediateOperand(rightSize);
  2961. Emit(Push(position,right.op));
  2962. ReleaseOperand(right);
  2963. IF backend.cooperative THEN
  2964. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2965. ELSE
  2966. CallThis(position,runtimeModuleName,procedureName, 4);
  2967. END;
  2968. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2969. Emit(Result(position,reg));
  2970. (*
  2971. AcquireThisRegister(int8,IntermediateCode.Result);
  2972. *)
  2973. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2974. (*
  2975. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2976. *)
  2977. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2978. ReleaseIntermediateOperand(reg);
  2979. BrL(falseLabel);
  2980. END CompareString;
  2981. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2982. VAR
  2983. left,right: Operand;
  2984. leftSize, rightSize: IntermediateCode.Operand;
  2985. saved: RegisterEntry;
  2986. procedureName: SyntaxTree.IdentifierString;
  2987. BEGIN
  2988. procedureName := "CopyString";
  2989. SaveRegisters();ReleaseUsedRegisters(saved);
  2990. Designate(leftExpression,left);
  2991. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2992. Emit(Push(position,leftSize));
  2993. ReleaseIntermediateOperand(leftSize);
  2994. Emit(Push(position,left.op));
  2995. ReleaseOperand(left);
  2996. Designate(rightExpression,right);
  2997. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2998. Emit(Push(position,rightSize));
  2999. ReleaseIntermediateOperand(rightSize);
  3000. Emit(Push(position,right.op));
  3001. ReleaseOperand(right);
  3002. IF backend.cooperative THEN
  3003. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3004. ELSE
  3005. CallThis(position,runtimeModuleName,procedureName,4);
  3006. END;
  3007. RestoreRegisters(saved);
  3008. END CopyString;
  3009. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  3010. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3011. leftType,rightType: SyntaxTree.Type;
  3012. leftExpression,rightExpression : SyntaxTree.Expression;
  3013. componentType: IntermediateCode.Type;
  3014. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3015. size: LONGINT;
  3016. BEGIN
  3017. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3018. dest := destination; destination := emptyOperand;
  3019. leftType := x.left.type.resolved;
  3020. rightType := x.right.type.resolved;
  3021. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3022. CASE x.operator OF
  3023. Scanner.Or:
  3024. (* shortcut evaluation of left OR right *)
  3025. IF ~conditional THEN ConditionToValue(x);
  3026. ELSE
  3027. next := NewLabel();
  3028. Condition(x.left,trueLabel,next);
  3029. SetLabel(next);
  3030. Condition(x.right,trueLabel,falseLabel);
  3031. END;
  3032. |Scanner.And:
  3033. (* shortcut evaluation of left & right *)
  3034. IF ~conditional THEN ConditionToValue(x);
  3035. ELSE
  3036. next := NewLabel();
  3037. Condition(x.left,next,falseLabel);
  3038. SetLabel(next);
  3039. Condition(x.right,trueLabel,falseLabel);
  3040. END;
  3041. |Scanner.Is:
  3042. IF ~conditional THEN ConditionToValue(x);
  3043. ELSE
  3044. (* get type desc tag *)
  3045. IF IsPointerToRecord(leftType,recordType) THEN
  3046. Evaluate(x.left,left);
  3047. Dereference(left,recordType,IsUnsafePointer(leftType))
  3048. ELSE
  3049. Designate(x.left,left);
  3050. END;
  3051. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3052. ReleaseOperand(left);
  3053. END;
  3054. |Scanner.Plus:
  3055. Evaluate(x.left,left);
  3056. Evaluate(x.right,right);
  3057. IF leftType IS SyntaxTree.SetType THEN
  3058. InitOperand(result,ModeValue);
  3059. Reuse2a(result.op,left.op,right.op,dest);
  3060. Emit(Or(position,result.op,left.op,right.op));
  3061. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3062. InitOperand(result,ModeValue);
  3063. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3064. Reuse2(result.tag,left.tag,right.tag);
  3065. Emit(Add(position,result.op,left.op,right.op));
  3066. Emit(Add(position,result.tag,left.tag,right.tag))
  3067. ELSE
  3068. InitOperand(result,ModeValue);
  3069. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3070. AddInt(result.op, left.op, right.op) ;
  3071. ELSE
  3072. *)
  3073. Reuse2a(result.op,left.op,right.op,dest);
  3074. Emit(Add(position,result.op,left.op,right.op));
  3075. (*
  3076. END;
  3077. *)
  3078. END;
  3079. ReleaseOperand(left); ReleaseOperand(right);
  3080. |Scanner.Minus:
  3081. Evaluate(x.left,left);
  3082. Evaluate(x.right,right);
  3083. IF leftType IS SyntaxTree.SetType THEN
  3084. InitOperand(result,ModeValue);
  3085. Reuse1(result.op,right.op);
  3086. Emit(Not(position,result.op,right.op));
  3087. ReleaseOperand(right);
  3088. Emit(And(position,result.op,result.op,left.op));
  3089. ReleaseOperand(left);
  3090. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3091. InitOperand(result,ModeValue);
  3092. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3093. Reuse2(result.tag,left.tag,right.tag);
  3094. Emit(Sub(position,result.op,left.op,right.op));
  3095. Emit(Sub(position,result.tag,left.tag,right.tag));
  3096. ReleaseOperand(left); ReleaseOperand(right)
  3097. ELSE
  3098. InitOperand(result,ModeValue);
  3099. Reuse2a(result.op,left.op,right.op,dest);
  3100. Emit(Sub(position,result.op,left.op,right.op));
  3101. ReleaseOperand(left); ReleaseOperand(right);
  3102. END;
  3103. |Scanner.Times:
  3104. Evaluate(x.left,left);
  3105. Evaluate(x.right,right);
  3106. IF leftType IS SyntaxTree.SetType THEN
  3107. InitOperand(result,ModeValue);
  3108. Reuse2a(result.op,left.op,right.op,dest);
  3109. Emit(And(position,result.op,left.op,right.op));
  3110. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3111. InitOperand(result, ModeValue);
  3112. componentType := left.op.type;
  3113. (* TODO: review this *)
  3114. (*
  3115. result.op = left.op * right.op - left.tag * right.tag
  3116. result.tag = left.tag * right.op + left.op * right.tag
  3117. *)
  3118. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3119. Emit(Mul(position,result.op, left.op, right.op));
  3120. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3121. Emit(Mul(position,tempReg, left.tag, right.tag));
  3122. Emit(Sub(position,result.op, result.op, tempReg));
  3123. Reuse2(result.tag, left.tag, right.op);
  3124. Emit(Mul(position,result.tag, left.tag, right.op));
  3125. Emit(Mul(position,tempReg, left.op, right.tag));
  3126. Emit(Add(position,result.tag, result.tag, tempReg));
  3127. ReleaseIntermediateOperand(tempReg)
  3128. ELSE
  3129. InitOperand(result,ModeValue);
  3130. Reuse2a(result.op,left.op,right.op,dest);
  3131. Emit(Mul(position,result.op,left.op,right.op));
  3132. END;
  3133. ReleaseOperand(left); ReleaseOperand(right);
  3134. |Scanner.Div:
  3135. Evaluate(x.left,left);
  3136. Evaluate(x.right,right);
  3137. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3138. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3139. IF ~isUnchecked THEN
  3140. exit := NewLabel();
  3141. BrltL(exit,zero,right.op);
  3142. EmitTrap(position,NegativeDivisorTrap);
  3143. SetLabel(exit);
  3144. END;
  3145. END;
  3146. InitOperand(result,ModeValue);
  3147. Reuse2a(result.op,left.op,right.op,dest);
  3148. Emit(Div(position,result.op,left.op,right.op));
  3149. ReleaseOperand(left); ReleaseOperand(right);
  3150. |Scanner.Mod:
  3151. Evaluate(x.left,left);
  3152. Evaluate(x.right,right);
  3153. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3154. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3155. IF ~isUnchecked THEN
  3156. exit := NewLabel();
  3157. BrltL(exit,zero,right.op);
  3158. EmitTrap(position,NegativeDivisorTrap);
  3159. SetLabel(exit);
  3160. END;
  3161. END;
  3162. InitOperand(result,ModeValue);
  3163. Reuse2a(result.op,left.op,right.op,dest);
  3164. Emit(Mod(position,result.op,left.op,right.op));
  3165. ReleaseOperand(left); ReleaseOperand(right);
  3166. |Scanner.Slash:
  3167. Evaluate(x.left,left);
  3168. Evaluate(x.right,right);
  3169. IF leftType IS SyntaxTree.SetType THEN
  3170. InitOperand(result,ModeValue);
  3171. Reuse2a(result.op,left.op,right.op,dest);
  3172. Emit(Xor(position,result.op,left.op,right.op));
  3173. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3174. InitOperand(result,ModeValue);
  3175. componentType := left.op.type;
  3176. (* review this *)
  3177. (*
  3178. divisor = right.op * right.op + right.tag * right.tag
  3179. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3180. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3181. *)
  3182. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3183. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3184. Emit(Mul(position,tempReg, right.op, right.op));
  3185. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3186. Emit(Add(position,tempReg, tempReg, tempReg2));
  3187. result.op := tempReg2;
  3188. Emit(Mul(position,result.op, left.op, right.op));
  3189. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3190. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3191. Emit(Add(position,result.op, result.op, tempReg2));
  3192. Emit(Div(position,result.op, result.op, tempReg));
  3193. Reuse2(result.tag, left.tag, right.op);
  3194. Emit(Mul(position,result.tag, left.tag, right.op));
  3195. Emit(Mul(position,tempReg2, left.op, right.tag));
  3196. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3197. Emit(Div(position,result.tag, result.tag, tempReg));
  3198. ReleaseIntermediateOperand(tempReg);
  3199. ReleaseIntermediateOperand(tempReg2)
  3200. ELSE
  3201. InitOperand(result,ModeValue);
  3202. Reuse2a(result.op,left.op,right.op,dest);
  3203. Emit(Div(position,result.op,left.op,right.op));
  3204. END;
  3205. ReleaseOperand(left); ReleaseOperand(right);
  3206. |Scanner.Equal:
  3207. IF ~conditional THEN ConditionToValue(x);
  3208. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3209. CompareString(BreqL,x.left,x.right);
  3210. ELSE
  3211. Evaluate(x.left,left);
  3212. Evaluate(x.right,right);
  3213. IF leftType IS SyntaxTree.RangeType THEN
  3214. ASSERT(rightType IS SyntaxTree.RangeType);
  3215. BrneL(falseLabel, left.op, right.op); (* first *)
  3216. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3217. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3218. ReleaseOperand(left); ReleaseOperand(right);
  3219. BrL(trueLabel)
  3220. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3221. BrneL(falseLabel, left.op, right.op); (* first *)
  3222. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3223. ReleaseOperand(left); ReleaseOperand(right);
  3224. BrL(trueLabel)
  3225. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3226. (* TODO: review this *)
  3227. BrneL(falseLabel, left.op, right.op); (* real part *)
  3228. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3229. ReleaseOperand(left); ReleaseOperand(right);
  3230. BrL(trueLabel)
  3231. ELSE
  3232. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3233. ReleaseOperand(left); ReleaseOperand(right);
  3234. BrL(trueLabel);
  3235. END;
  3236. END;
  3237. |Scanner.LessEqual:
  3238. IF ~conditional THEN ConditionToValue(x);
  3239. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3240. CompareString(BrgeL,x.right,x.left);
  3241. ELSE
  3242. Evaluate(x.left,left);
  3243. Evaluate(x.right,right);
  3244. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3245. Reuse1(temp.op,right.op);
  3246. Emit(And(position,temp.op,left.op,right.op));
  3247. ReleaseOperand(right);
  3248. BreqL(trueLabel,temp.op,left.op);
  3249. BrL(falseLabel);
  3250. ReleaseOperand(temp);ReleaseOperand(left);
  3251. ELSE
  3252. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3253. ReleaseOperand(left); ReleaseOperand(right);
  3254. BrL(trueLabel);
  3255. END;
  3256. END;
  3257. |Scanner.Less:
  3258. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3259. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3260. leftExpression.SetType(system.booleanType);
  3261. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3262. rightExpression.SetType(system.booleanType);
  3263. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3264. leftExpression.SetType(system.booleanType);
  3265. Expression(leftExpression);
  3266. ELSIF ~conditional THEN ConditionToValue(x);
  3267. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3268. CompareString(BrltL,x.left,x.right);
  3269. ELSE
  3270. Evaluate(x.left,left);
  3271. Evaluate(x.right,right);
  3272. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3273. ReleaseOperand(left); ReleaseOperand(right);
  3274. BrL(trueLabel);
  3275. END;
  3276. |Scanner.Greater:
  3277. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3278. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3279. leftExpression.SetType(system.booleanType);
  3280. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3281. rightExpression.SetType(system.booleanType);
  3282. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3283. leftExpression.SetType(system.booleanType);
  3284. Expression(leftExpression);
  3285. ELSIF ~conditional THEN ConditionToValue(x);
  3286. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3287. CompareString(BrltL,x.right,x.left);
  3288. ELSE
  3289. Evaluate(x.left,left);
  3290. Evaluate(x.right,right);
  3291. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3292. ReleaseOperand(left); ReleaseOperand(right);
  3293. BrL(trueLabel);
  3294. END;
  3295. |Scanner.GreaterEqual:
  3296. IF ~conditional THEN ConditionToValue(x);
  3297. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3298. CompareString(BrgeL,x.left,x.right);
  3299. ELSE
  3300. Evaluate(x.left,left);
  3301. Evaluate(x.right,right);
  3302. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3303. Reuse1(temp.op,left.op);
  3304. Emit(And(position,temp.op,left.op,right.op));
  3305. ReleaseOperand(left);
  3306. BreqL(trueLabel, temp.op,right.op);
  3307. ReleaseOperand(temp); ReleaseOperand(right);
  3308. BrL(falseLabel);
  3309. ELSE
  3310. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3311. ReleaseOperand(left); ReleaseOperand(right);
  3312. BrL(trueLabel);
  3313. END;
  3314. END;
  3315. |Scanner.Unequal:
  3316. IF ~conditional THEN ConditionToValue(x);
  3317. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3318. CompareString(BrneL,x.left,x.right);
  3319. ELSE
  3320. Evaluate(x.left,left);
  3321. Evaluate(x.right,right);
  3322. IF leftType IS SyntaxTree.RangeType THEN
  3323. ASSERT(rightType IS SyntaxTree.RangeType);
  3324. BrneL(trueLabel, left.op, right.op); (* first *)
  3325. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3326. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3327. ReleaseOperand(left); ReleaseOperand(right);
  3328. BrL(falseLabel)
  3329. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3330. BrneL(trueLabel, left.op, right.op); (* first *)
  3331. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3332. ReleaseOperand(left); ReleaseOperand(right);
  3333. BrL(falseLabel)
  3334. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3335. (* TODO: review this *)
  3336. BrneL(trueLabel, left.op, right.op); (* real part *)
  3337. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3338. ReleaseOperand(left); ReleaseOperand(right);
  3339. BrL(falseLabel)
  3340. ELSE
  3341. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3342. ReleaseOperand(left); ReleaseOperand(right);
  3343. BrL(trueLabel);
  3344. END;
  3345. END;
  3346. |Scanner.In:
  3347. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3348. Evaluate(x.left,left);
  3349. Evaluate(x.right,right);
  3350. Convert(left.op,setType);
  3351. ReuseCopy(temp.op,right.op);
  3352. Emit(Shr(position,temp.op,temp.op,left.op));
  3353. ReleaseOperand(right); ReleaseOperand(left);
  3354. IntermediateCode.InitImmediate(one,setType,1);
  3355. Emit(And(position,temp.op,temp.op,one));
  3356. IF conditional THEN
  3357. IntermediateCode.InitImmediate(zero,setType,0);
  3358. BrneL(trueLabel,temp.op,zero);
  3359. ReleaseOperand(temp);
  3360. BrL(falseLabel);
  3361. ELSE
  3362. Convert(temp.op,bool);
  3363. result.mode := ModeValue;
  3364. result.op := temp.op;
  3365. result.tag := nil; (* may be left over from calls to evaluate *)
  3366. END;
  3367. ELSE
  3368. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3369. IF x.operator = Scanner.Questionmarks THEN
  3370. leftExpression := x.left;
  3371. rightExpression := x.right;
  3372. ELSE
  3373. leftExpression := x.right;
  3374. rightExpression := x.left;
  3375. END;
  3376. Evaluate(leftExpression, left);
  3377. Emit(Push(position,left.op));
  3378. ReleaseOperand(left);
  3379. Designate(rightExpression, right);
  3380. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3381. IF ~backend.cellsAreObjects THEN
  3382. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3383. END;
  3384. Emit(Push(position,right.op));
  3385. ReleaseOperand(right);
  3386. IF backend.cellsAreObjects THEN
  3387. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3388. ELSE
  3389. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3390. END;
  3391. InitOperand(result, ModeValue);
  3392. result.op := NewRegisterOperand(bool);
  3393. Emit(Result(position,result.op));
  3394. IF conditional THEN
  3395. IntermediateCode.InitImmediate(zero,setType,0);
  3396. BrneL(trueLabel,result.op,zero);
  3397. ReleaseOperand(result);
  3398. BrL(falseLabel);
  3399. END;
  3400. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3401. leftExpression := x.left;
  3402. rightExpression := x.right;
  3403. Evaluate(leftExpression, left);
  3404. Emit(Push(position,left.op));
  3405. ReleaseOperand(left);
  3406. Evaluate(rightExpression, right);
  3407. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3408. IF ~backend.cellsAreObjects THEN
  3409. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3410. END;
  3411. Emit(Push(position,right.op));
  3412. ReleaseOperand(right);
  3413. IF backend.cellsAreObjects THEN
  3414. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3415. ELSE
  3416. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3417. END;
  3418. InitOperand(result, ModeValue);
  3419. result.op := NewRegisterOperand(bool);
  3420. Emit(Result(position,result.op));
  3421. IF conditional THEN
  3422. IntermediateCode.InitImmediate(zero,setType,0);
  3423. BrneL(trueLabel,result.op,zero);
  3424. ReleaseOperand(result);
  3425. BrL(falseLabel);
  3426. END;
  3427. ELSE
  3428. HALT(100);
  3429. END;
  3430. END;
  3431. destination := dest;
  3432. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3433. END VisitBinaryExpression;
  3434. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3435. VAR localResult, operand: Operand;
  3436. BEGIN
  3437. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3438. InitOperand(localResult, ModeValue);
  3439. ASSERT(x.first # NIL);
  3440. Evaluate(x.first, operand);
  3441. localResult.op := operand.op;
  3442. ReleaseOperand(operand);
  3443. UseIntermediateOperand(localResult.op);
  3444. ASSERT(x.last # NIL);
  3445. Evaluate(x.last, operand);
  3446. localResult.tag := operand.op;
  3447. ReleaseOperand(operand);
  3448. UseIntermediateOperand(localResult.tag);
  3449. IF x.step # NIL THEN
  3450. Evaluate(x.step, operand);
  3451. localResult.extra := operand.op;
  3452. ReleaseOperand(operand);
  3453. UseIntermediateOperand(localResult.extra);
  3454. END;
  3455. result := localResult;
  3456. IF Trace THEN TraceExit("VisitRangeExpression") END
  3457. END VisitRangeExpression;
  3458. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3459. BEGIN
  3460. HALT(100); (* should never be evaluated *)
  3461. END VisitTensorRangeExpression;
  3462. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3463. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3464. BEGIN
  3465. IF Trace THEN TraceEnter("VisitConversion") END;
  3466. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3467. dest := destination; destination := emptyOperand;
  3468. Evaluate(x.expression,old);
  3469. InitOperand(result,ModeValue);
  3470. result.op := old.op;
  3471. ASSERT(result.op.mode # 0);
  3472. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3473. (* convert TO a complex number *)
  3474. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3475. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3476. ASSERT(result.op.mode # 0);
  3477. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3478. (* convert FROM a complex number TO a complex number*)
  3479. result.tag := old.tag;
  3480. ASSERT(result.tag.mode # 0);
  3481. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3482. ASSERT(result.tag.mode # 0)
  3483. ELSE
  3484. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3485. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3486. END
  3487. ELSE
  3488. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3489. ASSERT(result.op.mode # 0);
  3490. result.tag := old.tag; (*! probably never used *)
  3491. END;
  3492. destination := dest;
  3493. IF Trace THEN TraceExit("VisitConversion") END;
  3494. END VisitConversion;
  3495. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3496. BEGIN
  3497. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3498. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3499. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3500. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3501. END VisitTypeDeclaration;
  3502. (** designators (expressions) *)
  3503. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3504. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3505. BEGIN
  3506. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3507. IF x.left # NIL THEN Expression(x.left) END;
  3508. Symbol(x.symbol,result);
  3509. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3510. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3511. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3512. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3513. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3514. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3515. END;
  3516. END;
  3517. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3518. END VisitSymbolDesignator;
  3519. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3520. BEGIN
  3521. IF isUnchecked THEN RETURN END;
  3522. IF tagsAvailable THEN
  3523. TrapC(BrltL,index,length,IndexCheckTrap);
  3524. END;
  3525. END BoundCheck;
  3526. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3527. VAR d: IntermediateCode.Operand;
  3528. BEGIN
  3529. IF isUnchecked THEN RETURN END;
  3530. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3531. TrapC(op,dim,d,ArraySizeTrap);
  3532. ReleaseIntermediateOperand(d);
  3533. END DimensionCheck;
  3534. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3535. VAR
  3536. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3537. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3538. expression: SyntaxTree.Expression;
  3539. resultingType, leftType, baseType: SyntaxTree.Type;
  3540. skipLabel1: Label;
  3541. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3542. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3543. variableOp: Operand;
  3544. variable: SyntaxTree.Variable;
  3545. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3546. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3547. VAR e: SyntaxTree.Expression; i: LONGINT;
  3548. BEGIN
  3549. tensorFound := FALSE;
  3550. FOR i := 0 TO parameters.Length()-1 DO
  3551. e := parameters.GetExpression(i);
  3552. IF e IS SyntaxTree.TensorRangeExpression THEN
  3553. ASSERT(~tensorFound);
  3554. tensorFound := TRUE;
  3555. ELSIF e IS SyntaxTree.RangeExpression THEN
  3556. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3557. ELSE
  3558. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3559. END;
  3560. END;
  3561. END CountIndices;
  3562. BEGIN
  3563. ASSERT(tagsAvailable);
  3564. resultingType := x.type.resolved; (* resulting type *)
  3565. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3566. InitOperand(localResult, ModeReference);
  3567. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3568. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3569. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3570. (* a globally defined array destination tag is available -> use and invalidate it*)
  3571. localResult.tag := arrayDestinationTag;
  3572. IntermediateCode.InitOperand(arrayDestinationTag)
  3573. ELSE
  3574. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3575. (* the result is of array range type and thus does not provide any collectable pointers *)
  3576. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3577. Symbol(variable, variableOp);
  3578. ReuseCopy(localResult.tag, variableOp.op);
  3579. ReleaseOperand(variableOp);
  3580. END
  3581. END;
  3582. indexListSize := x.parameters.Length();
  3583. CountIndices(x.parameters);
  3584. (*ASSERT(tensorRangeCount <= 1);*)
  3585. (* designate the array to be indexed over, perform tensor range check if known *)
  3586. Designate(x.left, array);
  3587. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3588. Dereference(array, leftType,FALSE);
  3589. IF ~tensorFound THEN
  3590. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3591. END
  3592. END;
  3593. (* default base offset *)
  3594. srcDimOffset := 0;
  3595. destDimOffset := 0;
  3596. indexDim := 0;
  3597. (* use address of source array as basis *)
  3598. localResult.op := array.op;
  3599. UseIntermediateOperand(localResult.op);
  3600. (* go through the index list *)
  3601. FOR i := 0 TO indexListSize - 1 DO
  3602. expression := x.parameters.GetExpression(i);
  3603. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3604. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3605. srcDimOffset := -indexListSize;
  3606. destDimOffset := -suffixRanges;
  3607. ELSE
  3608. (* determine which dimension of source array is currently looked at *)
  3609. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3610. (* get the memory operand pointing to array descriptor dimension *)
  3611. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3612. (* make a reusable register from it *)
  3613. ReuseCopy(srcDim, tmp);
  3614. ReleaseIntermediateOperand(tmp);
  3615. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3616. ELSE
  3617. srcDim := IntermediateCode.Immediate(sizeType, i);
  3618. END;
  3619. (* get length and increment of source array for current dimension *)
  3620. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3621. Convert(sourceLength.op, sizeType);
  3622. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3623. Convert(sourceIncrement.op, sizeType);
  3624. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3625. ReleaseIntermediateOperand(srcDim);
  3626. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3627. (* SINGLE INDEX *)
  3628. Evaluate(expression, index);
  3629. ReleaseIntermediateOperand(index.tag);
  3630. index.tag := emptyOperand;
  3631. Convert(index.op, sizeType);
  3632. (* lower bound check *)
  3633. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3634. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3635. ELSIF isUnchecked THEN (* do nothing *)
  3636. ELSE
  3637. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3638. END;
  3639. (* upper bound check *)
  3640. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3641. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3642. ELSIF isUnchecked THEN (* do nothing *)
  3643. ELSE
  3644. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3645. END;
  3646. ReleaseOperand(sourceLength);
  3647. Convert(index.op, addressType);
  3648. summand := index.op;
  3649. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3650. (* RANGE OF INDICES *)
  3651. Evaluate(expression, range);
  3652. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3653. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3654. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3655. ReleaseOperand(range);
  3656. Convert(firstIndex, sizeType);
  3657. Convert(lastIndex, sizeType);
  3658. Convert(stepSize, sizeType);
  3659. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3660. if it is 'MAX(LONGINT)' *)
  3661. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3662. TransferToRegister(lastIndex, lastIndex);
  3663. skipLabel1 := NewLabel();
  3664. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3665. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3666. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3667. SetLabel(skipLabel1)
  3668. END;
  3669. (* check if step size is valid *)
  3670. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3671. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3672. ELSIF isUnchecked THEN (* do nothing *)
  3673. ELSE
  3674. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3675. END;
  3676. (* check lower bound check *)
  3677. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3678. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3679. ELSIF isUnchecked THEN (* do nothing *)
  3680. ELSE
  3681. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3682. END;
  3683. (* check upper bound check *)
  3684. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3685. (* statically open range: nothing to do *)
  3686. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3687. ASSERT(staticLastIndex < staticSourceLength)
  3688. ELSIF isUnchecked THEN (* do nothing *)
  3689. ELSE
  3690. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3691. END;
  3692. (* determine length of target array for current dimension *)
  3693. (* 1. incorporate last index: *)
  3694. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3695. (* last index is static *)
  3696. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3697. targetLength := sourceLength.op
  3698. ELSE
  3699. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3700. END;
  3701. UseIntermediateOperand(targetLength);
  3702. ELSE
  3703. (* targetLength := lastIndex + 1
  3704. Reuse1(targetLength, lastIndex);
  3705. *)
  3706. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3707. END;
  3708. ReleaseOperand(sourceLength);
  3709. ReleaseIntermediateOperand(lastIndex);
  3710. (* 2. incorporate first index: *)
  3711. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3712. (* first index and current target length are static *)
  3713. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3714. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3715. (* first index = 0: nothing to do *)
  3716. ELSE
  3717. (* targetLength := targetLength - firstIndex *)
  3718. TransferToRegister(targetLength, targetLength);
  3719. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3720. END;
  3721. (* clip negative lengths to 0 *)
  3722. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3723. IF staticTargetLength < 0 THEN
  3724. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3725. END
  3726. ELSE
  3727. skipLabel1 := NewLabel();
  3728. TransferToRegister(targetLength, targetLength);
  3729. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3730. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3731. SetLabel(skipLabel1)
  3732. END;
  3733. (* 3. incorporate index step size: *)
  3734. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3735. (*step size and current target length are static *)
  3736. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3737. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3738. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3739. (* step size = 1: nothing to do *)
  3740. ELSE
  3741. (* emit code for this:
  3742. targetLength := (targetLength-1) DIV stepSize +1;
  3743. *)
  3744. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3745. DivInt(targetLength, targetLength, stepSize);
  3746. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3747. END;
  3748. (* determine increment of target array for current dimension *)
  3749. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3750. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3751. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3752. (* step size = 1 *)
  3753. targetIncrement := sourceIncrement.op;
  3754. UseIntermediateOperand(targetIncrement)
  3755. ELSE
  3756. (* targetIncrement := sourceIncrement * stepSize *)
  3757. Reuse1(targetIncrement, stepSize);
  3758. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3759. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3760. END;
  3761. ReleaseIntermediateOperand(stepSize);
  3762. (* write length and increment of target array to descriptor *)
  3763. IF destDimOffset < 0 THEN
  3764. (* determine which dimension of target array is currently looked at *)
  3765. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3766. TransferToRegister(destDim, tmp);
  3767. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3768. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3769. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3770. ReleaseIntermediateOperand(destDim);
  3771. INC(destDimOffset);
  3772. ELSE
  3773. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3774. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3775. END;
  3776. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3777. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3778. INC(indexDim);
  3779. Convert(firstIndex, addressType);
  3780. TransferToRegister(summand, firstIndex);
  3781. ELSE HALT(100);
  3782. END;
  3783. (*
  3784. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3785. *)
  3786. Convert(sourceIncrement.op, addressType);
  3787. Convert(summand, addressType);
  3788. MulInt(summand, summand, sourceIncrement.op);
  3789. ReleaseIntermediateOperand(sourceIncrement.op);
  3790. AddInt(localResult.op, localResult.op, summand);
  3791. ReleaseIntermediateOperand(summand);
  3792. END
  3793. END;
  3794. result := localResult;
  3795. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3796. ReleaseIntermediateOperand(result.tag);
  3797. result.tag := TypeDescriptorAdr(resultingType);
  3798. IF ~newObjectFile THEN
  3799. IntermediateCode.MakeMemory(result.tag,addressType);
  3800. END;
  3801. ELSIF IsDelegate(resultingType) THEN
  3802. ReleaseIntermediateOperand(result.tag);
  3803. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3804. UseIntermediateOperand(result.tag);
  3805. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3806. ReleaseIntermediateOperand(result.tag);
  3807. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3808. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3809. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3810. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3811. (* finalize target array descriptor *)
  3812. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3813. (* write lengths and increments of target array for remaining dimensions *)
  3814. i := indexListSize;
  3815. WHILE indexDim < targetArrayDimensionality DO
  3816. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3817. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3818. ReleaseOperand(sourceLength);
  3819. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3820. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3821. ReleaseOperand(sourceIncrement);
  3822. INC(i); INC(indexDim);
  3823. END;
  3824. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3825. tmp := nil;
  3826. ELSE
  3827. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3828. END;
  3829. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3830. ReleaseIntermediateOperand(tmp);
  3831. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3832. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3833. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3834. ELSE
  3835. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3836. END;
  3837. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3838. ReleaseIntermediateOperand(tmp);
  3839. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3840. (* write dimensionality *)
  3841. IF targetArrayDimensionality # 0 THEN
  3842. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3843. END;
  3844. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3845. END;
  3846. ReleaseOperand(array);
  3847. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3848. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3849. END;
  3850. END MathIndexDesignator;
  3851. (* get the length of an array , trying to make use of static information *)
  3852. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3853. VAR res: IntermediateCode.Operand; size: LONGINT;
  3854. BEGIN
  3855. type := type.resolved;
  3856. IF type IS SyntaxTree.ArrayType THEN
  3857. WITH type: SyntaxTree.ArrayType DO
  3858. IF type.form = SyntaxTree.Static THEN
  3859. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3860. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3861. Evaluate(type.length, op);
  3862. ReleaseIntermediateOperand(op.tag);
  3863. RETURN op.op;*)
  3864. ELSE
  3865. res := tag;
  3866. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3867. IntermediateCode.MakeMemory(res,addressType);
  3868. UseIntermediateOperand(res);
  3869. RETURN res
  3870. END
  3871. END;
  3872. ELSE
  3873. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3874. RETURN IntermediateCode.Immediate(addressType,size);
  3875. END;
  3876. END ArrayLength;
  3877. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3878. BEGIN
  3879. IF IsImmediate(x) THEN
  3880. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3881. ELSE
  3882. IF ~ReusableRegister(res) THEN
  3883. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3884. ELSE
  3885. UseIntermediateOperand(res);
  3886. END;
  3887. Emit(Mov(position,res,x))
  3888. END;
  3889. END CopyInt;
  3890. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3891. BEGIN
  3892. ReleaseIntermediateOperand(res);
  3893. IF IsImmediate(x) & IsImmediate(y) THEN
  3894. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3895. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3896. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3897. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3898. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3899. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3900. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3901. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3902. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3903. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3904. UseIntermediateOperand(res);
  3905. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3906. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3907. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3908. UseIntermediateOperand(res);
  3909. ELSE
  3910. IF ~ReusableRegister(res) THEN
  3911. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3912. ELSE
  3913. UseIntermediateOperand(res);
  3914. END;
  3915. IF IsImmediate(x) & (x.intValue = 0) THEN
  3916. Emit(Mov(position,res,y))
  3917. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3918. Emit(Mov(position,res,x))
  3919. ELSE
  3920. Emit(Add(position,res, x, y));
  3921. END;
  3922. END;
  3923. END AddInt;
  3924. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3925. BEGIN
  3926. ReleaseIntermediateOperand(res);
  3927. IF IsImmediate(x) & IsImmediate(y) THEN
  3928. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3929. ELSE
  3930. IF ~ReusableRegister(res) THEN
  3931. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3932. ELSE UseIntermediateOperand(res);
  3933. END;
  3934. IF IsImmediate(x) & (x.intValue = 1) THEN
  3935. Emit(Mov(position,res,y))
  3936. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3937. Emit(Mov(position,res,x))
  3938. ELSE
  3939. Emit(Mul(position,res, x, y));
  3940. END;
  3941. END;
  3942. END MulInt;
  3943. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3944. BEGIN
  3945. ReleaseIntermediateOperand(res);
  3946. IF IsImmediate(x) & IsImmediate(y) THEN
  3947. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3948. ELSE
  3949. IF ~ReusableRegister(res) THEN
  3950. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3951. ELSE UseIntermediateOperand(res);
  3952. END;
  3953. IF IsImmediate(x) & (x.intValue = 1) THEN
  3954. Emit(Mov(position,res,y))
  3955. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3956. Emit(Mov(position,res,x))
  3957. ELSE
  3958. Emit(Div(position,res, x, y));
  3959. END;
  3960. END;
  3961. END DivInt;
  3962. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3963. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3964. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3965. BEGIN
  3966. type := x.left.type.resolved;
  3967. IF type IS SyntaxTree.StringType THEN
  3968. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3969. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3970. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3971. type := atype;
  3972. x.left.SetType(type);
  3973. END;
  3974. IntermediateCode.InitImmediate(res,addressType,0);
  3975. maxDim := x.parameters.Length()-1;
  3976. (*
  3977. computation rule:
  3978. a: ARRAY X,Y,Z OF Element with size S
  3979. a[i,j,k] -->
  3980. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3981. *)
  3982. FOR i := 0 TO maxDim DO
  3983. e := x.parameters.GetExpression(i);
  3984. Evaluate(e,index);
  3985. Convert(index.op,addressType);
  3986. AddInt(res, res, index.op);
  3987. IF i = 0 THEN
  3988. (*
  3989. ReuseCopy(res, index.op);
  3990. *)
  3991. Designate(x.left,array);
  3992. type := x.left.type.resolved;
  3993. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3994. Dereference(array, type, FALSE);
  3995. END;
  3996. (*
  3997. ELSE AddInt(res, res, index.op);
  3998. *)
  3999. END;
  4000. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4001. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4002. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4003. BoundCheck(index.op, length);
  4004. END;
  4005. ReleaseIntermediateOperand(length);
  4006. END;
  4007. ReleaseOperand(index);
  4008. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4009. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4010. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4011. MulInt(res,res,length);
  4012. END;
  4013. ReleaseIntermediateOperand(length);
  4014. END;
  4015. (* remaining open dimensions -- compute address *)
  4016. i := maxDim+1;
  4017. IF type IS SyntaxTree.ArrayType THEN
  4018. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4019. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4020. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4021. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4022. MulInt(res,res,length);
  4023. END;
  4024. ReleaseIntermediateOperand(length);
  4025. INC(i);
  4026. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4027. END;
  4028. END;
  4029. IF (type IS SyntaxTree.ArrayType) THEN
  4030. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4031. size := StaticSize(system, type);
  4032. IF size # 1 THEN
  4033. length := IntermediateCode.Immediate(addressType,size);
  4034. MulInt(res,res,length);
  4035. END;
  4036. ELSE
  4037. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4038. IF size # 1 THEN
  4039. length := IntermediateCode.Immediate(addressType,size);
  4040. MulInt(res,res,length);
  4041. END;
  4042. END;
  4043. END;
  4044. AddInt(res,res,array.op);
  4045. InitOperand(result,ModeReference);
  4046. result.op := res;
  4047. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4048. ReleaseIntermediateOperand(result.tag);
  4049. result.tag := TypeDescriptorAdr(type);
  4050. IF ~newObjectFile THEN
  4051. IntermediateCode.MakeMemory(result.tag,addressType);
  4052. END
  4053. ELSIF IsDelegate(type) THEN
  4054. ReleaseIntermediateOperand(result.tag);
  4055. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4056. UseIntermediateOperand(result.tag);
  4057. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4058. ReleaseIntermediateOperand(result.tag);
  4059. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4060. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4061. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4062. END;
  4063. ReleaseOperand(array);
  4064. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4065. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4066. END;
  4067. END IndexDesignator;
  4068. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4069. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4070. BEGIN
  4071. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4072. dest := destination; destination := emptyOperand;
  4073. type := x.left.type.resolved;
  4074. IF type IS SyntaxTree.MathArrayType THEN
  4075. MathIndexDesignator(x);
  4076. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4077. IndexDesignator(x);
  4078. END;
  4079. destination := dest;
  4080. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4081. END VisitIndexDesignator;
  4082. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4083. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4084. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4085. procedure: SyntaxTree.Procedure;
  4086. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4087. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4088. BEGIN
  4089. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4090. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4091. parameters := expression.parameters;
  4092. moduleName := "FoxArrayBase";
  4093. procedureName := "CopyDescriptor";
  4094. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4095. SaveRegisters();ReleaseUsedRegisters(saved);
  4096. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4097. IF procedure = NIL THEN
  4098. s := "procedure ";
  4099. Strings.Append(s,moduleName);
  4100. Strings.Append(s,".");
  4101. Strings.Append(s,procedureName);
  4102. Strings.Append(s," not present");
  4103. Error(position,s);
  4104. ELSE
  4105. (* push address of temporary variable *)
  4106. Symbol(variable,destOperand);
  4107. Emit(Push(position,destOperand.op));
  4108. ReleaseOperand(destOperand);
  4109. (* push src *)
  4110. Evaluate(expression.left,srcOperand);
  4111. (*
  4112. Dereference(srcOperand,expression.type.resolved);
  4113. Emit(Push(position,srcOperand.tag));
  4114. *)
  4115. Emit(Push(position,srcOperand.op));
  4116. ReleaseOperand(srcOperand);
  4117. tensorFound := FALSE;
  4118. FOR i := 0 TO parameters.Length()-1 DO
  4119. e := parameters.GetExpression(i);
  4120. IF e IS SyntaxTree.TensorRangeExpression THEN
  4121. tensorFound := TRUE;
  4122. ELSIF e IS SyntaxTree.RangeExpression THEN
  4123. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4124. ELSE
  4125. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4126. END;
  4127. END;
  4128. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4129. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4130. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4131. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4132. StaticCallOperand(procOp,procedure);
  4133. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4134. ReleaseOperand(procOp);
  4135. END;
  4136. RestoreRegisters(saved);
  4137. END;
  4138. RETURN variable
  4139. END PrepareTensorDescriptor;
  4140. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4141. VAR
  4142. type, descriptorType, baseType: SyntaxTree.Type;
  4143. operand, tmpOperand, variableOp, variable2Op: Operand;
  4144. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4145. variable, variable2: SyntaxTree.Variable;
  4146. dim, i, size: LONGINT;
  4147. (* TODO: needed? *)
  4148. oldArrayDestinationTag: IntermediateCode.Operand;
  4149. oldArrayDestinationDimension: LONGINT;
  4150. position: Position;
  4151. saved: RegisterEntry;
  4152. arrayFlags: SET;
  4153. m, n: LONGINT;
  4154. PROCEDURE Pass(op: IntermediateCode.Operand);
  4155. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4156. BEGIN
  4157. IF numberRegister >= 0 THEN
  4158. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4159. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4160. Emit(Mov(position,parameterRegister, op));
  4161. ELSE
  4162. Emit(Push(position,op))
  4163. END
  4164. END Pass;
  4165. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4166. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4167. BEGIN
  4168. formalType := formalType.resolved; actualType := actualType.resolved;
  4169. IF IsOpenArray(formalType)THEN
  4170. IF actualType IS SyntaxTree.StringType THEN
  4171. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4172. RETURN;
  4173. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4174. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4175. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4176. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4177. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4178. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4179. ELSE
  4180. tmp := baseReg;
  4181. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4182. IntermediateCode.MakeMemory(tmp,addressType);
  4183. Pass((tmp));
  4184. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4185. END;
  4186. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4187. END;
  4188. END PushArrayLens;
  4189. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4190. BEGIN
  4191. CASE size OF
  4192. |2: INCL(flags,Size2Flag);
  4193. |3: INCL(flags,Size3Flag);
  4194. |4: INCL(flags,Size4Flag);
  4195. |5: INCL(flags,Size5Flag);
  4196. |6: INCL(flags,Size6Flag);
  4197. |7: INCL(flags,Size7Flag);
  4198. |8: INCL(flags,Size8Flag);
  4199. END;
  4200. END SetSmallArraySizeFlag;
  4201. BEGIN
  4202. IF Trace THEN TraceEnter("PushParameter") END;
  4203. position := expression.position;
  4204. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4205. type := expression.type.resolved;
  4206. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4207. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4208. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4209. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4210. );
  4211. (* TODO: needed? *)
  4212. oldArrayDestinationTag := arrayDestinationTag;
  4213. oldArrayDestinationDimension := arrayDestinationDimension;
  4214. IF IsArrayOfSystemByte(parameter.type) THEN
  4215. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4216. Designate(expression,operand);
  4217. ELSE
  4218. Evaluate(expression, tmpOperand);
  4219. (* array of system byte does not provide any pointers *)
  4220. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4221. Symbol(variable, operand);
  4222. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4223. Emit(Mov(position,tmp, tmpOperand.op));
  4224. ReleaseOperand(tmpOperand);
  4225. END;
  4226. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4227. ReleaseIntermediateOperand(operand.tag);
  4228. operand.tag := tmp;
  4229. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4230. Pass((operand.tag));
  4231. END;
  4232. Pass((operand.op));
  4233. ELSIF IsOpenArray(parameter.type) THEN
  4234. Designate(expression,operand);
  4235. baseReg := operand.tag;
  4236. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4237. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4238. END;
  4239. Pass((operand.op)); (* address of the array *)
  4240. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4241. (* case 1
  4242. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4243. *)
  4244. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4245. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4246. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4247. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4248. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4249. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4250. arrayDestinationTag := sp;
  4251. (* case 1b
  4252. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4253. *)
  4254. IF expression IS SyntaxTree.IndexDesignator THEN
  4255. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4256. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4257. arrayDestinationDimension := dim;
  4258. Designate(expression,operand);
  4259. (* case 1a
  4260. P(...,A,...) push: push array descriptor to stack
  4261. *)
  4262. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4263. Designate(expression,operand);
  4264. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4265. i := 0;
  4266. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4267. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4268. INC(i);
  4269. END;
  4270. type := expression.type.resolved;
  4271. WHILE (i<dim) DO (* remaining static dimensions *)
  4272. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4273. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4274. ReleaseOperand(tmpOperand);
  4275. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4276. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4277. ReleaseOperand(tmpOperand);
  4278. INC(i);
  4279. END;
  4280. dimOp := IntermediateCode.Immediate(addressType,dim);
  4281. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4282. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4283. (* case 1d
  4284. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4285. + case 1e
  4286. P(.. PT() ... );
  4287. *)
  4288. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4289. Designate(expression,operand);
  4290. Dereference(operand,type.resolved,FALSE);
  4291. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4292. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4293. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4294. (* case 1f
  4295. P(...,S,...) push: create array descriptor to S on stack
  4296. case 1g
  4297. P(... PS()...)
  4298. *)
  4299. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4300. Designate(expression,operand);
  4301. FOR i := 0 TO dim-1 DO
  4302. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4303. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4304. ReleaseOperand(tmpOperand);
  4305. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4306. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4307. ReleaseOperand(tmpOperand);
  4308. END;
  4309. (*******
  4310. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4311. *)
  4312. arrayFlags := {StaticFlag};
  4313. IF dim = 1 THEN
  4314. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4315. ReleaseOperand(tmpOperand);
  4316. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4317. m := LONGINT(tmpOperand.op.intValue);
  4318. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4319. ELSIF dim = 2 THEN
  4320. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4321. ReleaseOperand(tmpOperand);
  4322. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4323. m := LONGINT(tmpOperand.op.intValue);
  4324. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4325. ReleaseOperand(tmpOperand);
  4326. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4327. n := LONGINT(tmpOperand.op.intValue);
  4328. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4329. INCL(arrayFlags,SmallMatrixFlag);
  4330. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4331. END;
  4332. END;
  4333. (*******)
  4334. dimOp := IntermediateCode.Immediate(addressType,dim);
  4335. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4336. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4337. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4338. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4339. baseType := SemanticChecker.ArrayBase(type,dim);
  4340. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4341. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4342. ELSE HALT(100);
  4343. END;
  4344. (* case 2
  4345. procedure P([left args], var A: array [*,*] of Type, [right args])
  4346. *)
  4347. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4348. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4349. (* case 2b
  4350. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4351. push: push reference to pushed array descriptor
  4352. post: remove array descriptor.
  4353. *)
  4354. IF expression IS SyntaxTree.IndexDesignator THEN
  4355. descriptorType := GetMathArrayDescriptorType(dim);
  4356. (* range type : no allocation possible, should be untraced *)
  4357. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4358. Symbol(variable,variableOp);
  4359. arrayDestinationTag := variableOp.op;
  4360. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4361. arrayDestinationDimension := dim;
  4362. NeedDescriptor := TRUE;
  4363. Designate(expression,operand);
  4364. Pass((operand.tag));
  4365. NeedDescriptor := FALSE;
  4366. (* case 2a
  4367. P(...,A,...)
  4368. push: push reference to array descriptor on stack
  4369. *)
  4370. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4371. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4372. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4373. INC(i);
  4374. END;
  4375. IF i = dim THEN
  4376. Designate(expression,operand);
  4377. Pass((operand.tag));
  4378. ELSE (* open-static *)
  4379. type := expression.type.resolved;
  4380. descriptorType := GetMathArrayDescriptorType(dim);
  4381. (* static array , cannot be reallocated, untraced !*)
  4382. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4383. Symbol(variable,variableOp);
  4384. arrayDestinationTag := variableOp.op;
  4385. Designate(expression,operand);
  4386. FOR i := 0 TO dim-1 DO
  4387. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4388. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4389. ReleaseOperand(tmpOperand);
  4390. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4391. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4392. ReleaseOperand(tmpOperand);
  4393. END;
  4394. dimOp := IntermediateCode.Immediate(addressType,dim);
  4395. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4396. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4397. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4398. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4399. baseType := SemanticChecker.ArrayBase(type,dim);
  4400. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4401. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4402. Pass((arrayDestinationTag));
  4403. END;
  4404. (* case 2d
  4405. P(...,T,...) push: emit dimension check, push T
  4406. *)
  4407. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4408. Designate(expression,operand);
  4409. Dereference(operand,type.resolved,FALSE);
  4410. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4411. Pass((operand.tag));
  4412. (* case 2f
  4413. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4414. push: push reference to pushed array descriptor
  4415. post: remove array descriptor
  4416. *)
  4417. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4418. descriptorType := GetMathArrayDescriptorType(dim);
  4419. (* static array -- cannot be reallocatated, untraced *)
  4420. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4421. Symbol(variable,variableOp);
  4422. arrayDestinationTag := variableOp.op;
  4423. Designate(expression,operand);
  4424. FOR i := 0 TO dim-1 DO
  4425. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4426. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4427. ReleaseOperand(tmpOperand);
  4428. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4429. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4430. ReleaseOperand(tmpOperand);
  4431. END;
  4432. (*
  4433. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4434. *)
  4435. arrayFlags := {StaticFlag};
  4436. IF dim = 1 THEN
  4437. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4438. ReleaseOperand(tmpOperand);
  4439. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4440. m := LONGINT(tmpOperand.op.intValue);
  4441. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4442. ELSIF dim = 2 THEN
  4443. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4444. ReleaseOperand(tmpOperand);
  4445. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4446. m := LONGINT(tmpOperand.op.intValue);
  4447. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4448. ReleaseOperand(tmpOperand);
  4449. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4450. n := LONGINT(tmpOperand.op.intValue);
  4451. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4452. INCL(arrayFlags,SmallMatrixFlag);
  4453. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4454. END;
  4455. END;
  4456. (*******)
  4457. dimOp := IntermediateCode.Immediate(addressType,dim);
  4458. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4459. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4460. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4461. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4462. baseType := SemanticChecker.ArrayBase(type,dim);
  4463. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4464. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4465. Pass((arrayDestinationTag));
  4466. ELSE HALT(100);
  4467. END;
  4468. (* case 3
  4469. procedure P([left args], [const] A: array [?] of Type, [right args])
  4470. *)
  4471. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4472. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4473. (* case 3b
  4474. P(...,A[a..b,c..d],...)
  4475. *)
  4476. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4477. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4478. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4479. Symbol(variable,variableOp);
  4480. LoadValue(variableOp,system.addressType);
  4481. ELSE
  4482. descriptorType := GetMathArrayDescriptorType(dim);
  4483. (* range -- cannot be reallocated *)
  4484. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4485. Symbol(variable,variableOp);
  4486. END;
  4487. arrayDestinationTag := variableOp.op;
  4488. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4489. arrayDestinationDimension := 0;
  4490. Designate(expression,operand);
  4491. Pass((operand.tag));
  4492. (* case 3a
  4493. P(...,A,...)
  4494. *)
  4495. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4496. i := 0;
  4497. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4498. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4499. INC(i);
  4500. END;
  4501. IF i = dim THEN
  4502. Designate(expression,operand);
  4503. Pass((operand.tag));
  4504. ELSE (* open-static *)
  4505. type := expression.type.resolved;
  4506. descriptorType := GetMathArrayDescriptorType(dim);
  4507. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4508. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4509. Symbol(variable,variableOp);
  4510. arrayDestinationTag := variableOp.op;
  4511. Designate(expression,operand);
  4512. FOR i := 0 TO dim-1 DO
  4513. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4514. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4515. ReleaseOperand(tmpOperand);
  4516. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4517. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4518. ReleaseOperand(tmpOperand);
  4519. END;
  4520. dimOp := IntermediateCode.Immediate(addressType,dim);
  4521. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4522. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4523. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4524. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4525. baseType := SemanticChecker.ArrayBase(type,dim);
  4526. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4527. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4528. Pass((arrayDestinationTag));
  4529. END;
  4530. (* case 3d
  4531. P(...,T,...)
  4532. case 3e
  4533. P(...,PT(...),...)
  4534. *)
  4535. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4536. Designate(expression,operand);
  4537. Dereference(operand,type.resolved,FALSE);
  4538. Pass((operand.tag));
  4539. (* case 3f
  4540. P(...,S,...)
  4541. case 3g
  4542. P(...,PS(...),...)
  4543. *)
  4544. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4545. descriptorType := GetMathArrayDescriptorType(dim);
  4546. (* static array does not need to be traced *)
  4547. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4548. Symbol(variable,variableOp);
  4549. arrayDestinationTag := variableOp.op;
  4550. Designate(expression,operand);
  4551. IF operand.op.type.length >1 THEN (* vector register *)
  4552. (* static array does not need to be traced *)
  4553. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4554. Symbol(variable2, variable2Op);
  4555. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4556. Emit(Mov(position,tmp, operand.op));
  4557. ReleaseOperand(operand);
  4558. Symbol(variable2, operand);
  4559. END;
  4560. FOR i := 0 TO dim-1 DO
  4561. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4562. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4563. ReleaseOperand(tmpOperand);
  4564. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4565. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4566. ReleaseOperand(tmpOperand);
  4567. END;
  4568. dimOp := IntermediateCode.Immediate(addressType,dim);
  4569. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4570. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4571. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4572. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4573. baseType := SemanticChecker.ArrayBase(type,dim);
  4574. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4575. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4576. Pass((arrayDestinationTag));
  4577. ELSE HALT(100);
  4578. END;
  4579. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4580. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4581. (* case 4b
  4582. P(...,A[a..b,c..d],...)
  4583. *)
  4584. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4585. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4586. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4587. Symbol(variable,variableOp);
  4588. LoadValue(variableOp,system.addressType);
  4589. ELSE
  4590. descriptorType := GetMathArrayDescriptorType(dim);
  4591. (* range array -- cannot be allocated *)
  4592. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4593. Symbol(variable,variableOp);
  4594. END;
  4595. arrayDestinationTag := variableOp.op;
  4596. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4597. arrayDestinationDimension := 0;
  4598. Designate(expression,operand);
  4599. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4600. Symbol(variable,variableOp);
  4601. ELSE
  4602. (* alias to range -- untraced *)
  4603. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4604. Symbol(variable,variableOp);
  4605. MakeMemory(tmp,variableOp.op,addressType,0);
  4606. Emit(Mov(position,tmp,operand.tag));
  4607. ReleaseIntermediateOperand(tmp);
  4608. END;
  4609. Pass((variableOp.op));
  4610. ReleaseOperand(variableOp);
  4611. (* case 4a
  4612. P(...,A,...)
  4613. *)
  4614. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4615. i := 0;
  4616. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4617. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4618. INC(i);
  4619. END;
  4620. IF i = dim THEN
  4621. Designate(expression,operand);
  4622. arrayDestinationTag := operand.tag;
  4623. ELSE (* open-static *)
  4624. type := expression.type.resolved;
  4625. descriptorType := GetMathArrayDescriptorType(dim);
  4626. (* static array -- untraced *)
  4627. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4628. Symbol(variable,variableOp);
  4629. arrayDestinationTag := variableOp.op;
  4630. Designate(expression,operand);
  4631. FOR i := 0 TO dim-1 DO
  4632. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4633. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4634. ReleaseOperand(tmpOperand);
  4635. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4636. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4637. ReleaseOperand(tmpOperand);
  4638. END;
  4639. dimOp := IntermediateCode.Immediate(addressType,dim);
  4640. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4641. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4642. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4643. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4644. baseType := SemanticChecker.ArrayBase(type,dim);
  4645. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4646. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4647. END;
  4648. (* tensor alias to open array -- untraced *)
  4649. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4650. Symbol(variable,variableOp);
  4651. MakeMemory(tmp,variableOp.op,addressType,0);
  4652. Emit(Mov(position,tmp,arrayDestinationTag));
  4653. ReleaseIntermediateOperand(tmp);
  4654. Pass((variableOp.op));
  4655. ReleaseOperand(variableOp);
  4656. (* case 4d
  4657. P(...,T,...)
  4658. *)
  4659. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4660. Designate(expression,operand);
  4661. Pass((operand.op));
  4662. (* case 4f
  4663. P(...,S,...)
  4664. *)
  4665. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4666. descriptorType := GetMathArrayDescriptorType(dim);
  4667. (* static array -- cannot be reallocated, untraced *)
  4668. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4669. Symbol(variable,variableOp);
  4670. arrayDestinationTag := variableOp.op;
  4671. Designate(expression,operand);
  4672. FOR i := 0 TO dim-1 DO
  4673. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4674. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4675. ReleaseOperand(tmpOperand);
  4676. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4677. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4678. ReleaseOperand(tmpOperand);
  4679. END;
  4680. dimOp := IntermediateCode.Immediate(addressType,dim);
  4681. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4682. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4683. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4684. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4685. baseType := SemanticChecker.ArrayBase(type,dim);
  4686. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4687. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4688. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4689. Symbol(variable,variableOp);
  4690. MakeMemory(tmp,variableOp.op,addressType,0);
  4691. Emit(Mov(position,tmp,arrayDestinationTag));
  4692. ReleaseIntermediateOperand(tmp);
  4693. Pass((variableOp.op));
  4694. ReleaseOperand(variableOp);
  4695. ELSE HALT(100);
  4696. END;
  4697. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4698. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4699. Designate(expression,operand);
  4700. IF operand.op.type.length > 1 THEN
  4701. Emit(Push(position, operand.op));
  4702. ELSE
  4703. size := system.SizeOf(type);
  4704. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4705. size := ToMemoryUnits(system,size);
  4706. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4707. arrayDestinationTag := sp;
  4708. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4709. END;
  4710. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4711. Designate(expression,operand);
  4712. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4713. (* static array no pointer *)
  4714. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4715. Symbol(variable,variableOp);
  4716. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4717. Emit(Mov(position,tmp,operand.op));
  4718. Emit(Push(position,variableOp.op));
  4719. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4720. Pass((operand.op));
  4721. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4722. END;
  4723. ELSE HALT(200)
  4724. END;
  4725. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4726. IF parameter.kind = SyntaxTree.VarParameter THEN
  4727. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4728. Designate(expression, operand);
  4729. Pass((operand.op));
  4730. ELSE
  4731. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4732. Evaluate(expression, operand);
  4733. Pass((operand.extra)); (* step *)
  4734. Pass((operand.tag)); (* last *)
  4735. Pass((operand.op)) (* first *)
  4736. END
  4737. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4738. IF parameter.kind = SyntaxTree.VarParameter THEN
  4739. Designate(expression, operand);
  4740. Pass((operand.op));
  4741. ELSE
  4742. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4743. Evaluate(expression, operand);
  4744. Pass((operand.tag)); (* real part *)
  4745. Pass((operand.op)) (* imaginary part *)
  4746. END
  4747. ELSE
  4748. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4749. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4750. Designate(expression,operand);
  4751. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4752. (* stack allocation *)
  4753. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4754. (*! parameter alignment to be discussed ... *)
  4755. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4756. size := type(SyntaxTree.StringType).length;
  4757. END;
  4758. IF backend.cooperative & parameter.NeedsTrace() THEN
  4759. dst := NewRegisterOperand (addressType);
  4760. Emit(Mov(position,dst, sp));
  4761. IntermediateCode.InitImmediate(null, byteType, 0);
  4762. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4763. ReleaseIntermediateOperand(dst);
  4764. SaveRegisters();ReleaseUsedRegisters(saved);
  4765. (* register dst has been freed before SaveRegisters already *)
  4766. CallAssignMethod(dst, operand.op, parameter.type);
  4767. RestoreRegisters(saved);
  4768. END;
  4769. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4770. ELSIF IsOpenArray(parameter.type) THEN
  4771. Designate(expression,operand);
  4772. baseReg := operand.tag;
  4773. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4774. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4775. END;
  4776. Pass((operand.op)); (* address of the array *)
  4777. ELSIF IsDelegate(parameter.type) THEN
  4778. Evaluate(expression,operand);
  4779. IF backend.cooperative & parameter.NeedsTrace() THEN
  4780. Emit(Push(position, nil));
  4781. dst := NewRegisterOperand (addressType);
  4782. Emit(Mov(position,dst, sp));
  4783. ReleaseIntermediateOperand(dst);
  4784. SaveRegisters();ReleaseUsedRegisters(saved);
  4785. Emit(Push(position, dst));
  4786. (* register dst has been freed before SaveRegisters already *)
  4787. Emit(Push(position, operand.tag));
  4788. CallThis(position,"GarbageCollector","Assign",2);
  4789. RestoreRegisters(saved);
  4790. ELSE
  4791. Pass((operand.tag));
  4792. END;
  4793. Pass((operand.op));
  4794. ELSE
  4795. Evaluate(expression,operand);
  4796. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4797. Emit(Push(position, nil));
  4798. dst := NewRegisterOperand (addressType);
  4799. Emit(Mov(position,dst, sp));
  4800. ReleaseIntermediateOperand(dst);
  4801. SaveRegisters();ReleaseUsedRegisters(saved);
  4802. Emit(Push(position, dst));
  4803. (* register dst has been freed before SaveRegisters already *)
  4804. Emit(Push(position, operand.op));
  4805. CallThis(position,"GarbageCollector","Assign",2);
  4806. RestoreRegisters(saved);
  4807. ELSE
  4808. Pass((operand.op));
  4809. END;
  4810. END;
  4811. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4812. Evaluate(expression,operand);
  4813. Pass((operand.op));
  4814. ELSE (* var parameter *)
  4815. Designate(expression,operand);
  4816. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4817. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4818. Pass((operand.tag));
  4819. END;
  4820. END;
  4821. Pass((operand.op));
  4822. END;
  4823. END;
  4824. (* TODO: needed? *)
  4825. arrayDestinationTag := oldArrayDestinationTag;
  4826. arrayDestinationDimension := oldArrayDestinationDimension;
  4827. IF needsParameterBackup THEN
  4828. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4829. ReuseCopy(parameterBackup, operand.op)
  4830. END;
  4831. ReleaseOperand(operand);
  4832. IF Trace THEN TraceExit("PushParameter") END;
  4833. END PushParameter;
  4834. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4835. VAR prevConditional: BOOLEAN;
  4836. BEGIN
  4837. prevConditional := conditional;
  4838. conditional := FALSE;
  4839. 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
  4840. Expression(x.result); (* use register *)
  4841. END;
  4842. Statement(x.statement);
  4843. conditional := prevConditional;
  4844. IF x.result # NIL THEN Expression(x.result) END;
  4845. 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
  4846. ReleaseIntermediateOperand(result.op);
  4847. END;
  4848. END VisitStatementDesignator;
  4849. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4850. VAR
  4851. procedure: SyntaxTree.Procedure;
  4852. procedureType: SyntaxTree.ProcedureType;
  4853. wasInline: BOOLEAN;
  4854. actualParameters: SyntaxTree.ExpressionList;
  4855. formalParameter: SyntaxTree.Parameter;
  4856. actualParameter: SyntaxTree.Expression;
  4857. i: LONGINT;
  4858. localVariable: SyntaxTree.Variable;
  4859. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4860. src, dest: Operand;
  4861. prevInlineExit : Label;
  4862. prevMapper: SymbolMapper;
  4863. tooComplex: BOOLEAN;
  4864. resultDesignator: SyntaxTree.Expression;
  4865. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4866. BEGIN
  4867. IF e = NIL THEN RETURN TRUE
  4868. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4869. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4870. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4871. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4872. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4873. ELSE RETURN FALSE
  4874. END;
  4875. END SimpleExpression;
  4876. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4877. BEGIN
  4878. RETURN checker.CanPassInRegister(type)
  4879. END FitsInRegister;
  4880. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4881. VAR
  4882. variable: SyntaxTree.Variable;
  4883. variableDesignator: SyntaxTree.Designator;
  4884. BEGIN
  4885. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4886. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4887. variableDesignator.SetType(type);
  4888. RETURN variableDesignator
  4889. END GetTemp;
  4890. BEGIN
  4891. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4892. wasInline := currentIsInline;
  4893. prevInlineExit := currentInlineExit;
  4894. prevMapper := currentMapper;
  4895. currentInlineExit := NewLabel();
  4896. tooComplex := FALSE;
  4897. NEW(currentMapper);
  4898. currentIsInline := TRUE;
  4899. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4900. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4901. formalParameter := procedureType.firstParameter;
  4902. actualParameters := x.parameters;
  4903. i := 0;
  4904. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4905. actualParameter := actualParameters.GetExpression(i);
  4906. IF actualParameter.resolved # NIL THEN
  4907. actualParameter := actualParameter.resolved
  4908. END;
  4909. (*
  4910. if expression is simple and can be passed immediately
  4911. or if type fits in register then we can proceed
  4912. otherwise we escape to ordinary procedure call.
  4913. *)
  4914. (* cases where the expression can be mapped identically *)
  4915. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4916. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4917. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4918. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4919. (*
  4920. Assign(variableDesignator, actualParameter);
  4921. *)
  4922. Evaluate(actualParameter, src);
  4923. Designate(variableDesignator, dest);
  4924. Emit(Mov(x.position, dest.op, src.op));
  4925. ReleaseOperand(dest);
  4926. ReleaseOperand(src);
  4927. (* the src operand should now have been completely released ! *)
  4928. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4929. ELSE tooComplex := TRUE
  4930. END;
  4931. (*
  4932. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4933. currentMapper.Add(formalParameter, actualParameter, NIL);
  4934. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4935. variableDesignator := GetTemp(system.addressType, FALSE);
  4936. Designate(actualParameter, src);
  4937. Designate(variableDesignator, dest);
  4938. IntermediateCode.MakeMemory(dest.op,addressType);
  4939. Emit(Mov(x.position, dest.op, src.op));
  4940. ReleaseOperand(dest);
  4941. IF src.tag.mode # IntermediateCode.Undefined THEN
  4942. tagDesignator := GetTemp(system.addressType, FALSE);
  4943. Designate(tagDesignator, dest);
  4944. IntermediateCode.MakeMemory(dest.op,addressType);
  4945. Emit(Mov(x.position, dest.op, src.op));
  4946. END;
  4947. ReleaseOperand(dest); ReleaseOperand(src);
  4948. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4949. END;
  4950. *)
  4951. formalParameter := formalParameter.nextParameter;
  4952. INC(i);
  4953. END;
  4954. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4955. IF resultDesignator # NIL THEN
  4956. returnDesignator := resultDesignator
  4957. ELSE
  4958. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4959. END;
  4960. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4961. END;
  4962. localVariable := procedure.procedureScope.firstVariable;
  4963. WHILE ~tooComplex & (localVariable # NIL) DO
  4964. variableDesignator := GetTemp(localVariable.type, FALSE);
  4965. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4966. localVariable := localVariable.nextVariable;
  4967. END;
  4968. IF ~tooComplex THEN
  4969. VisitStatementBlock(procedure.procedureScope.body);
  4970. SetLabel(currentInlineExit);
  4971. IF procedureType.returnType # NIL THEN
  4972. Designate(returnDesignator, result);
  4973. IF conditional THEN
  4974. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4975. ValueToCondition(result)
  4976. END;
  4977. END;
  4978. END;
  4979. currentMapper := prevMapper;
  4980. currentInlineExit := prevInlineExit;
  4981. currentIsInline := wasInline;
  4982. RETURN ~tooComplex
  4983. END InlineProcedureCall;
  4984. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4985. VAR
  4986. parameters: SyntaxTree.ExpressionList;
  4987. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4988. designator: SyntaxTree.Designator;
  4989. procedureType: SyntaxTree.ProcedureType;
  4990. formalParameter: SyntaxTree.Parameter;
  4991. operand, returnValue: Operand;
  4992. reg, size, mask, dest: IntermediateCode.Operand;
  4993. saved,saved2: RegisterEntry;
  4994. symbol: SyntaxTree.Symbol;
  4995. variable: SyntaxTree.Variable;
  4996. i, parametersSize, returnTypeSize : LONGINT;
  4997. structuredReturnType: BOOLEAN;
  4998. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4999. tempVariableDesignator: SyntaxTree.Designator;
  5000. gap, alignment: LONGINT; (*fld*)
  5001. (* TODO: remove unnecessary backup variables *)
  5002. oldResult: Operand;
  5003. oldCurrentScope: SyntaxTree.Scope;
  5004. oldArrayDestinationTag: IntermediateCode.Operand;
  5005. oldArrayDestinationDimension: LONGINT;
  5006. oldConstantDeclaration: SyntaxTree.Symbol;
  5007. oldDestination: IntermediateCode.Operand;
  5008. oldCurrentLoop: Label;
  5009. oldConditional: BOOLEAN;
  5010. oldTrueLabel, oldFalseLabel: Label;
  5011. oldLocked: BOOLEAN;
  5012. usedRegisters,oldUsedRegisters: RegisterEntry;
  5013. return: IntermediateCode.Operand;
  5014. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5015. arg: IntermediateCode.Operand;
  5016. dummy: IntermediateCode.Operand;
  5017. recordType: SyntaxTree.RecordType;
  5018. operatorSelectionProcedureOperand: Operand;
  5019. operatorSelectionProcedure: SyntaxTree.Procedure;
  5020. fingerPrint: SyntaxTree.FingerPrint;
  5021. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5022. identifierNumber: LONGINT;
  5023. parameterRegister: Backend.Registers;
  5024. parameterRegisters: LONGINT;
  5025. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5026. procedure: SyntaxTree.Procedure;
  5027. PROCEDURE BackupGlobalState;
  5028. BEGIN
  5029. oldResult := result;
  5030. oldCurrentScope := currentScope;
  5031. oldArrayDestinationTag := arrayDestinationTag;
  5032. oldArrayDestinationDimension := arrayDestinationDimension;
  5033. oldConstantDeclaration := constantDeclaration;
  5034. oldDestination := destination;
  5035. oldCurrentLoop := currentLoop;
  5036. oldConditional := conditional;
  5037. oldTrueLabel := trueLabel;
  5038. oldFalseLabel := falseLabel;
  5039. oldLocked := locked;
  5040. oldUsedRegisters := usedRegisters
  5041. END BackupGlobalState;
  5042. PROCEDURE RestoreGlobalState;
  5043. BEGIN
  5044. result := oldResult;
  5045. currentScope := oldCurrentScope;
  5046. arrayDestinationTag := oldArrayDestinationTag;
  5047. arrayDestinationDimension := oldArrayDestinationDimension;
  5048. constantDeclaration := oldConstantDeclaration;
  5049. destination := oldDestination;
  5050. currentLoop := oldCurrentLoop;
  5051. conditional := oldConditional;
  5052. trueLabel := oldTrueLabel;
  5053. falseLabel := oldFalseLabel;
  5054. locked := oldLocked;
  5055. usedRegisters := oldUsedRegisters
  5056. END RestoreGlobalState;
  5057. (** do preparations before parameter push for array-structured object types (ASOTs):
  5058. if ASOT is passed as VAR parameter:
  5059. - allocate temporary variable of math array type
  5060. - copy contents of ASOT to be passed to temporary variable
  5061. - use temporary variable as the actual parameter instead
  5062. - 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)
  5063. **)
  5064. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5065. VAR
  5066. expression: SyntaxTree.Expression;
  5067. BEGIN
  5068. IF actualParameter IS SyntaxTree.Designator THEN
  5069. designator := actualParameter(SyntaxTree.Designator);
  5070. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5071. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5072. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5073. ASSERT(checker # NIL);
  5074. checker.SetCurrentScope(currentScope);
  5075. (* allocate temporary variable *)
  5076. ASSERT(actualParameter.type # NIL);
  5077. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5078. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5079. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5080. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5081. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5082. ASSERT(tempVariableDesignator.type # NIL);
  5083. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5084. (* copy math array stored in actual parameter to temporary variable *)
  5085. BackupGlobalState;
  5086. AssignMathArray(tempVariableDesignator, actualParameter);
  5087. RestoreGlobalState;
  5088. (* use temporary variable as actual parameter instead of the original one *)
  5089. actualParameter := tempVariableDesignator;
  5090. (* create write-back call and store it in linked list *)
  5091. (* create new list entry *)
  5092. IF firstWriteBackCall = NIL THEN
  5093. NEW(firstWriteBackCall);
  5094. currentWriteBackCall := firstWriteBackCall
  5095. ELSE
  5096. ASSERT(currentWriteBackCall # NIL);
  5097. NEW(currentWriteBackCall.next);
  5098. currentWriteBackCall := currentWriteBackCall.next
  5099. END;
  5100. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5101. ASSERT(expression.type = NIL);
  5102. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5103. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5104. (* prepare writeback for any other "normal" indexer *)
  5105. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5106. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5107. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5108. Assign(tempVariableDesignator, actualParameter);
  5109. actualParameter := tempVariableDesignator;
  5110. IF firstWriteBackCall = NIL THEN
  5111. NEW(firstWriteBackCall);
  5112. currentWriteBackCall := firstWriteBackCall
  5113. ELSE
  5114. ASSERT(currentWriteBackCall # NIL);
  5115. NEW(currentWriteBackCall.next);
  5116. currentWriteBackCall := currentWriteBackCall.next
  5117. END;
  5118. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5119. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5120. END
  5121. END
  5122. END PrepareParameter;
  5123. BEGIN
  5124. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5125. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5126. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5127. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5128. IF InlineProcedureCall(x) THEN
  5129. RETURN
  5130. ELSE
  5131. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5132. END
  5133. END;
  5134. END;
  5135. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5136. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5137. dest := destination; destination := emptyOperand;
  5138. SaveRegisters();ReleaseUsedRegisters(saved);
  5139. parameters := x.parameters;
  5140. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5141. (* an operator is called *)
  5142. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5143. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5144. (* check if a dynamic operator call should be performed *)
  5145. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5146. ELSE
  5147. isCallOfDynamicOperator := FALSE
  5148. END;
  5149. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5150. Emit(Push(position, ap));
  5151. END;
  5152. alignment := procedureType.stackAlignment;
  5153. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5154. alignment := 16 (* bytes *);
  5155. END;
  5156. IF alignment > 1 THEN
  5157. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5158. Emit(Mov(position,reg, sp));
  5159. gap := ParametersSize(system, procedureType, FALSE);
  5160. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5161. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5162. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5163. END;
  5164. END;
  5165. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5166. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5167. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5168. Emit(And(position,sp, sp, mask));
  5169. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5170. Emit(Push(position,reg));
  5171. (*
  5172. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5173. Emit(Mov(position,mem,reg));
  5174. *)
  5175. ReleaseIntermediateOperand(reg);
  5176. END;
  5177. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5178. (* align stack to 16-byte boundary *)
  5179. IntermediateCode.InitImmediate(mask,addressType,-16);
  5180. Emit(And(position,sp, sp, mask));
  5181. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5182. IF gap # 0 THEN
  5183. IntermediateCode.InitImmediate(size,addressType,gap);
  5184. Emit(Sub(position,sp,sp,size))
  5185. END;
  5186. END;
  5187. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5188. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5189. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5190. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5191. ELSE
  5192. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5193. END;
  5194. Evaluate(x.left, operand);
  5195. IF symbol IS SyntaxTree.Procedure THEN
  5196. IF (procedureType.selfParameter # NIL) THEN
  5197. Emit(Push(position,operand.tag));
  5198. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5199. Emit(Push(position,operand.tag));
  5200. ELSIF (procedureType.isDelegate) THEN
  5201. Emit(Push(position,operand.tag));
  5202. END;
  5203. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5204. IF (procedureType.selfParameter # NIL) THEN
  5205. Emit(Push(position,operand.tag));
  5206. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5207. Emit(Push(position,operand.tag));
  5208. END;
  5209. ELSE HALT(200);
  5210. END;
  5211. ReleaseIntermediateOperand(operand.tag);
  5212. operand.tag := emptyOperand;
  5213. (* determine if a structured return type is needed *)
  5214. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5215. IF structuredReturnType THEN
  5216. IF resultDesignator # NIL THEN
  5217. d := resultDesignator;
  5218. ELSE
  5219. (* temporary result that might be allocated, must potentially be traced *)
  5220. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5221. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5222. d.SetType(variable.type);
  5223. END;
  5224. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5225. Designate(d,returnValue);
  5226. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5227. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5228. Emit(Push(position,size));
  5229. Emit(Push(position,returnValue.op));
  5230. ReleaseOperand(returnValue);
  5231. ELSE*)
  5232. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5233. (*
  5234. END;
  5235. *)
  5236. END;
  5237. firstWriteBackCall := NIL; (* reset write-back call list *)
  5238. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5239. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5240. IF parameterRegister = NIL THEN parameterRegisters := 0
  5241. ELSE parameterRegisters := LEN(parameterRegister)
  5242. END;
  5243. passByRegister := parameterRegisters > 0;
  5244. registerNumber := 0;
  5245. formalParameter := procedureType.lastParameter;
  5246. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5247. actualParameter := parameters.GetExpression(i);
  5248. PrepareParameter(actualParameter, formalParameter);
  5249. IF passByRegister & (i < parameterRegisters) THEN
  5250. IF ~PassInRegister(formalParameter) THEN
  5251. Error(actualParameter.position,"cannot be passed by register")
  5252. ELSE
  5253. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5254. END;
  5255. INC(registerNumber);
  5256. ELSE
  5257. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5258. END;
  5259. formalParameter := formalParameter.prevParameter;
  5260. END;
  5261. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5262. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5263. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5264. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5265. END;
  5266. ELSE
  5267. hasDynamicOperands := FALSE;
  5268. formalParameter := procedureType.firstParameter;
  5269. FOR i := 0 TO parameters.Length() - 1 DO
  5270. actualParameter := parameters.GetExpression(i);
  5271. IF formalParameter # NIL THEN (* TENTATIVE *)
  5272. PrepareParameter(actualParameter, formalParameter);
  5273. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5274. ASSERT(i < 2);
  5275. hasDynamicOperands := TRUE;
  5276. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5277. ELSE
  5278. IF passByRegister & (registerNumber > 0) THEN
  5279. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5280. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5281. END;
  5282. passByRegister := FALSE;
  5283. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5284. END;
  5285. formalParameter := formalParameter.nextParameter;
  5286. END;
  5287. END;
  5288. END;
  5289. IF symbol IS SyntaxTree.Procedure THEN
  5290. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5291. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5292. Emit(Push(position,reg));
  5293. ReleaseIntermediateOperand(reg);
  5294. END;
  5295. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5296. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5297. parametersSize := ParametersSize(system,procedureType,FALSE);
  5298. END;
  5299. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5300. (*
  5301. dynamic operator overloading:
  5302. first push parameters, regularly:
  5303. [self]
  5304. par1
  5305. par2
  5306. then push parameters for GetOperator
  5307. identifier
  5308. ptr1
  5309. tag
  5310. ptr2
  5311. tag
  5312. call GetOperatorRuntimeProc
  5313. call Operator
  5314. *)
  5315. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5316. (* push ID *)
  5317. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5318. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5319. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5320. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5321. formalParameter := procedureType.firstParameter;
  5322. FOR i := 0 TO parameters.Length() - 1 DO
  5323. IF formalParameter.access # SyntaxTree.Hidden THEN
  5324. ASSERT(i < 2);
  5325. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5326. (* push pointer *)
  5327. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5328. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5329. (* add dereference *)
  5330. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5331. (*! better: do refer to stack above than using parameter backups !!*)
  5332. ReleaseIntermediateOperand(parameterBackups[i]);
  5333. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5334. END;
  5335. Emit(Push(position,parameterBackups[i]));
  5336. ReleaseIntermediateOperand(parameterBackups[i]);
  5337. (* push typetag *)
  5338. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5339. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5340. arg := TypeDescriptorAdr(recordType);
  5341. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5342. Emit(Push(position,arg));
  5343. ELSE
  5344. (* push 'NonPointer' *)
  5345. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5346. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5347. (* push fingerprint *)
  5348. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5349. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5350. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5351. END
  5352. END;
  5353. formalParameter := formalParameter.nextParameter
  5354. END;
  5355. (* for unary operators: complete the information for the second parameter *)
  5356. IF procedureType.numberParameters < 2 THEN
  5357. (* push 'NonPointer' *)
  5358. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5359. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5360. (* push 'NoType' *)
  5361. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5362. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5363. END;
  5364. (* call operator selection procedure *)
  5365. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5366. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5367. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5368. ReleaseOperand(operatorSelectionProcedureOperand);
  5369. (* use the address that the operator selection procedure returned as the target address of the call *)
  5370. InitOperand(operand, ModeValue);
  5371. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5372. Emit(Result(position,operand.op))
  5373. END
  5374. END;
  5375. ReleaseParameterRegisters();
  5376. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5377. SaveRegisters();ReleaseUsedRegisters(saved2);
  5378. CallThis(position,"Objects","LeaveA2",0);
  5379. RestoreRegisters(saved2);
  5380. END;
  5381. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5382. Emit(Call(position,operand.op,0));
  5383. ELSE
  5384. Emit(Call(position,operand.op,parametersSize));
  5385. END;
  5386. ReleaseOperand(operand);
  5387. IF procedureType.noReturn THEN
  5388. EmitTrap(position,NoReturnTrap);
  5389. END;
  5390. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5391. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5392. Emit(Result(position,return));
  5393. END;
  5394. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5395. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5396. Emit(Push(position, return));
  5397. CallThis(position,"Objects","ReenterA2",0);
  5398. Emit(Pop(position, return));
  5399. ELSE
  5400. CallThis(position,"Objects","ReenterA2",0);
  5401. END;
  5402. END;
  5403. (* === return parameter space === *)
  5404. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5405. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5406. (* cleanup all space for all parameters *)
  5407. IF parametersSize < 32 THEN
  5408. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5409. parametersSize := 32
  5410. END;
  5411. size := IntermediateCode.Immediate(addressType,parametersSize);
  5412. Emit(Add(position,sp,sp,size))
  5413. END;
  5414. IF SysvABI(procedureType.callingConvention) THEN
  5415. IF passByRegister THEN
  5416. IF parameters.Length() > parameterRegisters THEN
  5417. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5418. ELSE
  5419. parametersSize := 0
  5420. END;
  5421. ELSE
  5422. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5423. INC( parametersSize, (-parametersSize) MOD 16 )
  5424. END;
  5425. IF parametersSize > 0 THEN
  5426. size := IntermediateCode.Immediate(addressType,parametersSize);
  5427. Emit(Add(position,sp,sp,size))
  5428. END;
  5429. END;
  5430. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5431. IF structuredReturnType THEN
  5432. (* stack pointer rewinding done by callee
  5433. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5434. Emit(Add(position,sp,sp,size));
  5435. *)
  5436. RestoreRegisters(saved);
  5437. InitOperand(result,ModeReference);
  5438. Symbol(variable,result);
  5439. ELSE
  5440. RestoreRegisters(saved);
  5441. InitOperand(result,ModeValue);
  5442. result.op := return;
  5443. END;
  5444. END;
  5445. IF alignment > 1 THEN
  5446. Emit(Pop(position,sp));
  5447. END;
  5448. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5449. Emit(Pop(position, ap));
  5450. END;
  5451. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5452. ValueToCondition(result);
  5453. END;
  5454. destination := dest;
  5455. (* perform all write-back calls in the list *)
  5456. BackupGlobalState;
  5457. currentWriteBackCall := firstWriteBackCall;
  5458. WHILE currentWriteBackCall # NIL DO
  5459. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5460. currentWriteBackCall := currentWriteBackCall.next
  5461. END;
  5462. RestoreGlobalState;
  5463. (* TENATIVE *)
  5464. (*
  5465. IF isOperatorCall THEN
  5466. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5467. END;
  5468. *)
  5469. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5470. END VisitProcedureCallDesignator;
  5471. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5472. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5473. td: SyntaxTree.Symbol;
  5474. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5475. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5476. BEGIN
  5477. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5478. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5479. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5480. variable.SetType(system.anyType);
  5481. scope.AddVariable(variable);
  5482. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5483. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5484. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5485. typeDeclaration.SetScope(module.module.moduleScope);
  5486. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5487. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5488. END;
  5489. RETURN hiddenPointerType;
  5490. END GetHiddenPointerType;
  5491. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5492. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5493. BEGIN
  5494. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5495. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5496. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5497. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5498. scope.AddVariable(variable);
  5499. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5500. variable.SetType(system.anyType);
  5501. scope.AddVariable(variable);
  5502. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5503. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5504. typeDeclaration.SetDeclaredType(delegatePointerType);
  5505. typeDeclaration.SetScope(module.module.moduleScope);
  5506. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5507. delegatePointerType.SetState(SyntaxTree.Resolved);
  5508. END;
  5509. RETURN delegatePointerType
  5510. END GetDelegateType;
  5511. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5512. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5513. such as in VAR a: RECORD ... END;
  5514. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5515. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5516. *)
  5517. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5518. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5519. BEGIN (* no code emission *)
  5520. source := NIL;
  5521. x := x.resolved;
  5522. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5523. x := GetHiddenPointerType();
  5524. ELSIF IsDelegate(x) THEN
  5525. x := GetDelegateType();
  5526. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5527. ELSE HALT(200);
  5528. END;
  5529. td := x.typeDeclaration;
  5530. IF td = NIL THEN
  5531. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5532. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5533. ASSERT(td # NIL);
  5534. END;
  5535. IF newObjectFile THEN
  5536. GetCodeSectionNameForSymbol(td,name);
  5537. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5538. meta.CheckTypeDeclaration(x);
  5539. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5540. ELSE
  5541. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5542. END;
  5543. IF backend.cooperative OR meta.simple THEN
  5544. offset := 0;
  5545. ELSE
  5546. IF x IS SyntaxTree.CellType THEN
  5547. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5548. IF baseRecord = NIL THEN
  5549. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5550. ELSE
  5551. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5552. END;
  5553. ELSE
  5554. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5555. END;
  5556. END;
  5557. ELSE
  5558. offset := 0;
  5559. source := module.allSections.FindBySymbol(td); (*TODO*)
  5560. IF source = NIL THEN
  5561. null := 0;
  5562. GetCodeSectionNameForSymbol(td,name);
  5563. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5564. Basic.SuffixSegmentedName (name, module.module.name);
  5565. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5566. IntermediateCode.InitImmediate(op,addressType,0);
  5567. source(IntermediateCode.Section).Emit(Data(position,op));
  5568. source.SetReferenced(FALSE)
  5569. ELSE
  5570. name := source.name;
  5571. END;
  5572. END;
  5573. RETURN td
  5574. END GetBackendType;
  5575. BEGIN
  5576. (*td := t.typeDeclaration;*)
  5577. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5578. (*
  5579. IF t IS SyntaxTree.PointerType THEN
  5580. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5581. ELSE
  5582. source := GetBackendType(t);
  5583. END;
  5584. *)
  5585. IF newObjectFile THEN
  5586. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5587. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5588. IntermediateCode.SetOffset(res,offset);
  5589. ELSE
  5590. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5591. END;
  5592. (*
  5593. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5594. make memory should be used when tag is used, not earlier
  5595. *)
  5596. RETURN res
  5597. END TypeDescriptorAdr;
  5598. (*
  5599. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5600. VAR result: IntermediateCode.Operand;
  5601. BEGIN
  5602. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5603. operand.tag := TypeDescriptorAdr(operand.type);
  5604. IntermediateCode.MakeMemory(operand.tag,addressType);
  5605. UseIntermediateOperand(operand.tag);
  5606. END;
  5607. END MakeTypeTag;
  5608. *)
  5609. PROCEDURE ProfilerInit;
  5610. VAR reg: IntermediateCode.Operand;
  5611. BEGIN
  5612. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5613. Emit(Call(position,reg,0));
  5614. END ProfilerInit;
  5615. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5616. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5617. BEGIN
  5618. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5619. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5620. THEN
  5621. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5622. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5623. Emit(Push(position,reg));
  5624. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5625. Emit(Push(position,reg));
  5626. StaticCallOperand(result,procedure);
  5627. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5628. ReleaseOperand(result);
  5629. END;
  5630. END ProfilerEnterExit;
  5631. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5632. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5633. BEGIN
  5634. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5635. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5636. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5637. profileInit.Emit(Push(position,reg));
  5638. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5639. profileInit.Emit(Push(position,reg));
  5640. NEW(string, LEN(name)); COPY(name, string^);
  5641. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5642. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5643. sv.SetType(type);
  5644. Designate(sv,result);
  5645. profileInit.Emit(Push(position,result.tag));
  5646. profileInit.Emit(Push(position,result.op));
  5647. StaticCallOperand(result,procedure);
  5648. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5649. ReleaseOperand(result);
  5650. END;
  5651. END ProfilerAddProcedure;
  5652. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5653. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5654. BEGIN
  5655. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5656. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5657. profileInit.Emit(Push(position,reg));
  5658. profileInitPatchPosition := profileInit.pc;
  5659. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5660. NEW(string, LEN(name)); COPY(name, string^);
  5661. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5662. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5663. sv.SetType(type);
  5664. Designate(sv,result);
  5665. profileInit.Emit(Push(position,result.tag));
  5666. profileInit.Emit(Push(position,result.op));
  5667. StaticCallOperand(result,procedure);
  5668. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5669. ReleaseOperand(result);
  5670. END;
  5671. END ProfilerAddModule;
  5672. PROCEDURE ProfilerPatchInit;
  5673. VAR reg: IntermediateCode.Operand;
  5674. BEGIN
  5675. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5676. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5677. EmitLeave(profileInit,position,NIL,0);
  5678. profileInit.Emit(Exit(position,0,0,0));
  5679. END ProfilerPatchInit;
  5680. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5681. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5682. VAR
  5683. id: LONGINT;
  5684. leftType, rightType: SyntaxTree.Type;
  5685. procedureType: SyntaxTree.ProcedureType;
  5686. runtimeProcedure: SyntaxTree.Procedure;
  5687. runtimeProcedureOperand, operatorOperand: Operand;
  5688. kind: SET;
  5689. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5690. VAR
  5691. arg: IntermediateCode.Operand;
  5692. recordType: SyntaxTree.RecordType;
  5693. fingerPrint: SyntaxTree.FingerPrint;
  5694. BEGIN
  5695. IF type = NIL THEN
  5696. (* no type: push 'NoType' *)
  5697. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5698. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5699. ELSIF IsStrictlyPointerToRecord(type) THEN
  5700. (* pointer to record type: push typetag *)
  5701. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5702. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5703. arg := TypeDescriptorAdr(recordType);
  5704. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5705. ELSE
  5706. (* non-pointer to record type: push fingerprint *)
  5707. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5708. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5709. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5710. END;
  5711. operatorInitializationCodeSection.Emit(Push(position,arg))
  5712. END PushTypeInfo;
  5713. BEGIN
  5714. ASSERT(operatorInitializationCodeSection # NIL);
  5715. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5716. procedureType := operator.type(SyntaxTree.ProcedureType);
  5717. (* determine types *)
  5718. leftType := procedureType.firstParameter.type;
  5719. IF procedureType.numberParameters = 2 THEN
  5720. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5721. rightType := procedureType.firstParameter.nextParameter.type;
  5722. ELSE
  5723. rightType := NIL
  5724. END;
  5725. (* determine operator kind *)
  5726. IF IsStrictlyPointerToRecord(leftType) THEN
  5727. kind := {LhsIsPointer}
  5728. ELSE
  5729. kind := {}
  5730. END;
  5731. IF IsStrictlyPointerToRecord(rightType) THEN
  5732. kind := kind + {RhsIsPointer}
  5733. END;
  5734. IF kind # {} THEN (* TODO: to be removed later on *)
  5735. (* at least one of the types is a pointer to record *)
  5736. (* emit a code that registers this specific operator in the runtime *)
  5737. dump := operatorInitializationCodeSection.comments;
  5738. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5739. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5740. (* push ID *)
  5741. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5742. id := Global.GetSymbol(module.module.case, operator.name);
  5743. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5744. (* push kind *)
  5745. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5746. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5747. (* push type infos *)
  5748. PushTypeInfo(leftType);
  5749. PushTypeInfo(rightType);
  5750. (* push operator address *)
  5751. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5752. StaticCallOperand(operatorOperand, operator);
  5753. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5754. ReleaseOperand(operatorOperand);
  5755. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5756. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5757. ReleaseOperand(runtimeProcedureOperand)
  5758. END
  5759. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5760. END
  5761. END RegisterDynamicOperator;
  5762. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5763. VAR
  5764. traceModule: SyntaxTree.Module;
  5765. procedure: SyntaxTree.Procedure;
  5766. procedureVariable: SyntaxTree.Variable;
  5767. s,msg: Basic.MessageString;
  5768. res: Operand;
  5769. i: LONGINT;
  5770. sv: SyntaxTree.StringValue;
  5771. type: SyntaxTree.Type;
  5772. recordType: SyntaxTree.RecordType;
  5773. printout: Printout.Printer;
  5774. stringWriter: Streams.StringWriter;
  5775. expression: SyntaxTree.Expression;
  5776. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5777. BEGIN
  5778. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5779. IF procedure = NIL THEN
  5780. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5781. END;
  5782. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5783. s := "procedure ";
  5784. Strings.Append(s,backend.traceModuleName);
  5785. Strings.Append(s,".");
  5786. Strings.Append(s,procedureName);
  5787. Strings.Append(s," not present");
  5788. Error(position,s);
  5789. RETURN FALSE
  5790. ELSE
  5791. RETURN TRUE
  5792. END;
  5793. END GetProcedure;
  5794. PROCEDURE CallProcedure;
  5795. VAR size: LONGINT;
  5796. BEGIN
  5797. IF procedure # NIL THEN
  5798. StaticCallOperand(result,procedure);
  5799. size := ProcedureParametersSize(system,procedure);
  5800. ELSE
  5801. Symbol(procedureVariable, result);
  5802. LoadValue(result, procedureVariable.type.resolved);
  5803. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5804. END;
  5805. Emit(Call(position,result.op,size));
  5806. END CallProcedure;
  5807. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5808. VAR res: Operand; string: SyntaxTree.String;
  5809. BEGIN
  5810. IF GetProcedure("String") THEN
  5811. NEW(string, LEN(s)); COPY(s, string^);
  5812. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5813. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5814. sv.SetType(type);
  5815. Designate(sv,res);
  5816. Emit(Push(position,res.tag));
  5817. Emit(Push(position,res.op));
  5818. ReleaseOperand(res);
  5819. CallProcedure;
  5820. END;
  5821. END String;
  5822. PROCEDURE Integer(op: IntermediateCode.Operand);
  5823. BEGIN
  5824. IF GetProcedure("Int") THEN
  5825. Emit(Push(position,op));
  5826. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5827. CallProcedure;
  5828. END;
  5829. END Integer;
  5830. PROCEDURE Float(op: IntermediateCode.Operand);
  5831. BEGIN
  5832. IF GetProcedure("HIntHex") THEN
  5833. Emit(Push(position,op));
  5834. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5835. CallProcedure;
  5836. END;
  5837. END Float;
  5838. PROCEDURE Set(op: IntermediateCode.Operand);
  5839. BEGIN
  5840. IF GetProcedure("Set") THEN
  5841. Emit(Push(position,op));
  5842. (*
  5843. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5844. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5845. *)
  5846. CallProcedure;
  5847. END;
  5848. END Set;
  5849. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5850. BEGIN
  5851. IF GetProcedure("Boolean") THEN
  5852. Emit(Push(position,op));
  5853. CallProcedure;
  5854. END;
  5855. END Boolean;
  5856. PROCEDURE Char(op: IntermediateCode.Operand);
  5857. BEGIN
  5858. IF GetProcedure("Char") THEN
  5859. Emit(Push(position,op));
  5860. CallProcedure;
  5861. END;
  5862. END Char;
  5863. PROCEDURE Address(op: IntermediateCode.Operand);
  5864. BEGIN
  5865. IF GetProcedure("Address") THEN
  5866. Emit(Push(position,op));
  5867. CallProcedure;
  5868. END;
  5869. END Address;
  5870. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5871. VAR len: IntermediateCode.Operand;
  5872. BEGIN
  5873. IF GetProcedure("String") THEN
  5874. len := GetArrayLength(type, op.tag);
  5875. Emit(Push(position,len));
  5876. ReleaseIntermediateOperand(len);
  5877. Emit(Push(position,op.op));
  5878. CallProcedure;
  5879. END;
  5880. END StringOperand;
  5881. PROCEDURE Ln;
  5882. BEGIN
  5883. IF GetProcedure("Ln") THEN
  5884. CallProcedure;
  5885. END;
  5886. END Ln;
  5887. BEGIN
  5888. IF backend.traceModuleName = "" THEN RETURN END;
  5889. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5890. IF GetProcedure("Enter") THEN
  5891. CallProcedure
  5892. END;
  5893. NEW(stringWriter,LEN(s));
  5894. FOR i := 0 TO x.Length()-1 DO
  5895. msg := "";
  5896. expression := x.GetExpression(i);
  5897. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5898. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5899. ELSE
  5900. Global.GetModuleName(module.module, s);
  5901. END;
  5902. IF i = 0 THEN
  5903. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5904. stringWriter.String(":");
  5905. END;
  5906. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5907. IF ~(expression IS SyntaxTree.StringValue) THEN
  5908. printout.Expression(expression);
  5909. stringWriter.Get(s);
  5910. Strings.Append(msg,s);
  5911. Strings.Append(msg,"= ");
  5912. ELSE stringWriter.Get(s); (* remove from string writer *)
  5913. Strings.Append(msg, s);
  5914. END;
  5915. String(msg);
  5916. IF SemanticChecker.IsStringType(expression.type) THEN
  5917. Designate(expression,res);
  5918. StringOperand(res, expression.type);
  5919. ELSE
  5920. Evaluate(expression,res);
  5921. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5922. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5923. Convert(res.op,int64);
  5924. END;
  5925. Integer(res.op);
  5926. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5927. Boolean(res.op);
  5928. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5929. Set(res.op);
  5930. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5931. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5932. Convert(res.op,float64);
  5933. END;
  5934. Float(res.op);
  5935. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5936. Char(res.op);
  5937. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5938. Address(res.op);String("H");
  5939. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5940. Address(res.op);String("H");
  5941. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5942. Address(res.op);String("H");
  5943. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5944. Address(res.op);String("H");
  5945. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5946. String("NIL");
  5947. ELSE HALT(200);
  5948. END;
  5949. END;
  5950. ReleaseOperand(res);
  5951. String("; ");
  5952. END;
  5953. IF GetProcedure("Exit") THEN
  5954. CallProcedure
  5955. ELSE
  5956. Ln;
  5957. END;
  5958. END;
  5959. END SystemTrace;
  5960. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5961. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5962. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5963. BEGIN
  5964. type := type.resolved;
  5965. IF type IS SyntaxTree.RecordType THEN
  5966. WITH type: SyntaxTree.RecordType DO
  5967. baseType := type.baseType;
  5968. IF baseType # NIL THEN
  5969. baseType := baseType.resolved;
  5970. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5971. InitFields(baseType,adr,offset);
  5972. END;
  5973. variable := type.recordScope.firstVariable;
  5974. WHILE variable # NIL DO
  5975. IF variable.initializer # NIL THEN
  5976. Evaluate(variable.initializer,initializerOp);
  5977. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5978. Emit(Mov(position,mem,initializerOp.op));
  5979. ReleaseOperand(initializerOp);
  5980. ReleaseIntermediateOperand(mem);
  5981. END;
  5982. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5983. variable := variable.nextVariable
  5984. END;
  5985. END;
  5986. ELSIF type IS SyntaxTree.CellType THEN
  5987. WITH type: SyntaxTree.CellType DO
  5988. baseType := type.baseType;
  5989. IF baseType # NIL THEN
  5990. baseType := baseType.resolved;
  5991. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5992. InitFields(baseType,adr,offset);
  5993. END;
  5994. variable := type.cellScope.firstVariable;
  5995. WHILE variable # NIL DO
  5996. IF variable.initializer # NIL THEN
  5997. Evaluate(variable.initializer,initializerOp);
  5998. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5999. Emit(Mov(position,mem,initializerOp.op));
  6000. ReleaseOperand(initializerOp);
  6001. ReleaseIntermediateOperand(mem);
  6002. END;
  6003. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6004. variable := variable.nextVariable
  6005. END;
  6006. END;
  6007. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6008. WITH type: SyntaxTree.ArrayType DO
  6009. IF type.form = SyntaxTree.Static THEN
  6010. baseType := type.arrayBase;
  6011. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6012. FOR i := 0 TO type.staticLength-1 DO
  6013. InitFields(baseType,adr,offset+i*size);
  6014. END;
  6015. END;
  6016. END;
  6017. ELSIF type IS SyntaxTree.MathArrayType THEN
  6018. WITH type: SyntaxTree.MathArrayType DO
  6019. IF type.form = SyntaxTree.Open THEN
  6020. dim := DynamicDim(type);
  6021. imm := IntermediateCode.Immediate(addressType,dim);
  6022. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6023. baseType := SemanticChecker.ArrayBase(type,dim);
  6024. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6025. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6026. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6027. ReleaseIntermediateOperand(imm);
  6028. (* flags remain empty (=0) for open array *)
  6029. ELSIF type.form = SyntaxTree.Static THEN
  6030. baseType := type.arrayBase;
  6031. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6032. ASSERT(type.staticLength < 1024*1024*1024);
  6033. FOR i := 0 TO type.staticLength-1 DO
  6034. InitFields(baseType,adr,offset+i*size);
  6035. END;
  6036. END;
  6037. END;
  6038. END;
  6039. END InitFields;
  6040. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6041. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6042. BEGIN
  6043. type := variable.type.resolved;
  6044. IF (type IS SyntaxTree.MathArrayType) THEN
  6045. WITH type: SyntaxTree.MathArrayType DO
  6046. IF type.form = SyntaxTree.Open THEN
  6047. Symbol(variable,operand);
  6048. InitFields(type, operand.tag,0);
  6049. IF temporary THEN
  6050. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6051. END;
  6052. ELSIF type.form = SyntaxTree.Tensor THEN
  6053. Symbol(variable, operand);
  6054. MakeMemory(tmp,operand.op,addressType,0);
  6055. ReleaseOperand(operand);
  6056. IF temporary THEN
  6057. (* trick -- temporary object from array base *)
  6058. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6059. Symbol(symbol,operand);
  6060. MakeMemory(mem,operand.op,addressType,0);
  6061. ReleaseOperand(operand);
  6062. Emit(Mov(position,tmp, mem) );
  6063. ReleaseOperand(operand);
  6064. ELSE
  6065. Emit(Mov(position,tmp, nil ) );
  6066. END;
  6067. ReleaseIntermediateOperand(tmp);
  6068. END;
  6069. END;
  6070. ELSE
  6071. Symbol(variable,operand);
  6072. IF variable.initializer # NIL THEN
  6073. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6074. reference.SetType(variable.type.resolved);
  6075. reference.SetAssignable(TRUE);
  6076. Assign(reference,variable.initializer);
  6077. ELSIF temporary THEN
  6078. IF SemanticChecker.IsPointerType(variable.type) THEN
  6079. Symbol(variable, operand);
  6080. MakeMemory(tmp,operand.op,addressType,0);
  6081. ReleaseOperand(operand);
  6082. Emit(Mov(position,tmp, nil ) );
  6083. ReleaseIntermediateOperand(tmp);
  6084. END;
  6085. END;
  6086. InitFields(type, operand.op,0);
  6087. ReleaseOperand(operand);
  6088. END;
  6089. END InitVariable;
  6090. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6091. VAR end: Label;
  6092. BEGIN
  6093. IF type.form = SyntaxTree.Tensor THEN
  6094. InitOperand(result,ModeValue);
  6095. ReuseCopy(result.op,base);
  6096. end := NewLabel();
  6097. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6098. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6099. SetLabel(end);
  6100. Convert(result.op,lenType);
  6101. ELSE
  6102. InitOperand(result,ModeValue);
  6103. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6104. END
  6105. END MathArrayDim;
  6106. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6107. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6108. BEGIN
  6109. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6110. MakeMemory(mem,base,addressType,offset);
  6111. Emit(Mov(position,mem,value));
  6112. ReleaseIntermediateOperand(mem);
  6113. END PutMathArrayField;
  6114. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6115. VAR mem: IntermediateCode.Operand;
  6116. BEGIN
  6117. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6118. MakeMemory(mem,base,addressType,offset);
  6119. Emit(Mov(position,mem,value));
  6120. ReleaseIntermediateOperand(mem);
  6121. END PutMathArrayFieldOffset;
  6122. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6123. BEGIN
  6124. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6125. MakeMemory(value,base,addressType,offset);
  6126. END GetMathArrayField;
  6127. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6128. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6129. BEGIN
  6130. IF incr THEN
  6131. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6132. ELSE
  6133. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6134. END;
  6135. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6136. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6137. ELSE
  6138. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6139. Emit(Mov(position,reg,dim));
  6140. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6141. Emit(Add(position,reg,reg,base));
  6142. MakeMemory(mem, reg, addressType, offset);
  6143. ReleaseIntermediateOperand(reg);
  6144. Emit(Mov(position,mem,value));
  6145. ReleaseIntermediateOperand(mem);
  6146. END;
  6147. END PutMathArrayLenOrIncr;
  6148. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6149. BEGIN
  6150. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6151. END PutMathArrayLength;
  6152. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6153. BEGIN
  6154. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6155. END PutMathArrayIncrement;
  6156. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6157. BEGIN
  6158. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6159. END GetMathArrayIncrement;
  6160. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6161. BEGIN
  6162. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6163. END GetMathArrayLength;
  6164. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6165. VAR dimOp: IntermediateCode.Operand;
  6166. BEGIN
  6167. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6168. GetMathArrayLength(type, operand, dimOp, check, result);
  6169. END GetMathArrayLengthAt;
  6170. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6171. VAR dimOp: IntermediateCode.Operand;
  6172. BEGIN
  6173. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6174. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6175. END GetMathArrayIncrementAt;
  6176. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6177. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6178. offset: LONGINT;
  6179. BEGIN
  6180. IF increment THEN
  6181. offset := MathIncrOffset;
  6182. ELSE
  6183. offset := MathLenOffset;
  6184. END;
  6185. INC(offset,operand.dimOffset*2);
  6186. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6187. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6188. END;
  6189. (* static dimension *)
  6190. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6191. IF check & (type.form = SyntaxTree.Tensor) THEN
  6192. DimensionCheck(operand.tag,dim,BrltL);
  6193. END;
  6194. val := SHORT(dim.intValue);
  6195. IF type.form # SyntaxTree.Tensor THEN
  6196. t := SemanticChecker.ArrayBase(type,val);
  6197. type := t.resolved(SyntaxTree.MathArrayType);
  6198. IF type.form = SyntaxTree.Static THEN
  6199. IF increment THEN
  6200. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6201. ELSE
  6202. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6203. END;
  6204. InitOperand(result,ModeValue);
  6205. result.op := res;
  6206. RETURN;
  6207. END;
  6208. END;
  6209. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6210. MakeMemory(res,operand.tag,addressType,offset);
  6211. (*
  6212. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6213. *)
  6214. InitOperand(result,ModeValue);
  6215. result.op := res;
  6216. ELSE
  6217. Convert(dim,addressType);
  6218. IF check THEN
  6219. IF type.form = SyntaxTree.Tensor THEN
  6220. DimensionCheck(operand.tag,dim,BrltL);
  6221. ELSIF isUnchecked THEN (* do nothing *)
  6222. ELSE
  6223. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6224. END;
  6225. END;
  6226. end := NewLabel(); next := NIL;
  6227. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6228. Emit(Mov(position,res,dim));
  6229. Convert(res,sizeType);
  6230. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6231. WHILE t IS SyntaxTree.MathArrayType DO
  6232. type := t(SyntaxTree.MathArrayType);
  6233. IF type.form = SyntaxTree.Static THEN
  6234. imm := IntermediateCode.Immediate(sizeType,val);
  6235. next := NewLabel();
  6236. BrneL(next,imm,res);
  6237. IF increment THEN
  6238. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6239. ELSE
  6240. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6241. END;
  6242. Emit(MovReplace(position,res,imm));
  6243. BrL(end);
  6244. ELSE hasDynamicPart := TRUE;
  6245. END;
  6246. t := type.arrayBase.resolved;
  6247. val := val + 1;
  6248. IF next # NIL THEN SetLabel(next) END;
  6249. END;
  6250. IF hasDynamicPart THEN
  6251. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6252. Emit(Mov(position,res2,dim));
  6253. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6254. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6255. Emit(Add(position,res2,res2,imm));
  6256. Emit(Add(position,res2,res2,operand.tag));
  6257. IntermediateCode.MakeMemory(res2,sizeType);
  6258. Emit(MovReplace(position,res,res2));
  6259. ReleaseIntermediateOperand(res2);
  6260. END;
  6261. SetLabel(end);
  6262. Convert(res,sizeType);
  6263. InitOperand(result,ModeValue);
  6264. result.op := res;
  6265. END;
  6266. END MathArrayLenOrIncr;
  6267. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6268. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6269. offset: LONGINT;
  6270. BEGIN
  6271. offset := operand.dimOffset+DynamicDim(type)-1;
  6272. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6273. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6274. val := SHORT(dim.intValue);
  6275. t := SemanticChecker.ArrayBase(type,val);
  6276. type := t.resolved(SyntaxTree.ArrayType);
  6277. IF type.form = SyntaxTree.Static THEN
  6278. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6279. ELSE
  6280. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6281. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6282. END;
  6283. UseIntermediateOperand(res);
  6284. InitOperand(result,ModeValue);
  6285. result.op := res;
  6286. ELSE
  6287. Convert(dim,addressType);
  6288. IF ~isUnchecked THEN
  6289. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6290. END;
  6291. end := NewLabel(); next := NIL;
  6292. (* ReuseCopy(dim,res); *)
  6293. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6294. Emit(Mov(position,res,dim));
  6295. Convert(res,sizeType);
  6296. Convert(res,sizeType);
  6297. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6298. WHILE t IS SyntaxTree.ArrayType DO
  6299. type := t(SyntaxTree.ArrayType);
  6300. IF type.form = SyntaxTree.Static THEN
  6301. imm := IntermediateCode.Immediate(sizeType,val);
  6302. next := NewLabel();
  6303. BrneL(next,imm,res);
  6304. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6305. Emit(MovReplace(position,res,imm));
  6306. BrL(end);
  6307. ELSE hasDynamicPart := TRUE;
  6308. END;
  6309. t := type.arrayBase.resolved;
  6310. val := val + 1;
  6311. IF next # NIL THEN SetLabel(next) END;
  6312. END;
  6313. IF hasDynamicPart THEN
  6314. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6315. Convert(res2,addressType);
  6316. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6317. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6318. Emit(Sub(position,res2,imm,res2));
  6319. Emit(Add(position,res2,res2,operand.tag));
  6320. IntermediateCode.MakeMemory(res2,sizeType);
  6321. Emit(MovReplace(position,res,res2));
  6322. ReleaseIntermediateOperand(res2);
  6323. END;
  6324. SetLabel(end);
  6325. Convert(res,sizeType);
  6326. InitOperand(result,ModeValue);
  6327. result.op := res;
  6328. END;
  6329. END ArrayLen;
  6330. (**
  6331. create a temporary variable in current scope
  6332. **)
  6333. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6334. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6335. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6336. BEGIN
  6337. IF ~register THEN
  6338. v := temporaries.GetFreeVariable(type, untraced, index);
  6339. ELSE
  6340. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6341. END;
  6342. scope := currentScope;
  6343. (*
  6344. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6345. *)
  6346. name := temporaries.GetUID();
  6347. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6348. variable.SetType(type);
  6349. variable.SetAccess(SyntaxTree.Hidden);
  6350. variable.SetUntraced(untraced);
  6351. IF v = NIL THEN
  6352. temporaries.AddVariable(variable);
  6353. IF ~register THEN
  6354. IF scope.lastVariable # NIL THEN
  6355. offset := scope.lastVariable.offsetInBits;
  6356. ELSE
  6357. offset := 0;
  6358. END;
  6359. DEC(offset,system.SizeOf(variable.type));
  6360. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6361. variable(SyntaxTree.Variable).SetOffset(offset);
  6362. scope.AddVariable(variable(SyntaxTree.Variable));
  6363. scope.EnterSymbol(variable, duplicate);
  6364. ASSERT(~duplicate);
  6365. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6366. ELSE
  6367. variable.SetUseRegister(TRUE);
  6368. variable(SyntaxTree.Variable).SetOffset(0);
  6369. END;
  6370. ELSE (* v # NIL *)
  6371. (* reuse slot for new variable, do not create new slot ! *)
  6372. temporaries.SetVariable(index, variable);
  6373. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6374. ASSERT(~register);
  6375. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6376. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6377. scope.EnterSymbol(variable, duplicate);
  6378. ASSERT(~duplicate);
  6379. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6380. END;
  6381. RETURN variable(SyntaxTree.Variable)
  6382. END GetTemporaryVariable;
  6383. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6384. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6385. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6386. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6387. i: LONGINT; duplicate: BOOLEAN;
  6388. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6389. VAR variable: SyntaxTree.Variable;
  6390. BEGIN
  6391. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6392. variable.SetType(type);
  6393. recordScope.AddVariable(variable);
  6394. END AddVariable;
  6395. BEGIN
  6396. name := "@ArrayDescriptor";
  6397. Basic.AppendNumber(name,dimensions);
  6398. identifier := SyntaxTree.NewIdentifier(name);
  6399. parentScope := module.module.moduleScope;
  6400. symbol := parentScope.FindSymbol(identifier);
  6401. IF symbol # NIL THEN
  6402. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6403. type := typeDeclaration.declaredType;
  6404. ELSE
  6405. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6406. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6407. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6408. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6409. recordType.SetTypeDeclaration(typeDeclaration);
  6410. recordType.SetState(SyntaxTree.Resolved);
  6411. typeDeclaration.SetDeclaredType(recordType);
  6412. AddVariable("@ptr",system.anyType);
  6413. AddVariable("@adr",system.addressType);
  6414. AddVariable("@flags",system.addressType);
  6415. AddVariable("@dim",system.addressType);
  6416. AddVariable("@elementSize",system.addressType);
  6417. FOR i := 0 TO dimensions-1 DO
  6418. name := "@len";
  6419. Basic.AppendNumber(name,i);
  6420. AddVariable(name,system.addressType);
  6421. name := "@incr";
  6422. Basic.AppendNumber(name,i);
  6423. AddVariable(name,system.addressType);
  6424. END;
  6425. parentScope.AddTypeDeclaration(typeDeclaration);
  6426. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6427. ASSERT(~duplicate);
  6428. type := recordType;
  6429. END;
  6430. RETURN type
  6431. END GetMathArrayDescriptorType;
  6432. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6433. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6434. BEGIN
  6435. type := GetMathArrayDescriptorType(dimensions);
  6436. Emit(Push(position,op.op));
  6437. (* push type descriptor *)
  6438. reg := TypeDescriptorAdr(type);
  6439. IF ~newObjectFile THEN
  6440. IntermediateCode.MakeMemory(reg,addressType);
  6441. END;
  6442. Emit(Push(position,reg));
  6443. ReleaseIntermediateOperand(reg);
  6444. (* push realtime flag: false by default *)
  6445. Emit(Push(position,false));
  6446. CallThis(position,"Heaps","NewRec",3);
  6447. END NewMathArrayDescriptor;
  6448. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6449. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6450. BEGIN
  6451. NEW(string, LEN(s)); COPY(s, string^);
  6452. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6453. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6454. sv.SetType(type);
  6455. Designate(sv,res);
  6456. Emit(Push(position,res.tag));
  6457. Emit(Push(position,res.op));
  6458. ReleaseOperand(res);
  6459. END PushConstString;
  6460. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6461. BEGIN
  6462. IF b THEN
  6463. Emit(Push(Basic.invalidPosition, true));
  6464. ELSE
  6465. Emit(Push(Basic.invalidPosition, false));
  6466. END;
  6467. END PushConstBoolean;
  6468. PROCEDURE PushConstSet(v: SET);
  6469. VAR value: SyntaxTree.Value; op: Operand;
  6470. BEGIN
  6471. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6472. value.SetType(system.setType);
  6473. Evaluate(value, op);
  6474. Emit(Push(Basic.invalidPosition, op.op));
  6475. ReleaseOperand(op);
  6476. END PushConstSet;
  6477. PROCEDURE PushConstInteger(v: LONGINT);
  6478. VAR value: SyntaxTree.Value; op: Operand;
  6479. BEGIN
  6480. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6481. value.SetType(system.longintType);
  6482. Evaluate(value, op);
  6483. Emit(Push(Basic.invalidPosition, op.op));
  6484. ReleaseOperand(op);
  6485. END PushConstInteger;
  6486. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6487. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6488. section: IntermediateCode.Section;
  6489. BEGIN
  6490. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6491. Global.GetSymbolSegmentedName(symbol, name);
  6492. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6493. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6494. procedure.SetScope(moduleScope);
  6495. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6496. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6497. procedure.SetAccess(SyntaxTree.Hidden);
  6498. currentScope := procedureScope;
  6499. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6500. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6501. RETURN section;
  6502. END OpenInitializer;
  6503. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6504. BEGIN
  6505. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6506. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6507. section := prev;
  6508. END CloseInitializer;
  6509. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6510. VAR name: SyntaxTree.IdentifierString;
  6511. variable: SyntaxTree.Variable;
  6512. parameter: SyntaxTree.Parameter;
  6513. type: SyntaxTree.Type;
  6514. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6515. BEGIN
  6516. InitOperand(op,ModeReference);
  6517. op.op := fp;
  6518. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6519. Dereference(op, x, FALSE);
  6520. result := op;
  6521. Symbol(symbol, op);
  6522. END Field;
  6523. PROCEDURE Direction(direction: LONGINT): SET;
  6524. BEGIN
  6525. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6526. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6527. ELSE HALT(100);
  6528. END;
  6529. END Direction;
  6530. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6531. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6532. BEGIN
  6533. Field(port, op);
  6534. ToMemory(op.op,addressType,0);
  6535. Emit(Push(Basic.invalidPosition, op.op));
  6536. ReleaseOperand(op);
  6537. Basic.GetString(modifier.identifier, name);
  6538. PushConstString(name);
  6539. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6540. ASSERT(SemanticChecker.IsStringType(value.type));
  6541. Designate(value, op);
  6542. Emit(Push(modifier.position, op.tag));
  6543. Emit(Push(modifier.position, op.op));
  6544. ReleaseOperand(op);
  6545. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6546. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6547. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6548. Evaluate(value, op);
  6549. Emit(Push(modifier.position, op.op));
  6550. ReleaseOperand(op);
  6551. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6552. ELSE
  6553. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6554. END;
  6555. END AddPortProperty;
  6556. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6557. VAR modifier: SyntaxTree.Modifier;
  6558. BEGIN
  6559. modifier := parameter.modifiers;
  6560. WHILE modifier # NIL DO
  6561. AddPortProperty(parameter,modifier, modifier.expression);
  6562. modifier := modifier.nextModifier;
  6563. END;
  6564. END AddPortProperties;
  6565. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6566. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6567. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6568. PROCEDURE PushLens(type: SyntaxTree.Type);
  6569. BEGIN
  6570. IF IsSemiDynamicArray(type) THEN
  6571. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6572. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6573. Emit(Push(Basic.invalidPosition, op.op));
  6574. ReleaseOperand(op);
  6575. INC(dim);
  6576. ELSIF IsStaticArray(type) THEN
  6577. len := len * type(SyntaxTree.ArrayType).staticLength;
  6578. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6579. INC(dim);
  6580. ELSE
  6581. baseType := type;
  6582. END;
  6583. END PushLens;
  6584. BEGIN
  6585. (* cell *)
  6586. IF parameter.type IS SyntaxTree.ArrayType THEN
  6587. type := parameter.type;
  6588. dim := 0;
  6589. len := 1;
  6590. PushLens(type);
  6591. portType := baseType.resolved(SyntaxTree.PortType);
  6592. ELSE
  6593. portType := parameter.type(SyntaxTree.PortType);
  6594. END;
  6595. PushSelfPointer();
  6596. (* port / array of ports *)
  6597. IF IsStaticArray(type) THEN
  6598. PushConstInteger(len);
  6599. END;
  6600. Field(parameter, op);
  6601. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6602. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6603. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6604. Designate(d, op);*)
  6605. Emit(Push(Basic.invalidPosition, op.op));
  6606. ReleaseOperand(op);
  6607. (* name *)
  6608. PushConstString(name);
  6609. (* inout *)
  6610. PushConstSet(Direction(portType.direction));
  6611. (* width *)
  6612. PushConstInteger(portType.sizeInBits);
  6613. IF parameter.type IS SyntaxTree.PortType THEN
  6614. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6615. AddPortProperties(parameter);
  6616. ELSIF IsStaticArray(type)THEN
  6617. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6618. ELSIF IsSemiDynamicArray(type) THEN
  6619. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6620. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6621. Emit(Add(position,reg, sp, size));
  6622. (* dim *)
  6623. PushConstInteger(dim);
  6624. (* len array *)
  6625. Emit(Push(position, reg));
  6626. ReleaseIntermediateOperand(reg);
  6627. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6628. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6629. Emit(Add(position, sp,sp, size));
  6630. ELSE
  6631. HALT(100);
  6632. END;
  6633. END Parameter;
  6634. BEGIN
  6635. IF backend.cellsAreObjects THEN
  6636. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6637. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6638. END;
  6639. parameter := x.firstParameter;
  6640. WHILE (parameter # NIL) DO
  6641. type := parameter.type.resolved;
  6642. WHILE (type IS SyntaxTree.ArrayType) DO
  6643. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6644. END;
  6645. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6646. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6647. Parameter(name,parameter);
  6648. END;
  6649. parameter := parameter.nextParameter;
  6650. END;
  6651. ELSE HALT(200)
  6652. END;
  6653. END AddPorts;
  6654. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6655. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6656. BEGIN
  6657. Symbol(cell,op);
  6658. ToMemory(op.op,addressType,0);
  6659. Emit(Push(position,op.op));
  6660. ReleaseOperand(op);
  6661. property.GetName(name);
  6662. (* does not work when inheritance is used:
  6663. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6664. *)
  6665. PushConstString(name);
  6666. IF (value # NIL) THEN
  6667. ASSERT(
  6668. SemanticChecker.IsStringType(property.type)
  6669. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6670. OR (property.type.resolved IS SyntaxTree.FloatType)
  6671. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6672. OR (property.type.resolved IS SyntaxTree.SetType)
  6673. );
  6674. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6675. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6676. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6677. Designate(d, op);
  6678. IF SemanticChecker.IsStringType(property.type) THEN
  6679. Emit(Push(Basic.invalidPosition, op.tag))
  6680. END;
  6681. Emit(Push(Basic.invalidPosition, op.op));
  6682. ReleaseOperand(op);
  6683. END;
  6684. IF value = NIL THEN
  6685. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6686. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6687. ASSERT(SemanticChecker.IsStringType(value.type));
  6688. Designate(value, op);
  6689. PushString(op, value.type);
  6690. ReleaseOperand(op);
  6691. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6692. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6693. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6694. Evaluate(value, op);
  6695. Emit(Push(property.position, op.op));
  6696. ReleaseOperand(op);
  6697. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6698. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6699. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6700. Evaluate(value, op);
  6701. Emit(Push(property.position, op.op));
  6702. ReleaseOperand(op);
  6703. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6704. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6705. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6706. Evaluate(value, op);
  6707. Emit(Push(property.position, op.op));
  6708. ReleaseOperand(op);
  6709. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6710. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6711. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6712. Evaluate(value, op);
  6713. Emit(Push(property.position, op.op));
  6714. ReleaseOperand(op);
  6715. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6716. ELSE
  6717. HALT(200);
  6718. END;
  6719. END AddProperty;
  6720. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6721. VAR symbol: SyntaxTree.Symbol;
  6722. BEGIN
  6723. WHILE modifier # NIL DO
  6724. symbol := cellType.FindProperty(modifier.identifier);
  6725. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6726. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6727. modifier := modifier.nextModifier;
  6728. END;
  6729. END AddModifiers;
  6730. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6731. VAR last: SyntaxTree.Modifier;
  6732. BEGIN
  6733. IF to = NIL THEN
  6734. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6735. ELSE
  6736. last := to;
  6737. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6738. last := last.nextModifier;
  6739. END;
  6740. IF last.identifier # this.identifier THEN
  6741. ASSERT(last.nextModifier = NIL);
  6742. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6743. END;
  6744. END;
  6745. END AppendModifier;
  6746. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6747. BEGIN
  6748. WHILE this # NIL DO
  6749. AppendModifier(to, this);
  6750. this := this.nextModifier;
  6751. END;
  6752. END AppendModifiers;
  6753. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6754. VAR base: SyntaxTree.Type;
  6755. BEGIN
  6756. AppendModifiers(to, c.modifiers);
  6757. base := c.GetBaseValueType();
  6758. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6759. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6760. END;
  6761. END AppendCellTypeModifiers;
  6762. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6763. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6764. BEGIN
  6765. Basic.GetString(modifier.identifier, name);
  6766. PushConstString(name);
  6767. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6768. ASSERT(SemanticChecker.IsStringType(value.type));
  6769. Designate(value, op);
  6770. PushString(op, value.type);
  6771. ReleaseOperand(op);
  6772. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6773. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6774. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6775. Evaluate(value, op);
  6776. Emit(Push(modifier.position, op.op));
  6777. ReleaseOperand(op);
  6778. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6779. ELSE
  6780. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6781. END;
  6782. END AddPortProperty;
  6783. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6784. BEGIN
  6785. WHILE modifier # NIL DO
  6786. AddPortProperty(modifier, modifier.expression);
  6787. modifier := modifier.nextModifier;
  6788. END;
  6789. END AddPortProperties;
  6790. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6791. VAR op: Operand;
  6792. BEGIN
  6793. Evaluate(p, op);
  6794. Emit(Push(p.position, op.op));
  6795. ReleaseOperand(op);
  6796. IF p IS SyntaxTree.Designator THEN
  6797. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6798. END;
  6799. END PushPort;
  6800. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6801. VAR tmp: IntermediateCode.Operand;
  6802. BEGIN
  6803. actualType := actualType.resolved;
  6804. IF actualType IS SyntaxTree.StringType THEN
  6805. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6806. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6807. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6808. ELSE
  6809. tmp := op.tag;
  6810. IntermediateCode.MakeMemory(tmp,addressType);
  6811. Emit(Push(position,tmp));
  6812. END;
  6813. Emit(Push(position,op.op))
  6814. END PushString;
  6815. (* conservative check if x is potentially on the heap, excluding the module heap
  6816. required for generational garbage collector
  6817. *)
  6818. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6819. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6820. BEGIN
  6821. RETURN TRUE;
  6822. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6823. passed by reference.
  6824. pos := x.position.start;
  6825. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6826. x := x(SyntaxTree.Designator).left;
  6827. END;
  6828. RETURN x # NIL;
  6829. *)
  6830. END OnHeap;
  6831. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6832. VAR
  6833. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6834. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6835. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6836. tmp:IntermediateCode.Operand;
  6837. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6838. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6839. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6840. dest: IntermediateCode.Operand;
  6841. staticLength: LONGINT; itype: IntermediateCode.Type;
  6842. convert,isTensor: BOOLEAN;
  6843. recordType: SyntaxTree.RecordType;
  6844. baseType: SyntaxTree.Type;
  6845. flags: SET;
  6846. left: SyntaxTree.Expression;
  6847. call: SyntaxTree.Designator;
  6848. procedure: SyntaxTree.Procedure;
  6849. temporaryVariable: SyntaxTree.Variable;
  6850. dummy: IntermediateCode.Operand;
  6851. customBuiltin: SyntaxTree.CustomBuiltin;
  6852. isVarPar: ARRAY 3 OF BOOLEAN;
  6853. callsection: Sections.Section;
  6854. segmentedName: Basic.SegmentedName;
  6855. needsTrace: BOOLEAN;
  6856. n: ARRAY 256 OF CHAR;
  6857. modifier: SyntaxTree.Modifier;
  6858. previous, init: IntermediateCode.Section;
  6859. prevScope: SyntaxTree.Scope;
  6860. firstPar: LONGINT;
  6861. saved: RegisterEntry;
  6862. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6863. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6864. priority: IntermediateCode.Operand;
  6865. op,callop: Operand;
  6866. BEGIN
  6867. IF type = NIL THEN RETURN END;
  6868. type := type.resolved;
  6869. IF type IS SyntaxTree.PointerType THEN
  6870. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6871. END;
  6872. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6873. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6874. recordScope := type(SyntaxTree.RecordType).recordScope;
  6875. IF recordScope.bodyProcedure # NIL THEN
  6876. procedure := recordScope.bodyProcedure;
  6877. body := procedure.procedureScope.body;
  6878. Emit(Push(position,self));
  6879. IF body.isActive THEN
  6880. StaticCallOperand(callop,procedure);
  6881. Emit(Push(position,callop.op));
  6882. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6883. Convert(priority,sizeType);
  6884. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6885. END;
  6886. Emit(Push(position,priority));
  6887. ReleaseIntermediateOperand(priority);
  6888. IF backend.cooperative THEN
  6889. Emit(Push(position,self));
  6890. CallThis(position,"Activities","Create",3)
  6891. ELSE
  6892. flags := 0;
  6893. IF body.isSafe THEN
  6894. flags := 1;
  6895. END;
  6896. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6897. Emit(Push(position,self));
  6898. CallThis(position,"Objects","CreateProcess",4)
  6899. END;
  6900. ELSE
  6901. Emit(Push(position,self));
  6902. StaticCallOperand(callop,procedure);
  6903. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6904. END;
  6905. Emit(Pop(position,self));
  6906. END;
  6907. END CallBodies;
  6908. PROCEDURE PushTD(type: SyntaxTree.Type);
  6909. VAR op: IntermediateCode.Operand;
  6910. BEGIN
  6911. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6912. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6913. ELSE
  6914. IF type.resolved IS SyntaxTree.PointerType THEN
  6915. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6916. END;
  6917. op := TypeDescriptorAdr(type.resolved);
  6918. IF ~newObjectFile THEN
  6919. IntermediateCode.MakeMemory(op,addressType);
  6920. END;
  6921. Emit(Push(position,op));
  6922. END
  6923. END PushTD;
  6924. BEGIN
  6925. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6926. dest := destination; destination := emptyOperand;
  6927. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6928. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6929. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6930. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6931. CASE x.id OF
  6932. (* ---- COPY ----- *)
  6933. |Global.Copy:
  6934. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6935. (* ---- EXCL, INCL----- *)
  6936. |Global.Excl,Global.Incl:
  6937. Evaluate(p0,s0);
  6938. Evaluate(p1,s1);
  6939. Convert(s1.op,setType);
  6940. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6941. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6942. END;
  6943. ReuseCopy(res,s0.op);
  6944. ReleaseOperand(s0);
  6945. Reuse1(tmp,s1.op);
  6946. ReleaseOperand(s1);
  6947. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6948. IF x.id = Global.Excl THEN
  6949. Emit(Not(position,tmp,tmp));
  6950. Emit(And(position,res,res,tmp));
  6951. ELSE
  6952. Emit(Or(position,res,res,tmp));
  6953. END;
  6954. ReleaseIntermediateOperand(tmp);
  6955. Designate(p0,s0);
  6956. ToMemory(s0.op,setType,0);
  6957. Emit(Mov(position,s0.op,res));
  6958. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6959. (* ---- DISPOSE ----- *)
  6960. |Global.Dispose:
  6961. Designate(p0,s0);
  6962. Emit(Push(position,s0.op));
  6963. ReleaseOperand(s0);
  6964. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6965. (* ---- GETPROCEDURE ----- *)
  6966. |Global.GetProcedure:
  6967. Designate(p0,s0);
  6968. PushString(s0,p0.type);
  6969. Designate(p1,s1);
  6970. PushString(s1,p1.type);
  6971. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6972. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6973. ELSE PushTD(procedureType.firstParameter.type)
  6974. END;
  6975. PushTD(procedureType.returnType);
  6976. Designate(p2,s2);
  6977. Emit(Push(position,s2.op));
  6978. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6979. CallThis(position,"Modules","GetProcedure", 7);
  6980. (* ---- ASH, LSH, ROT ----- *)
  6981. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6982. Evaluate(p0,s0);
  6983. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6984. (* make unsigned arguments in order to produced a logical shift *)
  6985. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6986. convert:= TRUE;
  6987. itype := s0.op.type;
  6988. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6989. Convert(s0.op,itype);
  6990. ELSE
  6991. convert := FALSE;
  6992. END;
  6993. END;
  6994. Evaluate(p1,s1);
  6995. IF IsIntegerConstant(p1,hint) THEN
  6996. ReuseCopy(reg,s0.op);
  6997. IF hint > 0 THEN
  6998. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6999. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7000. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7001. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7002. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7003. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7004. END;
  7005. ELSIF hint < 0 THEN
  7006. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7007. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7008. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7009. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7010. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7011. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7012. END;
  7013. END;
  7014. ReleaseOperand(s0); ReleaseOperand(s1);
  7015. ELSE
  7016. exit := NewLabel();
  7017. end := NewLabel();
  7018. ReuseCopy(reg,s0.op);
  7019. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7020. Reuse1(tmp,s1.op);
  7021. Emit(Neg(position,tmp,s1.op));
  7022. Convert(tmp,s1.op.type);
  7023. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7024. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7025. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7026. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7027. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7028. END;
  7029. ReleaseIntermediateOperand(tmp);
  7030. BrL(end);
  7031. SetLabel(exit);
  7032. ReuseCopy(tmp,s1.op);
  7033. Convert(tmp,s1.op.type);
  7034. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7035. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7036. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7037. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7038. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7039. END;
  7040. ReleaseIntermediateOperand(tmp);
  7041. SetLabel(end);
  7042. ReleaseOperand(s0); ReleaseOperand(s1);
  7043. END;
  7044. InitOperand(result,ModeValue);
  7045. IF convert THEN
  7046. itype := reg.type;
  7047. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7048. Convert(reg,itype);
  7049. END;
  7050. result.op := reg;
  7051. (* ---- CAP ----- *)
  7052. |Global.Cap:
  7053. Evaluate(p0,result);
  7054. ReuseCopy(reg,result.op);
  7055. ReleaseIntermediateOperand(result.op);
  7056. ignore := NewLabel();
  7057. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7058. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7059. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7060. SetLabel(ignore);
  7061. result.op := reg;
  7062. (* ---- CHR ----- *)
  7063. |Global.Chr, Global.Chr32:
  7064. Evaluate(p0,result);
  7065. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7066. |Global.Entier, Global.EntierH:
  7067. Evaluate(p0,result);
  7068. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7069. (* ---- MIN and MAX ----- *)
  7070. |Global.Max,Global.Min:
  7071. Evaluate(p0,s0);
  7072. Evaluate(p1,s1);
  7073. Reuse2(res,s0.op,s1.op);
  7074. else := NewLabel();
  7075. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7076. ELSE BrltL(else,s1.op,s0.op) END;
  7077. Emit(Mov(position,res,s0.op));
  7078. ReleaseOperand(s0);
  7079. end := NewLabel();
  7080. BrL(end);
  7081. SetLabel(else);
  7082. Emit(MovReplace(position,res,s1.op));
  7083. SetLabel(end);
  7084. ReleaseOperand(s1);
  7085. InitOperand(result,ModeValue);
  7086. result.op := res;
  7087. (* ---- ODD ----- *)
  7088. |Global.Odd:
  7089. IF ~conditional THEN
  7090. ConditionToValue(x)
  7091. ELSE
  7092. Evaluate(p0,result);
  7093. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7094. Reuse1(res,result.op);
  7095. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7096. ReleaseIntermediateOperand(result.op);
  7097. result.op := res;
  7098. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7099. ReleaseOperand(result);
  7100. BrL(falseLabel);
  7101. END;
  7102. (* ---- ORD ----- *)
  7103. |Global.Ord, Global.Ord32:
  7104. Evaluate(p0,result);
  7105. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7106. (* ---- SHORT, LONG ----- *)
  7107. |Global.Short, Global.Long:
  7108. Evaluate(p0,result);
  7109. IF x.type IS SyntaxTree.ComplexType THEN
  7110. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7111. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7112. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7113. ELSE
  7114. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7115. END
  7116. (* ---- HALT, SYSTEM.HALT----- *)
  7117. |Global.Halt, Global.systemHalt:
  7118. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7119. EmitTrap (position, val);
  7120. (* ---- ASSERT ----- *)
  7121. |Global.Assert:
  7122. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7123. trueL := NewLabel();
  7124. falseL := NewLabel();
  7125. Condition(p0,trueL,falseL);
  7126. IF p1 = NIL THEN val := AssertTrap
  7127. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7128. END;
  7129. SetLabel(falseL);
  7130. EmitTrap(position,val);
  7131. SetLabel(trueL);
  7132. END;
  7133. (*
  7134. Emit(TrapC(result.op,val);
  7135. *)
  7136. (* ---- INC, DEC----- *)
  7137. |Global.Inc,Global.Dec:
  7138. Expression(p0); adr := result.op;
  7139. LoadValue(result,p0.type); l := result;
  7140. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7141. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7142. END;
  7143. IF x.id = Global.Inc THEN
  7144. Emit(Add(position,l.op,l.op,r.op));
  7145. ELSE
  7146. Emit(Sub(position,l.op,l.op,r.op));
  7147. END;
  7148. ReleaseOperand(l); ReleaseOperand(r);
  7149. (* ---- LEN ----- *)
  7150. |Global.Len: (* dynamic length, static length done by checker *)
  7151. Designate(p0,operand);
  7152. IF p1 = NIL THEN
  7153. InitOperand(l,ModeValue);
  7154. l.op := IntermediateCode.Immediate(sizeType,0);
  7155. ELSE
  7156. Evaluate(p1,l);
  7157. END;
  7158. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7159. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7160. Dereference(operand, p0.type.resolved, FALSE);
  7161. END;
  7162. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7163. ReleaseOperand(operand); ReleaseOperand(l);
  7164. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7165. ASSERT(p1 # NIL);
  7166. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7167. Dereference(operand,p0.type.resolved,FALSE);
  7168. END;
  7169. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7170. ReleaseOperand(operand); ReleaseOperand(l);
  7171. ELSE HALT(100);
  7172. END;
  7173. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7174. (* ---- FIRST ---- *)
  7175. |Global.First:
  7176. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7177. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7178. ELSE
  7179. Designate(p0, result)
  7180. END
  7181. (* ---- LAST ---- *)
  7182. |Global.Last:
  7183. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7184. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7185. ELSE
  7186. Designate(p0, result);
  7187. (* make sure result.op is a register *)
  7188. tmp := result.op;
  7189. ReuseCopy(result.op, result.op);
  7190. ReleaseIntermediateOperand(tmp);
  7191. (* add offset to result.op *)
  7192. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7193. END
  7194. (* ---- STEP ---- *)
  7195. |Global.Step:
  7196. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7197. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7198. ELSE
  7199. Designate(p0, result);
  7200. (* make sure result.op is a register *)
  7201. tmp := result.op;
  7202. ReuseCopy(result.op, result.op);
  7203. ReleaseIntermediateOperand(tmp);
  7204. (* add offset to result.op *)
  7205. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7206. END
  7207. (* ---- RE ---- *)
  7208. |Global.Re:
  7209. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7210. Designate(p0, result)
  7211. ELSE
  7212. Evaluate(p0, result)
  7213. END
  7214. (* ---- IM ---- *)
  7215. |Global.Im:
  7216. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7217. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7218. Designate(p0, result);
  7219. (* make sure result.op is a register *)
  7220. tmp := result.op;
  7221. ReuseCopy(result.op, result.op);
  7222. ReleaseIntermediateOperand(tmp);
  7223. (* add offset to result.op *)
  7224. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7225. (* ---- ABS ----- *)
  7226. |Global.Abs:
  7227. Evaluate(p0,operand);
  7228. type := p0.type.resolved;
  7229. InitOperand(result,ModeValue);
  7230. Reuse1a(result.op,operand.op,dest);
  7231. Emit(Abs(position,result.op,operand.op));
  7232. ReleaseOperand(operand);
  7233. (* ---- WAIT ----- *)
  7234. |Global.Wait:
  7235. Evaluate(p0,operand);
  7236. Emit(Push(position,operand.op));
  7237. ReleaseOperand(operand);
  7238. CallThis(position,"Activities","Wait", 1);
  7239. (* ---- NEW ----- *)
  7240. |Global.New:
  7241. (*! the following code is only correct for "standard" Oberon calling convention *)
  7242. IF x.type # NIL THEN
  7243. type := x.type.resolved;
  7244. firstPar := 0;
  7245. ELSE
  7246. type := p0.type.resolved;
  7247. firstPar := 1;
  7248. END;
  7249. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7250. THEN
  7251. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7252. IF backend.cooperative THEN
  7253. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7254. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7255. IF recordType.isObject THEN
  7256. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7257. IF recordType.IsActive() THEN
  7258. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7259. END;
  7260. IF recordType.IsProtected() THEN
  7261. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7262. END;
  7263. ELSE
  7264. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7265. END;
  7266. END;
  7267. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7268. CallThis(position,"Runtime","New", 1);
  7269. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7270. Emit(Result(position, pointer));
  7271. exit := NewLabel();
  7272. BreqL(exit,pointer,nil);
  7273. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7274. GetRecordTypeName (recordType,name);
  7275. IF ~recordType.isObject THEN
  7276. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7277. END;
  7278. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7279. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7280. IF recordType.isObject THEN
  7281. IF recordType.IsProtected() THEN
  7282. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7283. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7284. END;
  7285. IF recordType.IsActive() THEN
  7286. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7287. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7288. END;
  7289. END;
  7290. END;
  7291. (* initialize fields *)
  7292. IF type(SyntaxTree.PointerType).isPlain THEN
  7293. size := 0;
  7294. ELSIF recordType.isObject THEN
  7295. size := BaseObjectTypeSize;
  7296. ELSE
  7297. size := BaseRecordTypeSize;
  7298. END;
  7299. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7300. (* call initializer *)
  7301. constructor := GetConstructor(recordType);
  7302. IF constructor # NIL THEN
  7303. (*! should be unified with ProcedureCallDesignator *)
  7304. Emit(Push(position,pointer));
  7305. ReleaseIntermediateOperand(pointer);
  7306. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7307. FOR i := firstPar TO x.parameters.Length()-1 DO
  7308. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7309. formalParameter := formalParameter.nextParameter;
  7310. END;
  7311. (* static call of the constructor *)
  7312. GetCodeSectionNameForSymbol(constructor,name);
  7313. ASSERT(~constructor.isInline);
  7314. IF constructor.scope.ownerModule # module.module THEN
  7315. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7316. ELSE
  7317. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7318. END;
  7319. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7320. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7321. Emit(Pop(position,pointer));
  7322. END;
  7323. (* call bodies *)
  7324. CallBodies(pointer,type);
  7325. SetLabel(exit);
  7326. needsTrace := p0.NeedsTrace();
  7327. IF needsTrace THEN ModifyAssignments(true) END;
  7328. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7329. Emit(Push(position, pointer));
  7330. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7331. Emit(Pop(position, pointer));
  7332. END;
  7333. Designate(p0,l);
  7334. IF needsTrace THEN
  7335. CallAssignPointer(l.op, pointer);
  7336. ELSE
  7337. ToMemory(l.op,addressType,0);
  7338. Emit(Mov(position,l.op,pointer));
  7339. END;
  7340. ReleaseIntermediateOperand(pointer);
  7341. ReleaseOperand(l);
  7342. IF needsTrace THEN ModifyAssignments(false) END;
  7343. ELSE (* not cooperative backend *)
  7344. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7345. IF temporaryVariable # NIL THEN
  7346. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7347. ELSE
  7348. Designate(p0,l);
  7349. END;
  7350. (* l.op contains address of pointer to record *)
  7351. Emit(Push(position,l.op)); (* address for use after syscall *)
  7352. Emit(Push(position,l.op));
  7353. ReleaseOperand(l);
  7354. (* push type descriptor *)
  7355. reg := TypeDescriptorAdr(recordType);
  7356. IF ~newObjectFile THEN
  7357. IntermediateCode.MakeMemory(reg,addressType);
  7358. END;
  7359. Emit(Push(position,reg));
  7360. ReleaseIntermediateOperand(reg);
  7361. (* push realtime flag *)
  7362. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7363. ELSE Emit(Push(position,false));
  7364. END;
  7365. CallThis(position,"Heaps","NewRec", 3);
  7366. (* check allocation success, if not successful then do not call initializers and bodies *)
  7367. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7368. Emit(Pop(position,pointer));
  7369. MakeMemory(reg,pointer,addressType,0);
  7370. ReleaseIntermediateOperand(pointer);
  7371. pointer := reg;
  7372. exit := NewLabel();
  7373. BreqL(exit,pointer,nil);
  7374. Emit(Push(position,pointer));
  7375. (* initialize fields *)
  7376. InitFields(recordType, pointer,0);
  7377. (* call initializer *)
  7378. constructor := GetConstructor(recordType);
  7379. IF constructor # NIL THEN
  7380. (*! should be unified with ProcedureCallDesignator *)
  7381. Emit(Push(position,pointer));
  7382. ReleaseIntermediateOperand(pointer);
  7383. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7384. FOR i := firstPar TO x.parameters.Length()-1 DO
  7385. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7386. formalParameter := formalParameter.nextParameter;
  7387. END;
  7388. (* static call of the constructor *)
  7389. GetCodeSectionNameForSymbol(constructor,name);
  7390. ASSERT(~constructor.isInline);
  7391. IF constructor.scope.ownerModule # module.module THEN
  7392. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7393. ELSE
  7394. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7395. END;
  7396. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7397. ELSE
  7398. ReleaseIntermediateOperand(pointer);
  7399. END;
  7400. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7401. Emit(Pop(position,pointer));
  7402. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7403. Designate(p0,l);
  7404. IF backend.writeBarriers & OnHeap(p0) THEN
  7405. SaveRegisters();ReleaseUsedRegisters(saved);
  7406. Emit(Push(position,l.op));
  7407. Emit(Push(position,pointer));
  7408. CallThis(position,"Heaps","Assign",2);
  7409. RestoreRegisters(saved);
  7410. ELSE
  7411. ToMemory(l.op,addressType,0);
  7412. Emit(Mov(position,l.op,pointer));
  7413. END;
  7414. ReleaseOperand(l);
  7415. result.tag := emptyOperand;
  7416. ELSIF (x.type # NIL) THEN
  7417. result := l; (* temporary variable is the result of NEW Type() *)
  7418. END;
  7419. (* call bodies *)
  7420. CallBodies(pointer,type);
  7421. ReleaseIntermediateOperand(pointer);
  7422. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7423. end := NewLabel();
  7424. BrL(end);
  7425. SetLabel(exit);
  7426. Designate(p0,l);
  7427. ToMemory(l.op,addressType,0);
  7428. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7429. ReleaseOperand(l);
  7430. SetLabel(end);
  7431. ELSE
  7432. SetLabel(exit);
  7433. END;
  7434. END;
  7435. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7436. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7437. IF ~backend.cooperative THEN (* simpler version *)
  7438. (*
  7439. push len0
  7440. push len1
  7441. push len2
  7442. push len_size
  7443. push len_adr
  7444. push tag
  7445. push static elements
  7446. push element size
  7447. push adr
  7448. *)
  7449. dim := 0;
  7450. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7451. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7452. parameter := x.parameters.GetExpression(i);
  7453. Evaluate(parameter,r);
  7454. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7455. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7456. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7457. END;
  7458. Emit(Push(position,r.op));
  7459. ReleaseOperand(r);
  7460. INC(dim);
  7461. END;
  7462. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7463. Emit(Mov(position, adr, sp));
  7464. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7465. Emit(Push(position, adr));
  7466. ReleaseIntermediateOperand(adr);
  7467. openDim := dim;
  7468. staticLength := 1;
  7469. IF type IS SyntaxTree.ArrayType THEN
  7470. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7471. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7472. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7473. END;
  7474. END;
  7475. IF SemanticChecker.ContainsPointer(type) THEN
  7476. tmp := TypeDescriptorAdr(type);
  7477. IF ~newObjectFile THEN
  7478. IntermediateCode.MakeMemory(tmp,addressType);
  7479. END;
  7480. ELSE
  7481. tmp := nil;
  7482. END;
  7483. Emit(Push(position,tmp)); (* type descriptor *)
  7484. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7485. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7486. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7487. Designate(p0,l);
  7488. Emit(Push(position,l.op)); (* address *)
  7489. ReleaseOperand(l);
  7490. CallThis(position,"Heaps","NewArray", 6);
  7491. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7492. Emit(Add(position,sp,sp,tmp));
  7493. ELSE
  7494. dim := 0;
  7495. IntermediateCode.InitOperand(reg);
  7496. IF p1 # NIL THEN
  7497. FOR i := firstPar TO x.parameters.Length()-1 DO
  7498. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7499. parameter := x.parameters.GetExpression(i);
  7500. Evaluate(parameter,r);
  7501. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7502. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7503. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7504. END;
  7505. Emit(Push(position,r.op));
  7506. IF i=1 THEN
  7507. CopyInt(reg,r.op);
  7508. ELSE
  7509. MulInt(reg, reg, r.op);
  7510. END;
  7511. ReleaseOperand(r);
  7512. INC(dim);
  7513. END;
  7514. Convert(reg,addressType);
  7515. ELSE
  7516. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7517. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7518. END;
  7519. openDim := dim;
  7520. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7521. IF backend.cooperative THEN
  7522. size := ToMemoryUnits(system,system.SizeOf(type));
  7523. WHILE type IS SyntaxTree.ArrayType DO
  7524. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7525. END;
  7526. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7527. IF (size # 1) THEN
  7528. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7529. END;
  7530. Emit(Push(position,reg));
  7531. size := ToMemoryUnits(system,system.SizeOf(type));
  7532. IF (size # 1) THEN
  7533. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7534. END;
  7535. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7536. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7537. Emit(Push(position,reg));
  7538. ReleaseIntermediateOperand(reg);
  7539. CallThis(position,"Runtime","New", 1);
  7540. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7541. Emit(Result(position, pointer));
  7542. exit := NewLabel();
  7543. else := NewLabel();
  7544. BreqL(else,pointer,nil);
  7545. IF ~type.hasPointers THEN
  7546. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7547. ELSIF type IS SyntaxTree.RecordType THEN
  7548. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7549. ELSIF type IS SyntaxTree.ProcedureType THEN
  7550. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7551. ELSE
  7552. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7553. END;
  7554. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7555. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7556. 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))));
  7557. IF type IS SyntaxTree.RecordType THEN
  7558. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7559. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7560. ELSE
  7561. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7562. END;
  7563. i := openDim;
  7564. WHILE i > 0 DO
  7565. DEC (i);
  7566. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7567. END;
  7568. needsTrace := p0.NeedsTrace();
  7569. IF needsTrace THEN ModifyAssignments(true) END;
  7570. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7571. Emit(Push(position, pointer));
  7572. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7573. Emit(Pop(position, pointer));
  7574. END;
  7575. Designate(p0,l);
  7576. IF needsTrace THEN
  7577. CallAssignPointer(l.op, pointer);
  7578. ModifyAssignments(false);
  7579. ELSE
  7580. ToMemory(l.op,addressType,0);
  7581. Emit(Mov(position,l.op,pointer));
  7582. END;
  7583. ReleaseIntermediateOperand(pointer);
  7584. ReleaseOperand(l);
  7585. BrL(exit);
  7586. SetLabel(else);
  7587. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7588. Designate(p0,l);
  7589. IF needsTrace THEN
  7590. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7591. ELSE
  7592. ToMemory(l.op,addressType,0);
  7593. Emit(Mov(position,l.op,pointer));
  7594. END;
  7595. ReleaseOperand(l);
  7596. SetLabel(exit);
  7597. ELSE
  7598. (*! the following code is only correct for "standard" Oberon calling convention *)
  7599. IF SemanticChecker.ContainsPointer(type) THEN
  7600. IF type IS SyntaxTree.ArrayType THEN
  7601. staticLength := 1;
  7602. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7603. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7604. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7605. END;
  7606. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7607. MulInt(reg,reg,tmp);
  7608. END;
  7609. Designate(p0,l);
  7610. IF openDim > 0 THEN
  7611. Emit(Push(position,l.op)); (* address for use after syscall *)
  7612. END;
  7613. Emit(Push(position,l.op)); (* address *)
  7614. ReleaseOperand(l);
  7615. tmp := TypeDescriptorAdr(type);
  7616. IF ~newObjectFile THEN
  7617. IntermediateCode.MakeMemory(tmp,addressType);
  7618. END;
  7619. Emit(Push(position,tmp)); (* type descriptor *)
  7620. ReleaseIntermediateOperand(tmp);
  7621. Emit(Push(position,reg)); (* number Elements *)
  7622. ReleaseIntermediateOperand(reg);
  7623. tmp := IntermediateCode.Immediate(addressType,dim);
  7624. Emit(Push(position,tmp)); (* dimensions *)
  7625. (* push realtime flag *)
  7626. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7627. ELSE Emit(Push(position,false));
  7628. END;
  7629. CallThis(position,"Heaps","NewArr",5)
  7630. ELSE
  7631. size := ToMemoryUnits(system,system.SizeOf(type));
  7632. IF (size # 1) THEN
  7633. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7634. (*
  7635. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7636. *)
  7637. END;
  7638. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7639. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7640. AddInt(reg, reg, tmp);
  7641. (*
  7642. Emit(Add(position,reg,reg,tmp));
  7643. *)
  7644. Designate(p0,l);
  7645. IF openDim >0 THEN
  7646. Emit(Push(position,l.op)); (* address for use after syscall *)
  7647. END;
  7648. Emit(Push(position,l.op)); (* address for syscall *)
  7649. ReleaseOperand(l); (* pointer address *)
  7650. Emit(Push(position,reg)); (* size *)
  7651. ReleaseIntermediateOperand(reg);
  7652. (* push realtime flag *)
  7653. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7654. ELSE Emit(Push(position,false));
  7655. END;
  7656. CallThis(position,"Heaps","NewSys", 3)
  7657. END;
  7658. IF openDim > 0 THEN
  7659. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7660. Emit(Pop(position,adr));
  7661. ToMemory(adr,addressType,0);
  7662. ReuseCopy(tmp,adr);
  7663. ReleaseIntermediateOperand(adr);
  7664. adr := tmp;
  7665. else := NewLabel();
  7666. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7667. i := openDim-1;
  7668. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7669. WHILE (i >= 0) DO
  7670. Emit(Pop(position,reg));
  7671. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7672. Emit(Mov(position,res,reg));
  7673. DEC(i);
  7674. END;
  7675. ReleaseIntermediateOperand(adr);
  7676. ReleaseIntermediateOperand(reg);
  7677. exit := NewLabel();
  7678. BrL(exit);
  7679. SetLabel(else);
  7680. (* else part: array could not be allocated *)
  7681. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7682. Emit(Add(position,sp,sp,tmp));
  7683. SetLabel(exit);
  7684. END;
  7685. END;
  7686. END;
  7687. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7688. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7689. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7690. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7691. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7692. left.SetType(procedure.type);
  7693. formalParameter := procedureType.firstParameter;
  7694. (* push array to allocate *)
  7695. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7696. formalParameter :=formalParameter.nextParameter;
  7697. (* push length array *)
  7698. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7699. (* push size *)
  7700. type := t0;
  7701. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7702. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7703. END;
  7704. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7705. Emit(Push(position,tmp));
  7706. (* *)
  7707. IF SemanticChecker.ContainsPointer(type) THEN
  7708. tmp := TypeDescriptorAdr(type);
  7709. IF ~newObjectFile THEN
  7710. IntermediateCode.MakeMemory(tmp,addressType);
  7711. END;
  7712. ELSE
  7713. tmp := IntermediateCode.Immediate(addressType, 0);
  7714. END;
  7715. Emit(Push(position,tmp)); (* type descriptor *)
  7716. StaticCallOperand(result,procedure);
  7717. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7718. ReleaseOperand(result);
  7719. END;
  7720. (*
  7721. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7722. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7723. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7724. *)
  7725. ELSE
  7726. (*
  7727. push len0
  7728. push len1
  7729. push len2
  7730. push size
  7731. push len_adr
  7732. push element_size
  7733. push tag
  7734. push adr
  7735. *)
  7736. dim := 0;
  7737. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7738. isTensor := TRUE;
  7739. ELSE
  7740. isTensor := FALSE;
  7741. END;
  7742. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7743. IF ~isTensor THEN
  7744. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7745. END;
  7746. parameter := x.parameters.GetExpression(i);
  7747. Evaluate(parameter,r);
  7748. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7749. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7750. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7751. END;
  7752. Emit(Push(position,r.op));
  7753. ReleaseOperand(r);
  7754. INC(dim);
  7755. END;
  7756. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7757. Emit(Mov(position, adr, sp));
  7758. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7759. Emit(Push(position, adr));
  7760. ReleaseIntermediateOperand(adr);
  7761. openDim := dim;
  7762. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7763. IF isTensor THEN
  7764. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7765. ELSE
  7766. baseType := SemanticChecker.ArrayBase(type,openDim);
  7767. END;
  7768. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7769. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7770. IF SemanticChecker.ContainsPointer(baseType) THEN
  7771. tmp := TypeDescriptorAdr(baseType);
  7772. IF ~newObjectFile THEN
  7773. IntermediateCode.MakeMemory(tmp,addressType);
  7774. END;
  7775. ELSE
  7776. tmp := nil;
  7777. END;
  7778. Emit(Push(position,tmp)); (* type descriptor *)
  7779. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7780. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7781. ELSE (* error message has already been emited *)
  7782. RETURN;
  7783. END;
  7784. Designate(p0,l);
  7785. IF isTensor THEN
  7786. Emit(Push(position,l.op)); (* address *)
  7787. ELSE
  7788. Emit(Push(position,l.tag)); (* address *)
  7789. END;
  7790. ReleaseOperand(l);
  7791. StaticCallOperand(result,procedure);
  7792. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7793. ReleaseOperand(result);
  7794. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7795. Emit(Add(position,sp,sp,tmp));
  7796. END;
  7797. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7798. THEN
  7799. IF ~backend.cellsAreObjects THEN RETURN END;
  7800. IF InCellScope(currentScope) THEN
  7801. PushSelfPointer()
  7802. ELSE
  7803. Emit(Push(position, nil));
  7804. END;
  7805. (* push temp address *)
  7806. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7807. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7808. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7809. (* l.op contains address of pointer to record *)
  7810. Emit(Push(position,l.op)); (* address for use after syscall *)
  7811. ReleaseOperand(l);
  7812. (* push type descriptor *)
  7813. reg := TypeDescriptorAdr(baseType);
  7814. IF ~newObjectFile THEN
  7815. IntermediateCode.MakeMemory(reg,addressType);
  7816. END;
  7817. Emit(Push(position,reg));
  7818. ReleaseIntermediateOperand(reg);
  7819. (* push name *)
  7820. (*Global.GetSymbolName(p0, n);*)
  7821. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7822. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7823. ELSE
  7824. Global.GetModuleName(module.module, n);
  7825. END;
  7826. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7827. (*type.typeDeclaration.GetName(n);*)
  7828. PushConstString(n);
  7829. (* push cellnet boolean *)
  7830. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7831. (* push engine boolean *)
  7832. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7833. (* allocate *)
  7834. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7835. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7836. (* l.op contains address of pointer to record *)
  7837. ToMemory(l.op,addressType,0);
  7838. (* l.op contains value of pointer to record *)
  7839. InitFields(baseType, l.op,0);
  7840. (* add capabilities *)
  7841. modifier := p0(SyntaxTree.Designator).modifiers;
  7842. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7843. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7844. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7845. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7846. END;
  7847. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7848. (*
  7849. modifier := baseType(SyntaxTree.CellType).modifiers;
  7850. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7851. modifier := p0(SyntaxTree.Designator).modifiers;
  7852. *)
  7853. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7854. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7855. (* l.op contains address of pointer to record *)
  7856. ToMemory(l.op,addressType,0);
  7857. (* l.op contains value of pointer to record *)
  7858. Emit(Push(position,l.op)); (* address for use after syscall *)
  7859. ReleaseOperand(l);
  7860. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7861. prevScope := currentScope;
  7862. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7863. previous := section;
  7864. section := init;
  7865. (* add ports *)
  7866. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7867. CloseInitializer(previous);
  7868. currentScope := prevScope;
  7869. Symbol(temporaryVariable,l);
  7870. ToMemory(l.op,addressType,0);
  7871. Emit(Push(position,l.op));
  7872. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7873. (*
  7874. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7875. IF constructor # NIL THEN
  7876. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7877. FOR i := 1 TO x.parameters.Length()-1 DO
  7878. p := x.parameters.GetExpression(i);
  7879. Global.GetSymbolName(parameter,name);
  7880. Evaluate(p, value);
  7881. ASSERT(value.type # NIL);
  7882. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7883. par := instance.AddParameter(name);
  7884. par.SetInteger(value.integer);
  7885. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7886. par := instance.AddParameter(name);
  7887. par.SetBoolean(value.boolean);
  7888. ELSE Error(x.position,NotYetImplemented)
  7889. END;
  7890. parameter := parameter.nextParameter
  7891. END;
  7892. END;
  7893. *)
  7894. (* call initializer *)
  7895. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7896. IF constructor # NIL THEN
  7897. (*! should be unified with ProcedureCallDesignator *)
  7898. IF backend.cellsAreObjects THEN
  7899. Symbol(temporaryVariable,l);
  7900. ToMemory(l.op,addressType,0);
  7901. Emit(Push(position,l.op));
  7902. ReleaseOperand(l);
  7903. END;
  7904. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7905. FOR i := firstPar TO x.parameters.Length()-1 DO
  7906. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7907. formalParameter := formalParameter.nextParameter;
  7908. END;
  7909. (* static call of the constructor *)
  7910. Global.GetSymbolSegmentedName(constructor,name);
  7911. ASSERT(~constructor.isInline);
  7912. IF constructor.scope.ownerModule # module.module THEN
  7913. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7914. ELSE
  7915. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7916. END;
  7917. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7918. (*ELSE
  7919. ReleaseIntermediateOperand(pointer);*)
  7920. END;
  7921. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7922. ToMemory(l.op, addressType, 0);
  7923. Designate(p0,s0);
  7924. ToMemory(s0.op,addressType,0);
  7925. Emit(Mov(position,s0.op,l.op));
  7926. ReleaseOperand(l);
  7927. ReleaseOperand(s0);
  7928. result.tag := emptyOperand;
  7929. (* start *)
  7930. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7931. (* push cell *)
  7932. Symbol(temporaryVariable, l);
  7933. ToMemory(l.op,addressType,0);
  7934. Emit(Push(Basic.invalidPosition,l.op));
  7935. (* push delegate *)
  7936. Emit(Push(Basic.invalidPosition,l.op));
  7937. ReleaseOperand(l);
  7938. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7939. Emit(Push(position, s1.op));
  7940. ReleaseOperand(s1);
  7941. CallThis(position,"ActiveCellsRuntime","Start",3);
  7942. END;
  7943. (*IF temporaryVariable # NIL THEN
  7944. end := NewLabel();
  7945. BrL(end);
  7946. SetLabel(exit);
  7947. Designate(p0,l);
  7948. ToMemory(l.op,addressType,0);
  7949. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7950. ReleaseOperand(l);
  7951. SetLabel(end);
  7952. ELSE
  7953. SetLabel(exit);
  7954. END;
  7955. *)
  7956. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7957. ELSE (* no pointer to record, no pointer to array *)
  7958. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7959. (* ignore new statement *)
  7960. Warning(p0.position, "cannot run on final hardware");
  7961. ELSE
  7962. HALT(200);
  7963. END;
  7964. END;
  7965. (* ---- ADDRESSOF----- *)
  7966. |Global.systemAdr:
  7967. Designate(p0,s0);
  7968. s0.mode := ModeValue;
  7969. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7970. ReleaseIntermediateOperand(s0.op);
  7971. s0.op := s0.tag;
  7972. IntermediateCode.InitOperand(s0.tag);
  7973. END;
  7974. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7975. result := s0;
  7976. (* ---- BIT ----- *)
  7977. |Global.systemBit:
  7978. Evaluate(p0,s0);
  7979. ToMemory(s0.op,addressType,0);
  7980. ReuseCopy(res,s0.op);
  7981. ReleaseOperand(s0);
  7982. Evaluate(p1,s1);
  7983. Emit(Ror(position,res,res,s1.op));
  7984. ReleaseOperand(s1);
  7985. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7986. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7987. IF ~conditional THEN
  7988. InitOperand(result,ModeValue); result.op := res;
  7989. ELSE
  7990. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7991. BrL(falseLabel);
  7992. ReleaseIntermediateOperand(res);
  7993. END;
  7994. (* --- MSK ----*)
  7995. |Global.systemMsk:
  7996. Evaluate(p0,s0);
  7997. Evaluate(p1,s1);
  7998. ReuseCopy(res,s0.op);
  7999. ReleaseOperand(s0);
  8000. Emit(And(position,res,res,s1.op));
  8001. ReleaseOperand(s1);
  8002. InitOperand(result,ModeValue);
  8003. result.op := res;
  8004. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8005. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8006. Evaluate(p0,s0);
  8007. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8008. ReleaseOperand(s0);
  8009. InitOperand(result,ModeValue);
  8010. result.op := res;
  8011. (* ---- SYSTEM.GetStackPointer ----- *)
  8012. |Global.systemGetStackPointer:
  8013. InitOperand(result,ModeValue);
  8014. result.op := sp;
  8015. (* ---- SYSTEM.GetFramePointer ----- *)
  8016. |Global.systemGetFramePointer:
  8017. InitOperand(result,ModeValue);
  8018. result.op := fp;
  8019. (* ---- SYSTEM.GetActivity ----- *)
  8020. |Global.systemGetActivity:
  8021. ASSERT(backend.cooperative);
  8022. InitOperand(result,ModeValue);
  8023. result.op := ap;
  8024. (* ---- SYSTEM.SetStackPointer ----- *)
  8025. |Global.systemSetStackPointer:
  8026. Evaluate(p0,s0); (* *)
  8027. Emit(Mov(position,sp,s0.op));
  8028. ReleaseOperand(s0);
  8029. (* ---- SYSTEM.SetFramePointer ----- *)
  8030. |Global.systemSetFramePointer:
  8031. Evaluate(p0,s0); (* *)
  8032. Emit(Mov(position,fp,s0.op));
  8033. ReleaseOperand(s0);
  8034. (* ---- SYSTEM.Activity ----- *)
  8035. |Global.systemSetActivity:
  8036. ASSERT(backend.cooperative);
  8037. Evaluate(p0,s0); (* *)
  8038. Emit(Mov(position,ap,s0.op));
  8039. ReleaseOperand(s0);
  8040. (* ---- SYSTEM.VAL ----- *)
  8041. |Global.systemVal:
  8042. Expression(p1);
  8043. s1 := result;
  8044. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8045. IF s1.mode = ModeReference THEN
  8046. (* nothing to be done if not record type, just take over new type *)
  8047. IF (type IS SyntaxTree.RecordType) THEN
  8048. ReleaseIntermediateOperand(s1.tag);
  8049. s1.tag := TypeDescriptorAdr(type);
  8050. IF ~newObjectFile THEN
  8051. IntermediateCode.MakeMemory(s1.tag,addressType);
  8052. END;
  8053. UseIntermediateOperand(s1.tag);
  8054. END;
  8055. result := s1;
  8056. ELSE (* copy over result to different type, may not use convert *)
  8057. itype := IntermediateCode.GetType(system,type);
  8058. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8059. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8060. Emit(Mov(position,s0.op,s1.op));
  8061. ReleaseOperand(s1);
  8062. InitOperand(result,ModeValue);
  8063. result.op := s0.op;
  8064. ELSE (* different size, must convert *)
  8065. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8066. Convert(s1.op, IntermediateCode.GetType(system,type));
  8067. result := s1;
  8068. END;
  8069. END;
  8070. (* ---- SYSTEM.GET ----- *)
  8071. |Global.systemGet:
  8072. Evaluate(p0,s0); (* adr *)
  8073. Designate(p1,s1); (* variable *)
  8074. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8075. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8076. Emit(Mov(position,s1.op,s0.op));
  8077. ReleaseOperand(s1);
  8078. ReleaseOperand(s0);
  8079. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8080. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8081. Evaluate(p0,s0); (* *)
  8082. Evaluate(p1,s1); (* variable *)
  8083. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8084. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8085. (* real part *)
  8086. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8087. Emit(Mov(position,res, s1.op));
  8088. ReleaseIntermediateOperand(res);
  8089. (* imaginary part *)
  8090. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8091. Emit(Mov(position,res, s1.tag));
  8092. ReleaseIntermediateOperand(res);
  8093. ReleaseOperand(s1);
  8094. ReleaseOperand(s0);
  8095. ELSE
  8096. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8097. ReleaseOperand(s0);
  8098. Emit(Mov(position,res,s1.op));
  8099. ReleaseIntermediateOperand(res);
  8100. ReleaseOperand(s1);
  8101. END;
  8102. (* ---- SYSTEM.MOVE ----- *)
  8103. |Global.systemMove:
  8104. Evaluate(p0,s0);
  8105. Evaluate(p1,s1);
  8106. Evaluate(p2,s2);
  8107. Emit(Copy(position,s1.op,s0.op,s2.op));
  8108. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8109. (* ---- SYSTEM.NEW ----- *)
  8110. |Global.systemNew:
  8111. Designate(p0,s0);
  8112. Emit(Push(position,s0.op));
  8113. ReleaseOperand(s0);
  8114. Evaluate(p1,s1);
  8115. Emit(Push(position,s1.op));
  8116. ReleaseOperand(s1);
  8117. (* push realtime flag: false by default *)
  8118. Emit(Push(position,false));
  8119. CallThis(position,"Heaps","NewSys",3);
  8120. (* ---- SYSTEM.CALL ----- *)
  8121. |Global.systemRef:
  8122. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8123. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8124. s0.mode := ModeValue;
  8125. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8126. result := s0
  8127. (* ---- INCR ----- *)
  8128. |Global.Incr:
  8129. Designate(p0,operand);
  8130. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8131. Dereference(operand,p0.type.resolved,FALSE);
  8132. END;
  8133. ASSERT(p1 # NIL);
  8134. Evaluate(p1,l);
  8135. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8136. ReleaseOperand(operand); ReleaseOperand(l);
  8137. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8138. (* ---- SUM ----- *)
  8139. |Global.Sum: HALT(200);
  8140. (* ---- ALL ----- *)
  8141. |Global.All: HALT(200);
  8142. (* ---- CAS ----- *)
  8143. |Global.Cas:
  8144. needsTrace := p0.NeedsTrace();
  8145. IF needsTrace THEN ModifyAssignments(true) END;
  8146. Designate(p0,s0);
  8147. Evaluate(p1,s1);
  8148. Evaluate(p2,s2);
  8149. IF needsTrace THEN
  8150. Emit(Push(position, s0.op));
  8151. Emit(Push(position, s1.op));
  8152. Emit(Push(position, s2.op));
  8153. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8154. ELSE
  8155. Emit(Cas(position,s0.op,s1.op,s2.op));
  8156. END;
  8157. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8158. IF needsTrace THEN ModifyAssignments(false) END;
  8159. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8160. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8161. IF conditional THEN
  8162. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8163. BrL(falseLabel);
  8164. ReleaseIntermediateOperand(res);
  8165. END;
  8166. (* ---- DIM ----- *)
  8167. |Global.Dim:
  8168. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8169. Designate(p0,s0);
  8170. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8171. Dereference(s0,p0.type.resolved,FALSE);
  8172. END;
  8173. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8174. ReleaseOperand(s0);
  8175. (* ---- RESHAPE ----- *)
  8176. |Global.Reshape:
  8177. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8178. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8179. left.SetType(procedure.type);
  8180. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8181. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8182. END;
  8183. (* ---- SYSTEM.TYPECODE ----- *)
  8184. |Global.systemTypeCode:
  8185. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8186. IF type.resolved IS SyntaxTree.PointerType THEN
  8187. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8188. END;
  8189. result.op := TypeDescriptorAdr(type);
  8190. IF ~newObjectFile THEN
  8191. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8192. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8193. END;
  8194. result.mode := ModeValue;
  8195. (* ---- SYSTEM.TRACE ----- *)
  8196. |Global.systemTrace:
  8197. SystemTrace(x.parameters, x.position);
  8198. (* ----- CONNECT ------*)
  8199. |Global.Connect:
  8200. IF backend.cellsAreObjects THEN
  8201. PushPort(p0);
  8202. PushPort(p1);
  8203. IF p2 # NIL THEN
  8204. Evaluate(p2, s2);
  8205. Emit(Push(p2.position, s2.op));
  8206. ReleaseOperand(s2);
  8207. ELSE
  8208. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8209. END;
  8210. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8211. ELSE
  8212. Warning(x.position, "cannot run on final hardware");
  8213. END;
  8214. (* ----- DELEGATE ------*)
  8215. |Global.Delegate:
  8216. IF backend.cellsAreObjects THEN
  8217. PushPort(p0);
  8218. PushPort(p1);
  8219. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8220. ELSE
  8221. Warning(x.position, "cannot run on final hardware");
  8222. END;
  8223. (* ----- SEND ------*)
  8224. |Global.Send:
  8225. Evaluate(p0,s0);
  8226. Evaluate(p1,s1);
  8227. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8228. Emit(Push(position,s0.op));
  8229. Emit(Push(position,s1.op));
  8230. (*
  8231. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8232. *)
  8233. IF ~backend.cellsAreObjects THEN
  8234. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8235. END;
  8236. ReleaseOperand(s0);
  8237. ReleaseOperand(s1);
  8238. IF backend.cellsAreObjects THEN
  8239. CallThis(position,"ActiveCellsRuntime","Send",2);
  8240. ELSE
  8241. CallThis(position,ChannelModuleName,"Send",2);
  8242. END;
  8243. (* ----- RECEIVE ------*)
  8244. |Global.Receive:
  8245. Evaluate(p0,s0);
  8246. Emit(Push(position,s0.op));
  8247. Designate(p1,s1);
  8248. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8249. Emit(Push(position,s1.op));
  8250. IF p2 # NIL THEN
  8251. Designate(p2,s2);
  8252. Emit(Push(position,s2.op));
  8253. END;
  8254. (*
  8255. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8256. *)
  8257. IF ~backend.cellsAreObjects THEN
  8258. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8259. END;
  8260. ReleaseOperand(s0);
  8261. ReleaseOperand(s1);
  8262. ReleaseOperand(s2);
  8263. IF backend.cellsAreObjects THEN
  8264. IF p2 = NIL THEN
  8265. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8266. ELSE
  8267. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8268. END;
  8269. ELSE
  8270. IF p2 = NIL THEN
  8271. CallThis(position,ChannelModuleName,"Receive",2)
  8272. ELSE
  8273. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8274. END;
  8275. END;
  8276. | Global.systemSpecial:
  8277. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8278. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8279. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8280. (* determine if parameters are of the VAR kind *)
  8281. ASSERT(x.parameters.Length() <= 3);
  8282. formalParameter := procedureType.firstParameter;
  8283. FOR i := 0 TO x.parameters.Length() - 1 DO
  8284. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8285. formalParameter := formalParameter.nextParameter
  8286. END;
  8287. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8288. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8289. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8290. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8291. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8292. IF procedureType.returnType # NIL THEN
  8293. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8294. Emit(Result(position, res));
  8295. (*InitOperand(result,ModeValue);
  8296. result.op := res;
  8297. *)
  8298. IF ~conditional THEN
  8299. InitOperand(result,ModeValue); result.op := res;
  8300. ELSE
  8301. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8302. BrL(falseLabel);
  8303. ReleaseIntermediateOperand(res);
  8304. END;
  8305. END
  8306. ELSE (* function not yet implemented *)
  8307. Error(position,"not yet implemented");
  8308. END;
  8309. destination := dest;
  8310. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8311. END VisitBuiltinCallDesignator;
  8312. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8313. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8314. BEGIN
  8315. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8316. dest := destination; destination := emptyOperand;
  8317. Expression(x.left);
  8318. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8319. ELSIF isUnchecked THEN (* no check *)
  8320. ELSE
  8321. trueL := NewLabel();
  8322. falseL := NewLabel();
  8323. IF IsPointerToRecord(x.left.type,recordType) THEN
  8324. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8325. Emit(Mov(position,tag, result.op));
  8326. IF result.mode # ModeValue THEN
  8327. ptr := tag;
  8328. IntermediateCode.MakeMemory(ptr,addressType);
  8329. Emit(Mov(position,tag, ptr));
  8330. END;
  8331. IF ~backend.cooperative THEN
  8332. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8333. END;
  8334. IntermediateCode.MakeMemory(tag,addressType);
  8335. ELSE
  8336. tag := result.tag;
  8337. UseIntermediateOperand(tag);
  8338. END;
  8339. TypeTest(tag,x.type,trueL,falseL);
  8340. ReleaseIntermediateOperand(tag);
  8341. SetLabel(falseL);
  8342. EmitTrap(position,TypeCheckTrap);
  8343. SetLabel(trueL);
  8344. END;
  8345. destination := dest;
  8346. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8347. END VisitTypeGuardDesignator;
  8348. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8349. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8350. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8351. VAR label: Label; pc: LONGINT;
  8352. BEGIN
  8353. IF backend.cooperative & ~isUnchecked THEN
  8354. pc := section.pc;
  8355. label := NewLabel();
  8356. BrneL(label, operand.op, nil);
  8357. EmitTrap(position, NilPointerTrap);
  8358. SetLabel(label);
  8359. INC(statCoopNilCheck, section.pc - pc);
  8360. END;
  8361. END NilCheck;
  8362. BEGIN
  8363. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8364. ReuseCopy(dereferenced,operand.op);
  8365. ReleaseOperand(operand);
  8366. operand.mode := ModeReference;
  8367. operand.op := dereferenced;
  8368. operand.tag := dereferenced;
  8369. UseIntermediateOperand(operand.tag);
  8370. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8371. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8372. ReleaseIntermediateOperand(operand.tag);
  8373. operand.tag := TypeDescriptorAdr(type);
  8374. IF ~newObjectFile THEN
  8375. IntermediateCode.MakeMemory(operand.tag,addressType);
  8376. END;
  8377. ELSE
  8378. IF ~backend.cooperative THEN
  8379. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8380. END;
  8381. IntermediateCode.MakeMemory(operand.tag,addressType);
  8382. END;
  8383. NilCheck(operand.op);
  8384. ELSIF type IS SyntaxTree.ArrayType THEN
  8385. IF isUnsafe THEN
  8386. NilCheck(operand.op);
  8387. ReleaseIntermediateOperand(operand.tag);
  8388. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8389. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8390. ELSE
  8391. operand.tag := emptyOperand;
  8392. END;
  8393. ELSE
  8394. NilCheck(operand.op);
  8395. IF backend.cooperative THEN
  8396. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8397. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8398. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8399. ELSE
  8400. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8401. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8402. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8403. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8404. END;
  8405. END;
  8406. ELSIF type IS SyntaxTree.MathArrayType THEN
  8407. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8408. IntermediateCode.MakeMemory(operand.op,addressType);
  8409. ELSE HALT(100);
  8410. END;
  8411. END Dereference;
  8412. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8413. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8414. BEGIN
  8415. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8416. dest := destination; destination := emptyOperand;
  8417. Evaluate(x.left,d);
  8418. type := x.type.resolved;
  8419. prevIsUnchecked := isUnchecked;
  8420. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8421. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8422. END;
  8423. Dereference(d,type,IsUnsafePointer(x.left.type));
  8424. isUnchecked := prevIsUnchecked;
  8425. result := d;
  8426. 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
  8427. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8428. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8429. END;
  8430. END;
  8431. destination := dest;
  8432. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8433. END VisitDereferenceDesignator;
  8434. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8435. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8436. BEGIN
  8437. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8438. dest := destination; destination := emptyOperand;
  8439. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8440. tag := result.op;
  8441. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8442. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8443. StaticCallOperand(result,procedure.super);
  8444. ReleaseIntermediateOperand(result.tag);
  8445. UseIntermediateOperand(tag); (* necessary ? *)
  8446. result.tag := tag;
  8447. destination := dest;
  8448. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8449. END VisitSupercallDesignator;
  8450. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8451. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8452. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8453. name: Basic.SegmentedName;
  8454. procedure: SyntaxTree.Procedure;
  8455. procedureType: SyntaxTree.ProcedureType;
  8456. BEGIN
  8457. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8458. dest := destination; destination := emptyOperand;
  8459. scope := currentScope;
  8460. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8461. scope := scope.outerScope;
  8462. END;
  8463. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8464. IF newObjectFile THEN
  8465. moduleSection := meta.ModuleSection();
  8466. IF backend.cooperative THEN
  8467. moduleOffset := 0;
  8468. ELSE
  8469. moduleOffset := moduleSection.pc;
  8470. END;
  8471. result.mode := ModeValue;
  8472. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8473. ELSE
  8474. Symbol(moduleSelf,result);
  8475. IntermediateCode.MakeMemory(result.op,addressType);
  8476. END
  8477. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8478. result.mode := ModeValue;
  8479. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8480. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8481. ELSE
  8482. GetBaseRegister(basereg,currentScope,scope);
  8483. InitOperand(result,ModeReference);
  8484. result.op := basereg;
  8485. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8486. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8487. parametersSize := ProcedureParametersSize(system,procedure);
  8488. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8489. IF backend.cooperative THEN
  8490. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8491. END;
  8492. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8493. MakeMemory(result.op, result.op, addressType, 0);
  8494. END;
  8495. (* tag must be loaded when dereferencing SELF pointer *)
  8496. END;
  8497. destination := dest;
  8498. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8499. END VisitSelfDesignator;
  8500. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8501. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8502. BEGIN
  8503. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8504. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8505. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8506. parameter := procedureType.returnParameter;
  8507. IF currentIsInline THEN
  8508. map := currentMapper.Get(NIL);
  8509. IF map # NIL THEN
  8510. Designate(map.to, result);
  8511. ELSE
  8512. HALT(200);
  8513. END;
  8514. RETURN;
  8515. END;
  8516. VisitParameter(parameter);
  8517. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8518. END VisitResultDesignator;
  8519. (** values *)
  8520. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8521. BEGIN
  8522. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8523. IF conditional THEN
  8524. IF x.value THEN BrL(trueLabel)
  8525. ELSE BrL(falseLabel)
  8526. END;
  8527. ELSE
  8528. InitOperand(result,ModeValue);
  8529. IF x.value THEN result.op := true ELSE result.op := false END;
  8530. END;
  8531. END VisitBooleanValue;
  8532. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8533. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8534. BEGIN
  8535. Global.GetModuleSegmentedName(module.module, name);
  8536. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8537. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8538. RETURN section
  8539. END GetDataSection;
  8540. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8541. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8542. BEGIN
  8543. type := vop.type;
  8544. data := GetDataSection();
  8545. pc := EnterImmediate(data,vop);
  8546. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8547. IntermediateCode.MakeMemory(vop, type);
  8548. END GetImmediateMem;
  8549. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8550. BEGIN
  8551. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8552. InitOperand(result,ModeValue);
  8553. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8554. IF ~supportedImmediate(result.op) &~inData THEN
  8555. GetImmediateMem(result.op)
  8556. END;
  8557. END VisitIntegerValue;
  8558. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8559. BEGIN
  8560. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8561. InitOperand(result,ModeValue);
  8562. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8563. END VisitCharacterValue;
  8564. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8565. BEGIN
  8566. IF Trace THEN TraceEnter("VisitSetValue") END;
  8567. InitOperand(result,ModeValue);
  8568. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8569. END VisitSetValue;
  8570. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8571. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8572. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8573. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8574. BEGIN
  8575. numberElements := x.elements.Length();
  8576. FOR i := 0 TO numberElements-1 DO
  8577. expression := x.elements.GetExpression(i);
  8578. IF expression IS SyntaxTree.MathArrayExpression THEN
  8579. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8580. ELSE
  8581. inData := TRUE;
  8582. Evaluate(expression,op);
  8583. irv.Emit(Data(position,op.op));
  8584. inData := FALSE;
  8585. ReleaseOperand(op);
  8586. END;
  8587. END;
  8588. END RecursiveData;
  8589. BEGIN
  8590. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8591. IF ~TryConstantDeclaration() THEN
  8592. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8593. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8594. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8595. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8596. ELSE
  8597. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8598. END;
  8599. RecursiveData(x.array);
  8600. InitOperand(result,ModeReference);
  8601. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8602. END
  8603. END VisitMathArrayValue;
  8604. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8605. VAR constant: Sections.Section;
  8606. BEGIN
  8607. IF constantDeclaration = NIL THEN
  8608. RETURN FALSE
  8609. ELSE
  8610. (* Is a constant in this module: did we generate it already? *)
  8611. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8612. IF constant # NIL THEN
  8613. InitOperand(result,ModeReference);
  8614. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8615. RETURN TRUE;
  8616. END;
  8617. END;
  8618. RETURN FALSE
  8619. END TryConstantDeclaration;
  8620. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8621. BEGIN
  8622. constantDeclaration := x;
  8623. x.value.resolved.Accept(SELF);
  8624. END VisitConstant;
  8625. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8626. BEGIN
  8627. IF Trace THEN TraceEnter("VisitRealValue") END;
  8628. InitOperand(result,ModeValue);
  8629. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8630. END VisitRealValue;
  8631. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8632. VAR
  8633. componentType: SyntaxTree.Type;
  8634. BEGIN
  8635. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8636. ASSERT(x.type IS SyntaxTree.ComplexType);
  8637. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8638. InitOperand(result,ModeValue);
  8639. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8640. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8641. END VisitComplexValue;
  8642. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8643. VAR i: LONGINT; name: Basic.SegmentedName;
  8644. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8645. BEGIN
  8646. IF Trace THEN TraceEnter("VisitStringValue") END;
  8647. IF ~TryConstantDeclaration() THEN
  8648. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8649. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8650. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8651. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8652. ELSE
  8653. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8654. END;
  8655. FOR i := 0 TO x.length-1 DO
  8656. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8657. irv.Emit(Data(position,op));
  8658. END;
  8659. InitOperand(result,ModeReference);
  8660. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8661. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8662. END
  8663. END VisitStringValue;
  8664. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8665. BEGIN
  8666. IF Trace THEN TraceEnter("VisitNilValue") END;
  8667. InitOperand(result,ModeValue);
  8668. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8669. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8670. END VisitNilValue;
  8671. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8672. BEGIN
  8673. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8674. InitOperand(result,ModeValue);
  8675. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8676. END VisitEnumerationValue;
  8677. (** symbols *)
  8678. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8679. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8680. END VisitImport;
  8681. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8682. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8683. BEGIN
  8684. IF scope # baseScope THEN
  8685. (* left := [fp+8] *)
  8686. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8687. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8688. ReuseCopy(left,right);
  8689. ReleaseIntermediateOperand(right);
  8690. scope := scope.outerScope; DEC(level);
  8691. (* { left := [left+8] } *)
  8692. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8693. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8694. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8695. Emit(Mov(position,left,right));
  8696. scope := scope.outerScope; DEC(level);
  8697. END;
  8698. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8699. result := left;
  8700. ELSE
  8701. result := fp;
  8702. END;
  8703. END GetBaseRegister;
  8704. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8705. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8706. BEGIN
  8707. IF Trace THEN TraceEnter("VisitVariable"); END;
  8708. type := x.type.resolved;
  8709. IF (x.useRegister) THEN
  8710. InitOperand(result, ModeValue);
  8711. IF x.registerNumber < 0 THEN
  8712. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8713. reg := x.registerNumber;
  8714. ELSE
  8715. reg := registerUsageCount.Map(x.registerNumber);
  8716. UseRegister(reg);
  8717. END;
  8718. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8719. ELSIF x.externalName # NIL THEN
  8720. InitOperand(result,ModeReference);
  8721. Basic.ToSegmentedName(x.externalName^, name);
  8722. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8723. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8724. InitOperand(result,ModeReference);
  8725. GetBaseRegister(result.op,currentScope,x.scope);
  8726. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8727. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8728. InitOperand(result,ModeReference);
  8729. GetCodeSectionNameForSymbol(x,name);
  8730. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8731. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8732. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8733. InitOperand(result,ModeReference);
  8734. GetCodeSectionNameForSymbol(x,name);
  8735. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8736. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8737. ELSE (* field, left designator must have been emitted *)
  8738. ASSERT(result.mode = ModeReference);
  8739. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8740. ReuseCopy(temp,result.op);
  8741. ReleaseIntermediateOperand(result.op);
  8742. result.op := temp;
  8743. END;
  8744. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8745. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8746. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8747. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8748. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8749. END;
  8750. END;
  8751. END;
  8752. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8753. ValueToCondition(result);
  8754. ELSIF type IS SyntaxTree.ProcedureType THEN
  8755. ReleaseIntermediateOperand(result.tag);
  8756. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8757. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8758. UseIntermediateOperand(result.tag);
  8759. ELSE
  8760. result.tag := nil; (* nil *)
  8761. END;
  8762. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8763. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8764. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8765. ReleaseIntermediateOperand(result.tag);
  8766. Global.GetSymbolSegmentedName(x,name);
  8767. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8768. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8769. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8770. ELSE
  8771. END;
  8772. ELSE
  8773. ReleaseIntermediateOperand(result.tag);
  8774. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8775. END;
  8776. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8777. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8778. ReleaseIntermediateOperand(result.tag);
  8779. result.tag := result.op;
  8780. UseIntermediateOperand(result.tag);
  8781. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8782. IntermediateCode.MakeMemory(result.op,addressType);
  8783. END;
  8784. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8785. ReleaseIntermediateOperand(result.tag);
  8786. result.tag := TypeDescriptorAdr(type);
  8787. IF ~newObjectFile THEN
  8788. IntermediateCode.MakeMemory(result.tag,addressType);
  8789. END;
  8790. UseIntermediateOperand(result.tag);
  8791. (* tag for pointer type computed not here but during dereferencing *)
  8792. END;
  8793. IF Trace THEN TraceExit("VisitVariable") END;
  8794. END VisitVariable;
  8795. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8796. BEGIN
  8797. VisitVariable(property);
  8798. END VisitProperty;
  8799. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8800. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8801. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8802. BEGIN
  8803. type := x.type.resolved;
  8804. IF Trace THEN TraceEnter("VisitParameter") END;
  8805. IF x.ownerType IS SyntaxTree.CellType THEN
  8806. ptype := x.type.resolved;
  8807. IF backend.cellsAreObjects THEN
  8808. ASSERT(result.mode = ModeReference);
  8809. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8810. ReuseCopy(temp,result.op);
  8811. ReleaseIntermediateOperand(result.op);
  8812. result.op := temp;
  8813. END;
  8814. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8815. RETURN;
  8816. ELSE
  8817. InitOperand(result,ModeReference);
  8818. GetCodeSectionNameForSymbol(x,name);
  8819. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8820. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8821. RETURN;
  8822. END;
  8823. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8824. InitOperand(result,ModeReference);
  8825. GetCodeSectionNameForSymbol(x,name);
  8826. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8827. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8828. RETURN
  8829. ELSE
  8830. GetBaseRegister(basereg,currentScope,x.scope);
  8831. InitOperand(result,ModeReference);
  8832. result.op := basereg;
  8833. END;
  8834. IF IsOpenArray(type) THEN
  8835. result.tag := basereg;
  8836. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8837. IntermediateCode.MakeMemory(result.op,addressType);
  8838. IF Global.IsOberonProcedure(x.ownerType) THEN
  8839. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8840. UseIntermediateOperand(result.tag);
  8841. ELSE
  8842. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8843. END;
  8844. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8845. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8846. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8847. ELSIF IsStaticArray(type) THEN
  8848. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8849. IntermediateCode.MakeMemory(result.op,addressType);
  8850. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8851. ELSIF type IS SyntaxTree.MathArrayType THEN
  8852. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8853. WITH type: SyntaxTree.MathArrayType DO
  8854. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8855. IF type.form = SyntaxTree.Tensor THEN
  8856. ELSIF type.form = SyntaxTree.Open THEN
  8857. result.tag := result.op;
  8858. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8859. IntermediateCode.MakeMemory(result.op,addressType);
  8860. UseIntermediateOperand(result.tag);
  8861. ELSIF type.form = SyntaxTree.Static THEN
  8862. IF x.kind = SyntaxTree.ConstParameter THEN
  8863. IntermediateCode.MakeMemory(result.op,addressType);
  8864. END;
  8865. ELSE HALT(100)
  8866. END;
  8867. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8868. IF type.form = SyntaxTree.Tensor THEN
  8869. ToMemory(result.op,addressType,0);
  8870. ELSIF type.form = SyntaxTree.Open THEN
  8871. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8872. ReuseCopy(result.tag, mem);
  8873. ReleaseIntermediateOperand(mem);
  8874. ReleaseIntermediateOperand(result.op);
  8875. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8876. ELSIF type.form = SyntaxTree.Static THEN
  8877. IntermediateCode.MakeMemory(result.op,addressType);
  8878. ELSE HALT(100)
  8879. END;
  8880. ELSE HALT(100)
  8881. END;
  8882. END;
  8883. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8884. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8885. IntermediateCode.MakeMemory(result.op,addressType);
  8886. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8887. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8888. END;
  8889. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8890. ValueToCondition(result);
  8891. ELSIF type IS SyntaxTree.ProcedureType THEN
  8892. ReleaseIntermediateOperand(result.tag);
  8893. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8894. IF x.kind = SyntaxTree.VarParameter THEN
  8895. ReuseCopy(result.tag,result.op);
  8896. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8897. IntermediateCode.MakeMemory(result.tag,addressType);
  8898. ELSE
  8899. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8900. UseIntermediateOperand(result.tag);
  8901. END;
  8902. ELSE
  8903. result.tag := nil;
  8904. END;
  8905. (* tag for pointer type computed not here but during dereferencing *)
  8906. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8907. ReleaseIntermediateOperand(result.tag);
  8908. result.tag := basereg;
  8909. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8910. IntermediateCode.MakeMemory(result.tag,addressType);
  8911. UseIntermediateOperand(result.tag);
  8912. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8913. ReleaseIntermediateOperand(result.tag);
  8914. result.tag := TypeDescriptorAdr(type);
  8915. IF ~newObjectFile THEN
  8916. IntermediateCode.MakeMemory(result.tag,addressType);
  8917. END;
  8918. UseIntermediateOperand(result.tag);
  8919. END;
  8920. IF Trace THEN TraceExit("VisitParameter") END;
  8921. END VisitParameter;
  8922. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8923. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8924. BEGIN
  8925. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8926. (* left.p: left already emitted *)
  8927. tag := result.op; (* value of pointer to left *)
  8928. (* get type desc *)
  8929. tmp := result.tag;
  8930. IntermediateCode.MakeMemory(tmp,addressType);
  8931. (* get method adr *)
  8932. Reuse1(reg,tmp);
  8933. ReleaseIntermediateOperand(tmp);
  8934. IF backend.cooperative THEN
  8935. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8936. WHILE recordType.baseType # NIL DO
  8937. recordType := recordType.GetBaseRecord ();
  8938. END;
  8939. GetRecordTypeName (recordType,name);
  8940. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8941. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8942. offset := 0;
  8943. ELSE
  8944. offset := 2;
  8945. END;
  8946. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8947. ELSE
  8948. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8949. END;
  8950. InitOperand(operand,ModeReference);
  8951. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8952. operand.op := reg;
  8953. operand.tag := tag;
  8954. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8955. END DynamicCallOperand;
  8956. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8957. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8958. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8959. BEGIN
  8960. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8961. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8962. tag := operand.op;
  8963. ReleaseIntermediateOperand(operand.tag);
  8964. ELSE tag := nil
  8965. END;
  8966. IF x.isInline THEN
  8967. sectionType := Sections.InlineCodeSection;
  8968. ELSE
  8969. sectionType := Sections.CodeSection;
  8970. END;
  8971. IF x.externalName # NIL THEN
  8972. Basic.ToSegmentedName(x.externalName^, name);
  8973. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8974. ELSE
  8975. GetCodeSectionNameForSymbol(x, name);
  8976. IF (x.scope.ownerModule = module.module) THEN
  8977. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8978. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8979. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8980. IF source.pc = 0 THEN (* no code yet *)
  8981. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8982. END;
  8983. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8984. bits := x.procedureScope.body.code.inlineCode;
  8985. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8986. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8987. binary.CopyBits(bits, 0, bits.GetSize());
  8988. source.SetResolved(binary);
  8989. ELSE
  8990. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8991. END;
  8992. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8993. END;
  8994. InitOperand(operand,ModeValue);
  8995. operand.op := reg;
  8996. operand.tag := tag;
  8997. IF Trace THEN TraceExit("StaticCallOperand") END;
  8998. END StaticCallOperand;
  8999. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  9000. (* handle expressions of the form designator.procedure or procedure *)
  9001. BEGIN
  9002. IF Trace THEN TraceEnter("VisitProcedure") END;
  9003. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9004. DynamicCallOperand(result,x);
  9005. ELSIF x.isInline THEN
  9006. StaticCallOperand(result,x);
  9007. ELSE
  9008. StaticCallOperand(result,x);
  9009. END;
  9010. IF Trace THEN TraceExit("VisitProcedure") END;
  9011. END VisitProcedure;
  9012. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  9013. BEGIN
  9014. VisitProcedure(x);
  9015. END VisitOperator;
  9016. (** statements *)
  9017. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  9018. BEGIN
  9019. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9020. Expression(x.call);
  9021. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9022. ReleaseOperand(result)
  9023. END;
  9024. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9025. END VisitProcedureCallStatement;
  9026. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9027. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9028. leftBase, rightBase: SyntaxTree.Type;
  9029. procedureName,s: SyntaxTree.IdentifierString;
  9030. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9031. size: LONGINT; rightKind: LONGINT;
  9032. dummy: IntermediateCode.Operand;
  9033. CONST moduleName = "FoxArrayBase";
  9034. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9035. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9036. BEGIN
  9037. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9038. IF base IS SyntaxTree.MathArrayType THEN
  9039. base := OpenArray(base(SyntaxTree.MathArrayType));
  9040. END;
  9041. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9042. result.SetArrayBase(base);
  9043. RETURN result
  9044. END OpenArray;
  9045. BEGIN
  9046. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9047. SaveRegisters();ReleaseUsedRegisters(saved);
  9048. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9049. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9050. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9051. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9052. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9053. IF leftType.form = SyntaxTree.Tensor THEN
  9054. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9055. ELSIF leftType.form = SyntaxTree.Open THEN
  9056. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9057. ELSIF leftType.form = SyntaxTree.Static THEN
  9058. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9059. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9060. END;
  9061. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9062. IF procedure = NIL THEN
  9063. s := "Instruction not supported on target, emulation procedure ";
  9064. Strings.Append(s,moduleName);
  9065. Strings.Append(s,".");
  9066. Strings.Append(s,procedureName);
  9067. Strings.Append(s," not present");
  9068. Error(position,s);
  9069. ELSE
  9070. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9071. parameter.SetType(leftType);
  9072. parameter.SetAccess(SyntaxTree.Internal);
  9073. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9074. parameter.SetKind(rightKind);
  9075. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9076. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9077. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9078. StaticCallOperand(result,procedure);
  9079. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9080. ReleaseOperand(result);
  9081. END;
  9082. RestoreRegisters(saved);
  9083. END;
  9084. END AssignMathArray;
  9085. VAR modifyAssignmentCounter := 0: LONGINT;
  9086. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9087. VAR processor,mem,dst: IntermediateCode.Operand;
  9088. BEGIN
  9089. IF value.intValue = true.intValue THEN
  9090. INC(modifyAssignmentCounter);
  9091. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9092. modifyAssignmentsPC := section.pc;
  9093. ELSE
  9094. DEC(modifyAssignmentCounter);
  9095. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9096. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9097. END;
  9098. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9099. dst := NewRegisterOperand (addressType);
  9100. Emit(Mov(position,dst, processor));
  9101. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9102. Emit(Mov(position,mem, value));
  9103. ReleaseIntermediateOperand(dst);
  9104. END ModifyAssignments;
  9105. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9106. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9107. BEGIN
  9108. type := left.type.resolved;
  9109. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9110. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9111. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9112. IF procedureType.returnParameter = parameter THEN
  9113. (* this is the only case where the destination can be dynamically smaller than the source
  9114. in all other cases the dynamic size has to be taken
  9115. *)
  9116. IF backend.cooperative THEN
  9117. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9118. ELSE
  9119. MakeMemory(mem, tag, addressType, 0);
  9120. END;
  9121. RETURN mem;
  9122. END;
  9123. END;
  9124. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9125. END CopySize;
  9126. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9127. VAR
  9128. leftO, rightO: Operand;
  9129. arg,mem, sizeOp: IntermediateCode.Operand;
  9130. leftType, rightType, componentType, base: SyntaxTree.Type;
  9131. size: LONGINT;
  9132. parameters: SyntaxTree.ExpressionList;
  9133. procedure: SyntaxTree.Procedure;
  9134. call: SyntaxTree.ProcedureCallDesignator;
  9135. designator: SyntaxTree.Designator;
  9136. saved: RegisterEntry;
  9137. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9138. VAR procedureType: SyntaxTree.ProcedureType;
  9139. BEGIN
  9140. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9141. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9142. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9143. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9144. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9145. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9146. IF right.id = Global.Reshape THEN RETURN TRUE
  9147. END;
  9148. END;
  9149. END;
  9150. END;
  9151. RETURN FALSE
  9152. END CanPassAsResultParameter;
  9153. BEGIN
  9154. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9155. leftType := left.type.resolved; rightType:= right.type.resolved;
  9156. IF backend.cooperative & left.NeedsTrace() THEN
  9157. ModifyAssignments(true);
  9158. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9159. Designate(right, rightO);
  9160. Designate(left, leftO);
  9161. ASSERT(leftO.mode = ModeReference);
  9162. TransferToRegister(leftO.op, leftO.op);
  9163. TransferToRegister(rightO.op, rightO.op);
  9164. Emit(Push(position, leftO.op));
  9165. Emit(Push(position, rightO.op));
  9166. CallAssignMethod(leftO.op, rightO.op, left.type);
  9167. Emit(Pop(position, rightO.op));
  9168. Emit(Pop(position, leftO.op));
  9169. sizeOp := CopySize(left, leftO.tag);
  9170. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9171. ReleaseIntermediateOperand(sizeOp);
  9172. ReleaseOperand(leftO);
  9173. ReleaseOperand(rightO);
  9174. ELSE
  9175. Evaluate(right,rightO);
  9176. Designate(left,leftO);
  9177. ASSERT(leftO.mode = ModeReference);
  9178. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9179. (* copy procedure address first *)
  9180. MakeMemory(mem,leftO.op,addressType,0);
  9181. Emit(Mov(position,mem,rightO.op));
  9182. ReleaseIntermediateOperand(mem);
  9183. (* copy pointer address *)
  9184. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9185. CallAssignPointer(leftO.tag, rightO.tag);
  9186. ELSE
  9187. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9188. CallAssignPointer(leftO.op, rightO.op);
  9189. END;
  9190. ReleaseOperand(leftO);
  9191. ReleaseOperand(rightO);
  9192. END;
  9193. ModifyAssignments(false);
  9194. RETURN;
  9195. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9196. SaveRegisters();ReleaseUsedRegisters(saved);
  9197. IF SemanticChecker.IsPointerType(leftType) THEN
  9198. Evaluate(right,rightO);
  9199. Designate(left,leftO);
  9200. Emit(Push(position,leftO.op));
  9201. ReleaseOperand(leftO);
  9202. Emit(Push(position,rightO.op));
  9203. ReleaseOperand(rightO);
  9204. CallThis(position,"Heaps","Assign",2);
  9205. ELSIF leftType.IsRecordType() THEN
  9206. Designate(right,rightO);
  9207. Designate(left,leftO);
  9208. Emit(Push(position,leftO.op));
  9209. Emit(Push(position,leftO.tag)); (* type desc *)
  9210. ReleaseOperand(leftO);
  9211. Emit(Push(position,rightO.op));
  9212. ReleaseOperand(rightO);
  9213. CallThis(position,"Heaps","AssignRecord",3);
  9214. ELSIF IsStaticArray(leftType) THEN
  9215. size := StaticArrayNumElements(leftType);
  9216. base := StaticArrayBaseType(leftType);
  9217. Designate(right,rightO);
  9218. Designate(left,leftO);
  9219. Emit(Push(position,leftO.op));
  9220. ReleaseOperand(leftO);
  9221. arg := TypeDescriptorAdr(base);
  9222. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9223. Emit(Push(position,arg));
  9224. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9225. Emit(Push(position,rightO.op));
  9226. ReleaseOperand(rightO);
  9227. CallThis(position,"Heaps","AssignArray",4);
  9228. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9229. size := StaticMathArrayNumElements(leftType);
  9230. base := StaticMathArrayBaseType(leftType);
  9231. Designate(right,rightO);
  9232. Designate(left,leftO);
  9233. Emit(Push(position,leftO.op));
  9234. ReleaseOperand(leftO);
  9235. arg := TypeDescriptorAdr(base);
  9236. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9237. Emit(Push(position,arg));
  9238. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9239. Emit(Push(position,rightO.op));
  9240. ReleaseOperand(rightO);
  9241. CallThis(position,"Heaps","AssignArray",4);
  9242. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9243. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9244. Evaluate(right,rightO);
  9245. Designate(left,leftO);
  9246. MakeMemory(mem,leftO.op,addressType,0);
  9247. Emit(Mov(position,mem,rightO.op));
  9248. ReleaseIntermediateOperand(mem);
  9249. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9250. Emit (Push(position, leftO.tag));
  9251. ReleaseOperand(leftO);
  9252. Emit (Push(position, rightO.tag));
  9253. ReleaseOperand(rightO);
  9254. CallThis(position,"Heaps","Assign", 2);
  9255. ELSE HALT(100); (* missing ? *)
  9256. END;
  9257. RestoreRegisters(saved);
  9258. RETURN;
  9259. END;
  9260. IF CanPassAsResultParameter(right) THEN
  9261. procedureResultDesignator := left(SyntaxTree.Designator);
  9262. Expression(right);
  9263. procedureResultDesignator := NIL;
  9264. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9265. (* left <-- ALIAS OF right: zerocopy *)
  9266. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9267. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9268. designator.SetType(procedure.type);
  9269. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9270. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9271. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9272. END;
  9273. ELSIF leftType IS SyntaxTree.RangeType THEN
  9274. (* LHS is of array range type *)
  9275. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9276. Evaluate(right, rightO);
  9277. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9278. (* first *)
  9279. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9280. Emit(Mov(position,mem, rightO.op));
  9281. ReleaseIntermediateOperand(mem);
  9282. (* last *)
  9283. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9284. Emit(Mov(position,mem, rightO.tag));
  9285. ReleaseIntermediateOperand(mem);
  9286. (* step *)
  9287. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9288. Emit(Mov(position,mem, rightO.extra));
  9289. ReleaseIntermediateOperand(mem);
  9290. ReleaseOperand(rightO);
  9291. ReleaseOperand(leftO)
  9292. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9293. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9294. Evaluate(right, rightO);
  9295. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9296. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9297. (* real part *)
  9298. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9299. Emit(Mov(position,mem, rightO.op));
  9300. ReleaseIntermediateOperand(mem);
  9301. (* imaginary part *)
  9302. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9303. Emit(Mov(position,mem, rightO.tag));
  9304. ReleaseIntermediateOperand(mem);
  9305. ReleaseOperand(rightO);
  9306. ReleaseOperand(leftO)
  9307. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9308. OR (leftType IS SyntaxTree.PortType) THEN
  9309. (* rightO := leftO;*)
  9310. Evaluate(right,rightO);
  9311. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9312. Designate(left,leftO);
  9313. IF leftO.mode = ModeReference THEN
  9314. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9315. destination := mem;
  9316. ELSE
  9317. destination := leftO.op;
  9318. END;
  9319. ReleaseOperand(leftO);
  9320. IF destination.mode # IntermediateCode.Undefined THEN
  9321. Emit(Mov(position,destination,rightO.op));
  9322. END;
  9323. ReleaseOperand(rightO);
  9324. ReleaseIntermediateOperand(mem);
  9325. IntermediateCode.InitOperand(destination);
  9326. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9327. Evaluate(right,rightO);
  9328. Designate(left,leftO);
  9329. MakeMemory(mem,leftO.op,addressType,0);
  9330. Emit(Mov(position,mem,rightO.op));
  9331. ReleaseIntermediateOperand(mem);
  9332. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9333. (* delegate *)
  9334. (*
  9335. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9336. *)
  9337. Emit(Mov(position,leftO.tag,rightO.tag));
  9338. END;
  9339. ReleaseOperand(leftO);
  9340. ReleaseOperand(rightO);
  9341. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9342. Designate(right,rightO);
  9343. Designate(left,leftO);
  9344. sizeOp := CopySize(left, leftO.tag);
  9345. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9346. ReleaseIntermediateOperand(sizeOp);
  9347. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9348. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9349. IF (rightType IS SyntaxTree.StringType) THEN
  9350. CopyString(left,right);
  9351. 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
  9352. Designate(right,rightO);
  9353. Designate(left,leftO);
  9354. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9355. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9356. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9357. ELSE
  9358. HALT(201)
  9359. END;
  9360. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9361. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9362. Designate(right,rightO);
  9363. Designate(left,leftO);
  9364. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9365. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9366. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9367. ELSE
  9368. AssignMathArray(left,right);
  9369. END;
  9370. ELSE
  9371. HALT(200);
  9372. END;
  9373. END Assign;
  9374. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9375. BEGIN
  9376. IF Trace THEN TraceEnter("VisitAssignment") END;
  9377. Assign(x.left,x.right);
  9378. IF Trace THEN TraceExit("VisitAssignment") END;
  9379. END VisitAssignment;
  9380. PROCEDURE EmitCooperativeSwitch;
  9381. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9382. BEGIN
  9383. ASSERT (cooperativeSwitches);
  9384. pc := section.pc;
  9385. IF lastSwitchPC = section.pc THEN RETURN END;
  9386. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9387. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9388. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9389. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9390. INC(statCoopSwitch, section.pc - pc);
  9391. END EmitCooperativeSwitch;
  9392. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9393. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9394. BEGIN
  9395. p0 := communication.left; p1 := communication.right;
  9396. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9397. Evaluate(p0,s0);
  9398. Evaluate(p1,s1);
  9399. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9400. Emit(Push(position,s0.op));
  9401. Emit(Push(position,s1.op));
  9402. (*
  9403. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9404. *)
  9405. IF ~backend.cellsAreObjects THEN
  9406. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9407. END;
  9408. ReleaseOperand(s0);
  9409. ReleaseOperand(s1);
  9410. IF backend.cellsAreObjects THEN
  9411. CallThis(position,"ActiveCellsRuntime","Send",2);
  9412. ELSE
  9413. CallThis(position,ChannelModuleName,"Send",2);
  9414. END;
  9415. (* ----- RECEIVE ------*)
  9416. ELSE
  9417. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9418. tmp := p0; p0 := p1; p1 := tmp;
  9419. END;
  9420. Evaluate(p0,s0);
  9421. Emit(Push(position,s0.op));
  9422. Designate(p1,s1);
  9423. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9424. Emit(Push(position,s1.op));
  9425. (*
  9426. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9427. *)
  9428. IF ~backend.cellsAreObjects THEN
  9429. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9430. END;
  9431. ReleaseOperand(s0);
  9432. ReleaseOperand(s1);
  9433. IF backend.cellsAreObjects THEN
  9434. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9435. ELSE
  9436. CallThis(position,ChannelModuleName,"Receive",2)
  9437. END;
  9438. END;
  9439. END VisitCommunicationStatement;
  9440. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9441. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9442. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9443. VAR true, false: Label; condition, value: BOOLEAN;
  9444. BEGIN
  9445. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9446. IF condition THEN
  9447. true := NewLabel();
  9448. false := NewLabel();
  9449. Condition(if.condition,true,false);
  9450. SetLabel(true);
  9451. StatementSequence(if.statements);
  9452. BrL(end);
  9453. SetLabel(false);
  9454. ELSE
  9455. IF value THEN (* always true *)
  9456. escape := TRUE;
  9457. StatementSequence(if.statements);
  9458. (* no branch necessary -- rest skipped *)
  9459. END;
  9460. END;
  9461. END IfPart;
  9462. BEGIN
  9463. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9464. end := NewLabel();
  9465. elsifs := x.ElsifParts();
  9466. IfPart(x.ifPart);
  9467. FOR i := 0 TO elsifs-1 DO
  9468. IF ~escape THEN
  9469. elsif := x.GetElsifPart(i);
  9470. IfPart(elsif);
  9471. END;
  9472. END;
  9473. IF (x.elsePart # NIL) & ~escape THEN
  9474. StatementSequence(x.elsePart);
  9475. END;
  9476. SetLabel(end);
  9477. IF Trace THEN TraceExit("VisitIfStatement") END;
  9478. END VisitIfStatement;
  9479. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9480. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9481. BEGIN
  9482. (*IF x.variable.type.resolved = x.type.resolved THEN
  9483. (* always true, do nothing *)
  9484. ELSE*)
  9485. Designate(x.variable,res);
  9486. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9487. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9488. END;
  9489. trueL := NewLabel();
  9490. TypeTest(res.tag,x.type,trueL,falseL);
  9491. ReleaseOperand(res);
  9492. SetLabel(trueL);
  9493. StatementSequence(x.statements);
  9494. BrL(endL);
  9495. END WithPart;
  9496. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9497. VAR endL,falseL: Label;i: LONGINT;
  9498. BEGIN
  9499. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9500. endL := NewLabel();
  9501. FOR i := 0 TO x.WithParts()-1 DO
  9502. falseL := NewLabel();
  9503. WithPart(x.GetWithPart(i),falseL,endL);
  9504. SetLabel(falseL);
  9505. END;
  9506. IF x.elsePart = NIL THEN
  9507. IF ~isUnchecked THEN
  9508. EmitTrap(position,WithTrap);
  9509. END;
  9510. ELSE
  9511. StatementSequence(x.elsePart)
  9512. END;
  9513. SetLabel(endL);
  9514. IF Trace THEN TraceExit("VisitWithStatement") END;
  9515. END VisitWithStatement;
  9516. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9517. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9518. out,else: Label; label: Label;
  9519. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9520. symbol: SyntaxTree.Symbol;
  9521. BEGIN
  9522. (*! split case statement into if-elsif statements for large case label lists *)
  9523. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9524. size := x.max-x.min+1;
  9525. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9526. END;
  9527. Evaluate(x.variable,var);
  9528. ReuseCopy(tmp,var.op);
  9529. ReleaseIntermediateOperand(var.op);
  9530. var.op := tmp;
  9531. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9532. Convert(var.op,addressType);
  9533. size := x.max-x.min+1;
  9534. else := NewLabel();
  9535. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9536. (*
  9537. UniqueId(name,module.module,"case",caseId);
  9538. *)
  9539. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9540. Global.GetModuleSegmentedName(module.module, name);
  9541. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9542. symbol := SyntaxTree.NewSymbol(name[1]);
  9543. symbol.SetScope(moduleScope);
  9544. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9545. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9546. section.isCaseTable := TRUE;
  9547. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9548. ReuseCopy(res,var.op);
  9549. ReleaseOperand(var);
  9550. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9551. Emit(Add(position,res,res,jmp));
  9552. IntermediateCode.MakeMemory(res,addressType);
  9553. Emit(Br(position,res));
  9554. ReleaseIntermediateOperand(res);
  9555. out := NewLabel();
  9556. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9557. part := x.GetCasePart(i);
  9558. constant := part.firstConstant;
  9559. label := NewLabel();
  9560. SetLabel(label);
  9561. WHILE(constant # NIL) DO (* case labels for this case part *)
  9562. FOR j := constant.min TO constant.max DO
  9563. fixups[j-x.min] := label;
  9564. END;
  9565. constant := constant.next;
  9566. END;
  9567. StatementSequence(part.statements);
  9568. BrL(out);
  9569. END;
  9570. SetLabel(else);
  9571. FOR i := 0 TO size-1 DO
  9572. IF fixups[i] = NIL THEN
  9573. fixups[i] := else;
  9574. END;
  9575. END;
  9576. IF x.elsePart # NIL THEN
  9577. StatementSequence(x.elsePart);
  9578. ELSIF ~isUnchecked THEN
  9579. EmitTrap(position,CaseTrap);
  9580. END;
  9581. SetLabel(out);
  9582. FOR i := 0 TO size-1 DO
  9583. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9584. section.Emit(Data(position,op));
  9585. END;
  9586. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9587. END VisitCaseStatement;
  9588. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9589. VAR start: Label; true,false: Label;
  9590. BEGIN
  9591. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9592. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9593. start := NewLabel();
  9594. true := NewLabel();
  9595. false := NewLabel();
  9596. SetLabel(start);
  9597. Condition(x.condition,true,false);
  9598. SetLabel(true);
  9599. StatementSequence(x.statements);
  9600. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9601. BrL(start);
  9602. SetLabel(false);
  9603. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9604. END VisitWhileStatement;
  9605. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9606. VAR false,true: Label;
  9607. BEGIN
  9608. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9609. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9610. true := NewLabel();
  9611. false := NewLabel();
  9612. SetLabel(false);
  9613. StatementSequence(x.statements);
  9614. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9615. Condition(x.condition,true,false);
  9616. SetLabel(true);
  9617. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9618. END VisitRepeatStatement;
  9619. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9620. VAR
  9621. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9622. temporaryVariable: SyntaxTree.Variable;
  9623. temporaryVariableDesignator : SyntaxTree.Designator;
  9624. BEGIN
  9625. IF Trace THEN TraceEnter("VisitForStatement") END;
  9626. true := NewLabel();
  9627. false := NewLabel();
  9628. start := NewLabel();
  9629. Assign(x.variable,x.from);
  9630. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9631. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9632. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9633. Assign(temporaryVariableDesignator,x.to);
  9634. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9635. IF by > 0 THEN
  9636. cmp := Scanner.LessEqual
  9637. ELSE
  9638. cmp := Scanner.GreaterEqual
  9639. END;
  9640. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9641. binary.SetType(system.booleanType);
  9642. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9643. SetLabel(start);
  9644. Condition(binary,true,false);
  9645. SetLabel(true);
  9646. StatementSequence(x.statements);
  9647. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9648. binary.SetType(x.variable.type);
  9649. Assign(x.variable,binary);
  9650. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9651. BrL(start);
  9652. SetLabel(false);
  9653. IF Trace THEN TraceExit("VisitForStatement") END;
  9654. END VisitForStatement;
  9655. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9656. VAR prevLoop: Label;
  9657. BEGIN
  9658. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9659. prevLoop := currentLoop;
  9660. currentLoop := NewLabel();
  9661. StatementSequence(x.statements);
  9662. SetLabel(currentLoop);
  9663. currentLoop := prevLoop;
  9664. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9665. END VisitExitableBlock;
  9666. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9667. VAR prevLoop,start: Label;
  9668. BEGIN
  9669. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9670. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9671. start := NewLabel();
  9672. prevLoop := currentLoop;
  9673. SetLabel(start);
  9674. currentLoop := NewLabel();
  9675. StatementSequence(x.statements);
  9676. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9677. BrL(start);
  9678. SetLabel(currentLoop);
  9679. currentLoop := prevLoop;
  9680. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9681. END VisitLoopStatement;
  9682. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9683. VAR outer: SyntaxTree.Statement;
  9684. BEGIN
  9685. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9686. IF locked THEN (* r if we jump out of an exclusive block *)
  9687. outer := x.outer;
  9688. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9689. outer := outer.outer;
  9690. END;
  9691. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9692. Lock(FALSE);
  9693. END;
  9694. END;
  9695. BrL(currentLoop);
  9696. IF Trace THEN TraceExit("VisitExitStatement") END;
  9697. END VisitExitStatement;
  9698. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9699. VAR
  9700. expression, parameterDesignator: SyntaxTree.Expression;
  9701. type, componentType: SyntaxTree.Type;
  9702. res, right: Operand;
  9703. left, mem, reg: IntermediateCode.Operand;
  9704. parameter: SyntaxTree.Parameter;
  9705. procedure: SyntaxTree.Procedure;
  9706. procedureType: SyntaxTree.ProcedureType;
  9707. returnTypeOffset: LONGINT;
  9708. delegate: BOOLEAN;
  9709. map: SymbolMap;
  9710. cc, parametersSize: LONGINT;
  9711. BEGIN
  9712. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9713. expression := x.returnValue;
  9714. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9715. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9716. IF currentIsInline THEN
  9717. IF expression # NIL THEN
  9718. map := currentMapper.Get(NIL);
  9719. IF map # NIL THEN
  9720. Assign(map.to, expression);
  9721. ELSE
  9722. Evaluate(expression,res);
  9723. Emit(Return(position,res.op));
  9724. ReleaseOperand(res);
  9725. END;
  9726. END;
  9727. BrL(currentInlineExit);
  9728. RETURN;
  9729. END;
  9730. IF expression # NIL THEN
  9731. type := expression.type.resolved;
  9732. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9733. IF locked THEN Lock(FALSE) END;
  9734. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9735. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9736. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9737. (* return without structured return parameter *)
  9738. Evaluate(expression,res);
  9739. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9740. IF locked OR profile THEN
  9741. Emit(Push(position,res.op));
  9742. IF delegate THEN HALT(200) END;
  9743. ReleaseOperand(res);
  9744. IF locked THEN Lock(FALSE) END;
  9745. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9746. reg := NewRegisterOperand(res.op.type);
  9747. Emit(Pop(position,reg));
  9748. Emit(Return(position,reg));
  9749. ReleaseIntermediateOperand(reg);
  9750. ELSE
  9751. Emit(Return(position,res.op));
  9752. ReleaseOperand(res);
  9753. END;
  9754. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9755. THEN
  9756. (* return using structured return parameter *)
  9757. 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)
  9758. OR SemanticChecker.IsPointerType(type));
  9759. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9760. parameter :=procedureType.returnParameter;
  9761. ASSERT(parameter # NIL);
  9762. returnTypeOffset := parameter.offsetInBits;
  9763. (*
  9764. IF parameter# NIL THEN
  9765. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9766. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9767. ELSE
  9768. returnTypeOffset := system.offsetFirstParameter
  9769. END;
  9770. *)
  9771. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9772. IF type IS SyntaxTree.RangeType THEN
  9773. (* array range type *)
  9774. Evaluate(expression, right);
  9775. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9776. Emit(Mov(position,mem, right.op)); (* first *)
  9777. ReleaseIntermediateOperand(mem);
  9778. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9779. Emit(Mov(position,mem, right.tag)); (* last *)
  9780. ReleaseIntermediateOperand(mem);
  9781. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9782. Emit(Mov(position,mem, right.extra)); (* step *)
  9783. ReleaseIntermediateOperand(mem);
  9784. ReleaseOperand(right);
  9785. ELSIF type IS SyntaxTree.ComplexType THEN
  9786. Evaluate(expression, right);
  9787. componentType := type(SyntaxTree.ComplexType).componentType;
  9788. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9789. Emit(Mov(position,mem, right.op)); (* real part *)
  9790. ReleaseIntermediateOperand(mem);
  9791. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9792. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9793. ReleaseIntermediateOperand(mem);
  9794. ReleaseOperand(right);
  9795. ELSE (* covers cases: pointer / record / array *)
  9796. parameter := procedureType.returnParameter;
  9797. checker.SetCurrentScope(currentScope);
  9798. ASSERT(parameter # NIL);
  9799. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9800. Assign(parameterDesignator,expression);
  9801. END;
  9802. ReleaseIntermediateOperand(left);
  9803. IF locked THEN Lock(FALSE) END;
  9804. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9805. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9806. parameter := procedureType.returnParameter;
  9807. checker.SetCurrentScope(currentScope);
  9808. IF parameter = NIL THEN
  9809. Error(procedure.position, "structured return of parameter of procedure not found");
  9810. ELSE
  9811. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9812. Assign(parameterDesignator,expression);
  9813. END;
  9814. IF locked THEN Lock(FALSE) END;
  9815. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9816. ELSE
  9817. HALT(200);
  9818. END;
  9819. ELSE
  9820. IF locked THEN Lock(FALSE) END;
  9821. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9822. END;
  9823. IF backend.cooperative THEN
  9824. BrL(exitLabel);
  9825. ELSE
  9826. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9827. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9828. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9829. ELSE
  9830. parametersSize := 0;
  9831. END;
  9832. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9833. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9834. END;
  9835. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9836. END VisitReturnStatement;
  9837. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9838. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9839. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9840. statements: SyntaxTree.StatementSequence;
  9841. name, suffix: SyntaxTree.IdentifierString;
  9842. BEGIN
  9843. Strings.IntToStr(awaitProcCounter,suffix);
  9844. Strings.Concat("@AwaitProcedure",suffix,name);
  9845. identifier := SyntaxTree.NewIdentifier(name);
  9846. INC(awaitProcCounter);
  9847. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9848. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9849. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9850. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9851. procedure.SetAccess(SyntaxTree.Hidden);
  9852. procedure.SetScope(currentScope);
  9853. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9854. procedureType.SetReturnType(system.booleanType);
  9855. procedure.SetType(procedureType);
  9856. body := SyntaxTree.NewBody(x.position,procedureScope);
  9857. procedureScope.SetBody(body);
  9858. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9859. returnStatement.SetReturnValue(x.condition);
  9860. statements := SyntaxTree.NewStatementSequence();
  9861. statements.AddStatement(returnStatement);
  9862. body.SetStatementSequence(statements);
  9863. currentScope.AddProcedure(procedure);
  9864. RETURN procedure
  9865. END MakeAwaitProcedure;
  9866. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9867. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9868. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9869. BEGIN
  9870. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9871. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9872. IF backend.cooperative THEN
  9873. start := NewLabel();
  9874. true := NewLabel();
  9875. false := NewLabel();
  9876. SetLabel(start);
  9877. Condition(x.condition,true,false);
  9878. SetLabel(false);
  9879. PushSelfPointer();
  9880. CallThis(position,"ExclusiveBlocks","Await",1);
  9881. BrL(start);
  9882. SetLabel(true);
  9883. PushSelfPointer();
  9884. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9885. ELSE
  9886. proc := MakeAwaitProcedure(x);
  9887. Emit(Push(position,fp));
  9888. GetCodeSectionNameForSymbol(proc,name);
  9889. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9890. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9891. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9892. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9893. Emit(Result(position,res));
  9894. (*
  9895. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9896. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9897. *)
  9898. InitOperand(result,ModeValue);
  9899. result.op := res;
  9900. label := NewLabel();
  9901. BreqL(label, result.op, SELF.true);
  9902. ReleaseOperand(result);
  9903. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9904. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9905. Emit(Push(position,res));
  9906. Emit(Push(position,fp));
  9907. PushSelfPointer();
  9908. Emit(Push(position,nil));
  9909. CallThis(position,"Objects","Await",4);
  9910. SetLabel(label);
  9911. END;
  9912. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9913. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9914. END VisitAwaitStatement;
  9915. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9916. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9917. BEGIN
  9918. FOR i := 0 TO x.Length() - 1 DO
  9919. statement := x.GetStatement( i );
  9920. Statement(statement);
  9921. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9922. END;
  9923. END StatementSequence;
  9924. PROCEDURE PushSelfPointer;
  9925. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9926. procedureType: SyntaxTree.ProcedureType;
  9927. BEGIN
  9928. scope := currentScope;
  9929. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9930. scope := scope.outerScope;
  9931. END;
  9932. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9933. IF ~newObjectFile THEN
  9934. Symbol(moduleSelf,op);
  9935. IntermediateCode.MakeMemory(op.op,addressType);
  9936. ELSE
  9937. moduleSection := meta.ModuleSection();
  9938. IF backend.cooperative THEN
  9939. moduleOffset := 0;
  9940. ELSE
  9941. moduleOffset := moduleSection.pc;
  9942. END;
  9943. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9944. END;
  9945. ELSE
  9946. GetBaseRegister(op.op,currentScope,scope);
  9947. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9948. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9949. parametersSize := ProcedureParametersSize(system,procedure);
  9950. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9951. IF backend.cooperative THEN
  9952. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9953. END;
  9954. IntermediateCode.MakeMemory(op.op,addressType);
  9955. END;
  9956. Emit(Push(position,op.op));
  9957. ReleaseOperand(op);
  9958. END PushSelfPointer;
  9959. PROCEDURE Lock(lock: BOOLEAN);
  9960. BEGIN
  9961. IF Trace THEN TraceEnter("Lock") END;
  9962. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9963. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9964. ASSERT(modifyAssignmentCounter = 0);
  9965. IF dump # NIL THEN
  9966. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9967. dump.Ln;dump.Update;
  9968. END;
  9969. PushSelfPointer;
  9970. IF backend.cooperative THEN
  9971. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9972. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9973. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9974. END;
  9975. ELSE
  9976. Emit(Push(position,true));
  9977. IF lock THEN CallThis(position,"Objects","Lock",2)
  9978. ELSE CallThis(position,"Objects","Unlock",2);
  9979. END;
  9980. END;
  9981. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9982. IF Trace THEN TraceExit("Lock") END;
  9983. END Lock;
  9984. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9985. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9986. BEGIN
  9987. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9988. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9989. previouslyUnchecked := isUnchecked;
  9990. isUnchecked := isUnchecked OR x.isUnchecked;
  9991. previouslyCooperativeSwitches := cooperativeSwitches;
  9992. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9993. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9994. IF x.statements # NIL THEN
  9995. StatementSequence(x.statements);
  9996. END;
  9997. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9998. isUnchecked := previouslyUnchecked;
  9999. cooperativeSwitches := previouslyCooperativeSwitches;
  10000. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10001. END VisitStatementBlock;
  10002. PROCEDURE VisitCode(x: SyntaxTree.Code);
  10003. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10004. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10005. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10006. procedure: SyntaxTree.Procedure;
  10007. map: SymbolMap;
  10008. cc, parametersSize: LONGINT;
  10009. BEGIN
  10010. scope := currentScope;
  10011. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10012. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10013. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10014. return := emptyOperand;
  10015. IF Trace THEN TraceEnter("VisitCode") END;
  10016. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10017. NEW(in, x.inRules.Length());
  10018. FOR i := 0 TO LEN(in)-1 DO
  10019. statement := x.inRules.GetStatement(i);
  10020. WITH statement: SyntaxTree.Assignment DO
  10021. Evaluate(statement.right, operand);
  10022. result := operand.op;
  10023. NEW(str, 64);
  10024. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10025. in[i] := result; IntermediateCode.SetString(in[i], str);
  10026. ReleaseIntermediateOperand(operand.tag);
  10027. END;
  10028. END;
  10029. ELSE in := NIL
  10030. END;
  10031. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10032. NEW(out, x.outRules.Length());
  10033. FOR i := 0 TO LEN(out)-1 DO
  10034. statement := x.outRules.GetStatement(i);
  10035. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10036. WITH statement: SyntaxTree.Assignment DO
  10037. Designate(statement.left, operand);
  10038. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10039. NEW(str, 64);
  10040. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10041. out[i] := result; IntermediateCode.SetString(out[i], str);
  10042. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10043. |statement: SyntaxTree.ReturnStatement DO
  10044. NEW(str, 64);
  10045. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10046. IF currentIsInline THEN
  10047. map := currentMapper.Get(NIL);
  10048. Designate(map.to, operand);
  10049. IF map.isAddress THEN
  10050. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10051. ELSE
  10052. result := operand.op;
  10053. END;
  10054. (*! only if it does not fit into register
  10055. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10056. *)
  10057. (*Evaluate(map.to, operand);*)
  10058. out[i] := result;
  10059. ELSE
  10060. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10061. END;
  10062. IntermediateCode.SetString(out[i], str);
  10063. ReleaseIntermediateOperand(operand.tag);
  10064. return := out[i];
  10065. ELSE
  10066. END;
  10067. END;
  10068. ELSE out := NIL
  10069. END;
  10070. Emit(Asm(x.position,x.sourceCode, in, out));
  10071. IF in # NIL THEN
  10072. FOR i := 0 TO LEN(in)-1 DO
  10073. ReleaseIntermediateOperand(in[i]);
  10074. END;
  10075. END;
  10076. IF out # NIL THEN
  10077. FOR i := 0 TO LEN(out)-1 DO
  10078. WITH statement: SyntaxTree.Assignment DO
  10079. ReleaseIntermediateOperand(out[i]);
  10080. |statement: SyntaxTree.ReturnStatement DO
  10081. (* release happens below *)
  10082. ELSE
  10083. END;
  10084. statement := x.outRules.GetStatement(i);
  10085. END;
  10086. END;
  10087. IF return.mode # IntermediateCode.Undefined THEN
  10088. IF currentIsInline THEN
  10089. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10090. Symbol(procedureType.returnParameter, par);
  10091. MakeMemory(mem, par.op, return.type, 0);
  10092. ReleaseOperand(par);
  10093. Emit(Mov(position, mem, return));
  10094. ReleaseIntermediateOperand(mem);
  10095. ELSE
  10096. Emit(Return(position,return));
  10097. END;
  10098. ReleaseIntermediateOperand(return);
  10099. IF currentIsInline THEN RETURN END;
  10100. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10101. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10102. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10103. ELSE
  10104. parametersSize := 0;
  10105. END;
  10106. EmitLeave(section, position,procedure, cc);
  10107. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10108. END;
  10109. IF Trace THEN TraceExit("VisitCode") END;
  10110. END VisitCode;
  10111. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10112. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10113. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10114. const, call: IntermediateCode.Operand;
  10115. parameterDesignator: SyntaxTree.Expression;
  10116. saved: RegisterEntry;
  10117. name: Basic.SegmentedName;
  10118. BEGIN
  10119. IF Trace THEN TraceEnter("ParameterCopies") END;
  10120. parameter := x.firstParameter;
  10121. WHILE parameter # NIL DO
  10122. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10123. type := parameter.type.resolved;
  10124. IF IsOpenArray(type) THEN
  10125. VisitParameter(parameter);
  10126. op := result;
  10127. IF backend.cooperative & parameter.NeedsTrace() THEN
  10128. length := GetArrayLength(type, op.tag);
  10129. size := NewRegisterOperand(addressType);
  10130. base := ArrayBaseType(type);
  10131. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10132. Emit(Mul(position, size, length, const));
  10133. dst := NewRegisterOperand (addressType);
  10134. Emit(Mov(position, dst, size));
  10135. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10136. Emit(Sub(position,dst,sp,dst));
  10137. Emit(And(position,dst,dst,const));
  10138. Emit(Mov(position,sp,dst));
  10139. par := fp;
  10140. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10141. IntermediateCode.InitImmediate(null, byteType, 0);
  10142. Emit(Fill(position, dst, size, null));
  10143. ReleaseIntermediateOperand(dst);
  10144. ReleaseIntermediateOperand(length);
  10145. SaveRegisters();ReleaseUsedRegisters(saved);
  10146. (* register dst has been freed before SaveRegisters already *)
  10147. base := ArrayBaseType(type);
  10148. (* assign method of open array *)
  10149. IF base.IsRecordType() THEN
  10150. Emit (Push(position, length));
  10151. Emit (Push(position, dst));
  10152. Emit (Push(position, op.op));
  10153. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10154. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10155. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10156. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10157. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10158. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10159. Emit (Push(position,length));
  10160. Emit (Push(position, dst));
  10161. Emit (Push(position, length));
  10162. Emit (Push(position, op.op));
  10163. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10164. ELSE
  10165. Emit (Push(position, length));
  10166. Emit (Push(position, dst));
  10167. Emit (Push(position, length));
  10168. Emit (Push(position, op.op));
  10169. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10170. ASSERT(ArrayBaseType(type).IsPointer());
  10171. END;
  10172. RestoreRegisters(saved);
  10173. ELSE
  10174. temp := GetDynamicSize(type,op.tag);
  10175. ReuseCopy(size,temp);
  10176. ReleaseIntermediateOperand(temp);
  10177. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10178. Emit(Sub(position,size,sp,size));
  10179. Emit(And(position,size,size,const));
  10180. Emit(Mov(position,sp,size));
  10181. par := fp;
  10182. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10183. ReleaseIntermediateOperand(size);
  10184. size := GetDynamicSize(type,op.tag);
  10185. END;
  10186. Emit(Copy(position,sp,op.op,size));
  10187. ReleaseIntermediateOperand(size);
  10188. ReleaseOperand(op);
  10189. IntermediateCode.MakeMemory(par,addressType);
  10190. Emit(Mov(position,par,sp));
  10191. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10192. checker.SetCurrentScope(currentScope);
  10193. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10194. Assign(parameterDesignator,parameterDesignator);
  10195. END;
  10196. END;
  10197. parameter := parameter.nextParameter;
  10198. END;
  10199. IF Trace THEN TraceExit("ParameterCopies") END;
  10200. END ParameterCopies;
  10201. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10202. VAR x: SyntaxTree.Variable;
  10203. BEGIN
  10204. x := scope.firstVariable;
  10205. WHILE x # NIL DO
  10206. InitVariable(x,FALSE);
  10207. x := x.nextVariable;
  10208. END;
  10209. END InitVariables;
  10210. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10211. BEGIN
  10212. IF (symbol # NIL) THEN
  10213. RETURN fingerPrinter.SymbolFP(symbol).public
  10214. ELSE
  10215. RETURN 0
  10216. END;
  10217. END GetFingerprint;
  10218. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10219. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10220. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10221. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10222. name: Basic.SegmentedName;
  10223. offset: LONGINT;
  10224. BEGIN
  10225. IF Trace THEN TraceEnter("Body") END;
  10226. ReleaseUsedRegisters(saved); (* just in case ... *)
  10227. section := ir;
  10228. exitLabel := NewLabel ();
  10229. IF moduleBody THEN moduleBodySection := section END;
  10230. IF ir.comments # NIL THEN
  10231. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10232. commentPrintout.SingleStatement(TRUE);
  10233. dump := ir.comments;
  10234. ELSE
  10235. commentPrintout := NIL;
  10236. dump := NIL;
  10237. END;
  10238. prevScope := currentScope;
  10239. currentScope := scope;
  10240. lastSwitchPC := 0;
  10241. cooperativeSwitches := backend.cooperative;
  10242. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10243. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10244. IF x # NIL THEN
  10245. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10246. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10247. IF moduleBody THEN
  10248. ProfilerInit();
  10249. ELSE
  10250. Basic.SegmentedNameToString(ir.name, string);
  10251. ProfilerAddProcedure(numberProcedures,string);
  10252. ProfilerEnterExit(numberProcedures,TRUE);
  10253. END;
  10254. END;
  10255. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10256. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10257. END;
  10258. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10259. IF moduleBody & ~newObjectFile THEN
  10260. InitVariables(moduleScope)
  10261. END;
  10262. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10263. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10264. IF procedure = cellScope.bodyProcedure THEN
  10265. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10266. StaticCallOperand(op, cellScope.constructor);
  10267. Emit(Call(position,op.op,0));
  10268. END;
  10269. END;
  10270. END;
  10271. InitVariables(scope);
  10272. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10273. GetCodeSectionNameForSymbol(procedure, name);
  10274. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10275. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10276. IF ProtectModulesPointers THEN
  10277. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10278. ELSE
  10279. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10280. END;
  10281. IntermediateCode.SetOffset(right,offset); (* tag *)
  10282. IntermediateCode.InitMemory(left,addressType,fp,0);
  10283. Emit(Mov(position, left, right));
  10284. END;
  10285. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10286. ParameterCopies(procedureType);
  10287. IF x.code = NIL THEN
  10288. VisitStatementBlock(x);
  10289. ELSE
  10290. VisitCode(x.code)
  10291. END;
  10292. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10293. ir.SetFinally(ir.pc);
  10294. StatementSequence(x.finally)
  10295. END;
  10296. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10297. IF ~backend.cooperative THEN
  10298. ProfilerEnterExit(numberProcedures,FALSE);
  10299. END;
  10300. INC(numberProcedures);
  10301. END;
  10302. END;
  10303. IF backend.cooperative THEN
  10304. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10305. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10306. END;
  10307. IF x # NIL THEN
  10308. SELF.position := x.position;
  10309. END;
  10310. CheckRegistersFree();
  10311. ASSERT(modifyAssignmentCounter = 0);
  10312. currentScope := prevScope;
  10313. IF Trace THEN TraceExit("Body") END;
  10314. END Body;
  10315. END ImplementationVisitor;
  10316. MetaDataGenerator=OBJECT
  10317. VAR
  10318. implementationVisitor: ImplementationVisitor;
  10319. declarationVisitor: DeclarationVisitor;
  10320. module: Sections.Module;
  10321. moduleName: ARRAY 128 OF CHAR;
  10322. moduleNamePool: Basic.HashTableInt;
  10323. moduleNamePoolSection: IntermediateCode.Section;
  10324. modulePointerSection: IntermediateCode.Section;
  10325. modulePointerSizePC: LONGINT;
  10326. modulePointerSectionOffset: LONGINT;
  10327. modulePointers: LONGINT;
  10328. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10329. RecordBaseOffset: LONGINT;
  10330. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10331. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10332. TypeTags: LONGINT; (* type extension level support *)
  10333. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10334. patchInfoPC: LONGINT;
  10335. patchCRC: LONGINT;
  10336. CONST
  10337. EmptyBlockOffset = 2;
  10338. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10339. BEGIN
  10340. IF implementationVisitor.backend.cooperative THEN
  10341. TypeTags := MAX(LONGINT);
  10342. BaseTypesTableOffset := 0;
  10343. MethodTableOffset := 2;
  10344. TypeRecordBaseOffset := 0;
  10345. RecordBaseOffset := 0;
  10346. ELSIF simple THEN
  10347. TypeTags := 3; (* only 3 extensions allowed *)
  10348. BaseTypesTableOffset := 1;
  10349. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10350. TypeRecordBaseOffset := 0;
  10351. RecordBaseOffset := 1;
  10352. ELSE
  10353. TypeTags := 16;
  10354. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10355. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10356. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10357. (* change this when Heaps.HeapBlock is modified *)
  10358. RecordBaseOffset := 8;
  10359. END;
  10360. SELF.simple := simple;
  10361. SELF.implementationVisitor := implementationVisitor;
  10362. SELF.declarationVisitor := declarationVisitor;
  10363. implementationVisitor.meta := SELF;
  10364. declarationVisitor.meta := SELF;
  10365. END InitMetaDataGenerator;
  10366. PROCEDURE SetModule(module: Sections.Module);
  10367. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10368. BEGIN
  10369. SELF.module := module;
  10370. Global.GetModuleName(module.module,moduleName);
  10371. Global.GetSymbolSegmentedName(module.module, name);
  10372. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10373. NEW(moduleNamePool, 32);
  10374. (*! require GC protection *)
  10375. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10376. IF ProtectModulesPointers THEN
  10377. name := "Heaps.AnyPtr";
  10378. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10379. (* set base pointer *)
  10380. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10381. END;
  10382. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10383. modulePointers := 0;
  10384. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10385. AddPointer(moduleNamePoolSection, namePoolOffset);
  10386. END;
  10387. END SetModule;
  10388. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10389. BEGIN
  10390. IF ~implementationVisitor.backend.cooperative THEN
  10391. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10392. INC(modulePointers);
  10393. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10394. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10395. END;
  10396. END AddPointer;
  10397. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10398. BEGIN
  10399. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10400. END GetTypeRecordBaseOffset;
  10401. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10402. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10403. BEGIN
  10404. (* change this when Heaps.HeapBlock is modified *)
  10405. INC(dataAdrOffset,6);
  10406. Info(section,"headerAdr");
  10407. Address(section,0);
  10408. Info(section,"typeDesc");
  10409. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10410. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10411. NamedSymbol(section, name, symbol, 0, offset);
  10412. Info(section,"mark: LONGINT;");
  10413. Longint(section,-1);
  10414. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10415. Info(section,"dataAdr-: ADDRESS");
  10416. Symbol(section,section, dataAdrOffset,0);
  10417. Info(section,"size-: SIZE");
  10418. Address(section,0);
  10419. Info(section,"nextMark: HeapBlock;");
  10420. Address(section,0);
  10421. END HeapBlock;
  10422. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10423. VAR i: LONGINT;
  10424. BEGIN
  10425. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10426. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10427. Info(section,"count*: LONGINT");
  10428. Longint(section,0);
  10429. Info(section,"locked*: BOOLEAN");
  10430. Longint(section,0);
  10431. Info(section,"awaitingLock*: ProcessQueue");
  10432. Address(section,0);
  10433. Address(section,0);
  10434. Info(section,"awaitingCond*: ProcessQueue");
  10435. Address(section,0);
  10436. Address(section,0);
  10437. Info(section,"lockedBy*: ANY");
  10438. Address(section,0);
  10439. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10440. Longint(section,1);
  10441. FOR i := 2 TO 6 DO
  10442. Longint(section,0);
  10443. END;
  10444. Info(section,"lock*: ANY");
  10445. Address(section,0);
  10446. END ProtectedHeapBlock;
  10447. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10448. BEGIN
  10449. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10450. END Info;
  10451. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10452. VAR op: IntermediateCode.Operand;
  10453. BEGIN
  10454. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10455. section.Emit(Data(Basic.invalidPosition,op));
  10456. END Address;
  10457. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10458. VAR op: IntermediateCode.Operand;
  10459. BEGIN
  10460. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10461. section.Emit(Data(Basic.invalidPosition,op));
  10462. END Size;
  10463. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10464. VAR op: IntermediateCode.Operand;
  10465. BEGIN
  10466. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10467. section.Emit(Data(Basic.invalidPosition,op));
  10468. END Set;
  10469. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10470. VAR op: IntermediateCode.Operand;
  10471. BEGIN
  10472. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10473. section.Emit(Data(Basic.invalidPosition,op));
  10474. END Longint;
  10475. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10476. VAR op,noOperand: IntermediateCode.Operand;
  10477. BEGIN
  10478. IntermediateCode.InitOperand(noOperand);
  10479. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10480. section.PatchOperands(pc,op,noOperand,noOperand);
  10481. END PatchAddress;
  10482. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10483. VAR op,noOperand: IntermediateCode.Operand;
  10484. BEGIN
  10485. IntermediateCode.InitOperand(noOperand);
  10486. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10487. section.PatchOperands(pc,op,noOperand,noOperand);
  10488. END PatchSize;
  10489. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10490. VAR op,noOperand: IntermediateCode.Operand;
  10491. BEGIN
  10492. IntermediateCode.InitOperand(noOperand);
  10493. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10494. section.PatchOperands(pc,op,noOperand,noOperand);
  10495. END PatchLongint;
  10496. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10497. VAR op, noOperand: IntermediateCode.Operand;
  10498. BEGIN
  10499. IntermediateCode.InitOperand(noOperand);
  10500. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10501. section.PatchOperands(pc,op,noOperand,noOperand);
  10502. END PatchSymbol;
  10503. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10504. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10505. BEGIN
  10506. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10507. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10508. section.Emit(Data(Basic.invalidPosition,op));
  10509. END Boolean;
  10510. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10511. VAR op: IntermediateCode.Operand;
  10512. BEGIN
  10513. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10514. section.Emit(Data(Basic.invalidPosition,op));
  10515. END Char;
  10516. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10517. VAR op: IntermediateCode.Operand;
  10518. BEGIN
  10519. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10520. section.Emit(Data(Basic.invalidPosition,op));
  10521. END Integer;
  10522. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10523. VAR i: LONGINT;
  10524. BEGIN
  10525. Info(section,str);
  10526. i := 0;
  10527. WHILE(str[i] # 0X) DO
  10528. Char(section,str[i]);
  10529. INC(i);
  10530. END;
  10531. Char(section,0X);
  10532. END String;
  10533. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10534. VAR s: Basic.SectionName;
  10535. BEGIN
  10536. StringPool.GetString(str, s);
  10537. String(section, s);
  10538. END String0;
  10539. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10540. VAR op: IntermediateCode.Operand;
  10541. BEGIN
  10542. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10543. IntermediateCode.SetOffset(op,realOffset);
  10544. section.Emit(Data(Basic.invalidPosition,op));
  10545. END NamedSymbol;
  10546. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10547. VAR op: IntermediateCode.Operand;
  10548. BEGIN
  10549. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10550. IntermediateCode.SetOffset(op,realOffset);
  10551. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10552. END NamedSymbolAt;
  10553. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10554. BEGIN
  10555. IF symbol= NIL THEN
  10556. Address( section, realOffset);
  10557. ASSERT(virtualOffset = 0);
  10558. ELSE
  10559. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10560. END;
  10561. END Symbol;
  10562. (* OutPointers delivers
  10563. {pointerOffset}
  10564. *)
  10565. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10566. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10567. BEGIN
  10568. type := type.resolved;
  10569. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10570. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10571. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10572. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10573. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10574. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10575. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10576. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10577. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10578. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10579. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10580. ELSIF (type IS SyntaxTree.RecordType) THEN
  10581. (* never treat a record like a pointer, even if the pointer field is set! *)
  10582. WITH type: SyntaxTree.RecordType DO
  10583. base := type.GetBaseRecord();
  10584. IF base # NIL THEN
  10585. Pointers(offset,symbol,section, base,numberPointers);
  10586. END;
  10587. variable := type.recordScope.firstVariable;
  10588. WHILE(variable # NIL) DO
  10589. IF ~(variable.untraced) THEN
  10590. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10591. END;
  10592. variable := variable.nextVariable;
  10593. END;
  10594. END;
  10595. ELSIF (type IS SyntaxTree.CellType) THEN
  10596. WITH type: SyntaxTree.CellType DO
  10597. base := type.GetBaseRecord();
  10598. IF base # NIL THEN
  10599. Pointers(offset,symbol,section, base,numberPointers);
  10600. END;
  10601. variable := type.cellScope.firstVariable;
  10602. WHILE(variable # NIL) DO
  10603. IF ~(variable.untraced) THEN
  10604. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10605. END;
  10606. variable := variable.nextVariable;
  10607. END;
  10608. property := type.firstProperty;
  10609. WHILE(property # NIL) DO
  10610. IF ~(property.untraced) THEN
  10611. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10612. END;
  10613. property := property.nextProperty;
  10614. END;
  10615. parameter := type.firstParameter;
  10616. WHILE(parameter # NIL) DO
  10617. IF ~(parameter.untraced) THEN
  10618. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10619. END;
  10620. parameter := parameter.nextParameter;
  10621. END;
  10622. END;
  10623. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10624. WITH type: SyntaxTree.ArrayType DO
  10625. IF type.form= SyntaxTree.Static THEN
  10626. n := type.staticLength;
  10627. base := type.arrayBase.resolved;
  10628. WHILE(base IS SyntaxTree.ArrayType) DO
  10629. type := base(SyntaxTree.ArrayType);
  10630. n := n* type.staticLength;
  10631. base := type.arrayBase.resolved;
  10632. END;
  10633. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10634. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10635. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10636. FOR i := 0 TO n-1 DO
  10637. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10638. END;
  10639. END;
  10640. ELSE
  10641. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10642. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10643. END;
  10644. END;
  10645. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10646. WITH type: SyntaxTree.MathArrayType DO
  10647. IF type.form = SyntaxTree.Static THEN
  10648. n := type.staticLength;
  10649. base := type.arrayBase.resolved;
  10650. WHILE(base IS SyntaxTree.MathArrayType) DO
  10651. type := base(SyntaxTree.MathArrayType);
  10652. n := n* type.staticLength;
  10653. base := type.arrayBase.resolved;
  10654. END;
  10655. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10656. IF SemanticChecker.ContainsPointer(base) THEN
  10657. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10658. FOR i := 0 TO n-1 DO
  10659. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10660. END;
  10661. END;
  10662. ELSE
  10663. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10664. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10665. END
  10666. END;
  10667. (* ELSE no pointers in type *)
  10668. END;
  10669. END Pointers;
  10670. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10671. VAR position,i: LONGINT; ch: CHAR;
  10672. BEGIN
  10673. IF pool.Has(index) THEN
  10674. RETURN pool.GetInt(index)
  10675. ELSE
  10676. position := source.pc;
  10677. pool.PutInt(index, position);
  10678. Info(source, name);
  10679. i := 0;
  10680. REPEAT
  10681. ch := name[i]; INC(i);
  10682. Char( source, ch);
  10683. UNTIL ch = 0X;
  10684. END;
  10685. RETURN position;
  10686. END EnterDynamicName;
  10687. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10688. VAR name: Basic.SectionName; position: LONGINT;
  10689. BEGIN
  10690. IF pool.Has(index) THEN
  10691. RETURN pool.GetInt(index)
  10692. ELSE
  10693. StringPool.GetString(index, name);
  10694. position := EnterDynamicName(source,name,index, pool);
  10695. END;
  10696. RETURN position;
  10697. END DynamicName;
  10698. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10699. VAR section: IntermediateCode.Section;
  10700. BEGIN
  10701. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10702. IF implementationVisitor.backend.cooperative THEN
  10703. Info(section, "TypeDescriptor");
  10704. Basic.ToSegmentedName("BaseTypes.Array", name);
  10705. NamedSymbol(section, name,NIL, 0, 0);
  10706. BasePointer(section);
  10707. offset := 0;
  10708. ELSE
  10709. IF ProtectModulesPointers THEN
  10710. HeapBlock(mName,typeName,section,2);
  10711. END;
  10712. Info(section, "HeapBlock");
  10713. IF ProtectModulesPointers THEN
  10714. Symbol(section,section,2,0);
  10715. ELSE
  10716. Address(section,0);
  10717. END;
  10718. Info(section, "TypeDescriptor");
  10719. Address(section,0);
  10720. offset := section.pc;
  10721. END;
  10722. RETURN section
  10723. END NamedBlock;
  10724. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10725. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10726. BEGIN
  10727. COPY(moduleName,name);
  10728. Strings.Append(name,suffix);
  10729. Basic.ToSegmentedName(name, pooledName);
  10730. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10731. END Block;
  10732. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10733. VAR name: Basic.SegmentedName;
  10734. BEGIN
  10735. Info(source,"ArrayHeader");
  10736. IF implementationVisitor.backend.cooperative THEN
  10737. sizePC := source.pc;
  10738. Address(source,0);
  10739. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10740. IF baseType # "" THEN
  10741. Basic.ToSegmentedName(baseType, name);
  10742. NamedSymbol(source, name,NIL, 0, 0);
  10743. ELSE
  10744. Address(source,0);
  10745. END;
  10746. Address(source,0);
  10747. ELSE
  10748. Address(source,0);
  10749. Address(source,0);
  10750. (* first pointer for GC *)
  10751. IF hasPointer THEN
  10752. (* points to first element in the array, this is NOT the base type descriptor *)
  10753. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10754. ELSE
  10755. Address(source,0);
  10756. END;
  10757. sizePC := source.pc;
  10758. Address(source,0);
  10759. Info(source,"array data");
  10760. END;
  10761. END ArrayBlock;
  10762. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10763. BEGIN
  10764. IF implementationVisitor.backend.cooperative THEN
  10765. PatchSize(section, pc, size);
  10766. PatchSize(section, pc + 3, size);
  10767. ELSE
  10768. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10769. PatchSize(section, pc, size);
  10770. END;
  10771. END PatchArray;
  10772. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10773. VAR
  10774. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10775. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10776. poolMap: Basic.HashTableInt;
  10777. namePool: IntermediateCode.Section;
  10778. namePoolOffset: LONGINT;
  10779. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10780. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10781. BEGIN
  10782. Basic.SegmentedNameToString(s1.name,n1);
  10783. Basic.SegmentedNameToString(s2.name,n2);
  10784. index := 0;
  10785. ch1 := n1[index];
  10786. ch2 := n2[index];
  10787. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10788. INC(index);
  10789. ch1 := n1[index];
  10790. ch2 := n2[index];
  10791. END;
  10792. RETURN ch1 < ch2;
  10793. END Compare;
  10794. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10795. VAR
  10796. i, j: LONGINT;
  10797. x, t: Sections.Section;
  10798. BEGIN
  10799. IF lo < hi THEN
  10800. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10801. WHILE i <= j DO
  10802. WHILE Compare(list[i], x) DO INC(i) END;
  10803. WHILE Compare(x, list[j]) DO DEC(j) END;
  10804. IF i <= j THEN
  10805. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10806. INC(i); DEC(j)
  10807. END
  10808. END;
  10809. IF lo < j THEN QuickSort(list, lo, j) END;
  10810. IF i < hi THEN QuickSort(list, i, hi) END
  10811. END;
  10812. END QuickSort;
  10813. (*
  10814. ExportDesc* = RECORD
  10815. fp*: ADDRESS;
  10816. name* {UNTRACED}: DynamicName;
  10817. adr*: ADDRESS;
  10818. exports*: LONGINT;
  10819. dsc* {UNTRACED}: ExportArray
  10820. END;
  10821. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10822. *)
  10823. PROCEDURE ExportDesc2(
  10824. source: IntermediateCode.Section;
  10825. namePool: IntermediateCode.Section;
  10826. fingerPrinter: FingerPrinter.FingerPrinter;
  10827. symbol: Sections.Section;
  10828. name: StringPool.Index;
  10829. VAR patchAdr: LONGINT
  10830. ): BOOLEAN;
  10831. VAR fingerPrint: SyntaxTree.FingerPrint;
  10832. BEGIN
  10833. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10834. & (symbol.type # Sections.InlineCodeSection)
  10835. THEN
  10836. *)
  10837. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10838. & (symbol.type # Sections.InlineCodeSection))
  10839. THEN
  10840. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10841. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10842. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10843. Longint(source,fingerPrint.public);
  10844. ELSE
  10845. Longint(source, 0);
  10846. END;
  10847. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10848. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10849. Symbol(source, symbol,0,0);
  10850. patchAdr := source.pc;
  10851. Longint(source, 0);
  10852. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10853. Address(source,0);
  10854. END;
  10855. RETURN TRUE
  10856. ELSE
  10857. RETURN FALSE
  10858. END;
  10859. END ExportDesc2;
  10860. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10861. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10862. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10863. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10864. nextPatch: LONGINT;
  10865. TYPE
  10866. Scope = RECORD
  10867. elements: LONGINT;
  10868. gelements: LONGINT;
  10869. section: IntermediateCode.Section;
  10870. patchAdr: LONGINT;
  10871. arraySizePC: LONGINT;
  10872. beginPC: LONGINT; (* current scope start pc *)
  10873. END;
  10874. BEGIN
  10875. Basic.InitSegmentedName(prev);
  10876. olevel := -1;
  10877. scopes[0].section := source;
  10878. scopes[0].arraySizePC := MIN(LONGINT);
  10879. FOR s := 0 TO LEN(sections)-1 DO
  10880. symbol := sections[s];
  10881. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10882. this := sections[s].name;
  10883. level := 0;
  10884. WHILE (this[level] > 0) DO
  10885. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10886. INC(level);
  10887. END;
  10888. WHILE level < olevel DO
  10889. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10890. IF olevel > 0 THEN
  10891. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10892. nextPatch := scopes[olevel-1].patchAdr+1;
  10893. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10894. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10895. END;
  10896. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10897. DEC(olevel);
  10898. END;
  10899. IF (this[level] > 0) THEN
  10900. IF level > olevel THEN
  10901. (*TRACE("opening",level); *)
  10902. IF scopes[level].section = NIL THEN
  10903. arrayName := ".@ExportArray";
  10904. Strings.AppendInt(arrayName, level);
  10905. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10906. AddPointer(scopes[level].section,offset);
  10907. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10908. END;
  10909. scopes[level].beginPC := scopes[level].section.pc;
  10910. olevel := level;
  10911. scopes[olevel].elements := 0;
  10912. END;
  10913. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10914. sym := sections[s];
  10915. ELSE
  10916. sym := NIL;
  10917. END;
  10918. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10919. THEN
  10920. INC(scopes[olevel].elements);
  10921. END;
  10922. (* enter string in scope *)
  10923. INC(level);
  10924. END;
  10925. END;
  10926. Basic.SegmentedNameToString(this, name);
  10927. prev := this;
  10928. END;
  10929. END;
  10930. WHILE 0 <= olevel DO
  10931. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10932. IF olevel > 0 THEN
  10933. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10934. nextPatch := scopes[olevel-1].patchAdr+1;
  10935. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10936. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10937. END;
  10938. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10939. DEC(olevel);
  10940. END;
  10941. level := 0;
  10942. WHILE (level < LEN(scopes)) DO
  10943. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10944. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10945. END;
  10946. INC(level);
  10947. END;
  10948. END Export;
  10949. BEGIN
  10950. NEW(fingerPrinter);
  10951. NEW(poolMap, 64);
  10952. (* 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 *)
  10953. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10954. NEW(sectionArray, module.allSections.Length());
  10955. FOR i := 0 TO module.allSections.Length() - 1 DO
  10956. section := module.allSections.GetSection(i);
  10957. sectionArray[i] := section;
  10958. END;
  10959. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10960. Export(sectionArray^);
  10961. END ExportDesc;
  10962. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10963. VAR
  10964. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10965. BEGIN
  10966. Info(source, "exception table offsets array descriptor");
  10967. size := 0;
  10968. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10969. Info(source, "exception table content");
  10970. FOR i := 0 TO module.allSections.Length() - 1 DO
  10971. p := module.allSections.GetSection(i);
  10972. IF p.type = Sections.CodeSection THEN
  10973. finallyPC := p(IntermediateCode.Section).finally;
  10974. IF finallyPC>=0 THEN
  10975. Symbol( source, p, 0,0);
  10976. Symbol( source, p, finallyPC, 0);
  10977. Symbol( source, p, finallyPC,0);
  10978. INC(size);
  10979. END;
  10980. END
  10981. END;
  10982. PatchArray(source,sizePC,size);
  10983. END ExceptionArray;
  10984. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10985. VAR i: LONGINT; ch: CHAR;
  10986. BEGIN
  10987. i := 0;
  10988. REPEAT
  10989. ch := name[i]; INC(i);
  10990. Char( section, ch);
  10991. UNTIL ch = 0X;
  10992. WHILE i < 32 DO
  10993. Char( section, 0X); INC(i);
  10994. END;
  10995. END Name;
  10996. PROCEDURE References(section: IntermediateCode.Section);
  10997. CONST
  10998. sfTypeNone = 0X;
  10999. sfTypeCHAR = 01X;
  11000. sfTypeCHAR8 = 02X;
  11001. sfTypeCHAR16 = 03X;
  11002. sfTypeCHAR32 = 04X;
  11003. sfTypeRANGE = 05X;
  11004. sfTypeSHORTINT = 06X;
  11005. sfTypeINTEGER = 07X;
  11006. sfTypeLONGINT = 08X;
  11007. sfTypeHUGEINT = 09X;
  11008. sfTypeWORD = 0AX;
  11009. sfTypeLONGWORD = 0BX;
  11010. sfTypeSIGNED8 = 0CX;
  11011. sfTypeSIGNED16 = 0DX;
  11012. sfTypeSIGNED32 = 0EX;
  11013. sfTypeSIGNED64 = 0FX;
  11014. sfTypeUNSIGNED8 = 10X;
  11015. sfTypeUNSIGNED16 = 11X;
  11016. sfTypeUNSIGNED32 = 12X;
  11017. sfTypeUNSIGNED64 = 13X;
  11018. sfTypeREAL = 14X;
  11019. sfTypeLONGREAL = 15X;
  11020. sfTypeCOMPLEX = 16X;
  11021. sfTypeLONGCOMPLEX = 17X;
  11022. sfTypeBOOLEAN = 18X;
  11023. sfTypeSET = 19X;
  11024. sfTypeANY = 1AX;
  11025. sfTypeOBJECT = 1BX;
  11026. sfTypeBYTE = 1CX;
  11027. sfTypeADDRESS = 1DX;
  11028. sfTypeSIZE = 1EX;
  11029. sfTypeIndirect = 1FX;
  11030. sfTypeRecord = 20X;
  11031. sfTypePointerToRecord = 21X;
  11032. sfTypePointerToArray = 22X;
  11033. sfTypeOpenArray = 23X;
  11034. sfTypeStaticArray = 24X;
  11035. sfTypeDynamicArray = 25X;
  11036. sfTypeMathStaticArray = 26X;
  11037. sfTypeMathOpenArray = 27X;
  11038. sfTypeMathTensor = 28X;
  11039. sfTypeDelegate = 29X;
  11040. sfTypeENUM = 2AX;
  11041. sfTypeCELL = 2BX;
  11042. sfTypePORT = 2CX;
  11043. sfIN = 0X;
  11044. sfOUT = 1X;
  11045. flagDelegate = 0;
  11046. flagConstructor = 1;
  11047. (* variable / parameter addressing modes *)
  11048. sfAbsolute = 0X; (* global vars *)
  11049. sfRelative = 1X; (* variables, value parameters *)
  11050. sfIndirect = 2X; (* var parameters *)
  11051. sfScopeBegin = 0F0X;
  11052. sfScopeEnd = 0F1X;
  11053. sfProcedure = 0F2X;
  11054. sfVariable = 0F3X;
  11055. sfTypeDeclaration = 0F4X;
  11056. sfModule = 0FFX;
  11057. RefInfo = TRUE;
  11058. VAR
  11059. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11060. indirectTypes: Basic.HashTable;
  11061. PROCEDURE CurrentIndex(): LONGINT;
  11062. VAR i: LONGINT;
  11063. BEGIN
  11064. FOR i := startPC TO section.pc -1 DO
  11065. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11066. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11067. END;
  11068. startPC := section.pc;
  11069. RETURN lastOffset;
  11070. END CurrentIndex;
  11071. (*
  11072. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11073. Module = sfModule prevSymbol:SIZE name:String Scope.
  11074. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11075. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11076. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11077. Type =
  11078. sfTypePointerToRecord
  11079. | sfTypePointerToArray Type
  11080. | sfTypeOpenArray Type
  11081. | sfTypeDynamicArray Type
  11082. | sfTypeStaticArray length:SIZE Type
  11083. | sfTypeMathOpenArray Type
  11084. | sfTypeMathStaticArray length:SIZE Type
  11085. | sfTypeMathTensor Type
  11086. | sfTypeRecord tdAdr:ADDRESS
  11087. | sfTypeDelegate {Parameter} return:Type
  11088. | sfTypePort (sfIN | sfOUT)
  11089. | sfTypeBOOLEAN
  11090. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11091. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11092. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11093. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11094. | sfTypeWORD | sfTypeLONGWORD
  11095. | sfTypeREAL | sfTypeLONGREAL
  11096. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11097. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11098. | sfTypeIndirect offset:SIZE.
  11099. *)
  11100. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11101. VAR offset: SIZE;
  11102. BEGIN
  11103. IF indirectTypes.Has(type) THEN
  11104. offset := indirectTypes.GetInt(type);
  11105. Char(section, sfTypeIndirect);
  11106. Size(section, offset);
  11107. RETURN TRUE;
  11108. ELSE
  11109. indirectTypes.PutInt(type, CurrentIndex());
  11110. RETURN FALSE;
  11111. END;
  11112. END Indirect;
  11113. PROCEDURE NType(type: SyntaxTree.Type);
  11114. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11115. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11116. BEGIN
  11117. IF type = NIL THEN
  11118. Char(section, sfTypeNone)
  11119. ELSE
  11120. type := type.resolved;
  11121. size := type.sizeInBits;
  11122. WITH type:SyntaxTree.PointerType DO
  11123. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11124. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11125. Char(section, sfTypePointerToRecord);
  11126. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11127. ELSE
  11128. IF RefInfo THEN Info(section,"PointerToArray") END;
  11129. Char(section, sfTypePointerToArray);
  11130. NType(type.pointerBase);
  11131. END;
  11132. | type: SyntaxTree.ArrayType DO
  11133. IF ~Indirect(type) THEN
  11134. IF type.form = SyntaxTree.Open THEN
  11135. IF RefInfo THEN Info(section,"OpenArray") END;
  11136. Char(section, sfTypeOpenArray);
  11137. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11138. IF RefInfo THEN Info(section,"DynamicArray") END;
  11139. Char(section, sfTypeDynamicArray);
  11140. ELSIF type.form = SyntaxTree.Static THEN
  11141. IF RefInfo THEN Info(section,"StaticArray") END;
  11142. Char(section, sfTypeStaticArray);
  11143. Size(section, type.staticLength);
  11144. ELSE
  11145. HALT(100);
  11146. END;
  11147. NType(type.arrayBase);
  11148. END;
  11149. | type: SyntaxTree.MathArrayType DO
  11150. IF ~Indirect(type) THEN
  11151. IF type.form = SyntaxTree.Open THEN
  11152. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11153. Char(section, sfTypeMathOpenArray);
  11154. ELSIF type.form = SyntaxTree.Static THEN
  11155. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11156. Char(section, sfTypeMathStaticArray);
  11157. Size(section, type.staticLength);
  11158. ELSIF type.form = SyntaxTree.Tensor THEN
  11159. IF RefInfo THEN Info(section,"MathTensor") END;
  11160. Char(section, sfTypeMathTensor);
  11161. ELSE
  11162. HALT(100);
  11163. END;
  11164. NType(type.arrayBase);
  11165. END;
  11166. | type: SyntaxTree.RecordType DO
  11167. IF ~Indirect(type) THEN
  11168. IF type.pointerType # NIL (* OBJECT *) THEN
  11169. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11170. Char(section, sfTypePointerToRecord)
  11171. ELSE
  11172. IF RefInfo THEN Info(section,"Record") END;
  11173. Char(section, sfTypeRecord);
  11174. td := type.typeDeclaration;
  11175. IF RefInfo THEN Info(section,"TD") END;
  11176. IF (td # NIL) THEN
  11177. Global.GetSymbolSegmentedName(td,segmentedName);
  11178. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11179. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11180. ELSE
  11181. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11182. END;
  11183. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11184. Symbol(section, tir, 0, offset);
  11185. ELSE
  11186. Address(section, 0);
  11187. END;
  11188. END;
  11189. END;
  11190. | type: SyntaxTree.CellType DO
  11191. IF ~Indirect(type) THEN
  11192. IF RefInfo THEN Info(section,"Record") END;
  11193. Char(section, sfTypeRecord);
  11194. td := type.typeDeclaration;
  11195. IF RefInfo THEN Info(section,"TD") END;
  11196. IF (td # NIL) THEN
  11197. Global.GetSymbolSegmentedName(td,segmentedName);
  11198. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11199. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11200. ELSE
  11201. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11202. END;
  11203. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11204. Symbol(section, tir, 0, offset);
  11205. ELSE
  11206. Address(section, 0);
  11207. END;
  11208. END;
  11209. | type: SyntaxTree.PortType DO
  11210. Char(section, sfTypePORT);
  11211. IF type.direction = SyntaxTree.OutPort THEN
  11212. Char(section, sfOUT)
  11213. ELSE
  11214. Char(section, sfIN)
  11215. END;
  11216. | type: SyntaxTree.ProcedureType DO
  11217. IF ~Indirect(type) THEN
  11218. Char(section, sfTypeDelegate);
  11219. parameter := type.firstParameter;
  11220. WHILE(parameter # NIL) DO
  11221. NParameter(parameter, -1);
  11222. parameter := parameter.nextParameter;
  11223. END;
  11224. NType(type.returnType);
  11225. END;
  11226. | type:SyntaxTree.EnumerationType DO
  11227. Char(section, sfTypeENUM);
  11228. | type: SyntaxTree.BasicType DO
  11229. WITH type: SyntaxTree.BooleanType DO
  11230. IF RefInfo THEN Info(section,"Boolean") END;
  11231. Char(section, sfTypeBOOLEAN);
  11232. | type: SyntaxTree.CharacterType DO
  11233. IF type = module.system.characterType THEN
  11234. IF RefInfo THEN Info(section,"CHAR") END;
  11235. Char(section, sfTypeCHAR);
  11236. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11237. IF RefInfo THEN Info(section,"CHAR8") END;
  11238. Char(section, sfTypeCHAR8)
  11239. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11240. IF RefInfo THEN Info(section,"CHAR16") END;
  11241. Char(section, sfTypeCHAR16);
  11242. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11243. IF RefInfo THEN Info(section,"CHAR32") END;
  11244. Char(section, sfTypeCHAR32);
  11245. ELSE
  11246. HALT(100);
  11247. END;
  11248. |type: SyntaxTree.IntegerType DO
  11249. IF type(SyntaxTree.IntegerType).signed THEN
  11250. IF (type = module.system.shortintType) THEN
  11251. IF RefInfo THEN Info(section,"SHORTINT") END;
  11252. Char(section, sfTypeSHORTINT)
  11253. ELSIF (type = module.system.integerType) THEN
  11254. IF RefInfo THEN Info(section,"INTEGER") END;
  11255. Char(section, sfTypeINTEGER)
  11256. ELSIF (type = module.system.longintType) THEN
  11257. IF RefInfo THEN Info(section,"LONGINT") END;
  11258. Char(section, sfTypeLONGINT)
  11259. ELSIF (type = module.system.hugeintType) THEN
  11260. IF RefInfo THEN Info(section,"HUGEINT") END;
  11261. Char(section, sfTypeHUGEINT)
  11262. ELSIF (type = module.system.wordType) THEN
  11263. IF RefInfo THEN Info(section,"WORD") END;
  11264. Char(section, sfTypeWORD)
  11265. ELSIF (type = module.system.longWordType) THEN
  11266. IF RefInfo THEN Info(section,"LONGWORD") END;
  11267. Char(section, sfTypeLONGWORD);
  11268. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11269. IF RefInfo THEN Info(section,"SIGNED8") END;
  11270. Char(section, sfTypeSIGNED8)
  11271. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11272. IF RefInfo THEN Info(section,"SIGNED16") END;
  11273. Char(section, sfTypeSIGNED16)
  11274. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11275. IF RefInfo THEN Info(section,"SIGNED32") END;
  11276. Char(section, sfTypeSIGNED32)
  11277. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11278. IF RefInfo THEN Info(section,"SIGNED64") END;
  11279. Char(section, sfTypeSIGNED64)
  11280. ELSE
  11281. HALT(100);
  11282. END
  11283. ELSE (* unsigned *)
  11284. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11285. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11286. Char(section, sfTypeUNSIGNED8)
  11287. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11288. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11289. Char(section, sfTypeUNSIGNED16)
  11290. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11291. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11292. Char(section, sfTypeUNSIGNED32)
  11293. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11294. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11295. Char(section, sfTypeUNSIGNED64)
  11296. ELSE
  11297. HALT(100)
  11298. END
  11299. END;
  11300. | type: SyntaxTree.FloatType DO
  11301. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11302. IF RefInfo THEN Info(section,"REAL") END;
  11303. Char(section, sfTypeREAL);
  11304. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11305. IF RefInfo THEN Info(section,"LONGREAL") END;
  11306. Char(section, sfTypeLONGREAL);
  11307. ELSE
  11308. HALT(100);
  11309. END;
  11310. |type: SyntaxTree.ComplexType DO
  11311. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11312. IF RefInfo THEN Info(section,"COMPLEX") END;
  11313. Char(section, sfTypeCOMPLEX);
  11314. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11315. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11316. Char(section, sfTypeLONGCOMPLEX);
  11317. ELSE
  11318. HALT(100);
  11319. END;
  11320. |type:SyntaxTree.SetType DO
  11321. IF RefInfo THEN Info(section,"SET") END;
  11322. Char(section, sfTypeSET);
  11323. |type:SyntaxTree.AnyType DO
  11324. IF RefInfo THEN Info(section,"ANY") END;
  11325. Char(section, sfTypeANY);
  11326. |type:SyntaxTree.ObjectType DO
  11327. IF RefInfo THEN Info(section,"OBJECT") END;
  11328. Char(section, sfTypeOBJECT);
  11329. |type:SyntaxTree.ByteType DO
  11330. IF RefInfo THEN Info(section,"BYTE") END;
  11331. Char(section, sfTypeBYTE);
  11332. |type:SyntaxTree.RangeType DO
  11333. IF RefInfo THEN Info(section,"RANGE") END;
  11334. Char(section, sfTypeRANGE)
  11335. |type:SyntaxTree.AddressType DO
  11336. IF RefInfo THEN Info(section,"ADDRESS") END;
  11337. Char(section, sfTypeADDRESS)
  11338. |type:SyntaxTree.SizeType DO
  11339. IF RefInfo THEN Info(section,"SIZE") END;
  11340. Char(section, sfTypeSIZE)
  11341. ELSE
  11342. HALT(100)
  11343. END;
  11344. ELSE HALT(101);
  11345. END;
  11346. END;
  11347. END NType;
  11348. (*
  11349. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11350. *)
  11351. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11352. VAR pos: LONGINT; type: SyntaxTree.Type;
  11353. BEGIN
  11354. IF RefInfo THEN Info(section, "Parameter") END;
  11355. Char(section, sfVariable);
  11356. Size(section, procOffset);
  11357. String0(section, parameter.name);
  11358. type := parameter.type.resolved;
  11359. IF parameter.kind = SyntaxTree.VarParameter THEN
  11360. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11361. ELSE Char(section, sfIndirect)
  11362. END;
  11363. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11364. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11365. Char(section, sfIndirect);
  11366. ELSE
  11367. Char(section, sfRelative);
  11368. END;
  11369. ELSE
  11370. Char(section, sfRelative);
  11371. END;
  11372. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11373. NType(parameter.type);
  11374. END NParameter;
  11375. (*
  11376. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11377. *)
  11378. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11379. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11380. flags: SET;
  11381. BEGIN
  11382. IF procedure.externalName # NIL THEN RETURN END;
  11383. IF RefInfo THEN Info(section, "Procedure") END;
  11384. pos := CurrentIndex();
  11385. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11386. Char(section, sfProcedure);
  11387. Size(section, scopeOffset);
  11388. String0(section,procedure.name);
  11389. s := module.allSections.FindBySymbol(procedure);
  11390. Symbol(section,s,0,0); (* start *)
  11391. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11392. flags := {};
  11393. IF procedureType.isDelegate THEN
  11394. INCL(flags, flagDelegate);
  11395. END;
  11396. IF procedure.isConstructor THEN
  11397. INCL(flags, flagConstructor);
  11398. END;
  11399. Set(section, flags);
  11400. IF RefInfo THEN Info(section, "Parameters") END;
  11401. parameter := procedureType.firstParameter;
  11402. WHILE(parameter # NIL) DO
  11403. NParameter(parameter, pos);
  11404. parameter := parameter.nextParameter;
  11405. END;
  11406. IF procedureType.returnParameter # NIL THEN
  11407. NParameter(procedureType.returnParameter, pos);
  11408. END;
  11409. IF procedureType.selfParameter # NIL THEN
  11410. NParameter(procedureType.selfParameter, pos);
  11411. END;
  11412. IF RefInfo THEN Info(section, "ReturnType") END;
  11413. NType(procedureType.returnType);
  11414. NScope(procedure.procedureScope, pos);
  11415. END NProcedure;
  11416. (*
  11417. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11418. *)
  11419. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11420. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11421. BEGIN
  11422. IF RefInfo THEN Info(section, "Variable") END;
  11423. pos := CurrentIndex();
  11424. Char(section, sfVariable);
  11425. Size(section, scopeOffset);
  11426. String0(section, variable.name);
  11427. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11428. Char(section, sfAbsolute);
  11429. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11430. NamedSymbol(section, sn,variable, 0,0);
  11431. ELSE
  11432. Char(section, sfRelative);
  11433. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11434. END;
  11435. NType(variable.type);
  11436. s := module.allSections.FindBySymbol(variable);
  11437. END NVariable;
  11438. (*
  11439. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11440. *)
  11441. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11442. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11443. BEGIN
  11444. IF typeDeclaration = NIL THEN RETURN END;
  11445. pos := CurrentIndex();
  11446. s := module.allSections.FindBySymbol(typeDeclaration);
  11447. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11448. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11449. Char(section, sfTypeDeclaration);
  11450. Size(section, scopeOffset);
  11451. String0(section, typeDeclaration.name);
  11452. declared := typeDeclaration.declaredType.resolved;
  11453. IF (declared IS SyntaxTree.PointerType) THEN
  11454. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11455. END;
  11456. WITH declared: SyntaxTree.RecordType DO
  11457. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11458. Symbol(section, s, 0, offset);
  11459. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11460. Basic.AppendToSegmentedName(name,".@Info");
  11461. s := module.allSections.FindByName(name);
  11462. IF s # NIL THEN (* does not work for coop *)
  11463. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11464. END;
  11465. NScope(declared.recordScope, pos);
  11466. |declared: SyntaxTree.CellType DO
  11467. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11468. Symbol(section, s, 0, offset);
  11469. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11470. Basic.AppendToSegmentedName(name,".@Info");
  11471. s := module.allSections.FindByName(name);
  11472. IF s # NIL THEN
  11473. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11474. END;
  11475. NScope(declared.cellScope, pos);
  11476. ELSE
  11477. Address(section, 0);
  11478. END;
  11479. END NTypeDeclaration;
  11480. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11481. VAR pos: LONGINT;
  11482. BEGIN
  11483. pos := CurrentIndex();
  11484. Char(section,sfModule);
  11485. Size(section, prevSymbol);
  11486. String0(section, module.name);
  11487. NScope(module.moduleScope, pos);
  11488. END NModule;
  11489. (*
  11490. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11491. *)
  11492. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11493. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11494. BEGIN
  11495. IF scope = NIL THEN RETURN END;
  11496. IF RefInfo THEN Info(section, "Scope") END;
  11497. Char(section, sfScopeBegin);
  11498. variable := scope.firstVariable;
  11499. WHILE (variable # NIL) DO
  11500. NVariable(variable, prevSymbol);
  11501. variable := variable.nextVariable;
  11502. END;
  11503. WITH scope: SyntaxTree.ModuleScope DO
  11504. bodyProcedure := scope.bodyProcedure;
  11505. |scope: SyntaxTree.RecordScope DO
  11506. bodyProcedure := scope.bodyProcedure;
  11507. ELSE
  11508. bodyProcedure := NIL;
  11509. END;
  11510. IF bodyProcedure # NIL THEN
  11511. NProcedure(bodyProcedure, prevSymbol)
  11512. END;
  11513. procedure := scope.firstProcedure;
  11514. WHILE procedure # NIL DO
  11515. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11516. procedure := procedure.nextProcedure;
  11517. END;
  11518. typeDeclaration := scope.firstTypeDeclaration;
  11519. WHILE typeDeclaration # NIL DO
  11520. NTypeDeclaration(typeDeclaration, prevSymbol);
  11521. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11522. END;
  11523. Char(section, sfScopeEnd); (* scope ends *)
  11524. END NScope;
  11525. BEGIN
  11526. NEW(indirectTypes, 32);
  11527. ArrayBlock(section,sizePC,"", FALSE);
  11528. startPC := section.pc;
  11529. NModule(module.module, -1);
  11530. PatchArray(section,sizePC,CurrentIndex());
  11531. END References;
  11532. (*
  11533. Command* = RECORD
  11534. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11535. name*: Name; (* name of the procedure *)
  11536. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11537. entryAdr* : ADDRESS; (* entry address of procedure *)
  11538. END;
  11539. *)
  11540. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11541. VAR
  11542. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11543. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11544. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11545. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11546. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11547. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11548. BEGIN
  11549. RETURN
  11550. (type = NIL) OR
  11551. (type.resolved IS SyntaxTree.RecordType) OR
  11552. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11553. (type.resolved IS SyntaxTree.AnyType);
  11554. END TypeAllowed;
  11555. BEGIN
  11556. numberParameters := procedureType.numberParameters;
  11557. RETURN
  11558. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11559. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11560. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11561. END GetProcedureAllowed;
  11562. PROCEDURE WriteType(type : SyntaxTree.Type);
  11563. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11564. name: Basic.SegmentedName; offset: LONGINT;
  11565. BEGIN
  11566. IF type = NIL THEN
  11567. Address(source,0);
  11568. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11569. Address(source,1);
  11570. ELSE
  11571. type := type.resolved;
  11572. IF type IS SyntaxTree.PointerType THEN
  11573. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11574. END;
  11575. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11576. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11577. name[0] := typeDeclaration.name; name[1] := -1;
  11578. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11579. ASSERT(section # NIL);
  11580. ELSE
  11581. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11582. (* TODO *)
  11583. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11584. END;
  11585. IF implementationVisitor.backend.cooperative THEN
  11586. offset := 0;
  11587. ELSE
  11588. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11589. END;
  11590. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11591. END;
  11592. END WriteType;
  11593. BEGIN
  11594. Info(source, "command array descriptor");
  11595. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11596. numberCommands := 0;
  11597. Info(source, "command array content");
  11598. FOR i := 0 TO module.allSections.Length() - 1 DO
  11599. p := module.allSections.GetSection(i);
  11600. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11601. procedure := p.symbol(SyntaxTree.Procedure);
  11602. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11603. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11604. procedure.GetName(name);
  11605. Name(source,name);
  11606. numberParameters := procedureType.numberParameters;
  11607. (* offset of type of first parameter *)
  11608. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11609. ELSE WriteType(procedureType.firstParameter.type)
  11610. END;
  11611. (* offset of type of return parameter *)
  11612. WriteType(procedureType.returnType);
  11613. (* command name *)
  11614. (* command code offset *)
  11615. Symbol(source,p,0,0);
  11616. INC(numberCommands);
  11617. IF Trace THEN
  11618. D.Ln;
  11619. END;
  11620. END;
  11621. END
  11622. END;
  11623. PatchArray(source,sizePC,numberCommands);
  11624. END CommandArray;
  11625. (* to prevent from double import of different module aliases *)
  11626. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11627. VAR i: SyntaxTree.Import;
  11628. BEGIN
  11629. i := module.module.moduleScope.firstImport;
  11630. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11631. i := i.nextImport;
  11632. END;
  11633. RETURN i = import
  11634. END IsFirstDirectOccurence;
  11635. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11636. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11637. BEGIN
  11638. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11639. ArrayBlock(source,pc,"", FALSE);
  11640. Info(source, "import module array data");
  11641. IF implementationVisitor.backend.cooperative THEN
  11642. offset := 0;
  11643. ELSE
  11644. IF module.system.addressType.sizeInBits = 64 THEN
  11645. (* change this when Heaps.HeapBlock is modified *)
  11646. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11647. ELSE
  11648. (* change this when Heaps.HeapBlock is modified *)
  11649. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11650. END;
  11651. END;
  11652. import := module.module.moduleScope.firstImport;
  11653. numberImports := 0;
  11654. WHILE import # NIL DO
  11655. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11656. Global.GetModuleSegmentedName(import.module,name);
  11657. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11658. NamedSymbol(source, name, NIL, 0, offset);
  11659. INC(numberImports);
  11660. END;
  11661. import := import.nextImport
  11662. END;
  11663. PatchArray(source,pc,numberImports);
  11664. END ImportsArray;
  11665. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11666. VAR
  11667. p: Sections.Section; sizePC, size, i: LONGINT;
  11668. BEGIN
  11669. Info(source, "Type info section");
  11670. size := 0;
  11671. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11672. FOR i := 0 TO module.allSections.Length() - 1 DO
  11673. p := module.allSections.GetSection(i);
  11674. WITH p: IntermediateCode.Section DO
  11675. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11676. Symbol(source,p,EmptyBlockOffset,0);
  11677. INC(size);
  11678. END;
  11679. END
  11680. END;
  11681. PatchArray(source,sizePC,size);
  11682. END TypeInfoSection;
  11683. (*
  11684. ProcTableEntry* = RECORD
  11685. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11686. noPtr*: LONGINT;
  11687. END;
  11688. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11689. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11690. *)
  11691. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11692. VAR
  11693. numberPointers: LONGINT;
  11694. procedure: SyntaxTree.Procedure;
  11695. BEGIN
  11696. Info(section,"pcFrom");
  11697. Symbol(section,procedureSection,0,0);
  11698. Info(section,"pcTo");
  11699. Symbol(section, procedureSection, procedureSection.pc, 0);
  11700. Info(section,"pointer to offsets array");
  11701. Symbol(section, section,section.pc+1,0);
  11702. Info(section,"offsets array");
  11703. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11704. PointerArray(section, procedure.procedureScope, numberPointers);
  11705. END ProcedureDescriptor;
  11706. (* only for tracing, the descriptor is otherwise not complete ! *)
  11707. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11708. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11709. BEGIN
  11710. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11711. name := procedureSection.name;
  11712. Basic.AppendToSegmentedName(name,".@Info");
  11713. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11714. Address(section,0);
  11715. Symbol(section,section,2,0);
  11716. (*
  11717. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11718. descSize: SIZE;
  11719. sentinel: ADDRESS; (* = MPO-4 *)
  11720. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11721. flags*: SET;
  11722. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11723. name*: Name;
  11724. END;
  11725. *)
  11726. Size(section, 0);
  11727. Address(section,0);
  11728. Address(section,0);
  11729. Set(section,{});
  11730. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11731. moduleSection := ModuleSection();
  11732. Symbol( section, moduleSection, moduleSection.pc,0);
  11733. IF procedureSection.symbol = NIL THEN
  11734. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11735. ELSE
  11736. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11737. END;
  11738. Name(section, infoName);
  11739. Size(section, 0);
  11740. RETURN section;
  11741. END MakeProcedureDescriptorTag;
  11742. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11743. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11744. BEGIN
  11745. name := procedureSection.name;
  11746. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11747. IF implementationVisitor.backend.cooperative THEN
  11748. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11749. Info(section, "TypeDescriptor");
  11750. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11751. NamedSymbol(dest, name,NIL, 0, 0);
  11752. BaseRecord(dest);
  11753. offset := 0;
  11754. ELSIF CreateProcedureDescInfo THEN
  11755. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11756. Address(dest,0);
  11757. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11758. offset := dest.pc;
  11759. ELSE
  11760. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11761. END;
  11762. ProcedureDescriptor(dest, procedureSection);
  11763. Symbol(section, dest, offset, 0);
  11764. END ProcedureDescriptorPointer;
  11765. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11766. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11767. BEGIN
  11768. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11769. numberProcs := 0;
  11770. FOR i := 0 TO module.allSections.Length() - 1 DO
  11771. destination := module.allSections.GetSection(i);
  11772. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11773. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11774. INC(numberProcs);
  11775. END
  11776. END;
  11777. PatchArray(section, sizePC, numberProcs);
  11778. END ProcedureDescriptorArray;
  11779. (*
  11780. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11781. VAR
  11782. next*: Module; (** once a module is published, all fields are read-only *)
  11783. name*: Name;
  11784. init, published: BOOLEAN;
  11785. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11786. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11787. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11788. command*: POINTER TO ARRAY OF Command;
  11789. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11790. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11791. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11792. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11793. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11794. data*, code*: Bytes;
  11795. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11796. export*: ExportDesc;
  11797. term*: TerminationHandler;
  11798. exTable*: ExceptionTable;
  11799. noProcs*: LONGINT;
  11800. firstProc*: ADDRESS; <- done by loader
  11801. maxPtrs*: LONGINT;
  11802. crc*: LONGINT;
  11803. *)
  11804. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11805. BEGIN
  11806. Info(section, "cycle");
  11807. Size(section,0);
  11808. Info(section, "references");
  11809. Size(section,0);
  11810. Info(section, "nextMarked");
  11811. Address(section,0);
  11812. Info(section, "nextWatched");
  11813. Address(section,0);
  11814. END BasePointer;
  11815. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11816. BEGIN
  11817. BasePointer(section);
  11818. Info(section, "action");
  11819. Address(section,0);
  11820. Info(section, "monitor");
  11821. Address(section,0);
  11822. END BaseObject;
  11823. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11824. BEGIN
  11825. BasePointer(section);
  11826. Info(section, "action");
  11827. Address(section,0);
  11828. Info(section, "monitor");
  11829. Address(section,0);
  11830. END BaseRecord;
  11831. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11832. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11833. pooledName: Basic.SegmentedName;
  11834. symbol: SyntaxTree.Symbol;
  11835. BEGIN
  11836. Global.GetModuleName(module.module,name);
  11837. Strings.Append(name,".@Module.@Descriptor");
  11838. Basic.ToSegmentedName(name, pooledName);
  11839. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11840. Symbol(section,descriptorSection,0,0);
  11841. Info(descriptorSection, "descriptor");
  11842. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11843. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11844. Address(descriptorSection,0);
  11845. Global.GetModuleName(module.module,name);
  11846. Strings.Append(name,".@Trace");
  11847. Basic.ToSegmentedName(name, pooledName);
  11848. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11849. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11850. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11851. END ModuleDescriptor;
  11852. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11853. VAR name: ARRAY 128 OF CHAR;
  11854. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11855. symbol: SyntaxTree.Symbol;
  11856. BEGIN
  11857. ASSERT(implementationVisitor.backend.newObjectFile);
  11858. Global.GetModuleName(module.module,name);
  11859. Strings.Append(name,".@Module");
  11860. Basic.ToSegmentedName(name, pooledName);
  11861. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11862. moduleSection.SetExported(TRUE);
  11863. IF moduleSection.pc = 0 THEN
  11864. IF implementationVisitor.backend.cooperative THEN
  11865. Info(moduleSection, "descriptor");
  11866. ModuleDescriptor(moduleSection);
  11867. BaseObject(moduleSection);
  11868. implementationVisitor.CreateTraceModuleMethod(module.module);
  11869. ELSE
  11870. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11871. Info(moduleSection, "HeapBlock");
  11872. Symbol(moduleSection,moduleSection,2,0);
  11873. Info(moduleSection, "TypeDescriptor");
  11874. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11875. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11876. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11877. END;
  11878. END;
  11879. RETURN moduleSection;
  11880. END ModuleSection;
  11881. PROCEDURE NewModuleInfo();
  11882. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11883. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11884. sectionName: Basic.SectionName;
  11885. CONST MPO=-40000000H;
  11886. BEGIN
  11887. (*
  11888. TypeDesc* = POINTER TO RECORD
  11889. descSize: SIZE;
  11890. sentinel: LONGINT; (* = MPO-4 *)
  11891. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11892. flags*: SET;
  11893. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11894. name*: Name;
  11895. refsOffset: SIZE;
  11896. END;
  11897. *)
  11898. (*name is missing prefixes sometimes*)
  11899. Global.GetModuleSegmentedName(module.module,name);
  11900. Basic.AppendToSegmentedName(name,".@Info");
  11901. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11902. IF ~implementationVisitor.backend.cooperative THEN
  11903. Info(source, "HeapBlock");
  11904. Address(source,0); (* an empty heap block prevents GC marking *)
  11905. Info(source, "TypeDescriptor");
  11906. Address(source,0);
  11907. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11908. END;
  11909. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11910. Address(source,MPO-4);
  11911. Info(source, "type tag pointer");
  11912. Address( source,0);
  11913. Info(source, "type flags");
  11914. flags := {};
  11915. Set( source, flags);
  11916. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11917. Info(source, "pointer to module");
  11918. moduleSection := ModuleSection();
  11919. Symbol( source, moduleSection, moduleSection.pc,0);
  11920. Info(source, "type name");
  11921. i := 0;
  11922. sectionName := "@Self";
  11923. (*
  11924. Global.GetSymbolSegmentedName(td,name);
  11925. Basic.SegmentedNameToString(name, sectionName);
  11926. *)
  11927. Name(source,sectionName);
  11928. source.SetReferenced(FALSE);
  11929. patchInfoPC := source.pc;
  11930. Size(source, 0);
  11931. END NewModuleInfo;
  11932. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11933. VAR
  11934. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11935. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11936. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11937. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11938. referenceSectionOffset : LONGINT;
  11939. name: Basic.SegmentedName; offset: LONGINT;
  11940. flags: SET;
  11941. BEGIN
  11942. NewModuleInfo();
  11943. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11944. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11945. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11946. ImportsArray(importSection);
  11947. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11948. CommandArray(commandsSection);
  11949. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11950. ExceptionArray(exceptionSection);
  11951. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11952. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11953. TypeInfoSection(typeInfoSection);
  11954. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11955. References(referenceSection);
  11956. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11957. ProcedureDescriptorArray(procTableSection, numberProcs);
  11958. IF ProtectModulesPointers THEN
  11959. name := "Heaps.AnyPtr";
  11960. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11961. (* set base pointer *)
  11962. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11963. END;
  11964. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11965. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11966. moduleSection := ModuleSection();
  11967. Info(moduleSection, "nextRoot*: RootObject");
  11968. Address(moduleSection,0);
  11969. Info(moduleSection, "next*: Module");
  11970. Address(moduleSection,0);
  11971. Info(moduleSection, "name*: Name");
  11972. Name(moduleSection,moduleName);
  11973. Info(moduleSection, "init, published: BOOLEAN");
  11974. Boolean(moduleSection,FALSE);
  11975. Boolean(moduleSection,FALSE);
  11976. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11977. Boolean(moduleSection,FALSE);
  11978. Boolean(moduleSection,FALSE);
  11979. Info(moduleSection, "refcnt*: LONGINT");
  11980. Longint(moduleSection,0);
  11981. Info(moduleSection, "sb*: ADDRESS");
  11982. Address(moduleSection,0);
  11983. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11984. Address(moduleSection,0);
  11985. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11986. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11987. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11988. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11989. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11990. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11991. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11992. Symbol(moduleSection,importSection,importSectionOffset,0);
  11993. Info(moduleSection, "procTable*: ProcTable");
  11994. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11995. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11996. Address(moduleSection,0);
  11997. Address(moduleSection,0);
  11998. Address(moduleSection,0);
  11999. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12000. Info(moduleSection, "export*: ExportDesc");
  12001. ExportDesc(moduleSection);
  12002. Info(moduleSection, "term*: TerminationHandler");
  12003. Address(moduleSection,0);
  12004. Info(moduleSection, "exTable*: ExceptionTable");
  12005. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12006. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12007. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12008. Info(moduleSection, "crc*: LONGINT");
  12009. patchCRC:= moduleSection.pc;
  12010. Longint(moduleSection, 0); (*! must be implemented *)
  12011. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12012. Info(moduleSection, "body*: ADDRESS");
  12013. Symbol(moduleSection, bodyProc, 0,0);
  12014. Info(moduleSection, "module flags");
  12015. flags := {};
  12016. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12017. Set( moduleSection, flags);
  12018. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  12019. IF implementationVisitor.backend.cooperative THEN
  12020. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12021. Info(moduleSection, "monitor.owner");
  12022. Address(moduleSection,0);
  12023. Info(moduleSection, "monitor.nestingLevel");
  12024. Address(moduleSection,0);
  12025. Info(moduleSection, "monitor.blockedQueue");
  12026. Address(moduleSection,0); Address(moduleSection,0);
  12027. Info(moduleSection, "monitor.waitingQueue");
  12028. Address(moduleSection,0); Address(moduleSection,0);
  12029. Info(moduleSection, "monitor.waitingSentinel");
  12030. Address(moduleSection,0);
  12031. END;
  12032. END Module;
  12033. PROCEDURE PatchCRC(crc: LONGINT);
  12034. BEGIN
  12035. IF implementationVisitor.newObjectFile & ~simple THEN
  12036. PatchLongint(ModuleSection(), patchCRC, crc);
  12037. END;
  12038. END PatchCRC;
  12039. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12040. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12041. BEGIN
  12042. ArrayBlock(source,pc,"",FALSE);
  12043. Info(source, "pointer offsets array data");
  12044. IF scope IS SyntaxTree.RecordScope THEN
  12045. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12046. ELSIF scope IS SyntaxTree.CellScope THEN
  12047. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12048. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12049. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12050. WHILE variable # NIL DO
  12051. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12052. symbol := module.allSections.FindBySymbol(variable);
  12053. ASSERT(symbol # NIL);
  12054. Pointers(0,symbol, source,variable.type,numberPointers);
  12055. END;
  12056. variable := variable.nextVariable;
  12057. END;
  12058. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12059. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12060. WHILE parameter # NIL DO
  12061. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12062. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12063. END;
  12064. parameter := parameter.nextParameter;
  12065. END;
  12066. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12067. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12068. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12069. IF implementationVisitor.backend.preciseGC THEN
  12070. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12071. END;
  12072. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12073. END;
  12074. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12075. WHILE(variable # NIL) DO
  12076. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12077. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12078. END;
  12079. variable := variable.nextVariable
  12080. END;
  12081. END;
  12082. PatchArray(source,pc,numberPointers);
  12083. END PointerArray;
  12084. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12085. VAR
  12086. name: Basic.SegmentedName;
  12087. section: IntermediateCode.Section;
  12088. BEGIN
  12089. ASSERT(implementationVisitor.newObjectFile);
  12090. Global.GetSymbolSegmentedName(symbol,name);
  12091. Basic.AppendToSegmentedName(name,suffix);
  12092. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12093. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12094. Info(section, "HeapBlock");
  12095. Address(section,0); (* empty such that GC does not go on traversing *)
  12096. Info(section, suffix);
  12097. Address(section,0);
  12098. pc := section.pc;
  12099. RETURN section;
  12100. END SymbolSection;
  12101. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12102. VAR recordType: SyntaxTree.RecordType;
  12103. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12104. section: Sections.Section; cellType: SyntaxTree.CellType;
  12105. tdInfoOffset: LONGINT;
  12106. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12107. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12108. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12109. sectionName: Basic.SectionName;
  12110. CONST MPO=-40000000H;
  12111. BEGIN
  12112. (*
  12113. TypeDesc* = POINTER TO RECORD
  12114. descSize: SIZE;
  12115. sentinel: LONGINT; (* = MPO-4 *)
  12116. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12117. flags*: SET;
  12118. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12119. name*: Name;
  12120. refsOffset: SIZE;
  12121. END;
  12122. *)
  12123. (* source := module.sections.FindByName(...) *)
  12124. Global.GetSymbolSegmentedName(td,name);
  12125. Basic.AppendToSegmentedName(name,".@Info");
  12126. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12127. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12128. Address(source,0);
  12129. Info(source, "TypeDescriptor");
  12130. Address(source,0);
  12131. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12132. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12133. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12134. Info(source, "type tag pointer");
  12135. Symbol( source, tag, offset, 0);
  12136. Info(source, "type flags");
  12137. flags := {};
  12138. IF isProtected THEN INCL(flags,31) END;
  12139. Set( source, flags);
  12140. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12141. Info(source, "pointer to module");
  12142. moduleSection := ModuleSection();
  12143. Symbol( source, moduleSection, moduleSection.pc,0);
  12144. Info(source, "type name");
  12145. i := 0;
  12146. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12147. (*
  12148. Global.GetSymbolSegmentedName(td,name);
  12149. Basic.SegmentedNameToString(name, sectionName);
  12150. *)
  12151. Name(source,sectionName);
  12152. source.SetReferenced(FALSE);
  12153. Size(source, 0);
  12154. RETURN source;
  12155. END NewTypeDescriptorInfo;
  12156. PROCEDURE NewTypeDescriptor;
  12157. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12158. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12159. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12160. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12161. CONST MPO=-40000000H;
  12162. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12163. VAR i: LONGINT;
  12164. PROCEDURE Td(record: SyntaxTree.RecordType);
  12165. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12166. BEGIN
  12167. IF record # NIL THEN
  12168. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12169. baseTD := record.typeDeclaration;
  12170. Global.GetSymbolSegmentedName(baseTD,name);
  12171. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12172. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12173. ELSE
  12174. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12175. END;
  12176. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12177. Symbol(source, tir, 0, offset);
  12178. IF reverse THEN Td(record.GetBaseRecord()) END;
  12179. END;
  12180. END Td;
  12181. BEGIN
  12182. Info(source, "tag table");
  12183. baseRecord := recordType;
  12184. i := 0;
  12185. WHILE baseRecord # NIL DO
  12186. INC(i);
  12187. baseRecord := baseRecord.GetBaseRecord();
  12188. END;
  12189. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12190. IF ~reverse THEN Td(recordType) END;
  12191. WHILE i < size DO
  12192. Address(source,0);
  12193. INC(i);
  12194. END;
  12195. IF reverse THEN Td(recordType) END;
  12196. END TdTable;
  12197. PROCEDURE MethodTable(reverse: BOOLEAN);
  12198. VAR i,methods: LONGINT;
  12199. BEGIN
  12200. Info(source, "method table");
  12201. IF recordType # NIL THEN
  12202. methods := recordType.recordScope.numberMethods;
  12203. IF reverse THEN
  12204. FOR i := methods-1 TO 0 BY -1 DO
  12205. procedure := recordType.recordScope.FindMethod(i);
  12206. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12207. NamedSymbol(source, name,procedure, 0,0);
  12208. END;
  12209. ELSE
  12210. FOR i := 0 TO methods-1 DO
  12211. procedure := recordType.recordScope.FindMethod(i);
  12212. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12213. NamedSymbol(source, name,procedure, 0,0);
  12214. END;
  12215. END;
  12216. END;
  12217. END MethodTable;
  12218. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12219. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12220. BEGIN
  12221. Info(source, "method table");
  12222. baseRecord := recordType;
  12223. WHILE baseRecord.baseType # NIL DO
  12224. baseRecord := baseRecord.GetBaseRecord ();
  12225. END;
  12226. GetRecordTypeName (baseRecord, name);
  12227. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12228. IF name = stackFrame THEN
  12229. start := 0;
  12230. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12231. baseRecord := recordType;
  12232. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12233. baseRecord := baseRecord.GetBaseRecord ();
  12234. END;
  12235. IF baseRecord # NIL THEN
  12236. GetRecordTypeName (baseRecord, name);
  12237. IF pointer & ~baseRecord.isObject THEN
  12238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12239. END;
  12240. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12241. ELSIF recordType.isObject THEN
  12242. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12243. ELSIF pointer THEN
  12244. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12245. ELSE
  12246. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12247. END;
  12248. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12249. Symbol(source, tir, 0, 0);
  12250. start := 0;
  12251. baseRecord := recordType;
  12252. WHILE (baseRecord # NIL) DO
  12253. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12254. baseRecord := baseRecord.GetBaseRecord ();
  12255. END;
  12256. ELSE
  12257. (* explicit trace method: *)
  12258. procedure := recordType.recordScope.FindMethod(0);
  12259. IF ~procedure.isFinalizer THEN
  12260. Global.GetSymbolSegmentedName(procedure, name);
  12261. NamedSymbol(source, name,procedure, 0,0);
  12262. END;
  12263. start := 1;
  12264. END;
  12265. IF (name # stackFrame) & recordType.isObject THEN
  12266. baseRecord := recordType;
  12267. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12268. baseRecord := baseRecord.GetBaseRecord ();
  12269. END;
  12270. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12271. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12272. ELSE
  12273. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12274. END;
  12275. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12276. Symbol(source, tir, 0, 0);
  12277. END;
  12278. methods := recordType.recordScope.numberMethods;
  12279. FOR i := start TO methods-1 DO
  12280. procedure := recordType.recordScope.FindMethod(i);
  12281. IF ~procedure.isFinalizer THEN
  12282. Global.GetSymbolSegmentedName(procedure, name);
  12283. NamedSymbol(source, name,procedure, 0,0);
  12284. END;
  12285. END;
  12286. END CooperativeMethodTable;
  12287. BEGIN
  12288. Global.GetSymbolSegmentedName(td,name);
  12289. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12290. source.SetExported(IsExported(td));
  12291. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12292. IF implementationVisitor.backend.cooperative THEN
  12293. base := NIL;
  12294. baseRecord := recordType.GetBaseRecord();
  12295. IF baseRecord # NIL THEN
  12296. baseTD := baseRecord.typeDeclaration;
  12297. END;
  12298. IF ~recordType.isObject THEN
  12299. Info(source, "parent");
  12300. IF baseRecord # NIL THEN
  12301. Global.GetSymbolSegmentedName(baseTD,name);
  12302. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12303. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12304. ELSE
  12305. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12306. END;
  12307. Symbol(source, tir, 0, 0);
  12308. ELSE
  12309. Address(source,0);
  12310. END;
  12311. Info(source, "record size");
  12312. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12313. source.SetReferenced(FALSE);
  12314. CooperativeMethodTable(FALSE);
  12315. base := source;
  12316. Global.GetSymbolSegmentedName(td,name);
  12317. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12318. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12319. source.SetExported(IsExported(td));
  12320. source.SetReferenced(FALSE);
  12321. END;
  12322. Info(source, "parent");
  12323. IF baseRecord # NIL THEN
  12324. Global.GetSymbolSegmentedName(baseTD,name);
  12325. sym := baseTD;
  12326. IF ~recordType.isObject THEN
  12327. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12328. sym := NIL;
  12329. END;
  12330. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12331. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12332. ELSE
  12333. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12334. END;
  12335. Symbol(source, tir, 0, 0);
  12336. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12337. Address(source,0);
  12338. ELSE
  12339. IF recordType.isObject THEN
  12340. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12341. ELSE
  12342. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12343. END;
  12344. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12345. Symbol(source, tir, 0, 0);
  12346. END;
  12347. Info(source, "base record descriptor");
  12348. Symbol(source, base, 0, 0);
  12349. CooperativeMethodTable(TRUE);
  12350. source.SetReferenced(FALSE);
  12351. IF recordType.hasPointers THEN
  12352. IF ~HasExplicitTraceMethod (recordType) THEN
  12353. implementationVisitor.CreateTraceMethod(recordType);
  12354. END;
  12355. implementationVisitor.CreateResetProcedure(recordType);
  12356. implementationVisitor.CreateAssignProcedure(recordType);
  12357. END;
  12358. ELSIF ~simple THEN
  12359. (*
  12360. MethodEnd = MPO
  12361. ---
  12362. methods (# methods)
  12363. ---
  12364. tags (16)
  12365. ---
  12366. TypeDesc = TypeInfoAdr
  12367. ---
  12368. td adr ---> rec size
  12369. ----
  12370. pointer offsets
  12371. ----
  12372. (padding)
  12373. -----
  12374. empty [2 addresses aligned]
  12375. empty
  12376. empty
  12377. numPtrs
  12378. ---
  12379. pointer offsets
  12380. ---
  12381. *)
  12382. Info(source, "MethodEnd = MPO");
  12383. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12384. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12385. MethodTable(TRUE);
  12386. TdTable(TypeTags, TRUE);
  12387. Info(source, "type descriptor info pointer");
  12388. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12389. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12390. IF (cellType # NIL) THEN
  12391. IF cellType.sizeInBits < 0 THEN
  12392. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12393. END;
  12394. Info(source, "cell size");
  12395. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12396. ELSE
  12397. Info(source, "record size");
  12398. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12399. END;
  12400. Info(source, "pointer offsets pointer");
  12401. padding := 1- source.pc MOD 2;
  12402. Symbol(source, source, source.pc+1+padding,0);
  12403. IF padding >0 THEN
  12404. Info(source, "padding");
  12405. FOR i := 1 TO padding DO Address(source,0) END;
  12406. END;
  12407. IF cellType # NIL THEN
  12408. PointerArray(source, cellType.cellScope, numberPointers);
  12409. ELSE
  12410. PointerArray(source, recordType.recordScope, numberPointers);
  12411. END;
  12412. ELSE
  12413. (*
  12414. simple:
  12415. td adr --> size
  12416. tag(1)
  12417. tag(2)
  12418. tag(3)
  12419. methods ->
  12420. *)
  12421. Info(source, "record size");
  12422. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12423. TdTable(TypeTags, FALSE);
  12424. MethodTable(FALSE);
  12425. source.SetReferenced(FALSE);
  12426. END;
  12427. END NewTypeDescriptor;
  12428. BEGIN
  12429. x := x.resolved;
  12430. IF (x IS SyntaxTree.PointerType) THEN
  12431. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12432. END;
  12433. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12434. recordType := x(SyntaxTree.RecordType);
  12435. td := x.typeDeclaration;
  12436. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12437. ASSERT(td # NIL);
  12438. section := module.allSections.FindBySymbol(td); (* TODO *)
  12439. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12440. IF implementationVisitor.newObjectFile THEN
  12441. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12442. NewTypeDescriptor
  12443. END;
  12444. ELSE
  12445. (* data section in intermediate code *)
  12446. Global.GetSymbolSegmentedName(td,name);
  12447. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12448. Basic.SuffixSegmentedName (name, module.module.name);
  12449. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12450. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12451. tir.Emit(Data(Basic.invalidPosition,op));
  12452. END;
  12453. END;
  12454. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12455. cellType := x(SyntaxTree.CellType);
  12456. td := x.typeDeclaration;
  12457. section := module.allSections.FindBySymbol(td); (* TODO *)
  12458. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12459. IF implementationVisitor.newObjectFile THEN
  12460. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12461. NewTypeDescriptor
  12462. END;
  12463. END;
  12464. END;
  12465. END
  12466. END CheckTypeDeclaration
  12467. END MetaDataGenerator;
  12468. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12469. VAR
  12470. trace-: BOOLEAN;
  12471. traceString-: SyntaxTree.IdentifierString;
  12472. traceModuleName-: SyntaxTree.IdentifierString;
  12473. newObjectFile-: BOOLEAN;
  12474. profile-: BOOLEAN;
  12475. noRuntimeChecks: BOOLEAN;
  12476. simpleMetaData-: BOOLEAN;
  12477. noAsserts: BOOLEAN;
  12478. optimize-: BOOLEAN;
  12479. cooperative-: BOOLEAN;
  12480. preregisterStatic-: BOOLEAN;
  12481. dump-: Basic.Writer;
  12482. cellsAreObjects: BOOLEAN;
  12483. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12484. experiment: BOOLEAN;
  12485. PROCEDURE &InitIntermediateBackend*;
  12486. BEGIN
  12487. simpleMetaData := FALSE;
  12488. newObjectFile := FALSE;
  12489. InitBackend;
  12490. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12491. SetTraceModuleName(DefaultTraceModuleName);
  12492. END InitIntermediateBackend;
  12493. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12494. VAR
  12495. declarationVisitor: DeclarationVisitor;
  12496. implementationVisitor: ImplementationVisitor;
  12497. module: Sections.Module;
  12498. name, platformName: SyntaxTree.IdentifierString;
  12499. meta: MetaDataGenerator;
  12500. crc: CRC.CRC32Stream;
  12501. BEGIN
  12502. ResetError;
  12503. Global.GetSymbolName(x,name);
  12504. NEW(module,x,system); (* backend structures *)
  12505. Global.GetModuleName(x, name);
  12506. module.SetModuleName(name);
  12507. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12508. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12509. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12510. declarationVisitor.Module(x,module);
  12511. IF newObjectFile & ~meta.simple THEN
  12512. meta.Module(implementationVisitor.moduleBodySection);
  12513. END;
  12514. GetDescription(platformName);
  12515. module.SetPlatformName(platformName);
  12516. IF newObjectFile THEN
  12517. NEW(crc);
  12518. module.allSections.WriteRaw(crc);
  12519. crc.Update;
  12520. meta.PatchCRC(crc.GetCRC());
  12521. END;
  12522. RETURN module
  12523. END GenerateIntermediate;
  12524. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12525. BEGIN RETURN TRUE
  12526. END SupportedImmediate;
  12527. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12528. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12529. END ProcessSyntaxTreeModule;
  12530. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12531. VAR
  12532. result: Sections.Module;
  12533. traceName: Basic.MessageString;
  12534. BEGIN
  12535. ASSERT(intermediateCodeModule IS Sections.Module);
  12536. result := intermediateCodeModule(Sections.Module);
  12537. IF trace THEN
  12538. traceName := "intermediate code trace: ";
  12539. Strings.Append(traceName,traceString);
  12540. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12541. IF (traceString="") OR (traceString="*") THEN
  12542. result.Dump(dump);
  12543. dump.Update
  12544. ELSE
  12545. Sections.DumpFiltered(dump, result, traceString);
  12546. END
  12547. END;
  12548. RETURN result
  12549. END ProcessIntermediateCodeModule;
  12550. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12551. BEGIN instructionSet := "Intermediate";
  12552. END GetDescription;
  12553. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12554. BEGIN
  12555. SELF.newObjectFile := newObjectFile;
  12556. SELF.simpleMetaData := simpleMetaData;
  12557. END SetNewObjectFile;
  12558. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12559. BEGIN COPY(name, traceModuleName)
  12560. END SetTraceModuleName;
  12561. PROCEDURE DefineOptions(options: Options.Options);
  12562. BEGIN
  12563. DefineOptions^(options);
  12564. options.Add(0X,"trace",Options.String);
  12565. options.Add(0X,"runtime",Options.String);
  12566. options.Add(0X,"newObjectFile",Options.Flag);
  12567. options.Add(0X,"traceModule",Options.String);
  12568. options.Add(0X,"profile",Options.Flag);
  12569. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12570. options.Add(0X,"noAsserts",Options.Flag);
  12571. options.Add(0X,"metaData",Options.String);
  12572. options.Add('o',"optimize", Options.Flag);
  12573. options.Add(0X,"preregisterStatic", Options.Flag);
  12574. options.Add(0X,"cellsAreObjects", Options.Flag);
  12575. options.Add(0X,"preciseGC", Options.Flag);
  12576. options.Add(0X,"trackLeave", Options.Flag);
  12577. options.Add(0X,"writeBarriers", Options.Flag);
  12578. options.Add(0X,"experiment", Options.Flag);
  12579. END DefineOptions;
  12580. PROCEDURE GetOptions(options: Options.Options);
  12581. VAR name,string: SyntaxTree.IdentifierString;
  12582. BEGIN
  12583. GetOptions^(options);
  12584. trace := options.GetString("trace",traceString);
  12585. profile := options.GetFlag("profile");
  12586. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12587. noAsserts := options.GetFlag("noAsserts");
  12588. cooperative := options.GetFlag("cooperative");
  12589. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12590. IF cooperative THEN
  12591. SetRuntimeModuleName("CPU") END
  12592. END;
  12593. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12594. simpleMetaData := TRUE
  12595. END;
  12596. IF options.GetString("metaData",string) THEN
  12597. IF string = "simple" THEN simpleMetaData := TRUE
  12598. ELSIF string ="full" THEN simpleMetaData := FALSE
  12599. END;
  12600. END;
  12601. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12602. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12603. optimize := options.GetFlag("optimize");
  12604. preregisterStatic := options.GetFlag("preregisterStatic");
  12605. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12606. preciseGC := options.GetFlag("preciseGC");
  12607. trackLeave := options.GetFlag("trackLeave");
  12608. writeBarriers := options.GetFlag("writeBarriers");
  12609. experiment := options.GetFlag("experiment");
  12610. END GetOptions;
  12611. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12612. BEGIN RETURN SymbolFileFormat.Get()
  12613. END DefaultSymbolFileFormat;
  12614. END IntermediateBackend;
  12615. (* ----------------------------------- register allocation ------------------------------------- *)
  12616. (* register mapping scheme
  12617. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12618. spill offset
  12619. part(n) --> ticket <--> physical register
  12620. spill offset
  12621. *)
  12622. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12623. emptyOperand: IntermediateCode.Operand;
  12624. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12625. statCoopResetVariables: LONGINT;
  12626. statCoopModifyAssignments: LONGINT;
  12627. modifyAssignmentsPC : LONGINT;
  12628. statCoopNilCheck: LONGINT;
  12629. statCoopSwitch: LONGINT;
  12630. statCoopAssignProcedure: LONGINT;
  12631. statCoopTraceMethod: LONGINT;
  12632. statCoopResetProcedure: LONGINT;
  12633. statCoopTraceModule: LONGINT;
  12634. PROCEDURE ResetStatistics*;
  12635. BEGIN
  12636. statCoopResetVariables := 0;
  12637. statCoopModifyAssignments := 0;
  12638. statCoopNilCheck:= 0;
  12639. statCoopSwitch:= 0;
  12640. statCoopAssignProcedure:= 0;
  12641. statCoopTraceMethod:= 0;
  12642. statCoopResetProcedure:= 0;
  12643. statCoopTraceModule:= 0;
  12644. END ResetStatistics;
  12645. PROCEDURE Statistics*;
  12646. BEGIN
  12647. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12648. TRACE(statCoopNilCheck, statCoopSwitch);
  12649. TRACE(statCoopAssignProcedure,
  12650. statCoopTraceMethod,
  12651. statCoopResetProcedure,
  12652. statCoopTraceModule)
  12653. END Statistics;
  12654. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12655. VAR h: LONGINT;
  12656. BEGIN
  12657. WHILE b # 0 DO
  12658. h := a MOD b;
  12659. a := b;
  12660. b := h;
  12661. END;
  12662. RETURN a
  12663. END GCD;
  12664. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12665. BEGIN
  12666. RETURN a*b DIV GCD(a,b)
  12667. END SCM;
  12668. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12669. BEGIN
  12670. (*TRACE(a,b);*)
  12671. IF a = 0 THEN RETURN b
  12672. ELSIF b = 0 THEN RETURN a
  12673. ELSE RETURN SCM(a,b)
  12674. END;
  12675. END CommonAlignment;
  12676. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12677. BEGIN
  12678. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12679. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12680. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12681. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12682. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12683. END
  12684. END PassBySingleReference;
  12685. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12686. BEGIN
  12687. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12688. END PassInRegister;
  12689. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12690. VAR new: RegisterEntry;
  12691. BEGIN
  12692. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12693. IF queue = NIL THEN
  12694. queue := new
  12695. ELSE
  12696. new.next := queue;
  12697. IF queue#NIL THEN queue.prev := new END;
  12698. queue := new
  12699. END;
  12700. END AddRegisterEntry;
  12701. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12702. VAR this: RegisterEntry;
  12703. BEGIN
  12704. this := queue;
  12705. WHILE (this # NIL) & (this.register # register) DO
  12706. this := this.next;
  12707. END;
  12708. IF this = NIL THEN
  12709. RETURN FALSE
  12710. END;
  12711. ASSERT(this # NIL);
  12712. IF this = queue THEN queue := queue.next END;
  12713. IF this.prev # NIL THEN this.prev.next := this.next END;
  12714. IF this.next # NIL THEN this.next.prev := this.prev END;
  12715. RETURN TRUE
  12716. END RemoveRegisterEntry;
  12717. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12718. BEGIN ASSERT(cond);
  12719. END Assert;
  12720. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12721. BEGIN
  12722. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12723. END ReusableRegister;
  12724. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12725. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12726. BEGIN
  12727. procedure := moduleScope.bodyProcedure;
  12728. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12729. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12730. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12731. procedure.SetScope(moduleScope);
  12732. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12733. procedure.SetAccess(SyntaxTree.Hidden);
  12734. moduleScope.SetBodyProcedure(procedure);
  12735. moduleScope.AddProcedure(procedure);
  12736. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12737. END;
  12738. END EnsureBodyProcedure;
  12739. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12740. VAR import: SyntaxTree.Import;
  12741. selfName: SyntaxTree.IdentifierString;
  12742. module: SyntaxTree.Module;
  12743. BEGIN
  12744. scope.ownerModule.GetName(selfName);
  12745. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12746. module := scope.ownerModule
  12747. ELSE
  12748. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12749. IF import = NIL THEN
  12750. RETURN NIL
  12751. ELSIF import.module = NIL THEN
  12752. RETURN NIL
  12753. ELSE module := import.module
  12754. END;
  12755. END;
  12756. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12757. END GetSymbol;
  12758. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12759. BEGIN
  12760. op.mode := mode;
  12761. IntermediateCode.InitOperand(op.op);
  12762. IntermediateCode.InitOperand(op.tag);
  12763. IntermediateCode.InitOperand(op.extra);
  12764. op.dimOffset := 0;
  12765. END InitOperand;
  12766. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12767. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12768. BEGIN RETURN IntermediateCode.GetType(system, type)
  12769. END GetType;
  12770. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12771. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12772. BEGIN
  12773. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12774. (*
  12775. UniqueId(name,module,name,adr);
  12776. *)
  12777. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12778. constant.SetValue(value);
  12779. constant.SetAccess(SyntaxTree.Hidden);
  12780. module.moduleScope.AddConstant(constant);
  12781. constant.SetScope(module.moduleScope);
  12782. RETURN constant
  12783. END BuildConstant;
  12784. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12785. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12786. BEGIN
  12787. variable := scope.firstVariable;
  12788. WHILE variable # NIL DO
  12789. IF variable.NeedsTrace() THEN
  12790. RETURN TRUE;
  12791. END;
  12792. variable := variable.nextVariable;
  12793. END;
  12794. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12795. WHILE parameter # NIL DO
  12796. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12797. RETURN TRUE;
  12798. END;
  12799. parameter := parameter.nextParameter;
  12800. END;
  12801. RETURN FALSE;
  12802. END HasPointers;
  12803. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12804. 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));
  12805. END IsVariableParameter;
  12806. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12807. VAR parameter: SyntaxTree.Parameter;
  12808. BEGIN
  12809. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12810. WHILE parameter # NIL DO
  12811. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12812. IF parameter.movable THEN RETURN TRUE END;
  12813. parameter := parameter.nextParameter;
  12814. END;
  12815. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12816. END HasVariableParameters;
  12817. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12818. BEGIN
  12819. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12820. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12821. END HasExplicitTraceMethod;
  12822. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12823. BEGIN
  12824. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12825. IF (expression IS SyntaxTree.IntegerValue) THEN
  12826. val := expression(SyntaxTree.IntegerValue).value;
  12827. RETURN TRUE
  12828. ELSE
  12829. RETURN FALSE
  12830. END;
  12831. END IsIntegerConstant;
  12832. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12833. BEGIN
  12834. IF val <= 0 THEN RETURN FALSE END;
  12835. exp := 0;
  12836. WHILE ~ODD(val) DO
  12837. val := val DIV 2;
  12838. INC(exp)
  12839. END;
  12840. RETURN val = 1
  12841. END PowerOf2;
  12842. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12843. VAR procedure: SyntaxTree.Procedure;
  12844. BEGIN
  12845. procedure := record.recordScope.constructor;
  12846. IF procedure = NIL THEN
  12847. record := record.GetBaseRecord();
  12848. IF record # NIL THEN
  12849. procedure := GetConstructor(record)
  12850. END;
  12851. END;
  12852. RETURN procedure;
  12853. END GetConstructor;
  12854. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12855. BEGIN
  12856. value := SHORT(op.intValue);
  12857. RETURN op.mode = IntermediateCode.ModeImmediate;
  12858. END IsIntegerImmediate;
  12859. (** whether a type strictily is a pointer to record or object type
  12860. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12861. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12862. BEGIN
  12863. IF type = NIL THEN
  12864. RETURN FALSE
  12865. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12866. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12867. ELSE
  12868. RETURN FALSE
  12869. END
  12870. END IsStrictlyPointerToRecord;
  12871. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12872. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12873. END IsUnsafePointer;
  12874. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12875. BEGIN type := type.resolved;
  12876. IF type IS SyntaxTree.PointerType THEN
  12877. type := type(SyntaxTree.PointerType).pointerBase;
  12878. type := type.resolved;
  12879. IF type IS SyntaxTree.RecordType THEN
  12880. recordType := type(SyntaxTree.RecordType);
  12881. RETURN TRUE
  12882. ELSE
  12883. RETURN FALSE
  12884. END
  12885. ELSIF type IS SyntaxTree.RecordType THEN
  12886. recordType := type(SyntaxTree.RecordType);
  12887. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12888. ELSIF type IS SyntaxTree.ObjectType THEN
  12889. RETURN TRUE
  12890. ELSIF type IS SyntaxTree.AnyType THEN
  12891. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12892. ELSE
  12893. RETURN FALSE
  12894. END;
  12895. END IsPointerToRecord;
  12896. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12897. BEGIN
  12898. type := type.resolved;
  12899. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12900. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12901. END IsArrayOfSystemByte;
  12902. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12903. BEGIN
  12904. IF type = NIL THEN RETURN FALSE END;
  12905. type := type.resolved;
  12906. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12907. END IsOpenArray;
  12908. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12909. BEGIN
  12910. IF type = NIL THEN RETURN FALSE END;
  12911. type := type.resolved;
  12912. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12913. END IsSemiDynamicArray;
  12914. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12915. BEGIN
  12916. IF type = NIL THEN RETURN FALSE END;
  12917. type := type.resolved;
  12918. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12919. END IsStaticArray;
  12920. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12921. BEGIN
  12922. IF type = NIL THEN RETURN FALSE END;
  12923. type := type.resolved;
  12924. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12925. END IsStaticMathArray;
  12926. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12927. BEGIN
  12928. WHILE (IsStaticMathArray(type)) DO
  12929. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12930. END;
  12931. RETURN type;
  12932. END StaticMathArrayBaseType;
  12933. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12934. VAR size: LONGINT;
  12935. BEGIN
  12936. size := 1;
  12937. WHILE (IsStaticArray(type)) DO
  12938. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12939. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12940. END;
  12941. RETURN size;
  12942. END StaticArrayNumElements;
  12943. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12944. VAR size: LONGINT;
  12945. BEGIN
  12946. size := 1;
  12947. WHILE (IsStaticMathArray(type)) DO
  12948. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12949. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12950. END;
  12951. RETURN size;
  12952. END StaticMathArrayNumElements;
  12953. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12954. BEGIN
  12955. WHILE (IsStaticArray(type)) DO
  12956. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12957. END;
  12958. RETURN type;
  12959. END StaticArrayBaseType;
  12960. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12961. BEGIN
  12962. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12963. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12964. END;
  12965. RETURN type;
  12966. END ArrayBaseType;
  12967. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12968. BEGIN
  12969. IF type = NIL THEN RETURN FALSE END;
  12970. type := type.resolved;
  12971. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12972. END IsDelegate;
  12973. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12974. VAR i: LONGINT;
  12975. BEGIN
  12976. i := 0; type := type.resolved;
  12977. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12978. INC(i);
  12979. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12980. END;
  12981. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12982. INC(i);
  12983. type := type(SyntaxTree.MathArrayType).arrayBase;
  12984. IF type # NIL THEN type := type.resolved END;
  12985. END;
  12986. RETURN i
  12987. END DynamicDim;
  12988. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12989. BEGIN
  12990. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12991. type := type(SyntaxTree.ArrayType).arrayBase;
  12992. END;
  12993. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12994. type := type(SyntaxTree.MathArrayType).arrayBase;
  12995. END;
  12996. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12997. END StaticSize;
  12998. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12999. BEGIN
  13000. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13001. END IsImmediate;
  13002. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13003. BEGIN
  13004. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13005. END IsAddress;
  13006. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13007. BEGIN
  13008. RETURN (x.mode = IntermediateCode.ModeRegister);
  13009. END IsRegister;
  13010. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13011. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13012. BEGIN
  13013. typeDeclaration := recordType.typeDeclaration;
  13014. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13015. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13016. END GetRecordTypeName;
  13017. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13018. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13019. BEGIN
  13020. parSize := 0;
  13021. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13022. parameter := procedureType.returnParameter;
  13023. INC(parSize,system.SizeOfParameter(parameter));
  13024. parSize := parSize + (-parSize) MOD system.addressSize;
  13025. END;
  13026. parameter :=procedureType.lastParameter;
  13027. WHILE (parameter # NIL) DO
  13028. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  13029. INC(parSize, system.addressSize);
  13030. ELSE
  13031. INC(parSize,system.SizeOfParameter(parameter));
  13032. parSize := parSize + (-parSize) MOD system.addressSize;
  13033. END;
  13034. parameter := parameter.prevParameter;
  13035. END;
  13036. IF procedureType.selfParameter # NIL THEN
  13037. parameter := procedureType.selfParameter;
  13038. INC(parSize,system.SizeOfParameter(parameter));
  13039. parSize := parSize + (-parSize) MOD system.addressSize;
  13040. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13041. END; (* method => self pointer *)
  13042. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13043. RETURN ToMemoryUnits(system,parSize)
  13044. END ParametersSize;
  13045. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13046. BEGIN
  13047. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13048. END IsNested;
  13049. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13050. BEGIN
  13051. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13052. scope := scope.outerScope;
  13053. END;
  13054. RETURN scope # NIL;
  13055. END InCellScope;
  13056. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13057. BEGIN
  13058. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13059. RETURN 0
  13060. ELSE
  13061. *)
  13062. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13063. (*END;*)
  13064. END ProcedureParametersSize;
  13065. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13066. VAR dataUnit: LONGINT;
  13067. BEGIN dataUnit := system.dataUnit;
  13068. ASSERT(size MOD system.dataUnit = 0);
  13069. RETURN LONGINT(size DIV system.dataUnit)
  13070. END ToMemoryUnits;
  13071. PROCEDURE Get*(): Backend.Backend;
  13072. VAR backend: IntermediateBackend;
  13073. BEGIN NEW(backend); RETURN backend
  13074. END Get;
  13075. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13076. VAR instruction: IntermediateCode.Instruction;
  13077. BEGIN
  13078. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13079. RETURN instruction
  13080. END Nop;
  13081. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13082. VAR instruction: IntermediateCode.Instruction;
  13083. BEGIN
  13084. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13085. RETURN instruction
  13086. END Mov;
  13087. (* like Mov but ensures that no new register will be allocated for dest *)
  13088. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13089. VAR instruction: IntermediateCode.Instruction;
  13090. BEGIN
  13091. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13092. RETURN instruction
  13093. END MovReplace;
  13094. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13095. VAR instruction: IntermediateCode.Instruction;
  13096. BEGIN
  13097. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13098. RETURN instruction
  13099. END Conv;
  13100. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13101. BEGIN
  13102. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13103. END SysvABI;
  13104. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13105. BEGIN
  13106. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13107. END SysvABIorWINAPI;
  13108. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13109. VAR instruction: IntermediateCode.Instruction;
  13110. BEGIN
  13111. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13112. RETURN instruction
  13113. END Call;
  13114. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13115. VAR op1, op2, op3: IntermediateCode.Operand;
  13116. VAR instruction: IntermediateCode.Instruction;
  13117. BEGIN
  13118. IntermediateCode.InitNumber(op1,pcOffset);
  13119. IntermediateCode.InitNumber(op2,callingConvention);
  13120. IntermediateCode.InitNumber(op3,unwind);
  13121. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13122. RETURN instruction
  13123. END Exit;
  13124. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13125. VAR instruction: IntermediateCode.Instruction;
  13126. BEGIN
  13127. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13128. RETURN instruction
  13129. END Return;
  13130. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13131. VAR instruction: IntermediateCode.Instruction;
  13132. BEGIN
  13133. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13134. RETURN instruction
  13135. END Result;
  13136. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13137. VAR op1: IntermediateCode.Operand;
  13138. VAR instruction: IntermediateCode.Instruction;
  13139. BEGIN
  13140. IntermediateCode.InitNumber(op1,nr);
  13141. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13142. RETURN instruction
  13143. END Trap;
  13144. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13145. VAR instruction: IntermediateCode.Instruction;
  13146. BEGIN
  13147. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13148. RETURN instruction
  13149. END Br;
  13150. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13151. VAR instruction: IntermediateCode.Instruction;
  13152. BEGIN
  13153. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13154. RETURN instruction
  13155. END Breq;
  13156. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13157. VAR instruction: IntermediateCode.Instruction;
  13158. BEGIN
  13159. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13160. RETURN instruction
  13161. END Brne;
  13162. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13163. VAR instruction: IntermediateCode.Instruction;
  13164. BEGIN
  13165. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13166. RETURN instruction
  13167. END Brge;
  13168. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13169. VAR instruction: IntermediateCode.Instruction;
  13170. BEGIN
  13171. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13172. RETURN instruction
  13173. END Brlt;
  13174. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13175. VAR instruction: IntermediateCode.Instruction;
  13176. BEGIN
  13177. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13178. RETURN instruction
  13179. END Pop;
  13180. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13181. VAR instruction: IntermediateCode.Instruction;
  13182. BEGIN
  13183. ASSERT(op.mode # IntermediateCode.Undefined);
  13184. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13185. RETURN instruction
  13186. END Push;
  13187. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13188. VAR instruction: IntermediateCode.Instruction;
  13189. BEGIN
  13190. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13191. RETURN instruction
  13192. END Neg;
  13193. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13194. VAR instruction: IntermediateCode.Instruction;
  13195. BEGIN
  13196. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13197. RETURN instruction
  13198. END Not;
  13199. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13200. VAR instruction: IntermediateCode.Instruction;
  13201. BEGIN
  13202. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13203. RETURN instruction
  13204. END Abs;
  13205. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13206. VAR instruction: IntermediateCode.Instruction;
  13207. BEGIN
  13208. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13209. ASSERT(~IsImmediate(instruction.op1));
  13210. RETURN instruction
  13211. END Mul;
  13212. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13213. VAR instruction: IntermediateCode.Instruction;
  13214. BEGIN
  13215. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13216. RETURN instruction
  13217. END Div;
  13218. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13219. VAR instruction: IntermediateCode.Instruction;
  13220. BEGIN
  13221. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13222. RETURN instruction
  13223. END Mod;
  13224. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13225. VAR instruction: IntermediateCode.Instruction;
  13226. BEGIN
  13227. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13228. RETURN instruction
  13229. END Sub;
  13230. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13231. VAR instruction: IntermediateCode.Instruction;
  13232. BEGIN
  13233. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13234. RETURN instruction
  13235. END Add;
  13236. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13237. VAR instruction: IntermediateCode.Instruction;
  13238. BEGIN
  13239. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13240. RETURN instruction
  13241. END And;
  13242. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13243. VAR instruction: IntermediateCode.Instruction;
  13244. BEGIN
  13245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13246. RETURN instruction
  13247. END Or;
  13248. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13249. VAR instruction: IntermediateCode.Instruction;
  13250. BEGIN
  13251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13252. RETURN instruction
  13253. END Xor;
  13254. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13255. VAR instruction: IntermediateCode.Instruction;
  13256. BEGIN
  13257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13258. RETURN instruction
  13259. END Shl;
  13260. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13261. VAR instruction: IntermediateCode.Instruction;
  13262. BEGIN
  13263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13264. RETURN instruction
  13265. END Shr;
  13266. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13267. VAR instruction: IntermediateCode.Instruction;
  13268. BEGIN
  13269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13270. RETURN instruction
  13271. END Rol;
  13272. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13273. VAR instruction: IntermediateCode.Instruction;
  13274. BEGIN
  13275. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13276. RETURN instruction
  13277. END Ror;
  13278. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13279. VAR instruction: IntermediateCode.Instruction;
  13280. BEGIN
  13281. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13282. RETURN instruction
  13283. END Cas;
  13284. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13285. VAR instruction: IntermediateCode.Instruction;
  13286. BEGIN
  13287. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13288. RETURN instruction
  13289. END Copy;
  13290. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13291. VAR instruction: IntermediateCode.Instruction;
  13292. BEGIN
  13293. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13294. RETURN instruction
  13295. END Fill;
  13296. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13297. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13298. BEGIN
  13299. string := IntermediateCode.String(s);
  13300. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13301. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13302. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13303. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13304. RETURN instruction
  13305. END Asm;
  13306. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13307. VAR instruction: IntermediateCode.Instruction;
  13308. BEGIN
  13309. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13310. RETURN instruction
  13311. END Data;
  13312. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13313. VAR instruction: IntermediateCode.Instruction;
  13314. BEGIN
  13315. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13316. IntermediateCode.SetSubType(instruction, subtype);
  13317. RETURN instruction
  13318. END SpecialInstruction;
  13319. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13320. VAR op1: IntermediateCode.Operand;
  13321. VAR instruction: IntermediateCode.Instruction;
  13322. BEGIN
  13323. (*! generate a warning if size exceeds a certain limit *)
  13324. (*
  13325. ASSERT(bytes < 1000000); (* sanity check *)
  13326. *)
  13327. ASSERT(0 <= units); (* sanity check *)
  13328. IntermediateCode.InitNumber(op1,units);
  13329. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13330. RETURN instruction
  13331. END Reserve;
  13332. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13333. VAR op1: IntermediateCode.Operand;
  13334. VAR instruction: IntermediateCode.Instruction;
  13335. BEGIN
  13336. IntermediateCode.InitNumber(op1,position.start);
  13337. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13338. RETURN instruction
  13339. END LabelInstruction;
  13340. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13341. VAR pc: LONGINT;
  13342. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13343. BEGIN
  13344. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13345. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13346. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13347. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13348. IF instr.op1.type.form = IntermediateCode.Float THEN
  13349. RETURN instr.op1.floatValue = op.floatValue
  13350. ELSE
  13351. RETURN instr.op1.intValue = op.intValue
  13352. END;
  13353. END ProvidesValue;
  13354. BEGIN
  13355. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13356. pc := 0;
  13357. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13358. INC(pc);
  13359. END;
  13360. IF pc = data.pc THEN
  13361. data.Emit(Data(Basic.invalidPosition,vop));
  13362. END;
  13363. RETURN pc
  13364. END EnterImmediate;
  13365. PROCEDURE Init;
  13366. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13367. BEGIN
  13368. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13369. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13370. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13371. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13372. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13373. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13374. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13375. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13376. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13377. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13378. IntermediateCode.InitOperand(emptyOperand);
  13379. FOR i := 0 TO NumberSystemCalls-1 DO
  13380. name := "@SystemCall";
  13381. Basic.AppendNumber(name,i);
  13382. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13383. END;
  13384. END Init;
  13385. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13386. BEGIN
  13387. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13388. END IsExported;
  13389. BEGIN
  13390. Init;
  13391. END FoxIntermediateBackend.
  13392. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13393. # Release.Build --path="/temp/obg/" Win32G ~
  13394. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13395. FStols.CloseFiles A2Z.exe ~
  13396. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13397. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13398. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13399. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13400. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13401. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13402. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13403. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13404. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13405. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13406. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod