QbeGen.mod 141 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696
  1. IMPLEMENTATION MODULE QbeGen;
  2. IMPORT FileIO, SymTab;
  3. VAR
  4. out : FileIO.File;
  5. opened : BOOLEAN;
  6. inBody : BOOLEAN;
  7. dead : BOOLEAN; (* TRUE past a terminator: next instruction opens
  8. an unreachable block with a fresh label, so
  9. the .ssa stays valid QBE (no dangling temps,
  10. no instruction outside a block). *)
  11. nTemp : CARDINAL;
  12. nLab : CARDINAL;
  13. loopTop : CARDINAL;
  14. loopSt : ARRAY [0 .. 15] OF QVal;
  15. nR : CARDINAL; (* non-zero REAL consts flushed at BeginBody *)
  16. rNames : ARRAY [0 .. 31] OF QVal;
  17. rVals : ARRAY [0 .. 31] OF QVal;
  18. nStr : CARDINAL; (* string-literal data counter *)
  19. strNams : ARRAY [0 .. 4095] OF QVal;
  20. strTexts : ARRAY [0 .. 4095] OF ARRAY [0 .. 255] OF CHAR;
  21. (* UString literals: decoded codepoints, recorded for EndModule. *)
  22. ustrN : CARDINAL;
  23. ustrNams : ARRAY [0 .. 255] OF QVal;
  24. ustrStart : ARRAY [0 .. 255] OF CARDINAL;
  25. ustrCount : ARRAY [0 .. 255] OF CARDINAL;
  26. ustrPool : ARRAY [0 .. 8191] OF INTEGER;
  27. ustrUsed : CARDINAL;
  28. (* array constructors: pooled static descriptors *)
  29. ctorN : CARDINAL;
  30. ctorNam : ARRAY [0 .. 255] OF QVal;
  31. ctorTxt : ARRAY [0 .. 255] OF ARRAY [0 .. 4095] OF CHAR;
  32. ctorUse : ARRAY [0 .. 255] OF BOOLEAN; (* FALSE once inlined as a field *)
  33. ctorTop : CARDINAL;
  34. ctorTyp : ARRAY [0 .. 7] OF INTEGER;
  35. ctorCnt : ARRAY [0 .. 7] OF CARDINAL;
  36. ctorBuf : ARRAY [0 .. 7] OF ARRAY [0 .. 4095] OF CHAR;
  37. ctorEv : ARRAY [0 .. 7] OF ARRAY [0 .. 255] OF QVal;
  38. ctorEk : ARRAY [0 .. 7] OF ARRAY [0 .. 255] OF INTEGER;
  39. (* compile-time set constants: pooled static masks (Lower's PoolSet) *)
  40. setN : CARDINAL;
  41. setNam : ARRAY [0 .. 255] OF QVal; (* "setN" (no $) *)
  42. setW : ARRAY [0 .. 255] OF CARDINAL; (* words per entry *)
  43. setMask : ARRAY [0 .. 255] OF ARRAY [0 .. 15] OF CARDINAL;
  44. withTop : CARDINAL;
  45. withSt : ARRAY [0 .. 7] OF QVal;
  46. noEmit : BOOLEAN; (* TRUE while parsing nested procedures in 4.1:
  47. SymTab tracks, QbeGen suppresses output *)
  48. inFunc : BOOLEAN; (* TRUE inside an emitted function body *)
  49. useStack : BOOLEAN;(* TRUE: NewHeap allocates stack slots *)
  50. funcRes : CHAR; (* current function result class *)
  51. nLoc : CARDINAL; (* function-local name table entries *)
  52. locNames : ARRAY [0 .. 255] OF SymTab.Name;
  53. locTag : ARRAY [0 .. 255] OF INTEGER; (* 0 slot, 1 data, 2 addr *)
  54. locRep : ARRAY [0 .. 255] OF QVal; (* slot temp / mangled / addr *)
  55. locCls : ARRAY [0 .. 255] OF CHAR;
  56. locTyp : ARRAY [0 .. 255] OF INTEGER;
  57. funcDepth : CARDINAL; (* open BeginFuncs; main body = 0 *)
  58. excHas : ARRAY [0 .. 16] OF BOOLEAN;
  59. excBodyL, excHandlerL, excAfterL : ARRAY [0 .. 16] OF QVal;
  60. scopeTop : CARDINAL; (* open procedure scopes *)
  61. scopeBase : ARRAY [0 .. 16] OF CARDINAL;
  62. scopeLink : ARRAY [0 .. 15] OF QVal; (* per-scope link records *)
  63. slTmp : QVal; (* current static-link param temp *)
  64. hdrComma : BOOLEAN;
  65. stkLink : ARRAY [0 .. 15] OF QVal; (* per-call static links *)
  66. stkExt : ARRAY [0 .. 15] OF BOOLEAN; (* per-call external flag *)
  67. stkInd : ARRAY [0 .. 15] OF BOOLEAN; (* per-call indirect flag *)
  68. outSel : CARDINAL; (* 0 = file, else nestBufs[outSel-1] *)
  69. nInit : CARDINAL;
  70. initNames : ARRAY [0 .. 31] OF QVal;
  71. nFini : CARDINAL;
  72. finiNames : ARRAY [0 .. 31] OF QVal;
  73. sessBuf : ARRAY [0 .. 8388607] OF CHAR; (* whole image, buffered (8 MiB:
  74. must hold the compiler's own
  75. image text when self-hosting) *)
  76. sessUsed : CARDINAL;
  77. nestBufs : ARRAY [0 .. 15] OF ARRAY [0 .. 65535] OF CHAR;
  78. nestUsed : ARRAY [0 .. 15] OF CARDINAL;
  79. (* Short-circuit AND/OR: the RHS operand's code is buffered here
  80. (delayTop > 0) and replayed inside the branch. *)
  81. delayBuf : ARRAY [0 .. 15] OF ARRAY [0 .. 8191] OF CHAR;
  82. delayUsed : ARRAY [0 .. 15] OF CARDINAL;
  83. delayTop : CARDINAL;
  84. (* one buffer per nesting depth: each nested function stays
  85. contiguous no matter how deep the parse interleaves *)
  86. nPar : CARDINAL; (* recorded formal params for the header *)
  87. parCls : ARRAY [0 .. 63] OF CHAR;
  88. parTmp : ARRAY [0 .. 63] OF QVal;
  89. parNam : ARRAY [0 .. 63] OF SymTab.Name;
  90. parVar : ARRAY [0 .. 63] OF BOOLEAN;
  91. parTyp : ARRAY [0 .. 63] OF INTEGER;
  92. argBuf : ARRAY [0 .. 4095] OF CHAR; (* accumulated call args *)
  93. hbuf : ARRAY [0 .. 2047] OF CHAR; (* buffered function header *)
  94. nArg : CARDINAL;
  95. recvQ : QVal; (* armed class-method receiver *)
  96. recvArmed : BOOLEAN;
  97. callDepth : CARDINAL; (* nested-call stack *)
  98. stkName : ARRAY [0 .. 15] OF QVal;
  99. stkRes : ARRAY [0 .. 15] OF CHAR;
  100. stkArg : ARRAY [0 .. 15] OF ARRAY [0 .. 1023] OF CHAR;
  101. stkN : ARRAY [0 .. 15] OF CARDINAL;
  102. funcName : QVal; (* current function / call target *)
  103. curModName : SymTab.Name; (* module being compiled (global names) *)
  104. outName : SymTab.Name; (* image-file override (Lower compare) *)
  105. hasOutName : BOOLEAN;
  106. nVal : ARRAY [0 .. 255] OF QVal; (* VAR-actual note keys *)
  107. nAddr : ARRAY [0 .. 255] OF QVal; (* VAR-actual note addresses *)
  108. nn : CARDINAL;
  109. (* Session-state snapshot: Lower runs per unit while the grammar's
  110. suppressed inline emit still mutates these, so Lower saves/restores
  111. its own values around each unit. *)
  112. sav_nTemp, sav_nLab, sav_loopTop, sav_nR, sav_nStr, sav_nLoc,
  113. sav_nPar, sav_nArg, sav_nn, sav_nInit, sav_nFini, sav_sessUsed, sav_delayTop,
  114. sav_ustrN, sav_ustrUsed, sav_ctorN, sav_ctorTop, sav_funcDepth,
  115. sav_scopeTop, sav_callDepth, sav_outSel, sav_withTop,
  116. sav_setN : CARDINAL;
  117. sav_inBody, sav_inFunc, sav_useStack, sav_recvArmed : BOOLEAN;
  118. PROCEDURE SaveSession;
  119. BEGIN
  120. sav_nTemp := nTemp; sav_nLab := nLab; sav_loopTop := loopTop;
  121. sav_nR := nR; sav_nStr := nStr; sav_nLoc := nLoc; sav_nPar := nPar;
  122. sav_nArg := nArg; sav_nn := nn; sav_nInit := nInit;
  123. sav_nFini := nFini;
  124. sav_sessUsed := sessUsed; sav_delayTop := delayTop;
  125. sav_ustrN := ustrN; sav_ustrUsed := ustrUsed;
  126. sav_ctorN := ctorN; sav_ctorTop := ctorTop;
  127. sav_setN := setN;
  128. sav_funcDepth := funcDepth; sav_scopeTop := scopeTop;
  129. sav_callDepth := callDepth; sav_outSel := outSel;
  130. sav_withTop := withTop;
  131. sav_inBody := inBody; sav_inFunc := inFunc;
  132. sav_useStack := useStack; sav_recvArmed := recvArmed
  133. END SaveSession;
  134. PROCEDURE RestoreSession;
  135. VAR i : CARDINAL;
  136. BEGIN
  137. nTemp := sav_nTemp; nLab := sav_nLab; loopTop := sav_loopTop;
  138. nR := sav_nR; nStr := sav_nStr; nLoc := sav_nLoc; nPar := sav_nPar;
  139. nArg := sav_nArg; nInit := sav_nInit; nFini := sav_nFini;
  140. sessUsed := sav_sessUsed; delayTop := sav_delayTop;
  141. ustrN := sav_ustrN; ustrUsed := sav_ustrUsed;
  142. ctorN := sav_ctorN; ctorTop := sav_ctorTop;
  143. setN := sav_setN;
  144. funcDepth := sav_funcDepth; scopeTop := sav_scopeTop;
  145. callDepth := sav_callDepth; outSel := sav_outSel;
  146. withTop := sav_withTop;
  147. inBody := sav_inBody; inFunc := sav_inFunc;
  148. useStack := sav_useStack; recvArmed := sav_recvArmed;
  149. (* Clear the VAR-actual note ring. The grammar's suppressed
  150. parse-time emit never reaches the buffer, but its NoteAddr calls
  151. do fill this ring; AddrOfVal scans the whole ring and the keys
  152. are temps that restart per function, so a stale grammar entry can
  153. false-match Lower's own key. Lower re-notes its own VAR
  154. actuals, so starting from an empty ring is correct. *)
  155. nn := 0;
  156. i := 0;
  157. WHILE i <= HIGH(nVal) DO
  158. nVal[i][0] := CHR(0); nAddr[i][0] := CHR(0); INC(i)
  159. END
  160. END RestoreSession;
  161. (* ---------------- small string utilities ---------------- *)
  162. PROCEDURE Len (s: ARRAY OF CHAR): CARDINAL;
  163. VAR i : CARDINAL;
  164. BEGIN
  165. i := 0;
  166. WHILE (i <= HIGH(s)) AND (s[i] # CHR(0)) DO INC(i) END;
  167. RETURN i
  168. END Len;
  169. PROCEDURE Cpy (VAR d: ARRAY OF CHAR; s: ARRAY OF CHAR);
  170. VAR i : CARDINAL;
  171. BEGIN
  172. i := 0;
  173. WHILE (i <= HIGH(d)) AND (i <= HIGH(s)) AND (s[i] # CHR(0)) DO
  174. d[i] := s[i]; INC(i)
  175. END;
  176. IF i <= HIGH(d) THEN d[i] := CHR(0) END
  177. END Cpy;
  178. PROCEDURE App (VAR d: ARRAY OF CHAR; s: ARRAY OF CHAR);
  179. VAR i, j : CARDINAL;
  180. BEGIN
  181. i := 0;
  182. WHILE (i <= HIGH(d)) AND (d[i] # CHR(0)) DO INC(i) END;
  183. j := 0;
  184. WHILE (i <= HIGH(d)) AND (j <= HIGH(s)) AND (s[j] # CHR(0)) DO
  185. d[i] := s[j]; INC(i); INC(j)
  186. END;
  187. IF i <= HIGH(d) THEN d[i] := CHR(0) END
  188. END App;
  189. PROCEDURE BufApp (VAR buf: ARRAY OF CHAR; VAR used: CARDINAL;
  190. s: ARRAY OF CHAR; eol: BOOLEAN);
  191. VAR j : CARDINAL;
  192. BEGIN
  193. j := 0;
  194. WHILE (used < HIGH(buf)) AND (j <= HIGH(s)) AND (s[j] # CHR(0)) DO
  195. buf[used] := s[j]; INC(used); INC(j)
  196. END;
  197. IF eol AND (used < HIGH(buf)) THEN
  198. buf[used] := CHR(10); INC(used)
  199. END;
  200. IF used <= HIGH(buf) THEN buf[used] := CHR(0) END
  201. END BufApp;
  202. PROCEDURE WEmit (s: ARRAY OF CHAR; eol: BOOLEAN);
  203. (* Single output sink: the session buffer, or a nesting-depth
  204. buffer for nested functions (QBE rejects definitions inside
  205. functions, so nested bodies hoist until EndModule). *)
  206. VAR b, u, j : CARDINAL;
  207. BEGIN
  208. IF NOT opened OR noEmit THEN RETURN END;
  209. IF delayTop > 0 THEN
  210. b := delayTop - 1;
  211. u := delayUsed[b]; j := 0;
  212. WHILE (u < HIGH(delayBuf[b])) AND (j <= HIGH(s))
  213. AND (s[j] # CHR(0)) DO
  214. delayBuf[b][u] := s[j]; INC(u); INC(j)
  215. END;
  216. IF eol AND (u < HIGH(delayBuf[b])) THEN
  217. delayBuf[b][u] := CHR(10); INC(u)
  218. END;
  219. IF u <= HIGH(delayBuf[b]) THEN delayBuf[b][u] := CHR(0) END;
  220. delayUsed[b] := u;
  221. RETURN
  222. END;
  223. IF outSel = 0 THEN
  224. BufApp(sessBuf, sessUsed, s, eol);
  225. RETURN
  226. END;
  227. b := outSel - 1;
  228. IF b > HIGH(nestBufs) THEN b := HIGH(nestBufs) END;
  229. u := nestUsed[b];
  230. j := 0;
  231. WHILE (u < HIGH(nestBufs[b])) AND (j <= HIGH(s)) AND (s[j] # CHR(0)) DO
  232. nestBufs[b][u] := s[j]; INC(u); INC(j)
  233. END;
  234. IF eol AND (u < HIGH(nestBufs[b])) THEN
  235. nestBufs[b][u] := CHR(10); INC(u)
  236. END;
  237. IF u <= HIGH(nestBufs[b]) THEN nestBufs[b][u] := CHR(0) END;
  238. nestUsed[b] := u
  239. END WEmit;
  240. PROCEDURE W (s: ARRAY OF CHAR);
  241. BEGIN
  242. WEmit(s, FALSE)
  243. END W;
  244. PROCEDURE WL (s: ARRAY OF CHAR);
  245. BEGIN
  246. WEmit(s, TRUE)
  247. END WL;
  248. PROCEDURE SetNoEmit (b: BOOLEAN);
  249. BEGIN
  250. noEmit := b
  251. END SetNoEmit;
  252. PROCEDURE DelayBegin;
  253. (* Start buffering output (the RHS operand of a short-circuit AND/OR). *)
  254. BEGIN
  255. IF delayTop <= HIGH(delayBuf) THEN
  256. delayUsed[delayTop] := 0;
  257. delayBuf[delayTop][0] := CHR(0);
  258. INC(delayTop)
  259. END
  260. END DelayBegin;
  261. PROCEDURE DelayEnd;
  262. (* Stop buffering (restore the previous output sink). *)
  263. BEGIN
  264. IF delayTop > 0 THEN DEC(delayTop) END
  265. END DelayEnd;
  266. PROCEDURE DelayFlush;
  267. (* Emit the buffered RHS operand's code into the current sink.
  268. DelayEnd already popped delayTop, so the just-used buffer index is
  269. delayTop itself. *)
  270. VAR b: CARDINAL;
  271. BEGIN
  272. b := delayTop;
  273. IF b <= HIGH(delayBuf) THEN WEmit(delayBuf[b], FALSE) END
  274. END DelayFlush;
  275. PROCEDURE Slot4 (VAR s: QVal);
  276. BEGIN
  277. NewTemp(s);
  278. Revive;
  279. W(" "); W(s); W(" =l alloc4 4"); WL("")
  280. END Slot4;
  281. PROCEDURE StoreW (slot: ARRAY OF CHAR; val: ARRAY OF CHAR);
  282. BEGIN
  283. Revive;
  284. W(" storew "); W(val); W(", "); WL(slot)
  285. END StoreW;
  286. PROCEDURE LoadW (slot: ARRAY OF CHAR; VAR q: QVal);
  287. BEGIN
  288. NewTemp(q);
  289. Revive;
  290. W(" "); W(q); W(" =w loadw "); WL(slot)
  291. END LoadW;
  292. PROCEDURE SetModule (name: ARRAY OF CHAR);
  293. (* Names the module whose globals are being emitted (QBE symbols
  294. become "<mod>_<name>" so separate modules never collide). *)
  295. BEGIN
  296. Cpy(curModName, name)
  297. END SetModule;
  298. PROCEDURE SymRef (name: ARRAY OF CHAR; VAR ref: QVal);
  299. (* "$<mod>_<sym>" for module-level entries (avoids cross-module
  300. collisions); "$<name>" fallback otherwise. *)
  301. VAR g : SymTab.Name;
  302. BEGIN
  303. Cpy(ref, "$");
  304. IF SymTab.GlobalRef(name, g) THEN App(ref, g)
  305. ELSE App(ref, name)
  306. END
  307. END SymRef;
  308. PROCEDURE Wc (c: CHAR);
  309. (* Writes a single class character (w/d/l). *)
  310. VAR s : ARRAY [0 .. 1] OF CHAR;
  311. BEGIN
  312. s[0] := c; s[1] := CHR(0);
  313. W(s)
  314. END Wc;
  315. PROCEDURE AppNum (VAR d: ARRAY OF CHAR; v: CARDINAL);
  316. (* Appends v in decimal to d. *)
  317. VAR buf : ARRAY [0 .. 15] OF CHAR;
  318. n, i, L : CARDINAL;
  319. BEGIN
  320. n := 0;
  321. IF v = 0 THEN buf[0] := "0"; n := 1 END;
  322. WHILE (v > 0) AND (n <= HIGH(buf)) DO
  323. buf[n] := CHR(ORD("0") + v MOD 10); v := v DIV 10; INC(n)
  324. END;
  325. i := n;
  326. WHILE i > 0 DO
  327. DEC(i);
  328. L := Len(d);
  329. IF L < HIGH(d) THEN d[L] := buf[i]; d[L + 1] := CHR(0) END
  330. END
  331. END AppNum;
  332. (* ---------------- exported helpers ---------------- *)
  333. PROCEDURE CopyOp (s: ARRAY OF CHAR; VAR d: ARRAY OF CHAR);
  334. BEGIN
  335. Cpy(d, s)
  336. END CopyOp;
  337. PROCEDURE NoteAddr (val: ARRAY OF CHAR; addr: ARRAY OF CHAR);
  338. (* Records value-temp → address mapping for VAR actuals. Ring of
  339. 256: safe because SSA temps are never reused (stale entries can
  340. never false-match, only age out on pathological expressions). *)
  341. BEGIN
  342. Cpy(nVal[nn], val);
  343. Cpy(nAddr[nn], addr);
  344. nn := nn + 1;
  345. IF nn > HIGH(nVal) THEN nn := 0 END
  346. END NoteAddr;
  347. PROCEDURE AddrOfVal (val: ARRAY OF CHAR; VAR addr: QVal): BOOLEAN;
  348. VAR i : CARDINAL;
  349. BEGIN
  350. i := 0;
  351. WHILE i <= HIGH(nVal) DO
  352. IF SymTab.Equal(nVal[i], val) THEN
  353. Cpy(addr, nAddr[i]);
  354. RETURN TRUE
  355. END;
  356. INC(i)
  357. END;
  358. RETURN FALSE
  359. END AddrOfVal;
  360. PROCEDURE AddrOf (name: ARRAY OF CHAR; VAR q: QVal);
  361. VAR idx : INTEGER;
  362. levels : CARDINAL;
  363. BEGIN
  364. IF LocFindUp(name, levels, idx) THEN
  365. IF levels = 0 THEN
  366. IF locTag[idx] = 1 THEN
  367. Cpy(q, "$");
  368. App(q, locRep[idx])
  369. ELSE
  370. Cpy(q, locRep[idx])
  371. END
  372. ELSE
  373. UpAddrOf(idx, levels, q)
  374. END;
  375. RETURN
  376. END;
  377. SymRef(name, q)
  378. END AddrOf;
  379. PROCEDURE IntStr (v: INTEGER; VAR s: QVal);
  380. VAR neg : BOOLEAN;
  381. mag : CARDINAL;
  382. buf : ARRAY [0 .. 15] OF CHAR;
  383. n, i, L : CARDINAL;
  384. t : CHAR;
  385. BEGIN
  386. neg := v < 0;
  387. IF neg THEN mag := VAL(CARDINAL, -v) ELSE mag := VAL(CARDINAL, v) END;
  388. n := 0;
  389. IF mag = 0 THEN buf[0] := "0"; n := 1 END;
  390. WHILE (mag > 0) AND (n < HIGH(buf)) DO
  391. buf[n] := CHR(ORD("0") + mag MOD 10); mag := mag DIV 10; INC(n)
  392. END;
  393. i := 0;
  394. WHILE i < n DIV 2 DO
  395. t := buf[i]; buf[i] := buf[n - 1 - i]; buf[n - 1 - i] := t; INC(i)
  396. END;
  397. s[0] := CHR(0);
  398. IF neg THEN App(s, "-") END;
  399. i := 0;
  400. WHILE i < n DO
  401. L := Len(s);
  402. IF L < HIGH(s) THEN s[L] := buf[i]; s[L + 1] := CHR(0) END;
  403. INC(i)
  404. END
  405. END IntStr;
  406. PROCEDURE HexVal (ch: CHAR): INTEGER;
  407. BEGIN
  408. IF (ch >= "0") AND (ch <= "9") THEN RETURN ORD(ch) - ORD("0") END;
  409. IF (ch >= "A") AND (ch <= "F") THEN RETURN ORD(ch) - ORD("A") + 10 END;
  410. IF (ch >= "a") AND (ch <= "f") THEN RETURN ORD(ch) - ORD("a") + 10 END;
  411. RETURN 0
  412. END HexVal;
  413. PROCEDURE NormInt (s: ARRAY OF CHAR; VAR d: QVal);
  414. (* "0xFF" -> "255", plain decimals are copied through. *)
  415. VAR n, i : CARDINAL;
  416. v : INTEGER;
  417. BEGIN
  418. n := Len(s);
  419. IF (n > 2) AND (s[0] = "0")
  420. AND ((s[1] = "x") OR (s[1] = "X")) THEN
  421. v := 0; i := 2;
  422. WHILE i < n DO v := v * 16 + HexVal(s[i]); INC(i) END;
  423. IntStr(v, d)
  424. ELSE
  425. Cpy(d, s)
  426. END
  427. END NormInt;
  428. PROCEDURE NormLit (s: ARRAY OF CHAR; VAR d: QVal; VAR isCh: BOOLEAN);
  429. (* Full V3 integer literal: octal B/b, hex H/h and C/c suffixes plus
  430. the 0x/0X prefix; C marks a character constant. The suffix letter
  431. is excluded from the digit run (HexVal would read 'B' as 11).
  432. A 0x/0X prefix takes priority over any trailing B/C/H (C-style
  433. hex digits, so 0xB is 11, never an octal suffix). *)
  434. VAR n, i, hi, base : CARDINAL;
  435. v : INTEGER;
  436. ch : CHAR;
  437. BEGIN
  438. n := Len(s);
  439. isCh := FALSE;
  440. IF n = 0 THEN Cpy(d, "0"); RETURN END;
  441. i := 0;
  442. IF (n >= 3) AND (s[0] = "0") AND ((s[1] = "x") OR (s[1] = "X")) THEN
  443. base := 16; hi := n; i := 2
  444. ELSE
  445. ch := s[n - 1];
  446. IF (ch = "B") OR (ch = "b") THEN
  447. base := 8; hi := n - 1
  448. ELSIF (ch = "H") OR (ch = "h") THEN
  449. base := 16; hi := n - 1
  450. ELSIF (ch = "C") OR (ch = "c") THEN
  451. base := 16; hi := n - 1; isCh := TRUE
  452. ELSE
  453. base := 10; hi := n
  454. END
  455. END;
  456. v := 0;
  457. WHILE i < hi DO
  458. v := v * VAL(INTEGER, base) + HexVal(s[i]); INC(i)
  459. END;
  460. IntStr(v, d)
  461. END NormLit;
  462. PROCEDURE NormReal (s: ARRAY OF CHAR; VAR d: QVal);
  463. (* "3.14" -> "d_3.14" (QBE double immediates carry a d_ prefix). *)
  464. BEGIN
  465. Cpy(d, "d_");
  466. App(d, s)
  467. END NormReal;
  468. PROCEDURE CharVal (s: ARRAY OF CHAR): INTEGER;
  469. BEGIN
  470. IF Len(s) >= 2 THEN RETURN ORD(s[1]) END;
  471. RETURN 0
  472. END CharVal;
  473. PROCEDURE NegFold (a: ARRAY OF CHAR; VAR q: QVal);
  474. (* Safe for a and q being the same variable. *)
  475. VAR i, j, L : CARDINAL;
  476. tmp : QVal;
  477. BEGIN
  478. Cpy(tmp, a);
  479. IF Len(tmp) = 0 THEN Cpy(q, "0"); RETURN END;
  480. IF tmp[0] = "-" THEN
  481. i := 1; j := 0;
  482. WHILE (tmp[i] # CHR(0)) AND (j < HIGH(q)) DO
  483. q[j] := tmp[i]; INC(i); INC(j)
  484. END;
  485. IF j <= HIGH(q) THEN q[j] := CHR(0) END
  486. ELSIF (tmp[0] = "d") AND (Len(tmp) > 1) AND (tmp[1] = "_") THEN
  487. Cpy(q, "d_-");
  488. i := 2;
  489. WHILE tmp[i] # CHR(0) DO
  490. L := Len(q);
  491. IF L < HIGH(q) THEN q[L] := tmp[i]; q[L + 1] := CHR(0) END;
  492. INC(i)
  493. END
  494. ELSE
  495. Cpy(q, "-");
  496. App(q, tmp)
  497. END
  498. END NegFold;
  499. PROCEDURE IsImm (s: ARRAY OF CHAR): BOOLEAN;
  500. BEGIN
  501. IF Len(s) = 0 THEN RETURN FALSE END;
  502. RETURN ((s[0] >= "0") AND (s[0] <= "9")) OR (s[0] = "-")
  503. OR (s[0] = "d")
  504. END IsImm;
  505. PROCEDURE ParseInt (s: ARRAY OF CHAR; VAR v: INTEGER): BOOLEAN;
  506. VAR i, nd, d: CARDINAL;
  507. neg: BOOLEAN;
  508. BEGIN
  509. v := 0; i := 0; neg := FALSE; nd := 0;
  510. IF (i <= HIGH(s)) AND (s[i] = "-") THEN neg := TRUE; INC(i) END;
  511. IF (i > HIGH(s)) OR (s[i] = CHR(0)) THEN RETURN FALSE END;
  512. WHILE (i <= HIGH(s)) AND (s[i] # CHR(0)) DO
  513. d := ORD(s[i]);
  514. IF (d < ORD("0")) OR (d > ORD("9")) THEN RETURN FALSE END;
  515. v := v * 10 + VAL(INTEGER, d - ORD("0"));
  516. INC(i); INC(nd)
  517. END;
  518. IF nd = 0 THEN RETURN FALSE END;
  519. IF neg THEN v := -v END;
  520. RETURN TRUE
  521. END ParseInt;
  522. PROCEDURE Fold2 (kind: INTEGER; a, b: ARRAY OF CHAR; VAR r: QVal): BOOLEAN;
  523. VAR x, y, z: INTEGER;
  524. BEGIN
  525. IF NOT ParseInt(a, x) THEN RETURN FALSE END;
  526. IF NOT ParseInt(b, y) THEN RETURN FALSE END;
  527. IF kind = 0 THEN z := x + y
  528. ELSIF kind = 1 THEN z := x - y
  529. ELSIF kind = 2 THEN z := x * y
  530. ELSIF kind = 3 THEN
  531. IF y = 0 THEN RETURN FALSE END;
  532. z := x DIV y
  533. ELSE
  534. IF y = 0 THEN RETURN FALSE END;
  535. z := x MOD y
  536. END;
  537. IntStr(z, r);
  538. RETURN TRUE
  539. END Fold2;
  540. (* ---------------- module / data section ---------------- *)
  541. PROCEDURE OpenModule (name: ARRAY OF CHAR);
  542. VAR i : CARDINAL;
  543. BEGIN
  544. opened := TRUE;
  545. inBody := FALSE;
  546. dead := FALSE;
  547. hasOutName := FALSE;
  548. nTemp := 0; nLab := 0; loopTop := 0; nR := 0; nStr := 0;
  549. withTop := 0;
  550. noEmit := FALSE; inFunc := FALSE; useStack := FALSE;
  551. ctorN := 0; ctorTop := 0;
  552. setN := 0;
  553. nLoc := 0; nPar := 0; nArg := 0; nn := 0; callDepth := 0;
  554. recvArmed := FALSE;
  555. funcDepth := 0; scopeTop := 0; scopeBase[0] := 0;
  556. nInit := 0; nFini := 0;
  557. outSel := 0;
  558. sessUsed := 0; sessBuf[0] := CHR(0);
  559. delayTop := 0;
  560. ustrN := 0; ustrUsed := 0;
  561. i := 0;
  562. WHILE i <= HIGH(nestBufs) DO
  563. nestBufs[i][0] := CHR(0); nestUsed[i] := 0; INC(i)
  564. END;
  565. WL("# QBE IR generated by the V3 step-1 backend");
  566. WL("")
  567. END OpenModule;
  568. PROCEDURE DataLine (name: ARRAY OF CHAR; isReal: BOOLEAN;
  569. init: ARRAY OF CHAR);
  570. BEGIN
  571. IF NOT opened THEN RETURN END;
  572. W("data $"); W(name);
  573. IF isReal THEN W(" = { d ") ELSE W(" = { w ") END;
  574. W(init);
  575. WL(" }")
  576. END DataLine;
  577. PROCEDURE DataLineB (name: ARRAY OF CHAR; init: ARRAY OF CHAR);
  578. (* A one-byte global (BYTE/SBYTE). *)
  579. BEGIN
  580. IF NOT opened THEN RETURN END;
  581. W("data $"); W(name);
  582. W(" = { b ");
  583. W(init);
  584. WL(" }")
  585. END DataLineB;
  586. PROCEDURE DataLineH (name: ARRAY OF CHAR; init: ARRAY OF CHAR);
  587. (* A 16-bit global (WORD16/INTEGER16). *)
  588. BEGIN
  589. IF NOT opened THEN RETURN END;
  590. W("data $"); W(name);
  591. W(" = { h ");
  592. W(init);
  593. WL(" }")
  594. END DataLineH;
  595. PROCEDURE DataLinePacked (name: ARRAY OF CHAR; t: INTEGER);
  596. (* A PACKEDSET global: 1/2/4 bytes, zero-initialised. *)
  597. VAR nb: CARDINAL;
  598. BEGIN
  599. IF NOT opened THEN RETURN END;
  600. nb := SymTab.SetBytes(t);
  601. W("data $"); W(name);
  602. W(" = { ");
  603. IF nb = 1 THEN W("b 0")
  604. ELSIF nb = 2 THEN W("h 0")
  605. ELSE W("w 0")
  606. END;
  607. WL(" }")
  608. END DataLinePacked;
  609. PROCEDURE DataLineL (name: ARRAY OF CHAR; init: ARRAY OF CHAR);
  610. BEGIN
  611. IF NOT opened THEN RETURN END;
  612. W("data $"); W(name);
  613. W(" = { l ");
  614. W(init);
  615. WL(" }")
  616. END DataLineL;
  617. PROCEDURE DeclLocal (name: ARRAY OF CHAR; t: INTEGER);
  618. (* Function-local variable: stack slot + static init, recorded. *)
  619. VAR slot : QVal;
  620. BEGIN
  621. AllocLocal(t, slot);
  622. LocAdd(name, 0, slot, ResClass(t), t)
  623. END DeclLocal;
  624. PROCEDURE DeclVar (name: ARRAY OF CHAR; t: INTEGER);
  625. (* Module-level variable: emitted as data "$<mod>_<name>". *)
  626. VAR g : QVal;
  627. BEGIN
  628. IF inFunc THEN DeclLocal(name, t); RETURN END;
  629. Cpy(g, curModName); App(g, "_"); App(g, name);
  630. IF SymTab.ClassOf(t) = SymTab.ClReal THEN DataLine(g, TRUE, "0")
  631. ELSIF SymTab.IsByteType(t) THEN DataLineB(g, "0")
  632. ELSIF SymTab.IsWord16Type(t) THEN DataLineH(g, "0")
  633. ELSIF SymTab.ClassOf(t) = SymTab.ClArray THEN DeclArr(g, t)
  634. ELSIF SymTab.IsPackedSet(t) THEN DataLinePacked(g, t)
  635. ELSIF SymTab.ClassOf(t) = SymTab.ClSet THEN DeclSet(g, t)
  636. ELSIF (SymTab.ClassOf(t) = SymTab.ClRecord)
  637. OR (SymTab.ClassOf(t) = SymTab.ClClass) THEN
  638. DeclRec(g, t)
  639. ELSIF (SymTab.ClassOf(t) = SymTab.ClPtr)
  640. OR (SymTab.ClassOf(t) = SymTab.ClLong)
  641. OR (SymTab.ClassOf(t) = SymTab.ClProc) THEN DataLineL(g, "0")
  642. ELSE DataLine(g, FALSE, "0")
  643. END
  644. END DeclVar;
  645. PROCEDURE IsZeroReal (val: ARRAY OF CHAR): BOOLEAN;
  646. (* TRUE when the "d_..." literal denotes zero (checked textually). *)
  647. VAR i : CARDINAL;
  648. seen : BOOLEAN;
  649. ch : CHAR;
  650. BEGIN
  651. i := 0;
  652. IF (Len(val) > 1) AND (val[0] = "d") AND (val[1] = "_") THEN i := 2 END;
  653. IF (Len(val) > i) AND (val[i] = "-") THEN INC(i) END;
  654. seen := FALSE;
  655. WHILE val[i] # CHR(0) DO
  656. ch := val[i];
  657. IF (ch >= "0") AND (ch <= "9") THEN
  658. seen := TRUE;
  659. IF ch # "0" THEN RETURN FALSE END
  660. ELSIF (ch # ".") AND (ch # "E") AND (ch # "e")
  661. AND (ch # "+") AND (ch # "-") THEN
  662. RETURN FALSE
  663. END;
  664. INC(i)
  665. END;
  666. RETURN seen
  667. END IsZeroReal;
  668. PROCEDURE DeclConst (name: ARRAY OF CHAR; val: ARRAY OF CHAR; t: INTEGER);
  669. VAR cls : INTEGER;
  670. mang : QVal;
  671. BEGIN
  672. cls := SymTab.ClassOf(t);
  673. IF inFunc THEN
  674. Cpy(mang, funcName); App(mang, "_"); App(mang, name);
  675. LocAdd(name, 1, mang, ResClass(t), t)
  676. ELSE
  677. Cpy(mang, curModName); App(mang, "_"); App(mang, name)
  678. END;
  679. IF (cls = SymTab.ClStr) OR NOT IsImm(val) THEN
  680. DataLine(mang, FALSE, "0"); RETURN
  681. END;
  682. IF cls = SymTab.ClLong THEN
  683. DataLineL(mang, val)
  684. ELSIF cls = SymTab.ClReal THEN
  685. (* This qbe accepts only integer/zero literals in "data":
  686. non-zero REALs flush at BeginBody. *)
  687. DataLine(mang, TRUE, "0");
  688. IF NOT IsZeroReal(val) AND (nR <= HIGH(rNames)) THEN
  689. Cpy(rNames[nR], mang); Cpy(rVals[nR], val); INC(nR)
  690. END
  691. ELSE DataLine(mang, FALSE, val)
  692. END
  693. END DeclConst;
  694. (* ---------------- function body ---------------- *)
  695. PROCEDURE BeginInit (mod: ARRAY OF CHAR);
  696. (* Module BEGIN body as `<mod>_init`; main calls it at startup. *)
  697. VAR sym : QVal;
  698. BEGIN
  699. IF NOT opened THEN RETURN END;
  700. excHas[0] := FALSE;
  701. Cpy(sym, mod);
  702. App(sym, "_init");
  703. WL("");
  704. W("export function w $"); W(sym); WL("() {");
  705. WL("@start");
  706. IF nInit <= HIGH(initNames) THEN
  707. Cpy(initNames[nInit], sym); INC(nInit)
  708. END
  709. END BeginInit;
  710. PROCEDURE EndInit;
  711. BEGIN
  712. Revive;
  713. WL(" ret 0");
  714. WL("}")
  715. END EndInit;
  716. PROCEDURE BeginFini (mod: ARRAY OF CHAR);
  717. (* Module FINALLY body as `<mod>_fini`; main calls it at termination. *)
  718. VAR sym : QVal;
  719. BEGIN
  720. IF NOT opened THEN RETURN END;
  721. excHas[0] := FALSE;
  722. Cpy(sym, mod);
  723. App(sym, "_fini");
  724. WL("");
  725. W("export function w $"); W(sym); WL("() {");
  726. WL("@start");
  727. IF nFini <= HIGH(finiNames) THEN
  728. Cpy(finiNames[nFini], sym); INC(nFini)
  729. END
  730. END BeginFini;
  731. PROCEDURE EndFini;
  732. BEGIN
  733. Revive;
  734. WL(" ret 0");
  735. WL("}")
  736. END EndFini;
  737. PROCEDURE BeginBody;
  738. VAR i : CARDINAL;
  739. t : QVal;
  740. BEGIN
  741. IF NOT opened OR inBody THEN RETURN END;
  742. WL("");
  743. WL("export function w $main() {");
  744. WL("@start");
  745. excHas[0] := FALSE;
  746. WL(" call $m2_exc_init()");
  747. inBody := TRUE;
  748. i := 0;
  749. WHILE i < nR DO
  750. NewTemp(t);
  751. W(" "); W(t); W(" =d copy "); WL(rVals[i]);
  752. StoreVar(rNames[i], t, TRUE);
  753. INC(i)
  754. END;
  755. i := 0;
  756. WHILE i < nInit DO
  757. W(" call $"); W(initNames[i]); WL("()");
  758. INC(i)
  759. END
  760. END BeginBody;
  761. PROCEDURE FlushSets;
  762. (* Pooled set constants. Declared before EndModule, which calls it. *)
  763. VAR k, i: CARDINAL;
  764. w: CARDINAL;
  765. sv: QVal;
  766. BEGIN
  767. IF NOT opened THEN RETURN END;
  768. k := 0;
  769. WHILE k < setN DO
  770. W("data $"); W(setNam[k]); W(" = { ");
  771. w := setW[k];
  772. IF w = 0 THEN w := 1 END;
  773. i := 0;
  774. WHILE i < w DO
  775. IF i > 0 THEN W(", ") END;
  776. IntStr(VAL(INTEGER, setMask[k][i]), sv);
  777. W("w "); W(sv);
  778. INC(i)
  779. END;
  780. WL(" }");
  781. INC(k)
  782. END
  783. END FlushSets;
  784. PROCEDURE FiniExists (name: ARRAY OF CHAR): BOOLEAN;
  785. VAR i: CARDINAL;
  786. BEGIN
  787. i := 0;
  788. WHILE i < nFini DO
  789. IF SymTab.Equal(finiNames[i], name) THEN RETURN TRUE END;
  790. INC(i)
  791. END;
  792. RETURN FALSE
  793. END FiniExists;
  794. PROCEDURE EmitFiniCalls (prog: ARRAY OF CHAR);
  795. (* Program finalizer first, then imported/local finalizers in reverse
  796. initialization order. *)
  797. VAR i: CARDINAL; p: QVal;
  798. BEGIN
  799. Cpy(p, prog); App(p, "_fini");
  800. IF FiniExists(p) THEN
  801. W(" call $"); W(p); WL("()")
  802. END;
  803. i := nFini;
  804. WHILE i > 0 DO
  805. DEC(i);
  806. IF NOT SymTab.Equal(finiNames[i], p) THEN
  807. W(" call $"); W(finiNames[i]); WL("()")
  808. END
  809. END
  810. END EmitFiniCalls;
  811. PROCEDURE EndModule (name: ARRAY OF CHAR);
  812. VAR i : CARDINAL;
  813. fname : ARRAY [0 .. 127] OF CHAR;
  814. ref : QVal;
  815. BEGIN
  816. IF NOT opened THEN RETURN END;
  817. (* Per-unit Lower emission: the grammar's own unit-end EndModule must
  818. not flush/close/write while the legacy emit is suppressed. The
  819. real session image is written by Lower.EndSession. *)
  820. IF noEmit THEN RETURN END;
  821. IF NOT inBody THEN BeginBody END;
  822. EmitFiniCalls(name);
  823. IF SymTab.Lookup("ExitCode")
  824. AND (SymTab.SymKind("ExitCode") = SymTab.KindVar)
  825. AND SymTab.IsIntFamily(SymTab.SymType("ExitCode")) THEN
  826. Cpy(ref, "$"); App(ref, name); App(ref, "_ExitCode");
  827. W(" %ec =w loadw "); WL(ref);
  828. WL(" ret %ec")
  829. ELSE
  830. WL(" ret 0")
  831. END;
  832. WL("}");
  833. (* hoisted nested functions, then deferred data *)
  834. i := 0;
  835. WHILE i <= HIGH(nestBufs) DO
  836. IF nestUsed[i] > 0 THEN
  837. BufApp(sessBuf, sessUsed, nestBufs[i], FALSE)
  838. END;
  839. INC(i)
  840. END;
  841. FlushStrings;
  842. FlushUStrings;
  843. FlushCtors;
  844. FlushSets;
  845. EmitVTables;
  846. (* the image is named after the program module *)
  847. fname[0] := CHR(0);
  848. App(fname, "gen_ssa/");
  849. IF hasOutName THEN App(fname, outName) ELSE App(fname, name) END;
  850. App(fname, ".ssa");
  851. FileIO.Open(out, fname, TRUE);
  852. IF FileIO.Okay THEN
  853. (* Flush exactly sessUsed bytes. FileIO.WriteString scans for a
  854. NUL and misbehaves for multi-megabyte buffers, so write the
  855. image byte by byte up to sessUsed. *)
  856. i := 0;
  857. WHILE i < sessUsed DO
  858. FileIO.Write(out, sessBuf[i]); INC(i)
  859. END
  860. END;
  861. FileIO.Close(out);
  862. opened := FALSE
  863. END EndModule;
  864. (* ---------------- functions and calls (step 4.1) ---------------- *)
  865. (* Module-level procedures only (nested → NoEmit until 4.2).
  866. Value params arrive as SSA values and are copied to slots;
  867. composite value params arrive as addresses and are copied;
  868. VAR params stay addresses. Locals live in stack slots. *)
  869. PROCEDURE LocFind (name: ARRAY OF CHAR): INTEGER;
  870. VAR i : CARDINAL;
  871. BEGIN
  872. i := 0;
  873. WHILE i < nLoc DO
  874. IF SymTab.Equal(locNames[i], name) THEN RETURN VAL(INTEGER, i) END;
  875. INC(i)
  876. END;
  877. RETURN -1
  878. END LocFind;
  879. PROCEDURE ScopeBegin;
  880. (* Pushes a procedure scope (always balanced, even under NoEmit). *)
  881. BEGIN
  882. IF scopeTop > HIGH(scopeLink) THEN RETURN END;
  883. scopeBase[scopeTop] := nLoc;
  884. INC(scopeTop);
  885. scopeBase[scopeTop] := nLoc
  886. END ScopeBegin;
  887. PROCEDURE ScopeEnd;
  888. BEGIN
  889. IF scopeTop > 0 THEN
  890. DEC(scopeTop);
  891. nLoc := scopeBase[scopeTop]
  892. END
  893. END ScopeEnd;
  894. PROCEDURE LocFindUp (name: ARRAY OF CHAR; VAR levels: CARDINAL;
  895. VAR flat: INTEGER): BOOLEAN;
  896. (* Innermost procedure scope holding name; levels = scopes crossed,
  897. flat = table index. FALSE when purely global. *)
  898. VAR s, top, lo, hi, j : CARDINAL;
  899. BEGIN
  900. levels := 0; flat := -1;
  901. IF scopeTop = 0 THEN RETURN FALSE END;
  902. top := scopeTop - 1;
  903. s := top;
  904. LOOP
  905. lo := scopeBase[s];
  906. IF s = top THEN hi := nLoc ELSE hi := scopeBase[s + 1] END;
  907. j := lo;
  908. WHILE j < hi DO
  909. IF SymTab.Equal(locNames[j], name) THEN
  910. levels := top - s;
  911. flat := VAL(INTEGER, j);
  912. RETURN TRUE
  913. END;
  914. INC(j)
  915. END;
  916. IF s = 0 THEN RETURN FALSE END;
  917. DEC(s)
  918. END
  919. END LocFindUp;
  920. PROCEDURE LocAdd (name: ARRAY OF CHAR; tag: INTEGER; rep: ARRAY OF CHAR;
  921. cls: CHAR; typ: INTEGER);
  922. VAR idx : CARDINAL;
  923. off : QVal;
  924. lk : QVal;
  925. BEGIN
  926. IF (scopeTop = 0) OR (nLoc > HIGH(locNames)) THEN RETURN END;
  927. idx := nLoc - scopeBase[scopeTop - 1];
  928. IF idx > 63 THEN RETURN END;
  929. Cpy(locNames[nLoc], name);
  930. locTag[nLoc] := tag;
  931. Cpy(locRep[nLoc], rep);
  932. locCls[nLoc] := cls;
  933. locTyp[nLoc] := typ;
  934. INC(nLoc);
  935. IF tag = 1 THEN RETURN END;
  936. Cpy(lk, scopeLink[scopeTop - 1]);
  937. IntStr(VAL(INTEGER, 8 * (idx + 1)), off);
  938. NewTemp(lk);
  939. Op3L("add", lk, scopeLink[scopeTop - 1], off);
  940. Revive;
  941. W(" storel "); W(rep); W(", "); WL(lk)
  942. END LocAdd;
  943. PROCEDURE LocFull (): BOOLEAN;
  944. (* TRUE past 64 locals in the current scope (→ 233). *)
  945. BEGIN
  946. IF scopeTop = 0 THEN RETURN FALSE END;
  947. RETURN nLoc - scopeBase[scopeTop - 1] > 63
  948. END LocFull;
  949. PROCEDURE UpAddr (levels: CARDINAL; rel: CARDINAL; VAR q: QVal);
  950. (* Address of an up-level local: walks the static chain, then
  951. loads the link cell (slot address or actual address). *)
  952. VAR cur, t, off : QVal;
  953. L : CARDINAL;
  954. BEGIN
  955. Cpy(cur, scopeLink[scopeTop - 1]);
  956. L := levels;
  957. WHILE L > 0 DO
  958. NewTemp(t);
  959. Revive;
  960. W(" "); W(t); W(" =l loadl "); WL(cur);
  961. Cpy(cur, t);
  962. DEC(L)
  963. END;
  964. IntStr(VAL(INTEGER, 8 * (rel + 1)), off);
  965. NewTemp(t);
  966. Op3L("add", t, cur, off);
  967. NewTemp(q);
  968. Revive;
  969. W(" "); W(q); W(" =l loadl "); WL(t)
  970. END UpAddr;
  971. PROCEDURE ResClass (t: INTEGER): CHAR;
  972. VAR cls : INTEGER;
  973. BEGIN
  974. cls := SymTab.ClassOf(t);
  975. IF cls = SymTab.ClReal THEN RETURN "d" END;
  976. IF (cls = SymTab.ClArray) OR (cls = SymTab.ClSet)
  977. OR (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass)
  978. OR (cls = SymTab.ClPtr) OR (cls = SymTab.ClLong)
  979. OR (cls = SymTab.ClProc) THEN
  980. RETURN "l"
  981. END;
  982. RETURN "w"
  983. END ResClass;
  984. PROCEDURE Mangled (pname: ARRAY OF CHAR; uid: CARDINAL; VAR q: QVal);
  985. (* External procedures bind to their C link name; everything else
  986. mangles to <name>_<uid> (deterministic, collision-free). *)
  987. VAR link, base : SymTab.Name;
  988. BEGIN
  989. IF SymTab.ProcLink(pname, link) THEN
  990. Cpy(q, link);
  991. RETURN
  992. END;
  993. IF NOT SymTab.SymBase(pname, base) THEN
  994. IF NOT SymTab.ProcBaseByUid(uid, base) THEN Cpy(base, pname) END
  995. END;
  996. Cpy(q, base);
  997. App(q, "_");
  998. AppNum(q, uid)
  999. END Mangled;
  1000. PROCEDURE AllocLocal (t: INTEGER; VAR slot: QVal);
  1001. (* Stack slot sized for t's inline footprint; arrays/records get
  1002. full objects + static init. Scalar/pointer/set slots are
  1003. zero-initialized: QBE rejects reads of never-stored slots, and
  1004. the frontend emits a dead load for assignment targets (Test2
  1005. heritage, harmless for zero-initialized globals). Locals match
  1006. the globals' zero-init convention. *)
  1007. VAR cls : INTEGER;
  1008. nb : QVal;
  1009. BEGIN
  1010. cls := SymTab.ClassOf(t);
  1011. NewTemp(slot);
  1012. Revive;
  1013. W(" "); W(slot);
  1014. IF (cls = SymTab.ClArray) THEN
  1015. IntStr(VAL(INTEGER, HeapSize(t)), nb);
  1016. W(" =l alloc8 "); WL(nb);
  1017. InitStack(slot, t)
  1018. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  1019. IntStr(VAL(INTEGER, SymTab.TypeSize(t)), nb);
  1020. W(" =l alloc8 "); WL(nb);
  1021. InitStack(slot, t)
  1022. ELSIF SymTab.IsPackedSet(t) THEN
  1023. W(" =l alloc4 4"); WL("");
  1024. IF SymTab.SetBytes(t) = 1 THEN W(" storeb 0, "); WL(slot)
  1025. ELSIF SymTab.SetBytes(t) = 2 THEN W(" storeh 0, "); WL(slot)
  1026. ELSE W(" storew 0, "); WL(slot)
  1027. END
  1028. ELSIF cls = SymTab.ClSet THEN
  1029. IntStr(VAL(INTEGER, SymTab.SetWords(t) * 4), nb);
  1030. W(" =l alloc8 "); WL(nb);
  1031. SetZero(slot, SymTab.SetWords(t))
  1032. ELSIF cls = SymTab.ClReal THEN
  1033. W(" =l alloc8 8"); WL("");
  1034. W(" stored d_0.0, "); WL(slot)
  1035. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClLong)
  1036. OR (cls = SymTab.ClProc) THEN
  1037. W(" =l alloc8 8"); WL("");
  1038. W(" storel 0, "); WL(slot)
  1039. ELSIF (cls = SymTab.ClByte) OR (cls = SymTab.ClSByte) THEN
  1040. W(" =l alloc4 4"); WL("");
  1041. W(" storeb 0, "); WL(slot)
  1042. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN
  1043. W(" =l alloc4 4"); WL("");
  1044. W(" storeh 0, "); WL(slot)
  1045. ELSE
  1046. W(" =l alloc4 4"); WL("");
  1047. W(" storew 0, "); WL(slot)
  1048. END
  1049. END AllocLocal;
  1050. PROCEDURE OpenScalarDesc (val: ARRAY OF CHAR; t, ft: INTEGER; VAR desc: QVal);
  1051. (* gm2 compatibility: wrap a scalar actual as an `ARRAY OF BYTE`
  1052. descriptor in the frame. Layout is the usual [count][data]; the
  1053. count is ObjectSize(actual), so HIGH matches gm2's SIZE-1, and the
  1054. payload is a copy of the value (writes do not reach the actual). *)
  1055. VAR cnt, off, nb: QVal;
  1056. cls: INTEGER;
  1057. sz, esz: CARDINAL;
  1058. BEGIN
  1059. sz := SymTab.ObjectSize(t);
  1060. esz := SymTab.ObjectSize(SymTab.ArrayElem(ft));
  1061. IF esz = 0 THEN esz := 1 END;
  1062. NewTemp(desc); Revive;
  1063. W(" "); W(desc); W(" =l alloc8 ");
  1064. IntStr(VAL(INTEGER, 8 + sz * esz), nb); WL(nb);
  1065. NewTemp(cnt); IntStr(VAL(INTEGER, sz), cnt);
  1066. W(" storel "); W(cnt); W(", "); W(desc); WL("");
  1067. NewTemp(off); Op3L("add", off, desc, "8");
  1068. cls := SymTab.ClassOf(t);
  1069. IF cls = SymTab.ClReal THEN
  1070. W(" stored "); W(val); W(", "); W(off); WL("")
  1071. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClLong) OR (sz > 4) THEN
  1072. W(" storel "); W(val); W(", "); W(off); WL("")
  1073. ELSIF (cls = SymTab.ClByte) OR (cls = SymTab.ClSByte) THEN
  1074. W(" storeb "); W(val); W(", "); W(off); WL("")
  1075. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN
  1076. W(" storeh "); W(val); W(", "); W(off); WL("")
  1077. ELSE
  1078. W(" storew "); W(val); W(", "); W(off); WL("")
  1079. END
  1080. END OpenScalarDesc;
  1081. PROCEDURE BeginFunc (mangled: ARRAY OF CHAR);
  1082. (* Opens function context and scope; the header (with a leading
  1083. static-link param) buffers until EndFuncHeader. FORWARD/DefUnit
  1084. paths discard via AbortFunc. *)
  1085. BEGIN
  1086. ScopeBegin;
  1087. INC(funcDepth);
  1088. IF funcDepth <= HIGH(excHas) THEN excHas[funcDepth] := FALSE END;
  1089. inFunc := TRUE;
  1090. nPar := 0;
  1091. funcRes := "w";
  1092. Cpy(funcName, mangled);
  1093. hbuf[0] := CHR(0);
  1094. NewTemp(slTmp);
  1095. HApp("l ");
  1096. HApp(slTmp);
  1097. hdrComma := TRUE;
  1098. IF funcDepth > 1 THEN
  1099. outSel := funcDepth - 1;
  1100. IF outSel > HIGH(nestBufs) + 1 THEN
  1101. outSel := HIGH(nestBufs) + 1
  1102. END
  1103. ELSE
  1104. outSel := 0
  1105. END
  1106. END BeginFunc;
  1107. PROCEDURE SetFuncRes (t: INTEGER);
  1108. BEGIN
  1109. funcRes := ResClass(t)
  1110. END SetFuncRes;
  1111. PROCEDURE HApp (s: ARRAY OF CHAR);
  1112. (* Appends to the header buffer (bounded: FormalParams cap it). *)
  1113. VAR i, j : CARDINAL;
  1114. BEGIN
  1115. i := 0;
  1116. WHILE (i <= HIGH(hbuf)) AND (hbuf[i] # CHR(0)) DO INC(i) END;
  1117. j := 0;
  1118. WHILE (i < HIGH(hbuf)) AND (j <= HIGH(s)) AND (s[j] # CHR(0)) DO
  1119. hbuf[i] := s[j]; INC(i); INC(j)
  1120. END;
  1121. IF i <= HIGH(hbuf) THEN hbuf[i] := CHR(0) END
  1122. END HApp;
  1123. PROCEDURE FuncParam (name: ARRAY OF CHAR; isVar: BOOLEAN;
  1124. t: INTEGER): BOOLEAN;
  1125. VAR c : CHAR;
  1126. tmp : QVal;
  1127. buf : ARRAY [0 .. 71] OF CHAR;
  1128. BEGIN
  1129. IF nPar > HIGH(parCls) THEN RETURN FALSE END;
  1130. IF isVar THEN c := "l" ELSE c := ResClass(t) END;
  1131. parCls[nPar] := c;
  1132. NewTemp(tmp);
  1133. Cpy(parTmp[nPar], tmp);
  1134. Cpy(parNam[nPar], name);
  1135. parVar[nPar] := isVar;
  1136. parTyp[nPar] := t;
  1137. IF hdrComma THEN HApp(", ") END;
  1138. hdrComma := TRUE;
  1139. buf[0] := c; buf[1] := " "; buf[2] := CHR(0);
  1140. App(buf, tmp);
  1141. HApp(buf);
  1142. INC(nPar);
  1143. RETURN TRUE
  1144. END FuncParam;
  1145. PROCEDURE EndFuncHeader;
  1146. (* Flushes the buffered header + body label, allocates the link
  1147. record ([0] = parent link), then emits entry copies. *)
  1148. VAR i : CARDINAL;
  1149. slot, nb, lk : QVal;
  1150. cls : INTEGER;
  1151. BEGIN
  1152. W("export function "); Wc(funcRes); W(" $"); W(funcName); W("(");
  1153. W(hbuf);
  1154. WL(") {");
  1155. WL("@start");
  1156. inBody := TRUE;
  1157. NewTemp(lk);
  1158. Cpy(scopeLink[scopeTop - 1], lk);
  1159. Revive;
  1160. W(" "); W(lk); W(" =l alloc8 520"); WL("");
  1161. W(" storel "); W(slTmp); W(", "); WL(lk);
  1162. i := 0;
  1163. WHILE i < nPar DO
  1164. cls := SymTab.ClassOf(parTyp[i]);
  1165. IF parVar[i] THEN
  1166. LocAdd(parNam[i], 2, parTmp[i], parCls[i], parTyp[i])
  1167. ELSE
  1168. AllocLocal(parTyp[i], slot);
  1169. LocAdd(parNam[i], 0, slot, parCls[i], parTyp[i]);
  1170. IF cls = SymTab.ClArray THEN
  1171. CopyArray(slot, parTmp[i], parTyp[i])
  1172. ELSIF cls = SymTab.ClSet THEN
  1173. CopySetVal(slot, parTyp[i], parTmp[i], parTyp[i])
  1174. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  1175. CopyRecord(slot, parTmp[i], parTyp[i])
  1176. ELSIF cls = SymTab.ClReal THEN
  1177. Revive;
  1178. W(" stored "); W(parTmp[i]); W(", "); WL(slot)
  1179. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClProc)
  1180. OR (cls = SymTab.ClLong) THEN
  1181. Revive;
  1182. W(" storel "); W(parTmp[i]); W(", "); WL(slot)
  1183. ELSIF (cls = SymTab.ClByte) OR (cls = SymTab.ClSByte) THEN
  1184. Revive;
  1185. W(" storeb "); W(parTmp[i]); W(", "); WL(slot)
  1186. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN
  1187. Revive;
  1188. W(" storeh "); W(parTmp[i]); W(", "); WL(slot)
  1189. ELSE
  1190. Revive;
  1191. W(" storew "); W(parTmp[i]); W(", "); WL(slot)
  1192. END
  1193. END;
  1194. INC(i)
  1195. END
  1196. END EndFuncHeader;
  1197. PROCEDURE AbortFunc;
  1198. (* Discards function context without emitting (DefUnit headings,
  1199. FORWARD, methods): pops the scope, restores the depth. *)
  1200. BEGIN
  1201. ScopeEnd;
  1202. IF funcDepth <= HIGH(excHas) THEN excHas[funcDepth] := FALSE END;
  1203. IF funcDepth > 0 THEN DEC(funcDepth) END;
  1204. inFunc := funcDepth > 0;
  1205. inBody := FALSE;
  1206. nPar := 0;
  1207. IF funcDepth > 1 THEN outSel := funcDepth - 1
  1208. ELSE outSel := 0
  1209. END
  1210. END AbortFunc;
  1211. PROCEDURE EndFunc (resT: INTEGER);
  1212. VAR rc : CHAR;
  1213. BEGIN
  1214. rc := ResClass(resT);
  1215. Revive;
  1216. IF resT # SymTab.InvalidType THEN
  1217. (* A function that reaches its end without RETURN raises the
  1218. language functionException instead of silently returning 0. *)
  1219. TrapCode(4)
  1220. ELSIF rc = "d" THEN WL(" ret d_0.0")
  1221. ELSIF rc = "l" THEN WL(" ret 0")
  1222. ELSE WL(" ret 0")
  1223. END;
  1224. WL("}");
  1225. ScopeEnd;
  1226. IF funcDepth <= HIGH(excHas) THEN excHas[funcDepth] := FALSE END;
  1227. IF funcDepth > 0 THEN DEC(funcDepth) END;
  1228. inFunc := funcDepth > 0;
  1229. inBody := FALSE;
  1230. IF funcDepth > 1 THEN outSel := funcDepth - 1
  1231. ELSE outSel := 0
  1232. END
  1233. END EndFunc;
  1234. PROCEDURE EmitRet (q: ARRAY OF CHAR; hasVal: BOOLEAN);
  1235. BEGIN
  1236. Revive;
  1237. IF (funcDepth <= HIGH(excHas)) AND excHas[funcDepth] THEN
  1238. WL(" call $m2_exc_leave()")
  1239. END;
  1240. IF hasVal THEN W(" ret "); WL(q)
  1241. ELSE WL(" ret 0")
  1242. END;
  1243. dead := TRUE
  1244. END EmitRet;
  1245. PROCEDURE ExcBegin;
  1246. (* M2: emit the handler prologue for the current function/module body.
  1247. The QBE frame owns a 512-byte sigjmp_buf; the runtime handler stores
  1248. that address. Dispatch: 0 = body, 2 = RETRY/body, 1 = handler. *)
  1249. VAR env, r, z, chk: QVal;
  1250. BEGIN
  1251. IF funcDepth > HIGH(excHas) THEN RETURN END;
  1252. Revive;
  1253. NewTemp(env);
  1254. W(" "); W(env); WL(" =l alloc8 512");
  1255. W(" call $m2_exc_push(l "); W(env); WL(")");
  1256. NewTemp(r);
  1257. W(" "); W(r); W(" =w call $__sigsetjmp(l "); W(env);
  1258. W(", w 1)"); WL("");
  1259. NewLabel(excBodyL[funcDepth]);
  1260. NewLabel(excHandlerL[funcDepth]);
  1261. NewLabel(excAfterL[funcDepth]);
  1262. NewLabel(chk);
  1263. NewTemp(z);
  1264. Op3("ceqw", z, r, "0", FALSE);
  1265. Jnz(z, excBodyL[funcDepth], chk);
  1266. EmitLabel(chk);
  1267. NewTemp(z);
  1268. Op3("ceqw", z, r, "2", FALSE);
  1269. Jnz(z, excBodyL[funcDepth], excHandlerL[funcDepth]);
  1270. EmitLabel(excBodyL[funcDepth]);
  1271. excHas[funcDepth] := TRUE
  1272. END ExcBegin;
  1273. PROCEDURE ExcBodyDone;
  1274. BEGIN
  1275. IF funcDepth > HIGH(excHas) THEN RETURN END;
  1276. Revive;
  1277. WL(" call $m2_exc_leave()");
  1278. Jmp(excAfterL[funcDepth])
  1279. END ExcBodyDone;
  1280. PROCEDURE ExcHandlerBegin;
  1281. BEGIN
  1282. IF funcDepth > HIGH(excHas) THEN RETURN END;
  1283. EmitLabel(excHandlerL[funcDepth])
  1284. END ExcHandlerBegin;
  1285. PROCEDURE ExcEnd;
  1286. BEGIN
  1287. IF funcDepth > HIGH(excHas) THEN RETURN END;
  1288. Revive;
  1289. WL(" call $m2_exc_leave()");
  1290. EmitLabel(excAfterL[funcDepth])
  1291. END ExcEnd;
  1292. PROCEDURE ExcRetry;
  1293. BEGIN
  1294. IF dead THEN RETURN END;
  1295. WL(" call $m2_exc_retry()");
  1296. dead := TRUE
  1297. END ExcRetry;
  1298. PROCEDURE ProcAddr (mangled: ARRAY OF CHAR; VAR q: QVal);
  1299. BEGIN
  1300. Cpy(q, "$");
  1301. App(q, mangled)
  1302. END ProcAddr;
  1303. PROCEDURE CallBeginInd (callee: ARRAY OF CHAR; resT: INTEGER;
  1304. isExt: BOOLEAN);
  1305. (* Indirect call through the code pointer in `callee`. *)
  1306. BEGIN
  1307. IF callDepth > HIGH(stkName) THEN RETURN END;
  1308. Cpy(stkName[callDepth], callee);
  1309. stkRes[callDepth] := ResClass(resT);
  1310. stkExt[callDepth] := isExt;
  1311. stkInd[callDepth] := TRUE;
  1312. Cpy(stkLink[callDepth], "0");
  1313. stkArg[callDepth][0] := CHR(0);
  1314. stkN[callDepth] := 0;
  1315. INC(callDepth);
  1316. IF recvArmed THEN
  1317. IF NOT CallArg(recvQ, "l") THEN
  1318. END;
  1319. recvArmed := FALSE
  1320. END
  1321. END CallBeginInd;
  1322. PROCEDURE VirtCallBegin (obj: ARRAY OF CHAR; slot: INTEGER; resT: INTEGER);
  1323. (* Virtual dispatch: load obj's vtable pointer, fetch slot `slot`,
  1324. and begin an indirect call through it. The receiver (obj) must be
  1325. armed (ArmRecv). *)
  1326. VAR vt, off, ea, fp: QVal;
  1327. BEGIN
  1328. NewTemp(vt);
  1329. W(" "); W(vt); W(" =l loadl "); WL(obj);
  1330. IntStr(slot * 8, off);
  1331. NewTemp(ea);
  1332. Op3L("add", ea, vt, off);
  1333. NewTemp(fp);
  1334. W(" "); W(fp); W(" =l loadl "); WL(ea);
  1335. CallBeginInd(fp, resT, FALSE)
  1336. END VirtCallBegin;
  1337. PROCEDURE ArmRecv (q: ARRAY OF CHAR);
  1338. (* Arms the receiver for the next class-method call: CallBegin passes
  1339. it as the hidden first argument. *)
  1340. BEGIN
  1341. Cpy(recvQ, q);
  1342. recvArmed := TRUE
  1343. END ArmRecv;
  1344. PROCEDURE CallBegin (mangled: ARRAY OF CHAR; resT: INTEGER;
  1345. fdep: CARDINAL; isExt: BOOLEAN);
  1346. (* Pushes a call level; the static link is resolved now (caller
  1347. context cannot change mid-call): module callers pass 0, others
  1348. walk the chain (inFuncDepth - fdep) from their link record.
  1349. External callees take no static link. *)
  1350. VAR walks : INTEGER;
  1351. cur, t : QVal;
  1352. BEGIN
  1353. IF callDepth > HIGH(stkName) THEN RETURN END;
  1354. Cpy(stkName[callDepth], mangled);
  1355. stkRes[callDepth] := ResClass(resT);
  1356. stkExt[callDepth] := isExt;
  1357. stkInd[callDepth] := FALSE;
  1358. stkArg[callDepth][0] := CHR(0);
  1359. stkN[callDepth] := 0;
  1360. IF isExt THEN
  1361. Cpy(stkLink[callDepth], "0")
  1362. ELSIF funcDepth = 0 THEN
  1363. Cpy(stkLink[callDepth], "0")
  1364. ELSE
  1365. walks := VAL(INTEGER, funcDepth) - VAL(INTEGER, fdep);
  1366. Cpy(cur, scopeLink[scopeTop - 1]);
  1367. WHILE walks > 0 DO
  1368. NewTemp(t);
  1369. Revive;
  1370. W(" "); W(t); W(" =l loadl "); WL(cur);
  1371. Cpy(cur, t);
  1372. DEC(walks)
  1373. END;
  1374. Cpy(stkLink[callDepth], cur)
  1375. END;
  1376. INC(callDepth);
  1377. IF recvArmed THEN
  1378. (* class method: the receiver is the hidden first argument *)
  1379. IF NOT CallArg(recvQ, "l") THEN
  1380. END;
  1381. recvArmed := FALSE
  1382. END
  1383. END CallBegin;
  1384. PROCEDURE CallArg (q: ARRAY OF CHAR; cls: CHAR): BOOLEAN;
  1385. (* Appends "c operand, " to the current level. FALSE when full. *)
  1386. VAR need, have, i, j, d : CARDINAL;
  1387. BEGIN
  1388. d := callDepth - 1;
  1389. IF callDepth = 0 THEN RETURN FALSE END;
  1390. IF d > HIGH(stkArg) THEN d := HIGH(stkArg) END;
  1391. need := Len(q) + 5;
  1392. have := Len(stkArg[d]);
  1393. IF (stkN[d] >= 64) OR (have + need > HIGH(stkArg[d])) THEN
  1394. RETURN FALSE
  1395. END;
  1396. i := have; j := 0;
  1397. stkArg[d][i] := cls; INC(i);
  1398. stkArg[d][i] := " "; INC(i);
  1399. WHILE q[j] # CHR(0) DO
  1400. stkArg[d][i] := q[j]; INC(i); INC(j)
  1401. END;
  1402. stkArg[d][i] := ","; INC(i);
  1403. stkArg[d][i] := " "; INC(i);
  1404. stkArg[d][i] := CHR(0);
  1405. INC(stkN[d]);
  1406. RETURN TRUE
  1407. END CallArg;
  1408. PROCEDURE CallEnd (wantRes: BOOLEAN; VAR q: QVal);
  1409. VAR i, d : CARDINAL;
  1410. rc : CHAR;
  1411. body : ARRAY [0 .. 1023] OF CHAR;
  1412. BEGIN
  1413. IF callDepth = 0 THEN Cpy(q, "0"); RETURN END;
  1414. DEC(callDepth);
  1415. d := callDepth;
  1416. IF d > HIGH(stkArg) THEN d := HIGH(stkArg) END;
  1417. Cpy(funcName, stkName[d]);
  1418. rc := stkRes[d];
  1419. i := 0;
  1420. WHILE (stkArg[d][i] # CHR(0)) AND (i < HIGH(body)) DO
  1421. body[i] := stkArg[d][i]; INC(i)
  1422. END;
  1423. IF (i >= 2) AND (body[i-2] = ",") THEN
  1424. body[i-2] := CHR(0)
  1425. ELSE
  1426. body[i] := CHR(0)
  1427. END;
  1428. Revive;
  1429. IF wantRes THEN
  1430. NewTemp(q);
  1431. W(" "); W(q); W(" ="); Wc(rc)
  1432. ELSE
  1433. W(" ")
  1434. END;
  1435. IF stkInd[d] THEN
  1436. W(" call "); W(funcName); W("(") (* callee operand already %-prefixed *)
  1437. ELSE
  1438. W(" call $"); W(funcName); W("(")
  1439. END;
  1440. IF stkExt[d] THEN
  1441. W(body) (* C callee: no static link *)
  1442. ELSE
  1443. W("l "); W(stkLink[d]);
  1444. IF body[0] # CHR(0) THEN W(", "); W(body) END
  1445. END;
  1446. WL(")")
  1447. END CallEnd;
  1448. PROCEDURE InitStack (addr: ARRAY OF CHAR; t: INTEGER);
  1449. BEGIN
  1450. useStack := TRUE;
  1451. InitHeap(addr, t);
  1452. useStack := FALSE
  1453. END InitStack;
  1454. PROCEDURE ArgClass (t: INTEGER): CHAR;
  1455. (* Formal/actual class for call emission. *)
  1456. BEGIN
  1457. RETURN ResClass(t)
  1458. END ArgClass;
  1459. PROCEDURE CArg (q: ARRAY OF CHAR; t: INTEGER; VAR out: QVal;
  1460. VAR cls: CHAR);
  1461. BEGIN
  1462. cls := ArgClass(t);
  1463. IF SymTab.ClassOf(t) = SymTab.ClStr THEN
  1464. NewTemp(out); Op3L("add", out, q, "8"); cls := "l"
  1465. ELSIF (SymTab.ClassOf(t) = SymTab.ClArray)
  1466. AND SymTab.IsCharArray(t) THEN
  1467. NewTemp(out); Op3L("add", out, q, "8"); cls := "l"
  1468. ELSE Cpy(out, q)
  1469. END
  1470. END CArg;
  1471. PROCEDURE CArgAdd (q: ARRAY OF CHAR; t: INTEGER; VAR out: QVal;
  1472. VAR cls: CHAR);
  1473. BEGIN
  1474. CArg(q, t, out, cls);
  1475. IF NOT CallArg(out, cls) THEN END
  1476. END CArgAdd;
  1477. (* ---------------- temporaries and operators ---------------- *)
  1478. PROCEDURE NewTemp (VAR t: QVal);
  1479. BEGIN
  1480. Cpy(t, "%t");
  1481. AppNum(t, nTemp);
  1482. INC(nTemp)
  1483. END NewTemp;
  1484. PROCEDURE LocLoadFlat (idx: INTEGER; long: BOOLEAN; VAR q: QVal);
  1485. (* Loads a same-scope entry: slots/data by class (or long for
  1486. pointers), addr entries via ElemLoad. *)
  1487. BEGIN
  1488. IF locTag[idx] = 2 THEN
  1489. ElemLoad(locRep[idx], locTyp[idx], q);
  1490. RETURN
  1491. END;
  1492. NewTemp(q);
  1493. Revive;
  1494. W(" "); W(q);
  1495. IF long THEN W(" =l loadl ")
  1496. ELSIF locCls[idx] = "d" THEN W(" =d loadd ")
  1497. ELSIF SymTab.IsByteType(locTyp[idx]) THEN
  1498. IF SymTab.IsSignedByte(locTyp[idx]) THEN W(" =w loadsb ")
  1499. ELSE W(" =w loadub ")
  1500. END
  1501. ELSIF SymTab.IsWord16Type(locTyp[idx]) THEN
  1502. IF SymTab.IsSignedWord16(locTyp[idx]) THEN W(" =w loadsh ")
  1503. ELSE W(" =w loaduh ")
  1504. END
  1505. ELSE W(" =w loadw ")
  1506. END;
  1507. IF locTag[idx] = 1 THEN W("$") END;
  1508. WL(locRep[idx])
  1509. END LocLoadFlat;
  1510. PROCEDURE LocStoreFlat (idx: INTEGER; q: ARRAY OF CHAR; long: BOOLEAN);
  1511. (* Stores a same-scope entry: slots/data by class (or long), addr
  1512. via ElemStore. Data stores are grammar-unreachable (consts). *)
  1513. BEGIN
  1514. IF locTag[idx] = 2 THEN
  1515. ElemStore(locRep[idx], q, locTyp[idx]);
  1516. RETURN
  1517. END;
  1518. Revive;
  1519. IF long THEN W(" storel ")
  1520. ELSIF locCls[idx] = "d" THEN W(" stored ")
  1521. ELSIF SymTab.IsByteType(locTyp[idx]) THEN W(" storeb ")
  1522. ELSIF SymTab.IsWord16Type(locTyp[idx]) THEN W(" storeh ")
  1523. ELSE W(" storew ")
  1524. END;
  1525. W(q); W(", ");
  1526. IF locTag[idx] = 1 THEN W("$") END;
  1527. WL(locRep[idx])
  1528. END LocStoreFlat;
  1529. PROCEDURE UpLoad (flat: INTEGER; levels: CARDINAL; long: BOOLEAN;
  1530. VAR q: QVal);
  1531. (* Up-level load: data entries live globally; otherwise the link
  1532. cell yields the address and ElemLoad reads through it. *)
  1533. VAR a : QVal;
  1534. rel : CARDINAL;
  1535. BEGIN
  1536. IF locTag[flat] = 1 THEN
  1537. NewTemp(q);
  1538. Revive;
  1539. W(" "); W(q);
  1540. IF long THEN W(" =l loadl $")
  1541. ELSIF locCls[flat] = "d" THEN W(" =d loadd $")
  1542. ELSIF SymTab.IsByteType(locTyp[flat]) THEN
  1543. IF SymTab.IsSignedByte(locTyp[flat]) THEN W(" =w loadsb $")
  1544. ELSE W(" =w loadub $")
  1545. END
  1546. ELSIF SymTab.IsWord16Type(locTyp[flat]) THEN
  1547. IF SymTab.IsSignedWord16(locTyp[flat]) THEN W(" =w loadsh $")
  1548. ELSE W(" =w loaduh $")
  1549. END
  1550. ELSE W(" =w loadw $")
  1551. END;
  1552. WL(locRep[flat]);
  1553. RETURN
  1554. END;
  1555. rel := VAL(CARDINAL, flat) - scopeBase[scopeTop - 1 - levels];
  1556. UpAddr(levels, rel, a);
  1557. ElemLoad(a, locTyp[flat], q)
  1558. END UpLoad;
  1559. PROCEDURE UpStore (flat: INTEGER; levels: CARDINAL; q: ARRAY OF CHAR;
  1560. long: BOOLEAN);
  1561. VAR a : QVal;
  1562. rel : CARDINAL;
  1563. BEGIN
  1564. IF locTag[flat] = 1 THEN
  1565. Revive;
  1566. IF long THEN W(" storel ")
  1567. ELSIF locCls[flat] = "d" THEN W(" stored ")
  1568. ELSIF SymTab.IsByteType(locTyp[flat]) THEN W(" storeb ")
  1569. ELSIF SymTab.IsWord16Type(locTyp[flat]) THEN W(" storeh ")
  1570. ELSE W(" storew ")
  1571. END;
  1572. W(q); W(", $"); WL(locRep[flat]);
  1573. RETURN
  1574. END;
  1575. rel := VAL(CARDINAL, flat) - scopeBase[scopeTop - 1 - levels];
  1576. UpAddr(levels, rel, a);
  1577. ElemStore(a, q, locTyp[flat])
  1578. END UpStore;
  1579. PROCEDURE UpAddrOf (flat: INTEGER; levels: CARDINAL; VAR q: QVal);
  1580. (* Up-level address: data entries name globals; otherwise the
  1581. link cell holds it (composites) or points at it. For scalars
  1582. the cell IS the usable address (slot or actual address). *)
  1583. VAR a : QVal;
  1584. rel : CARDINAL;
  1585. BEGIN
  1586. IF locTag[flat] = 1 THEN
  1587. Cpy(q, "$");
  1588. App(q, locRep[flat]);
  1589. RETURN
  1590. END;
  1591. rel := VAL(CARDINAL, flat) - scopeBase[scopeTop - 1 - levels];
  1592. UpAddr(levels, rel, q)
  1593. END UpAddrOf;
  1594. PROCEDURE LoadDesignator (name: ARRAY OF CHAR; t: INTEGER; k: INTEGER;
  1595. VAR q: QVal): BOOLEAN;
  1596. VAR cls : INTEGER;
  1597. cv : QVal;
  1598. BEGIN
  1599. cls := SymTab.ClassOf(t);
  1600. IF SymTab.Equal(name, "TRUE") THEN
  1601. Cpy(q, "1"); RETURN TRUE
  1602. ELSIF SymTab.Equal(name, "FALSE") THEN
  1603. Cpy(q, "0"); RETURN TRUE
  1604. ELSIF SymTab.Equal(name, "NIL") THEN
  1605. Cpy(q, "0"); RETURN TRUE
  1606. END;
  1607. (* an immediate CONST (incl. an enumeration literal) is its value *)
  1608. IF k = SymTab.KindConst THEN
  1609. IF SymTab.GetSymVal(name, cv) AND IsImm(cv) THEN
  1610. Cpy(q, cv); RETURN TRUE
  1611. END
  1612. END;
  1613. IF (k = SymTab.KindVar) OR (k = SymTab.KindParam)
  1614. OR (k = SymTab.KindConst) THEN
  1615. IF SymTab.IsSmallInt(t) THEN
  1616. LoadShortVar(name, SymTab.IsSignedSmallInt(t),
  1617. SymTab.SmallIntBytes(t), q); RETURN TRUE
  1618. ELSIF (cls = SymTab.ClInt) OR (cls = SymTab.ClBool)
  1619. OR (cls = SymTab.ClChar) OR (cls = SymTab.ClEnum)
  1620. OR (cls = SymTab.ClReal) THEN
  1621. LoadVar(name, cls = SymTab.ClReal, q); RETURN TRUE
  1622. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClProc) THEN
  1623. LoadPtr(name, q); RETURN TRUE
  1624. ELSIF (cls = SymTab.ClArray) OR (cls = SymTab.ClSet)
  1625. OR (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  1626. AddrOf(name, q); RETURN TRUE
  1627. END
  1628. END;
  1629. Cpy(q, "0");
  1630. RETURN FALSE
  1631. END LoadDesignator;
  1632. PROCEDURE LoadVar (name: ARRAY OF CHAR; isReal: BOOLEAN; VAR q: QVal);
  1633. VAR idx : INTEGER;
  1634. levels : CARDINAL;
  1635. ref : QVal;
  1636. BEGIN
  1637. IF LocFindUp(name, levels, idx) THEN
  1638. IF levels = 0 THEN LocLoadFlat(idx, FALSE, q)
  1639. ELSE UpLoad(idx, levels, FALSE, q)
  1640. END;
  1641. RETURN
  1642. END;
  1643. NewTemp(q);
  1644. Revive;
  1645. SymRef(name, ref);
  1646. W(" "); W(q);
  1647. IF isReal THEN W(" =d loadd ") ELSE W(" =w loadw ") END;
  1648. WL(ref)
  1649. END LoadVar;
  1650. PROCEDURE LoadShortVar (name: ARRAY OF CHAR; signed: BOOLEAN;
  1651. bytes: CARDINAL; VAR q: QVal);
  1652. VAR idx : INTEGER;
  1653. levels : CARDINAL;
  1654. ref : QVal;
  1655. BEGIN
  1656. IF LocFindUp(name, levels, idx) THEN
  1657. IF levels = 0 THEN LocLoadFlat(idx, FALSE, q)
  1658. ELSE UpLoad(idx, levels, FALSE, q)
  1659. END;
  1660. RETURN
  1661. END;
  1662. NewTemp(q);
  1663. Revive;
  1664. SymRef(name, ref);
  1665. W(" "); W(q);
  1666. IF bytes = 1 THEN
  1667. IF signed THEN W(" =w loadsb ") ELSE W(" =w loadub ") END
  1668. ELSE
  1669. IF signed THEN W(" =w loadsh ") ELSE W(" =w loaduh ") END
  1670. END;
  1671. WL(ref)
  1672. END LoadShortVar;
  1673. PROCEDURE StoreShortVar (name: ARRAY OF CHAR; bytes: CARDINAL;
  1674. q: ARRAY OF CHAR);
  1675. VAR idx : INTEGER;
  1676. levels : CARDINAL;
  1677. ref : QVal;
  1678. BEGIN
  1679. IF LocFindUp(name, levels, idx) THEN
  1680. IF levels = 0 THEN LocStoreFlat(idx, q, FALSE)
  1681. ELSE UpStore(idx, levels, q, FALSE)
  1682. END;
  1683. RETURN
  1684. END;
  1685. Revive;
  1686. SymRef(name, ref);
  1687. IF bytes = 1 THEN W(" storeb ") ELSE W(" storeh ") END;
  1688. W(q); W(", "); WL(ref)
  1689. END StoreShortVar;
  1690. PROCEDURE LoadPtr (name: ARRAY OF CHAR; VAR q: QVal);
  1691. VAR idx : INTEGER;
  1692. levels : CARDINAL;
  1693. ref : QVal;
  1694. BEGIN
  1695. IF LocFindUp(name, levels, idx) THEN
  1696. IF levels = 0 THEN LocLoadFlat(idx, TRUE, q)
  1697. ELSE UpLoad(idx, levels, TRUE, q)
  1698. END;
  1699. RETURN
  1700. END;
  1701. NewTemp(q);
  1702. Revive;
  1703. SymRef(name, ref);
  1704. W(" "); W(q); W(" =l loadl ");
  1705. WL(ref)
  1706. END LoadPtr;
  1707. PROCEDURE LoadLong (name: ARRAY OF CHAR; VAR q: QVal);
  1708. VAR idx : INTEGER;
  1709. levels : CARDINAL;
  1710. ref : QVal;
  1711. BEGIN
  1712. IF LocFindUp(name, levels, idx) THEN
  1713. IF levels = 0 THEN LocLoadFlat(idx, TRUE, q)
  1714. ELSE UpLoad(idx, levels, TRUE, q)
  1715. END;
  1716. RETURN
  1717. END;
  1718. NewTemp(q);
  1719. Revive;
  1720. SymRef(name, ref);
  1721. W(" "); W(q); W(" =l loadl ");
  1722. WL(ref)
  1723. END LoadLong;
  1724. PROCEDURE StoreLong (name: ARRAY OF CHAR; q: ARRAY OF CHAR);
  1725. VAR idx : INTEGER;
  1726. levels : CARDINAL;
  1727. ref : QVal;
  1728. BEGIN
  1729. IF LocFindUp(name, levels, idx) THEN
  1730. IF levels = 0 THEN LocStoreFlat(idx, q, TRUE)
  1731. ELSE UpStore(idx, levels, q, TRUE)
  1732. END;
  1733. RETURN
  1734. END;
  1735. Revive;
  1736. SymRef(name, ref);
  1737. W(" storel "); W(q); W(", "); WL(ref)
  1738. END StoreLong;
  1739. PROCEDURE WidenLong (a: ARRAY OF CHAR; VAR q: QVal);
  1740. (* INTEGER (w) -> LONGINT (l) via extsw. *)
  1741. BEGIN
  1742. NewTemp(q);
  1743. Revive;
  1744. W(" "); W(q); W(" =l extsw "); WL(a)
  1745. END WidenLong;
  1746. PROCEDURE CmpLong (op: INTEGER; l, r: ARRAY OF CHAR; VAR q: QVal);
  1747. (* 64-bit comparison (result w). *)
  1748. VAR mn : ARRAY [0 .. 7] OF CHAR;
  1749. BEGIN
  1750. mn[0] := CHR(0);
  1751. IF op = SymTab.OpEq THEN Cpy(mn, "ceql")
  1752. ELSIF (op = SymTab.OpNeq1) OR (op = SymTab.OpNeq2) THEN Cpy(mn, "cnel")
  1753. ELSIF op = SymTab.OpLt THEN Cpy(mn, "csltl")
  1754. ELSIF op = SymTab.OpLe THEN Cpy(mn, "cslel")
  1755. ELSIF op = SymTab.OpGt THEN Cpy(mn, "csgtl")
  1756. ELSE Cpy(mn, "csgel")
  1757. END;
  1758. NewTemp(q);
  1759. Op3(mn, q, l, r, FALSE)
  1760. END CmpLong;
  1761. PROCEDURE StoreVar (name: ARRAY OF CHAR; q: ARRAY OF CHAR; isReal: BOOLEAN);
  1762. VAR idx : INTEGER;
  1763. levels : CARDINAL;
  1764. ref : QVal;
  1765. BEGIN
  1766. IF LocFindUp(name, levels, idx) THEN
  1767. IF levels = 0 THEN LocStoreFlat(idx, q, FALSE)
  1768. ELSE UpStore(idx, levels, q, FALSE)
  1769. END;
  1770. RETURN
  1771. END;
  1772. Revive;
  1773. SymRef(name, ref);
  1774. IF isReal THEN W(" stored ") ELSE W(" storew ") END;
  1775. W(q); W(", "); WL(ref)
  1776. END StoreVar;
  1777. PROCEDURE StorePtr (name: ARRAY OF CHAR; q: ARRAY OF CHAR);
  1778. VAR idx : INTEGER;
  1779. levels : CARDINAL;
  1780. ref : QVal;
  1781. BEGIN
  1782. IF LocFindUp(name, levels, idx) THEN
  1783. IF levels = 0 THEN LocStoreFlat(idx, q, TRUE)
  1784. ELSE UpStore(idx, levels, q, TRUE)
  1785. END;
  1786. RETURN
  1787. END;
  1788. Revive;
  1789. SymRef(name, ref);
  1790. W(" storel "); W(q); W(", "); WL(ref)
  1791. END StorePtr;
  1792. PROCEDURE Op3 (mn: ARRAY OF CHAR; res, l, r: ARRAY OF CHAR;
  1793. isReal: BOOLEAN);
  1794. BEGIN
  1795. Revive;
  1796. W(" "); W(res);
  1797. IF isReal THEN W(" =d ") ELSE W(" =w ") END;
  1798. W(mn); W(" "); W(l); W(", "); WL(r)
  1799. END Op3;
  1800. PROCEDURE AbsQ (a: ARRAY OF CHAR; VAR q: QVal; isReal: BOOLEAN);
  1801. VAR c, neg : QVal;
  1802. lNeg, lPos, lDone : QVal;
  1803. BEGIN
  1804. IF isReal THEN Cmp(SymTab.OpLt, a, "d_0.0", c, TRUE)
  1805. ELSE Cmp(SymTab.OpLt, a, "0", c, FALSE)
  1806. END;
  1807. NewLabel(lNeg); NewLabel(lPos); NewLabel(lDone);
  1808. NewTemp(neg);
  1809. NegQ(a, neg, isReal);
  1810. Jnz(c, lNeg, lPos);
  1811. EmitLabel(lNeg);
  1812. CopyOp(neg, q);
  1813. Jmp(lDone);
  1814. EmitLabel(lPos);
  1815. CopyOp(a, q);
  1816. EmitLabel(lDone)
  1817. END AbsQ;
  1818. PROCEDURE NegQ (a: ARRAY OF CHAR; VAR q: QVal; isReal: BOOLEAN);
  1819. BEGIN
  1820. NewTemp(q);
  1821. IF isReal THEN Op3("sub", q, "d_0.0", a, TRUE)
  1822. ELSE Op3("sub", q, "0", a, FALSE)
  1823. END
  1824. END NegQ;
  1825. PROCEDURE ConvIR (a: ARRAY OF CHAR; VAR q: QVal);
  1826. (* INTEGER -> REAL widening for assignments (swtof). *)
  1827. BEGIN
  1828. NewTemp(q);
  1829. Revive;
  1830. W(" "); W(q); W(" =d swtof "); WL(a)
  1831. END ConvIR;
  1832. PROCEDURE NarrowLong (a: ARRAY OF CHAR; VAR q: QVal);
  1833. (* LONGINT (l) -> INTEGER (w): keep the low 32 bits. *)
  1834. BEGIN
  1835. NewTemp(q);
  1836. Revive;
  1837. W(" "); W(q); W(" =w copy "); WL(a)
  1838. END NarrowLong;
  1839. PROCEDURE ConvRI (a: ARRAY OF CHAR; VAR q: QVal);
  1840. (* REAL -> INTEGER (truncate toward zero). *)
  1841. BEGIN
  1842. NewTemp(q);
  1843. Revive;
  1844. W(" "); W(q); W(" =w dtosi "); WL(a)
  1845. END ConvRI;
  1846. PROCEDURE ConvRL (a: ARRAY OF CHAR; VAR q: QVal);
  1847. (* REAL -> LONGINT (truncate toward zero). *)
  1848. BEGIN
  1849. NewTemp(q);
  1850. Revive;
  1851. W(" "); W(q); W(" =l dtosi "); WL(a)
  1852. END ConvRL;
  1853. PROCEDURE ConvLR (a: ARRAY OF CHAR; VAR q: QVal);
  1854. (* LONGINT -> REAL. *)
  1855. BEGIN
  1856. NewTemp(q);
  1857. Revive;
  1858. W(" "); W(q); W(" =d sltof "); WL(a)
  1859. END ConvLR;
  1860. PROCEDURE NotQ (a: ARRAY OF CHAR; VAR q: QVal);
  1861. BEGIN
  1862. NewTemp(q);
  1863. Op3("xor", q, "1", a, FALSE)
  1864. END NotQ;
  1865. PROCEDURE CapQ (a: ARRAY OF CHAR; VAR q: QVal);
  1866. (* Branchless UPCASE: q := a - 32 * (a >= 'a' AND a <= 'z'). *)
  1867. VAR lo, hi, in1, delta: QVal;
  1868. BEGIN
  1869. NewTemp(lo); Op3("csgew", lo, a, "97", FALSE);
  1870. NewTemp(hi); Op3("cslew", hi, a, "122", FALSE);
  1871. NewTemp(in1); Op3("and", in1, lo, hi, FALSE);
  1872. NewTemp(delta); Op3("mul", delta, in1, "32", FALSE);
  1873. NewTemp(q); Op3("sub", q, a, delta, FALSE)
  1874. END CapQ;
  1875. PROCEDURE NewLabel (VAR l: QVal);
  1876. BEGIN
  1877. Cpy(l, "@L");
  1878. AppNum(l, nLab);
  1879. INC(nLab)
  1880. END NewLabel;
  1881. PROCEDURE Revive;
  1882. (* Opens an unreachable block if past a terminator. Keeps every
  1883. temporary defined and every instruction inside a block, even for
  1884. dead source tails (EXIT followed by more statements) and CASE
  1885. chains whose compares follow a Jmp. Counter-driven: fixpoint-safe. *)
  1886. VAR b: QVal;
  1887. BEGIN
  1888. IF opened AND dead THEN
  1889. NewLabel(b);
  1890. WL(b);
  1891. dead := FALSE
  1892. END
  1893. END Revive;
  1894. PROCEDURE EmitLabel (l: ARRAY OF CHAR);
  1895. BEGIN
  1896. WL(l);
  1897. dead := FALSE
  1898. END EmitLabel;
  1899. PROCEDURE Jmp (l: ARRAY OF CHAR);
  1900. BEGIN
  1901. IF dead THEN RETURN END; (* unreachable: a terminator with no
  1902. intervening label can never be reached; emitting it would end
  1903. the block and orphan whatever follows. *)
  1904. W(" jmp "); WL(l);
  1905. dead := TRUE
  1906. END Jmp;
  1907. PROCEDURE Jnz (c, t, f: ARRAY OF CHAR);
  1908. BEGIN
  1909. IF dead THEN RETURN END;
  1910. W(" jnz "); W(c); W(", "); W(t); W(", "); WL(f);
  1911. dead := TRUE
  1912. END Jnz;
  1913. PROCEDURE Cmp (op: INTEGER; l, r: ARRAY OF CHAR; VAR q: QVal;
  1914. isReal: BOOLEAN);
  1915. VAR mn : ARRAY [0 .. 7] OF CHAR;
  1916. BEGIN
  1917. mn[0] := CHR(0);
  1918. IF isReal THEN
  1919. IF op = SymTab.OpEq THEN Cpy(mn, "ceqd")
  1920. ELSIF (op = SymTab.OpNeq1) OR (op = SymTab.OpNeq2) THEN Cpy(mn, "cned")
  1921. ELSIF op = SymTab.OpLt THEN Cpy(mn, "cltd")
  1922. ELSIF op = SymTab.OpLe THEN Cpy(mn, "cled")
  1923. ELSIF op = SymTab.OpGt THEN Cpy(mn, "cgtd")
  1924. ELSE Cpy(mn, "cged")
  1925. END
  1926. ELSE
  1927. IF op = SymTab.OpEq THEN Cpy(mn, "ceqw")
  1928. ELSIF (op = SymTab.OpNeq1) OR (op = SymTab.OpNeq2) THEN Cpy(mn, "cnew")
  1929. ELSIF op = SymTab.OpLt THEN Cpy(mn, "csltw")
  1930. ELSIF op = SymTab.OpLe THEN Cpy(mn, "cslew")
  1931. ELSIF op = SymTab.OpGt THEN Cpy(mn, "csgtw")
  1932. ELSE Cpy(mn, "csgew")
  1933. END
  1934. END;
  1935. NewTemp(q);
  1936. Op3(mn, q, l, r, FALSE)
  1937. END Cmp;
  1938. PROCEDURE StrEq (op: INTEGER; l, r: ARRAY OF CHAR; VAR q: QVal);
  1939. (* String equality via the shim: q := (l = r) as a BOOLEAN, negated for
  1940. OpNeq. Operands are descriptor addresses; the shim strcmps the
  1941. NUL-terminated contents. *)
  1942. VAR t: QVal;
  1943. BEGIN
  1944. NewTemp(q);
  1945. W(" "); W(q); W(" =w call $m2streq(l ");
  1946. W(l); W(", l "); W(r); WL(")");
  1947. IF (op = SymTab.OpNeq1) OR (op = SymTab.OpNeq2) THEN
  1948. NewTemp(t);
  1949. W(" "); W(t); W(" =w xor "); W(q); WL(", 1");
  1950. Cpy(q, t)
  1951. END
  1952. END StrEq;
  1953. PROCEDURE StrAssign (dst, src: ARRAY OF CHAR);
  1954. (* Copy the string src into the CHAR array at dst (content copy,
  1955. truncated to the destination capacity, NUL-terminated). *)
  1956. BEGIN
  1957. W(" call $m2strassign(l "); W(dst); W(", l "); W(src); WL(")")
  1958. END StrAssign;
  1959. PROCEDURE UAssign (dst, src: ARRAY OF CHAR);
  1960. (* Copy a U"..." descriptor (count + 4-byte codepoints) into the UCHAR
  1961. array at dst: min(count, capacity) codepoints + a 0 terminator. *)
  1962. BEGIN
  1963. W(" call $m2uassign(l "); W(dst); W(", l "); W(src); WL(")")
  1964. END UAssign;
  1965. PROCEDURE UStrLen (s: ARRAY OF CHAR; VAR q: QVal);
  1966. (* q := the UString codepoint count (INTEGER). *)
  1967. VAR t: QVal;
  1968. BEGIN
  1969. NewTemp(t);
  1970. W(" "); W(t); W(" =w call $m2ustrlen(l "); W(s); WL(")");
  1971. Cpy(q, t)
  1972. END UStrLen;
  1973. PROCEDURE DecQ (VAR q: QVal);
  1974. (* q := q - 1 (w domain; q is an INTEGER count). *)
  1975. VAR t: QVal;
  1976. BEGIN
  1977. NewTemp(t);
  1978. Op3("sub", t, q, "1", FALSE);
  1979. Cpy(q, t)
  1980. END DecQ;
  1981. PROCEDURE UStrCat (a, b: ARRAY OF CHAR; VAR q: QVal);
  1982. (* q := a + b (a UString descriptor in the shim's concat buffer). *)
  1983. BEGIN
  1984. NewTemp(q);
  1985. W(" "); W(q); W(" =l call $m2ustrcat(l "); W(a); W(", l "); W(b); WL(")")
  1986. END UStrCat;
  1987. PROCEDURE UStrFrom (cp: ARRAY OF CHAR; VAR q: QVal);
  1988. (* q := a 1-codepoint UString descriptor for the UCHAR value cp. *)
  1989. BEGIN
  1990. NewTemp(q);
  1991. W(" "); W(q); W(" =l call $m2ustrfrom(l "); W(cp); WL(")")
  1992. END UStrFrom;
  1993. PROCEDURE StrCat (a, b: ARRAY OF CHAR; VAR q: QVal);
  1994. (* q := a + b (a descriptor in the shim's concat buffer). *)
  1995. BEGIN
  1996. NewTemp(q);
  1997. W(" "); W(q); W(" =l call $m2strcat(l "); W(a); W(", l "); W(b); WL(")")
  1998. END StrCat;
  1999. (* ---------------- arrays: length-prefixed layout ---------------- *)
  2000. (* Indexes and counts are LONGCARD (l) in emitted code; immediates
  2001. pass through, w-temps widen via extsw. Traps call $abort + hlt
  2002. (interim; runtime/syslib/Trap replaces them later). *)
  2003. PROCEDURE ElemCls (t: SymTab.TypeIndex): INTEGER;
  2004. BEGIN
  2005. RETURN SymTab.ClassOf(SymTab.ArrayElem(t))
  2006. END ElemCls;
  2007. PROCEDURE ElemSize (t: SymTab.TypeIndex): CARDINAL;
  2008. (* Storage size of t's elements: CHAR 1, REAL 8, nested/pointer/long 8,
  2009. records/classes/sets their inline footprint, else 4. t is an array
  2010. (or string) descriptor. *)
  2011. VAR cls: INTEGER; et: SymTab.TypeIndex;
  2012. BEGIN
  2013. cls := SymTab.ClassOf(t);
  2014. IF cls = SymTab.ClStr THEN RETURN 1 END;
  2015. et := SymTab.ArrayElem(t);
  2016. cls := SymTab.ClassOf(et);
  2017. IF (cls = SymTab.ClChar) OR (cls = SymTab.ClByte)
  2018. OR (cls = SymTab.ClSByte) THEN RETURN 1
  2019. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN RETURN 2
  2020. ELSIF cls = SymTab.ClReal THEN RETURN 8
  2021. ELSIF (cls = SymTab.ClArray) OR (cls = SymTab.ClPtr)
  2022. OR (cls = SymTab.ClLong) THEN RETURN 8
  2023. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass)
  2024. OR (cls = SymTab.ClSet) THEN
  2025. RETURN SymTab.TypeSize(et)
  2026. ELSE RETURN 4
  2027. END
  2028. END ElemSize;
  2029. PROCEDURE Op3L (mn: ARRAY OF CHAR; res, l, r: ARRAY OF CHAR);
  2030. BEGIN
  2031. Revive;
  2032. W(" "); W(res);
  2033. W(" =l ");
  2034. W(mn); W(" "); W(l); W(", "); WL(r)
  2035. END Op3L;
  2036. PROCEDURE HaltQ;
  2037. BEGIN
  2038. Revive;
  2039. WL(" call $exit(w 1)");
  2040. WL(" hlt");
  2041. dead := TRUE
  2042. END HaltQ;
  2043. PROCEDURE TrapCode (code: CARDINAL);
  2044. VAR q: QVal;
  2045. BEGIN
  2046. Revive;
  2047. IntStr(VAL(INTEGER, code), q);
  2048. W(" call $m2_exc_raise_lang(w "); W(q); WL(")");
  2049. WL(" hlt");
  2050. dead := TRUE
  2051. END TrapCode;
  2052. PROCEDURE Trap;
  2053. BEGIN
  2054. TrapCode(12) (* sysException *)
  2055. END Trap;
  2056. (* ---------------- records: flat blobs, pointer fields ---------------- *)
  2057. (* Scalars/sets inline, array fields as inline descriptors (8-byte length
  2058. word + data), nested records inline. Static offsets throughout. *)
  2059. PROCEDURE HasArrayField (t: SymTab.TypeIndex): BOOLEAN;
  2060. (* TRUE when record type t (recursively) has any ARRAY field. Such
  2061. record arrays need per-element expansion so each inline array field's
  2062. descriptor length word is initialised; a compact zero blob would
  2063. leave the count 0 and trap when the field is passed as an open array.
  2064. Records with no array field still stay a compact blob. *)
  2065. VAR i: CARDINAL; fn: SymTab.Name; ft: SymTab.TypeIndex; cls: INTEGER;
  2066. BEGIN
  2067. i := 0;
  2068. WHILE i < SymTab.FieldCount(t) DO
  2069. SymTab.FieldName(t, i, fn);
  2070. ft := SymTab.FieldType(t, fn);
  2071. cls := SymTab.ClassOf(ft);
  2072. IF cls = SymTab.ClArray THEN RETURN TRUE
  2073. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  2074. IF HasArrayField(ft) THEN RETURN TRUE END
  2075. END;
  2076. INC(i)
  2077. END;
  2078. RETURN FALSE
  2079. END HasArrayField;
  2080. PROCEDURE RecArrayExpanded (n: CARDINAL; t: INTEGER): BOOLEAN;
  2081. (* TRUE when a record-/class-array's per-element expansion fits the image
  2082. budget. Larger tables keep the compact zero blob and are instead
  2083. initialised at run time (RecArrayNeedsInit/InitRecArray). The budget
  2084. keeps the compiler's own huge tables (AST.arena: 262144 records) from
  2085. inflating the 4 MiB image. *)
  2086. BEGIN
  2087. RETURN VAL(INTEGER, n) * VAL(INTEGER, SymTab.TypeSize(t)) <= 131072
  2088. END RecArrayExpanded;
  2089. PROCEDURE ArrBodyItems (prefix: ARRAY OF CHAR; t: INTEGER);
  2090. (* Inline contents of an array descriptor (no "data $name = {" wrapper
  2091. and no closing brace): "l <n>[, <elem>...]". Nested levels are
  2092. referenced as $prefix_i (emitted by ArrData). Record/class elements
  2093. with nested-array fields are expanded per element (EmitRec) so their
  2094. sub-descriptors are referenced; others stay a compact zero blob. *)
  2095. VAR n, i: CARDINAL;
  2096. elem: SymTab.TypeIndex;
  2097. ecls: INTEGER;
  2098. esz: CARDINAL;
  2099. bv, sub: QVal;
  2100. first: BOOLEAN;
  2101. (* One inline record: mirrors RecItems (same field order and comma
  2102. handling), but array fields recurse into the enclosing
  2103. ArrBodyItems. Nested here so no FORWARD declaration is needed. *)
  2104. PROCEDURE EmitRec (rt: SymTab.TypeIndex; rpre: ARRAY OF CHAR;
  2105. VAR first: BOOLEAN);
  2106. VAR i, k, w: CARDINAL;
  2107. fn: SymTab.Name;
  2108. ft: SymTab.TypeIndex;
  2109. cls: INTEGER;
  2110. rsub: QVal;
  2111. PROCEDURE Sep;
  2112. BEGIN
  2113. IF first THEN first := FALSE ELSE W(", ") END
  2114. END Sep;
  2115. BEGIN
  2116. i := 0;
  2117. WHILE i < SymTab.FieldCount(rt) DO
  2118. SymTab.FieldName(rt, i, fn);
  2119. ft := SymTab.FieldType(rt, fn);
  2120. cls := SymTab.ClassOf(ft);
  2121. IF cls = SymTab.ClReal THEN Sep; W("d 0")
  2122. ELSIF (cls = SymTab.ClChar) OR (cls = SymTab.ClByte)
  2123. OR (cls = SymTab.ClSByte) THEN Sep; W("b 0")
  2124. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN
  2125. Sep; W("h 0")
  2126. ELSIF cls = SymTab.ClArray THEN
  2127. Sep;
  2128. Cpy(rsub, rpre); App(rsub, "_"); App(rsub, fn);
  2129. ArrBodyItems(rsub, ft)
  2130. ELSIF cls = SymTab.ClSet THEN
  2131. w := SymTab.SetWords(ft);
  2132. IF w = 0 THEN w := 1 END;
  2133. Sep; W("w 0");
  2134. k := 1;
  2135. WHILE k < w DO W(", w 0"); INC(k) END
  2136. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  2137. Cpy(rsub, rpre); App(rsub, "_"); App(rsub, fn);
  2138. EmitRec(ft, rsub, first)
  2139. ELSE Sep; W("w 0")
  2140. END;
  2141. INC(i)
  2142. END
  2143. END EmitRec;
  2144. BEGIN
  2145. n := SymTab.ArrayLen(t);
  2146. elem := SymTab.ArrayElem(t);
  2147. ecls := SymTab.ClassOf(elem);
  2148. W("l ");
  2149. IntStr(VAL(INTEGER, n), bv);
  2150. W(bv);
  2151. IF ecls = SymTab.ClArray THEN
  2152. i := 0;
  2153. WHILE i < n DO
  2154. W(", l $"); W(prefix); W("_");
  2155. IntStr(VAL(INTEGER, i), bv);
  2156. W(bv);
  2157. INC(i)
  2158. END
  2159. ELSIF ((ecls = SymTab.ClRecord) OR (ecls = SymTab.ClClass))
  2160. AND HasArrayField(elem)
  2161. AND RecArrayExpanded(n, elem) THEN
  2162. i := 0;
  2163. WHILE i < n DO
  2164. Cpy(sub, prefix); App(sub, "_");
  2165. IntStr(VAL(INTEGER, i), bv); App(sub, bv);
  2166. first := FALSE;
  2167. EmitRec(elem, sub, first);
  2168. INC(i)
  2169. END
  2170. ELSE
  2171. IF ecls = SymTab.ClChar THEN
  2172. (* CHAR: n data bytes + one NUL terminator slot *)
  2173. W(", z ");
  2174. IntStr(VAL(INTEGER, n + 1), bv);
  2175. W(bv)
  2176. ELSIF ecls = SymTab.ClUChar THEN
  2177. (* UCHAR: n codepoints + one 0-codepoint terminator slot *)
  2178. W(", z ");
  2179. IntStr(VAL(INTEGER, (n + 1) * 4), bv);
  2180. W(bv)
  2181. ELSE
  2182. IF (ecls = SymTab.ClByte) OR (ecls = SymTab.ClSByte) THEN esz := 1
  2183. ELSIF (ecls = SymTab.ClWord16) OR (ecls = SymTab.ClSWord16) THEN esz := 2
  2184. ELSIF (ecls = SymTab.ClReal) OR (ecls = SymTab.ClPtr)
  2185. OR (ecls = SymTab.ClProc) OR (ecls = SymTab.ClLong) THEN esz := 8
  2186. ELSIF (ecls = SymTab.ClRecord) OR (ecls = SymTab.ClClass)
  2187. OR (ecls = SymTab.ClSet) THEN
  2188. (* inline footprint, not a fixed 4 (same fix as ElemSize) *)
  2189. esz := SymTab.TypeSize(elem)
  2190. ELSE esz := 4
  2191. END;
  2192. IF n > 0 THEN
  2193. W(", z ");
  2194. IntStr(VAL(INTEGER, n * esz), bv);
  2195. W(bv)
  2196. END
  2197. END
  2198. END
  2199. END ArrBodyItems;
  2200. PROCEDURE ArrData (name: ARRAY OF CHAR; t: INTEGER);
  2201. (* "data $name = { <items> }" plus, for nested levels, the recursive
  2202. sub-descriptor data $name_i. *)
  2203. VAR n, i: CARDINAL;
  2204. elem: SymTab.TypeIndex;
  2205. bv: QVal;
  2206. sub: QVal;
  2207. (* Mirrors RecStatics, but nested-array sub-descriptors recurse into
  2208. the enclosing ArrData. Nested here so no FORWARD is needed. *)
  2209. PROCEDURE EmitRecStatics (rpre: ARRAY OF CHAR; rt: SymTab.TypeIndex);
  2210. VAR k, j, an: CARDINAL;
  2211. fn: SymTab.Name;
  2212. ft, et: SymTab.TypeIndex;
  2213. cls: INTEGER;
  2214. rsub, bv2: QVal;
  2215. BEGIN
  2216. k := 0;
  2217. WHILE k < SymTab.FieldCount(rt) DO
  2218. SymTab.FieldName(rt, k, fn);
  2219. ft := SymTab.FieldType(rt, fn);
  2220. cls := SymTab.ClassOf(ft);
  2221. IF cls = SymTab.ClArray THEN
  2222. et := SymTab.ArrayElem(ft);
  2223. IF SymTab.ClassOf(et) = SymTab.ClArray THEN
  2224. an := SymTab.ArrayLen(ft);
  2225. j := 0;
  2226. WHILE j < an DO
  2227. Cpy(rsub, rpre); App(rsub, "_"); App(rsub, fn);
  2228. App(rsub, "_");
  2229. IntStr(VAL(INTEGER, j), bv2);
  2230. App(rsub, bv2);
  2231. ArrData(rsub, et);
  2232. INC(j)
  2233. END
  2234. END
  2235. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  2236. Cpy(rsub, rpre); App(rsub, "_"); App(rsub, fn);
  2237. EmitRecStatics(rsub, ft)
  2238. END;
  2239. INC(k)
  2240. END
  2241. END EmitRecStatics;
  2242. BEGIN
  2243. IF NOT opened THEN RETURN END;
  2244. W("data $"); W(name);
  2245. W(" = { ");
  2246. ArrBodyItems(name, t);
  2247. WL(" }");
  2248. elem := SymTab.ArrayElem(t);
  2249. IF SymTab.ClassOf(elem) = SymTab.ClArray THEN
  2250. n := SymTab.ArrayLen(t);
  2251. i := 0;
  2252. WHILE i < n DO
  2253. Cpy(sub, name); App(sub, "_");
  2254. IntStr(VAL(INTEGER, i), bv);
  2255. App(sub, bv);
  2256. ArrData(sub, elem);
  2257. INC(i)
  2258. END
  2259. ELSIF ((SymTab.ClassOf(elem) = SymTab.ClRecord)
  2260. OR (SymTab.ClassOf(elem) = SymTab.ClClass))
  2261. AND HasArrayField(elem)
  2262. AND RecArrayExpanded(SymTab.ArrayLen(t), elem) THEN
  2263. (* Sub-descriptors referenced (as $name_i_field_k) from the inline
  2264. items emitted by ArrBodyItems; one set per element. *)
  2265. n := SymTab.ArrayLen(t);
  2266. i := 0;
  2267. WHILE i < n DO
  2268. Cpy(sub, name); App(sub, "_");
  2269. IntStr(VAL(INTEGER, i), bv);
  2270. App(sub, bv);
  2271. EmitRecStatics(sub, elem);
  2272. INC(i)
  2273. END
  2274. END
  2275. END ArrData;
  2276. PROCEDURE RecStatics (recname: ARRAY OF CHAR; t: SymTab.TypeIndex);
  2277. (* Pre-pass: static sub-descriptors for NESTED array fields (the
  2278. top-level array field is now inline in the record), recursive. *)
  2279. VAR n, i, k, an: CARDINAL;
  2280. fn: SymTab.Name;
  2281. ft, et: SymTab.TypeIndex;
  2282. cls: INTEGER;
  2283. sub, bv: QVal;
  2284. BEGIN
  2285. n := SymTab.FieldCount(t);
  2286. i := 0;
  2287. WHILE i < n DO
  2288. SymTab.FieldName(t, i, fn);
  2289. ft := SymTab.FieldType(t, fn);
  2290. cls := SymTab.ClassOf(ft);
  2291. IF cls = SymTab.ClArray THEN
  2292. et := SymTab.ArrayElem(ft);
  2293. IF SymTab.ClassOf(et) = SymTab.ClArray THEN
  2294. an := SymTab.ArrayLen(ft);
  2295. k := 0;
  2296. WHILE k < an DO
  2297. Cpy(sub, recname); App(sub, "_"); App(sub, fn);
  2298. App(sub, "_");
  2299. IntStr(VAL(INTEGER, k), bv);
  2300. App(sub, bv);
  2301. ArrData(sub, et);
  2302. INC(k)
  2303. END
  2304. END
  2305. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  2306. Cpy(sub, recname); App(sub, "_"); App(sub, fn);
  2307. RecStatics(sub, ft)
  2308. END;
  2309. INC(i)
  2310. END
  2311. END RecStatics;
  2312. PROCEDURE RecItems (t: SymTab.TypeIndex; prefix: ARRAY OF CHAR;
  2313. VAR first: BOOLEAN);
  2314. (* Comma-separated item list (no wrapper); nested records inline.
  2315. Emission order follows the (prepend-built) field chain, i.e.
  2316. reverse declaration; offsets (not positions) place everything. *)
  2317. VAR n, i, k, w: CARDINAL;
  2318. fn: SymTab.Name;
  2319. ft: SymTab.TypeIndex;
  2320. cls: INTEGER;
  2321. sub: QVal;
  2322. PROCEDURE Sep;
  2323. BEGIN
  2324. IF first THEN first := FALSE ELSE W(", ") END
  2325. END Sep;
  2326. BEGIN
  2327. n := SymTab.FieldCount(t);
  2328. i := 0;
  2329. WHILE i < n DO
  2330. SymTab.FieldName(t, i, fn);
  2331. ft := SymTab.FieldType(t, fn);
  2332. cls := SymTab.ClassOf(ft);
  2333. IF cls = SymTab.ClReal THEN Sep; W("d 0")
  2334. ELSIF (cls = SymTab.ClChar) OR (cls = SymTab.ClByte)
  2335. OR (cls = SymTab.ClSByte) THEN Sep; W("b 0")
  2336. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN
  2337. Sep; W("h 0")
  2338. ELSIF cls = SymTab.ClArray THEN
  2339. (* array field: inline descriptor (was a pointer) *)
  2340. Sep;
  2341. Cpy(sub, prefix); App(sub, "_"); App(sub, fn);
  2342. ArrBodyItems(sub, ft)
  2343. ELSIF cls = SymTab.ClSet THEN
  2344. w := SymTab.SetWords(ft);
  2345. IF w = 0 THEN w := 1 END;
  2346. Sep; W("w 0");
  2347. k := 1;
  2348. WHILE k < w DO W(", w 0"); INC(k) END
  2349. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  2350. Cpy(sub, prefix); App(sub, "_"); App(sub, fn);
  2351. RecItems(ft, sub, first)
  2352. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClLong)
  2353. OR (cls = SymTab.ClProc) THEN
  2354. (* 8-byte fields: match the layout's pointer/long size (a `w 0`
  2355. here would shrink the global and clobber the next symbol) *)
  2356. Sep; W("l 0")
  2357. ELSE Sep; W("w 0")
  2358. END;
  2359. INC(i)
  2360. END
  2361. END RecItems;
  2362. PROCEDURE VtRef (t: INTEGER; VAR q: QVal);
  2363. (* The class's vtable symbol ($vt_<typeindex>). *)
  2364. VAR bv: QVal;
  2365. BEGIN
  2366. Cpy(q, "$vt_");
  2367. IntStr(t, bv);
  2368. App(q, bv)
  2369. END VtRef;
  2370. PROCEDURE EmitVTables;
  2371. (* One data array per class with a vtable: slots (inherited first) as
  2372. method code addresses. *)
  2373. VAR k, j, n: CARDINAL;
  2374. t: INTEGER;
  2375. nm: SymTab.Name;
  2376. mg, vt: QVal;
  2377. BEGIN
  2378. IF NOT opened THEN RETURN END;
  2379. k := 0;
  2380. WHILE k < SymTab.VtClassCount() DO
  2381. t := SymTab.VtClassAt(k);
  2382. n := SymTab.VtCount(t);
  2383. VtRef(t, vt);
  2384. W("data "); W(vt); W(" = { ");
  2385. j := 0;
  2386. WHILE j < n DO
  2387. IF SymTab.VtName(t, j, nm) THEN
  2388. IF j > 0 THEN W(", ") END;
  2389. IF SymTab.VtHasBody(t, j) THEN
  2390. Mangled(nm, SymTab.VtUid(t, j), mg);
  2391. W("l $"); W(mg)
  2392. ELSE
  2393. W("l 0") (* declared but never implemented *)
  2394. END
  2395. END;
  2396. INC(j)
  2397. END;
  2398. IF n = 0 THEN W("l 0") END;
  2399. WL(" }");
  2400. INC(k)
  2401. END
  2402. END EmitVTables;
  2403. PROCEDURE DeclRec (name: ARRAY OF CHAR; t: INTEGER);
  2404. VAR first: BOOLEAN;
  2405. vt, sz: QVal;
  2406. BEGIN
  2407. IF NOT opened THEN RETURN END;
  2408. IF SymTab.IsVariant(t) AND (SymTab.ClassOf(t) = SymTab.ClRecord) THEN
  2409. (* variant record: fields overlay, so emit one zero-filled blob
  2410. of the record's (max) size *)
  2411. IntStr(VAL(INTEGER, SymTab.TypeSize(t)), sz);
  2412. W("data $"); W(name); W(" = { z "); W(sz); WL(" }");
  2413. RETURN
  2414. END;
  2415. RecStatics(name, t);
  2416. W("data $"); W(name);
  2417. W(" = { ");
  2418. first := TRUE;
  2419. (* a class with a vtable stores its vtable pointer at offset 0 *)
  2420. IF (SymTab.ClassOf(t) = SymTab.ClClass) AND SymTab.HasVTable(t) THEN
  2421. VtRef(t, vt);
  2422. W("l "); W(vt);
  2423. first := FALSE
  2424. END;
  2425. RecItems(t, name, first);
  2426. IF first THEN W("w 0") END;
  2427. WL(" }")
  2428. END DeclRec;
  2429. PROCEDURE FieldAddr (base: ARRAY OF CHAR; off: INTEGER; VAR q: QVal);
  2430. VAR sb: QVal;
  2431. BEGIN
  2432. NewTemp(q);
  2433. IntStr(off, sb);
  2434. Op3L("add", q, base, sb)
  2435. END FieldAddr;
  2436. PROCEDURE ThisBase (VAR q: QVal);
  2437. (* The current method's receiver address (the hidden THIS VAR param). *)
  2438. BEGIN
  2439. AddrOf("THIS", q)
  2440. END ThisBase;
  2441. PROCEDURE PushWith (base: ARRAY OF CHAR);
  2442. BEGIN
  2443. IF withTop <= HIGH(withSt) THEN
  2444. Cpy(withSt[withTop], base); INC(withTop)
  2445. END
  2446. END PushWith;
  2447. PROCEDURE PopWith;
  2448. BEGIN
  2449. IF withTop > 0 THEN DEC(withTop) END
  2450. END PopWith;
  2451. PROCEDURE TopWith (VAR base: QVal): BOOLEAN;
  2452. BEGIN
  2453. IF withTop = 0 THEN RETURN FALSE END;
  2454. Cpy(base, withSt[withTop - 1]);
  2455. RETURN TRUE
  2456. END TopWith;
  2457. PROCEDURE CopyRecord (dst: ARRAY OF CHAR; src: ARRAY OF CHAR;
  2458. t: INTEGER);
  2459. (* Whole-record copy: a flat byte blit of the record's (max) size.
  2460. Records are flat blobs (scalars/sets/pointers inline, arrays and
  2461. nested records inline), so this is correct — and the only correct
  2462. choice for variant records, whose fields overlay. *)
  2463. VAR n: QVal;
  2464. BEGIN
  2465. IntStr(VAL(INTEGER, SymTab.TypeSize(t)), n);
  2466. Revive;
  2467. W(" call $memcpy(l "); W(dst); W(", l "); W(src);
  2468. W(", l "); W(n); WL(")")
  2469. END CopyRecord;
  2470. PROCEDURE WordsBytes (words: CARDINAL): CARDINAL;
  2471. BEGIN
  2472. IF words = 0 THEN RETURN 8 END;
  2473. RETURN ((words * 4 + 7) DIV 8) * 8
  2474. END WordsBytes;
  2475. PROCEDURE DeclSet (name: ARRAY OF CHAR; t: INTEGER);
  2476. VAR w, i: CARDINAL;
  2477. BEGIN
  2478. IF NOT opened THEN RETURN END;
  2479. w := SymTab.SetWords(t);
  2480. IF w = 0 THEN w := 1 END;
  2481. W("data $"); W(name);
  2482. W(" = { w 0");
  2483. i := 1;
  2484. WHILE i < w DO
  2485. W(", w 0");
  2486. INC(i)
  2487. END;
  2488. WL(" }")
  2489. END DeclSet;
  2490. PROCEDURE PoolSet (mask: ARRAY OF CARDINAL; words: CARDINAL; VAR q: QVal);
  2491. VAR k: CARDINAL;
  2492. BEGIN
  2493. IF NOT opened OR noEmit THEN Cpy(q, "0"); RETURN END;
  2494. IF setN > HIGH(setW) THEN Cpy(q, "0"); RETURN END;
  2495. k := 0;
  2496. WHILE (k < words) AND (k <= HIGH(mask)) AND (k <= 15) DO
  2497. setMask[setN][k] := mask[k]; INC(k)
  2498. END;
  2499. WHILE k <= 15 DO setMask[setN][k] := 0; INC(k) END;
  2500. setW[setN] := words;
  2501. Cpy(setNam[setN], "set"); AppNum(setNam[setN], setN);
  2502. Cpy(q, "$"); App(q, setNam[setN]);
  2503. INC(setN)
  2504. END PoolSet;
  2505. PROCEDURE PoolSetNamed (name: ARRAY OF CHAR; mask: ARRAY OF CARDINAL;
  2506. words: CARDINAL; VAR q: QVal);
  2507. (* Like PoolSet but registers the descriptor as `data $<name>` — used for
  2508. a module-level set CONST, whose global name (<unit>_<const>) is what a
  2509. client's qualified reference emits. *)
  2510. VAR k: CARDINAL;
  2511. BEGIN
  2512. IF NOT opened OR noEmit THEN Cpy(q, "0"); RETURN END;
  2513. IF setN > HIGH(setW) THEN Cpy(q, "0"); RETURN END;
  2514. k := 0;
  2515. WHILE (k < words) AND (k <= HIGH(mask)) AND (k <= 15) DO
  2516. setMask[setN][k] := mask[k]; INC(k)
  2517. END;
  2518. WHILE k <= 15 DO setMask[setN][k] := 0; INC(k) END;
  2519. setW[setN] := words;
  2520. Cpy(setNam[setN], name);
  2521. Cpy(q, "$"); App(q, name);
  2522. INC(setN)
  2523. END PoolSetNamed;
  2524. PROCEDURE NewSetTemp (words: CARDINAL; VAR q: QVal);
  2525. VAR nb: QVal;
  2526. BEGIN
  2527. NewTemp(q);
  2528. Revive;
  2529. IntStr(VAL(INTEGER, WordsBytes(words)), nb);
  2530. W(" "); W(q); W(" =l alloc8 "); WL(nb)
  2531. END NewSetTemp;
  2532. PROCEDURE SetZero (addr: ARRAY OF CHAR; words: CARDINAL);
  2533. VAR i: CARDINAL;
  2534. a, z, off: QVal;
  2535. BEGIN
  2536. NewTemp(z);
  2537. Op3("xor", z, "0", "0", FALSE);
  2538. i := 0;
  2539. WHILE i < words DO
  2540. NewTemp(a);
  2541. IntStr(VAL(INTEGER, i * 4), off);
  2542. Op3L("add", a, addr, off);
  2543. Revive;
  2544. W(" storew "); W(z); W(", "); WL(a);
  2545. INC(i)
  2546. END
  2547. END SetZero;
  2548. PROCEDURE SetBit (addr: ARRAY OF CHAR; val: ARRAY OF CHAR;
  2549. lo: INTEGER; span: CARDINAL);
  2550. (* ORs one element in: off = val - lo trapped in [0, span). *)
  2551. VAR off, offL, hiS, loS: QVal;
  2552. wi, bi, wil, off4, wa, wcur, m, wn: QVal;
  2553. BEGIN
  2554. NewTemp(off);
  2555. IntStr(lo, loS);
  2556. Op3("sub", off, val, loS, FALSE);
  2557. WidenIndex(off, offL);
  2558. IntStr(VAL(INTEGER, span) - 1, hiS);
  2559. CheckRange(offL, "0", hiS);
  2560. NewTemp(wi);
  2561. Op3("shr", wi, off, "5", FALSE);
  2562. NewTemp(bi);
  2563. Op3("and", bi, off, "31", FALSE);
  2564. WidenIndex(wi, wil);
  2565. NewTemp(off4);
  2566. Op3L("mul", off4, wil, "4");
  2567. NewTemp(wa);
  2568. Op3L("add", wa, addr, off4);
  2569. NewTemp(m);
  2570. Op3("shl", m, "1", bi, FALSE);
  2571. NewTemp(wcur);
  2572. W(" "); W(wcur); W(" =w loadw "); WL(wa);
  2573. NewTemp(wn);
  2574. Op3("or", wn, wcur, m, FALSE);
  2575. Revive;
  2576. W(" storew "); W(wn); W(", "); WL(wa)
  2577. END SetBit;
  2578. PROCEDURE SetClearBit (addr: ARRAY OF CHAR; val: ARRAY OF CHAR;
  2579. lo: INTEGER; span: CARDINAL);
  2580. (* ANDs one element out: off = val - lo trapped in [0, span). *)
  2581. VAR off, offL, hiS, loS: QVal;
  2582. wi, bi, wil, off4, wa, wcur, m, nm, wn: QVal;
  2583. BEGIN
  2584. NewTemp(off);
  2585. IntStr(lo, loS);
  2586. Op3("sub", off, val, loS, FALSE);
  2587. WidenIndex(off, offL);
  2588. IntStr(VAL(INTEGER, span) - 1, hiS);
  2589. CheckRange(offL, "0", hiS);
  2590. NewTemp(wi);
  2591. Op3("shr", wi, off, "5", FALSE);
  2592. NewTemp(bi);
  2593. Op3("and", bi, off, "31", FALSE);
  2594. WidenIndex(wi, wil);
  2595. NewTemp(off4);
  2596. Op3L("mul", off4, wil, "4");
  2597. NewTemp(wa);
  2598. Op3L("add", wa, addr, off4);
  2599. NewTemp(m);
  2600. Op3("shl", m, "1", bi, FALSE);
  2601. NewTemp(nm);
  2602. Op3("xor", nm, m, "-1", FALSE);
  2603. NewTemp(wcur);
  2604. W(" "); W(wcur); W(" =w loadw "); WL(wa);
  2605. NewTemp(wn);
  2606. Op3("and", wn, wcur, nm, FALSE);
  2607. Revive;
  2608. W(" storew "); W(wn); W(", "); WL(wa)
  2609. END SetClearBit;
  2610. PROCEDURE SetShift (src: ARRAY OF CHAR; n: ARRAY OF CHAR;
  2611. words: CARDINAL; span: CARDINAL; isRot: BOOLEAN;
  2612. VAR q: QVal);
  2613. (* Bit-by-bit shift/rotate by a runtime amount n over [0, span);
  2614. bits that leave the span are dropped (SHIFT) or wrapped (ROTATE). *)
  2615. VAR out, nn, sp, hi, i: QVal;
  2616. wi, bi, wil, off4, wa, m, t, bit, nzb: QVal;
  2617. j, c, cs, jw: QVal;
  2618. ok1, ok2, ok, sj, wj, bj, wjl, o2, wb2, mm, mm2, mm3: QVal;
  2619. wcur, wn, ip1: QVal;
  2620. ltop, lbody, lend: QVal;
  2621. BEGIN
  2622. NewSetTemp(words, out);
  2623. SetZero(out, words);
  2624. Cpy(nn, n);
  2625. IntStr(VAL(INTEGER, span), sp);
  2626. IntStr(VAL(INTEGER, span) - 1, hi);
  2627. IF isRot THEN
  2628. NewTemp(j); Op3("rem", j, n, sp, FALSE);
  2629. NewTemp(ok1); Op3("add", ok1, j, sp, FALSE);
  2630. NewTemp(cs); Op3("rem", cs, ok1, sp, FALSE);
  2631. Cpy(nn, cs)
  2632. END;
  2633. NewTemp(i); Op3("add", i, "0", "0", FALSE);
  2634. NewLabel(ltop); NewLabel(lbody); NewLabel(lend);
  2635. EmitLabel(ltop);
  2636. NewTemp(c); Op3("cslew", c, i, hi, FALSE);
  2637. Jnz(c, lbody, lend);
  2638. EmitLabel(lbody);
  2639. NewTemp(wi); Op3("shr", wi, i, "5", FALSE);
  2640. NewTemp(bi); Op3("and", bi, i, "31", FALSE);
  2641. WidenIndex(wi, wil);
  2642. NewTemp(off4); Op3L("mul", off4, wil, "4");
  2643. NewTemp(wa); Op3L("add", wa, src, off4);
  2644. NewTemp(m); Op3("shl", m, "1", bi, FALSE);
  2645. NewTemp(t); W(" "); W(t); W(" =w loadw "); WL(wa);
  2646. NewTemp(bit); Op3("and", bit, t, m, FALSE);
  2647. NewTemp(nzb); Op3("cnew", nzb, bit, "0", FALSE);
  2648. NewTemp(j); Op3("add", j, i, nn, FALSE);
  2649. IF isRot THEN
  2650. NewTemp(c); Op3("csgew", c, j, sp, FALSE);
  2651. NewTemp(cs); Op3("mul", cs, c, sp, FALSE);
  2652. NewTemp(jw); Op3("sub", jw, j, cs, FALSE);
  2653. Cpy(j, jw)
  2654. END;
  2655. NewTemp(ok1); Op3("csgew", ok1, j, "0", FALSE);
  2656. NewTemp(ok2); Op3("cslew", ok2, j, hi, FALSE);
  2657. NewTemp(ok); Op3("and", ok, ok1, ok2, FALSE);
  2658. (* a dropped bit must still address a *valid* word: clamp the index
  2659. to 0 when out of range, so the load below cannot fault (the store
  2660. is already masked to a no-op by ok via mm3) *)
  2661. NewTemp(sj); Op3("mul", sj, j, ok, FALSE);
  2662. NewTemp(wj); Op3("shr", wj, sj, "5", FALSE);
  2663. NewTemp(bj); Op3("and", bj, sj, "31", FALSE);
  2664. WidenIndex(wj, wjl);
  2665. NewTemp(o2); Op3L("mul", o2, wjl, "4");
  2666. NewTemp(wb2); Op3L("add", wb2, out, o2);
  2667. NewTemp(mm); Op3("shl", mm, "1", bj, FALSE);
  2668. NewTemp(mm2); Op3("mul", mm2, mm, nzb, FALSE);
  2669. NewTemp(mm3); Op3("mul", mm3, mm2, ok, FALSE);
  2670. NewTemp(wcur); W(" "); W(wcur); W(" =w loadw "); WL(wb2);
  2671. NewTemp(wn); Op3("or", wn, wcur, mm3, FALSE);
  2672. Revive;
  2673. W(" storew "); W(wn); W(", "); WL(wb2);
  2674. Op3("add", i, i, "1", FALSE);
  2675. Jmp(ltop);
  2676. EmitLabel(lend);
  2677. Cpy(q, out)
  2678. END SetShift;
  2679. PROCEDURE SetRange (addr: ARRAY OF CHAR; a: ARRAY OF CHAR;
  2680. b: ARRAY OF CHAR; lo: INTEGER; span: CARDINAL);
  2681. VAR al, bl, hiS: QVal;
  2682. cur, c: QVal;
  2683. ltop, lbody, lend: QVal;
  2684. BEGIN
  2685. WidenIndex(a, al);
  2686. WidenIndex(b, bl);
  2687. IntStr(VAL(INTEGER, span) - 1, hiS);
  2688. CheckRange(al, "0", hiS);
  2689. CheckRange(bl, "0", hiS);
  2690. NewTemp(cur);
  2691. Op3("add", cur, a, "0", FALSE);
  2692. NewLabel(ltop); NewLabel(lbody); NewLabel(lend);
  2693. EmitLabel(ltop);
  2694. NewTemp(c);
  2695. Op3("cslew", c, cur, b, FALSE);
  2696. Jnz(c, lbody, lend);
  2697. EmitLabel(lbody);
  2698. SetBit(addr, cur, lo, span);
  2699. Op3("add", cur, cur, "1", FALSE);
  2700. Jmp(ltop);
  2701. EmitLabel(lend)
  2702. END SetRange;
  2703. PROCEDURE SetBinOp (sel: INTEGER; l: ARRAY OF CHAR; r: ARRAY OF CHAR;
  2704. lw, rw: CARDINAL; VAR q: QVal);
  2705. (* Union/intersection/difference/symdiff over possibly different
  2706. spans: overlap via op, larger-side extras copied (union/symdiff/
  2707. left-diff) or zeroed. Result has max words. *)
  2708. VAR i, m, res: CARDINAL;
  2709. la, ra, ta, a, b, c, nb, z: QVal;
  2710. BEGIN
  2711. m := lw;
  2712. IF rw < m THEN m := rw END;
  2713. res := lw;
  2714. IF rw > res THEN res := rw END;
  2715. NewSetTemp(res, q);
  2716. NewTemp(z);
  2717. Op3("xor", z, "0", "0", FALSE);
  2718. i := 0;
  2719. WHILE i < m DO
  2720. IntStr(VAL(INTEGER, i * 4), nb);
  2721. NewTemp(la); Op3L("add", la, l, nb);
  2722. NewTemp(ra); Op3L("add", ra, r, nb);
  2723. NewTemp(ta); Op3L("add", ta, q, nb);
  2724. NewTemp(a);
  2725. W(" "); W(a); W(" =w loadw "); WL(la);
  2726. NewTemp(b);
  2727. W(" "); W(b); W(" =w loadw "); WL(ra);
  2728. NewTemp(c);
  2729. IF sel = 0 THEN Op3("or", c, a, b, FALSE)
  2730. ELSIF sel = 1 THEN Op3("and", c, a, b, FALSE)
  2731. ELSIF sel = 2 THEN
  2732. NewTemp(nb);
  2733. Op3("xor", nb, b, "-1", FALSE);
  2734. Op3("and", c, a, nb, FALSE)
  2735. ELSE Op3("xor", c, a, b, FALSE)
  2736. END;
  2737. Revive;
  2738. W(" storew "); W(c); W(", "); WL(ta);
  2739. INC(i)
  2740. END;
  2741. WHILE i < lw DO
  2742. IntStr(VAL(INTEGER, i * 4), nb);
  2743. NewTemp(la); Op3L("add", la, l, nb);
  2744. NewTemp(ta); Op3L("add", ta, q, nb);
  2745. IF (sel = 0) OR (sel = 2) OR (sel = 3) THEN
  2746. NewTemp(a);
  2747. W(" "); W(a); W(" =w loadw "); WL(la);
  2748. Revive;
  2749. W(" storew "); W(a); W(", "); WL(ta)
  2750. ELSE
  2751. Revive;
  2752. W(" storew "); W(z); W(", "); WL(ta)
  2753. END;
  2754. INC(i)
  2755. END;
  2756. WHILE i < rw DO
  2757. IntStr(VAL(INTEGER, i * 4), nb);
  2758. NewTemp(ra); Op3L("add", ra, r, nb);
  2759. NewTemp(ta); Op3L("add", ta, q, nb);
  2760. IF (sel = 0) OR (sel = 3) THEN
  2761. NewTemp(b);
  2762. W(" "); W(b); W(" =w loadw "); WL(ra);
  2763. Revive;
  2764. W(" storew "); W(b); W(", "); WL(ta)
  2765. ELSE
  2766. Revive;
  2767. W(" storew "); W(z); W(", "); WL(ta)
  2768. END;
  2769. INC(i)
  2770. END
  2771. END SetBinOp;
  2772. PROCEDURE CmpSet (op: INTEGER; l: ARRAY OF CHAR; r: ARRAY OF CHAR;
  2773. lw, rw: CARDINAL; VAR q: QVal);
  2774. VAR i, m: CARDINAL;
  2775. la, ra, a, b, c, acc, nb: QVal;
  2776. BEGIN
  2777. NewTemp(acc);
  2778. Op3("xor", acc, "1", "0", FALSE);
  2779. m := lw;
  2780. IF rw < m THEN m := rw END;
  2781. i := 0;
  2782. WHILE i < m DO
  2783. IntStr(VAL(INTEGER, i * 4), nb);
  2784. NewTemp(la); Op3L("add", la, l, nb);
  2785. NewTemp(ra); Op3L("add", ra, r, nb);
  2786. NewTemp(a);
  2787. W(" "); W(a); W(" =w loadw "); WL(la);
  2788. NewTemp(b);
  2789. W(" "); W(b); W(" =w loadw "); WL(ra);
  2790. NewTemp(c);
  2791. Op3("ceqw", c, a, b, FALSE);
  2792. NewTemp(q);
  2793. Op3("and", q, acc, c, FALSE);
  2794. CopyOp(q, acc);
  2795. INC(i)
  2796. END;
  2797. WHILE i < lw DO
  2798. IntStr(VAL(INTEGER, i * 4), nb);
  2799. NewTemp(la); Op3L("add", la, l, nb);
  2800. NewTemp(a);
  2801. W(" "); W(a); W(" =w loadw "); WL(la);
  2802. NewTemp(c);
  2803. Op3("ceqw", c, a, "0", FALSE);
  2804. NewTemp(q);
  2805. Op3("and", q, acc, c, FALSE);
  2806. CopyOp(q, acc);
  2807. INC(i)
  2808. END;
  2809. WHILE i < rw DO
  2810. IntStr(VAL(INTEGER, i * 4), nb);
  2811. NewTemp(ra); Op3L("add", ra, r, nb);
  2812. NewTemp(b);
  2813. W(" "); W(b); W(" =w loadw "); WL(ra);
  2814. NewTemp(c);
  2815. Op3("ceqw", c, b, "0", FALSE);
  2816. NewTemp(q);
  2817. Op3("and", q, acc, c, FALSE);
  2818. CopyOp(q, acc);
  2819. INC(i)
  2820. END;
  2821. IF (op = SymTab.OpNeq1) OR (op = SymTab.OpNeq2) THEN
  2822. NewTemp(q);
  2823. Op3("xor", q, acc, "1", FALSE)
  2824. ELSE
  2825. CopyOp(acc, q)
  2826. END
  2827. END CmpSet;
  2828. PROCEDURE LoadPacked (addr: ARRAY OF CHAR; t: INTEGER; VAR q: QVal);
  2829. VAR nb: CARDINAL;
  2830. BEGIN
  2831. nb := SymTab.SetBytes(t);
  2832. NewTemp(q);
  2833. Revive;
  2834. W(" "); W(q);
  2835. IF nb = 1 THEN W(" =w loadub ")
  2836. ELSIF nb = 2 THEN W(" =w loaduh ")
  2837. ELSE W(" =w loadw ")
  2838. END;
  2839. WL(addr)
  2840. END LoadPacked;
  2841. PROCEDURE StorePacked (addr: ARRAY OF CHAR; t: INTEGER;
  2842. v: ARRAY OF CHAR);
  2843. VAR nb: CARDINAL;
  2844. BEGIN
  2845. nb := SymTab.SetBytes(t);
  2846. Revive;
  2847. IF nb = 1 THEN W(" storeb ")
  2848. ELSIF nb = 2 THEN W(" storeh ")
  2849. ELSE W(" storew ")
  2850. END;
  2851. W(v); W(", "); WL(addr)
  2852. END StorePacked;
  2853. PROCEDURE CopySetVal (dst: ARRAY OF CHAR; dt: INTEGER;
  2854. src: ARRAY OF CHAR; et: INTEGER);
  2855. VAR q: QVal;
  2856. BEGIN
  2857. IF SymTab.IsPackedSet(dt) THEN
  2858. IF SymTab.IsPackedSet(et) THEN LoadPacked(src, et, q)
  2859. ELSE LoadW(src, q)
  2860. END;
  2861. StorePacked(dst, dt, q)
  2862. ELSIF SymTab.IsPackedSet(et) THEN
  2863. SetZero(dst, SymTab.SetWords(dt));
  2864. LoadPacked(src, et, q);
  2865. StoreW(dst, q)
  2866. ELSE CopySet(dst, src, SymTab.SetWords(dt), SymTab.SetWords(et))
  2867. END
  2868. END CopySetVal;
  2869. PROCEDURE PackedSetBit (addr: ARRAY OF CHAR; t: INTEGER;
  2870. val: ARRAY OF CHAR; lo: INTEGER; span: CARDINAL);
  2871. VAR off, offL, hiS, loS, m, old, nv: QVal;
  2872. BEGIN
  2873. NewTemp(off);
  2874. IntStr(lo, loS);
  2875. Op3("sub", off, val, loS, FALSE);
  2876. WidenIndex(off, offL);
  2877. IntStr(VAL(INTEGER, span) - 1, hiS);
  2878. CheckRange(offL, "0", hiS);
  2879. NewTemp(m);
  2880. Op3("shl", m, "1", off, FALSE);
  2881. LoadPacked(addr, t, old);
  2882. NewTemp(nv);
  2883. Op3("or", nv, old, m, FALSE);
  2884. StorePacked(addr, t, nv)
  2885. END PackedSetBit;
  2886. PROCEDURE PackedSetClearBit (addr: ARRAY OF CHAR; t: INTEGER;
  2887. val: ARRAY OF CHAR; lo: INTEGER;
  2888. span: CARDINAL);
  2889. VAR off, offL, hiS, loS, m, nm, old, nv: QVal;
  2890. BEGIN
  2891. NewTemp(off);
  2892. IntStr(lo, loS);
  2893. Op3("sub", off, val, loS, FALSE);
  2894. WidenIndex(off, offL);
  2895. IntStr(VAL(INTEGER, span) - 1, hiS);
  2896. CheckRange(offL, "0", hiS);
  2897. NewTemp(m);
  2898. Op3("shl", m, "1", off, FALSE);
  2899. NewTemp(nm);
  2900. Op3("xor", nm, m, "-1", FALSE);
  2901. LoadPacked(addr, t, old);
  2902. NewTemp(nv);
  2903. Op3("and", nv, old, nm, FALSE);
  2904. StorePacked(addr, t, nv)
  2905. END PackedSetClearBit;
  2906. PROCEDURE PackedInSet (x: ARRAY OF CHAR; s: ARRAY OF CHAR;
  2907. lo: INTEGER; span: CARDINAL; t: INTEGER;
  2908. VAR q: QVal);
  2909. VAR off, offL, hiS, loS, word, sh, bit: QVal;
  2910. BEGIN
  2911. NewTemp(off);
  2912. IntStr(lo, loS);
  2913. Op3("sub", off, x, loS, FALSE);
  2914. WidenIndex(off, offL);
  2915. IntStr(VAL(INTEGER, span) - 1, hiS);
  2916. CheckRange(offL, "0", hiS);
  2917. LoadPacked(s, t, word);
  2918. NewTemp(sh);
  2919. Op3("shr", sh, word, off, FALSE);
  2920. NewTemp(bit);
  2921. Op3("and", bit, sh, "1", FALSE);
  2922. Cmp(SymTab.OpNeq1, bit, "0", q, FALSE)
  2923. END PackedInSet;
  2924. PROCEDURE PackedCmpSet (op: INTEGER; l: ARRAY OF CHAR; lt: INTEGER;
  2925. r: ARRAY OF CHAR; rt: INTEGER; VAR q: QVal);
  2926. VAR q1, q2: QVal;
  2927. BEGIN
  2928. IF SymTab.IsPackedSet(lt) THEN LoadPacked(l, lt, q1)
  2929. ELSE LoadW(l, q1)
  2930. END;
  2931. IF SymTab.IsPackedSet(rt) THEN LoadPacked(r, rt, q2)
  2932. ELSE LoadW(r, q2)
  2933. END;
  2934. Cmp(op, q1, q2, q, FALSE)
  2935. END PackedCmpSet;
  2936. PROCEDURE PackedSetBinOp (sel: INTEGER; l: ARRAY OF CHAR; lt: INTEGER;
  2937. r: ARRAY OF CHAR; rt: INTEGER; VAR q: QVal);
  2938. VAR tl, tr, w: QVal;
  2939. BEGIN
  2940. NewSetTemp(1, tl); NewSetTemp(1, tr);
  2941. IF SymTab.IsPackedSet(lt) THEN LoadPacked(l, lt, w)
  2942. ELSE LoadW(l, w)
  2943. END;
  2944. StoreW(tl, w);
  2945. IF SymTab.IsPackedSet(rt) THEN LoadPacked(r, rt, w)
  2946. ELSE LoadW(r, w)
  2947. END;
  2948. StoreW(tr, w);
  2949. SetBinOp(sel, tl, tr, 1, 1, q)
  2950. END PackedSetBinOp;
  2951. PROCEDURE CopySet (dst: ARRAY OF CHAR; src: ARRAY OF CHAR;
  2952. dw, sw: CARDINAL);
  2953. (* Copies min words via memcpy, zero-fills dst extras. Src extras
  2954. beyond dst must be zero (trap) — otherwise out-of-span bits
  2955. would vanish silently on narrowing assignment. *)
  2956. VAR m, i: CARDINAL;
  2957. n, da, sa, a, z, off, c: QVal;
  2958. qr, acc, lok, lbad: QVal;
  2959. BEGIN
  2960. m := dw;
  2961. IF sw < m THEN m := sw END;
  2962. IF sw > dw THEN
  2963. NewTemp(acc);
  2964. Op3("xor", acc, "1", "0", FALSE);
  2965. i := dw;
  2966. WHILE i < sw DO
  2967. IntStr(VAL(INTEGER, i * 4), off);
  2968. NewTemp(a); Op3L("add", a, src, off);
  2969. NewTemp(c);
  2970. W(" "); W(c); W(" =w loadw "); WL(a);
  2971. NewTemp(qr);
  2972. Op3("ceqw", qr, c, "0", FALSE);
  2973. NewTemp(c);
  2974. Op3("and", c, acc, qr, FALSE);
  2975. CopyOp(c, acc);
  2976. INC(i)
  2977. END;
  2978. NewLabel(lok); NewLabel(lbad);
  2979. Jnz(acc, lok, lbad);
  2980. EmitLabel(lbad);
  2981. Trap;
  2982. EmitLabel(lok)
  2983. END;
  2984. IF m > 0 THEN
  2985. IntStr(VAL(INTEGER, m * 4), n);
  2986. NewTemp(qr);
  2987. W(" "); W(qr); W(" =l call $memcpy(l ");
  2988. W(dst); W(", l "); W(src); W(", l "); W(n); WL(")")
  2989. END;
  2990. NewTemp(z);
  2991. Op3("xor", z, "0", "0", FALSE);
  2992. i := m;
  2993. WHILE i < dw DO
  2994. NewTemp(a);
  2995. IntStr(VAL(INTEGER, i * 4), off);
  2996. Op3L("add", a, dst, off);
  2997. Revive;
  2998. W(" storew "); W(z); W(", "); WL(a);
  2999. INC(i)
  3000. END
  3001. END CopySet;
  3002. PROCEDURE InSet (x: ARRAY OF CHAR; s: ARRAY OF CHAR; lo: INTEGER;
  3003. span: CARDINAL; VAR q: QVal);
  3004. (* Membership bit test with span trap; q is fresh w 0/1. *)
  3005. VAR off, offL, hiS, loS: QVal;
  3006. wi, bi, wil, off4, wa, wcur, m, a: QVal;
  3007. spanS: QVal;
  3008. BEGIN
  3009. NewTemp(off);
  3010. IntStr(lo, loS);
  3011. Op3("sub", off, x, loS, FALSE);
  3012. WidenIndex(off, offL);
  3013. IntStr(VAL(INTEGER, span) - 1, spanS);
  3014. CheckRange(offL, "0", spanS);
  3015. NewTemp(wi);
  3016. Op3("shr", wi, off, "5", FALSE);
  3017. NewTemp(bi);
  3018. Op3("and", bi, off, "31", FALSE);
  3019. WidenIndex(wi, wil);
  3020. NewTemp(off4);
  3021. Op3L("mul", off4, wil, "4");
  3022. NewTemp(wa);
  3023. Op3L("add", wa, s, off4);
  3024. NewTemp(wcur);
  3025. W(" "); W(wcur); W(" =w loadw "); WL(wa);
  3026. NewTemp(m);
  3027. Op3("shl", m, "1", bi, FALSE);
  3028. NewTemp(a);
  3029. Op3("and", a, wcur, m, FALSE);
  3030. NewTemp(q);
  3031. Op3("cnew", q, a, "0", FALSE)
  3032. END InSet;
  3033. PROCEDURE WidenIndex (idx: ARRAY OF CHAR; VAR q: QVal);
  3034. BEGIN
  3035. IF IsImm(idx) THEN Cpy(q, idx)
  3036. ELSE
  3037. NewTemp(q);
  3038. Revive;
  3039. W(" "); W(q); W(" =l extsw "); WL(idx)
  3040. END
  3041. END WidenIndex;
  3042. PROCEDURE OpenHi (base: ARRAY OF CHAR; VAR q: QVal);
  3043. VAR c: QVal;
  3044. BEGIN
  3045. NewTemp(c);
  3046. Revive;
  3047. W(" "); W(c); W(" =l loadl "); WL(base);
  3048. NewTemp(q);
  3049. Op3L("sub", q, c, "1")
  3050. END OpenHi;
  3051. PROCEDURE OpenHiChar (base: ARRAY OF CHAR; VAR q: QVal);
  3052. (* q := loadl(base) — the open-array count, i.e. the index of the NUL
  3053. terminator slot that CHAR arrays reserve. *)
  3054. BEGIN
  3055. NewTemp(q);
  3056. Revive;
  3057. W(" "); W(q); W(" =l loadl "); WL(base)
  3058. END OpenHiChar;
  3059. PROCEDURE LoadCount (base: ARRAY OF CHAR; VAR q: QVal);
  3060. BEGIN
  3061. NewTemp(q);
  3062. Revive;
  3063. W(" "); W(q); W(" =l loadl "); WL(base)
  3064. END LoadCount;
  3065. PROCEDURE CheckCode (idx, lo, hi: ARRAY OF CHAR; code: CARDINAL);
  3066. (* l-domain operands (widened index, immediates, or open hi temp);
  3067. comparisons are long (result w). *)
  3068. VAR c1, c2, c: QVal;
  3069. lok, lbad: QVal;
  3070. BEGIN
  3071. NewTemp(c1);
  3072. Op3("csgel", c1, idx, lo, FALSE);
  3073. NewTemp(c2);
  3074. Op3("cslel", c2, idx, hi, FALSE);
  3075. NewTemp(c);
  3076. Op3("and", c, c1, c2, FALSE);
  3077. NewLabel(lok); NewLabel(lbad);
  3078. Jnz(c, lok, lbad);
  3079. EmitLabel(lbad);
  3080. TrapCode(code);
  3081. EmitLabel(lok)
  3082. END CheckCode;
  3083. PROCEDURE CheckRange (idx, lo, hi: ARRAY OF CHAR);
  3084. BEGIN
  3085. CheckCode(idx, lo, hi, 1) (* rangeException *)
  3086. END CheckRange;
  3087. PROCEDURE CheckIndex (idx, lo, hi: ARRAY OF CHAR);
  3088. BEGIN
  3089. CheckCode(idx, lo, hi, 0) (* indexException *)
  3090. END CheckIndex;
  3091. PROCEDURE ElemAddr (base, idx, lo: ARRAY OF CHAR; elemT: INTEGER;
  3092. VAR q: QVal);
  3093. (* q := base + 8 + (idx - lo) * elemSize in l, fresh temp.
  3094. elemT is the array descriptor (open or fixed); all operands
  3095. l-domain (immediates pass, temps pre-widened). *)
  3096. VAR t1, t2, tb, sb: QVal;
  3097. BEGIN
  3098. NewTemp(t1);
  3099. Op3L("sub", t1, idx, lo);
  3100. IntStr(VAL(INTEGER, ElemSize(elemT)), sb);
  3101. NewTemp(t2);
  3102. Op3L("mul", t2, t1, sb);
  3103. NewTemp(tb);
  3104. Op3L("add", tb, base, "8");
  3105. NewTemp(q);
  3106. Op3L("add", q, tb, t2)
  3107. END ElemAddr;
  3108. PROCEDURE ViewField (view: ARRAY OF CHAR; off: CARDINAL; VAR q: QVal);
  3109. (* q := loadl(view + off), off one of 0,8,16,24,32. *)
  3110. VAR a, s: QVal;
  3111. BEGIN
  3112. NewTemp(a);
  3113. IntStr(VAL(INTEGER, off), s);
  3114. Op3L("add", a, view, s);
  3115. NewTemp(q);
  3116. Revive;
  3117. W(" "); W(q); W(" =l loadl "); WL(a)
  3118. END ViewField;
  3119. PROCEDURE ViewIndex (view, idx, lo: ARRAY OF CHAR;
  3120. nextIsArray: BOOLEAN; VAR q: QVal);
  3121. VAR t1, stride, off, base, addr, nv, next, tmp: QVal;
  3122. BEGIN
  3123. NewTemp(t1);
  3124. Op3L("sub", t1, idx, lo);
  3125. ViewField(view, 16, stride);
  3126. NewTemp(off);
  3127. Op3L("mul", off, t1, stride);
  3128. ViewField(view, 24, base);
  3129. NewTemp(addr);
  3130. Op3L("add", addr, base, off);
  3131. IF NOT nextIsArray THEN
  3132. CopyOp(addr, q)
  3133. ELSE
  3134. ViewField(view, 32, next);
  3135. NewTemp(nv);
  3136. Revive;
  3137. W(" "); W(nv); WL(" =l alloc8 40");
  3138. (* copy count, elemBytes, stride and next from the template *)
  3139. ViewField(next, 0, tmp);
  3140. Revive; W(" storel "); W(tmp); W(", "); WL(nv);
  3141. IntStr(8, off);
  3142. NewTemp(t1); Op3L("add", t1, nv, off);
  3143. ViewField(next, 8, tmp);
  3144. Revive; W(" storel "); W(tmp); W(", "); WL(t1);
  3145. IntStr(16, off);
  3146. NewTemp(t1); Op3L("add", t1, nv, off);
  3147. ViewField(next, 16, tmp);
  3148. Revive; W(" storel "); W(tmp); W(", "); WL(t1);
  3149. IntStr(32, off);
  3150. NewTemp(t1); Op3L("add", t1, nv, off);
  3151. ViewField(next, 32, tmp);
  3152. Revive; W(" storel "); W(tmp); W(", "); WL(t1);
  3153. IntStr(24, off);
  3154. NewTemp(t1); Op3L("add", t1, nv, off);
  3155. Revive; W(" storel "); W(addr); W(", "); WL(t1);
  3156. CopyOp(nv, q)
  3157. END
  3158. END ViewIndex;
  3159. PROCEDURE ViewToOpen1D (view: ARRAY OF CHAR; ft: INTEGER;
  3160. VAR q, base, nbytes: QVal);
  3161. VAR count, elem, total, n, desc, p, p2, eoff: QVal;
  3162. cls, extra: INTEGER;
  3163. BEGIN
  3164. ViewField(view, 0, count);
  3165. ViewField(view, 8, elem);
  3166. NewTemp(total);
  3167. Op3L("mul", total, count, elem);
  3168. cls := SymTab.ClassOf(SymTab.ArrayElem(ft));
  3169. IF (cls = SymTab.ClByte) OR (cls = SymTab.ClSByte) THEN
  3170. CopyOp(total, count)
  3171. END;
  3172. extra := 0;
  3173. IF cls = SymTab.ClChar THEN extra := 1
  3174. ELSIF cls = SymTab.ClUChar THEN extra := 4
  3175. END;
  3176. NewTemp(n);
  3177. Op3L("add", n, total, "8");
  3178. IF extra > 0 THEN
  3179. IntStr(VAL(INTEGER, extra), eoff);
  3180. NewTemp(p); Op3L("add", p, n, eoff); CopyOp(p, n)
  3181. END;
  3182. NewTemp(desc);
  3183. W(" "); W(desc); W(" =l call $malloc(l "); W(n); WL(")");
  3184. Revive;
  3185. W(" storel "); W(count); W(", "); WL(desc);
  3186. ViewField(view, 24, base);
  3187. CopyOp(total, nbytes);
  3188. NewTemp(p);
  3189. Op3L("add", p, desc, "8");
  3190. Revive;
  3191. W(" "); W(n); W(" =l call $memcpy(l ");
  3192. W(p); W(", l "); W(base); W(", l "); W(total); WL(")");
  3193. IF extra > 0 THEN
  3194. NewTemp(p); Op3L("add", p, desc, "8");
  3195. NewTemp(p2); Op3L("add", p2, p, total);
  3196. Revive;
  3197. IF extra = 1 THEN W(" storeb 0, "); WL(p2)
  3198. ELSE W(" storew 0, "); WL(p2) END
  3199. END;
  3200. CopyOp(desc, q)
  3201. END ViewToOpen1D;
  3202. PROCEDURE ViewCopyBack (desc, base, nbytes: ARRAY OF CHAR);
  3203. VAR p, r: QVal;
  3204. BEGIN
  3205. NewTemp(p);
  3206. Op3L("add", p, desc, "8");
  3207. NewTemp(r);
  3208. W(" "); W(r); W(" =l call $memcpy(l ");
  3209. W(base); W(", l "); W(p); W(", l "); W(nbytes); WL(")")
  3210. END ViewCopyBack;
  3211. PROCEDURE ViewFree (desc: ARRAY OF CHAR);
  3212. BEGIN
  3213. Revive;
  3214. W(" call $free(l "); W(desc); WL(")")
  3215. END ViewFree;
  3216. PROCEDURE ViewBase (view: ARRAY OF CHAR; VAR q: QVal);
  3217. BEGIN
  3218. ViewField(view, 24, q)
  3219. END ViewBase;
  3220. PROCEDURE ViewSize (view: ARRAY OF CHAR; VAR q: QVal);
  3221. VAR cnt, esz, r: QVal;
  3222. BEGIN
  3223. ViewField(view, 0, cnt);
  3224. ViewField(view, 8, esz);
  3225. NewTemp(r);
  3226. Op3L("mul", r, cnt, esz);
  3227. CopyOp(r, q)
  3228. END ViewSize;
  3229. PROCEDURE DescData (desc: ARRAY OF CHAR; VAR q: QVal);
  3230. BEGIN
  3231. NewTemp(q);
  3232. Op3L("add", q, desc, "8")
  3233. END DescData;
  3234. PROCEDURE OpenSize (desc: ARRAY OF CHAR; ft: INTEGER; VAR q: QVal);
  3235. VAR cnt, esz, r: QVal;
  3236. BEGIN
  3237. NewTemp(q);
  3238. Revive;
  3239. W(" "); W(q); W(" =l loadl "); WL(desc);
  3240. IntStr(VAL(INTEGER, SymTab.ArrayLeafBytes(ft)), esz);
  3241. NewTemp(r);
  3242. Op3L("mul", r, q, esz);
  3243. CopyOp(r, q)
  3244. END OpenSize;
  3245. PROCEDURE ElemLoad (addr: ARRAY OF CHAR; t: INTEGER; VAR q: QVal);
  3246. (* Loads one element of (element-)type t. Nested/pointer elements
  3247. are addresses (loadl). *)
  3248. VAR cls: INTEGER;
  3249. BEGIN
  3250. cls := SymTab.ClassOf(t);
  3251. NewTemp(q);
  3252. Revive;
  3253. W(" "); W(q);
  3254. IF cls = SymTab.ClReal THEN W(" =d loadd ")
  3255. ELSIF (cls = SymTab.ClArray) OR (cls = SymTab.ClPtr)
  3256. OR (cls = SymTab.ClLong) OR (cls = SymTab.ClProc)
  3257. OR (cls = SymTab.ClClass) THEN
  3258. W(" =l loadl ")
  3259. ELSIF cls = SymTab.ClChar THEN W(" =w loadub ")
  3260. ELSIF cls = SymTab.ClSet THEN
  3261. IF SymTab.IsPackedSet(t) AND (SymTab.SetBytes(t) = 1) THEN
  3262. W(" =w loadub ")
  3263. ELSIF SymTab.IsPackedSet(t) AND (SymTab.SetBytes(t) = 2) THEN
  3264. W(" =w loaduh ")
  3265. ELSE W(" =w loadw ")
  3266. END
  3267. ELSIF cls = SymTab.ClByte THEN W(" =w loadub ")
  3268. ELSIF cls = SymTab.ClSByte THEN W(" =w loadsb ")
  3269. ELSIF cls = SymTab.ClWord16 THEN W(" =w loaduh ")
  3270. ELSIF cls = SymTab.ClSWord16 THEN W(" =w loadsh ")
  3271. ELSE W(" =w loadw ")
  3272. END;
  3273. WL(addr)
  3274. END ElemLoad;
  3275. PROCEDURE ElemStore (addr, v: ARRAY OF CHAR; t: INTEGER);
  3276. VAR cls: INTEGER;
  3277. BEGIN
  3278. cls := SymTab.ClassOf(t);
  3279. Revive;
  3280. IF cls = SymTab.ClReal THEN W(" stored ")
  3281. ELSIF (cls = SymTab.ClArray) OR (cls = SymTab.ClPtr)
  3282. OR (cls = SymTab.ClLong) OR (cls = SymTab.ClProc)
  3283. OR (cls = SymTab.ClClass) THEN
  3284. W(" storel ")
  3285. ELSIF cls = SymTab.ClChar THEN W(" storeb ")
  3286. ELSIF cls = SymTab.ClSet THEN
  3287. IF SymTab.IsPackedSet(t) AND (SymTab.SetBytes(t) = 1) THEN
  3288. W(" storeb ")
  3289. ELSIF SymTab.IsPackedSet(t) AND (SymTab.SetBytes(t) = 2) THEN
  3290. W(" storeh ")
  3291. ELSE W(" storew ")
  3292. END
  3293. ELSIF (cls = SymTab.ClByte) OR (cls = SymTab.ClSByte) THEN W(" storeb ")
  3294. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN W(" storeh ")
  3295. ELSE W(" storew ")
  3296. END;
  3297. W(v); W(", "); WL(addr)
  3298. END ElemStore;
  3299. PROCEDURE CopyOldNestedToView (dst, src: ARRAY OF CHAR;
  3300. t: INTEGER; rank: CARDINAL);
  3301. (* Adapt an old nested-descriptor constructor (e.g. names{"Thu","Fri"})
  3302. into a flat multi-dimensional view payload. Only static constructor
  3303. sources use this path. *)
  3304. VAR count, base, esz, row, a, off, off2, child, i, c: QVal;
  3305. ltop, lbody, lend: QVal;
  3306. BEGIN
  3307. IF rank <= 1 THEN
  3308. ViewField(dst, 24, base);
  3309. ViewField(dst, 0, count);
  3310. ViewField(dst, 8, esz);
  3311. NewTemp(a);
  3312. Op3L("mul", a, count, esz);
  3313. NewTemp(off); Op3L("add", off, src, "8");
  3314. NewTemp(c);
  3315. W(" "); W(c); W(" =l call $memcpy(l ");
  3316. W(base); W(", l "); W(off); W(", l "); W(a); WL(")")
  3317. ELSE
  3318. ViewField(dst, 0, count);
  3319. NewTemp(i);
  3320. W(" "); W(i); W(" =l copy 0"); WL("");
  3321. NewLabel(ltop); NewLabel(lbody); NewLabel(lend);
  3322. EmitLabel(ltop);
  3323. NewTemp(c); Op3("csltl", c, i, count, FALSE);
  3324. Jnz(c, lbody, lend);
  3325. EmitLabel(lbody);
  3326. ViewIndex(dst, i, "0", TRUE, row);
  3327. NewTemp(off); Op3L("mul", off, i, "8");
  3328. NewTemp(a); Op3L("add", a, src, "8");
  3329. NewTemp(off2); Op3L("add", off2, a, off);
  3330. NewTemp(child); W(" "); W(child); W(" =l loadl "); WL(off2);
  3331. CopyOldNestedToView(row, child, SymTab.ArrayElem(t), rank - 1);
  3332. Op3L("add", i, i, "1");
  3333. Jmp(ltop);
  3334. EmitLabel(lend)
  3335. END
  3336. END CopyOldNestedToView;
  3337. PROCEDURE CopyArray (dst: ARRAY OF CHAR; src: ARRAY OF CHAR;
  3338. t: INTEGER);
  3339. (* Whole-array copy with runtime count check + blit. Nested levels
  3340. recurse through a runtime loop; counts mismatch traps. dst/src
  3341. are descriptor address operands; t is the destination type. *)
  3342. VAR dc, sc, ok: QVal;
  3343. lok, lbad: QVal;
  3344. ecls: INTEGER;
  3345. n, da, sa: QVal;
  3346. sb: QVal;
  3347. qr: QVal;
  3348. i, c, de, se, di, si, dd0, doff, sd0, soff: QVal;
  3349. ltop, lbody, lend: QVal;
  3350. BEGIN
  3351. IF SymTab.IsMultiArray(t) THEN
  3352. IF (src[0] = "$") AND (src[1] = "c") AND (src[2] = "t")
  3353. AND (src[3] = "o") THEN
  3354. CopyOldNestedToView(dst, src, t, SymTab.ArrayDepth(t))
  3355. ELSE
  3356. (* src/dst are ArrayView pointers; copy the flat payload only. *)
  3357. ViewField(dst, 24, da);
  3358. ViewField(src, 24, sa);
  3359. ViewField(dst, 0, n);
  3360. ViewField(dst, 8, sb);
  3361. NewTemp(qr);
  3362. Op3L("mul", qr, n, sb);
  3363. NewTemp(n);
  3364. W(" "); W(n); W(" =l call $memcpy(l ");
  3365. W(da); W(", l "); W(sa); W(", l "); W(qr); WL(")")
  3366. END;
  3367. RETURN
  3368. END;
  3369. NewTemp(dc);
  3370. Revive;
  3371. W(" "); W(dc); W(" =l loadl "); WL(dst);
  3372. NewTemp(sc);
  3373. W(" "); W(sc); W(" =l loadl "); WL(src);
  3374. NewTemp(ok);
  3375. Op3("ceql", ok, dc, sc, FALSE);
  3376. NewLabel(lok); NewLabel(lbad);
  3377. Jnz(ok, lok, lbad);
  3378. EmitLabel(lbad);
  3379. Trap;
  3380. EmitLabel(lok);
  3381. ecls := ElemCls(t);
  3382. IF (ecls = SymTab.ClArray) THEN
  3383. NewTemp(i);
  3384. W(" "); W(i); W(" =l copy 0"); WL("");
  3385. NewLabel(ltop); NewLabel(lbody); NewLabel(lend);
  3386. EmitLabel(ltop);
  3387. NewTemp(c);
  3388. Op3("csltl", c, i, dc, FALSE);
  3389. Jnz(c, lbody, lend);
  3390. EmitLabel(lbody);
  3391. NewTemp(dd0); Op3L("add", dd0, dst, "8");
  3392. NewTemp(doff); Op3L("mul", doff, i, "8");
  3393. NewTemp(de); Op3L("add", de, dd0, doff);
  3394. NewTemp(sd0); Op3L("add", sd0, src, "8");
  3395. NewTemp(soff); Op3L("mul", soff, i, "8");
  3396. NewTemp(se); Op3L("add", se, sd0, soff);
  3397. NewTemp(di);
  3398. W(" "); W(di); W(" =l loadl "); WL(de);
  3399. NewTemp(si);
  3400. W(" "); W(si); W(" =l loadl "); WL(se);
  3401. CopyArray(di, si, SymTab.ArrayElem(t));
  3402. Op3L("add", i, i, "1");
  3403. Jmp(ltop);
  3404. EmitLabel(lend)
  3405. ELSE
  3406. IntStr(VAL(INTEGER, ElemSize(t)), sb);
  3407. NewTemp(n);
  3408. Op3L("mul", n, dc, sb);
  3409. NewTemp(da);
  3410. Op3L("add", da, dst, "8");
  3411. NewTemp(sa);
  3412. Op3L("add", sa, src, "8");
  3413. NewTemp(qr);
  3414. W(" "); W(qr); W(" =l call $memcpy(l ");
  3415. W(da); W(", l "); W(sa); W(", l "); W(n); WL(")")
  3416. END
  3417. END CopyArray;
  3418. PROCEDURE CopyArrayEx (dst: ARRAY OF CHAR; src: ARRAY OF CHAR;
  3419. t: INTEGER; dstIsView, srcIsView: BOOLEAN);
  3420. VAR db, dc, de, sb, sc, se, total, srcData, dstData, r: QVal;
  3421. BEGIN
  3422. IF SymTab.IsMultiArray(t) THEN
  3423. CopyArray(dst, src, t); RETURN
  3424. END;
  3425. IF dstIsView THEN
  3426. ViewField(dst, 24, db);
  3427. ViewField(dst, 0, dc);
  3428. ViewField(dst, 8, de);
  3429. NewTemp(total); Op3L("mul", total, dc, de);
  3430. IF srcIsView THEN
  3431. ViewField(src, 24, sb)
  3432. ELSE
  3433. NewTemp(srcData); Op3L("add", srcData, src, "8"); CopyOp(srcData, sb)
  3434. END;
  3435. NewTemp(r);
  3436. W(" "); W(r); W(" =l call $memcpy(l ");
  3437. W(db); W(", l "); W(sb); W(", l "); W(total); WL(")")
  3438. ELSIF srcIsView THEN
  3439. ViewField(src, 24, sb);
  3440. ViewField(src, 0, sc);
  3441. ViewField(src, 8, se);
  3442. NewTemp(total); Op3L("mul", total, sc, se);
  3443. NewTemp(dstData); Op3L("add", dstData, dst, "8");
  3444. NewTemp(r);
  3445. W(" "); W(r); W(" =l call $memcpy(l ");
  3446. W(dstData); W(", l "); W(sb); W(", l "); W(total); WL(")")
  3447. ELSE
  3448. CopyArray(dst, src, t)
  3449. END
  3450. END CopyArrayEx;
  3451. PROCEDURE DeclStr (text: ARRAY OF CHAR; VAR q: QVal);
  3452. (* Records a quoted literal for top-level emission at EndModule and
  3453. returns its address operand ($strN). Data definitions may only
  3454. appear outside functions, but literals occur mid-body. *)
  3455. VAR nm: QVal;
  3456. BEGIN
  3457. Cpy(nm, "str");
  3458. AppNum(nm, nStr);
  3459. IF nStr <= HIGH(strNams) THEN
  3460. Cpy(strNams[nStr], nm);
  3461. Cpy(strTexts[nStr], text);
  3462. INC(nStr)
  3463. END;
  3464. Cpy(q, "$");
  3465. App(q, nm)
  3466. END DeclStr;
  3467. PROCEDURE DeclUStr (text: ARRAY OF CHAR; VAR q: QVal;
  3468. VAR single: BOOLEAN; VAR cp: INTEGER;
  3469. VAR ok: BOOLEAN);
  3470. (* text is the raw lexeme U'...' / U"..." Strict RFC3629-decode the
  3471. bytes between the quotes. Exactly one codepoint -> single:=TRUE,
  3472. cp:=it. Otherwise record a UString descriptor and q := "$ustrN".
  3473. ok:=FALSE for invalid UTF-8 (overlong / surrogate / >10FFFF /
  3474. truncation). *)
  3475. VAR L, i, cnt, base: CARDINAL;
  3476. b0, b1, b2, b3, ch: INTEGER;
  3477. nm: QVal;
  3478. PROCEDURE Cont (VAR b: INTEGER): BOOLEAN;
  3479. (* consume a continuation byte, or fail *)
  3480. BEGIN
  3481. IF i >= L - 1 THEN RETURN FALSE END;
  3482. b := ORD(text[i]); INC(i);
  3483. RETURN (b >= 128) AND (b <= 191)
  3484. END Cont;
  3485. BEGIN
  3486. single := FALSE; cp := 0; ok := TRUE;
  3487. q[0] := "0"; q[1] := CHR(0);
  3488. L := Len(text);
  3489. IF (L < 3) OR (text[0] # "U") THEN ok := FALSE; RETURN END;
  3490. i := 2; cnt := 0; base := ustrUsed;
  3491. WHILE i < L - 1 DO
  3492. b0 := ORD(text[i]); INC(i);
  3493. ch := -1;
  3494. IF b0 <= 127 THEN
  3495. ch := b0
  3496. ELSIF (b0 >= 194) AND (b0 <= 223) THEN
  3497. IF Cont(b1) THEN ch := ((b0 - 192) * 64) + (b1 - 128) END
  3498. ELSIF (b0 >= 224) AND (b0 <= 239) THEN
  3499. IF Cont(b1) AND Cont(b2) THEN
  3500. ch := ((b0 - 224) * 4096) + ((b1 - 128) * 64) + (b2 - 128);
  3501. IF ch < 2048 THEN ch := -1 END
  3502. END
  3503. ELSIF (b0 >= 240) AND (b0 <= 244) THEN
  3504. IF Cont(b1) AND Cont(b2) AND Cont(b3) THEN
  3505. ch := ((b0 - 240) * 262144) + ((b1 - 128) * 4096)
  3506. + ((b2 - 128) * 64) + (b3 - 128);
  3507. IF ch < 65536 THEN ch := -1 END
  3508. END
  3509. ELSE ok := FALSE
  3510. END;
  3511. IF ok AND (ch < 0) THEN ok := FALSE END;
  3512. IF ok AND (ch >= 55296) AND (ch <= 57343) THEN ok := FALSE END;
  3513. IF ok AND (ch > 1114111) THEN ok := FALSE END;
  3514. IF NOT ok THEN RETURN END;
  3515. IF ustrUsed <= HIGH(ustrPool) THEN
  3516. ustrPool[ustrUsed] := ch; INC(ustrUsed)
  3517. END;
  3518. INC(cnt)
  3519. END;
  3520. IF cnt = 1 THEN
  3521. single := TRUE; cp := ustrPool[base]
  3522. ELSE
  3523. Cpy(nm, "ustr"); AppNum(nm, ustrN);
  3524. IF ustrN <= HIGH(ustrNams) THEN
  3525. Cpy(ustrNams[ustrN], nm);
  3526. ustrStart[ustrN] := base; ustrCount[ustrN] := cnt; INC(ustrN)
  3527. END;
  3528. Cpy(q, "$"); App(q, nm)
  3529. END
  3530. END DeclUStr;
  3531. PROCEDURE FlushUStrings;
  3532. VAR k, i: CARDINAL;
  3533. bv: QVal;
  3534. BEGIN
  3535. IF NOT opened THEN RETURN END;
  3536. k := 0;
  3537. WHILE k < ustrN DO
  3538. W("data $"); W(ustrNams[k]); W(" = { l ");
  3539. IntStr(VAL(INTEGER, ustrCount[k]), bv); W(bv);
  3540. i := 0;
  3541. WHILE i < ustrCount[k] DO
  3542. W(", w ");
  3543. IntStr(ustrPool[ustrStart[k] + i], bv); W(bv);
  3544. INC(i)
  3545. END;
  3546. WL(" }");
  3547. INC(k)
  3548. END
  3549. END FlushUStrings;
  3550. PROCEDURE DeclCharStr (ch: ARRAY OF CHAR; VAR q: QVal);
  3551. VAR v: INTEGER;
  3552. txt: ARRAY [0 .. 3] OF CHAR;
  3553. BEGIN
  3554. IF ParseInt(ch, v) AND (v >= 0) AND (v < 256) THEN
  3555. txt[0] := '"'; txt[1] := CHR(v); txt[2] := '"'; txt[3] := CHR(0);
  3556. DeclStr(txt, q)
  3557. ELSE Cpy(q, "0")
  3558. END
  3559. END DeclCharStr;
  3560. PROCEDURE FindStrPos (v: ARRAY OF CHAR; VAR k: CARDINAL): BOOLEAN;
  3561. VAR j: CARDINAL;
  3562. sv: QVal;
  3563. BEGIN
  3564. j := 0;
  3565. WHILE j < nStr DO
  3566. Cpy(sv, "$"); App(sv, strNams[j]);
  3567. IF SymTab.Equal(sv, v) THEN k := j; RETURN TRUE END;
  3568. INC(j)
  3569. END;
  3570. RETURN FALSE
  3571. END FindStrPos;
  3572. PROCEDURE StrLitLen (v: ARRAY OF CHAR; VAR n: INTEGER): BOOLEAN;
  3573. VAR k: CARDINAL;
  3574. BEGIN
  3575. n := 0;
  3576. IF NOT FindStrPos(v, k) THEN RETURN FALSE END;
  3577. n := VAL(INTEGER, SymTab.StrLen(strTexts[k]) - 2);
  3578. RETURN TRUE
  3579. END StrLitLen;
  3580. PROCEDURE StrFold (a, b: ARRAY OF CHAR; clsA, clsB: INTEGER;
  3581. VAR q: QVal; VAR ok: BOOLEAN);
  3582. (* Constant-fold `a + b` into one string literal descriptor. *)
  3583. VAR ka, kb: CARDINAL;
  3584. ta, tb, joined: ARRAY [0 .. 1023] OF CHAR;
  3585. oa, ob, ord: INTEGER;
  3586. i, L: CARDINAL;
  3587. isCharA, isCharB: BOOLEAN;
  3588. PROCEDURE AppendInner (VAR s: ARRAY OF CHAR; txt: ARRAY OF CHAR);
  3589. VAR n: CARDINAL;
  3590. c2: ARRAY [0 .. 1] OF CHAR;
  3591. BEGIN
  3592. n := Len(txt);
  3593. IF n >= 2 THEN
  3594. i := 1;
  3595. WHILE i < n - 1 DO
  3596. c2[0] := txt[i]; c2[1] := CHR(0);
  3597. App(s, c2);
  3598. INC(i)
  3599. END
  3600. END
  3601. END AppendInner;
  3602. BEGIN
  3603. ok := FALSE;
  3604. isCharA := (clsA = SymTab.ClChar) OR (clsA = SymTab.ClEnum)
  3605. OR (clsA = SymTab.ClBool);
  3606. isCharB := (clsB = SymTab.ClChar) OR (clsB = SymTab.ClEnum)
  3607. OR (clsB = SymTab.ClBool);
  3608. IF isCharA THEN
  3609. IF NOT ParseInt(a, oa) THEN RETURN END
  3610. ELSIF NOT FindStrPos(a, ka) THEN RETURN
  3611. END;
  3612. IF isCharB THEN
  3613. IF NOT ParseInt(b, ob) THEN RETURN END
  3614. ELSIF NOT FindStrPos(b, kb) THEN RETURN
  3615. END;
  3616. joined[0] := '"'; joined[1] := CHR(0);
  3617. IF isCharA THEN
  3618. IF (oa < 0) OR (oa > 255) THEN RETURN END;
  3619. joined[1] := CHR(oa); joined[2] := CHR(0)
  3620. ELSE AppendInner(joined, strTexts[ka])
  3621. END;
  3622. IF isCharB THEN
  3623. IF (ob < 0) OR (ob > 255) THEN RETURN END;
  3624. L := Len(joined); joined[L] := CHR(ob); joined[L + 1] := CHR(0)
  3625. ELSE AppendInner(joined, strTexts[kb])
  3626. END;
  3627. L := Len(joined); joined[L] := '"'; joined[L + 1] := CHR(0);
  3628. DeclStr(joined, q);
  3629. ok := TRUE
  3630. END StrFold;
  3631. PROCEDURE FlushStrings;
  3632. (* Emits all recorded string literals as top-level data. *)
  3633. VAR k, i, L: CARDINAL;
  3634. bv: QVal;
  3635. BEGIN
  3636. IF NOT opened THEN RETURN END;
  3637. k := 0;
  3638. WHILE k < nStr DO
  3639. L := Len(strTexts[k]);
  3640. IF L >= 2 THEN
  3641. W("data $"); W(strNams[k]);
  3642. W(" = { l ");
  3643. IntStr(VAL(INTEGER, L - 2), bv);
  3644. W(bv);
  3645. i := 1;
  3646. WHILE i < L - 1 DO
  3647. W(", b ");
  3648. IntStr(ORD(strTexts[k][i]), bv);
  3649. W(bv);
  3650. INC(i)
  3651. END;
  3652. W(", b 0"); (* NUL terminator (count excludes it) *)
  3653. WL(" }")
  3654. END;
  3655. INC(k)
  3656. END
  3657. END FlushStrings;
  3658. PROCEDURE DeclMultiArr (name: ARRAY OF CHAR; t: INTEGER);
  3659. (* Static fixed multi-dimensional array: a chain of view descriptors
  3660. plus one contiguous payload block. One-dimensional arrays still use
  3661. ArrData. *)
  3662. VAR rank, k, count, stride, payload: CARDINAL;
  3663. cur: SymTab.TypeIndex;
  3664. lab, base, nxt, bv, sv, pv: QVal;
  3665. BEGIN
  3666. IF NOT opened THEN RETURN END;
  3667. rank := SymTab.ArrayDepth(t);
  3668. IF rank < 2 THEN ArrData(name, t); RETURN END;
  3669. payload := SymTab.ArrayPayloadSize(t);
  3670. cur := t;
  3671. k := 0;
  3672. WHILE k < rank DO
  3673. count := SymTab.ArrayLen(cur);
  3674. stride := SymTab.ArrayStride(t, k);
  3675. Cpy(lab, name);
  3676. IF k > 0 THEN
  3677. App(lab, "_t"); IntStr(VAL(INTEGER, k), bv); App(lab, bv)
  3678. END;
  3679. IF k = 0 THEN
  3680. Cpy(base, "$"); App(base, name); App(base, "_data")
  3681. ELSE
  3682. Cpy(base, "0")
  3683. END;
  3684. IF k + 1 < rank THEN
  3685. Cpy(nxt, "$"); App(nxt, name); App(nxt, "_t");
  3686. IntStr(VAL(INTEGER, k + 1), bv); App(nxt, bv)
  3687. ELSE
  3688. Cpy(nxt, "0")
  3689. END;
  3690. W("data $"); W(lab); W(" = { l ");
  3691. IntStr(VAL(INTEGER, count), bv); W(bv);
  3692. W(", l "); IntStr(VAL(INTEGER, stride), sv); W(sv);
  3693. W(", l "); W(sv);
  3694. W(", l "); W(base);
  3695. W(", l "); W(nxt); WL(" }");
  3696. cur := SymTab.ArrayElem(cur);
  3697. INC(k)
  3698. END;
  3699. W("data $"); W(name); W("_data = { z ");
  3700. IntStr(VAL(INTEGER, payload), pv); W(pv); WL(" }")
  3701. END DeclMultiArr;
  3702. PROCEDURE DeclArr (name: ARRAY OF CHAR; t: INTEGER);
  3703. BEGIN
  3704. IF SymTab.IsOpenArray(t) OR (SymTab.ArrayDepth(t) = 0) THEN
  3705. DataLine(name, FALSE, "0"); RETURN
  3706. END;
  3707. IF SymTab.IsMultiArray(t) THEN DeclMultiArr(name, t)
  3708. ELSE ArrData(name, t)
  3709. END
  3710. END DeclArr;
  3711. (* ---------------- array constructors (step: `T{...}`) ---------------- *)
  3712. (* A constructor becomes a pooled static descriptor with the same
  3713. layout as a declared array: "l <ArrayLen>, <items>" (CHAR/UCHAR
  3714. get a trailing zero terminator slot, like ArrBodyItems). Nested
  3715. arrays are emitted as their own pooled descriptors and referenced
  3716. by `l $ctoK` so the runtime descriptor pointers stay valid. *)
  3717. PROCEDURE IsBakeOp (v: ARRAY OF CHAR): BOOLEAN;
  3718. (* TRUE when v may be embedded in a static descriptor: an immediate,
  3719. or a pooled constructor/label reference ($ctoN). A plain global
  3720. address ($mod_var) is NOT bakeable into an inline field. *)
  3721. BEGIN
  3722. IF (v[0] = CHR(0)) OR (v[0] = "%") THEN RETURN FALSE END;
  3723. IF v[0] # "$" THEN RETURN TRUE END;
  3724. (* accept $ctoN only *)
  3725. RETURN (v[1] = "c") AND (v[2] = "t") AND (v[3] = "o")
  3726. END IsBakeOp;
  3727. PROCEDURE CtorItem (VAR buf: ARRAY OF CHAR; v: ARRAY OF CHAR;
  3728. cls: INTEGER);
  3729. BEGIN
  3730. App(buf, ", ");
  3731. IF (cls = SymTab.ClChar) OR (cls = SymTab.ClByte)
  3732. OR (cls = SymTab.ClSByte) THEN
  3733. App(buf, "b ")
  3734. ELSIF (cls = SymTab.ClWord16) OR (cls = SymTab.ClSWord16) THEN
  3735. App(buf, "h ")
  3736. ELSIF cls = SymTab.ClReal THEN
  3737. App(buf, "d ")
  3738. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClProc)
  3739. OR (cls = SymTab.ClLong) OR (cls = SymTab.ClArray) THEN
  3740. App(buf, "l ")
  3741. ELSE
  3742. App(buf, "w ")
  3743. END;
  3744. App(buf, v)
  3745. END CtorItem;
  3746. PROCEDURE RecItem (VAR s: ARRAY OF CHAR; VAR first: BOOLEAN;
  3747. v: ARRAY OF CHAR; cls: INTEGER);
  3748. (* Record field item with a leading separator when not first. *)
  3749. BEGIN
  3750. IF first THEN first := FALSE ELSE App(s, ", ") END;
  3751. IF cls = SymTab.ClChar THEN App(s, "b ")
  3752. ELSIF cls = SymTab.ClReal THEN App(s, "d ")
  3753. ELSIF (cls = SymTab.ClPtr) OR (cls = SymTab.ClProc)
  3754. OR (cls = SymTab.ClLong) OR (cls = SymTab.ClArray) THEN
  3755. App(s, "l ")
  3756. ELSE
  3757. App(s, "w ")
  3758. END;
  3759. App(s, v)
  3760. END RecItem;
  3761. PROCEDURE ArrZeroBody (VAR s: ARRAY OF CHAR; t: INTEGER);
  3762. (* "l <n>, z <bytes>" — an all-zero array body (used for a record's
  3763. unprovided array field). *)
  3764. VAR n: CARDINAL;
  3765. elem: SymTab.TypeIndex;
  3766. ecls: INTEGER;
  3767. esz: CARDINAL;
  3768. bv: QVal;
  3769. BEGIN
  3770. n := SymTab.ArrayLen(t);
  3771. elem := SymTab.ArrayElem(t);
  3772. ecls := SymTab.ClassOf(elem);
  3773. App(s, "l ");
  3774. IntStr(VAL(INTEGER, n), bv);
  3775. App(s, bv);
  3776. IF ecls = SymTab.ClChar THEN
  3777. App(s, ", z "); IntStr(VAL(INTEGER, n + 1), bv); App(s, bv)
  3778. ELSIF ecls = SymTab.ClUChar THEN
  3779. App(s, ", z "); IntStr(VAL(INTEGER, (n + 1) * 4), bv); App(s, bv)
  3780. ELSE
  3781. IF (ecls = SymTab.ClReal) OR (ecls = SymTab.ClPtr)
  3782. OR (ecls = SymTab.ClProc) OR (ecls = SymTab.ClArray)
  3783. OR (ecls = SymTab.ClLong) THEN esz := 8
  3784. ELSE esz := 4
  3785. END;
  3786. IF n > 0 THEN
  3787. App(s, ", z "); IntStr(VAL(INTEGER, n * esz), bv); App(s, bv)
  3788. END
  3789. END
  3790. END ArrZeroBody;
  3791. PROCEDURE FindCtor (v: ARRAY OF CHAR): INTEGER;
  3792. VAR k: CARDINAL;
  3793. sv: QVal;
  3794. BEGIN
  3795. k := 0;
  3796. WHILE k < ctorN DO
  3797. Cpy(sv, "$"); App(sv, ctorNam[k]);
  3798. IF SymTab.Equal(sv, v) THEN RETURN VAL(INTEGER, k) END;
  3799. INC(k)
  3800. END;
  3801. RETURN -1
  3802. END FindCtor;
  3803. (* default items for a nested record field, appended to s *)
  3804. PROCEDURE RecItemDefaults (VAR s: ARRAY OF CHAR; VAR first: BOOLEAN;
  3805. prefix: ARRAY OF CHAR; t: INTEGER);
  3806. VAR i, n, cls, w: INTEGER;
  3807. fn: SymTab.Name;
  3808. ft: SymTab.TypeIndex;
  3809. sub: QVal;
  3810. BEGIN
  3811. n := VAL(INTEGER, SymTab.FieldCount(t));
  3812. i := 0;
  3813. WHILE i < n DO
  3814. SymTab.FieldName(t, i, fn);
  3815. ft := SymTab.FieldType(t, fn);
  3816. cls := SymTab.ClassOf(ft);
  3817. IF first THEN first := FALSE ELSE App(s, ", ") END;
  3818. IF cls = SymTab.ClReal THEN App(s, "d 0")
  3819. ELSIF cls = SymTab.ClChar THEN App(s, "b 0")
  3820. ELSIF cls = SymTab.ClArray THEN ArrZeroBody(s, ft)
  3821. ELSIF cls = SymTab.ClSet THEN
  3822. w := VAL(INTEGER, SymTab.SetWords(ft));
  3823. IF w = 0 THEN w := 1 END;
  3824. App(s, "w 0");
  3825. WHILE w > 1 DO App(s, ", w 0"); DEC(w) END
  3826. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  3827. Cpy(sub, prefix); App(sub, "_"); App(sub, fn);
  3828. RecItemDefaults(s, first, sub, ft)
  3829. ELSE App(s, "w 0")
  3830. END;
  3831. INC(i)
  3832. END
  3833. END RecItemDefaults;
  3834. PROCEDURE CtorBegin (t: INTEGER);
  3835. BEGIN
  3836. IF ctorTop > HIGH(ctorTyp) THEN RETURN END;
  3837. ctorTyp[ctorTop] := t;
  3838. ctorCnt[ctorTop] := 0;
  3839. ctorBuf[ctorTop][0] := CHR(0);
  3840. INC(ctorTop)
  3841. END CtorBegin;
  3842. PROCEDURE CtorElemType (t: INTEGER; cnt: CARDINAL): SymTab.TypeIndex;
  3843. (* the type of the cnt-th constructor element: array element, or the
  3844. cnt-th record field in declaration order. *)
  3845. VAR fn: SymTab.Name;
  3846. BEGIN
  3847. IF SymTab.ClassOf(t) = SymTab.ClArray THEN
  3848. RETURN SymTab.ArrayElem(t)
  3849. END;
  3850. SymTab.FieldName(t, cnt, fn);
  3851. IF fn[0] = CHR(0) THEN RETURN SymTab.InvalidType END;
  3852. RETURN SymTab.FieldType(t, fn)
  3853. END CtorElemType;
  3854. PROCEDURE StrDesc (v: ARRAY OF CHAR; elemT: INTEGER; VAR out: QVal);
  3855. (* v is a $strN descriptor; build a CHAR-array descriptor of type
  3856. elemT from its text (padded/NUL-terminated) and return "$ctoM". *)
  3857. VAR k: CARDINAL;
  3858. found: BOOLEAN;
  3859. txt, bv, sv: QVal;
  3860. buf: ARRAY [0 .. 4095] OF CHAR;
  3861. n, i, L: CARDINAL;
  3862. BEGIN
  3863. Cpy(out, v);
  3864. IF (ctorN > HIGH(ctorNam)) THEN RETURN END;
  3865. found := FALSE; k := 0;
  3866. WHILE (k < nStr) AND NOT found DO
  3867. Cpy(sv, "$"); App(sv, strNams[k]);
  3868. IF SymTab.Equal(sv, v) THEN
  3869. Cpy(txt, strTexts[k]); found := TRUE
  3870. ELSE INC(k)
  3871. END
  3872. END;
  3873. IF NOT found THEN RETURN END;
  3874. L := Len(txt);
  3875. n := SymTab.ArrayLen(elemT);
  3876. buf[0] := CHR(0);
  3877. App(buf, "l ");
  3878. IntStr(VAL(INTEGER, n), bv);
  3879. App(buf, bv);
  3880. i := 0;
  3881. WHILE i < n DO
  3882. IF (i + 1 < L - 1) AND ((i + 1) <= HIGH(txt)) THEN
  3883. IntStr(ORD(txt[i + 1]), bv)
  3884. ELSE Cpy(bv, "0")
  3885. END;
  3886. CtorItem(buf, bv, SymTab.ClChar);
  3887. INC(i)
  3888. END;
  3889. App(buf, ", b 0");
  3890. Cpy(ctorNam[ctorN], "cto"); AppNum(ctorNam[ctorN], ctorN);
  3891. Cpy(ctorTxt[ctorN], buf);
  3892. ctorUse[ctorN] := TRUE;
  3893. INC(ctorN);
  3894. Cpy(out, "$"); App(out, ctorNam[ctorN - 1])
  3895. END StrDesc;
  3896. PROCEDURE AppCtorElem (v: ARRAY OF CHAR; cls: INTEGER);
  3897. VAR cnt: CARDINAL;
  3898. BEGIN
  3899. IF ctorTop = 0 THEN RETURN END;
  3900. cnt := ctorCnt[ctorTop - 1];
  3901. IF cnt > HIGH(ctorEv[0]) THEN RETURN END;
  3902. Cpy(ctorEv[ctorTop - 1][cnt], v);
  3903. ctorEk[ctorTop - 1][cnt] := cls;
  3904. INC(ctorCnt[ctorTop - 1])
  3905. END AppCtorElem;
  3906. PROCEDURE CtorElem (v: ARRAY OF CHAR);
  3907. (* Record the next constructor element. The element type is derived
  3908. from the constructor's type and the element index. A string literal
  3909. filling a CHAR element expands into consecutive elements. *)
  3910. VAR t, elemT, cls, k, si: INTEGER;
  3911. cnt: CARDINAL;
  3912. vv, bv: QVal;
  3913. isStr: BOOLEAN;
  3914. BEGIN
  3915. IF ctorTop = 0 THEN RETURN END;
  3916. t := ctorTyp[ctorTop - 1];
  3917. elemT := CtorElemType(t, ctorCnt[ctorTop - 1]);
  3918. cls := SymTab.ClassOf(elemT);
  3919. isStr := (Len(v) > 3) AND (v[0] = "$")
  3920. AND (v[1] = "s") AND (v[2] = "t");
  3921. IF cls = SymTab.ClChar THEN
  3922. IF isStr AND FindStrPos(v, cnt) THEN
  3923. k := 1;
  3924. WHILE k < VAL(INTEGER, Len(strTexts[cnt])) - 1 DO
  3925. IntStr(ORD(strTexts[cnt][k]), bv);
  3926. AppCtorElem(bv, SymTab.ClChar);
  3927. INC(k)
  3928. END;
  3929. RETURN
  3930. END;
  3931. AppCtorElem(v, SymTab.ClChar);
  3932. RETURN
  3933. END;
  3934. Cpy(vv, v);
  3935. IF (cls = SymTab.ClArray) AND isStr
  3936. AND (SymTab.ClassOf(SymTab.ArrayElem(elemT)) = SymTab.ClChar) THEN
  3937. StrDesc(v, elemT, vv)
  3938. END;
  3939. AppCtorElem(vv, cls)
  3940. END CtorElem;
  3941. PROCEDURE NewCtorTemp (t: INTEGER; VAR q: QVal);
  3942. VAR nb: QVal;
  3943. BEGIN
  3944. NewTemp(q);
  3945. Revive;
  3946. IntStr(VAL(INTEGER, HeapSize(t)), nb);
  3947. W(" "); W(q); W(" =l alloc8 "); WL(nb)
  3948. END NewCtorTemp;
  3949. PROCEDURE InitArrHeader (addr: ARRAY OF CHAR; t: INTEGER);
  3950. (* Store an inline array's count header (and CHAR/UCHAR terminator
  3951. slot) at addr, so a following CopyArray sees matching counts. *)
  3952. VAR nb, ea: QVal;
  3953. BEGIN
  3954. IF SymTab.ClassOf(t) # SymTab.ClArray THEN RETURN END;
  3955. IntStr(VAL(INTEGER, SymTab.ArrayLen(t)), nb);
  3956. Revive; W(" storel "); W(nb); W(", "); WL(addr);
  3957. IF SymTab.IsCharArray(t) THEN
  3958. IntStr(VAL(INTEGER, 8 + SymTab.ArrayLen(t)), nb);
  3959. NewTemp(ea); Op3L("add", ea, addr, nb);
  3960. Revive; W(" storeb 0, "); WL(ea)
  3961. END;
  3962. IF SymTab.IsUCharArray(t) THEN
  3963. IntStr(VAL(INTEGER, 8 + SymTab.ArrayLen(t) * 4), nb);
  3964. NewTemp(ea); Op3L("add", ea, addr, nb);
  3965. Revive; W(" storew 0, "); WL(ea)
  3966. END
  3967. END InitArrHeader;
  3968. PROCEDURE CtorArrStatic (VAR s: ARRAY OF CHAR; lvl: CARDINAL;
  3969. t: INTEGER; cnt: CARDINAL);
  3970. VAR elem, ecls, n, k, ci: INTEGER;
  3971. v: QVal;
  3972. BEGIN
  3973. elem := SymTab.ArrayElem(t);
  3974. ecls := SymTab.ClassOf(elem);
  3975. n := VAL(INTEGER, SymTab.ArrayLen(t));
  3976. App(s, "l ");
  3977. IntStr(n, v);
  3978. App(s, v);
  3979. k := 0;
  3980. WHILE k < n DO
  3981. IF k < VAL(INTEGER, cnt) THEN
  3982. Cpy(v, ctorEv[lvl][k])
  3983. ELSE Cpy(v, "0")
  3984. END;
  3985. CtorItem(s, v, ecls);
  3986. INC(k)
  3987. END;
  3988. IF ecls = SymTab.ClChar THEN App(s, ", b 0")
  3989. ELSIF ecls = SymTab.ClUChar THEN App(s, ", w 0")
  3990. END
  3991. END CtorArrStatic;
  3992. PROCEDURE CtorRecStatic (VAR s: ARRAY OF CHAR; lvl: CARDINAL;
  3993. t: INTEGER; cnt: CARDINAL);
  3994. (* Static record body: fields in declaration order; an array/record
  3995. field given as a nested constructor is inlined (and that child
  3996. descriptor is marked consumed). *)
  3997. VAR i, n, cls, ci, w: INTEGER;
  3998. fn: SymTab.Name;
  3999. ft: SymTab.TypeIndex;
  4000. v, bv: QVal;
  4001. first: BOOLEAN;
  4002. BEGIN
  4003. first := TRUE;
  4004. IF (SymTab.ClassOf(t) = SymTab.ClClass) AND SymTab.HasVTable(t) THEN
  4005. VtRef(t, bv);
  4006. App(s, "l "); App(s, bv);
  4007. first := FALSE
  4008. END;
  4009. n := VAL(INTEGER, SymTab.FieldCount(t));
  4010. i := 0;
  4011. WHILE i < n DO
  4012. SymTab.FieldName(t, i, fn);
  4013. ft := SymTab.FieldType(t, fn);
  4014. cls := SymTab.ClassOf(ft);
  4015. v[0] := CHR(0);
  4016. IF i < VAL(INTEGER, cnt) THEN Cpy(v, ctorEv[lvl][i]) END;
  4017. IF (v[0] # CHR(0)) AND (v[0] = "$")
  4018. AND ((cls = SymTab.ClArray) OR (cls = SymTab.ClRecord)
  4019. OR (cls = SymTab.ClClass)) THEN
  4020. ci := FindCtor(v);
  4021. IF first THEN first := FALSE ELSE App(s, ", ") END;
  4022. IF ci >= 0 THEN
  4023. App(s, ctorTxt[ci]);
  4024. ctorUse[ci] := FALSE
  4025. ELSIF cls = SymTab.ClArray THEN ArrZeroBody(s, ft)
  4026. ELSE App(s, "w 0")
  4027. END
  4028. ELSIF v[0] # CHR(0) THEN
  4029. RecItem(s, first, v, cls)
  4030. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  4031. IF first THEN first := FALSE ELSE App(s, ", ") END;
  4032. Cpy(bv, ctorNam[ctorN]); App(bv, "_"); App(bv, fn);
  4033. RecItemDefaults(s, first, bv, ft)
  4034. ELSE
  4035. IF first THEN first := FALSE ELSE App(s, ", ") END;
  4036. IF cls = SymTab.ClReal THEN App(s, "d 0")
  4037. ELSIF cls = SymTab.ClChar THEN App(s, "b 0")
  4038. ELSIF cls = SymTab.ClArray THEN ArrZeroBody(s, ft)
  4039. ELSIF cls = SymTab.ClSet THEN
  4040. w := VAL(INTEGER, SymTab.SetWords(ft));
  4041. IF w = 0 THEN w := 1 END;
  4042. App(s, "w 0");
  4043. WHILE w > 1 DO App(s, ", w 0"); DEC(w) END
  4044. ELSE App(s, "w 0")
  4045. END
  4046. END;
  4047. INC(i)
  4048. END;
  4049. IF first THEN App(s, "w 0") END
  4050. END CtorRecStatic;
  4051. PROCEDURE CtorEnd (VAR q: QVal);
  4052. VAR t, cls, lvl, k, n, cnt, esz, off, ci: INTEGER;
  4053. allc: BOOLEAN;
  4054. bv, a, v: QVal;
  4055. s: ARRAY [0 .. 4095] OF CHAR;
  4056. ft, elem: SymTab.TypeIndex;
  4057. nm: SymTab.Name;
  4058. BEGIN
  4059. IF ctorTop = 0 THEN Cpy(q, "0"); RETURN END;
  4060. DEC(ctorTop);
  4061. lvl := VAL(INTEGER, ctorTop);
  4062. IF noEmit THEN Cpy(q, "0"); RETURN END;
  4063. t := ctorTyp[ctorTop];
  4064. cnt := VAL(INTEGER, ctorCnt[ctorTop]);
  4065. cls := SymTab.ClassOf(t);
  4066. IF (cls # SymTab.ClArray) AND (cls # SymTab.ClRecord)
  4067. AND (cls # SymTab.ClClass) THEN
  4068. Cpy(q, "0"); RETURN
  4069. END;
  4070. allc := TRUE; k := 0;
  4071. WHILE k < cnt DO
  4072. IF NOT IsBakeOp(ctorEv[lvl][k]) THEN allc := FALSE END;
  4073. INC(k)
  4074. END;
  4075. IF allc AND (ctorN <= HIGH(ctorNam)) THEN
  4076. s[0] := CHR(0);
  4077. IF cls = SymTab.ClArray THEN
  4078. CtorArrStatic(s, ctorTop, t, ctorCnt[ctorTop])
  4079. ELSE
  4080. CtorRecStatic(s, ctorTop, t, ctorCnt[ctorTop])
  4081. END;
  4082. Cpy(ctorNam[ctorN], "cto"); AppNum(ctorNam[ctorN], ctorN);
  4083. Cpy(ctorTxt[ctorN], s);
  4084. ctorUse[ctorN] := TRUE;
  4085. INC(ctorN);
  4086. Cpy(q, "$"); App(q, ctorNam[ctorN - 1])
  4087. ELSE
  4088. (* runtime construction: an all-zero descriptor filled in place *)
  4089. NewCtorTemp(t, q);
  4090. IF cls = SymTab.ClArray THEN
  4091. IntStr(VAL(INTEGER, SymTab.ArrayLen(t)), bv);
  4092. Revive; W(" storel "); W(bv); W(", "); WL(q);
  4093. elem := SymTab.ArrayElem(t);
  4094. esz := VAL(INTEGER, ElemSize(t));
  4095. n := VAL(INTEGER, SymTab.ArrayLen(t));
  4096. k := 0;
  4097. WHILE k < n DO
  4098. off := 8 + k * esz;
  4099. FieldAddr(q, off, a);
  4100. IF k < cnt THEN
  4101. Cpy(v, ctorEv[lvl][k]);
  4102. ElemStore(a, v, elem)
  4103. ELSE ElemStore(a, "0", elem)
  4104. END;
  4105. INC(k)
  4106. END;
  4107. IF SymTab.ClassOf(elem) = SymTab.ClChar THEN
  4108. off := 8 + n;
  4109. FieldAddr(q, off, a);
  4110. Revive; W(" storeb 0, "); WL(a)
  4111. ELSIF SymTab.ClassOf(elem) = SymTab.ClUChar THEN
  4112. off := 8 + n * 4;
  4113. FieldAddr(q, off, a);
  4114. Revive; W(" storew 0, "); WL(a)
  4115. END
  4116. ELSE
  4117. (* record / class *)
  4118. IF (cls = SymTab.ClClass) AND SymTab.HasVTable(t) THEN
  4119. VtRef(t, bv);
  4120. off := SymTab.VptrOffset(t);
  4121. FieldAddr(q, off, a);
  4122. Revive; W(" storel "); W(bv); W(", "); WL(a)
  4123. END;
  4124. n := VAL(INTEGER, SymTab.FieldCount(t));
  4125. k := 0;
  4126. WHILE k < n DO
  4127. SymTab.FieldName(t, k, nm);
  4128. ft := SymTab.FieldType(t, nm);
  4129. off := SymTab.FieldOffset(t, nm);
  4130. FieldAddr(q, off, a);
  4131. IF k < cnt THEN
  4132. Cpy(v, ctorEv[lvl][k]);
  4133. IF SymTab.ClassOf(ft) = SymTab.ClArray THEN
  4134. InitArrHeader(a, ft);
  4135. CopyArray(a, v, ft)
  4136. ELSIF (SymTab.ClassOf(ft) = SymTab.ClRecord)
  4137. OR (SymTab.ClassOf(ft) = SymTab.ClClass) THEN
  4138. CopyRecord(a, v, ft)
  4139. ELSIF SymTab.ClassOf(ft) = SymTab.ClSet THEN
  4140. CopySet(a, v, SymTab.SetWords(ft), SymTab.SetWords(ft))
  4141. ELSE ElemStore(a, v, ft)
  4142. END
  4143. ELSIF (SymTab.ClassOf(ft) = SymTab.ClReal)
  4144. OR (SymTab.ClassOf(ft) = SymTab.ClChar)
  4145. OR (SymTab.ClassOf(ft) = SymTab.ClInt)
  4146. OR (SymTab.ClassOf(ft) = SymTab.ClBool)
  4147. OR (SymTab.ClassOf(ft) = SymTab.ClEnum)
  4148. OR (SymTab.ClassOf(ft) = SymTab.ClLong)
  4149. OR (SymTab.ClassOf(ft) = SymTab.ClPtr)
  4150. OR (SymTab.ClassOf(ft) = SymTab.ClProc) THEN
  4151. ElemStore(a, "0", ft)
  4152. END;
  4153. INC(k)
  4154. END
  4155. END
  4156. END
  4157. END CtorEnd;
  4158. PROCEDURE FlushCtors;
  4159. VAR k: CARDINAL;
  4160. BEGIN
  4161. IF NOT opened THEN RETURN END;
  4162. k := 0;
  4163. WHILE k < ctorN DO
  4164. IF ctorUse[k] THEN
  4165. W("data $"); W(ctorNam[k]); W(" = { "); W(ctorTxt[k]); WL(" }")
  4166. END;
  4167. INC(k)
  4168. END
  4169. END FlushCtors;
  4170. PROCEDURE PushLoop (exit: ARRAY OF CHAR);
  4171. BEGIN
  4172. IF loopTop <= HIGH(loopSt) THEN
  4173. Cpy(loopSt[loopTop], exit); INC(loopTop)
  4174. END
  4175. END PushLoop;
  4176. PROCEDURE PopLoop;
  4177. BEGIN
  4178. IF loopTop > 0 THEN DEC(loopTop) END
  4179. END PopLoop;
  4180. PROCEDURE TopLoop (VAR exit: QVal): BOOLEAN;
  4181. BEGIN
  4182. IF loopTop = 0 THEN RETURN FALSE END;
  4183. Cpy(exit, loopSt[loopTop - 1]);
  4184. RETURN TRUE
  4185. END TopLoop;
  4186. PROCEDURE CmpL (op: INTEGER; l, r: ARRAY OF CHAR; VAR q: QVal);
  4187. VAR mn : ARRAY [0 .. 7] OF CHAR;
  4188. BEGIN
  4189. mn[0] := CHR(0);
  4190. IF op = SymTab.OpEq THEN Cpy(mn, "ceql")
  4191. ELSE Cpy(mn, "cnel")
  4192. END;
  4193. NewTemp(q);
  4194. Op3(mn, q, l, r, FALSE)
  4195. END CmpL;
  4196. (* ---------------- heap (step 3.6: extern malloc/free) ---------------- *)
  4197. (* Only the object skeleton is initialized (array counts); elements
  4198. and members stay garbage per Wirth, except nested objects which
  4199. are allocated recursively. DISPOSE is shallow (documented). *)
  4200. PROCEDURE HeapSize (t: INTEGER): CARDINAL;
  4201. VAR cls: INTEGER;
  4202. n: CARDINAL;
  4203. BEGIN
  4204. cls := SymTab.ClassOf(t);
  4205. IF (cls = SymTab.ClArray) AND SymTab.IsMultiArray(t) THEN
  4206. RETURN SymTab.ArrayDepth(t) * 40 + SymTab.ArrayPayloadSize(t)
  4207. ELSIF cls = SymTab.ClArray THEN
  4208. n := SymTab.ArrayLen(t) * ElemSize(t);
  4209. IF SymTab.IsCharArray(t) THEN n := n + 1 END;
  4210. IF SymTab.IsUCharArray(t) THEN n := n + 4 END;
  4211. RETURN 8 + n
  4212. END;
  4213. RETURN SymTab.TypeSize(t)
  4214. END HeapSize;
  4215. PROCEDURE NewHeap (t: SymTab.TypeIndex; VAR q: QVal);
  4216. VAR nb: QVal;
  4217. BEGIN
  4218. NewTemp(q);
  4219. Revive;
  4220. IntStr(VAL(INTEGER, HeapSize(t)), nb);
  4221. W(" "); W(q);
  4222. IF useStack THEN W(" =l alloc8 "); W(nb); WL("")
  4223. ELSE W(" =l call $malloc(l "); W(nb); WL(")")
  4224. END
  4225. END NewHeap;
  4226. PROCEDURE FreeHeap (v: ARRAY OF CHAR);
  4227. BEGIN
  4228. Revive;
  4229. W(" call $free(l "); W(v); WL(")")
  4230. END FreeHeap;
  4231. PROCEDURE InitMultiHeap (addr: ARRAY OF CHAR; t: SymTab.TypeIndex);
  4232. (* Initialise the per-level view chain and zero the flat payload. *)
  4233. VAR rank, k, count, stride, payload: CARDINAL;
  4234. cur: SymTab.TypeIndex;
  4235. v, a, nb, off, pay: QVal;
  4236. BEGIN
  4237. rank := SymTab.ArrayDepth(t);
  4238. payload := SymTab.ArrayPayloadSize(t);
  4239. cur := t;
  4240. k := 0;
  4241. WHILE k < rank DO
  4242. IntStr(VAL(INTEGER, k * 40), off);
  4243. NewTemp(v); Op3L("add", v, addr, off);
  4244. count := SymTab.ArrayLen(cur);
  4245. IntStr(VAL(INTEGER, count), nb);
  4246. Revive; W(" storel "); W(nb); W(", "); WL(v);
  4247. stride := SymTab.ArrayStride(t, k);
  4248. IntStr(VAL(INTEGER, stride), nb);
  4249. NewTemp(a); Op3L("add", a, v, "8");
  4250. Revive; W(" storel "); W(nb); W(", "); WL(a);
  4251. NewTemp(a); Op3L("add", a, v, "16");
  4252. Revive; W(" storel "); W(nb); W(", "); WL(a);
  4253. IF k = 0 THEN
  4254. IntStr(VAL(INTEGER, rank * 40), off);
  4255. NewTemp(pay); Op3L("add", pay, addr, off);
  4256. NewTemp(a); Op3L("add", a, v, "24");
  4257. Revive; W(" storel "); W(pay); W(", "); WL(a)
  4258. ELSE
  4259. NewTemp(a); Op3L("add", a, v, "24");
  4260. Revive; W(" storel 0, "); WL(a)
  4261. END;
  4262. IF k + 1 < rank THEN
  4263. IntStr(VAL(INTEGER, (k + 1) * 40), off);
  4264. NewTemp(a); Op3L("add", a, addr, off);
  4265. NewTemp(nb); Op3L("add", nb, v, "32");
  4266. Revive; W(" storel "); W(a); W(", "); WL(nb)
  4267. ELSE
  4268. NewTemp(a); Op3L("add", a, v, "32");
  4269. Revive; W(" storel 0, "); WL(a)
  4270. END;
  4271. cur := SymTab.ArrayElem(cur);
  4272. INC(k)
  4273. END;
  4274. IntStr(VAL(INTEGER, rank * 40), off);
  4275. NewTemp(pay); Op3L("add", pay, addr, off);
  4276. IntStr(VAL(INTEGER, payload), nb);
  4277. NewTemp(a); W(" "); W(a); W(" =l call $memset(l ");
  4278. W(pay); W(", w 0, l "); W(nb); WL(")")
  4279. END InitMultiHeap;
  4280. PROCEDURE InitHeap (addr: ARRAY OF CHAR; t: SymTab.TypeIndex);
  4281. VAR cls, ecls: INTEGER;
  4282. n, i: CARDINAL;
  4283. fn: SymTab.Name;
  4284. ft: SymTab.TypeIndex;
  4285. nb, ea, eb, fa, fb: QVal;
  4286. BEGIN
  4287. cls := SymTab.ClassOf(t);
  4288. IF (cls = SymTab.ClClass) AND SymTab.HasVTable(t) THEN
  4289. (* install the class's vtable pointer *)
  4290. VtRef(t, eb);
  4291. IntStr(SymTab.VptrOffset(t), nb);
  4292. NewTemp(ea);
  4293. Op3L("add", ea, addr, nb);
  4294. Revive;
  4295. W(" storel "); W(eb); W(", "); WL(ea)
  4296. END;
  4297. IF (cls = SymTab.ClArray) AND SymTab.IsMultiArray(t) THEN
  4298. InitMultiHeap(addr, t)
  4299. ELSIF cls = SymTab.ClArray THEN
  4300. IntStr(VAL(INTEGER, SymTab.ArrayLen(t)), nb);
  4301. Revive;
  4302. W(" storel "); W(nb); W(", "); WL(addr);
  4303. IF SymTab.IsCharArray(t) THEN
  4304. (* NUL terminator slot at index = count *)
  4305. IntStr(VAL(INTEGER, 8 + SymTab.ArrayLen(t)), nb);
  4306. NewTemp(ea);
  4307. Op3L("add", ea, addr, nb);
  4308. Revive;
  4309. W(" storeb 0, "); WL(ea)
  4310. END;
  4311. IF SymTab.IsUCharArray(t) THEN
  4312. (* 0-codepoint terminator at index = count (4-byte element) *)
  4313. IntStr(VAL(INTEGER, 8 + SymTab.ArrayLen(t) * 4), nb);
  4314. NewTemp(ea);
  4315. Op3L("add", ea, addr, nb);
  4316. Revive;
  4317. W(" storew 0, "); WL(ea)
  4318. END;
  4319. ecls := SymTab.ClassOf(SymTab.ArrayElem(t));
  4320. IF ecls = SymTab.ClArray THEN
  4321. n := SymTab.ArrayLen(t);
  4322. i := 0;
  4323. WHILE i < n DO
  4324. IntStr(VAL(INTEGER, 8 + i * 8), nb);
  4325. NewTemp(ea);
  4326. Op3L("add", ea, addr, nb);
  4327. NewHeap(SymTab.ArrayElem(t), eb);
  4328. InitHeap(eb, SymTab.ArrayElem(t)); (* init the sub-array *)
  4329. Revive;
  4330. W(" storel "); W(eb); W(", "); WL(ea);
  4331. INC(i)
  4332. END
  4333. END
  4334. ELSIF (cls = SymTab.ClRecord) OR (cls = SymTab.ClClass) THEN
  4335. n := SymTab.FieldCount(t);
  4336. i := 0;
  4337. WHILE i < n DO
  4338. SymTab.FieldName(t, i, fn);
  4339. ft := SymTab.FieldType(t, fn);
  4340. ecls := SymTab.ClassOf(ft);
  4341. IF ecls = SymTab.ClArray THEN
  4342. (* inline array field: initialize its header in place *)
  4343. IntStr(SymTab.FieldOffset(t, fn), nb);
  4344. NewTemp(fa);
  4345. Op3L("add", fa, addr, nb);
  4346. InitHeap(fa, ft)
  4347. ELSIF (ecls = SymTab.ClRecord) OR (ecls = SymTab.ClClass) THEN
  4348. IntStr(SymTab.FieldOffset(t, fn), nb);
  4349. NewTemp(fa);
  4350. Op3L("add", fa, addr, nb);
  4351. InitHeap(fa, ft)
  4352. END;
  4353. INC(i)
  4354. END
  4355. END
  4356. END InitHeap;
  4357. PROCEDURE InFunction (): BOOLEAN;
  4358. (* TRUE while a function body is open (module-level test). *)
  4359. BEGIN
  4360. RETURN inFunc
  4361. END InFunction;
  4362. PROCEDURE RecArrayNeedsInit (n: CARDINAL; t: INTEGER): BOOLEAN;
  4363. (* TRUE for an array of records/classes that (recursively) has array
  4364. fields and is too large to expand inline: its inline length words
  4365. must be initialised at run time (InitRecArray). *)
  4366. VAR elem: INTEGER;
  4367. BEGIN
  4368. IF SymTab.ClassOf(t) # SymTab.ClArray THEN RETURN FALSE END;
  4369. elem := SymTab.ArrayElem(t);
  4370. IF (SymTab.ClassOf(elem) # SymTab.ClRecord)
  4371. AND (SymTab.ClassOf(elem) # SymTab.ClClass) THEN RETURN FALSE END;
  4372. IF NOT HasArrayField(elem) THEN RETURN FALSE END;
  4373. RETURN NOT RecArrayExpanded(n, elem)
  4374. END RecArrayNeedsInit;
  4375. PROCEDURE DeclRecTemplate (varName: ARRAY OF CHAR; rec: INTEGER);
  4376. (* "data $<mod>_<varName>_tmpl = { <one record with counts set> }" plus
  4377. any nested sub-descriptors; InitRecArray copies it over each element
  4378. of the compact array-of-record blob. *)
  4379. VAR g: QVal; first: BOOLEAN;
  4380. BEGIN
  4381. IF NOT opened THEN RETURN END;
  4382. Cpy(g, curModName); App(g, "_"); App(g, varName); App(g, "_tmpl");
  4383. RecStatics(g, rec);
  4384. W("data $"); W(g); W(" = { ");
  4385. first := TRUE;
  4386. RecItems(rec, g, first);
  4387. WL(" }")
  4388. END DeclRecTemplate;
  4389. PROCEDURE InitRecArray (varName: ARRAY OF CHAR; arrT: INTEGER);
  4390. (* value-initialise $<mod>_<varName>'s element length words: copy the
  4391. template record over each element (element i is at base + 8 +
  4392. i*stride). *)
  4393. VAR base, tmpl, slot, i, il, off, tb, p, c, one, two, nStr, stStr: QVal;
  4394. elem: INTEGER; lTop, lBody, lDone: QVal;
  4395. BEGIN
  4396. IF NOT opened THEN RETURN END;
  4397. elem := SymTab.ArrayElem(arrT);
  4398. Cpy(base, "$"); App(base, curModName); App(base, "_"); App(base, varName);
  4399. Cpy(tmpl, base); App(tmpl, "_tmpl");
  4400. IntStr(VAL(INTEGER, SymTab.ArrayLen(arrT)), nStr);
  4401. IntStr(VAL(INTEGER, SymTab.TypeSize(elem)), stStr);
  4402. Slot4(slot);
  4403. StoreW(slot, "0");
  4404. NewLabel(lTop); NewLabel(lBody); NewLabel(lDone);
  4405. EmitLabel(lTop);
  4406. LoadW(slot, i);
  4407. NewTemp(c); Op3("csltw", c, i, nStr, FALSE);
  4408. Jnz(c, lBody, lDone);
  4409. EmitLabel(lBody);
  4410. LoadW(slot, i);
  4411. WidenIndex(i, il);
  4412. NewTemp(off); Op3L("mul", off, il, stStr);
  4413. NewTemp(tb); Op3L("add", tb, base, "8");
  4414. NewTemp(p); Op3L("add", p, tb, off);
  4415. CopyRecord(p, tmpl, elem);
  4416. LoadW(slot, i);
  4417. NewTemp(one); CopyOp("1", one);
  4418. NewTemp(two); Op3("add", two, i, one, FALSE);
  4419. StoreW(slot, two);
  4420. Jmp(lTop);
  4421. EmitLabel(lDone)
  4422. END InitRecArray;
  4423. BEGIN
  4424. opened := FALSE;
  4425. inBody := FALSE;
  4426. dead := FALSE;
  4427. nTemp := 0; nLab := 0; loopTop := 0; nR := 0; nStr := 0;
  4428. withTop := 0;
  4429. noEmit := FALSE; inFunc := FALSE; useStack := FALSE;
  4430. nLoc := 0; nPar := 0; nArg := 0; nn := 0; callDepth := 0;
  4431. recvArmed := FALSE;
  4432. funcDepth := 0; scopeTop := 0; scopeBase[0] := 0;
  4433. outSel := 0
  4434. END QbeGen.