FoxIntermediateBackend.Mod 581 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825148261482714828148291483014831148321483314834148351483614837148381483914840148411484214843148441484514846148471484814849148501485114852
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  88. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. registerNumber: LONGINT;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. ELSE
  762. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  763. END;
  764. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  765. IF finalizer THEN
  766. IF backend.hasLinkRegister THEN
  767. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  768. END;
  769. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  770. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  771. ir.Emit(Br(x.position,dest));
  772. ELSE
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. ELSE
  776. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  777. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  778. END;
  779. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  780. IF backend.cooperative THEN
  781. IF HasPointers (scope) THEN
  782. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  783. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  784. ir.Emit(Result(x.position, res));
  785. ir.Emit(Push(x.position, res));
  786. implementationVisitor.ResetVariables(scope);
  787. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  788. ir.Emit(Pop(x.position, res));
  789. ir.Emit(Return(x.position, res));
  790. ELSE
  791. implementationVisitor.ResetVariables(scope);
  792. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  793. END;
  794. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  795. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  796. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  797. ir.Emit(Result(x.position, res));
  798. ir.Emit(Push(x.position, res));
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. ir.Emit(Pop(x.position, res));
  801. ir.Emit(Return(x.position, res));
  802. ELSE
  803. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  804. END;
  805. END;
  806. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  807. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  808. ELSE
  809. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  810. ir.Emit(Nop(x.position));
  811. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  812. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  813. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  814. END;
  815. END;
  816. END
  817. END;
  818. ELSE (* force body for procedures *)
  819. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  820. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  821. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  822. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  823. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  824. END;
  825. Scope(scope);
  826. Signature;
  827. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  828. currentScope := prevScope;
  829. END Procedure;
  830. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. ASSERT (bodyProcedure # NIL);
  835. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  837. procedure.SetScope(bodyProcedure.scope);
  838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  839. procedure.SetAccess(SyntaxTree.Hidden);
  840. Global.GetSymbolSegmentedName (procedure,name);
  841. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  842. ir.SetExported(TRUE);
  843. Global.GetSymbolSegmentedName (bodyProcedure,name);
  844. IF ~meta.simple THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  849. ELSIF backend.preregisterStatic THEN
  850. implementationVisitor.currentScope := module.module.moduleScope;
  851. implementationVisitor.section := ir;
  852. implementationVisitor.PushSelfPointer();
  853. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  854. ELSE
  855. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  856. ir.Emit(Call(bodyProcedure.position,op, 0));
  857. END;
  858. END AddBodyCallStub;
  859. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  860. VAR name: Basic.SegmentedName;
  861. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  862. BEGIN
  863. Global.GetSymbolSegmentedName (symbol,name);
  864. Basic.RemoveSuffix(name);
  865. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  866. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  867. ir.SetExported(TRUE);
  868. IntermediateCode.InitImmediate(op,addressType,initStack);
  869. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  870. END AddStackAllocation;
  871. (** entry function to visit a complete module *)
  872. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  873. VAR
  874. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  875. hasDynamicOperatorDeclarations: BOOLEAN;
  876. operator: SyntaxTree.Operator;
  877. import: SyntaxTree.Import;
  878. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  879. BEGIN
  880. type := type.resolved;
  881. IF type IS SyntaxTree.RecordType THEN
  882. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  883. ELSIF (type IS SyntaxTree.ArrayType) THEN
  884. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  885. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  886. END;
  887. ELSIF type IS SyntaxTree.MathArrayType THEN
  888. WITH type: SyntaxTree.MathArrayType DO
  889. IF type.form = SyntaxTree.Open THEN
  890. RETURN TRUE
  891. ELSIF type.form = SyntaxTree.Static THEN
  892. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  893. END;
  894. END;
  895. END;
  896. RETURN FALSE
  897. END TypeNeedsInitialization;
  898. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  899. VAR variable: SyntaxTree.Variable;
  900. BEGIN
  901. variable := scope.firstVariable;
  902. WHILE variable # NIL DO
  903. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  904. IF variable.initializer # NIL THEN RETURN TRUE END;
  905. variable := variable.nextVariable;
  906. END;
  907. RETURN FALSE
  908. END ScopeNeedsInitialization;
  909. BEGIN
  910. ASSERT(x # NIL); ASSERT(module # NIL);
  911. SELF.module := module;
  912. (* add import names to the generated Sections.Module *)
  913. import := x.moduleScope.firstImport;
  914. WHILE import # NIL DO
  915. import.module.GetName(idstr);
  916. module.imports.AddName(idstr);
  917. import := import.nextImport
  918. END;
  919. implementationVisitor.module := module;
  920. implementationVisitor.moduleScope := x.moduleScope;
  921. implementationVisitor.moduleSelf := moduleSelf;
  922. implementationVisitor.canBeLoaded := TRUE;
  923. meta.SetModule(module);
  924. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  925. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  926. END;
  927. IF backend.profile THEN
  928. EnsureBodyProcedure(x.moduleScope);
  929. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  930. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  931. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  932. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  933. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  934. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  935. Global.GetModuleName(module.module,idstr);
  936. implementationVisitor.ProfilerAddModule(idstr);
  937. implementationVisitor.numberProcedures := 0;
  938. END;
  939. implementationVisitor.profile := backend.profile;
  940. (* check if there is at least one dynamic operator locally defined *)
  941. hasDynamicOperatorDeclarations := FALSE;
  942. operator := x.moduleScope.firstOperator;
  943. WHILE operator # NIL DO
  944. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  945. operator := operator.nextOperator
  946. END;
  947. (* add operator initialization code section *)
  948. IF hasDynamicOperatorDeclarations THEN
  949. EnsureBodyProcedure(x.moduleScope);
  950. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  951. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  952. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  953. END;
  954. Scope(x.moduleScope);
  955. IF hasDynamicOperatorDeclarations THEN
  956. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  957. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  958. END;
  959. IF backend.profile THEN
  960. implementationVisitor.ProfilerPatchInit;
  961. END;
  962. END Module;
  963. END DeclarationVisitor;
  964. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  965. RegisterUsageCount*=OBJECT
  966. VAR used: UsedArray; count: LONGINT;
  967. PROCEDURE &Init;
  968. VAR i: LONGINT;
  969. BEGIN
  970. count := 0;
  971. IF used = NIL THEN NEW(used,64); END;
  972. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  973. END Init;
  974. PROCEDURE Grow;
  975. VAR new: UsedArray; size,i: LONGINT;
  976. BEGIN
  977. size := LEN(used)*2;
  978. NEW(new,size);
  979. FOR i := 0 TO LEN(used)-1 DO
  980. new[i].count := used[i].count;
  981. new[i].type := used[i].type;
  982. new[i].map := used[i].map
  983. END;
  984. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  985. used := new
  986. END Grow;
  987. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  988. BEGIN
  989. INC(count);
  990. IF count = LEN(used) THEN Grow END;
  991. used[count].type := type;
  992. used[count].class := class;
  993. used[count].map := count;
  994. RETURN count;
  995. END Next;
  996. PROCEDURE IncUse(register: LONGINT);
  997. BEGIN
  998. INC(used[register].count);
  999. (*
  1000. IF (register = 1) & (count > 30) THEN
  1001. D.TraceBack;
  1002. END;
  1003. *)
  1004. END IncUse;
  1005. PROCEDURE DecUse(register: LONGINT);
  1006. BEGIN
  1007. DEC(used[register].count);
  1008. END DecUse;
  1009. PROCEDURE Map(register: LONGINT): LONGINT;
  1010. VAR map : LONGINT;
  1011. BEGIN
  1012. IF register > 0 THEN
  1013. map := used[register].map;
  1014. WHILE register # map DO register := map; map := used[register].map END;
  1015. END;
  1016. RETURN register
  1017. END Map;
  1018. PROCEDURE Use(register: LONGINT): LONGINT;
  1019. BEGIN
  1020. IF register< LEN(used) THEN
  1021. RETURN used[register].count
  1022. ELSE
  1023. RETURN 0
  1024. END
  1025. END Use;
  1026. END RegisterUsageCount;
  1027. RegisterEntry = POINTER TO RECORD
  1028. prev,next: RegisterEntry;
  1029. register: LONGINT;
  1030. registerClass: IntermediateCode.RegisterClass;
  1031. type: IntermediateCode.Type;
  1032. END;
  1033. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1034. Variables = OBJECT (Basic.List)
  1035. VAR
  1036. inUse: VariableUse;
  1037. registerIndex: LONGINT;
  1038. nameIndex: LONGINT;
  1039. PROCEDURE & Init;
  1040. VAR i: LONGINT;
  1041. BEGIN
  1042. InitList(16);
  1043. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1044. registerIndex := 1024;
  1045. nameIndex := 0;
  1046. END Init;
  1047. PROCEDURE Clear*;
  1048. VAR i: LONGINT;
  1049. BEGIN
  1050. Clear^;
  1051. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1052. registerIndex := 1024;
  1053. nameIndex := 0;
  1054. END Clear;
  1055. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1056. VAR string: SyntaxTree.IdentifierString ;
  1057. BEGIN
  1058. COPY("@hiddenIRVar",string);
  1059. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1060. RETURN SyntaxTree.NewIdentifier(string);
  1061. END GetUID;
  1062. PROCEDURE GetUsage(VAR use: VariableUse);
  1063. BEGIN
  1064. use := inUse;
  1065. END GetUsage;
  1066. PROCEDURE SetUsage(CONST use: VariableUse);
  1067. BEGIN
  1068. inUse := use;
  1069. END SetUsage;
  1070. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1071. VAR any: ANY;
  1072. BEGIN
  1073. any := Get(i);
  1074. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1075. END GetVariable;
  1076. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1077. BEGIN
  1078. Set(pos, v);
  1079. END SetVariable;
  1080. PROCEDURE Occupy(pos: LONGINT);
  1081. BEGIN
  1082. INCL(inUse[pos DIV 32], pos MOD 32);
  1083. END Occupy;
  1084. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1085. BEGIN
  1086. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1087. END Occupied;
  1088. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1089. BEGIN
  1090. Occupy(Length());
  1091. Add(v);
  1092. END AddVariable;
  1093. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1094. BEGIN
  1095. t1 := t1.resolved;
  1096. t2 := t2.resolved;
  1097. (*RETURN t1.SameType(t2); *)
  1098. RETURN
  1099. (t1.SameType(t2))
  1100. OR
  1101. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1102. OR
  1103. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1104. OR
  1105. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1106. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1107. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1108. OR
  1109. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1110. (DynamicDim(t1) = DynamicDim(t2))
  1111. );
  1112. END CompatibleType;
  1113. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1114. VAR var : SyntaxTree.Variable; i: LONGINT;
  1115. BEGIN
  1116. pos := Length();
  1117. FOR i := 0 TO pos-1 DO
  1118. IF ~(Occupied(i)) THEN
  1119. var := GetVariable(i);
  1120. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1121. pos := i;
  1122. Occupy(i);
  1123. RETURN var;
  1124. END;
  1125. END;
  1126. END;
  1127. RETURN NIL
  1128. END GetFreeVariable;
  1129. END Variables;
  1130. SymbolMap = POINTER TO RECORD
  1131. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1132. isAddress: BOOLEAN;
  1133. END;
  1134. SymbolMapper = OBJECT
  1135. VAR
  1136. first: SymbolMap;
  1137. PROCEDURE & Init;
  1138. BEGIN
  1139. first := NIL;
  1140. END Init;
  1141. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1142. VAR new: SymbolMap;
  1143. BEGIN
  1144. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1145. new.next := first; first := new;
  1146. END Add;
  1147. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1148. VAR s: SymbolMap;
  1149. BEGIN
  1150. s := first;
  1151. WHILE (s # NIL) & (s.this # this) DO
  1152. s := s.next
  1153. END;
  1154. RETURN s
  1155. END Get;
  1156. END SymbolMapper;
  1157. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1158. VAR
  1159. system: Global.System;
  1160. section: IntermediateCode.Section;
  1161. module: Sections.Module;
  1162. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1163. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1164. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1165. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1166. checker: SemanticChecker.Checker;
  1167. backend: IntermediateBackend;
  1168. meta: MetaDataGenerator;
  1169. position: Position;
  1170. moduleSelf: SyntaxTree.Variable;
  1171. (* variables for hand over of variables / temporary state *)
  1172. currentScope: SyntaxTree.Scope;
  1173. constantDeclaration : SyntaxTree.Symbol;
  1174. result: Operand; (* result of the most recent expression / statement *)
  1175. destination: IntermediateCode.Operand;
  1176. arrayDestinationTag: IntermediateCode.Operand;
  1177. arrayDestinationDimension:LONGINT;
  1178. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1179. conditional: BOOLEAN;
  1180. trueLabel, falseLabel, exitLabel: Label;
  1181. locked: BOOLEAN;
  1182. (*
  1183. usedRegisters: Registers;
  1184. *)
  1185. registerUsageCount: RegisterUsageCount;
  1186. usedRegisters: RegisterEntry;
  1187. (* useful operands and types *)
  1188. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1189. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1190. commentPrintout: Printout.Printer;
  1191. dump: Streams.Writer;
  1192. tagsAvailable : BOOLEAN;
  1193. supportedInstruction: SupportedInstructionProcedure;
  1194. supportedImmediate: SupportedImmediateProcedure;
  1195. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1196. emitLabels: BOOLEAN;
  1197. builtinsModuleName : SyntaxTree.IdentifierString;
  1198. indexCounter: LONGINT;
  1199. profile: BOOLEAN;
  1200. profileId, profileInit: IntermediateCode.Section;
  1201. profileInitPatchPosition: LONGINT;
  1202. numberProcedures: LONGINT;
  1203. procedureResultDesignator : SyntaxTree.Designator;
  1204. operatorInitializationCodeSection: IntermediateCode.Section;
  1205. fingerPrinter: FingerPrinter.FingerPrinter;
  1206. temporaries: Variables;
  1207. canBeLoaded : BOOLEAN;
  1208. currentIsInline: BOOLEAN;
  1209. currentMapper: SymbolMapper;
  1210. currentInlineExit: Label;
  1211. moduleBodySection: IntermediateCode.Section;
  1212. NeedDescriptor : BOOLEAN;
  1213. cooperativeSwitches: BOOLEAN;
  1214. lastSwitchPC: LONGINT;
  1215. isUnchecked: BOOLEAN;
  1216. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1217. BEGIN
  1218. SELF.system := system;
  1219. SELF.builtinsModuleName := runtime;
  1220. currentScope := NIL;
  1221. hiddenPointerType := NIL;
  1222. delegatePointerType := NIL;
  1223. awaitProcCounter := 0;
  1224. labelId := 0; constId := 0; labelId := 0;
  1225. SELF.checker := checker;
  1226. SELF.backend := backend;
  1227. position := Basic.invalidPosition;
  1228. conditional := FALSE;
  1229. locked := FALSE;
  1230. InitOperand(result,ModeUndefined);
  1231. addressType := IntermediateCode.GetType(system,system.addressType);
  1232. setType := IntermediateCode.GetType(system,system.setType);
  1233. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1234. lenType := IntermediateCode.GetType(system, system.lenType);
  1235. byteType := IntermediateCode.GetType(system, system.byteType);
  1236. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1237. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1238. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1239. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1240. nil := IntermediateCode.Immediate(addressType,0);
  1241. one := IntermediateCode.Immediate(addressType,1);
  1242. IntermediateCode.InitOperand(destination);
  1243. tagsAvailable := TRUE;
  1244. supportedInstruction := supportedInstructionProcedure;
  1245. supportedImmediate := supportedImmediateProcedure;
  1246. inData := FALSE;
  1247. SELF.emitLabels := emitLabels;
  1248. IntermediateCode.InitOperand(arrayDestinationTag);
  1249. bool := IntermediateCode.GetType(system,system.booleanType);
  1250. IntermediateCode.InitImmediate(false,bool,0);
  1251. IntermediateCode.InitImmediate(true,bool,1);
  1252. indexCounter := 0;
  1253. NEW(registerUsageCount);
  1254. usedRegisters := NIL;
  1255. procedureResultDesignator := NIL;
  1256. NEW(fingerPrinter);
  1257. NEW(temporaries);
  1258. currentIsInline := FALSE;
  1259. NeedDescriptor := FALSE;
  1260. isUnchecked := backend.noRuntimeChecks;
  1261. END Init;
  1262. TYPE Context = RECORD
  1263. section: IntermediateCode.Section;
  1264. registerUsageCount: RegisterUsageCount;
  1265. usedRegisters: RegisterEntry;
  1266. temporaries: Variables;
  1267. END;
  1268. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1269. VAR context: Context;
  1270. BEGIN
  1271. context.section := section;
  1272. context.registerUsageCount := registerUsageCount;
  1273. context.usedRegisters := usedRegisters;
  1274. context.temporaries := temporaries;
  1275. section := new;
  1276. NEW(registerUsageCount);
  1277. NEW(temporaries);
  1278. usedRegisters := NIL;
  1279. RETURN context;
  1280. END SwitchContext;
  1281. PROCEDURE ReturnToContext(context: Context);
  1282. BEGIN
  1283. section := context.section;
  1284. registerUsageCount := context.registerUsageCount;
  1285. usedRegisters := context.usedRegisters;
  1286. temporaries := context.temporaries;
  1287. END ReturnToContext;
  1288. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1289. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1290. BEGIN
  1291. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1292. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1293. END;
  1294. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1295. section.SetExported(IsExported(syntaxTreeSymbol));
  1296. RETURN section
  1297. END NewSection;
  1298. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1299. VAR new: LONGINT;
  1300. BEGIN
  1301. new := registerUsageCount.Next(type,class);
  1302. UseRegister(new);
  1303. RETURN new
  1304. END AcquireRegister;
  1305. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1306. VAR
  1307. fingerPrint: SyntaxTree.FingerPrint;
  1308. fingerPrintString: ARRAY 32 OF CHAR;
  1309. BEGIN
  1310. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1311. string := "[";
  1312. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1313. Strings.Append(string, fingerPrintString);
  1314. Strings.Append(string, "]");
  1315. END GetFingerprintString;
  1316. (** get the name for the code section that represens a certain symbol
  1317. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1318. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1319. VAR string: ARRAY 32 OF CHAR;
  1320. BEGIN
  1321. Global.GetSymbolSegmentedName(symbol, name);
  1322. (* if the symbol is an operator, then append the fingerprint to the name *)
  1323. IF symbol IS SyntaxTree.Operator THEN
  1324. GetFingerprintString(symbol, string);
  1325. Basic.AppendToSegmentedName(name,string);
  1326. END
  1327. END GetCodeSectionNameForSymbol;
  1328. (** get the name for the code section that represens a certain symbol
  1329. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1330. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1331. VAR string: ARRAY 32 OF CHAR;
  1332. BEGIN
  1333. Global.GetSymbolNameInScope(symbol, scope, name);
  1334. (* if the symbol is an operator, then append the fingerprint to the name *)
  1335. IF symbol IS SyntaxTree.Operator THEN
  1336. GetFingerprintString(symbol, string);
  1337. Strings.Append(name, string);
  1338. END
  1339. END GetCodeSectionNameForSymbolInScope;
  1340. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1341. BEGIN
  1342. IF dump # NIL THEN
  1343. dump.String("enter "); dump.String(s); dump.Ln;
  1344. END;
  1345. END TraceEnter;
  1346. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1347. BEGIN
  1348. IF dump # NIL THEN
  1349. dump.String("exit "); dump.String(s); dump.Ln;
  1350. END;
  1351. END TraceExit;
  1352. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1353. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1354. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1355. VAR i: LONGINT;
  1356. BEGIN
  1357. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1358. IF op.rule # NIL THEN
  1359. FOR i := 0 TO LEN(op.rule)-1 DO
  1360. CheckRegister(op.rule[i])
  1361. END;
  1362. END;
  1363. END CheckRegister;
  1364. BEGIN
  1365. CheckRegister(instruction.op1);
  1366. CheckRegister(instruction.op2);
  1367. CheckRegister(instruction.op3);
  1368. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1369. ELSE section.Emit(instruction);
  1370. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1371. END;
  1372. END Emit;
  1373. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1374. BEGIN
  1375. IF backend.cooperative THEN
  1376. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1377. CallThis(position,"Runtime","Trap",1);
  1378. ELSE
  1379. Emit(Trap(position,trapNo));
  1380. END;
  1381. END EmitTrap;
  1382. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1383. VAR name: Basic.SegmentedName;
  1384. VAR op1, op2, reg: IntermediateCode.Operand;
  1385. VAR call, nocall: Label;
  1386. VAR parametersSize: LONGINT;
  1387. VAR prevSection: IntermediateCode.Section;
  1388. VAR prevDump: Streams.Writer;
  1389. VAR body: SyntaxTree.Body;
  1390. VAR procedureType: SyntaxTree.ProcedureType;
  1391. BEGIN
  1392. IF procedure # NIL THEN
  1393. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1394. ELSE procedureType := NIL;
  1395. END;
  1396. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1397. prevSection := SELF.section;
  1398. SELF.section := section;
  1399. prevDump := dump;
  1400. dump := section.comments;
  1401. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1402. IF backend.hasLinkRegister THEN
  1403. Emit(Push(Basic.invalidPosition, lr));
  1404. END;
  1405. Emit(Push(Basic.invalidPosition,fp));
  1406. IF procedure # NIL THEN
  1407. body := procedure.procedureScope.body;
  1408. ELSE
  1409. body := NIL;
  1410. END;
  1411. IF backend.cooperative THEN
  1412. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1413. GetCodeSectionNameForSymbol(procedure, name);
  1414. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1415. ELSE
  1416. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1417. END;
  1418. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1419. IntermediateCode.AddOffset(op1, 1);
  1420. Emit(Push(Basic.invalidPosition,op1));
  1421. Emit(Mov(Basic.invalidPosition,fp, sp));
  1422. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1423. NEW(call, section);
  1424. NEW(nocall, section);
  1425. reg := NewRegisterOperand(addressType);
  1426. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1427. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1428. BrltL(call, sp, reg);
  1429. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1430. BrgeL(nocall, sp, op2);
  1431. call.Resolve(section.pc);
  1432. Emit(Push(Basic.invalidPosition, reg));
  1433. ReleaseIntermediateOperand(reg);
  1434. parametersSize := ProcParametersSize(procedure);
  1435. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1436. Emit(Push(Basic.invalidPosition, op2));
  1437. CallThis(position, "Activities","ExpandStack",2);
  1438. Emit(Result(Basic.invalidPosition, sp));
  1439. nocall.Resolve(section.pc);
  1440. END;
  1441. ELSE
  1442. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1443. Emit(Push(Basic.invalidPosition, one)) ;
  1444. procedureType.SetParametersOffset(1);
  1445. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1446. END;
  1447. Emit(Mov(Basic.invalidPosition, fp, sp));
  1448. END;
  1449. END;
  1450. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1451. SELF.section := prevSection;
  1452. dump := prevDump;
  1453. END EmitEnter;
  1454. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1455. VAR op1,op2: IntermediateCode.Operand;
  1456. VAR instruction: IntermediateCode.Instruction;
  1457. BEGIN
  1458. IntermediateCode.InitNumber(op1,callconv);
  1459. IntermediateCode.InitNumber(op2,varSize);
  1460. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1461. RETURN instruction
  1462. END Enter;
  1463. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1464. VAR op1: IntermediateCode.Operand;
  1465. VAR instruction: IntermediateCode.Instruction;
  1466. BEGIN
  1467. IntermediateCode.InitNumber(op1,callconv);
  1468. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1469. RETURN instruction
  1470. END Leave;
  1471. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1472. VAR prevSection: IntermediateCode.Section;
  1473. VAR op2, size: IntermediateCode.Operand;
  1474. VAR body: SyntaxTree.Body;
  1475. BEGIN
  1476. prevSection := SELF.section;
  1477. SELF.section := section;
  1478. Emit(Leave(position, callconv));
  1479. IF procedure # NIL THEN
  1480. body := procedure.procedureScope.body;
  1481. ELSE
  1482. body := NIL;
  1483. END;
  1484. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1485. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1486. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1487. Emit(Add(position, sp, fp, op2));
  1488. ELSE
  1489. Emit(Mov(position, sp, fp));
  1490. END;
  1491. Emit(Pop(position, fp));
  1492. END;
  1493. SELF.section := prevSection;
  1494. END EmitLeave;
  1495. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1496. VAR m: SymbolMap;
  1497. BEGIN
  1498. position := x.position;
  1499. IF currentIsInline THEN
  1500. m := currentMapper.Get(x);
  1501. IF m # NIL THEN
  1502. (*
  1503. Printout.Info("mapping from", x);
  1504. Printout.Info("mapping to ", m.to);
  1505. *)
  1506. m.to.Accept(SELF);
  1507. op := result;
  1508. IF m.tag # NIL THEN
  1509. ReleaseIntermediateOperand(result.tag);
  1510. m.tag.Accept(SELF);
  1511. op.tag := result.op;
  1512. ReleaseIntermediateOperand(result.tag);
  1513. END;
  1514. RETURN
  1515. END;
  1516. END;
  1517. x.Accept(SELF);
  1518. op := result;
  1519. END Symbol;
  1520. PROCEDURE Expression(x: SyntaxTree.Expression);
  1521. BEGIN
  1522. position := x.position;
  1523. constantDeclaration := NIL;
  1524. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1525. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1526. END;
  1527. IF x.resolved # NIL THEN
  1528. x.resolved.Accept(SELF)
  1529. ELSE
  1530. x.Accept(SELF)
  1531. END;
  1532. (* check this, was commented out in ActiveCells3 *)
  1533. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1534. Error(x.position, "unsupported modifier");
  1535. END;
  1536. END Expression;
  1537. (*
  1538. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1539. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1540. BEGIN
  1541. temporaries.GetUsage(current);
  1542. FOR i := 0 TO LEN(current)-1 DO
  1543. set := current[i] - previous[i];
  1544. IF set # {} THEN
  1545. FOR j := 0 TO MAX(SET)-1 DO
  1546. IF j IN set THEN
  1547. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1548. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1549. Symbol(variable, op);
  1550. MakeMemory(tmp,op.op,addressType,0);
  1551. ReleaseOperand(op);
  1552. Emit(Mov(position,tmp, nil ) );
  1553. ReleaseIntermediateOperand(tmp);
  1554. END;
  1555. END;
  1556. END;
  1557. END;
  1558. END;
  1559. END ResetUsedTemporaries;
  1560. *)
  1561. PROCEDURE Statement(x: SyntaxTree.Statement);
  1562. VAR use: VariableUse;
  1563. BEGIN
  1564. temporaries.GetUsage(use);
  1565. position := x.position;
  1566. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1567. IF commentPrintout # NIL THEN
  1568. commentPrintout.Statement(x);
  1569. dump.Ln;
  1570. (*dump.Update;*)
  1571. END;
  1572. x.Accept(SELF);
  1573. (*
  1574. CheckRegistersFree();
  1575. *)
  1576. (*ResetUsedTemporaries(use);*)
  1577. temporaries.SetUsage(use);
  1578. END Statement;
  1579. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1580. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1581. *)
  1582. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1583. BEGIN
  1584. ASSERT(op.mode # IntermediateCode.Undefined);
  1585. IF op.mode = IntermediateCode.ModeMemory THEN
  1586. ReuseCopy(res,op);
  1587. ELSE
  1588. res := op;
  1589. UseIntermediateOperand(res);
  1590. END;
  1591. IntermediateCode.AddOffset(res,offset);
  1592. IntermediateCode.MakeMemory(res,type);
  1593. END MakeMemory;
  1594. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1595. VAR mem: IntermediateCode.Operand;
  1596. BEGIN
  1597. MakeMemory(mem,res,type,offset);
  1598. ReleaseIntermediateOperand(res);
  1599. res := mem;
  1600. END ToMemory;
  1601. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1602. VAR mem: IntermediateCode.Operand;
  1603. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1604. componentType: SyntaxTree.Type;
  1605. BEGIN
  1606. type := type.resolved;
  1607. IF operand.mode = ModeReference THEN
  1608. IF type IS SyntaxTree.RangeType THEN
  1609. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1610. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1611. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1612. ReleaseOperand(operand);
  1613. operand.op := firstOp;
  1614. operand.tag := lastOp;
  1615. operand.extra := stepOp;
  1616. ELSIF type IS SyntaxTree.ComplexType THEN
  1617. componentType := type(SyntaxTree.ComplexType).componentType;
  1618. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1619. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1620. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1621. ReleaseOperand(operand);
  1622. operand.op := firstOp;
  1623. operand.tag := lastOp
  1624. ELSE
  1625. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1626. ReleaseIntermediateOperand(operand.op);
  1627. operand.op := mem;
  1628. END;
  1629. operand.mode := ModeValue;
  1630. END;
  1631. ASSERT(operand.mode = ModeValue);
  1632. END LoadValue;
  1633. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1634. VAR prevConditional: BOOLEAN;
  1635. BEGIN
  1636. prevConditional := conditional;
  1637. conditional := FALSE;
  1638. InitOperand(result, ModeUndefined);
  1639. Expression(x);
  1640. op := result;
  1641. LoadValue(op,x.type.resolved);
  1642. conditional := prevConditional;
  1643. END Evaluate;
  1644. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1645. VAR prevConditional: BOOLEAN;
  1646. BEGIN
  1647. prevConditional := conditional;
  1648. conditional := FALSE;
  1649. InitOperand(result,ModeUndefined);
  1650. Expression(x);
  1651. op := result;
  1652. (*
  1653. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1654. *)
  1655. conditional := prevConditional;
  1656. END Designate;
  1657. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1658. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1659. BEGIN
  1660. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1661. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1662. conditional := TRUE;
  1663. trueLabel := trueL; falseLabel := falseL;
  1664. Expression(x);
  1665. trueL := trueLabel; falseL := falseLabel;
  1666. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1667. END Condition;
  1668. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1669. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1670. BEGIN
  1671. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1672. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1673. RETURN op
  1674. END NewRegisterOperand;
  1675. PROCEDURE UnuseRegister(register: LONGINT);
  1676. BEGIN
  1677. IF (register > 0) THEN
  1678. register := registerUsageCount.Map(register);
  1679. registerUsageCount.DecUse(register);
  1680. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1681. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1682. END;
  1683. IF registerUsageCount.Use(register)=0 THEN
  1684. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1685. Warning(position, "register cannot be removed");
  1686. END;
  1687. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1688. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1689. END;
  1690. ELSIF registerUsageCount.Use(register)<0 THEN
  1691. Warning(position, "register removed too often");
  1692. IF dump # NIL THEN
  1693. dump.String("register removed too often"); dump.Ln; dump.Update;
  1694. END;
  1695. END;
  1696. END;
  1697. END UnuseRegister;
  1698. PROCEDURE UseRegister(register: LONGINT);
  1699. BEGIN
  1700. IF (register > 0) THEN
  1701. register := registerUsageCount.Map(register);
  1702. registerUsageCount.IncUse(register);
  1703. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1704. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1705. END;
  1706. IF registerUsageCount.Use(register)=1 THEN
  1707. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1708. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1709. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1710. END;
  1711. END;
  1712. END;
  1713. END UseRegister;
  1714. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1715. BEGIN
  1716. UnuseRegister(op.register)
  1717. END ReleaseIntermediateOperand;
  1718. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1719. BEGIN
  1720. UseRegister(op.register)
  1721. END UseIntermediateOperand;
  1722. PROCEDURE ReleaseOperand(CONST op: Operand);
  1723. BEGIN
  1724. UnuseRegister(op.op.register);
  1725. UnuseRegister(op.tag.register);
  1726. UnuseRegister(op.extra.register);
  1727. END ReleaseOperand;
  1728. (* save registers marked in array "markedRegisters" to the stack
  1729. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1730. *)
  1731. PROCEDURE SaveRegisters();
  1732. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1733. BEGIN
  1734. entry := usedRegisters;
  1735. WHILE entry # NIL DO
  1736. type := registerUsageCount.used[entry.register].type;
  1737. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1738. Emit(Push(position,op));
  1739. entry := entry.next;
  1740. END;
  1741. END SaveRegisters;
  1742. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1743. BEGIN
  1744. saved := usedRegisters;
  1745. usedRegisters := NIL;
  1746. END ReleaseUsedRegisters;
  1747. (** remove parameter registers from used queue *)
  1748. PROCEDURE ReleaseParameterRegisters;
  1749. VAR entry,prev,next: RegisterEntry;
  1750. BEGIN
  1751. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1752. WHILE entry # NIL DO
  1753. next := entry.next;
  1754. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1755. registerUsageCount.DecUse(entry.register);
  1756. ASSERT(registerUsageCount.Use(entry.register)=0);
  1757. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1758. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1759. END;
  1760. ELSIF prev = NIL THEN
  1761. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1762. ELSE
  1763. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1764. END;
  1765. entry := next;
  1766. END;
  1767. END ReleaseParameterRegisters;
  1768. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1769. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1770. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1771. BEGIN
  1772. entry := saved;
  1773. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1774. entry := prev;
  1775. WHILE entry # NIL DO
  1776. prev := entry.prev;
  1777. type := entry.type;
  1778. class := entry.registerClass;
  1779. IntermediateCode.InitRegister(op,type,class,entry.register);
  1780. (*
  1781. new := registerUsageCount.Next(type,class);
  1782. registerUsageCount.Remap(entry.register,new);
  1783. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1784. dump.String("remap register "); dump.Int(entry.register,1);
  1785. dump.String("to "); dump.Int(new,1);
  1786. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1787. END;
  1788. entry.register := new;
  1789. *)
  1790. Emit(Pop(position,op));
  1791. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1792. entry := prev;
  1793. END;
  1794. (*
  1795. usedRegisters := saved;
  1796. *)
  1797. END RestoreRegisters;
  1798. PROCEDURE CheckRegistersFree;
  1799. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1800. BEGIN
  1801. IF usedRegisters # NIL THEN
  1802. r := usedRegisters;
  1803. WHILE r # NIL DO
  1804. warning := "register ";
  1805. Strings.AppendInt(warning, r.register);
  1806. Strings.Append(warning, " not released.");
  1807. Warning(position,warning);
  1808. r := r .next;
  1809. END;
  1810. END;
  1811. FOR i := 0 TO registerUsageCount.count-1 DO
  1812. IF registerUsageCount.used[i].count < 0 THEN
  1813. warning := "register ";
  1814. Strings.AppendInt(warning, i);
  1815. Strings.Append(warning, " unused too often.");
  1816. Warning(position,warning);
  1817. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1818. warning := "register ";
  1819. Strings.AppendInt(warning, i);
  1820. Strings.Append(warning, " not unused often enough.");
  1821. Warning(position,warning);
  1822. END;
  1823. END;
  1824. END CheckRegistersFree;
  1825. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1826. Otherwise allocate a new register.
  1827. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1828. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1829. BEGIN
  1830. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1831. UseIntermediateOperand(result);
  1832. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1833. UseIntermediateOperand(result);
  1834. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1835. END;
  1836. END Reuse2;
  1837. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1838. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1839. If not then allocate a new register.
  1840. Does NOT necessarily keep the content of src1 or src2 in result!
  1841. *)
  1842. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1843. BEGIN
  1844. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1845. UseIntermediateOperand(result);
  1846. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1847. UseIntermediateOperand(result);
  1848. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1849. result := alternative; alternative := emptyOperand;
  1850. UseIntermediateOperand(result);
  1851. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1852. END;
  1853. END Reuse2a;
  1854. (* like reuse2 but only one source *)
  1855. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1856. BEGIN
  1857. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1858. UseIntermediateOperand(result);
  1859. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1860. END;
  1861. END Reuse1;
  1862. (* like reuse2a but only one source *)
  1863. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1864. BEGIN
  1865. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1866. UseIntermediateOperand(result);
  1867. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1868. UseIntermediateOperand(result);
  1869. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1870. END;
  1871. END Reuse1a;
  1872. (* like reuse1 but guarantees that content of src1 is in result *)
  1873. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1874. BEGIN
  1875. IF ReusableRegister(src1) THEN
  1876. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1877. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1878. UseIntermediateOperand(result);
  1879. ELSE
  1880. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1881. Emit(Mov(position,result,src1));
  1882. END
  1883. END ReuseCopy;
  1884. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1885. BEGIN
  1886. IF ReusableRegister(src) THEN
  1887. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1888. ELSE
  1889. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1890. Emit(Mov(position,result,src));
  1891. ReleaseIntermediateOperand(src);
  1892. END
  1893. END TransferToRegister;
  1894. (** labels and branches **)
  1895. PROCEDURE NewLabel(): Label;
  1896. VAR label: Label;
  1897. BEGIN
  1898. NEW(label,section); RETURN label;
  1899. END NewLabel;
  1900. PROCEDURE SetLabel(label: Label);
  1901. BEGIN label.Resolve(section.pc);
  1902. END SetLabel;
  1903. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1904. BEGIN
  1905. ASSERT(label # NIL);
  1906. IF label.pc < 0 THEN (* label not yet set *)
  1907. label.AddFixup(section.pc);
  1908. END;
  1909. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1910. END LabelOperand;
  1911. PROCEDURE BrL(label: Label);
  1912. BEGIN
  1913. Emit(Br(position,LabelOperand(label)));
  1914. END BrL;
  1915. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1916. BEGIN
  1917. Emit(Brge(position,LabelOperand(label),left,right));
  1918. END BrgeL;
  1919. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1920. BEGIN
  1921. Emit(Brlt(position,LabelOperand(label),left,right));
  1922. END BrltL;
  1923. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1924. BEGIN
  1925. Emit(Breq(position,LabelOperand(label),left,right));
  1926. END BreqL;
  1927. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1928. BEGIN
  1929. Emit(Brne(position,LabelOperand(label),left,right));
  1930. END BrneL;
  1931. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1932. VAR new: IntermediateCode.Operand;
  1933. BEGIN
  1934. IF Trace THEN TraceEnter("Convert") END;
  1935. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1936. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1937. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1938. & (operand.offset = 0)
  1939. THEN
  1940. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1941. Emit(Conv(position,new,operand));
  1942. ELSE
  1943. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1944. Emit(Conv(position,new,operand));
  1945. ReleaseIntermediateOperand(operand);
  1946. END;
  1947. operand := new;
  1948. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1949. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1950. ELSE
  1951. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1952. Emit(Conv(position,new,operand));
  1953. ReleaseIntermediateOperand(operand);
  1954. operand := new;
  1955. END;
  1956. IF Trace THEN TraceExit("Convert") END;
  1957. END Convert;
  1958. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1959. VAR exit: Label;
  1960. BEGIN
  1961. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1962. exit := NewLabel();
  1963. br(exit,left,right);
  1964. EmitTrap(position,trapNo);
  1965. SetLabel(exit);
  1966. END TrapC;
  1967. (** expressions *)
  1968. (** emit necessary runtime check for set elements **)
  1969. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1970. VAR max: IntermediateCode.Operand;
  1971. BEGIN
  1972. IF isUnchecked THEN RETURN END;
  1973. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1974. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1975. TrapC(BrgeL, max, o, SetElementTrap);
  1976. END;
  1977. END CheckSetElement;
  1978. (** the set that a range represents **)
  1979. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1980. VAR
  1981. operand: Operand;
  1982. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1983. BEGIN
  1984. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1985. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1986. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1987. one := IntermediateCode.Immediate(setType, 1);
  1988. Evaluate(x, operand);
  1989. Convert(operand.op, setType);
  1990. Convert(operand.tag, setType);
  1991. CheckSetElement(operand.op);
  1992. CheckSetElement(operand.tag);
  1993. (* create mask for lower bound
  1994. i.e. shift 11111111 to the left by the value of the lower bound
  1995. *)
  1996. Reuse1(temp, operand.op);
  1997. Emit(Shl(position,temp, allBits, operand.op));
  1998. ReleaseIntermediateOperand(operand.op);
  1999. operand.op := temp;
  2000. (* create mask for upper bound
  2001. i.e. shift 11111111 to the right by the difference between the
  2002. upper bound and the maximum number of set elements
  2003. *)
  2004. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2005. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2006. Reuse1(temp, operand.tag);
  2007. ELSE
  2008. Reuse1(temp, operand.tag);
  2009. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2010. Emit(Sub(position,temp, size, operand.tag));
  2011. END;
  2012. Emit(Shr(position,temp, allBits, operand.tag));
  2013. ReleaseIntermediateOperand(operand.tag);
  2014. operand.tag := temp;
  2015. Reuse2(resultingSet, operand.op, operand.tag);
  2016. (* intersect the two masks *)
  2017. Emit(And(position,resultingSet, operand.op, operand.tag));
  2018. ReleaseOperand(operand);
  2019. RETURN resultingSet
  2020. END SetFromRange;
  2021. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2022. VAR
  2023. res, operand: Operand;
  2024. temp, one, noBits, dest: IntermediateCode.Operand;
  2025. expression: SyntaxTree.Expression;
  2026. i: LONGINT;
  2027. BEGIN
  2028. IF Trace THEN TraceEnter("VisitSet") END;
  2029. dest := destination;
  2030. destination := emptyOperand;
  2031. noBits := IntermediateCode.Immediate(setType, 0);
  2032. one := IntermediateCode.Immediate(setType, 1);
  2033. (* start off with the empty set *)
  2034. InitOperand(res, ModeValue);
  2035. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2036. Emit(Mov(position,res.op, noBits));
  2037. FOR i := 0 TO x.elements.Length() - 1 DO
  2038. expression := x.elements.GetExpression(i);
  2039. IF expression IS SyntaxTree.RangeExpression THEN
  2040. (* range of set elements *)
  2041. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2042. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2043. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2044. ReleaseIntermediateOperand(temp)
  2045. ELSE
  2046. (* singelton element *)
  2047. Evaluate(expression, operand);
  2048. Convert(operand.op, setType);
  2049. CheckSetElement(operand.op);
  2050. (* create subset containing single element *)
  2051. Reuse1(temp, operand.op);
  2052. Emit(Shl(position,temp, one, operand.op));
  2053. ReleaseOperand(operand);
  2054. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2055. ReleaseIntermediateOperand(temp);
  2056. END
  2057. END;
  2058. result := res;
  2059. destination := dest;
  2060. IF Trace THEN TraceExit("VisitSet") END;
  2061. END VisitSet;
  2062. (* math arrays of the form [a,b,c]
  2063. x is a static array and thus does not provide any pointers
  2064. *)
  2065. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2066. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2067. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2068. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2069. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2070. element: SyntaxTree.IntegerValue;
  2071. BEGIN
  2072. numberElements := x.elements.Length();
  2073. expression := index.parameters.GetExpression(dim);
  2074. element := expression(SyntaxTree.IntegerValue);
  2075. FOR i := 0 TO numberElements-1 DO
  2076. expression := x.elements.GetExpression(i);
  2077. element.SetValue(i);
  2078. IF expression IS SyntaxTree.MathArrayExpression THEN
  2079. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2080. ELSE
  2081. Assign(index,expression);
  2082. END;
  2083. END;
  2084. END RecursiveAssignment;
  2085. PROCEDURE Dimension(): LONGINT;
  2086. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2087. BEGIN
  2088. dim := 0;
  2089. expression := x;
  2090. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2091. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2092. INC(dim);
  2093. END;
  2094. RETURN dim;
  2095. END Dimension;
  2096. BEGIN
  2097. (*static math array not providing pointers anyway *)
  2098. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2099. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2100. designator.SetType(variable.type);
  2101. dim := Dimension();
  2102. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2103. FOR i := 0 TO dim-1 DO
  2104. element := SyntaxTree.NewIntegerValue(x.position,0);
  2105. element.SetType(system.longintType);
  2106. index.parameters.AddExpression(element);
  2107. END;
  2108. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2109. RecursiveAssignment(x,0);
  2110. Expression(designator);
  2111. END VisitMathArrayExpression;
  2112. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2113. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2114. BEGIN
  2115. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2116. dest := destination; destination := emptyOperand;
  2117. IF x.operator = Scanner.Not THEN
  2118. IF conditional THEN
  2119. Condition(x.left,falseLabel,trueLabel)
  2120. ELSE
  2121. Evaluate(x.left,operand);
  2122. InitOperand(result,ModeValue);
  2123. Reuse1a(result.op,operand.op,dest);
  2124. Emit(Xor(position,result.op,operand.op,true));
  2125. ReleaseOperand(operand);
  2126. END;
  2127. ELSIF x.operator = Scanner.Minus THEN
  2128. Evaluate(x.left,operand);
  2129. InitOperand(result,ModeValue);
  2130. Reuse1a(result.op,operand.op,dest);
  2131. type := x.left.type.resolved;
  2132. IF type IS SyntaxTree.SetType THEN
  2133. Emit(Not(position,result.op,operand.op));
  2134. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2135. Reuse1(result.tag,operand.tag);
  2136. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2137. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2138. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2139. Emit(Neg(position,result.op,operand.op));
  2140. ELSE HALT(200)
  2141. END;
  2142. ReleaseOperand(operand);
  2143. ELSIF x.operator = Scanner.Address THEN
  2144. Designate(x.left,operand);
  2145. operand.mode := ModeValue;
  2146. t0 := x.left.type.resolved;
  2147. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2148. ReleaseIntermediateOperand(operand.op);
  2149. operand.op := operand.tag;
  2150. IntermediateCode.InitOperand(operand.tag);
  2151. END;
  2152. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2153. result := operand;
  2154. ELSE HALT(100)
  2155. END;
  2156. destination := dest;
  2157. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2158. END VisitUnaryExpression;
  2159. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2160. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2161. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2162. BEGIN
  2163. type := type.resolved;
  2164. originalType := type;
  2165. IF type IS SyntaxTree.PointerType THEN
  2166. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2167. END;
  2168. IF type IS SyntaxTree.ObjectType THEN
  2169. BrL(trueL);
  2170. ELSE
  2171. ASSERT(type IS SyntaxTree.RecordType);
  2172. (*
  2173. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2174. *)
  2175. ReuseCopy(left,tag);
  2176. right := TypeDescriptorAdr(type);
  2177. IF backend.cooperative THEN
  2178. repeatL := NewLabel();
  2179. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2180. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2181. END;
  2182. SetLabel(repeatL);
  2183. BreqL(trueL,left,right);
  2184. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2185. BrneL(repeatL,left,nil);
  2186. ELSIF meta.simple THEN
  2187. level := type(SyntaxTree.RecordType).Level();
  2188. (* get type desc tag of level relative to base tag *)
  2189. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2190. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2191. IntermediateCode.MakeMemory(left,addressType);
  2192. BreqL(trueL,left,right);
  2193. ELSE
  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. END;
  2201. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2202. BrL(falseL);
  2203. END;
  2204. END TypeTest;
  2205. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2206. BEGIN
  2207. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2208. IF dump # NIL THEN
  2209. dump.String(s); dump.Ln;
  2210. END;
  2211. END Error;
  2212. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2213. BEGIN
  2214. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2215. IF dump # NIL THEN
  2216. dump.String(s); dump.Ln; dump.Update;
  2217. END;
  2218. END Warning;
  2219. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2220. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2221. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2222. operand:Operand;
  2223. BEGIN
  2224. previousSection := section;
  2225. Global.GetModuleName(mod,name);
  2226. Strings.Append(name,".@Trace");
  2227. Basic.ToSegmentedName(name, pooledName);
  2228. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2229. IF dump # NIL THEN dump := section.comments END;
  2230. IF backend.hasLinkRegister THEN
  2231. Emit(Push(Basic.invalidPosition, lr));
  2232. END;
  2233. variable := mod.moduleScope.firstVariable;
  2234. WHILE variable # NIL DO
  2235. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2236. Symbol(variable, operand);
  2237. register := operand.op;
  2238. CallTraceMethod(register, variable.type);
  2239. ReleaseIntermediateOperand(register);
  2240. END;
  2241. variable := variable.nextVariable;
  2242. END;
  2243. IF backend.hasLinkRegister THEN
  2244. Emit(Pop(Basic.invalidPosition, lr));
  2245. END;
  2246. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2247. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2248. Emit(Br(position,op));
  2249. INC(statCoopTraceModule, section.pc);
  2250. section := previousSection;
  2251. IF dump # NIL THEN dump := section.comments END;
  2252. END CreateTraceModuleMethod;
  2253. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2254. BEGIN
  2255. Emit (Push(position, dst));
  2256. Emit (Push(position, src));
  2257. CallThis(position,"GarbageCollector","Assign", 2);
  2258. END CallAssignPointer;
  2259. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2260. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2261. BEGIN
  2262. IF SemanticChecker.IsPointerType (type) THEN
  2263. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2264. ELSIF type.IsRecordType() THEN
  2265. Emit (Push(position,dst));
  2266. Emit (Push(position,src));
  2267. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2268. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2269. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2270. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2271. ELSIF IsStaticArray(type) THEN
  2272. size := StaticArrayNumElements(type);
  2273. base := StaticArrayBaseType(type);
  2274. IF base.IsRecordType() THEN
  2275. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2276. Emit (Push(position, dst));
  2277. Emit (Push(position, src));
  2278. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2279. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2280. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2281. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2282. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2283. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2284. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2285. Emit (Push(position, dst));
  2286. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2287. Emit (Push(position, src));
  2288. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2289. ELSE
  2290. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2291. Emit (Push(position, dst));
  2292. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2293. Emit (Push(position, src));
  2294. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2295. ASSERT(StaticArrayBaseType(type).IsPointer());
  2296. END;
  2297. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2298. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2299. Emit (Push(position, dst));
  2300. Emit (Push(position, src));
  2301. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2302. ELSE HALT(100); (* missing ? *)
  2303. END;
  2304. END CallAssignMethod;
  2305. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2306. VAR name: Basic.SegmentedName;
  2307. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2308. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2309. context: Context;
  2310. BEGIN
  2311. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2312. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2313. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2314. GetRecordTypeName (recordType,name);
  2315. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2316. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2317. IF dump # NIL THEN dump := section.comments END;
  2318. IF backend.hasLinkRegister THEN
  2319. Emit(Push(Basic.invalidPosition, lr));
  2320. END;
  2321. variable := recordType.recordScope.firstVariable;
  2322. WHILE variable # NIL DO
  2323. IF variable.NeedsTrace() THEN
  2324. dst := NewRegisterOperand (addressType);
  2325. src := NewRegisterOperand (addressType);
  2326. Emit (Mov(position, dst, parameter1));
  2327. Emit (Mov(position, src, parameter2));
  2328. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2329. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2330. CallAssignMethod(dst, src, variable.type);
  2331. ReleaseIntermediateOperand(src);
  2332. ReleaseIntermediateOperand(dst);
  2333. END;
  2334. variable := variable.nextVariable;
  2335. END;
  2336. recordBase := recordType.GetBaseRecord();
  2337. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2338. IF backend.hasLinkRegister THEN
  2339. Emit(Pop(Basic.invalidPosition, lr));
  2340. END;
  2341. GetRecordTypeName (recordBase,name);
  2342. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2343. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2344. Emit(Br(position,op));
  2345. ELSE
  2346. Emit(Exit(position,0,0, 0));
  2347. END;
  2348. IF ~recordType.isObject THEN
  2349. GetRecordTypeName (recordType,name);
  2350. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2351. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2352. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2353. NEW(registerUsageCount);
  2354. usedRegisters := NIL;
  2355. dst := NewRegisterOperand (addressType);
  2356. src := NewRegisterOperand (addressType);
  2357. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2358. Emit(Mov(position, dst, parameter1));
  2359. Emit(Mov(position, src, parameter2));
  2360. label := NewLabel();
  2361. SetLabel(label);
  2362. Emit(Push(position, dst));
  2363. Emit(Push(position, src));
  2364. GetRecordTypeName (recordType,name);
  2365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2366. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2367. Emit(Call(position, op, 0));
  2368. Emit(Pop(position, src));
  2369. Emit(Pop(position, dst));
  2370. Emit(Add(position, dst, dst, ofs));
  2371. Emit(Add(position, src, src, ofs));
  2372. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2373. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2374. Emit(Exit(position,0,0, 0));
  2375. END;
  2376. INC(statCoopAssignProcedure, section.pc);
  2377. ReturnToContext(context);
  2378. IF dump # NIL THEN dump := section.comments END;
  2379. END CreateAssignProcedure;
  2380. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2381. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2382. BEGIN
  2383. IF IsUnsafePointer (type) THEN
  2384. skip := NewLabel();
  2385. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2386. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2387. BreqL (skip, op, nil);
  2388. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2389. SetLabel (skip);
  2390. ELSIF SemanticChecker.IsPointerType (type) THEN
  2391. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2392. CallThis(position,"GarbageCollector","Mark", 1);
  2393. ELSIF type.IsRecordType() THEN
  2394. Emit (Push(position,register));
  2395. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2396. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2397. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2398. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2399. ELSIF IsStaticArray(type) THEN
  2400. size := StaticArrayNumElements(type);
  2401. base := StaticArrayBaseType(type);
  2402. IF base.IsRecordType() THEN
  2403. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2404. Emit (Push(position, register));
  2405. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2408. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2409. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2410. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2411. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2412. Emit (Push(position, register));
  2413. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2414. ELSE
  2415. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2416. Emit (Push(position, register));
  2417. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2418. ASSERT(base.IsPointer());
  2419. END;
  2420. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2421. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2422. CallThis(position,"GarbageCollector","Mark", 1);
  2423. ELSE HALT(100); (* missing ? *)
  2424. END;
  2425. END CallTraceMethod;
  2426. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2427. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2428. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2429. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2430. BEGIN
  2431. previousSection := section;
  2432. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2433. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2434. GetRecordTypeName (recordType,name);
  2435. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2436. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2437. IF dump # NIL THEN dump := section.comments END;
  2438. IF backend.hasLinkRegister THEN
  2439. Emit(Push(Basic.invalidPosition, lr));
  2440. END;
  2441. variable := recordType.recordScope.firstVariable;
  2442. WHILE variable # NIL DO
  2443. IF variable.NeedsTrace() THEN
  2444. register := NewRegisterOperand (addressType);
  2445. Emit (Mov(position,register,parameter1));
  2446. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2447. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2448. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2449. END;
  2450. CallTraceMethod(register, variable.type);
  2451. ReleaseIntermediateOperand(register);
  2452. END;
  2453. variable := variable.nextVariable;
  2454. END;
  2455. recordBase := recordType.GetBaseRecord();
  2456. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2457. recordBase := recordBase.GetBaseRecord();
  2458. END;
  2459. IF recordBase # NIL THEN
  2460. IF backend.hasLinkRegister THEN
  2461. Emit(Pop(Basic.invalidPosition, lr));
  2462. END;
  2463. GetRecordTypeName (recordBase,name);
  2464. IF HasExplicitTraceMethod (recordBase) THEN
  2465. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2466. ELSE
  2467. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2468. END;
  2469. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2470. Emit(Br(position,op));
  2471. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2472. Emit(Exit(position,0,0,0));
  2473. ELSE
  2474. IF backend.hasLinkRegister THEN
  2475. Emit(Pop(Basic.invalidPosition, lr));
  2476. END;
  2477. IF recordType.isObject THEN
  2478. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2479. ELSE
  2480. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2481. END;
  2482. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2483. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2484. Emit(Br(position,op));
  2485. END;
  2486. IF ~recordType.isObject THEN
  2487. GetRecordTypeName (recordType,name);
  2488. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2490. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2491. NEW(registerUsageCount);
  2492. usedRegisters := NIL;
  2493. IF dump # NIL THEN dump := section.comments END;
  2494. register := NewRegisterOperand (addressType);
  2495. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2496. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2497. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2498. END;
  2499. Emit (Push(position,register));
  2500. GetRecordTypeName (recordType,name);
  2501. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2502. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2503. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2504. ReleaseIntermediateOperand(register);
  2505. Emit(Exit(position,0,0,0));
  2506. GetRecordTypeName (recordType,name);
  2507. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2509. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2510. NEW(registerUsageCount);
  2511. usedRegisters := NIL;
  2512. register := NewRegisterOperand (addressType);
  2513. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2514. Emit(Mov(position, register, parameter1));
  2515. label := NewLabel();
  2516. SetLabel(label);
  2517. Emit(Push(position, register));
  2518. GetRecordTypeName (recordType,name);
  2519. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2520. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2521. Emit(Call(position, op, 0));
  2522. Emit(Pop(position, register));
  2523. Emit(Add(position, register, register, ofs));
  2524. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2525. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2526. Emit(Exit(position,0,0,0));
  2527. END;
  2528. INC(statCoopTraceMethod, section.pc);
  2529. ReturnToContext(context);
  2530. IF dump # NIL THEN dump := section.comments END;
  2531. END CreateTraceMethod;
  2532. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2533. VAR name: Basic.SegmentedName;
  2534. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2535. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2536. context: Context;
  2537. BEGIN
  2538. IF recordType.isObject THEN RETURN END;
  2539. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2540. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2541. GetRecordTypeName (recordType,name);
  2542. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2543. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2544. IF dump # NIL THEN dump := section.comments END;
  2545. IF backend.hasLinkRegister THEN
  2546. Emit(Push(Basic.invalidPosition, lr));
  2547. END;
  2548. variable := recordType.recordScope.firstVariable;
  2549. WHILE variable # NIL DO
  2550. IF variable.NeedsTrace() THEN
  2551. dst := NewRegisterOperand (addressType);
  2552. Emit (Mov(position, dst, parameter1));
  2553. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2554. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2555. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2556. END;
  2557. CallResetProcedure(dst, nil, variable.type);
  2558. ReleaseIntermediateOperand(dst);
  2559. END;
  2560. variable := variable.nextVariable;
  2561. END;
  2562. recordBase := recordType.GetBaseRecord();
  2563. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2564. IF backend.hasLinkRegister THEN
  2565. Emit(Pop(Basic.invalidPosition, lr));
  2566. END;
  2567. GetRecordTypeName (recordBase,name);
  2568. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2569. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2570. Emit(Br(position,op));
  2571. ELSE
  2572. Emit(Exit(position,0,0, 0));
  2573. END;
  2574. GetRecordTypeName (recordType,name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2576. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2577. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2578. NEW(registerUsageCount);
  2579. usedRegisters := NIL;
  2580. dst := NewRegisterOperand (addressType);
  2581. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2582. Emit(Mov(position, dst, parameter1));
  2583. label := NewLabel();
  2584. SetLabel(label);
  2585. Emit(Push(position, dst));
  2586. GetRecordTypeName (recordType,name);
  2587. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2588. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2589. Emit(Call(position, op, 0));
  2590. Emit(Pop(position, dst));
  2591. Emit(Add(position, dst, dst, ofs));
  2592. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2593. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2594. Emit(Exit(position,0,0, 0));
  2595. INC(statCoopResetProcedure, section.pc);
  2596. ReturnToContext(context);
  2597. IF dump # NIL THEN dump := section.comments END;
  2598. END CreateResetProcedure;
  2599. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2600. VAR name: Basic.SegmentedName; context: Context;
  2601. BEGIN
  2602. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2603. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2604. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2605. IF dump # NIL THEN dump := section.comments END;
  2606. IF backend.hasLinkRegister THEN
  2607. Emit(Push(Basic.invalidPosition, lr));
  2608. END;
  2609. Emit(Push(position,fp));
  2610. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2611. ResetVariables(scope);
  2612. Emit(Pop(position,fp));
  2613. Emit(Exit(position,0,0, 0));
  2614. ReturnToContext(context);
  2615. IF dump # NIL THEN dump := section.comments END;
  2616. END CreateResetMethod;
  2617. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2618. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2619. BEGIN
  2620. IF SemanticChecker.IsPointerType (type) THEN
  2621. Emit (Push(position, dest));
  2622. CallThis(position,"GarbageCollector","Reset", 1);
  2623. ELSIF type.IsRecordType() THEN
  2624. Emit (Push(position, dest));
  2625. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2626. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2627. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2628. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2629. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2630. size := GetArrayLength(type, tag);
  2631. base := ArrayBaseType(type);
  2632. IF base.IsRecordType() THEN
  2633. Emit (Push(position, size));
  2634. Emit (Push(position, dest));
  2635. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2636. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2637. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2638. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2639. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2640. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2641. Emit (Push(position, size));
  2642. Emit (Push(position, dest));
  2643. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2644. ELSE
  2645. Emit (Push(position, size));
  2646. Emit (Push(position, dest));
  2647. CallThis(position,"GarbageCollector","ResetArray", 2);
  2648. ASSERT(ArrayBaseType(type).IsPointer());
  2649. END;
  2650. ReleaseIntermediateOperand(size);
  2651. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2652. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2653. Emit (Push(position, dest));
  2654. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2655. ELSE HALT(100); (* missing ? *)
  2656. END;
  2657. END CallResetProcedure;
  2658. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2659. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2660. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2661. VAR operand: Operand;
  2662. BEGIN
  2663. Symbol (symbol, operand);
  2664. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2665. ReleaseOperand(operand);
  2666. END Reset;
  2667. BEGIN
  2668. previousScope := currentScope;
  2669. currentScope := scope;
  2670. pc := section.pc;
  2671. variable := scope.firstVariable;
  2672. WHILE variable # NIL DO
  2673. IF variable.NeedsTrace() THEN
  2674. Reset (variable);
  2675. END;
  2676. variable := variable.nextVariable;
  2677. END;
  2678. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2679. WHILE parameter # NIL DO
  2680. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2681. Reset (parameter);
  2682. END;
  2683. parameter := parameter.nextParameter;
  2684. END;
  2685. INC(statCoopResetVariables, section.pc - pc);
  2686. currentScope := previousScope;
  2687. END ResetVariables;
  2688. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2689. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2690. BEGIN
  2691. type := symbol.type.resolved;
  2692. SaveRegisters();ReleaseUsedRegisters(saved);
  2693. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2694. Symbol(symbol, operand);
  2695. ToMemory(operand.op,addressType,0);
  2696. Emit(Push(position,operand.op));
  2697. IF refer THEN
  2698. CallThis(position,"Heaps","Refer",1);
  2699. ELSE
  2700. CallThis(position,"Heaps","Reset",1);
  2701. END;
  2702. ELSIF type.IsRecordType() THEN
  2703. Symbol(symbol, operand);
  2704. Emit(Push(position,operand.op));
  2705. Emit(Push(position,operand.tag)); (* type desc *)
  2706. IF refer THEN
  2707. CallThis(position,"Heaps","ReferRecord",2);
  2708. ELSE
  2709. CallThis(position,"Heaps","ResetRecord",2);
  2710. END;
  2711. ELSIF IsStaticArray(type) THEN
  2712. size := StaticArrayNumElements(type);
  2713. base := StaticArrayBaseType(type);
  2714. Symbol(symbol, operand);
  2715. arg := TypeDescriptorAdr(base);
  2716. Emit(Push(position,operand.op));
  2717. Emit(Push(position,arg));
  2718. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2719. ReleaseIntermediateOperand(arg);
  2720. IF refer THEN
  2721. CallThis(position,"Heaps","ReferArray",3);
  2722. ELSE
  2723. CallThis(position,"Heaps","ResetArray",3);
  2724. END;
  2725. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2726. size := StaticMathArrayNumElements(type);
  2727. base := StaticMathArrayBaseType(type);
  2728. Symbol(symbol, operand);
  2729. arg := TypeDescriptorAdr(base);
  2730. Emit(Push(position,operand.op));
  2731. Emit(Push(position,arg));
  2732. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2733. ReleaseIntermediateOperand(arg);
  2734. IF refer THEN
  2735. CallThis(position,"Heaps","ReferArray",3);
  2736. ELSE
  2737. CallThis(position,"Heaps","ResetArray",3);
  2738. END;
  2739. ELSIF type IS SyntaxTree.MathArrayType THEN
  2740. Symbol(symbol, operand);
  2741. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2742. Emit (Push(position, operand.op));
  2743. ELSE
  2744. Emit (Push(position, operand.tag));
  2745. END;
  2746. IF refer THEN
  2747. CallThis(position,"Heaps","ReferMathArray", 1);
  2748. ELSE
  2749. CallThis(position,"Heaps","ResetMathArray", 1);
  2750. END;
  2751. ELSIF type IS SyntaxTree.ProcedureType THEN
  2752. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2753. Symbol(symbol, operand);
  2754. Emit (Push(position, operand.tag));
  2755. IF refer THEN
  2756. CallThis(position,"Heaps","Refer", 1);
  2757. ELSE
  2758. CallThis(position,"Heaps","Reset", 1);
  2759. END;
  2760. ELSE HALT(100); (* missing ? *)
  2761. END;
  2762. ReleaseOperand(operand);
  2763. RestoreRegisters(saved);
  2764. END Reset;
  2765. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2766. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2767. BEGIN
  2768. previousScope := currentScope;
  2769. currentScope := scope;
  2770. pc := section.pc;
  2771. IF ~ refer THEN
  2772. variable := scope.firstVariable;
  2773. prevOffset := MAX(SIZE);
  2774. WHILE variable # NIL DO
  2775. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2776. Reset (variable,refer);
  2777. prevOffset := variable.offsetInBits;
  2778. END;
  2779. variable := variable.nextVariable;
  2780. END;
  2781. END;
  2782. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2783. WHILE parameter # NIL DO
  2784. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2785. Reset (parameter,refer);
  2786. END;
  2787. parameter := parameter.nextParameter;
  2788. END;
  2789. INC(statCoopResetVariables, section.pc - pc);
  2790. currentScope := previousScope;
  2791. END ResetVariables2;
  2792. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2793. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2794. VAR op: IntermediateCode.Operand; context: Context;
  2795. BEGIN
  2796. previousSection := section;
  2797. GetCodeSectionNameForSymbol(procedure, name);
  2798. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2799. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2800. IF dump # NIL THEN dump := section.comments END;
  2801. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2802. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2803. Emit(Data(position,op));
  2804. Emit(Data(position,nil));
  2805. IF HasPointers (procedure.procedureScope) THEN
  2806. GetCodeSectionNameForSymbol(procedure, name);
  2807. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2808. ELSE
  2809. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2810. END;
  2811. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2812. Emit(Data(position,op));
  2813. ReturnToContext(context);
  2814. IF dump # NIL THEN dump := section.comments END;
  2815. END CreateProcedureDescriptor;
  2816. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2817. VAR import: SyntaxTree.Import;
  2818. s: Basic.MessageString;
  2819. selfName: SyntaxTree.IdentifierString;
  2820. BEGIN
  2821. moduleScope.ownerModule.GetName(selfName);
  2822. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2823. module := moduleScope.ownerModule
  2824. ELSE
  2825. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2826. IF import = NIL THEN
  2827. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2828. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2829. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2830. s := "Module ";
  2831. Strings.Append(s,moduleName);
  2832. Strings.Append(s," cannot be imported.");
  2833. IF force THEN
  2834. Error(position,s);
  2835. ELSIF canBeLoaded THEN
  2836. IF WarningDynamicLoading THEN
  2837. Strings.Append(s, "=> no dynamic linking.");
  2838. Warning(position, s);
  2839. END;
  2840. canBeLoaded := FALSE;
  2841. END;
  2842. RETURN FALSE
  2843. ELSE
  2844. SELF.module.imports.AddName(moduleName)
  2845. END;
  2846. ELSIF import.module = NIL THEN (* already tried *)
  2847. RETURN FALSE
  2848. END;
  2849. module := import.module;
  2850. END;
  2851. RETURN TRUE
  2852. END AddImport;
  2853. (* needed for old binary object file format*)
  2854. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2855. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2856. BEGIN
  2857. IF AddImport(moduleName,module,TRUE) THEN
  2858. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2859. IF procedure = NIL THEN
  2860. s := "Instruction not supported on target, emulation procedure ";
  2861. Strings.Append(s,moduleName);
  2862. Strings.Append(s,".");
  2863. Strings.Append(s,procedureName);
  2864. Strings.Append(s," not present");
  2865. Error(position,s);
  2866. ELSE
  2867. StaticCallOperand(r,procedure);
  2868. ReleaseOperand(r);
  2869. fp := GetFingerprint(procedure);
  2870. END;
  2871. END;
  2872. END EnsureSymbol;
  2873. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2874. VAR exit: Label; trueL,falseL: Label;
  2875. BEGIN
  2876. trueL := NewLabel();
  2877. falseL := NewLabel();
  2878. exit := NewLabel();
  2879. Condition(x,trueL,falseL);
  2880. InitOperand(result,ModeValue);
  2881. SetLabel(trueL);
  2882. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2883. Emit(Mov(position,result.op,true));
  2884. BrL(exit);
  2885. SetLabel(falseL);
  2886. Emit(MovReplace(position,result.op,false));
  2887. SetLabel(exit);
  2888. END ConditionToValue;
  2889. PROCEDURE ValueToCondition(VAR op: Operand);
  2890. BEGIN
  2891. LoadValue(op,system.booleanType);
  2892. BrneL(trueLabel,op.op, false);
  2893. ReleaseOperand(op);
  2894. BrL(falseLabel);
  2895. END ValueToCondition;
  2896. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2897. VAR size: LONGINT;
  2898. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2899. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2900. BEGIN
  2901. ASSERT(type.form = SyntaxTree.Open);
  2902. baseType := type.arrayBase.resolved;
  2903. IF IsOpenArray(baseType) THEN
  2904. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2905. ELSE
  2906. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2907. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2908. END;
  2909. len := tag;
  2910. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2911. IntermediateCode.MakeMemory(len,addressType);
  2912. UseIntermediateOperand(len);
  2913. Reuse2(res,sizeOperand,len);
  2914. Emit(Mul(position,res,sizeOperand,len));
  2915. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2916. RETURN res
  2917. END GetArraySize;
  2918. BEGIN
  2919. type := type.resolved;
  2920. IF IsOpenArray(type) THEN
  2921. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2922. RETURN tag
  2923. ELSE
  2924. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2925. END;
  2926. ELSE
  2927. size := ToMemoryUnits(system,system.SizeOf(type));
  2928. RETURN IntermediateCode.Immediate(addressType,size)
  2929. END;
  2930. END GetDynamicSize;
  2931. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2932. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2933. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2934. BEGIN
  2935. ASSERT(type.form = SyntaxTree.Open);
  2936. baseType := type.arrayBase.resolved;
  2937. IF IsOpenArray(baseType) THEN
  2938. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2939. ELSE
  2940. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2941. END;
  2942. len := tag;
  2943. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2944. IntermediateCode.MakeMemory(len,addressType);
  2945. UseIntermediateOperand(len);
  2946. Reuse2(res,sizeOperand,len);
  2947. Emit(Mul(position,res,sizeOperand,len));
  2948. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2949. RETURN res
  2950. END GetLength;
  2951. BEGIN
  2952. type := type.resolved;
  2953. IF IsOpenArray(type) THEN
  2954. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2955. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2956. ELSIF type IS SyntaxTree.StringType THEN
  2957. RETURN tag;
  2958. ELSE
  2959. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2960. END;
  2961. END GetArrayLength;
  2962. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2963. VAR result: IntermediateCode.Operand;
  2964. BEGIN
  2965. IF backend.cooperative THEN
  2966. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2967. ELSE
  2968. MakeMemory(result, tag, addressType, 0);
  2969. END;
  2970. RETURN result
  2971. END GetSizeFromTag;
  2972. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2973. VAR parameter: SyntaxTree.Parameter;
  2974. BEGIN
  2975. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2976. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2977. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2978. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2979. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2980. END;
  2981. RETURN GetDynamicSize(e.type, tag);
  2982. END GetArrayOfBytesSize;
  2983. (*
  2984. to find imported symbol. not needed ?
  2985. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2986. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2987. BEGIN
  2988. IF AddImport(moduleName,importedModule,FALSE) THEN
  2989. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2990. RETURN symbol
  2991. ELSE
  2992. RETURN NIL
  2993. END
  2994. END SymbolByName;
  2995. *)
  2996. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2997. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2998. BEGIN
  2999. IF AddImport(moduleName,runtimeModule,force) THEN
  3000. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3001. IF procedure = NIL THEN
  3002. s := "Procedure ";
  3003. Strings.Append(s,moduleName);
  3004. Strings.Append(s,".");
  3005. Strings.Append(s,procedureName);
  3006. Strings.Append(s," not present");
  3007. Error(position,s);
  3008. RETURN FALSE
  3009. ELSE
  3010. RETURN TRUE
  3011. END;
  3012. ELSE RETURN FALSE
  3013. END;
  3014. END GetRuntimeProcedure;
  3015. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3016. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3017. s: Basic.MessageString;
  3018. BEGIN
  3019. Basic.InitSegmentedName(name);
  3020. name[0] := Basic.MakeString(moduleName);
  3021. name[1] := Basic.MakeString(typeName);
  3022. name[2] := -1;
  3023. IF AddImport(moduleName,importedModule, FALSE) THEN
  3024. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3025. IF symbol = NIL THEN
  3026. s := "type ";
  3027. Strings.Append(s,moduleName);
  3028. Strings.Append(s,".");
  3029. Strings.Append(s,typeName);
  3030. Strings.Append(s," not present");
  3031. Error(position,s);
  3032. END;
  3033. ELSE symbol := NIL;
  3034. END;
  3035. IF importedModule = moduleScope.ownerModule THEN
  3036. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3037. ELSE
  3038. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3039. END;
  3040. RETURN symbol
  3041. END GetTypeDescriptor;
  3042. (* 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. *)
  3043. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3044. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3045. pooledName: Basic.SegmentedName; size: LONGINT;
  3046. BEGIN
  3047. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3048. StaticCallOperand(result,procedure);
  3049. IF numberParameters < 0 THEN
  3050. size := ProcParametersSize(procedure);
  3051. ELSE
  3052. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3053. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3054. Error(position,"runtime call parameter count mismatch");
  3055. END;
  3056. END;
  3057. Emit(Call(position, result.op, size));
  3058. ReleaseOperand(result);
  3059. ELSE (* only static linking possible *)
  3060. ASSERT(numberParameters >= 0);
  3061. Basic.InitSegmentedName(pooledName);
  3062. pooledName[0] := Basic.MakeString(moduleName);
  3063. pooledName[1] := Basic.MakeString(procedureName);
  3064. pooledName[2] := -1;
  3065. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3066. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3067. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3068. END;
  3069. END CallThisChecked;
  3070. (* 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. *)
  3071. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3072. BEGIN
  3073. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3074. END CallThis;
  3075. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3076. VAR
  3077. left,right: Operand;
  3078. leftSize, rightSize: IntermediateCode.Operand;
  3079. saved: RegisterEntry;
  3080. reg: IntermediateCode.Operand;
  3081. procedureName: SyntaxTree.IdentifierString;
  3082. BEGIN
  3083. procedureName := "CompareString";
  3084. SaveRegisters();ReleaseUsedRegisters(saved);
  3085. Designate(leftExpression,left);
  3086. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3087. Emit(Push(position,leftSize));
  3088. ReleaseIntermediateOperand(leftSize);
  3089. Emit(Push(position,left.op));
  3090. ReleaseOperand(left);
  3091. Designate(rightExpression,right);
  3092. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3093. Emit(Push(position,rightSize));
  3094. ReleaseIntermediateOperand(rightSize);
  3095. Emit(Push(position,right.op));
  3096. ReleaseOperand(right);
  3097. CallThis(position,builtinsModuleName,procedureName, 4);
  3098. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3099. Emit(Result(position,reg));
  3100. (*
  3101. AcquireThisRegister(int8,IntermediateCode.Result);
  3102. *)
  3103. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3104. (*
  3105. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3106. *)
  3107. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3108. ReleaseIntermediateOperand(reg);
  3109. BrL(falseLabel);
  3110. END CompareString;
  3111. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3112. VAR
  3113. left,right: Operand;
  3114. leftSize, rightSize: IntermediateCode.Operand;
  3115. saved: RegisterEntry;
  3116. procedureName: SyntaxTree.IdentifierString;
  3117. BEGIN
  3118. procedureName := "CopyString";
  3119. SaveRegisters();ReleaseUsedRegisters(saved);
  3120. Designate(leftExpression,left);
  3121. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3122. Emit(Push(position,leftSize));
  3123. ReleaseIntermediateOperand(leftSize);
  3124. Emit(Push(position,left.op));
  3125. ReleaseOperand(left);
  3126. Designate(rightExpression,right);
  3127. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3128. Emit(Push(position,rightSize));
  3129. ReleaseIntermediateOperand(rightSize);
  3130. Emit(Push(position,right.op));
  3131. ReleaseOperand(right);
  3132. CallThis(position,builtinsModuleName,procedureName,4);
  3133. RestoreRegisters(saved);
  3134. END CopyString;
  3135. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3136. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3137. leftType,rightType: SyntaxTree.Type;
  3138. leftExpression,rightExpression : SyntaxTree.Expression;
  3139. componentType: IntermediateCode.Type;
  3140. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3141. size: LONGINT;
  3142. BEGIN
  3143. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3144. dest := destination; destination := emptyOperand;
  3145. leftType := x.left.type.resolved;
  3146. rightType := x.right.type.resolved;
  3147. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3148. CASE x.operator OF
  3149. Scanner.Or:
  3150. (* shortcut evaluation of left OR right *)
  3151. IF ~conditional THEN ConditionToValue(x);
  3152. ELSE
  3153. next := NewLabel();
  3154. Condition(x.left,trueLabel,next);
  3155. SetLabel(next);
  3156. Condition(x.right,trueLabel,falseLabel);
  3157. END;
  3158. |Scanner.And:
  3159. (* shortcut evaluation of left & right *)
  3160. IF ~conditional THEN ConditionToValue(x);
  3161. ELSE
  3162. next := NewLabel();
  3163. Condition(x.left,next,falseLabel);
  3164. SetLabel(next);
  3165. Condition(x.right,trueLabel,falseLabel);
  3166. END;
  3167. |Scanner.Is:
  3168. IF ~conditional THEN ConditionToValue(x);
  3169. ELSE
  3170. (* get type desc tag *)
  3171. IF IsPointerToRecord(leftType,recordType) THEN
  3172. Evaluate(x.left,left);
  3173. Dereference(left,recordType,IsUnsafePointer(leftType))
  3174. ELSE
  3175. Designate(x.left,left);
  3176. END;
  3177. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3178. ReleaseOperand(left);
  3179. END;
  3180. |Scanner.Plus:
  3181. Evaluate(x.left,left);
  3182. Evaluate(x.right,right);
  3183. IF leftType IS SyntaxTree.SetType THEN
  3184. InitOperand(result,ModeValue);
  3185. Reuse2a(result.op,left.op,right.op,dest);
  3186. Emit(Or(position,result.op,left.op,right.op));
  3187. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3188. InitOperand(result,ModeValue);
  3189. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3190. Reuse2(result.tag,left.tag,right.tag);
  3191. Emit(Add(position,result.op,left.op,right.op));
  3192. Emit(Add(position,result.tag,left.tag,right.tag))
  3193. ELSE
  3194. InitOperand(result,ModeValue);
  3195. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3196. AddInt(result.op, left.op, right.op) ;
  3197. ELSE
  3198. *)
  3199. Reuse2a(result.op,left.op,right.op,dest);
  3200. Emit(Add(position,result.op,left.op,right.op));
  3201. (*
  3202. END;
  3203. *)
  3204. END;
  3205. ReleaseOperand(left); ReleaseOperand(right);
  3206. |Scanner.Minus:
  3207. Evaluate(x.left,left);
  3208. Evaluate(x.right,right);
  3209. IF leftType IS SyntaxTree.SetType THEN
  3210. InitOperand(result,ModeValue);
  3211. Reuse1(result.op,right.op);
  3212. Emit(Not(position,result.op,right.op));
  3213. ReleaseOperand(right);
  3214. Emit(And(position,result.op,result.op,left.op));
  3215. ReleaseOperand(left);
  3216. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3217. InitOperand(result,ModeValue);
  3218. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3219. Reuse2(result.tag,left.tag,right.tag);
  3220. Emit(Sub(position,result.op,left.op,right.op));
  3221. Emit(Sub(position,result.tag,left.tag,right.tag));
  3222. ReleaseOperand(left); ReleaseOperand(right)
  3223. ELSE
  3224. InitOperand(result,ModeValue);
  3225. Reuse2a(result.op,left.op,right.op,dest);
  3226. Emit(Sub(position,result.op,left.op,right.op));
  3227. ReleaseOperand(left); ReleaseOperand(right);
  3228. END;
  3229. |Scanner.Times:
  3230. Evaluate(x.left,left);
  3231. Evaluate(x.right,right);
  3232. IF leftType IS SyntaxTree.SetType THEN
  3233. InitOperand(result,ModeValue);
  3234. Reuse2a(result.op,left.op,right.op,dest);
  3235. Emit(And(position,result.op,left.op,right.op));
  3236. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3237. InitOperand(result, ModeValue);
  3238. componentType := left.op.type;
  3239. (* TODO: review this *)
  3240. (*
  3241. result.op = left.op * right.op - left.tag * right.tag
  3242. result.tag = left.tag * right.op + left.op * right.tag
  3243. *)
  3244. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3245. Emit(Mul(position,result.op, left.op, right.op));
  3246. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3247. Emit(Mul(position,tempReg, left.tag, right.tag));
  3248. Emit(Sub(position,result.op, result.op, tempReg));
  3249. Reuse2(result.tag, left.tag, right.op);
  3250. Emit(Mul(position,result.tag, left.tag, right.op));
  3251. Emit(Mul(position,tempReg, left.op, right.tag));
  3252. Emit(Add(position,result.tag, result.tag, tempReg));
  3253. ReleaseIntermediateOperand(tempReg)
  3254. ELSE
  3255. InitOperand(result,ModeValue);
  3256. Reuse2a(result.op,left.op,right.op,dest);
  3257. Emit(Mul(position,result.op,left.op,right.op));
  3258. END;
  3259. ReleaseOperand(left); ReleaseOperand(right);
  3260. |Scanner.Div:
  3261. Evaluate(x.left,left);
  3262. Evaluate(x.right,right);
  3263. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3264. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3265. IF ~isUnchecked THEN
  3266. exit := NewLabel();
  3267. BrltL(exit,zero,right.op);
  3268. EmitTrap(position,NegativeDivisorTrap);
  3269. SetLabel(exit);
  3270. END;
  3271. END;
  3272. InitOperand(result,ModeValue);
  3273. Reuse2a(result.op,left.op,right.op,dest);
  3274. Emit(Div(position,result.op,left.op,right.op));
  3275. ReleaseOperand(left); ReleaseOperand(right);
  3276. |Scanner.Mod:
  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(Mod(position,result.op,left.op,right.op));
  3291. ReleaseOperand(left); ReleaseOperand(right);
  3292. |Scanner.Slash:
  3293. Evaluate(x.left,left);
  3294. Evaluate(x.right,right);
  3295. IF leftType IS SyntaxTree.SetType THEN
  3296. InitOperand(result,ModeValue);
  3297. Reuse2a(result.op,left.op,right.op,dest);
  3298. Emit(Xor(position,result.op,left.op,right.op));
  3299. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3300. InitOperand(result,ModeValue);
  3301. componentType := left.op.type;
  3302. (* review this *)
  3303. (*
  3304. divisor = right.op * right.op + right.tag * right.tag
  3305. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3306. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3307. *)
  3308. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3309. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3310. Emit(Mul(position,tempReg, right.op, right.op));
  3311. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3312. Emit(Add(position,tempReg, tempReg, tempReg2));
  3313. result.op := tempReg2;
  3314. Emit(Mul(position,result.op, left.op, right.op));
  3315. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3316. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3317. Emit(Add(position,result.op, result.op, tempReg2));
  3318. Emit(Div(position,result.op, result.op, tempReg));
  3319. Reuse2(result.tag, left.tag, right.op);
  3320. Emit(Mul(position,result.tag, left.tag, right.op));
  3321. Emit(Mul(position,tempReg2, left.op, right.tag));
  3322. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3323. Emit(Div(position,result.tag, result.tag, tempReg));
  3324. ReleaseIntermediateOperand(tempReg);
  3325. ReleaseIntermediateOperand(tempReg2)
  3326. ELSE
  3327. InitOperand(result,ModeValue);
  3328. Reuse2a(result.op,left.op,right.op,dest);
  3329. Emit(Div(position,result.op,left.op,right.op));
  3330. END;
  3331. ReleaseOperand(left); ReleaseOperand(right);
  3332. |Scanner.Equal:
  3333. IF ~conditional THEN ConditionToValue(x);
  3334. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3335. CompareString(BreqL,x.left,x.right);
  3336. ELSE
  3337. Evaluate(x.left,left);
  3338. Evaluate(x.right,right);
  3339. IF leftType IS SyntaxTree.RangeType THEN
  3340. ASSERT(rightType IS SyntaxTree.RangeType);
  3341. BrneL(falseLabel, left.op, right.op); (* first *)
  3342. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3343. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3344. ReleaseOperand(left); ReleaseOperand(right);
  3345. BrL(trueLabel)
  3346. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3347. BrneL(falseLabel, left.op, right.op); (* first *)
  3348. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3349. ReleaseOperand(left); ReleaseOperand(right);
  3350. BrL(trueLabel)
  3351. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3352. (* TODO: review this *)
  3353. BrneL(falseLabel, left.op, right.op); (* real part *)
  3354. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3355. ReleaseOperand(left); ReleaseOperand(right);
  3356. BrL(trueLabel)
  3357. ELSE
  3358. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3359. ReleaseOperand(left); ReleaseOperand(right);
  3360. BrL(trueLabel);
  3361. END;
  3362. END;
  3363. |Scanner.LessEqual:
  3364. IF ~conditional THEN ConditionToValue(x);
  3365. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3366. CompareString(BrgeL,x.right,x.left);
  3367. ELSE
  3368. Evaluate(x.left,left);
  3369. Evaluate(x.right,right);
  3370. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3371. Reuse1(temp.op,right.op);
  3372. Emit(And(position,temp.op,left.op,right.op));
  3373. ReleaseOperand(right);
  3374. BreqL(trueLabel,temp.op,left.op);
  3375. BrL(falseLabel);
  3376. ReleaseOperand(temp);ReleaseOperand(left);
  3377. ELSE
  3378. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3379. ReleaseOperand(left); ReleaseOperand(right);
  3380. BrL(trueLabel);
  3381. END;
  3382. END;
  3383. |Scanner.Less:
  3384. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3385. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3386. leftExpression.SetType(system.booleanType);
  3387. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3388. rightExpression.SetType(system.booleanType);
  3389. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3390. leftExpression.SetType(system.booleanType);
  3391. Expression(leftExpression);
  3392. ELSIF ~conditional THEN ConditionToValue(x);
  3393. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3394. CompareString(BrltL,x.left,x.right);
  3395. ELSE
  3396. Evaluate(x.left,left);
  3397. Evaluate(x.right,right);
  3398. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3399. ReleaseOperand(left); ReleaseOperand(right);
  3400. BrL(trueLabel);
  3401. END;
  3402. |Scanner.Greater:
  3403. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3404. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3405. leftExpression.SetType(system.booleanType);
  3406. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3407. rightExpression.SetType(system.booleanType);
  3408. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3409. leftExpression.SetType(system.booleanType);
  3410. Expression(leftExpression);
  3411. ELSIF ~conditional THEN ConditionToValue(x);
  3412. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3413. CompareString(BrltL,x.right,x.left);
  3414. ELSE
  3415. Evaluate(x.left,left);
  3416. Evaluate(x.right,right);
  3417. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3418. ReleaseOperand(left); ReleaseOperand(right);
  3419. BrL(trueLabel);
  3420. END;
  3421. |Scanner.GreaterEqual:
  3422. IF ~conditional THEN ConditionToValue(x);
  3423. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3424. CompareString(BrgeL,x.left,x.right);
  3425. ELSE
  3426. Evaluate(x.left,left);
  3427. Evaluate(x.right,right);
  3428. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3429. Reuse1(temp.op,left.op);
  3430. Emit(And(position,temp.op,left.op,right.op));
  3431. ReleaseOperand(left);
  3432. BreqL(trueLabel, temp.op,right.op);
  3433. ReleaseOperand(temp); ReleaseOperand(right);
  3434. BrL(falseLabel);
  3435. ELSE
  3436. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3437. ReleaseOperand(left); ReleaseOperand(right);
  3438. BrL(trueLabel);
  3439. END;
  3440. END;
  3441. |Scanner.Unequal:
  3442. IF ~conditional THEN ConditionToValue(x);
  3443. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3444. CompareString(BrneL,x.left,x.right);
  3445. ELSE
  3446. Evaluate(x.left,left);
  3447. Evaluate(x.right,right);
  3448. IF leftType IS SyntaxTree.RangeType THEN
  3449. ASSERT(rightType IS SyntaxTree.RangeType);
  3450. BrneL(trueLabel, left.op, right.op); (* first *)
  3451. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3452. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3453. ReleaseOperand(left); ReleaseOperand(right);
  3454. BrL(falseLabel)
  3455. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3456. BrneL(trueLabel, left.op, right.op); (* first *)
  3457. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3458. ReleaseOperand(left); ReleaseOperand(right);
  3459. BrL(falseLabel)
  3460. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3461. (* TODO: review this *)
  3462. BrneL(trueLabel, left.op, right.op); (* real part *)
  3463. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3464. ReleaseOperand(left); ReleaseOperand(right);
  3465. BrL(falseLabel)
  3466. ELSE
  3467. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3468. ReleaseOperand(left); ReleaseOperand(right);
  3469. BrL(trueLabel);
  3470. END;
  3471. END;
  3472. |Scanner.In:
  3473. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3474. Evaluate(x.left,left);
  3475. Evaluate(x.right,right);
  3476. Convert(left.op,setType);
  3477. Convert(right.op,setType);
  3478. ReuseCopy(temp.op,right.op);
  3479. Emit(Shr(position,temp.op,temp.op,left.op));
  3480. ReleaseOperand(right); ReleaseOperand(left);
  3481. IntermediateCode.InitImmediate(one,setType,1);
  3482. Emit(And(position,temp.op,temp.op,one));
  3483. IF conditional THEN
  3484. IntermediateCode.InitImmediate(zero,setType,0);
  3485. BrneL(trueLabel,temp.op,zero);
  3486. ReleaseOperand(temp);
  3487. BrL(falseLabel);
  3488. ELSE
  3489. Convert(temp.op,bool);
  3490. result.mode := ModeValue;
  3491. result.op := temp.op;
  3492. result.tag := nil; (* may be left over from calls to evaluate *)
  3493. END;
  3494. ELSE
  3495. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3496. IF x.operator = Scanner.Questionmarks THEN
  3497. leftExpression := x.left;
  3498. rightExpression := x.right;
  3499. ELSE
  3500. leftExpression := x.right;
  3501. rightExpression := x.left;
  3502. END;
  3503. Evaluate(leftExpression, left);
  3504. Emit(Push(position,left.op));
  3505. ReleaseOperand(left);
  3506. Designate(rightExpression, right);
  3507. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3508. IF ~backend.cellsAreObjects THEN
  3509. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3510. END;
  3511. Emit(Push(position,right.op));
  3512. ReleaseOperand(right);
  3513. IF backend.cellsAreObjects THEN
  3514. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3515. ELSE
  3516. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3517. END;
  3518. InitOperand(result, ModeValue);
  3519. result.op := NewRegisterOperand(bool);
  3520. Emit(Result(position,result.op));
  3521. IF conditional THEN
  3522. IntermediateCode.InitImmediate(zero,setType,0);
  3523. BrneL(trueLabel,result.op,zero);
  3524. ReleaseOperand(result);
  3525. BrL(falseLabel);
  3526. END;
  3527. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3528. leftExpression := x.left;
  3529. rightExpression := x.right;
  3530. Evaluate(leftExpression, left);
  3531. Emit(Push(position,left.op));
  3532. ReleaseOperand(left);
  3533. Evaluate(rightExpression, right);
  3534. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3535. IF ~backend.cellsAreObjects THEN
  3536. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3537. END;
  3538. Emit(Push(position,right.op));
  3539. ReleaseOperand(right);
  3540. IF backend.cellsAreObjects THEN
  3541. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3542. ELSE
  3543. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3544. END;
  3545. InitOperand(result, ModeValue);
  3546. result.op := NewRegisterOperand(bool);
  3547. Emit(Result(position,result.op));
  3548. IF conditional THEN
  3549. IntermediateCode.InitImmediate(zero,setType,0);
  3550. BrneL(trueLabel,result.op,zero);
  3551. ReleaseOperand(result);
  3552. BrL(falseLabel);
  3553. END;
  3554. ELSE
  3555. HALT(100);
  3556. END;
  3557. END;
  3558. destination := dest;
  3559. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3560. END VisitBinaryExpression;
  3561. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3562. VAR localResult, operand: Operand;
  3563. BEGIN
  3564. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3565. InitOperand(localResult, ModeValue);
  3566. ASSERT(x.first # NIL);
  3567. Evaluate(x.first, operand);
  3568. localResult.op := operand.op;
  3569. ReleaseOperand(operand);
  3570. UseIntermediateOperand(localResult.op);
  3571. ASSERT(x.last # NIL);
  3572. Evaluate(x.last, operand);
  3573. localResult.tag := operand.op;
  3574. ReleaseOperand(operand);
  3575. UseIntermediateOperand(localResult.tag);
  3576. IF x.step # NIL THEN
  3577. Evaluate(x.step, operand);
  3578. localResult.extra := operand.op;
  3579. ReleaseOperand(operand);
  3580. UseIntermediateOperand(localResult.extra);
  3581. END;
  3582. result := localResult;
  3583. IF Trace THEN TraceExit("VisitRangeExpression") END
  3584. END VisitRangeExpression;
  3585. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3586. BEGIN
  3587. HALT(100); (* should never be evaluated *)
  3588. END VisitTensorRangeExpression;
  3589. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3590. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3591. BEGIN
  3592. IF Trace THEN TraceEnter("VisitConversion") END;
  3593. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3594. dest := destination; destination := emptyOperand;
  3595. Evaluate(x.expression,old);
  3596. InitOperand(result,ModeValue);
  3597. result.op := old.op;
  3598. ASSERT(result.op.mode # 0);
  3599. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3600. (* convert TO a complex number *)
  3601. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3602. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3603. ASSERT(result.op.mode # 0);
  3604. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3605. (* convert FROM a complex number TO a complex number*)
  3606. result.tag := old.tag;
  3607. ASSERT(result.tag.mode # 0);
  3608. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3609. ASSERT(result.tag.mode # 0)
  3610. ELSE
  3611. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3612. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3613. END
  3614. ELSE
  3615. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3616. ASSERT(result.op.mode # 0);
  3617. result.tag := old.tag; (*! probably never used *)
  3618. END;
  3619. destination := dest;
  3620. IF Trace THEN TraceExit("VisitConversion") END;
  3621. END VisitConversion;
  3622. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3623. BEGIN
  3624. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3625. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3626. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3627. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3628. END VisitTypeDeclaration;
  3629. (** designators (expressions) *)
  3630. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3631. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3632. BEGIN
  3633. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3634. IF x.left # NIL THEN Expression(x.left) END;
  3635. Symbol(x.symbol,result);
  3636. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3637. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3638. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3639. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3640. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3641. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3642. END;
  3643. END;
  3644. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3645. END VisitSymbolDesignator;
  3646. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3647. BEGIN
  3648. IF isUnchecked THEN RETURN END;
  3649. IF tagsAvailable THEN
  3650. TrapC(BrltL,index,length,IndexCheckTrap);
  3651. END;
  3652. END BoundCheck;
  3653. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3654. VAR d: IntermediateCode.Operand;
  3655. BEGIN
  3656. IF isUnchecked THEN RETURN END;
  3657. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3658. TrapC(op,dim,d,ArraySizeTrap);
  3659. ReleaseIntermediateOperand(d);
  3660. END DimensionCheck;
  3661. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3662. VAR
  3663. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3664. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3665. expression: SyntaxTree.Expression;
  3666. resultingType, leftType, baseType: SyntaxTree.Type;
  3667. skipLabel1: Label;
  3668. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3669. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3670. variableOp: Operand;
  3671. variable: SyntaxTree.Variable;
  3672. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3673. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3674. VAR e: SyntaxTree.Expression; i: LONGINT;
  3675. BEGIN
  3676. tensorFound := FALSE;
  3677. FOR i := 0 TO parameters.Length()-1 DO
  3678. e := parameters.GetExpression(i);
  3679. IF e IS SyntaxTree.TensorRangeExpression THEN
  3680. ASSERT(~tensorFound);
  3681. tensorFound := TRUE;
  3682. ELSIF e IS SyntaxTree.RangeExpression THEN
  3683. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3684. ELSE
  3685. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3686. END;
  3687. END;
  3688. END CountIndices;
  3689. BEGIN
  3690. ASSERT(tagsAvailable);
  3691. resultingType := x.type.resolved; (* resulting type *)
  3692. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3693. InitOperand(localResult, ModeReference);
  3694. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3695. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3696. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3697. (* a globally defined array destination tag is available -> use and invalidate it*)
  3698. localResult.tag := arrayDestinationTag;
  3699. IntermediateCode.InitOperand(arrayDestinationTag)
  3700. ELSE
  3701. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3702. (* the result is of array range type and thus does not provide any collectable pointers *)
  3703. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3704. Symbol(variable, variableOp);
  3705. ReuseCopy(localResult.tag, variableOp.op);
  3706. ReleaseOperand(variableOp);
  3707. END
  3708. END;
  3709. indexListSize := x.parameters.Length();
  3710. CountIndices(x.parameters);
  3711. (*ASSERT(tensorRangeCount <= 1);*)
  3712. (* designate the array to be indexed over, perform tensor range check if known *)
  3713. Designate(x.left, array);
  3714. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3715. Dereference(array, leftType,FALSE);
  3716. IF ~tensorFound THEN
  3717. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3718. END
  3719. END;
  3720. (* default base offset *)
  3721. srcDimOffset := 0;
  3722. destDimOffset := 0;
  3723. indexDim := 0;
  3724. (* use address of source array as basis *)
  3725. localResult.op := array.op;
  3726. UseIntermediateOperand(localResult.op);
  3727. (* go through the index list *)
  3728. FOR i := 0 TO indexListSize - 1 DO
  3729. expression := x.parameters.GetExpression(i);
  3730. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3731. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3732. srcDimOffset := -indexListSize;
  3733. destDimOffset := -suffixRanges;
  3734. ELSE
  3735. (* determine which dimension of source array is currently looked at *)
  3736. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3737. (* get the memory operand pointing to array descriptor dimension *)
  3738. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3739. (* make a reusable register from it *)
  3740. ReuseCopy(srcDim, tmp);
  3741. ReleaseIntermediateOperand(tmp);
  3742. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3743. ELSE
  3744. srcDim := IntermediateCode.Immediate(sizeType, i);
  3745. END;
  3746. (* get length and increment of source array for current dimension *)
  3747. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3748. Convert(sourceLength.op, sizeType);
  3749. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3750. Convert(sourceIncrement.op, sizeType);
  3751. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3752. ReleaseIntermediateOperand(srcDim);
  3753. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3754. (* SINGLE INDEX *)
  3755. Evaluate(expression, index);
  3756. ReleaseIntermediateOperand(index.tag);
  3757. index.tag := emptyOperand;
  3758. Convert(index.op, sizeType);
  3759. (* lower bound check *)
  3760. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3761. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3762. ELSIF isUnchecked THEN (* do nothing *)
  3763. ELSE
  3764. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3765. END;
  3766. (* upper bound check *)
  3767. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3768. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3769. ELSIF isUnchecked THEN (* do nothing *)
  3770. ELSE
  3771. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3772. END;
  3773. ReleaseOperand(sourceLength);
  3774. Convert(index.op, addressType);
  3775. summand := index.op;
  3776. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3777. (* RANGE OF INDICES *)
  3778. Evaluate(expression, range);
  3779. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3780. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3781. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3782. ReleaseOperand(range);
  3783. Convert(firstIndex, sizeType);
  3784. Convert(lastIndex, sizeType);
  3785. Convert(stepSize, sizeType);
  3786. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3787. if it is 'MAX(LONGINT)' *)
  3788. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3789. TransferToRegister(lastIndex, lastIndex);
  3790. skipLabel1 := NewLabel();
  3791. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3792. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3793. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3794. SetLabel(skipLabel1)
  3795. END;
  3796. (* check if step size is valid *)
  3797. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3798. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3799. ELSIF isUnchecked THEN (* do nothing *)
  3800. ELSE
  3801. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3802. END;
  3803. (* check lower bound check *)
  3804. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3805. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3806. ELSIF isUnchecked THEN (* do nothing *)
  3807. ELSE
  3808. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3809. END;
  3810. (* check upper bound check *)
  3811. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3812. (* statically open range: nothing to do *)
  3813. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3814. ASSERT(staticLastIndex < staticSourceLength)
  3815. ELSIF isUnchecked THEN (* do nothing *)
  3816. ELSE
  3817. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3818. END;
  3819. (* determine length of target array for current dimension *)
  3820. (* 1. incorporate last index: *)
  3821. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3822. (* last index is static *)
  3823. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3824. targetLength := sourceLength.op
  3825. ELSE
  3826. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3827. END;
  3828. UseIntermediateOperand(targetLength);
  3829. ELSE
  3830. (* targetLength := lastIndex + 1
  3831. Reuse1(targetLength, lastIndex);
  3832. *)
  3833. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3834. END;
  3835. ReleaseOperand(sourceLength);
  3836. ReleaseIntermediateOperand(lastIndex);
  3837. (* 2. incorporate first index: *)
  3838. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3839. (* first index and current target length are static *)
  3840. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3841. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3842. (* first index = 0: nothing to do *)
  3843. ELSE
  3844. (* targetLength := targetLength - firstIndex *)
  3845. TransferToRegister(targetLength, targetLength);
  3846. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3847. END;
  3848. (* clip negative lengths to 0 *)
  3849. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3850. IF staticTargetLength < 0 THEN
  3851. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3852. END
  3853. ELSE
  3854. skipLabel1 := NewLabel();
  3855. TransferToRegister(targetLength, targetLength);
  3856. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3857. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3858. SetLabel(skipLabel1)
  3859. END;
  3860. (* 3. incorporate index step size: *)
  3861. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3862. (*step size and current target length are static *)
  3863. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3864. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3865. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3866. (* step size = 1: nothing to do *)
  3867. ELSE
  3868. (* emit code for this:
  3869. targetLength := (targetLength-1) DIV stepSize +1;
  3870. *)
  3871. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3872. DivInt(targetLength, targetLength, stepSize);
  3873. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3874. END;
  3875. (* determine increment of target array for current dimension *)
  3876. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3877. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3878. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3879. (* step size = 1 *)
  3880. targetIncrement := sourceIncrement.op;
  3881. UseIntermediateOperand(targetIncrement)
  3882. ELSE
  3883. (* targetIncrement := sourceIncrement * stepSize *)
  3884. Reuse1(targetIncrement, stepSize);
  3885. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3886. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3887. END;
  3888. ReleaseIntermediateOperand(stepSize);
  3889. (* write length and increment of target array to descriptor *)
  3890. IF destDimOffset < 0 THEN
  3891. (* determine which dimension of target array is currently looked at *)
  3892. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3893. TransferToRegister(destDim, tmp);
  3894. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3895. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3896. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3897. ReleaseIntermediateOperand(destDim);
  3898. INC(destDimOffset);
  3899. ELSE
  3900. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3901. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3902. END;
  3903. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3904. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3905. INC(indexDim);
  3906. Convert(firstIndex, addressType);
  3907. TransferToRegister(summand, firstIndex);
  3908. ELSE HALT(100);
  3909. END;
  3910. (*
  3911. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3912. *)
  3913. Convert(sourceIncrement.op, addressType);
  3914. Convert(summand, addressType);
  3915. MulInt(summand, summand, sourceIncrement.op);
  3916. ReleaseIntermediateOperand(sourceIncrement.op);
  3917. AddInt(localResult.op, localResult.op, summand);
  3918. ReleaseIntermediateOperand(summand);
  3919. END
  3920. END;
  3921. result := localResult;
  3922. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3923. ReleaseIntermediateOperand(result.tag);
  3924. result.tag := TypeDescriptorAdr(resultingType);
  3925. ELSIF IsDelegate(resultingType) THEN
  3926. ReleaseIntermediateOperand(result.tag);
  3927. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3928. UseIntermediateOperand(result.tag);
  3929. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3930. ReleaseIntermediateOperand(result.tag);
  3931. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3932. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3933. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3934. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3935. (* finalize target array descriptor *)
  3936. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3937. (* write lengths and increments of target array for remaining dimensions *)
  3938. i := indexListSize;
  3939. WHILE indexDim < targetArrayDimensionality DO
  3940. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3941. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3942. ReleaseOperand(sourceLength);
  3943. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3944. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3945. ReleaseOperand(sourceIncrement);
  3946. INC(i); INC(indexDim);
  3947. END;
  3948. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3949. tmp := nil;
  3950. ELSE
  3951. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3952. END;
  3953. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3954. ReleaseIntermediateOperand(tmp);
  3955. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3956. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3957. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3958. ELSE
  3959. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3960. END;
  3961. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3962. ReleaseIntermediateOperand(tmp);
  3963. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3964. (* write dimensionality *)
  3965. IF targetArrayDimensionality # 0 THEN
  3966. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3967. END;
  3968. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3969. END;
  3970. ReleaseOperand(array);
  3971. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3972. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3973. END;
  3974. END MathIndexDesignator;
  3975. (* get the length of an array , trying to make use of static information *)
  3976. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3977. VAR res: IntermediateCode.Operand; size: LONGINT;
  3978. BEGIN
  3979. type := type.resolved;
  3980. IF type IS SyntaxTree.ArrayType THEN
  3981. WITH type: SyntaxTree.ArrayType DO
  3982. IF type.form = SyntaxTree.Static THEN
  3983. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3984. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3985. Evaluate(type.length, op);
  3986. ReleaseIntermediateOperand(op.tag);
  3987. RETURN op.op;*)
  3988. ELSE
  3989. res := tag;
  3990. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3991. IntermediateCode.MakeMemory(res,addressType);
  3992. UseIntermediateOperand(res);
  3993. RETURN res
  3994. END
  3995. END;
  3996. ELSE
  3997. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3998. RETURN IntermediateCode.Immediate(addressType,size);
  3999. END;
  4000. END ArrayLength;
  4001. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4002. BEGIN
  4003. IF IsImmediate(x) THEN
  4004. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4005. ELSE
  4006. IF ~ReusableRegister(res) THEN
  4007. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4008. ELSE
  4009. UseIntermediateOperand(res);
  4010. END;
  4011. Emit(Mov(position,res,x))
  4012. END;
  4013. END CopyInt;
  4014. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4015. BEGIN
  4016. ReleaseIntermediateOperand(res);
  4017. IF IsImmediate(x) & IsImmediate(y) THEN
  4018. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4019. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4020. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4021. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4022. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4023. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4024. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4025. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4026. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4027. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4028. UseIntermediateOperand(res);
  4029. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4030. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4031. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4032. UseIntermediateOperand(res);
  4033. ELSE
  4034. IF ~ReusableRegister(res) THEN
  4035. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4036. ELSE
  4037. UseIntermediateOperand(res);
  4038. END;
  4039. IF IsImmediate(x) & (x.intValue = 0) THEN
  4040. Emit(Mov(position,res,y))
  4041. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4042. Emit(Mov(position,res,x))
  4043. ELSE
  4044. Emit(Add(position,res, x, y));
  4045. END;
  4046. END;
  4047. END AddInt;
  4048. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4049. BEGIN
  4050. ReleaseIntermediateOperand(res);
  4051. IF IsImmediate(x) & IsImmediate(y) THEN
  4052. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4053. ELSE
  4054. IF ~ReusableRegister(res) THEN
  4055. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4056. ELSE UseIntermediateOperand(res);
  4057. END;
  4058. IF IsImmediate(x) & (x.intValue = 1) THEN
  4059. Emit(Mov(position,res,y))
  4060. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4061. Emit(Mov(position,res,x))
  4062. ELSE
  4063. Emit(Mul(position,res, x, y));
  4064. END;
  4065. END;
  4066. END MulInt;
  4067. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4068. BEGIN
  4069. ReleaseIntermediateOperand(res);
  4070. IF IsImmediate(x) & IsImmediate(y) THEN
  4071. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4072. ELSE
  4073. IF ~ReusableRegister(res) THEN
  4074. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4075. ELSE UseIntermediateOperand(res);
  4076. END;
  4077. IF IsImmediate(x) & (x.intValue = 1) THEN
  4078. Emit(Mov(position,res,y))
  4079. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4080. Emit(Mov(position,res,x))
  4081. ELSE
  4082. Emit(Div(position,res, x, y));
  4083. END;
  4084. END;
  4085. END DivInt;
  4086. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4087. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4088. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4089. BEGIN
  4090. type := x.left.type.resolved;
  4091. IF type IS SyntaxTree.StringType THEN
  4092. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4093. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4094. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4095. type := atype;
  4096. x.left.SetType(type);
  4097. END;
  4098. IntermediateCode.InitImmediate(res,addressType,0);
  4099. maxDim := x.parameters.Length()-1;
  4100. (*
  4101. computation rule:
  4102. a: ARRAY X,Y,Z OF Element with size S
  4103. a[i,j,k] -->
  4104. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4105. *)
  4106. FOR i := 0 TO maxDim DO
  4107. e := x.parameters.GetExpression(i);
  4108. Evaluate(e,index);
  4109. Convert(index.op,addressType);
  4110. AddInt(res, res, index.op);
  4111. IF i = 0 THEN
  4112. (*
  4113. ReuseCopy(res, index.op);
  4114. *)
  4115. Designate(x.left,array);
  4116. type := x.left.type.resolved;
  4117. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4118. Dereference(array, type, FALSE);
  4119. END;
  4120. (*
  4121. ELSE AddInt(res, res, index.op);
  4122. *)
  4123. END;
  4124. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4125. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4126. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4127. BoundCheck(index.op, length);
  4128. END;
  4129. ReleaseIntermediateOperand(length);
  4130. END;
  4131. ReleaseOperand(index);
  4132. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4133. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4134. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4135. MulInt(res,res,length);
  4136. END;
  4137. ReleaseIntermediateOperand(length);
  4138. END;
  4139. (* remaining open dimensions -- compute address *)
  4140. i := maxDim+1;
  4141. IF type IS SyntaxTree.ArrayType THEN
  4142. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4143. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4144. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4145. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4146. MulInt(res,res,length);
  4147. END;
  4148. ReleaseIntermediateOperand(length);
  4149. INC(i);
  4150. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4151. END;
  4152. END;
  4153. IF (type IS SyntaxTree.ArrayType) THEN
  4154. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4155. size := StaticSize(system, type);
  4156. IF size # 1 THEN
  4157. length := IntermediateCode.Immediate(addressType,size);
  4158. MulInt(res,res,length);
  4159. END;
  4160. ELSE
  4161. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4162. IF size # 1 THEN
  4163. length := IntermediateCode.Immediate(addressType,size);
  4164. MulInt(res,res,length);
  4165. END;
  4166. END;
  4167. END;
  4168. AddInt(res,res,array.op);
  4169. InitOperand(result,ModeReference);
  4170. result.op := res;
  4171. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4172. ReleaseIntermediateOperand(result.tag);
  4173. result.tag := TypeDescriptorAdr(type);
  4174. ELSIF IsDelegate(type) THEN
  4175. ReleaseIntermediateOperand(result.tag);
  4176. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4177. UseIntermediateOperand(result.tag);
  4178. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4179. ReleaseIntermediateOperand(result.tag);
  4180. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4181. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4182. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4183. END;
  4184. ReleaseOperand(array);
  4185. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4186. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4187. END;
  4188. END IndexDesignator;
  4189. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4190. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4191. BEGIN
  4192. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4193. dest := destination; destination := emptyOperand;
  4194. type := x.left.type.resolved;
  4195. IF type IS SyntaxTree.MathArrayType THEN
  4196. MathIndexDesignator(x);
  4197. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4198. IndexDesignator(x);
  4199. END;
  4200. destination := dest;
  4201. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4202. END VisitIndexDesignator;
  4203. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4204. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4205. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4206. procedure: SyntaxTree.Procedure;
  4207. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4208. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4209. BEGIN
  4210. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4211. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4212. parameters := expression.parameters;
  4213. moduleName := "FoxArrayBase";
  4214. procedureName := "CopyDescriptor";
  4215. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4216. SaveRegisters();ReleaseUsedRegisters(saved);
  4217. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4218. IF procedure = NIL THEN
  4219. s := "procedure ";
  4220. Strings.Append(s,moduleName);
  4221. Strings.Append(s,".");
  4222. Strings.Append(s,procedureName);
  4223. Strings.Append(s," not present");
  4224. Error(position,s);
  4225. ELSE
  4226. (* push address of temporary variable *)
  4227. Symbol(variable,destOperand);
  4228. Emit(Push(position,destOperand.op));
  4229. ReleaseOperand(destOperand);
  4230. (* push src *)
  4231. Evaluate(expression.left,srcOperand);
  4232. (*
  4233. Dereference(srcOperand,expression.type.resolved);
  4234. Emit(Push(position,srcOperand.tag));
  4235. *)
  4236. Emit(Push(position,srcOperand.op));
  4237. ReleaseOperand(srcOperand);
  4238. tensorFound := FALSE;
  4239. FOR i := 0 TO parameters.Length()-1 DO
  4240. e := parameters.GetExpression(i);
  4241. IF e IS SyntaxTree.TensorRangeExpression THEN
  4242. tensorFound := TRUE;
  4243. ELSIF e IS SyntaxTree.RangeExpression THEN
  4244. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4245. ELSE
  4246. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4247. END;
  4248. END;
  4249. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4250. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4251. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4252. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4253. StaticCallOperand(procOp,procedure);
  4254. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4255. ReleaseOperand(procOp);
  4256. END;
  4257. RestoreRegisters(saved);
  4258. END;
  4259. RETURN variable
  4260. END PrepareTensorDescriptor;
  4261. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4262. VAR
  4263. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4264. operand, tmpOperand, variableOp, variable2Op: Operand;
  4265. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4266. variable, variable2: SyntaxTree.Variable;
  4267. dim, i, size: LONGINT;
  4268. (* TODO: needed? *)
  4269. oldArrayDestinationTag: IntermediateCode.Operand;
  4270. oldArrayDestinationDimension: LONGINT;
  4271. position: Position;
  4272. saved: RegisterEntry;
  4273. arrayFlags: SET;
  4274. m, n: LONGINT;
  4275. PROCEDURE Pass(op: IntermediateCode.Operand);
  4276. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4277. BEGIN
  4278. IF numberRegister >= 0 THEN
  4279. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4280. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4281. Emit(Mov(position,parameterRegister, op));
  4282. ELSE
  4283. Emit(Push(position,op))
  4284. END
  4285. END Pass;
  4286. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4287. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4288. BEGIN
  4289. formalType := formalType.resolved; actualType := actualType.resolved;
  4290. IF IsOpenArray(formalType)THEN
  4291. IF actualType IS SyntaxTree.StringType THEN
  4292. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4293. RETURN;
  4294. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4295. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4296. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4297. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4298. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4299. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4300. ELSE
  4301. tmp := baseReg;
  4302. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4303. IntermediateCode.MakeMemory(tmp,addressType);
  4304. Pass((tmp));
  4305. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4306. END;
  4307. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4308. END;
  4309. END PushArrayLens;
  4310. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4311. BEGIN
  4312. CASE size OF
  4313. |2: INCL(flags,Size2Flag);
  4314. |3: INCL(flags,Size3Flag);
  4315. |4: INCL(flags,Size4Flag);
  4316. |5: INCL(flags,Size5Flag);
  4317. |6: INCL(flags,Size6Flag);
  4318. |7: INCL(flags,Size7Flag);
  4319. |8: INCL(flags,Size8Flag);
  4320. END;
  4321. END SetSmallArraySizeFlag;
  4322. BEGIN
  4323. IF Trace THEN TraceEnter("PushParameter") END;
  4324. position := expression.position;
  4325. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4326. type := expression.type.resolved;
  4327. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4328. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4329. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4330. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4331. );
  4332. (* TODO: needed? *)
  4333. oldArrayDestinationTag := arrayDestinationTag;
  4334. oldArrayDestinationDimension := arrayDestinationDimension;
  4335. IF IsArrayOfSystemByte(parameter.type) THEN
  4336. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4337. Designate(expression,operand);
  4338. ELSE
  4339. Evaluate(expression, tmpOperand);
  4340. (* array of system byte does not provide any pointers *)
  4341. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4342. Symbol(variable, operand);
  4343. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4344. Emit(Mov(position,tmp, tmpOperand.op));
  4345. ReleaseOperand(tmpOperand);
  4346. END;
  4347. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4348. ReleaseIntermediateOperand(operand.tag);
  4349. operand.tag := tmp;
  4350. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4351. Pass((operand.tag));
  4352. END;
  4353. Pass((operand.op));
  4354. ELSIF IsOpenArray(parameter.type) THEN
  4355. Designate(expression,operand);
  4356. baseReg := operand.tag;
  4357. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4358. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4359. END;
  4360. Pass((operand.op)); (* address of the array *)
  4361. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4362. (* case 1
  4363. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4364. *)
  4365. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4366. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4367. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4368. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4369. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4370. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4371. arrayDestinationTag := sp;
  4372. (* case 1b
  4373. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4374. *)
  4375. IF expression IS SyntaxTree.IndexDesignator THEN
  4376. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4377. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4378. arrayDestinationDimension := dim;
  4379. Designate(expression,operand);
  4380. (* case 1a
  4381. P(...,A,...) push: push array descriptor to stack
  4382. *)
  4383. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4384. Designate(expression,operand);
  4385. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4386. i := 0;
  4387. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4388. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4389. INC(i);
  4390. END;
  4391. type := expression.type.resolved;
  4392. WHILE (i<dim) DO (* remaining static dimensions *)
  4393. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4394. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4395. ReleaseOperand(tmpOperand);
  4396. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4397. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4398. ReleaseOperand(tmpOperand);
  4399. INC(i);
  4400. END;
  4401. dimOp := IntermediateCode.Immediate(addressType,dim);
  4402. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4403. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4404. (* case 1d
  4405. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4406. + case 1e
  4407. P(.. PT() ... );
  4408. *)
  4409. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4410. Designate(expression,operand);
  4411. Dereference(operand,type.resolved,FALSE);
  4412. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4413. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4414. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4415. (* case 1f
  4416. P(...,S,...) push: create array descriptor to S on stack
  4417. case 1g
  4418. P(... PS()...)
  4419. *)
  4420. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4421. Designate(expression,operand);
  4422. FOR i := 0 TO dim-1 DO
  4423. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4424. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4425. ReleaseOperand(tmpOperand);
  4426. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4427. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4428. ReleaseOperand(tmpOperand);
  4429. END;
  4430. (*******
  4431. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4432. *)
  4433. arrayFlags := {StaticFlag};
  4434. IF dim = 1 THEN
  4435. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4436. ReleaseOperand(tmpOperand);
  4437. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4438. m := LONGINT(tmpOperand.op.intValue);
  4439. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4440. ELSIF dim = 2 THEN
  4441. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4442. ReleaseOperand(tmpOperand);
  4443. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4444. m := LONGINT(tmpOperand.op.intValue);
  4445. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4446. ReleaseOperand(tmpOperand);
  4447. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4448. n := LONGINT(tmpOperand.op.intValue);
  4449. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4450. INCL(arrayFlags,SmallMatrixFlag);
  4451. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4452. END;
  4453. END;
  4454. (*******)
  4455. dimOp := IntermediateCode.Immediate(addressType,dim);
  4456. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4457. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4458. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4459. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4460. baseType := SemanticChecker.ArrayBase(type,dim);
  4461. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4462. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4463. ELSE HALT(100);
  4464. END;
  4465. (* case 2
  4466. procedure P([left args], var A: array [*,*] of Type, [right args])
  4467. *)
  4468. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4469. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4470. (* case 2b
  4471. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4472. push: push reference to pushed array descriptor
  4473. post: remove array descriptor.
  4474. *)
  4475. IF expression IS SyntaxTree.IndexDesignator THEN
  4476. descriptorType := GetMathArrayDescriptorType(dim);
  4477. (* range type : no allocation possible, should be untraced *)
  4478. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4479. Symbol(variable,variableOp);
  4480. arrayDestinationTag := variableOp.op;
  4481. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4482. arrayDestinationDimension := dim;
  4483. NeedDescriptor := TRUE;
  4484. Designate(expression,operand);
  4485. Pass((operand.tag));
  4486. NeedDescriptor := FALSE;
  4487. (* case 2a
  4488. P(...,A,...)
  4489. push: push reference to array descriptor on stack
  4490. *)
  4491. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4492. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4493. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4494. INC(i);
  4495. END;
  4496. IF i = dim THEN
  4497. Designate(expression,operand);
  4498. Pass((operand.tag));
  4499. ELSE (* open-static *)
  4500. type := expression.type.resolved;
  4501. descriptorType := GetMathArrayDescriptorType(dim);
  4502. (* static array , cannot be reallocated, untraced !*)
  4503. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4504. Symbol(variable,variableOp);
  4505. arrayDestinationTag := variableOp.op;
  4506. Designate(expression,operand);
  4507. FOR i := 0 TO dim-1 DO
  4508. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4509. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4510. ReleaseOperand(tmpOperand);
  4511. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4512. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4513. ReleaseOperand(tmpOperand);
  4514. END;
  4515. dimOp := IntermediateCode.Immediate(addressType,dim);
  4516. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4517. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4518. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4519. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4520. baseType := SemanticChecker.ArrayBase(type,dim);
  4521. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4522. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4523. Pass((arrayDestinationTag));
  4524. END;
  4525. (* case 2d
  4526. P(...,T,...) push: emit dimension check, push T
  4527. *)
  4528. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4529. Designate(expression,operand);
  4530. Dereference(operand,type.resolved,FALSE);
  4531. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4532. Pass((operand.tag));
  4533. (* case 2f
  4534. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4535. push: push reference to pushed array descriptor
  4536. post: remove array descriptor
  4537. *)
  4538. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4539. descriptorType := GetMathArrayDescriptorType(dim);
  4540. (* static array -- cannot be reallocatated, untraced *)
  4541. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4542. Symbol(variable,variableOp);
  4543. arrayDestinationTag := variableOp.op;
  4544. Designate(expression,operand);
  4545. FOR i := 0 TO dim-1 DO
  4546. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4547. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4548. ReleaseOperand(tmpOperand);
  4549. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4550. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4551. ReleaseOperand(tmpOperand);
  4552. END;
  4553. (*
  4554. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4555. *)
  4556. arrayFlags := {StaticFlag};
  4557. IF dim = 1 THEN
  4558. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4559. ReleaseOperand(tmpOperand);
  4560. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4561. m := LONGINT(tmpOperand.op.intValue);
  4562. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4563. ELSIF dim = 2 THEN
  4564. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4565. ReleaseOperand(tmpOperand);
  4566. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4567. m := LONGINT(tmpOperand.op.intValue);
  4568. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4569. ReleaseOperand(tmpOperand);
  4570. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4571. n := LONGINT(tmpOperand.op.intValue);
  4572. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4573. INCL(arrayFlags,SmallMatrixFlag);
  4574. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4575. END;
  4576. END;
  4577. (*******)
  4578. dimOp := IntermediateCode.Immediate(addressType,dim);
  4579. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4580. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4581. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4582. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4583. baseType := SemanticChecker.ArrayBase(type,dim);
  4584. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4585. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4586. Pass((arrayDestinationTag));
  4587. ELSE HALT(100);
  4588. END;
  4589. (* case 3
  4590. procedure P([left args], [const] A: array [?] of Type, [right args])
  4591. *)
  4592. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4593. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4594. (* case 3b
  4595. P(...,A[a..b,c..d],...)
  4596. *)
  4597. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4598. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4599. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4600. Symbol(variable,variableOp);
  4601. LoadValue(variableOp,system.addressType);
  4602. ELSE
  4603. descriptorType := GetMathArrayDescriptorType(dim);
  4604. (* range -- cannot be reallocated *)
  4605. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4606. Symbol(variable,variableOp);
  4607. END;
  4608. arrayDestinationTag := variableOp.op;
  4609. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4610. arrayDestinationDimension := 0;
  4611. Designate(expression,operand);
  4612. Pass((operand.tag));
  4613. (* case 3a
  4614. P(...,A,...)
  4615. *)
  4616. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4617. i := 0;
  4618. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4619. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4620. INC(i);
  4621. END;
  4622. IF i = dim THEN
  4623. Designate(expression,operand);
  4624. Pass((operand.tag));
  4625. ELSE (* open-static *)
  4626. type := expression.type.resolved;
  4627. descriptorType := GetMathArrayDescriptorType(dim);
  4628. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4629. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4630. Symbol(variable,variableOp);
  4631. arrayDestinationTag := variableOp.op;
  4632. Designate(expression,operand);
  4633. FOR i := 0 TO dim-1 DO
  4634. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4635. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4636. ReleaseOperand(tmpOperand);
  4637. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4638. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4639. ReleaseOperand(tmpOperand);
  4640. END;
  4641. dimOp := IntermediateCode.Immediate(addressType,dim);
  4642. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4643. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4644. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4645. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4646. baseType := SemanticChecker.ArrayBase(type,dim);
  4647. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4648. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4649. Pass((arrayDestinationTag));
  4650. END;
  4651. (* case 3d
  4652. P(...,T,...)
  4653. case 3e
  4654. P(...,PT(...),...)
  4655. *)
  4656. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4657. Designate(expression,operand);
  4658. Dereference(operand,type.resolved,FALSE);
  4659. Pass((operand.tag));
  4660. (* case 3f
  4661. P(...,S,...)
  4662. case 3g
  4663. P(...,PS(...),...)
  4664. *)
  4665. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4666. descriptorType := GetMathArrayDescriptorType(dim);
  4667. (* static array does not need to be traced *)
  4668. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4669. Symbol(variable,variableOp);
  4670. arrayDestinationTag := variableOp.op;
  4671. Designate(expression,operand);
  4672. IF operand.op.type.length >1 THEN (* vector register *)
  4673. (* static array does not need to be traced *)
  4674. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4675. Symbol(variable2, variable2Op);
  4676. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4677. Emit(Mov(position,tmp, operand.op));
  4678. ReleaseOperand(operand);
  4679. Symbol(variable2, operand);
  4680. END;
  4681. FOR i := 0 TO dim-1 DO
  4682. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4683. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4684. ReleaseOperand(tmpOperand);
  4685. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4686. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4687. ReleaseOperand(tmpOperand);
  4688. END;
  4689. dimOp := IntermediateCode.Immediate(addressType,dim);
  4690. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4691. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4692. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4693. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4694. baseType := SemanticChecker.ArrayBase(type,dim);
  4695. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4696. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4697. Pass((arrayDestinationTag));
  4698. ELSE HALT(100);
  4699. END;
  4700. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4701. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4702. (* case 4b
  4703. P(...,A[a..b,c..d],...)
  4704. *)
  4705. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4706. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4707. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4708. Symbol(variable,variableOp);
  4709. LoadValue(variableOp,system.addressType);
  4710. ELSE
  4711. descriptorType := GetMathArrayDescriptorType(dim);
  4712. (* range array -- cannot be allocated *)
  4713. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4714. Symbol(variable,variableOp);
  4715. END;
  4716. arrayDestinationTag := variableOp.op;
  4717. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4718. arrayDestinationDimension := 0;
  4719. Designate(expression,operand);
  4720. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4721. Symbol(variable,variableOp);
  4722. ELSE
  4723. (* alias to range -- untraced *)
  4724. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4725. Symbol(variable,variableOp);
  4726. MakeMemory(tmp,variableOp.op,addressType,0);
  4727. Emit(Mov(position,tmp,operand.tag));
  4728. ReleaseIntermediateOperand(tmp);
  4729. END;
  4730. Pass((variableOp.op));
  4731. ReleaseOperand(variableOp);
  4732. (* case 4a
  4733. P(...,A,...)
  4734. *)
  4735. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4736. i := 0;
  4737. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4738. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4739. INC(i);
  4740. END;
  4741. IF i = dim THEN
  4742. Designate(expression,operand);
  4743. arrayDestinationTag := operand.tag;
  4744. ELSE (* open-static *)
  4745. type := expression.type.resolved;
  4746. descriptorType := GetMathArrayDescriptorType(dim);
  4747. (* static array -- untraced *)
  4748. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4749. Symbol(variable,variableOp);
  4750. arrayDestinationTag := variableOp.op;
  4751. Designate(expression,operand);
  4752. FOR i := 0 TO dim-1 DO
  4753. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4754. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4755. ReleaseOperand(tmpOperand);
  4756. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4757. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4758. ReleaseOperand(tmpOperand);
  4759. END;
  4760. dimOp := IntermediateCode.Immediate(addressType,dim);
  4761. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4762. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4763. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4764. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4765. baseType := SemanticChecker.ArrayBase(type,dim);
  4766. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4767. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4768. END;
  4769. (* tensor alias to open array -- untraced *)
  4770. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4771. Symbol(variable,variableOp);
  4772. MakeMemory(tmp,variableOp.op,addressType,0);
  4773. Emit(Mov(position,tmp,arrayDestinationTag));
  4774. ReleaseIntermediateOperand(tmp);
  4775. Pass((variableOp.op));
  4776. ReleaseOperand(variableOp);
  4777. (* case 4d
  4778. P(...,T,...)
  4779. *)
  4780. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4781. Designate(expression,operand);
  4782. Pass((operand.op));
  4783. (* case 4f
  4784. P(...,S,...)
  4785. *)
  4786. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4787. descriptorType := GetMathArrayDescriptorType(dim);
  4788. (* static array -- cannot be reallocated, untraced *)
  4789. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4790. Symbol(variable,variableOp);
  4791. arrayDestinationTag := variableOp.op;
  4792. Designate(expression,operand);
  4793. FOR i := 0 TO dim-1 DO
  4794. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4795. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4796. ReleaseOperand(tmpOperand);
  4797. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4798. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4799. ReleaseOperand(tmpOperand);
  4800. END;
  4801. dimOp := IntermediateCode.Immediate(addressType,dim);
  4802. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4803. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4804. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4805. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4806. baseType := SemanticChecker.ArrayBase(type,dim);
  4807. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4808. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4809. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4810. Symbol(variable,variableOp);
  4811. MakeMemory(tmp,variableOp.op,addressType,0);
  4812. Emit(Mov(position,tmp,arrayDestinationTag));
  4813. ReleaseIntermediateOperand(tmp);
  4814. Pass((variableOp.op));
  4815. ReleaseOperand(variableOp);
  4816. ELSE HALT(100);
  4817. END;
  4818. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4819. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4820. Designate(expression,operand);
  4821. IF operand.op.type.length > 1 THEN
  4822. Emit(Push(position, operand.op));
  4823. ELSE
  4824. size := system.SizeOf(type);
  4825. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4826. size := ToMemoryUnits(system,size);
  4827. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4828. arrayDestinationTag := sp;
  4829. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4830. END;
  4831. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4832. Designate(expression,operand);
  4833. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4834. (* static array no pointer *)
  4835. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4836. Symbol(variable,variableOp);
  4837. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4838. Emit(Mov(position,tmp,operand.op));
  4839. Emit(Push(position,variableOp.op));
  4840. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4841. Pass((operand.op));
  4842. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4843. END;
  4844. ELSE HALT(200)
  4845. END;
  4846. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4847. IF parameter.kind = SyntaxTree.VarParameter THEN
  4848. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4849. Designate(expression, operand);
  4850. Pass((operand.op));
  4851. ELSE
  4852. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4853. Evaluate(expression, operand);
  4854. Pass((operand.extra)); (* step *)
  4855. Pass((operand.tag)); (* last *)
  4856. Pass((operand.op)) (* first *)
  4857. END
  4858. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4859. IF parameter.kind = SyntaxTree.VarParameter THEN
  4860. Designate(expression, operand);
  4861. Pass((operand.op));
  4862. ELSE
  4863. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4864. Evaluate(expression, operand);
  4865. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4866. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4867. Pass((operand.tag)); (* imaginary part *)
  4868. Pass((operand.op)) (* real part *)
  4869. ELSE
  4870. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4871. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4872. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4873. tmp := sp;
  4874. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4875. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4876. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4877. IntermediateCode.AddOffset(tmp,size);
  4878. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4879. END
  4880. END
  4881. ELSE
  4882. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4883. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4884. Designate(expression,operand);
  4885. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4886. (* stack allocation *)
  4887. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4888. (*! parameter alignment to be discussed ... *)
  4889. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4890. size := type(SyntaxTree.StringType).length;
  4891. END;
  4892. IF backend.cooperative & parameter.NeedsTrace() THEN
  4893. dst := NewRegisterOperand (addressType);
  4894. Emit(Mov(position,dst, sp));
  4895. IntermediateCode.InitImmediate(null, byteType, 0);
  4896. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4897. ReleaseIntermediateOperand(dst);
  4898. SaveRegisters();ReleaseUsedRegisters(saved);
  4899. (* register dst has been freed before SaveRegisters already *)
  4900. CallAssignMethod(dst, operand.op, parameter.type);
  4901. RestoreRegisters(saved);
  4902. END;
  4903. IF operand.op.type.length > 1 THEN (* vector *)
  4904. MakeMemory(tmp,sp,operand.op.type,0);
  4905. Emit(Mov(position, tmp, operand.op));
  4906. ELSE
  4907. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4908. END;
  4909. ELSIF IsOpenArray(parameter.type) THEN
  4910. Designate(expression,operand);
  4911. baseReg := operand.tag;
  4912. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4913. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4914. END;
  4915. Pass((operand.op)); (* address of the array *)
  4916. ELSIF IsDelegate(parameter.type) THEN
  4917. Evaluate(expression,operand);
  4918. IF backend.cooperative & parameter.NeedsTrace() THEN
  4919. Emit(Push(position, nil));
  4920. dst := NewRegisterOperand (addressType);
  4921. Emit(Mov(position,dst, sp));
  4922. ReleaseIntermediateOperand(dst);
  4923. SaveRegisters();ReleaseUsedRegisters(saved);
  4924. Emit(Push(position, dst));
  4925. (* register dst has been freed before SaveRegisters already *)
  4926. Emit(Push(position, operand.tag));
  4927. CallThis(position,"GarbageCollector","Assign",2);
  4928. RestoreRegisters(saved);
  4929. ELSE
  4930. Pass((operand.tag));
  4931. END;
  4932. Pass((operand.op));
  4933. ELSE
  4934. Evaluate(expression,operand);
  4935. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4936. Emit(Push(position, nil));
  4937. dst := NewRegisterOperand (addressType);
  4938. Emit(Mov(position,dst, sp));
  4939. ReleaseIntermediateOperand(dst);
  4940. SaveRegisters();ReleaseUsedRegisters(saved);
  4941. Emit(Push(position, dst));
  4942. (* register dst has been freed before SaveRegisters already *)
  4943. Emit(Push(position, operand.op));
  4944. CallThis(position,"GarbageCollector","Assign",2);
  4945. RestoreRegisters(saved);
  4946. ELSE
  4947. Pass((operand.op));
  4948. END;
  4949. END;
  4950. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4951. Evaluate(expression,operand);
  4952. Pass((operand.op));
  4953. ELSE (* var parameter *)
  4954. Designate(expression,operand);
  4955. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4956. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4957. Pass((operand.tag));
  4958. END;
  4959. END;
  4960. Pass((operand.op));
  4961. END;
  4962. END;
  4963. (* TODO: needed? *)
  4964. arrayDestinationTag := oldArrayDestinationTag;
  4965. arrayDestinationDimension := oldArrayDestinationDimension;
  4966. IF needsParameterBackup THEN
  4967. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4968. ReuseCopy(parameterBackup, operand.op)
  4969. END;
  4970. ReleaseOperand(operand);
  4971. IF Trace THEN TraceExit("PushParameter") END;
  4972. END PushParameter;
  4973. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4974. VAR prevConditional: BOOLEAN;
  4975. BEGIN
  4976. prevConditional := conditional;
  4977. conditional := FALSE;
  4978. 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
  4979. Expression(x.result); (* use register *)
  4980. END;
  4981. Statement(x.statement);
  4982. conditional := prevConditional;
  4983. IF x.result # NIL THEN Expression(x.result) END;
  4984. 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
  4985. ReleaseIntermediateOperand(result.op);
  4986. END;
  4987. END VisitStatementDesignator;
  4988. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4989. VAR
  4990. procedure: SyntaxTree.Procedure;
  4991. procedureType: SyntaxTree.ProcedureType;
  4992. wasInline: BOOLEAN;
  4993. actualParameters: SyntaxTree.ExpressionList;
  4994. formalParameter: SyntaxTree.Parameter;
  4995. actualParameter: SyntaxTree.Expression;
  4996. i: LONGINT;
  4997. localVariable: SyntaxTree.Variable;
  4998. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4999. src, dest: Operand;
  5000. prevInlineExit : Label;
  5001. prevMapper: SymbolMapper;
  5002. tooComplex: BOOLEAN;
  5003. resultDesignator: SyntaxTree.Expression;
  5004. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5005. BEGIN
  5006. IF e = NIL THEN RETURN TRUE
  5007. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5008. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5009. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5010. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5011. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5012. ELSE RETURN FALSE
  5013. END;
  5014. END SimpleExpression;
  5015. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5016. BEGIN
  5017. RETURN checker.CanPassInRegister(type)
  5018. END FitsInRegister;
  5019. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5020. VAR
  5021. variable: SyntaxTree.Variable;
  5022. variableDesignator: SyntaxTree.Designator;
  5023. BEGIN
  5024. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5025. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5026. variableDesignator.SetType(type);
  5027. RETURN variableDesignator
  5028. END GetTemp;
  5029. BEGIN
  5030. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5031. wasInline := currentIsInline;
  5032. prevInlineExit := currentInlineExit;
  5033. prevMapper := currentMapper;
  5034. currentInlineExit := NewLabel();
  5035. tooComplex := FALSE;
  5036. NEW(currentMapper);
  5037. currentIsInline := TRUE;
  5038. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5039. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5040. formalParameter := procedureType.firstParameter;
  5041. actualParameters := x.parameters;
  5042. i := 0;
  5043. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5044. actualParameter := actualParameters.GetExpression(i);
  5045. IF actualParameter.resolved # NIL THEN
  5046. actualParameter := actualParameter.resolved
  5047. END;
  5048. (*
  5049. if expression is simple and can be passed immediately
  5050. or if type fits in register then we can proceed
  5051. otherwise we escape to ordinary procedure call.
  5052. *)
  5053. (* cases where the expression can be mapped identically *)
  5054. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5055. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5056. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5057. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5058. (*
  5059. Assign(variableDesignator, actualParameter);
  5060. *)
  5061. Evaluate(actualParameter, src);
  5062. Designate(variableDesignator, dest);
  5063. Emit(Mov(x.position, dest.op, src.op));
  5064. ReleaseOperand(dest);
  5065. ReleaseOperand(src);
  5066. (* the src operand should now have been completely released ! *)
  5067. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5068. ELSE tooComplex := TRUE
  5069. END;
  5070. (*
  5071. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5072. currentMapper.Add(formalParameter, actualParameter, NIL);
  5073. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5074. variableDesignator := GetTemp(system.addressType, FALSE);
  5075. Designate(actualParameter, src);
  5076. Designate(variableDesignator, dest);
  5077. IntermediateCode.MakeMemory(dest.op,addressType);
  5078. Emit(Mov(x.position, dest.op, src.op));
  5079. ReleaseOperand(dest);
  5080. IF src.tag.mode # IntermediateCode.Undefined THEN
  5081. tagDesignator := GetTemp(system.addressType, FALSE);
  5082. Designate(tagDesignator, dest);
  5083. IntermediateCode.MakeMemory(dest.op,addressType);
  5084. Emit(Mov(x.position, dest.op, src.op));
  5085. END;
  5086. ReleaseOperand(dest); ReleaseOperand(src);
  5087. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5088. END;
  5089. *)
  5090. formalParameter := formalParameter.nextParameter;
  5091. INC(i);
  5092. END;
  5093. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5094. IF resultDesignator # NIL THEN
  5095. returnDesignator := resultDesignator
  5096. ELSE
  5097. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5098. END;
  5099. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5100. END;
  5101. localVariable := procedure.procedureScope.firstVariable;
  5102. WHILE ~tooComplex & (localVariable # NIL) DO
  5103. variableDesignator := GetTemp(localVariable.type, FALSE);
  5104. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5105. localVariable := localVariable.nextVariable;
  5106. END;
  5107. IF ~tooComplex THEN
  5108. VisitStatementBlock(procedure.procedureScope.body);
  5109. SetLabel(currentInlineExit);
  5110. IF procedureType.returnType # NIL THEN
  5111. Designate(returnDesignator, result);
  5112. IF conditional THEN
  5113. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5114. ValueToCondition(result)
  5115. END;
  5116. END;
  5117. END;
  5118. currentMapper := prevMapper;
  5119. currentInlineExit := prevInlineExit;
  5120. currentIsInline := wasInline;
  5121. RETURN ~tooComplex
  5122. END InlineProcedureCall;
  5123. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5124. VAR
  5125. parameters: SyntaxTree.ExpressionList;
  5126. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5127. designator: SyntaxTree.Designator;
  5128. procedureType: SyntaxTree.ProcedureType;
  5129. formalParameter: SyntaxTree.Parameter;
  5130. operand, returnValue: Operand;
  5131. reg, size, mask, dest: IntermediateCode.Operand;
  5132. saved,saved2: RegisterEntry;
  5133. symbol: SyntaxTree.Symbol;
  5134. variable: SyntaxTree.Variable;
  5135. i, parametersSize, returnTypeSize : LONGINT;
  5136. structuredReturnType: BOOLEAN;
  5137. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5138. tempVariableDesignator: SyntaxTree.Designator;
  5139. gap, alignment: LONGINT; (*fld*)
  5140. (* TODO: remove unnecessary backup variables *)
  5141. oldResult: Operand;
  5142. oldCurrentScope: SyntaxTree.Scope;
  5143. oldArrayDestinationTag: IntermediateCode.Operand;
  5144. oldArrayDestinationDimension: LONGINT;
  5145. oldConstantDeclaration: SyntaxTree.Symbol;
  5146. oldDestination: IntermediateCode.Operand;
  5147. oldCurrentLoop: Label;
  5148. oldConditional: BOOLEAN;
  5149. oldTrueLabel, oldFalseLabel: Label;
  5150. oldLocked: BOOLEAN;
  5151. usedRegisters,oldUsedRegisters: RegisterEntry;
  5152. return: IntermediateCode.Operand;
  5153. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5154. arg: IntermediateCode.Operand;
  5155. dummy: IntermediateCode.Operand;
  5156. recordType: SyntaxTree.RecordType;
  5157. operatorSelectionProcedureOperand: Operand;
  5158. operatorSelectionProcedure: SyntaxTree.Procedure;
  5159. fingerPrint: SyntaxTree.FingerPrint;
  5160. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5161. identifierNumber: LONGINT;
  5162. parameterRegisters: SIZE;
  5163. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5164. procedure: SyntaxTree.Procedure;
  5165. callingConvention: SyntaxTree.CallingConvention;
  5166. PROCEDURE BackupGlobalState;
  5167. BEGIN
  5168. oldResult := result;
  5169. oldCurrentScope := currentScope;
  5170. oldArrayDestinationTag := arrayDestinationTag;
  5171. oldArrayDestinationDimension := arrayDestinationDimension;
  5172. oldConstantDeclaration := constantDeclaration;
  5173. oldDestination := destination;
  5174. oldCurrentLoop := currentLoop;
  5175. oldConditional := conditional;
  5176. oldTrueLabel := trueLabel;
  5177. oldFalseLabel := falseLabel;
  5178. oldLocked := locked;
  5179. oldUsedRegisters := usedRegisters
  5180. END BackupGlobalState;
  5181. PROCEDURE RestoreGlobalState;
  5182. BEGIN
  5183. result := oldResult;
  5184. currentScope := oldCurrentScope;
  5185. arrayDestinationTag := oldArrayDestinationTag;
  5186. arrayDestinationDimension := oldArrayDestinationDimension;
  5187. constantDeclaration := oldConstantDeclaration;
  5188. destination := oldDestination;
  5189. currentLoop := oldCurrentLoop;
  5190. conditional := oldConditional;
  5191. trueLabel := oldTrueLabel;
  5192. falseLabel := oldFalseLabel;
  5193. locked := oldLocked;
  5194. usedRegisters := oldUsedRegisters
  5195. END RestoreGlobalState;
  5196. (** do preparations before parameter push for array-structured object types (ASOTs):
  5197. if ASOT is passed as VAR parameter:
  5198. - allocate temporary variable of math array type
  5199. - copy contents of ASOT to be passed to temporary variable
  5200. - use temporary variable as the actual parameter instead
  5201. - 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)
  5202. **)
  5203. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5204. VAR
  5205. expression: SyntaxTree.Expression;
  5206. BEGIN
  5207. IF actualParameter IS SyntaxTree.Designator THEN
  5208. designator := actualParameter(SyntaxTree.Designator);
  5209. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5210. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5211. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5212. ASSERT(checker # NIL);
  5213. checker.SetCurrentScope(currentScope);
  5214. (* allocate temporary variable *)
  5215. ASSERT(actualParameter.type # NIL);
  5216. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5217. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5218. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5219. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5220. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5221. ASSERT(tempVariableDesignator.type # NIL);
  5222. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5223. (* copy math array stored in actual parameter to temporary variable *)
  5224. BackupGlobalState;
  5225. AssignMathArray(tempVariableDesignator, actualParameter);
  5226. RestoreGlobalState;
  5227. (* use temporary variable as actual parameter instead of the original one *)
  5228. actualParameter := tempVariableDesignator;
  5229. (* create write-back call and store it in linked list *)
  5230. (* create new list entry *)
  5231. IF firstWriteBackCall = NIL THEN
  5232. NEW(firstWriteBackCall);
  5233. currentWriteBackCall := firstWriteBackCall
  5234. ELSE
  5235. ASSERT(currentWriteBackCall # NIL);
  5236. NEW(currentWriteBackCall.next);
  5237. currentWriteBackCall := currentWriteBackCall.next
  5238. END;
  5239. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5240. ASSERT(expression.type = NIL);
  5241. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5242. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5243. (* prepare writeback for any other "normal" indexer *)
  5244. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5245. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5246. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5247. Assign(tempVariableDesignator, actualParameter);
  5248. actualParameter := tempVariableDesignator;
  5249. IF firstWriteBackCall = NIL THEN
  5250. NEW(firstWriteBackCall);
  5251. currentWriteBackCall := firstWriteBackCall
  5252. ELSE
  5253. ASSERT(currentWriteBackCall # NIL);
  5254. NEW(currentWriteBackCall.next);
  5255. currentWriteBackCall := currentWriteBackCall.next
  5256. END;
  5257. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5258. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5259. END
  5260. END
  5261. END PrepareParameter;
  5262. BEGIN
  5263. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5264. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5265. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5266. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5267. IF InlineProcedureCall(x) THEN
  5268. RETURN
  5269. ELSE
  5270. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5271. END
  5272. END;
  5273. END;
  5274. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5275. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5276. callingConvention := procedureType.callingConvention;
  5277. dest := destination; destination := emptyOperand;
  5278. SaveRegisters();ReleaseUsedRegisters(saved);
  5279. parameters := x.parameters;
  5280. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5281. (* an operator is called *)
  5282. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5283. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5284. (* check if a dynamic operator call should be performed *)
  5285. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5286. ELSE
  5287. isCallOfDynamicOperator := FALSE
  5288. END;
  5289. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5290. Emit(Push(position, ap));
  5291. END;
  5292. alignment := procedureType.stackAlignment;
  5293. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5294. alignment := 16 (* bytes *);
  5295. END;
  5296. IF alignment > 1 THEN
  5297. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5298. Emit(Mov(position,reg, sp));
  5299. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5300. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5301. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5302. gap := 4*ToMemoryUnits(system,system.addressSize);
  5303. END;
  5304. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5305. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5306. IF gap < 0 THEN
  5307. gap := 0
  5308. END;
  5309. ELSE
  5310. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5311. END;
  5312. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5313. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5314. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5315. Emit(And(position,sp, sp, mask));
  5316. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5317. Emit(Push(position,reg));
  5318. ReleaseIntermediateOperand(reg);
  5319. END;
  5320. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5321. (* align stack to 16-byte boundary *)
  5322. IntermediateCode.InitImmediate(mask,addressType,-16);
  5323. Emit(And(position,sp, sp, mask));
  5324. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5325. IF gap # 0 THEN
  5326. IntermediateCode.InitImmediate(size,addressType,gap);
  5327. Emit(Sub(position,sp,sp,size))
  5328. END;
  5329. END;
  5330. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5331. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5332. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5333. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5334. ELSE
  5335. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5336. END;
  5337. Evaluate(x.left, operand);
  5338. IF symbol IS SyntaxTree.Procedure THEN
  5339. IF (procedureType.selfParameter # NIL) THEN
  5340. Emit(Push(position,operand.tag));
  5341. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5342. Emit(Push(position,operand.tag));
  5343. ELSIF (procedureType.isDelegate) THEN
  5344. Emit(Push(position,operand.tag));
  5345. END;
  5346. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5347. IF (procedureType.selfParameter # NIL) THEN
  5348. Emit(Push(position,operand.tag));
  5349. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5350. Emit(Push(position,operand.tag));
  5351. END;
  5352. ELSE HALT(200);
  5353. END;
  5354. ReleaseIntermediateOperand(operand.tag);
  5355. operand.tag := emptyOperand;
  5356. (* determine if a structured return type is needed *)
  5357. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5358. IF structuredReturnType THEN
  5359. IF resultDesignator # NIL THEN
  5360. d := resultDesignator;
  5361. ELSE
  5362. (* temporary result that might be allocated, must potentially be traced *)
  5363. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5364. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5365. d.SetType(variable.type);
  5366. END;
  5367. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5368. Designate(d,returnValue);
  5369. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5370. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5371. Emit(Push(position,size));
  5372. Emit(Push(position,returnValue.op));
  5373. ReleaseOperand(returnValue);
  5374. ELSE*)
  5375. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5376. (*
  5377. END;
  5378. *)
  5379. END;
  5380. firstWriteBackCall := NIL; (* reset write-back call list *)
  5381. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5382. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5383. passByRegister := parameterRegisters > 0;
  5384. registerNumber := 0;
  5385. formalParameter := procedureType.lastParameter;
  5386. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5387. actualParameter := parameters.GetExpression(i);
  5388. PrepareParameter(actualParameter, formalParameter);
  5389. IF passByRegister & (i < parameterRegisters) THEN
  5390. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5391. Error(actualParameter.position,"cannot be passed by register")
  5392. ELSE
  5393. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5394. END;
  5395. INC(registerNumber);
  5396. ELSE
  5397. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5398. END;
  5399. formalParameter := formalParameter.prevParameter;
  5400. END;
  5401. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5402. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5403. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5404. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5405. END;
  5406. ELSE
  5407. hasDynamicOperands := FALSE;
  5408. formalParameter := procedureType.firstParameter;
  5409. FOR i := 0 TO parameters.Length() - 1 DO
  5410. actualParameter := parameters.GetExpression(i);
  5411. IF formalParameter # NIL THEN (* TENTATIVE *)
  5412. PrepareParameter(actualParameter, formalParameter);
  5413. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5414. ASSERT(i < 2);
  5415. hasDynamicOperands := TRUE;
  5416. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5417. ELSE
  5418. IF passByRegister & (registerNumber > 0) THEN
  5419. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5420. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5421. END;
  5422. passByRegister := FALSE;
  5423. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5424. END;
  5425. formalParameter := formalParameter.nextParameter;
  5426. END;
  5427. END;
  5428. END;
  5429. IF symbol IS SyntaxTree.Procedure THEN
  5430. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5431. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5432. Emit(Push(position,reg));
  5433. ReleaseIntermediateOperand(reg);
  5434. END;
  5435. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5436. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5437. parametersSize := ParametersSize(system,procedureType, FALSE);
  5438. END;
  5439. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5440. (*
  5441. dynamic operator overloading:
  5442. first push parameters, regularly:
  5443. [self]
  5444. par1
  5445. par2
  5446. then push parameters for GetOperator
  5447. identifier
  5448. ptr1
  5449. tag
  5450. ptr2
  5451. tag
  5452. call GetOperatorRuntimeProc
  5453. call Operator
  5454. *)
  5455. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5456. (* push ID *)
  5457. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5458. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5459. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5460. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5461. formalParameter := procedureType.firstParameter;
  5462. FOR i := 0 TO parameters.Length() - 1 DO
  5463. IF formalParameter.access # SyntaxTree.Hidden THEN
  5464. ASSERT(i < 2);
  5465. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5466. (* push pointer *)
  5467. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5468. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5469. (* add dereference *)
  5470. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5471. (*! better: do refer to stack above than using parameter backups !!*)
  5472. ReleaseIntermediateOperand(parameterBackups[i]);
  5473. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5474. END;
  5475. Emit(Push(position,parameterBackups[i]));
  5476. ReleaseIntermediateOperand(parameterBackups[i]);
  5477. (* push typetag *)
  5478. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5479. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5480. arg := TypeDescriptorAdr(recordType);
  5481. Emit(Push(position,arg));
  5482. ELSE
  5483. (* push 'NonPointer' *)
  5484. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5485. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5486. (* push fingerprint *)
  5487. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5488. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5489. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5490. END
  5491. END;
  5492. formalParameter := formalParameter.nextParameter
  5493. END;
  5494. (* for unary operators: complete the information for the second parameter *)
  5495. IF procedureType.numberParameters < 2 THEN
  5496. (* push 'NonPointer' *)
  5497. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5498. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5499. (* push 'NoType' *)
  5500. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5501. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5502. END;
  5503. (* call operator selection procedure *)
  5504. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5505. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5506. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5507. ReleaseOperand(operatorSelectionProcedureOperand);
  5508. (* use the address that the operator selection procedure returned as the target address of the call *)
  5509. InitOperand(operand, ModeValue);
  5510. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5511. Emit(Result(position,operand.op))
  5512. END
  5513. END;
  5514. ReleaseParameterRegisters();
  5515. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5516. SaveRegisters();ReleaseUsedRegisters(saved2);
  5517. CallThis(position,"Objects","LeaveA2",0);
  5518. RestoreRegisters(saved2);
  5519. END;
  5520. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5521. Emit(Call(position,operand.op,0));
  5522. ELSE
  5523. Emit(Call(position,operand.op,parametersSize));
  5524. END;
  5525. ReleaseOperand(operand);
  5526. IF procedureType.noReturn THEN
  5527. EmitTrap(position,NoReturnTrap);
  5528. END;
  5529. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5530. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5531. Emit(Result(position,return));
  5532. END;
  5533. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5534. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5535. Emit(Push(position, return));
  5536. CallThis(position,"Objects","ReenterA2",0);
  5537. Emit(Pop(position, return));
  5538. ELSE
  5539. CallThis(position,"Objects","ReenterA2",0);
  5540. END;
  5541. END;
  5542. (* === return parameter space === *)
  5543. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5544. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5545. (* cleanup all space for all parameters *)
  5546. IF parametersSize < 32 THEN
  5547. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5548. parametersSize := 32
  5549. END;
  5550. size := IntermediateCode.Immediate(addressType,parametersSize);
  5551. Emit(Add(position,sp,sp,size))
  5552. END;
  5553. IF (callingConvention IN SysvABI) THEN
  5554. IF passByRegister THEN
  5555. IF parameters.Length() > parameterRegisters THEN
  5556. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5557. ELSE
  5558. parametersSize := 0
  5559. END;
  5560. ELSE
  5561. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5562. INC( parametersSize, (-parametersSize) MOD 16 )
  5563. END;
  5564. IF parametersSize > 0 THEN
  5565. size := IntermediateCode.Immediate(addressType,parametersSize);
  5566. Emit(Add(position,sp,sp,size))
  5567. END;
  5568. END;
  5569. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5570. IF structuredReturnType THEN
  5571. (* stack pointer rewinding done by callee
  5572. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5573. Emit(Add(position,sp,sp,size));
  5574. *)
  5575. RestoreRegisters(saved);
  5576. InitOperand(result,ModeReference);
  5577. Symbol(variable,result);
  5578. ELSE
  5579. RestoreRegisters(saved);
  5580. InitOperand(result,ModeValue);
  5581. result.op := return;
  5582. END;
  5583. END;
  5584. IF alignment > 1 THEN
  5585. Emit(Pop(position,sp));
  5586. END;
  5587. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5588. Emit(Pop(position, ap));
  5589. END;
  5590. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5591. ValueToCondition(result);
  5592. END;
  5593. destination := dest;
  5594. (* perform all write-back calls in the list *)
  5595. BackupGlobalState;
  5596. currentWriteBackCall := firstWriteBackCall;
  5597. WHILE currentWriteBackCall # NIL DO
  5598. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5599. currentWriteBackCall := currentWriteBackCall.next
  5600. END;
  5601. RestoreGlobalState;
  5602. (* TENATIVE *)
  5603. (*
  5604. IF isOperatorCall THEN
  5605. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5606. END;
  5607. *)
  5608. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5609. END VisitProcedureCallDesignator;
  5610. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5611. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5612. td: SyntaxTree.Symbol;
  5613. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5614. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5615. BEGIN
  5616. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5617. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5618. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5619. variable.SetType(system.anyType);
  5620. scope.AddVariable(variable);
  5621. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5622. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5623. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5624. typeDeclaration.SetScope(module.module.moduleScope);
  5625. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5626. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5627. END;
  5628. RETURN hiddenPointerType;
  5629. END GetHiddenPointerType;
  5630. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5631. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5632. BEGIN
  5633. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5634. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5635. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5636. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5637. scope.AddVariable(variable);
  5638. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5639. variable.SetType(system.anyType);
  5640. scope.AddVariable(variable);
  5641. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5642. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5643. typeDeclaration.SetDeclaredType(delegatePointerType);
  5644. typeDeclaration.SetScope(module.module.moduleScope);
  5645. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5646. delegatePointerType.SetState(SyntaxTree.Resolved);
  5647. END;
  5648. RETURN delegatePointerType
  5649. END GetDelegateType;
  5650. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5651. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5652. such as in VAR a: RECORD ... END;
  5653. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5654. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5655. *)
  5656. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5657. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5658. BEGIN (* no code emission *)
  5659. source := NIL;
  5660. x := x.resolved;
  5661. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5662. x := GetHiddenPointerType();
  5663. ELSIF IsDelegate(x) THEN
  5664. x := GetDelegateType();
  5665. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5666. ELSE HALT(200);
  5667. END;
  5668. td := x.typeDeclaration;
  5669. IF td = NIL THEN
  5670. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5671. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5672. ASSERT(td # NIL);
  5673. END;
  5674. GetCodeSectionNameForSymbol(td,name);
  5675. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5676. meta.CheckTypeDeclaration(x);
  5677. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5678. ELSE
  5679. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5680. END;
  5681. IF backend.cooperative OR meta.simple THEN
  5682. offset := 0;
  5683. ELSE
  5684. IF x IS SyntaxTree.CellType THEN
  5685. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5686. IF baseRecord = NIL THEN
  5687. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5688. ELSE
  5689. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5690. END;
  5691. ELSE
  5692. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5693. END;
  5694. END;
  5695. RETURN td
  5696. END GetBackendType;
  5697. BEGIN
  5698. (*td := t.typeDeclaration;*)
  5699. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5700. (*
  5701. IF t IS SyntaxTree.PointerType THEN
  5702. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5703. ELSE
  5704. source := GetBackendType(t);
  5705. END;
  5706. *)
  5707. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5708. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5709. IntermediateCode.SetOffset(res,offset);
  5710. (*
  5711. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5712. make memory should be used when tag is used, not earlier
  5713. *)
  5714. RETURN res
  5715. END TypeDescriptorAdr;
  5716. (*
  5717. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5718. VAR result: IntermediateCode.Operand;
  5719. BEGIN
  5720. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5721. operand.tag := TypeDescriptorAdr(operand.type);
  5722. IntermediateCode.MakeMemory(operand.tag,addressType);
  5723. UseIntermediateOperand(operand.tag);
  5724. END;
  5725. END MakeTypeTag;
  5726. *)
  5727. PROCEDURE ProfilerInit;
  5728. VAR reg: IntermediateCode.Operand;
  5729. BEGIN
  5730. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5731. Emit(Call(position,reg,0));
  5732. END ProfilerInit;
  5733. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5734. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5735. BEGIN
  5736. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5737. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5738. THEN
  5739. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5740. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5741. Emit(Push(position,reg));
  5742. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5743. Emit(Push(position,reg));
  5744. StaticCallOperand(result,procedure);
  5745. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5746. ReleaseOperand(result);
  5747. END;
  5748. END ProfilerEnterExit;
  5749. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5750. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5751. BEGIN
  5752. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5753. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5754. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5755. profileInit.Emit(Push(position,reg));
  5756. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5757. profileInit.Emit(Push(position,reg));
  5758. NEW(string, LEN(name)); COPY(name, string^);
  5759. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5760. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5761. sv.SetType(type);
  5762. Designate(sv,result);
  5763. profileInit.Emit(Push(position,result.tag));
  5764. profileInit.Emit(Push(position,result.op));
  5765. StaticCallOperand(result,procedure);
  5766. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5767. ReleaseOperand(result);
  5768. END;
  5769. END ProfilerAddProcedure;
  5770. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5771. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5772. BEGIN
  5773. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5774. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5775. profileInit.Emit(Push(position,reg));
  5776. profileInitPatchPosition := profileInit.pc;
  5777. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5778. NEW(string, LEN(name)); COPY(name, string^);
  5779. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5780. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5781. sv.SetType(type);
  5782. Designate(sv,result);
  5783. profileInit.Emit(Push(position,result.tag));
  5784. profileInit.Emit(Push(position,result.op));
  5785. StaticCallOperand(result,procedure);
  5786. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5787. ReleaseOperand(result);
  5788. END;
  5789. END ProfilerAddModule;
  5790. PROCEDURE ProfilerPatchInit;
  5791. VAR reg: IntermediateCode.Operand;
  5792. BEGIN
  5793. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5794. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5795. EmitLeave(profileInit,position,NIL,0);
  5796. profileInit.Emit(Exit(position,0,0,0));
  5797. END ProfilerPatchInit;
  5798. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5799. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5800. VAR
  5801. id: LONGINT;
  5802. leftType, rightType: SyntaxTree.Type;
  5803. procedureType: SyntaxTree.ProcedureType;
  5804. runtimeProcedure: SyntaxTree.Procedure;
  5805. runtimeProcedureOperand, operatorOperand: Operand;
  5806. kind: SET;
  5807. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5808. VAR
  5809. arg: IntermediateCode.Operand;
  5810. recordType: SyntaxTree.RecordType;
  5811. fingerPrint: SyntaxTree.FingerPrint;
  5812. BEGIN
  5813. IF type = NIL THEN
  5814. (* no type: push 'NoType' *)
  5815. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5816. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5817. ELSIF IsStrictlyPointerToRecord(type) THEN
  5818. (* pointer to record type: push typetag *)
  5819. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5820. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5821. arg := TypeDescriptorAdr(recordType);
  5822. ELSE
  5823. (* non-pointer to record type: push fingerprint *)
  5824. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5825. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5826. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5827. END;
  5828. operatorInitializationCodeSection.Emit(Push(position,arg))
  5829. END PushTypeInfo;
  5830. BEGIN
  5831. ASSERT(operatorInitializationCodeSection # NIL);
  5832. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5833. procedureType := operator.type(SyntaxTree.ProcedureType);
  5834. (* determine types *)
  5835. leftType := procedureType.firstParameter.type;
  5836. IF procedureType.numberParameters = 2 THEN
  5837. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5838. rightType := procedureType.firstParameter.nextParameter.type;
  5839. ELSE
  5840. rightType := NIL
  5841. END;
  5842. (* determine operator kind *)
  5843. IF IsStrictlyPointerToRecord(leftType) THEN
  5844. kind := {LhsIsPointer}
  5845. ELSE
  5846. kind := {}
  5847. END;
  5848. IF IsStrictlyPointerToRecord(rightType) THEN
  5849. kind := kind + {RhsIsPointer}
  5850. END;
  5851. IF kind # {} THEN (* TODO: to be removed later on *)
  5852. (* at least one of the types is a pointer to record *)
  5853. (* emit a code that registers this specific operator in the runtime *)
  5854. dump := operatorInitializationCodeSection.comments;
  5855. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5856. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5857. (* push ID *)
  5858. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5859. id := Global.GetSymbol(module.module.case, operator.name);
  5860. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5861. (* push kind *)
  5862. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5863. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5864. (* push type infos *)
  5865. PushTypeInfo(leftType);
  5866. PushTypeInfo(rightType);
  5867. (* push operator address *)
  5868. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5869. StaticCallOperand(operatorOperand, operator);
  5870. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5871. ReleaseOperand(operatorOperand);
  5872. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5873. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5874. ReleaseOperand(runtimeProcedureOperand)
  5875. END
  5876. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5877. END
  5878. END RegisterDynamicOperator;
  5879. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5880. VAR
  5881. traceModule: SyntaxTree.Module;
  5882. procedure: SyntaxTree.Procedure;
  5883. procedureVariable: SyntaxTree.Variable;
  5884. s,msg: Basic.MessageString;
  5885. res: Operand;
  5886. i: LONGINT;
  5887. sv: SyntaxTree.StringValue;
  5888. type: SyntaxTree.Type;
  5889. recordType: SyntaxTree.RecordType;
  5890. printout: Printout.Printer;
  5891. stringWriter: Streams.StringWriter;
  5892. expression: SyntaxTree.Expression;
  5893. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5894. BEGIN
  5895. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5896. IF procedure = NIL THEN
  5897. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5898. END;
  5899. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5900. s := "procedure ";
  5901. Strings.Append(s,backend.traceModuleName);
  5902. Strings.Append(s,".");
  5903. Strings.Append(s,procedureName);
  5904. Strings.Append(s," not present");
  5905. Error(position,s);
  5906. RETURN FALSE
  5907. ELSE
  5908. RETURN TRUE
  5909. END;
  5910. END GetProcedure;
  5911. PROCEDURE CallProcedure;
  5912. VAR size: LONGINT;
  5913. BEGIN
  5914. IF procedure # NIL THEN
  5915. StaticCallOperand(result,procedure);
  5916. size := ProcParametersSize(procedure);
  5917. ELSE
  5918. Symbol(procedureVariable, result);
  5919. LoadValue(result, procedureVariable.type.resolved);
  5920. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5921. END;
  5922. Emit(Call(position,result.op,size));
  5923. END CallProcedure;
  5924. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5925. VAR res: Operand; string: SyntaxTree.String;
  5926. BEGIN
  5927. IF GetProcedure("String") THEN
  5928. NEW(string, LEN(s)); COPY(s, string^);
  5929. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5930. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5931. sv.SetType(type);
  5932. Designate(sv,res);
  5933. Emit(Push(position,res.tag));
  5934. Emit(Push(position,res.op));
  5935. ReleaseOperand(res);
  5936. CallProcedure;
  5937. END;
  5938. END String;
  5939. PROCEDURE Integer(op: IntermediateCode.Operand);
  5940. BEGIN
  5941. IF GetProcedure("Int") THEN
  5942. Emit(Push(position,op));
  5943. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5944. CallProcedure;
  5945. END;
  5946. END Integer;
  5947. PROCEDURE Float(op: IntermediateCode.Operand);
  5948. BEGIN
  5949. IF GetProcedure("HIntHex") THEN
  5950. Emit(Push(position,op));
  5951. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5952. CallProcedure;
  5953. END;
  5954. END Float;
  5955. PROCEDURE Set(op: IntermediateCode.Operand);
  5956. BEGIN
  5957. IF GetProcedure("Set") THEN
  5958. Emit(Push(position,op));
  5959. (*
  5960. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5961. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5962. *)
  5963. CallProcedure;
  5964. END;
  5965. END Set;
  5966. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5967. BEGIN
  5968. IF GetProcedure("Boolean") THEN
  5969. Emit(Push(position,op));
  5970. CallProcedure;
  5971. END;
  5972. END Boolean;
  5973. PROCEDURE Char(op: IntermediateCode.Operand);
  5974. BEGIN
  5975. IF GetProcedure("Char") THEN
  5976. Emit(Push(position,op));
  5977. CallProcedure;
  5978. END;
  5979. END Char;
  5980. PROCEDURE Address(op: IntermediateCode.Operand);
  5981. BEGIN
  5982. IF GetProcedure("Address") THEN
  5983. Emit(Push(position,op));
  5984. CallProcedure;
  5985. END;
  5986. END Address;
  5987. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5988. VAR len: IntermediateCode.Operand;
  5989. BEGIN
  5990. IF GetProcedure("String") THEN
  5991. len := GetArrayLength(type, op.tag);
  5992. Emit(Push(position,len));
  5993. ReleaseIntermediateOperand(len);
  5994. Emit(Push(position,op.op));
  5995. CallProcedure;
  5996. END;
  5997. END StringOperand;
  5998. PROCEDURE Ln;
  5999. BEGIN
  6000. IF GetProcedure("Ln") THEN
  6001. CallProcedure;
  6002. END;
  6003. END Ln;
  6004. BEGIN
  6005. IF backend.traceModuleName = "" THEN RETURN END;
  6006. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6007. IF GetProcedure("Enter") THEN
  6008. CallProcedure
  6009. END;
  6010. NEW(stringWriter,LEN(s));
  6011. FOR i := 0 TO x.Length()-1 DO
  6012. msg := "";
  6013. expression := x.GetExpression(i);
  6014. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6015. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6016. ELSE
  6017. Global.GetModuleName(module.module, s);
  6018. END;
  6019. IF i = 0 THEN
  6020. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6021. stringWriter.String(":");
  6022. END;
  6023. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6024. IF ~(expression IS SyntaxTree.StringValue) THEN
  6025. printout.Expression(expression);
  6026. stringWriter.Get(s);
  6027. Strings.Append(msg,s);
  6028. Strings.Append(msg,"= ");
  6029. ELSE stringWriter.Get(s); (* remove from string writer *)
  6030. Strings.Append(msg, s);
  6031. END;
  6032. String(msg);
  6033. IF SemanticChecker.IsStringType(expression.type) THEN
  6034. Designate(expression,res);
  6035. StringOperand(res, expression.type);
  6036. ELSE
  6037. Evaluate(expression,res);
  6038. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6039. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6040. Convert(res.op,int64);
  6041. END;
  6042. Integer(res.op);
  6043. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6044. Boolean(res.op);
  6045. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6046. Set(res.op);
  6047. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6048. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6049. Convert(res.op,float64);
  6050. END;
  6051. Float(res.op);
  6052. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6053. Char(res.op);
  6054. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6055. Address(res.op);String("H");
  6056. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6057. Address(res.op);String("H");
  6058. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6059. Address(res.op);String("H");
  6060. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6061. Address(res.op);String("H");
  6062. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6063. String("NIL");
  6064. ELSE HALT(200);
  6065. END;
  6066. END;
  6067. ReleaseOperand(res);
  6068. String("; ");
  6069. END;
  6070. IF GetProcedure("Exit") THEN
  6071. CallProcedure
  6072. ELSE
  6073. Ln;
  6074. END;
  6075. END;
  6076. END SystemTrace;
  6077. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6078. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6079. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6080. BEGIN
  6081. type := type.resolved;
  6082. IF type IS SyntaxTree.RecordType THEN
  6083. WITH type: SyntaxTree.RecordType DO
  6084. baseType := type.baseType;
  6085. IF baseType # NIL THEN
  6086. baseType := baseType.resolved;
  6087. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6088. InitFields(baseType,adr,offset);
  6089. END;
  6090. variable := type.recordScope.firstVariable;
  6091. WHILE variable # NIL DO
  6092. IF variable.initializer # NIL THEN
  6093. Evaluate(variable.initializer,initializerOp);
  6094. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6095. Emit(Mov(position,mem,initializerOp.op));
  6096. ReleaseOperand(initializerOp);
  6097. ReleaseIntermediateOperand(mem);
  6098. END;
  6099. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6100. variable := variable.nextVariable
  6101. END;
  6102. END;
  6103. ELSIF type IS SyntaxTree.CellType THEN
  6104. WITH type: SyntaxTree.CellType DO
  6105. baseType := type.baseType;
  6106. IF baseType # NIL THEN
  6107. baseType := baseType.resolved;
  6108. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6109. InitFields(baseType,adr,offset);
  6110. END;
  6111. variable := type.cellScope.firstVariable;
  6112. WHILE variable # NIL DO
  6113. IF variable.initializer # NIL THEN
  6114. Evaluate(variable.initializer,initializerOp);
  6115. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6116. Emit(Mov(position,mem,initializerOp.op));
  6117. ReleaseOperand(initializerOp);
  6118. ReleaseIntermediateOperand(mem);
  6119. END;
  6120. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6121. variable := variable.nextVariable
  6122. END;
  6123. END;
  6124. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6125. WITH type: SyntaxTree.ArrayType DO
  6126. IF type.form = SyntaxTree.Static THEN
  6127. baseType := type.arrayBase;
  6128. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6129. FOR i := 0 TO type.staticLength-1 DO
  6130. InitFields(baseType,adr,offset+i*size);
  6131. END;
  6132. END;
  6133. END;
  6134. ELSIF type IS SyntaxTree.MathArrayType THEN
  6135. WITH type: SyntaxTree.MathArrayType DO
  6136. IF type.form = SyntaxTree.Open THEN
  6137. dim := DynamicDim(type);
  6138. imm := IntermediateCode.Immediate(addressType,dim);
  6139. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6140. baseType := SemanticChecker.ArrayBase(type,dim);
  6141. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6142. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6143. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6144. ReleaseIntermediateOperand(imm);
  6145. (* flags remain empty (=0) for open array *)
  6146. ELSIF type.form = SyntaxTree.Static THEN
  6147. baseType := type.arrayBase;
  6148. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6149. ASSERT(type.staticLength < 1024*1024*1024);
  6150. FOR i := 0 TO type.staticLength-1 DO
  6151. InitFields(baseType,adr,offset+i*size);
  6152. END;
  6153. END;
  6154. END;
  6155. END;
  6156. END InitFields;
  6157. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6158. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6159. saved: RegisterEntry;
  6160. BEGIN
  6161. type := variable.type.resolved;
  6162. IF (type IS SyntaxTree.MathArrayType) THEN
  6163. WITH type: SyntaxTree.MathArrayType DO
  6164. IF type.form = SyntaxTree.Open THEN
  6165. Symbol(variable,operand);
  6166. InitFields(type, operand.tag,0);
  6167. IF temporary THEN
  6168. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6169. END;
  6170. ELSIF type.form = SyntaxTree.Tensor THEN
  6171. IF temporary & backend.writeBarriers THEN
  6172. SaveRegisters();ReleaseUsedRegisters(saved);
  6173. Symbol(variable, operand);
  6174. Emit(Push(position,operand.op));
  6175. ReleaseOperand(operand);
  6176. Emit(Push(position,nil));
  6177. CallThis(position,"FoxArrayBase","Assign",2);
  6178. RestoreRegisters(saved);
  6179. ELSE
  6180. Symbol(variable, operand);
  6181. MakeMemory(tmp,operand.op,addressType,0);
  6182. ReleaseOperand(operand);
  6183. IF FALSE & temporary THEN
  6184. (* trick -- temporary object from array base *)
  6185. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6186. Symbol(symbol,operand);
  6187. MakeMemory(mem,operand.op,addressType,0);
  6188. ReleaseOperand(operand);
  6189. Emit(Mov(position,tmp, mem) );
  6190. ReleaseOperand(operand);
  6191. ELSE
  6192. Emit(Mov(position,tmp, nil ) );
  6193. END;
  6194. ReleaseIntermediateOperand(tmp)
  6195. END;
  6196. END;
  6197. END;
  6198. ELSE
  6199. Symbol(variable,operand);
  6200. IF variable.initializer # NIL THEN
  6201. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6202. reference.SetType(variable.type.resolved);
  6203. reference.SetAssignable(TRUE);
  6204. Assign(reference,variable.initializer);
  6205. ELSIF temporary THEN
  6206. IF SemanticChecker.IsPointerType(variable.type) THEN
  6207. IF backend.writeBarriers THEN
  6208. SaveRegisters();ReleaseUsedRegisters(saved);
  6209. Symbol(variable, operand);
  6210. Emit(Push(position,operand.op));
  6211. ReleaseOperand(operand);
  6212. Emit(Push(position,nil));
  6213. CallThis(position,"Heaps","Assign",2);
  6214. RestoreRegisters(saved);
  6215. ELSE
  6216. Symbol(variable, operand);
  6217. MakeMemory(tmp,operand.op,addressType,0);
  6218. ReleaseOperand(operand);
  6219. Emit(Mov(position,tmp, nil ) );
  6220. ReleaseIntermediateOperand(tmp);
  6221. END;
  6222. END;
  6223. END;
  6224. InitFields(type, operand.op,0);
  6225. ReleaseOperand(operand);
  6226. END;
  6227. END InitVariable;
  6228. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6229. VAR end: Label;
  6230. BEGIN
  6231. IF type.form = SyntaxTree.Tensor THEN
  6232. InitOperand(result,ModeValue);
  6233. ReuseCopy(result.op,base);
  6234. end := NewLabel();
  6235. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6236. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6237. SetLabel(end);
  6238. Convert(result.op,lenType);
  6239. ELSE
  6240. InitOperand(result,ModeValue);
  6241. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6242. END
  6243. END MathArrayDim;
  6244. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6245. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6246. BEGIN
  6247. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6248. MakeMemory(mem,base,addressType,offset);
  6249. Emit(Mov(position,mem,value));
  6250. ReleaseIntermediateOperand(mem);
  6251. END PutMathArrayField;
  6252. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6253. VAR mem: IntermediateCode.Operand;
  6254. BEGIN
  6255. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6256. MakeMemory(mem,base,addressType,offset);
  6257. Emit(Mov(position,mem,value));
  6258. ReleaseIntermediateOperand(mem);
  6259. END PutMathArrayFieldOffset;
  6260. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6261. BEGIN
  6262. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6263. MakeMemory(value,base,addressType,offset);
  6264. END GetMathArrayField;
  6265. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6266. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6267. BEGIN
  6268. IF incr THEN
  6269. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6270. ELSE
  6271. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6272. END;
  6273. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6274. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6275. ELSE
  6276. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6277. Emit(Mov(position,reg,dim));
  6278. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6279. Emit(Add(position,reg,reg,base));
  6280. MakeMemory(mem, reg, addressType, offset);
  6281. ReleaseIntermediateOperand(reg);
  6282. Emit(Mov(position,mem,value));
  6283. ReleaseIntermediateOperand(mem);
  6284. END;
  6285. END PutMathArrayLenOrIncr;
  6286. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6287. BEGIN
  6288. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6289. END PutMathArrayLength;
  6290. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6291. BEGIN
  6292. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6293. END PutMathArrayIncrement;
  6294. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6295. BEGIN
  6296. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6297. END GetMathArrayIncrement;
  6298. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6299. BEGIN
  6300. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6301. END GetMathArrayLength;
  6302. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6303. VAR dimOp: IntermediateCode.Operand;
  6304. BEGIN
  6305. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6306. GetMathArrayLength(type, operand, dimOp, check, result);
  6307. END GetMathArrayLengthAt;
  6308. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6309. VAR dimOp: IntermediateCode.Operand;
  6310. BEGIN
  6311. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6312. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6313. END GetMathArrayIncrementAt;
  6314. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6315. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6316. offset: LONGINT;
  6317. BEGIN
  6318. IF increment THEN
  6319. offset := MathIncrOffset;
  6320. ELSE
  6321. offset := MathLenOffset;
  6322. END;
  6323. INC(offset,operand.dimOffset*2);
  6324. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6325. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6326. END;
  6327. (* static dimension *)
  6328. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6329. IF check & (type.form = SyntaxTree.Tensor) THEN
  6330. DimensionCheck(operand.tag,dim,BrltL);
  6331. END;
  6332. val := SHORT(dim.intValue);
  6333. IF type.form # SyntaxTree.Tensor THEN
  6334. t := SemanticChecker.ArrayBase(type,val);
  6335. type := t.resolved(SyntaxTree.MathArrayType);
  6336. IF type.form = SyntaxTree.Static THEN
  6337. IF increment THEN
  6338. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6339. ELSE
  6340. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6341. END;
  6342. InitOperand(result,ModeValue);
  6343. result.op := res;
  6344. RETURN;
  6345. END;
  6346. END;
  6347. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6348. MakeMemory(res,operand.tag,addressType,offset);
  6349. (*
  6350. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6351. *)
  6352. InitOperand(result,ModeValue);
  6353. result.op := res;
  6354. ELSE
  6355. Convert(dim,addressType);
  6356. IF check THEN
  6357. IF type.form = SyntaxTree.Tensor THEN
  6358. DimensionCheck(operand.tag,dim,BrltL);
  6359. ELSIF isUnchecked THEN (* do nothing *)
  6360. ELSE
  6361. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6362. END;
  6363. END;
  6364. end := NewLabel(); next := NIL;
  6365. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6366. Emit(Mov(position,res,dim));
  6367. Convert(res,sizeType);
  6368. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6369. WHILE t IS SyntaxTree.MathArrayType DO
  6370. type := t(SyntaxTree.MathArrayType);
  6371. IF type.form = SyntaxTree.Static THEN
  6372. imm := IntermediateCode.Immediate(sizeType,val);
  6373. next := NewLabel();
  6374. BrneL(next,imm,res);
  6375. IF increment THEN
  6376. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6377. ELSE
  6378. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6379. END;
  6380. Emit(MovReplace(position,res,imm));
  6381. BrL(end);
  6382. ELSE hasDynamicPart := TRUE;
  6383. END;
  6384. t := type.arrayBase.resolved;
  6385. val := val + 1;
  6386. IF next # NIL THEN SetLabel(next) END;
  6387. END;
  6388. IF hasDynamicPart THEN
  6389. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6390. Emit(Mov(position,res2,dim));
  6391. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6392. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6393. Emit(Add(position,res2,res2,imm));
  6394. Emit(Add(position,res2,res2,operand.tag));
  6395. IntermediateCode.MakeMemory(res2,sizeType);
  6396. Emit(MovReplace(position,res,res2));
  6397. ReleaseIntermediateOperand(res2);
  6398. END;
  6399. SetLabel(end);
  6400. Convert(res,sizeType);
  6401. InitOperand(result,ModeValue);
  6402. result.op := res;
  6403. END;
  6404. END MathArrayLenOrIncr;
  6405. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6406. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6407. offset: LONGINT;
  6408. BEGIN
  6409. offset := operand.dimOffset+DynamicDim(type)-1;
  6410. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6411. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6412. val := SHORT(dim.intValue);
  6413. t := SemanticChecker.ArrayBase(type,val);
  6414. type := t.resolved(SyntaxTree.ArrayType);
  6415. IF type.form = SyntaxTree.Static THEN
  6416. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6417. ELSE
  6418. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6419. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6420. END;
  6421. UseIntermediateOperand(res);
  6422. InitOperand(result,ModeValue);
  6423. result.op := res;
  6424. ELSE
  6425. Convert(dim,addressType);
  6426. IF ~isUnchecked THEN
  6427. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6428. END;
  6429. end := NewLabel(); next := NIL;
  6430. (* ReuseCopy(dim,res); *)
  6431. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6432. Emit(Mov(position,res,dim));
  6433. Convert(res,sizeType);
  6434. Convert(res,sizeType);
  6435. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6436. WHILE t IS SyntaxTree.ArrayType DO
  6437. type := t(SyntaxTree.ArrayType);
  6438. IF type.form = SyntaxTree.Static THEN
  6439. imm := IntermediateCode.Immediate(sizeType,val);
  6440. next := NewLabel();
  6441. BrneL(next,imm,res);
  6442. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6443. Emit(MovReplace(position,res,imm));
  6444. BrL(end);
  6445. ELSE hasDynamicPart := TRUE;
  6446. END;
  6447. t := type.arrayBase.resolved;
  6448. val := val + 1;
  6449. IF next # NIL THEN SetLabel(next) END;
  6450. END;
  6451. IF hasDynamicPart THEN
  6452. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6453. Convert(res2,addressType);
  6454. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6455. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6456. Emit(Sub(position,res2,imm,res2));
  6457. Emit(Add(position,res2,res2,operand.tag));
  6458. IntermediateCode.MakeMemory(res2,sizeType);
  6459. Emit(MovReplace(position,res,res2));
  6460. ReleaseIntermediateOperand(res2);
  6461. END;
  6462. SetLabel(end);
  6463. Convert(res,sizeType);
  6464. InitOperand(result,ModeValue);
  6465. result.op := res;
  6466. END;
  6467. END ArrayLen;
  6468. (**
  6469. create a temporary variable in current scope
  6470. **)
  6471. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6472. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6473. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6474. BEGIN
  6475. IF ~register THEN
  6476. v := temporaries.GetFreeVariable(type, untraced, index);
  6477. ELSE
  6478. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6479. END;
  6480. scope := currentScope;
  6481. (*
  6482. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6483. *)
  6484. name := temporaries.GetUID();
  6485. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6486. variable.SetType(type);
  6487. variable.SetAccess(SyntaxTree.Hidden);
  6488. variable.SetUntraced(untraced);
  6489. IF v = NIL THEN
  6490. temporaries.AddVariable(variable);
  6491. IF ~register THEN
  6492. IF scope.lastVariable # NIL THEN
  6493. offset := scope.lastVariable.offsetInBits;
  6494. ELSE
  6495. offset := 0;
  6496. END;
  6497. DEC(offset,system.SizeOf(variable.type));
  6498. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6499. variable(SyntaxTree.Variable).SetOffset(offset);
  6500. scope.AddVariable(variable(SyntaxTree.Variable));
  6501. scope.EnterSymbol(variable, duplicate);
  6502. ASSERT(~duplicate);
  6503. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6504. ELSE
  6505. variable.SetUseRegister(TRUE);
  6506. variable(SyntaxTree.Variable).SetOffset(0);
  6507. END;
  6508. ELSE (* v # NIL *)
  6509. (* reuse slot for new variable, do not create new slot ! *)
  6510. temporaries.SetVariable(index, variable);
  6511. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6512. ASSERT(~register);
  6513. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6514. ASSERT(v.offsetInBits # 0);
  6515. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6516. scope.EnterSymbol(variable, duplicate);
  6517. ASSERT(~duplicate);
  6518. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6519. END;
  6520. RETURN variable(SyntaxTree.Variable)
  6521. END GetTemporaryVariable;
  6522. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6523. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6524. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6525. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6526. i: LONGINT; duplicate: BOOLEAN;
  6527. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6528. VAR variable: SyntaxTree.Variable;
  6529. BEGIN
  6530. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6531. variable.SetType(type);
  6532. recordScope.AddVariable(variable);
  6533. END AddVariable;
  6534. BEGIN
  6535. name := "@ArrayDescriptor";
  6536. Basic.AppendNumber(name,dimensions);
  6537. identifier := SyntaxTree.NewIdentifier(name);
  6538. parentScope := module.module.moduleScope;
  6539. symbol := parentScope.FindSymbol(identifier);
  6540. IF symbol # NIL THEN
  6541. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6542. type := typeDeclaration.declaredType;
  6543. ELSE
  6544. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6545. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6546. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6547. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6548. recordType.SetTypeDeclaration(typeDeclaration);
  6549. recordType.SetState(SyntaxTree.Resolved);
  6550. typeDeclaration.SetDeclaredType(recordType);
  6551. AddVariable("@ptr",system.anyType);
  6552. AddVariable("@adr",system.addressType);
  6553. AddVariable("@flags",system.addressType);
  6554. AddVariable("@dim",system.addressType);
  6555. AddVariable("@elementSize",system.addressType);
  6556. FOR i := 0 TO dimensions-1 DO
  6557. name := "@len";
  6558. Basic.AppendNumber(name,i);
  6559. AddVariable(name,system.addressType);
  6560. name := "@incr";
  6561. Basic.AppendNumber(name,i);
  6562. AddVariable(name,system.addressType);
  6563. END;
  6564. parentScope.AddTypeDeclaration(typeDeclaration);
  6565. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6566. ASSERT(~duplicate);
  6567. type := recordType;
  6568. END;
  6569. RETURN type
  6570. END GetMathArrayDescriptorType;
  6571. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6572. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6573. BEGIN
  6574. type := GetMathArrayDescriptorType(dimensions);
  6575. Emit(Push(position,op.op));
  6576. (* push type descriptor *)
  6577. reg := TypeDescriptorAdr(type);
  6578. Emit(Push(position,reg));
  6579. ReleaseIntermediateOperand(reg);
  6580. (* push realtime flag: false by default *)
  6581. Emit(Push(position,false));
  6582. CallThis(position,"Heaps","NewRec",3);
  6583. END NewMathArrayDescriptor;
  6584. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6585. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6586. BEGIN
  6587. NEW(string, LEN(s)); COPY(s, string^);
  6588. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6589. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6590. sv.SetType(type);
  6591. Designate(sv,res);
  6592. Emit(Push(position,res.tag));
  6593. Emit(Push(position,res.op));
  6594. ReleaseOperand(res);
  6595. END PushConstString;
  6596. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6597. BEGIN
  6598. IF b THEN
  6599. Emit(Push(Basic.invalidPosition, true));
  6600. ELSE
  6601. Emit(Push(Basic.invalidPosition, false));
  6602. END;
  6603. END PushConstBoolean;
  6604. PROCEDURE PushConstSet(v: SET);
  6605. VAR value: SyntaxTree.Value; op: Operand;
  6606. BEGIN
  6607. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6608. value.SetType(system.setType);
  6609. Evaluate(value, op);
  6610. Emit(Push(Basic.invalidPosition, op.op));
  6611. ReleaseOperand(op);
  6612. END PushConstSet;
  6613. PROCEDURE PushConstInteger(v: LONGINT);
  6614. VAR value: SyntaxTree.Value; op: Operand;
  6615. BEGIN
  6616. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6617. value.SetType(system.longintType);
  6618. Evaluate(value, op);
  6619. Emit(Push(Basic.invalidPosition, op.op));
  6620. ReleaseOperand(op);
  6621. END PushConstInteger;
  6622. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6623. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6624. section: IntermediateCode.Section;
  6625. BEGIN
  6626. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6627. Global.GetSymbolSegmentedName(symbol, name);
  6628. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6629. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6630. procedure.SetScope(moduleScope);
  6631. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6632. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6633. procedure.SetAccess(SyntaxTree.Hidden);
  6634. currentScope := procedureScope;
  6635. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6636. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6637. RETURN section;
  6638. END OpenInitializer;
  6639. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6640. BEGIN
  6641. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6642. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6643. section := prev;
  6644. END CloseInitializer;
  6645. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6646. VAR name: SyntaxTree.IdentifierString;
  6647. variable: SyntaxTree.Variable;
  6648. parameter: SyntaxTree.Parameter;
  6649. type: SyntaxTree.Type;
  6650. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6651. BEGIN
  6652. InitOperand(op,ModeReference);
  6653. op.op := fp;
  6654. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6655. Dereference(op, x, FALSE);
  6656. result := op;
  6657. Symbol(symbol, op);
  6658. END Field;
  6659. PROCEDURE Direction(direction: LONGINT): SET;
  6660. BEGIN
  6661. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6662. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6663. ELSE HALT(100);
  6664. END;
  6665. END Direction;
  6666. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6667. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6668. BEGIN
  6669. Field(port, op);
  6670. ToMemory(op.op,addressType,0);
  6671. Emit(Push(Basic.invalidPosition, op.op));
  6672. ReleaseOperand(op);
  6673. Basic.GetString(modifier.identifier, name);
  6674. PushConstString(name);
  6675. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6676. ASSERT(SemanticChecker.IsStringType(value.type));
  6677. Designate(value, op);
  6678. Emit(Push(modifier.position, op.tag));
  6679. Emit(Push(modifier.position, op.op));
  6680. ReleaseOperand(op);
  6681. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6682. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6683. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6684. Evaluate(value, op);
  6685. Emit(Push(modifier.position, op.op));
  6686. ReleaseOperand(op);
  6687. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6688. ELSE
  6689. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6690. END;
  6691. END AddPortProperty;
  6692. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6693. VAR modifier: SyntaxTree.Modifier;
  6694. BEGIN
  6695. modifier := parameter.modifiers;
  6696. WHILE modifier # NIL DO
  6697. AddPortProperty(parameter,modifier, modifier.expression);
  6698. modifier := modifier.nextModifier;
  6699. END;
  6700. END AddPortProperties;
  6701. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6702. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6703. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6704. PROCEDURE PushLens(type: SyntaxTree.Type);
  6705. BEGIN
  6706. IF IsSemiDynamicArray(type) THEN
  6707. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6708. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6709. Emit(Push(Basic.invalidPosition, op.op));
  6710. ReleaseOperand(op);
  6711. INC(dim);
  6712. ELSIF IsStaticArray(type) THEN
  6713. len := len * type(SyntaxTree.ArrayType).staticLength;
  6714. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6715. INC(dim);
  6716. ELSE
  6717. baseType := type;
  6718. END;
  6719. END PushLens;
  6720. BEGIN
  6721. (* cell *)
  6722. IF parameter.type IS SyntaxTree.ArrayType THEN
  6723. type := parameter.type;
  6724. dim := 0;
  6725. len := 1;
  6726. PushLens(type);
  6727. portType := baseType.resolved(SyntaxTree.PortType);
  6728. ELSE
  6729. portType := parameter.type(SyntaxTree.PortType);
  6730. END;
  6731. PushSelfPointer();
  6732. (* port / array of ports *)
  6733. IF IsStaticArray(type) THEN
  6734. PushConstInteger(len);
  6735. END;
  6736. Field(parameter, op);
  6737. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6738. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6739. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6740. Designate(d, op);*)
  6741. Emit(Push(Basic.invalidPosition, op.op));
  6742. ReleaseOperand(op);
  6743. (* name *)
  6744. PushConstString(name);
  6745. (* inout *)
  6746. PushConstSet(Direction(portType.direction));
  6747. (* width *)
  6748. PushConstInteger(portType.sizeInBits);
  6749. IF parameter.type IS SyntaxTree.PortType THEN
  6750. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6751. AddPortProperties(parameter);
  6752. ELSIF IsStaticArray(type)THEN
  6753. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6754. ELSIF IsSemiDynamicArray(type) THEN
  6755. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6756. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6757. Emit(Add(position,reg, sp, size));
  6758. (* dim *)
  6759. PushConstInteger(dim);
  6760. (* len array *)
  6761. Emit(Push(position, reg));
  6762. ReleaseIntermediateOperand(reg);
  6763. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6764. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6765. Emit(Add(position, sp,sp, size));
  6766. ELSE
  6767. HALT(100);
  6768. END;
  6769. END Parameter;
  6770. BEGIN
  6771. IF backend.cellsAreObjects THEN
  6772. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6773. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6774. END;
  6775. parameter := x.firstParameter;
  6776. WHILE (parameter # NIL) DO
  6777. type := parameter.type.resolved;
  6778. WHILE (type IS SyntaxTree.ArrayType) DO
  6779. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6780. END;
  6781. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6782. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6783. Parameter(name,parameter);
  6784. END;
  6785. parameter := parameter.nextParameter;
  6786. END;
  6787. ELSE HALT(200)
  6788. END;
  6789. END AddPorts;
  6790. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6791. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6792. BEGIN
  6793. Symbol(cell,op);
  6794. ToMemory(op.op,addressType,0);
  6795. Emit(Push(position,op.op));
  6796. ReleaseOperand(op);
  6797. property.GetName(name);
  6798. (* does not work when inheritance is used:
  6799. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6800. *)
  6801. PushConstString(name);
  6802. IF (value # NIL) THEN
  6803. ASSERT(
  6804. SemanticChecker.IsStringType(property.type)
  6805. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6806. OR (property.type.resolved IS SyntaxTree.FloatType)
  6807. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6808. OR (property.type.resolved IS SyntaxTree.SetType)
  6809. );
  6810. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6811. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6812. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6813. Designate(d, op);
  6814. IF SemanticChecker.IsStringType(property.type) THEN
  6815. Emit(Push(Basic.invalidPosition, op.tag))
  6816. END;
  6817. Emit(Push(Basic.invalidPosition, op.op));
  6818. ReleaseOperand(op);
  6819. END;
  6820. IF value = NIL THEN
  6821. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6822. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6823. ASSERT(SemanticChecker.IsStringType(value.type));
  6824. Designate(value, op);
  6825. PushString(op, value.type);
  6826. ReleaseOperand(op);
  6827. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6828. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6829. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6830. Evaluate(value, op);
  6831. Emit(Push(property.position, op.op));
  6832. ReleaseOperand(op);
  6833. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6834. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6835. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6836. Evaluate(value, op);
  6837. Emit(Push(property.position, op.op));
  6838. ReleaseOperand(op);
  6839. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6840. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6841. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6842. Evaluate(value, op);
  6843. Emit(Push(property.position, op.op));
  6844. ReleaseOperand(op);
  6845. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6846. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6847. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6848. Evaluate(value, op);
  6849. Emit(Push(property.position, op.op));
  6850. ReleaseOperand(op);
  6851. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6852. ELSE
  6853. HALT(200);
  6854. END;
  6855. END AddProperty;
  6856. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6857. VAR symbol: SyntaxTree.Symbol;
  6858. BEGIN
  6859. WHILE modifier # NIL DO
  6860. symbol := cellType.FindProperty(modifier.identifier);
  6861. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6862. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6863. modifier := modifier.nextModifier;
  6864. END;
  6865. END AddModifiers;
  6866. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6867. VAR last: SyntaxTree.Modifier;
  6868. BEGIN
  6869. IF to = NIL THEN
  6870. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6871. ELSE
  6872. last := to;
  6873. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6874. last := last.nextModifier;
  6875. END;
  6876. IF last.identifier # this.identifier THEN
  6877. ASSERT(last.nextModifier = NIL);
  6878. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6879. END;
  6880. END;
  6881. END AppendModifier;
  6882. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6883. BEGIN
  6884. WHILE this # NIL DO
  6885. AppendModifier(to, this);
  6886. this := this.nextModifier;
  6887. END;
  6888. END AppendModifiers;
  6889. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6890. VAR base: SyntaxTree.Type;
  6891. BEGIN
  6892. AppendModifiers(to, c.modifiers);
  6893. base := c.GetBaseValueType();
  6894. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6895. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6896. END;
  6897. END AppendCellTypeModifiers;
  6898. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6899. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6900. BEGIN
  6901. Basic.GetString(modifier.identifier, name);
  6902. PushConstString(name);
  6903. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6904. ASSERT(SemanticChecker.IsStringType(value.type));
  6905. Designate(value, op);
  6906. PushString(op, value.type);
  6907. ReleaseOperand(op);
  6908. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6909. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6910. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6911. Evaluate(value, op);
  6912. Emit(Push(modifier.position, op.op));
  6913. ReleaseOperand(op);
  6914. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6915. ELSE
  6916. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6917. END;
  6918. END AddPortProperty;
  6919. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6920. BEGIN
  6921. WHILE modifier # NIL DO
  6922. AddPortProperty(modifier, modifier.expression);
  6923. modifier := modifier.nextModifier;
  6924. END;
  6925. END AddPortProperties;
  6926. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6927. VAR op: Operand;
  6928. BEGIN
  6929. Evaluate(p, op);
  6930. Emit(Push(p.position, op.op));
  6931. ReleaseOperand(op);
  6932. IF p IS SyntaxTree.Designator THEN
  6933. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6934. END;
  6935. END PushPort;
  6936. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6937. VAR tmp: IntermediateCode.Operand;
  6938. BEGIN
  6939. actualType := actualType.resolved;
  6940. IF actualType IS SyntaxTree.StringType THEN
  6941. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6942. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6943. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6944. ELSE
  6945. tmp := op.tag;
  6946. IntermediateCode.MakeMemory(tmp,addressType);
  6947. Emit(Push(position,tmp));
  6948. END;
  6949. Emit(Push(position,op.op))
  6950. END PushString;
  6951. (* conservative check if x is potentially on the heap, excluding the module heap
  6952. required for generational garbage collector
  6953. *)
  6954. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6955. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6956. BEGIN
  6957. RETURN TRUE;
  6958. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6959. passed by reference.
  6960. pos := x.position.start;
  6961. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6962. x := x(SyntaxTree.Designator).left;
  6963. END;
  6964. RETURN x # NIL;
  6965. *)
  6966. END OnHeap;
  6967. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6968. VAR
  6969. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6970. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6971. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6972. tmp:IntermediateCode.Operand;
  6973. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6974. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6975. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6976. dest: IntermediateCode.Operand;
  6977. staticLength: LONGINT; itype: IntermediateCode.Type;
  6978. convert,isTensor: BOOLEAN;
  6979. recordType: SyntaxTree.RecordType;
  6980. baseType: SyntaxTree.Type;
  6981. flags: SET;
  6982. left: SyntaxTree.Expression;
  6983. call: SyntaxTree.Designator;
  6984. procedure: SyntaxTree.Procedure;
  6985. temporaryVariable: SyntaxTree.Variable;
  6986. dummy: IntermediateCode.Operand;
  6987. customBuiltin: SyntaxTree.CustomBuiltin;
  6988. isVarPar: ARRAY 3 OF BOOLEAN;
  6989. callsection: Sections.Section;
  6990. segmentedName: Basic.SegmentedName;
  6991. needsTrace: BOOLEAN;
  6992. n: ARRAY 256 OF CHAR;
  6993. modifier: SyntaxTree.Modifier;
  6994. previous, init: IntermediateCode.Section;
  6995. prevScope: SyntaxTree.Scope;
  6996. firstPar: LONGINT;
  6997. saved: RegisterEntry;
  6998. callingConvention: SyntaxTree.CallingConvention;
  6999. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7000. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7001. priority: IntermediateCode.Operand;
  7002. op,callop: Operand;
  7003. BEGIN
  7004. IF type = NIL THEN RETURN END;
  7005. type := type.resolved;
  7006. IF type IS SyntaxTree.PointerType THEN
  7007. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7008. END;
  7009. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7010. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7011. recordScope := type(SyntaxTree.RecordType).recordScope;
  7012. IF recordScope.bodyProcedure # NIL THEN
  7013. procedure := recordScope.bodyProcedure;
  7014. body := procedure.procedureScope.body;
  7015. Emit(Push(position,self));
  7016. IF body.isActive THEN
  7017. StaticCallOperand(callop,procedure);
  7018. Emit(Push(position,callop.op));
  7019. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7020. Convert(priority,sizeType);
  7021. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7022. END;
  7023. Emit(Push(position,priority));
  7024. ReleaseIntermediateOperand(priority);
  7025. IF backend.cooperative THEN
  7026. Emit(Push(position,self));
  7027. CallThis(position,"Activities","Create",3)
  7028. ELSE
  7029. flags := 0;
  7030. IF body.isSafe THEN
  7031. flags := 1;
  7032. END;
  7033. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7034. Emit(Push(position,self));
  7035. CallThis(position,"Objects","CreateProcess",4)
  7036. END;
  7037. ELSE
  7038. Emit(Push(position,self));
  7039. StaticCallOperand(callop,procedure);
  7040. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7041. END;
  7042. Emit(Pop(position,self));
  7043. END;
  7044. END CallBodies;
  7045. PROCEDURE PushTD(type: SyntaxTree.Type);
  7046. VAR op: IntermediateCode.Operand;
  7047. BEGIN
  7048. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7049. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7050. ELSE
  7051. IF type.resolved IS SyntaxTree.PointerType THEN
  7052. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7053. END;
  7054. op := TypeDescriptorAdr(type.resolved);
  7055. Emit(Push(position,op));
  7056. END
  7057. END PushTD;
  7058. BEGIN
  7059. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7060. dest := destination; destination := emptyOperand;
  7061. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7062. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7063. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7064. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7065. CASE x.id OF
  7066. (* ---- COPY ----- *)
  7067. |Global.Copy:
  7068. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7069. (* ---- EXCL, INCL----- *)
  7070. |Global.Excl,Global.Incl:
  7071. Evaluate(p0,s0);
  7072. Evaluate(p1,s1);
  7073. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7074. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7075. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7076. END;
  7077. ReuseCopy(res,s0.op);
  7078. ReleaseOperand(s0);
  7079. Reuse1(tmp,s1.op);
  7080. ReleaseOperand(s1);
  7081. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7082. IF x.id = Global.Excl THEN
  7083. Emit(Not(position,tmp,tmp));
  7084. Emit(And(position,res,res,tmp));
  7085. ELSE
  7086. Emit(Or(position,res,res,tmp));
  7087. END;
  7088. ReleaseIntermediateOperand(tmp);
  7089. Designate(p0,s0);
  7090. ToMemory(s0.op,s1.op.type,0);
  7091. Emit(Mov(position,s0.op,res));
  7092. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7093. (* ---- DISPOSE ----- *)
  7094. |Global.Dispose:
  7095. Designate(p0,s0);
  7096. Emit(Push(position,s0.op));
  7097. ReleaseOperand(s0);
  7098. CallThis(position,"Runtime","Dispose", 1);
  7099. (* ---- GETPROCEDURE ----- *)
  7100. |Global.GetProcedure:
  7101. Designate(p0,s0);
  7102. PushString(s0,p0.type);
  7103. Designate(p1,s1);
  7104. PushString(s1,p1.type);
  7105. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7106. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7107. ELSE PushTD(procedureType.firstParameter.type)
  7108. END;
  7109. PushTD(procedureType.returnType);
  7110. Designate(p2,s2);
  7111. Emit(Push(position,s2.op));
  7112. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7113. CallThis(position,"Modules","GetProcedure", 7);
  7114. (* ---- ASH, LSH, ROT ----- *)
  7115. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7116. Evaluate(p0,s0);
  7117. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7118. (* make unsigned arguments in order to produced a logical shift *)
  7119. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7120. convert:= TRUE;
  7121. itype := s0.op.type;
  7122. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7123. Convert(s0.op,itype);
  7124. ELSE
  7125. convert := FALSE;
  7126. END;
  7127. END;
  7128. Evaluate(p1,s1);
  7129. IF IsIntegerConstant(p1,hint) THEN
  7130. ReuseCopy(reg,s0.op);
  7131. IF hint > 0 THEN
  7132. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7133. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7134. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7135. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7136. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7137. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7138. END;
  7139. ELSIF hint < 0 THEN
  7140. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7141. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7142. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7143. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7144. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7145. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7146. END;
  7147. END;
  7148. ReleaseOperand(s0); ReleaseOperand(s1);
  7149. ELSE
  7150. exit := NewLabel();
  7151. end := NewLabel();
  7152. ReuseCopy(reg,s0.op);
  7153. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7154. Reuse1(tmp,s1.op);
  7155. Emit(Neg(position,tmp,s1.op));
  7156. Convert(tmp,s1.op.type);
  7157. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7158. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7159. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7160. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7161. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7162. END;
  7163. ReleaseIntermediateOperand(tmp);
  7164. BrL(end);
  7165. SetLabel(exit);
  7166. ReuseCopy(tmp,s1.op);
  7167. Convert(tmp,s1.op.type);
  7168. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7169. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7170. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7171. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7172. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7173. END;
  7174. ReleaseIntermediateOperand(tmp);
  7175. SetLabel(end);
  7176. ReleaseOperand(s0); ReleaseOperand(s1);
  7177. END;
  7178. InitOperand(result,ModeValue);
  7179. IF convert THEN
  7180. itype := reg.type;
  7181. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7182. Convert(reg,itype);
  7183. END;
  7184. result.op := reg;
  7185. (* ---- CAP ----- *)
  7186. |Global.Cap:
  7187. Evaluate(p0,result);
  7188. ReuseCopy(reg,result.op);
  7189. ReleaseIntermediateOperand(result.op);
  7190. ignore := NewLabel();
  7191. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7192. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7193. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7194. SetLabel(ignore);
  7195. result.op := reg;
  7196. (* ---- CHR ----- *)
  7197. |Global.Chr, Global.Chr32:
  7198. Evaluate(p0,result);
  7199. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7200. |Global.Entier, Global.EntierH:
  7201. Evaluate(p0,result);
  7202. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7203. (* ---- MIN and MAX ----- *)
  7204. |Global.Max,Global.Min:
  7205. Evaluate(p0,s0);
  7206. Evaluate(p1,s1);
  7207. Reuse2(res,s0.op,s1.op);
  7208. else := NewLabel();
  7209. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7210. ELSE BrltL(else,s1.op,s0.op) END;
  7211. Emit(Mov(position,res,s0.op));
  7212. ReleaseOperand(s0);
  7213. end := NewLabel();
  7214. BrL(end);
  7215. SetLabel(else);
  7216. Emit(MovReplace(position,res,s1.op));
  7217. SetLabel(end);
  7218. ReleaseOperand(s1);
  7219. InitOperand(result,ModeValue);
  7220. result.op := res;
  7221. (* ---- ODD ----- *)
  7222. |Global.Odd:
  7223. IF ~conditional THEN
  7224. ConditionToValue(x)
  7225. ELSE
  7226. Evaluate(p0,result);
  7227. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7228. Reuse1(res,result.op);
  7229. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7230. ReleaseIntermediateOperand(result.op);
  7231. result.op := res;
  7232. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7233. ReleaseOperand(result);
  7234. BrL(falseLabel);
  7235. END;
  7236. (* ---- ORD ----- *)
  7237. |Global.Ord, Global.Ord32:
  7238. Evaluate(p0,result);
  7239. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7240. (* ---- SHORT, LONG ----- *)
  7241. |Global.Short, Global.Long:
  7242. Evaluate(p0,result);
  7243. IF x.type IS SyntaxTree.ComplexType THEN
  7244. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7245. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7246. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7247. ELSE
  7248. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7249. END
  7250. (* ---- HALT, SYSTEM.HALT----- *)
  7251. |Global.Halt, Global.systemHalt:
  7252. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7253. EmitTrap (position, val);
  7254. (* ---- ASSERT ----- *)
  7255. |Global.Assert:
  7256. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7257. trueL := NewLabel();
  7258. falseL := NewLabel();
  7259. Condition(p0,trueL,falseL);
  7260. IF p1 = NIL THEN val := AssertTrap
  7261. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7262. END;
  7263. SetLabel(falseL);
  7264. EmitTrap(position,val);
  7265. SetLabel(trueL);
  7266. END;
  7267. (*
  7268. Emit(TrapC(result.op,val);
  7269. *)
  7270. (* ---- INC, DEC----- *)
  7271. |Global.Inc,Global.Dec:
  7272. Expression(p0); adr := result.op;
  7273. LoadValue(result,p0.type); l := result;
  7274. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7275. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7276. END;
  7277. IF x.id = Global.Inc THEN
  7278. Emit(Add(position,l.op,l.op,r.op));
  7279. ELSE
  7280. Emit(Sub(position,l.op,l.op,r.op));
  7281. END;
  7282. ReleaseOperand(l); ReleaseOperand(r);
  7283. (* ---- LEN ----- *)
  7284. |Global.Len: (* dynamic length, static length done by checker *)
  7285. Designate(p0,operand);
  7286. IF p1 = NIL THEN
  7287. InitOperand(l,ModeValue);
  7288. l.op := IntermediateCode.Immediate(sizeType,0);
  7289. ELSE
  7290. Evaluate(p1,l);
  7291. END;
  7292. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7293. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7294. Dereference(operand, p0.type.resolved, FALSE);
  7295. END;
  7296. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7297. ReleaseOperand(operand); ReleaseOperand(l);
  7298. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7299. ASSERT(p1 # NIL);
  7300. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7301. Dereference(operand,p0.type.resolved,FALSE);
  7302. END;
  7303. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7304. ReleaseOperand(operand); ReleaseOperand(l);
  7305. ELSE HALT(100);
  7306. END;
  7307. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7308. (* ---- FIRST ---- *)
  7309. |Global.First:
  7310. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7311. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7312. ELSE
  7313. Designate(p0, result)
  7314. END
  7315. (* ---- LAST ---- *)
  7316. |Global.Last:
  7317. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7318. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7319. ELSE
  7320. Designate(p0, result);
  7321. (* make sure result.op is a register *)
  7322. tmp := result.op;
  7323. ReuseCopy(result.op, result.op);
  7324. ReleaseIntermediateOperand(tmp);
  7325. (* add offset to result.op *)
  7326. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7327. END
  7328. (* ---- STEP ---- *)
  7329. |Global.Step:
  7330. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7331. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7332. ELSE
  7333. Designate(p0, result);
  7334. (* make sure result.op is a register *)
  7335. tmp := result.op;
  7336. ReuseCopy(result.op, result.op);
  7337. ReleaseIntermediateOperand(tmp);
  7338. (* add offset to result.op *)
  7339. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7340. END
  7341. (* ---- RE ---- *)
  7342. |Global.Re:
  7343. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7344. Designate(p0, result)
  7345. ELSE
  7346. Evaluate(p0, result)
  7347. END
  7348. (* ---- IM ---- *)
  7349. |Global.Im:
  7350. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7351. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7352. Designate(p0, result);
  7353. (* make sure result.op is a register *)
  7354. tmp := result.op;
  7355. ReuseCopy(result.op, result.op);
  7356. ReleaseIntermediateOperand(tmp);
  7357. (* add offset to result.op *)
  7358. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7359. (* ---- ABS ----- *)
  7360. |Global.Abs:
  7361. Evaluate(p0,operand);
  7362. type := p0.type.resolved;
  7363. InitOperand(result,ModeValue);
  7364. Reuse1a(result.op,operand.op,dest);
  7365. Emit(Abs(position,result.op,operand.op));
  7366. ReleaseOperand(operand);
  7367. (* ---- WAIT ----- *)
  7368. |Global.Wait:
  7369. Evaluate(p0,operand);
  7370. Emit(Push(position,operand.op));
  7371. ReleaseOperand(operand);
  7372. CallThis(position,"Activities","Wait", 1);
  7373. (* ---- NEW ----- *)
  7374. |Global.New:
  7375. (*! the following code is only correct for "standard" Oberon calling convention *)
  7376. IF x.type # NIL THEN
  7377. type := x.type.resolved;
  7378. firstPar := 0;
  7379. ELSE
  7380. type := p0.type.resolved;
  7381. firstPar := 1;
  7382. END;
  7383. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7384. THEN
  7385. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7386. IF backend.cooperative THEN
  7387. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7388. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7389. IF recordType.isObject THEN
  7390. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7391. IF recordType.IsActive() THEN
  7392. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7393. END;
  7394. IF recordType.IsProtected() THEN
  7395. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7396. END;
  7397. ELSE
  7398. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7399. END;
  7400. END;
  7401. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7402. CallThis(position,"Runtime","New", 1);
  7403. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7404. Emit(Result(position, pointer));
  7405. exit := NewLabel();
  7406. BreqL(exit,pointer,nil);
  7407. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7408. GetRecordTypeName (recordType,name);
  7409. IF ~recordType.isObject THEN
  7410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7411. END;
  7412. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7413. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7414. IF recordType.isObject THEN
  7415. IF recordType.IsProtected() THEN
  7416. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7417. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7418. END;
  7419. IF recordType.IsActive() THEN
  7420. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7421. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7422. END;
  7423. END;
  7424. END;
  7425. (* initialize fields *)
  7426. IF type(SyntaxTree.PointerType).isPlain THEN
  7427. size := 0;
  7428. ELSIF recordType.isObject THEN
  7429. size := BaseObjectTypeSize;
  7430. ELSE
  7431. size := BaseRecordTypeSize;
  7432. END;
  7433. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7434. (* call initializer *)
  7435. constructor := GetConstructor(recordType);
  7436. IF constructor # NIL THEN
  7437. (*! should be unified with ProcedureCallDesignator *)
  7438. Emit(Push(position,pointer));
  7439. ReleaseIntermediateOperand(pointer);
  7440. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7441. FOR i := firstPar TO x.parameters.Length()-1 DO
  7442. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7443. formalParameter := formalParameter.nextParameter;
  7444. END;
  7445. (* static call of the constructor *)
  7446. GetCodeSectionNameForSymbol(constructor,name);
  7447. ASSERT(~constructor.isInline);
  7448. IF constructor.scope.ownerModule # module.module THEN
  7449. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7450. ELSE
  7451. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7452. END;
  7453. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7454. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7455. Emit(Pop(position,pointer));
  7456. END;
  7457. (* call bodies *)
  7458. CallBodies(pointer,type);
  7459. SetLabel(exit);
  7460. needsTrace := p0.NeedsTrace();
  7461. IF needsTrace THEN ModifyAssignments(true) END;
  7462. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7463. Emit(Push(position, pointer));
  7464. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7465. Emit(Pop(position, pointer));
  7466. END;
  7467. Designate(p0,l);
  7468. IF needsTrace THEN
  7469. CallAssignPointer(l.op, pointer);
  7470. ELSE
  7471. ToMemory(l.op,addressType,0);
  7472. Emit(Mov(position,l.op,pointer));
  7473. END;
  7474. ReleaseIntermediateOperand(pointer);
  7475. ReleaseOperand(l);
  7476. IF needsTrace THEN ModifyAssignments(false) END;
  7477. ELSE (* not cooperative backend *)
  7478. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7479. IF temporaryVariable # NIL THEN
  7480. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7481. ELSE
  7482. Designate(p0,l);
  7483. END;
  7484. (* l.op contains address of pointer to record *)
  7485. Emit(Push(position,l.op)); (* address for use after syscall *)
  7486. Emit(Push(position,l.op));
  7487. ReleaseOperand(l);
  7488. (* push type descriptor *)
  7489. reg := TypeDescriptorAdr(recordType);
  7490. Emit(Push(position,reg));
  7491. ReleaseIntermediateOperand(reg);
  7492. (* push realtime flag *)
  7493. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7494. ELSE Emit(Push(position,false));
  7495. END;
  7496. CallThis(position,"Heaps","NewRec", 3);
  7497. (* check allocation success, if not successful then do not call initializers and bodies *)
  7498. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7499. Emit(Pop(position,pointer));
  7500. MakeMemory(reg,pointer,addressType,0);
  7501. ReleaseIntermediateOperand(pointer);
  7502. pointer := reg;
  7503. exit := NewLabel();
  7504. BreqL(exit,pointer,nil);
  7505. Emit(Push(position,pointer));
  7506. (* initialize fields *)
  7507. InitFields(recordType, pointer,0);
  7508. (* call initializer *)
  7509. constructor := GetConstructor(recordType);
  7510. IF constructor # NIL THEN
  7511. (*! should be unified with ProcedureCallDesignator *)
  7512. Emit(Push(position,pointer));
  7513. ReleaseIntermediateOperand(pointer);
  7514. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7515. FOR i := firstPar TO x.parameters.Length()-1 DO
  7516. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7517. formalParameter := formalParameter.nextParameter;
  7518. END;
  7519. (* static call of the constructor *)
  7520. GetCodeSectionNameForSymbol(constructor,name);
  7521. ASSERT(~constructor.isInline);
  7522. IF constructor.scope.ownerModule # module.module THEN
  7523. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7524. ELSE
  7525. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7526. END;
  7527. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7528. ELSE
  7529. ReleaseIntermediateOperand(pointer);
  7530. END;
  7531. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7532. Emit(Pop(position,pointer));
  7533. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7534. Designate(p0,l);
  7535. IF backend.writeBarriers & OnHeap(p0) THEN
  7536. SaveRegisters();ReleaseUsedRegisters(saved);
  7537. Emit(Push(position,l.op));
  7538. Emit(Push(position,pointer));
  7539. CallThis(position,"Heaps","Assign",2);
  7540. RestoreRegisters(saved);
  7541. ELSE
  7542. ToMemory(l.op,addressType,0);
  7543. Emit(Mov(position,l.op,pointer));
  7544. END;
  7545. ReleaseOperand(l);
  7546. result.tag := emptyOperand;
  7547. ELSIF (x.type # NIL) THEN
  7548. result := l; (* temporary variable is the result of NEW Type() *)
  7549. END;
  7550. (* call bodies *)
  7551. CallBodies(pointer,type);
  7552. ReleaseIntermediateOperand(pointer);
  7553. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7554. end := NewLabel();
  7555. BrL(end);
  7556. SetLabel(exit);
  7557. Designate(p0,l);
  7558. ToMemory(l.op,addressType,0);
  7559. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7560. ReleaseOperand(l);
  7561. SetLabel(end);
  7562. ELSE
  7563. SetLabel(exit);
  7564. END;
  7565. END;
  7566. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7567. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7568. IF ~backend.cooperative THEN (* simpler version *)
  7569. (*
  7570. push len0
  7571. push len1
  7572. push len2
  7573. push len_size
  7574. push len_adr
  7575. push tag
  7576. push static elements
  7577. push element size
  7578. push adr
  7579. *)
  7580. dim := 0;
  7581. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7582. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7583. parameter := x.parameters.GetExpression(i);
  7584. Evaluate(parameter,r);
  7585. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7586. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7587. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7588. END;
  7589. Emit(Push(position,r.op));
  7590. ReleaseOperand(r);
  7591. INC(dim);
  7592. END;
  7593. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7594. Emit(Mov(position, adr, sp));
  7595. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7596. Emit(Push(position, adr));
  7597. ReleaseIntermediateOperand(adr);
  7598. openDim := dim;
  7599. staticLength := 1;
  7600. IF type IS SyntaxTree.ArrayType THEN
  7601. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7602. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7603. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7604. END;
  7605. END;
  7606. IF SemanticChecker.ContainsPointer(type) THEN
  7607. tmp := TypeDescriptorAdr(type);
  7608. ELSE
  7609. tmp := nil;
  7610. END;
  7611. Emit(Push(position,tmp)); (* type descriptor *)
  7612. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7613. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7614. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7615. Designate(p0,l);
  7616. Emit(Push(position,l.op)); (* address *)
  7617. ReleaseOperand(l);
  7618. CallThis(position,"Heaps","NewArray", 6);
  7619. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7620. Emit(Add(position,sp,sp,tmp));
  7621. ELSE
  7622. dim := 0;
  7623. IntermediateCode.InitOperand(reg);
  7624. IF p1 # NIL THEN
  7625. FOR i := firstPar TO x.parameters.Length()-1 DO
  7626. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7627. parameter := x.parameters.GetExpression(i);
  7628. Evaluate(parameter,r);
  7629. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7630. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7631. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7632. END;
  7633. Emit(Push(position,r.op));
  7634. IF i=1 THEN
  7635. CopyInt(reg,r.op);
  7636. ELSE
  7637. MulInt(reg, reg, r.op);
  7638. END;
  7639. ReleaseOperand(r);
  7640. INC(dim);
  7641. END;
  7642. Convert(reg,addressType);
  7643. ELSE
  7644. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7645. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7646. END;
  7647. openDim := dim;
  7648. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7649. IF backend.cooperative THEN
  7650. size := ToMemoryUnits(system,system.SizeOf(type));
  7651. WHILE type IS SyntaxTree.ArrayType DO
  7652. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7653. END;
  7654. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7655. IF (size # 1) THEN
  7656. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7657. END;
  7658. Emit(Push(position,reg));
  7659. size := ToMemoryUnits(system,system.SizeOf(type));
  7660. IF (size # 1) THEN
  7661. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7662. END;
  7663. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7664. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7665. Emit(Push(position,reg));
  7666. ReleaseIntermediateOperand(reg);
  7667. CallThis(position,"Runtime","New", 1);
  7668. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7669. Emit(Result(position, pointer));
  7670. exit := NewLabel();
  7671. else := NewLabel();
  7672. BreqL(else,pointer,nil);
  7673. IF ~type.hasPointers THEN
  7674. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7675. ELSIF type IS SyntaxTree.RecordType THEN
  7676. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7677. ELSIF type IS SyntaxTree.ProcedureType THEN
  7678. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7679. ELSE
  7680. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7681. END;
  7682. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7683. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7684. 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))));
  7685. IF type IS SyntaxTree.RecordType THEN
  7686. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7687. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7688. ELSE
  7689. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7690. END;
  7691. i := openDim;
  7692. WHILE i > 0 DO
  7693. DEC (i);
  7694. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7695. END;
  7696. needsTrace := p0.NeedsTrace();
  7697. IF needsTrace THEN ModifyAssignments(true) END;
  7698. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7699. Emit(Push(position, pointer));
  7700. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7701. Emit(Pop(position, pointer));
  7702. END;
  7703. Designate(p0,l);
  7704. IF needsTrace THEN
  7705. CallAssignPointer(l.op, pointer);
  7706. ModifyAssignments(false);
  7707. ELSE
  7708. ToMemory(l.op,addressType,0);
  7709. Emit(Mov(position,l.op,pointer));
  7710. END;
  7711. ReleaseIntermediateOperand(pointer);
  7712. ReleaseOperand(l);
  7713. BrL(exit);
  7714. SetLabel(else);
  7715. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7716. Designate(p0,l);
  7717. IF needsTrace THEN
  7718. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7719. ELSE
  7720. ToMemory(l.op,addressType,0);
  7721. Emit(Mov(position,l.op,pointer));
  7722. END;
  7723. ReleaseOperand(l);
  7724. SetLabel(exit);
  7725. ELSE
  7726. (*! the following code is only correct for "standard" Oberon calling convention *)
  7727. IF SemanticChecker.ContainsPointer(type) THEN
  7728. IF type IS SyntaxTree.ArrayType THEN
  7729. staticLength := 1;
  7730. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7731. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7732. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7733. END;
  7734. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7735. MulInt(reg,reg,tmp);
  7736. END;
  7737. Designate(p0,l);
  7738. IF openDim > 0 THEN
  7739. Emit(Push(position,l.op)); (* address for use after syscall *)
  7740. END;
  7741. Emit(Push(position,l.op)); (* address *)
  7742. ReleaseOperand(l);
  7743. tmp := TypeDescriptorAdr(type);
  7744. Emit(Push(position,tmp)); (* type descriptor *)
  7745. ReleaseIntermediateOperand(tmp);
  7746. Emit(Push(position,reg)); (* number Elements *)
  7747. ReleaseIntermediateOperand(reg);
  7748. tmp := IntermediateCode.Immediate(addressType,dim);
  7749. Emit(Push(position,tmp)); (* dimensions *)
  7750. (* push realtime flag *)
  7751. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7752. ELSE Emit(Push(position,false));
  7753. END;
  7754. CallThis(position,"Heaps","NewArr",5)
  7755. ELSE
  7756. size := ToMemoryUnits(system,system.SizeOf(type));
  7757. IF (size # 1) THEN
  7758. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7759. (*
  7760. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7761. *)
  7762. END;
  7763. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7764. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7765. AddInt(reg, reg, tmp);
  7766. (*
  7767. Emit(Add(position,reg,reg,tmp));
  7768. *)
  7769. Designate(p0,l);
  7770. IF openDim >0 THEN
  7771. Emit(Push(position,l.op)); (* address for use after syscall *)
  7772. END;
  7773. Emit(Push(position,l.op)); (* address for syscall *)
  7774. ReleaseOperand(l); (* pointer address *)
  7775. Emit(Push(position,reg)); (* size *)
  7776. ReleaseIntermediateOperand(reg);
  7777. (* push realtime flag *)
  7778. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7779. ELSE Emit(Push(position,false));
  7780. END;
  7781. CallThis(position,"Heaps","NewSys", 3)
  7782. END;
  7783. IF openDim > 0 THEN
  7784. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7785. Emit(Pop(position,adr));
  7786. ToMemory(adr,addressType,0);
  7787. ReuseCopy(tmp,adr);
  7788. ReleaseIntermediateOperand(adr);
  7789. adr := tmp;
  7790. else := NewLabel();
  7791. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7792. i := openDim-1;
  7793. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7794. WHILE (i >= 0) DO
  7795. Emit(Pop(position,reg));
  7796. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7797. Emit(Mov(position,res,reg));
  7798. DEC(i);
  7799. END;
  7800. ReleaseIntermediateOperand(adr);
  7801. ReleaseIntermediateOperand(reg);
  7802. exit := NewLabel();
  7803. BrL(exit);
  7804. SetLabel(else);
  7805. (* else part: array could not be allocated *)
  7806. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7807. Emit(Add(position,sp,sp,tmp));
  7808. SetLabel(exit);
  7809. END;
  7810. END;
  7811. END;
  7812. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7813. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7814. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7815. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7816. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7817. callingConvention := procedureType.callingConvention;
  7818. left.SetType(procedure.type);
  7819. formalParameter := procedureType.firstParameter;
  7820. (* push array to allocate *)
  7821. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7822. formalParameter :=formalParameter.nextParameter;
  7823. (* push length array *)
  7824. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7825. (* push size *)
  7826. type := t0;
  7827. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7828. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7829. END;
  7830. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7831. Emit(Push(position,tmp));
  7832. (* *)
  7833. IF SemanticChecker.ContainsPointer(type) THEN
  7834. tmp := TypeDescriptorAdr(type);
  7835. ELSE
  7836. tmp := IntermediateCode.Immediate(addressType, 0);
  7837. END;
  7838. Emit(Push(position,tmp)); (* type descriptor *)
  7839. StaticCallOperand(result,procedure);
  7840. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7841. ReleaseOperand(result);
  7842. END;
  7843. (*
  7844. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7845. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7846. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7847. *)
  7848. ELSE
  7849. (*
  7850. push len0
  7851. push len1
  7852. push len2
  7853. push size
  7854. push len_adr
  7855. push element_size
  7856. push tag
  7857. push adr
  7858. *)
  7859. dim := 0;
  7860. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7861. isTensor := TRUE;
  7862. ELSE
  7863. isTensor := FALSE;
  7864. END;
  7865. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7866. IF ~isTensor THEN
  7867. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7868. END;
  7869. parameter := x.parameters.GetExpression(i);
  7870. Evaluate(parameter,r);
  7871. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7872. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7873. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7874. END;
  7875. Emit(Push(position,r.op));
  7876. ReleaseOperand(r);
  7877. INC(dim);
  7878. END;
  7879. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7880. Emit(Mov(position, adr, sp));
  7881. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7882. Emit(Push(position, adr));
  7883. ReleaseIntermediateOperand(adr);
  7884. openDim := dim;
  7885. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7886. IF isTensor THEN
  7887. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7888. ELSE
  7889. baseType := SemanticChecker.ArrayBase(type,openDim);
  7890. END;
  7891. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7892. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7893. IF SemanticChecker.ContainsPointer(baseType) THEN
  7894. tmp := TypeDescriptorAdr(baseType);
  7895. ELSE
  7896. tmp := nil;
  7897. END;
  7898. Emit(Push(position,tmp)); (* type descriptor *)
  7899. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7900. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7901. ELSE (* error message has already been emited *)
  7902. RETURN;
  7903. END;
  7904. Designate(p0,l);
  7905. IF isTensor THEN
  7906. Emit(Push(position,l.op)); (* address *)
  7907. ELSE
  7908. Emit(Push(position,l.tag)); (* address *)
  7909. END;
  7910. ReleaseOperand(l);
  7911. StaticCallOperand(result,procedure);
  7912. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7913. ReleaseOperand(result);
  7914. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7915. Emit(Add(position,sp,sp,tmp));
  7916. END;
  7917. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7918. THEN
  7919. IF ~backend.cellsAreObjects THEN RETURN END;
  7920. IF InCellScope(currentScope) THEN
  7921. PushSelfPointer()
  7922. ELSE
  7923. Emit(Push(position, nil));
  7924. END;
  7925. (* push temp address *)
  7926. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7927. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7928. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7929. (* l.op contains address of pointer to record *)
  7930. Emit(Push(position,l.op)); (* address for use after syscall *)
  7931. ReleaseOperand(l);
  7932. (* push type descriptor *)
  7933. reg := TypeDescriptorAdr(baseType);
  7934. Emit(Push(position,reg));
  7935. ReleaseIntermediateOperand(reg);
  7936. (* push name *)
  7937. (*Global.GetSymbolName(p0, n);*)
  7938. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7939. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7940. ELSE
  7941. Global.GetModuleName(module.module, n);
  7942. END;
  7943. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7944. (*type.typeDeclaration.GetName(n);*)
  7945. PushConstString(n);
  7946. (* push cellnet boolean *)
  7947. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7948. (* push engine boolean *)
  7949. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7950. (* allocate *)
  7951. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7952. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7953. (* l.op contains address of pointer to record *)
  7954. ToMemory(l.op,addressType,0);
  7955. (* l.op contains value of pointer to record *)
  7956. InitFields(baseType, l.op,0);
  7957. (* add capabilities *)
  7958. modifier := p0(SyntaxTree.Designator).modifiers;
  7959. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7960. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7961. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7962. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7963. END;
  7964. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7965. (*
  7966. modifier := baseType(SyntaxTree.CellType).modifiers;
  7967. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7968. modifier := p0(SyntaxTree.Designator).modifiers;
  7969. *)
  7970. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7971. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7972. (* l.op contains address of pointer to record *)
  7973. ToMemory(l.op,addressType,0);
  7974. (* l.op contains value of pointer to record *)
  7975. Emit(Push(position,l.op)); (* address for use after syscall *)
  7976. ReleaseOperand(l);
  7977. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7978. prevScope := currentScope;
  7979. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7980. previous := section;
  7981. section := init;
  7982. (* add ports *)
  7983. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7984. CloseInitializer(previous);
  7985. currentScope := prevScope;
  7986. Symbol(temporaryVariable,l);
  7987. ToMemory(l.op,addressType,0);
  7988. Emit(Push(position,l.op));
  7989. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7990. (*
  7991. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7992. IF constructor # NIL THEN
  7993. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7994. FOR i := 1 TO x.parameters.Length()-1 DO
  7995. p := x.parameters.GetExpression(i);
  7996. Global.GetSymbolName(parameter,name);
  7997. Evaluate(p, value);
  7998. ASSERT(value.type # NIL);
  7999. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8000. par := instance.AddParameter(name);
  8001. par.SetInteger(value.integer);
  8002. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8003. par := instance.AddParameter(name);
  8004. par.SetBoolean(value.boolean);
  8005. ELSE Error(x.position,NotYetImplemented)
  8006. END;
  8007. parameter := parameter.nextParameter
  8008. END;
  8009. END;
  8010. *)
  8011. (* call initializer *)
  8012. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8013. IF constructor # NIL THEN
  8014. (*! should be unified with ProcedureCallDesignator *)
  8015. IF backend.cellsAreObjects THEN
  8016. Symbol(temporaryVariable,l);
  8017. ToMemory(l.op,addressType,0);
  8018. Emit(Push(position,l.op));
  8019. ReleaseOperand(l);
  8020. END;
  8021. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8022. FOR i := firstPar TO x.parameters.Length()-1 DO
  8023. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8024. formalParameter := formalParameter.nextParameter;
  8025. END;
  8026. (* static call of the constructor *)
  8027. Global.GetSymbolSegmentedName(constructor,name);
  8028. ASSERT(~constructor.isInline);
  8029. IF constructor.scope.ownerModule # module.module THEN
  8030. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8031. ELSE
  8032. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8033. END;
  8034. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8035. (*ELSE
  8036. ReleaseIntermediateOperand(pointer);*)
  8037. END;
  8038. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8039. ToMemory(l.op, addressType, 0);
  8040. Designate(p0,s0);
  8041. ToMemory(s0.op,addressType,0);
  8042. Emit(Mov(position,s0.op,l.op));
  8043. ReleaseOperand(l);
  8044. ReleaseOperand(s0);
  8045. result.tag := emptyOperand;
  8046. (* start *)
  8047. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8048. (* push cell *)
  8049. Symbol(temporaryVariable, l);
  8050. ToMemory(l.op,addressType,0);
  8051. Emit(Push(Basic.invalidPosition,l.op));
  8052. (* push delegate *)
  8053. Emit(Push(Basic.invalidPosition,l.op));
  8054. ReleaseOperand(l);
  8055. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8056. Emit(Push(position, s1.op));
  8057. ReleaseOperand(s1);
  8058. CallThis(position,"ActiveCellsRuntime","Start",3);
  8059. END;
  8060. (*IF temporaryVariable # NIL THEN
  8061. end := NewLabel();
  8062. BrL(end);
  8063. SetLabel(exit);
  8064. Designate(p0,l);
  8065. ToMemory(l.op,addressType,0);
  8066. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8067. ReleaseOperand(l);
  8068. SetLabel(end);
  8069. ELSE
  8070. SetLabel(exit);
  8071. END;
  8072. *)
  8073. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8074. ELSE (* no pointer to record, no pointer to array *)
  8075. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8076. (* ignore new statement *)
  8077. Warning(p0.position, "cannot run on final hardware");
  8078. ELSE
  8079. HALT(200);
  8080. END;
  8081. END;
  8082. (* ---- ADDRESSOF----- *)
  8083. |Global.systemAdr:
  8084. Designate(p0,s0);
  8085. s0.mode := ModeValue;
  8086. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8087. ReleaseIntermediateOperand(s0.op);
  8088. s0.op := s0.tag;
  8089. IntermediateCode.InitOperand(s0.tag);
  8090. END;
  8091. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8092. result := s0;
  8093. (* ---- BIT ----- *)
  8094. |Global.systemBit:
  8095. Evaluate(p0,s0);
  8096. ToMemory(s0.op,addressType,0);
  8097. ReuseCopy(res,s0.op);
  8098. ReleaseOperand(s0);
  8099. Evaluate(p1,s1);
  8100. Emit(Ror(position,res,res,s1.op));
  8101. ReleaseOperand(s1);
  8102. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8103. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8104. IF ~conditional THEN
  8105. InitOperand(result,ModeValue); result.op := res;
  8106. ELSE
  8107. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8108. BrL(falseLabel);
  8109. ReleaseIntermediateOperand(res);
  8110. END;
  8111. (* --- MSK ----*)
  8112. |Global.systemMsk:
  8113. Evaluate(p0,s0);
  8114. Evaluate(p1,s1);
  8115. ReuseCopy(res,s0.op);
  8116. ReleaseOperand(s0);
  8117. Emit(And(position,res,res,s1.op));
  8118. ReleaseOperand(s1);
  8119. InitOperand(result,ModeValue);
  8120. result.op := res;
  8121. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8122. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8123. Evaluate(p0,s0);
  8124. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8125. ReleaseOperand(s0);
  8126. InitOperand(result,ModeValue);
  8127. result.op := res;
  8128. (* ---- SYSTEM.GetStackPointer ----- *)
  8129. |Global.systemGetStackPointer:
  8130. InitOperand(result,ModeValue);
  8131. result.op := sp;
  8132. (* ---- SYSTEM.GetFramePointer ----- *)
  8133. |Global.systemGetFramePointer:
  8134. InitOperand(result,ModeValue);
  8135. result.op := fp;
  8136. (* ---- SYSTEM.GetActivity ----- *)
  8137. |Global.systemGetActivity:
  8138. ASSERT(backend.cooperative);
  8139. InitOperand(result,ModeValue);
  8140. result.op := ap;
  8141. (* ---- SYSTEM.SetStackPointer ----- *)
  8142. |Global.systemSetStackPointer:
  8143. Evaluate(p0,s0); (* *)
  8144. Emit(Mov(position,sp,s0.op));
  8145. ReleaseOperand(s0);
  8146. (* ---- SYSTEM.SetFramePointer ----- *)
  8147. |Global.systemSetFramePointer:
  8148. Evaluate(p0,s0); (* *)
  8149. Emit(Mov(position,fp,s0.op));
  8150. ReleaseOperand(s0);
  8151. (* ---- SYSTEM.Activity ----- *)
  8152. |Global.systemSetActivity:
  8153. ASSERT(backend.cooperative);
  8154. Evaluate(p0,s0); (* *)
  8155. Emit(Mov(position,ap,s0.op));
  8156. ReleaseOperand(s0);
  8157. (* ---- SYSTEM.VAL ----- *)
  8158. |Global.systemVal:
  8159. Expression(p1);
  8160. s1 := result;
  8161. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8162. IF s1.mode = ModeReference THEN
  8163. (* nothing to be done if not record type, just take over new type *)
  8164. IF (type IS SyntaxTree.RecordType) THEN
  8165. ReleaseIntermediateOperand(s1.tag);
  8166. s1.tag := TypeDescriptorAdr(type);
  8167. UseIntermediateOperand(s1.tag);
  8168. END;
  8169. result := s1;
  8170. ELSE (* copy over result to different type, may not use convert *)
  8171. itype := IntermediateCode.GetType(system,type);
  8172. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8173. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8174. Emit(Mov(position,s0.op,s1.op));
  8175. ReleaseOperand(s1);
  8176. InitOperand(result,ModeValue);
  8177. result.op := s0.op;
  8178. ELSE (* different size, must convert *)
  8179. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8180. Convert(s1.op, IntermediateCode.GetType(system,type));
  8181. result := s1;
  8182. END;
  8183. END;
  8184. (* ---- SYSTEM.GET ----- *)
  8185. |Global.systemGet:
  8186. Evaluate(p0,s0); (* adr *)
  8187. Designate(p1,s1); (* variable *)
  8188. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8189. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8190. Emit(Mov(position,s1.op,s0.op));
  8191. ReleaseOperand(s1);
  8192. ReleaseOperand(s0);
  8193. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8194. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8195. Evaluate(p0,s0); (* *)
  8196. Evaluate(p1,s1); (* variable *)
  8197. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8198. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8199. (* real part *)
  8200. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8201. Emit(Mov(position,res, s1.op));
  8202. ReleaseIntermediateOperand(res);
  8203. (* imaginary part *)
  8204. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8205. Emit(Mov(position,res, s1.tag));
  8206. ReleaseIntermediateOperand(res);
  8207. ReleaseOperand(s1);
  8208. ReleaseOperand(s0);
  8209. ELSE
  8210. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8211. ReleaseOperand(s0);
  8212. Emit(Mov(position,res,s1.op));
  8213. ReleaseIntermediateOperand(res);
  8214. ReleaseOperand(s1);
  8215. END;
  8216. (* ---- SYSTEM.MOVE ----- *)
  8217. |Global.systemMove:
  8218. Evaluate(p0,s0);
  8219. Evaluate(p1,s1);
  8220. Evaluate(p2,s2);
  8221. Emit(Copy(position,s1.op,s0.op,s2.op));
  8222. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8223. (* ---- SYSTEM.NEW ----- *)
  8224. |Global.systemNew:
  8225. Designate(p0,s0);
  8226. Emit(Push(position,s0.op));
  8227. ReleaseOperand(s0);
  8228. Evaluate(p1,s1);
  8229. Emit(Push(position,s1.op));
  8230. ReleaseOperand(s1);
  8231. (* push realtime flag: false by default *)
  8232. Emit(Push(position,false));
  8233. CallThis(position,"Heaps","NewSys",3);
  8234. (* ---- SYSTEM.CALL ----- *)
  8235. |Global.systemRef:
  8236. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8237. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8238. s0.mode := ModeValue;
  8239. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8240. result := s0
  8241. (* ---- INCR ----- *)
  8242. |Global.Incr:
  8243. Designate(p0,operand);
  8244. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8245. Dereference(operand,p0.type.resolved,FALSE);
  8246. END;
  8247. ASSERT(p1 # NIL);
  8248. Evaluate(p1,l);
  8249. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8250. ReleaseOperand(operand); ReleaseOperand(l);
  8251. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8252. (* ---- SUM ----- *)
  8253. |Global.Sum: HALT(200);
  8254. (* ---- ALL ----- *)
  8255. |Global.All: HALT(200);
  8256. (* ---- CAS ----- *)
  8257. |Global.Cas:
  8258. needsTrace := p0.NeedsTrace();
  8259. IF needsTrace THEN ModifyAssignments(true) END;
  8260. Designate(p0,s0);
  8261. Evaluate(p1,s1);
  8262. Evaluate(p2,s2);
  8263. IF needsTrace THEN
  8264. Emit(Push(position, s0.op));
  8265. Emit(Push(position, s1.op));
  8266. Emit(Push(position, s2.op));
  8267. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8268. ELSE
  8269. Emit(Cas(position,s0.op,s1.op,s2.op));
  8270. END;
  8271. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8272. IF needsTrace THEN ModifyAssignments(false) END;
  8273. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8274. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8275. IF conditional THEN
  8276. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8277. BrL(falseLabel);
  8278. ReleaseIntermediateOperand(res);
  8279. END;
  8280. (* ---- DIM ----- *)
  8281. |Global.Dim:
  8282. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8283. Designate(p0,s0);
  8284. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8285. Dereference(s0,p0.type.resolved,FALSE);
  8286. END;
  8287. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8288. ReleaseOperand(s0);
  8289. (* ---- RESHAPE ----- *)
  8290. |Global.Reshape:
  8291. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8292. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8293. left.SetType(procedure.type);
  8294. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8295. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8296. END;
  8297. (* ---- SYSTEM.TYPECODE ----- *)
  8298. |Global.systemTypeCode:
  8299. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8300. IF type.resolved IS SyntaxTree.PointerType THEN
  8301. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8302. END;
  8303. result.op := TypeDescriptorAdr(type);
  8304. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8305. result.mode := ModeValue;
  8306. (* ---- SYSTEM.TRACE ----- *)
  8307. |Global.systemTrace:
  8308. SystemTrace(x.parameters, x.position);
  8309. (* ----- CONNECT ------*)
  8310. |Global.Connect:
  8311. IF backend.cellsAreObjects THEN
  8312. PushPort(p0);
  8313. PushPort(p1);
  8314. IF p2 # NIL THEN
  8315. Evaluate(p2, s2);
  8316. Emit(Push(p2.position, s2.op));
  8317. ReleaseOperand(s2);
  8318. ELSE
  8319. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8320. END;
  8321. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8322. ELSE
  8323. Warning(x.position, "cannot run on final hardware");
  8324. END;
  8325. (* ----- DELEGATE ------*)
  8326. |Global.Delegate:
  8327. IF backend.cellsAreObjects THEN
  8328. PushPort(p0);
  8329. PushPort(p1);
  8330. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8331. ELSE
  8332. Warning(x.position, "cannot run on final hardware");
  8333. END;
  8334. (* ----- SEND ------*)
  8335. |Global.Send:
  8336. Evaluate(p0,s0);
  8337. Evaluate(p1,s1);
  8338. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8339. Emit(Push(position,s0.op));
  8340. Emit(Push(position,s1.op));
  8341. (*
  8342. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8343. *)
  8344. IF ~backend.cellsAreObjects THEN
  8345. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8346. END;
  8347. ReleaseOperand(s0);
  8348. ReleaseOperand(s1);
  8349. IF backend.cellsAreObjects THEN
  8350. CallThis(position,"ActiveCellsRuntime","Send",2);
  8351. ELSE
  8352. CallThis(position,ChannelModuleName,"Send",2);
  8353. END;
  8354. (* ----- RECEIVE ------*)
  8355. |Global.Receive:
  8356. Evaluate(p0,s0);
  8357. Emit(Push(position,s0.op));
  8358. Designate(p1,s1);
  8359. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8360. Emit(Push(position,s1.op));
  8361. IF p2 # NIL THEN
  8362. Designate(p2,s2);
  8363. Emit(Push(position,s2.op));
  8364. END;
  8365. (*
  8366. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8367. *)
  8368. IF ~backend.cellsAreObjects THEN
  8369. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8370. END;
  8371. ReleaseOperand(s0);
  8372. ReleaseOperand(s1);
  8373. ReleaseOperand(s2);
  8374. IF backend.cellsAreObjects THEN
  8375. IF p2 = NIL THEN
  8376. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8377. ELSE
  8378. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8379. END;
  8380. ELSE
  8381. IF p2 = NIL THEN
  8382. CallThis(position,ChannelModuleName,"Receive",2)
  8383. ELSE
  8384. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8385. END;
  8386. END;
  8387. | Global.systemSpecial:
  8388. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8389. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8390. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8391. (* determine if parameters are of the VAR kind *)
  8392. ASSERT(x.parameters.Length() <= 3);
  8393. formalParameter := procedureType.firstParameter;
  8394. FOR i := 0 TO x.parameters.Length() - 1 DO
  8395. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8396. formalParameter := formalParameter.nextParameter
  8397. END;
  8398. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8399. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8400. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8401. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8402. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8403. IF procedureType.returnType # NIL THEN
  8404. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8405. Emit(Result(position, res));
  8406. (*InitOperand(result,ModeValue);
  8407. result.op := res;
  8408. *)
  8409. IF ~conditional THEN
  8410. InitOperand(result,ModeValue); result.op := res;
  8411. ELSE
  8412. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8413. BrL(falseLabel);
  8414. ReleaseIntermediateOperand(res);
  8415. END;
  8416. END
  8417. ELSE (* function not yet implemented *)
  8418. Error(position,"not yet implemented");
  8419. END;
  8420. destination := dest;
  8421. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8422. END VisitBuiltinCallDesignator;
  8423. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8424. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8425. BEGIN
  8426. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8427. dest := destination; destination := emptyOperand;
  8428. Expression(x.left);
  8429. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8430. ELSIF isUnchecked THEN (* no check *)
  8431. ELSE
  8432. trueL := NewLabel();
  8433. falseL := NewLabel();
  8434. IF IsPointerToRecord(x.left.type,recordType) THEN
  8435. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8436. Emit(Mov(position,tag, result.op));
  8437. IF result.mode # ModeValue THEN
  8438. ptr := tag;
  8439. IntermediateCode.MakeMemory(ptr,addressType);
  8440. Emit(Mov(position,tag, ptr));
  8441. END;
  8442. IF ~backend.cooperative THEN
  8443. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8444. END;
  8445. IntermediateCode.MakeMemory(tag,addressType);
  8446. ELSE
  8447. tag := result.tag;
  8448. UseIntermediateOperand(tag);
  8449. END;
  8450. TypeTest(tag,x.type,trueL,falseL);
  8451. ReleaseIntermediateOperand(tag);
  8452. SetLabel(falseL);
  8453. EmitTrap(position,TypeCheckTrap);
  8454. SetLabel(trueL);
  8455. END;
  8456. destination := dest;
  8457. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8458. END VisitTypeGuardDesignator;
  8459. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8460. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8461. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8462. VAR label: Label; pc: LONGINT;
  8463. BEGIN
  8464. IF backend.cooperative & ~isUnchecked THEN
  8465. pc := section.pc;
  8466. label := NewLabel();
  8467. BrneL(label, operand.op, nil);
  8468. EmitTrap(position, NilPointerTrap);
  8469. SetLabel(label);
  8470. INC(statCoopNilCheck, section.pc - pc);
  8471. END;
  8472. END NilCheck;
  8473. BEGIN
  8474. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8475. ReuseCopy(dereferenced,operand.op);
  8476. ReleaseOperand(operand);
  8477. operand.mode := ModeReference;
  8478. operand.op := dereferenced;
  8479. operand.tag := dereferenced;
  8480. UseIntermediateOperand(operand.tag);
  8481. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8482. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8483. ReleaseIntermediateOperand(operand.tag);
  8484. operand.tag := TypeDescriptorAdr(type);
  8485. ELSE
  8486. IF ~backend.cooperative THEN
  8487. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8488. END;
  8489. IntermediateCode.MakeMemory(operand.tag,addressType);
  8490. END;
  8491. NilCheck(operand.op);
  8492. ELSIF type IS SyntaxTree.ArrayType THEN
  8493. IF isUnsafe THEN
  8494. NilCheck(operand.op);
  8495. ReleaseIntermediateOperand(operand.tag);
  8496. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8497. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8498. ELSE
  8499. operand.tag := emptyOperand;
  8500. END;
  8501. ELSE
  8502. NilCheck(operand.op);
  8503. IF backend.cooperative THEN
  8504. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8505. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8506. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8507. ELSE
  8508. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8509. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8510. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8511. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8512. END;
  8513. END;
  8514. ELSIF type IS SyntaxTree.MathArrayType THEN
  8515. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8516. IntermediateCode.MakeMemory(operand.op,addressType);
  8517. ELSE HALT(100);
  8518. END;
  8519. END Dereference;
  8520. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8521. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8522. BEGIN
  8523. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8524. dest := destination; destination := emptyOperand;
  8525. Evaluate(x.left,d);
  8526. type := x.type.resolved;
  8527. prevIsUnchecked := isUnchecked;
  8528. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8529. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8530. END;
  8531. Dereference(d,type,IsUnsafePointer(x.left.type));
  8532. isUnchecked := prevIsUnchecked;
  8533. result := d;
  8534. 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
  8535. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8536. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8537. END;
  8538. END;
  8539. destination := dest;
  8540. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8541. END VisitDereferenceDesignator;
  8542. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8543. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8544. BEGIN
  8545. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8546. dest := destination; destination := emptyOperand;
  8547. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8548. tag := result.op;
  8549. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8550. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8551. StaticCallOperand(result,procedure.super);
  8552. ReleaseIntermediateOperand(result.tag);
  8553. UseIntermediateOperand(tag); (* necessary ? *)
  8554. result.tag := tag;
  8555. destination := dest;
  8556. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8557. END VisitSupercallDesignator;
  8558. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8559. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8560. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8561. name: Basic.SegmentedName;
  8562. procedure: SyntaxTree.Procedure;
  8563. procedureType: SyntaxTree.ProcedureType;
  8564. BEGIN
  8565. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8566. dest := destination; destination := emptyOperand;
  8567. scope := currentScope;
  8568. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8569. scope := scope.outerScope;
  8570. END;
  8571. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8572. moduleSection := meta.ModuleSection();
  8573. IF backend.cooperative THEN
  8574. moduleOffset := 0;
  8575. ELSE
  8576. moduleOffset := moduleSection.pc;
  8577. END;
  8578. result.mode := ModeValue;
  8579. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8580. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8581. result.mode := ModeValue;
  8582. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8583. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8584. ELSE
  8585. GetBaseRegister(basereg,currentScope,scope);
  8586. InitOperand(result,ModeReference);
  8587. result.op := basereg;
  8588. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8589. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8590. parametersSize := ProcParametersSize(procedure);
  8591. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8592. IF backend.cooperative THEN
  8593. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8594. END;
  8595. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8596. MakeMemory(result.op, result.op, addressType, 0);
  8597. END;
  8598. (* tag must be loaded when dereferencing SELF pointer *)
  8599. END;
  8600. destination := dest;
  8601. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8602. END VisitSelfDesignator;
  8603. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8604. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8605. BEGIN
  8606. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8607. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8608. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8609. parameter := procedureType.returnParameter;
  8610. IF currentIsInline THEN
  8611. map := currentMapper.Get(NIL);
  8612. IF map # NIL THEN
  8613. Designate(map.to, result);
  8614. ELSE
  8615. HALT(200);
  8616. END;
  8617. RETURN;
  8618. END;
  8619. VisitParameter(parameter);
  8620. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8621. END VisitResultDesignator;
  8622. (** values *)
  8623. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8624. BEGIN
  8625. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8626. IF conditional THEN
  8627. IF x.value THEN BrL(trueLabel)
  8628. ELSE BrL(falseLabel)
  8629. END;
  8630. ELSE
  8631. InitOperand(result,ModeValue);
  8632. IF x.value THEN result.op := true ELSE result.op := false END;
  8633. END;
  8634. END VisitBooleanValue;
  8635. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8636. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8637. BEGIN
  8638. Global.GetModuleSegmentedName(module.module, name);
  8639. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8640. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8641. RETURN section
  8642. END GetDataSection;
  8643. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8644. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8645. BEGIN
  8646. type := vop.type;
  8647. data := GetDataSection();
  8648. pc := EnterImmediate(data,vop);
  8649. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8650. IntermediateCode.MakeMemory(vop, type);
  8651. END GetImmediateMem;
  8652. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8653. BEGIN
  8654. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8655. InitOperand(result,ModeValue);
  8656. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8657. IF ~supportedImmediate(result.op) &~inData THEN
  8658. GetImmediateMem(result.op)
  8659. END;
  8660. END VisitIntegerValue;
  8661. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8662. BEGIN
  8663. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8664. InitOperand(result,ModeValue);
  8665. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8666. END VisitCharacterValue;
  8667. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8668. BEGIN
  8669. IF Trace THEN TraceEnter("VisitSetValue") END;
  8670. InitOperand(result,ModeValue);
  8671. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8672. END VisitSetValue;
  8673. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8674. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8675. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8676. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8677. BEGIN
  8678. numberElements := x.elements.Length();
  8679. FOR i := 0 TO numberElements-1 DO
  8680. expression := x.elements.GetExpression(i);
  8681. IF expression IS SyntaxTree.MathArrayExpression THEN
  8682. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8683. ELSE
  8684. inData := TRUE;
  8685. Evaluate(expression,op);
  8686. irv.Emit(Data(position,op.op));
  8687. inData := FALSE;
  8688. ReleaseOperand(op);
  8689. END;
  8690. END;
  8691. END RecursiveData;
  8692. BEGIN
  8693. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8694. IF ~TryConstantDeclaration() THEN
  8695. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8696. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8697. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8698. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8699. ELSE
  8700. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8701. END;
  8702. RecursiveData(x.array);
  8703. InitOperand(result,ModeReference);
  8704. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8705. END
  8706. END VisitMathArrayValue;
  8707. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8708. VAR constant: Sections.Section;
  8709. BEGIN
  8710. IF constantDeclaration = NIL THEN
  8711. RETURN FALSE
  8712. ELSE
  8713. (* Is a constant in this module: did we generate it already? *)
  8714. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8715. IF constant # NIL THEN
  8716. InitOperand(result,ModeReference);
  8717. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8718. RETURN TRUE;
  8719. END;
  8720. END;
  8721. RETURN FALSE
  8722. END TryConstantDeclaration;
  8723. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8724. BEGIN
  8725. constantDeclaration := x;
  8726. x.value.resolved.Accept(SELF);
  8727. END VisitConstant;
  8728. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8729. BEGIN
  8730. IF Trace THEN TraceEnter("VisitRealValue") END;
  8731. InitOperand(result,ModeValue);
  8732. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8733. END VisitRealValue;
  8734. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8735. VAR
  8736. componentType: SyntaxTree.Type;
  8737. BEGIN
  8738. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8739. ASSERT(x.type IS SyntaxTree.ComplexType);
  8740. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8741. InitOperand(result,ModeValue);
  8742. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8743. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8744. END VisitComplexValue;
  8745. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8746. VAR i: LONGINT; name: Basic.SegmentedName;
  8747. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8748. BEGIN
  8749. IF Trace THEN TraceEnter("VisitStringValue") END;
  8750. IF ~TryConstantDeclaration() THEN
  8751. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8752. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8753. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8754. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8755. ELSE
  8756. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8757. END;
  8758. FOR i := 0 TO x.length-1 DO
  8759. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8760. irv.Emit(Data(position,op));
  8761. END;
  8762. InitOperand(result,ModeReference);
  8763. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8764. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8765. END
  8766. END VisitStringValue;
  8767. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8768. BEGIN
  8769. IF Trace THEN TraceEnter("VisitNilValue") END;
  8770. InitOperand(result,ModeValue);
  8771. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8772. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8773. END VisitNilValue;
  8774. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8775. BEGIN
  8776. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8777. InitOperand(result,ModeValue);
  8778. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8779. END VisitEnumerationValue;
  8780. (** symbols *)
  8781. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8782. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8783. END VisitImport;
  8784. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8785. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8786. BEGIN
  8787. IF scope # baseScope THEN
  8788. (* left := [fp+8] *)
  8789. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8790. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8791. ReuseCopy(left,right);
  8792. ReleaseIntermediateOperand(right);
  8793. scope := scope.outerScope; DEC(level);
  8794. (* { left := [left+8] } *)
  8795. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8796. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8797. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8798. Emit(Mov(position,left,right));
  8799. scope := scope.outerScope; DEC(level);
  8800. END;
  8801. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8802. result := left;
  8803. ELSE
  8804. result := fp;
  8805. END;
  8806. END GetBaseRegister;
  8807. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8808. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8809. BEGIN
  8810. IF Trace THEN TraceEnter("VisitVariable"); END;
  8811. type := x.type.resolved;
  8812. IF (x.useRegister) THEN
  8813. InitOperand(result, ModeValue);
  8814. IF x.registerNumber < 0 THEN
  8815. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8816. reg := x.registerNumber;
  8817. ELSE
  8818. reg := registerUsageCount.Map(x.registerNumber);
  8819. UseRegister(reg);
  8820. END;
  8821. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8822. ELSIF x.externalName # NIL THEN
  8823. InitOperand(result,ModeReference);
  8824. Basic.ToSegmentedName(x.externalName^, name);
  8825. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8826. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8827. InitOperand(result,ModeReference);
  8828. GetBaseRegister(result.op,currentScope,x.scope);
  8829. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8830. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8831. InitOperand(result,ModeReference);
  8832. GetCodeSectionNameForSymbol(x,name);
  8833. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8834. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8835. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8836. InitOperand(result,ModeReference);
  8837. GetCodeSectionNameForSymbol(x,name);
  8838. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8839. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8840. ELSE (* field, left designator must have been emitted *)
  8841. ASSERT(result.mode = ModeReference);
  8842. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8843. ReuseCopy(temp,result.op);
  8844. ReleaseIntermediateOperand(result.op);
  8845. result.op := temp;
  8846. END;
  8847. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8848. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8849. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8850. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8851. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8852. END;
  8853. END;
  8854. END;
  8855. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8856. ValueToCondition(result);
  8857. ELSIF type IS SyntaxTree.ProcedureType THEN
  8858. ReleaseIntermediateOperand(result.tag);
  8859. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8860. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8861. UseIntermediateOperand(result.tag);
  8862. ELSE
  8863. result.tag := nil; (* nil *)
  8864. END;
  8865. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8866. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8867. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8868. ReleaseIntermediateOperand(result.tag);
  8869. Global.GetSymbolSegmentedName(x,name);
  8870. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8871. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8872. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8873. ELSE
  8874. END;
  8875. ELSE
  8876. ReleaseIntermediateOperand(result.tag);
  8877. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8878. END;
  8879. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8880. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8881. ReleaseIntermediateOperand(result.tag);
  8882. result.tag := result.op;
  8883. UseIntermediateOperand(result.tag);
  8884. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8885. IntermediateCode.MakeMemory(result.op,addressType);
  8886. END;
  8887. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8888. ReleaseIntermediateOperand(result.tag);
  8889. result.tag := TypeDescriptorAdr(type);
  8890. UseIntermediateOperand(result.tag);
  8891. (* tag for pointer type computed not here but during dereferencing *)
  8892. END;
  8893. IF Trace THEN TraceExit("VisitVariable") END;
  8894. END VisitVariable;
  8895. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8896. BEGIN
  8897. VisitVariable(property);
  8898. END VisitProperty;
  8899. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8900. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8901. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8902. BEGIN
  8903. type := x.type.resolved;
  8904. IF Trace THEN TraceEnter("VisitParameter") END;
  8905. IF x.ownerType IS SyntaxTree.CellType THEN
  8906. ptype := x.type.resolved;
  8907. IF backend.cellsAreObjects THEN
  8908. ASSERT(result.mode = ModeReference);
  8909. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8910. ReuseCopy(temp,result.op);
  8911. ReleaseIntermediateOperand(result.op);
  8912. result.op := temp;
  8913. END;
  8914. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8915. RETURN;
  8916. ELSE
  8917. InitOperand(result,ModeReference);
  8918. GetCodeSectionNameForSymbol(x,name);
  8919. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8920. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8921. RETURN;
  8922. END;
  8923. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8924. InitOperand(result,ModeReference);
  8925. GetCodeSectionNameForSymbol(x,name);
  8926. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8927. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8928. RETURN
  8929. ELSE
  8930. GetBaseRegister(basereg,currentScope,x.scope);
  8931. InitOperand(result,ModeReference);
  8932. result.op := basereg;
  8933. END;
  8934. IF IsOpenArray(type) THEN
  8935. result.tag := basereg;
  8936. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8937. IntermediateCode.MakeMemory(result.op,addressType);
  8938. IF Global.IsOberonProcedure(x.ownerType) THEN
  8939. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8940. UseIntermediateOperand(result.tag);
  8941. ELSE
  8942. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8943. END;
  8944. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8945. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8946. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8947. ELSIF IsStaticArray(type) THEN
  8948. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8949. IntermediateCode.MakeMemory(result.op,addressType);
  8950. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8951. ELSIF type IS SyntaxTree.MathArrayType THEN
  8952. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8953. WITH type: SyntaxTree.MathArrayType DO
  8954. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8955. IF type.form = SyntaxTree.Tensor THEN
  8956. ELSIF type.form = SyntaxTree.Open THEN
  8957. result.tag := result.op;
  8958. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8959. IntermediateCode.MakeMemory(result.op,addressType);
  8960. UseIntermediateOperand(result.tag);
  8961. ELSIF type.form = SyntaxTree.Static THEN
  8962. IF x.kind = SyntaxTree.ConstParameter THEN
  8963. IntermediateCode.MakeMemory(result.op,addressType);
  8964. END;
  8965. ELSE HALT(100)
  8966. END;
  8967. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8968. IF type.form = SyntaxTree.Tensor THEN
  8969. ToMemory(result.op,addressType,0);
  8970. ELSIF type.form = SyntaxTree.Open THEN
  8971. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8972. ReuseCopy(result.tag, mem);
  8973. ReleaseIntermediateOperand(mem);
  8974. ReleaseIntermediateOperand(result.op);
  8975. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8976. ELSIF type.form = SyntaxTree.Static THEN
  8977. IntermediateCode.MakeMemory(result.op,addressType);
  8978. ELSE HALT(100)
  8979. END;
  8980. ELSE HALT(100)
  8981. END;
  8982. END;
  8983. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8984. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8985. IntermediateCode.MakeMemory(result.op,addressType);
  8986. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8987. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8988. END;
  8989. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8990. ValueToCondition(result);
  8991. ELSIF type IS SyntaxTree.ProcedureType THEN
  8992. ReleaseIntermediateOperand(result.tag);
  8993. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8994. IF x.kind = SyntaxTree.VarParameter THEN
  8995. ReuseCopy(result.tag,result.op);
  8996. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8997. IntermediateCode.MakeMemory(result.tag,addressType);
  8998. ELSE
  8999. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9000. UseIntermediateOperand(result.tag);
  9001. END;
  9002. ELSE
  9003. result.tag := nil;
  9004. END;
  9005. (* tag for pointer type computed not here but during dereferencing *)
  9006. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9007. ReleaseIntermediateOperand(result.tag);
  9008. result.tag := basereg;
  9009. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9010. IntermediateCode.MakeMemory(result.tag,addressType);
  9011. UseIntermediateOperand(result.tag);
  9012. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9013. ReleaseIntermediateOperand(result.tag);
  9014. result.tag := TypeDescriptorAdr(type);
  9015. UseIntermediateOperand(result.tag);
  9016. END;
  9017. IF Trace THEN TraceExit("VisitParameter") END;
  9018. END VisitParameter;
  9019. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9020. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9021. BEGIN
  9022. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9023. (* left.p: left already emitted *)
  9024. tag := result.op; (* value of pointer to left *)
  9025. (* get type desc *)
  9026. tmp := result.tag;
  9027. IntermediateCode.MakeMemory(tmp,addressType);
  9028. (* get method adr *)
  9029. Reuse1(reg,tmp);
  9030. ReleaseIntermediateOperand(tmp);
  9031. IF backend.cooperative THEN
  9032. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9033. WHILE recordType.baseType # NIL DO
  9034. recordType := recordType.GetBaseRecord ();
  9035. END;
  9036. GetRecordTypeName (recordType,name);
  9037. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9038. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9039. offset := 0;
  9040. ELSE
  9041. offset := 2;
  9042. END;
  9043. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9044. ELSIF meta.simple THEN
  9045. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9046. ELSE
  9047. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9048. END;
  9049. InitOperand(operand,ModeReference);
  9050. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9051. operand.op := reg;
  9052. operand.tag := tag;
  9053. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9054. END DynamicCallOperand;
  9055. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9056. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9057. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9058. BEGIN
  9059. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9060. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9061. tag := operand.op;
  9062. ReleaseIntermediateOperand(operand.tag);
  9063. ELSE tag := nil
  9064. END;
  9065. IF x.isInline THEN
  9066. sectionType := Sections.InlineCodeSection;
  9067. ELSE
  9068. sectionType := Sections.CodeSection;
  9069. END;
  9070. IF x.externalName # NIL THEN
  9071. Basic.ToSegmentedName(x.externalName^, name);
  9072. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9073. ELSE
  9074. GetCodeSectionNameForSymbol(x, name);
  9075. IF (x.scope.ownerModule = module.module) THEN
  9076. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9077. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9078. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9079. IF source.pc = 0 THEN (* no code yet *)
  9080. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9081. END;
  9082. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9083. bits := x.procedureScope.body.code.inlineCode;
  9084. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9085. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9086. binary.CopyBits(bits, 0, bits.GetSize());
  9087. source.SetResolved(binary);
  9088. ELSE
  9089. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9090. END;
  9091. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9092. END;
  9093. InitOperand(operand,ModeValue);
  9094. operand.op := reg;
  9095. operand.tag := tag;
  9096. IF Trace THEN TraceExit("StaticCallOperand") END;
  9097. END StaticCallOperand;
  9098. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9099. (* handle expressions of the form designator.procedure or procedure *)
  9100. BEGIN
  9101. IF Trace THEN TraceEnter("VisitProcedure") END;
  9102. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9103. DynamicCallOperand(result,x);
  9104. ELSIF x.isInline THEN
  9105. StaticCallOperand(result,x);
  9106. ELSE
  9107. StaticCallOperand(result,x);
  9108. END;
  9109. IF Trace THEN TraceExit("VisitProcedure") END;
  9110. END VisitProcedure;
  9111. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9112. BEGIN
  9113. VisitProcedure(x);
  9114. END VisitOperator;
  9115. (** statements *)
  9116. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9117. BEGIN
  9118. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9119. Expression(x.call);
  9120. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9121. ReleaseOperand(result)
  9122. END;
  9123. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9124. END VisitProcedureCallStatement;
  9125. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9126. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9127. leftBase, rightBase: SyntaxTree.Type;
  9128. procedureName,s: SyntaxTree.IdentifierString;
  9129. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9130. size: LONGINT; rightKind: LONGINT;
  9131. dummy: IntermediateCode.Operand;
  9132. CONST moduleName = "FoxArrayBase";
  9133. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9134. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9135. BEGIN
  9136. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9137. IF base IS SyntaxTree.MathArrayType THEN
  9138. base := OpenArray(base(SyntaxTree.MathArrayType));
  9139. END;
  9140. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9141. result.SetArrayBase(base);
  9142. RETURN result
  9143. END OpenArray;
  9144. BEGIN
  9145. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9146. SaveRegisters();ReleaseUsedRegisters(saved);
  9147. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9148. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9149. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9150. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9151. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9152. IF leftType.form = SyntaxTree.Tensor THEN
  9153. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9154. ELSIF leftType.form = SyntaxTree.Open THEN
  9155. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9156. ELSIF leftType.form = SyntaxTree.Static THEN
  9157. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9158. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9159. END;
  9160. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9161. IF procedure = NIL THEN
  9162. s := "Instruction not supported on target, emulation procedure ";
  9163. Strings.Append(s,moduleName);
  9164. Strings.Append(s,".");
  9165. Strings.Append(s,procedureName);
  9166. Strings.Append(s," not present");
  9167. Error(position,s);
  9168. ELSE
  9169. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9170. parameter.SetType(leftType);
  9171. parameter.SetAccess(SyntaxTree.Internal);
  9172. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9173. parameter.SetKind(rightKind);
  9174. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9175. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9176. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9177. StaticCallOperand(result,procedure);
  9178. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9179. ReleaseOperand(result);
  9180. END;
  9181. RestoreRegisters(saved);
  9182. END;
  9183. END AssignMathArray;
  9184. VAR modifyAssignmentCounter := 0: LONGINT;
  9185. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9186. VAR processor,mem,dst: IntermediateCode.Operand;
  9187. BEGIN
  9188. IF value.intValue = true.intValue THEN
  9189. INC(modifyAssignmentCounter);
  9190. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9191. modifyAssignmentsPC := section.pc;
  9192. ELSE
  9193. DEC(modifyAssignmentCounter);
  9194. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9195. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9196. END;
  9197. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9198. dst := NewRegisterOperand (addressType);
  9199. Emit(Mov(position,dst, processor));
  9200. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9201. Emit(Mov(position,mem, value));
  9202. ReleaseIntermediateOperand(dst);
  9203. END ModifyAssignments;
  9204. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9205. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9206. BEGIN
  9207. type := left.type.resolved;
  9208. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9209. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9210. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9211. IF procedureType.returnParameter = parameter THEN
  9212. (* this is the only case where the destination can be dynamically smaller than the source
  9213. in all other cases the dynamic size has to be taken
  9214. *)
  9215. IF backend.cooperative THEN
  9216. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9217. ELSE
  9218. MakeMemory(mem, tag, addressType, 0);
  9219. END;
  9220. RETURN mem;
  9221. END;
  9222. END;
  9223. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9224. END CopySize;
  9225. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9226. VAR
  9227. leftO, rightO: Operand;
  9228. arg,mem, sizeOp: IntermediateCode.Operand;
  9229. leftType, rightType, componentType, base: SyntaxTree.Type;
  9230. size: LONGINT;
  9231. parameters: SyntaxTree.ExpressionList;
  9232. procedure: SyntaxTree.Procedure;
  9233. call: SyntaxTree.ProcedureCallDesignator;
  9234. designator: SyntaxTree.Designator;
  9235. saved: RegisterEntry;
  9236. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9237. VAR procedureType: SyntaxTree.ProcedureType;
  9238. BEGIN
  9239. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9240. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9241. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9242. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9243. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9244. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9245. IF right.id = Global.Reshape THEN RETURN TRUE
  9246. END;
  9247. END;
  9248. END;
  9249. END;
  9250. RETURN FALSE
  9251. END CanPassAsResultParameter;
  9252. BEGIN
  9253. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9254. leftType := left.type.resolved; rightType:= right.type.resolved;
  9255. IF backend.cooperative & left.NeedsTrace() THEN
  9256. ModifyAssignments(true);
  9257. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9258. Designate(right, rightO);
  9259. Designate(left, leftO);
  9260. ASSERT(leftO.mode = ModeReference);
  9261. TransferToRegister(leftO.op, leftO.op);
  9262. TransferToRegister(rightO.op, rightO.op);
  9263. Emit(Push(position, leftO.op));
  9264. Emit(Push(position, rightO.op));
  9265. CallAssignMethod(leftO.op, rightO.op, left.type);
  9266. Emit(Pop(position, rightO.op));
  9267. Emit(Pop(position, leftO.op));
  9268. sizeOp := CopySize(left, leftO.tag);
  9269. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9270. ReleaseIntermediateOperand(sizeOp);
  9271. ReleaseOperand(leftO);
  9272. ReleaseOperand(rightO);
  9273. ELSE
  9274. Evaluate(right,rightO);
  9275. Designate(left,leftO);
  9276. ASSERT(leftO.mode = ModeReference);
  9277. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9278. (* copy procedure address first *)
  9279. MakeMemory(mem,leftO.op,addressType,0);
  9280. Emit(Mov(position,mem,rightO.op));
  9281. ReleaseIntermediateOperand(mem);
  9282. (* copy pointer address *)
  9283. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9284. CallAssignPointer(leftO.tag, rightO.tag);
  9285. ELSE
  9286. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9287. CallAssignPointer(leftO.op, rightO.op);
  9288. END;
  9289. ReleaseOperand(leftO);
  9290. ReleaseOperand(rightO);
  9291. END;
  9292. ModifyAssignments(false);
  9293. RETURN;
  9294. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9295. SaveRegisters();ReleaseUsedRegisters(saved);
  9296. IF SemanticChecker.IsPointerType(leftType) THEN
  9297. Evaluate(right,rightO);
  9298. Designate(left,leftO);
  9299. Emit(Push(position,leftO.op));
  9300. ReleaseOperand(leftO);
  9301. Emit(Push(position,rightO.op));
  9302. ReleaseOperand(rightO);
  9303. CallThis(position,"Heaps","Assign",2);
  9304. ELSIF leftType.IsRecordType() THEN
  9305. Designate(right,rightO);
  9306. Designate(left,leftO);
  9307. Emit(Push(position,leftO.op));
  9308. Emit(Push(position,leftO.tag)); (* type desc *)
  9309. ReleaseOperand(leftO);
  9310. Emit(Push(position,rightO.op));
  9311. ReleaseOperand(rightO);
  9312. CallThis(position,"Heaps","AssignRecord",3);
  9313. ELSIF IsStaticArray(leftType) THEN
  9314. size := StaticArrayNumElements(leftType);
  9315. base := StaticArrayBaseType(leftType);
  9316. Designate(right,rightO);
  9317. Designate(left,leftO);
  9318. Emit(Push(position,leftO.op));
  9319. ReleaseOperand(leftO);
  9320. arg := TypeDescriptorAdr(base);
  9321. Emit(Push(position,arg));
  9322. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9323. Emit(Push(position,rightO.op));
  9324. ReleaseOperand(rightO);
  9325. CallThis(position,"Heaps","AssignArray",4);
  9326. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9327. size := StaticMathArrayNumElements(leftType);
  9328. base := StaticMathArrayBaseType(leftType);
  9329. Designate(right,rightO);
  9330. Designate(left,leftO);
  9331. Emit(Push(position,leftO.op));
  9332. ReleaseOperand(leftO);
  9333. arg := TypeDescriptorAdr(base);
  9334. Emit(Push(position,arg));
  9335. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9336. Emit(Push(position,rightO.op));
  9337. ReleaseOperand(rightO);
  9338. CallThis(position,"Heaps","AssignArray",4);
  9339. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9340. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9341. Evaluate(right,rightO);
  9342. Designate(left,leftO);
  9343. MakeMemory(mem,leftO.op,addressType,0);
  9344. Emit(Mov(position,mem,rightO.op));
  9345. ReleaseIntermediateOperand(mem);
  9346. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9347. Emit (Push(position, leftO.tag));
  9348. ReleaseOperand(leftO);
  9349. Emit (Push(position, rightO.tag));
  9350. ReleaseOperand(rightO);
  9351. CallThis(position,"Heaps","Assign", 2);
  9352. ELSE HALT(100); (* missing ? *)
  9353. END;
  9354. RestoreRegisters(saved);
  9355. RETURN;
  9356. END;
  9357. IF CanPassAsResultParameter(right) THEN
  9358. procedureResultDesignator := left(SyntaxTree.Designator);
  9359. Expression(right);
  9360. procedureResultDesignator := NIL;
  9361. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9362. (* left <-- ALIAS OF right: zerocopy *)
  9363. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9364. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9365. designator.SetType(procedure.type);
  9366. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9367. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9368. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9369. END;
  9370. ELSIF leftType IS SyntaxTree.RangeType THEN
  9371. (* LHS is of array range type *)
  9372. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9373. Evaluate(right, rightO);
  9374. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9375. (* first *)
  9376. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9377. Emit(Mov(position,mem, rightO.op));
  9378. ReleaseIntermediateOperand(mem);
  9379. (* last *)
  9380. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9381. Emit(Mov(position,mem, rightO.tag));
  9382. ReleaseIntermediateOperand(mem);
  9383. (* step *)
  9384. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9385. Emit(Mov(position,mem, rightO.extra));
  9386. ReleaseIntermediateOperand(mem);
  9387. ReleaseOperand(rightO);
  9388. ReleaseOperand(leftO)
  9389. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9390. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9391. Evaluate(right, rightO);
  9392. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9393. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9394. (* real part *)
  9395. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9396. Emit(Mov(position,mem, rightO.op));
  9397. ReleaseIntermediateOperand(mem);
  9398. (* imaginary part *)
  9399. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9400. Emit(Mov(position,mem, rightO.tag));
  9401. ReleaseIntermediateOperand(mem);
  9402. ReleaseOperand(rightO);
  9403. ReleaseOperand(leftO)
  9404. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9405. OR (leftType IS SyntaxTree.PortType) THEN
  9406. (* rightO := leftO;*)
  9407. Evaluate(right,rightO);
  9408. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9409. Designate(left,leftO);
  9410. IF leftO.mode = ModeReference THEN
  9411. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9412. destination := mem;
  9413. ELSE
  9414. destination := leftO.op;
  9415. END;
  9416. ReleaseOperand(leftO);
  9417. IF destination.mode # IntermediateCode.Undefined THEN
  9418. Emit(Mov(position,destination,rightO.op));
  9419. END;
  9420. ReleaseOperand(rightO);
  9421. ReleaseIntermediateOperand(mem);
  9422. IntermediateCode.InitOperand(destination);
  9423. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9424. Evaluate(right,rightO);
  9425. Designate(left,leftO);
  9426. MakeMemory(mem,leftO.op,addressType,0);
  9427. Emit(Mov(position,mem,rightO.op));
  9428. ReleaseIntermediateOperand(mem);
  9429. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9430. (* delegate *)
  9431. (*
  9432. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9433. *)
  9434. Emit(Mov(position,leftO.tag,rightO.tag));
  9435. END;
  9436. ReleaseOperand(leftO);
  9437. ReleaseOperand(rightO);
  9438. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9439. Designate(right,rightO);
  9440. Designate(left,leftO);
  9441. sizeOp := CopySize(left, leftO.tag);
  9442. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9443. ReleaseIntermediateOperand(sizeOp);
  9444. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9445. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9446. IF (rightType IS SyntaxTree.StringType) THEN
  9447. CopyString(left,right);
  9448. 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
  9449. Designate(right,rightO);
  9450. Designate(left,leftO);
  9451. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9452. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9453. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9454. ELSE
  9455. HALT(201)
  9456. END;
  9457. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9458. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9459. Designate(right,rightO);
  9460. Designate(left,leftO);
  9461. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9462. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9463. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9464. Emit(Mov(position, leftO.op, mem));
  9465. ReleaseIntermediateOperand(mem);
  9466. ELSE
  9467. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9468. END;
  9469. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9470. ELSE
  9471. AssignMathArray(left,right);
  9472. END;
  9473. ELSE
  9474. HALT(200);
  9475. END;
  9476. END Assign;
  9477. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9478. BEGIN
  9479. IF Trace THEN TraceEnter("VisitAssignment") END;
  9480. Assign(x.left,x.right);
  9481. IF Trace THEN TraceExit("VisitAssignment") END;
  9482. END VisitAssignment;
  9483. PROCEDURE EmitCooperativeSwitch;
  9484. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9485. BEGIN
  9486. ASSERT (cooperativeSwitches);
  9487. pc := section.pc;
  9488. IF lastSwitchPC = section.pc THEN RETURN END;
  9489. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9490. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9491. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9492. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9493. INC(statCoopSwitch, section.pc - pc);
  9494. END EmitCooperativeSwitch;
  9495. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9496. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9497. BEGIN
  9498. p0 := communication.left; p1 := communication.right;
  9499. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9500. Evaluate(p0,s0);
  9501. Evaluate(p1,s1);
  9502. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9503. Emit(Push(position,s0.op));
  9504. Emit(Push(position,s1.op));
  9505. (*
  9506. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9507. *)
  9508. IF ~backend.cellsAreObjects THEN
  9509. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9510. END;
  9511. ReleaseOperand(s0);
  9512. ReleaseOperand(s1);
  9513. IF backend.cellsAreObjects THEN
  9514. CallThis(position,"ActiveCellsRuntime","Send",2);
  9515. ELSE
  9516. CallThis(position,ChannelModuleName,"Send",2);
  9517. END;
  9518. (* ----- RECEIVE ------*)
  9519. ELSE
  9520. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9521. tmp := p0; p0 := p1; p1 := tmp;
  9522. END;
  9523. Evaluate(p0,s0);
  9524. Emit(Push(position,s0.op));
  9525. Designate(p1,s1);
  9526. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9527. Emit(Push(position,s1.op));
  9528. (*
  9529. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9530. *)
  9531. IF ~backend.cellsAreObjects THEN
  9532. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9533. END;
  9534. ReleaseOperand(s0);
  9535. ReleaseOperand(s1);
  9536. IF backend.cellsAreObjects THEN
  9537. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9538. ELSE
  9539. CallThis(position,ChannelModuleName,"Receive",2)
  9540. END;
  9541. END;
  9542. END VisitCommunicationStatement;
  9543. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9544. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9545. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9546. VAR true, false: Label; condition, value: BOOLEAN;
  9547. BEGIN
  9548. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9549. IF condition THEN
  9550. true := NewLabel();
  9551. false := NewLabel();
  9552. Condition(if.condition,true,false);
  9553. SetLabel(true);
  9554. StatementSequence(if.statements);
  9555. BrL(end);
  9556. SetLabel(false);
  9557. ELSE
  9558. IF value THEN (* always true *)
  9559. escape := TRUE;
  9560. StatementSequence(if.statements);
  9561. (* no branch necessary -- rest skipped *)
  9562. END;
  9563. END;
  9564. END IfPart;
  9565. BEGIN
  9566. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9567. end := NewLabel();
  9568. elsifs := x.ElsifParts();
  9569. IfPart(x.ifPart);
  9570. FOR i := 0 TO elsifs-1 DO
  9571. IF ~escape THEN
  9572. elsif := x.GetElsifPart(i);
  9573. IfPart(elsif);
  9574. END;
  9575. END;
  9576. IF (x.elsePart # NIL) & ~escape THEN
  9577. StatementSequence(x.elsePart);
  9578. END;
  9579. SetLabel(end);
  9580. IF Trace THEN TraceExit("VisitIfStatement") END;
  9581. END VisitIfStatement;
  9582. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9583. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9584. BEGIN
  9585. (*IF x.variable.type.resolved = x.type.resolved THEN
  9586. (* always true, do nothing *)
  9587. ELSE*)
  9588. Designate(x.variable,res);
  9589. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9590. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9591. END;
  9592. trueL := NewLabel();
  9593. TypeTest(res.tag,x.type,trueL,falseL);
  9594. ReleaseOperand(res);
  9595. SetLabel(trueL);
  9596. StatementSequence(x.statements);
  9597. BrL(endL);
  9598. END WithPart;
  9599. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9600. VAR endL,falseL: Label;i: LONGINT;
  9601. BEGIN
  9602. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9603. endL := NewLabel();
  9604. FOR i := 0 TO x.WithParts()-1 DO
  9605. falseL := NewLabel();
  9606. WithPart(x.GetWithPart(i),falseL,endL);
  9607. SetLabel(falseL);
  9608. END;
  9609. IF x.elsePart = NIL THEN
  9610. IF ~isUnchecked THEN
  9611. EmitTrap(position,WithTrap);
  9612. END;
  9613. ELSE
  9614. StatementSequence(x.elsePart)
  9615. END;
  9616. SetLabel(endL);
  9617. IF Trace THEN TraceExit("VisitWithStatement") END;
  9618. END VisitWithStatement;
  9619. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9620. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9621. out,else: Label; label: Label;
  9622. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9623. symbol: SyntaxTree.Symbol;
  9624. BEGIN
  9625. (*! split case statement into if-elsif statements for large case label lists *)
  9626. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9627. range := x.max-x.min+1;
  9628. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9629. END;
  9630. size := LONGINT(range);
  9631. Evaluate(x.variable,var);
  9632. ReuseCopy(tmp,var.op);
  9633. ReleaseIntermediateOperand(var.op);
  9634. var.op := tmp;
  9635. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9636. Convert(var.op,addressType);
  9637. else := NewLabel();
  9638. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9639. (*
  9640. UniqueId(name,module.module,"case",caseId);
  9641. *)
  9642. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9643. Global.GetModuleSegmentedName(module.module, name);
  9644. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9645. symbol := SyntaxTree.NewSymbol(name[1]);
  9646. symbol.SetScope(moduleScope);
  9647. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9648. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9649. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9650. ReuseCopy(res,var.op);
  9651. ReleaseOperand(var);
  9652. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9653. Emit(Add(position,res,res,jmp));
  9654. IntermediateCode.MakeMemory(res,addressType);
  9655. Emit(Br(position,res));
  9656. ReleaseIntermediateOperand(res);
  9657. out := NewLabel();
  9658. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9659. part := x.GetCasePart(i);
  9660. constant := part.firstConstant;
  9661. label := NewLabel();
  9662. SetLabel(label);
  9663. WHILE(constant # NIL) DO (* case labels for this case part *)
  9664. FOR j := constant.min TO constant.max DO
  9665. fixups[j-x.min] := label;
  9666. END;
  9667. constant := constant.next;
  9668. END;
  9669. StatementSequence(part.statements);
  9670. BrL(out);
  9671. END;
  9672. SetLabel(else);
  9673. FOR i := 0 TO size-1 DO
  9674. IF fixups[i] = NIL THEN
  9675. fixups[i] := else;
  9676. END;
  9677. END;
  9678. IF x.elsePart # NIL THEN
  9679. StatementSequence(x.elsePart);
  9680. ELSIF ~isUnchecked THEN
  9681. EmitTrap(position,CaseTrap);
  9682. END;
  9683. SetLabel(out);
  9684. FOR i := 0 TO size-1 DO
  9685. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9686. section.Emit(Data(position,op));
  9687. END;
  9688. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9689. END VisitCaseStatement;
  9690. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9691. VAR start: Label; true,false: Label;
  9692. BEGIN
  9693. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9694. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9695. start := NewLabel();
  9696. true := NewLabel();
  9697. false := NewLabel();
  9698. SetLabel(start);
  9699. Condition(x.condition,true,false);
  9700. SetLabel(true);
  9701. StatementSequence(x.statements);
  9702. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9703. BrL(start);
  9704. SetLabel(false);
  9705. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9706. END VisitWhileStatement;
  9707. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9708. VAR false,true: Label;
  9709. BEGIN
  9710. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9711. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9712. true := NewLabel();
  9713. false := NewLabel();
  9714. SetLabel(false);
  9715. StatementSequence(x.statements);
  9716. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9717. Condition(x.condition,true,false);
  9718. SetLabel(true);
  9719. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9720. END VisitRepeatStatement;
  9721. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9722. VAR
  9723. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9724. temporaryVariable: SyntaxTree.Variable;
  9725. temporaryVariableDesignator : SyntaxTree.Designator;
  9726. BEGIN
  9727. IF Trace THEN TraceEnter("VisitForStatement") END;
  9728. true := NewLabel();
  9729. false := NewLabel();
  9730. start := NewLabel();
  9731. Assign(x.variable,x.from);
  9732. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9733. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9734. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9735. Assign(temporaryVariableDesignator,x.to);
  9736. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9737. IF by > 0 THEN
  9738. cmp := Scanner.LessEqual
  9739. ELSE
  9740. cmp := Scanner.GreaterEqual
  9741. END;
  9742. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9743. binary.SetType(system.booleanType);
  9744. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9745. SetLabel(start);
  9746. Condition(binary,true,false);
  9747. SetLabel(true);
  9748. StatementSequence(x.statements);
  9749. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9750. binary.SetType(x.variable.type);
  9751. Assign(x.variable,binary);
  9752. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9753. BrL(start);
  9754. SetLabel(false);
  9755. IF Trace THEN TraceExit("VisitForStatement") END;
  9756. END VisitForStatement;
  9757. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9758. VAR prevLoop: Label;
  9759. BEGIN
  9760. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9761. prevLoop := currentLoop;
  9762. currentLoop := NewLabel();
  9763. StatementSequence(x.statements);
  9764. SetLabel(currentLoop);
  9765. currentLoop := prevLoop;
  9766. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9767. END VisitExitableBlock;
  9768. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9769. VAR prevLoop,start: Label;
  9770. BEGIN
  9771. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9772. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9773. start := NewLabel();
  9774. prevLoop := currentLoop;
  9775. SetLabel(start);
  9776. currentLoop := NewLabel();
  9777. StatementSequence(x.statements);
  9778. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9779. BrL(start);
  9780. SetLabel(currentLoop);
  9781. currentLoop := prevLoop;
  9782. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9783. END VisitLoopStatement;
  9784. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9785. VAR outer: SyntaxTree.Statement;
  9786. BEGIN
  9787. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9788. IF locked THEN (* r if we jump out of an exclusive block *)
  9789. outer := x.outer;
  9790. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9791. outer := outer.outer;
  9792. END;
  9793. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9794. Lock(FALSE);
  9795. END;
  9796. END;
  9797. BrL(currentLoop);
  9798. IF Trace THEN TraceExit("VisitExitStatement") END;
  9799. END VisitExitStatement;
  9800. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9801. VAR
  9802. expression, parameterDesignator: SyntaxTree.Expression;
  9803. type, componentType: SyntaxTree.Type;
  9804. res, right: Operand;
  9805. left, mem, reg: IntermediateCode.Operand;
  9806. parameter: SyntaxTree.Parameter;
  9807. procedure: SyntaxTree.Procedure;
  9808. procedureType: SyntaxTree.ProcedureType;
  9809. returnTypeOffset: LONGINT;
  9810. delegate: BOOLEAN;
  9811. map: SymbolMap;
  9812. callingConvention, parametersSize: LONGINT;
  9813. BEGIN
  9814. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9815. expression := x.returnValue;
  9816. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9817. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9818. IF currentIsInline THEN
  9819. IF expression # NIL THEN
  9820. map := currentMapper.Get(NIL);
  9821. IF map # NIL THEN
  9822. Assign(map.to, expression);
  9823. ELSE
  9824. Evaluate(expression,res);
  9825. Emit(Return(position,res.op));
  9826. ReleaseOperand(res);
  9827. END;
  9828. END;
  9829. BrL(currentInlineExit);
  9830. RETURN;
  9831. END;
  9832. IF expression # NIL THEN
  9833. type := expression.type.resolved;
  9834. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9835. IF locked THEN Lock(FALSE) END;
  9836. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9837. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9838. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9839. 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
  9840. (* return without structured return parameter *)
  9841. Evaluate(expression,res);
  9842. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9843. IF locked OR profile THEN
  9844. Emit(Push(position,res.op));
  9845. IF delegate THEN HALT(200) END;
  9846. ReleaseOperand(res);
  9847. IF locked THEN Lock(FALSE) END;
  9848. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9849. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9850. reg := NewRegisterOperand(res.op.type);
  9851. Emit(Pop(position,reg));
  9852. Emit(Return(position,reg));
  9853. ReleaseIntermediateOperand(reg);
  9854. ELSE
  9855. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9856. Emit(Return(position,res.op));
  9857. ReleaseOperand(res);
  9858. END;
  9859. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9860. THEN
  9861. (* return using structured return parameter *)
  9862. 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)
  9863. OR SemanticChecker.IsPointerType(type));
  9864. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9865. parameter :=procedureType.returnParameter;
  9866. ASSERT(parameter # NIL);
  9867. returnTypeOffset := parameter.offsetInBits;
  9868. (*
  9869. IF parameter# NIL THEN
  9870. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9871. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9872. ELSE
  9873. returnTypeOffset := system.offsetFirstParameter
  9874. END;
  9875. *)
  9876. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9877. IF type IS SyntaxTree.RangeType THEN
  9878. (* array range type *)
  9879. Evaluate(expression, right);
  9880. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9881. Emit(Mov(position,mem, right.op)); (* first *)
  9882. ReleaseIntermediateOperand(mem);
  9883. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9884. Emit(Mov(position,mem, right.tag)); (* last *)
  9885. ReleaseIntermediateOperand(mem);
  9886. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9887. Emit(Mov(position,mem, right.extra)); (* step *)
  9888. ReleaseIntermediateOperand(mem);
  9889. ReleaseOperand(right);
  9890. ELSIF type IS SyntaxTree.ComplexType THEN
  9891. Evaluate(expression, right);
  9892. componentType := type(SyntaxTree.ComplexType).componentType;
  9893. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9894. Emit(Mov(position,mem, right.op)); (* real part *)
  9895. ReleaseIntermediateOperand(mem);
  9896. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9897. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9898. ReleaseIntermediateOperand(mem);
  9899. ReleaseOperand(right);
  9900. ELSE (* covers cases: pointer / record / array *)
  9901. parameter := procedureType.returnParameter;
  9902. checker.SetCurrentScope(currentScope);
  9903. ASSERT(parameter # NIL);
  9904. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9905. Assign(parameterDesignator,expression);
  9906. END;
  9907. ReleaseIntermediateOperand(left);
  9908. IF locked THEN Lock(FALSE) END;
  9909. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9910. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9911. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9912. parameter := procedureType.returnParameter;
  9913. checker.SetCurrentScope(currentScope);
  9914. IF parameter = NIL THEN
  9915. Error(procedure.position, "structured return of parameter of procedure not found");
  9916. ELSE
  9917. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9918. Assign(parameterDesignator,expression);
  9919. END;
  9920. IF locked THEN Lock(FALSE) END;
  9921. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9922. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9923. ELSE
  9924. HALT(200);
  9925. END;
  9926. ELSE
  9927. IF locked THEN Lock(FALSE) END;
  9928. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9929. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9930. END;
  9931. IF backend.cooperative THEN
  9932. BrL(exitLabel);
  9933. ELSE
  9934. callingConvention := procedureType.callingConvention;
  9935. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9936. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9937. ELSE
  9938. parametersSize := 0;
  9939. END;
  9940. EmitLeave(section, position,procedure, callingConvention);
  9941. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9942. END;
  9943. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9944. END VisitReturnStatement;
  9945. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9946. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9947. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9948. statements: SyntaxTree.StatementSequence;
  9949. name, suffix: SyntaxTree.IdentifierString;
  9950. BEGIN
  9951. Strings.IntToStr(awaitProcCounter,suffix);
  9952. Strings.Concat("@AwaitProcedure",suffix,name);
  9953. identifier := SyntaxTree.NewIdentifier(name);
  9954. INC(awaitProcCounter);
  9955. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9956. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9957. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9958. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9959. procedure.SetAccess(SyntaxTree.Hidden);
  9960. procedure.SetScope(currentScope);
  9961. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9962. procedureType.SetReturnType(system.booleanType);
  9963. procedure.SetType(procedureType);
  9964. body := SyntaxTree.NewBody(x.position,procedureScope);
  9965. procedureScope.SetBody(body);
  9966. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9967. returnStatement.SetReturnValue(x.condition);
  9968. statements := SyntaxTree.NewStatementSequence();
  9969. statements.AddStatement(returnStatement);
  9970. body.SetStatementSequence(statements);
  9971. currentScope.AddProcedure(procedure);
  9972. RETURN procedure
  9973. END MakeAwaitProcedure;
  9974. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9975. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9976. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9977. BEGIN
  9978. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9979. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9980. IF backend.cooperative THEN
  9981. start := NewLabel();
  9982. true := NewLabel();
  9983. false := NewLabel();
  9984. SetLabel(start);
  9985. Condition(x.condition,true,false);
  9986. SetLabel(false);
  9987. PushSelfPointer();
  9988. CallThis(position,"ExclusiveBlocks","Await",1);
  9989. BrL(start);
  9990. SetLabel(true);
  9991. PushSelfPointer();
  9992. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9993. ELSE
  9994. proc := MakeAwaitProcedure(x);
  9995. Emit(Push(position,fp));
  9996. GetCodeSectionNameForSymbol(proc,name);
  9997. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9998. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9999. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10000. Emit(Call(position,call,ProcParametersSize(proc)));
  10001. Emit(Result(position,res));
  10002. (*
  10003. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10004. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10005. *)
  10006. InitOperand(result,ModeValue);
  10007. result.op := res;
  10008. label := NewLabel();
  10009. BreqL(label, result.op, SELF.true);
  10010. ReleaseOperand(result);
  10011. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10012. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10013. Emit(Push(position,res));
  10014. Emit(Push(position,fp));
  10015. PushSelfPointer();
  10016. Emit(Push(position,nil));
  10017. CallThis(position,"Objects","Await",4);
  10018. SetLabel(label);
  10019. END;
  10020. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10021. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10022. END VisitAwaitStatement;
  10023. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10024. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10025. BEGIN
  10026. FOR i := 0 TO x.Length() - 1 DO
  10027. statement := x.GetStatement( i );
  10028. Statement(statement);
  10029. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10030. END;
  10031. END StatementSequence;
  10032. PROCEDURE PushSelfPointer;
  10033. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10034. procedureType: SyntaxTree.ProcedureType;
  10035. BEGIN
  10036. scope := currentScope;
  10037. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10038. scope := scope.outerScope;
  10039. END;
  10040. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10041. moduleSection := meta.ModuleSection();
  10042. IF backend.cooperative THEN
  10043. moduleOffset := 0;
  10044. ELSE
  10045. moduleOffset := moduleSection.pc;
  10046. END;
  10047. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10048. ELSE
  10049. GetBaseRegister(op.op,currentScope,scope);
  10050. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10051. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10052. parametersSize := ProcParametersSize(procedure);
  10053. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10054. IF backend.cooperative THEN
  10055. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10056. END;
  10057. IntermediateCode.MakeMemory(op.op,addressType);
  10058. END;
  10059. Emit(Push(position,op.op));
  10060. ReleaseOperand(op);
  10061. END PushSelfPointer;
  10062. PROCEDURE Lock(lock: BOOLEAN);
  10063. BEGIN
  10064. IF Trace THEN TraceEnter("Lock") END;
  10065. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10066. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10067. ASSERT(modifyAssignmentCounter = 0);
  10068. IF dump # NIL THEN
  10069. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10070. dump.Ln;dump.Update;
  10071. END;
  10072. PushSelfPointer;
  10073. IF backend.cooperative THEN
  10074. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10075. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10076. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10077. END;
  10078. ELSE
  10079. Emit(Push(position,true));
  10080. IF lock THEN CallThis(position,"Objects","Lock",2)
  10081. ELSE CallThis(position,"Objects","Unlock",2);
  10082. END;
  10083. END;
  10084. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10085. IF Trace THEN TraceExit("Lock") END;
  10086. END Lock;
  10087. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10088. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10089. BEGIN
  10090. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10091. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10092. previouslyUnchecked := isUnchecked;
  10093. isUnchecked := isUnchecked OR x.isUnchecked;
  10094. previouslyCooperativeSwitches := cooperativeSwitches;
  10095. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10096. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10097. IF x.statements # NIL THEN
  10098. StatementSequence(x.statements);
  10099. END;
  10100. IF (x IS SyntaxTree.Body) THEN
  10101. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10102. section.SetFinally(section.pc);
  10103. StatementSequence(x(SyntaxTree.Body).finally)
  10104. ELSIF x.isExclusive THEN
  10105. end := NewLabel();
  10106. BrL(end);
  10107. section.SetFinally(section.pc);
  10108. Lock(FALSE);
  10109. EmitTrap(position,RethrowTrap);
  10110. SetLabel(end);
  10111. END;
  10112. END;
  10113. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10114. isUnchecked := previouslyUnchecked;
  10115. cooperativeSwitches := previouslyCooperativeSwitches;
  10116. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10117. END VisitStatementBlock;
  10118. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10119. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10120. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10121. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10122. procedure: SyntaxTree.Procedure;
  10123. map: SymbolMap;
  10124. callingConvention, parametersSize: LONGINT;
  10125. BEGIN
  10126. scope := currentScope;
  10127. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10128. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10129. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10130. return := emptyOperand;
  10131. IF Trace THEN TraceEnter("VisitCode") END;
  10132. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10133. NEW(in, x.inRules.Length());
  10134. FOR i := 0 TO LEN(in)-1 DO
  10135. statement := x.inRules.GetStatement(i);
  10136. WITH statement: SyntaxTree.Assignment DO
  10137. Evaluate(statement.right, operand);
  10138. result := operand.op;
  10139. NEW(str, 64);
  10140. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10141. in[i] := result; IntermediateCode.SetString(in[i], str);
  10142. ReleaseIntermediateOperand(operand.tag);
  10143. END;
  10144. END;
  10145. ELSE in := NIL
  10146. END;
  10147. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10148. NEW(out, x.outRules.Length());
  10149. FOR i := 0 TO LEN(out)-1 DO
  10150. statement := x.outRules.GetStatement(i);
  10151. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10152. WITH statement: SyntaxTree.Assignment DO
  10153. Designate(statement.left, operand);
  10154. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10155. NEW(str, 64);
  10156. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10157. out[i] := result; IntermediateCode.SetString(out[i], str);
  10158. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10159. |statement: SyntaxTree.ReturnStatement DO
  10160. NEW(str, 64);
  10161. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10162. IF currentIsInline THEN
  10163. map := currentMapper.Get(NIL);
  10164. Designate(map.to, operand);
  10165. IF map.isAddress THEN
  10166. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10167. ELSE
  10168. result := operand.op;
  10169. END;
  10170. (*! only if it does not fit into register
  10171. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10172. *)
  10173. (*Evaluate(map.to, operand);*)
  10174. out[i] := result;
  10175. ELSE
  10176. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10177. END;
  10178. IntermediateCode.SetString(out[i], str);
  10179. ReleaseIntermediateOperand(operand.tag);
  10180. return := out[i];
  10181. ELSE
  10182. END;
  10183. END;
  10184. ELSE out := NIL
  10185. END;
  10186. Emit(Asm(x.position,x.sourceCode, in, out));
  10187. IF in # NIL THEN
  10188. FOR i := 0 TO LEN(in)-1 DO
  10189. ReleaseIntermediateOperand(in[i]);
  10190. END;
  10191. END;
  10192. IF out # NIL THEN
  10193. FOR i := 0 TO LEN(out)-1 DO
  10194. WITH statement: SyntaxTree.Assignment DO
  10195. ReleaseIntermediateOperand(out[i]);
  10196. |statement: SyntaxTree.ReturnStatement DO
  10197. (* release happens below *)
  10198. ELSE
  10199. END;
  10200. statement := x.outRules.GetStatement(i);
  10201. END;
  10202. END;
  10203. IF return.mode # IntermediateCode.Undefined THEN
  10204. IF currentIsInline THEN
  10205. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10206. Symbol(procedureType.returnParameter, par);
  10207. MakeMemory(mem, par.op, return.type, 0);
  10208. ReleaseOperand(par);
  10209. Emit(Mov(position, mem, return));
  10210. ReleaseIntermediateOperand(mem);
  10211. ELSE
  10212. Emit(Return(position,return));
  10213. END;
  10214. ReleaseIntermediateOperand(return);
  10215. IF currentIsInline THEN RETURN END;
  10216. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10217. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10218. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10219. ELSE
  10220. parametersSize := 0;
  10221. END;
  10222. EmitLeave(section, position,procedure, callingConvention);
  10223. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10224. END;
  10225. IF Trace THEN TraceExit("VisitCode") END;
  10226. END VisitCode;
  10227. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10228. BEGIN
  10229. RETURN ProcedureParametersSize(system, procedure);
  10230. END ProcParametersSize;
  10231. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10232. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10233. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10234. const, call: IntermediateCode.Operand;
  10235. parameterDesignator: SyntaxTree.Expression;
  10236. saved: RegisterEntry;
  10237. name: Basic.SegmentedName;
  10238. BEGIN
  10239. IF Trace THEN TraceEnter("ParameterCopies") END;
  10240. parameter := x.firstParameter;
  10241. WHILE parameter # NIL DO
  10242. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10243. type := parameter.type.resolved;
  10244. IF IsOpenArray(type) THEN
  10245. VisitParameter(parameter);
  10246. op := result;
  10247. IF backend.cooperative & parameter.NeedsTrace() THEN
  10248. length := GetArrayLength(type, op.tag);
  10249. size := NewRegisterOperand(addressType);
  10250. base := ArrayBaseType(type);
  10251. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10252. Emit(Mul(position, size, length, const));
  10253. dst := NewRegisterOperand (addressType);
  10254. Emit(Mov(position, dst, size));
  10255. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10256. Emit(Sub(position,dst,sp,dst));
  10257. Emit(And(position,dst,dst,const));
  10258. Emit(Mov(position,sp,dst));
  10259. par := fp;
  10260. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10261. IntermediateCode.InitImmediate(null, byteType, 0);
  10262. Emit(Fill(position, dst, size, null));
  10263. ReleaseIntermediateOperand(dst);
  10264. ReleaseIntermediateOperand(length);
  10265. SaveRegisters();ReleaseUsedRegisters(saved);
  10266. (* register dst has been freed before SaveRegisters already *)
  10267. base := ArrayBaseType(type);
  10268. (* assign method of open array *)
  10269. IF base.IsRecordType() THEN
  10270. Emit (Push(position, length));
  10271. Emit (Push(position, dst));
  10272. Emit (Push(position, op.op));
  10273. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10274. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10276. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10277. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10278. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10279. Emit (Push(position,length));
  10280. Emit (Push(position, dst));
  10281. Emit (Push(position, length));
  10282. Emit (Push(position, op.op));
  10283. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10284. ELSE
  10285. Emit (Push(position, length));
  10286. Emit (Push(position, dst));
  10287. Emit (Push(position, length));
  10288. Emit (Push(position, op.op));
  10289. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10290. ASSERT(ArrayBaseType(type).IsPointer());
  10291. END;
  10292. RestoreRegisters(saved);
  10293. ELSE
  10294. temp := GetDynamicSize(type,op.tag);
  10295. ReuseCopy(size,temp);
  10296. ReleaseIntermediateOperand(temp);
  10297. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10298. Emit(Sub(position,size,sp,size));
  10299. Emit(And(position,size,size,const));
  10300. Emit(Mov(position,sp,size));
  10301. par := fp;
  10302. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10303. ReleaseIntermediateOperand(size);
  10304. size := GetDynamicSize(type,op.tag);
  10305. END;
  10306. Emit(Copy(position,sp,op.op,size));
  10307. ReleaseIntermediateOperand(size);
  10308. ReleaseOperand(op);
  10309. IntermediateCode.MakeMemory(par,addressType);
  10310. Emit(Mov(position,par,sp));
  10311. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10312. checker.SetCurrentScope(currentScope);
  10313. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10314. Assign(parameterDesignator,parameterDesignator);
  10315. END;
  10316. END;
  10317. parameter := parameter.nextParameter;
  10318. END;
  10319. IF Trace THEN TraceExit("ParameterCopies") END;
  10320. END ParameterCopies;
  10321. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10322. VAR x: SyntaxTree.Variable;
  10323. BEGIN
  10324. x := scope.firstVariable;
  10325. WHILE x # NIL DO
  10326. InitVariable(x,FALSE);
  10327. x := x.nextVariable;
  10328. END;
  10329. END InitVariables;
  10330. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10331. BEGIN
  10332. IF (symbol # NIL) THEN
  10333. RETURN fingerPrinter.SymbolFP(symbol).public
  10334. ELSE
  10335. RETURN 0
  10336. END;
  10337. END GetFingerprint;
  10338. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10339. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10340. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10341. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10342. name: Basic.SegmentedName;
  10343. offset: LONGINT;
  10344. BEGIN
  10345. IF Trace THEN TraceEnter("Body") END;
  10346. ReleaseUsedRegisters(saved); (* just in case ... *)
  10347. section := ir;
  10348. exitLabel := NewLabel ();
  10349. IF moduleBody THEN moduleBodySection := section END;
  10350. IF ir.comments # NIL THEN
  10351. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10352. commentPrintout.SingleStatement(TRUE);
  10353. dump := ir.comments;
  10354. ELSE
  10355. commentPrintout := NIL;
  10356. dump := NIL;
  10357. END;
  10358. prevScope := currentScope;
  10359. currentScope := scope;
  10360. lastSwitchPC := 0;
  10361. cooperativeSwitches := backend.cooperative;
  10362. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10363. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10364. IF x # NIL THEN
  10365. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10366. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10367. IF moduleBody THEN
  10368. ProfilerInit();
  10369. ELSE
  10370. Basic.SegmentedNameToString(ir.name, string);
  10371. ProfilerAddProcedure(numberProcedures,string);
  10372. ProfilerEnterExit(numberProcedures,TRUE);
  10373. END;
  10374. END;
  10375. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10376. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10377. END;
  10378. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10379. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10380. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10381. IF procedure = cellScope.bodyProcedure THEN
  10382. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10383. StaticCallOperand(op, cellScope.constructor);
  10384. Emit(Call(position,op.op,0));
  10385. END;
  10386. END;
  10387. END;
  10388. InitVariables(scope);
  10389. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10390. GetCodeSectionNameForSymbol(procedure, name);
  10391. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10392. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10393. IF ProtectModulesPointers THEN
  10394. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10395. ELSE
  10396. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10397. END;
  10398. IntermediateCode.SetOffset(right,offset); (* tag *)
  10399. IntermediateCode.InitMemory(left,addressType,fp,0);
  10400. Emit(Mov(position, left, right));
  10401. END;
  10402. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10403. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10404. ParameterCopies(procedureType);
  10405. IF x.code = NIL THEN
  10406. VisitStatementBlock(x);
  10407. ELSE
  10408. VisitCode(x.code)
  10409. END;
  10410. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10411. IF ~backend.cooperative THEN
  10412. ProfilerEnterExit(numberProcedures,FALSE);
  10413. END;
  10414. INC(numberProcedures);
  10415. END;
  10416. END;
  10417. IF backend.cooperative THEN
  10418. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10419. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10420. END;
  10421. IF x # NIL THEN
  10422. SELF.position := x.position;
  10423. END;
  10424. CheckRegistersFree();
  10425. ASSERT(modifyAssignmentCounter = 0);
  10426. currentScope := prevScope;
  10427. IF Trace THEN TraceExit("Body") END;
  10428. END Body;
  10429. END ImplementationVisitor;
  10430. MetaDataGenerator=OBJECT
  10431. VAR
  10432. implementationVisitor: ImplementationVisitor;
  10433. declarationVisitor: DeclarationVisitor;
  10434. module: Sections.Module;
  10435. moduleName: ARRAY 128 OF CHAR;
  10436. moduleNamePool: Basic.HashTableInt;
  10437. moduleNamePoolSection: IntermediateCode.Section;
  10438. modulePointerSection: IntermediateCode.Section;
  10439. modulePointerSizePC: LONGINT;
  10440. modulePointerSectionOffset: LONGINT;
  10441. modulePointers: LONGINT;
  10442. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10443. RecordBaseOffset: LONGINT;
  10444. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10445. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10446. TypeTags: LONGINT; (* type extension level support *)
  10447. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10448. patchInfoPC: LONGINT;
  10449. patchCRC: LONGINT;
  10450. CONST
  10451. EmptyBlockOffset = 2;
  10452. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10453. BEGIN
  10454. IF implementationVisitor.backend.cooperative THEN
  10455. TypeTags := MAX(LONGINT);
  10456. BaseTypesTableOffset := 0;
  10457. MethodTableOffset := 2;
  10458. TypeRecordBaseOffset := 0;
  10459. RecordBaseOffset := 0;
  10460. ELSIF simple THEN
  10461. TypeTags := 3; (* only 3 extensions allowed *)
  10462. BaseTypesTableOffset := 1;
  10463. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10464. TypeRecordBaseOffset := 0;
  10465. RecordBaseOffset := 1;
  10466. ELSE
  10467. TypeTags := 16;
  10468. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10469. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10470. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10471. (* change this when Heaps.HeapBlock is modified *)
  10472. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10473. RecordBaseOffset := 8; (* addresses *)
  10474. ELSE
  10475. RecordBaseOffset := 9; (* addresses *)
  10476. END;
  10477. END;
  10478. SELF.simple := simple;
  10479. SELF.implementationVisitor := implementationVisitor;
  10480. SELF.declarationVisitor := declarationVisitor;
  10481. implementationVisitor.meta := SELF;
  10482. declarationVisitor.meta := SELF;
  10483. END InitMetaDataGenerator;
  10484. PROCEDURE SetModule(module: Sections.Module);
  10485. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10486. BEGIN
  10487. SELF.module := module;
  10488. Global.GetModuleName(module.module,moduleName);
  10489. Global.GetSymbolSegmentedName(module.module, name);
  10490. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10491. NEW(moduleNamePool, 32);
  10492. (*! require GC protection *)
  10493. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10494. IF ProtectModulesPointers THEN
  10495. name := "Heaps.AnyPtr";
  10496. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10497. (* set base pointer *)
  10498. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10499. END;
  10500. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10501. modulePointers := 0;
  10502. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10503. AddPointer(moduleNamePoolSection, namePoolOffset);
  10504. END;
  10505. END SetModule;
  10506. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10507. BEGIN
  10508. IF ~implementationVisitor.backend.cooperative THEN
  10509. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10510. INC(modulePointers);
  10511. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10512. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10513. END;
  10514. END AddPointer;
  10515. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10516. BEGIN
  10517. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10518. END GetTypeRecordBaseOffset;
  10519. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10520. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10521. BEGIN
  10522. (* change this when Heaps.HeapBlock is modified *)
  10523. INC(dataAdrOffset,7);
  10524. Info(section,"headerAdr");
  10525. Address(section,0);
  10526. Info(section,"typeDesc");
  10527. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10528. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10529. NamedSymbol(section, name, symbol, 0, offset);
  10530. Info(section,"mark: LONGINT;");
  10531. Longint(section,-1);
  10532. Info(section,"refCount: LONGINT;");
  10533. Longint(section,0);
  10534. (*
  10535. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10536. *)
  10537. Info(section,"dataAdr-: ADDRESS");
  10538. Symbol(section,section, dataAdrOffset,0);
  10539. Info(section,"size-: SIZE");
  10540. Address(section,0);
  10541. Info(section,"nextMark: HeapBlock;");
  10542. Address(section,0);
  10543. END HeapBlock;
  10544. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10545. VAR i: LONGINT;
  10546. BEGIN
  10547. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10548. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10549. Info(section,"count*: LONGINT");
  10550. Longint(section,0);
  10551. Info(section,"locked*: BOOLEAN");
  10552. Longint(section,0);
  10553. Info(section,"awaitingLock*: ProcessQueue");
  10554. Address(section,0);
  10555. Address(section,0);
  10556. Info(section,"awaitingCond*: ProcessQueue");
  10557. Address(section,0);
  10558. Address(section,0);
  10559. Info(section,"lockedBy*: ANY");
  10560. Address(section,0);
  10561. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10562. Longint(section,1);
  10563. FOR i := 2 TO 6 DO
  10564. Longint(section,0);
  10565. END;
  10566. Info(section,"lock*: ANY");
  10567. Address(section,0);
  10568. END ProtectedHeapBlock;
  10569. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10570. BEGIN
  10571. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10572. END Info;
  10573. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10574. VAR op: IntermediateCode.Operand;
  10575. BEGIN
  10576. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10577. section.Emit(Data(Basic.invalidPosition,op));
  10578. END Address;
  10579. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10580. VAR op: IntermediateCode.Operand;
  10581. BEGIN
  10582. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10583. section.Emit(Data(Basic.invalidPosition,op));
  10584. END Size;
  10585. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10586. VAR op: IntermediateCode.Operand;
  10587. BEGIN
  10588. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10589. section.Emit(Data(Basic.invalidPosition,op));
  10590. END Set;
  10591. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10592. VAR op: IntermediateCode.Operand;
  10593. BEGIN
  10594. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10595. section.Emit(Data(Basic.invalidPosition,op));
  10596. END Longint;
  10597. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10598. VAR op,noOperand: IntermediateCode.Operand;
  10599. BEGIN
  10600. IntermediateCode.InitOperand(noOperand);
  10601. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10602. section.PatchOperands(pc,op,noOperand,noOperand);
  10603. END PatchAddress;
  10604. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10605. VAR op,noOperand: IntermediateCode.Operand;
  10606. BEGIN
  10607. IntermediateCode.InitOperand(noOperand);
  10608. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10609. section.PatchOperands(pc,op,noOperand,noOperand);
  10610. END PatchSize;
  10611. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10612. VAR op,noOperand: IntermediateCode.Operand;
  10613. BEGIN
  10614. IntermediateCode.InitOperand(noOperand);
  10615. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10616. section.PatchOperands(pc,op,noOperand,noOperand);
  10617. END PatchLongint;
  10618. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10619. VAR op, noOperand: IntermediateCode.Operand;
  10620. BEGIN
  10621. IntermediateCode.InitOperand(noOperand);
  10622. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10623. section.PatchOperands(pc,op,noOperand,noOperand);
  10624. END PatchSymbol;
  10625. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10626. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10627. BEGIN
  10628. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10629. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10630. section.Emit(Data(Basic.invalidPosition,op));
  10631. END Boolean;
  10632. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10633. VAR op: IntermediateCode.Operand;
  10634. BEGIN
  10635. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10636. section.Emit(Data(Basic.invalidPosition,op));
  10637. END Char;
  10638. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10639. VAR op: IntermediateCode.Operand;
  10640. BEGIN
  10641. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10642. section.Emit(Data(Basic.invalidPosition,op));
  10643. END Integer;
  10644. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10645. VAR i: LONGINT;
  10646. BEGIN
  10647. Info(section,str);
  10648. i := 0;
  10649. WHILE(str[i] # 0X) DO
  10650. Char(section,str[i]);
  10651. INC(i);
  10652. END;
  10653. Char(section,0X);
  10654. END String;
  10655. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10656. VAR s: Basic.SectionName;
  10657. BEGIN
  10658. StringPool.GetString(str, s);
  10659. String(section, s);
  10660. END String0;
  10661. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10662. VAR op: IntermediateCode.Operand;
  10663. BEGIN
  10664. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10665. IntermediateCode.SetOffset(op,realOffset);
  10666. section.Emit(Data(Basic.invalidPosition,op));
  10667. END NamedSymbol;
  10668. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10669. VAR op: IntermediateCode.Operand;
  10670. BEGIN
  10671. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10672. IntermediateCode.SetOffset(op,realOffset);
  10673. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10674. END NamedSymbolAt;
  10675. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10676. BEGIN
  10677. IF symbol= NIL THEN
  10678. Address( section, realOffset);
  10679. ASSERT(virtualOffset = 0);
  10680. ELSE
  10681. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10682. END;
  10683. END Symbol;
  10684. (* OutPointers delivers
  10685. {pointerOffset}
  10686. *)
  10687. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10688. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10689. BEGIN
  10690. type := type.resolved;
  10691. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10692. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10693. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10694. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10695. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10696. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10697. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10698. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10699. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10700. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10701. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10702. ELSIF (type IS SyntaxTree.RecordType) THEN
  10703. (* never treat a record like a pointer, even if the pointer field is set! *)
  10704. WITH type: SyntaxTree.RecordType DO
  10705. base := type.GetBaseRecord();
  10706. IF base # NIL THEN
  10707. Pointers(offset,symbol,section, base,numberPointers);
  10708. END;
  10709. variable := type.recordScope.firstVariable;
  10710. WHILE(variable # NIL) DO
  10711. IF ~(variable.untraced) THEN
  10712. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10713. END;
  10714. variable := variable.nextVariable;
  10715. END;
  10716. END;
  10717. ELSIF (type IS SyntaxTree.CellType) THEN
  10718. WITH type: SyntaxTree.CellType DO
  10719. base := type.GetBaseRecord();
  10720. IF base # NIL THEN
  10721. Pointers(offset,symbol,section, base,numberPointers);
  10722. END;
  10723. variable := type.cellScope.firstVariable;
  10724. WHILE(variable # NIL) DO
  10725. IF ~(variable.untraced) THEN
  10726. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10727. END;
  10728. variable := variable.nextVariable;
  10729. END;
  10730. property := type.firstProperty;
  10731. WHILE(property # NIL) DO
  10732. IF ~(property.untraced) THEN
  10733. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10734. END;
  10735. property := property.nextProperty;
  10736. END;
  10737. parameter := type.firstParameter;
  10738. WHILE(parameter # NIL) DO
  10739. IF ~(parameter.untraced) THEN
  10740. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10741. END;
  10742. parameter := parameter.nextParameter;
  10743. END;
  10744. END;
  10745. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10746. WITH type: SyntaxTree.ArrayType DO
  10747. IF type.form= SyntaxTree.Static THEN
  10748. n := type.staticLength;
  10749. base := type.arrayBase.resolved;
  10750. WHILE(base IS SyntaxTree.ArrayType) DO
  10751. type := base(SyntaxTree.ArrayType);
  10752. n := n* type.staticLength;
  10753. base := type.arrayBase.resolved;
  10754. END;
  10755. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10756. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10757. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10758. FOR i := 0 TO n-1 DO
  10759. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10760. END;
  10761. END;
  10762. ELSE
  10763. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10764. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10765. END;
  10766. END;
  10767. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10768. WITH type: SyntaxTree.MathArrayType DO
  10769. IF type.form = SyntaxTree.Static THEN
  10770. n := type.staticLength;
  10771. base := type.arrayBase.resolved;
  10772. WHILE(base IS SyntaxTree.MathArrayType) DO
  10773. type := base(SyntaxTree.MathArrayType);
  10774. n := n* type.staticLength;
  10775. base := type.arrayBase.resolved;
  10776. END;
  10777. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10778. IF SemanticChecker.ContainsPointer(base) THEN
  10779. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10780. FOR i := 0 TO n-1 DO
  10781. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10782. END;
  10783. END;
  10784. ELSE
  10785. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10786. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10787. END
  10788. END;
  10789. (* ELSE no pointers in type *)
  10790. END;
  10791. END Pointers;
  10792. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10793. VAR position,i: LONGINT; ch: CHAR;
  10794. BEGIN
  10795. IF pool.Has(index) THEN
  10796. RETURN pool.GetInt(index)
  10797. ELSE
  10798. position := source.pc;
  10799. pool.PutInt(index, position);
  10800. Info(source, name);
  10801. i := 0;
  10802. REPEAT
  10803. ch := name[i]; INC(i);
  10804. Char( source, ch);
  10805. UNTIL ch = 0X;
  10806. END;
  10807. RETURN position;
  10808. END EnterDynamicName;
  10809. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10810. VAR name: Basic.SectionName; position: LONGINT;
  10811. BEGIN
  10812. IF pool.Has(index) THEN
  10813. RETURN pool.GetInt(index)
  10814. ELSE
  10815. StringPool.GetString(index, name);
  10816. position := EnterDynamicName(source,name,index, pool);
  10817. END;
  10818. RETURN position;
  10819. END DynamicName;
  10820. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10821. VAR section: IntermediateCode.Section;
  10822. BEGIN
  10823. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10824. IF implementationVisitor.backend.cooperative THEN
  10825. Info(section, "TypeDescriptor");
  10826. Basic.ToSegmentedName("BaseTypes.Array", name);
  10827. NamedSymbol(section, name,NIL, 0, 0);
  10828. BasePointer(section);
  10829. offset := 0;
  10830. ELSE
  10831. IF ProtectModulesPointers THEN
  10832. HeapBlock(mName,typeName,section,2);
  10833. END;
  10834. Info(section, "HeapBlock");
  10835. IF ProtectModulesPointers THEN
  10836. Symbol(section,section,2,0);
  10837. ELSE
  10838. Address(section,0);
  10839. END;
  10840. Info(section, "TypeDescriptor");
  10841. Address(section,0);
  10842. offset := section.pc;
  10843. END;
  10844. RETURN section
  10845. END NamedBlock;
  10846. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10847. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10848. BEGIN
  10849. COPY(moduleName,name);
  10850. Strings.Append(name,suffix);
  10851. Basic.ToSegmentedName(name, pooledName);
  10852. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10853. END Block;
  10854. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10855. VAR name: Basic.SegmentedName;
  10856. BEGIN
  10857. Info(source,"ArrayHeader");
  10858. IF implementationVisitor.backend.cooperative THEN
  10859. sizePC := source.pc;
  10860. Address(source,0);
  10861. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10862. IF baseType # "" THEN
  10863. Basic.ToSegmentedName(baseType, name);
  10864. NamedSymbol(source, name,NIL, 0, 0);
  10865. ELSE
  10866. Address(source,0);
  10867. END;
  10868. Address(source,0);
  10869. ELSE
  10870. Address(source,0);
  10871. Address(source,0);
  10872. (* first pointer for GC *)
  10873. IF hasPointer THEN
  10874. (* points to first element in the array, this is NOT the base type descriptor *)
  10875. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10876. ELSE
  10877. Address(source,0);
  10878. END;
  10879. sizePC := source.pc;
  10880. Address(source,0);
  10881. Info(source,"array data");
  10882. END;
  10883. END ArrayBlock;
  10884. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10885. BEGIN
  10886. IF implementationVisitor.backend.cooperative THEN
  10887. PatchSize(section, pc, size);
  10888. PatchSize(section, pc + 3, size);
  10889. ELSE
  10890. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10891. PatchSize(section, pc, size);
  10892. END;
  10893. END PatchArray;
  10894. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10895. VAR
  10896. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10897. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10898. poolMap: Basic.HashTableInt;
  10899. namePool: IntermediateCode.Section;
  10900. namePoolOffset: LONGINT;
  10901. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10902. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10903. BEGIN
  10904. Basic.SegmentedNameToString(s1.name,n1);
  10905. Basic.SegmentedNameToString(s2.name,n2);
  10906. index := 0;
  10907. ch1 := n1[index];
  10908. ch2 := n2[index];
  10909. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10910. INC(index);
  10911. ch1 := n1[index];
  10912. ch2 := n2[index];
  10913. END;
  10914. RETURN ch1 < ch2;
  10915. END Compare;
  10916. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10917. VAR
  10918. i, j: LONGINT;
  10919. x, t: Sections.Section;
  10920. BEGIN
  10921. IF lo < hi THEN
  10922. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10923. WHILE i <= j DO
  10924. WHILE Compare(list[i], x) DO INC(i) END;
  10925. WHILE Compare(x, list[j]) DO DEC(j) END;
  10926. IF i <= j THEN
  10927. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10928. INC(i); DEC(j)
  10929. END
  10930. END;
  10931. IF lo < j THEN QuickSort(list, lo, j) END;
  10932. IF i < hi THEN QuickSort(list, i, hi) END
  10933. END;
  10934. END QuickSort;
  10935. (*
  10936. ExportDesc* = RECORD
  10937. fp*: ADDRESS;
  10938. name* {UNTRACED}: DynamicName;
  10939. adr*: ADDRESS;
  10940. exports*: LONGINT;
  10941. dsc* {UNTRACED}: ExportArray
  10942. END;
  10943. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10944. *)
  10945. PROCEDURE ExportDesc2(
  10946. source: IntermediateCode.Section;
  10947. namePool: IntermediateCode.Section;
  10948. fingerPrinter: FingerPrinter.FingerPrinter;
  10949. symbol: Sections.Section;
  10950. name: StringPool.Index;
  10951. VAR patchAdr: LONGINT
  10952. ): BOOLEAN;
  10953. VAR fingerPrint: SyntaxTree.FingerPrint;
  10954. BEGIN
  10955. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10956. & (symbol.type # Sections.InlineCodeSection)
  10957. THEN
  10958. *)
  10959. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10960. & (symbol.type # Sections.ExitCodeSection)
  10961. & (symbol.type # Sections.InlineCodeSection))
  10962. THEN
  10963. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10964. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10965. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10966. Longint(source,fingerPrint.public);
  10967. ELSE
  10968. Longint(source, 0);
  10969. END;
  10970. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10971. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10972. Symbol(source, symbol,0,0);
  10973. patchAdr := source.pc;
  10974. Longint(source, 0);
  10975. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10976. Address(source,0);
  10977. END;
  10978. RETURN TRUE
  10979. ELSE
  10980. RETURN FALSE
  10981. END;
  10982. END ExportDesc2;
  10983. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10984. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10985. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10986. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10987. nextPatch: LONGINT;
  10988. TYPE
  10989. Scope = RECORD
  10990. elements: LONGINT;
  10991. gelements: LONGINT;
  10992. section: IntermediateCode.Section;
  10993. patchAdr: LONGINT;
  10994. arraySizePC: LONGINT;
  10995. beginPC: LONGINT; (* current scope start pc *)
  10996. END;
  10997. BEGIN
  10998. Basic.InitSegmentedName(prev);
  10999. olevel := -1;
  11000. scopes[0].section := source;
  11001. scopes[0].arraySizePC := MIN(LONGINT);
  11002. FOR s := 0 TO LEN(sections)-1 DO
  11003. symbol := sections[s];
  11004. 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
  11005. this := sections[s].name;
  11006. level := 0;
  11007. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11008. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11009. INC(level);
  11010. END;
  11011. WHILE level < olevel DO
  11012. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11013. IF olevel > 0 THEN
  11014. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11015. nextPatch := scopes[olevel-1].patchAdr+1;
  11016. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11017. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11018. END;
  11019. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11020. DEC(olevel);
  11021. END;
  11022. IF (level < LEN(this)) & (this[level] > 0) THEN
  11023. IF level > olevel THEN
  11024. (*TRACE("opening",level); *)
  11025. IF scopes[level].section = NIL THEN
  11026. arrayName := ".@ExportArray";
  11027. Strings.AppendInt(arrayName, level);
  11028. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11029. AddPointer(scopes[level].section,offset);
  11030. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11031. END;
  11032. scopes[level].beginPC := scopes[level].section.pc;
  11033. olevel := level;
  11034. scopes[olevel].elements := 0;
  11035. END;
  11036. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11037. sym := sections[s];
  11038. ELSE
  11039. sym := NIL;
  11040. END;
  11041. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11042. THEN
  11043. INC(scopes[olevel].elements);
  11044. END;
  11045. (* enter string in scope *)
  11046. INC(level);
  11047. END;
  11048. END;
  11049. Basic.SegmentedNameToString(this, name);
  11050. prev := this;
  11051. END;
  11052. END;
  11053. WHILE 0 <= olevel DO
  11054. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11055. IF olevel > 0 THEN
  11056. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11057. nextPatch := scopes[olevel-1].patchAdr+1;
  11058. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11059. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11060. END;
  11061. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11062. DEC(olevel);
  11063. END;
  11064. level := 0;
  11065. WHILE (level < LEN(scopes)) DO
  11066. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11067. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11068. END;
  11069. INC(level);
  11070. END;
  11071. END Export;
  11072. BEGIN
  11073. NEW(fingerPrinter);
  11074. NEW(poolMap, 64);
  11075. (* 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 *)
  11076. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11077. NEW(sectionArray, module.allSections.Length());
  11078. FOR i := 0 TO module.allSections.Length() - 1 DO
  11079. section := module.allSections.GetSection(i);
  11080. sectionArray[i] := section;
  11081. END;
  11082. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11083. Export(sectionArray^);
  11084. END ExportDesc;
  11085. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11086. VAR
  11087. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11088. BEGIN
  11089. Info(source, "exception table offsets array descriptor");
  11090. size := 0;
  11091. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11092. Info(source, "exception table content");
  11093. FOR i := 0 TO module.allSections.Length() - 1 DO
  11094. p := module.allSections.GetSection(i);
  11095. IF p.type = Sections.CodeSection THEN
  11096. finallyPC := p(IntermediateCode.Section).finally;
  11097. IF finallyPC>=0 THEN
  11098. Symbol( source, p, 0,0);
  11099. Symbol( source, p, finallyPC, 0);
  11100. Symbol( source, p, finallyPC,0);
  11101. INC(size);
  11102. END;
  11103. END
  11104. END;
  11105. PatchArray(source,sizePC,size);
  11106. END ExceptionArray;
  11107. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11108. VAR i: LONGINT; ch: CHAR;
  11109. BEGIN
  11110. i := 0;
  11111. REPEAT
  11112. ch := name[i]; INC(i);
  11113. Char( section, ch);
  11114. UNTIL ch = 0X;
  11115. WHILE i < 32 DO
  11116. Char( section, 0X); INC(i);
  11117. END;
  11118. END Name;
  11119. PROCEDURE References(section: IntermediateCode.Section);
  11120. CONST
  11121. sfTypeNone = 0X;
  11122. sfTypeCHAR = 01X;
  11123. sfTypeCHAR8 = 02X;
  11124. sfTypeCHAR16 = 03X;
  11125. sfTypeCHAR32 = 04X;
  11126. sfTypeRANGE = 05X;
  11127. sfTypeSHORTINT = 06X;
  11128. sfTypeINTEGER = 07X;
  11129. sfTypeLONGINT = 08X;
  11130. sfTypeHUGEINT = 09X;
  11131. sfTypeWORD = 0AX;
  11132. sfTypeLONGWORD = 0BX;
  11133. sfTypeSIGNED8 = 0CX;
  11134. sfTypeSIGNED16 = 0DX;
  11135. sfTypeSIGNED32 = 0EX;
  11136. sfTypeSIGNED64 = 0FX;
  11137. sfTypeUNSIGNED8 = 10X;
  11138. sfTypeUNSIGNED16 = 11X;
  11139. sfTypeUNSIGNED32 = 12X;
  11140. sfTypeUNSIGNED64 = 13X;
  11141. sfTypeREAL = 14X;
  11142. sfTypeLONGREAL = 15X;
  11143. sfTypeCOMPLEX = 16X;
  11144. sfTypeLONGCOMPLEX = 17X;
  11145. sfTypeBOOLEAN = 18X;
  11146. sfTypeSET = 19X;
  11147. sfTypeANY = 1AX;
  11148. sfTypeOBJECT = 1BX;
  11149. sfTypeBYTE = 1CX;
  11150. sfTypeADDRESS = 1DX;
  11151. sfTypeSIZE = 1EX;
  11152. sfTypeIndirect = 1FX;
  11153. sfTypeRecord = 20X;
  11154. sfTypePointerToRecord = 21X;
  11155. sfTypePointerToArray = 22X;
  11156. sfTypeOpenArray = 23X;
  11157. sfTypeStaticArray = 24X;
  11158. sfTypeDynamicArray = 25X;
  11159. sfTypeMathStaticArray = 26X;
  11160. sfTypeMathOpenArray = 27X;
  11161. sfTypeMathTensor = 28X;
  11162. sfTypeProcedure = 29X;
  11163. sfTypeDelegate = 2AX;
  11164. sfTypeENUM = 2BX;
  11165. sfTypeCELL = 2CX;
  11166. sfTypePORT = 2DX;
  11167. sfIN = 0X;
  11168. sfOUT = 1X;
  11169. flagDelegate = 0;
  11170. flagConstructor = 1;
  11171. (* variable / parameter addressing modes *)
  11172. sfAbsolute = 0X; (* global vars *)
  11173. sfRelative = 1X; (* variables, value parameters *)
  11174. sfIndirect = 2X; (* var parameters *)
  11175. sfScopeBegin = 0F0X;
  11176. sfScopeEnd = 0F1X;
  11177. sfProcedure = 0F2X;
  11178. sfVariable = 0F3X;
  11179. sfTypeDeclaration = 0F4X;
  11180. sfModule = 0FFX;
  11181. RefInfo = TRUE;
  11182. VAR
  11183. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11184. indirectTypes: Basic.HashTable;
  11185. PROCEDURE CurrentIndex(): LONGINT;
  11186. VAR i: LONGINT;
  11187. BEGIN
  11188. FOR i := startPC TO section.pc -1 DO
  11189. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11190. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11191. END;
  11192. startPC := section.pc;
  11193. RETURN lastOffset;
  11194. END CurrentIndex;
  11195. (*
  11196. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11197. Module = sfModule prevSymbol:SIZE name:String Scope.
  11198. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11199. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11200. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11201. Type =
  11202. sfTypePointerToRecord
  11203. | sfTypePointerToArray Type
  11204. | sfTypeOpenArray Type
  11205. | sfTypeDynamicArray Type
  11206. | sfTypeStaticArray length:SIZE Type
  11207. | sfTypeMathOpenArray Type
  11208. | sfTypeMathStaticArray length:SIZE Type
  11209. | sfTypeMathTensor Type
  11210. | sfTypeRecord tdAdr:ADDRESS
  11211. | sfTypeProcedure {Parameter} return:Type
  11212. | sfTypeDelegate {Parameter} return:Type
  11213. | sfTypePort (sfIN | sfOUT)
  11214. | sfTypeBOOLEAN
  11215. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11216. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11217. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11218. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11219. | sfTypeWORD | sfTypeLONGWORD
  11220. | sfTypeREAL | sfTypeLONGREAL
  11221. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11222. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11223. | sfTypeIndirect offset:SIZE.
  11224. *)
  11225. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11226. VAR offset: SIZE;
  11227. BEGIN
  11228. IF indirectTypes.Has(type) THEN
  11229. offset := indirectTypes.GetInt(type);
  11230. Char(section, sfTypeIndirect);
  11231. Size(section, offset);
  11232. RETURN TRUE;
  11233. ELSE
  11234. indirectTypes.PutInt(type, CurrentIndex());
  11235. RETURN FALSE;
  11236. END;
  11237. END Indirect;
  11238. PROCEDURE NType(type: SyntaxTree.Type);
  11239. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11240. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11241. BEGIN
  11242. IF type = NIL THEN
  11243. Char(section, sfTypeNone)
  11244. ELSE
  11245. type := type.resolved;
  11246. size := type.sizeInBits;
  11247. WITH type:SyntaxTree.PointerType DO
  11248. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11249. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11250. Char(section, sfTypePointerToRecord);
  11251. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11252. ELSE
  11253. IF RefInfo THEN Info(section,"PointerToArray") END;
  11254. Char(section, sfTypePointerToArray);
  11255. NType(type.pointerBase);
  11256. END;
  11257. | type: SyntaxTree.ArrayType DO
  11258. IF ~Indirect(type) THEN
  11259. IF type.form = SyntaxTree.Open THEN
  11260. IF RefInfo THEN Info(section,"OpenArray") END;
  11261. Char(section, sfTypeOpenArray);
  11262. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11263. IF RefInfo THEN Info(section,"DynamicArray") END;
  11264. Char(section, sfTypeDynamicArray);
  11265. ELSIF type.form = SyntaxTree.Static THEN
  11266. IF RefInfo THEN Info(section,"StaticArray") END;
  11267. Char(section, sfTypeStaticArray);
  11268. Size(section, type.staticLength);
  11269. ELSE
  11270. HALT(100);
  11271. END;
  11272. NType(type.arrayBase);
  11273. END;
  11274. | type: SyntaxTree.MathArrayType DO
  11275. IF ~Indirect(type) THEN
  11276. IF type.form = SyntaxTree.Open THEN
  11277. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11278. Char(section, sfTypeMathOpenArray);
  11279. ELSIF type.form = SyntaxTree.Static THEN
  11280. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11281. Char(section, sfTypeMathStaticArray);
  11282. Size(section, type.staticLength);
  11283. ELSIF type.form = SyntaxTree.Tensor THEN
  11284. IF RefInfo THEN Info(section,"MathTensor") END;
  11285. Char(section, sfTypeMathTensor);
  11286. ELSE
  11287. HALT(100);
  11288. END;
  11289. NType(type.arrayBase);
  11290. END;
  11291. | type: SyntaxTree.RecordType DO
  11292. IF ~Indirect(type) THEN
  11293. IF type.pointerType # NIL (* OBJECT *) THEN
  11294. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11295. Char(section, sfTypePointerToRecord)
  11296. ELSE
  11297. IF RefInfo THEN Info(section,"Record") END;
  11298. Char(section, sfTypeRecord);
  11299. td := type.typeDeclaration;
  11300. IF RefInfo THEN Info(section,"TD") END;
  11301. IF (td # NIL) THEN
  11302. Global.GetSymbolSegmentedName(td,segmentedName);
  11303. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11304. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11305. ELSE
  11306. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11307. END;
  11308. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11309. Symbol(section, tir, 0, offset);
  11310. ELSE
  11311. Address(section, 0);
  11312. END;
  11313. END;
  11314. END;
  11315. | type: SyntaxTree.CellType DO
  11316. IF ~Indirect(type) THEN
  11317. IF RefInfo THEN Info(section,"Record") END;
  11318. Char(section, sfTypeRecord);
  11319. td := type.typeDeclaration;
  11320. IF RefInfo THEN Info(section,"TD") END;
  11321. IF (td # NIL) THEN
  11322. Global.GetSymbolSegmentedName(td,segmentedName);
  11323. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11324. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11325. ELSE
  11326. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11327. END;
  11328. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11329. Symbol(section, tir, 0, offset);
  11330. ELSE
  11331. Address(section, 0);
  11332. END;
  11333. END;
  11334. | type: SyntaxTree.PortType DO
  11335. Char(section, sfTypePORT);
  11336. IF type.direction = SyntaxTree.OutPort THEN
  11337. Char(section, sfOUT)
  11338. ELSE
  11339. Char(section, sfIN)
  11340. END;
  11341. | type: SyntaxTree.ProcedureType DO
  11342. IF ~Indirect(type) THEN
  11343. IF type.isDelegate THEN
  11344. Char(section, sfTypeDelegate);
  11345. ELSE
  11346. Char(section, sfTypeProcedure);
  11347. END;
  11348. parameter := type.firstParameter;
  11349. WHILE(parameter # NIL) DO
  11350. NParameter(parameter, -1);
  11351. parameter := parameter.nextParameter;
  11352. END;
  11353. NType(type.returnType);
  11354. END;
  11355. | type:SyntaxTree.EnumerationType DO
  11356. Char(section, sfTypeENUM);
  11357. | type: SyntaxTree.BasicType DO
  11358. WITH type: SyntaxTree.BooleanType DO
  11359. IF RefInfo THEN Info(section,"Boolean") END;
  11360. Char(section, sfTypeBOOLEAN);
  11361. | type: SyntaxTree.CharacterType DO
  11362. IF type = module.system.characterType THEN
  11363. IF RefInfo THEN Info(section,"CHAR") END;
  11364. Char(section, sfTypeCHAR);
  11365. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11366. IF RefInfo THEN Info(section,"CHAR8") END;
  11367. Char(section, sfTypeCHAR8)
  11368. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11369. IF RefInfo THEN Info(section,"CHAR16") END;
  11370. Char(section, sfTypeCHAR16);
  11371. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11372. IF RefInfo THEN Info(section,"CHAR32") END;
  11373. Char(section, sfTypeCHAR32);
  11374. ELSE
  11375. HALT(100);
  11376. END;
  11377. |type: SyntaxTree.IntegerType DO
  11378. IF type(SyntaxTree.IntegerType).signed THEN
  11379. IF (type = module.system.shortintType) THEN
  11380. IF RefInfo THEN Info(section,"SHORTINT") END;
  11381. Char(section, sfTypeSHORTINT)
  11382. ELSIF (type = module.system.integerType) THEN
  11383. IF RefInfo THEN Info(section,"INTEGER") END;
  11384. Char(section, sfTypeINTEGER)
  11385. ELSIF (type = module.system.longintType) THEN
  11386. IF RefInfo THEN Info(section,"LONGINT") END;
  11387. Char(section, sfTypeLONGINT)
  11388. ELSIF (type = module.system.hugeintType) THEN
  11389. IF RefInfo THEN Info(section,"HUGEINT") END;
  11390. Char(section, sfTypeHUGEINT)
  11391. ELSIF (type = module.system.wordType) THEN
  11392. IF RefInfo THEN Info(section,"WORD") END;
  11393. Char(section, sfTypeWORD)
  11394. ELSIF (type = module.system.longWordType) THEN
  11395. IF RefInfo THEN Info(section,"LONGWORD") END;
  11396. Char(section, sfTypeLONGWORD);
  11397. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11398. IF RefInfo THEN Info(section,"SIGNED8") END;
  11399. Char(section, sfTypeSIGNED8)
  11400. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11401. IF RefInfo THEN Info(section,"SIGNED16") END;
  11402. Char(section, sfTypeSIGNED16)
  11403. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11404. IF RefInfo THEN Info(section,"SIGNED32") END;
  11405. Char(section, sfTypeSIGNED32)
  11406. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11407. IF RefInfo THEN Info(section,"SIGNED64") END;
  11408. Char(section, sfTypeSIGNED64)
  11409. ELSE
  11410. HALT(100);
  11411. END
  11412. ELSE (* unsigned *)
  11413. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11414. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11415. Char(section, sfTypeUNSIGNED8)
  11416. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11417. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11418. Char(section, sfTypeUNSIGNED16)
  11419. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11420. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11421. Char(section, sfTypeUNSIGNED32)
  11422. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11423. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11424. Char(section, sfTypeUNSIGNED64)
  11425. ELSE
  11426. HALT(100)
  11427. END
  11428. END;
  11429. | type: SyntaxTree.FloatType DO
  11430. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11431. IF RefInfo THEN Info(section,"REAL") END;
  11432. Char(section, sfTypeREAL);
  11433. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11434. IF RefInfo THEN Info(section,"LONGREAL") END;
  11435. Char(section, sfTypeLONGREAL);
  11436. ELSE
  11437. HALT(100);
  11438. END;
  11439. |type: SyntaxTree.ComplexType DO
  11440. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11441. IF RefInfo THEN Info(section,"COMPLEX") END;
  11442. Char(section, sfTypeCOMPLEX);
  11443. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11444. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11445. Char(section, sfTypeLONGCOMPLEX);
  11446. ELSE
  11447. HALT(100);
  11448. END;
  11449. |type:SyntaxTree.SetType DO
  11450. IF RefInfo THEN Info(section,"SET") END;
  11451. Char(section, sfTypeSET);
  11452. |type:SyntaxTree.AnyType DO
  11453. IF RefInfo THEN Info(section,"ANY") END;
  11454. Char(section, sfTypeANY);
  11455. |type:SyntaxTree.ObjectType DO
  11456. IF RefInfo THEN Info(section,"OBJECT") END;
  11457. Char(section, sfTypeOBJECT);
  11458. |type:SyntaxTree.ByteType DO
  11459. IF RefInfo THEN Info(section,"BYTE") END;
  11460. Char(section, sfTypeBYTE);
  11461. |type:SyntaxTree.RangeType DO
  11462. IF RefInfo THEN Info(section,"RANGE") END;
  11463. Char(section, sfTypeRANGE)
  11464. |type:SyntaxTree.AddressType DO
  11465. IF RefInfo THEN Info(section,"ADDRESS") END;
  11466. Char(section, sfTypeADDRESS)
  11467. |type:SyntaxTree.SizeType DO
  11468. IF RefInfo THEN Info(section,"SIZE") END;
  11469. Char(section, sfTypeSIZE)
  11470. ELSE
  11471. HALT(100)
  11472. END;
  11473. ELSE HALT(101);
  11474. END;
  11475. END;
  11476. END NType;
  11477. (*
  11478. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11479. *)
  11480. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11481. VAR pos: LONGINT; type: SyntaxTree.Type;
  11482. BEGIN
  11483. IF RefInfo THEN Info(section, "Parameter") END;
  11484. Char(section, sfVariable);
  11485. Size(section, procOffset);
  11486. String0(section, parameter.name);
  11487. type := parameter.type.resolved;
  11488. IF parameter.kind = SyntaxTree.VarParameter THEN
  11489. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11490. ELSE Char(section, sfIndirect)
  11491. END;
  11492. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11493. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11494. Char(section, sfIndirect);
  11495. ELSE
  11496. Char(section, sfRelative);
  11497. END;
  11498. ELSE
  11499. Char(section, sfRelative);
  11500. END;
  11501. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11502. NType(parameter.type);
  11503. END NParameter;
  11504. (*
  11505. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11506. *)
  11507. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11508. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11509. flags: SET;
  11510. BEGIN
  11511. IF procedure.externalName # NIL THEN RETURN END;
  11512. IF RefInfo THEN Info(section, "Procedure") END;
  11513. pos := CurrentIndex();
  11514. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11515. Char(section, sfProcedure);
  11516. Size(section, scopeOffset);
  11517. String0(section,procedure.name);
  11518. s := module.allSections.FindBySymbol(procedure);
  11519. Symbol(section,s,0,0); (* start *)
  11520. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11521. flags := {};
  11522. IF procedureType.isDelegate THEN
  11523. INCL(flags, flagDelegate);
  11524. END;
  11525. IF procedure.isConstructor THEN
  11526. INCL(flags, flagConstructor);
  11527. END;
  11528. Set(section, flags);
  11529. IF RefInfo THEN Info(section, "Parameters") END;
  11530. parameter := procedureType.firstParameter;
  11531. WHILE(parameter # NIL) DO
  11532. NParameter(parameter, pos);
  11533. parameter := parameter.nextParameter;
  11534. END;
  11535. IF procedureType.returnParameter # NIL THEN
  11536. NParameter(procedureType.returnParameter, pos);
  11537. END;
  11538. IF procedureType.selfParameter # NIL THEN
  11539. NParameter(procedureType.selfParameter, pos);
  11540. END;
  11541. IF RefInfo THEN Info(section, "ReturnType") END;
  11542. NType(procedureType.returnType);
  11543. NScope(procedure.procedureScope, pos);
  11544. END NProcedure;
  11545. (*
  11546. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11547. *)
  11548. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11549. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11550. BEGIN
  11551. IF RefInfo THEN Info(section, "Variable") END;
  11552. pos := CurrentIndex();
  11553. Char(section, sfVariable);
  11554. Size(section, scopeOffset);
  11555. String0(section, variable.name);
  11556. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11557. Char(section, sfAbsolute);
  11558. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11559. NamedSymbol(section, sn,variable, 0,0);
  11560. ELSE
  11561. Char(section, sfRelative);
  11562. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11563. END;
  11564. NType(variable.type);
  11565. s := module.allSections.FindBySymbol(variable);
  11566. END NVariable;
  11567. (*
  11568. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11569. *)
  11570. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11571. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11572. BEGIN
  11573. IF typeDeclaration = NIL THEN RETURN END;
  11574. pos := CurrentIndex();
  11575. s := module.allSections.FindBySymbol(typeDeclaration);
  11576. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11577. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11578. Char(section, sfTypeDeclaration);
  11579. Size(section, scopeOffset);
  11580. String0(section, typeDeclaration.name);
  11581. declared := typeDeclaration.declaredType.resolved;
  11582. IF (declared IS SyntaxTree.PointerType) THEN
  11583. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11584. END;
  11585. WITH declared: SyntaxTree.RecordType DO
  11586. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11587. Symbol(section, s, 0, offset);
  11588. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11589. Basic.AppendToSegmentedName(name,".@Info");
  11590. s := module.allSections.FindByName(name);
  11591. IF s # NIL THEN (* does not work for coop *)
  11592. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11593. END;
  11594. NScope(declared.recordScope, pos);
  11595. |declared: SyntaxTree.CellType DO
  11596. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11597. Symbol(section, s, 0, offset);
  11598. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11599. Basic.AppendToSegmentedName(name,".@Info");
  11600. s := module.allSections.FindByName(name);
  11601. IF s # NIL THEN
  11602. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11603. END;
  11604. NScope(declared.cellScope, pos);
  11605. ELSE
  11606. Address(section, 0);
  11607. END;
  11608. END NTypeDeclaration;
  11609. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11610. VAR pos: LONGINT;
  11611. BEGIN
  11612. pos := CurrentIndex();
  11613. Char(section,sfModule);
  11614. Size(section, prevSymbol);
  11615. String0(section, module.name);
  11616. NScope(module.moduleScope, pos);
  11617. END NModule;
  11618. (*
  11619. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11620. *)
  11621. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11622. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11623. BEGIN
  11624. IF scope = NIL THEN RETURN END;
  11625. IF RefInfo THEN Info(section, "Scope") END;
  11626. Char(section, sfScopeBegin);
  11627. variable := scope.firstVariable;
  11628. WHILE (variable # NIL) DO
  11629. NVariable(variable, prevSymbol);
  11630. variable := variable.nextVariable;
  11631. END;
  11632. WITH scope: SyntaxTree.ModuleScope DO
  11633. bodyProcedure := scope.bodyProcedure;
  11634. |scope: SyntaxTree.RecordScope DO
  11635. bodyProcedure := scope.bodyProcedure;
  11636. ELSE
  11637. bodyProcedure := NIL;
  11638. END;
  11639. IF bodyProcedure # NIL THEN
  11640. NProcedure(bodyProcedure, prevSymbol)
  11641. END;
  11642. procedure := scope.firstProcedure;
  11643. WHILE procedure # NIL DO
  11644. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11645. procedure := procedure.nextProcedure;
  11646. END;
  11647. typeDeclaration := scope.firstTypeDeclaration;
  11648. WHILE typeDeclaration # NIL DO
  11649. NTypeDeclaration(typeDeclaration, prevSymbol);
  11650. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11651. END;
  11652. Char(section, sfScopeEnd); (* scope ends *)
  11653. END NScope;
  11654. BEGIN
  11655. NEW(indirectTypes, 32);
  11656. ArrayBlock(section,sizePC,"", FALSE);
  11657. startPC := section.pc;
  11658. NModule(module.module, -1);
  11659. PatchArray(section,sizePC,CurrentIndex());
  11660. END References;
  11661. (*
  11662. Command* = RECORD
  11663. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11664. name*: Name; (* name of the procedure *)
  11665. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11666. entryAdr* : ADDRESS; (* entry address of procedure *)
  11667. END;
  11668. *)
  11669. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11670. VAR
  11671. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11672. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11673. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11674. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11675. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11676. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11677. BEGIN
  11678. RETURN
  11679. (type = NIL) OR
  11680. (type.resolved IS SyntaxTree.RecordType) OR
  11681. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11682. (type.resolved IS SyntaxTree.AnyType);
  11683. END TypeAllowed;
  11684. BEGIN
  11685. numberParameters := procedureType.numberParameters;
  11686. RETURN
  11687. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11688. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11689. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11690. END GetProcedureAllowed;
  11691. PROCEDURE WriteType(type : SyntaxTree.Type);
  11692. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11693. name: Basic.SegmentedName; offset: LONGINT;
  11694. BEGIN
  11695. IF type = NIL THEN
  11696. Address(source,0);
  11697. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11698. Address(source,1);
  11699. ELSE
  11700. type := type.resolved;
  11701. IF type IS SyntaxTree.PointerType THEN
  11702. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11703. END;
  11704. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11705. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11706. name[0] := typeDeclaration.name; name[1] := -1;
  11707. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11708. ASSERT(section # NIL);
  11709. ELSE
  11710. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11711. (* TODO *)
  11712. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11713. END;
  11714. IF implementationVisitor.backend.cooperative THEN
  11715. offset := 0;
  11716. ELSE
  11717. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11718. END;
  11719. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11720. END;
  11721. END WriteType;
  11722. BEGIN
  11723. Info(source, "command array descriptor");
  11724. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11725. numberCommands := 0;
  11726. Info(source, "command array content");
  11727. FOR i := 0 TO module.allSections.Length() - 1 DO
  11728. p := module.allSections.GetSection(i);
  11729. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11730. procedure := p.symbol(SyntaxTree.Procedure);
  11731. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11732. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11733. procedure.GetName(name);
  11734. Name(source,name);
  11735. numberParameters := procedureType.numberParameters;
  11736. (* offset of type of first parameter *)
  11737. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11738. ELSE WriteType(procedureType.firstParameter.type)
  11739. END;
  11740. (* offset of type of return parameter *)
  11741. WriteType(procedureType.returnType);
  11742. (* command name *)
  11743. (* command code offset *)
  11744. Symbol(source,p,0,0);
  11745. INC(numberCommands);
  11746. IF Trace THEN
  11747. D.Ln;
  11748. END;
  11749. END;
  11750. END
  11751. END;
  11752. PatchArray(source,sizePC,numberCommands);
  11753. END CommandArray;
  11754. (* to prevent from double import of different module aliases *)
  11755. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11756. VAR i: SyntaxTree.Import;
  11757. BEGIN
  11758. i := module.module.moduleScope.firstImport;
  11759. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11760. i := i.nextImport;
  11761. END;
  11762. RETURN i = import
  11763. END IsFirstDirectOccurence;
  11764. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11765. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11766. BEGIN
  11767. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11768. ArrayBlock(source,pc,"", FALSE);
  11769. Info(source, "import module array data");
  11770. IF implementationVisitor.backend.cooperative THEN
  11771. offset := 0;
  11772. ELSE
  11773. IF module.system.addressType.sizeInBits = 64 THEN
  11774. (* change this when Heaps.HeapBlock is modified *)
  11775. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11776. ELSE
  11777. (* change this when Heaps.HeapBlock is modified *)
  11778. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11779. END;
  11780. END;
  11781. import := module.module.moduleScope.firstImport;
  11782. numberImports := 0;
  11783. WHILE import # NIL DO
  11784. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11785. Global.GetModuleSegmentedName(import.module,name);
  11786. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11787. NamedSymbol(source, name, NIL, 0, offset);
  11788. INC(numberImports);
  11789. END;
  11790. import := import.nextImport
  11791. END;
  11792. PatchArray(source,pc,numberImports);
  11793. END ImportsArray;
  11794. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11795. VAR
  11796. p: Sections.Section; sizePC, size, i: LONGINT;
  11797. BEGIN
  11798. Info(source, "Type info section");
  11799. size := 0;
  11800. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11801. FOR i := 0 TO module.allSections.Length() - 1 DO
  11802. p := module.allSections.GetSection(i);
  11803. WITH p: IntermediateCode.Section DO
  11804. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11805. Symbol(source,p,EmptyBlockOffset,0);
  11806. INC(size);
  11807. END;
  11808. END
  11809. END;
  11810. PatchArray(source,sizePC,size);
  11811. END TypeInfoSection;
  11812. (*
  11813. ProcTableEntry* = RECORD
  11814. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11815. noPtr*: LONGINT;
  11816. END;
  11817. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11818. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11819. *)
  11820. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11821. VAR
  11822. numberPointers: LONGINT;
  11823. procedure: SyntaxTree.Procedure;
  11824. BEGIN
  11825. Info(section,"pcFrom");
  11826. Symbol(section,procedureSection,0,0);
  11827. Info(section,"pcTo");
  11828. Symbol(section, procedureSection, procedureSection.pc, 0);
  11829. Info(section,"pointer to offsets array");
  11830. Symbol(section, section,section.pc+1,0);
  11831. Info(section,"offsets array");
  11832. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11833. PointerArray(section, procedure.procedureScope, numberPointers);
  11834. END ProcedureDescriptor;
  11835. (* only for tracing, the descriptor is otherwise not complete ! *)
  11836. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11837. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11838. BEGIN
  11839. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11840. name := procedureSection.name;
  11841. Basic.AppendToSegmentedName(name,".@Info");
  11842. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11843. Address(section,0);
  11844. Symbol(section,section,2,0);
  11845. (*
  11846. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11847. descSize: SIZE;
  11848. sentinel: ADDRESS; (* = MPO-4 *)
  11849. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11850. flags*: SET;
  11851. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11852. name*: Name;
  11853. END;
  11854. *)
  11855. Size(section, 0);
  11856. Address(section,0);
  11857. Address(section,0);
  11858. Set(section,{});
  11859. moduleSection := ModuleSection();
  11860. Symbol( section, moduleSection, moduleSection.pc,0);
  11861. IF procedureSection.symbol = NIL THEN
  11862. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11863. ELSE
  11864. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11865. END;
  11866. Name(section, infoName);
  11867. Size(section, 0);
  11868. RETURN section;
  11869. END MakeProcedureDescriptorTag;
  11870. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11871. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11872. BEGIN
  11873. name := procedureSection.name;
  11874. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11875. IF implementationVisitor.backend.cooperative THEN
  11876. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11877. Info(section, "TypeDescriptor");
  11878. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11879. NamedSymbol(dest, name,NIL, 0, 0);
  11880. BaseRecord(dest);
  11881. offset := 0;
  11882. ELSIF CreateProcedureDescInfo THEN
  11883. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11884. Address(dest,0);
  11885. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11886. offset := dest.pc;
  11887. ELSE
  11888. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11889. END;
  11890. ProcedureDescriptor(dest, procedureSection);
  11891. Symbol(section, dest, offset, 0);
  11892. END ProcedureDescriptorPointer;
  11893. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11894. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11895. BEGIN
  11896. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11897. numberProcs := 0;
  11898. FOR i := 0 TO module.allSections.Length() - 1 DO
  11899. destination := module.allSections.GetSection(i);
  11900. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11901. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11902. INC(numberProcs);
  11903. END
  11904. END;
  11905. PatchArray(section, sizePC, numberProcs);
  11906. END ProcedureDescriptorArray;
  11907. (*
  11908. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11909. VAR
  11910. next*: Module; (** once a module is published, all fields are read-only *)
  11911. name*: Name;
  11912. init, published: BOOLEAN;
  11913. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11914. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11915. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11916. command*: POINTER TO ARRAY OF Command;
  11917. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11918. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11919. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11920. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11921. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11922. data*, code*: Bytes;
  11923. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11924. export*: ExportDesc;
  11925. term*: TerminationHandler;
  11926. exTable*: ExceptionTable;
  11927. noProcs*: LONGINT;
  11928. firstProc*: ADDRESS; <- done by loader
  11929. maxPtrs*: LONGINT;
  11930. crc*: LONGINT;
  11931. *)
  11932. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11933. BEGIN
  11934. Info(section, "cycle");
  11935. Size(section,0);
  11936. Info(section, "references");
  11937. Size(section,0);
  11938. Info(section, "nextMarked");
  11939. Address(section,0);
  11940. Info(section, "nextWatched");
  11941. Address(section,0);
  11942. END BasePointer;
  11943. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11944. BEGIN
  11945. BasePointer(section);
  11946. Info(section, "action");
  11947. Address(section,0);
  11948. Info(section, "monitor");
  11949. Address(section,0);
  11950. END BaseObject;
  11951. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11952. BEGIN
  11953. BasePointer(section);
  11954. Info(section, "action");
  11955. Address(section,0);
  11956. Info(section, "monitor");
  11957. Address(section,0);
  11958. END BaseRecord;
  11959. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11960. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11961. pooledName: Basic.SegmentedName;
  11962. symbol: SyntaxTree.Symbol;
  11963. BEGIN
  11964. Global.GetModuleName(module.module,name);
  11965. Strings.Append(name,".@Module.@Descriptor");
  11966. Basic.ToSegmentedName(name, pooledName);
  11967. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11968. Symbol(section,descriptorSection,0,0);
  11969. Info(descriptorSection, "descriptor");
  11970. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11971. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11972. Address(descriptorSection,0);
  11973. Global.GetModuleName(module.module,name);
  11974. Strings.Append(name,".@Trace");
  11975. Basic.ToSegmentedName(name, pooledName);
  11976. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11977. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11978. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11979. END ModuleDescriptor;
  11980. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11981. VAR name: ARRAY 128 OF CHAR;
  11982. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11983. symbol: SyntaxTree.Symbol;
  11984. BEGIN
  11985. Global.GetModuleName(module.module,name);
  11986. Strings.Append(name,".@Module");
  11987. Basic.ToSegmentedName(name, pooledName);
  11988. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11989. moduleSection.SetExported(TRUE);
  11990. IF moduleSection.pc = 0 THEN
  11991. IF implementationVisitor.backend.cooperative THEN
  11992. Info(moduleSection, "descriptor");
  11993. ModuleDescriptor(moduleSection);
  11994. BaseObject(moduleSection);
  11995. implementationVisitor.CreateTraceModuleMethod(module.module);
  11996. ELSE
  11997. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11998. Info(moduleSection, "HeapBlock");
  11999. Symbol(moduleSection,moduleSection,2,0);
  12000. Info(moduleSection, "TypeDescriptor");
  12001. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12002. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12003. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12004. END;
  12005. END;
  12006. RETURN moduleSection;
  12007. END ModuleSection;
  12008. PROCEDURE NewModuleInfo();
  12009. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12010. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12011. sectionName: Basic.SectionName;
  12012. CONST MPO=-40000000H;
  12013. BEGIN
  12014. (*
  12015. TypeDesc* = POINTER TO RECORD
  12016. descSize: SIZE;
  12017. sentinel: LONGINT; (* = MPO-4 *)
  12018. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12019. flags*: SET;
  12020. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12021. name*: Name;
  12022. refsOffset: SIZE;
  12023. END;
  12024. *)
  12025. (*name is missing prefixes sometimes*)
  12026. Global.GetModuleSegmentedName(module.module,name);
  12027. Basic.AppendToSegmentedName(name,".@Info");
  12028. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12029. IF ~implementationVisitor.backend.cooperative THEN
  12030. Info(source, "HeapBlock");
  12031. Address(source,0); (* an empty heap block prevents GC marking *)
  12032. Info(source, "TypeDescriptor");
  12033. Address(source,0);
  12034. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12035. END;
  12036. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12037. Address(source,MPO-4);
  12038. Info(source, "type tag pointer");
  12039. Address( source,0);
  12040. Info(source, "type flags");
  12041. flags := {};
  12042. Set( source, flags);
  12043. Info(source, "pointer to module");
  12044. moduleSection := ModuleSection();
  12045. Symbol( source, moduleSection, moduleSection.pc,0);
  12046. Info(source, "type name");
  12047. i := 0;
  12048. sectionName := "@Self";
  12049. (*
  12050. Global.GetSymbolSegmentedName(td,name);
  12051. Basic.SegmentedNameToString(name, sectionName);
  12052. *)
  12053. Name(source,sectionName);
  12054. patchInfoPC := source.pc;
  12055. Size(source, 0);
  12056. END NewModuleInfo;
  12057. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12058. VAR
  12059. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12060. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12061. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12062. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12063. referenceSectionOffset : LONGINT;
  12064. name: Basic.SegmentedName; offset: LONGINT;
  12065. flags: SET;
  12066. BEGIN
  12067. NewModuleInfo();
  12068. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12069. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12070. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12071. ImportsArray(importSection);
  12072. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12073. CommandArray(commandsSection);
  12074. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12075. ExceptionArray(exceptionSection);
  12076. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12077. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12078. TypeInfoSection(typeInfoSection);
  12079. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12080. referenceSection.SetExported(TRUE);
  12081. References(referenceSection);
  12082. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12083. ProcedureDescriptorArray(procTableSection, numberProcs);
  12084. IF ProtectModulesPointers THEN
  12085. name := "Heaps.AnyPtr";
  12086. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12087. (* set base pointer *)
  12088. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12089. END;
  12090. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12091. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12092. moduleSection := ModuleSection();
  12093. Info(moduleSection, "nextRoot*: RootObject");
  12094. Address(moduleSection,0);
  12095. Info(moduleSection, "next*: Module");
  12096. Address(moduleSection,0);
  12097. Info(moduleSection, "name*: Name");
  12098. Name(moduleSection,moduleName);
  12099. Info(moduleSection, "init, published: BOOLEAN");
  12100. Boolean(moduleSection,FALSE);
  12101. Boolean(moduleSection,FALSE);
  12102. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12103. Boolean(moduleSection,FALSE);
  12104. Boolean(moduleSection,FALSE);
  12105. Info(moduleSection, "refcnt*: LONGINT");
  12106. Longint(moduleSection,0);
  12107. Info(moduleSection, "sb*: ADDRESS");
  12108. Address(moduleSection,0);
  12109. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12110. Address(moduleSection,0);
  12111. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12112. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12113. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12114. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12115. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12116. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12117. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12118. Symbol(moduleSection,importSection,importSectionOffset,0);
  12119. Info(moduleSection, "procTable*: ProcTable");
  12120. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12121. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12122. Address(moduleSection,0);
  12123. Address(moduleSection,0);
  12124. Address(moduleSection,0);
  12125. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12126. Info(moduleSection, "export*: ExportDesc");
  12127. ExportDesc(moduleSection);
  12128. Info(moduleSection, "term*: TerminationHandler");
  12129. Address(moduleSection,0);
  12130. Info(moduleSection, "exTable*: ExceptionTable");
  12131. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12132. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12133. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12134. Info(moduleSection, "crc*: LONGINT");
  12135. patchCRC:= moduleSection.pc;
  12136. Longint(moduleSection, 0); (*! must be implemented *)
  12137. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12138. Info(moduleSection, "body*: ADDRESS");
  12139. Symbol(moduleSection, bodyProc, 0,0);
  12140. Info(moduleSection, "module flags");
  12141. flags := {};
  12142. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12143. Set( moduleSection, flags);
  12144. IF implementationVisitor.backend.cooperative THEN
  12145. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12146. Info(moduleSection, "monitor.owner");
  12147. Address(moduleSection,0);
  12148. Info(moduleSection, "monitor.nestingLevel");
  12149. Address(moduleSection,0);
  12150. Info(moduleSection, "monitor.blockedQueue");
  12151. Address(moduleSection,0); Address(moduleSection,0);
  12152. Info(moduleSection, "monitor.waitingQueue");
  12153. Address(moduleSection,0); Address(moduleSection,0);
  12154. Info(moduleSection, "monitor.waitingSentinel");
  12155. Address(moduleSection,0);
  12156. END;
  12157. END Module;
  12158. PROCEDURE PatchCRC(crc: LONGINT);
  12159. BEGIN
  12160. IF ~simple THEN
  12161. PatchLongint(ModuleSection(), patchCRC, crc);
  12162. END;
  12163. END PatchCRC;
  12164. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12165. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12166. BEGIN
  12167. ArrayBlock(source,pc,"",FALSE);
  12168. Info(source, "pointer offsets array data");
  12169. IF scope IS SyntaxTree.RecordScope THEN
  12170. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12171. ELSIF scope IS SyntaxTree.CellScope THEN
  12172. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12173. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12174. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12175. WHILE variable # NIL DO
  12176. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12177. symbol := module.allSections.FindBySymbol(variable);
  12178. ASSERT(symbol # NIL);
  12179. Pointers(0,symbol, source,variable.type,numberPointers);
  12180. END;
  12181. variable := variable.nextVariable;
  12182. END;
  12183. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12184. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12185. WHILE parameter # NIL DO
  12186. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12187. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12188. END;
  12189. parameter := parameter.nextParameter;
  12190. END;
  12191. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12192. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12193. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12194. IF implementationVisitor.backend.preciseGC THEN
  12195. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12196. END;
  12197. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12198. END;
  12199. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12200. WHILE(variable # NIL) DO
  12201. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12202. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12203. END;
  12204. variable := variable.nextVariable
  12205. END;
  12206. END;
  12207. PatchArray(source,pc,numberPointers);
  12208. END PointerArray;
  12209. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12210. VAR
  12211. name: Basic.SegmentedName;
  12212. section: IntermediateCode.Section;
  12213. BEGIN
  12214. Global.GetSymbolSegmentedName(symbol,name);
  12215. Basic.AppendToSegmentedName(name,suffix);
  12216. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12217. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12218. Info(section, "HeapBlock");
  12219. Address(section,0); (* empty such that GC does not go on traversing *)
  12220. Info(section, suffix);
  12221. Address(section,0);
  12222. pc := section.pc;
  12223. RETURN section;
  12224. END SymbolSection;
  12225. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12226. VAR recordType: SyntaxTree.RecordType;
  12227. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12228. section: Sections.Section; cellType: SyntaxTree.CellType;
  12229. tdInfoOffset: LONGINT;
  12230. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12231. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12232. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12233. sectionName: Basic.SectionName;
  12234. CONST MPO=-40000000H;
  12235. BEGIN
  12236. (*
  12237. TypeDesc* = POINTER TO RECORD
  12238. descSize: SIZE;
  12239. sentinel: LONGINT; (* = MPO-4 *)
  12240. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12241. flags*: SET;
  12242. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12243. name*: Name;
  12244. refsOffset: SIZE;
  12245. END;
  12246. *)
  12247. (* source := module.sections.FindByName(...) *)
  12248. Global.GetSymbolSegmentedName(td,name);
  12249. Basic.AppendToSegmentedName(name,".@Info");
  12250. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12251. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12252. Address(source,0);
  12253. Info(source, "TypeDescriptor");
  12254. Address(source,0);
  12255. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12256. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12257. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12258. Info(source, "type tag pointer");
  12259. Symbol( source, tag, offset, 0);
  12260. Info(source, "type flags");
  12261. flags := {};
  12262. IF isProtected THEN INCL(flags,31) END;
  12263. Set( source, flags);
  12264. Info(source, "pointer to module");
  12265. moduleSection := ModuleSection();
  12266. Symbol( source, moduleSection, moduleSection.pc,0);
  12267. Info(source, "type name");
  12268. i := 0;
  12269. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12270. (*
  12271. Global.GetSymbolSegmentedName(td,name);
  12272. Basic.SegmentedNameToString(name, sectionName);
  12273. *)
  12274. Name(source,sectionName);
  12275. Size(source, 0);
  12276. RETURN source;
  12277. END NewTypeDescriptorInfo;
  12278. PROCEDURE NewTypeDescriptor;
  12279. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12280. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12281. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12282. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12283. CONST MPO=-40000000H;
  12284. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12285. VAR i: LONGINT;
  12286. PROCEDURE Td(record: SyntaxTree.RecordType);
  12287. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12288. BEGIN
  12289. IF record # NIL THEN
  12290. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12291. baseTD := record.typeDeclaration;
  12292. Global.GetSymbolSegmentedName(baseTD,name);
  12293. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12294. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12295. ELSE
  12296. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12297. END;
  12298. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12299. Symbol(source, tir, 0, offset);
  12300. IF reverse THEN Td(record.GetBaseRecord()) END;
  12301. END;
  12302. END Td;
  12303. BEGIN
  12304. Info(source, "tag table");
  12305. baseRecord := recordType;
  12306. i := 0;
  12307. WHILE baseRecord # NIL DO
  12308. INC(i);
  12309. baseRecord := baseRecord.GetBaseRecord();
  12310. END;
  12311. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12312. IF ~reverse THEN Td(recordType) END;
  12313. WHILE i < size DO
  12314. Address(source,0);
  12315. INC(i);
  12316. END;
  12317. IF reverse THEN Td(recordType) END;
  12318. END TdTable;
  12319. PROCEDURE MethodTable(reverse: BOOLEAN);
  12320. VAR i,methods: LONGINT;
  12321. BEGIN
  12322. Info(source, "method table");
  12323. IF recordType # NIL THEN
  12324. methods := recordType.recordScope.numberMethods;
  12325. IF reverse THEN
  12326. FOR i := methods-1 TO 0 BY -1 DO
  12327. procedure := recordType.recordScope.FindMethod(i);
  12328. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12329. NamedSymbol(source, name,procedure, 0,0);
  12330. END;
  12331. ELSE
  12332. FOR i := 0 TO methods-1 DO
  12333. procedure := recordType.recordScope.FindMethod(i);
  12334. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12335. NamedSymbol(source, name,procedure, 0,0);
  12336. END;
  12337. END;
  12338. END;
  12339. END MethodTable;
  12340. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12341. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12342. BEGIN
  12343. Info(source, "method table");
  12344. baseRecord := recordType;
  12345. WHILE baseRecord.baseType # NIL DO
  12346. baseRecord := baseRecord.GetBaseRecord ();
  12347. END;
  12348. GetRecordTypeName (baseRecord, name);
  12349. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12350. IF name = stackFrame THEN
  12351. start := 0;
  12352. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12353. baseRecord := recordType;
  12354. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12355. baseRecord := baseRecord.GetBaseRecord ();
  12356. END;
  12357. IF baseRecord # NIL THEN
  12358. GetRecordTypeName (baseRecord, name);
  12359. IF pointer & ~baseRecord.isObject THEN
  12360. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12361. END;
  12362. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12363. ELSIF recordType.isObject THEN
  12364. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12365. ELSIF pointer THEN
  12366. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12367. ELSE
  12368. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12369. END;
  12370. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12371. Symbol(source, tir, 0, 0);
  12372. start := 0;
  12373. baseRecord := recordType;
  12374. WHILE (baseRecord # NIL) DO
  12375. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12376. baseRecord := baseRecord.GetBaseRecord ();
  12377. END;
  12378. ELSE
  12379. (* explicit trace method: *)
  12380. procedure := recordType.recordScope.FindMethod(0);
  12381. IF ~procedure.isFinalizer THEN
  12382. Global.GetSymbolSegmentedName(procedure, name);
  12383. NamedSymbol(source, name,procedure, 0,0);
  12384. END;
  12385. start := 1;
  12386. END;
  12387. IF (name # stackFrame) & recordType.isObject THEN
  12388. baseRecord := recordType;
  12389. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12390. baseRecord := baseRecord.GetBaseRecord ();
  12391. END;
  12392. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12393. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12394. ELSE
  12395. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12396. END;
  12397. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12398. Symbol(source, tir, 0, 0);
  12399. END;
  12400. methods := recordType.recordScope.numberMethods;
  12401. FOR i := start TO methods-1 DO
  12402. procedure := recordType.recordScope.FindMethod(i);
  12403. IF ~procedure.isFinalizer THEN
  12404. Global.GetSymbolSegmentedName(procedure, name);
  12405. NamedSymbol(source, name,procedure, 0,0);
  12406. END;
  12407. END;
  12408. END CooperativeMethodTable;
  12409. BEGIN
  12410. Global.GetSymbolSegmentedName(td,name);
  12411. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12412. source.SetExported(IsExported(td));
  12413. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12414. IF implementationVisitor.backend.cooperative THEN
  12415. base := NIL;
  12416. baseRecord := recordType.GetBaseRecord();
  12417. IF baseRecord # NIL THEN
  12418. baseTD := baseRecord.typeDeclaration;
  12419. END;
  12420. IF ~recordType.isObject THEN
  12421. Info(source, "parent");
  12422. IF baseRecord # NIL THEN
  12423. Global.GetSymbolSegmentedName(baseTD,name);
  12424. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12425. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12426. ELSE
  12427. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12428. END;
  12429. Symbol(source, tir, 0, 0);
  12430. ELSE
  12431. Address(source,0);
  12432. END;
  12433. Info(source, "record size");
  12434. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12435. CooperativeMethodTable(FALSE);
  12436. base := source;
  12437. Global.GetSymbolSegmentedName(td,name);
  12438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12439. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12440. source.SetExported(IsExported(td));
  12441. END;
  12442. Info(source, "parent");
  12443. IF baseRecord # NIL THEN
  12444. Global.GetSymbolSegmentedName(baseTD,name);
  12445. sym := baseTD;
  12446. IF ~recordType.isObject THEN
  12447. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12448. sym := NIL;
  12449. END;
  12450. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12451. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12452. ELSE
  12453. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12454. END;
  12455. Symbol(source, tir, 0, 0);
  12456. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12457. Address(source,0);
  12458. ELSE
  12459. IF recordType.isObject THEN
  12460. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12461. ELSE
  12462. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12463. END;
  12464. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12465. Symbol(source, tir, 0, 0);
  12466. END;
  12467. Info(source, "base record descriptor");
  12468. Symbol(source, base, 0, 0);
  12469. CooperativeMethodTable(TRUE);
  12470. IF recordType.hasPointers THEN
  12471. IF ~HasExplicitTraceMethod (recordType) THEN
  12472. implementationVisitor.CreateTraceMethod(recordType);
  12473. END;
  12474. implementationVisitor.CreateResetProcedure(recordType);
  12475. implementationVisitor.CreateAssignProcedure(recordType);
  12476. END;
  12477. ELSIF ~simple THEN
  12478. (*
  12479. MethodEnd = MPO
  12480. ---
  12481. methods (# methods)
  12482. ---
  12483. tags (16)
  12484. ---
  12485. TypeDesc = TypeInfoAdr
  12486. ---
  12487. td adr ---> rec size
  12488. ----
  12489. pointer offsets
  12490. ----
  12491. (padding)
  12492. -----
  12493. empty [2 addresses aligned]
  12494. empty
  12495. empty
  12496. numPtrs
  12497. ---
  12498. pointer offsets
  12499. ---
  12500. *)
  12501. Info(source, "MethodEnd = MPO");
  12502. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12503. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12504. MethodTable(TRUE);
  12505. TdTable(TypeTags, TRUE);
  12506. Info(source, "type descriptor info pointer");
  12507. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12508. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12509. IF (cellType # NIL) THEN
  12510. IF cellType.sizeInBits < 0 THEN
  12511. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12512. END;
  12513. Info(source, "cell size");
  12514. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12515. ELSE
  12516. Info(source, "record size");
  12517. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12518. END;
  12519. Info(source, "pointer offsets pointer");
  12520. padding := 1- source.pc MOD 2;
  12521. Symbol(source, source, source.pc+1+padding,0);
  12522. IF padding >0 THEN
  12523. Info(source, "padding");
  12524. FOR i := 1 TO padding DO Address(source,0) END;
  12525. END;
  12526. IF cellType # NIL THEN
  12527. PointerArray(source, cellType.cellScope, numberPointers);
  12528. ELSE
  12529. PointerArray(source, recordType.recordScope, numberPointers);
  12530. END;
  12531. ELSE
  12532. (*
  12533. simple:
  12534. td adr --> size
  12535. tag(1)
  12536. tag(2)
  12537. tag(3)
  12538. methods ->
  12539. *)
  12540. Info(source, "record size");
  12541. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12542. TdTable(TypeTags, FALSE);
  12543. MethodTable(FALSE);
  12544. END;
  12545. END NewTypeDescriptor;
  12546. BEGIN
  12547. x := x.resolved;
  12548. IF (x IS SyntaxTree.PointerType) THEN
  12549. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12550. END;
  12551. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12552. recordType := x(SyntaxTree.RecordType);
  12553. td := x.typeDeclaration;
  12554. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12555. ASSERT(td # NIL);
  12556. section := module.allSections.FindBySymbol(td); (* TODO *)
  12557. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12558. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12559. NewTypeDescriptor
  12560. END;
  12561. END;
  12562. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12563. cellType := x(SyntaxTree.CellType);
  12564. td := x.typeDeclaration;
  12565. section := module.allSections.FindBySymbol(td); (* TODO *)
  12566. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12567. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12568. NewTypeDescriptor
  12569. END;
  12570. END;
  12571. END
  12572. END CheckTypeDeclaration
  12573. END MetaDataGenerator;
  12574. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12575. VAR
  12576. trace-: BOOLEAN;
  12577. traceString-: SyntaxTree.IdentifierString;
  12578. traceModuleName-: SyntaxTree.IdentifierString;
  12579. profile-: BOOLEAN;
  12580. noRuntimeChecks: BOOLEAN;
  12581. simpleMetaData-: BOOLEAN;
  12582. noAsserts: BOOLEAN;
  12583. optimize-: BOOLEAN;
  12584. cooperative-: BOOLEAN;
  12585. preregisterStatic-: BOOLEAN;
  12586. dump-: Basic.Writer;
  12587. cellsAreObjects: BOOLEAN;
  12588. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12589. experiment: BOOLEAN;
  12590. PROCEDURE &InitIntermediateBackend*;
  12591. BEGIN
  12592. simpleMetaData := FALSE;
  12593. InitBackend;
  12594. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12595. SetTraceModuleName(DefaultTraceModuleName);
  12596. END InitIntermediateBackend;
  12597. (* must be overwritten by actual backend, if parameter registers should be used *)
  12598. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12599. BEGIN
  12600. RETURN 0; (* default case: no parameter registers *)
  12601. END NumberParameterRegisters;
  12602. (* must be overwritten by actual backend, if parameter registers should be used *)
  12603. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12604. BEGIN
  12605. HALT(100); (* abstract *)
  12606. END ParameterRegister;
  12607. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12608. VAR
  12609. declarationVisitor: DeclarationVisitor;
  12610. implementationVisitor: ImplementationVisitor;
  12611. module: Sections.Module;
  12612. name, platformName: SyntaxTree.IdentifierString;
  12613. meta: MetaDataGenerator;
  12614. crc: CRC.CRC32Stream;
  12615. BEGIN
  12616. ResetError;
  12617. Global.GetSymbolName(x,name);
  12618. NEW(module,x,system); (* backend structures *)
  12619. Global.GetModuleName(x, name);
  12620. module.SetModuleName(name);
  12621. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12622. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12623. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12624. declarationVisitor.Module(x,module);
  12625. IF ~meta.simple THEN
  12626. meta.Module(implementationVisitor.moduleBodySection);
  12627. END;
  12628. GetDescription(platformName);
  12629. module.SetPlatformName(platformName);
  12630. NEW(crc);
  12631. module.allSections.WriteRaw(crc);
  12632. crc.Update;
  12633. meta.PatchCRC(crc.GetCRC());
  12634. RETURN module
  12635. END GenerateIntermediate;
  12636. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12637. BEGIN RETURN TRUE
  12638. END SupportedImmediate;
  12639. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12640. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12641. END ProcessSyntaxTreeModule;
  12642. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12643. VAR
  12644. result: Sections.Module;
  12645. traceName: Basic.MessageString;
  12646. BEGIN
  12647. ASSERT(intermediateCodeModule IS Sections.Module);
  12648. result := intermediateCodeModule(Sections.Module);
  12649. IF trace THEN
  12650. traceName := "intermediate code trace: ";
  12651. Strings.Append(traceName,traceString);
  12652. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12653. IF (traceString="") OR (traceString="*") THEN
  12654. result.Dump(dump);
  12655. dump.Update
  12656. ELSE
  12657. Sections.DumpFiltered(dump, result, traceString);
  12658. END
  12659. END;
  12660. RETURN result
  12661. END ProcessIntermediateCodeModule;
  12662. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12663. BEGIN instructionSet := "Intermediate";
  12664. END GetDescription;
  12665. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12666. BEGIN
  12667. SELF.simpleMetaData := simpleMetaData;
  12668. END SetSimpleMetaData;
  12669. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12670. BEGIN COPY(name, traceModuleName)
  12671. END SetTraceModuleName;
  12672. PROCEDURE DefineOptions*(options: Options.Options);
  12673. BEGIN
  12674. DefineOptions^(options);
  12675. options.Add(0X,"trace",Options.String);
  12676. options.Add(0X,"builtinsModule",Options.String);
  12677. options.Add(0X,"traceModule",Options.String);
  12678. options.Add(0X,"profile",Options.Flag);
  12679. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12680. options.Add(0X,"noAsserts",Options.Flag);
  12681. options.Add(0X,"metaData",Options.String);
  12682. options.Add('o',"optimize", Options.Flag);
  12683. options.Add(0X,"preregisterStatic", Options.Flag);
  12684. options.Add(0X,"cellsAreObjects", Options.Flag);
  12685. options.Add(0X,"preciseGC", Options.Flag);
  12686. options.Add(0X,"trackLeave", Options.Flag);
  12687. options.Add(0X,"writeBarriers", Options.Flag);
  12688. options.Add(0X,"experiment", Options.Flag);
  12689. END DefineOptions;
  12690. PROCEDURE GetOptions*(options: Options.Options);
  12691. VAR name,string: SyntaxTree.IdentifierString;
  12692. BEGIN
  12693. GetOptions^(options);
  12694. trace := options.GetString("trace",traceString);
  12695. profile := options.GetFlag("profile");
  12696. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12697. noAsserts := options.GetFlag("noAsserts");
  12698. cooperative := options.GetFlag("cooperative");
  12699. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12700. simpleMetaData := TRUE
  12701. END;
  12702. IF options.GetString("metaData",string) THEN
  12703. IF string = "simple" THEN simpleMetaData := TRUE
  12704. ELSIF string ="full" THEN simpleMetaData := FALSE
  12705. END;
  12706. END;
  12707. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12708. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12709. optimize := options.GetFlag("optimize");
  12710. preregisterStatic := options.GetFlag("preregisterStatic");
  12711. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12712. preciseGC := options.GetFlag("preciseGC");
  12713. trackLeave := options.GetFlag("trackLeave");
  12714. writeBarriers := options.GetFlag("writeBarriers");
  12715. experiment := options.GetFlag("experiment");
  12716. END GetOptions;
  12717. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12718. BEGIN RETURN SymbolFileFormat.Get()
  12719. END DefaultSymbolFileFormat;
  12720. END IntermediateBackend;
  12721. (* ----------------------------------- register allocation ------------------------------------- *)
  12722. (* register mapping scheme
  12723. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12724. spill offset
  12725. part(n) --> ticket <--> physical register
  12726. spill offset
  12727. *)
  12728. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12729. emptyOperand: IntermediateCode.Operand;
  12730. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12731. statCoopResetVariables: LONGINT;
  12732. statCoopModifyAssignments: LONGINT;
  12733. modifyAssignmentsPC : LONGINT;
  12734. statCoopNilCheck: LONGINT;
  12735. statCoopSwitch: LONGINT;
  12736. statCoopAssignProcedure: LONGINT;
  12737. statCoopTraceMethod: LONGINT;
  12738. statCoopResetProcedure: LONGINT;
  12739. statCoopTraceModule: LONGINT;
  12740. PROCEDURE ResetStatistics*;
  12741. BEGIN
  12742. statCoopResetVariables := 0;
  12743. statCoopModifyAssignments := 0;
  12744. statCoopNilCheck:= 0;
  12745. statCoopSwitch:= 0;
  12746. statCoopAssignProcedure:= 0;
  12747. statCoopTraceMethod:= 0;
  12748. statCoopResetProcedure:= 0;
  12749. statCoopTraceModule:= 0;
  12750. END ResetStatistics;
  12751. PROCEDURE Statistics*;
  12752. BEGIN
  12753. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12754. TRACE(statCoopNilCheck, statCoopSwitch);
  12755. TRACE(statCoopAssignProcedure,
  12756. statCoopTraceMethod,
  12757. statCoopResetProcedure,
  12758. statCoopTraceModule)
  12759. END Statistics;
  12760. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12761. VAR h: LONGINT;
  12762. BEGIN
  12763. WHILE b # 0 DO
  12764. h := a MOD b;
  12765. a := b;
  12766. b := h;
  12767. END;
  12768. RETURN a
  12769. END GCD;
  12770. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12771. BEGIN
  12772. RETURN a*b DIV GCD(a,b)
  12773. END SCM;
  12774. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12775. BEGIN
  12776. (*TRACE(a,b);*)
  12777. IF a = 0 THEN RETURN b
  12778. ELSIF b = 0 THEN RETURN a
  12779. ELSE RETURN SCM(a,b)
  12780. END;
  12781. END CommonAlignment;
  12782. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12783. BEGIN
  12784. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12785. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12786. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12787. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12788. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12789. END
  12790. END PassBySingleReference;
  12791. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12792. BEGIN
  12793. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12794. END PassInRegister;
  12795. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12796. VAR new: RegisterEntry;
  12797. BEGIN
  12798. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12799. IF queue = NIL THEN
  12800. queue := new
  12801. ELSE
  12802. new.next := queue;
  12803. IF queue#NIL THEN queue.prev := new END;
  12804. queue := new
  12805. END;
  12806. END AddRegisterEntry;
  12807. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12808. VAR this: RegisterEntry;
  12809. BEGIN
  12810. this := queue;
  12811. WHILE (this # NIL) & (this.register # register) DO
  12812. this := this.next;
  12813. END;
  12814. IF this = NIL THEN
  12815. RETURN FALSE
  12816. END;
  12817. ASSERT(this # NIL);
  12818. IF this = queue THEN queue := queue.next END;
  12819. IF this.prev # NIL THEN this.prev.next := this.next END;
  12820. IF this.next # NIL THEN this.next.prev := this.prev END;
  12821. RETURN TRUE
  12822. END RemoveRegisterEntry;
  12823. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12824. BEGIN ASSERT(cond);
  12825. END Assert;
  12826. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12827. BEGIN
  12828. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12829. END ReusableRegister;
  12830. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12832. BEGIN
  12833. procedure := moduleScope.bodyProcedure;
  12834. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12835. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12837. procedure.SetScope(moduleScope);
  12838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12839. procedure.SetAccess(SyntaxTree.Hidden);
  12840. moduleScope.SetBodyProcedure(procedure);
  12841. moduleScope.AddProcedure(procedure);
  12842. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12843. END;
  12844. END EnsureBodyProcedure;
  12845. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12846. VAR import: SyntaxTree.Import;
  12847. selfName: SyntaxTree.IdentifierString;
  12848. module: SyntaxTree.Module;
  12849. BEGIN
  12850. scope.ownerModule.GetName(selfName);
  12851. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12852. module := scope.ownerModule
  12853. ELSE
  12854. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12855. IF import = NIL THEN
  12856. RETURN NIL
  12857. ELSIF import.module = NIL THEN
  12858. RETURN NIL
  12859. ELSE module := import.module
  12860. END;
  12861. END;
  12862. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12863. END GetSymbol;
  12864. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12865. BEGIN
  12866. op.mode := mode;
  12867. IntermediateCode.InitOperand(op.op);
  12868. IntermediateCode.InitOperand(op.tag);
  12869. IntermediateCode.InitOperand(op.extra);
  12870. op.dimOffset := 0;
  12871. END InitOperand;
  12872. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12873. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12874. BEGIN RETURN IntermediateCode.GetType(system, type)
  12875. END GetType;
  12876. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12877. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12878. BEGIN
  12879. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12880. (*
  12881. UniqueId(name,module,name,adr);
  12882. *)
  12883. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12884. constant.SetValue(value);
  12885. constant.SetAccess(SyntaxTree.Hidden);
  12886. module.moduleScope.AddConstant(constant);
  12887. constant.SetScope(module.moduleScope);
  12888. RETURN constant
  12889. END BuildConstant;
  12890. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12891. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12892. BEGIN
  12893. variable := scope.firstVariable;
  12894. WHILE variable # NIL DO
  12895. IF variable.NeedsTrace() THEN
  12896. RETURN TRUE;
  12897. END;
  12898. variable := variable.nextVariable;
  12899. END;
  12900. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12901. WHILE parameter # NIL DO
  12902. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12903. RETURN TRUE;
  12904. END;
  12905. parameter := parameter.nextParameter;
  12906. END;
  12907. RETURN FALSE;
  12908. END HasPointers;
  12909. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12910. 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));
  12911. END IsVariableParameter;
  12912. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12913. VAR parameter: SyntaxTree.Parameter;
  12914. BEGIN
  12915. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12916. WHILE parameter # NIL DO
  12917. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12918. IF parameter.movable THEN RETURN TRUE END;
  12919. parameter := parameter.nextParameter;
  12920. END;
  12921. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12922. END HasVariableParameters;
  12923. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12924. BEGIN
  12925. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12926. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12927. END HasExplicitTraceMethod;
  12928. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12929. BEGIN
  12930. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12931. IF (expression IS SyntaxTree.IntegerValue) THEN
  12932. val := expression(SyntaxTree.IntegerValue).value;
  12933. RETURN TRUE
  12934. ELSE
  12935. RETURN FALSE
  12936. END;
  12937. END IsIntegerConstant;
  12938. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12939. BEGIN
  12940. IF val <= 0 THEN RETURN FALSE END;
  12941. exp := 0;
  12942. WHILE ~ODD(val) DO
  12943. val := val DIV 2;
  12944. INC(exp)
  12945. END;
  12946. RETURN val = 1
  12947. END PowerOf2;
  12948. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12949. VAR procedure: SyntaxTree.Procedure;
  12950. BEGIN
  12951. procedure := record.recordScope.constructor;
  12952. IF procedure = NIL THEN
  12953. record := record.GetBaseRecord();
  12954. IF record # NIL THEN
  12955. procedure := GetConstructor(record)
  12956. END;
  12957. END;
  12958. RETURN procedure;
  12959. END GetConstructor;
  12960. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12961. BEGIN
  12962. value := SHORT(op.intValue);
  12963. RETURN op.mode = IntermediateCode.ModeImmediate;
  12964. END IsIntegerImmediate;
  12965. (** whether a type strictily is a pointer to record or object type
  12966. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12967. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12968. BEGIN
  12969. IF type = NIL THEN
  12970. RETURN FALSE
  12971. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12972. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12973. ELSE
  12974. RETURN FALSE
  12975. END
  12976. END IsStrictlyPointerToRecord;
  12977. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12978. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12979. END IsUnsafePointer;
  12980. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12981. BEGIN type := type.resolved;
  12982. IF type IS SyntaxTree.PointerType THEN
  12983. type := type(SyntaxTree.PointerType).pointerBase;
  12984. type := type.resolved;
  12985. IF type IS SyntaxTree.RecordType THEN
  12986. recordType := type(SyntaxTree.RecordType);
  12987. RETURN TRUE
  12988. ELSE
  12989. RETURN FALSE
  12990. END
  12991. ELSIF type IS SyntaxTree.RecordType THEN
  12992. recordType := type(SyntaxTree.RecordType);
  12993. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12994. ELSIF type IS SyntaxTree.ObjectType THEN
  12995. RETURN TRUE
  12996. ELSIF type IS SyntaxTree.AnyType THEN
  12997. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12998. ELSE
  12999. RETURN FALSE
  13000. END;
  13001. END IsPointerToRecord;
  13002. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13003. BEGIN
  13004. type := type.resolved;
  13005. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13006. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13007. END IsArrayOfSystemByte;
  13008. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13009. BEGIN
  13010. IF type = NIL THEN RETURN FALSE END;
  13011. type := type.resolved;
  13012. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13013. END IsOpenArray;
  13014. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13015. BEGIN
  13016. IF type = NIL THEN RETURN FALSE END;
  13017. type := type.resolved;
  13018. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13019. END IsSemiDynamicArray;
  13020. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13021. BEGIN
  13022. IF type = NIL THEN RETURN FALSE END;
  13023. type := type.resolved;
  13024. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13025. END IsStaticArray;
  13026. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13027. BEGIN
  13028. IF type = NIL THEN RETURN FALSE END;
  13029. type := type.resolved;
  13030. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13031. END IsStaticMathArray;
  13032. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13033. BEGIN
  13034. WHILE (IsStaticMathArray(type)) DO
  13035. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13036. END;
  13037. RETURN type;
  13038. END StaticMathArrayBaseType;
  13039. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13040. VAR size: LONGINT;
  13041. BEGIN
  13042. size := 1;
  13043. WHILE (IsStaticArray(type)) DO
  13044. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13045. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13046. END;
  13047. RETURN size;
  13048. END StaticArrayNumElements;
  13049. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13050. VAR size: LONGINT;
  13051. BEGIN
  13052. size := 1;
  13053. WHILE (IsStaticMathArray(type)) DO
  13054. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13055. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13056. END;
  13057. RETURN size;
  13058. END StaticMathArrayNumElements;
  13059. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13060. BEGIN
  13061. WHILE (IsStaticArray(type)) DO
  13062. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13063. END;
  13064. RETURN type;
  13065. END StaticArrayBaseType;
  13066. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13067. BEGIN
  13068. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13069. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13070. END;
  13071. RETURN type;
  13072. END ArrayBaseType;
  13073. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13074. BEGIN
  13075. IF type = NIL THEN RETURN FALSE END;
  13076. type := type.resolved;
  13077. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13078. END IsDelegate;
  13079. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13080. VAR i: LONGINT;
  13081. BEGIN
  13082. i := 0; type := type.resolved;
  13083. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13084. INC(i);
  13085. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13086. END;
  13087. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13088. INC(i);
  13089. type := type(SyntaxTree.MathArrayType).arrayBase;
  13090. IF type # NIL THEN type := type.resolved END;
  13091. END;
  13092. RETURN i
  13093. END DynamicDim;
  13094. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13095. BEGIN
  13096. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13097. type := type(SyntaxTree.ArrayType).arrayBase;
  13098. END;
  13099. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13100. type := type(SyntaxTree.MathArrayType).arrayBase;
  13101. END;
  13102. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13103. END StaticSize;
  13104. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13105. BEGIN
  13106. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13107. END IsImmediate;
  13108. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13109. BEGIN
  13110. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13111. END IsAddress;
  13112. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13113. BEGIN
  13114. RETURN (x.mode = IntermediateCode.ModeRegister);
  13115. END IsRegister;
  13116. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13117. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13118. BEGIN
  13119. typeDeclaration := recordType.typeDeclaration;
  13120. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13121. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13122. END GetRecordTypeName;
  13123. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13124. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13125. BEGIN
  13126. parSize := 0;
  13127. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13128. parameter := procedureType.returnParameter;
  13129. INC(parSize,system.SizeOfParameter(parameter));
  13130. parSize := parSize + (-parSize) MOD system.addressSize;
  13131. END;
  13132. parameter :=procedureType.lastParameter;
  13133. WHILE (parameter # NIL) DO
  13134. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13135. INC(parSize, system.addressSize);
  13136. ELSE
  13137. INC(parSize,system.SizeOfParameter(parameter));
  13138. parSize := parSize + (-parSize) MOD system.addressSize;
  13139. END;
  13140. parameter := parameter.prevParameter;
  13141. END;
  13142. IF procedureType.selfParameter # NIL THEN
  13143. parameter := procedureType.selfParameter;
  13144. INC(parSize,system.SizeOfParameter(parameter));
  13145. parSize := parSize + (-parSize) MOD system.addressSize;
  13146. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13147. END; (* method => self pointer *)
  13148. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13149. RETURN ToMemoryUnits(system,parSize)
  13150. END ParametersSize;
  13151. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13152. BEGIN
  13153. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13154. END IsNested;
  13155. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13156. BEGIN
  13157. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13158. scope := scope.outerScope;
  13159. END;
  13160. RETURN scope # NIL;
  13161. END InCellScope;
  13162. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13163. BEGIN
  13164. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13165. END ProcedureParametersSize;
  13166. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13167. VAR dataUnit: LONGINT;
  13168. BEGIN dataUnit := system.dataUnit;
  13169. ASSERT(size MOD system.dataUnit = 0);
  13170. RETURN LONGINT(size DIV system.dataUnit)
  13171. END ToMemoryUnits;
  13172. PROCEDURE Get*(): Backend.Backend;
  13173. VAR backend: IntermediateBackend;
  13174. BEGIN NEW(backend); RETURN backend
  13175. END Get;
  13176. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13177. VAR instruction: IntermediateCode.Instruction;
  13178. BEGIN
  13179. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13180. RETURN instruction
  13181. END Nop;
  13182. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13183. VAR instruction: IntermediateCode.Instruction;
  13184. BEGIN
  13185. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13186. RETURN instruction
  13187. END Mov;
  13188. (* like Mov but ensures that no new register will be allocated for dest *)
  13189. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13190. VAR instruction: IntermediateCode.Instruction;
  13191. BEGIN
  13192. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13193. RETURN instruction
  13194. END MovReplace;
  13195. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13196. VAR instruction: IntermediateCode.Instruction;
  13197. BEGIN
  13198. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13199. RETURN instruction
  13200. END Conv;
  13201. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13202. VAR instruction: IntermediateCode.Instruction;
  13203. BEGIN
  13204. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13205. RETURN instruction
  13206. END Call;
  13207. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13208. VAR op1, op2, op3: IntermediateCode.Operand;
  13209. VAR instruction: IntermediateCode.Instruction;
  13210. BEGIN
  13211. IntermediateCode.InitNumber(op1,pcOffset);
  13212. IntermediateCode.InitNumber(op2,callingConvention);
  13213. IntermediateCode.InitNumber(op3,unwind);
  13214. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13215. RETURN instruction
  13216. END Exit;
  13217. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13218. VAR instruction: IntermediateCode.Instruction;
  13219. BEGIN
  13220. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13221. RETURN instruction
  13222. END Return;
  13223. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13224. VAR instruction: IntermediateCode.Instruction;
  13225. BEGIN
  13226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13227. RETURN instruction
  13228. END Result;
  13229. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13230. VAR op1: IntermediateCode.Operand;
  13231. VAR instruction: IntermediateCode.Instruction;
  13232. BEGIN
  13233. IntermediateCode.InitNumber(op1,nr);
  13234. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13235. RETURN instruction
  13236. END Trap;
  13237. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13238. VAR instruction: IntermediateCode.Instruction;
  13239. BEGIN
  13240. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13241. RETURN instruction
  13242. END Br;
  13243. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13244. VAR instruction: IntermediateCode.Instruction;
  13245. BEGIN
  13246. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13247. RETURN instruction
  13248. END Breq;
  13249. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13250. VAR instruction: IntermediateCode.Instruction;
  13251. BEGIN
  13252. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13253. RETURN instruction
  13254. END Brne;
  13255. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13256. VAR instruction: IntermediateCode.Instruction;
  13257. BEGIN
  13258. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13259. RETURN instruction
  13260. END Brge;
  13261. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13262. VAR instruction: IntermediateCode.Instruction;
  13263. BEGIN
  13264. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13265. RETURN instruction
  13266. END Brlt;
  13267. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13268. VAR instruction: IntermediateCode.Instruction;
  13269. BEGIN
  13270. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13271. RETURN instruction
  13272. END Pop;
  13273. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13274. VAR instruction: IntermediateCode.Instruction;
  13275. BEGIN
  13276. ASSERT(op.mode # IntermediateCode.Undefined);
  13277. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13278. RETURN instruction
  13279. END Push;
  13280. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13281. VAR instruction: IntermediateCode.Instruction;
  13282. BEGIN
  13283. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13284. RETURN instruction
  13285. END Neg;
  13286. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13287. VAR instruction: IntermediateCode.Instruction;
  13288. BEGIN
  13289. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13290. RETURN instruction
  13291. END Not;
  13292. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13293. VAR instruction: IntermediateCode.Instruction;
  13294. BEGIN
  13295. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13296. RETURN instruction
  13297. END Abs;
  13298. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13299. VAR instruction: IntermediateCode.Instruction;
  13300. BEGIN
  13301. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13302. ASSERT(~IsImmediate(instruction.op1));
  13303. RETURN instruction
  13304. END Mul;
  13305. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13306. VAR instruction: IntermediateCode.Instruction;
  13307. BEGIN
  13308. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13309. RETURN instruction
  13310. END Div;
  13311. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13312. VAR instruction: IntermediateCode.Instruction;
  13313. BEGIN
  13314. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13315. RETURN instruction
  13316. END Mod;
  13317. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13318. VAR instruction: IntermediateCode.Instruction;
  13319. BEGIN
  13320. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13321. RETURN instruction
  13322. END Sub;
  13323. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13324. VAR instruction: IntermediateCode.Instruction;
  13325. BEGIN
  13326. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13327. RETURN instruction
  13328. END Add;
  13329. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13330. VAR instruction: IntermediateCode.Instruction;
  13331. BEGIN
  13332. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13333. RETURN instruction
  13334. END And;
  13335. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13336. VAR instruction: IntermediateCode.Instruction;
  13337. BEGIN
  13338. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13339. RETURN instruction
  13340. END Or;
  13341. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13342. VAR instruction: IntermediateCode.Instruction;
  13343. BEGIN
  13344. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13345. RETURN instruction
  13346. END Xor;
  13347. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13348. VAR instruction: IntermediateCode.Instruction;
  13349. BEGIN
  13350. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13351. RETURN instruction
  13352. END Shl;
  13353. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13354. VAR instruction: IntermediateCode.Instruction;
  13355. BEGIN
  13356. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13357. RETURN instruction
  13358. END Shr;
  13359. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13360. VAR instruction: IntermediateCode.Instruction;
  13361. BEGIN
  13362. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13363. RETURN instruction
  13364. END Rol;
  13365. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13366. VAR instruction: IntermediateCode.Instruction;
  13367. BEGIN
  13368. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13369. RETURN instruction
  13370. END Ror;
  13371. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13372. VAR instruction: IntermediateCode.Instruction;
  13373. BEGIN
  13374. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13375. RETURN instruction
  13376. END Cas;
  13377. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13378. VAR instruction: IntermediateCode.Instruction;
  13379. BEGIN
  13380. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13381. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13382. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13383. RETURN instruction
  13384. END Copy;
  13385. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13386. VAR instruction: IntermediateCode.Instruction;
  13387. BEGIN
  13388. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13389. RETURN instruction
  13390. END Fill;
  13391. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13392. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13393. BEGIN
  13394. string := IntermediateCode.String(s);
  13395. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13396. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13397. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13398. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13399. RETURN instruction
  13400. END Asm;
  13401. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13402. VAR instruction: IntermediateCode.Instruction;
  13403. BEGIN
  13404. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13405. RETURN instruction
  13406. END Data;
  13407. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13408. VAR instruction: IntermediateCode.Instruction;
  13409. BEGIN
  13410. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13411. IntermediateCode.SetSubType(instruction, subtype);
  13412. RETURN instruction
  13413. END SpecialInstruction;
  13414. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13415. VAR op1: IntermediateCode.Operand;
  13416. VAR instruction: IntermediateCode.Instruction;
  13417. BEGIN
  13418. (*! generate a warning if size exceeds a certain limit *)
  13419. (*
  13420. ASSERT(bytes < 1000000); (* sanity check *)
  13421. *)
  13422. ASSERT(0 <= units); (* sanity check *)
  13423. IntermediateCode.InitNumber(op1,units);
  13424. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13425. RETURN instruction
  13426. END Reserve;
  13427. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13428. VAR op1: IntermediateCode.Operand;
  13429. VAR instruction: IntermediateCode.Instruction;
  13430. BEGIN
  13431. IntermediateCode.InitNumber(op1,position.start);
  13432. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13433. RETURN instruction
  13434. END LabelInstruction;
  13435. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13436. VAR pc: LONGINT;
  13437. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13438. BEGIN
  13439. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13440. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13441. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13442. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13443. IF instr.op1.type.form = IntermediateCode.Float THEN
  13444. RETURN instr.op1.floatValue = op.floatValue
  13445. ELSE
  13446. RETURN instr.op1.intValue = op.intValue
  13447. END;
  13448. END ProvidesValue;
  13449. BEGIN
  13450. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13451. pc := 0;
  13452. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13453. INC(pc);
  13454. END;
  13455. IF pc = data.pc THEN
  13456. data.Emit(Data(Basic.invalidPosition,vop));
  13457. END;
  13458. RETURN pc
  13459. END EnterImmediate;
  13460. PROCEDURE Init;
  13461. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13462. BEGIN
  13463. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13464. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13465. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13466. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13467. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13468. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13469. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13470. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13471. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13472. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13473. IntermediateCode.InitOperand(emptyOperand);
  13474. FOR i := 0 TO NumberSystemCalls-1 DO
  13475. name := "@SystemCall";
  13476. Basic.AppendNumber(name,i);
  13477. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13478. END;
  13479. END Init;
  13480. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13481. BEGIN
  13482. RETURN (symbol # NIL) & symbol.NeedsSection();
  13483. END IsExported;
  13484. BEGIN
  13485. Init;
  13486. END FoxIntermediateBackend.
  13487. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13488. # Release.Build --path="/temp/obg/" Win32 ~
  13489. # 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 ~
  13490. FStols.CloseFiles A2Z.exe ~
  13491. System.FreeDownTo FoxIntermediateBackend ~
  13492. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13493. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13494. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13495. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13496. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13497. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13498. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13499. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13500. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13501. GenericLinker.Mod Loader.Mod BootConsole.Mod