FoxIntermediateBackend.Mod 583 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825148261482714828148291483014831148321483314834148351483614837148381483914840148411484214843148441484514846148471484814849148501485114852148531485414855148561485714858148591486014861148621486314864148651486614867148681486914870148711487214873148741487514876148771487814879148801488114882148831488414885148861488714888148891489014891148921489314894148951489614897148981489914900
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  88. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. registerNumber: LONGINT;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. ELSE
  762. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  763. END;
  764. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  765. IF finalizer THEN
  766. IF backend.hasLinkRegister THEN
  767. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  768. END;
  769. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  770. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  771. ir.Emit(Br(x.position,dest));
  772. ELSE
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. ELSE
  776. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  777. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  778. END;
  779. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  780. IF backend.cooperative THEN
  781. IF HasPointers (scope) THEN
  782. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  783. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  784. ir.Emit(Result(x.position, res));
  785. ir.Emit(Push(x.position, res));
  786. implementationVisitor.ResetVariables(scope);
  787. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  788. ir.Emit(Pop(x.position, res));
  789. ir.Emit(Return(x.position, res));
  790. ELSE
  791. implementationVisitor.ResetVariables(scope);
  792. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  793. END;
  794. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  795. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  796. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  797. ir.Emit(Result(x.position, res));
  798. ir.Emit(Push(x.position, res));
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. ir.Emit(Pop(x.position, res));
  801. ir.Emit(Return(x.position, res));
  802. ELSE
  803. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  804. END;
  805. END;
  806. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  807. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  808. ELSE
  809. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  810. ir.Emit(Nop(x.position));
  811. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  812. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  813. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  814. END;
  815. END;
  816. END
  817. END;
  818. ELSE (* force body for procedures *)
  819. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  820. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  821. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  822. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  823. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  824. END;
  825. Scope(scope);
  826. Signature;
  827. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  828. currentScope := prevScope;
  829. END Procedure;
  830. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. ASSERT (bodyProcedure # NIL);
  835. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  837. procedure.SetScope(bodyProcedure.scope);
  838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  839. procedure.SetAccess(SyntaxTree.Hidden);
  840. Global.GetSymbolSegmentedName (procedure,name);
  841. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  842. ir.SetExported(TRUE);
  843. Global.GetSymbolSegmentedName (bodyProcedure,name);
  844. IF ~meta.simple THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  849. ELSIF backend.preregisterStatic THEN
  850. implementationVisitor.currentScope := module.module.moduleScope;
  851. implementationVisitor.section := ir;
  852. implementationVisitor.PushSelfPointer();
  853. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  854. ELSE
  855. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  856. ir.Emit(Call(bodyProcedure.position,op, 0));
  857. END;
  858. END AddBodyCallStub;
  859. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  860. VAR name: Basic.SegmentedName;
  861. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  862. BEGIN
  863. Global.GetSymbolSegmentedName (symbol,name);
  864. Basic.RemoveSuffix(name);
  865. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  866. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  867. ir.SetExported(TRUE);
  868. IntermediateCode.InitImmediate(op,addressType,initStack);
  869. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  870. END AddStackAllocation;
  871. (** entry function to visit a complete module *)
  872. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  873. VAR
  874. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  875. hasDynamicOperatorDeclarations: BOOLEAN;
  876. operator: SyntaxTree.Operator;
  877. import: SyntaxTree.Import;
  878. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  879. BEGIN
  880. type := type.resolved;
  881. IF type IS SyntaxTree.RecordType THEN
  882. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  883. ELSIF (type IS SyntaxTree.ArrayType) THEN
  884. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  885. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  886. END;
  887. ELSIF type IS SyntaxTree.MathArrayType THEN
  888. WITH type: SyntaxTree.MathArrayType DO
  889. IF type.form = SyntaxTree.Open THEN
  890. RETURN TRUE
  891. ELSIF type.form = SyntaxTree.Static THEN
  892. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  893. END;
  894. END;
  895. END;
  896. RETURN FALSE
  897. END TypeNeedsInitialization;
  898. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  899. VAR variable: SyntaxTree.Variable;
  900. BEGIN
  901. variable := scope.firstVariable;
  902. WHILE variable # NIL DO
  903. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  904. IF variable.initializer # NIL THEN RETURN TRUE END;
  905. variable := variable.nextVariable;
  906. END;
  907. RETURN FALSE
  908. END ScopeNeedsInitialization;
  909. BEGIN
  910. ASSERT(x # NIL); ASSERT(module # NIL);
  911. SELF.module := module;
  912. (* add import names to the generated Sections.Module *)
  913. import := x.moduleScope.firstImport;
  914. WHILE import # NIL DO
  915. import.module.GetName(idstr);
  916. module.imports.AddName(idstr);
  917. import := import.nextImport
  918. END;
  919. implementationVisitor.module := module;
  920. implementationVisitor.moduleScope := x.moduleScope;
  921. implementationVisitor.moduleSelf := moduleSelf;
  922. implementationVisitor.canBeLoaded := TRUE;
  923. meta.SetModule(module);
  924. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  925. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  926. END;
  927. IF backend.profile THEN
  928. EnsureBodyProcedure(x.moduleScope);
  929. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  930. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  931. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  932. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  933. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  934. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  935. Global.GetModuleName(module.module,idstr);
  936. implementationVisitor.ProfilerAddModule(idstr);
  937. implementationVisitor.numberProcedures := 0;
  938. END;
  939. implementationVisitor.profile := backend.profile;
  940. (* check if there is at least one dynamic operator locally defined *)
  941. hasDynamicOperatorDeclarations := FALSE;
  942. operator := x.moduleScope.firstOperator;
  943. WHILE operator # NIL DO
  944. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  945. operator := operator.nextOperator
  946. END;
  947. (* add operator initialization code section *)
  948. IF hasDynamicOperatorDeclarations THEN
  949. EnsureBodyProcedure(x.moduleScope);
  950. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  951. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  952. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  953. END;
  954. Scope(x.moduleScope);
  955. IF hasDynamicOperatorDeclarations THEN
  956. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  957. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  958. END;
  959. IF backend.profile THEN
  960. implementationVisitor.ProfilerPatchInit;
  961. END;
  962. END Module;
  963. END DeclarationVisitor;
  964. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  965. RegisterUsageCount*=OBJECT
  966. VAR used: UsedArray; count: LONGINT;
  967. PROCEDURE &Init;
  968. VAR i: LONGINT;
  969. BEGIN
  970. count := 0;
  971. IF used = NIL THEN NEW(used,64); END;
  972. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  973. END Init;
  974. PROCEDURE Grow;
  975. VAR new: UsedArray; size,i: LONGINT;
  976. BEGIN
  977. size := LEN(used)*2;
  978. NEW(new,size);
  979. FOR i := 0 TO LEN(used)-1 DO
  980. new[i].count := used[i].count;
  981. new[i].type := used[i].type;
  982. new[i].map := used[i].map
  983. END;
  984. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  985. used := new
  986. END Grow;
  987. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  988. BEGIN
  989. INC(count);
  990. IF count = LEN(used) THEN Grow END;
  991. used[count].type := type;
  992. used[count].class := class;
  993. used[count].map := count;
  994. RETURN count;
  995. END Next;
  996. PROCEDURE IncUse(register: LONGINT);
  997. BEGIN
  998. INC(used[register].count);
  999. (*
  1000. IF (register = 1) & (count > 30) THEN
  1001. D.TraceBack;
  1002. END;
  1003. *)
  1004. END IncUse;
  1005. PROCEDURE DecUse(register: LONGINT);
  1006. BEGIN
  1007. DEC(used[register].count);
  1008. END DecUse;
  1009. PROCEDURE Map(register: LONGINT): LONGINT;
  1010. VAR map : LONGINT;
  1011. BEGIN
  1012. IF register > 0 THEN
  1013. map := used[register].map;
  1014. WHILE register # map DO register := map; map := used[register].map END;
  1015. END;
  1016. RETURN register
  1017. END Map;
  1018. PROCEDURE Use(register: LONGINT): LONGINT;
  1019. BEGIN
  1020. IF register< LEN(used) THEN
  1021. RETURN used[register].count
  1022. ELSE
  1023. RETURN 0
  1024. END
  1025. END Use;
  1026. END RegisterUsageCount;
  1027. RegisterEntry = POINTER TO RECORD
  1028. prev,next: RegisterEntry;
  1029. register: LONGINT;
  1030. registerClass: IntermediateCode.RegisterClass;
  1031. type: IntermediateCode.Type;
  1032. END;
  1033. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1034. Variables = OBJECT (Basic.List)
  1035. VAR
  1036. inUse: VariableUse;
  1037. registerIndex: LONGINT;
  1038. nameIndex: LONGINT;
  1039. PROCEDURE & Init;
  1040. VAR i: LONGINT;
  1041. BEGIN
  1042. InitList(16);
  1043. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1044. registerIndex := 1024;
  1045. nameIndex := 0;
  1046. END Init;
  1047. PROCEDURE Clear*;
  1048. VAR i: LONGINT;
  1049. BEGIN
  1050. Clear^;
  1051. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1052. registerIndex := 1024;
  1053. nameIndex := 0;
  1054. END Clear;
  1055. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1056. VAR string: SyntaxTree.IdentifierString ;
  1057. BEGIN
  1058. COPY("@hiddenIRVar",string);
  1059. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1060. RETURN SyntaxTree.NewIdentifier(string);
  1061. END GetUID;
  1062. PROCEDURE GetUsage(VAR use: VariableUse);
  1063. BEGIN
  1064. use := inUse;
  1065. END GetUsage;
  1066. PROCEDURE SetUsage(CONST use: VariableUse);
  1067. BEGIN
  1068. inUse := use;
  1069. END SetUsage;
  1070. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1071. VAR any: ANY;
  1072. BEGIN
  1073. any := Get(i);
  1074. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1075. END GetVariable;
  1076. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1077. BEGIN
  1078. Set(pos, v);
  1079. END SetVariable;
  1080. PROCEDURE Occupy(pos: LONGINT);
  1081. BEGIN
  1082. INCL(inUse[pos DIV 32], pos MOD 32);
  1083. END Occupy;
  1084. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1085. BEGIN
  1086. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1087. END Occupied;
  1088. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1089. BEGIN
  1090. Occupy(Length());
  1091. Add(v);
  1092. END AddVariable;
  1093. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1094. BEGIN
  1095. t1 := t1.resolved;
  1096. t2 := t2.resolved;
  1097. (*RETURN t1.SameType(t2); *)
  1098. RETURN
  1099. (t1.SameType(t2))
  1100. OR
  1101. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1102. OR
  1103. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1104. OR
  1105. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1106. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1107. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1108. OR
  1109. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1110. (DynamicDim(t1) = DynamicDim(t2))
  1111. );
  1112. END CompatibleType;
  1113. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1114. VAR var : SyntaxTree.Variable; i: LONGINT;
  1115. BEGIN
  1116. pos := Length();
  1117. FOR i := 0 TO pos-1 DO
  1118. IF ~(Occupied(i)) THEN
  1119. var := GetVariable(i);
  1120. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1121. pos := i;
  1122. Occupy(i);
  1123. RETURN var;
  1124. END;
  1125. END;
  1126. END;
  1127. RETURN NIL
  1128. END GetFreeVariable;
  1129. END Variables;
  1130. SymbolMap = POINTER TO RECORD
  1131. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1132. isAddress: BOOLEAN;
  1133. END;
  1134. SymbolMapper = OBJECT
  1135. VAR
  1136. first: SymbolMap;
  1137. PROCEDURE & Init;
  1138. BEGIN
  1139. first := NIL;
  1140. END Init;
  1141. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1142. VAR new: SymbolMap;
  1143. BEGIN
  1144. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1145. new.next := first; first := new;
  1146. END Add;
  1147. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1148. VAR s: SymbolMap;
  1149. BEGIN
  1150. s := first;
  1151. WHILE (s # NIL) & (s.this # this) DO
  1152. s := s.next
  1153. END;
  1154. RETURN s
  1155. END Get;
  1156. END SymbolMapper;
  1157. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1158. VAR
  1159. system: Global.System;
  1160. section: IntermediateCode.Section;
  1161. module: Sections.Module;
  1162. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1163. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1164. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1165. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1166. checker: SemanticChecker.Checker;
  1167. backend: IntermediateBackend;
  1168. meta: MetaDataGenerator;
  1169. position: Position;
  1170. moduleSelf: SyntaxTree.Variable;
  1171. (* variables for hand over of variables / temporary state *)
  1172. currentScope: SyntaxTree.Scope;
  1173. constantDeclaration : SyntaxTree.Symbol;
  1174. result: Operand; (* result of the most recent expression / statement *)
  1175. destination: IntermediateCode.Operand;
  1176. arrayDestinationTag: IntermediateCode.Operand;
  1177. arrayDestinationDimension:LONGINT;
  1178. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1179. conditional: BOOLEAN;
  1180. trueLabel, falseLabel, exitLabel: Label;
  1181. locked: BOOLEAN;
  1182. (*
  1183. usedRegisters: Registers;
  1184. *)
  1185. registerUsageCount: RegisterUsageCount;
  1186. usedRegisters: RegisterEntry;
  1187. (* useful operands and types *)
  1188. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1189. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1190. commentPrintout: Printout.Printer;
  1191. dump: Streams.Writer;
  1192. tagsAvailable : BOOLEAN;
  1193. supportedInstruction: SupportedInstructionProcedure;
  1194. supportedImmediate: SupportedImmediateProcedure;
  1195. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1196. emitLabels: BOOLEAN;
  1197. builtinsModuleName : SyntaxTree.IdentifierString;
  1198. indexCounter: LONGINT;
  1199. profile: BOOLEAN;
  1200. profileId, profileInit: IntermediateCode.Section;
  1201. profileInitPatchPosition: LONGINT;
  1202. numberProcedures: LONGINT;
  1203. procedureResultDesignator : SyntaxTree.Designator;
  1204. operatorInitializationCodeSection: IntermediateCode.Section;
  1205. fingerPrinter: FingerPrinter.FingerPrinter;
  1206. temporaries: Variables;
  1207. canBeLoaded : BOOLEAN;
  1208. currentIsInline: BOOLEAN;
  1209. currentMapper: SymbolMapper;
  1210. currentInlineExit: Label;
  1211. moduleBodySection: IntermediateCode.Section;
  1212. NeedDescriptor : BOOLEAN;
  1213. cooperativeSwitches: BOOLEAN;
  1214. lastSwitchPC: LONGINT;
  1215. isUnchecked: BOOLEAN;
  1216. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1217. BEGIN
  1218. SELF.system := system;
  1219. SELF.builtinsModuleName := runtime;
  1220. currentScope := NIL;
  1221. hiddenPointerType := NIL;
  1222. delegatePointerType := NIL;
  1223. awaitProcCounter := 0;
  1224. labelId := 0; constId := 0; labelId := 0;
  1225. SELF.checker := checker;
  1226. SELF.backend := backend;
  1227. position := Basic.invalidPosition;
  1228. conditional := FALSE;
  1229. locked := FALSE;
  1230. InitOperand(result,ModeUndefined);
  1231. addressType := IntermediateCode.GetType(system,system.addressType);
  1232. setType := IntermediateCode.GetType(system,system.setType);
  1233. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1234. lenType := IntermediateCode.GetType(system, system.lenType);
  1235. byteType := IntermediateCode.GetType(system, system.byteType);
  1236. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1237. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1238. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1239. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1240. nil := IntermediateCode.Immediate(addressType,0);
  1241. one := IntermediateCode.Immediate(addressType,1);
  1242. IntermediateCode.InitOperand(destination);
  1243. tagsAvailable := TRUE;
  1244. supportedInstruction := supportedInstructionProcedure;
  1245. supportedImmediate := supportedImmediateProcedure;
  1246. inData := FALSE;
  1247. SELF.emitLabels := emitLabels;
  1248. IntermediateCode.InitOperand(arrayDestinationTag);
  1249. bool := IntermediateCode.GetType(system,system.booleanType);
  1250. IntermediateCode.InitImmediate(false,bool,0);
  1251. IntermediateCode.InitImmediate(true,bool,1);
  1252. indexCounter := 0;
  1253. NEW(registerUsageCount);
  1254. usedRegisters := NIL;
  1255. procedureResultDesignator := NIL;
  1256. NEW(fingerPrinter);
  1257. NEW(temporaries);
  1258. currentIsInline := FALSE;
  1259. NeedDescriptor := FALSE;
  1260. isUnchecked := backend.noRuntimeChecks;
  1261. END Init;
  1262. TYPE Context = RECORD
  1263. section: IntermediateCode.Section;
  1264. registerUsageCount: RegisterUsageCount;
  1265. usedRegisters: RegisterEntry;
  1266. temporaries: Variables;
  1267. END;
  1268. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1269. VAR context: Context;
  1270. BEGIN
  1271. context.section := section;
  1272. context.registerUsageCount := registerUsageCount;
  1273. context.usedRegisters := usedRegisters;
  1274. context.temporaries := temporaries;
  1275. section := new;
  1276. NEW(registerUsageCount);
  1277. NEW(temporaries);
  1278. usedRegisters := NIL;
  1279. RETURN context;
  1280. END SwitchContext;
  1281. PROCEDURE ReturnToContext(context: Context);
  1282. BEGIN
  1283. section := context.section;
  1284. registerUsageCount := context.registerUsageCount;
  1285. usedRegisters := context.usedRegisters;
  1286. temporaries := context.temporaries;
  1287. END ReturnToContext;
  1288. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1289. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1290. BEGIN
  1291. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1292. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1293. END;
  1294. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1295. section.SetExported(IsExported(syntaxTreeSymbol));
  1296. RETURN section
  1297. END NewSection;
  1298. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1299. VAR new: LONGINT;
  1300. BEGIN
  1301. new := registerUsageCount.Next(type,class);
  1302. UseRegister(new);
  1303. RETURN new
  1304. END AcquireRegister;
  1305. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1306. VAR
  1307. fingerPrint: SyntaxTree.FingerPrint;
  1308. fingerPrintString: ARRAY 32 OF CHAR;
  1309. BEGIN
  1310. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1311. string := "[";
  1312. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1313. Strings.Append(string, fingerPrintString);
  1314. Strings.Append(string, "]");
  1315. END GetFingerprintString;
  1316. (** get the name for the code section that represens a certain symbol
  1317. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1318. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1319. VAR string: ARRAY 32 OF CHAR;
  1320. BEGIN
  1321. Global.GetSymbolSegmentedName(symbol, name);
  1322. (* if the symbol is an operator, then append the fingerprint to the name *)
  1323. IF symbol IS SyntaxTree.Operator THEN
  1324. GetFingerprintString(symbol, string);
  1325. Basic.AppendToSegmentedName(name,string);
  1326. END
  1327. END GetCodeSectionNameForSymbol;
  1328. (** get the name for the code section that represens a certain symbol
  1329. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1330. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1331. VAR string: ARRAY 32 OF CHAR;
  1332. BEGIN
  1333. Global.GetSymbolNameInScope(symbol, scope, name);
  1334. (* if the symbol is an operator, then append the fingerprint to the name *)
  1335. IF symbol IS SyntaxTree.Operator THEN
  1336. GetFingerprintString(symbol, string);
  1337. Strings.Append(name, string);
  1338. END
  1339. END GetCodeSectionNameForSymbolInScope;
  1340. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1341. BEGIN
  1342. IF dump # NIL THEN
  1343. dump.String("enter "); dump.String(s); dump.Ln;
  1344. END;
  1345. END TraceEnter;
  1346. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1347. BEGIN
  1348. IF dump # NIL THEN
  1349. dump.String("exit "); dump.String(s); dump.Ln;
  1350. END;
  1351. END TraceExit;
  1352. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1353. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1354. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1355. VAR i: LONGINT;
  1356. BEGIN
  1357. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1358. IF op.rule # NIL THEN
  1359. FOR i := 0 TO LEN(op.rule)-1 DO
  1360. CheckRegister(op.rule[i])
  1361. END;
  1362. END;
  1363. END CheckRegister;
  1364. BEGIN
  1365. CheckRegister(instruction.op1);
  1366. CheckRegister(instruction.op2);
  1367. CheckRegister(instruction.op3);
  1368. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1369. ELSE section.Emit(instruction);
  1370. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1371. END;
  1372. END Emit;
  1373. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1374. VAR saved: RegisterEntry;
  1375. BEGIN
  1376. IF backend.cooperative THEN
  1377. ReleaseUsedRegisters(saved);
  1378. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1379. CallThis(position,"Runtime","Trap",1);
  1380. RestoreRegisterUse(saved);
  1381. ELSE
  1382. Emit(Trap(position,trapNo));
  1383. END;
  1384. END EmitTrap;
  1385. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1386. VAR name: Basic.SegmentedName;
  1387. VAR op1, op2, reg: IntermediateCode.Operand;
  1388. VAR call, nocall: Label;
  1389. VAR parametersSize: LONGINT;
  1390. VAR prevSection: IntermediateCode.Section;
  1391. VAR prevDump: Streams.Writer;
  1392. VAR body: SyntaxTree.Body;
  1393. VAR procedureType: SyntaxTree.ProcedureType;
  1394. BEGIN
  1395. IF procedure # NIL THEN
  1396. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1397. ELSE procedureType := NIL;
  1398. END;
  1399. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1400. prevSection := SELF.section;
  1401. SELF.section := section;
  1402. prevDump := dump;
  1403. dump := section.comments;
  1404. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1405. IF backend.hasLinkRegister THEN
  1406. Emit(Push(Basic.invalidPosition, lr));
  1407. END;
  1408. Emit(Push(Basic.invalidPosition,fp));
  1409. IF procedure # NIL THEN
  1410. body := procedure.procedureScope.body;
  1411. ELSE
  1412. body := NIL;
  1413. END;
  1414. IF backend.cooperative THEN
  1415. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1416. GetCodeSectionNameForSymbol(procedure, name);
  1417. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1418. ELSE
  1419. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1420. END;
  1421. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1422. IntermediateCode.AddOffset(op1, 1);
  1423. Emit(Push(Basic.invalidPosition,op1));
  1424. Emit(Mov(Basic.invalidPosition,fp, sp));
  1425. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1426. NEW(call, section);
  1427. NEW(nocall, section);
  1428. reg := NewRegisterOperand(addressType);
  1429. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1430. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1431. BrltL(call, sp, reg);
  1432. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1433. BrgeL(nocall, sp, op2);
  1434. call.Resolve(section.pc);
  1435. Emit(Push(Basic.invalidPosition, reg));
  1436. ReleaseIntermediateOperand(reg);
  1437. parametersSize := ProcParametersSize(procedure);
  1438. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1439. Emit(Push(Basic.invalidPosition, op2));
  1440. CallThis(position, "Activities","ExpandStack",2);
  1441. Emit(Result(Basic.invalidPosition, sp));
  1442. nocall.Resolve(section.pc);
  1443. END;
  1444. ELSE
  1445. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1446. Emit(Push(Basic.invalidPosition, one)) ;
  1447. procedureType.SetParametersOffset(1);
  1448. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1449. END;
  1450. Emit(Mov(Basic.invalidPosition, fp, sp));
  1451. END;
  1452. END;
  1453. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1454. SELF.section := prevSection;
  1455. dump := prevDump;
  1456. END EmitEnter;
  1457. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1458. VAR op1,op2: IntermediateCode.Operand;
  1459. VAR instruction: IntermediateCode.Instruction;
  1460. BEGIN
  1461. IntermediateCode.InitNumber(op1,callconv);
  1462. IntermediateCode.InitNumber(op2,varSize);
  1463. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1464. RETURN instruction
  1465. END Enter;
  1466. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1467. VAR op1: IntermediateCode.Operand;
  1468. VAR instruction: IntermediateCode.Instruction;
  1469. BEGIN
  1470. IntermediateCode.InitNumber(op1,callconv);
  1471. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1472. RETURN instruction
  1473. END Leave;
  1474. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1475. VAR prevSection: IntermediateCode.Section;
  1476. VAR op2, size: IntermediateCode.Operand;
  1477. VAR body: SyntaxTree.Body;
  1478. BEGIN
  1479. prevSection := SELF.section;
  1480. SELF.section := section;
  1481. Emit(Leave(position, callconv));
  1482. IF procedure # NIL THEN
  1483. body := procedure.procedureScope.body;
  1484. ELSE
  1485. body := NIL;
  1486. END;
  1487. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1488. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1489. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1490. Emit(Add(position, sp, fp, op2));
  1491. ELSE
  1492. Emit(Mov(position, sp, fp));
  1493. END;
  1494. Emit(Pop(position, fp));
  1495. END;
  1496. SELF.section := prevSection;
  1497. END EmitLeave;
  1498. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1499. VAR m: SymbolMap;
  1500. BEGIN
  1501. position := x.position;
  1502. IF currentIsInline THEN
  1503. m := currentMapper.Get(x);
  1504. IF m # NIL THEN
  1505. (*
  1506. Printout.Info("mapping from", x);
  1507. Printout.Info("mapping to ", m.to);
  1508. *)
  1509. m.to.Accept(SELF);
  1510. op := result;
  1511. IF m.tag # NIL THEN
  1512. ReleaseIntermediateOperand(result.tag);
  1513. m.tag.Accept(SELF);
  1514. op.tag := result.op;
  1515. ReleaseIntermediateOperand(result.tag);
  1516. END;
  1517. RETURN
  1518. END;
  1519. END;
  1520. x.Accept(SELF);
  1521. op := result;
  1522. END Symbol;
  1523. PROCEDURE Expression(x: SyntaxTree.Expression);
  1524. BEGIN
  1525. position := x.position;
  1526. constantDeclaration := NIL;
  1527. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1528. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1529. END;
  1530. IF x.resolved # NIL THEN
  1531. x.resolved.Accept(SELF)
  1532. ELSE
  1533. x.Accept(SELF)
  1534. END;
  1535. (* check this, was commented out in ActiveCells3 *)
  1536. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1537. Error(x.position, "unsupported modifier");
  1538. END;
  1539. END Expression;
  1540. (*
  1541. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1542. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1543. BEGIN
  1544. temporaries.GetUsage(current);
  1545. FOR i := 0 TO LEN(current)-1 DO
  1546. set := current[i] - previous[i];
  1547. IF set # {} THEN
  1548. FOR j := 0 TO MAX(SET)-1 DO
  1549. IF j IN set THEN
  1550. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1551. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1552. Symbol(variable, op);
  1553. MakeMemory(tmp,op.op,addressType,0);
  1554. ReleaseOperand(op);
  1555. Emit(Mov(position,tmp, nil ) );
  1556. ReleaseIntermediateOperand(tmp);
  1557. END;
  1558. END;
  1559. END;
  1560. END;
  1561. END;
  1562. END ResetUsedTemporaries;
  1563. *)
  1564. PROCEDURE Statement(x: SyntaxTree.Statement);
  1565. VAR use: VariableUse;
  1566. BEGIN
  1567. temporaries.GetUsage(use);
  1568. position := x.position;
  1569. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1570. IF commentPrintout # NIL THEN
  1571. commentPrintout.Statement(x);
  1572. dump.Ln;
  1573. (*dump.Update;*)
  1574. END;
  1575. x.Accept(SELF);
  1576. (*
  1577. CheckRegistersFree();
  1578. *)
  1579. (*ResetUsedTemporaries(use);*)
  1580. temporaries.SetUsage(use);
  1581. END Statement;
  1582. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1583. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1584. *)
  1585. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1586. BEGIN
  1587. ASSERT(op.mode # IntermediateCode.Undefined);
  1588. IF op.mode = IntermediateCode.ModeMemory THEN
  1589. ReuseCopy(res,op);
  1590. ELSE
  1591. res := op;
  1592. UseIntermediateOperand(res);
  1593. END;
  1594. IntermediateCode.AddOffset(res,offset);
  1595. IntermediateCode.MakeMemory(res,type);
  1596. END MakeMemory;
  1597. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1598. VAR mem: IntermediateCode.Operand;
  1599. BEGIN
  1600. MakeMemory(mem,res,type,offset);
  1601. ReleaseIntermediateOperand(res);
  1602. res := mem;
  1603. END ToMemory;
  1604. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1605. VAR mem: IntermediateCode.Operand;
  1606. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1607. componentType: SyntaxTree.Type;
  1608. BEGIN
  1609. type := type.resolved;
  1610. IF operand.mode = ModeReference THEN
  1611. IF type IS SyntaxTree.RangeType THEN
  1612. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1613. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1614. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1615. ReleaseOperand(operand);
  1616. operand.op := firstOp;
  1617. operand.tag := lastOp;
  1618. operand.extra := stepOp;
  1619. ELSIF type IS SyntaxTree.ComplexType THEN
  1620. componentType := type(SyntaxTree.ComplexType).componentType;
  1621. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1622. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1623. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1624. ReleaseOperand(operand);
  1625. operand.op := firstOp;
  1626. operand.tag := lastOp
  1627. ELSE
  1628. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1629. ReleaseIntermediateOperand(operand.op);
  1630. operand.op := mem;
  1631. END;
  1632. operand.mode := ModeValue;
  1633. END;
  1634. ASSERT(operand.mode = ModeValue);
  1635. END LoadValue;
  1636. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1637. VAR prevConditional: BOOLEAN;
  1638. BEGIN
  1639. prevConditional := conditional;
  1640. conditional := FALSE;
  1641. InitOperand(result, ModeUndefined);
  1642. Expression(x);
  1643. op := result;
  1644. LoadValue(op,x.type.resolved);
  1645. conditional := prevConditional;
  1646. END Evaluate;
  1647. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1648. VAR prevConditional: BOOLEAN;
  1649. BEGIN
  1650. prevConditional := conditional;
  1651. conditional := FALSE;
  1652. InitOperand(result,ModeUndefined);
  1653. Expression(x);
  1654. op := result;
  1655. (*
  1656. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1657. *)
  1658. conditional := prevConditional;
  1659. END Designate;
  1660. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1661. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1662. BEGIN
  1663. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1664. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1665. conditional := TRUE;
  1666. trueLabel := trueL; falseLabel := falseL;
  1667. Expression(x);
  1668. trueL := trueLabel; falseL := falseLabel;
  1669. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1670. END Condition;
  1671. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1672. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1673. BEGIN
  1674. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1675. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1676. RETURN op
  1677. END NewRegisterOperand;
  1678. PROCEDURE UnuseRegister(register: LONGINT);
  1679. BEGIN
  1680. IF (register > 0) THEN
  1681. register := registerUsageCount.Map(register);
  1682. registerUsageCount.DecUse(register);
  1683. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1684. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1685. END;
  1686. IF registerUsageCount.Use(register)=0 THEN
  1687. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1688. Warning(position, "register cannot be removed");
  1689. END;
  1690. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1691. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1692. END;
  1693. ELSIF registerUsageCount.Use(register)<0 THEN
  1694. Warning(position, "register removed too often");
  1695. IF dump # NIL THEN
  1696. dump.String("register removed too often"); dump.Ln; dump.Update;
  1697. END;
  1698. END;
  1699. END;
  1700. END UnuseRegister;
  1701. PROCEDURE UseRegister(register: LONGINT);
  1702. BEGIN
  1703. IF (register > 0) THEN
  1704. register := registerUsageCount.Map(register);
  1705. registerUsageCount.IncUse(register);
  1706. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1707. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1708. END;
  1709. IF registerUsageCount.Use(register)=1 THEN
  1710. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1711. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1712. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1713. END;
  1714. END;
  1715. END;
  1716. END UseRegister;
  1717. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1718. BEGIN
  1719. UnuseRegister(op.register)
  1720. END ReleaseIntermediateOperand;
  1721. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1722. BEGIN
  1723. UseRegister(op.register)
  1724. END UseIntermediateOperand;
  1725. PROCEDURE ReleaseOperand(CONST op: Operand);
  1726. BEGIN
  1727. UnuseRegister(op.op.register);
  1728. UnuseRegister(op.tag.register);
  1729. UnuseRegister(op.extra.register);
  1730. END ReleaseOperand;
  1731. (* save registers marked in array "markedRegisters" to the stack
  1732. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1733. *)
  1734. PROCEDURE SaveRegisters();
  1735. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1736. BEGIN
  1737. entry := usedRegisters;
  1738. WHILE entry # NIL DO
  1739. type := registerUsageCount.used[entry.register].type;
  1740. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1741. Emit(Push(position,op));
  1742. entry := entry.next;
  1743. END;
  1744. END SaveRegisters;
  1745. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1746. BEGIN
  1747. saved := usedRegisters;
  1748. usedRegisters := NIL;
  1749. END ReleaseUsedRegisters;
  1750. (** remove parameter registers from used queue *)
  1751. PROCEDURE ReleaseParameterRegisters;
  1752. VAR entry,prev,next: RegisterEntry;
  1753. BEGIN
  1754. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1755. WHILE entry # NIL DO
  1756. next := entry.next;
  1757. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1758. registerUsageCount.DecUse(entry.register);
  1759. ASSERT(registerUsageCount.Use(entry.register)=0);
  1760. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1761. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1762. END;
  1763. ELSIF prev = NIL THEN
  1764. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1765. ELSE
  1766. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1767. END;
  1768. entry := next;
  1769. END;
  1770. END ReleaseParameterRegisters;
  1771. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1772. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1773. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1774. BEGIN
  1775. entry := saved;
  1776. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1777. entry := prev;
  1778. WHILE entry # NIL DO
  1779. prev := entry.prev;
  1780. type := entry.type;
  1781. class := entry.registerClass;
  1782. IntermediateCode.InitRegister(op,type,class,entry.register);
  1783. Emit(Pop(position,op));
  1784. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1785. entry := prev;
  1786. END;
  1787. END RestoreRegisters;
  1788. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1789. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1790. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1791. BEGIN
  1792. entry := saved;
  1793. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1794. entry := prev;
  1795. WHILE entry # NIL DO
  1796. prev := entry.prev;
  1797. type := entry.type;
  1798. class := entry.registerClass;
  1799. IntermediateCode.InitRegister(op,type,class,entry.register);
  1800. Emit(Mov(position,op,op));
  1801. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1802. entry := prev;
  1803. END;
  1804. END RestoreRegisterUse;
  1805. PROCEDURE CheckRegistersFree;
  1806. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1807. BEGIN
  1808. IF usedRegisters # NIL THEN
  1809. r := usedRegisters;
  1810. WHILE r # NIL DO
  1811. warning := "register ";
  1812. Strings.AppendInt(warning, r.register);
  1813. Strings.Append(warning, " not released.");
  1814. Warning(position,warning);
  1815. r := r .next;
  1816. END;
  1817. END;
  1818. FOR i := 0 TO registerUsageCount.count-1 DO
  1819. IF registerUsageCount.used[i].count < 0 THEN
  1820. warning := "register ";
  1821. Strings.AppendInt(warning, i);
  1822. Strings.Append(warning, " unused too often.");
  1823. Warning(position,warning);
  1824. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1825. warning := "register ";
  1826. Strings.AppendInt(warning, i);
  1827. Strings.Append(warning, " not unused often enough.");
  1828. Warning(position,warning);
  1829. END;
  1830. END;
  1831. END CheckRegistersFree;
  1832. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1833. Otherwise allocate a new register.
  1834. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1835. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1836. BEGIN
  1837. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1838. UseIntermediateOperand(result);
  1839. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1840. UseIntermediateOperand(result);
  1841. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1842. END;
  1843. END Reuse2;
  1844. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1845. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1846. If not then allocate a new register.
  1847. Does NOT necessarily keep the content of src1 or src2 in result!
  1848. *)
  1849. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1850. BEGIN
  1851. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1852. UseIntermediateOperand(result);
  1853. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1856. result := alternative; alternative := emptyOperand;
  1857. UseIntermediateOperand(result);
  1858. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1859. END;
  1860. END Reuse2a;
  1861. (* like reuse2 but only one source *)
  1862. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1863. BEGIN
  1864. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1865. UseIntermediateOperand(result);
  1866. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1867. END;
  1868. END Reuse1;
  1869. (* like reuse2a but only one source *)
  1870. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1871. BEGIN
  1872. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1873. UseIntermediateOperand(result);
  1874. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1875. UseIntermediateOperand(result);
  1876. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1877. END;
  1878. END Reuse1a;
  1879. (* like reuse1 but guarantees that content of src1 is in result *)
  1880. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1881. BEGIN
  1882. IF ReusableRegister(src1) THEN
  1883. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1884. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1885. UseIntermediateOperand(result);
  1886. ELSE
  1887. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1888. Emit(Mov(position,result,src1));
  1889. END
  1890. END ReuseCopy;
  1891. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1892. BEGIN
  1893. IF ReusableRegister(src) THEN
  1894. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1895. ELSE
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1897. Emit(Mov(position,result,src));
  1898. ReleaseIntermediateOperand(src);
  1899. END
  1900. END TransferToRegister;
  1901. (** labels and branches **)
  1902. PROCEDURE NewLabel(): Label;
  1903. VAR label: Label;
  1904. BEGIN
  1905. NEW(label,section); RETURN label;
  1906. END NewLabel;
  1907. PROCEDURE SetLabel(label: Label);
  1908. BEGIN label.Resolve(section.pc);
  1909. END SetLabel;
  1910. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1911. BEGIN
  1912. ASSERT(label # NIL);
  1913. IF label.pc < 0 THEN (* label not yet set *)
  1914. label.AddFixup(section.pc);
  1915. END;
  1916. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1917. END LabelOperand;
  1918. PROCEDURE BrL(label: Label);
  1919. BEGIN
  1920. Emit(Br(position,LabelOperand(label)));
  1921. END BrL;
  1922. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1923. BEGIN
  1924. Emit(Brge(position,LabelOperand(label),left,right));
  1925. END BrgeL;
  1926. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1927. BEGIN
  1928. Emit(Brlt(position,LabelOperand(label),left,right));
  1929. END BrltL;
  1930. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1931. BEGIN
  1932. Emit(Breq(position,LabelOperand(label),left,right));
  1933. END BreqL;
  1934. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1935. BEGIN
  1936. Emit(Brne(position,LabelOperand(label),left,right));
  1937. END BrneL;
  1938. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1939. VAR new: IntermediateCode.Operand;
  1940. BEGIN
  1941. IF Trace THEN TraceEnter("Convert") END;
  1942. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1943. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1944. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1945. & (operand.offset = 0)
  1946. THEN
  1947. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1948. Emit(Conv(position,new,operand));
  1949. ELSE
  1950. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1951. Emit(Conv(position,new,operand));
  1952. ReleaseIntermediateOperand(operand);
  1953. END;
  1954. operand := new;
  1955. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1956. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1957. ELSE
  1958. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1959. Emit(Conv(position,new,operand));
  1960. ReleaseIntermediateOperand(operand);
  1961. operand := new;
  1962. END;
  1963. IF Trace THEN TraceExit("Convert") END;
  1964. END Convert;
  1965. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1966. VAR exit: Label;
  1967. BEGIN
  1968. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1969. exit := NewLabel();
  1970. br(exit,left,right);
  1971. EmitTrap(position,trapNo);
  1972. SetLabel(exit);
  1973. END TrapC;
  1974. (** expressions *)
  1975. (** emit necessary runtime check for set elements **)
  1976. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1977. VAR max: IntermediateCode.Operand;
  1978. BEGIN
  1979. IF isUnchecked THEN RETURN END;
  1980. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1981. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1982. TrapC(BrgeL, max, o, SetElementTrap);
  1983. END;
  1984. END CheckSetElement;
  1985. (** the set that a range represents **)
  1986. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1987. VAR
  1988. operand: Operand;
  1989. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1990. BEGIN
  1991. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1992. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1993. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1994. one := IntermediateCode.Immediate(setType, 1);
  1995. Evaluate(x, operand);
  1996. Convert(operand.op, setType);
  1997. Convert(operand.tag, setType);
  1998. CheckSetElement(operand.op);
  1999. CheckSetElement(operand.tag);
  2000. (* create mask for lower bound
  2001. i.e. shift 11111111 to the left by the value of the lower bound
  2002. *)
  2003. Reuse1(temp, operand.op);
  2004. Emit(Shl(position,temp, allBits, operand.op));
  2005. ReleaseIntermediateOperand(operand.op);
  2006. operand.op := temp;
  2007. (* create mask for upper bound
  2008. i.e. shift 11111111 to the right by the difference between the
  2009. upper bound and the maximum number of set elements
  2010. *)
  2011. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2012. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2013. Reuse1(temp, operand.tag);
  2014. ELSE
  2015. Reuse1(temp, operand.tag);
  2016. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2017. Emit(Sub(position,temp, size, operand.tag));
  2018. END;
  2019. Emit(Shr(position,temp, allBits, operand.tag));
  2020. ReleaseIntermediateOperand(operand.tag);
  2021. operand.tag := temp;
  2022. Reuse2(resultingSet, operand.op, operand.tag);
  2023. (* intersect the two masks *)
  2024. Emit(And(position,resultingSet, operand.op, operand.tag));
  2025. ReleaseOperand(operand);
  2026. RETURN resultingSet
  2027. END SetFromRange;
  2028. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2029. VAR
  2030. res, operand: Operand;
  2031. temp, one, noBits, dest: IntermediateCode.Operand;
  2032. expression: SyntaxTree.Expression;
  2033. i: LONGINT;
  2034. BEGIN
  2035. IF Trace THEN TraceEnter("VisitSet") END;
  2036. dest := destination;
  2037. destination := emptyOperand;
  2038. noBits := IntermediateCode.Immediate(setType, 0);
  2039. one := IntermediateCode.Immediate(setType, 1);
  2040. (* start off with the empty set *)
  2041. InitOperand(res, ModeValue);
  2042. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2043. Emit(Mov(position,res.op, noBits));
  2044. FOR i := 0 TO x.elements.Length() - 1 DO
  2045. expression := x.elements.GetExpression(i);
  2046. IF expression IS SyntaxTree.RangeExpression THEN
  2047. (* range of set elements *)
  2048. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2049. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2050. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2051. ReleaseIntermediateOperand(temp)
  2052. ELSE
  2053. (* singelton element *)
  2054. Evaluate(expression, operand);
  2055. Convert(operand.op, setType);
  2056. CheckSetElement(operand.op);
  2057. (* create subset containing single element *)
  2058. Reuse1(temp, operand.op);
  2059. Emit(Shl(position,temp, one, operand.op));
  2060. ReleaseOperand(operand);
  2061. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2062. ReleaseIntermediateOperand(temp);
  2063. END
  2064. END;
  2065. result := res;
  2066. destination := dest;
  2067. IF Trace THEN TraceExit("VisitSet") END;
  2068. END VisitSet;
  2069. (* math arrays of the form [a,b,c]
  2070. x is a static array and thus does not provide any pointers
  2071. *)
  2072. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2073. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2074. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2075. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2076. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2077. element: SyntaxTree.IntegerValue;
  2078. BEGIN
  2079. numberElements := x.elements.Length();
  2080. expression := index.parameters.GetExpression(dim);
  2081. element := expression(SyntaxTree.IntegerValue);
  2082. FOR i := 0 TO numberElements-1 DO
  2083. expression := x.elements.GetExpression(i);
  2084. element.SetValue(i);
  2085. IF expression IS SyntaxTree.MathArrayExpression THEN
  2086. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2087. ELSE
  2088. Assign(index,expression);
  2089. END;
  2090. END;
  2091. END RecursiveAssignment;
  2092. PROCEDURE Dimension(): LONGINT;
  2093. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2094. BEGIN
  2095. dim := 0;
  2096. expression := x;
  2097. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2098. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2099. INC(dim);
  2100. END;
  2101. RETURN dim;
  2102. END Dimension;
  2103. BEGIN
  2104. (*static math array not providing pointers anyway *)
  2105. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2106. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2107. designator.SetType(variable.type);
  2108. dim := Dimension();
  2109. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2110. FOR i := 0 TO dim-1 DO
  2111. element := SyntaxTree.NewIntegerValue(x.position,0);
  2112. element.SetType(system.longintType);
  2113. index.parameters.AddExpression(element);
  2114. END;
  2115. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2116. RecursiveAssignment(x,0);
  2117. Expression(designator);
  2118. END VisitMathArrayExpression;
  2119. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2120. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2121. BEGIN
  2122. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2123. dest := destination; destination := emptyOperand;
  2124. IF x.operator = Scanner.Not THEN
  2125. IF conditional THEN
  2126. Condition(x.left,falseLabel,trueLabel)
  2127. ELSE
  2128. Evaluate(x.left,operand);
  2129. InitOperand(result,ModeValue);
  2130. Reuse1a(result.op,operand.op,dest);
  2131. Emit(Xor(position,result.op,operand.op,true));
  2132. ReleaseOperand(operand);
  2133. END;
  2134. ELSIF x.operator = Scanner.Minus THEN
  2135. Evaluate(x.left,operand);
  2136. InitOperand(result,ModeValue);
  2137. Reuse1a(result.op,operand.op,dest);
  2138. type := x.left.type.resolved;
  2139. IF type IS SyntaxTree.SetType THEN
  2140. Emit(Not(position,result.op,operand.op));
  2141. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2142. Reuse1(result.tag,operand.tag);
  2143. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2144. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2145. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2146. Emit(Neg(position,result.op,operand.op));
  2147. ELSE HALT(200)
  2148. END;
  2149. ReleaseOperand(operand);
  2150. ELSIF x.operator = Scanner.Address THEN
  2151. Designate(x.left,operand);
  2152. operand.mode := ModeValue;
  2153. t0 := x.left.type.resolved;
  2154. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2155. ReleaseIntermediateOperand(operand.op);
  2156. operand.op := operand.tag;
  2157. IntermediateCode.InitOperand(operand.tag);
  2158. END;
  2159. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2160. result := operand;
  2161. ELSE HALT(100)
  2162. END;
  2163. destination := dest;
  2164. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2165. END VisitUnaryExpression;
  2166. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2167. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2168. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2169. BEGIN
  2170. type := type.resolved;
  2171. originalType := type;
  2172. IF type IS SyntaxTree.PointerType THEN
  2173. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2174. END;
  2175. IF type IS SyntaxTree.ObjectType THEN
  2176. BrL(trueL);
  2177. ELSE
  2178. ASSERT(type IS SyntaxTree.RecordType);
  2179. (*
  2180. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2181. *)
  2182. ReuseCopy(left,tag);
  2183. right := TypeDescriptorAdr(type);
  2184. IF backend.cooperative THEN
  2185. repeatL := NewLabel();
  2186. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2187. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2188. END;
  2189. SetLabel(repeatL);
  2190. BreqL(trueL,left,right);
  2191. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2192. BrneL(repeatL,left,nil);
  2193. ELSIF meta.simple THEN
  2194. level := type(SyntaxTree.RecordType).Level();
  2195. (* get type desc tag of level relative to base tag *)
  2196. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2197. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2198. IntermediateCode.MakeMemory(left,addressType);
  2199. BreqL(trueL,left,right);
  2200. ELSE
  2201. level := type(SyntaxTree.RecordType).Level();
  2202. (* get type desc tag of level relative to base tag *)
  2203. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2204. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2205. IntermediateCode.MakeMemory(left,addressType);
  2206. BreqL(trueL,left,right);
  2207. END;
  2208. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2209. BrL(falseL);
  2210. END;
  2211. END TypeTest;
  2212. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2213. BEGIN
  2214. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2215. IF dump # NIL THEN
  2216. dump.String(s); dump.Ln;
  2217. END;
  2218. END Error;
  2219. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2220. BEGIN
  2221. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2222. IF dump # NIL THEN
  2223. dump.String(s); dump.Ln; dump.Update;
  2224. END;
  2225. END Warning;
  2226. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2227. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2228. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2229. operand:Operand;
  2230. BEGIN
  2231. previousSection := section;
  2232. Global.GetModuleName(mod,name);
  2233. Strings.Append(name,".@Trace");
  2234. Basic.ToSegmentedName(name, pooledName);
  2235. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2236. IF dump # NIL THEN dump := section.comments END;
  2237. IF backend.hasLinkRegister THEN
  2238. Emit(Push(Basic.invalidPosition, lr));
  2239. END;
  2240. variable := mod.moduleScope.firstVariable;
  2241. WHILE variable # NIL DO
  2242. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2243. Symbol(variable, operand);
  2244. register := operand.op;
  2245. CallTraceMethod(register, variable.type);
  2246. ReleaseIntermediateOperand(register);
  2247. END;
  2248. variable := variable.nextVariable;
  2249. END;
  2250. IF backend.hasLinkRegister THEN
  2251. Emit(Pop(Basic.invalidPosition, lr));
  2252. END;
  2253. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2254. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2255. Emit(Br(position,op));
  2256. INC(statCoopTraceModule, section.pc);
  2257. section := previousSection;
  2258. IF dump # NIL THEN dump := section.comments END;
  2259. END CreateTraceModuleMethod;
  2260. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2261. BEGIN
  2262. Emit (Push(position, dst));
  2263. Emit (Push(position, src));
  2264. CallThis(position,"GarbageCollector","Assign", 2);
  2265. END CallAssignPointer;
  2266. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2267. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2268. BEGIN
  2269. IF SemanticChecker.IsPointerType (type) THEN
  2270. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2271. ELSIF type.IsRecordType() THEN
  2272. Emit (Push(position,dst));
  2273. Emit (Push(position,src));
  2274. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2276. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2277. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2278. ELSIF IsStaticArray(type) THEN
  2279. size := StaticArrayNumElements(type);
  2280. base := StaticArrayBaseType(type);
  2281. IF base.IsRecordType() THEN
  2282. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2283. Emit (Push(position, dst));
  2284. Emit (Push(position, src));
  2285. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2287. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2288. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2289. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2290. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2291. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2292. Emit (Push(position, dst));
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, src));
  2295. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2296. ELSE
  2297. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2298. Emit (Push(position, dst));
  2299. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2300. Emit (Push(position, src));
  2301. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2302. ASSERT(StaticArrayBaseType(type).IsPointer());
  2303. END;
  2304. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2305. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2306. Emit (Push(position, dst));
  2307. Emit (Push(position, src));
  2308. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2309. ELSE HALT(100); (* missing ? *)
  2310. END;
  2311. END CallAssignMethod;
  2312. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2313. VAR name: Basic.SegmentedName;
  2314. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2315. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2316. context: Context;
  2317. BEGIN
  2318. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2319. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2320. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2323. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2324. section.SetExported (TRUE);
  2325. IF dump # NIL THEN dump := section.comments END;
  2326. IF backend.hasLinkRegister THEN
  2327. Emit(Push(Basic.invalidPosition, lr));
  2328. END;
  2329. variable := recordType.recordScope.firstVariable;
  2330. WHILE variable # NIL DO
  2331. IF variable.NeedsTrace() THEN
  2332. dst := NewRegisterOperand (addressType);
  2333. src := NewRegisterOperand (addressType);
  2334. Emit (Mov(position, dst, parameter1));
  2335. Emit (Mov(position, src, parameter2));
  2336. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2337. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2338. CallAssignMethod(dst, src, variable.type);
  2339. ReleaseIntermediateOperand(src);
  2340. ReleaseIntermediateOperand(dst);
  2341. END;
  2342. variable := variable.nextVariable;
  2343. END;
  2344. recordBase := recordType.GetBaseRecord();
  2345. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2346. IF backend.hasLinkRegister THEN
  2347. Emit(Pop(Basic.invalidPosition, lr));
  2348. END;
  2349. GetRecordTypeName (recordBase,name);
  2350. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2351. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2352. Emit(Br(position,op));
  2353. ELSE
  2354. Emit(Exit(position,0,0, 0));
  2355. END;
  2356. IF ~recordType.isObject THEN
  2357. GetRecordTypeName (recordType,name);
  2358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2359. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2360. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2361. section.SetExported (TRUE);
  2362. NEW(registerUsageCount);
  2363. usedRegisters := NIL;
  2364. dst := NewRegisterOperand (addressType);
  2365. src := NewRegisterOperand (addressType);
  2366. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2367. Emit(Mov(position, dst, parameter1));
  2368. Emit(Mov(position, src, parameter2));
  2369. label := NewLabel();
  2370. SetLabel(label);
  2371. Emit(Push(position, dst));
  2372. Emit(Push(position, src));
  2373. GetRecordTypeName (recordType,name);
  2374. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2375. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2376. Emit(Call(position, op, 0));
  2377. Emit(Pop(position, src));
  2378. Emit(Pop(position, dst));
  2379. Emit(Add(position, dst, dst, ofs));
  2380. Emit(Add(position, src, src, ofs));
  2381. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2382. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2383. Emit(Exit(position,0,0, 0));
  2384. END;
  2385. INC(statCoopAssignProcedure, section.pc);
  2386. ReturnToContext(context);
  2387. IF dump # NIL THEN dump := section.comments END;
  2388. END CreateAssignProcedure;
  2389. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2390. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2391. BEGIN
  2392. IF IsUnsafePointer (type) THEN
  2393. skip := NewLabel();
  2394. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2395. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2396. BreqL (skip, op, nil);
  2397. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2398. SetLabel (skip);
  2399. ELSIF SemanticChecker.IsPointerType (type) THEN
  2400. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2401. CallThis(position,"GarbageCollector","Mark", 1);
  2402. ELSIF type.IsRecordType() THEN
  2403. Emit (Push(position,register));
  2404. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2405. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2406. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2407. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2408. ELSIF IsStaticArray(type) THEN
  2409. size := StaticArrayNumElements(type);
  2410. base := StaticArrayBaseType(type);
  2411. IF base.IsRecordType() THEN
  2412. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2413. Emit (Push(position, register));
  2414. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2417. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2418. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2419. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2420. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2421. Emit (Push(position, register));
  2422. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2423. ELSE
  2424. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2425. Emit (Push(position, register));
  2426. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2427. ASSERT(base.IsPointer());
  2428. END;
  2429. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2430. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2431. CallThis(position,"GarbageCollector","Mark", 1);
  2432. ELSE HALT(100); (* missing ? *)
  2433. END;
  2434. END CallTraceMethod;
  2435. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2436. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2437. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2438. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2439. BEGIN
  2440. previousSection := section;
  2441. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2442. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2443. GetRecordTypeName (recordType,name);
  2444. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2445. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2446. section.SetExported (TRUE);
  2447. IF dump # NIL THEN dump := section.comments END;
  2448. IF backend.hasLinkRegister THEN
  2449. Emit(Push(Basic.invalidPosition, lr));
  2450. END;
  2451. variable := recordType.recordScope.firstVariable;
  2452. WHILE variable # NIL DO
  2453. IF variable.NeedsTrace() THEN
  2454. register := NewRegisterOperand (addressType);
  2455. Emit (Mov(position,register,parameter1));
  2456. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2457. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2458. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2459. END;
  2460. CallTraceMethod(register, variable.type);
  2461. ReleaseIntermediateOperand(register);
  2462. END;
  2463. variable := variable.nextVariable;
  2464. END;
  2465. recordBase := recordType.GetBaseRecord();
  2466. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2467. recordBase := recordBase.GetBaseRecord();
  2468. END;
  2469. IF recordBase # NIL THEN
  2470. IF backend.hasLinkRegister THEN
  2471. Emit(Pop(Basic.invalidPosition, lr));
  2472. END;
  2473. GetRecordTypeName (recordBase,name);
  2474. IF HasExplicitTraceMethod (recordBase) THEN
  2475. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2476. ELSE
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2478. END;
  2479. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2480. Emit(Br(position,op));
  2481. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2482. Emit(Exit(position,0,0,0));
  2483. ELSE
  2484. IF backend.hasLinkRegister THEN
  2485. Emit(Pop(Basic.invalidPosition, lr));
  2486. END;
  2487. IF recordType.isObject THEN
  2488. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2489. ELSE
  2490. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2491. END;
  2492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2493. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2494. Emit(Br(position,op));
  2495. END;
  2496. IF ~recordType.isObject THEN
  2497. GetRecordTypeName (recordType,name);
  2498. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2499. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2500. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2501. section.SetExported (TRUE);
  2502. NEW(registerUsageCount);
  2503. usedRegisters := NIL;
  2504. IF dump # NIL THEN dump := section.comments END;
  2505. register := NewRegisterOperand (addressType);
  2506. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2507. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2508. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2509. END;
  2510. Emit (Push(position,register));
  2511. GetRecordTypeName (recordType,name);
  2512. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2513. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2514. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2515. ReleaseIntermediateOperand(register);
  2516. Emit(Exit(position,0,0,0));
  2517. GetRecordTypeName (recordType,name);
  2518. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2519. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2520. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2521. section.SetExported (TRUE);
  2522. NEW(registerUsageCount);
  2523. usedRegisters := NIL;
  2524. register := NewRegisterOperand (addressType);
  2525. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2526. Emit(Mov(position, register, parameter1));
  2527. label := NewLabel();
  2528. SetLabel(label);
  2529. Emit(Push(position, register));
  2530. GetRecordTypeName (recordType,name);
  2531. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2532. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2533. Emit(Call(position, op, 0));
  2534. Emit(Pop(position, register));
  2535. Emit(Add(position, register, register, ofs));
  2536. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2537. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2538. Emit(Exit(position,0,0,0));
  2539. END;
  2540. INC(statCoopTraceMethod, section.pc);
  2541. ReturnToContext(context);
  2542. IF dump # NIL THEN dump := section.comments END;
  2543. END CreateTraceMethod;
  2544. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2545. VAR name: Basic.SegmentedName;
  2546. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2547. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2548. context: Context;
  2549. BEGIN
  2550. IF recordType.isObject THEN RETURN END;
  2551. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2552. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2553. GetRecordTypeName (recordType,name);
  2554. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2555. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2556. section.SetExported (TRUE);
  2557. IF dump # NIL THEN dump := section.comments END;
  2558. IF backend.hasLinkRegister THEN
  2559. Emit(Push(Basic.invalidPosition, lr));
  2560. END;
  2561. variable := recordType.recordScope.firstVariable;
  2562. WHILE variable # NIL DO
  2563. IF variable.NeedsTrace() THEN
  2564. dst := NewRegisterOperand (addressType);
  2565. Emit (Mov(position, dst, parameter1));
  2566. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2567. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2568. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2569. END;
  2570. CallResetProcedure(dst, nil, variable.type);
  2571. ReleaseIntermediateOperand(dst);
  2572. END;
  2573. variable := variable.nextVariable;
  2574. END;
  2575. recordBase := recordType.GetBaseRecord();
  2576. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2577. IF backend.hasLinkRegister THEN
  2578. Emit(Pop(Basic.invalidPosition, lr));
  2579. END;
  2580. GetRecordTypeName (recordBase,name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2582. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2583. Emit(Br(position,op));
  2584. ELSE
  2585. Emit(Exit(position,0,0, 0));
  2586. END;
  2587. GetRecordTypeName (recordType,name);
  2588. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2589. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2590. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2591. section.SetExported (TRUE);
  2592. NEW(registerUsageCount);
  2593. usedRegisters := NIL;
  2594. dst := NewRegisterOperand (addressType);
  2595. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2596. Emit(Mov(position, dst, parameter1));
  2597. label := NewLabel();
  2598. SetLabel(label);
  2599. Emit(Push(position, dst));
  2600. GetRecordTypeName (recordType,name);
  2601. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2602. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2603. Emit(Call(position, op, 0));
  2604. Emit(Pop(position, dst));
  2605. Emit(Add(position, dst, dst, ofs));
  2606. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2607. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2608. Emit(Exit(position,0,0, 0));
  2609. INC(statCoopResetProcedure, section.pc);
  2610. ReturnToContext(context);
  2611. IF dump # NIL THEN dump := section.comments END;
  2612. END CreateResetProcedure;
  2613. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2614. VAR name: Basic.SegmentedName; context: Context;
  2615. BEGIN
  2616. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2617. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2618. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2619. IF dump # NIL THEN dump := section.comments END;
  2620. IF backend.hasLinkRegister THEN
  2621. Emit(Push(Basic.invalidPosition, lr));
  2622. END;
  2623. Emit(Push(position,fp));
  2624. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2625. ResetVariables(scope);
  2626. Emit(Pop(position,fp));
  2627. Emit(Exit(position,0,0, 0));
  2628. ReturnToContext(context);
  2629. IF dump # NIL THEN dump := section.comments END;
  2630. END CreateResetMethod;
  2631. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2632. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2633. BEGIN
  2634. IF SemanticChecker.IsPointerType (type) THEN
  2635. Emit (Push(position, dest));
  2636. CallThis(position,"GarbageCollector","Reset", 1);
  2637. ELSIF type.IsRecordType() THEN
  2638. Emit (Push(position, dest));
  2639. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2640. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2641. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2642. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2643. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2644. size := GetArrayLength(type, tag);
  2645. base := ArrayBaseType(type);
  2646. IF base.IsRecordType() THEN
  2647. Emit (Push(position, size));
  2648. Emit (Push(position, dest));
  2649. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2650. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2651. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2652. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2653. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2654. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2655. Emit (Push(position, size));
  2656. Emit (Push(position, dest));
  2657. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2658. ELSE
  2659. Emit (Push(position, size));
  2660. Emit (Push(position, dest));
  2661. CallThis(position,"GarbageCollector","ResetArray", 2);
  2662. ASSERT(ArrayBaseType(type).IsPointer());
  2663. END;
  2664. ReleaseIntermediateOperand(size);
  2665. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2666. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2667. Emit (Push(position, dest));
  2668. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2669. ELSE HALT(100); (* missing ? *)
  2670. END;
  2671. END CallResetProcedure;
  2672. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2673. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2674. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2675. VAR operand: Operand;
  2676. BEGIN
  2677. Symbol (symbol, operand);
  2678. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2679. ReleaseOperand(operand);
  2680. END Reset;
  2681. BEGIN
  2682. previousScope := currentScope;
  2683. currentScope := scope;
  2684. pc := section.pc;
  2685. prevOffset := MAX(SIZE);
  2686. variable := scope.firstVariable;
  2687. WHILE variable # NIL DO
  2688. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2689. Reset (variable);
  2690. prevOffset := variable.offsetInBits;
  2691. END;
  2692. variable := variable.nextVariable;
  2693. END;
  2694. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2695. WHILE parameter # NIL DO
  2696. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2697. Reset (parameter);
  2698. END;
  2699. parameter := parameter.nextParameter;
  2700. END;
  2701. INC(statCoopResetVariables, section.pc - pc);
  2702. currentScope := previousScope;
  2703. END ResetVariables;
  2704. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2705. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2706. BEGIN
  2707. type := symbol.type.resolved;
  2708. SaveRegisters();ReleaseUsedRegisters(saved);
  2709. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2710. Symbol(symbol, operand);
  2711. ToMemory(operand.op,addressType,0);
  2712. Emit(Push(position,operand.op));
  2713. IF refer THEN
  2714. CallThis(position,"Heaps","Refer",1);
  2715. ELSE
  2716. CallThis(position,"Heaps","Reset",1);
  2717. END;
  2718. ELSIF type.IsRecordType() THEN
  2719. Symbol(symbol, operand);
  2720. Emit(Push(position,operand.op));
  2721. Emit(Push(position,operand.tag)); (* type desc *)
  2722. IF refer THEN
  2723. CallThis(position,"Heaps","ReferRecord",2);
  2724. ELSE
  2725. CallThis(position,"Heaps","ResetRecord",2);
  2726. END;
  2727. ELSIF IsStaticArray(type) THEN
  2728. size := StaticArrayNumElements(type);
  2729. base := StaticArrayBaseType(type);
  2730. Symbol(symbol, operand);
  2731. arg := TypeDescriptorAdr(base);
  2732. Emit(Push(position,operand.op));
  2733. Emit(Push(position,arg));
  2734. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2735. ReleaseIntermediateOperand(arg);
  2736. IF refer THEN
  2737. CallThis(position,"Heaps","ReferArray",3);
  2738. ELSE
  2739. CallThis(position,"Heaps","ResetArray",3);
  2740. END;
  2741. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2742. size := StaticMathArrayNumElements(type);
  2743. base := StaticMathArrayBaseType(type);
  2744. Symbol(symbol, operand);
  2745. arg := TypeDescriptorAdr(base);
  2746. Emit(Push(position,operand.op));
  2747. Emit(Push(position,arg));
  2748. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2749. ReleaseIntermediateOperand(arg);
  2750. IF refer THEN
  2751. CallThis(position,"Heaps","ReferArray",3);
  2752. ELSE
  2753. CallThis(position,"Heaps","ResetArray",3);
  2754. END;
  2755. ELSIF type IS SyntaxTree.MathArrayType THEN
  2756. Symbol(symbol, operand);
  2757. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2758. Emit (Push(position, operand.op));
  2759. ELSE
  2760. Emit (Push(position, operand.tag));
  2761. END;
  2762. IF refer THEN
  2763. CallThis(position,"Heaps","ReferMathArray", 1);
  2764. ELSE
  2765. CallThis(position,"Heaps","ResetMathArray", 1);
  2766. END;
  2767. ELSIF type IS SyntaxTree.ProcedureType THEN
  2768. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2769. Symbol(symbol, operand);
  2770. Emit (Push(position, operand.tag));
  2771. IF refer THEN
  2772. CallThis(position,"Heaps","Refer", 1);
  2773. ELSE
  2774. CallThis(position,"Heaps","Reset", 1);
  2775. END;
  2776. ELSE HALT(100); (* missing ? *)
  2777. END;
  2778. ReleaseOperand(operand);
  2779. RestoreRegisters(saved);
  2780. END Reset;
  2781. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2782. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2783. BEGIN
  2784. previousScope := currentScope;
  2785. currentScope := scope;
  2786. pc := section.pc;
  2787. IF ~ refer THEN
  2788. variable := scope.firstVariable;
  2789. prevOffset := MAX(SIZE);
  2790. WHILE variable # NIL DO
  2791. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2792. Reset (variable,refer);
  2793. prevOffset := variable.offsetInBits;
  2794. END;
  2795. variable := variable.nextVariable;
  2796. END;
  2797. END;
  2798. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2799. WHILE parameter # NIL DO
  2800. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2801. Reset (parameter,refer);
  2802. END;
  2803. parameter := parameter.nextParameter;
  2804. END;
  2805. INC(statCoopResetVariables, section.pc - pc);
  2806. currentScope := previousScope;
  2807. END ResetVariables2;
  2808. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2809. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2810. VAR op: IntermediateCode.Operand; context: Context;
  2811. BEGIN
  2812. previousSection := section;
  2813. GetCodeSectionNameForSymbol(procedure, name);
  2814. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2815. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2816. IF dump # NIL THEN dump := section.comments END;
  2817. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2818. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2819. Emit(Data(position,op));
  2820. Emit(Data(position,nil));
  2821. IF HasPointers (procedure.procedureScope) THEN
  2822. GetCodeSectionNameForSymbol(procedure, name);
  2823. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2824. ELSE
  2825. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2826. END;
  2827. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2828. Emit(Data(position,op));
  2829. ReturnToContext(context);
  2830. IF dump # NIL THEN dump := section.comments END;
  2831. END CreateProcedureDescriptor;
  2832. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2833. VAR import: SyntaxTree.Import;
  2834. s: Basic.MessageString;
  2835. selfName: SyntaxTree.IdentifierString;
  2836. BEGIN
  2837. moduleScope.ownerModule.GetName(selfName);
  2838. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2839. module := moduleScope.ownerModule
  2840. ELSE
  2841. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2842. IF import = NIL THEN
  2843. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2844. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2845. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2846. s := "Module ";
  2847. Strings.Append(s,moduleName);
  2848. Strings.Append(s," cannot be imported.");
  2849. IF force THEN
  2850. Error(position,s);
  2851. ELSIF canBeLoaded THEN
  2852. IF WarningDynamicLoading THEN
  2853. Strings.Append(s, "=> no dynamic linking.");
  2854. Warning(position, s);
  2855. END;
  2856. canBeLoaded := FALSE;
  2857. END;
  2858. RETURN FALSE
  2859. ELSE
  2860. SELF.module.imports.AddName(moduleName)
  2861. END;
  2862. ELSIF import.module = NIL THEN (* already tried *)
  2863. RETURN FALSE
  2864. END;
  2865. module := import.module;
  2866. END;
  2867. RETURN TRUE
  2868. END AddImport;
  2869. (* needed for old binary object file format*)
  2870. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2871. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2872. BEGIN
  2873. IF AddImport(moduleName,module,TRUE) THEN
  2874. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2875. IF procedure = NIL THEN
  2876. s := "Instruction not supported on target, emulation procedure ";
  2877. Strings.Append(s,moduleName);
  2878. Strings.Append(s,".");
  2879. Strings.Append(s,procedureName);
  2880. Strings.Append(s," not present");
  2881. Error(position,s);
  2882. ELSE
  2883. StaticCallOperand(r,procedure);
  2884. ReleaseOperand(r);
  2885. fp := GetFingerprint(procedure);
  2886. END;
  2887. END;
  2888. END EnsureSymbol;
  2889. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2890. VAR exit: Label; trueL,falseL: Label;
  2891. BEGIN
  2892. trueL := NewLabel();
  2893. falseL := NewLabel();
  2894. exit := NewLabel();
  2895. Condition(x,trueL,falseL);
  2896. InitOperand(result,ModeValue);
  2897. SetLabel(trueL);
  2898. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2899. Emit(Mov(position,result.op,true));
  2900. BrL(exit);
  2901. SetLabel(falseL);
  2902. Emit(MovReplace(position,result.op,false));
  2903. SetLabel(exit);
  2904. END ConditionToValue;
  2905. PROCEDURE ValueToCondition(VAR op: Operand);
  2906. BEGIN
  2907. LoadValue(op,system.booleanType);
  2908. BrneL(trueLabel,op.op, false);
  2909. ReleaseOperand(op);
  2910. BrL(falseLabel);
  2911. END ValueToCondition;
  2912. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2913. VAR size: LONGINT;
  2914. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2915. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2916. BEGIN
  2917. ASSERT(type.form = SyntaxTree.Open);
  2918. baseType := type.arrayBase.resolved;
  2919. IF IsOpenArray(baseType) THEN
  2920. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2921. ELSE
  2922. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2923. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2924. END;
  2925. len := tag;
  2926. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2927. IntermediateCode.MakeMemory(len,addressType);
  2928. UseIntermediateOperand(len);
  2929. Reuse2(res,sizeOperand,len);
  2930. Emit(Mul(position,res,sizeOperand,len));
  2931. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2932. RETURN res
  2933. END GetArraySize;
  2934. BEGIN
  2935. type := type.resolved;
  2936. IF IsOpenArray(type) THEN
  2937. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2938. RETURN tag
  2939. ELSE
  2940. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2941. END;
  2942. ELSE
  2943. size := ToMemoryUnits(system,system.SizeOf(type));
  2944. RETURN IntermediateCode.Immediate(addressType,size)
  2945. END;
  2946. END GetDynamicSize;
  2947. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2948. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2949. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2950. BEGIN
  2951. ASSERT(type.form = SyntaxTree.Open);
  2952. baseType := type.arrayBase.resolved;
  2953. IF IsOpenArray(baseType) THEN
  2954. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2955. ELSE
  2956. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2957. END;
  2958. len := tag;
  2959. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2960. IntermediateCode.MakeMemory(len,addressType);
  2961. UseIntermediateOperand(len);
  2962. Reuse2(res,sizeOperand,len);
  2963. Emit(Mul(position,res,sizeOperand,len));
  2964. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2965. RETURN res
  2966. END GetLength;
  2967. BEGIN
  2968. type := type.resolved;
  2969. IF IsOpenArray(type) THEN
  2970. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2971. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2972. ELSIF type IS SyntaxTree.StringType THEN
  2973. RETURN tag;
  2974. ELSE
  2975. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2976. END;
  2977. END GetArrayLength;
  2978. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2979. VAR result: IntermediateCode.Operand;
  2980. BEGIN
  2981. IF backend.cooperative THEN
  2982. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2983. ELSE
  2984. MakeMemory(result, tag, addressType, 0);
  2985. END;
  2986. RETURN result
  2987. END GetSizeFromTag;
  2988. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2989. VAR parameter: SyntaxTree.Parameter;
  2990. BEGIN
  2991. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2992. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2993. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2994. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2995. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2996. END;
  2997. RETURN GetDynamicSize(e.type, tag);
  2998. END GetArrayOfBytesSize;
  2999. (*
  3000. to find imported symbol. not needed ?
  3001. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3002. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3003. BEGIN
  3004. IF AddImport(moduleName,importedModule,FALSE) THEN
  3005. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3006. RETURN symbol
  3007. ELSE
  3008. RETURN NIL
  3009. END
  3010. END SymbolByName;
  3011. *)
  3012. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3013. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3014. BEGIN
  3015. IF AddImport(moduleName,runtimeModule,force) THEN
  3016. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3017. IF procedure = NIL THEN
  3018. s := "Procedure ";
  3019. Strings.Append(s,moduleName);
  3020. Strings.Append(s,".");
  3021. Strings.Append(s,procedureName);
  3022. Strings.Append(s," not present");
  3023. Error(position,s);
  3024. RETURN FALSE
  3025. ELSE
  3026. RETURN TRUE
  3027. END;
  3028. ELSE RETURN FALSE
  3029. END;
  3030. END GetRuntimeProcedure;
  3031. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3032. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3033. s: Basic.MessageString;
  3034. BEGIN
  3035. Basic.InitSegmentedName(name);
  3036. name[0] := Basic.MakeString(moduleName);
  3037. name[1] := Basic.MakeString(typeName);
  3038. name[2] := -1;
  3039. IF AddImport(moduleName,importedModule, FALSE) THEN
  3040. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3041. IF symbol = NIL THEN
  3042. s := "type ";
  3043. Strings.Append(s,moduleName);
  3044. Strings.Append(s,".");
  3045. Strings.Append(s,typeName);
  3046. Strings.Append(s," not present");
  3047. Error(position,s);
  3048. END;
  3049. ELSE symbol := NIL;
  3050. END;
  3051. IF importedModule = moduleScope.ownerModule THEN
  3052. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3053. ELSE
  3054. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3055. END;
  3056. RETURN symbol
  3057. END GetTypeDescriptor;
  3058. (* 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. *)
  3059. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3060. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3061. pooledName: Basic.SegmentedName; size: LONGINT;
  3062. BEGIN
  3063. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3064. StaticCallOperand(result,procedure);
  3065. IF numberParameters < 0 THEN
  3066. size := ProcParametersSize(procedure);
  3067. ELSE
  3068. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3069. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3070. Error(position,"runtime call parameter count mismatch");
  3071. END;
  3072. END;
  3073. Emit(Call(position, result.op, size));
  3074. ReleaseOperand(result);
  3075. ELSE (* only static linking possible *)
  3076. ASSERT(numberParameters >= 0);
  3077. Basic.InitSegmentedName(pooledName);
  3078. pooledName[0] := Basic.MakeString(moduleName);
  3079. pooledName[1] := Basic.MakeString(procedureName);
  3080. pooledName[2] := -1;
  3081. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3082. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3083. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3084. END;
  3085. END CallThisChecked;
  3086. (* 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. *)
  3087. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3088. BEGIN
  3089. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3090. END CallThis;
  3091. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3092. VAR
  3093. left,right: Operand;
  3094. leftSize, rightSize: IntermediateCode.Operand;
  3095. saved: RegisterEntry;
  3096. reg: IntermediateCode.Operand;
  3097. procedureName: SyntaxTree.IdentifierString;
  3098. BEGIN
  3099. procedureName := "CompareString";
  3100. SaveRegisters();ReleaseUsedRegisters(saved);
  3101. Designate(leftExpression,left);
  3102. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3103. Emit(Push(position,leftSize));
  3104. ReleaseIntermediateOperand(leftSize);
  3105. Emit(Push(position,left.op));
  3106. ReleaseOperand(left);
  3107. Designate(rightExpression,right);
  3108. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3109. Emit(Push(position,rightSize));
  3110. ReleaseIntermediateOperand(rightSize);
  3111. Emit(Push(position,right.op));
  3112. ReleaseOperand(right);
  3113. CallThis(position,builtinsModuleName,procedureName, 4);
  3114. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3115. Emit(Result(position,reg));
  3116. (*
  3117. AcquireThisRegister(int8,IntermediateCode.Result);
  3118. *)
  3119. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3120. (*
  3121. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3122. *)
  3123. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3124. ReleaseIntermediateOperand(reg);
  3125. BrL(falseLabel);
  3126. END CompareString;
  3127. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3128. VAR
  3129. left,right: Operand;
  3130. leftSize, rightSize: IntermediateCode.Operand;
  3131. saved: RegisterEntry;
  3132. procedureName: SyntaxTree.IdentifierString;
  3133. BEGIN
  3134. procedureName := "CopyString";
  3135. SaveRegisters();ReleaseUsedRegisters(saved);
  3136. Designate(leftExpression,left);
  3137. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3138. Emit(Push(position,leftSize));
  3139. ReleaseIntermediateOperand(leftSize);
  3140. Emit(Push(position,left.op));
  3141. ReleaseOperand(left);
  3142. Designate(rightExpression,right);
  3143. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3144. Emit(Push(position,rightSize));
  3145. ReleaseIntermediateOperand(rightSize);
  3146. Emit(Push(position,right.op));
  3147. ReleaseOperand(right);
  3148. CallThis(position,builtinsModuleName,procedureName,4);
  3149. RestoreRegisters(saved);
  3150. END CopyString;
  3151. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3152. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3153. leftType,rightType: SyntaxTree.Type;
  3154. leftExpression,rightExpression : SyntaxTree.Expression;
  3155. componentType: IntermediateCode.Type;
  3156. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3157. size: LONGINT;
  3158. BEGIN
  3159. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3160. dest := destination; destination := emptyOperand;
  3161. leftType := x.left.type.resolved;
  3162. rightType := x.right.type.resolved;
  3163. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3164. CASE x.operator OF
  3165. Scanner.Or:
  3166. (* shortcut evaluation of left OR right *)
  3167. IF ~conditional THEN ConditionToValue(x);
  3168. ELSE
  3169. next := NewLabel();
  3170. Condition(x.left,trueLabel,next);
  3171. SetLabel(next);
  3172. Condition(x.right,trueLabel,falseLabel);
  3173. END;
  3174. |Scanner.And:
  3175. (* shortcut evaluation of left & right *)
  3176. IF ~conditional THEN ConditionToValue(x);
  3177. ELSE
  3178. next := NewLabel();
  3179. Condition(x.left,next,falseLabel);
  3180. SetLabel(next);
  3181. Condition(x.right,trueLabel,falseLabel);
  3182. END;
  3183. |Scanner.Is:
  3184. IF ~conditional THEN ConditionToValue(x);
  3185. ELSE
  3186. (* get type desc tag *)
  3187. IF IsPointerToRecord(leftType,recordType) THEN
  3188. Evaluate(x.left,left);
  3189. Dereference(left,recordType,IsUnsafePointer(leftType))
  3190. ELSE
  3191. Designate(x.left,left);
  3192. END;
  3193. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3194. ReleaseOperand(left);
  3195. END;
  3196. |Scanner.Plus:
  3197. Evaluate(x.left,left);
  3198. Evaluate(x.right,right);
  3199. IF leftType IS SyntaxTree.SetType THEN
  3200. InitOperand(result,ModeValue);
  3201. Reuse2a(result.op,left.op,right.op,dest);
  3202. Emit(Or(position,result.op,left.op,right.op));
  3203. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3204. InitOperand(result,ModeValue);
  3205. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3206. Reuse2(result.tag,left.tag,right.tag);
  3207. Emit(Add(position,result.op,left.op,right.op));
  3208. Emit(Add(position,result.tag,left.tag,right.tag))
  3209. ELSE
  3210. InitOperand(result,ModeValue);
  3211. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3212. AddInt(result.op, left.op, right.op) ;
  3213. ELSE
  3214. *)
  3215. Reuse2a(result.op,left.op,right.op,dest);
  3216. Emit(Add(position,result.op,left.op,right.op));
  3217. (*
  3218. END;
  3219. *)
  3220. END;
  3221. ReleaseOperand(left); ReleaseOperand(right);
  3222. |Scanner.Minus:
  3223. Evaluate(x.left,left);
  3224. Evaluate(x.right,right);
  3225. IF leftType IS SyntaxTree.SetType THEN
  3226. InitOperand(result,ModeValue);
  3227. Reuse1(result.op,right.op);
  3228. Emit(Not(position,result.op,right.op));
  3229. ReleaseOperand(right);
  3230. Emit(And(position,result.op,result.op,left.op));
  3231. ReleaseOperand(left);
  3232. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3233. InitOperand(result,ModeValue);
  3234. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3235. Reuse2(result.tag,left.tag,right.tag);
  3236. Emit(Sub(position,result.op,left.op,right.op));
  3237. Emit(Sub(position,result.tag,left.tag,right.tag));
  3238. ReleaseOperand(left); ReleaseOperand(right)
  3239. ELSE
  3240. InitOperand(result,ModeValue);
  3241. Reuse2a(result.op,left.op,right.op,dest);
  3242. Emit(Sub(position,result.op,left.op,right.op));
  3243. ReleaseOperand(left); ReleaseOperand(right);
  3244. END;
  3245. |Scanner.Times:
  3246. Evaluate(x.left,left);
  3247. Evaluate(x.right,right);
  3248. IF leftType IS SyntaxTree.SetType THEN
  3249. InitOperand(result,ModeValue);
  3250. Reuse2a(result.op,left.op,right.op,dest);
  3251. Emit(And(position,result.op,left.op,right.op));
  3252. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3253. InitOperand(result, ModeValue);
  3254. componentType := left.op.type;
  3255. (* TODO: review this *)
  3256. (*
  3257. result.op = left.op * right.op - left.tag * right.tag
  3258. result.tag = left.tag * right.op + left.op * right.tag
  3259. *)
  3260. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3261. Emit(Mul(position,result.op, left.op, right.op));
  3262. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3263. Emit(Mul(position,tempReg, left.tag, right.tag));
  3264. Emit(Sub(position,result.op, result.op, tempReg));
  3265. Reuse2(result.tag, left.tag, right.op);
  3266. Emit(Mul(position,result.tag, left.tag, right.op));
  3267. Emit(Mul(position,tempReg, left.op, right.tag));
  3268. Emit(Add(position,result.tag, result.tag, tempReg));
  3269. ReleaseIntermediateOperand(tempReg)
  3270. ELSE
  3271. InitOperand(result,ModeValue);
  3272. Reuse2a(result.op,left.op,right.op,dest);
  3273. Emit(Mul(position,result.op,left.op,right.op));
  3274. END;
  3275. ReleaseOperand(left); ReleaseOperand(right);
  3276. |Scanner.Div:
  3277. Evaluate(x.left,left);
  3278. Evaluate(x.right,right);
  3279. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3280. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3281. IF ~isUnchecked THEN
  3282. exit := NewLabel();
  3283. BrltL(exit,zero,right.op);
  3284. EmitTrap(position,NegativeDivisorTrap);
  3285. SetLabel(exit);
  3286. END;
  3287. END;
  3288. InitOperand(result,ModeValue);
  3289. Reuse2a(result.op,left.op,right.op,dest);
  3290. Emit(Div(position,result.op,left.op,right.op));
  3291. ReleaseOperand(left); ReleaseOperand(right);
  3292. |Scanner.Mod:
  3293. Evaluate(x.left,left);
  3294. Evaluate(x.right,right);
  3295. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3296. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3297. IF ~isUnchecked THEN
  3298. exit := NewLabel();
  3299. BrltL(exit,zero,right.op);
  3300. EmitTrap(position,NegativeDivisorTrap);
  3301. SetLabel(exit);
  3302. END;
  3303. END;
  3304. InitOperand(result,ModeValue);
  3305. Reuse2a(result.op,left.op,right.op,dest);
  3306. Emit(Mod(position,result.op,left.op,right.op));
  3307. ReleaseOperand(left); ReleaseOperand(right);
  3308. |Scanner.Slash:
  3309. Evaluate(x.left,left);
  3310. Evaluate(x.right,right);
  3311. IF leftType IS SyntaxTree.SetType THEN
  3312. InitOperand(result,ModeValue);
  3313. Reuse2a(result.op,left.op,right.op,dest);
  3314. Emit(Xor(position,result.op,left.op,right.op));
  3315. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3316. InitOperand(result,ModeValue);
  3317. componentType := left.op.type;
  3318. (* review this *)
  3319. (*
  3320. divisor = right.op * right.op + right.tag * right.tag
  3321. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3322. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3323. *)
  3324. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3325. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3326. Emit(Mul(position,tempReg, right.op, right.op));
  3327. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3328. Emit(Add(position,tempReg, tempReg, tempReg2));
  3329. result.op := tempReg2;
  3330. Emit(Mul(position,result.op, left.op, right.op));
  3331. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3332. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3333. Emit(Add(position,result.op, result.op, tempReg2));
  3334. Emit(Div(position,result.op, result.op, tempReg));
  3335. Reuse2(result.tag, left.tag, right.op);
  3336. Emit(Mul(position,result.tag, left.tag, right.op));
  3337. Emit(Mul(position,tempReg2, left.op, right.tag));
  3338. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3339. Emit(Div(position,result.tag, result.tag, tempReg));
  3340. ReleaseIntermediateOperand(tempReg);
  3341. ReleaseIntermediateOperand(tempReg2)
  3342. ELSE
  3343. InitOperand(result,ModeValue);
  3344. Reuse2a(result.op,left.op,right.op,dest);
  3345. Emit(Div(position,result.op,left.op,right.op));
  3346. END;
  3347. ReleaseOperand(left); ReleaseOperand(right);
  3348. |Scanner.Equal:
  3349. IF ~conditional THEN ConditionToValue(x);
  3350. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3351. CompareString(BreqL,x.left,x.right);
  3352. ELSE
  3353. Evaluate(x.left,left);
  3354. Evaluate(x.right,right);
  3355. IF leftType IS SyntaxTree.RangeType THEN
  3356. ASSERT(rightType IS SyntaxTree.RangeType);
  3357. BrneL(falseLabel, left.op, right.op); (* first *)
  3358. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3359. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3360. ReleaseOperand(left); ReleaseOperand(right);
  3361. BrL(trueLabel)
  3362. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3363. BrneL(falseLabel, left.op, right.op); (* first *)
  3364. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3365. ReleaseOperand(left); ReleaseOperand(right);
  3366. BrL(trueLabel)
  3367. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3368. (* TODO: review this *)
  3369. BrneL(falseLabel, left.op, right.op); (* real part *)
  3370. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3371. ReleaseOperand(left); ReleaseOperand(right);
  3372. BrL(trueLabel)
  3373. ELSE
  3374. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3375. ReleaseOperand(left); ReleaseOperand(right);
  3376. BrL(trueLabel);
  3377. END;
  3378. END;
  3379. |Scanner.LessEqual:
  3380. IF ~conditional THEN ConditionToValue(x);
  3381. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3382. CompareString(BrgeL,x.right,x.left);
  3383. ELSE
  3384. Evaluate(x.left,left);
  3385. Evaluate(x.right,right);
  3386. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3387. Reuse1(temp.op,right.op);
  3388. Emit(And(position,temp.op,left.op,right.op));
  3389. ReleaseOperand(right);
  3390. BreqL(trueLabel,temp.op,left.op);
  3391. BrL(falseLabel);
  3392. ReleaseOperand(temp);ReleaseOperand(left);
  3393. ELSE
  3394. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3395. ReleaseOperand(left); ReleaseOperand(right);
  3396. BrL(trueLabel);
  3397. END;
  3398. END;
  3399. |Scanner.Less:
  3400. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3401. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3402. leftExpression.SetType(system.booleanType);
  3403. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3404. rightExpression.SetType(system.booleanType);
  3405. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3406. leftExpression.SetType(system.booleanType);
  3407. Expression(leftExpression);
  3408. ELSIF ~conditional THEN ConditionToValue(x);
  3409. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3410. CompareString(BrltL,x.left,x.right);
  3411. ELSE
  3412. Evaluate(x.left,left);
  3413. Evaluate(x.right,right);
  3414. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3415. ReleaseOperand(left); ReleaseOperand(right);
  3416. BrL(trueLabel);
  3417. END;
  3418. |Scanner.Greater:
  3419. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3420. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3421. leftExpression.SetType(system.booleanType);
  3422. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3423. rightExpression.SetType(system.booleanType);
  3424. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3425. leftExpression.SetType(system.booleanType);
  3426. Expression(leftExpression);
  3427. ELSIF ~conditional THEN ConditionToValue(x);
  3428. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3429. CompareString(BrltL,x.right,x.left);
  3430. ELSE
  3431. Evaluate(x.left,left);
  3432. Evaluate(x.right,right);
  3433. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3434. ReleaseOperand(left); ReleaseOperand(right);
  3435. BrL(trueLabel);
  3436. END;
  3437. |Scanner.GreaterEqual:
  3438. IF ~conditional THEN ConditionToValue(x);
  3439. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3440. CompareString(BrgeL,x.left,x.right);
  3441. ELSE
  3442. Evaluate(x.left,left);
  3443. Evaluate(x.right,right);
  3444. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3445. Reuse1(temp.op,left.op);
  3446. Emit(And(position,temp.op,left.op,right.op));
  3447. ReleaseOperand(left);
  3448. BreqL(trueLabel, temp.op,right.op);
  3449. ReleaseOperand(temp); ReleaseOperand(right);
  3450. BrL(falseLabel);
  3451. ELSE
  3452. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3453. ReleaseOperand(left); ReleaseOperand(right);
  3454. BrL(trueLabel);
  3455. END;
  3456. END;
  3457. |Scanner.Unequal:
  3458. IF ~conditional THEN ConditionToValue(x);
  3459. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3460. CompareString(BrneL,x.left,x.right);
  3461. ELSE
  3462. Evaluate(x.left,left);
  3463. Evaluate(x.right,right);
  3464. IF leftType IS SyntaxTree.RangeType THEN
  3465. ASSERT(rightType IS SyntaxTree.RangeType);
  3466. BrneL(trueLabel, left.op, right.op); (* first *)
  3467. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3468. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3469. ReleaseOperand(left); ReleaseOperand(right);
  3470. BrL(falseLabel)
  3471. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3472. BrneL(trueLabel, left.op, right.op); (* first *)
  3473. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3474. ReleaseOperand(left); ReleaseOperand(right);
  3475. BrL(falseLabel)
  3476. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3477. (* TODO: review this *)
  3478. BrneL(trueLabel, left.op, right.op); (* real part *)
  3479. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3480. ReleaseOperand(left); ReleaseOperand(right);
  3481. BrL(falseLabel)
  3482. ELSE
  3483. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3484. ReleaseOperand(left); ReleaseOperand(right);
  3485. BrL(trueLabel);
  3486. END;
  3487. END;
  3488. |Scanner.In:
  3489. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3490. Evaluate(x.left,left);
  3491. Evaluate(x.right,right);
  3492. Convert(left.op,setType);
  3493. Convert(right.op,setType);
  3494. ReuseCopy(temp.op,right.op);
  3495. Emit(Shr(position,temp.op,temp.op,left.op));
  3496. ReleaseOperand(right); ReleaseOperand(left);
  3497. IntermediateCode.InitImmediate(one,setType,1);
  3498. Emit(And(position,temp.op,temp.op,one));
  3499. IF conditional THEN
  3500. IntermediateCode.InitImmediate(zero,setType,0);
  3501. BrneL(trueLabel,temp.op,zero);
  3502. ReleaseOperand(temp);
  3503. BrL(falseLabel);
  3504. ELSE
  3505. Convert(temp.op,bool);
  3506. result.mode := ModeValue;
  3507. result.op := temp.op;
  3508. result.tag := nil; (* may be left over from calls to evaluate *)
  3509. END;
  3510. ELSE
  3511. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3512. IF x.operator = Scanner.Questionmarks THEN
  3513. leftExpression := x.left;
  3514. rightExpression := x.right;
  3515. ELSE
  3516. leftExpression := x.right;
  3517. rightExpression := x.left;
  3518. END;
  3519. Evaluate(leftExpression, left);
  3520. Emit(Push(position,left.op));
  3521. ReleaseOperand(left);
  3522. Designate(rightExpression, right);
  3523. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3524. IF ~backend.cellsAreObjects THEN
  3525. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3526. END;
  3527. Emit(Push(position,right.op));
  3528. ReleaseOperand(right);
  3529. IF backend.cellsAreObjects THEN
  3530. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3531. ELSE
  3532. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3533. END;
  3534. InitOperand(result, ModeValue);
  3535. result.op := NewRegisterOperand(bool);
  3536. Emit(Result(position,result.op));
  3537. IF conditional THEN
  3538. IntermediateCode.InitImmediate(zero,setType,0);
  3539. BrneL(trueLabel,result.op,zero);
  3540. ReleaseOperand(result);
  3541. BrL(falseLabel);
  3542. END;
  3543. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3544. leftExpression := x.left;
  3545. rightExpression := x.right;
  3546. Evaluate(leftExpression, left);
  3547. Emit(Push(position,left.op));
  3548. ReleaseOperand(left);
  3549. Evaluate(rightExpression, right);
  3550. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3551. IF ~backend.cellsAreObjects THEN
  3552. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3553. END;
  3554. Emit(Push(position,right.op));
  3555. ReleaseOperand(right);
  3556. IF backend.cellsAreObjects THEN
  3557. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3558. ELSE
  3559. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3560. END;
  3561. InitOperand(result, ModeValue);
  3562. result.op := NewRegisterOperand(bool);
  3563. Emit(Result(position,result.op));
  3564. IF conditional THEN
  3565. IntermediateCode.InitImmediate(zero,setType,0);
  3566. BrneL(trueLabel,result.op,zero);
  3567. ReleaseOperand(result);
  3568. BrL(falseLabel);
  3569. END;
  3570. ELSE
  3571. HALT(100);
  3572. END;
  3573. END;
  3574. destination := dest;
  3575. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3576. END VisitBinaryExpression;
  3577. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3578. VAR localResult, operand: Operand;
  3579. BEGIN
  3580. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3581. InitOperand(localResult, ModeValue);
  3582. ASSERT(x.first # NIL);
  3583. Evaluate(x.first, operand);
  3584. localResult.op := operand.op;
  3585. ReleaseOperand(operand);
  3586. UseIntermediateOperand(localResult.op);
  3587. ASSERT(x.last # NIL);
  3588. Evaluate(x.last, operand);
  3589. localResult.tag := operand.op;
  3590. ReleaseOperand(operand);
  3591. UseIntermediateOperand(localResult.tag);
  3592. IF x.step # NIL THEN
  3593. Evaluate(x.step, operand);
  3594. localResult.extra := operand.op;
  3595. ReleaseOperand(operand);
  3596. UseIntermediateOperand(localResult.extra);
  3597. END;
  3598. result := localResult;
  3599. IF Trace THEN TraceExit("VisitRangeExpression") END
  3600. END VisitRangeExpression;
  3601. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3602. BEGIN
  3603. HALT(100); (* should never be evaluated *)
  3604. END VisitTensorRangeExpression;
  3605. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3606. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3607. BEGIN
  3608. IF Trace THEN TraceEnter("VisitConversion") END;
  3609. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3610. dest := destination; destination := emptyOperand;
  3611. Evaluate(x.expression,old);
  3612. InitOperand(result,ModeValue);
  3613. result.op := old.op;
  3614. ASSERT(result.op.mode # 0);
  3615. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3616. (* convert TO a complex number *)
  3617. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3618. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3619. ASSERT(result.op.mode # 0);
  3620. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3621. (* convert FROM a complex number TO a complex number*)
  3622. result.tag := old.tag;
  3623. ASSERT(result.tag.mode # 0);
  3624. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3625. ASSERT(result.tag.mode # 0)
  3626. ELSE
  3627. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3628. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3629. END
  3630. ELSE
  3631. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3632. ASSERT(result.op.mode # 0);
  3633. result.tag := old.tag; (*! probably never used *)
  3634. END;
  3635. destination := dest;
  3636. IF Trace THEN TraceExit("VisitConversion") END;
  3637. END VisitConversion;
  3638. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3639. BEGIN
  3640. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3641. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3642. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3643. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3644. END VisitTypeDeclaration;
  3645. (** designators (expressions) *)
  3646. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3647. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3648. BEGIN
  3649. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3650. IF x.left # NIL THEN Expression(x.left) END;
  3651. Symbol(x.symbol,result);
  3652. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3653. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3654. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3655. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3656. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3657. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3658. END;
  3659. END;
  3660. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3661. END VisitSymbolDesignator;
  3662. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3663. BEGIN
  3664. IF isUnchecked THEN RETURN END;
  3665. IF tagsAvailable THEN
  3666. TrapC(BrltL,index,length,IndexCheckTrap);
  3667. END;
  3668. END BoundCheck;
  3669. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3670. VAR d: IntermediateCode.Operand;
  3671. BEGIN
  3672. IF isUnchecked THEN RETURN END;
  3673. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3674. TrapC(op,dim,d,ArraySizeTrap);
  3675. ReleaseIntermediateOperand(d);
  3676. END DimensionCheck;
  3677. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3678. VAR
  3679. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3680. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3681. expression: SyntaxTree.Expression;
  3682. resultingType, leftType, baseType: SyntaxTree.Type;
  3683. skipLabel1: Label;
  3684. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3685. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3686. variableOp: Operand;
  3687. variable: SyntaxTree.Variable;
  3688. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3689. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3690. VAR e: SyntaxTree.Expression; i: LONGINT;
  3691. BEGIN
  3692. tensorFound := FALSE;
  3693. FOR i := 0 TO parameters.Length()-1 DO
  3694. e := parameters.GetExpression(i);
  3695. IF e IS SyntaxTree.TensorRangeExpression THEN
  3696. ASSERT(~tensorFound);
  3697. tensorFound := TRUE;
  3698. ELSIF e IS SyntaxTree.RangeExpression THEN
  3699. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3700. ELSE
  3701. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3702. END;
  3703. END;
  3704. END CountIndices;
  3705. BEGIN
  3706. ASSERT(tagsAvailable);
  3707. resultingType := x.type.resolved; (* resulting type *)
  3708. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3709. InitOperand(localResult, ModeReference);
  3710. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3711. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3712. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3713. (* a globally defined array destination tag is available -> use and invalidate it*)
  3714. localResult.tag := arrayDestinationTag;
  3715. IntermediateCode.InitOperand(arrayDestinationTag)
  3716. ELSE
  3717. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3718. (* the result is of array range type and thus does not provide any collectable pointers *)
  3719. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3720. Symbol(variable, variableOp);
  3721. ReuseCopy(localResult.tag, variableOp.op);
  3722. ReleaseOperand(variableOp);
  3723. END
  3724. END;
  3725. indexListSize := x.parameters.Length();
  3726. CountIndices(x.parameters);
  3727. (*ASSERT(tensorRangeCount <= 1);*)
  3728. (* designate the array to be indexed over, perform tensor range check if known *)
  3729. Designate(x.left, array);
  3730. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3731. Dereference(array, leftType,FALSE);
  3732. IF ~tensorFound THEN
  3733. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3734. END
  3735. END;
  3736. (* default base offset *)
  3737. srcDimOffset := 0;
  3738. destDimOffset := 0;
  3739. indexDim := 0;
  3740. (* use address of source array as basis *)
  3741. localResult.op := array.op;
  3742. UseIntermediateOperand(localResult.op);
  3743. (* go through the index list *)
  3744. FOR i := 0 TO indexListSize - 1 DO
  3745. expression := x.parameters.GetExpression(i);
  3746. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3747. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3748. srcDimOffset := -indexListSize;
  3749. destDimOffset := -suffixRanges;
  3750. ELSE
  3751. (* determine which dimension of source array is currently looked at *)
  3752. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3753. (* get the memory operand pointing to array descriptor dimension *)
  3754. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3755. (* make a reusable register from it *)
  3756. ReuseCopy(srcDim, tmp);
  3757. ReleaseIntermediateOperand(tmp);
  3758. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3759. ELSE
  3760. srcDim := IntermediateCode.Immediate(sizeType, i);
  3761. END;
  3762. (* get length and increment of source array for current dimension *)
  3763. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3764. Convert(sourceLength.op, sizeType);
  3765. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3766. Convert(sourceIncrement.op, sizeType);
  3767. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3768. ReleaseIntermediateOperand(srcDim);
  3769. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3770. (* SINGLE INDEX *)
  3771. Evaluate(expression, index);
  3772. ReleaseIntermediateOperand(index.tag);
  3773. index.tag := emptyOperand;
  3774. Convert(index.op, sizeType);
  3775. (* lower bound check *)
  3776. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3777. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3778. ELSIF isUnchecked THEN (* do nothing *)
  3779. ELSE
  3780. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3781. END;
  3782. (* upper bound check *)
  3783. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3784. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3785. ELSIF isUnchecked THEN (* do nothing *)
  3786. ELSE
  3787. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3788. END;
  3789. ReleaseOperand(sourceLength);
  3790. Convert(index.op, addressType);
  3791. summand := index.op;
  3792. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3793. (* RANGE OF INDICES *)
  3794. Evaluate(expression, range);
  3795. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3796. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3797. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3798. ReleaseOperand(range);
  3799. Convert(firstIndex, sizeType);
  3800. Convert(lastIndex, sizeType);
  3801. Convert(stepSize, sizeType);
  3802. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3803. if it is 'MAX(LONGINT)' *)
  3804. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3805. TransferToRegister(lastIndex, lastIndex);
  3806. skipLabel1 := NewLabel();
  3807. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3808. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3809. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3810. SetLabel(skipLabel1)
  3811. END;
  3812. (* check if step size is valid *)
  3813. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3814. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3815. ELSIF isUnchecked THEN (* do nothing *)
  3816. ELSE
  3817. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3818. END;
  3819. (* check lower bound check *)
  3820. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3821. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3822. ELSIF isUnchecked THEN (* do nothing *)
  3823. ELSE
  3824. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3825. END;
  3826. (* check upper bound check *)
  3827. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3828. (* statically open range: nothing to do *)
  3829. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3830. ASSERT(staticLastIndex < staticSourceLength)
  3831. ELSIF isUnchecked THEN (* do nothing *)
  3832. ELSE
  3833. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3834. END;
  3835. (* determine length of target array for current dimension *)
  3836. (* 1. incorporate last index: *)
  3837. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3838. (* last index is static *)
  3839. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3840. targetLength := sourceLength.op
  3841. ELSE
  3842. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3843. END;
  3844. UseIntermediateOperand(targetLength);
  3845. ELSE
  3846. (* targetLength := lastIndex + 1
  3847. Reuse1(targetLength, lastIndex);
  3848. *)
  3849. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3850. END;
  3851. ReleaseOperand(sourceLength);
  3852. ReleaseIntermediateOperand(lastIndex);
  3853. (* 2. incorporate first index: *)
  3854. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3855. (* first index and current target length are static *)
  3856. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3857. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3858. (* first index = 0: nothing to do *)
  3859. ELSE
  3860. (* targetLength := targetLength - firstIndex *)
  3861. TransferToRegister(targetLength, targetLength);
  3862. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3863. END;
  3864. (* clip negative lengths to 0 *)
  3865. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3866. IF staticTargetLength < 0 THEN
  3867. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3868. END
  3869. ELSE
  3870. skipLabel1 := NewLabel();
  3871. TransferToRegister(targetLength, targetLength);
  3872. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3873. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3874. SetLabel(skipLabel1)
  3875. END;
  3876. (* 3. incorporate index step size: *)
  3877. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3878. (*step size and current target length are static *)
  3879. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3880. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3881. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3882. (* step size = 1: nothing to do *)
  3883. ELSE
  3884. (* emit code for this:
  3885. targetLength := (targetLength-1) DIV stepSize +1;
  3886. *)
  3887. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3888. DivInt(targetLength, targetLength, stepSize);
  3889. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3890. END;
  3891. (* determine increment of target array for current dimension *)
  3892. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3893. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3894. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3895. (* step size = 1 *)
  3896. targetIncrement := sourceIncrement.op;
  3897. UseIntermediateOperand(targetIncrement)
  3898. ELSE
  3899. (* targetIncrement := sourceIncrement * stepSize *)
  3900. Reuse1(targetIncrement, stepSize);
  3901. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3902. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3903. END;
  3904. ReleaseIntermediateOperand(stepSize);
  3905. (* write length and increment of target array to descriptor *)
  3906. IF destDimOffset < 0 THEN
  3907. (* determine which dimension of target array is currently looked at *)
  3908. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3909. TransferToRegister(destDim, tmp);
  3910. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3911. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3912. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3913. ReleaseIntermediateOperand(destDim);
  3914. INC(destDimOffset);
  3915. ELSE
  3916. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3917. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3918. END;
  3919. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3920. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3921. INC(indexDim);
  3922. Convert(firstIndex, addressType);
  3923. TransferToRegister(summand, firstIndex);
  3924. ELSE HALT(100);
  3925. END;
  3926. (*
  3927. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3928. *)
  3929. Convert(sourceIncrement.op, addressType);
  3930. Convert(summand, addressType);
  3931. MulInt(summand, summand, sourceIncrement.op);
  3932. ReleaseIntermediateOperand(sourceIncrement.op);
  3933. AddInt(localResult.op, localResult.op, summand);
  3934. ReleaseIntermediateOperand(summand);
  3935. END
  3936. END;
  3937. result := localResult;
  3938. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3939. ReleaseIntermediateOperand(result.tag);
  3940. result.tag := TypeDescriptorAdr(resultingType);
  3941. ELSIF IsDelegate(resultingType) THEN
  3942. ReleaseIntermediateOperand(result.tag);
  3943. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3944. UseIntermediateOperand(result.tag);
  3945. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3946. ReleaseIntermediateOperand(result.tag);
  3947. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3948. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3949. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3950. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3951. (* finalize target array descriptor *)
  3952. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3953. (* write lengths and increments of target array for remaining dimensions *)
  3954. i := indexListSize;
  3955. WHILE indexDim < targetArrayDimensionality DO
  3956. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3957. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3958. ReleaseOperand(sourceLength);
  3959. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3960. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3961. ReleaseOperand(sourceIncrement);
  3962. INC(i); INC(indexDim);
  3963. END;
  3964. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3965. tmp := nil;
  3966. ELSE
  3967. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3968. END;
  3969. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3970. ReleaseIntermediateOperand(tmp);
  3971. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3972. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3973. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3974. ELSE
  3975. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3976. END;
  3977. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3978. ReleaseIntermediateOperand(tmp);
  3979. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3980. (* write dimensionality *)
  3981. IF targetArrayDimensionality # 0 THEN
  3982. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3983. END;
  3984. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3985. END;
  3986. ReleaseOperand(array);
  3987. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3988. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3989. END;
  3990. END MathIndexDesignator;
  3991. (* get the length of an array , trying to make use of static information *)
  3992. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3993. VAR res: IntermediateCode.Operand; size: LONGINT;
  3994. BEGIN
  3995. type := type.resolved;
  3996. IF type IS SyntaxTree.ArrayType THEN
  3997. WITH type: SyntaxTree.ArrayType DO
  3998. IF type.form = SyntaxTree.Static THEN
  3999. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4000. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4001. Evaluate(type.length, op);
  4002. ReleaseIntermediateOperand(op.tag);
  4003. RETURN op.op;*)
  4004. ELSE
  4005. res := tag;
  4006. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4007. IntermediateCode.MakeMemory(res,addressType);
  4008. UseIntermediateOperand(res);
  4009. RETURN res
  4010. END
  4011. END;
  4012. ELSE
  4013. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4014. RETURN IntermediateCode.Immediate(addressType,size);
  4015. END;
  4016. END ArrayLength;
  4017. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4018. BEGIN
  4019. IF IsImmediate(x) THEN
  4020. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4021. ELSE
  4022. IF ~ReusableRegister(res) THEN
  4023. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4024. ELSE
  4025. UseIntermediateOperand(res);
  4026. END;
  4027. Emit(Mov(position,res,x))
  4028. END;
  4029. END CopyInt;
  4030. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4031. BEGIN
  4032. ReleaseIntermediateOperand(res);
  4033. IF IsImmediate(x) & IsImmediate(y) THEN
  4034. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4035. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4036. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4037. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4038. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4039. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4040. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4041. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4042. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4043. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4044. UseIntermediateOperand(res);
  4045. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4046. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4047. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4048. UseIntermediateOperand(res);
  4049. ELSE
  4050. IF ~ReusableRegister(res) THEN
  4051. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4052. ELSE
  4053. UseIntermediateOperand(res);
  4054. END;
  4055. IF IsImmediate(x) & (x.intValue = 0) THEN
  4056. Emit(Mov(position,res,y))
  4057. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4058. Emit(Mov(position,res,x))
  4059. ELSE
  4060. Emit(Add(position,res, x, y));
  4061. END;
  4062. END;
  4063. END AddInt;
  4064. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4065. BEGIN
  4066. ReleaseIntermediateOperand(res);
  4067. IF IsImmediate(x) & IsImmediate(y) THEN
  4068. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4069. ELSE
  4070. IF ~ReusableRegister(res) THEN
  4071. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4072. ELSE UseIntermediateOperand(res);
  4073. END;
  4074. IF IsImmediate(x) & (x.intValue = 1) THEN
  4075. Emit(Mov(position,res,y))
  4076. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4077. Emit(Mov(position,res,x))
  4078. ELSE
  4079. Emit(Mul(position,res, x, y));
  4080. END;
  4081. END;
  4082. END MulInt;
  4083. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4084. BEGIN
  4085. ReleaseIntermediateOperand(res);
  4086. IF IsImmediate(x) & IsImmediate(y) THEN
  4087. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4088. ELSE
  4089. IF ~ReusableRegister(res) THEN
  4090. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4091. ELSE UseIntermediateOperand(res);
  4092. END;
  4093. IF IsImmediate(x) & (x.intValue = 1) THEN
  4094. Emit(Mov(position,res,y))
  4095. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4096. Emit(Mov(position,res,x))
  4097. ELSE
  4098. Emit(Div(position,res, x, y));
  4099. END;
  4100. END;
  4101. END DivInt;
  4102. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4103. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4104. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4105. BEGIN
  4106. type := x.left.type.resolved;
  4107. IF type IS SyntaxTree.StringType THEN
  4108. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4109. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4110. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4111. type := atype;
  4112. x.left.SetType(type);
  4113. END;
  4114. IntermediateCode.InitImmediate(res,addressType,0);
  4115. maxDim := x.parameters.Length()-1;
  4116. (*
  4117. computation rule:
  4118. a: ARRAY X,Y,Z OF Element with size S
  4119. a[i,j,k] -->
  4120. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4121. *)
  4122. FOR i := 0 TO maxDim DO
  4123. e := x.parameters.GetExpression(i);
  4124. Evaluate(e,index);
  4125. Convert(index.op,addressType);
  4126. AddInt(res, res, index.op);
  4127. IF i = 0 THEN
  4128. (*
  4129. ReuseCopy(res, index.op);
  4130. *)
  4131. Designate(x.left,array);
  4132. type := x.left.type.resolved;
  4133. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4134. Dereference(array, type, FALSE);
  4135. END;
  4136. (*
  4137. ELSE AddInt(res, res, index.op);
  4138. *)
  4139. END;
  4140. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4141. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4142. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4143. BoundCheck(index.op, length);
  4144. END;
  4145. ReleaseIntermediateOperand(length);
  4146. END;
  4147. ReleaseOperand(index);
  4148. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4149. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4150. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4151. MulInt(res,res,length);
  4152. END;
  4153. ReleaseIntermediateOperand(length);
  4154. END;
  4155. (* remaining open dimensions -- compute address *)
  4156. i := maxDim+1;
  4157. IF type IS SyntaxTree.ArrayType THEN
  4158. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4159. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4160. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4161. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4162. MulInt(res,res,length);
  4163. END;
  4164. ReleaseIntermediateOperand(length);
  4165. INC(i);
  4166. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4167. END;
  4168. END;
  4169. IF (type IS SyntaxTree.ArrayType) THEN
  4170. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4171. size := StaticSize(system, type);
  4172. IF size # 1 THEN
  4173. length := IntermediateCode.Immediate(addressType,size);
  4174. MulInt(res,res,length);
  4175. END;
  4176. ELSE
  4177. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4178. IF size # 1 THEN
  4179. length := IntermediateCode.Immediate(addressType,size);
  4180. MulInt(res,res,length);
  4181. END;
  4182. END;
  4183. END;
  4184. AddInt(res,res,array.op);
  4185. InitOperand(result,ModeReference);
  4186. result.op := res;
  4187. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4188. ReleaseIntermediateOperand(result.tag);
  4189. result.tag := TypeDescriptorAdr(type);
  4190. ELSIF IsDelegate(type) THEN
  4191. ReleaseIntermediateOperand(result.tag);
  4192. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4193. UseIntermediateOperand(result.tag);
  4194. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4195. ReleaseIntermediateOperand(result.tag);
  4196. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4197. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4198. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4199. END;
  4200. ReleaseOperand(array);
  4201. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4202. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4203. END;
  4204. END IndexDesignator;
  4205. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4206. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4207. BEGIN
  4208. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4209. dest := destination; destination := emptyOperand;
  4210. type := x.left.type.resolved;
  4211. IF type IS SyntaxTree.MathArrayType THEN
  4212. MathIndexDesignator(x);
  4213. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4214. IndexDesignator(x);
  4215. END;
  4216. destination := dest;
  4217. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4218. END VisitIndexDesignator;
  4219. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4220. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4221. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4222. procedure: SyntaxTree.Procedure;
  4223. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4224. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4225. BEGIN
  4226. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4227. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4228. parameters := expression.parameters;
  4229. moduleName := "FoxArrayBase";
  4230. procedureName := "CopyDescriptor";
  4231. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4232. SaveRegisters();ReleaseUsedRegisters(saved);
  4233. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4234. IF procedure = NIL THEN
  4235. s := "procedure ";
  4236. Strings.Append(s,moduleName);
  4237. Strings.Append(s,".");
  4238. Strings.Append(s,procedureName);
  4239. Strings.Append(s," not present");
  4240. Error(position,s);
  4241. ELSE
  4242. (* push address of temporary variable *)
  4243. Symbol(variable,destOperand);
  4244. Emit(Push(position,destOperand.op));
  4245. ReleaseOperand(destOperand);
  4246. (* push src *)
  4247. Evaluate(expression.left,srcOperand);
  4248. (*
  4249. Dereference(srcOperand,expression.type.resolved);
  4250. Emit(Push(position,srcOperand.tag));
  4251. *)
  4252. Emit(Push(position,srcOperand.op));
  4253. ReleaseOperand(srcOperand);
  4254. tensorFound := FALSE;
  4255. FOR i := 0 TO parameters.Length()-1 DO
  4256. e := parameters.GetExpression(i);
  4257. IF e IS SyntaxTree.TensorRangeExpression THEN
  4258. tensorFound := TRUE;
  4259. ELSIF e IS SyntaxTree.RangeExpression THEN
  4260. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4261. ELSE
  4262. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4263. END;
  4264. END;
  4265. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4266. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4267. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4268. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4269. StaticCallOperand(procOp,procedure);
  4270. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4271. ReleaseOperand(procOp);
  4272. END;
  4273. RestoreRegisters(saved);
  4274. END;
  4275. RETURN variable
  4276. END PrepareTensorDescriptor;
  4277. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4278. VAR
  4279. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4280. operand, tmpOperand, variableOp, variable2Op: Operand;
  4281. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4282. variable, variable2: SyntaxTree.Variable;
  4283. dim, i, size: LONGINT;
  4284. (* TODO: needed? *)
  4285. oldArrayDestinationTag: IntermediateCode.Operand;
  4286. oldArrayDestinationDimension: LONGINT;
  4287. position: Position;
  4288. saved: RegisterEntry;
  4289. arrayFlags: SET;
  4290. m, n: LONGINT;
  4291. PROCEDURE Pass(op: IntermediateCode.Operand);
  4292. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4293. BEGIN
  4294. IF numberRegister >= 0 THEN
  4295. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4296. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4297. Emit(Mov(position,parameterRegister, op));
  4298. ELSE
  4299. Emit(Push(position,op))
  4300. END
  4301. END Pass;
  4302. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4303. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4304. BEGIN
  4305. formalType := formalType.resolved; actualType := actualType.resolved;
  4306. IF IsOpenArray(formalType)THEN
  4307. IF actualType IS SyntaxTree.StringType THEN
  4308. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4309. RETURN;
  4310. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4311. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4312. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4313. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4314. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4315. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4316. ELSE
  4317. tmp := baseReg;
  4318. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4319. IntermediateCode.MakeMemory(tmp,addressType);
  4320. Pass((tmp));
  4321. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4322. END;
  4323. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4324. END;
  4325. END PushArrayLens;
  4326. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4327. BEGIN
  4328. CASE size OF
  4329. |2: INCL(flags,Size2Flag);
  4330. |3: INCL(flags,Size3Flag);
  4331. |4: INCL(flags,Size4Flag);
  4332. |5: INCL(flags,Size5Flag);
  4333. |6: INCL(flags,Size6Flag);
  4334. |7: INCL(flags,Size7Flag);
  4335. |8: INCL(flags,Size8Flag);
  4336. END;
  4337. END SetSmallArraySizeFlag;
  4338. BEGIN
  4339. IF Trace THEN TraceEnter("PushParameter") END;
  4340. position := expression.position;
  4341. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4342. type := expression.type.resolved;
  4343. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4344. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4345. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4346. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4347. );
  4348. (* TODO: needed? *)
  4349. oldArrayDestinationTag := arrayDestinationTag;
  4350. oldArrayDestinationDimension := arrayDestinationDimension;
  4351. IF IsArrayOfSystemByte(parameter.type) THEN
  4352. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4353. Designate(expression,operand);
  4354. ELSE
  4355. Evaluate(expression, tmpOperand);
  4356. (* array of system byte does not provide any pointers *)
  4357. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4358. Symbol(variable, operand);
  4359. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4360. Emit(Mov(position,tmp, tmpOperand.op));
  4361. ReleaseOperand(tmpOperand);
  4362. END;
  4363. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4364. ReleaseIntermediateOperand(operand.tag);
  4365. operand.tag := tmp;
  4366. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4367. Pass((operand.tag));
  4368. END;
  4369. Pass((operand.op));
  4370. ELSIF IsOpenArray(parameter.type) THEN
  4371. Designate(expression,operand);
  4372. baseReg := operand.tag;
  4373. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4374. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4375. END;
  4376. Pass((operand.op)); (* address of the array *)
  4377. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4378. (* case 1
  4379. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4380. *)
  4381. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4382. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4383. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4384. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4385. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4386. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4387. arrayDestinationTag := sp;
  4388. (* case 1b
  4389. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4390. *)
  4391. IF expression IS SyntaxTree.IndexDesignator THEN
  4392. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4393. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4394. arrayDestinationDimension := dim;
  4395. Designate(expression,operand);
  4396. (* case 1a
  4397. P(...,A,...) push: push array descriptor to stack
  4398. *)
  4399. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4400. Designate(expression,operand);
  4401. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4402. i := 0;
  4403. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4404. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4405. INC(i);
  4406. END;
  4407. type := expression.type.resolved;
  4408. WHILE (i<dim) DO (* remaining static dimensions *)
  4409. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4410. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4411. ReleaseOperand(tmpOperand);
  4412. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4413. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4414. ReleaseOperand(tmpOperand);
  4415. INC(i);
  4416. END;
  4417. dimOp := IntermediateCode.Immediate(addressType,dim);
  4418. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4419. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4420. (* case 1d
  4421. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4422. + case 1e
  4423. P(.. PT() ... );
  4424. *)
  4425. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4426. Designate(expression,operand);
  4427. Dereference(operand,type.resolved,FALSE);
  4428. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4429. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4430. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4431. (* case 1f
  4432. P(...,S,...) push: create array descriptor to S on stack
  4433. case 1g
  4434. P(... PS()...)
  4435. *)
  4436. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4437. Designate(expression,operand);
  4438. FOR i := 0 TO dim-1 DO
  4439. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4440. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4441. ReleaseOperand(tmpOperand);
  4442. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4443. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4444. ReleaseOperand(tmpOperand);
  4445. END;
  4446. (*******
  4447. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4448. *)
  4449. arrayFlags := {StaticFlag};
  4450. IF dim = 1 THEN
  4451. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4452. ReleaseOperand(tmpOperand);
  4453. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4454. m := LONGINT(tmpOperand.op.intValue);
  4455. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4456. ELSIF dim = 2 THEN
  4457. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4458. ReleaseOperand(tmpOperand);
  4459. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4460. m := LONGINT(tmpOperand.op.intValue);
  4461. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4462. ReleaseOperand(tmpOperand);
  4463. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4464. n := LONGINT(tmpOperand.op.intValue);
  4465. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4466. INCL(arrayFlags,SmallMatrixFlag);
  4467. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4468. END;
  4469. END;
  4470. (*******)
  4471. dimOp := IntermediateCode.Immediate(addressType,dim);
  4472. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4473. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4474. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4475. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4476. baseType := SemanticChecker.ArrayBase(type,dim);
  4477. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4478. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4479. ELSE HALT(100);
  4480. END;
  4481. (* case 2
  4482. procedure P([left args], var A: array [*,*] of Type, [right args])
  4483. *)
  4484. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4485. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4486. (* case 2b
  4487. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4488. push: push reference to pushed array descriptor
  4489. post: remove array descriptor.
  4490. *)
  4491. IF expression IS SyntaxTree.IndexDesignator THEN
  4492. descriptorType := GetMathArrayDescriptorType(dim);
  4493. (* range type : no allocation possible, should be untraced *)
  4494. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4495. Symbol(variable,variableOp);
  4496. arrayDestinationTag := variableOp.op;
  4497. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4498. arrayDestinationDimension := dim;
  4499. NeedDescriptor := TRUE;
  4500. Designate(expression,operand);
  4501. Pass((operand.tag));
  4502. NeedDescriptor := FALSE;
  4503. (* case 2a
  4504. P(...,A,...)
  4505. push: push reference to array descriptor on stack
  4506. *)
  4507. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4508. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4509. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4510. INC(i);
  4511. END;
  4512. IF i = dim THEN
  4513. Designate(expression,operand);
  4514. Pass((operand.tag));
  4515. ELSE (* open-static *)
  4516. type := expression.type.resolved;
  4517. descriptorType := GetMathArrayDescriptorType(dim);
  4518. (* static array , cannot be reallocated, untraced !*)
  4519. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4520. Symbol(variable,variableOp);
  4521. arrayDestinationTag := variableOp.op;
  4522. Designate(expression,operand);
  4523. FOR i := 0 TO dim-1 DO
  4524. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4525. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4526. ReleaseOperand(tmpOperand);
  4527. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4528. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4529. ReleaseOperand(tmpOperand);
  4530. END;
  4531. dimOp := IntermediateCode.Immediate(addressType,dim);
  4532. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4533. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4534. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4535. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4536. baseType := SemanticChecker.ArrayBase(type,dim);
  4537. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4538. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4539. Pass((arrayDestinationTag));
  4540. END;
  4541. (* case 2d
  4542. P(...,T,...) push: emit dimension check, push T
  4543. *)
  4544. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4545. Designate(expression,operand);
  4546. Dereference(operand,type.resolved,FALSE);
  4547. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4548. Pass((operand.tag));
  4549. (* case 2f
  4550. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4551. push: push reference to pushed array descriptor
  4552. post: remove array descriptor
  4553. *)
  4554. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4555. descriptorType := GetMathArrayDescriptorType(dim);
  4556. (* static array -- cannot be reallocatated, untraced *)
  4557. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4558. Symbol(variable,variableOp);
  4559. arrayDestinationTag := variableOp.op;
  4560. Designate(expression,operand);
  4561. FOR i := 0 TO dim-1 DO
  4562. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4563. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4564. ReleaseOperand(tmpOperand);
  4565. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4566. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4567. ReleaseOperand(tmpOperand);
  4568. END;
  4569. (*
  4570. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4571. *)
  4572. arrayFlags := {StaticFlag};
  4573. IF dim = 1 THEN
  4574. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4575. ReleaseOperand(tmpOperand);
  4576. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4577. m := LONGINT(tmpOperand.op.intValue);
  4578. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4579. ELSIF dim = 2 THEN
  4580. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4581. ReleaseOperand(tmpOperand);
  4582. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4583. m := LONGINT(tmpOperand.op.intValue);
  4584. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4585. ReleaseOperand(tmpOperand);
  4586. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4587. n := LONGINT(tmpOperand.op.intValue);
  4588. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4589. INCL(arrayFlags,SmallMatrixFlag);
  4590. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4591. END;
  4592. END;
  4593. (*******)
  4594. dimOp := IntermediateCode.Immediate(addressType,dim);
  4595. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4596. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4597. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4598. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4599. baseType := SemanticChecker.ArrayBase(type,dim);
  4600. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4601. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4602. Pass((arrayDestinationTag));
  4603. ELSE HALT(100);
  4604. END;
  4605. (* case 3
  4606. procedure P([left args], [const] A: array [?] of Type, [right args])
  4607. *)
  4608. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4609. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4610. (* case 3b
  4611. P(...,A[a..b,c..d],...)
  4612. *)
  4613. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4614. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4615. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4616. Symbol(variable,variableOp);
  4617. LoadValue(variableOp,system.addressType);
  4618. ELSE
  4619. descriptorType := GetMathArrayDescriptorType(dim);
  4620. (* range -- cannot be reallocated *)
  4621. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4622. Symbol(variable,variableOp);
  4623. END;
  4624. arrayDestinationTag := variableOp.op;
  4625. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4626. arrayDestinationDimension := 0;
  4627. Designate(expression,operand);
  4628. Pass((operand.tag));
  4629. (* case 3a
  4630. P(...,A,...)
  4631. *)
  4632. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4633. i := 0;
  4634. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4635. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4636. INC(i);
  4637. END;
  4638. IF i = dim THEN
  4639. Designate(expression,operand);
  4640. Pass((operand.tag));
  4641. ELSE (* open-static *)
  4642. type := expression.type.resolved;
  4643. descriptorType := GetMathArrayDescriptorType(dim);
  4644. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4645. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4646. Symbol(variable,variableOp);
  4647. arrayDestinationTag := variableOp.op;
  4648. Designate(expression,operand);
  4649. FOR i := 0 TO dim-1 DO
  4650. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4651. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4652. ReleaseOperand(tmpOperand);
  4653. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4654. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4655. ReleaseOperand(tmpOperand);
  4656. END;
  4657. dimOp := IntermediateCode.Immediate(addressType,dim);
  4658. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4659. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4660. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4661. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4662. baseType := SemanticChecker.ArrayBase(type,dim);
  4663. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4664. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4665. Pass((arrayDestinationTag));
  4666. END;
  4667. (* case 3d
  4668. P(...,T,...)
  4669. case 3e
  4670. P(...,PT(...),...)
  4671. *)
  4672. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4673. Designate(expression,operand);
  4674. Dereference(operand,type.resolved,FALSE);
  4675. Pass((operand.tag));
  4676. (* case 3f
  4677. P(...,S,...)
  4678. case 3g
  4679. P(...,PS(...),...)
  4680. *)
  4681. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4682. descriptorType := GetMathArrayDescriptorType(dim);
  4683. (* static array does not need to be traced *)
  4684. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4685. Symbol(variable,variableOp);
  4686. arrayDestinationTag := variableOp.op;
  4687. Designate(expression,operand);
  4688. IF operand.op.type.length >1 THEN (* vector register *)
  4689. (* static array does not need to be traced *)
  4690. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4691. Symbol(variable2, variable2Op);
  4692. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4693. Emit(Mov(position,tmp, operand.op));
  4694. ReleaseOperand(operand);
  4695. Symbol(variable2, operand);
  4696. END;
  4697. FOR i := 0 TO dim-1 DO
  4698. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4699. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4700. ReleaseOperand(tmpOperand);
  4701. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4702. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4703. ReleaseOperand(tmpOperand);
  4704. END;
  4705. dimOp := IntermediateCode.Immediate(addressType,dim);
  4706. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4707. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4708. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4709. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4710. baseType := SemanticChecker.ArrayBase(type,dim);
  4711. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4712. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4713. Pass((arrayDestinationTag));
  4714. ELSE HALT(100);
  4715. END;
  4716. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4717. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4718. (* case 4b
  4719. P(...,A[a..b,c..d],...)
  4720. *)
  4721. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4722. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4723. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4724. Symbol(variable,variableOp);
  4725. LoadValue(variableOp,system.addressType);
  4726. ELSE
  4727. descriptorType := GetMathArrayDescriptorType(dim);
  4728. (* range array -- cannot be allocated *)
  4729. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4730. Symbol(variable,variableOp);
  4731. END;
  4732. arrayDestinationTag := variableOp.op;
  4733. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4734. arrayDestinationDimension := 0;
  4735. Designate(expression,operand);
  4736. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4737. Symbol(variable,variableOp);
  4738. ELSE
  4739. (* alias to range -- untraced *)
  4740. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4741. Symbol(variable,variableOp);
  4742. MakeMemory(tmp,variableOp.op,addressType,0);
  4743. Emit(Mov(position,tmp,operand.tag));
  4744. ReleaseIntermediateOperand(tmp);
  4745. END;
  4746. Pass((variableOp.op));
  4747. ReleaseOperand(variableOp);
  4748. (* case 4a
  4749. P(...,A,...)
  4750. *)
  4751. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4752. i := 0;
  4753. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4754. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4755. INC(i);
  4756. END;
  4757. IF i = dim THEN
  4758. Designate(expression,operand);
  4759. arrayDestinationTag := operand.tag;
  4760. ELSE (* open-static *)
  4761. type := expression.type.resolved;
  4762. descriptorType := GetMathArrayDescriptorType(dim);
  4763. (* static array -- untraced *)
  4764. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4765. Symbol(variable,variableOp);
  4766. arrayDestinationTag := variableOp.op;
  4767. Designate(expression,operand);
  4768. FOR i := 0 TO dim-1 DO
  4769. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4770. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4771. ReleaseOperand(tmpOperand);
  4772. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4773. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4774. ReleaseOperand(tmpOperand);
  4775. END;
  4776. dimOp := IntermediateCode.Immediate(addressType,dim);
  4777. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4778. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4779. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4780. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4781. baseType := SemanticChecker.ArrayBase(type,dim);
  4782. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4783. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4784. END;
  4785. (* tensor alias to open array -- untraced *)
  4786. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4787. Symbol(variable,variableOp);
  4788. MakeMemory(tmp,variableOp.op,addressType,0);
  4789. Emit(Mov(position,tmp,arrayDestinationTag));
  4790. ReleaseIntermediateOperand(tmp);
  4791. Pass((variableOp.op));
  4792. ReleaseOperand(variableOp);
  4793. (* case 4d
  4794. P(...,T,...)
  4795. *)
  4796. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4797. Designate(expression,operand);
  4798. Pass((operand.op));
  4799. (* case 4f
  4800. P(...,S,...)
  4801. *)
  4802. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4803. descriptorType := GetMathArrayDescriptorType(dim);
  4804. (* static array -- cannot be reallocated, untraced *)
  4805. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4806. Symbol(variable,variableOp);
  4807. arrayDestinationTag := variableOp.op;
  4808. Designate(expression,operand);
  4809. FOR i := 0 TO dim-1 DO
  4810. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4811. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4812. ReleaseOperand(tmpOperand);
  4813. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4814. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4815. ReleaseOperand(tmpOperand);
  4816. END;
  4817. dimOp := IntermediateCode.Immediate(addressType,dim);
  4818. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4819. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4820. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4821. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4822. baseType := SemanticChecker.ArrayBase(type,dim);
  4823. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4824. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4825. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4826. Symbol(variable,variableOp);
  4827. MakeMemory(tmp,variableOp.op,addressType,0);
  4828. Emit(Mov(position,tmp,arrayDestinationTag));
  4829. ReleaseIntermediateOperand(tmp);
  4830. Pass((variableOp.op));
  4831. ReleaseOperand(variableOp);
  4832. ELSE HALT(100);
  4833. END;
  4834. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4835. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4836. Designate(expression,operand);
  4837. IF operand.op.type.length > 1 THEN
  4838. Emit(Push(position, operand.op));
  4839. ELSE
  4840. size := system.SizeOf(type);
  4841. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4842. size := ToMemoryUnits(system,size);
  4843. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4844. arrayDestinationTag := sp;
  4845. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4846. END;
  4847. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4848. Designate(expression,operand);
  4849. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4850. (* static array no pointer *)
  4851. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4852. Symbol(variable,variableOp);
  4853. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4854. Emit(Mov(position,tmp,operand.op));
  4855. Emit(Push(position,variableOp.op));
  4856. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4857. Pass((operand.op));
  4858. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4859. END;
  4860. ELSE HALT(200)
  4861. END;
  4862. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4863. IF parameter.kind = SyntaxTree.VarParameter THEN
  4864. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4865. Designate(expression, operand);
  4866. Pass((operand.op));
  4867. ELSE
  4868. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4869. Evaluate(expression, operand);
  4870. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4871. Pass((operand.extra)); (* step *)
  4872. Pass((operand.tag)); (* last *)
  4873. Pass((operand.op)); (* first *)
  4874. ELSE
  4875. (* pass range as structure in order to comply with the variable alignment of its components *)
  4876. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4877. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4878. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4879. tmp := sp;
  4880. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4881. Emit(Mov(position,tmp,operand.op)); (* first *)
  4882. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4883. IntermediateCode.AddOffset(tmp,size);
  4884. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4885. IntermediateCode.AddOffset(tmp,size);
  4886. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4887. END;
  4888. END
  4889. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4890. IF parameter.kind = SyntaxTree.VarParameter THEN
  4891. Designate(expression, operand);
  4892. Pass((operand.op));
  4893. ELSE
  4894. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4895. Evaluate(expression, operand);
  4896. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4897. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4898. Pass((operand.tag)); (* imaginary part *)
  4899. Pass((operand.op)) (* real part *)
  4900. ELSE
  4901. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4902. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4903. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4904. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4905. tmp := sp;
  4906. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4907. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4908. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4909. IntermediateCode.AddOffset(tmp,size);
  4910. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4911. END
  4912. END
  4913. ELSE
  4914. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4915. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4916. Designate(expression,operand);
  4917. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4918. (* stack allocation *)
  4919. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4920. (*! parameter alignment to be discussed ... *)
  4921. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4922. size := type(SyntaxTree.StringType).length;
  4923. END;
  4924. IF backend.cooperative & parameter.NeedsTrace() THEN
  4925. dst := NewRegisterOperand (addressType);
  4926. Emit(Mov(position,dst, sp));
  4927. IntermediateCode.InitImmediate(null, byteType, 0);
  4928. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4929. ReleaseIntermediateOperand(dst);
  4930. SaveRegisters();ReleaseUsedRegisters(saved);
  4931. (* register dst has been freed before SaveRegisters already *)
  4932. CallAssignMethod(dst, operand.op, parameter.type);
  4933. RestoreRegisters(saved);
  4934. END;
  4935. IF operand.op.type.length > 1 THEN (* vector *)
  4936. MakeMemory(tmp,sp,operand.op.type,0);
  4937. Emit(Mov(position, tmp, operand.op));
  4938. ELSE
  4939. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4940. END;
  4941. ELSIF IsOpenArray(parameter.type) THEN
  4942. Designate(expression,operand);
  4943. baseReg := operand.tag;
  4944. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4945. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4946. END;
  4947. Pass((operand.op)); (* address of the array *)
  4948. ELSIF IsDelegate(parameter.type) THEN
  4949. Evaluate(expression,operand);
  4950. IF backend.cooperative & parameter.NeedsTrace() THEN
  4951. Emit(Push(position, nil));
  4952. dst := NewRegisterOperand (addressType);
  4953. Emit(Mov(position,dst, sp));
  4954. ReleaseIntermediateOperand(dst);
  4955. SaveRegisters();ReleaseUsedRegisters(saved);
  4956. Emit(Push(position, dst));
  4957. (* register dst has been freed before SaveRegisters already *)
  4958. Emit(Push(position, operand.tag));
  4959. CallThis(position,"GarbageCollector","Assign",2);
  4960. RestoreRegisters(saved);
  4961. ELSE
  4962. Pass((operand.tag));
  4963. END;
  4964. Pass((operand.op));
  4965. ELSE
  4966. Evaluate(expression,operand);
  4967. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4968. Emit(Push(position, nil));
  4969. dst := NewRegisterOperand (addressType);
  4970. Emit(Mov(position,dst, sp));
  4971. ReleaseIntermediateOperand(dst);
  4972. SaveRegisters();ReleaseUsedRegisters(saved);
  4973. Emit(Push(position, dst));
  4974. (* register dst has been freed before SaveRegisters already *)
  4975. Emit(Push(position, operand.op));
  4976. CallThis(position,"GarbageCollector","Assign",2);
  4977. RestoreRegisters(saved);
  4978. ELSE
  4979. Pass((operand.op));
  4980. END;
  4981. END;
  4982. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4983. Evaluate(expression,operand);
  4984. Pass((operand.op));
  4985. ELSE (* var parameter *)
  4986. Designate(expression,operand);
  4987. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4988. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4989. Pass((operand.tag));
  4990. END;
  4991. END;
  4992. Pass((operand.op));
  4993. END;
  4994. END;
  4995. (* TODO: needed? *)
  4996. arrayDestinationTag := oldArrayDestinationTag;
  4997. arrayDestinationDimension := oldArrayDestinationDimension;
  4998. IF needsParameterBackup THEN
  4999. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5000. ReuseCopy(parameterBackup, operand.op)
  5001. END;
  5002. ReleaseOperand(operand);
  5003. IF Trace THEN TraceExit("PushParameter") END;
  5004. END PushParameter;
  5005. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5006. VAR prevConditional: BOOLEAN;
  5007. BEGIN
  5008. prevConditional := conditional;
  5009. conditional := FALSE;
  5010. 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
  5011. Expression(x.result); (* use register *)
  5012. END;
  5013. Statement(x.statement);
  5014. conditional := prevConditional;
  5015. IF x.result # NIL THEN Expression(x.result) END;
  5016. 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
  5017. ReleaseIntermediateOperand(result.op);
  5018. END;
  5019. END VisitStatementDesignator;
  5020. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5021. VAR
  5022. procedure: SyntaxTree.Procedure;
  5023. procedureType: SyntaxTree.ProcedureType;
  5024. wasInline: BOOLEAN;
  5025. actualParameters: SyntaxTree.ExpressionList;
  5026. formalParameter: SyntaxTree.Parameter;
  5027. actualParameter: SyntaxTree.Expression;
  5028. i: LONGINT;
  5029. localVariable: SyntaxTree.Variable;
  5030. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5031. src, dest: Operand;
  5032. prevInlineExit : Label;
  5033. prevMapper: SymbolMapper;
  5034. tooComplex: BOOLEAN;
  5035. resultDesignator: SyntaxTree.Expression;
  5036. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5037. BEGIN
  5038. IF e = NIL THEN RETURN TRUE
  5039. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5040. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5041. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5042. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5043. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5044. ELSE RETURN FALSE
  5045. END;
  5046. END SimpleExpression;
  5047. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5048. BEGIN
  5049. RETURN checker.CanPassInRegister(type)
  5050. END FitsInRegister;
  5051. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5052. VAR
  5053. variable: SyntaxTree.Variable;
  5054. variableDesignator: SyntaxTree.Designator;
  5055. BEGIN
  5056. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5057. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5058. variableDesignator.SetType(type);
  5059. RETURN variableDesignator
  5060. END GetTemp;
  5061. BEGIN
  5062. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5063. wasInline := currentIsInline;
  5064. prevInlineExit := currentInlineExit;
  5065. prevMapper := currentMapper;
  5066. currentInlineExit := NewLabel();
  5067. tooComplex := FALSE;
  5068. NEW(currentMapper);
  5069. currentIsInline := TRUE;
  5070. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5071. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5072. formalParameter := procedureType.firstParameter;
  5073. actualParameters := x.parameters;
  5074. i := 0;
  5075. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5076. actualParameter := actualParameters.GetExpression(i);
  5077. IF actualParameter.resolved # NIL THEN
  5078. actualParameter := actualParameter.resolved
  5079. END;
  5080. (*
  5081. if expression is simple and can be passed immediately
  5082. or if type fits in register then we can proceed
  5083. otherwise we escape to ordinary procedure call.
  5084. *)
  5085. (* cases where the expression can be mapped identically *)
  5086. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5087. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5088. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5089. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5090. (*
  5091. Assign(variableDesignator, actualParameter);
  5092. *)
  5093. Evaluate(actualParameter, src);
  5094. Designate(variableDesignator, dest);
  5095. Emit(Mov(x.position, dest.op, src.op));
  5096. ReleaseOperand(dest);
  5097. ReleaseOperand(src);
  5098. (* the src operand should now have been completely released ! *)
  5099. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5100. ELSE tooComplex := TRUE
  5101. END;
  5102. (*
  5103. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5104. currentMapper.Add(formalParameter, actualParameter, NIL);
  5105. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5106. variableDesignator := GetTemp(system.addressType, FALSE);
  5107. Designate(actualParameter, src);
  5108. Designate(variableDesignator, dest);
  5109. IntermediateCode.MakeMemory(dest.op,addressType);
  5110. Emit(Mov(x.position, dest.op, src.op));
  5111. ReleaseOperand(dest);
  5112. IF src.tag.mode # IntermediateCode.Undefined THEN
  5113. tagDesignator := GetTemp(system.addressType, FALSE);
  5114. Designate(tagDesignator, dest);
  5115. IntermediateCode.MakeMemory(dest.op,addressType);
  5116. Emit(Mov(x.position, dest.op, src.op));
  5117. END;
  5118. ReleaseOperand(dest); ReleaseOperand(src);
  5119. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5120. END;
  5121. *)
  5122. formalParameter := formalParameter.nextParameter;
  5123. INC(i);
  5124. END;
  5125. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5126. IF resultDesignator # NIL THEN
  5127. returnDesignator := resultDesignator
  5128. ELSE
  5129. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5130. END;
  5131. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5132. END;
  5133. localVariable := procedure.procedureScope.firstVariable;
  5134. WHILE ~tooComplex & (localVariable # NIL) DO
  5135. variableDesignator := GetTemp(localVariable.type, FALSE);
  5136. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5137. localVariable := localVariable.nextVariable;
  5138. END;
  5139. IF ~tooComplex THEN
  5140. VisitStatementBlock(procedure.procedureScope.body);
  5141. SetLabel(currentInlineExit);
  5142. IF procedureType.returnType # NIL THEN
  5143. Designate(returnDesignator, result);
  5144. IF conditional THEN
  5145. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5146. ValueToCondition(result)
  5147. END;
  5148. END;
  5149. END;
  5150. currentMapper := prevMapper;
  5151. currentInlineExit := prevInlineExit;
  5152. currentIsInline := wasInline;
  5153. RETURN ~tooComplex
  5154. END InlineProcedureCall;
  5155. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5156. VAR
  5157. parameters: SyntaxTree.ExpressionList;
  5158. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5159. designator: SyntaxTree.Designator;
  5160. procedureType: SyntaxTree.ProcedureType;
  5161. formalParameter: SyntaxTree.Parameter;
  5162. operand, returnValue: Operand;
  5163. reg, size, mask, dest: IntermediateCode.Operand;
  5164. saved,saved2: RegisterEntry;
  5165. symbol: SyntaxTree.Symbol;
  5166. variable: SyntaxTree.Variable;
  5167. i, parametersSize, returnTypeSize : LONGINT;
  5168. structuredReturnType: BOOLEAN;
  5169. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5170. tempVariableDesignator: SyntaxTree.Designator;
  5171. gap, alignment: LONGINT; (*fld*)
  5172. (* TODO: remove unnecessary backup variables *)
  5173. oldResult: Operand;
  5174. oldCurrentScope: SyntaxTree.Scope;
  5175. oldArrayDestinationTag: IntermediateCode.Operand;
  5176. oldArrayDestinationDimension: LONGINT;
  5177. oldConstantDeclaration: SyntaxTree.Symbol;
  5178. oldDestination: IntermediateCode.Operand;
  5179. oldCurrentLoop: Label;
  5180. oldConditional: BOOLEAN;
  5181. oldTrueLabel, oldFalseLabel: Label;
  5182. oldLocked: BOOLEAN;
  5183. usedRegisters,oldUsedRegisters: RegisterEntry;
  5184. return: IntermediateCode.Operand;
  5185. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5186. arg: IntermediateCode.Operand;
  5187. dummy: IntermediateCode.Operand;
  5188. recordType: SyntaxTree.RecordType;
  5189. operatorSelectionProcedureOperand: Operand;
  5190. operatorSelectionProcedure: SyntaxTree.Procedure;
  5191. fingerPrint: SyntaxTree.FingerPrint;
  5192. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5193. identifierNumber: LONGINT;
  5194. parameterRegisters: SIZE;
  5195. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5196. procedure: SyntaxTree.Procedure;
  5197. callingConvention: SyntaxTree.CallingConvention;
  5198. PROCEDURE BackupGlobalState;
  5199. BEGIN
  5200. oldResult := result;
  5201. oldCurrentScope := currentScope;
  5202. oldArrayDestinationTag := arrayDestinationTag;
  5203. oldArrayDestinationDimension := arrayDestinationDimension;
  5204. oldConstantDeclaration := constantDeclaration;
  5205. oldDestination := destination;
  5206. oldCurrentLoop := currentLoop;
  5207. oldConditional := conditional;
  5208. oldTrueLabel := trueLabel;
  5209. oldFalseLabel := falseLabel;
  5210. oldLocked := locked;
  5211. oldUsedRegisters := usedRegisters
  5212. END BackupGlobalState;
  5213. PROCEDURE RestoreGlobalState;
  5214. BEGIN
  5215. result := oldResult;
  5216. currentScope := oldCurrentScope;
  5217. arrayDestinationTag := oldArrayDestinationTag;
  5218. arrayDestinationDimension := oldArrayDestinationDimension;
  5219. constantDeclaration := oldConstantDeclaration;
  5220. destination := oldDestination;
  5221. currentLoop := oldCurrentLoop;
  5222. conditional := oldConditional;
  5223. trueLabel := oldTrueLabel;
  5224. falseLabel := oldFalseLabel;
  5225. locked := oldLocked;
  5226. usedRegisters := oldUsedRegisters
  5227. END RestoreGlobalState;
  5228. (** do preparations before parameter push for array-structured object types (ASOTs):
  5229. if ASOT is passed as VAR parameter:
  5230. - allocate temporary variable of math array type
  5231. - copy contents of ASOT to be passed to temporary variable
  5232. - use temporary variable as the actual parameter instead
  5233. - 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)
  5234. **)
  5235. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5236. VAR
  5237. expression: SyntaxTree.Expression;
  5238. BEGIN
  5239. IF actualParameter IS SyntaxTree.Designator THEN
  5240. designator := actualParameter(SyntaxTree.Designator);
  5241. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5242. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5243. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5244. ASSERT(checker # NIL);
  5245. checker.SetCurrentScope(currentScope);
  5246. (* allocate temporary variable *)
  5247. ASSERT(actualParameter.type # NIL);
  5248. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5249. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5250. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5251. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5252. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5253. ASSERT(tempVariableDesignator.type # NIL);
  5254. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5255. (* copy math array stored in actual parameter to temporary variable *)
  5256. BackupGlobalState;
  5257. AssignMathArray(tempVariableDesignator, actualParameter);
  5258. RestoreGlobalState;
  5259. (* use temporary variable as actual parameter instead of the original one *)
  5260. actualParameter := tempVariableDesignator;
  5261. (* create write-back call and store it in linked list *)
  5262. (* create new list entry *)
  5263. IF firstWriteBackCall = NIL THEN
  5264. NEW(firstWriteBackCall);
  5265. currentWriteBackCall := firstWriteBackCall
  5266. ELSE
  5267. ASSERT(currentWriteBackCall # NIL);
  5268. NEW(currentWriteBackCall.next);
  5269. currentWriteBackCall := currentWriteBackCall.next
  5270. END;
  5271. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5272. ASSERT(expression.type = NIL);
  5273. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5274. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5275. (* prepare writeback for any other "normal" indexer *)
  5276. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5277. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5278. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5279. Assign(tempVariableDesignator, actualParameter);
  5280. actualParameter := tempVariableDesignator;
  5281. IF firstWriteBackCall = NIL THEN
  5282. NEW(firstWriteBackCall);
  5283. currentWriteBackCall := firstWriteBackCall
  5284. ELSE
  5285. ASSERT(currentWriteBackCall # NIL);
  5286. NEW(currentWriteBackCall.next);
  5287. currentWriteBackCall := currentWriteBackCall.next
  5288. END;
  5289. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5290. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5291. END
  5292. END
  5293. END PrepareParameter;
  5294. BEGIN
  5295. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5296. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5297. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5298. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5299. IF InlineProcedureCall(x) THEN
  5300. RETURN
  5301. ELSE
  5302. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5303. END
  5304. END;
  5305. END;
  5306. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5307. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5308. callingConvention := procedureType.callingConvention;
  5309. dest := destination; destination := emptyOperand;
  5310. SaveRegisters();ReleaseUsedRegisters(saved);
  5311. parameters := x.parameters;
  5312. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5313. (* an operator is called *)
  5314. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5315. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5316. (* check if a dynamic operator call should be performed *)
  5317. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5318. ELSE
  5319. isCallOfDynamicOperator := FALSE
  5320. END;
  5321. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5322. Emit(Push(position, ap));
  5323. END;
  5324. alignment := procedureType.stackAlignment;
  5325. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5326. alignment := 16 (* bytes *);
  5327. END;
  5328. IF alignment > 1 THEN
  5329. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5330. Emit(Mov(position,reg, sp));
  5331. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5332. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5333. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5334. gap := 4*ToMemoryUnits(system,system.addressSize);
  5335. END;
  5336. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5337. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5338. IF gap < 0 THEN
  5339. gap := 0
  5340. END;
  5341. ELSE
  5342. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5343. END;
  5344. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5345. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5346. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5347. Emit(And(position,sp, sp, mask));
  5348. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5349. Emit(Push(position,reg));
  5350. ReleaseIntermediateOperand(reg);
  5351. END;
  5352. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5353. (* align stack to 16-byte boundary *)
  5354. IntermediateCode.InitImmediate(mask,addressType,-16);
  5355. Emit(And(position,sp, sp, mask));
  5356. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5357. IF gap # 0 THEN
  5358. IntermediateCode.InitImmediate(size,addressType,gap);
  5359. Emit(Sub(position,sp,sp,size))
  5360. END;
  5361. END;
  5362. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5363. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5364. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5365. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5366. ELSE
  5367. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5368. END;
  5369. Evaluate(x.left, operand);
  5370. IF symbol IS SyntaxTree.Procedure THEN
  5371. IF (procedureType.selfParameter # NIL) THEN
  5372. Emit(Push(position,operand.tag));
  5373. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5374. Emit(Push(position,operand.tag));
  5375. ELSIF (procedureType.isDelegate) THEN
  5376. Emit(Push(position,operand.tag));
  5377. END;
  5378. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5379. IF (procedureType.selfParameter # NIL) THEN
  5380. Emit(Push(position,operand.tag));
  5381. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5382. Emit(Push(position,operand.tag));
  5383. END;
  5384. ELSE HALT(200);
  5385. END;
  5386. ReleaseIntermediateOperand(operand.tag);
  5387. operand.tag := emptyOperand;
  5388. (* determine if a structured return type is needed *)
  5389. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5390. IF structuredReturnType THEN
  5391. IF resultDesignator # NIL THEN
  5392. d := resultDesignator;
  5393. ELSE
  5394. (* temporary result that might be allocated, must potentially be traced *)
  5395. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5396. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5397. d.SetType(variable.type);
  5398. END;
  5399. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5400. Designate(d,returnValue);
  5401. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5402. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5403. Emit(Push(position,size));
  5404. Emit(Push(position,returnValue.op));
  5405. ReleaseOperand(returnValue);
  5406. ELSE*)
  5407. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5408. (*
  5409. END;
  5410. *)
  5411. END;
  5412. firstWriteBackCall := NIL; (* reset write-back call list *)
  5413. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5414. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5415. passByRegister := parameterRegisters > 0;
  5416. registerNumber := 0;
  5417. formalParameter := procedureType.lastParameter;
  5418. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5419. actualParameter := parameters.GetExpression(i);
  5420. PrepareParameter(actualParameter, formalParameter);
  5421. IF passByRegister & (i < parameterRegisters) THEN
  5422. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5423. Error(actualParameter.position,"cannot be passed by register")
  5424. ELSE
  5425. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5426. END;
  5427. INC(registerNumber);
  5428. ELSE
  5429. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5430. END;
  5431. formalParameter := formalParameter.prevParameter;
  5432. END;
  5433. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5434. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5435. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5436. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5437. END;
  5438. ELSE
  5439. hasDynamicOperands := FALSE;
  5440. formalParameter := procedureType.firstParameter;
  5441. FOR i := 0 TO parameters.Length() - 1 DO
  5442. actualParameter := parameters.GetExpression(i);
  5443. IF formalParameter # NIL THEN (* TENTATIVE *)
  5444. PrepareParameter(actualParameter, formalParameter);
  5445. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5446. ASSERT(i < 2);
  5447. hasDynamicOperands := TRUE;
  5448. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5449. ELSE
  5450. IF passByRegister & (registerNumber > 0) THEN
  5451. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5452. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5453. END;
  5454. passByRegister := FALSE;
  5455. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5456. END;
  5457. formalParameter := formalParameter.nextParameter;
  5458. END;
  5459. END;
  5460. END;
  5461. IF symbol IS SyntaxTree.Procedure THEN
  5462. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5463. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5464. Emit(Push(position,reg));
  5465. ReleaseIntermediateOperand(reg);
  5466. END;
  5467. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5468. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5469. parametersSize := ParametersSize(system,procedureType, FALSE);
  5470. END;
  5471. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5472. (*
  5473. dynamic operator overloading:
  5474. first push parameters, regularly:
  5475. [self]
  5476. par1
  5477. par2
  5478. then push parameters for GetOperator
  5479. identifier
  5480. ptr1
  5481. tag
  5482. ptr2
  5483. tag
  5484. call GetOperatorRuntimeProc
  5485. call Operator
  5486. *)
  5487. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5488. (* push ID *)
  5489. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5490. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5491. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5492. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5493. formalParameter := procedureType.firstParameter;
  5494. FOR i := 0 TO parameters.Length() - 1 DO
  5495. IF formalParameter.access # SyntaxTree.Hidden THEN
  5496. ASSERT(i < 2);
  5497. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5498. (* push pointer *)
  5499. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5500. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5501. (* add dereference *)
  5502. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5503. (*! better: do refer to stack above than using parameter backups !!*)
  5504. ReleaseIntermediateOperand(parameterBackups[i]);
  5505. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5506. END;
  5507. Emit(Push(position,parameterBackups[i]));
  5508. ReleaseIntermediateOperand(parameterBackups[i]);
  5509. (* push typetag *)
  5510. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5511. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5512. arg := TypeDescriptorAdr(recordType);
  5513. Emit(Push(position,arg));
  5514. ELSE
  5515. (* push 'NonPointer' *)
  5516. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5517. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5518. (* push fingerprint *)
  5519. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5520. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5521. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5522. END
  5523. END;
  5524. formalParameter := formalParameter.nextParameter
  5525. END;
  5526. (* for unary operators: complete the information for the second parameter *)
  5527. IF procedureType.numberParameters < 2 THEN
  5528. (* push 'NonPointer' *)
  5529. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5530. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5531. (* push 'NoType' *)
  5532. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5533. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5534. END;
  5535. (* call operator selection procedure *)
  5536. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5537. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5538. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5539. ReleaseOperand(operatorSelectionProcedureOperand);
  5540. (* use the address that the operator selection procedure returned as the target address of the call *)
  5541. InitOperand(operand, ModeValue);
  5542. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5543. Emit(Result(position,operand.op))
  5544. END
  5545. END;
  5546. ReleaseParameterRegisters();
  5547. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5548. SaveRegisters();ReleaseUsedRegisters(saved2);
  5549. CallThis(position,"Objects","LeaveA2",0);
  5550. RestoreRegisters(saved2);
  5551. END;
  5552. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5553. Emit(Call(position,operand.op,0));
  5554. ELSE
  5555. Emit(Call(position,operand.op,parametersSize));
  5556. END;
  5557. ReleaseOperand(operand);
  5558. IF procedureType.noReturn THEN
  5559. EmitTrap(position,NoReturnTrap);
  5560. END;
  5561. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5562. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5563. Emit(Result(position,return));
  5564. END;
  5565. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5566. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5567. Emit(Push(position, return));
  5568. CallThis(position,"Objects","ReenterA2",0);
  5569. Emit(Pop(position, return));
  5570. ELSE
  5571. CallThis(position,"Objects","ReenterA2",0);
  5572. END;
  5573. END;
  5574. (* === return parameter space === *)
  5575. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5576. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5577. (* cleanup all space for all parameters *)
  5578. IF parametersSize < 32 THEN
  5579. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5580. parametersSize := 32
  5581. END;
  5582. size := IntermediateCode.Immediate(addressType,parametersSize);
  5583. Emit(Add(position,sp,sp,size))
  5584. END;
  5585. IF (callingConvention IN SysvABI) THEN
  5586. IF passByRegister THEN
  5587. IF parameters.Length() > parameterRegisters THEN
  5588. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5589. ELSE
  5590. parametersSize := 0
  5591. END;
  5592. ELSE
  5593. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5594. INC( parametersSize, (-parametersSize) MOD 16 )
  5595. END;
  5596. IF parametersSize > 0 THEN
  5597. size := IntermediateCode.Immediate(addressType,parametersSize);
  5598. Emit(Add(position,sp,sp,size))
  5599. END;
  5600. END;
  5601. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5602. IF structuredReturnType THEN
  5603. (* stack pointer rewinding done by callee
  5604. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5605. Emit(Add(position,sp,sp,size));
  5606. *)
  5607. RestoreRegisters(saved);
  5608. InitOperand(result,ModeReference);
  5609. Symbol(variable,result);
  5610. ELSE
  5611. RestoreRegisters(saved);
  5612. InitOperand(result,ModeValue);
  5613. result.op := return;
  5614. END;
  5615. END;
  5616. IF alignment > 1 THEN
  5617. Emit(Pop(position,sp));
  5618. END;
  5619. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5620. Emit(Pop(position, ap));
  5621. END;
  5622. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5623. ValueToCondition(result);
  5624. END;
  5625. destination := dest;
  5626. (* perform all write-back calls in the list *)
  5627. BackupGlobalState;
  5628. currentWriteBackCall := firstWriteBackCall;
  5629. WHILE currentWriteBackCall # NIL DO
  5630. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5631. currentWriteBackCall := currentWriteBackCall.next
  5632. END;
  5633. RestoreGlobalState;
  5634. (* TENATIVE *)
  5635. (*
  5636. IF isOperatorCall THEN
  5637. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5638. END;
  5639. *)
  5640. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5641. END VisitProcedureCallDesignator;
  5642. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5643. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5644. td: SyntaxTree.Symbol;
  5645. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5646. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5647. BEGIN
  5648. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5649. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5650. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5651. variable.SetType(system.anyType);
  5652. scope.AddVariable(variable);
  5653. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5654. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5655. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5656. typeDeclaration.SetScope(module.module.moduleScope);
  5657. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5658. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5659. END;
  5660. RETURN hiddenPointerType;
  5661. END GetHiddenPointerType;
  5662. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5663. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5664. BEGIN
  5665. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5666. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5667. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5668. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5669. scope.AddVariable(variable);
  5670. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5671. variable.SetType(system.anyType);
  5672. scope.AddVariable(variable);
  5673. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5674. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5675. typeDeclaration.SetDeclaredType(delegatePointerType);
  5676. typeDeclaration.SetScope(module.module.moduleScope);
  5677. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5678. delegatePointerType.SetState(SyntaxTree.Resolved);
  5679. END;
  5680. RETURN delegatePointerType
  5681. END GetDelegateType;
  5682. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5683. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5684. such as in VAR a: RECORD ... END;
  5685. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5686. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5687. *)
  5688. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5689. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5690. BEGIN (* no code emission *)
  5691. source := NIL;
  5692. x := x.resolved;
  5693. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5694. x := GetHiddenPointerType();
  5695. ELSIF IsDelegate(x) THEN
  5696. x := GetDelegateType();
  5697. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5698. ELSE HALT(200);
  5699. END;
  5700. td := x.typeDeclaration;
  5701. IF td = NIL THEN
  5702. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5703. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5704. ASSERT(td # NIL);
  5705. END;
  5706. GetCodeSectionNameForSymbol(td,name);
  5707. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5708. meta.CheckTypeDeclaration(x);
  5709. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5710. ELSE
  5711. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5712. END;
  5713. IF backend.cooperative OR meta.simple THEN
  5714. offset := 0;
  5715. ELSE
  5716. IF x IS SyntaxTree.CellType THEN
  5717. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5718. IF baseRecord = NIL THEN
  5719. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5720. ELSE
  5721. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5722. END;
  5723. ELSE
  5724. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5725. END;
  5726. END;
  5727. RETURN td
  5728. END GetBackendType;
  5729. BEGIN
  5730. (*td := t.typeDeclaration;*)
  5731. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5732. (*
  5733. IF t IS SyntaxTree.PointerType THEN
  5734. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5735. ELSE
  5736. source := GetBackendType(t);
  5737. END;
  5738. *)
  5739. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5740. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5741. IntermediateCode.SetOffset(res,offset);
  5742. (*
  5743. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5744. make memory should be used when tag is used, not earlier
  5745. *)
  5746. RETURN res
  5747. END TypeDescriptorAdr;
  5748. (*
  5749. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5750. VAR result: IntermediateCode.Operand;
  5751. BEGIN
  5752. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5753. operand.tag := TypeDescriptorAdr(operand.type);
  5754. IntermediateCode.MakeMemory(operand.tag,addressType);
  5755. UseIntermediateOperand(operand.tag);
  5756. END;
  5757. END MakeTypeTag;
  5758. *)
  5759. PROCEDURE ProfilerInit;
  5760. VAR reg: IntermediateCode.Operand;
  5761. BEGIN
  5762. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5763. Emit(Call(position,reg,0));
  5764. END ProfilerInit;
  5765. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5766. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5767. BEGIN
  5768. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5769. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5770. THEN
  5771. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5772. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5773. Emit(Push(position,reg));
  5774. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5775. Emit(Push(position,reg));
  5776. StaticCallOperand(result,procedure);
  5777. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5778. ReleaseOperand(result);
  5779. END;
  5780. END ProfilerEnterExit;
  5781. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5782. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5783. BEGIN
  5784. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5785. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5786. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5787. profileInit.Emit(Push(position,reg));
  5788. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5789. profileInit.Emit(Push(position,reg));
  5790. NEW(string, LEN(name)); COPY(name, string^);
  5791. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5792. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5793. sv.SetType(type);
  5794. Designate(sv,result);
  5795. profileInit.Emit(Push(position,result.tag));
  5796. profileInit.Emit(Push(position,result.op));
  5797. StaticCallOperand(result,procedure);
  5798. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5799. ReleaseOperand(result);
  5800. END;
  5801. END ProfilerAddProcedure;
  5802. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5803. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5804. BEGIN
  5805. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5806. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5807. profileInit.Emit(Push(position,reg));
  5808. profileInitPatchPosition := profileInit.pc;
  5809. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5810. NEW(string, LEN(name)); COPY(name, string^);
  5811. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5812. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5813. sv.SetType(type);
  5814. Designate(sv,result);
  5815. profileInit.Emit(Push(position,result.tag));
  5816. profileInit.Emit(Push(position,result.op));
  5817. StaticCallOperand(result,procedure);
  5818. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5819. ReleaseOperand(result);
  5820. END;
  5821. END ProfilerAddModule;
  5822. PROCEDURE ProfilerPatchInit;
  5823. VAR reg: IntermediateCode.Operand;
  5824. BEGIN
  5825. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5826. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5827. EmitLeave(profileInit,position,NIL,0);
  5828. profileInit.Emit(Exit(position,0,0,0));
  5829. END ProfilerPatchInit;
  5830. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5831. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5832. VAR
  5833. id: LONGINT;
  5834. leftType, rightType: SyntaxTree.Type;
  5835. procedureType: SyntaxTree.ProcedureType;
  5836. runtimeProcedure: SyntaxTree.Procedure;
  5837. runtimeProcedureOperand, operatorOperand: Operand;
  5838. kind: SET;
  5839. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5840. VAR
  5841. arg: IntermediateCode.Operand;
  5842. recordType: SyntaxTree.RecordType;
  5843. fingerPrint: SyntaxTree.FingerPrint;
  5844. BEGIN
  5845. IF type = NIL THEN
  5846. (* no type: push 'NoType' *)
  5847. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5848. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5849. ELSIF IsStrictlyPointerToRecord(type) THEN
  5850. (* pointer to record type: push typetag *)
  5851. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5852. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5853. arg := TypeDescriptorAdr(recordType);
  5854. ELSE
  5855. (* non-pointer to record type: push fingerprint *)
  5856. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5857. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5858. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5859. END;
  5860. operatorInitializationCodeSection.Emit(Push(position,arg))
  5861. END PushTypeInfo;
  5862. BEGIN
  5863. ASSERT(operatorInitializationCodeSection # NIL);
  5864. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5865. procedureType := operator.type(SyntaxTree.ProcedureType);
  5866. (* determine types *)
  5867. leftType := procedureType.firstParameter.type;
  5868. IF procedureType.numberParameters = 2 THEN
  5869. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5870. rightType := procedureType.firstParameter.nextParameter.type;
  5871. ELSE
  5872. rightType := NIL
  5873. END;
  5874. (* determine operator kind *)
  5875. IF IsStrictlyPointerToRecord(leftType) THEN
  5876. kind := {LhsIsPointer}
  5877. ELSE
  5878. kind := {}
  5879. END;
  5880. IF IsStrictlyPointerToRecord(rightType) THEN
  5881. kind := kind + {RhsIsPointer}
  5882. END;
  5883. IF kind # {} THEN (* TODO: to be removed later on *)
  5884. (* at least one of the types is a pointer to record *)
  5885. (* emit a code that registers this specific operator in the runtime *)
  5886. dump := operatorInitializationCodeSection.comments;
  5887. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5888. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5889. (* push ID *)
  5890. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5891. id := Global.GetSymbol(module.module.case, operator.name);
  5892. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5893. (* push kind *)
  5894. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5895. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5896. (* push type infos *)
  5897. PushTypeInfo(leftType);
  5898. PushTypeInfo(rightType);
  5899. (* push operator address *)
  5900. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5901. StaticCallOperand(operatorOperand, operator);
  5902. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5903. ReleaseOperand(operatorOperand);
  5904. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5905. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5906. ReleaseOperand(runtimeProcedureOperand)
  5907. END
  5908. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5909. END
  5910. END RegisterDynamicOperator;
  5911. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5912. VAR
  5913. traceModule: SyntaxTree.Module;
  5914. procedure: SyntaxTree.Procedure;
  5915. procedureVariable: SyntaxTree.Variable;
  5916. s,msg: Basic.MessageString;
  5917. res: Operand;
  5918. i: LONGINT;
  5919. sv: SyntaxTree.StringValue;
  5920. type: SyntaxTree.Type;
  5921. recordType: SyntaxTree.RecordType;
  5922. printout: Printout.Printer;
  5923. stringWriter: Streams.StringWriter;
  5924. expression: SyntaxTree.Expression;
  5925. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5926. BEGIN
  5927. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5928. IF procedure = NIL THEN
  5929. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5930. END;
  5931. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5932. s := "procedure ";
  5933. Strings.Append(s,backend.traceModuleName);
  5934. Strings.Append(s,".");
  5935. Strings.Append(s,procedureName);
  5936. Strings.Append(s," not present");
  5937. Error(position,s);
  5938. RETURN FALSE
  5939. ELSE
  5940. RETURN TRUE
  5941. END;
  5942. END GetProcedure;
  5943. PROCEDURE CallProcedure;
  5944. VAR size: LONGINT;
  5945. BEGIN
  5946. IF procedure # NIL THEN
  5947. StaticCallOperand(result,procedure);
  5948. size := ProcParametersSize(procedure);
  5949. ELSE
  5950. Symbol(procedureVariable, result);
  5951. LoadValue(result, procedureVariable.type.resolved);
  5952. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5953. END;
  5954. Emit(Call(position,result.op,size));
  5955. END CallProcedure;
  5956. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5957. VAR res: Operand; string: SyntaxTree.String;
  5958. BEGIN
  5959. IF GetProcedure("String") THEN
  5960. NEW(string, LEN(s)); COPY(s, string^);
  5961. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5962. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5963. sv.SetType(type);
  5964. Designate(sv,res);
  5965. Emit(Push(position,res.tag));
  5966. Emit(Push(position,res.op));
  5967. ReleaseOperand(res);
  5968. CallProcedure;
  5969. END;
  5970. END String;
  5971. PROCEDURE Integer(op: IntermediateCode.Operand);
  5972. BEGIN
  5973. IF GetProcedure("Int") THEN
  5974. Emit(Push(position,op));
  5975. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5976. CallProcedure;
  5977. END;
  5978. END Integer;
  5979. PROCEDURE Float(op: IntermediateCode.Operand);
  5980. BEGIN
  5981. IF GetProcedure("HIntHex") THEN
  5982. Emit(Push(position,op));
  5983. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5984. CallProcedure;
  5985. END;
  5986. END Float;
  5987. PROCEDURE Set(op: IntermediateCode.Operand);
  5988. BEGIN
  5989. IF GetProcedure("Set") THEN
  5990. Emit(Push(position,op));
  5991. (*
  5992. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5993. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5994. *)
  5995. CallProcedure;
  5996. END;
  5997. END Set;
  5998. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5999. BEGIN
  6000. IF GetProcedure("Boolean") THEN
  6001. Emit(Push(position,op));
  6002. CallProcedure;
  6003. END;
  6004. END Boolean;
  6005. PROCEDURE Char(op: IntermediateCode.Operand);
  6006. BEGIN
  6007. IF GetProcedure("Char") THEN
  6008. Emit(Push(position,op));
  6009. CallProcedure;
  6010. END;
  6011. END Char;
  6012. PROCEDURE Address(op: IntermediateCode.Operand);
  6013. BEGIN
  6014. IF GetProcedure("Address") THEN
  6015. Emit(Push(position,op));
  6016. CallProcedure;
  6017. END;
  6018. END Address;
  6019. PROCEDURE Size(op: IntermediateCode.Operand);
  6020. BEGIN
  6021. IF GetProcedure("Size") THEN
  6022. Emit(Push(position,op));
  6023. CallProcedure;
  6024. END;
  6025. END Size;
  6026. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6027. VAR len: IntermediateCode.Operand;
  6028. BEGIN
  6029. IF GetProcedure("String") THEN
  6030. len := GetArrayLength(type, op.tag);
  6031. Emit(Push(position,len));
  6032. ReleaseIntermediateOperand(len);
  6033. Emit(Push(position,op.op));
  6034. CallProcedure;
  6035. END;
  6036. END StringOperand;
  6037. PROCEDURE Ln;
  6038. BEGIN
  6039. IF GetProcedure("Ln") THEN
  6040. CallProcedure;
  6041. END;
  6042. END Ln;
  6043. BEGIN
  6044. IF backend.traceModuleName = "" THEN RETURN END;
  6045. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6046. IF GetProcedure("Enter") THEN
  6047. CallProcedure
  6048. END;
  6049. NEW(stringWriter,LEN(s));
  6050. FOR i := 0 TO x.Length()-1 DO
  6051. msg := "";
  6052. expression := x.GetExpression(i);
  6053. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6054. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6055. ELSE
  6056. Global.GetModuleName(module.module, s);
  6057. END;
  6058. IF i = 0 THEN
  6059. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6060. stringWriter.String(":");
  6061. END;
  6062. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6063. IF ~(expression IS SyntaxTree.StringValue) THEN
  6064. printout.Expression(expression);
  6065. stringWriter.Get(s);
  6066. Strings.Append(msg,s);
  6067. Strings.Append(msg,"= ");
  6068. ELSE stringWriter.Get(s); (* remove from string writer *)
  6069. Strings.Append(msg, s);
  6070. END;
  6071. String(msg);
  6072. IF SemanticChecker.IsStringType(expression.type) THEN
  6073. Designate(expression,res);
  6074. StringOperand(res, expression.type);
  6075. ELSE
  6076. Evaluate(expression,res);
  6077. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6078. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6079. Convert(res.op,int64);
  6080. END;
  6081. Integer(res.op);
  6082. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6083. Boolean(res.op);
  6084. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6085. Set(res.op);
  6086. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6087. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6088. Convert(res.op,float64);
  6089. END;
  6090. Float(res.op);
  6091. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6092. Char(res.op);
  6093. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6094. Address(res.op);String("H");
  6095. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6096. Size(res.op);
  6097. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6098. Address(res.op);String("H");
  6099. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6100. Address(res.op);String("H");
  6101. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6102. String("NIL");
  6103. ELSE HALT(200);
  6104. END;
  6105. END;
  6106. ReleaseOperand(res);
  6107. String("; ");
  6108. END;
  6109. IF GetProcedure("Exit") THEN
  6110. CallProcedure
  6111. ELSE
  6112. Ln;
  6113. END;
  6114. END;
  6115. END SystemTrace;
  6116. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6117. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6118. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6119. BEGIN
  6120. type := type.resolved;
  6121. IF type IS SyntaxTree.RecordType THEN
  6122. WITH type: SyntaxTree.RecordType DO
  6123. baseType := type.baseType;
  6124. IF baseType # NIL THEN
  6125. baseType := baseType.resolved;
  6126. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6127. InitFields(baseType,adr,offset);
  6128. END;
  6129. variable := type.recordScope.firstVariable;
  6130. WHILE variable # NIL DO
  6131. IF variable.initializer # NIL THEN
  6132. Evaluate(variable.initializer,initializerOp);
  6133. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6134. Emit(Mov(position,mem,initializerOp.op));
  6135. ReleaseOperand(initializerOp);
  6136. ReleaseIntermediateOperand(mem);
  6137. END;
  6138. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6139. variable := variable.nextVariable
  6140. END;
  6141. END;
  6142. ELSIF type IS SyntaxTree.CellType THEN
  6143. WITH type: SyntaxTree.CellType DO
  6144. baseType := type.baseType;
  6145. IF baseType # NIL THEN
  6146. baseType := baseType.resolved;
  6147. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6148. InitFields(baseType,adr,offset);
  6149. END;
  6150. variable := type.cellScope.firstVariable;
  6151. WHILE variable # NIL DO
  6152. IF variable.initializer # NIL THEN
  6153. Evaluate(variable.initializer,initializerOp);
  6154. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6155. Emit(Mov(position,mem,initializerOp.op));
  6156. ReleaseOperand(initializerOp);
  6157. ReleaseIntermediateOperand(mem);
  6158. END;
  6159. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6160. variable := variable.nextVariable
  6161. END;
  6162. END;
  6163. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6164. WITH type: SyntaxTree.ArrayType DO
  6165. IF type.form = SyntaxTree.Static THEN
  6166. baseType := type.arrayBase;
  6167. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6168. FOR i := 0 TO type.staticLength-1 DO
  6169. InitFields(baseType,adr,offset+i*size);
  6170. END;
  6171. END;
  6172. END;
  6173. ELSIF type IS SyntaxTree.MathArrayType THEN
  6174. WITH type: SyntaxTree.MathArrayType DO
  6175. IF type.form = SyntaxTree.Open THEN
  6176. dim := DynamicDim(type);
  6177. imm := IntermediateCode.Immediate(addressType,dim);
  6178. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6179. baseType := SemanticChecker.ArrayBase(type,dim);
  6180. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6181. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6182. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6183. ReleaseIntermediateOperand(imm);
  6184. (* flags remain empty (=0) for open array *)
  6185. ELSIF type.form = SyntaxTree.Static THEN
  6186. baseType := type.arrayBase;
  6187. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6188. ASSERT(type.staticLength < 1024*1024*1024);
  6189. FOR i := 0 TO type.staticLength-1 DO
  6190. InitFields(baseType,adr,offset+i*size);
  6191. END;
  6192. END;
  6193. END;
  6194. END;
  6195. END InitFields;
  6196. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6197. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6198. saved: RegisterEntry;
  6199. BEGIN
  6200. type := variable.type.resolved;
  6201. IF (type IS SyntaxTree.MathArrayType) THEN
  6202. WITH type: SyntaxTree.MathArrayType DO
  6203. IF type.form = SyntaxTree.Open THEN
  6204. Symbol(variable,operand);
  6205. InitFields(type, operand.tag,0);
  6206. IF temporary THEN
  6207. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6208. END;
  6209. ELSIF type.form = SyntaxTree.Tensor THEN
  6210. IF temporary & backend.writeBarriers THEN
  6211. SaveRegisters();ReleaseUsedRegisters(saved);
  6212. Symbol(variable, operand);
  6213. Emit(Push(position,operand.op));
  6214. ReleaseOperand(operand);
  6215. Emit(Push(position,nil));
  6216. CallThis(position,"FoxArrayBase","Assign",2);
  6217. RestoreRegisters(saved);
  6218. ELSE
  6219. Symbol(variable, operand);
  6220. MakeMemory(tmp,operand.op,addressType,0);
  6221. ReleaseOperand(operand);
  6222. IF FALSE & temporary THEN
  6223. (* trick -- temporary object from array base *)
  6224. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6225. Symbol(symbol,operand);
  6226. MakeMemory(mem,operand.op,addressType,0);
  6227. ReleaseOperand(operand);
  6228. Emit(Mov(position,tmp, mem) );
  6229. ReleaseOperand(operand);
  6230. ELSE
  6231. Emit(Mov(position,tmp, nil ) );
  6232. END;
  6233. ReleaseIntermediateOperand(tmp)
  6234. END;
  6235. END;
  6236. END;
  6237. ELSE
  6238. Symbol(variable,operand);
  6239. IF variable.initializer # NIL THEN
  6240. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6241. reference.SetType(variable.type.resolved);
  6242. reference.SetAssignable(TRUE);
  6243. Assign(reference,variable.initializer);
  6244. ELSIF temporary THEN
  6245. IF SemanticChecker.IsPointerType(variable.type) THEN
  6246. IF backend.cooperative THEN
  6247. SaveRegisters();ReleaseUsedRegisters(saved);
  6248. Symbol(variable, operand);
  6249. CallAssignPointer(operand.op, nil);
  6250. ReleaseOperand(operand);
  6251. RestoreRegisters(saved);
  6252. ELSIF backend.writeBarriers THEN
  6253. SaveRegisters();ReleaseUsedRegisters(saved);
  6254. Symbol(variable, operand);
  6255. Emit(Push(position,operand.op));
  6256. ReleaseOperand(operand);
  6257. Emit(Push(position,nil));
  6258. CallThis(position,"Heaps","Assign",2);
  6259. RestoreRegisters(saved);
  6260. ELSE
  6261. Symbol(variable, operand);
  6262. MakeMemory(tmp,operand.op,addressType,0);
  6263. ReleaseOperand(operand);
  6264. Emit(Mov(position,tmp, nil ) );
  6265. ReleaseIntermediateOperand(tmp);
  6266. END;
  6267. END;
  6268. END;
  6269. InitFields(type, operand.op,0);
  6270. ReleaseOperand(operand);
  6271. END;
  6272. END InitVariable;
  6273. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6274. VAR end: Label;
  6275. BEGIN
  6276. IF type.form = SyntaxTree.Tensor THEN
  6277. InitOperand(result,ModeValue);
  6278. ReuseCopy(result.op,base);
  6279. end := NewLabel();
  6280. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6281. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6282. SetLabel(end);
  6283. Convert(result.op,lenType);
  6284. ELSE
  6285. InitOperand(result,ModeValue);
  6286. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6287. END
  6288. END MathArrayDim;
  6289. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6290. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6291. BEGIN
  6292. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6293. MakeMemory(mem,base,addressType,offset);
  6294. Emit(Mov(position,mem,value));
  6295. ReleaseIntermediateOperand(mem);
  6296. END PutMathArrayField;
  6297. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6298. VAR mem: IntermediateCode.Operand;
  6299. BEGIN
  6300. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6301. MakeMemory(mem,base,addressType,offset);
  6302. Emit(Mov(position,mem,value));
  6303. ReleaseIntermediateOperand(mem);
  6304. END PutMathArrayFieldOffset;
  6305. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6306. BEGIN
  6307. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6308. MakeMemory(value,base,addressType,offset);
  6309. END GetMathArrayField;
  6310. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6311. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6312. BEGIN
  6313. IF incr THEN
  6314. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6315. ELSE
  6316. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6317. END;
  6318. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6319. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6320. ELSE
  6321. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6322. Emit(Mov(position,reg,dim));
  6323. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6324. Emit(Add(position,reg,reg,base));
  6325. MakeMemory(mem, reg, addressType, offset);
  6326. ReleaseIntermediateOperand(reg);
  6327. Emit(Mov(position,mem,value));
  6328. ReleaseIntermediateOperand(mem);
  6329. END;
  6330. END PutMathArrayLenOrIncr;
  6331. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6332. BEGIN
  6333. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6334. END PutMathArrayLength;
  6335. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6336. BEGIN
  6337. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6338. END PutMathArrayIncrement;
  6339. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6340. BEGIN
  6341. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6342. END GetMathArrayIncrement;
  6343. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6344. BEGIN
  6345. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6346. END GetMathArrayLength;
  6347. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6348. VAR dimOp: IntermediateCode.Operand;
  6349. BEGIN
  6350. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6351. GetMathArrayLength(type, operand, dimOp, check, result);
  6352. END GetMathArrayLengthAt;
  6353. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6354. VAR dimOp: IntermediateCode.Operand;
  6355. BEGIN
  6356. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6357. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6358. END GetMathArrayIncrementAt;
  6359. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6360. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6361. offset: LONGINT;
  6362. BEGIN
  6363. IF increment THEN
  6364. offset := MathIncrOffset;
  6365. ELSE
  6366. offset := MathLenOffset;
  6367. END;
  6368. INC(offset,operand.dimOffset*2);
  6369. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6370. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6371. END;
  6372. (* static dimension *)
  6373. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6374. IF check & (type.form = SyntaxTree.Tensor) THEN
  6375. DimensionCheck(operand.tag,dim,BrltL);
  6376. END;
  6377. val := SHORT(dim.intValue);
  6378. IF type.form # SyntaxTree.Tensor THEN
  6379. t := SemanticChecker.ArrayBase(type,val);
  6380. type := t.resolved(SyntaxTree.MathArrayType);
  6381. IF type.form = SyntaxTree.Static THEN
  6382. IF increment THEN
  6383. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6384. ELSE
  6385. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6386. END;
  6387. InitOperand(result,ModeValue);
  6388. result.op := res;
  6389. RETURN;
  6390. END;
  6391. END;
  6392. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6393. MakeMemory(res,operand.tag,addressType,offset);
  6394. (*
  6395. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6396. *)
  6397. InitOperand(result,ModeValue);
  6398. result.op := res;
  6399. ELSE
  6400. Convert(dim,addressType);
  6401. IF check THEN
  6402. IF type.form = SyntaxTree.Tensor THEN
  6403. DimensionCheck(operand.tag,dim,BrltL);
  6404. ELSIF isUnchecked THEN (* do nothing *)
  6405. ELSE
  6406. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6407. END;
  6408. END;
  6409. end := NewLabel(); next := NIL;
  6410. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6411. Emit(Mov(position,res,dim));
  6412. Convert(res,sizeType);
  6413. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6414. WHILE t IS SyntaxTree.MathArrayType DO
  6415. type := t(SyntaxTree.MathArrayType);
  6416. IF type.form = SyntaxTree.Static THEN
  6417. imm := IntermediateCode.Immediate(sizeType,val);
  6418. next := NewLabel();
  6419. BrneL(next,imm,res);
  6420. IF increment THEN
  6421. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6422. ELSE
  6423. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6424. END;
  6425. Emit(MovReplace(position,res,imm));
  6426. BrL(end);
  6427. ELSE hasDynamicPart := TRUE;
  6428. END;
  6429. t := type.arrayBase.resolved;
  6430. val := val + 1;
  6431. IF next # NIL THEN SetLabel(next) END;
  6432. END;
  6433. IF hasDynamicPart THEN
  6434. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6435. Emit(Mov(position,res2,dim));
  6436. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6437. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6438. Emit(Add(position,res2,res2,imm));
  6439. Emit(Add(position,res2,res2,operand.tag));
  6440. IntermediateCode.MakeMemory(res2,sizeType);
  6441. Emit(MovReplace(position,res,res2));
  6442. ReleaseIntermediateOperand(res2);
  6443. END;
  6444. SetLabel(end);
  6445. Convert(res,sizeType);
  6446. InitOperand(result,ModeValue);
  6447. result.op := res;
  6448. END;
  6449. END MathArrayLenOrIncr;
  6450. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6451. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6452. offset: LONGINT;
  6453. BEGIN
  6454. offset := operand.dimOffset+DynamicDim(type)-1;
  6455. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6456. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6457. val := SHORT(dim.intValue);
  6458. t := SemanticChecker.ArrayBase(type,val);
  6459. type := t.resolved(SyntaxTree.ArrayType);
  6460. IF type.form = SyntaxTree.Static THEN
  6461. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6462. ELSE
  6463. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6464. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6465. END;
  6466. UseIntermediateOperand(res);
  6467. InitOperand(result,ModeValue);
  6468. result.op := res;
  6469. ELSE
  6470. Convert(dim,addressType);
  6471. IF ~isUnchecked THEN
  6472. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6473. END;
  6474. end := NewLabel(); next := NIL;
  6475. (* ReuseCopy(dim,res); *)
  6476. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6477. Emit(Mov(position,res,dim));
  6478. Convert(res,sizeType);
  6479. Convert(res,sizeType);
  6480. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6481. WHILE t IS SyntaxTree.ArrayType DO
  6482. type := t(SyntaxTree.ArrayType);
  6483. IF type.form = SyntaxTree.Static THEN
  6484. imm := IntermediateCode.Immediate(sizeType,val);
  6485. next := NewLabel();
  6486. BrneL(next,imm,res);
  6487. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6488. Emit(MovReplace(position,res,imm));
  6489. BrL(end);
  6490. ELSE hasDynamicPart := TRUE;
  6491. END;
  6492. t := type.arrayBase.resolved;
  6493. val := val + 1;
  6494. IF next # NIL THEN SetLabel(next) END;
  6495. END;
  6496. IF hasDynamicPart THEN
  6497. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6498. Convert(res2,addressType);
  6499. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6500. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6501. Emit(Sub(position,res2,imm,res2));
  6502. Emit(Add(position,res2,res2,operand.tag));
  6503. IntermediateCode.MakeMemory(res2,sizeType);
  6504. Emit(MovReplace(position,res,res2));
  6505. ReleaseIntermediateOperand(res2);
  6506. END;
  6507. SetLabel(end);
  6508. Convert(res,sizeType);
  6509. InitOperand(result,ModeValue);
  6510. result.op := res;
  6511. END;
  6512. END ArrayLen;
  6513. (**
  6514. create a temporary variable in current scope
  6515. **)
  6516. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6517. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6518. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6519. BEGIN
  6520. IF ~register THEN
  6521. v := temporaries.GetFreeVariable(type, untraced, index);
  6522. ELSE
  6523. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6524. END;
  6525. scope := currentScope;
  6526. (*
  6527. v := NIL; (* disable free variable managemenet for the time being *)
  6528. *)
  6529. name := temporaries.GetUID();
  6530. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6531. variable.SetType(type);
  6532. variable.SetAccess(SyntaxTree.Hidden);
  6533. variable.SetUntraced(untraced);
  6534. IF v = NIL THEN
  6535. temporaries.AddVariable(variable);
  6536. IF ~register THEN
  6537. IF scope.lastVariable # NIL THEN
  6538. offset := scope.lastVariable.offsetInBits;
  6539. ELSE
  6540. offset := 0;
  6541. END;
  6542. DEC(offset,system.SizeOf(variable.type));
  6543. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6544. variable(SyntaxTree.Variable).SetOffset(offset);
  6545. scope.AddVariable(variable(SyntaxTree.Variable));
  6546. scope.EnterSymbol(variable, duplicate);
  6547. ASSERT(~duplicate);
  6548. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6549. ELSE
  6550. variable.SetUseRegister(TRUE);
  6551. variable(SyntaxTree.Variable).SetOffset(0);
  6552. END;
  6553. ELSE (* v # NIL *)
  6554. (* reuse slot for new variable, do not create new slot ! *)
  6555. temporaries.SetVariable(index, variable);
  6556. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6557. ASSERT(~register);
  6558. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6559. ASSERT(v.offsetInBits # 0);
  6560. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6561. scope.EnterSymbol(variable, duplicate);
  6562. ASSERT(~duplicate);
  6563. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6564. END;
  6565. RETURN variable(SyntaxTree.Variable)
  6566. END GetTemporaryVariable;
  6567. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6568. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6569. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6570. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6571. i: LONGINT; duplicate: BOOLEAN;
  6572. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6573. VAR variable: SyntaxTree.Variable;
  6574. BEGIN
  6575. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6576. variable.SetType(type);
  6577. recordScope.AddVariable(variable);
  6578. END AddVariable;
  6579. BEGIN
  6580. name := "@ArrayDescriptor";
  6581. Basic.AppendNumber(name,dimensions);
  6582. identifier := SyntaxTree.NewIdentifier(name);
  6583. parentScope := module.module.moduleScope;
  6584. symbol := parentScope.FindSymbol(identifier);
  6585. IF symbol # NIL THEN
  6586. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6587. type := typeDeclaration.declaredType;
  6588. ELSE
  6589. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6590. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6591. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6592. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6593. recordType.SetTypeDeclaration(typeDeclaration);
  6594. recordType.SetState(SyntaxTree.Resolved);
  6595. typeDeclaration.SetDeclaredType(recordType);
  6596. AddVariable("@ptr",system.anyType);
  6597. AddVariable("@adr",system.addressType);
  6598. AddVariable("@flags",system.addressType);
  6599. AddVariable("@dim",system.addressType);
  6600. AddVariable("@elementSize",system.addressType);
  6601. FOR i := 0 TO dimensions-1 DO
  6602. name := "@len";
  6603. Basic.AppendNumber(name,i);
  6604. AddVariable(name,system.addressType);
  6605. name := "@incr";
  6606. Basic.AppendNumber(name,i);
  6607. AddVariable(name,system.addressType);
  6608. END;
  6609. parentScope.AddTypeDeclaration(typeDeclaration);
  6610. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6611. ASSERT(~duplicate);
  6612. type := recordType;
  6613. END;
  6614. RETURN type
  6615. END GetMathArrayDescriptorType;
  6616. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6617. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6618. BEGIN
  6619. type := GetMathArrayDescriptorType(dimensions);
  6620. Emit(Push(position,op.op));
  6621. (* push type descriptor *)
  6622. reg := TypeDescriptorAdr(type);
  6623. Emit(Push(position,reg));
  6624. ReleaseIntermediateOperand(reg);
  6625. (* push realtime flag: false by default *)
  6626. Emit(Push(position,false));
  6627. CallThis(position,"Heaps","NewRec",3);
  6628. END NewMathArrayDescriptor;
  6629. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6630. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6631. BEGIN
  6632. NEW(string, LEN(s)); COPY(s, string^);
  6633. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6634. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6635. sv.SetType(type);
  6636. Designate(sv,res);
  6637. Emit(Push(position,res.tag));
  6638. Emit(Push(position,res.op));
  6639. ReleaseOperand(res);
  6640. END PushConstString;
  6641. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6642. BEGIN
  6643. IF b THEN
  6644. Emit(Push(Basic.invalidPosition, true));
  6645. ELSE
  6646. Emit(Push(Basic.invalidPosition, false));
  6647. END;
  6648. END PushConstBoolean;
  6649. PROCEDURE PushConstSet(v: SET);
  6650. VAR value: SyntaxTree.Value; op: Operand;
  6651. BEGIN
  6652. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6653. value.SetType(system.setType);
  6654. Evaluate(value, op);
  6655. Emit(Push(Basic.invalidPosition, op.op));
  6656. ReleaseOperand(op);
  6657. END PushConstSet;
  6658. PROCEDURE PushConstInteger(v: LONGINT);
  6659. VAR value: SyntaxTree.Value; op: Operand;
  6660. BEGIN
  6661. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6662. value.SetType(system.longintType);
  6663. Evaluate(value, op);
  6664. Emit(Push(Basic.invalidPosition, op.op));
  6665. ReleaseOperand(op);
  6666. END PushConstInteger;
  6667. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6668. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6669. section: IntermediateCode.Section;
  6670. BEGIN
  6671. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6672. Global.GetSymbolSegmentedName(symbol, name);
  6673. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6674. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6675. procedure.SetScope(moduleScope);
  6676. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6677. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6678. procedure.SetAccess(SyntaxTree.Hidden);
  6679. currentScope := procedureScope;
  6680. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6681. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6682. RETURN section;
  6683. END OpenInitializer;
  6684. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6685. BEGIN
  6686. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6687. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6688. section := prev;
  6689. END CloseInitializer;
  6690. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6691. VAR name: SyntaxTree.IdentifierString;
  6692. variable: SyntaxTree.Variable;
  6693. parameter: SyntaxTree.Parameter;
  6694. type: SyntaxTree.Type;
  6695. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6696. BEGIN
  6697. InitOperand(op,ModeReference);
  6698. op.op := fp;
  6699. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6700. Dereference(op, x, FALSE);
  6701. result := op;
  6702. Symbol(symbol, op);
  6703. END Field;
  6704. PROCEDURE Direction(direction: LONGINT): SET;
  6705. BEGIN
  6706. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6707. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6708. ELSE HALT(100);
  6709. END;
  6710. END Direction;
  6711. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6712. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6713. BEGIN
  6714. Field(port, op);
  6715. ToMemory(op.op,addressType,0);
  6716. Emit(Push(Basic.invalidPosition, op.op));
  6717. ReleaseOperand(op);
  6718. Basic.GetString(modifier.identifier, name);
  6719. PushConstString(name);
  6720. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6721. ASSERT(SemanticChecker.IsStringType(value.type));
  6722. Designate(value, op);
  6723. Emit(Push(modifier.position, op.tag));
  6724. Emit(Push(modifier.position, op.op));
  6725. ReleaseOperand(op);
  6726. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6727. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6728. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6729. Evaluate(value, op);
  6730. Emit(Push(modifier.position, op.op));
  6731. ReleaseOperand(op);
  6732. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6733. ELSE
  6734. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6735. END;
  6736. END AddPortProperty;
  6737. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6738. VAR modifier: SyntaxTree.Modifier;
  6739. BEGIN
  6740. modifier := parameter.modifiers;
  6741. WHILE modifier # NIL DO
  6742. AddPortProperty(parameter,modifier, modifier.expression);
  6743. modifier := modifier.nextModifier;
  6744. END;
  6745. END AddPortProperties;
  6746. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6747. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6748. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6749. PROCEDURE PushLens(type: SyntaxTree.Type);
  6750. BEGIN
  6751. IF IsSemiDynamicArray(type) THEN
  6752. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6753. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6754. Emit(Push(Basic.invalidPosition, op.op));
  6755. ReleaseOperand(op);
  6756. INC(dim);
  6757. ELSIF IsStaticArray(type) THEN
  6758. len := len * type(SyntaxTree.ArrayType).staticLength;
  6759. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6760. INC(dim);
  6761. ELSE
  6762. baseType := type;
  6763. END;
  6764. END PushLens;
  6765. BEGIN
  6766. (* cell *)
  6767. IF parameter.type IS SyntaxTree.ArrayType THEN
  6768. type := parameter.type;
  6769. dim := 0;
  6770. len := 1;
  6771. PushLens(type);
  6772. portType := baseType.resolved(SyntaxTree.PortType);
  6773. ELSE
  6774. portType := parameter.type(SyntaxTree.PortType);
  6775. END;
  6776. PushSelfPointer();
  6777. (* port / array of ports *)
  6778. IF IsStaticArray(type) THEN
  6779. PushConstInteger(len);
  6780. END;
  6781. Field(parameter, op);
  6782. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6783. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6784. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6785. Designate(d, op);*)
  6786. Emit(Push(Basic.invalidPosition, op.op));
  6787. ReleaseOperand(op);
  6788. (* name *)
  6789. PushConstString(name);
  6790. (* inout *)
  6791. PushConstSet(Direction(portType.direction));
  6792. (* width *)
  6793. PushConstInteger(portType.sizeInBits);
  6794. IF parameter.type IS SyntaxTree.PortType THEN
  6795. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6796. AddPortProperties(parameter);
  6797. ELSIF IsStaticArray(type)THEN
  6798. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6799. ELSIF IsSemiDynamicArray(type) THEN
  6800. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6801. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6802. Emit(Add(position,reg, sp, size));
  6803. (* dim *)
  6804. PushConstInteger(dim);
  6805. (* len array *)
  6806. Emit(Push(position, reg));
  6807. ReleaseIntermediateOperand(reg);
  6808. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6809. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6810. Emit(Add(position, sp,sp, size));
  6811. ELSE
  6812. HALT(100);
  6813. END;
  6814. END Parameter;
  6815. BEGIN
  6816. IF backend.cellsAreObjects THEN
  6817. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6818. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6819. END;
  6820. parameter := x.firstParameter;
  6821. WHILE (parameter # NIL) DO
  6822. type := parameter.type.resolved;
  6823. WHILE (type IS SyntaxTree.ArrayType) DO
  6824. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6825. END;
  6826. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6827. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6828. Parameter(name,parameter);
  6829. END;
  6830. parameter := parameter.nextParameter;
  6831. END;
  6832. ELSE HALT(200)
  6833. END;
  6834. END AddPorts;
  6835. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6836. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6837. BEGIN
  6838. Symbol(cell,op);
  6839. ToMemory(op.op,addressType,0);
  6840. Emit(Push(position,op.op));
  6841. ReleaseOperand(op);
  6842. property.GetName(name);
  6843. (* does not work when inheritance is used:
  6844. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6845. *)
  6846. PushConstString(name);
  6847. IF (value # NIL) THEN
  6848. ASSERT(
  6849. SemanticChecker.IsStringType(property.type)
  6850. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6851. OR (property.type.resolved IS SyntaxTree.FloatType)
  6852. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6853. OR (property.type.resolved IS SyntaxTree.SetType)
  6854. );
  6855. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6856. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6857. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6858. Designate(d, op);
  6859. IF SemanticChecker.IsStringType(property.type) THEN
  6860. Emit(Push(Basic.invalidPosition, op.tag))
  6861. END;
  6862. Emit(Push(Basic.invalidPosition, op.op));
  6863. ReleaseOperand(op);
  6864. END;
  6865. IF value = NIL THEN
  6866. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6867. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6868. ASSERT(SemanticChecker.IsStringType(value.type));
  6869. Designate(value, op);
  6870. PushString(op, value.type);
  6871. ReleaseOperand(op);
  6872. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6873. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6874. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6875. Evaluate(value, op);
  6876. Emit(Push(property.position, op.op));
  6877. ReleaseOperand(op);
  6878. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6879. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6880. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6881. Evaluate(value, op);
  6882. Emit(Push(property.position, op.op));
  6883. ReleaseOperand(op);
  6884. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6885. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6886. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6887. Evaluate(value, op);
  6888. Emit(Push(property.position, op.op));
  6889. ReleaseOperand(op);
  6890. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6891. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6892. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6893. Evaluate(value, op);
  6894. Emit(Push(property.position, op.op));
  6895. ReleaseOperand(op);
  6896. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6897. ELSE
  6898. HALT(200);
  6899. END;
  6900. END AddProperty;
  6901. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6902. VAR symbol: SyntaxTree.Symbol;
  6903. BEGIN
  6904. WHILE modifier # NIL DO
  6905. symbol := cellType.FindProperty(modifier.identifier);
  6906. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6907. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6908. modifier := modifier.nextModifier;
  6909. END;
  6910. END AddModifiers;
  6911. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6912. VAR last: SyntaxTree.Modifier;
  6913. BEGIN
  6914. IF to = NIL THEN
  6915. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6916. ELSE
  6917. last := to;
  6918. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6919. last := last.nextModifier;
  6920. END;
  6921. IF last.identifier # this.identifier THEN
  6922. ASSERT(last.nextModifier = NIL);
  6923. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6924. END;
  6925. END;
  6926. END AppendModifier;
  6927. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6928. BEGIN
  6929. WHILE this # NIL DO
  6930. AppendModifier(to, this);
  6931. this := this.nextModifier;
  6932. END;
  6933. END AppendModifiers;
  6934. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6935. VAR base: SyntaxTree.Type;
  6936. BEGIN
  6937. AppendModifiers(to, c.modifiers);
  6938. base := c.GetBaseValueType();
  6939. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6940. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6941. END;
  6942. END AppendCellTypeModifiers;
  6943. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6944. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6945. BEGIN
  6946. Basic.GetString(modifier.identifier, name);
  6947. PushConstString(name);
  6948. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6949. ASSERT(SemanticChecker.IsStringType(value.type));
  6950. Designate(value, op);
  6951. PushString(op, value.type);
  6952. ReleaseOperand(op);
  6953. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6954. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6955. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6956. Evaluate(value, op);
  6957. Emit(Push(modifier.position, op.op));
  6958. ReleaseOperand(op);
  6959. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6960. ELSE
  6961. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6962. END;
  6963. END AddPortProperty;
  6964. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6965. BEGIN
  6966. WHILE modifier # NIL DO
  6967. AddPortProperty(modifier, modifier.expression);
  6968. modifier := modifier.nextModifier;
  6969. END;
  6970. END AddPortProperties;
  6971. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6972. VAR op: Operand;
  6973. BEGIN
  6974. Evaluate(p, op);
  6975. Emit(Push(p.position, op.op));
  6976. ReleaseOperand(op);
  6977. IF p IS SyntaxTree.Designator THEN
  6978. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6979. END;
  6980. END PushPort;
  6981. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6982. VAR tmp: IntermediateCode.Operand;
  6983. BEGIN
  6984. actualType := actualType.resolved;
  6985. IF actualType IS SyntaxTree.StringType THEN
  6986. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6987. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6988. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6989. ELSE
  6990. tmp := op.tag;
  6991. IntermediateCode.MakeMemory(tmp,addressType);
  6992. Emit(Push(position,tmp));
  6993. END;
  6994. Emit(Push(position,op.op))
  6995. END PushString;
  6996. (* conservative check if x is potentially on the heap, excluding the module heap
  6997. required for generational garbage collector
  6998. *)
  6999. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7000. VAR pos: LONGINT; y: SyntaxTree.Expression;
  7001. BEGIN
  7002. RETURN TRUE;
  7003. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7004. passed by reference.
  7005. pos := x.position.start;
  7006. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7007. x := x(SyntaxTree.Designator).left;
  7008. END;
  7009. RETURN x # NIL;
  7010. *)
  7011. END OnHeap;
  7012. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7013. VAR
  7014. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7015. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7016. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7017. tmp:IntermediateCode.Operand;
  7018. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7019. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7020. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7021. dest: IntermediateCode.Operand;
  7022. staticLength: LONGINT; itype: IntermediateCode.Type;
  7023. convert,isTensor: BOOLEAN;
  7024. recordType: SyntaxTree.RecordType;
  7025. baseType: SyntaxTree.Type;
  7026. flags: SET;
  7027. left: SyntaxTree.Expression;
  7028. call: SyntaxTree.Designator;
  7029. procedure: SyntaxTree.Procedure;
  7030. temporaryVariable: SyntaxTree.Variable;
  7031. dummy: IntermediateCode.Operand;
  7032. customBuiltin: SyntaxTree.CustomBuiltin;
  7033. isVarPar: ARRAY 3 OF BOOLEAN;
  7034. callsection: Sections.Section;
  7035. segmentedName: Basic.SegmentedName;
  7036. needsTrace: BOOLEAN;
  7037. n: ARRAY 256 OF CHAR;
  7038. modifier: SyntaxTree.Modifier;
  7039. previous, init: IntermediateCode.Section;
  7040. prevScope: SyntaxTree.Scope;
  7041. firstPar: LONGINT;
  7042. saved: RegisterEntry;
  7043. callingConvention: SyntaxTree.CallingConvention;
  7044. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7045. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7046. priority: IntermediateCode.Operand;
  7047. op,callop: Operand;
  7048. BEGIN
  7049. IF type = NIL THEN RETURN END;
  7050. type := type.resolved;
  7051. IF type IS SyntaxTree.PointerType THEN
  7052. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7053. END;
  7054. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7055. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7056. recordScope := type(SyntaxTree.RecordType).recordScope;
  7057. IF recordScope.bodyProcedure # NIL THEN
  7058. procedure := recordScope.bodyProcedure;
  7059. body := procedure.procedureScope.body;
  7060. Emit(Push(position,self));
  7061. IF body.isActive THEN
  7062. StaticCallOperand(callop,procedure);
  7063. Emit(Push(position,callop.op));
  7064. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7065. Convert(priority,sizeType);
  7066. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7067. END;
  7068. Emit(Push(position,priority));
  7069. ReleaseIntermediateOperand(priority);
  7070. IF backend.cooperative THEN
  7071. Emit(Push(position,self));
  7072. CallThis(position,"Activities","Create",3)
  7073. ELSE
  7074. flags := 0;
  7075. IF body.isSafe THEN
  7076. flags := 1;
  7077. END;
  7078. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7079. Emit(Push(position,self));
  7080. CallThis(position,"Objects","CreateProcess",4)
  7081. END;
  7082. ELSE
  7083. Emit(Push(position,self));
  7084. StaticCallOperand(callop,procedure);
  7085. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7086. END;
  7087. Emit(Pop(position,self));
  7088. END;
  7089. END CallBodies;
  7090. PROCEDURE PushTD(type: SyntaxTree.Type);
  7091. VAR op: IntermediateCode.Operand;
  7092. BEGIN
  7093. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7094. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7095. ELSE
  7096. IF type.resolved IS SyntaxTree.PointerType THEN
  7097. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7098. END;
  7099. op := TypeDescriptorAdr(type.resolved);
  7100. Emit(Push(position,op));
  7101. END
  7102. END PushTD;
  7103. BEGIN
  7104. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7105. dest := destination; destination := emptyOperand;
  7106. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7107. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7108. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7109. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7110. CASE x.id OF
  7111. (* ---- COPY ----- *)
  7112. |Global.Copy:
  7113. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7114. (* ---- EXCL, INCL----- *)
  7115. |Global.Excl,Global.Incl:
  7116. Evaluate(p0,s0);
  7117. Evaluate(p1,s1);
  7118. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7119. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7120. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7121. END;
  7122. ReuseCopy(res,s0.op);
  7123. ReleaseOperand(s0);
  7124. Reuse1(tmp,s1.op);
  7125. ReleaseOperand(s1);
  7126. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7127. IF x.id = Global.Excl THEN
  7128. Emit(Not(position,tmp,tmp));
  7129. Emit(And(position,res,res,tmp));
  7130. ELSE
  7131. Emit(Or(position,res,res,tmp));
  7132. END;
  7133. ReleaseIntermediateOperand(tmp);
  7134. Designate(p0,s0);
  7135. ToMemory(s0.op,s1.op.type,0);
  7136. Emit(Mov(position,s0.op,res));
  7137. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7138. (* ---- DISPOSE ----- *)
  7139. |Global.Dispose:
  7140. Designate(p0,s0);
  7141. Emit(Push(position,s0.op));
  7142. ReleaseOperand(s0);
  7143. CallThis(position,"Runtime","Dispose", 1);
  7144. (* ---- GETPROCEDURE ----- *)
  7145. |Global.GetProcedure:
  7146. Designate(p0,s0);
  7147. PushString(s0,p0.type);
  7148. Designate(p1,s1);
  7149. PushString(s1,p1.type);
  7150. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7151. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7152. ELSE PushTD(procedureType.firstParameter.type)
  7153. END;
  7154. PushTD(procedureType.returnType);
  7155. Designate(p2,s2);
  7156. Emit(Push(position,s2.op));
  7157. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7158. CallThis(position,"Modules","GetProcedure", 7);
  7159. (* ---- ASH, LSH, ROT ----- *)
  7160. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7161. Evaluate(p0,s0);
  7162. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7163. (* make unsigned arguments in order to produced a logical shift *)
  7164. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7165. convert:= TRUE;
  7166. itype := s0.op.type;
  7167. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7168. Convert(s0.op,itype);
  7169. ELSE
  7170. convert := FALSE;
  7171. END;
  7172. END;
  7173. Evaluate(p1,s1);
  7174. IF IsIntegerConstant(p1,hint) THEN
  7175. ReuseCopy(reg,s0.op);
  7176. IF hint > 0 THEN
  7177. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7178. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7179. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7180. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7181. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7182. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7183. END;
  7184. ELSIF hint < 0 THEN
  7185. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7186. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7187. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7188. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7189. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7190. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7191. END;
  7192. END;
  7193. ReleaseOperand(s0); ReleaseOperand(s1);
  7194. ELSE
  7195. exit := NewLabel();
  7196. end := NewLabel();
  7197. ReuseCopy(reg,s0.op);
  7198. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7199. Reuse1(tmp,s1.op);
  7200. Emit(Neg(position,tmp,s1.op));
  7201. Convert(tmp,s1.op.type);
  7202. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7203. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7204. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7205. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7206. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7207. END;
  7208. ReleaseIntermediateOperand(tmp);
  7209. BrL(end);
  7210. SetLabel(exit);
  7211. ReuseCopy(tmp,s1.op);
  7212. Convert(tmp,s1.op.type);
  7213. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7214. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7215. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7216. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7217. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7218. END;
  7219. ReleaseIntermediateOperand(tmp);
  7220. SetLabel(end);
  7221. ReleaseOperand(s0); ReleaseOperand(s1);
  7222. END;
  7223. InitOperand(result,ModeValue);
  7224. IF convert THEN
  7225. itype := reg.type;
  7226. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7227. Convert(reg,itype);
  7228. END;
  7229. result.op := reg;
  7230. (* ---- CAP ----- *)
  7231. |Global.Cap:
  7232. Evaluate(p0,result);
  7233. ReuseCopy(reg,result.op);
  7234. ReleaseIntermediateOperand(result.op);
  7235. ignore := NewLabel();
  7236. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7237. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7238. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7239. SetLabel(ignore);
  7240. result.op := reg;
  7241. (* ---- CHR ----- *)
  7242. |Global.Chr, Global.Chr32:
  7243. Evaluate(p0,result);
  7244. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7245. |Global.Entier, Global.EntierH:
  7246. Evaluate(p0,result);
  7247. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7248. (* ---- MIN and MAX ----- *)
  7249. |Global.Max,Global.Min:
  7250. Evaluate(p0,s0);
  7251. Evaluate(p1,s1);
  7252. Reuse2(res,s0.op,s1.op);
  7253. else := NewLabel();
  7254. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7255. ELSE BrltL(else,s1.op,s0.op) END;
  7256. Emit(Mov(position,res,s0.op));
  7257. ReleaseOperand(s0);
  7258. end := NewLabel();
  7259. BrL(end);
  7260. SetLabel(else);
  7261. Emit(MovReplace(position,res,s1.op));
  7262. SetLabel(end);
  7263. ReleaseOperand(s1);
  7264. InitOperand(result,ModeValue);
  7265. result.op := res;
  7266. (* ---- ODD ----- *)
  7267. |Global.Odd:
  7268. IF ~conditional THEN
  7269. ConditionToValue(x)
  7270. ELSE
  7271. Evaluate(p0,result);
  7272. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7273. Reuse1(res,result.op);
  7274. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7275. ReleaseIntermediateOperand(result.op);
  7276. result.op := res;
  7277. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7278. ReleaseOperand(result);
  7279. BrL(falseLabel);
  7280. END;
  7281. (* ---- ORD ----- *)
  7282. |Global.Ord, Global.Ord32:
  7283. Evaluate(p0,result);
  7284. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7285. (* ---- SHORT, LONG ----- *)
  7286. |Global.Short, Global.Long:
  7287. Evaluate(p0,result);
  7288. IF x.type IS SyntaxTree.ComplexType THEN
  7289. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7290. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7291. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7292. ELSE
  7293. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7294. END
  7295. (* ---- HALT, SYSTEM.HALT----- *)
  7296. |Global.Halt, Global.systemHalt:
  7297. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7298. EmitTrap (position, val);
  7299. (* ---- ASSERT ----- *)
  7300. |Global.Assert:
  7301. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7302. trueL := NewLabel();
  7303. falseL := NewLabel();
  7304. Condition(p0,trueL,falseL);
  7305. IF p1 = NIL THEN val := AssertTrap
  7306. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7307. END;
  7308. SetLabel(falseL);
  7309. EmitTrap(position,val);
  7310. SetLabel(trueL);
  7311. END;
  7312. (*
  7313. Emit(TrapC(result.op,val);
  7314. *)
  7315. (* ---- INC, DEC----- *)
  7316. |Global.Inc,Global.Dec:
  7317. Expression(p0); adr := result.op;
  7318. LoadValue(result,p0.type); l := result;
  7319. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7320. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7321. END;
  7322. IF x.id = Global.Inc THEN
  7323. Emit(Add(position,l.op,l.op,r.op));
  7324. ELSE
  7325. Emit(Sub(position,l.op,l.op,r.op));
  7326. END;
  7327. ReleaseOperand(l); ReleaseOperand(r);
  7328. (* ---- LEN ----- *)
  7329. |Global.Len: (* dynamic length, static length done by checker *)
  7330. Designate(p0,operand);
  7331. IF p1 = NIL THEN
  7332. InitOperand(l,ModeValue);
  7333. l.op := IntermediateCode.Immediate(sizeType,0);
  7334. ELSE
  7335. Evaluate(p1,l);
  7336. END;
  7337. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7338. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7339. Dereference(operand, p0.type.resolved, FALSE);
  7340. END;
  7341. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7342. ReleaseOperand(operand); ReleaseOperand(l);
  7343. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7344. ASSERT(p1 # NIL);
  7345. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7346. Dereference(operand,p0.type.resolved,FALSE);
  7347. END;
  7348. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7349. ReleaseOperand(operand); ReleaseOperand(l);
  7350. ELSE HALT(100);
  7351. END;
  7352. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7353. (* ---- FIRST ---- *)
  7354. |Global.First:
  7355. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7356. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7357. ELSE
  7358. Designate(p0, result)
  7359. END
  7360. (* ---- LAST ---- *)
  7361. |Global.Last:
  7362. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7363. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7364. ELSE
  7365. Designate(p0, result);
  7366. (* make sure result.op is a register *)
  7367. tmp := result.op;
  7368. ReuseCopy(result.op, result.op);
  7369. ReleaseIntermediateOperand(tmp);
  7370. (* add offset to result.op *)
  7371. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7372. END
  7373. (* ---- STEP ---- *)
  7374. |Global.Step:
  7375. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7376. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7377. ELSE
  7378. Designate(p0, result);
  7379. (* make sure result.op is a register *)
  7380. tmp := result.op;
  7381. ReuseCopy(result.op, result.op);
  7382. ReleaseIntermediateOperand(tmp);
  7383. (* add offset to result.op *)
  7384. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7385. END
  7386. (* ---- RE ---- *)
  7387. |Global.Re:
  7388. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7389. Designate(p0, result)
  7390. ELSE
  7391. Evaluate(p0, result)
  7392. END
  7393. (* ---- IM ---- *)
  7394. |Global.Im:
  7395. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7396. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7397. Designate(p0, result);
  7398. (* make sure result.op is a register *)
  7399. tmp := result.op;
  7400. ReuseCopy(result.op, result.op);
  7401. ReleaseIntermediateOperand(tmp);
  7402. (* add offset to result.op *)
  7403. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7404. (* ---- ABS ----- *)
  7405. |Global.Abs:
  7406. Evaluate(p0,operand);
  7407. type := p0.type.resolved;
  7408. InitOperand(result,ModeValue);
  7409. Reuse1a(result.op,operand.op,dest);
  7410. Emit(Abs(position,result.op,operand.op));
  7411. ReleaseOperand(operand);
  7412. (* ---- WAIT ----- *)
  7413. |Global.Wait:
  7414. Evaluate(p0,operand);
  7415. Emit(Push(position,operand.op));
  7416. ReleaseOperand(operand);
  7417. CallThis(position,"Activities","Wait", 1);
  7418. (* ---- NEW ----- *)
  7419. |Global.New:
  7420. (*! the following code is only correct for "standard" Oberon calling convention *)
  7421. IF x.type # NIL THEN
  7422. type := x.type.resolved;
  7423. firstPar := 0;
  7424. ELSE
  7425. type := p0.type.resolved;
  7426. firstPar := 1;
  7427. END;
  7428. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7429. THEN
  7430. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7431. IF backend.cooperative THEN
  7432. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7433. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7434. IF recordType.isObject THEN
  7435. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7436. IF recordType.IsActive() THEN
  7437. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7438. END;
  7439. IF recordType.IsProtected() THEN
  7440. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7441. END;
  7442. ELSE
  7443. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7444. END;
  7445. END;
  7446. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7447. CallThis(position,"Runtime","New", 1);
  7448. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7449. Emit(Result(position, pointer));
  7450. exit := NewLabel();
  7451. BreqL(exit,pointer,nil);
  7452. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7453. GetRecordTypeName (recordType,name);
  7454. IF ~recordType.isObject THEN
  7455. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7456. END;
  7457. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7458. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7459. IF recordType.isObject THEN
  7460. IF recordType.IsProtected() THEN
  7461. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7462. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7463. END;
  7464. IF recordType.IsActive() THEN
  7465. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7466. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7467. END;
  7468. END;
  7469. END;
  7470. (* initialize fields *)
  7471. IF type(SyntaxTree.PointerType).isPlain THEN
  7472. size := 0;
  7473. ELSIF recordType.isObject THEN
  7474. size := BaseObjectTypeSize;
  7475. ELSE
  7476. size := BaseRecordTypeSize;
  7477. END;
  7478. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7479. (* call initializer *)
  7480. constructor := GetConstructor(recordType);
  7481. IF constructor # NIL THEN
  7482. (*! should be unified with ProcedureCallDesignator *)
  7483. Emit(Push(position,pointer));
  7484. ReleaseIntermediateOperand(pointer);
  7485. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7486. FOR i := firstPar TO x.parameters.Length()-1 DO
  7487. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7488. formalParameter := formalParameter.nextParameter;
  7489. END;
  7490. (* static call of the constructor *)
  7491. GetCodeSectionNameForSymbol(constructor,name);
  7492. ASSERT(~constructor.isInline);
  7493. IF constructor.scope.ownerModule # module.module THEN
  7494. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7495. ELSE
  7496. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7497. END;
  7498. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7499. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7500. Emit(Pop(position,pointer));
  7501. END;
  7502. (* call bodies *)
  7503. CallBodies(pointer,type);
  7504. SetLabel(exit);
  7505. needsTrace := p0.NeedsTrace();
  7506. IF needsTrace THEN ModifyAssignments(true) END;
  7507. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7508. Emit(Push(position, pointer));
  7509. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7510. Emit(Pop(position, pointer));
  7511. END;
  7512. Designate(p0,l);
  7513. IF needsTrace THEN
  7514. CallAssignPointer(l.op, pointer);
  7515. ELSE
  7516. ToMemory(l.op,addressType,0);
  7517. Emit(Mov(position,l.op,pointer));
  7518. END;
  7519. ReleaseIntermediateOperand(pointer);
  7520. ReleaseOperand(l);
  7521. IF needsTrace THEN ModifyAssignments(false) END;
  7522. ELSE (* not cooperative backend *)
  7523. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7524. IF temporaryVariable # NIL THEN
  7525. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7526. ELSE
  7527. Designate(p0,l);
  7528. END;
  7529. (* l.op contains address of pointer to record *)
  7530. Emit(Push(position,l.op)); (* address for use after syscall *)
  7531. Emit(Push(position,l.op));
  7532. ReleaseOperand(l);
  7533. (* push type descriptor *)
  7534. reg := TypeDescriptorAdr(recordType);
  7535. Emit(Push(position,reg));
  7536. ReleaseIntermediateOperand(reg);
  7537. (* push realtime flag *)
  7538. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7539. ELSE Emit(Push(position,false));
  7540. END;
  7541. CallThis(position,"Heaps","NewRec", 3);
  7542. (* check allocation success, if not successful then do not call initializers and bodies *)
  7543. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7544. Emit(Pop(position,pointer));
  7545. MakeMemory(reg,pointer,addressType,0);
  7546. ReleaseIntermediateOperand(pointer);
  7547. pointer := reg;
  7548. exit := NewLabel();
  7549. BreqL(exit,pointer,nil);
  7550. Emit(Push(position,pointer));
  7551. (* initialize fields *)
  7552. InitFields(recordType, pointer,0);
  7553. (* call initializer *)
  7554. constructor := GetConstructor(recordType);
  7555. IF constructor # NIL THEN
  7556. (*! should be unified with ProcedureCallDesignator *)
  7557. Emit(Push(position,pointer));
  7558. ReleaseIntermediateOperand(pointer);
  7559. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7560. FOR i := firstPar TO x.parameters.Length()-1 DO
  7561. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7562. formalParameter := formalParameter.nextParameter;
  7563. END;
  7564. (* static call of the constructor *)
  7565. GetCodeSectionNameForSymbol(constructor,name);
  7566. ASSERT(~constructor.isInline);
  7567. IF constructor.scope.ownerModule # module.module THEN
  7568. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7569. ELSE
  7570. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7571. END;
  7572. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7573. ELSE
  7574. ReleaseIntermediateOperand(pointer);
  7575. END;
  7576. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7577. Emit(Pop(position,pointer));
  7578. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7579. Designate(p0,l);
  7580. IF backend.writeBarriers & OnHeap(p0) THEN
  7581. SaveRegisters();ReleaseUsedRegisters(saved);
  7582. Emit(Push(position,l.op));
  7583. Emit(Push(position,pointer));
  7584. CallThis(position,"Heaps","Assign",2);
  7585. RestoreRegisters(saved);
  7586. ELSE
  7587. ToMemory(l.op,addressType,0);
  7588. Emit(Mov(position,l.op,pointer));
  7589. END;
  7590. ReleaseOperand(l);
  7591. result.tag := emptyOperand;
  7592. ELSIF (x.type # NIL) THEN
  7593. result := l; (* temporary variable is the result of NEW Type() *)
  7594. END;
  7595. (* call bodies *)
  7596. CallBodies(pointer,type);
  7597. ReleaseIntermediateOperand(pointer);
  7598. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7599. end := NewLabel();
  7600. BrL(end);
  7601. SetLabel(exit);
  7602. Designate(p0,l);
  7603. ToMemory(l.op,addressType,0);
  7604. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7605. ReleaseOperand(l);
  7606. SetLabel(end);
  7607. ELSE
  7608. SetLabel(exit);
  7609. END;
  7610. END;
  7611. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7612. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7613. IF ~backend.cooperative THEN (* simpler version *)
  7614. (*
  7615. push len0
  7616. push len1
  7617. push len2
  7618. push len_size
  7619. push len_adr
  7620. push tag
  7621. push static elements
  7622. push element size
  7623. push adr
  7624. *)
  7625. dim := 0;
  7626. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7627. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7628. parameter := x.parameters.GetExpression(i);
  7629. Evaluate(parameter,r);
  7630. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7631. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7632. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7633. END;
  7634. Emit(Push(position,r.op));
  7635. ReleaseOperand(r);
  7636. INC(dim);
  7637. END;
  7638. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7639. Emit(Mov(position, adr, sp));
  7640. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7641. Emit(Push(position, adr));
  7642. ReleaseIntermediateOperand(adr);
  7643. openDim := dim;
  7644. staticLength := 1;
  7645. IF type IS SyntaxTree.ArrayType THEN
  7646. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7647. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7648. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7649. END;
  7650. END;
  7651. IF SemanticChecker.ContainsPointer(type) THEN
  7652. tmp := TypeDescriptorAdr(type);
  7653. ELSE
  7654. tmp := nil;
  7655. END;
  7656. Emit(Push(position,tmp)); (* type descriptor *)
  7657. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7658. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7659. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7660. Designate(p0,l);
  7661. Emit(Push(position,l.op)); (* address *)
  7662. ReleaseOperand(l);
  7663. CallThis(position,"Heaps","NewArray", 6);
  7664. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7665. Emit(Add(position,sp,sp,tmp));
  7666. ELSE
  7667. dim := 0;
  7668. IntermediateCode.InitOperand(reg);
  7669. IF p1 # NIL THEN
  7670. FOR i := firstPar TO x.parameters.Length()-1 DO
  7671. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7672. parameter := x.parameters.GetExpression(i);
  7673. Evaluate(parameter,r);
  7674. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7675. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7676. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7677. END;
  7678. Emit(Push(position,r.op));
  7679. IF i=1 THEN
  7680. CopyInt(reg,r.op);
  7681. ELSE
  7682. MulInt(reg, reg, r.op);
  7683. END;
  7684. ReleaseOperand(r);
  7685. INC(dim);
  7686. END;
  7687. Convert(reg,addressType);
  7688. ELSE
  7689. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7690. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7691. END;
  7692. openDim := dim;
  7693. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7694. IF backend.cooperative THEN
  7695. size := ToMemoryUnits(system,system.SizeOf(type));
  7696. WHILE type IS SyntaxTree.ArrayType DO
  7697. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7698. END;
  7699. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7700. IF (size # 1) THEN
  7701. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7702. END;
  7703. Emit(Push(position,reg));
  7704. size := ToMemoryUnits(system,system.SizeOf(type));
  7705. IF (size # 1) THEN
  7706. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7707. END;
  7708. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7709. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7710. Emit(Push(position,reg));
  7711. ReleaseIntermediateOperand(reg);
  7712. CallThis(position,"Runtime","New", 1);
  7713. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7714. Emit(Result(position, pointer));
  7715. exit := NewLabel();
  7716. else := NewLabel();
  7717. BreqL(else,pointer,nil);
  7718. IF ~type.hasPointers THEN
  7719. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7720. ELSIF type IS SyntaxTree.RecordType THEN
  7721. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7722. ELSIF type IS SyntaxTree.ProcedureType THEN
  7723. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7724. ELSE
  7725. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7726. END;
  7727. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7728. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7729. 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))));
  7730. IF type IS SyntaxTree.RecordType THEN
  7731. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7732. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7733. ELSE
  7734. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7735. END;
  7736. i := openDim;
  7737. WHILE i > 0 DO
  7738. DEC (i);
  7739. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7740. END;
  7741. needsTrace := p0.NeedsTrace();
  7742. IF needsTrace THEN ModifyAssignments(true) END;
  7743. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7744. Emit(Push(position, pointer));
  7745. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7746. Emit(Pop(position, pointer));
  7747. END;
  7748. Designate(p0,l);
  7749. IF needsTrace THEN
  7750. CallAssignPointer(l.op, pointer);
  7751. ModifyAssignments(false);
  7752. ELSE
  7753. ToMemory(l.op,addressType,0);
  7754. Emit(Mov(position,l.op,pointer));
  7755. END;
  7756. ReleaseIntermediateOperand(pointer);
  7757. ReleaseOperand(l);
  7758. BrL(exit);
  7759. SetLabel(else);
  7760. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7761. Designate(p0,l);
  7762. IF needsTrace THEN
  7763. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7764. ELSE
  7765. ToMemory(l.op,addressType,0);
  7766. Emit(Mov(position,l.op,pointer));
  7767. END;
  7768. ReleaseOperand(l);
  7769. SetLabel(exit);
  7770. ELSE
  7771. (*! the following code is only correct for "standard" Oberon calling convention *)
  7772. IF SemanticChecker.ContainsPointer(type) THEN
  7773. IF type IS SyntaxTree.ArrayType THEN
  7774. staticLength := 1;
  7775. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7776. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7777. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7778. END;
  7779. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7780. MulInt(reg,reg,tmp);
  7781. END;
  7782. Designate(p0,l);
  7783. IF openDim > 0 THEN
  7784. Emit(Push(position,l.op)); (* address for use after syscall *)
  7785. END;
  7786. Emit(Push(position,l.op)); (* address *)
  7787. ReleaseOperand(l);
  7788. tmp := TypeDescriptorAdr(type);
  7789. Emit(Push(position,tmp)); (* type descriptor *)
  7790. ReleaseIntermediateOperand(tmp);
  7791. Emit(Push(position,reg)); (* number Elements *)
  7792. ReleaseIntermediateOperand(reg);
  7793. tmp := IntermediateCode.Immediate(addressType,dim);
  7794. Emit(Push(position,tmp)); (* dimensions *)
  7795. (* push realtime flag *)
  7796. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7797. ELSE Emit(Push(position,false));
  7798. END;
  7799. CallThis(position,"Heaps","NewArr",5)
  7800. ELSE
  7801. size := ToMemoryUnits(system,system.SizeOf(type));
  7802. IF (size # 1) THEN
  7803. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7804. (*
  7805. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7806. *)
  7807. END;
  7808. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7809. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7810. AddInt(reg, reg, tmp);
  7811. (*
  7812. Emit(Add(position,reg,reg,tmp));
  7813. *)
  7814. Designate(p0,l);
  7815. IF openDim >0 THEN
  7816. Emit(Push(position,l.op)); (* address for use after syscall *)
  7817. END;
  7818. Emit(Push(position,l.op)); (* address for syscall *)
  7819. ReleaseOperand(l); (* pointer address *)
  7820. Emit(Push(position,reg)); (* size *)
  7821. ReleaseIntermediateOperand(reg);
  7822. (* push realtime flag *)
  7823. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7824. ELSE Emit(Push(position,false));
  7825. END;
  7826. CallThis(position,"Heaps","NewSys", 3)
  7827. END;
  7828. IF openDim > 0 THEN
  7829. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7830. Emit(Pop(position,adr));
  7831. ToMemory(adr,addressType,0);
  7832. ReuseCopy(tmp,adr);
  7833. ReleaseIntermediateOperand(adr);
  7834. adr := tmp;
  7835. else := NewLabel();
  7836. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7837. i := openDim-1;
  7838. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7839. WHILE (i >= 0) DO
  7840. Emit(Pop(position,reg));
  7841. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7842. Emit(Mov(position,res,reg));
  7843. DEC(i);
  7844. END;
  7845. ReleaseIntermediateOperand(adr);
  7846. ReleaseIntermediateOperand(reg);
  7847. exit := NewLabel();
  7848. BrL(exit);
  7849. SetLabel(else);
  7850. (* else part: array could not be allocated *)
  7851. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7852. Emit(Add(position,sp,sp,tmp));
  7853. SetLabel(exit);
  7854. END;
  7855. END;
  7856. END;
  7857. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7858. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7859. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7860. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7861. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7862. callingConvention := procedureType.callingConvention;
  7863. left.SetType(procedure.type);
  7864. formalParameter := procedureType.firstParameter;
  7865. (* push array to allocate *)
  7866. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7867. formalParameter :=formalParameter.nextParameter;
  7868. (* push length array *)
  7869. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7870. (* push size *)
  7871. type := t0;
  7872. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7873. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7874. END;
  7875. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7876. Emit(Push(position,tmp));
  7877. (* *)
  7878. IF SemanticChecker.ContainsPointer(type) THEN
  7879. tmp := TypeDescriptorAdr(type);
  7880. ELSE
  7881. tmp := IntermediateCode.Immediate(addressType, 0);
  7882. END;
  7883. Emit(Push(position,tmp)); (* type descriptor *)
  7884. StaticCallOperand(result,procedure);
  7885. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7886. ReleaseOperand(result);
  7887. END;
  7888. (*
  7889. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7890. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7891. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7892. *)
  7893. ELSE
  7894. (*
  7895. push len0
  7896. push len1
  7897. push len2
  7898. push size
  7899. push len_adr
  7900. push element_size
  7901. push tag
  7902. push adr
  7903. *)
  7904. dim := 0;
  7905. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7906. isTensor := TRUE;
  7907. ELSE
  7908. isTensor := FALSE;
  7909. END;
  7910. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7911. IF ~isTensor THEN
  7912. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7913. END;
  7914. parameter := x.parameters.GetExpression(i);
  7915. Evaluate(parameter,r);
  7916. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7917. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7918. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7919. END;
  7920. Emit(Push(position,r.op));
  7921. ReleaseOperand(r);
  7922. INC(dim);
  7923. END;
  7924. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7925. Emit(Mov(position, adr, sp));
  7926. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7927. Emit(Push(position, adr));
  7928. ReleaseIntermediateOperand(adr);
  7929. openDim := dim;
  7930. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7931. IF isTensor THEN
  7932. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7933. ELSE
  7934. baseType := SemanticChecker.ArrayBase(type,openDim);
  7935. END;
  7936. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7937. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7938. IF SemanticChecker.ContainsPointer(baseType) THEN
  7939. tmp := TypeDescriptorAdr(baseType);
  7940. ELSE
  7941. tmp := nil;
  7942. END;
  7943. Emit(Push(position,tmp)); (* type descriptor *)
  7944. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7945. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7946. ELSE (* error message has already been emited *)
  7947. RETURN;
  7948. END;
  7949. Designate(p0,l);
  7950. IF isTensor THEN
  7951. Emit(Push(position,l.op)); (* address *)
  7952. ELSE
  7953. Emit(Push(position,l.tag)); (* address *)
  7954. END;
  7955. ReleaseOperand(l);
  7956. StaticCallOperand(result,procedure);
  7957. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7958. ReleaseOperand(result);
  7959. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7960. Emit(Add(position,sp,sp,tmp));
  7961. END;
  7962. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7963. THEN
  7964. IF ~backend.cellsAreObjects THEN RETURN END;
  7965. IF InCellScope(currentScope) THEN
  7966. PushSelfPointer()
  7967. ELSE
  7968. Emit(Push(position, nil));
  7969. END;
  7970. (* push temp address *)
  7971. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7972. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7973. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7974. (* l.op contains address of pointer to record *)
  7975. Emit(Push(position,l.op)); (* address for use after syscall *)
  7976. ReleaseOperand(l);
  7977. (* push type descriptor *)
  7978. reg := TypeDescriptorAdr(baseType);
  7979. Emit(Push(position,reg));
  7980. ReleaseIntermediateOperand(reg);
  7981. (* push name *)
  7982. (*Global.GetSymbolName(p0, n);*)
  7983. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7984. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7985. ELSE
  7986. Global.GetModuleName(module.module, n);
  7987. END;
  7988. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7989. (*type.typeDeclaration.GetName(n);*)
  7990. PushConstString(n);
  7991. (* push cellnet boolean *)
  7992. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7993. (* push engine boolean *)
  7994. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7995. (* allocate *)
  7996. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7997. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7998. (* l.op contains address of pointer to record *)
  7999. ToMemory(l.op,addressType,0);
  8000. (* l.op contains value of pointer to record *)
  8001. InitFields(baseType, l.op,0);
  8002. (* add capabilities *)
  8003. modifier := p0(SyntaxTree.Designator).modifiers;
  8004. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8005. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8006. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8007. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8008. END;
  8009. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8010. (*
  8011. modifier := baseType(SyntaxTree.CellType).modifiers;
  8012. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8013. modifier := p0(SyntaxTree.Designator).modifiers;
  8014. *)
  8015. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8016. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8017. (* l.op contains address of pointer to record *)
  8018. ToMemory(l.op,addressType,0);
  8019. (* l.op contains value of pointer to record *)
  8020. Emit(Push(position,l.op)); (* address for use after syscall *)
  8021. ReleaseOperand(l);
  8022. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8023. prevScope := currentScope;
  8024. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8025. previous := section;
  8026. section := init;
  8027. (* add ports *)
  8028. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8029. CloseInitializer(previous);
  8030. currentScope := prevScope;
  8031. Symbol(temporaryVariable,l);
  8032. ToMemory(l.op,addressType,0);
  8033. Emit(Push(position,l.op));
  8034. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8035. (*
  8036. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8037. IF constructor # NIL THEN
  8038. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8039. FOR i := 1 TO x.parameters.Length()-1 DO
  8040. p := x.parameters.GetExpression(i);
  8041. Global.GetSymbolName(parameter,name);
  8042. Evaluate(p, value);
  8043. ASSERT(value.type # NIL);
  8044. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8045. par := instance.AddParameter(name);
  8046. par.SetInteger(value.integer);
  8047. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8048. par := instance.AddParameter(name);
  8049. par.SetBoolean(value.boolean);
  8050. ELSE Error(x.position,NotYetImplemented)
  8051. END;
  8052. parameter := parameter.nextParameter
  8053. END;
  8054. END;
  8055. *)
  8056. (* call initializer *)
  8057. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8058. IF constructor # NIL THEN
  8059. (*! should be unified with ProcedureCallDesignator *)
  8060. IF backend.cellsAreObjects THEN
  8061. Symbol(temporaryVariable,l);
  8062. ToMemory(l.op,addressType,0);
  8063. Emit(Push(position,l.op));
  8064. ReleaseOperand(l);
  8065. END;
  8066. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8067. FOR i := firstPar TO x.parameters.Length()-1 DO
  8068. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8069. formalParameter := formalParameter.nextParameter;
  8070. END;
  8071. (* static call of the constructor *)
  8072. Global.GetSymbolSegmentedName(constructor,name);
  8073. ASSERT(~constructor.isInline);
  8074. IF constructor.scope.ownerModule # module.module THEN
  8075. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8076. ELSE
  8077. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8078. END;
  8079. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8080. (*ELSE
  8081. ReleaseIntermediateOperand(pointer);*)
  8082. END;
  8083. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8084. ToMemory(l.op, addressType, 0);
  8085. Designate(p0,s0);
  8086. ToMemory(s0.op,addressType,0);
  8087. Emit(Mov(position,s0.op,l.op));
  8088. ReleaseOperand(l);
  8089. ReleaseOperand(s0);
  8090. result.tag := emptyOperand;
  8091. (* start *)
  8092. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8093. (* push cell *)
  8094. Symbol(temporaryVariable, l);
  8095. ToMemory(l.op,addressType,0);
  8096. Emit(Push(Basic.invalidPosition,l.op));
  8097. (* push delegate *)
  8098. Emit(Push(Basic.invalidPosition,l.op));
  8099. ReleaseOperand(l);
  8100. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8101. Emit(Push(position, s1.op));
  8102. ReleaseOperand(s1);
  8103. CallThis(position,"ActiveCellsRuntime","Start",3);
  8104. END;
  8105. (*IF temporaryVariable # NIL THEN
  8106. end := NewLabel();
  8107. BrL(end);
  8108. SetLabel(exit);
  8109. Designate(p0,l);
  8110. ToMemory(l.op,addressType,0);
  8111. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8112. ReleaseOperand(l);
  8113. SetLabel(end);
  8114. ELSE
  8115. SetLabel(exit);
  8116. END;
  8117. *)
  8118. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8119. ELSE (* no pointer to record, no pointer to array *)
  8120. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8121. (* ignore new statement *)
  8122. Warning(p0.position, "cannot run on final hardware");
  8123. ELSE
  8124. HALT(200);
  8125. END;
  8126. END;
  8127. (* ---- ADDRESSOF----- *)
  8128. |Global.systemAdr:
  8129. Designate(p0,s0);
  8130. s0.mode := ModeValue;
  8131. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8132. ReleaseIntermediateOperand(s0.op);
  8133. s0.op := s0.tag;
  8134. IntermediateCode.InitOperand(s0.tag);
  8135. END;
  8136. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8137. result := s0;
  8138. (* ---- BIT ----- *)
  8139. |Global.systemBit:
  8140. Evaluate(p0,s0);
  8141. ToMemory(s0.op,addressType,0);
  8142. ReuseCopy(res,s0.op);
  8143. ReleaseOperand(s0);
  8144. Evaluate(p1,s1);
  8145. Emit(Ror(position,res,res,s1.op));
  8146. ReleaseOperand(s1);
  8147. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8148. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8149. IF ~conditional THEN
  8150. InitOperand(result,ModeValue); result.op := res;
  8151. ELSE
  8152. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8153. BrL(falseLabel);
  8154. ReleaseIntermediateOperand(res);
  8155. END;
  8156. (* --- MSK ----*)
  8157. |Global.systemMsk:
  8158. Evaluate(p0,s0);
  8159. Evaluate(p1,s1);
  8160. ReuseCopy(res,s0.op);
  8161. ReleaseOperand(s0);
  8162. Emit(And(position,res,res,s1.op));
  8163. ReleaseOperand(s1);
  8164. InitOperand(result,ModeValue);
  8165. result.op := res;
  8166. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8167. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8168. Evaluate(p0,s0);
  8169. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8170. ReleaseOperand(s0);
  8171. InitOperand(result,ModeValue);
  8172. result.op := res;
  8173. (* ---- SYSTEM.GetStackPointer ----- *)
  8174. |Global.systemGetStackPointer:
  8175. InitOperand(result,ModeValue);
  8176. result.op := sp;
  8177. (* ---- SYSTEM.GetFramePointer ----- *)
  8178. |Global.systemGetFramePointer:
  8179. InitOperand(result,ModeValue);
  8180. result.op := fp;
  8181. (* ---- SYSTEM.GetActivity ----- *)
  8182. |Global.systemGetActivity:
  8183. ASSERT(backend.cooperative);
  8184. InitOperand(result,ModeValue);
  8185. result.op := ap;
  8186. (* ---- SYSTEM.SetStackPointer ----- *)
  8187. |Global.systemSetStackPointer:
  8188. Evaluate(p0,s0); (* *)
  8189. Emit(Mov(position,sp,s0.op));
  8190. ReleaseOperand(s0);
  8191. (* ---- SYSTEM.SetFramePointer ----- *)
  8192. |Global.systemSetFramePointer:
  8193. Evaluate(p0,s0); (* *)
  8194. Emit(Mov(position,fp,s0.op));
  8195. ReleaseOperand(s0);
  8196. (* ---- SYSTEM.Activity ----- *)
  8197. |Global.systemSetActivity:
  8198. ASSERT(backend.cooperative);
  8199. Evaluate(p0,s0); (* *)
  8200. Emit(Mov(position,ap,s0.op));
  8201. ReleaseOperand(s0);
  8202. (* ---- SYSTEM.VAL ----- *)
  8203. |Global.systemVal:
  8204. Expression(p1);
  8205. s1 := result;
  8206. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8207. IF s1.mode = ModeReference THEN
  8208. (* nothing to be done if not record type, just take over new type *)
  8209. IF (type IS SyntaxTree.RecordType) THEN
  8210. ReleaseIntermediateOperand(s1.tag);
  8211. s1.tag := TypeDescriptorAdr(type);
  8212. UseIntermediateOperand(s1.tag);
  8213. END;
  8214. result := s1;
  8215. ELSE (* copy over result to different type, may not use convert *)
  8216. itype := IntermediateCode.GetType(system,type);
  8217. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8218. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8219. Emit(Mov(position,s0.op,s1.op));
  8220. ReleaseOperand(s1);
  8221. InitOperand(result,ModeValue);
  8222. result.op := s0.op;
  8223. ELSE (* different size, must convert *)
  8224. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8225. Convert(s1.op, IntermediateCode.GetType(system,type));
  8226. result := s1;
  8227. END;
  8228. END;
  8229. (* ---- SYSTEM.GET ----- *)
  8230. |Global.systemGet:
  8231. Evaluate(p0,s0); (* adr *)
  8232. Designate(p1,s1); (* variable *)
  8233. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8234. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8235. Emit(Mov(position,s1.op,s0.op));
  8236. ReleaseOperand(s1);
  8237. ReleaseOperand(s0);
  8238. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8239. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8240. Evaluate(p0,s0); (* *)
  8241. Evaluate(p1,s1); (* variable *)
  8242. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8243. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8244. (* real part *)
  8245. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8246. Emit(Mov(position,res, s1.op));
  8247. ReleaseIntermediateOperand(res);
  8248. (* imaginary part *)
  8249. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8250. Emit(Mov(position,res, s1.tag));
  8251. ReleaseIntermediateOperand(res);
  8252. ReleaseOperand(s1);
  8253. ReleaseOperand(s0);
  8254. ELSE
  8255. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8256. ReleaseOperand(s0);
  8257. Emit(Mov(position,res,s1.op));
  8258. ReleaseIntermediateOperand(res);
  8259. ReleaseOperand(s1);
  8260. END;
  8261. (* ---- SYSTEM.MOVE ----- *)
  8262. |Global.systemMove:
  8263. Evaluate(p0,s0);
  8264. Evaluate(p1,s1);
  8265. Evaluate(p2,s2);
  8266. Emit(Copy(position,s1.op,s0.op,s2.op));
  8267. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8268. (* ---- SYSTEM.NEW ----- *)
  8269. |Global.systemNew:
  8270. Designate(p0,s0);
  8271. Emit(Push(position,s0.op));
  8272. ReleaseOperand(s0);
  8273. Evaluate(p1,s1);
  8274. Emit(Push(position,s1.op));
  8275. ReleaseOperand(s1);
  8276. (* push realtime flag: false by default *)
  8277. Emit(Push(position,false));
  8278. CallThis(position,"Heaps","NewSys",3);
  8279. (* ---- SYSTEM.CALL ----- *)
  8280. |Global.systemRef:
  8281. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8282. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8283. s0.mode := ModeValue;
  8284. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8285. result := s0
  8286. (* ---- INCR ----- *)
  8287. |Global.Incr:
  8288. Designate(p0,operand);
  8289. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8290. Dereference(operand,p0.type.resolved,FALSE);
  8291. END;
  8292. ASSERT(p1 # NIL);
  8293. Evaluate(p1,l);
  8294. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8295. ReleaseOperand(operand); ReleaseOperand(l);
  8296. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8297. (* ---- SUM ----- *)
  8298. |Global.Sum: HALT(200);
  8299. (* ---- ALL ----- *)
  8300. |Global.All: HALT(200);
  8301. (* ---- CAS ----- *)
  8302. |Global.Cas:
  8303. needsTrace := p0.NeedsTrace();
  8304. IF needsTrace THEN ModifyAssignments(true) END;
  8305. Designate(p0,s0);
  8306. Evaluate(p1,s1);
  8307. Evaluate(p2,s2);
  8308. IF needsTrace THEN
  8309. Emit(Push(position, s0.op));
  8310. Emit(Push(position, s1.op));
  8311. Emit(Push(position, s2.op));
  8312. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8313. ELSE
  8314. Emit(Cas(position,s0.op,s1.op,s2.op));
  8315. END;
  8316. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8317. IF needsTrace THEN ModifyAssignments(false) END;
  8318. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8319. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8320. IF conditional THEN
  8321. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8322. BrL(falseLabel);
  8323. ReleaseIntermediateOperand(res);
  8324. END;
  8325. (* ---- DIM ----- *)
  8326. |Global.Dim:
  8327. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8328. Designate(p0,s0);
  8329. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8330. Dereference(s0,p0.type.resolved,FALSE);
  8331. END;
  8332. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8333. ReleaseOperand(s0);
  8334. (* ---- RESHAPE ----- *)
  8335. |Global.Reshape:
  8336. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8337. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8338. left.SetType(procedure.type);
  8339. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8340. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8341. END;
  8342. (* ---- SYSTEM.TYPECODE ----- *)
  8343. |Global.systemTypeCode:
  8344. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8345. IF type.resolved IS SyntaxTree.PointerType THEN
  8346. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8347. END;
  8348. result.op := TypeDescriptorAdr(type);
  8349. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8350. result.mode := ModeValue;
  8351. (* ---- SYSTEM.TRACE ----- *)
  8352. |Global.systemTrace:
  8353. SystemTrace(x.parameters, x.position);
  8354. (* ----- CONNECT ------*)
  8355. |Global.Connect:
  8356. IF backend.cellsAreObjects THEN
  8357. PushPort(p0);
  8358. PushPort(p1);
  8359. IF p2 # NIL THEN
  8360. Evaluate(p2, s2);
  8361. Emit(Push(p2.position, s2.op));
  8362. ReleaseOperand(s2);
  8363. ELSE
  8364. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8365. END;
  8366. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8367. ELSE
  8368. Warning(x.position, "cannot run on final hardware");
  8369. END;
  8370. (* ----- DELEGATE ------*)
  8371. |Global.Delegate:
  8372. IF backend.cellsAreObjects THEN
  8373. PushPort(p0);
  8374. PushPort(p1);
  8375. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8376. ELSE
  8377. Warning(x.position, "cannot run on final hardware");
  8378. END;
  8379. (* ----- SEND ------*)
  8380. |Global.Send:
  8381. Evaluate(p0,s0);
  8382. Evaluate(p1,s1);
  8383. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8384. Emit(Push(position,s0.op));
  8385. Emit(Push(position,s1.op));
  8386. (*
  8387. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8388. *)
  8389. IF ~backend.cellsAreObjects THEN
  8390. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8391. END;
  8392. ReleaseOperand(s0);
  8393. ReleaseOperand(s1);
  8394. IF backend.cellsAreObjects THEN
  8395. CallThis(position,"ActiveCellsRuntime","Send",2);
  8396. ELSE
  8397. CallThis(position,ChannelModuleName,"Send",2);
  8398. END;
  8399. (* ----- RECEIVE ------*)
  8400. |Global.Receive:
  8401. Evaluate(p0,s0);
  8402. Emit(Push(position,s0.op));
  8403. Designate(p1,s1);
  8404. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8405. Emit(Push(position,s1.op));
  8406. IF p2 # NIL THEN
  8407. Designate(p2,s2);
  8408. Emit(Push(position,s2.op));
  8409. END;
  8410. (*
  8411. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8412. *)
  8413. IF ~backend.cellsAreObjects THEN
  8414. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8415. END;
  8416. ReleaseOperand(s0);
  8417. ReleaseOperand(s1);
  8418. ReleaseOperand(s2);
  8419. IF backend.cellsAreObjects THEN
  8420. IF p2 = NIL THEN
  8421. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8422. ELSE
  8423. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8424. END;
  8425. ELSE
  8426. IF p2 = NIL THEN
  8427. CallThis(position,ChannelModuleName,"Receive",2)
  8428. ELSE
  8429. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8430. END;
  8431. END;
  8432. | Global.systemSpecial:
  8433. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8434. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8435. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8436. (* determine if parameters are of the VAR kind *)
  8437. ASSERT(x.parameters.Length() <= 3);
  8438. formalParameter := procedureType.firstParameter;
  8439. FOR i := 0 TO x.parameters.Length() - 1 DO
  8440. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8441. formalParameter := formalParameter.nextParameter
  8442. END;
  8443. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8444. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8445. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8446. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8447. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8448. IF procedureType.returnType # NIL THEN
  8449. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8450. Emit(Result(position, res));
  8451. (*InitOperand(result,ModeValue);
  8452. result.op := res;
  8453. *)
  8454. IF ~conditional THEN
  8455. InitOperand(result,ModeValue); result.op := res;
  8456. ELSE
  8457. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8458. BrL(falseLabel);
  8459. ReleaseIntermediateOperand(res);
  8460. END;
  8461. END
  8462. ELSE (* function not yet implemented *)
  8463. Error(position,"not yet implemented");
  8464. END;
  8465. destination := dest;
  8466. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8467. END VisitBuiltinCallDesignator;
  8468. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8469. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8470. BEGIN
  8471. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8472. dest := destination; destination := emptyOperand;
  8473. Expression(x.left);
  8474. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8475. ELSIF isUnchecked THEN (* no check *)
  8476. ELSE
  8477. trueL := NewLabel();
  8478. falseL := NewLabel();
  8479. IF IsPointerToRecord(x.left.type,recordType) THEN
  8480. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8481. Emit(Mov(position,tag, result.op));
  8482. IF result.mode # ModeValue THEN
  8483. ptr := tag;
  8484. IntermediateCode.MakeMemory(ptr,addressType);
  8485. Emit(Mov(position,tag, ptr));
  8486. END;
  8487. IF ~backend.cooperative THEN
  8488. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8489. END;
  8490. IntermediateCode.MakeMemory(tag,addressType);
  8491. ELSE
  8492. tag := result.tag;
  8493. UseIntermediateOperand(tag);
  8494. END;
  8495. TypeTest(tag,x.type,trueL,falseL);
  8496. ReleaseIntermediateOperand(tag);
  8497. SetLabel(falseL);
  8498. EmitTrap(position,TypeCheckTrap);
  8499. SetLabel(trueL);
  8500. END;
  8501. destination := dest;
  8502. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8503. END VisitTypeGuardDesignator;
  8504. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8505. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8506. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8507. VAR label: Label; pc: LONGINT;
  8508. BEGIN
  8509. IF backend.cooperative & ~isUnchecked THEN
  8510. pc := section.pc;
  8511. label := NewLabel();
  8512. BrneL(label, operand.op, nil);
  8513. EmitTrap(position, NilPointerTrap);
  8514. SetLabel(label);
  8515. INC(statCoopNilCheck, section.pc - pc);
  8516. END;
  8517. END NilCheck;
  8518. BEGIN
  8519. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8520. ReuseCopy(dereferenced,operand.op);
  8521. ReleaseOperand(operand);
  8522. operand.mode := ModeReference;
  8523. operand.op := dereferenced;
  8524. operand.tag := dereferenced;
  8525. UseIntermediateOperand(operand.tag);
  8526. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8527. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8528. ReleaseIntermediateOperand(operand.tag);
  8529. operand.tag := TypeDescriptorAdr(type);
  8530. ELSE
  8531. IF ~backend.cooperative THEN
  8532. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8533. END;
  8534. IntermediateCode.MakeMemory(operand.tag,addressType);
  8535. END;
  8536. NilCheck(operand.op);
  8537. ELSIF type IS SyntaxTree.ArrayType THEN
  8538. IF isUnsafe THEN
  8539. NilCheck(operand.op);
  8540. ReleaseIntermediateOperand(operand.tag);
  8541. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8542. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8543. ELSE
  8544. operand.tag := emptyOperand;
  8545. END;
  8546. ELSE
  8547. NilCheck(operand.op);
  8548. IF backend.cooperative THEN
  8549. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8550. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8551. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8552. ELSE
  8553. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8554. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8555. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8556. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8557. END;
  8558. END;
  8559. ELSIF type IS SyntaxTree.MathArrayType THEN
  8560. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8561. IntermediateCode.MakeMemory(operand.op,addressType);
  8562. ELSE HALT(100);
  8563. END;
  8564. END Dereference;
  8565. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8566. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8567. BEGIN
  8568. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8569. dest := destination; destination := emptyOperand;
  8570. Evaluate(x.left,d);
  8571. type := x.type.resolved;
  8572. prevIsUnchecked := isUnchecked;
  8573. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8574. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8575. END;
  8576. Dereference(d,type,IsUnsafePointer(x.left.type));
  8577. isUnchecked := prevIsUnchecked;
  8578. result := d;
  8579. 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
  8580. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8581. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8582. END;
  8583. END;
  8584. destination := dest;
  8585. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8586. END VisitDereferenceDesignator;
  8587. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8588. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8589. BEGIN
  8590. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8591. dest := destination; destination := emptyOperand;
  8592. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8593. tag := result.op;
  8594. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8595. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8596. StaticCallOperand(result,procedure.super);
  8597. ReleaseIntermediateOperand(result.tag);
  8598. UseIntermediateOperand(tag); (* necessary ? *)
  8599. result.tag := tag;
  8600. destination := dest;
  8601. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8602. END VisitSupercallDesignator;
  8603. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8604. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8605. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8606. name: Basic.SegmentedName;
  8607. procedure: SyntaxTree.Procedure;
  8608. procedureType: SyntaxTree.ProcedureType;
  8609. BEGIN
  8610. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8611. dest := destination; destination := emptyOperand;
  8612. scope := currentScope;
  8613. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8614. scope := scope.outerScope;
  8615. END;
  8616. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8617. moduleSection := meta.ModuleSection();
  8618. IF backend.cooperative THEN
  8619. moduleOffset := 0;
  8620. ELSE
  8621. moduleOffset := moduleSection.pc;
  8622. END;
  8623. result.mode := ModeValue;
  8624. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8625. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8626. result.mode := ModeValue;
  8627. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8628. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8629. ELSE
  8630. GetBaseRegister(basereg,currentScope,scope);
  8631. InitOperand(result,ModeReference);
  8632. result.op := basereg;
  8633. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8634. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8635. parametersSize := ProcParametersSize(procedure);
  8636. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8637. IF backend.cooperative THEN
  8638. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8639. END;
  8640. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8641. MakeMemory(result.op, result.op, addressType, 0);
  8642. END;
  8643. (* tag must be loaded when dereferencing SELF pointer *)
  8644. END;
  8645. destination := dest;
  8646. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8647. END VisitSelfDesignator;
  8648. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8649. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8650. BEGIN
  8651. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8652. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8653. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8654. parameter := procedureType.returnParameter;
  8655. IF currentIsInline THEN
  8656. map := currentMapper.Get(NIL);
  8657. IF map # NIL THEN
  8658. Designate(map.to, result);
  8659. ELSE
  8660. HALT(200);
  8661. END;
  8662. RETURN;
  8663. END;
  8664. VisitParameter(parameter);
  8665. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8666. END VisitResultDesignator;
  8667. (** values *)
  8668. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8669. BEGIN
  8670. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8671. IF conditional THEN
  8672. IF x.value THEN BrL(trueLabel)
  8673. ELSE BrL(falseLabel)
  8674. END;
  8675. ELSE
  8676. InitOperand(result,ModeValue);
  8677. IF x.value THEN result.op := true ELSE result.op := false END;
  8678. END;
  8679. END VisitBooleanValue;
  8680. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8681. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8682. BEGIN
  8683. Global.GetModuleSegmentedName(module.module, name);
  8684. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8685. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8686. RETURN section
  8687. END GetDataSection;
  8688. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8689. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8690. BEGIN
  8691. type := vop.type;
  8692. data := GetDataSection();
  8693. pc := EnterImmediate(data,vop);
  8694. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8695. IntermediateCode.MakeMemory(vop, type);
  8696. END GetImmediateMem;
  8697. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8698. BEGIN
  8699. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8700. InitOperand(result,ModeValue);
  8701. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8702. IF ~supportedImmediate(result.op) &~inData THEN
  8703. GetImmediateMem(result.op)
  8704. END;
  8705. END VisitIntegerValue;
  8706. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8707. BEGIN
  8708. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8709. InitOperand(result,ModeValue);
  8710. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8711. END VisitCharacterValue;
  8712. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8713. BEGIN
  8714. IF Trace THEN TraceEnter("VisitSetValue") END;
  8715. InitOperand(result,ModeValue);
  8716. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8717. END VisitSetValue;
  8718. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8719. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8720. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8721. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8722. BEGIN
  8723. numberElements := x.elements.Length();
  8724. FOR i := 0 TO numberElements-1 DO
  8725. expression := x.elements.GetExpression(i);
  8726. IF expression IS SyntaxTree.MathArrayExpression THEN
  8727. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8728. ELSE
  8729. inData := TRUE;
  8730. Evaluate(expression,op);
  8731. irv.Emit(Data(position,op.op));
  8732. inData := FALSE;
  8733. ReleaseOperand(op);
  8734. END;
  8735. END;
  8736. END RecursiveData;
  8737. BEGIN
  8738. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8739. IF ~TryConstantDeclaration() THEN
  8740. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8741. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8742. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8743. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8744. ELSE
  8745. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8746. END;
  8747. RecursiveData(x.array);
  8748. InitOperand(result,ModeReference);
  8749. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8750. END
  8751. END VisitMathArrayValue;
  8752. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8753. VAR constant: Sections.Section;
  8754. BEGIN
  8755. IF constantDeclaration = NIL THEN
  8756. RETURN FALSE
  8757. ELSE
  8758. (* Is a constant in this module: did we generate it already? *)
  8759. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8760. IF constant # NIL THEN
  8761. InitOperand(result,ModeReference);
  8762. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8763. RETURN TRUE;
  8764. END;
  8765. END;
  8766. RETURN FALSE
  8767. END TryConstantDeclaration;
  8768. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8769. BEGIN
  8770. constantDeclaration := x;
  8771. x.value.resolved.Accept(SELF);
  8772. END VisitConstant;
  8773. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8774. BEGIN
  8775. IF Trace THEN TraceEnter("VisitRealValue") END;
  8776. InitOperand(result,ModeValue);
  8777. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8778. END VisitRealValue;
  8779. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8780. VAR
  8781. componentType: SyntaxTree.Type;
  8782. BEGIN
  8783. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8784. ASSERT(x.type IS SyntaxTree.ComplexType);
  8785. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8786. InitOperand(result,ModeValue);
  8787. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8788. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8789. END VisitComplexValue;
  8790. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8791. VAR i: LONGINT; name: Basic.SegmentedName;
  8792. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8793. BEGIN
  8794. IF Trace THEN TraceEnter("VisitStringValue") END;
  8795. IF ~TryConstantDeclaration() THEN
  8796. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8797. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8798. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8799. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8800. ELSE
  8801. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8802. END;
  8803. FOR i := 0 TO x.length-1 DO
  8804. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8805. irv.Emit(Data(position,op));
  8806. END;
  8807. InitOperand(result,ModeReference);
  8808. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8809. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8810. END
  8811. END VisitStringValue;
  8812. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8813. BEGIN
  8814. IF Trace THEN TraceEnter("VisitNilValue") END;
  8815. InitOperand(result,ModeValue);
  8816. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8817. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8818. END VisitNilValue;
  8819. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8820. BEGIN
  8821. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8822. InitOperand(result,ModeValue);
  8823. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8824. END VisitEnumerationValue;
  8825. (** symbols *)
  8826. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8827. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8828. END VisitImport;
  8829. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8830. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8831. BEGIN
  8832. IF scope # baseScope THEN
  8833. (* left := [fp+8] *)
  8834. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8835. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8836. ReuseCopy(left,right);
  8837. ReleaseIntermediateOperand(right);
  8838. scope := scope.outerScope; DEC(level);
  8839. (* { left := [left+8] } *)
  8840. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8841. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8842. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8843. Emit(Mov(position,left,right));
  8844. scope := scope.outerScope; DEC(level);
  8845. END;
  8846. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8847. result := left;
  8848. ELSE
  8849. result := fp;
  8850. END;
  8851. END GetBaseRegister;
  8852. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8853. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8854. BEGIN
  8855. IF Trace THEN TraceEnter("VisitVariable"); END;
  8856. type := x.type.resolved;
  8857. IF (x.useRegister) THEN
  8858. InitOperand(result, ModeValue);
  8859. IF x.registerNumber < 0 THEN
  8860. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8861. reg := x.registerNumber;
  8862. ELSE
  8863. reg := registerUsageCount.Map(x.registerNumber);
  8864. UseRegister(reg);
  8865. END;
  8866. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8867. ELSIF x.externalName # NIL THEN
  8868. InitOperand(result,ModeReference);
  8869. Basic.ToSegmentedName(x.externalName^, name);
  8870. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8871. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8872. InitOperand(result,ModeReference);
  8873. GetBaseRegister(result.op,currentScope,x.scope);
  8874. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8875. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8876. InitOperand(result,ModeReference);
  8877. GetCodeSectionNameForSymbol(x,name);
  8878. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8879. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8880. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8881. InitOperand(result,ModeReference);
  8882. GetCodeSectionNameForSymbol(x,name);
  8883. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8884. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8885. ELSE (* field, left designator must have been emitted *)
  8886. ASSERT(result.mode = ModeReference);
  8887. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8888. ReuseCopy(temp,result.op);
  8889. ReleaseIntermediateOperand(result.op);
  8890. result.op := temp;
  8891. END;
  8892. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8893. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8894. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8895. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8896. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8897. END;
  8898. END;
  8899. END;
  8900. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8901. ValueToCondition(result);
  8902. ELSIF type IS SyntaxTree.ProcedureType THEN
  8903. ReleaseIntermediateOperand(result.tag);
  8904. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8905. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8906. UseIntermediateOperand(result.tag);
  8907. ELSE
  8908. result.tag := nil; (* nil *)
  8909. END;
  8910. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8911. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8912. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8913. ReleaseIntermediateOperand(result.tag);
  8914. Global.GetSymbolSegmentedName(x,name);
  8915. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8916. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8917. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8918. ELSE
  8919. END;
  8920. ELSE
  8921. ReleaseIntermediateOperand(result.tag);
  8922. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8923. END;
  8924. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8925. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8926. ReleaseIntermediateOperand(result.tag);
  8927. result.tag := result.op;
  8928. UseIntermediateOperand(result.tag);
  8929. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8930. IntermediateCode.MakeMemory(result.op,addressType);
  8931. END;
  8932. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8933. ReleaseIntermediateOperand(result.tag);
  8934. result.tag := TypeDescriptorAdr(type);
  8935. UseIntermediateOperand(result.tag);
  8936. (* tag for pointer type computed not here but during dereferencing *)
  8937. END;
  8938. IF Trace THEN TraceExit("VisitVariable") END;
  8939. END VisitVariable;
  8940. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8941. BEGIN
  8942. VisitVariable(property);
  8943. END VisitProperty;
  8944. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8945. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8946. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8947. BEGIN
  8948. type := x.type.resolved;
  8949. IF Trace THEN TraceEnter("VisitParameter") END;
  8950. IF x.ownerType IS SyntaxTree.CellType THEN
  8951. ptype := x.type.resolved;
  8952. IF backend.cellsAreObjects THEN
  8953. ASSERT(result.mode = ModeReference);
  8954. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8955. ReuseCopy(temp,result.op);
  8956. ReleaseIntermediateOperand(result.op);
  8957. result.op := temp;
  8958. END;
  8959. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8960. RETURN;
  8961. ELSE
  8962. InitOperand(result,ModeReference);
  8963. GetCodeSectionNameForSymbol(x,name);
  8964. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8965. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8966. RETURN;
  8967. END;
  8968. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8969. InitOperand(result,ModeReference);
  8970. GetCodeSectionNameForSymbol(x,name);
  8971. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8972. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8973. RETURN
  8974. ELSE
  8975. GetBaseRegister(basereg,currentScope,x.scope);
  8976. InitOperand(result,ModeReference);
  8977. result.op := basereg;
  8978. END;
  8979. IF IsOpenArray(type) THEN
  8980. result.tag := basereg;
  8981. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8982. IntermediateCode.MakeMemory(result.op,addressType);
  8983. IF Global.IsOberonProcedure(x.ownerType) THEN
  8984. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8985. UseIntermediateOperand(result.tag);
  8986. ELSE
  8987. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8988. END;
  8989. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8990. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8991. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8992. ELSIF IsStaticArray(type) THEN
  8993. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8994. IntermediateCode.MakeMemory(result.op,addressType);
  8995. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8996. ELSIF type IS SyntaxTree.MathArrayType THEN
  8997. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8998. WITH type: SyntaxTree.MathArrayType DO
  8999. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9000. IF type.form = SyntaxTree.Tensor THEN
  9001. ELSIF type.form = SyntaxTree.Open THEN
  9002. result.tag := result.op;
  9003. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9004. IntermediateCode.MakeMemory(result.op,addressType);
  9005. UseIntermediateOperand(result.tag);
  9006. ELSIF type.form = SyntaxTree.Static THEN
  9007. IF x.kind = SyntaxTree.ConstParameter THEN
  9008. IntermediateCode.MakeMemory(result.op,addressType);
  9009. END;
  9010. ELSE HALT(100)
  9011. END;
  9012. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9013. IF type.form = SyntaxTree.Tensor THEN
  9014. ToMemory(result.op,addressType,0);
  9015. ELSIF type.form = SyntaxTree.Open THEN
  9016. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9017. ReuseCopy(result.tag, mem);
  9018. ReleaseIntermediateOperand(mem);
  9019. ReleaseIntermediateOperand(result.op);
  9020. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9021. ELSIF type.form = SyntaxTree.Static THEN
  9022. IntermediateCode.MakeMemory(result.op,addressType);
  9023. ELSE HALT(100)
  9024. END;
  9025. ELSE HALT(100)
  9026. END;
  9027. END;
  9028. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9029. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9030. IntermediateCode.MakeMemory(result.op,addressType);
  9031. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9032. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9033. END;
  9034. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9035. ValueToCondition(result);
  9036. ELSIF type IS SyntaxTree.ProcedureType THEN
  9037. ReleaseIntermediateOperand(result.tag);
  9038. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9039. IF x.kind = SyntaxTree.VarParameter THEN
  9040. ReuseCopy(result.tag,result.op);
  9041. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9042. IntermediateCode.MakeMemory(result.tag,addressType);
  9043. ELSE
  9044. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9045. UseIntermediateOperand(result.tag);
  9046. END;
  9047. ELSE
  9048. result.tag := nil;
  9049. END;
  9050. (* tag for pointer type computed not here but during dereferencing *)
  9051. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9052. ReleaseIntermediateOperand(result.tag);
  9053. result.tag := basereg;
  9054. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9055. IntermediateCode.MakeMemory(result.tag,addressType);
  9056. UseIntermediateOperand(result.tag);
  9057. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9058. ReleaseIntermediateOperand(result.tag);
  9059. result.tag := TypeDescriptorAdr(type);
  9060. UseIntermediateOperand(result.tag);
  9061. END;
  9062. IF Trace THEN TraceExit("VisitParameter") END;
  9063. END VisitParameter;
  9064. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9065. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9066. BEGIN
  9067. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9068. (* left.p: left already emitted *)
  9069. tag := result.op; (* value of pointer to left *)
  9070. (* get type desc *)
  9071. tmp := result.tag;
  9072. IntermediateCode.MakeMemory(tmp,addressType);
  9073. (* get method adr *)
  9074. Reuse1(reg,tmp);
  9075. ReleaseIntermediateOperand(tmp);
  9076. IF backend.cooperative THEN
  9077. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9078. WHILE recordType.baseType # NIL DO
  9079. recordType := recordType.GetBaseRecord ();
  9080. END;
  9081. GetRecordTypeName (recordType,name);
  9082. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9083. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9084. offset := 0;
  9085. ELSE
  9086. offset := 2;
  9087. END;
  9088. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9089. ELSIF meta.simple THEN
  9090. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9091. ELSE
  9092. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9093. END;
  9094. InitOperand(operand,ModeReference);
  9095. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9096. operand.op := reg;
  9097. operand.tag := tag;
  9098. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9099. END DynamicCallOperand;
  9100. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9101. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9102. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9103. BEGIN
  9104. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9105. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9106. tag := operand.op;
  9107. ReleaseIntermediateOperand(operand.tag);
  9108. ELSE tag := nil
  9109. END;
  9110. IF x.isInline THEN
  9111. sectionType := Sections.InlineCodeSection;
  9112. ELSE
  9113. sectionType := Sections.CodeSection;
  9114. END;
  9115. IF x.externalName # NIL THEN
  9116. Basic.ToSegmentedName(x.externalName^, name);
  9117. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9118. ELSE
  9119. GetCodeSectionNameForSymbol(x, name);
  9120. IF (x.scope.ownerModule = module.module) THEN
  9121. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9122. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9123. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9124. IF source.pc = 0 THEN (* no code yet *)
  9125. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9126. END;
  9127. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9128. bits := x.procedureScope.body.code.inlineCode;
  9129. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9130. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9131. binary.CopyBits(bits, 0, bits.GetSize());
  9132. source.SetResolved(binary);
  9133. ELSE
  9134. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9135. END;
  9136. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9137. END;
  9138. InitOperand(operand,ModeValue);
  9139. operand.op := reg;
  9140. operand.tag := tag;
  9141. IF Trace THEN TraceExit("StaticCallOperand") END;
  9142. END StaticCallOperand;
  9143. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9144. (* handle expressions of the form designator.procedure or procedure *)
  9145. BEGIN
  9146. IF Trace THEN TraceEnter("VisitProcedure") END;
  9147. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9148. DynamicCallOperand(result,x);
  9149. ELSIF x.isInline THEN
  9150. StaticCallOperand(result,x);
  9151. ELSE
  9152. StaticCallOperand(result,x);
  9153. END;
  9154. IF Trace THEN TraceExit("VisitProcedure") END;
  9155. END VisitProcedure;
  9156. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9157. BEGIN
  9158. VisitProcedure(x);
  9159. END VisitOperator;
  9160. (** statements *)
  9161. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9162. BEGIN
  9163. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9164. Expression(x.call);
  9165. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9166. ReleaseOperand(result)
  9167. END;
  9168. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9169. END VisitProcedureCallStatement;
  9170. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9171. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9172. leftBase, rightBase: SyntaxTree.Type;
  9173. procedureName,s: SyntaxTree.IdentifierString;
  9174. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9175. size: LONGINT; rightKind: LONGINT;
  9176. dummy: IntermediateCode.Operand;
  9177. CONST moduleName = "FoxArrayBase";
  9178. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9179. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9180. BEGIN
  9181. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9182. IF base IS SyntaxTree.MathArrayType THEN
  9183. base := OpenArray(base(SyntaxTree.MathArrayType));
  9184. END;
  9185. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9186. result.SetArrayBase(base);
  9187. RETURN result
  9188. END OpenArray;
  9189. BEGIN
  9190. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9191. SaveRegisters();ReleaseUsedRegisters(saved);
  9192. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9193. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9194. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9195. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9196. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9197. IF leftType.form = SyntaxTree.Tensor THEN
  9198. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9199. ELSIF leftType.form = SyntaxTree.Open THEN
  9200. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9201. ELSIF leftType.form = SyntaxTree.Static THEN
  9202. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9203. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9204. END;
  9205. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9206. IF procedure = NIL THEN
  9207. s := "Instruction not supported on target, emulation procedure ";
  9208. Strings.Append(s,moduleName);
  9209. Strings.Append(s,".");
  9210. Strings.Append(s,procedureName);
  9211. Strings.Append(s," not present");
  9212. Error(position,s);
  9213. ELSE
  9214. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9215. parameter.SetType(leftType);
  9216. parameter.SetAccess(SyntaxTree.Internal);
  9217. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9218. parameter.SetKind(rightKind);
  9219. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9220. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9221. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9222. StaticCallOperand(result,procedure);
  9223. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9224. ReleaseOperand(result);
  9225. END;
  9226. RestoreRegisters(saved);
  9227. END;
  9228. END AssignMathArray;
  9229. VAR modifyAssignmentCounter := 0: LONGINT;
  9230. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9231. VAR processor,mem,dst: IntermediateCode.Operand;
  9232. BEGIN
  9233. IF value.intValue = true.intValue THEN
  9234. INC(modifyAssignmentCounter);
  9235. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9236. modifyAssignmentsPC := section.pc;
  9237. ELSE
  9238. DEC(modifyAssignmentCounter);
  9239. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9240. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9241. END;
  9242. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9243. dst := NewRegisterOperand (addressType);
  9244. Emit(Mov(position,dst, processor));
  9245. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9246. Emit(Mov(position,mem, value));
  9247. ReleaseIntermediateOperand(dst);
  9248. END ModifyAssignments;
  9249. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9250. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9251. BEGIN
  9252. type := left.type.resolved;
  9253. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9254. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9255. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9256. IF procedureType.returnParameter = parameter THEN
  9257. (* this is the only case where the destination can be dynamically smaller than the source
  9258. in all other cases the dynamic size has to be taken
  9259. *)
  9260. IF backend.cooperative THEN
  9261. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9262. ELSE
  9263. MakeMemory(mem, tag, addressType, 0);
  9264. END;
  9265. RETURN mem;
  9266. END;
  9267. END;
  9268. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9269. END CopySize;
  9270. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9271. VAR
  9272. leftO, rightO: Operand;
  9273. arg,mem, sizeOp: IntermediateCode.Operand;
  9274. leftType, rightType, componentType, base: SyntaxTree.Type;
  9275. size: LONGINT;
  9276. parameters: SyntaxTree.ExpressionList;
  9277. procedure: SyntaxTree.Procedure;
  9278. call: SyntaxTree.ProcedureCallDesignator;
  9279. designator: SyntaxTree.Designator;
  9280. saved: RegisterEntry;
  9281. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9282. VAR procedureType: SyntaxTree.ProcedureType;
  9283. BEGIN
  9284. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9285. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9286. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9287. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9288. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9289. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9290. IF right.id = Global.Reshape THEN RETURN TRUE
  9291. END;
  9292. END;
  9293. END;
  9294. END;
  9295. RETURN FALSE
  9296. END CanPassAsResultParameter;
  9297. BEGIN
  9298. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9299. leftType := left.type.resolved; rightType:= right.type.resolved;
  9300. IF backend.cooperative & left.NeedsTrace() THEN
  9301. ModifyAssignments(true);
  9302. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9303. Designate(right, rightO);
  9304. Designate(left, leftO);
  9305. ASSERT(leftO.mode = ModeReference);
  9306. TransferToRegister(leftO.op, leftO.op);
  9307. TransferToRegister(rightO.op, rightO.op);
  9308. Emit(Push(position, leftO.op));
  9309. Emit(Push(position, rightO.op));
  9310. CallAssignMethod(leftO.op, rightO.op, left.type);
  9311. Emit(Pop(position, rightO.op));
  9312. Emit(Pop(position, leftO.op));
  9313. sizeOp := CopySize(left, leftO.tag);
  9314. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9315. ReleaseIntermediateOperand(sizeOp);
  9316. ReleaseOperand(leftO);
  9317. ReleaseOperand(rightO);
  9318. ELSE
  9319. Evaluate(right,rightO);
  9320. Designate(left,leftO);
  9321. ASSERT(leftO.mode = ModeReference);
  9322. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9323. (* copy procedure address first *)
  9324. MakeMemory(mem,leftO.op,addressType,0);
  9325. Emit(Mov(position,mem,rightO.op));
  9326. ReleaseIntermediateOperand(mem);
  9327. (* copy pointer address *)
  9328. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9329. CallAssignPointer(leftO.tag, rightO.tag);
  9330. ELSE
  9331. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9332. CallAssignPointer(leftO.op, rightO.op);
  9333. END;
  9334. ReleaseOperand(leftO);
  9335. ReleaseOperand(rightO);
  9336. END;
  9337. ModifyAssignments(false);
  9338. RETURN;
  9339. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9340. SaveRegisters();ReleaseUsedRegisters(saved);
  9341. IF SemanticChecker.IsPointerType(leftType) THEN
  9342. Evaluate(right,rightO);
  9343. Designate(left,leftO);
  9344. Emit(Push(position,leftO.op));
  9345. ReleaseOperand(leftO);
  9346. Emit(Push(position,rightO.op));
  9347. ReleaseOperand(rightO);
  9348. CallThis(position,"Heaps","Assign",2);
  9349. ELSIF leftType.IsRecordType() THEN
  9350. Designate(right,rightO);
  9351. Designate(left,leftO);
  9352. Emit(Push(position,leftO.op));
  9353. Emit(Push(position,leftO.tag)); (* type desc *)
  9354. ReleaseOperand(leftO);
  9355. Emit(Push(position,rightO.op));
  9356. ReleaseOperand(rightO);
  9357. CallThis(position,"Heaps","AssignRecord",3);
  9358. ELSIF IsStaticArray(leftType) THEN
  9359. size := StaticArrayNumElements(leftType);
  9360. base := StaticArrayBaseType(leftType);
  9361. Designate(right,rightO);
  9362. Designate(left,leftO);
  9363. Emit(Push(position,leftO.op));
  9364. ReleaseOperand(leftO);
  9365. arg := TypeDescriptorAdr(base);
  9366. Emit(Push(position,arg));
  9367. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9368. Emit(Push(position,rightO.op));
  9369. ReleaseOperand(rightO);
  9370. CallThis(position,"Heaps","AssignArray",4);
  9371. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9372. size := StaticMathArrayNumElements(leftType);
  9373. base := StaticMathArrayBaseType(leftType);
  9374. Designate(right,rightO);
  9375. Designate(left,leftO);
  9376. Emit(Push(position,leftO.op));
  9377. ReleaseOperand(leftO);
  9378. arg := TypeDescriptorAdr(base);
  9379. Emit(Push(position,arg));
  9380. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9381. Emit(Push(position,rightO.op));
  9382. ReleaseOperand(rightO);
  9383. CallThis(position,"Heaps","AssignArray",4);
  9384. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9385. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9386. Evaluate(right,rightO);
  9387. Designate(left,leftO);
  9388. MakeMemory(mem,leftO.op,addressType,0);
  9389. Emit(Mov(position,mem,rightO.op));
  9390. ReleaseIntermediateOperand(mem);
  9391. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9392. Emit (Push(position, leftO.tag));
  9393. ReleaseOperand(leftO);
  9394. Emit (Push(position, rightO.tag));
  9395. ReleaseOperand(rightO);
  9396. CallThis(position,"Heaps","Assign", 2);
  9397. ELSE HALT(100); (* missing ? *)
  9398. END;
  9399. RestoreRegisters(saved);
  9400. RETURN;
  9401. END;
  9402. IF CanPassAsResultParameter(right) THEN
  9403. procedureResultDesignator := left(SyntaxTree.Designator);
  9404. Expression(right);
  9405. procedureResultDesignator := NIL;
  9406. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9407. (* left <-- ALIAS OF right: zerocopy *)
  9408. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9409. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9410. designator.SetType(procedure.type);
  9411. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9412. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9413. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9414. END;
  9415. ELSIF leftType IS SyntaxTree.RangeType THEN
  9416. (* LHS is of array range type *)
  9417. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9418. Evaluate(right, rightO);
  9419. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9420. (* first *)
  9421. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9422. Emit(Mov(position,mem, rightO.op));
  9423. ReleaseIntermediateOperand(mem);
  9424. (* last *)
  9425. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9426. Emit(Mov(position,mem, rightO.tag));
  9427. ReleaseIntermediateOperand(mem);
  9428. (* step *)
  9429. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9430. Emit(Mov(position,mem, rightO.extra));
  9431. ReleaseIntermediateOperand(mem);
  9432. ReleaseOperand(rightO);
  9433. ReleaseOperand(leftO)
  9434. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9435. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9436. Evaluate(right, rightO);
  9437. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9438. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9439. (* real part *)
  9440. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9441. Emit(Mov(position,mem, rightO.op));
  9442. ReleaseIntermediateOperand(mem);
  9443. (* imaginary part *)
  9444. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9445. Emit(Mov(position,mem, rightO.tag));
  9446. ReleaseIntermediateOperand(mem);
  9447. ReleaseOperand(rightO);
  9448. ReleaseOperand(leftO)
  9449. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9450. OR (leftType IS SyntaxTree.PortType) THEN
  9451. (* rightO := leftO;*)
  9452. Evaluate(right,rightO);
  9453. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9454. Designate(left,leftO);
  9455. IF leftO.mode = ModeReference THEN
  9456. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9457. destination := mem;
  9458. ELSE
  9459. destination := leftO.op;
  9460. END;
  9461. ReleaseOperand(leftO);
  9462. IF destination.mode # IntermediateCode.Undefined THEN
  9463. Emit(Mov(position,destination,rightO.op));
  9464. END;
  9465. ReleaseOperand(rightO);
  9466. ReleaseIntermediateOperand(mem);
  9467. IntermediateCode.InitOperand(destination);
  9468. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9469. Evaluate(right,rightO);
  9470. Designate(left,leftO);
  9471. MakeMemory(mem,leftO.op,addressType,0);
  9472. Emit(Mov(position,mem,rightO.op));
  9473. ReleaseIntermediateOperand(mem);
  9474. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9475. (* delegate *)
  9476. (*
  9477. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9478. *)
  9479. Emit(Mov(position,leftO.tag,rightO.tag));
  9480. END;
  9481. ReleaseOperand(leftO);
  9482. ReleaseOperand(rightO);
  9483. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9484. Designate(right,rightO);
  9485. Designate(left,leftO);
  9486. sizeOp := CopySize(left, leftO.tag);
  9487. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9488. ReleaseIntermediateOperand(sizeOp);
  9489. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9490. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9491. IF (rightType IS SyntaxTree.StringType) THEN
  9492. CopyString(left,right);
  9493. 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
  9494. Designate(right,rightO);
  9495. Designate(left,leftO);
  9496. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9497. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9498. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9499. ELSE
  9500. HALT(201)
  9501. END;
  9502. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9503. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9504. Designate(right,rightO);
  9505. Designate(left,leftO);
  9506. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9507. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9508. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9509. Emit(Mov(position, leftO.op, mem));
  9510. ReleaseIntermediateOperand(mem);
  9511. ELSE
  9512. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9513. END;
  9514. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9515. ELSE
  9516. AssignMathArray(left,right);
  9517. END;
  9518. ELSE
  9519. HALT(200);
  9520. END;
  9521. END Assign;
  9522. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9523. BEGIN
  9524. IF Trace THEN TraceEnter("VisitAssignment") END;
  9525. Assign(x.left,x.right);
  9526. IF Trace THEN TraceExit("VisitAssignment") END;
  9527. END VisitAssignment;
  9528. PROCEDURE EmitCooperativeSwitch;
  9529. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9530. BEGIN
  9531. ASSERT (cooperativeSwitches);
  9532. pc := section.pc;
  9533. IF lastSwitchPC = section.pc THEN RETURN END;
  9534. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9535. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9536. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9537. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9538. INC(statCoopSwitch, section.pc - pc);
  9539. END EmitCooperativeSwitch;
  9540. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9541. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9542. BEGIN
  9543. p0 := communication.left; p1 := communication.right;
  9544. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9545. Evaluate(p0,s0);
  9546. Evaluate(p1,s1);
  9547. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9548. Emit(Push(position,s0.op));
  9549. Emit(Push(position,s1.op));
  9550. (*
  9551. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9552. *)
  9553. IF ~backend.cellsAreObjects THEN
  9554. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9555. END;
  9556. ReleaseOperand(s0);
  9557. ReleaseOperand(s1);
  9558. IF backend.cellsAreObjects THEN
  9559. CallThis(position,"ActiveCellsRuntime","Send",2);
  9560. ELSE
  9561. CallThis(position,ChannelModuleName,"Send",2);
  9562. END;
  9563. (* ----- RECEIVE ------*)
  9564. ELSE
  9565. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9566. tmp := p0; p0 := p1; p1 := tmp;
  9567. END;
  9568. Evaluate(p0,s0);
  9569. Emit(Push(position,s0.op));
  9570. Designate(p1,s1);
  9571. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9572. Emit(Push(position,s1.op));
  9573. (*
  9574. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9575. *)
  9576. IF ~backend.cellsAreObjects THEN
  9577. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9578. END;
  9579. ReleaseOperand(s0);
  9580. ReleaseOperand(s1);
  9581. IF backend.cellsAreObjects THEN
  9582. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9583. ELSE
  9584. CallThis(position,ChannelModuleName,"Receive",2)
  9585. END;
  9586. END;
  9587. END VisitCommunicationStatement;
  9588. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9589. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9590. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9591. VAR true, false: Label; condition, value: BOOLEAN;
  9592. BEGIN
  9593. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9594. IF condition THEN
  9595. true := NewLabel();
  9596. false := NewLabel();
  9597. Condition(if.condition,true,false);
  9598. SetLabel(true);
  9599. StatementSequence(if.statements);
  9600. BrL(end);
  9601. SetLabel(false);
  9602. ELSE
  9603. IF value THEN (* always true *)
  9604. escape := TRUE;
  9605. StatementSequence(if.statements);
  9606. (* no branch necessary -- rest skipped *)
  9607. END;
  9608. END;
  9609. END IfPart;
  9610. BEGIN
  9611. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9612. end := NewLabel();
  9613. elsifs := x.ElsifParts();
  9614. IfPart(x.ifPart);
  9615. FOR i := 0 TO elsifs-1 DO
  9616. IF ~escape THEN
  9617. elsif := x.GetElsifPart(i);
  9618. IfPart(elsif);
  9619. END;
  9620. END;
  9621. IF (x.elsePart # NIL) & ~escape THEN
  9622. StatementSequence(x.elsePart);
  9623. END;
  9624. SetLabel(end);
  9625. IF Trace THEN TraceExit("VisitIfStatement") END;
  9626. END VisitIfStatement;
  9627. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9628. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9629. BEGIN
  9630. (*IF x.variable.type.resolved = x.type.resolved THEN
  9631. (* always true, do nothing *)
  9632. ELSE*)
  9633. Designate(x.variable,res);
  9634. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9635. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9636. END;
  9637. trueL := NewLabel();
  9638. TypeTest(res.tag,x.type,trueL,falseL);
  9639. ReleaseOperand(res);
  9640. SetLabel(trueL);
  9641. StatementSequence(x.statements);
  9642. BrL(endL);
  9643. END WithPart;
  9644. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9645. VAR endL,falseL: Label;i: LONGINT;
  9646. BEGIN
  9647. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9648. endL := NewLabel();
  9649. FOR i := 0 TO x.WithParts()-1 DO
  9650. falseL := NewLabel();
  9651. WithPart(x.GetWithPart(i),falseL,endL);
  9652. SetLabel(falseL);
  9653. END;
  9654. IF x.elsePart = NIL THEN
  9655. IF ~isUnchecked THEN
  9656. EmitTrap(position,WithTrap);
  9657. END;
  9658. ELSE
  9659. StatementSequence(x.elsePart)
  9660. END;
  9661. SetLabel(endL);
  9662. IF Trace THEN TraceExit("VisitWithStatement") END;
  9663. END VisitWithStatement;
  9664. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9665. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9666. out,else: Label; label: Label;
  9667. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9668. symbol: SyntaxTree.Symbol;
  9669. BEGIN
  9670. (*! split case statement into if-elsif statements for large case label lists *)
  9671. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9672. range := x.max-x.min+1;
  9673. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9674. END;
  9675. size := LONGINT(range);
  9676. Evaluate(x.variable,var);
  9677. ReuseCopy(tmp,var.op);
  9678. ReleaseIntermediateOperand(var.op);
  9679. var.op := tmp;
  9680. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9681. Convert(var.op,addressType);
  9682. else := NewLabel();
  9683. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9684. (*
  9685. UniqueId(name,module.module,"case",caseId);
  9686. *)
  9687. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9688. Global.GetModuleSegmentedName(module.module, name);
  9689. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9690. symbol := SyntaxTree.NewSymbol(name[1]);
  9691. symbol.SetScope(moduleScope);
  9692. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9693. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9694. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9695. ReuseCopy(res,var.op);
  9696. ReleaseOperand(var);
  9697. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9698. Emit(Add(position,res,res,jmp));
  9699. IntermediateCode.MakeMemory(res,addressType);
  9700. Emit(Br(position,res));
  9701. ReleaseIntermediateOperand(res);
  9702. out := NewLabel();
  9703. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9704. part := x.GetCasePart(i);
  9705. constant := part.firstConstant;
  9706. label := NewLabel();
  9707. SetLabel(label);
  9708. WHILE(constant # NIL) DO (* case labels for this case part *)
  9709. FOR j := constant.min TO constant.max DO
  9710. fixups[j-x.min] := label;
  9711. END;
  9712. constant := constant.next;
  9713. END;
  9714. StatementSequence(part.statements);
  9715. BrL(out);
  9716. END;
  9717. SetLabel(else);
  9718. FOR i := 0 TO size-1 DO
  9719. IF fixups[i] = NIL THEN
  9720. fixups[i] := else;
  9721. END;
  9722. END;
  9723. IF x.elsePart # NIL THEN
  9724. StatementSequence(x.elsePart);
  9725. ELSIF ~isUnchecked THEN
  9726. EmitTrap(position,CaseTrap);
  9727. END;
  9728. SetLabel(out);
  9729. FOR i := 0 TO size-1 DO
  9730. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9731. section.Emit(Data(position,op));
  9732. END;
  9733. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9734. END VisitCaseStatement;
  9735. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9736. VAR start: Label; true,false: Label;
  9737. BEGIN
  9738. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9739. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9740. start := NewLabel();
  9741. true := NewLabel();
  9742. false := NewLabel();
  9743. SetLabel(start);
  9744. Condition(x.condition,true,false);
  9745. SetLabel(true);
  9746. StatementSequence(x.statements);
  9747. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9748. BrL(start);
  9749. SetLabel(false);
  9750. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9751. END VisitWhileStatement;
  9752. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9753. VAR false,true: Label;
  9754. BEGIN
  9755. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9756. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9757. true := NewLabel();
  9758. false := NewLabel();
  9759. SetLabel(false);
  9760. StatementSequence(x.statements);
  9761. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9762. Condition(x.condition,true,false);
  9763. SetLabel(true);
  9764. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9765. END VisitRepeatStatement;
  9766. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9767. VAR
  9768. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9769. temporaryVariable: SyntaxTree.Variable;
  9770. temporaryVariableDesignator : SyntaxTree.Designator;
  9771. BEGIN
  9772. IF Trace THEN TraceEnter("VisitForStatement") END;
  9773. true := NewLabel();
  9774. false := NewLabel();
  9775. start := NewLabel();
  9776. Assign(x.variable,x.from);
  9777. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9778. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9779. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9780. Assign(temporaryVariableDesignator,x.to);
  9781. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9782. IF by > 0 THEN
  9783. cmp := Scanner.LessEqual
  9784. ELSE
  9785. cmp := Scanner.GreaterEqual
  9786. END;
  9787. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9788. binary.SetType(system.booleanType);
  9789. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9790. SetLabel(start);
  9791. Condition(binary,true,false);
  9792. SetLabel(true);
  9793. StatementSequence(x.statements);
  9794. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9795. binary.SetType(x.variable.type);
  9796. Assign(x.variable,binary);
  9797. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9798. BrL(start);
  9799. SetLabel(false);
  9800. IF Trace THEN TraceExit("VisitForStatement") END;
  9801. END VisitForStatement;
  9802. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9803. VAR prevLoop: Label;
  9804. BEGIN
  9805. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9806. prevLoop := currentLoop;
  9807. currentLoop := NewLabel();
  9808. StatementSequence(x.statements);
  9809. SetLabel(currentLoop);
  9810. currentLoop := prevLoop;
  9811. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9812. END VisitExitableBlock;
  9813. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9814. VAR prevLoop,start: Label;
  9815. BEGIN
  9816. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9817. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9818. start := NewLabel();
  9819. prevLoop := currentLoop;
  9820. SetLabel(start);
  9821. currentLoop := NewLabel();
  9822. StatementSequence(x.statements);
  9823. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9824. BrL(start);
  9825. SetLabel(currentLoop);
  9826. currentLoop := prevLoop;
  9827. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9828. END VisitLoopStatement;
  9829. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9830. VAR outer: SyntaxTree.Statement;
  9831. BEGIN
  9832. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9833. IF locked THEN (* r if we jump out of an exclusive block *)
  9834. outer := x.outer;
  9835. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9836. outer := outer.outer;
  9837. END;
  9838. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9839. Lock(FALSE);
  9840. END;
  9841. END;
  9842. BrL(currentLoop);
  9843. IF Trace THEN TraceExit("VisitExitStatement") END;
  9844. END VisitExitStatement;
  9845. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9846. VAR
  9847. expression, parameterDesignator: SyntaxTree.Expression;
  9848. type, componentType: SyntaxTree.Type;
  9849. res, right: Operand;
  9850. left, mem, reg: IntermediateCode.Operand;
  9851. parameter: SyntaxTree.Parameter;
  9852. procedure: SyntaxTree.Procedure;
  9853. procedureType: SyntaxTree.ProcedureType;
  9854. returnTypeOffset: LONGINT;
  9855. delegate: BOOLEAN;
  9856. map: SymbolMap;
  9857. callingConvention, parametersSize: LONGINT;
  9858. BEGIN
  9859. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9860. expression := x.returnValue;
  9861. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9862. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9863. IF currentIsInline THEN
  9864. IF expression # NIL THEN
  9865. map := currentMapper.Get(NIL);
  9866. IF map # NIL THEN
  9867. Assign(map.to, expression);
  9868. ELSE
  9869. Evaluate(expression,res);
  9870. Emit(Return(position,res.op));
  9871. ReleaseOperand(res);
  9872. END;
  9873. END;
  9874. BrL(currentInlineExit);
  9875. RETURN;
  9876. END;
  9877. IF expression # NIL THEN
  9878. type := expression.type.resolved;
  9879. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9880. IF locked THEN Lock(FALSE) END;
  9881. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9882. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9883. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9884. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9885. (* return without structured return parameter *)
  9886. Evaluate(expression,res);
  9887. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9888. IF locked OR profile THEN
  9889. Emit(Push(position,res.op));
  9890. IF delegate THEN HALT(200) END;
  9891. ReleaseOperand(res);
  9892. IF locked THEN Lock(FALSE) END;
  9893. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9894. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9895. reg := NewRegisterOperand(res.op.type);
  9896. Emit(Pop(position,reg));
  9897. Emit(Return(position,reg));
  9898. ReleaseIntermediateOperand(reg);
  9899. ELSE
  9900. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9901. Emit(Return(position,res.op));
  9902. ReleaseOperand(res);
  9903. END;
  9904. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9905. THEN
  9906. (* return using structured return parameter *)
  9907. 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)
  9908. OR SemanticChecker.IsPointerType(type));
  9909. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9910. parameter :=procedureType.returnParameter;
  9911. ASSERT(parameter # NIL);
  9912. returnTypeOffset := parameter.offsetInBits;
  9913. (*
  9914. IF parameter# NIL THEN
  9915. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9916. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9917. ELSE
  9918. returnTypeOffset := system.offsetFirstParameter
  9919. END;
  9920. *)
  9921. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9922. IF type IS SyntaxTree.RangeType THEN
  9923. (* array range type *)
  9924. Evaluate(expression, right);
  9925. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9926. Emit(Mov(position,mem, right.op)); (* first *)
  9927. ReleaseIntermediateOperand(mem);
  9928. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9929. Emit(Mov(position,mem, right.tag)); (* last *)
  9930. ReleaseIntermediateOperand(mem);
  9931. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9932. Emit(Mov(position,mem, right.extra)); (* step *)
  9933. ReleaseIntermediateOperand(mem);
  9934. ReleaseOperand(right);
  9935. ELSIF type IS SyntaxTree.ComplexType THEN
  9936. Evaluate(expression, right);
  9937. componentType := type(SyntaxTree.ComplexType).componentType;
  9938. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9939. Emit(Mov(position,mem, right.op)); (* real part *)
  9940. ReleaseIntermediateOperand(mem);
  9941. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9942. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9943. ReleaseIntermediateOperand(mem);
  9944. ReleaseOperand(right);
  9945. ELSE (* covers cases: pointer / record / array *)
  9946. parameter := procedureType.returnParameter;
  9947. checker.SetCurrentScope(currentScope);
  9948. ASSERT(parameter # NIL);
  9949. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9950. Assign(parameterDesignator,expression);
  9951. END;
  9952. ReleaseIntermediateOperand(left);
  9953. IF locked THEN Lock(FALSE) END;
  9954. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9955. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9956. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9957. parameter := procedureType.returnParameter;
  9958. checker.SetCurrentScope(currentScope);
  9959. IF parameter = NIL THEN
  9960. Error(procedure.position, "structured return of parameter of procedure not found");
  9961. ELSE
  9962. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9963. Assign(parameterDesignator,expression);
  9964. END;
  9965. IF locked THEN Lock(FALSE) END;
  9966. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9967. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9968. ELSE
  9969. HALT(200);
  9970. END;
  9971. ELSE
  9972. IF locked THEN Lock(FALSE) END;
  9973. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9974. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9975. END;
  9976. IF backend.cooperative THEN
  9977. BrL(exitLabel);
  9978. ELSE
  9979. callingConvention := procedureType.callingConvention;
  9980. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9981. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9982. ELSE
  9983. parametersSize := 0;
  9984. END;
  9985. EmitLeave(section, position,procedure, callingConvention);
  9986. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9987. END;
  9988. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9989. END VisitReturnStatement;
  9990. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9991. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9992. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9993. statements: SyntaxTree.StatementSequence;
  9994. name, suffix: SyntaxTree.IdentifierString;
  9995. BEGIN
  9996. Strings.IntToStr(awaitProcCounter,suffix);
  9997. Strings.Concat("@AwaitProcedure",suffix,name);
  9998. identifier := SyntaxTree.NewIdentifier(name);
  9999. INC(awaitProcCounter);
  10000. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10001. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10002. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10003. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10004. procedure.SetAccess(SyntaxTree.Hidden);
  10005. procedure.SetScope(currentScope);
  10006. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10007. procedureType.SetReturnType(system.booleanType);
  10008. procedure.SetType(procedureType);
  10009. body := SyntaxTree.NewBody(x.position,procedureScope);
  10010. procedureScope.SetBody(body);
  10011. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10012. returnStatement.SetReturnValue(x.condition);
  10013. statements := SyntaxTree.NewStatementSequence();
  10014. statements.AddStatement(returnStatement);
  10015. body.SetStatementSequence(statements);
  10016. currentScope.AddProcedure(procedure);
  10017. RETURN procedure
  10018. END MakeAwaitProcedure;
  10019. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10020. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10021. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10022. BEGIN
  10023. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10024. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10025. IF backend.cooperative THEN
  10026. start := NewLabel();
  10027. true := NewLabel();
  10028. false := NewLabel();
  10029. SetLabel(start);
  10030. Condition(x.condition,true,false);
  10031. SetLabel(false);
  10032. PushSelfPointer();
  10033. CallThis(position,"ExclusiveBlocks","Await",1);
  10034. BrL(start);
  10035. SetLabel(true);
  10036. PushSelfPointer();
  10037. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10038. ELSE
  10039. proc := MakeAwaitProcedure(x);
  10040. Emit(Push(position,fp));
  10041. GetCodeSectionNameForSymbol(proc,name);
  10042. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10043. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10044. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10045. Emit(Call(position,call,ProcParametersSize(proc)));
  10046. Emit(Result(position,res));
  10047. (*
  10048. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10049. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10050. *)
  10051. InitOperand(result,ModeValue);
  10052. result.op := res;
  10053. label := NewLabel();
  10054. BreqL(label, result.op, SELF.true);
  10055. ReleaseOperand(result);
  10056. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10057. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10058. Emit(Push(position,res));
  10059. Emit(Push(position,fp));
  10060. PushSelfPointer();
  10061. Emit(Push(position,nil));
  10062. CallThis(position,"Objects","Await",4);
  10063. SetLabel(label);
  10064. END;
  10065. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10066. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10067. END VisitAwaitStatement;
  10068. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10069. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10070. BEGIN
  10071. FOR i := 0 TO x.Length() - 1 DO
  10072. statement := x.GetStatement( i );
  10073. Statement(statement);
  10074. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10075. END;
  10076. END StatementSequence;
  10077. PROCEDURE PushSelfPointer;
  10078. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10079. procedureType: SyntaxTree.ProcedureType;
  10080. BEGIN
  10081. scope := currentScope;
  10082. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10083. scope := scope.outerScope;
  10084. END;
  10085. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10086. moduleSection := meta.ModuleSection();
  10087. IF backend.cooperative THEN
  10088. moduleOffset := 0;
  10089. ELSE
  10090. moduleOffset := moduleSection.pc;
  10091. END;
  10092. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10093. ELSE
  10094. GetBaseRegister(op.op,currentScope,scope);
  10095. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10096. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10097. parametersSize := ProcParametersSize(procedure);
  10098. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10099. IF backend.cooperative THEN
  10100. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10101. END;
  10102. IntermediateCode.MakeMemory(op.op,addressType);
  10103. END;
  10104. Emit(Push(position,op.op));
  10105. ReleaseOperand(op);
  10106. END PushSelfPointer;
  10107. PROCEDURE Lock(lock: BOOLEAN);
  10108. BEGIN
  10109. IF Trace THEN TraceEnter("Lock") END;
  10110. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10111. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10112. ASSERT(modifyAssignmentCounter = 0);
  10113. IF dump # NIL THEN
  10114. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10115. dump.Ln;dump.Update;
  10116. END;
  10117. PushSelfPointer;
  10118. IF backend.cooperative THEN
  10119. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10120. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10121. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10122. END;
  10123. ELSE
  10124. Emit(Push(position,true));
  10125. IF lock THEN CallThis(position,"Objects","Lock",2)
  10126. ELSE CallThis(position,"Objects","Unlock",2);
  10127. END;
  10128. END;
  10129. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10130. IF Trace THEN TraceExit("Lock") END;
  10131. END Lock;
  10132. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10133. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10134. BEGIN
  10135. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10136. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10137. previouslyUnchecked := isUnchecked;
  10138. isUnchecked := isUnchecked OR x.isUnchecked;
  10139. previouslyCooperativeSwitches := cooperativeSwitches;
  10140. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10141. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10142. IF x.statements # NIL THEN
  10143. StatementSequence(x.statements);
  10144. END;
  10145. IF (x IS SyntaxTree.Body) THEN
  10146. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10147. section.SetFinally(section.pc);
  10148. StatementSequence(x(SyntaxTree.Body).finally)
  10149. ELSIF x.isExclusive THEN
  10150. end := NewLabel();
  10151. BrL(end);
  10152. section.SetFinally(section.pc);
  10153. Lock(FALSE);
  10154. EmitTrap(position,RethrowTrap);
  10155. SetLabel(end);
  10156. END;
  10157. END;
  10158. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10159. isUnchecked := previouslyUnchecked;
  10160. cooperativeSwitches := previouslyCooperativeSwitches;
  10161. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10162. END VisitStatementBlock;
  10163. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10164. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10165. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10166. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10167. procedure: SyntaxTree.Procedure;
  10168. map: SymbolMap;
  10169. callingConvention, parametersSize: LONGINT;
  10170. BEGIN
  10171. scope := currentScope;
  10172. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10173. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10174. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10175. return := emptyOperand;
  10176. IF Trace THEN TraceEnter("VisitCode") END;
  10177. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10178. NEW(in, x.inRules.Length());
  10179. FOR i := 0 TO LEN(in)-1 DO
  10180. statement := x.inRules.GetStatement(i);
  10181. WITH statement: SyntaxTree.Assignment DO
  10182. Evaluate(statement.right, operand);
  10183. result := operand.op;
  10184. NEW(str, 64);
  10185. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10186. in[i] := result; IntermediateCode.SetString(in[i], str);
  10187. ReleaseIntermediateOperand(operand.tag);
  10188. END;
  10189. END;
  10190. ELSE in := NIL
  10191. END;
  10192. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10193. NEW(out, x.outRules.Length());
  10194. FOR i := 0 TO LEN(out)-1 DO
  10195. statement := x.outRules.GetStatement(i);
  10196. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10197. WITH statement: SyntaxTree.Assignment DO
  10198. Designate(statement.left, operand);
  10199. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10200. NEW(str, 64);
  10201. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10202. out[i] := result; IntermediateCode.SetString(out[i], str);
  10203. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10204. |statement: SyntaxTree.ReturnStatement DO
  10205. NEW(str, 64);
  10206. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10207. IF currentIsInline THEN
  10208. map := currentMapper.Get(NIL);
  10209. Designate(map.to, operand);
  10210. IF map.isAddress THEN
  10211. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10212. ELSE
  10213. result := operand.op;
  10214. END;
  10215. (*! only if it does not fit into register
  10216. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10217. *)
  10218. (*Evaluate(map.to, operand);*)
  10219. out[i] := result;
  10220. ELSE
  10221. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10222. END;
  10223. IntermediateCode.SetString(out[i], str);
  10224. ReleaseIntermediateOperand(operand.tag);
  10225. return := out[i];
  10226. ELSE
  10227. END;
  10228. END;
  10229. ELSE out := NIL
  10230. END;
  10231. Emit(Asm(x.position,x.sourceCode, in, out));
  10232. IF in # NIL THEN
  10233. FOR i := 0 TO LEN(in)-1 DO
  10234. ReleaseIntermediateOperand(in[i]);
  10235. END;
  10236. END;
  10237. IF out # NIL THEN
  10238. FOR i := 0 TO LEN(out)-1 DO
  10239. WITH statement: SyntaxTree.Assignment DO
  10240. ReleaseIntermediateOperand(out[i]);
  10241. |statement: SyntaxTree.ReturnStatement DO
  10242. (* release happens below *)
  10243. ELSE
  10244. END;
  10245. statement := x.outRules.GetStatement(i);
  10246. END;
  10247. END;
  10248. IF return.mode # IntermediateCode.Undefined THEN
  10249. IF currentIsInline THEN
  10250. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10251. Symbol(procedureType.returnParameter, par);
  10252. MakeMemory(mem, par.op, return.type, 0);
  10253. ReleaseOperand(par);
  10254. Emit(Mov(position, mem, return));
  10255. ReleaseIntermediateOperand(mem);
  10256. ELSE
  10257. Emit(Return(position,return));
  10258. END;
  10259. ReleaseIntermediateOperand(return);
  10260. IF currentIsInline THEN RETURN END;
  10261. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10262. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10263. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10264. ELSE
  10265. parametersSize := 0;
  10266. END;
  10267. EmitLeave(section, position,procedure, callingConvention);
  10268. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10269. END;
  10270. IF Trace THEN TraceExit("VisitCode") END;
  10271. END VisitCode;
  10272. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10273. BEGIN
  10274. RETURN ProcedureParametersSize(system, procedure);
  10275. END ProcParametersSize;
  10276. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10277. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10278. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10279. const, call: IntermediateCode.Operand;
  10280. parameterDesignator: SyntaxTree.Expression;
  10281. saved: RegisterEntry;
  10282. name: Basic.SegmentedName;
  10283. BEGIN
  10284. IF Trace THEN TraceEnter("ParameterCopies") END;
  10285. parameter := x.firstParameter;
  10286. WHILE parameter # NIL DO
  10287. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10288. type := parameter.type.resolved;
  10289. IF IsOpenArray(type) THEN
  10290. VisitParameter(parameter);
  10291. op := result;
  10292. IF backend.cooperative & parameter.NeedsTrace() THEN
  10293. length := GetArrayLength(type, op.tag);
  10294. size := NewRegisterOperand(addressType);
  10295. base := ArrayBaseType(type);
  10296. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10297. Emit(Mul(position, size, length, const));
  10298. dst := NewRegisterOperand (addressType);
  10299. Emit(Mov(position, dst, size));
  10300. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10301. Emit(Sub(position,dst,sp,dst));
  10302. Emit(And(position,dst,dst,const));
  10303. Emit(Mov(position,sp,dst));
  10304. par := fp;
  10305. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10306. IntermediateCode.InitImmediate(null, byteType, 0);
  10307. Emit(Fill(position, dst, size, null));
  10308. ReleaseIntermediateOperand(dst);
  10309. ReleaseIntermediateOperand(length);
  10310. SaveRegisters();ReleaseUsedRegisters(saved);
  10311. (* register dst has been freed before SaveRegisters already *)
  10312. base := ArrayBaseType(type);
  10313. (* assign method of open array *)
  10314. IF base.IsRecordType() THEN
  10315. Emit (Push(position, length));
  10316. Emit (Push(position, dst));
  10317. Emit (Push(position, op.op));
  10318. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10320. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10321. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10322. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10323. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10324. Emit (Push(position,length));
  10325. Emit (Push(position, dst));
  10326. Emit (Push(position, length));
  10327. Emit (Push(position, op.op));
  10328. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10329. ELSE
  10330. Emit (Push(position, length));
  10331. Emit (Push(position, dst));
  10332. Emit (Push(position, length));
  10333. Emit (Push(position, op.op));
  10334. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10335. ASSERT(ArrayBaseType(type).IsPointer());
  10336. END;
  10337. RestoreRegisters(saved);
  10338. ELSE
  10339. temp := GetDynamicSize(type,op.tag);
  10340. ReuseCopy(size,temp);
  10341. ReleaseIntermediateOperand(temp);
  10342. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10343. Emit(Sub(position,size,sp,size));
  10344. Emit(And(position,size,size,const));
  10345. Emit(Mov(position,sp,size));
  10346. par := fp;
  10347. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10348. ReleaseIntermediateOperand(size);
  10349. size := GetDynamicSize(type,op.tag);
  10350. END;
  10351. Emit(Copy(position,sp,op.op,size));
  10352. ReleaseIntermediateOperand(size);
  10353. ReleaseOperand(op);
  10354. IntermediateCode.MakeMemory(par,addressType);
  10355. Emit(Mov(position,par,sp));
  10356. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10357. checker.SetCurrentScope(currentScope);
  10358. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10359. Assign(parameterDesignator,parameterDesignator);
  10360. END;
  10361. END;
  10362. parameter := parameter.nextParameter;
  10363. END;
  10364. IF Trace THEN TraceExit("ParameterCopies") END;
  10365. END ParameterCopies;
  10366. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10367. VAR x: SyntaxTree.Variable;
  10368. BEGIN
  10369. x := scope.firstVariable;
  10370. WHILE x # NIL DO
  10371. InitVariable(x,FALSE);
  10372. x := x.nextVariable;
  10373. END;
  10374. END InitVariables;
  10375. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10376. BEGIN
  10377. IF (symbol # NIL) THEN
  10378. RETURN fingerPrinter.SymbolFP(symbol).public
  10379. ELSE
  10380. RETURN 0
  10381. END;
  10382. END GetFingerprint;
  10383. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10384. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10385. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10386. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10387. name: Basic.SegmentedName;
  10388. offset: LONGINT;
  10389. BEGIN
  10390. IF Trace THEN TraceEnter("Body") END;
  10391. ReleaseUsedRegisters(saved); (* just in case ... *)
  10392. section := ir;
  10393. exitLabel := NewLabel ();
  10394. IF moduleBody THEN moduleBodySection := section END;
  10395. IF ir.comments # NIL THEN
  10396. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10397. commentPrintout.SingleStatement(TRUE);
  10398. dump := ir.comments;
  10399. ELSE
  10400. commentPrintout := NIL;
  10401. dump := NIL;
  10402. END;
  10403. prevScope := currentScope;
  10404. currentScope := scope;
  10405. lastSwitchPC := 0;
  10406. cooperativeSwitches := backend.cooperative;
  10407. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10408. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10409. IF x # NIL THEN
  10410. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10411. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10412. IF moduleBody THEN
  10413. ProfilerInit();
  10414. ELSE
  10415. Basic.SegmentedNameToString(ir.name, string);
  10416. ProfilerAddProcedure(numberProcedures,string);
  10417. ProfilerEnterExit(numberProcedures,TRUE);
  10418. END;
  10419. END;
  10420. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10421. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10422. END;
  10423. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10424. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10425. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10426. IF procedure = cellScope.bodyProcedure THEN
  10427. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10428. StaticCallOperand(op, cellScope.constructor);
  10429. Emit(Call(position,op.op,0));
  10430. END;
  10431. END;
  10432. END;
  10433. InitVariables(scope);
  10434. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10435. GetCodeSectionNameForSymbol(procedure, name);
  10436. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10437. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10438. IF ProtectModulesPointers THEN
  10439. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10440. ELSE
  10441. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10442. END;
  10443. IntermediateCode.SetOffset(right,offset); (* tag *)
  10444. IntermediateCode.InitMemory(left,addressType,fp,0);
  10445. Emit(Mov(position, left, right));
  10446. END;
  10447. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10448. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10449. ParameterCopies(procedureType);
  10450. IF x.code = NIL THEN
  10451. VisitStatementBlock(x);
  10452. ELSE
  10453. VisitCode(x.code)
  10454. END;
  10455. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10456. IF ~backend.cooperative THEN
  10457. ProfilerEnterExit(numberProcedures,FALSE);
  10458. END;
  10459. INC(numberProcedures);
  10460. END;
  10461. END;
  10462. IF backend.cooperative THEN
  10463. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10464. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10465. END;
  10466. IF x # NIL THEN
  10467. SELF.position := x.position;
  10468. END;
  10469. CheckRegistersFree();
  10470. ASSERT(modifyAssignmentCounter = 0);
  10471. currentScope := prevScope;
  10472. IF Trace THEN TraceExit("Body") END;
  10473. END Body;
  10474. END ImplementationVisitor;
  10475. MetaDataGenerator=OBJECT
  10476. VAR
  10477. implementationVisitor: ImplementationVisitor;
  10478. declarationVisitor: DeclarationVisitor;
  10479. module: Sections.Module;
  10480. moduleName: ARRAY 128 OF CHAR;
  10481. moduleNamePool: Basic.HashTableInt;
  10482. moduleNamePoolSection: IntermediateCode.Section;
  10483. modulePointerSection: IntermediateCode.Section;
  10484. modulePointerSizePC: LONGINT;
  10485. modulePointerSectionOffset: LONGINT;
  10486. modulePointers: LONGINT;
  10487. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10488. RecordBaseOffset: LONGINT;
  10489. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10490. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10491. TypeTags: LONGINT; (* type extension level support *)
  10492. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10493. patchInfoPC: LONGINT;
  10494. patchCRC: LONGINT;
  10495. CONST
  10496. EmptyBlockOffset = 2;
  10497. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10498. BEGIN
  10499. IF implementationVisitor.backend.cooperative THEN
  10500. TypeTags := MAX(LONGINT);
  10501. BaseTypesTableOffset := 0;
  10502. MethodTableOffset := 2;
  10503. TypeRecordBaseOffset := 0;
  10504. RecordBaseOffset := 0;
  10505. ELSIF simple THEN
  10506. TypeTags := 3; (* only 3 extensions allowed *)
  10507. BaseTypesTableOffset := 1;
  10508. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10509. TypeRecordBaseOffset := 0;
  10510. RecordBaseOffset := 1;
  10511. ELSE
  10512. TypeTags := 16;
  10513. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10514. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10515. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10516. (* change this when Heaps.HeapBlock is modified *)
  10517. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10518. RecordBaseOffset := 8; (* addresses *)
  10519. ELSE
  10520. RecordBaseOffset := 9; (* addresses *)
  10521. END;
  10522. END;
  10523. SELF.simple := simple;
  10524. SELF.implementationVisitor := implementationVisitor;
  10525. SELF.declarationVisitor := declarationVisitor;
  10526. implementationVisitor.meta := SELF;
  10527. declarationVisitor.meta := SELF;
  10528. END InitMetaDataGenerator;
  10529. PROCEDURE SetModule(module: Sections.Module);
  10530. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10531. BEGIN
  10532. SELF.module := module;
  10533. Global.GetModuleName(module.module,moduleName);
  10534. Global.GetSymbolSegmentedName(module.module, name);
  10535. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10536. NEW(moduleNamePool, 32);
  10537. (*! require GC protection *)
  10538. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10539. IF ProtectModulesPointers THEN
  10540. name := "Heaps.AnyPtr";
  10541. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10542. (* set base pointer *)
  10543. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10544. END;
  10545. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10546. modulePointers := 0;
  10547. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10548. AddPointer(moduleNamePoolSection, namePoolOffset);
  10549. END;
  10550. END SetModule;
  10551. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10552. BEGIN
  10553. IF ~implementationVisitor.backend.cooperative THEN
  10554. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10555. INC(modulePointers);
  10556. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10557. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10558. END;
  10559. END AddPointer;
  10560. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10561. BEGIN
  10562. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10563. END GetTypeRecordBaseOffset;
  10564. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10565. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10566. BEGIN
  10567. (* change this when Heaps.HeapBlock is modified *)
  10568. INC(dataAdrOffset,7);
  10569. Info(section,"headerAdr");
  10570. Address(section,0);
  10571. Info(section,"typeDesc");
  10572. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10573. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10574. NamedSymbol(section, name, symbol, 0, offset);
  10575. Info(section,"mark: LONGINT;");
  10576. Longint(section,-1);
  10577. Info(section,"refCount: LONGINT;");
  10578. Longint(section,0);
  10579. (*
  10580. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10581. *)
  10582. Info(section,"dataAdr-: ADDRESS");
  10583. Symbol(section,section, dataAdrOffset,0);
  10584. Info(section,"size-: SIZE");
  10585. Address(section,0);
  10586. Info(section,"nextMark: HeapBlock;");
  10587. Address(section,0);
  10588. END HeapBlock;
  10589. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10590. VAR i: LONGINT;
  10591. BEGIN
  10592. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10593. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10594. Info(section,"count*: LONGINT");
  10595. Longint(section,0);
  10596. Info(section,"locked*: BOOLEAN");
  10597. Longint(section,0);
  10598. Info(section,"awaitingLock*: ProcessQueue");
  10599. Address(section,0);
  10600. Address(section,0);
  10601. Info(section,"awaitingCond*: ProcessQueue");
  10602. Address(section,0);
  10603. Address(section,0);
  10604. Info(section,"lockedBy*: ANY");
  10605. Address(section,0);
  10606. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10607. Longint(section,1);
  10608. FOR i := 2 TO 6 DO
  10609. Longint(section,0);
  10610. END;
  10611. Info(section,"lock*: ANY");
  10612. Address(section,0);
  10613. END ProtectedHeapBlock;
  10614. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10615. BEGIN
  10616. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10617. END Info;
  10618. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10619. VAR op: IntermediateCode.Operand;
  10620. BEGIN
  10621. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10622. section.Emit(Data(Basic.invalidPosition,op));
  10623. END Address;
  10624. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10625. VAR op: IntermediateCode.Operand;
  10626. BEGIN
  10627. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10628. section.Emit(Data(Basic.invalidPosition,op));
  10629. END Size;
  10630. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10631. VAR op: IntermediateCode.Operand;
  10632. BEGIN
  10633. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10634. section.Emit(Data(Basic.invalidPosition,op));
  10635. END Set;
  10636. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10637. VAR op: IntermediateCode.Operand;
  10638. BEGIN
  10639. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10640. section.Emit(Data(Basic.invalidPosition,op));
  10641. END Longint;
  10642. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10643. VAR op,noOperand: IntermediateCode.Operand;
  10644. BEGIN
  10645. IntermediateCode.InitOperand(noOperand);
  10646. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10647. section.PatchOperands(pc,op,noOperand,noOperand);
  10648. END PatchAddress;
  10649. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10650. VAR op,noOperand: IntermediateCode.Operand;
  10651. BEGIN
  10652. IntermediateCode.InitOperand(noOperand);
  10653. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10654. section.PatchOperands(pc,op,noOperand,noOperand);
  10655. END PatchSize;
  10656. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10657. VAR op,noOperand: IntermediateCode.Operand;
  10658. BEGIN
  10659. IntermediateCode.InitOperand(noOperand);
  10660. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10661. section.PatchOperands(pc,op,noOperand,noOperand);
  10662. END PatchLongint;
  10663. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10664. VAR op, noOperand: IntermediateCode.Operand;
  10665. BEGIN
  10666. IntermediateCode.InitOperand(noOperand);
  10667. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10668. section.PatchOperands(pc,op,noOperand,noOperand);
  10669. END PatchSymbol;
  10670. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10671. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10672. BEGIN
  10673. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10674. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10675. section.Emit(Data(Basic.invalidPosition,op));
  10676. END Boolean;
  10677. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10678. VAR op: IntermediateCode.Operand;
  10679. BEGIN
  10680. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10681. section.Emit(Data(Basic.invalidPosition,op));
  10682. END Char;
  10683. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10684. VAR op: IntermediateCode.Operand;
  10685. BEGIN
  10686. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10687. section.Emit(Data(Basic.invalidPosition,op));
  10688. END Integer;
  10689. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10690. VAR i: LONGINT;
  10691. BEGIN
  10692. Info(section,str);
  10693. i := 0;
  10694. WHILE(str[i] # 0X) DO
  10695. Char(section,str[i]);
  10696. INC(i);
  10697. END;
  10698. Char(section,0X);
  10699. END String;
  10700. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10701. VAR s: Basic.SectionName;
  10702. BEGIN
  10703. StringPool.GetString(str, s);
  10704. String(section, s);
  10705. END String0;
  10706. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10707. VAR op: IntermediateCode.Operand;
  10708. BEGIN
  10709. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10710. IntermediateCode.SetOffset(op,realOffset);
  10711. section.Emit(Data(Basic.invalidPosition,op));
  10712. END NamedSymbol;
  10713. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10714. VAR op: IntermediateCode.Operand;
  10715. BEGIN
  10716. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10717. IntermediateCode.SetOffset(op,realOffset);
  10718. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10719. END NamedSymbolAt;
  10720. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10721. BEGIN
  10722. IF symbol= NIL THEN
  10723. Address( section, realOffset);
  10724. ASSERT(virtualOffset = 0);
  10725. ELSE
  10726. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10727. END;
  10728. END Symbol;
  10729. (* OutPointers delivers
  10730. {pointerOffset}
  10731. *)
  10732. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10733. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10734. BEGIN
  10735. type := type.resolved;
  10736. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10737. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10738. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10739. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10740. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10741. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10742. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10743. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10744. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10745. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10746. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10747. ELSIF (type IS SyntaxTree.RecordType) THEN
  10748. (* never treat a record like a pointer, even if the pointer field is set! *)
  10749. WITH type: SyntaxTree.RecordType DO
  10750. base := type.GetBaseRecord();
  10751. IF base # NIL THEN
  10752. Pointers(offset,symbol,section, base,numberPointers);
  10753. END;
  10754. variable := type.recordScope.firstVariable;
  10755. WHILE(variable # NIL) DO
  10756. IF ~(variable.untraced) THEN
  10757. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10758. END;
  10759. variable := variable.nextVariable;
  10760. END;
  10761. END;
  10762. ELSIF (type IS SyntaxTree.CellType) THEN
  10763. WITH type: SyntaxTree.CellType DO
  10764. base := type.GetBaseRecord();
  10765. IF base # NIL THEN
  10766. Pointers(offset,symbol,section, base,numberPointers);
  10767. END;
  10768. variable := type.cellScope.firstVariable;
  10769. WHILE(variable # NIL) DO
  10770. IF ~(variable.untraced) THEN
  10771. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10772. END;
  10773. variable := variable.nextVariable;
  10774. END;
  10775. property := type.firstProperty;
  10776. WHILE(property # NIL) DO
  10777. IF ~(property.untraced) THEN
  10778. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10779. END;
  10780. property := property.nextProperty;
  10781. END;
  10782. parameter := type.firstParameter;
  10783. WHILE(parameter # NIL) DO
  10784. IF ~(parameter.untraced) THEN
  10785. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10786. END;
  10787. parameter := parameter.nextParameter;
  10788. END;
  10789. END;
  10790. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10791. WITH type: SyntaxTree.ArrayType DO
  10792. IF type.form= SyntaxTree.Static THEN
  10793. n := type.staticLength;
  10794. base := type.arrayBase.resolved;
  10795. WHILE(base IS SyntaxTree.ArrayType) DO
  10796. type := base(SyntaxTree.ArrayType);
  10797. n := n* type.staticLength;
  10798. base := type.arrayBase.resolved;
  10799. END;
  10800. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10801. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10802. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10803. FOR i := 0 TO n-1 DO
  10804. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10805. END;
  10806. END;
  10807. ELSE
  10808. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10809. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10810. END;
  10811. END;
  10812. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10813. WITH type: SyntaxTree.MathArrayType DO
  10814. IF type.form = SyntaxTree.Static THEN
  10815. n := type.staticLength;
  10816. base := type.arrayBase.resolved;
  10817. WHILE(base IS SyntaxTree.MathArrayType) DO
  10818. type := base(SyntaxTree.MathArrayType);
  10819. n := n* type.staticLength;
  10820. base := type.arrayBase.resolved;
  10821. END;
  10822. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10823. IF SemanticChecker.ContainsPointer(base) THEN
  10824. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10825. FOR i := 0 TO n-1 DO
  10826. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10827. END;
  10828. END;
  10829. ELSE
  10830. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10831. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10832. END
  10833. END;
  10834. (* ELSE no pointers in type *)
  10835. END;
  10836. END Pointers;
  10837. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10838. VAR position,i: LONGINT; ch: CHAR;
  10839. BEGIN
  10840. IF pool.Has(index) THEN
  10841. RETURN pool.GetInt(index)
  10842. ELSE
  10843. position := source.pc;
  10844. pool.PutInt(index, position);
  10845. Info(source, name);
  10846. i := 0;
  10847. REPEAT
  10848. ch := name[i]; INC(i);
  10849. Char( source, ch);
  10850. UNTIL ch = 0X;
  10851. END;
  10852. RETURN position;
  10853. END EnterDynamicName;
  10854. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10855. VAR name: Basic.SectionName; position: LONGINT;
  10856. BEGIN
  10857. IF pool.Has(index) THEN
  10858. RETURN pool.GetInt(index)
  10859. ELSE
  10860. StringPool.GetString(index, name);
  10861. position := EnterDynamicName(source,name,index, pool);
  10862. END;
  10863. RETURN position;
  10864. END DynamicName;
  10865. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10866. VAR section: IntermediateCode.Section;
  10867. BEGIN
  10868. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10869. IF implementationVisitor.backend.cooperative THEN
  10870. Info(section, "TypeDescriptor");
  10871. Basic.ToSegmentedName("BaseTypes.Array", name);
  10872. NamedSymbol(section, name,NIL, 0, 0);
  10873. BasePointer(section);
  10874. offset := 0;
  10875. ELSE
  10876. IF ProtectModulesPointers THEN
  10877. HeapBlock(mName,typeName,section,2);
  10878. END;
  10879. Info(section, "HeapBlock");
  10880. IF ProtectModulesPointers THEN
  10881. Symbol(section,section,2,0);
  10882. ELSE
  10883. Address(section,0);
  10884. END;
  10885. Info(section, "TypeDescriptor");
  10886. Address(section,0);
  10887. offset := section.pc;
  10888. END;
  10889. RETURN section
  10890. END NamedBlock;
  10891. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10892. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10893. BEGIN
  10894. COPY(moduleName,name);
  10895. Strings.Append(name,suffix);
  10896. Basic.ToSegmentedName(name, pooledName);
  10897. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10898. END Block;
  10899. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10900. VAR name: Basic.SegmentedName;
  10901. BEGIN
  10902. Info(source,"ArrayHeader");
  10903. IF implementationVisitor.backend.cooperative THEN
  10904. sizePC := source.pc;
  10905. Address(source,0);
  10906. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10907. IF baseType # "" THEN
  10908. Basic.ToSegmentedName(baseType, name);
  10909. NamedSymbol(source, name,NIL, 0, 0);
  10910. ELSE
  10911. Address(source,0);
  10912. END;
  10913. Address(source,0);
  10914. ELSE
  10915. Address(source,0);
  10916. Address(source,0);
  10917. (* first pointer for GC *)
  10918. IF hasPointer THEN
  10919. (* points to first element in the array, this is NOT the base type descriptor *)
  10920. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10921. ELSE
  10922. Address(source,0);
  10923. END;
  10924. sizePC := source.pc;
  10925. Address(source,0);
  10926. Info(source,"array data");
  10927. END;
  10928. END ArrayBlock;
  10929. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10930. BEGIN
  10931. IF implementationVisitor.backend.cooperative THEN
  10932. PatchSize(section, pc, size);
  10933. PatchSize(section, pc + 3, size);
  10934. ELSE
  10935. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10936. PatchSize(section, pc, size);
  10937. END;
  10938. END PatchArray;
  10939. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10940. VAR
  10941. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10942. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10943. poolMap: Basic.HashTableInt;
  10944. namePool: IntermediateCode.Section;
  10945. namePoolOffset: LONGINT;
  10946. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10947. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10948. BEGIN
  10949. Basic.SegmentedNameToString(s1.name,n1);
  10950. Basic.SegmentedNameToString(s2.name,n2);
  10951. index := 0;
  10952. ch1 := n1[index];
  10953. ch2 := n2[index];
  10954. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10955. INC(index);
  10956. ch1 := n1[index];
  10957. ch2 := n2[index];
  10958. END;
  10959. RETURN ch1 < ch2;
  10960. END Compare;
  10961. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10962. VAR
  10963. i, j: LONGINT;
  10964. x, t: Sections.Section;
  10965. BEGIN
  10966. IF lo < hi THEN
  10967. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10968. WHILE i <= j DO
  10969. WHILE Compare(list[i], x) DO INC(i) END;
  10970. WHILE Compare(x, list[j]) DO DEC(j) END;
  10971. IF i <= j THEN
  10972. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10973. INC(i); DEC(j)
  10974. END
  10975. END;
  10976. IF lo < j THEN QuickSort(list, lo, j) END;
  10977. IF i < hi THEN QuickSort(list, i, hi) END
  10978. END;
  10979. END QuickSort;
  10980. (*
  10981. ExportDesc* = RECORD
  10982. fp*: ADDRESS;
  10983. name* {UNTRACED}: DynamicName;
  10984. adr*: ADDRESS;
  10985. exports*: LONGINT;
  10986. dsc* {UNTRACED}: ExportArray
  10987. END;
  10988. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10989. *)
  10990. PROCEDURE ExportDesc2(
  10991. source: IntermediateCode.Section;
  10992. namePool: IntermediateCode.Section;
  10993. fingerPrinter: FingerPrinter.FingerPrinter;
  10994. symbol: Sections.Section;
  10995. name: StringPool.Index;
  10996. VAR patchAdr: LONGINT
  10997. ): BOOLEAN;
  10998. VAR fingerPrint: SyntaxTree.FingerPrint;
  10999. BEGIN
  11000. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11001. & (symbol.type # Sections.InlineCodeSection)
  11002. THEN
  11003. *)
  11004. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11005. & (symbol.type # Sections.ExitCodeSection)
  11006. & (symbol.type # Sections.InlineCodeSection))
  11007. THEN
  11008. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11009. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11010. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11011. Longint(source,fingerPrint.public);
  11012. ELSE
  11013. Longint(source, 0);
  11014. END;
  11015. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11016. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11017. Symbol(source, symbol,0,0);
  11018. patchAdr := source.pc;
  11019. Longint(source, 0);
  11020. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11021. Address(source,0);
  11022. END;
  11023. RETURN TRUE
  11024. ELSE
  11025. RETURN FALSE
  11026. END;
  11027. END ExportDesc2;
  11028. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11029. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11030. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11031. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11032. nextPatch: LONGINT;
  11033. TYPE
  11034. Scope = RECORD
  11035. elements: LONGINT;
  11036. gelements: LONGINT;
  11037. section: IntermediateCode.Section;
  11038. patchAdr: LONGINT;
  11039. arraySizePC: LONGINT;
  11040. beginPC: LONGINT; (* current scope start pc *)
  11041. END;
  11042. BEGIN
  11043. Basic.InitSegmentedName(prev);
  11044. olevel := -1;
  11045. scopes[0].section := source;
  11046. scopes[0].arraySizePC := MIN(LONGINT);
  11047. FOR s := 0 TO LEN(sections)-1 DO
  11048. symbol := sections[s];
  11049. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  11050. this := sections[s].name;
  11051. level := 0;
  11052. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11053. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11054. INC(level);
  11055. END;
  11056. WHILE level < olevel DO
  11057. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11058. IF olevel > 0 THEN
  11059. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11060. nextPatch := scopes[olevel-1].patchAdr+1;
  11061. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11062. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11063. END;
  11064. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11065. DEC(olevel);
  11066. END;
  11067. IF (level < LEN(this)) & (this[level] > 0) THEN
  11068. IF level > olevel THEN
  11069. (*TRACE("opening",level); *)
  11070. IF scopes[level].section = NIL THEN
  11071. arrayName := ".@ExportArray";
  11072. Strings.AppendInt(arrayName, level);
  11073. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11074. AddPointer(scopes[level].section,offset);
  11075. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11076. END;
  11077. scopes[level].beginPC := scopes[level].section.pc;
  11078. olevel := level;
  11079. scopes[olevel].elements := 0;
  11080. END;
  11081. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11082. sym := sections[s];
  11083. ELSE
  11084. sym := NIL;
  11085. END;
  11086. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11087. THEN
  11088. INC(scopes[olevel].elements);
  11089. END;
  11090. (* enter string in scope *)
  11091. INC(level);
  11092. END;
  11093. END;
  11094. Basic.SegmentedNameToString(this, name);
  11095. prev := this;
  11096. END;
  11097. END;
  11098. WHILE 0 <= olevel DO
  11099. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11100. IF olevel > 0 THEN
  11101. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11102. nextPatch := scopes[olevel-1].patchAdr+1;
  11103. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11104. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11105. END;
  11106. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11107. DEC(olevel);
  11108. END;
  11109. level := 0;
  11110. WHILE (level < LEN(scopes)) DO
  11111. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11112. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11113. END;
  11114. INC(level);
  11115. END;
  11116. END Export;
  11117. BEGIN
  11118. NEW(fingerPrinter);
  11119. NEW(poolMap, 64);
  11120. (* 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 *)
  11121. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11122. NEW(sectionArray, module.allSections.Length());
  11123. FOR i := 0 TO module.allSections.Length() - 1 DO
  11124. section := module.allSections.GetSection(i);
  11125. sectionArray[i] := section;
  11126. END;
  11127. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11128. Export(sectionArray^);
  11129. END ExportDesc;
  11130. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11131. VAR
  11132. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11133. BEGIN
  11134. Info(source, "exception table offsets array descriptor");
  11135. size := 0;
  11136. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11137. Info(source, "exception table content");
  11138. FOR i := 0 TO module.allSections.Length() - 1 DO
  11139. p := module.allSections.GetSection(i);
  11140. IF p.type = Sections.CodeSection THEN
  11141. finallyPC := p(IntermediateCode.Section).finally;
  11142. IF finallyPC>=0 THEN
  11143. Symbol( source, p, 0,0);
  11144. Symbol( source, p, finallyPC, 0);
  11145. Symbol( source, p, finallyPC,0);
  11146. INC(size);
  11147. END;
  11148. END
  11149. END;
  11150. PatchArray(source,sizePC,size);
  11151. END ExceptionArray;
  11152. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11153. VAR i: LONGINT; ch: CHAR;
  11154. BEGIN
  11155. i := 0;
  11156. REPEAT
  11157. ch := name[i]; INC(i);
  11158. Char( section, ch);
  11159. UNTIL ch = 0X;
  11160. WHILE i < 32 DO
  11161. Char( section, 0X); INC(i);
  11162. END;
  11163. END Name;
  11164. PROCEDURE References(section: IntermediateCode.Section);
  11165. CONST
  11166. sfTypeNone = 0X;
  11167. sfTypeCHAR = 01X;
  11168. sfTypeCHAR8 = 02X;
  11169. sfTypeCHAR16 = 03X;
  11170. sfTypeCHAR32 = 04X;
  11171. sfTypeRANGE = 05X;
  11172. sfTypeSHORTINT = 06X;
  11173. sfTypeINTEGER = 07X;
  11174. sfTypeLONGINT = 08X;
  11175. sfTypeHUGEINT = 09X;
  11176. sfTypeWORD = 0AX;
  11177. sfTypeLONGWORD = 0BX;
  11178. sfTypeSIGNED8 = 0CX;
  11179. sfTypeSIGNED16 = 0DX;
  11180. sfTypeSIGNED32 = 0EX;
  11181. sfTypeSIGNED64 = 0FX;
  11182. sfTypeUNSIGNED8 = 10X;
  11183. sfTypeUNSIGNED16 = 11X;
  11184. sfTypeUNSIGNED32 = 12X;
  11185. sfTypeUNSIGNED64 = 13X;
  11186. sfTypeREAL = 14X;
  11187. sfTypeLONGREAL = 15X;
  11188. sfTypeCOMPLEX = 16X;
  11189. sfTypeLONGCOMPLEX = 17X;
  11190. sfTypeBOOLEAN = 18X;
  11191. sfTypeSET = 19X;
  11192. sfTypeANY = 1AX;
  11193. sfTypeOBJECT = 1BX;
  11194. sfTypeBYTE = 1CX;
  11195. sfTypeADDRESS = 1DX;
  11196. sfTypeSIZE = 1EX;
  11197. sfTypeIndirect = 1FX;
  11198. sfTypeRecord = 20X;
  11199. sfTypePointerToRecord = 21X;
  11200. sfTypePointerToArray = 22X;
  11201. sfTypeOpenArray = 23X;
  11202. sfTypeStaticArray = 24X;
  11203. sfTypeDynamicArray = 25X;
  11204. sfTypeMathStaticArray = 26X;
  11205. sfTypeMathOpenArray = 27X;
  11206. sfTypeMathTensor = 28X;
  11207. sfTypeProcedure = 29X;
  11208. sfTypeDelegate = 2AX;
  11209. sfTypeENUM = 2BX;
  11210. sfTypeCELL = 2CX;
  11211. sfTypePORT = 2DX;
  11212. sfIN = 0X;
  11213. sfOUT = 1X;
  11214. flagDelegate = 0;
  11215. flagConstructor = 1;
  11216. (* variable / parameter addressing modes *)
  11217. sfAbsolute = 0X; (* global vars *)
  11218. sfRelative = 1X; (* variables, value parameters *)
  11219. sfIndirect = 2X; (* var parameters *)
  11220. sfScopeBegin = 0F0X;
  11221. sfScopeEnd = 0F1X;
  11222. sfProcedure = 0F2X;
  11223. sfVariable = 0F3X;
  11224. sfTypeDeclaration = 0F4X;
  11225. sfModule = 0FFX;
  11226. RefInfo = TRUE;
  11227. VAR
  11228. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11229. indirectTypes: Basic.HashTable;
  11230. PROCEDURE CurrentIndex(): LONGINT;
  11231. VAR i: LONGINT;
  11232. BEGIN
  11233. FOR i := startPC TO section.pc -1 DO
  11234. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11235. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11236. END;
  11237. startPC := section.pc;
  11238. RETURN lastOffset;
  11239. END CurrentIndex;
  11240. (*
  11241. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11242. Module = sfModule prevSymbol:SIZE name:String Scope.
  11243. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11244. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11245. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11246. Type =
  11247. sfTypePointerToRecord
  11248. | sfTypePointerToArray Type
  11249. | sfTypeOpenArray Type
  11250. | sfTypeDynamicArray Type
  11251. | sfTypeStaticArray length:SIZE Type
  11252. | sfTypeMathOpenArray Type
  11253. | sfTypeMathStaticArray length:SIZE Type
  11254. | sfTypeMathTensor Type
  11255. | sfTypeRecord tdAdr:ADDRESS
  11256. | sfTypeProcedure {Parameter} return:Type
  11257. | sfTypeDelegate {Parameter} return:Type
  11258. | sfTypePort (sfIN | sfOUT)
  11259. | sfTypeBOOLEAN
  11260. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11261. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11262. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11263. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11264. | sfTypeWORD | sfTypeLONGWORD
  11265. | sfTypeREAL | sfTypeLONGREAL
  11266. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11267. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11268. | sfTypeIndirect offset:SIZE.
  11269. *)
  11270. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11271. VAR offset: SIZE;
  11272. BEGIN
  11273. IF indirectTypes.Has(type) THEN
  11274. offset := indirectTypes.GetInt(type);
  11275. Char(section, sfTypeIndirect);
  11276. Size(section, offset);
  11277. RETURN TRUE;
  11278. ELSE
  11279. indirectTypes.PutInt(type, CurrentIndex());
  11280. RETURN FALSE;
  11281. END;
  11282. END Indirect;
  11283. PROCEDURE NType(type: SyntaxTree.Type);
  11284. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11285. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11286. BEGIN
  11287. IF type = NIL THEN
  11288. Char(section, sfTypeNone)
  11289. ELSE
  11290. type := type.resolved;
  11291. size := type.sizeInBits;
  11292. WITH type:SyntaxTree.PointerType DO
  11293. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11294. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11295. Char(section, sfTypePointerToRecord);
  11296. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11297. ELSE
  11298. IF RefInfo THEN Info(section,"PointerToArray") END;
  11299. Char(section, sfTypePointerToArray);
  11300. NType(type.pointerBase);
  11301. END;
  11302. | type: SyntaxTree.ArrayType DO
  11303. IF ~Indirect(type) THEN
  11304. IF type.form = SyntaxTree.Open THEN
  11305. IF RefInfo THEN Info(section,"OpenArray") END;
  11306. Char(section, sfTypeOpenArray);
  11307. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11308. IF RefInfo THEN Info(section,"DynamicArray") END;
  11309. Char(section, sfTypeDynamicArray);
  11310. ELSIF type.form = SyntaxTree.Static THEN
  11311. IF RefInfo THEN Info(section,"StaticArray") END;
  11312. Char(section, sfTypeStaticArray);
  11313. Size(section, type.staticLength);
  11314. ELSE
  11315. HALT(100);
  11316. END;
  11317. NType(type.arrayBase);
  11318. END;
  11319. | type: SyntaxTree.MathArrayType DO
  11320. IF ~Indirect(type) THEN
  11321. IF type.form = SyntaxTree.Open THEN
  11322. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11323. Char(section, sfTypeMathOpenArray);
  11324. ELSIF type.form = SyntaxTree.Static THEN
  11325. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11326. Char(section, sfTypeMathStaticArray);
  11327. Size(section, type.staticLength);
  11328. ELSIF type.form = SyntaxTree.Tensor THEN
  11329. IF RefInfo THEN Info(section,"MathTensor") END;
  11330. Char(section, sfTypeMathTensor);
  11331. ELSE
  11332. HALT(100);
  11333. END;
  11334. NType(type.arrayBase);
  11335. END;
  11336. | type: SyntaxTree.RecordType DO
  11337. IF ~Indirect(type) THEN
  11338. IF type.pointerType # NIL (* OBJECT *) THEN
  11339. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11340. Char(section, sfTypePointerToRecord)
  11341. ELSE
  11342. IF RefInfo THEN Info(section,"Record") END;
  11343. Char(section, sfTypeRecord);
  11344. td := type.typeDeclaration;
  11345. IF RefInfo THEN Info(section,"TD") END;
  11346. IF (td # NIL) THEN
  11347. Global.GetSymbolSegmentedName(td,segmentedName);
  11348. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11349. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11350. ELSE
  11351. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11352. END;
  11353. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11354. Symbol(section, tir, 0, offset);
  11355. ELSE
  11356. Address(section, 0);
  11357. END;
  11358. END;
  11359. END;
  11360. | type: SyntaxTree.CellType DO
  11361. IF ~Indirect(type) THEN
  11362. IF RefInfo THEN Info(section,"Record") END;
  11363. Char(section, sfTypeRecord);
  11364. td := type.typeDeclaration;
  11365. IF RefInfo THEN Info(section,"TD") END;
  11366. IF (td # NIL) THEN
  11367. Global.GetSymbolSegmentedName(td,segmentedName);
  11368. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11369. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11370. ELSE
  11371. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11372. END;
  11373. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11374. Symbol(section, tir, 0, offset);
  11375. ELSE
  11376. Address(section, 0);
  11377. END;
  11378. END;
  11379. | type: SyntaxTree.PortType DO
  11380. Char(section, sfTypePORT);
  11381. IF type.direction = SyntaxTree.OutPort THEN
  11382. Char(section, sfOUT)
  11383. ELSE
  11384. Char(section, sfIN)
  11385. END;
  11386. | type: SyntaxTree.ProcedureType DO
  11387. IF ~Indirect(type) THEN
  11388. IF type.isDelegate THEN
  11389. Char(section, sfTypeDelegate);
  11390. ELSE
  11391. Char(section, sfTypeProcedure);
  11392. END;
  11393. parameter := type.firstParameter;
  11394. WHILE(parameter # NIL) DO
  11395. NParameter(parameter, -1);
  11396. parameter := parameter.nextParameter;
  11397. END;
  11398. NType(type.returnType);
  11399. END;
  11400. | type:SyntaxTree.EnumerationType DO
  11401. Char(section, sfTypeENUM);
  11402. | type: SyntaxTree.BasicType DO
  11403. WITH type: SyntaxTree.BooleanType DO
  11404. IF RefInfo THEN Info(section,"Boolean") END;
  11405. Char(section, sfTypeBOOLEAN);
  11406. | type: SyntaxTree.CharacterType DO
  11407. IF type = module.system.characterType THEN
  11408. IF RefInfo THEN Info(section,"CHAR") END;
  11409. Char(section, sfTypeCHAR);
  11410. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11411. IF RefInfo THEN Info(section,"CHAR8") END;
  11412. Char(section, sfTypeCHAR8)
  11413. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11414. IF RefInfo THEN Info(section,"CHAR16") END;
  11415. Char(section, sfTypeCHAR16);
  11416. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11417. IF RefInfo THEN Info(section,"CHAR32") END;
  11418. Char(section, sfTypeCHAR32);
  11419. ELSE
  11420. HALT(100);
  11421. END;
  11422. |type: SyntaxTree.IntegerType DO
  11423. IF type(SyntaxTree.IntegerType).signed THEN
  11424. IF (type = module.system.shortintType) THEN
  11425. IF RefInfo THEN Info(section,"SHORTINT") END;
  11426. Char(section, sfTypeSHORTINT)
  11427. ELSIF (type = module.system.integerType) THEN
  11428. IF RefInfo THEN Info(section,"INTEGER") END;
  11429. Char(section, sfTypeINTEGER)
  11430. ELSIF (type = module.system.longintType) THEN
  11431. IF RefInfo THEN Info(section,"LONGINT") END;
  11432. Char(section, sfTypeLONGINT)
  11433. ELSIF (type = module.system.hugeintType) THEN
  11434. IF RefInfo THEN Info(section,"HUGEINT") END;
  11435. Char(section, sfTypeHUGEINT)
  11436. ELSIF (type = module.system.wordType) THEN
  11437. IF RefInfo THEN Info(section,"WORD") END;
  11438. Char(section, sfTypeWORD)
  11439. ELSIF (type = module.system.longWordType) THEN
  11440. IF RefInfo THEN Info(section,"LONGWORD") END;
  11441. Char(section, sfTypeLONGWORD);
  11442. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11443. IF RefInfo THEN Info(section,"SIGNED8") END;
  11444. Char(section, sfTypeSIGNED8)
  11445. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11446. IF RefInfo THEN Info(section,"SIGNED16") END;
  11447. Char(section, sfTypeSIGNED16)
  11448. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11449. IF RefInfo THEN Info(section,"SIGNED32") END;
  11450. Char(section, sfTypeSIGNED32)
  11451. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11452. IF RefInfo THEN Info(section,"SIGNED64") END;
  11453. Char(section, sfTypeSIGNED64)
  11454. ELSE
  11455. HALT(100);
  11456. END
  11457. ELSE (* unsigned *)
  11458. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11459. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11460. Char(section, sfTypeUNSIGNED8)
  11461. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11462. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11463. Char(section, sfTypeUNSIGNED16)
  11464. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11465. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11466. Char(section, sfTypeUNSIGNED32)
  11467. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11468. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11469. Char(section, sfTypeUNSIGNED64)
  11470. ELSE
  11471. HALT(100)
  11472. END
  11473. END;
  11474. | type: SyntaxTree.FloatType DO
  11475. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11476. IF RefInfo THEN Info(section,"REAL") END;
  11477. Char(section, sfTypeREAL);
  11478. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11479. IF RefInfo THEN Info(section,"LONGREAL") END;
  11480. Char(section, sfTypeLONGREAL);
  11481. ELSE
  11482. HALT(100);
  11483. END;
  11484. |type: SyntaxTree.ComplexType DO
  11485. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11486. IF RefInfo THEN Info(section,"COMPLEX") END;
  11487. Char(section, sfTypeCOMPLEX);
  11488. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11489. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11490. Char(section, sfTypeLONGCOMPLEX);
  11491. ELSE
  11492. HALT(100);
  11493. END;
  11494. |type:SyntaxTree.SetType DO
  11495. IF RefInfo THEN Info(section,"SET") END;
  11496. Char(section, sfTypeSET);
  11497. |type:SyntaxTree.AnyType DO
  11498. IF RefInfo THEN Info(section,"ANY") END;
  11499. Char(section, sfTypeANY);
  11500. |type:SyntaxTree.ObjectType DO
  11501. IF RefInfo THEN Info(section,"OBJECT") END;
  11502. Char(section, sfTypeOBJECT);
  11503. |type:SyntaxTree.ByteType DO
  11504. IF RefInfo THEN Info(section,"BYTE") END;
  11505. Char(section, sfTypeBYTE);
  11506. |type:SyntaxTree.RangeType DO
  11507. IF RefInfo THEN Info(section,"RANGE") END;
  11508. Char(section, sfTypeRANGE)
  11509. |type:SyntaxTree.AddressType DO
  11510. IF RefInfo THEN Info(section,"ADDRESS") END;
  11511. Char(section, sfTypeADDRESS)
  11512. |type:SyntaxTree.SizeType DO
  11513. IF RefInfo THEN Info(section,"SIZE") END;
  11514. Char(section, sfTypeSIZE)
  11515. ELSE
  11516. HALT(100)
  11517. END;
  11518. ELSE HALT(101);
  11519. END;
  11520. END;
  11521. END NType;
  11522. (*
  11523. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11524. *)
  11525. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11526. VAR pos: LONGINT; type: SyntaxTree.Type;
  11527. BEGIN
  11528. IF RefInfo THEN Info(section, "Parameter") END;
  11529. Char(section, sfVariable);
  11530. Size(section, procOffset);
  11531. String0(section, parameter.name);
  11532. type := parameter.type.resolved;
  11533. IF parameter.kind = SyntaxTree.VarParameter THEN
  11534. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11535. ELSE Char(section, sfIndirect)
  11536. END;
  11537. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11538. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11539. Char(section, sfIndirect);
  11540. ELSE
  11541. Char(section, sfRelative);
  11542. END;
  11543. ELSE
  11544. Char(section, sfRelative);
  11545. END;
  11546. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11547. NType(parameter.type);
  11548. END NParameter;
  11549. (*
  11550. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11551. *)
  11552. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11553. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11554. flags: SET;
  11555. BEGIN
  11556. IF procedure.externalName # NIL THEN RETURN END;
  11557. IF RefInfo THEN Info(section, "Procedure") END;
  11558. pos := CurrentIndex();
  11559. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11560. Char(section, sfProcedure);
  11561. Size(section, scopeOffset);
  11562. String0(section,procedure.name);
  11563. s := module.allSections.FindBySymbol(procedure);
  11564. Symbol(section,s,0,0); (* start *)
  11565. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11566. flags := {};
  11567. IF procedureType.isDelegate THEN
  11568. INCL(flags, flagDelegate);
  11569. END;
  11570. IF procedure.isConstructor THEN
  11571. INCL(flags, flagConstructor);
  11572. END;
  11573. Set(section, flags);
  11574. IF RefInfo THEN Info(section, "Parameters") END;
  11575. parameter := procedureType.firstParameter;
  11576. WHILE(parameter # NIL) DO
  11577. NParameter(parameter, pos);
  11578. parameter := parameter.nextParameter;
  11579. END;
  11580. IF procedureType.returnParameter # NIL THEN
  11581. NParameter(procedureType.returnParameter, pos);
  11582. END;
  11583. IF procedureType.selfParameter # NIL THEN
  11584. NParameter(procedureType.selfParameter, pos);
  11585. END;
  11586. IF RefInfo THEN Info(section, "ReturnType") END;
  11587. NType(procedureType.returnType);
  11588. NScope(procedure.procedureScope, pos);
  11589. END NProcedure;
  11590. (*
  11591. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11592. *)
  11593. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11594. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11595. BEGIN
  11596. IF RefInfo THEN Info(section, "Variable") END;
  11597. pos := CurrentIndex();
  11598. Char(section, sfVariable);
  11599. Size(section, scopeOffset);
  11600. String0(section, variable.name);
  11601. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11602. Char(section, sfAbsolute);
  11603. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11604. NamedSymbol(section, sn,variable, 0,0);
  11605. ELSE
  11606. Char(section, sfRelative);
  11607. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11608. END;
  11609. NType(variable.type);
  11610. s := module.allSections.FindBySymbol(variable);
  11611. END NVariable;
  11612. (*
  11613. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11614. *)
  11615. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11616. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11617. BEGIN
  11618. IF typeDeclaration = NIL THEN RETURN END;
  11619. pos := CurrentIndex();
  11620. s := module.allSections.FindBySymbol(typeDeclaration);
  11621. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11622. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11623. Char(section, sfTypeDeclaration);
  11624. Size(section, scopeOffset);
  11625. String0(section, typeDeclaration.name);
  11626. declared := typeDeclaration.declaredType.resolved;
  11627. IF (declared IS SyntaxTree.PointerType) THEN
  11628. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11629. END;
  11630. WITH declared: SyntaxTree.RecordType DO
  11631. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11632. Symbol(section, s, 0, offset);
  11633. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11634. Basic.AppendToSegmentedName(name,".@Info");
  11635. s := module.allSections.FindByName(name);
  11636. IF s # NIL THEN (* does not work for coop *)
  11637. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11638. END;
  11639. NScope(declared.recordScope, pos);
  11640. |declared: SyntaxTree.CellType DO
  11641. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11642. Symbol(section, s, 0, offset);
  11643. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11644. Basic.AppendToSegmentedName(name,".@Info");
  11645. s := module.allSections.FindByName(name);
  11646. IF s # NIL THEN
  11647. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11648. END;
  11649. NScope(declared.cellScope, pos);
  11650. ELSE
  11651. Address(section, 0);
  11652. END;
  11653. END NTypeDeclaration;
  11654. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11655. VAR pos: LONGINT;
  11656. BEGIN
  11657. pos := CurrentIndex();
  11658. Char(section,sfModule);
  11659. Size(section, prevSymbol);
  11660. String0(section, module.name);
  11661. NScope(module.moduleScope, pos);
  11662. END NModule;
  11663. (*
  11664. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11665. *)
  11666. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11667. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11668. BEGIN
  11669. IF scope = NIL THEN RETURN END;
  11670. IF RefInfo THEN Info(section, "Scope") END;
  11671. Char(section, sfScopeBegin);
  11672. variable := scope.firstVariable;
  11673. WHILE (variable # NIL) DO
  11674. NVariable(variable, prevSymbol);
  11675. variable := variable.nextVariable;
  11676. END;
  11677. WITH scope: SyntaxTree.ModuleScope DO
  11678. bodyProcedure := scope.bodyProcedure;
  11679. |scope: SyntaxTree.RecordScope DO
  11680. bodyProcedure := scope.bodyProcedure;
  11681. ELSE
  11682. bodyProcedure := NIL;
  11683. END;
  11684. IF bodyProcedure # NIL THEN
  11685. NProcedure(bodyProcedure, prevSymbol)
  11686. END;
  11687. procedure := scope.firstProcedure;
  11688. WHILE procedure # NIL DO
  11689. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11690. procedure := procedure.nextProcedure;
  11691. END;
  11692. typeDeclaration := scope.firstTypeDeclaration;
  11693. WHILE typeDeclaration # NIL DO
  11694. NTypeDeclaration(typeDeclaration, prevSymbol);
  11695. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11696. END;
  11697. Char(section, sfScopeEnd); (* scope ends *)
  11698. END NScope;
  11699. BEGIN
  11700. NEW(indirectTypes, 32);
  11701. ArrayBlock(section,sizePC,"", FALSE);
  11702. startPC := section.pc;
  11703. NModule(module.module, -1);
  11704. PatchArray(section,sizePC,CurrentIndex());
  11705. END References;
  11706. (*
  11707. Command* = RECORD
  11708. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11709. name*: Name; (* name of the procedure *)
  11710. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11711. entryAdr* : ADDRESS; (* entry address of procedure *)
  11712. END;
  11713. *)
  11714. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11715. VAR
  11716. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11717. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11718. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11719. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11720. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11721. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11722. BEGIN
  11723. RETURN
  11724. (type = NIL) OR
  11725. (type.resolved IS SyntaxTree.RecordType) OR
  11726. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11727. (type.resolved IS SyntaxTree.AnyType);
  11728. END TypeAllowed;
  11729. BEGIN
  11730. numberParameters := procedureType.numberParameters;
  11731. RETURN
  11732. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11733. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11734. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11735. END GetProcedureAllowed;
  11736. PROCEDURE WriteType(type : SyntaxTree.Type);
  11737. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11738. name: Basic.SegmentedName; offset: LONGINT;
  11739. BEGIN
  11740. IF type = NIL THEN
  11741. Address(source,0);
  11742. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11743. Address(source,1);
  11744. ELSE
  11745. type := type.resolved;
  11746. IF type IS SyntaxTree.PointerType THEN
  11747. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11748. END;
  11749. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11750. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11751. name[0] := typeDeclaration.name; name[1] := -1;
  11752. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11753. ASSERT(section # NIL);
  11754. ELSE
  11755. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11756. (* TODO *)
  11757. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11758. END;
  11759. IF implementationVisitor.backend.cooperative THEN
  11760. offset := 0;
  11761. ELSE
  11762. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11763. END;
  11764. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11765. END;
  11766. END WriteType;
  11767. BEGIN
  11768. Info(source, "command array descriptor");
  11769. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11770. numberCommands := 0;
  11771. Info(source, "command array content");
  11772. FOR i := 0 TO module.allSections.Length() - 1 DO
  11773. p := module.allSections.GetSection(i);
  11774. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11775. procedure := p.symbol(SyntaxTree.Procedure);
  11776. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11777. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11778. procedure.GetName(name);
  11779. Name(source,name);
  11780. numberParameters := procedureType.numberParameters;
  11781. (* offset of type of first parameter *)
  11782. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11783. ELSE WriteType(procedureType.firstParameter.type)
  11784. END;
  11785. (* offset of type of return parameter *)
  11786. WriteType(procedureType.returnType);
  11787. (* command name *)
  11788. (* command code offset *)
  11789. Symbol(source,p,0,0);
  11790. INC(numberCommands);
  11791. IF Trace THEN
  11792. D.Ln;
  11793. END;
  11794. END;
  11795. END
  11796. END;
  11797. PatchArray(source,sizePC,numberCommands);
  11798. END CommandArray;
  11799. (* to prevent from double import of different module aliases *)
  11800. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11801. VAR i: SyntaxTree.Import;
  11802. BEGIN
  11803. i := module.module.moduleScope.firstImport;
  11804. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11805. i := i.nextImport;
  11806. END;
  11807. RETURN i = import
  11808. END IsFirstDirectOccurence;
  11809. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11810. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11811. BEGIN
  11812. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11813. ArrayBlock(source,pc,"", FALSE);
  11814. Info(source, "import module array data");
  11815. IF implementationVisitor.backend.cooperative THEN
  11816. offset := 0;
  11817. ELSE
  11818. IF module.system.addressType.sizeInBits = 64 THEN
  11819. (* change this when Heaps.HeapBlock is modified *)
  11820. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11821. ELSE
  11822. (* change this when Heaps.HeapBlock is modified *)
  11823. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11824. END;
  11825. END;
  11826. import := module.module.moduleScope.firstImport;
  11827. numberImports := 0;
  11828. WHILE import # NIL DO
  11829. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11830. Global.GetModuleSegmentedName(import.module,name);
  11831. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11832. NamedSymbol(source, name, NIL, 0, offset);
  11833. INC(numberImports);
  11834. END;
  11835. import := import.nextImport
  11836. END;
  11837. PatchArray(source,pc,numberImports);
  11838. END ImportsArray;
  11839. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11840. VAR
  11841. p: Sections.Section; sizePC, size, i: LONGINT;
  11842. BEGIN
  11843. Info(source, "Type info section");
  11844. size := 0;
  11845. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11846. FOR i := 0 TO module.allSections.Length() - 1 DO
  11847. p := module.allSections.GetSection(i);
  11848. WITH p: IntermediateCode.Section DO
  11849. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11850. Symbol(source,p,EmptyBlockOffset,0);
  11851. INC(size);
  11852. END;
  11853. END
  11854. END;
  11855. PatchArray(source,sizePC,size);
  11856. END TypeInfoSection;
  11857. (*
  11858. ProcTableEntry* = RECORD
  11859. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11860. noPtr*: LONGINT;
  11861. END;
  11862. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11863. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11864. *)
  11865. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11866. VAR
  11867. numberPointers: LONGINT;
  11868. procedure: SyntaxTree.Procedure;
  11869. BEGIN
  11870. Info(section,"pcFrom");
  11871. Symbol(section,procedureSection,0,0);
  11872. Info(section,"pcTo");
  11873. Symbol(section, procedureSection, procedureSection.pc, 0);
  11874. Info(section,"pointer to offsets array");
  11875. Symbol(section, section,section.pc+1,0);
  11876. Info(section,"offsets array");
  11877. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11878. PointerArray(section, procedure.procedureScope, numberPointers);
  11879. END ProcedureDescriptor;
  11880. (* only for tracing, the descriptor is otherwise not complete ! *)
  11881. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11882. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11883. BEGIN
  11884. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11885. name := procedureSection.name;
  11886. Basic.AppendToSegmentedName(name,".@Info");
  11887. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11888. Address(section,0);
  11889. Symbol(section,section,2,0);
  11890. (*
  11891. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11892. descSize: SIZE;
  11893. sentinel: ADDRESS; (* = MPO-4 *)
  11894. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11895. flags*: SET;
  11896. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11897. name*: Name;
  11898. END;
  11899. *)
  11900. Size(section, 0);
  11901. Address(section,0);
  11902. Address(section,0);
  11903. Set(section,{});
  11904. moduleSection := ModuleSection();
  11905. Symbol( section, moduleSection, moduleSection.pc,0);
  11906. IF procedureSection.symbol = NIL THEN
  11907. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11908. ELSE
  11909. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11910. END;
  11911. Name(section, infoName);
  11912. Size(section, 0);
  11913. RETURN section;
  11914. END MakeProcedureDescriptorTag;
  11915. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11916. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11917. BEGIN
  11918. name := procedureSection.name;
  11919. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11920. IF implementationVisitor.backend.cooperative THEN
  11921. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11922. Info(section, "TypeDescriptor");
  11923. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11924. NamedSymbol(dest, name,NIL, 0, 0);
  11925. BaseRecord(dest);
  11926. offset := 0;
  11927. ELSIF CreateProcedureDescInfo THEN
  11928. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11929. Address(dest,0);
  11930. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11931. offset := dest.pc;
  11932. ELSE
  11933. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11934. END;
  11935. ProcedureDescriptor(dest, procedureSection);
  11936. Symbol(section, dest, offset, 0);
  11937. END ProcedureDescriptorPointer;
  11938. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11939. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11940. BEGIN
  11941. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11942. numberProcs := 0;
  11943. FOR i := 0 TO module.allSections.Length() - 1 DO
  11944. destination := module.allSections.GetSection(i);
  11945. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11946. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11947. INC(numberProcs);
  11948. END
  11949. END;
  11950. PatchArray(section, sizePC, numberProcs);
  11951. END ProcedureDescriptorArray;
  11952. (*
  11953. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11954. VAR
  11955. next*: Module; (** once a module is published, all fields are read-only *)
  11956. name*: Name;
  11957. init, published: BOOLEAN;
  11958. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11959. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11960. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11961. command*: POINTER TO ARRAY OF Command;
  11962. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11963. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11964. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11965. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11966. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11967. data*, code*: Bytes;
  11968. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11969. export*: ExportDesc;
  11970. term*: TerminationHandler;
  11971. exTable*: ExceptionTable;
  11972. noProcs*: LONGINT;
  11973. firstProc*: ADDRESS; <- done by loader
  11974. maxPtrs*: LONGINT;
  11975. crc*: LONGINT;
  11976. *)
  11977. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11978. BEGIN
  11979. Info(section, "cycle");
  11980. Size(section,0);
  11981. Info(section, "references");
  11982. Size(section,0);
  11983. Info(section, "nextMarked");
  11984. Address(section,0);
  11985. Info(section, "nextWatched");
  11986. Address(section,0);
  11987. END BasePointer;
  11988. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11989. BEGIN
  11990. BasePointer(section);
  11991. Info(section, "action");
  11992. Address(section,0);
  11993. Info(section, "monitor");
  11994. Address(section,0);
  11995. END BaseObject;
  11996. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11997. BEGIN
  11998. BasePointer(section);
  11999. Info(section, "action");
  12000. Address(section,0);
  12001. Info(section, "monitor");
  12002. Address(section,0);
  12003. END BaseRecord;
  12004. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12005. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12006. pooledName: Basic.SegmentedName;
  12007. symbol: SyntaxTree.Symbol;
  12008. BEGIN
  12009. Global.GetModuleName(module.module,name);
  12010. Strings.Append(name,".@Module.@Descriptor");
  12011. Basic.ToSegmentedName(name, pooledName);
  12012. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12013. Symbol(section,descriptorSection,0,0);
  12014. Info(descriptorSection, "descriptor");
  12015. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12016. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12017. Address(descriptorSection,0);
  12018. Global.GetModuleName(module.module,name);
  12019. Strings.Append(name,".@Trace");
  12020. Basic.ToSegmentedName(name, pooledName);
  12021. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12022. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12023. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12024. END ModuleDescriptor;
  12025. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12026. VAR name: ARRAY 128 OF CHAR;
  12027. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12028. symbol: SyntaxTree.Symbol;
  12029. BEGIN
  12030. Global.GetModuleName(module.module,name);
  12031. Strings.Append(name,".@Module");
  12032. Basic.ToSegmentedName(name, pooledName);
  12033. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12034. moduleSection.SetExported(TRUE);
  12035. IF moduleSection.pc = 0 THEN
  12036. IF implementationVisitor.backend.cooperative THEN
  12037. Info(moduleSection, "descriptor");
  12038. ModuleDescriptor(moduleSection);
  12039. BaseObject(moduleSection);
  12040. implementationVisitor.CreateTraceModuleMethod(module.module);
  12041. ELSE
  12042. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12043. Info(moduleSection, "HeapBlock");
  12044. Symbol(moduleSection,moduleSection,2,0);
  12045. Info(moduleSection, "TypeDescriptor");
  12046. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12047. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12048. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12049. END;
  12050. END;
  12051. RETURN moduleSection;
  12052. END ModuleSection;
  12053. PROCEDURE NewModuleInfo();
  12054. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12055. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12056. sectionName: Basic.SectionName;
  12057. CONST MPO=-40000000H;
  12058. BEGIN
  12059. (*
  12060. TypeDesc* = POINTER TO RECORD
  12061. descSize: SIZE;
  12062. sentinel: LONGINT; (* = MPO-4 *)
  12063. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12064. flags*: SET;
  12065. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12066. name*: Name;
  12067. refsOffset: SIZE;
  12068. END;
  12069. *)
  12070. (*name is missing prefixes sometimes*)
  12071. Global.GetModuleSegmentedName(module.module,name);
  12072. Basic.AppendToSegmentedName(name,".@Info");
  12073. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12074. IF ~implementationVisitor.backend.cooperative THEN
  12075. Info(source, "HeapBlock");
  12076. Address(source,0); (* an empty heap block prevents GC marking *)
  12077. Info(source, "TypeDescriptor");
  12078. Address(source,0);
  12079. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12080. END;
  12081. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12082. Address(source,MPO-4);
  12083. Info(source, "type tag pointer");
  12084. Address( source,0);
  12085. Info(source, "type flags");
  12086. flags := {};
  12087. Set( source, flags);
  12088. Info(source, "pointer to module");
  12089. moduleSection := ModuleSection();
  12090. Symbol( source, moduleSection, moduleSection.pc,0);
  12091. Info(source, "type name");
  12092. i := 0;
  12093. sectionName := "@Self";
  12094. (*
  12095. Global.GetSymbolSegmentedName(td,name);
  12096. Basic.SegmentedNameToString(name, sectionName);
  12097. *)
  12098. Name(source,sectionName);
  12099. patchInfoPC := source.pc;
  12100. Size(source, 0);
  12101. END NewModuleInfo;
  12102. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12103. VAR
  12104. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12105. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12106. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12107. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12108. referenceSectionOffset : LONGINT;
  12109. name: Basic.SegmentedName; offset: LONGINT;
  12110. flags: SET;
  12111. BEGIN
  12112. NewModuleInfo();
  12113. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12114. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12115. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12116. ImportsArray(importSection);
  12117. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12118. CommandArray(commandsSection);
  12119. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12120. ExceptionArray(exceptionSection);
  12121. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12122. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12123. TypeInfoSection(typeInfoSection);
  12124. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12125. referenceSection.SetExported(TRUE);
  12126. References(referenceSection);
  12127. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12128. ProcedureDescriptorArray(procTableSection, numberProcs);
  12129. IF ProtectModulesPointers THEN
  12130. name := "Heaps.AnyPtr";
  12131. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12132. (* set base pointer *)
  12133. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12134. END;
  12135. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12136. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12137. moduleSection := ModuleSection();
  12138. Info(moduleSection, "nextRoot*: RootObject");
  12139. Address(moduleSection,0);
  12140. Info(moduleSection, "next*: Module");
  12141. Address(moduleSection,0);
  12142. Info(moduleSection, "name*: Name");
  12143. Name(moduleSection,moduleName);
  12144. Info(moduleSection, "init, published: BOOLEAN");
  12145. Boolean(moduleSection,FALSE);
  12146. Boolean(moduleSection,FALSE);
  12147. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12148. Boolean(moduleSection,FALSE);
  12149. Boolean(moduleSection,FALSE);
  12150. Info(moduleSection, "refcnt*: LONGINT");
  12151. Longint(moduleSection,0);
  12152. Info(moduleSection, "sb*: ADDRESS");
  12153. Address(moduleSection,0);
  12154. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12155. Address(moduleSection,0);
  12156. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12157. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12158. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12159. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12160. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12161. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12162. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12163. Symbol(moduleSection,importSection,importSectionOffset,0);
  12164. Info(moduleSection, "procTable*: ProcTable");
  12165. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12166. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12167. Address(moduleSection,0);
  12168. Address(moduleSection,0);
  12169. Address(moduleSection,0);
  12170. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12171. Info(moduleSection, "export*: ExportDesc");
  12172. ExportDesc(moduleSection);
  12173. Info(moduleSection, "term*: TerminationHandler");
  12174. Address(moduleSection,0);
  12175. Info(moduleSection, "exTable*: ExceptionTable");
  12176. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12177. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12178. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12179. Info(moduleSection, "crc*: LONGINT");
  12180. patchCRC:= moduleSection.pc;
  12181. Longint(moduleSection, 0); (*! must be implemented *)
  12182. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12183. Info(moduleSection, "body*: ADDRESS");
  12184. Symbol(moduleSection, bodyProc, 0,0);
  12185. Info(moduleSection, "module flags");
  12186. flags := {};
  12187. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12188. Set( moduleSection, flags);
  12189. IF implementationVisitor.backend.cooperative THEN
  12190. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12191. Info(moduleSection, "monitor.owner");
  12192. Address(moduleSection,0);
  12193. Info(moduleSection, "monitor.nestingLevel");
  12194. Address(moduleSection,0);
  12195. Info(moduleSection, "monitor.blockedQueue");
  12196. Address(moduleSection,0); Address(moduleSection,0);
  12197. Info(moduleSection, "monitor.waitingQueue");
  12198. Address(moduleSection,0); Address(moduleSection,0);
  12199. Info(moduleSection, "monitor.waitingSentinel");
  12200. Address(moduleSection,0);
  12201. END;
  12202. END Module;
  12203. PROCEDURE PatchCRC(crc: LONGINT);
  12204. BEGIN
  12205. IF ~simple THEN
  12206. PatchLongint(ModuleSection(), patchCRC, crc);
  12207. END;
  12208. END PatchCRC;
  12209. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12210. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12211. BEGIN
  12212. ArrayBlock(source,pc,"",FALSE);
  12213. Info(source, "pointer offsets array data");
  12214. IF scope IS SyntaxTree.RecordScope THEN
  12215. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12216. ELSIF scope IS SyntaxTree.CellScope THEN
  12217. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12218. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12219. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12220. WHILE variable # NIL DO
  12221. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12222. symbol := module.allSections.FindBySymbol(variable);
  12223. ASSERT(symbol # NIL);
  12224. Pointers(0,symbol, source,variable.type,numberPointers);
  12225. END;
  12226. variable := variable.nextVariable;
  12227. END;
  12228. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12229. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12230. WHILE parameter # NIL DO
  12231. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12232. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12233. END;
  12234. parameter := parameter.nextParameter;
  12235. END;
  12236. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12237. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12238. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12239. IF implementationVisitor.backend.preciseGC THEN
  12240. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12241. END;
  12242. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12243. END;
  12244. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12245. WHILE(variable # NIL) DO
  12246. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12247. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12248. END;
  12249. variable := variable.nextVariable
  12250. END;
  12251. END;
  12252. PatchArray(source,pc,numberPointers);
  12253. END PointerArray;
  12254. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12255. VAR
  12256. name: Basic.SegmentedName;
  12257. section: IntermediateCode.Section;
  12258. BEGIN
  12259. Global.GetSymbolSegmentedName(symbol,name);
  12260. Basic.AppendToSegmentedName(name,suffix);
  12261. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12262. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12263. Info(section, "HeapBlock");
  12264. Address(section,0); (* empty such that GC does not go on traversing *)
  12265. Info(section, suffix);
  12266. Address(section,0);
  12267. pc := section.pc;
  12268. RETURN section;
  12269. END SymbolSection;
  12270. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12271. VAR recordType: SyntaxTree.RecordType;
  12272. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12273. section: Sections.Section; cellType: SyntaxTree.CellType;
  12274. tdInfoOffset: LONGINT;
  12275. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12276. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12277. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12278. sectionName: Basic.SectionName;
  12279. CONST MPO=-40000000H;
  12280. BEGIN
  12281. (*
  12282. TypeDesc* = POINTER TO RECORD
  12283. descSize: SIZE;
  12284. sentinel: LONGINT; (* = MPO-4 *)
  12285. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12286. flags*: SET;
  12287. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12288. name*: Name;
  12289. refsOffset: SIZE;
  12290. END;
  12291. *)
  12292. (* source := module.sections.FindByName(...) *)
  12293. Global.GetSymbolSegmentedName(td,name);
  12294. Basic.AppendToSegmentedName(name,".@Info");
  12295. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12296. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12297. Address(source,0);
  12298. Info(source, "TypeDescriptor");
  12299. Address(source,0);
  12300. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12301. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12302. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12303. Info(source, "type tag pointer");
  12304. Symbol( source, tag, offset, 0);
  12305. Info(source, "type flags");
  12306. flags := {};
  12307. IF isProtected THEN INCL(flags,31) END;
  12308. Set( source, flags);
  12309. Info(source, "pointer to module");
  12310. moduleSection := ModuleSection();
  12311. Symbol( source, moduleSection, moduleSection.pc,0);
  12312. Info(source, "type name");
  12313. i := 0;
  12314. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12315. (*
  12316. Global.GetSymbolSegmentedName(td,name);
  12317. Basic.SegmentedNameToString(name, sectionName);
  12318. *)
  12319. Name(source,sectionName);
  12320. Size(source, 0);
  12321. RETURN source;
  12322. END NewTypeDescriptorInfo;
  12323. PROCEDURE NewTypeDescriptor;
  12324. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12325. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12326. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12327. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12328. CONST MPO=-40000000H;
  12329. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12330. VAR i: LONGINT;
  12331. PROCEDURE Td(record: SyntaxTree.RecordType);
  12332. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12333. BEGIN
  12334. IF record # NIL THEN
  12335. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12336. baseTD := record.typeDeclaration;
  12337. Global.GetSymbolSegmentedName(baseTD,name);
  12338. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12339. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12340. ELSE
  12341. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12342. END;
  12343. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12344. Symbol(source, tir, 0, offset);
  12345. IF reverse THEN Td(record.GetBaseRecord()) END;
  12346. END;
  12347. END Td;
  12348. BEGIN
  12349. Info(source, "tag table");
  12350. baseRecord := recordType;
  12351. i := 0;
  12352. WHILE baseRecord # NIL DO
  12353. INC(i);
  12354. baseRecord := baseRecord.GetBaseRecord();
  12355. END;
  12356. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12357. IF ~reverse THEN Td(recordType) END;
  12358. WHILE i < size DO
  12359. Address(source,0);
  12360. INC(i);
  12361. END;
  12362. IF reverse THEN Td(recordType) END;
  12363. END TdTable;
  12364. PROCEDURE MethodTable(reverse: BOOLEAN);
  12365. VAR i,methods: LONGINT;
  12366. BEGIN
  12367. Info(source, "method table");
  12368. IF recordType # NIL THEN
  12369. methods := recordType.recordScope.numberMethods;
  12370. IF reverse THEN
  12371. FOR i := methods-1 TO 0 BY -1 DO
  12372. procedure := recordType.recordScope.FindMethod(i);
  12373. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12374. NamedSymbol(source, name,procedure, 0,0);
  12375. END;
  12376. ELSE
  12377. FOR i := 0 TO methods-1 DO
  12378. procedure := recordType.recordScope.FindMethod(i);
  12379. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12380. NamedSymbol(source, name,procedure, 0,0);
  12381. END;
  12382. END;
  12383. END;
  12384. END MethodTable;
  12385. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12386. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12387. BEGIN
  12388. Info(source, "method table");
  12389. baseRecord := recordType;
  12390. WHILE baseRecord.baseType # NIL DO
  12391. baseRecord := baseRecord.GetBaseRecord ();
  12392. END;
  12393. GetRecordTypeName (baseRecord, name);
  12394. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12395. IF name = stackFrame THEN
  12396. start := 0;
  12397. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12398. baseRecord := recordType;
  12399. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12400. baseRecord := baseRecord.GetBaseRecord ();
  12401. END;
  12402. IF baseRecord # NIL THEN
  12403. GetRecordTypeName (baseRecord, name);
  12404. IF pointer & ~baseRecord.isObject THEN
  12405. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12406. END;
  12407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12408. ELSIF recordType.isObject THEN
  12409. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12410. ELSIF pointer THEN
  12411. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12412. ELSE
  12413. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12414. END;
  12415. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12416. Symbol(source, tir, 0, 0);
  12417. start := 0;
  12418. baseRecord := recordType;
  12419. WHILE (baseRecord # NIL) DO
  12420. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12421. baseRecord := baseRecord.GetBaseRecord ();
  12422. END;
  12423. ELSE
  12424. (* explicit trace method: *)
  12425. procedure := recordType.recordScope.FindMethod(0);
  12426. IF ~procedure.isFinalizer THEN
  12427. Global.GetSymbolSegmentedName(procedure, name);
  12428. NamedSymbol(source, name,procedure, 0,0);
  12429. END;
  12430. start := 1;
  12431. END;
  12432. IF (name # stackFrame) & recordType.isObject THEN
  12433. baseRecord := recordType;
  12434. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12435. baseRecord := baseRecord.GetBaseRecord ();
  12436. END;
  12437. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12438. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12439. ELSE
  12440. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12441. END;
  12442. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12443. Symbol(source, tir, 0, 0);
  12444. END;
  12445. methods := recordType.recordScope.numberMethods;
  12446. FOR i := start TO methods-1 DO
  12447. procedure := recordType.recordScope.FindMethod(i);
  12448. IF ~procedure.isFinalizer THEN
  12449. Global.GetSymbolSegmentedName(procedure, name);
  12450. NamedSymbol(source, name,procedure, 0,0);
  12451. END;
  12452. END;
  12453. END CooperativeMethodTable;
  12454. BEGIN
  12455. Global.GetSymbolSegmentedName(td,name);
  12456. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12457. source.SetExported(IsExported(td));
  12458. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12459. IF implementationVisitor.backend.cooperative THEN
  12460. base := NIL;
  12461. baseRecord := recordType.GetBaseRecord();
  12462. IF baseRecord # NIL THEN
  12463. baseTD := baseRecord.typeDeclaration;
  12464. END;
  12465. IF ~recordType.isObject THEN
  12466. Info(source, "parent");
  12467. IF baseRecord # NIL THEN
  12468. Global.GetSymbolSegmentedName(baseTD,name);
  12469. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12470. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12471. ELSE
  12472. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12473. END;
  12474. Symbol(source, tir, 0, 0);
  12475. ELSE
  12476. Address(source,0);
  12477. END;
  12478. Info(source, "record size");
  12479. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12480. CooperativeMethodTable(FALSE);
  12481. base := source;
  12482. Global.GetSymbolSegmentedName(td,name);
  12483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12484. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12485. source.SetExported(IsExported(td));
  12486. END;
  12487. Info(source, "parent");
  12488. IF baseRecord # NIL THEN
  12489. Global.GetSymbolSegmentedName(baseTD,name);
  12490. sym := baseTD;
  12491. IF ~recordType.isObject THEN
  12492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12493. sym := NIL;
  12494. END;
  12495. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12496. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12497. ELSE
  12498. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12499. END;
  12500. Symbol(source, tir, 0, 0);
  12501. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12502. Address(source,0);
  12503. ELSE
  12504. IF recordType.isObject THEN
  12505. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12506. ELSE
  12507. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12508. END;
  12509. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12510. Symbol(source, tir, 0, 0);
  12511. END;
  12512. Info(source, "base record descriptor");
  12513. Symbol(source, base, 0, 0);
  12514. CooperativeMethodTable(TRUE);
  12515. IF recordType.hasPointers THEN
  12516. IF ~HasExplicitTraceMethod (recordType) THEN
  12517. implementationVisitor.CreateTraceMethod(recordType);
  12518. END;
  12519. implementationVisitor.CreateResetProcedure(recordType);
  12520. implementationVisitor.CreateAssignProcedure(recordType);
  12521. END;
  12522. ELSIF ~simple THEN
  12523. (*
  12524. MethodEnd = MPO
  12525. ---
  12526. methods (# methods)
  12527. ---
  12528. tags (16)
  12529. ---
  12530. TypeDesc = TypeInfoAdr
  12531. ---
  12532. td adr ---> rec size
  12533. ----
  12534. pointer offsets
  12535. ----
  12536. (padding)
  12537. -----
  12538. empty [2 addresses aligned]
  12539. empty
  12540. empty
  12541. numPtrs
  12542. ---
  12543. pointer offsets
  12544. ---
  12545. *)
  12546. Info(source, "MethodEnd = MPO");
  12547. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12548. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12549. MethodTable(TRUE);
  12550. TdTable(TypeTags, TRUE);
  12551. Info(source, "type descriptor info pointer");
  12552. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12553. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12554. IF (cellType # NIL) THEN
  12555. IF cellType.sizeInBits < 0 THEN
  12556. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12557. END;
  12558. Info(source, "cell size");
  12559. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12560. ELSE
  12561. Info(source, "record size");
  12562. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12563. END;
  12564. Info(source, "pointer offsets pointer");
  12565. padding := 1- source.pc MOD 2;
  12566. Symbol(source, source, source.pc+1+padding,0);
  12567. IF padding >0 THEN
  12568. Info(source, "padding");
  12569. FOR i := 1 TO padding DO Address(source,0) END;
  12570. END;
  12571. IF cellType # NIL THEN
  12572. PointerArray(source, cellType.cellScope, numberPointers);
  12573. ELSE
  12574. PointerArray(source, recordType.recordScope, numberPointers);
  12575. END;
  12576. ELSE
  12577. (*
  12578. simple:
  12579. td adr --> size
  12580. tag(1)
  12581. tag(2)
  12582. tag(3)
  12583. methods ->
  12584. *)
  12585. Info(source, "record size");
  12586. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12587. TdTable(TypeTags, FALSE);
  12588. MethodTable(FALSE);
  12589. END;
  12590. END NewTypeDescriptor;
  12591. BEGIN
  12592. x := x.resolved;
  12593. IF (x IS SyntaxTree.PointerType) THEN
  12594. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12595. END;
  12596. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12597. recordType := x(SyntaxTree.RecordType);
  12598. td := x.typeDeclaration;
  12599. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12600. ASSERT(td # NIL);
  12601. section := module.allSections.FindBySymbol(td); (* TODO *)
  12602. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12603. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12604. NewTypeDescriptor
  12605. END;
  12606. END;
  12607. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12608. cellType := x(SyntaxTree.CellType);
  12609. td := x.typeDeclaration;
  12610. section := module.allSections.FindBySymbol(td); (* TODO *)
  12611. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12612. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12613. NewTypeDescriptor
  12614. END;
  12615. END;
  12616. END
  12617. END CheckTypeDeclaration
  12618. END MetaDataGenerator;
  12619. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12620. VAR
  12621. trace-: BOOLEAN;
  12622. traceString-: SyntaxTree.IdentifierString;
  12623. traceModuleName-: SyntaxTree.IdentifierString;
  12624. profile-: BOOLEAN;
  12625. noRuntimeChecks: BOOLEAN;
  12626. simpleMetaData-: BOOLEAN;
  12627. noAsserts: BOOLEAN;
  12628. optimize-: BOOLEAN;
  12629. cooperative-: BOOLEAN;
  12630. preregisterStatic-: BOOLEAN;
  12631. dump-: Basic.Writer;
  12632. cellsAreObjects: BOOLEAN;
  12633. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12634. experiment: BOOLEAN;
  12635. PROCEDURE &InitIntermediateBackend*;
  12636. BEGIN
  12637. simpleMetaData := FALSE;
  12638. InitBackend;
  12639. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12640. SetTraceModuleName(DefaultTraceModuleName);
  12641. END InitIntermediateBackend;
  12642. (* must be overwritten by actual backend, if parameter registers should be used *)
  12643. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12644. BEGIN
  12645. RETURN 0; (* default case: no parameter registers *)
  12646. END NumberParameterRegisters;
  12647. (* must be overwritten by actual backend, if parameter registers should be used *)
  12648. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12649. BEGIN
  12650. HALT(100); (* abstract *)
  12651. END ParameterRegister;
  12652. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12653. VAR
  12654. declarationVisitor: DeclarationVisitor;
  12655. implementationVisitor: ImplementationVisitor;
  12656. module: Sections.Module;
  12657. name, platformName: SyntaxTree.IdentifierString;
  12658. meta: MetaDataGenerator;
  12659. crc: CRC.CRC32Stream;
  12660. BEGIN
  12661. ResetError;
  12662. Global.GetSymbolName(x,name);
  12663. NEW(module,x,system); (* backend structures *)
  12664. Global.GetModuleName(x, name);
  12665. module.SetModuleName(name);
  12666. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12667. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12668. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12669. declarationVisitor.Module(x,module);
  12670. IF ~meta.simple THEN
  12671. meta.Module(implementationVisitor.moduleBodySection);
  12672. END;
  12673. GetDescription(platformName);
  12674. module.SetPlatformName(platformName);
  12675. NEW(crc);
  12676. module.allSections.WriteRaw(crc);
  12677. crc.Update;
  12678. meta.PatchCRC(crc.GetCRC());
  12679. RETURN module
  12680. END GenerateIntermediate;
  12681. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12682. BEGIN RETURN TRUE
  12683. END SupportedImmediate;
  12684. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12685. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12686. END ProcessSyntaxTreeModule;
  12687. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12688. VAR
  12689. result: Sections.Module;
  12690. traceName: Basic.MessageString;
  12691. BEGIN
  12692. ASSERT(intermediateCodeModule IS Sections.Module);
  12693. result := intermediateCodeModule(Sections.Module);
  12694. IF trace THEN
  12695. traceName := "intermediate code trace: ";
  12696. Strings.Append(traceName,traceString);
  12697. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12698. IF (traceString="") OR (traceString="*") THEN
  12699. result.Dump(dump);
  12700. dump.Update
  12701. ELSE
  12702. Sections.DumpFiltered(dump, result, traceString);
  12703. END
  12704. END;
  12705. RETURN result
  12706. END ProcessIntermediateCodeModule;
  12707. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12708. BEGIN instructionSet := "Intermediate";
  12709. END GetDescription;
  12710. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12711. BEGIN
  12712. SELF.simpleMetaData := simpleMetaData;
  12713. END SetSimpleMetaData;
  12714. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12715. BEGIN COPY(name, traceModuleName)
  12716. END SetTraceModuleName;
  12717. PROCEDURE DefineOptions*(options: Options.Options);
  12718. BEGIN
  12719. DefineOptions^(options);
  12720. options.Add(0X,"trace",Options.String);
  12721. options.Add(0X,"builtinsModule",Options.String);
  12722. options.Add(0X,"traceModule",Options.String);
  12723. options.Add(0X,"profile",Options.Flag);
  12724. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12725. options.Add(0X,"noAsserts",Options.Flag);
  12726. options.Add(0X,"metaData",Options.String);
  12727. options.Add('o',"optimize", Options.Flag);
  12728. options.Add(0X,"preregisterStatic", Options.Flag);
  12729. options.Add(0X,"cellsAreObjects", Options.Flag);
  12730. options.Add(0X,"preciseGC", Options.Flag);
  12731. options.Add(0X,"trackLeave", Options.Flag);
  12732. options.Add(0X,"writeBarriers", Options.Flag);
  12733. options.Add(0X,"experiment", Options.Flag);
  12734. END DefineOptions;
  12735. PROCEDURE GetOptions*(options: Options.Options);
  12736. VAR name,string: SyntaxTree.IdentifierString;
  12737. BEGIN
  12738. GetOptions^(options);
  12739. trace := options.GetString("trace",traceString);
  12740. profile := options.GetFlag("profile");
  12741. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12742. noAsserts := options.GetFlag("noAsserts");
  12743. cooperative := options.GetFlag("cooperative");
  12744. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12745. simpleMetaData := TRUE
  12746. END;
  12747. IF options.GetString("metaData",string) THEN
  12748. IF string = "simple" THEN simpleMetaData := TRUE
  12749. ELSIF string ="full" THEN simpleMetaData := FALSE
  12750. END;
  12751. END;
  12752. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12753. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12754. optimize := options.GetFlag("optimize");
  12755. preregisterStatic := options.GetFlag("preregisterStatic");
  12756. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12757. preciseGC := options.GetFlag("preciseGC");
  12758. trackLeave := options.GetFlag("trackLeave");
  12759. writeBarriers := options.GetFlag("writeBarriers");
  12760. experiment := options.GetFlag("experiment");
  12761. END GetOptions;
  12762. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12763. BEGIN RETURN SymbolFileFormat.Get()
  12764. END DefaultSymbolFileFormat;
  12765. END IntermediateBackend;
  12766. (* ----------------------------------- register allocation ------------------------------------- *)
  12767. (* register mapping scheme
  12768. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12769. spill offset
  12770. part(n) --> ticket <--> physical register
  12771. spill offset
  12772. *)
  12773. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12774. emptyOperand: IntermediateCode.Operand;
  12775. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12776. statCoopResetVariables: LONGINT;
  12777. statCoopModifyAssignments: LONGINT;
  12778. modifyAssignmentsPC : LONGINT;
  12779. statCoopNilCheck: LONGINT;
  12780. statCoopSwitch: LONGINT;
  12781. statCoopAssignProcedure: LONGINT;
  12782. statCoopTraceMethod: LONGINT;
  12783. statCoopResetProcedure: LONGINT;
  12784. statCoopTraceModule: LONGINT;
  12785. PROCEDURE ResetStatistics*;
  12786. BEGIN
  12787. statCoopResetVariables := 0;
  12788. statCoopModifyAssignments := 0;
  12789. statCoopNilCheck:= 0;
  12790. statCoopSwitch:= 0;
  12791. statCoopAssignProcedure:= 0;
  12792. statCoopTraceMethod:= 0;
  12793. statCoopResetProcedure:= 0;
  12794. statCoopTraceModule:= 0;
  12795. END ResetStatistics;
  12796. PROCEDURE Statistics*;
  12797. BEGIN
  12798. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12799. TRACE(statCoopNilCheck, statCoopSwitch);
  12800. TRACE(statCoopAssignProcedure,
  12801. statCoopTraceMethod,
  12802. statCoopResetProcedure,
  12803. statCoopTraceModule)
  12804. END Statistics;
  12805. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12806. VAR h: LONGINT;
  12807. BEGIN
  12808. WHILE b # 0 DO
  12809. h := a MOD b;
  12810. a := b;
  12811. b := h;
  12812. END;
  12813. RETURN a
  12814. END GCD;
  12815. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12816. BEGIN
  12817. RETURN a*b DIV GCD(a,b)
  12818. END SCM;
  12819. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12820. BEGIN
  12821. (*TRACE(a,b);*)
  12822. IF a = 0 THEN RETURN b
  12823. ELSIF b = 0 THEN RETURN a
  12824. ELSE RETURN SCM(a,b)
  12825. END;
  12826. END CommonAlignment;
  12827. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12828. BEGIN
  12829. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12830. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12831. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12832. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12833. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12834. END
  12835. END PassBySingleReference;
  12836. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12837. BEGIN
  12838. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12839. END PassInRegister;
  12840. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12841. VAR new: RegisterEntry;
  12842. BEGIN
  12843. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12844. IF queue = NIL THEN
  12845. queue := new
  12846. ELSE
  12847. new.next := queue;
  12848. IF queue#NIL THEN queue.prev := new END;
  12849. queue := new
  12850. END;
  12851. END AddRegisterEntry;
  12852. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12853. VAR this: RegisterEntry;
  12854. BEGIN
  12855. this := queue;
  12856. WHILE (this # NIL) & (this.register # register) DO
  12857. this := this.next;
  12858. END;
  12859. IF this = NIL THEN
  12860. RETURN FALSE
  12861. END;
  12862. ASSERT(this # NIL);
  12863. IF this = queue THEN queue := queue.next END;
  12864. IF this.prev # NIL THEN this.prev.next := this.next END;
  12865. IF this.next # NIL THEN this.next.prev := this.prev END;
  12866. RETURN TRUE
  12867. END RemoveRegisterEntry;
  12868. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12869. BEGIN ASSERT(cond);
  12870. END Assert;
  12871. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12872. BEGIN
  12873. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12874. END ReusableRegister;
  12875. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12876. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12877. BEGIN
  12878. procedure := moduleScope.bodyProcedure;
  12879. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12880. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12881. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12882. procedure.SetScope(moduleScope);
  12883. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12884. procedure.SetAccess(SyntaxTree.Hidden);
  12885. moduleScope.SetBodyProcedure(procedure);
  12886. moduleScope.AddProcedure(procedure);
  12887. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12888. END;
  12889. END EnsureBodyProcedure;
  12890. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12891. VAR import: SyntaxTree.Import;
  12892. selfName: SyntaxTree.IdentifierString;
  12893. module: SyntaxTree.Module;
  12894. BEGIN
  12895. scope.ownerModule.GetName(selfName);
  12896. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12897. module := scope.ownerModule
  12898. ELSE
  12899. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12900. IF import = NIL THEN
  12901. RETURN NIL
  12902. ELSIF import.module = NIL THEN
  12903. RETURN NIL
  12904. ELSE module := import.module
  12905. END;
  12906. END;
  12907. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12908. END GetSymbol;
  12909. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12910. BEGIN
  12911. op.mode := mode;
  12912. IntermediateCode.InitOperand(op.op);
  12913. IntermediateCode.InitOperand(op.tag);
  12914. IntermediateCode.InitOperand(op.extra);
  12915. op.dimOffset := 0;
  12916. END InitOperand;
  12917. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12918. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12919. BEGIN RETURN IntermediateCode.GetType(system, type)
  12920. END GetType;
  12921. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12922. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12923. BEGIN
  12924. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12925. (*
  12926. UniqueId(name,module,name,adr);
  12927. *)
  12928. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12929. constant.SetValue(value);
  12930. constant.SetAccess(SyntaxTree.Hidden);
  12931. module.moduleScope.AddConstant(constant);
  12932. constant.SetScope(module.moduleScope);
  12933. RETURN constant
  12934. END BuildConstant;
  12935. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12936. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12937. BEGIN
  12938. variable := scope.firstVariable;
  12939. WHILE variable # NIL DO
  12940. IF variable.NeedsTrace() THEN
  12941. RETURN TRUE;
  12942. END;
  12943. variable := variable.nextVariable;
  12944. END;
  12945. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12946. WHILE parameter # NIL DO
  12947. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12948. RETURN TRUE;
  12949. END;
  12950. parameter := parameter.nextParameter;
  12951. END;
  12952. RETURN FALSE;
  12953. END HasPointers;
  12954. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12955. 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));
  12956. END IsVariableParameter;
  12957. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12958. VAR parameter: SyntaxTree.Parameter;
  12959. BEGIN
  12960. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12961. WHILE parameter # NIL DO
  12962. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12963. IF parameter.movable THEN RETURN TRUE END;
  12964. parameter := parameter.nextParameter;
  12965. END;
  12966. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12967. END HasVariableParameters;
  12968. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12969. BEGIN
  12970. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12971. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12972. END HasExplicitTraceMethod;
  12973. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12974. BEGIN
  12975. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12976. IF (expression IS SyntaxTree.IntegerValue) THEN
  12977. val := expression(SyntaxTree.IntegerValue).value;
  12978. RETURN TRUE
  12979. ELSE
  12980. RETURN FALSE
  12981. END;
  12982. END IsIntegerConstant;
  12983. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12984. BEGIN
  12985. IF val <= 0 THEN RETURN FALSE END;
  12986. exp := 0;
  12987. WHILE ~ODD(val) DO
  12988. val := val DIV 2;
  12989. INC(exp)
  12990. END;
  12991. RETURN val = 1
  12992. END PowerOf2;
  12993. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12994. VAR procedure: SyntaxTree.Procedure;
  12995. BEGIN
  12996. procedure := record.recordScope.constructor;
  12997. IF procedure = NIL THEN
  12998. record := record.GetBaseRecord();
  12999. IF record # NIL THEN
  13000. procedure := GetConstructor(record)
  13001. END;
  13002. END;
  13003. RETURN procedure;
  13004. END GetConstructor;
  13005. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13006. BEGIN
  13007. value := SHORT(op.intValue);
  13008. RETURN op.mode = IntermediateCode.ModeImmediate;
  13009. END IsIntegerImmediate;
  13010. (** whether a type strictily is a pointer to record or object type
  13011. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13012. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13013. BEGIN
  13014. IF type = NIL THEN
  13015. RETURN FALSE
  13016. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13017. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13018. ELSE
  13019. RETURN FALSE
  13020. END
  13021. END IsStrictlyPointerToRecord;
  13022. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13023. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13024. END IsUnsafePointer;
  13025. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13026. BEGIN type := type.resolved;
  13027. IF type IS SyntaxTree.PointerType THEN
  13028. type := type(SyntaxTree.PointerType).pointerBase;
  13029. type := type.resolved;
  13030. IF type IS SyntaxTree.RecordType THEN
  13031. recordType := type(SyntaxTree.RecordType);
  13032. RETURN TRUE
  13033. ELSE
  13034. RETURN FALSE
  13035. END
  13036. ELSIF type IS SyntaxTree.RecordType THEN
  13037. recordType := type(SyntaxTree.RecordType);
  13038. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13039. ELSIF type IS SyntaxTree.ObjectType THEN
  13040. RETURN TRUE
  13041. ELSIF type IS SyntaxTree.AnyType THEN
  13042. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13043. ELSE
  13044. RETURN FALSE
  13045. END;
  13046. END IsPointerToRecord;
  13047. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13048. BEGIN
  13049. type := type.resolved;
  13050. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13051. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13052. END IsArrayOfSystemByte;
  13053. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13054. BEGIN
  13055. IF type = NIL THEN RETURN FALSE END;
  13056. type := type.resolved;
  13057. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13058. END IsOpenArray;
  13059. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13060. BEGIN
  13061. IF type = NIL THEN RETURN FALSE END;
  13062. type := type.resolved;
  13063. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13064. END IsSemiDynamicArray;
  13065. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13066. BEGIN
  13067. IF type = NIL THEN RETURN FALSE END;
  13068. type := type.resolved;
  13069. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13070. END IsStaticArray;
  13071. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13072. BEGIN
  13073. IF type = NIL THEN RETURN FALSE END;
  13074. type := type.resolved;
  13075. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13076. END IsStaticMathArray;
  13077. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13078. BEGIN
  13079. WHILE (IsStaticMathArray(type)) DO
  13080. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13081. END;
  13082. RETURN type;
  13083. END StaticMathArrayBaseType;
  13084. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13085. VAR size: LONGINT;
  13086. BEGIN
  13087. size := 1;
  13088. WHILE (IsStaticArray(type)) DO
  13089. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13090. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13091. END;
  13092. RETURN size;
  13093. END StaticArrayNumElements;
  13094. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13095. VAR size: LONGINT;
  13096. BEGIN
  13097. size := 1;
  13098. WHILE (IsStaticMathArray(type)) DO
  13099. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13100. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13101. END;
  13102. RETURN size;
  13103. END StaticMathArrayNumElements;
  13104. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13105. BEGIN
  13106. WHILE (IsStaticArray(type)) DO
  13107. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13108. END;
  13109. RETURN type;
  13110. END StaticArrayBaseType;
  13111. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13112. BEGIN
  13113. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13114. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13115. END;
  13116. RETURN type;
  13117. END ArrayBaseType;
  13118. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13119. BEGIN
  13120. IF type = NIL THEN RETURN FALSE END;
  13121. type := type.resolved;
  13122. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13123. END IsDelegate;
  13124. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13125. VAR i: LONGINT;
  13126. BEGIN
  13127. i := 0; type := type.resolved;
  13128. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13129. INC(i);
  13130. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13131. END;
  13132. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13133. INC(i);
  13134. type := type(SyntaxTree.MathArrayType).arrayBase;
  13135. IF type # NIL THEN type := type.resolved END;
  13136. END;
  13137. RETURN i
  13138. END DynamicDim;
  13139. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13140. BEGIN
  13141. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13142. type := type(SyntaxTree.ArrayType).arrayBase;
  13143. END;
  13144. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13145. type := type(SyntaxTree.MathArrayType).arrayBase;
  13146. END;
  13147. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13148. END StaticSize;
  13149. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13150. BEGIN
  13151. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13152. END IsImmediate;
  13153. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13154. BEGIN
  13155. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13156. END IsAddress;
  13157. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13158. BEGIN
  13159. RETURN (x.mode = IntermediateCode.ModeRegister);
  13160. END IsRegister;
  13161. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13162. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13163. BEGIN
  13164. typeDeclaration := recordType.typeDeclaration;
  13165. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13166. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13167. END GetRecordTypeName;
  13168. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13169. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13170. BEGIN
  13171. parSize := 0;
  13172. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13173. parameter := procedureType.returnParameter;
  13174. INC(parSize,system.SizeOfParameter(parameter));
  13175. parSize := parSize + (-parSize) MOD system.addressSize;
  13176. END;
  13177. parameter :=procedureType.lastParameter;
  13178. WHILE (parameter # NIL) DO
  13179. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13180. INC(parSize, system.addressSize);
  13181. ELSE
  13182. INC(parSize,system.SizeOfParameter(parameter));
  13183. parSize := parSize + (-parSize) MOD system.addressSize;
  13184. END;
  13185. parameter := parameter.prevParameter;
  13186. END;
  13187. IF procedureType.selfParameter # NIL THEN
  13188. parameter := procedureType.selfParameter;
  13189. INC(parSize,system.SizeOfParameter(parameter));
  13190. parSize := parSize + (-parSize) MOD system.addressSize;
  13191. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13192. END; (* method => self pointer *)
  13193. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13194. RETURN ToMemoryUnits(system,parSize)
  13195. END ParametersSize;
  13196. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13197. BEGIN
  13198. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13199. END IsNested;
  13200. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13201. BEGIN
  13202. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13203. scope := scope.outerScope;
  13204. END;
  13205. RETURN scope # NIL;
  13206. END InCellScope;
  13207. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13208. BEGIN
  13209. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13210. END ProcedureParametersSize;
  13211. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13212. VAR dataUnit: LONGINT;
  13213. BEGIN dataUnit := system.dataUnit;
  13214. ASSERT(size MOD system.dataUnit = 0);
  13215. RETURN LONGINT(size DIV system.dataUnit)
  13216. END ToMemoryUnits;
  13217. PROCEDURE Get*(): Backend.Backend;
  13218. VAR backend: IntermediateBackend;
  13219. BEGIN NEW(backend); RETURN backend
  13220. END Get;
  13221. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13222. VAR instruction: IntermediateCode.Instruction;
  13223. BEGIN
  13224. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13225. RETURN instruction
  13226. END Nop;
  13227. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13228. VAR instruction: IntermediateCode.Instruction;
  13229. BEGIN
  13230. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13231. RETURN instruction
  13232. END Mov;
  13233. (* like Mov but ensures that no new register will be allocated for dest *)
  13234. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13235. VAR instruction: IntermediateCode.Instruction;
  13236. BEGIN
  13237. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13238. RETURN instruction
  13239. END MovReplace;
  13240. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13241. VAR instruction: IntermediateCode.Instruction;
  13242. BEGIN
  13243. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13244. RETURN instruction
  13245. END Conv;
  13246. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13247. VAR instruction: IntermediateCode.Instruction;
  13248. BEGIN
  13249. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13250. RETURN instruction
  13251. END Call;
  13252. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13253. VAR op1, op2, op3: IntermediateCode.Operand;
  13254. VAR instruction: IntermediateCode.Instruction;
  13255. BEGIN
  13256. IntermediateCode.InitNumber(op1,pcOffset);
  13257. IntermediateCode.InitNumber(op2,callingConvention);
  13258. IntermediateCode.InitNumber(op3,unwind);
  13259. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13260. RETURN instruction
  13261. END Exit;
  13262. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13263. VAR instruction: IntermediateCode.Instruction;
  13264. BEGIN
  13265. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13266. RETURN instruction
  13267. END Return;
  13268. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13269. VAR instruction: IntermediateCode.Instruction;
  13270. BEGIN
  13271. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13272. RETURN instruction
  13273. END Result;
  13274. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13275. VAR op1: IntermediateCode.Operand;
  13276. VAR instruction: IntermediateCode.Instruction;
  13277. BEGIN
  13278. IntermediateCode.InitNumber(op1,nr);
  13279. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13280. RETURN instruction
  13281. END Trap;
  13282. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13283. VAR instruction: IntermediateCode.Instruction;
  13284. BEGIN
  13285. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13286. RETURN instruction
  13287. END Br;
  13288. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13289. VAR instruction: IntermediateCode.Instruction;
  13290. BEGIN
  13291. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13292. RETURN instruction
  13293. END Breq;
  13294. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13295. VAR instruction: IntermediateCode.Instruction;
  13296. BEGIN
  13297. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13298. RETURN instruction
  13299. END Brne;
  13300. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13301. VAR instruction: IntermediateCode.Instruction;
  13302. BEGIN
  13303. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13304. RETURN instruction
  13305. END Brge;
  13306. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13307. VAR instruction: IntermediateCode.Instruction;
  13308. BEGIN
  13309. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13310. RETURN instruction
  13311. END Brlt;
  13312. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13313. VAR instruction: IntermediateCode.Instruction;
  13314. BEGIN
  13315. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13316. RETURN instruction
  13317. END Pop;
  13318. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13319. VAR instruction: IntermediateCode.Instruction;
  13320. BEGIN
  13321. ASSERT(op.mode # IntermediateCode.Undefined);
  13322. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13323. RETURN instruction
  13324. END Push;
  13325. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13326. VAR instruction: IntermediateCode.Instruction;
  13327. BEGIN
  13328. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13329. RETURN instruction
  13330. END Neg;
  13331. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13332. VAR instruction: IntermediateCode.Instruction;
  13333. BEGIN
  13334. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13335. RETURN instruction
  13336. END Not;
  13337. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13338. VAR instruction: IntermediateCode.Instruction;
  13339. BEGIN
  13340. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13341. RETURN instruction
  13342. END Abs;
  13343. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13344. VAR instruction: IntermediateCode.Instruction;
  13345. BEGIN
  13346. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13347. ASSERT(~IsImmediate(instruction.op1));
  13348. RETURN instruction
  13349. END Mul;
  13350. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13351. VAR instruction: IntermediateCode.Instruction;
  13352. BEGIN
  13353. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13354. RETURN instruction
  13355. END Div;
  13356. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13357. VAR instruction: IntermediateCode.Instruction;
  13358. BEGIN
  13359. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13360. RETURN instruction
  13361. END Mod;
  13362. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13363. VAR instruction: IntermediateCode.Instruction;
  13364. BEGIN
  13365. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13366. RETURN instruction
  13367. END Sub;
  13368. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13369. VAR instruction: IntermediateCode.Instruction;
  13370. BEGIN
  13371. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13372. RETURN instruction
  13373. END Add;
  13374. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13375. VAR instruction: IntermediateCode.Instruction;
  13376. BEGIN
  13377. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13378. RETURN instruction
  13379. END And;
  13380. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13381. VAR instruction: IntermediateCode.Instruction;
  13382. BEGIN
  13383. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13384. RETURN instruction
  13385. END Or;
  13386. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13387. VAR instruction: IntermediateCode.Instruction;
  13388. BEGIN
  13389. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13390. RETURN instruction
  13391. END Xor;
  13392. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13393. VAR instruction: IntermediateCode.Instruction;
  13394. BEGIN
  13395. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13396. RETURN instruction
  13397. END Shl;
  13398. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13399. VAR instruction: IntermediateCode.Instruction;
  13400. BEGIN
  13401. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13402. RETURN instruction
  13403. END Shr;
  13404. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13405. VAR instruction: IntermediateCode.Instruction;
  13406. BEGIN
  13407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13408. RETURN instruction
  13409. END Rol;
  13410. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13411. VAR instruction: IntermediateCode.Instruction;
  13412. BEGIN
  13413. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13414. RETURN instruction
  13415. END Ror;
  13416. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13417. VAR instruction: IntermediateCode.Instruction;
  13418. BEGIN
  13419. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13420. RETURN instruction
  13421. END Cas;
  13422. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13423. VAR instruction: IntermediateCode.Instruction;
  13424. BEGIN
  13425. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13426. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13427. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13428. RETURN instruction
  13429. END Copy;
  13430. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13431. VAR instruction: IntermediateCode.Instruction;
  13432. BEGIN
  13433. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13434. RETURN instruction
  13435. END Fill;
  13436. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13437. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13438. BEGIN
  13439. string := IntermediateCode.String(s);
  13440. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13441. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13442. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13443. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13444. RETURN instruction
  13445. END Asm;
  13446. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13447. VAR instruction: IntermediateCode.Instruction;
  13448. BEGIN
  13449. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13450. RETURN instruction
  13451. END Data;
  13452. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13453. VAR instruction: IntermediateCode.Instruction;
  13454. BEGIN
  13455. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13456. IntermediateCode.SetSubType(instruction, subtype);
  13457. RETURN instruction
  13458. END SpecialInstruction;
  13459. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13460. VAR op1: IntermediateCode.Operand;
  13461. VAR instruction: IntermediateCode.Instruction;
  13462. BEGIN
  13463. (*! generate a warning if size exceeds a certain limit *)
  13464. (*
  13465. ASSERT(bytes < 1000000); (* sanity check *)
  13466. *)
  13467. ASSERT(0 <= units); (* sanity check *)
  13468. IntermediateCode.InitNumber(op1,units);
  13469. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13470. RETURN instruction
  13471. END Reserve;
  13472. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13473. VAR op1: IntermediateCode.Operand;
  13474. VAR instruction: IntermediateCode.Instruction;
  13475. BEGIN
  13476. IntermediateCode.InitNumber(op1,position.start);
  13477. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13478. RETURN instruction
  13479. END LabelInstruction;
  13480. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13481. VAR pc: LONGINT;
  13482. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13483. BEGIN
  13484. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13485. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13486. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13487. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13488. IF instr.op1.type.form = IntermediateCode.Float THEN
  13489. RETURN instr.op1.floatValue = op.floatValue
  13490. ELSE
  13491. RETURN instr.op1.intValue = op.intValue
  13492. END;
  13493. END ProvidesValue;
  13494. BEGIN
  13495. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13496. pc := 0;
  13497. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13498. INC(pc);
  13499. END;
  13500. IF pc = data.pc THEN
  13501. data.Emit(Data(Basic.invalidPosition,vop));
  13502. END;
  13503. RETURN pc
  13504. END EnterImmediate;
  13505. PROCEDURE Init;
  13506. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13507. BEGIN
  13508. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13509. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13510. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13511. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13512. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13513. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13514. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13515. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13516. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13517. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13518. IntermediateCode.InitOperand(emptyOperand);
  13519. FOR i := 0 TO NumberSystemCalls-1 DO
  13520. name := "@SystemCall";
  13521. Basic.AppendNumber(name,i);
  13522. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13523. END;
  13524. END Init;
  13525. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13526. BEGIN
  13527. RETURN (symbol # NIL) & symbol.NeedsSection();
  13528. END IsExported;
  13529. BEGIN
  13530. Init;
  13531. END FoxIntermediateBackend.
  13532. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13533. # Release.Build --path="/temp/obg/" Win32 ~
  13534. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  13535. FStols.CloseFiles A2Z.exe ~
  13536. System.FreeDownTo FoxIntermediateBackend ~
  13537. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13538. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13539. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13540. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13541. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13542. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13543. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13544. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13545. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13546. GenericLinker.Mod Loader.Mod BootConsole.Mod