ORG.Mod.txt 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120
  1. MODULE ORG; (* N.Wirth, 16.4.2016 / 4.4.2017 / 31.5.2019 Oberon compiler; code generator for RISC*)
  2. IMPORT SYSTEM, Files, ORS, ORB;
  3. (*Code generator for Oberon compiler for RISC processor.
  4. Procedural interface to Parser OSAP; result in array "code".
  5. Procedure Close writes code-files*)
  6. CONST WordSize* = 4;
  7. StkOrg0 = -64; VarOrg0 = 0; (*for RISC-0 only*)
  8. MT = 12; SP = 14; LNK = 15; (*dedicated registers*)
  9. maxCode = 8000; maxStrx = 2400; maxTD = 160; C24 = 1000000H;
  10. Reg = 10; RegI = 11; Cond = 12; (*internal item modes*)
  11. (*frequently used opcodes*) U = 2000H; V = 1000H;
  12. Mov = 0; Lsl = 1; Asr = 2; Ror= 3; And = 4; Ann = 5; Ior = 6; Xor = 7;
  13. Add = 8; Sub = 9; Cmp = 9; Mul = 10; Div = 11;
  14. Fad = 12; Fsb = 13; Fml = 14; Fdv = 15;
  15. Ldr = 8; Str = 10;
  16. BR = 0; BLR = 1; BC = 2; BL = 3;
  17. MI = 0; PL = 8; EQ = 1; NE = 9; LT = 5; GE = 13; LE = 6; GT = 14;
  18. TYPE Item* = RECORD
  19. mode*: INTEGER;
  20. type*: ORB.Type;
  21. a*, b*, r: LONGINT;
  22. rdo*: BOOLEAN (*read only*)
  23. END ;
  24. (* Item forms and meaning of fields:
  25. mode r a b
  26. --------------------------------
  27. Const - value (proc adr) (immediate value)
  28. Var base off - (direct adr)
  29. Par - off0 off1 (indirect adr)
  30. Reg regno
  31. RegI regno off -
  32. Cond cond Fchain Tchain *)
  33. VAR pc*, varsize: LONGINT; (*program counter, data index*)
  34. tdx, strx: LONGINT;
  35. entry: LONGINT; (*main entry point*)
  36. RH: LONGINT; (*available registers R[0] ... R[H-1]*)
  37. frame: LONGINT; (*frame offset changed in SaveRegs and RestoreRegs*)
  38. fixorgP, fixorgD, fixorgT: LONGINT; (*origins of lists of locations to be fixed up by loader*)
  39. check: BOOLEAN; (*emit run-time checks*)
  40. version: INTEGER; (* 0 = RISC-0, 1 = RISC-5 *)
  41. relmap: ARRAY 6 OF INTEGER; (*condition codes for relations*)
  42. code: ARRAY maxCode OF LONGINT;
  43. data: ARRAY maxTD OF LONGINT; (*type descriptors*)
  44. str: ARRAY maxStrx OF CHAR;
  45. (*instruction assemblers according to formats*)
  46. PROCEDURE Put0(op, a, b, c: LONGINT);
  47. BEGIN (*emit format-0 instruction*)
  48. code[pc] := ((a*10H + b) * 10H + op) * 10000H + c; INC(pc)
  49. END Put0;
  50. PROCEDURE Put1(op, a, b, im: LONGINT);
  51. BEGIN (*emit format-1 instruction, -10000H <= im < 10000H*)
  52. IF im < 0 THEN INC(op, V) END ;
  53. code[pc] := (((a+40H) * 10H + b) * 10H + op) * 10000H + (im MOD 10000H); INC(pc)
  54. END Put1;
  55. PROCEDURE Put1a(op, a, b, im: LONGINT);
  56. BEGIN (*same as Put1, but with range test -10000H <= im < 10000H*)
  57. IF (im >= -10000H) & (im <= 0FFFFH) THEN Put1(op, a, b, im)
  58. ELSE Put1(Mov+U, RH, 0, im DIV 10000H);
  59. IF im MOD 10000H # 0 THEN Put1(Ior, RH, RH, im MOD 10000H) END ;
  60. Put0(op, a, b, RH)
  61. END
  62. END Put1a;
  63. PROCEDURE Put2(op, a, b, off: LONGINT);
  64. BEGIN (*emit load/store instruction*)
  65. code[pc] := ((op * 10H + a) * 10H + b) * 100000H + (off MOD 100000H); INC(pc)
  66. END Put2;
  67. PROCEDURE Put3(op, cond, off: LONGINT);
  68. BEGIN (*emit branch instruction*)
  69. code[pc] := ((op+12) * 10H + cond) * 1000000H + (off MOD 1000000H); INC(pc)
  70. END Put3;
  71. PROCEDURE incR;
  72. BEGIN
  73. IF RH < MT-1 THEN INC(RH) ELSE ORS.Mark("register stack overflow") END
  74. END incR;
  75. PROCEDURE CheckRegs*;
  76. BEGIN
  77. IF RH # 0 THEN ORS.Mark("Reg Stack"); RH := 0 END ;
  78. IF pc >= maxCode - 40 THEN ORS.Mark("program too long") END ;
  79. IF frame # 0 THEN ORS.Mark("frame error"); frame := 0 END
  80. END CheckRegs;
  81. PROCEDURE SetCC(VAR x: Item; n: LONGINT);
  82. BEGIN x.mode := Cond; x.a := 0; x.b := 0; x.r := n
  83. END SetCC;
  84. PROCEDURE Trap(cond, num: LONGINT);
  85. BEGIN Put3(BLR, cond, ORS.Pos()*100H + num*10H + MT)
  86. END Trap;
  87. (*handling of forward reference, fixups of branch addresses and constant tables*)
  88. PROCEDURE negated(cond: LONGINT): LONGINT;
  89. BEGIN
  90. IF cond < 8 THEN cond := cond+8 ELSE cond := cond-8 END ;
  91. RETURN cond
  92. END negated;
  93. PROCEDURE fix(at, with: LONGINT);
  94. BEGIN code[at] := code[at] DIV C24 * C24 + (with MOD C24)
  95. END fix;
  96. PROCEDURE FixOne*(at: LONGINT);
  97. BEGIN fix(at, pc-at-1)
  98. END FixOne;
  99. PROCEDURE FixLink*(L: LONGINT);
  100. VAR L1: LONGINT;
  101. BEGIN
  102. WHILE L # 0 DO L1 := code[L] MOD 40000H; fix(L, pc-L-1); L := L1 END
  103. END FixLink;
  104. PROCEDURE FixLinkWith(L0, dst: LONGINT);
  105. VAR L1: LONGINT;
  106. BEGIN
  107. WHILE L0 # 0 DO
  108. L1 := code[L0] MOD C24;
  109. code[L0] := code[L0] DIV C24 * C24 + ((dst - L0 - 1) MOD C24); L0 := L1
  110. END
  111. END FixLinkWith;
  112. PROCEDURE merged(L0, L1: LONGINT): LONGINT;
  113. VAR L2, L3: LONGINT;
  114. BEGIN
  115. IF L0 # 0 THEN L3 := L0;
  116. REPEAT L2 := L3; L3 := code[L2] MOD 40000H UNTIL L3 = 0;
  117. code[L2] := code[L2] + L1; L1 := L0
  118. END ;
  119. RETURN L1
  120. END merged;
  121. (* loading of operands and addresses into registers *)
  122. PROCEDURE GetSB(base: LONGINT);
  123. BEGIN
  124. IF version = 0 THEN Put1(Mov, RH, 0, VarOrg0)
  125. ELSE Put2(Ldr, RH, -base, pc-fixorgD); fixorgD := pc-1
  126. END
  127. END GetSB;
  128. PROCEDURE NilCheck;
  129. BEGIN IF check THEN Trap(EQ, 4) END
  130. END NilCheck;
  131. PROCEDURE load(VAR x: Item);
  132. VAR op: LONGINT;
  133. BEGIN
  134. IF x.type.size = 1 THEN op := Ldr+1 ELSE op := Ldr END ;
  135. IF x.mode # Reg THEN
  136. IF x.mode = ORB.Const THEN
  137. IF x.type.form = ORB.Proc THEN
  138. IF x.r > 0 THEN ORS.Mark("not allowed")
  139. ELSIF x.r = 0 THEN Put3(BL, 7, 0); Put1a(Sub, RH, LNK, pc*4 - x.a)
  140. ELSE GetSB(x.r); Put1(Add, RH, RH, x.a + 100H) (*mark as progbase-relative*)
  141. END
  142. ELSIF (x.a <= 0FFFFH) & (x.a >= -10000H) THEN Put1(Mov, RH, 0, x.a)
  143. ELSE Put1(Mov+U, RH, 0, x.a DIV 10000H MOD 10000H);
  144. IF x.a MOD 10000H # 0 THEN Put1(Ior, RH, RH, x.a MOD 10000H) END
  145. END ;
  146. x.r := RH; incR
  147. ELSIF x.mode = ORB.Var THEN
  148. IF x.r > 0 THEN (*local*) Put2(op, RH, SP, x.a + frame)
  149. ELSE GetSB(x.r); Put2(op, RH, RH, x.a)
  150. END ;
  151. x.r := RH; incR
  152. ELSIF x.mode = ORB.Par THEN Put2(Ldr, RH, SP, x.a + frame); Put2(op, RH, RH, x.b); x.r := RH; incR
  153. ELSIF x.mode = RegI THEN Put2(op, x.r, x.r, x.a)
  154. ELSIF x.mode = Cond THEN
  155. Put3(BC, negated(x.r), 2);
  156. FixLink(x.b); Put1(Mov, RH, 0, 1); Put3(BC, 7, 1);
  157. FixLink(x.a); Put1(Mov, RH, 0, 0); x.r := RH; incR
  158. END ;
  159. x.mode := Reg
  160. END
  161. END load;
  162. PROCEDURE loadAdr(VAR x: Item);
  163. BEGIN
  164. IF x.mode = ORB.Var THEN
  165. IF x.r > 0 THEN (*local*) Put1a(Add, RH, SP, x.a + frame)
  166. ELSE GetSB(x.r); Put1a(Add, RH, RH, x.a)
  167. END ;
  168. x.r := RH; incR
  169. ELSIF x.mode = ORB.Par THEN Put2(Ldr, RH, SP, x.a + frame);
  170. IF x.b # 0 THEN Put1a(Add, RH, RH, x.b) END ;
  171. x.r := RH; incR
  172. ELSIF x.mode = RegI THEN
  173. IF x.a # 0 THEN Put1a(Add, x.r, x.r, x.a) END
  174. ELSE ORS.Mark("address error")
  175. END ;
  176. x.mode := Reg
  177. END loadAdr;
  178. PROCEDURE loadCond(VAR x: Item);
  179. BEGIN
  180. IF x.type.form = ORB.Bool THEN
  181. IF x.mode = ORB.Const THEN x.r := 15 - x.a*8
  182. ELSE load(x);
  183. IF code[pc-1] DIV 40000000H # -2 THEN Put1(Cmp, x.r, x.r, 0) END ;
  184. x.r := NE; DEC(RH)
  185. END ;
  186. x.mode := Cond; x.a := 0; x.b := 0
  187. ELSE ORS.Mark("not Boolean?")
  188. END
  189. END loadCond;
  190. PROCEDURE loadTypTagAdr(T: ORB.Type);
  191. VAR x: Item;
  192. BEGIN x.mode := ORB.Var; x.a := T.len; x.r := -T.mno; loadAdr(x)
  193. END loadTypTagAdr;
  194. PROCEDURE loadStringAdr(VAR x: Item);
  195. BEGIN GetSB(0); Put1a(Add, RH, RH, varsize+x.a); x.mode := Reg; x.r := RH; incR
  196. END loadStringAdr;
  197. (* Items: Conversion from constants or from Objects on the Heap to Items on the Stack*)
  198. PROCEDURE MakeConstItem*(VAR x: Item; typ: ORB.Type; val: LONGINT);
  199. BEGIN x.mode := ORB.Const; x.type := typ; x.a := val
  200. END MakeConstItem;
  201. PROCEDURE MakeRealItem*(VAR x: Item; val: REAL);
  202. BEGIN x.mode := ORB.Const; x.type := ORB.realType; x.a := SYSTEM.VAL(LONGINT, val)
  203. END MakeRealItem;
  204. PROCEDURE MakeStringItem*(VAR x: Item; len: LONGINT); (*copies string from ORS-buffer to ORG-string array*)
  205. VAR i: LONGINT;
  206. BEGIN x.mode := ORB.Const; x.type := ORB.strType; x.a := strx; x.b := len; i := 0;
  207. IF strx + len + 4 < maxStrx THEN
  208. WHILE len > 0 DO str[strx] := ORS.str[i]; INC(strx); INC(i); DEC(len) END ;
  209. WHILE strx MOD 4 # 0 DO str[strx] := 0X; INC(strx) END
  210. ELSE ORS.Mark("too many strings")
  211. END
  212. END MakeStringItem;
  213. PROCEDURE MakeItem*(VAR x: Item; y: ORB.Object; curlev: LONGINT);
  214. BEGIN x.mode := y.class; x.type := y.type; x.a := y.val; x.rdo := y.rdo;
  215. IF y.class = ORB.Par THEN x.b := 0
  216. ELSIF (y.class = ORB.Const) & (y.type.form = ORB.String) THEN x.b := y.lev (*len*) ;
  217. ELSE x.r := y.lev
  218. END ;
  219. IF (y.lev > 0) & (y.lev # curlev) & (y.class # ORB.Const) THEN ORS.Mark("not accessible ") END
  220. END MakeItem;
  221. (* Code generation for Selectors, Variables, Constants *)
  222. PROCEDURE Field*(VAR x: Item; y: ORB.Object); (* x := x.y *)
  223. BEGIN;
  224. IF x.mode = ORB.Var THEN
  225. IF x.r >= 0 THEN x.a := x.a + y.val
  226. ELSE loadAdr(x); x.mode := RegI; x.a := y.val
  227. END
  228. ELSIF x.mode = RegI THEN x.a := x.a + y.val
  229. ELSIF x.mode = ORB.Par THEN x.b := x.b + y.val
  230. END
  231. END Field;
  232. PROCEDURE Index*(VAR x, y: Item); (* x := x[y] *)
  233. VAR s, lim: LONGINT;
  234. BEGIN s := x.type.base.size; lim := x.type.len;
  235. IF (y.mode = ORB.Const) & (lim >= 0) THEN
  236. IF (y.a < 0) OR (y.a >= lim) THEN ORS.Mark("bad index") END ;
  237. IF x.mode IN {ORB.Var, RegI} THEN x.a := y.a * s + x.a
  238. ELSIF x.mode = ORB.Par THEN x.b := y.a * s + x.b
  239. END
  240. ELSE load(y);
  241. IF check THEN (*check array bounds*)
  242. IF lim >= 0 THEN Put1a(Cmp, RH, y.r, lim)
  243. ELSE (*open array*)
  244. IF x.mode IN {ORB.Var, ORB.Par} THEN Put2(Ldr, RH, SP, x.a+4+frame); Put0(Cmp, RH, y.r, RH)
  245. ELSE ORS.Mark("error in Index")
  246. END
  247. END ;
  248. Trap(10, 1) (*BCC*)
  249. END ;
  250. IF s = 4 THEN Put1(Lsl, y.r, y.r, 2) ELSIF s > 1 THEN Put1a(Mul, y.r, y.r, s) END ;
  251. IF x.mode = ORB.Var THEN
  252. IF x.r > 0 THEN Put0(Add, y.r, SP, y.r); INC(x.a, frame)
  253. ELSE GetSB(x.r);
  254. IF x.r = 0 THEN Put0(Add, y.r, RH, y.r)
  255. ELSE Put1a(Add, RH, RH, x.a); Put0(Add, y.r, RH, y.r); x.a := 0
  256. END
  257. END ;
  258. x.r := y.r; x.mode := RegI
  259. ELSIF x.mode = ORB.Par THEN
  260. Put2(Ldr, RH, SP, x.a + frame);
  261. Put0(Add, y.r, RH, y.r); x.mode := RegI; x.r := y.r; x.a := x.b
  262. ELSIF x.mode = RegI THEN Put0(Add, x.r, x.r, y.r); DEC(RH)
  263. END
  264. END
  265. END Index;
  266. PROCEDURE DeRef*(VAR x: Item);
  267. BEGIN
  268. IF x.mode = ORB.Var THEN
  269. IF x.r > 0 THEN (*local*) Put2(Ldr, RH, SP, x.a + frame) ELSE GetSB(x.r); Put2(Ldr, RH, RH, x.a) END ;
  270. NilCheck; x.r := RH; incR
  271. ELSIF x.mode = ORB.Par THEN
  272. Put2(Ldr, RH, SP, x.a + frame); Put2(Ldr, RH, RH, x.b); NilCheck; x.r := RH; incR
  273. ELSIF x.mode = RegI THEN Put2(Ldr, x.r, x.r, x.a); NilCheck
  274. ELSIF x.mode # Reg THEN ORS.Mark("bad mode in DeRef")
  275. END ;
  276. x.mode := RegI; x.a := 0; x.b := 0
  277. END DeRef;
  278. PROCEDURE Q(T: ORB.Type; VAR dcw: LONGINT);
  279. BEGIN (*one entry of type descriptor extension table*)
  280. IF T.base # NIL THEN
  281. Q(T.base, dcw); data[dcw] := (T.mno*1000H + T.len) * 1000H + dcw - fixorgT;
  282. fixorgT := dcw; INC(dcw)
  283. END
  284. END Q;
  285. PROCEDURE FindPtrFlds(typ: ORB.Type; off: LONGINT; VAR dcw: LONGINT);
  286. VAR fld: ORB.Object; i, s: LONGINT;
  287. BEGIN
  288. IF (typ.form = ORB.Pointer) OR (typ.form = ORB.NilTyp) THEN data[dcw] := off; INC(dcw)
  289. ELSIF typ.form = ORB.Record THEN
  290. fld := typ.dsc;
  291. WHILE fld # NIL DO FindPtrFlds(fld.type, fld.val + off, dcw); fld := fld.next END
  292. ELSIF typ.form = ORB.Array THEN
  293. s := typ.base.size;
  294. FOR i := 0 TO typ.len-1 DO FindPtrFlds(typ.base, i*s + off, dcw) END
  295. END
  296. END FindPtrFlds;
  297. PROCEDURE BuildTD*(T: ORB.Type; VAR dc: LONGINT);
  298. VAR dcw, k, s: LONGINT; (*dcw = word address*)
  299. BEGIN dcw := dc DIV 4; s := T.size; (*convert size for heap allocation*)
  300. IF s <= 24 THEN s := 32 ELSIF s <= 56 THEN s := 64 ELSIF s <= 120 THEN s := 128
  301. ELSE s := (s+263) DIV 256 * 256
  302. END ;
  303. T.len := dc; data[dcw] := s; INC(dcw); (*len used as address*)
  304. k := T.nofpar; (*extension level!*)
  305. IF k > 3 THEN ORS.Mark("ext level too large")
  306. ELSE Q(T, dcw);
  307. WHILE k < 3 DO data[dcw] := -1; INC(dcw); INC(k) END
  308. END ;
  309. FindPtrFlds(T, 0, dcw); data[dcw] := -1; INC(dcw); tdx := dcw; dc := dcw*4;
  310. IF tdx >= maxTD THEN ORS.Mark("too many record types"); tdx := 0 END
  311. END BuildTD;
  312. PROCEDURE TypeTest*(VAR x: Item; T: ORB.Type; varpar, isguard: BOOLEAN);
  313. VAR pc0: LONGINT;
  314. BEGIN
  315. IF T = NIL THEN
  316. IF x.mode >= Reg THEN DEC(RH) END ;
  317. SetCC(x, 7)
  318. ELSE (*fetch tag into RH*)
  319. IF varpar THEN Put2(Ldr, RH, SP, x.a+4+frame)
  320. ELSE load(x);
  321. pc0 := pc; Put3(BC, EQ, 0); (*NIL belongs to every pointer type*)
  322. Put2(Ldr, RH, x.r, -8)
  323. END ;
  324. Put2(Ldr, RH, RH, T.nofpar*4); incR;
  325. loadTypTagAdr(T); (*tag of T*)
  326. Put0(Cmp, RH-1, RH-1, RH-2); DEC(RH, 2);
  327. IF ~varpar THEN fix(pc0, pc - pc0 - 1) END ;
  328. IF isguard THEN
  329. IF check THEN Trap(NE, 2) END
  330. ELSE SetCC(x, EQ);
  331. IF ~varpar THEN DEC(RH) END
  332. END
  333. END
  334. END TypeTest;
  335. (* Code generation for Boolean operators *)
  336. PROCEDURE Not*(VAR x: Item); (* x := ~x *)
  337. VAR t: LONGINT;
  338. BEGIN
  339. IF x.mode # Cond THEN loadCond(x) END ;
  340. x.r := negated(x.r); t := x.a; x.a := x.b; x.b := t
  341. END Not;
  342. PROCEDURE And1*(VAR x: Item); (* x := x & *)
  343. BEGIN
  344. IF x.mode # Cond THEN loadCond(x) END ;
  345. Put3(BC, negated(x.r), x.a); x.a := pc-1; FixLink(x.b); x.b := 0
  346. END And1;
  347. PROCEDURE And2*(VAR x, y: Item);
  348. BEGIN
  349. IF y.mode # Cond THEN loadCond(y) END ;
  350. x.a := merged(y.a, x.a); x.b := y.b; x.r := y.r
  351. END And2;
  352. PROCEDURE Or1*(VAR x: Item); (* x := x OR *)
  353. BEGIN
  354. IF x.mode # Cond THEN loadCond(x) END ;
  355. Put3(BC, x.r, x.b); x.b := pc-1; FixLink(x.a); x.a := 0
  356. END Or1;
  357. PROCEDURE Or2*(VAR x, y: Item);
  358. BEGIN
  359. IF y.mode # Cond THEN loadCond(y) END ;
  360. x.a := y.a; x.b := merged(y.b, x.b); x.r := y.r
  361. END Or2;
  362. (* Code generation for arithmetic operators *)
  363. PROCEDURE Neg*(VAR x: Item); (* x := -x *)
  364. BEGIN
  365. IF x.type.form = ORB.Int THEN
  366. IF x.mode = ORB.Const THEN x.a := -x.a
  367. ELSE load(x); Put1(Mov, RH, 0, 0); Put0(Sub, x.r, RH, x.r)
  368. END
  369. ELSIF x.type.form = ORB.Real THEN
  370. IF x.mode = ORB.Const THEN x.a := x.a + 7FFFFFFFH + 1
  371. ELSE load(x); Put1(Mov, RH, 0, 0); Put0(Fsb, x.r, RH, x.r)
  372. END
  373. ELSE (*form = Set*)
  374. IF x.mode = ORB.Const THEN x.a := -x.a-1
  375. ELSE load(x); Put1(Xor, x.r, x.r, -1)
  376. END
  377. END
  378. END Neg;
  379. PROCEDURE AddOp*(op: LONGINT; VAR x, y: Item); (* x := x +- y *)
  380. BEGIN
  381. IF op = ORS.plus THEN
  382. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN x.a := x.a + y.a
  383. ELSIF y.mode = ORB.Const THEN load(x);
  384. IF y.a # 0 THEN Put1a(Add, x.r, x.r, y.a) END
  385. ELSE load(x); load(y); Put0(Add, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  386. END
  387. ELSE (*op = ORS.minus*)
  388. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN x.a := x.a - y.a
  389. ELSIF y.mode = ORB.Const THEN load(x);
  390. IF y.a # 0 THEN Put1a(Sub, x.r, x.r, y.a) END
  391. ELSE load(x); load(y); Put0(Sub, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  392. END
  393. END
  394. END AddOp;
  395. PROCEDURE log2(m: LONGINT; VAR e: LONGINT): LONGINT;
  396. BEGIN e := 0;
  397. WHILE ~ODD(m) DO m := m DIV 2; INC(e) END ;
  398. RETURN m
  399. END log2;
  400. PROCEDURE MulOp*(VAR x, y: Item); (* x := x * y *)
  401. VAR e: LONGINT;
  402. BEGIN
  403. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN x.a := x.a * y.a
  404. ELSIF (y.mode = ORB.Const) & (y.a >= 2) & (log2(y.a, e) = 1) THEN load(x); Put1(Lsl, x.r, x.r, e)
  405. ELSIF y.mode = ORB.Const THEN load(x); Put1a(Mul, x.r, x.r, y.a)
  406. ELSIF (x.mode = ORB.Const) & (x.a >= 2) & (log2(x.a, e) = 1) THEN load(y); Put1(Lsl, y.r, y.r, e); x.mode := Reg; x.r := y.r
  407. ELSIF x.mode = ORB.Const THEN load(y); Put1a(Mul, y.r, y.r, x.a); x.mode := Reg; x.r := y.r
  408. ELSE load(x); load(y); Put0(Mul, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  409. END
  410. END MulOp;
  411. PROCEDURE DivOp*(op: LONGINT; VAR x, y: Item); (* x := x op y *)
  412. VAR e: LONGINT;
  413. BEGIN
  414. IF op = ORS.div THEN
  415. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN
  416. IF y.a > 0 THEN x.a := x.a DIV y.a ELSE ORS.Mark("bad divisor") END
  417. ELSIF (y.mode = ORB.Const) & (y.a >= 2) & (log2(y.a, e) = 1) THEN load(x); Put1(Asr, x.r, x.r, e)
  418. ELSIF y.mode = ORB.Const THEN
  419. IF y.a > 0 THEN load(x); Put1a(Div, x.r, x.r, y.a) ELSE ORS.Mark("bad divisor") END
  420. ELSE load(y);
  421. IF check THEN Trap(LE, 6) END ;
  422. load(x); Put0(Div, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  423. END
  424. ELSE (*op = ORS.mod*)
  425. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN
  426. IF y.a > 0 THEN x.a := x.a MOD y.a ELSE ORS.Mark("bad modulus") END
  427. ELSIF (y.mode = ORB.Const) & (y.a >= 2) & (log2(y.a, e) = 1) THEN load(x);
  428. IF e <= 16 THEN Put1(And, x.r, x.r, y.a-1) ELSE Put1(Lsl, x.r, x.r, 32-e); Put1(Ror, x.r, x.r, 32-e) END
  429. ELSIF y.mode = ORB.Const THEN
  430. IF y.a > 0 THEN load(x); Put1a(Div, x.r, x.r, y.a); Put0(Mov+U, x.r, 0, 0) ELSE ORS.Mark("bad modulus") END
  431. ELSE load(y);
  432. IF check THEN Trap(LE, 6) END ;
  433. load(x); Put0(Div, RH-2, x.r, y.r); Put0(Mov+U, RH-2, 0, 0); DEC(RH); x.r := RH-1
  434. END
  435. END
  436. END DivOp;
  437. (* Code generation for REAL operators *)
  438. PROCEDURE RealOp*(op: INTEGER; VAR x, y: Item); (* x := x op y *)
  439. BEGIN load(x); load(y);
  440. IF op = ORS.plus THEN Put0(Fad, RH-2, x.r, y.r)
  441. ELSIF op = ORS.minus THEN Put0(Fsb, RH-2, x.r, y.r)
  442. ELSIF op = ORS.times THEN Put0(Fml, RH-2, x.r, y.r)
  443. ELSIF op = ORS.rdiv THEN Put0(Fdv, RH-2, x.r, y.r)
  444. END ;
  445. DEC(RH); x.r := RH-1
  446. END RealOp;
  447. (* Code generation for set operators *)
  448. PROCEDURE Singleton*(VAR x: Item); (* x := {x} *)
  449. BEGIN
  450. IF x.mode = ORB.Const THEN x.a := LSL(1, x.a)
  451. ELSE load(x); Put1(Mov, RH, 0, 1); Put0(Lsl, x.r, RH, x.r)
  452. END
  453. END Singleton;
  454. PROCEDURE Set*(VAR x, y: Item); (* x := {x .. y} *)
  455. BEGIN
  456. IF (x.mode = ORB.Const) & ( y.mode = ORB.Const) THEN
  457. IF x.a <= y.a THEN x.a := LSL(2, y.a) - LSL(1, x.a) ELSE x.a := 0 END
  458. ELSE
  459. IF (x.mode = ORB.Const) & (x.a <= 16) THEN x.a := LSL(-1, x.a)
  460. ELSE load(x); Put1(Mov, RH, 0, -1); Put0(Lsl, x.r, RH, x.r)
  461. END ;
  462. IF (y.mode = ORB.Const) & (y.a < 16) THEN Put1(Mov, RH, 0, LSL(-2, y.a)); y.mode := Reg; y.r := RH; incR
  463. ELSE load(y); Put1(Mov, RH, 0, -2); Put0(Lsl, y.r, RH, y.r)
  464. END ;
  465. IF x.mode = ORB.Const THEN
  466. IF x.a # 0 THEN Put1(Xor, y.r, y.r, -1); Put1a(And, RH-1, y.r, x.a) END ;
  467. x.mode := Reg; x.r := RH-1
  468. ELSE DEC(RH); Put0(Ann, RH-1, x.r, y.r)
  469. END
  470. END
  471. END Set;
  472. PROCEDURE In*(VAR x, y: Item); (* x := x IN y *)
  473. BEGIN load(y);
  474. IF x.mode = ORB.Const THEN Put1(Ror, y.r, y.r, (x.a + 1) MOD 20H); DEC(RH)
  475. ELSE load(x); Put1(Add, x.r, x.r, 1); Put0(Ror, y.r, y.r, x.r); DEC(RH, 2)
  476. END ;
  477. SetCC(x, MI)
  478. END In;
  479. PROCEDURE SetOp*(op: LONGINT; VAR x, y: Item); (* x := x op y *)
  480. VAR xset, yset: SET; (*x.type.form = Set*)
  481. BEGIN
  482. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN
  483. xset := SYSTEM.VAL(SET, x.a); yset := SYSTEM.VAL(SET, y.a);
  484. IF op = ORS.plus THEN xset := xset + yset
  485. ELSIF op = ORS.minus THEN xset := xset - yset
  486. ELSIF op = ORS.times THEN xset := xset * yset
  487. ELSIF op = ORS.rdiv THEN xset := xset / yset
  488. END ;
  489. x.a := SYSTEM.VAL(LONGINT, xset)
  490. ELSIF y.mode = ORB.Const THEN
  491. load(x);
  492. IF op = ORS.plus THEN Put1a(Ior, x.r, x.r, y.a)
  493. ELSIF op = ORS.minus THEN Put1a(Ann, x.r, x.r, y.a)
  494. ELSIF op = ORS.times THEN Put1a(And, x.r, x.r, y.a)
  495. ELSIF op = ORS.rdiv THEN Put1a(Xor, x.r, x.r, y.a)
  496. END ;
  497. ELSE load(x); load(y);
  498. IF op = ORS.plus THEN Put0(Ior, RH-2, x.r, y.r)
  499. ELSIF op = ORS.minus THEN Put0(Ann, RH-2, x.r, y.r)
  500. ELSIF op = ORS.times THEN Put0(And, RH-2, x.r, y.r)
  501. ELSIF op = ORS.rdiv THEN Put0(Xor, RH-2, x.r, y.r)
  502. END ;
  503. DEC(RH); x.r := RH-1
  504. END
  505. END SetOp;
  506. (* Code generation for relations *)
  507. PROCEDURE IntRelation*(op: INTEGER; VAR x, y: Item); (* x := x < y *)
  508. BEGIN
  509. IF (y.mode = ORB.Const) & (y.type.form # ORB.Proc) THEN
  510. load(x);
  511. IF (y.a # 0) OR ~(op IN {ORS.eql, ORS.neq}) OR (code[pc-1] DIV 40000000H # -2) THEN Put1a(Cmp, x.r, x.r, y.a) END ;
  512. DEC(RH)
  513. ELSE
  514. IF (x.mode = Cond) OR (y.mode = Cond) THEN ORS.Mark("not implemented") END ;
  515. load(x); load(y); Put0(Cmp, x.r, x.r, y.r); DEC(RH, 2)
  516. END ;
  517. SetCC(x, relmap[op - ORS.eql])
  518. END IntRelation;
  519. PROCEDURE RealRelation*(op: INTEGER; VAR x, y: Item); (* x := x < y *)
  520. BEGIN load(x);
  521. IF (y.mode = ORB.Const) & (y.a = 0) THEN DEC(RH)
  522. ELSE load(y); Put0(Fsb, x.r, x.r, y.r); DEC(RH, 2)
  523. END ;
  524. SetCC(x, relmap[op - ORS.eql])
  525. END RealRelation;
  526. PROCEDURE StringRelation*(op: INTEGER; VAR x, y: Item); (* x := x < y *)
  527. (*x, y are char arrays or strings*)
  528. BEGIN
  529. IF x.type.form = ORB.String THEN loadStringAdr(x) ELSE loadAdr(x) END ;
  530. IF y.type.form = ORB.String THEN loadStringAdr(y) ELSE loadAdr(y) END ;
  531. Put2(Ldr+1, RH, x.r, 0); Put1(Add, x.r, x.r, 1);
  532. Put2(Ldr+1, RH+1, y.r, 0); Put1(Add, y.r, y.r, 1);
  533. Put0(Cmp, RH+2, RH, RH+1); Put3(BC, NE, 2);
  534. Put1(Cmp, RH+2, RH, 0); Put3(BC, NE, -8);
  535. DEC(RH, 2); SetCC(x, relmap[op - ORS.eql])
  536. END StringRelation;
  537. (* Code generation of Assignments *)
  538. PROCEDURE StrToChar*(VAR x: Item);
  539. BEGIN x.type := ORB.charType; DEC(strx, 4); x.a := ORD(str[x.a])
  540. END StrToChar;
  541. PROCEDURE Store*(VAR x, y: Item); (* x := y *)
  542. VAR op: LONGINT;
  543. BEGIN load(y);
  544. IF x.type.size = 1 THEN op := Str+1 ELSE op := Str END ;
  545. IF x.mode = ORB.Var THEN
  546. IF x.r > 0 THEN (*local*) Put2(op, y.r, SP, x.a + frame)
  547. ELSE GetSB(x.r); Put2(op, y.r, RH, x.a)
  548. END
  549. ELSIF x.mode = ORB.Par THEN Put2(Ldr, RH, SP, x.a + frame); Put2(op, y.r, RH, x.b);
  550. ELSIF x.mode = RegI THEN Put2(op, y.r, x.r, x.a); DEC(RH);
  551. ELSE ORS.Mark("bad mode in Store")
  552. END ;
  553. DEC(RH)
  554. END Store;
  555. PROCEDURE StoreStruct*(VAR x, y: Item); (* x := y, frame = 0 *)
  556. VAR s, pc0: LONGINT;
  557. BEGIN
  558. IF y.type.size # 0 THEN
  559. loadAdr(x); loadAdr(y);
  560. IF (x.type.form = ORB.Array) & (x.type.len > 0) THEN
  561. IF y.type.len >= 0 THEN
  562. IF x.type.size = y.type.size THEN Put1a(Mov, RH, 0, (y.type.size+3) DIV 4)
  563. ELSE ORS.Mark("different length/size, not implemented")
  564. END
  565. ELSE (*y open array*) Put2(Ldr, RH, SP, y.a+4); s := y.type.base.size; (*element size*)
  566. pc0 := pc; Put3(BC, EQ, 0);
  567. IF s = 1 THEN Put1(Add, RH, RH, 3); Put1(Asr, RH, RH, 2)
  568. ELSIF s # 4 THEN Put1a(Mul, RH, RH, s DIV 4)
  569. END ;
  570. IF check THEN
  571. Put1a(Mov, RH+1, 0, (x.type.size+3) DIV 4); Put0(Cmp, RH+1, RH, RH+1); Trap(GT, 3)
  572. END ;
  573. fix(pc0, pc + 5 - pc0)
  574. END
  575. ELSIF x.type.form = ORB.Record THEN Put1a(Mov, RH, 0, x.type.size DIV 4)
  576. ELSE ORS.Mark("inadmissible assignment")
  577. END ;
  578. Put2(Ldr, RH+1, y.r, 0); Put1(Add, y.r, y.r, 4);
  579. Put2(Str, RH+1, x.r, 0); Put1(Add, x.r, x.r, 4);
  580. Put1(Sub, RH, RH, 1); Put3(BC, NE, -6)
  581. END ;
  582. RH := 0
  583. END StoreStruct;
  584. PROCEDURE CopyString*(VAR x, y: Item); (* x := y *)
  585. VAR len: LONGINT;
  586. BEGIN loadAdr(x); len := x.type.len;
  587. IF len >= 0 THEN
  588. IF len < y.b THEN ORS.Mark("string too long") END
  589. ELSIF check THEN Put2(Ldr, RH, SP, x.a+4); (*open array len, frame = 0*)
  590. Put1(Cmp,RH, RH, y.b); Trap(LT, 3)
  591. END ;
  592. loadStringAdr(y);
  593. Put2(Ldr, RH, y.r, 0); Put1(Add, y.r, y.r, 4);
  594. Put2(Str, RH, x.r, 0); Put1(Add, x.r, x.r, 4);
  595. Put1(Asr, RH, RH, 24); Put3(BC, NE, -6); RH := 0
  596. END CopyString;
  597. (* Code generation for parameters *)
  598. PROCEDURE OpenArrayParam*(VAR x: Item);
  599. BEGIN loadAdr(x);
  600. IF x.type.len >= 0 THEN Put1a(Mov, RH, 0, x.type.len) ELSE Put2(Ldr, RH, SP, x.a+4+frame) END ;
  601. incR
  602. END OpenArrayParam;
  603. PROCEDURE VarParam*(VAR x: Item; ftype: ORB.Type);
  604. VAR xmd: INTEGER;
  605. BEGIN xmd := x.mode; loadAdr(x);
  606. IF (ftype.form = ORB.Array) & (ftype.len < 0) THEN (*open array*)
  607. IF x.type.len >= 0 THEN Put1a(Mov, RH, 0, x.type.len) ELSE Put2(Ldr, RH, SP, x.a+4+frame) END ;
  608. incR
  609. ELSIF ftype.form = ORB.Record THEN
  610. IF xmd = ORB.Par THEN Put2(Ldr, RH, SP, x.a+4+frame); incR ELSE loadTypTagAdr(x.type) END
  611. END
  612. END VarParam;
  613. PROCEDURE ValueParam*(VAR x: Item);
  614. BEGIN load(x)
  615. END ValueParam;
  616. PROCEDURE StringParam*(VAR x: Item);
  617. BEGIN loadStringAdr(x); Put1(Mov, RH, 0, x.b); incR (*len*)
  618. END StringParam;
  619. (*For Statements*)
  620. PROCEDURE For0*(VAR x, y: Item);
  621. BEGIN load(y)
  622. END For0;
  623. PROCEDURE For1*(VAR x, y, z, w: Item; VAR L: LONGINT);
  624. BEGIN
  625. IF z.mode = ORB.Const THEN Put1a(Cmp, RH, y.r, z.a)
  626. ELSE load(z); Put0(Cmp, RH-1, y.r, z.r); DEC(RH)
  627. END ;
  628. L := pc;
  629. IF w.a > 0 THEN Put3(BC, GT, 0)
  630. ELSIF w.a < 0 THEN Put3(BC, LT, 0)
  631. ELSE ORS.Mark("zero increment"); Put3(BC, MI, 0)
  632. END ;
  633. Store(x, y)
  634. END For1;
  635. PROCEDURE For2*(VAR x, y, w: Item);
  636. BEGIN load(x); DEC(RH); Put1a(Add, x.r, x.r, w.a)
  637. END For2;
  638. (* Branches, procedure calls, procedure prolog and epilog *)
  639. PROCEDURE Here*(): LONGINT;
  640. BEGIN RETURN pc
  641. END Here;
  642. PROCEDURE FJump*(VAR L: LONGINT);
  643. BEGIN Put3(BC, 7, L); L := pc-1
  644. END FJump;
  645. PROCEDURE CFJump*(VAR x: Item);
  646. BEGIN
  647. IF x.mode # Cond THEN loadCond(x) END ;
  648. Put3(BC, negated(x.r), x.a); FixLink(x.b); x.a := pc-1
  649. END CFJump;
  650. PROCEDURE BJump*(L: LONGINT);
  651. BEGIN Put3(BC, 7, L-pc-1)
  652. END BJump;
  653. PROCEDURE CBJump*(VAR x: Item; L: LONGINT);
  654. BEGIN
  655. IF x.mode # Cond THEN loadCond(x) END ;
  656. Put3(BC, negated(x.r), L-pc-1); FixLink(x.b); FixLinkWith(x.a, L)
  657. END CBJump;
  658. PROCEDURE Fixup*(VAR x: Item);
  659. BEGIN FixLink(x.a)
  660. END Fixup;
  661. PROCEDURE SaveRegs(r: LONGINT); (* R[0 .. r-1]*)
  662. VAR r0: LONGINT;
  663. BEGIN (*r > 0*) r0 := 0;
  664. Put1(Sub, SP, SP, r*4); INC(frame, 4*r);
  665. REPEAT Put2(Str, r0, SP, (r-r0-1)*4); INC(r0) UNTIL r0 = r
  666. END SaveRegs;
  667. PROCEDURE RestoreRegs(r: LONGINT); (*R[0 .. r-1]*)
  668. VAR r0: LONGINT;
  669. BEGIN (*r > 0*) r0 := r;
  670. REPEAT DEC(r0); Put2(Ldr, r0, SP, (r-r0-1)*4) UNTIL r0 = 0;
  671. Put1(Add, SP, SP, r*4); DEC(frame, 4*r)
  672. END RestoreRegs;
  673. PROCEDURE PrepCall*(VAR x: Item; VAR r: LONGINT);
  674. BEGIN (*x.type.form = ORB.Proc*)
  675. IF x.mode > ORB.Par THEN load(x) END ;
  676. r := RH;
  677. IF RH > 0 THEN SaveRegs(RH); RH := 0 END
  678. END PrepCall;
  679. PROCEDURE Call*(VAR x: Item; r: LONGINT);
  680. BEGIN (*x.type.form = ORB.Proc*)
  681. IF x.mode = ORB.Const THEN
  682. IF x.r >= 0 THEN Put3(BL, 7, (x.a DIV 4)-pc-1)
  683. ELSE (*imported*)
  684. IF pc - fixorgP < 1000H THEN
  685. Put3(BL, 7, ((-x.r) * 100H + x.a) * 1000H + pc-fixorgP); fixorgP := pc-1
  686. ELSE ORS.Mark("fixup impossible")
  687. END
  688. END
  689. ELSE
  690. IF x.mode <= ORB.Par THEN load(x); DEC(RH)
  691. ELSE Put2(Ldr, RH, SP, 0); Put1(Add, SP, SP, 4); DEC(r); DEC(frame, 4)
  692. END ;
  693. IF check THEN Trap(EQ, 5) END ;
  694. Put3(BLR, 7, RH)
  695. END ;
  696. IF x.type.base.form = ORB.NoTyp THEN (*procedure*) RH := 0
  697. ELSE (*function*)
  698. IF r > 0 THEN Put0(Mov, r, 0, 0); RestoreRegs(r) END ;
  699. x.mode := Reg; x.r := r; RH := r+1
  700. END
  701. END Call;
  702. PROCEDURE Enter*(parblksize, locblksize: LONGINT; int: BOOLEAN);
  703. VAR a, r: LONGINT;
  704. BEGIN frame := 0;
  705. IF ~int THEN (*procedure prolog*)
  706. IF locblksize >= 10000H THEN ORS.Mark("too many locals") END ;
  707. a := 4; r := 0;
  708. Put1(Sub, SP, SP, locblksize); Put2(Str, LNK, SP, 0);
  709. WHILE a < parblksize DO Put2(Str, r, SP, a); INC(r); INC(a, 4) END
  710. ELSE (*interrupt procedure*)
  711. Put1(Sub, SP, SP, locblksize); Put2(Str, 0, SP, 0); Put2(Str, 1, SP, 4); Put2(Str, 2, SP, 8)
  712. (*R0, R1, R2 saved on stack*)
  713. END
  714. END Enter;
  715. PROCEDURE Return*(form: INTEGER; VAR x: Item; size: LONGINT; int: BOOLEAN);
  716. BEGIN
  717. IF form # ORB.NoTyp THEN load(x) END ;
  718. IF ~int THEN (*procedure epilog*)
  719. Put2(Ldr, LNK, SP, 0); Put1(Add, SP, SP, size); Put3(BR, 7, LNK)
  720. ELSE (*interrupt return, restore R2, R1, R0*)
  721. Put2(Ldr, 2, SP, 8); Put2(Ldr, 1, SP, 4); Put2(Ldr, 0, SP, 0); Put1(Add, SP, SP, size);
  722. Put3(BR, 7, 10H) (*RTI*)
  723. END ;
  724. RH := 0
  725. END Return;
  726. (* In-line code procedures*)
  727. PROCEDURE Increment*(upordown: LONGINT; VAR x, y: Item);
  728. VAR op, zr, v: LONGINT;
  729. BEGIN (*frame = 0*)
  730. IF upordown = 0 THEN op := Add ELSE op := Sub END ;
  731. IF x.type = ORB.byteType THEN v := 1 ELSE v := 0 END ;
  732. IF y.type.form = ORB.NoTyp THEN y.mode := ORB.Const; y.a := 1 END ;
  733. IF (x.mode = ORB.Var) & (x.r > 0) THEN
  734. zr := RH; Put2(Ldr+v, zr, SP, x.a); incR;
  735. IF y.mode = ORB.Const THEN Put1a(op, zr, zr, y.a) ELSE load(y); Put0(op, zr, zr, y.r); DEC(RH) END ;
  736. Put2(Str+v, zr, SP, x.a); DEC(RH)
  737. ELSE loadAdr(x); zr := RH; Put2(Ldr+v, RH, x.r, 0); incR;
  738. IF y.mode = ORB.Const THEN Put1a(op, zr, zr, y.a) ELSE load(y); Put0(op, zr, zr, y.r); DEC(RH) END ;
  739. Put2(Str+v, zr, x.r, 0); DEC(RH, 2)
  740. END
  741. END Increment;
  742. PROCEDURE Include*(inorex: LONGINT; VAR x, y: Item);
  743. VAR op, zr: LONGINT;
  744. BEGIN loadAdr(x); zr := RH; Put2(Ldr, RH, x.r, 0); incR;
  745. IF inorex = 0 THEN op := Ior ELSE op := Ann END ;
  746. IF y.mode = ORB.Const THEN Put1a(op, zr, zr, LSL(1, y.a))
  747. ELSE load(y); Put1(Mov, RH, 0, 1); Put0(Lsl, y.r, RH, y.r); Put0(op, zr, zr, y.r); DEC(RH)
  748. END ;
  749. Put2(Str, zr, x.r, 0); DEC(RH, 2)
  750. END Include;
  751. PROCEDURE Assert*(VAR x: Item);
  752. VAR cond: LONGINT;
  753. BEGIN
  754. IF x.mode # Cond THEN loadCond(x) END ;
  755. IF x.a = 0 THEN cond := negated(x.r)
  756. ELSE Put3(BC, x.r, x.b); FixLink(x.a); x.b := pc-1; cond := 7
  757. END ;
  758. Trap(cond, 7); FixLink(x.b)
  759. END Assert;
  760. PROCEDURE New*(VAR x: Item);
  761. BEGIN loadAdr(x); loadTypTagAdr(x.type.base); Trap(7, 0); RH := 0
  762. END New;
  763. PROCEDURE Pack*(VAR x, y: Item);
  764. VAR z: Item;
  765. BEGIN z := x; load(x); load(y);
  766. Put1(Lsl, y.r, y.r, 23); Put0(Add, x.r, x.r, y.r); DEC(RH); Store(z, x)
  767. END Pack;
  768. PROCEDURE Unpk*(VAR x, y: Item);
  769. VAR z, e0: Item;
  770. BEGIN z := x; load(x); e0.mode := Reg; e0.r := RH; e0.type := ORB.intType;
  771. Put1(Asr, RH, x.r, 23); Put1(Sub, RH, RH, 127); Store(y, e0); incR;
  772. Put1(Lsl, RH, RH, 23); Put0(Sub, x.r, x.r, RH); Store(z, x)
  773. END Unpk;
  774. PROCEDURE Led*(VAR x: Item);
  775. BEGIN load(x); Put1(Mov, RH, 0, -60); Put2(Str, x.r, RH, 0); DEC(RH)
  776. END Led;
  777. PROCEDURE Get*(VAR x, y: Item);
  778. BEGIN load(x); x.type := y.type; x.mode := RegI; x.a := 0; Store(y, x)
  779. END Get;
  780. PROCEDURE Put*(VAR x, y: Item);
  781. BEGIN load(x); x.type := y.type; x.mode := RegI; x.a := 0; Store(x, y)
  782. END Put;
  783. PROCEDURE Copy*(VAR x, y, z: Item);
  784. BEGIN load(x); load(y);
  785. IF z.mode = ORB.Const THEN
  786. IF z.a > 0 THEN load(z) ELSE ORS.Mark("bad count") END
  787. ELSE load(z);
  788. IF check THEN Trap(LT, 3) END ;
  789. Put3(BC, EQ, 6)
  790. END ;
  791. Put2(Ldr, RH, x.r, 0); Put1(Add, x.r, x.r, 4);
  792. Put2(Str, RH, y.r, 0); Put1(Add, y.r, y.r, 4);
  793. Put1(Sub, z.r, z.r, 1); Put3(BC, NE, -6); DEC(RH, 3)
  794. END Copy;
  795. PROCEDURE LDPSR*(VAR x: Item);
  796. BEGIN (*x.mode = Const*) Put3(0, 15, x.a + 20H)
  797. END LDPSR;
  798. PROCEDURE LDREG*(VAR x, y: Item);
  799. BEGIN
  800. IF y.mode = ORB.Const THEN Put1a(Mov, x.a, 0, y.a)
  801. ELSE load(y); Put0(Mov, x.a, 0, y.r); DEC(RH)
  802. END
  803. END LDREG;
  804. (*In-line code functions*)
  805. PROCEDURE Abs*(VAR x: Item);
  806. BEGIN
  807. IF x.mode = ORB.Const THEN x.a := ABS(x.a)
  808. ELSE load(x);
  809. IF x.type.form = ORB.Real THEN Put1(Lsl, x.r, x.r, 1); Put1(Ror, x.r, x.r, 1)
  810. ELSE Put1(Cmp, x.r, x.r, 0); Put3(BC, GE, 2); Put1(Mov, RH, 0, 0); Put0(Sub, x.r, RH, x.r)
  811. END
  812. END
  813. END Abs;
  814. PROCEDURE Odd*(VAR x: Item);
  815. BEGIN load(x); Put1(And, x.r, x.r, 1); SetCC(x, NE); DEC(RH)
  816. END Odd;
  817. PROCEDURE Floor*(VAR x: Item);
  818. BEGIN load(x); Put1(Mov+U, RH, 0, 4B00H); Put0(Fad+V, x.r, x.r, RH)
  819. END Floor;
  820. PROCEDURE Float*(VAR x: Item);
  821. BEGIN load(x); Put1(Mov+U, RH, 0, 4B00H); Put0(Fad+U, x.r, x.r, RH)
  822. END Float;
  823. PROCEDURE Ord*(VAR x: Item);
  824. BEGIN
  825. IF x.mode IN {ORB.Var, ORB.Par, RegI, Cond} THEN load(x) END
  826. END Ord;
  827. PROCEDURE Len*(VAR x: Item);
  828. BEGIN
  829. IF x.type.len >= 0 THEN
  830. IF x.mode = RegI THEN DEC(RH) END ;
  831. x.mode := ORB.Const; x.a := x.type.len
  832. ELSE (*open array*) Put2(Ldr, RH, SP, x.a + 4 + frame); x.mode := Reg; x.r := RH; incR
  833. END
  834. END Len;
  835. PROCEDURE Shift*(fct: LONGINT; VAR x, y: Item);
  836. VAR op: LONGINT;
  837. BEGIN load(x);
  838. IF fct = 0 THEN op := Lsl ELSIF fct = 1 THEN op := Asr ELSE op := Ror END ;
  839. IF y.mode = ORB.Const THEN Put1(op, x.r, x.r, y.a MOD 20H)
  840. ELSE load(y); Put0(op, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  841. END
  842. END Shift;
  843. PROCEDURE ADC*(VAR x, y: Item);
  844. BEGIN load(x); load(y); Put0(Add+2000H, x.r, x.r, y.r); DEC(RH)
  845. END ADC;
  846. PROCEDURE SBC*(VAR x, y: Item);
  847. BEGIN load(x); load(y); Put0(Sub+2000H, x.r, x.r, y.r); DEC(RH)
  848. END SBC;
  849. PROCEDURE UML*(VAR x, y: Item);
  850. BEGIN load(x); load(y); Put0(Mul+2000H, x.r, x.r, y.r); DEC(RH)
  851. END UML;
  852. PROCEDURE Bit*(VAR x, y: Item);
  853. BEGIN load(x); Put2(Ldr, x.r, x.r, 0);
  854. IF y.mode = ORB.Const THEN Put1(Ror, x.r, x.r, y.a+1); DEC(RH)
  855. ELSE load(y); Put1(Add, y.r, y.r, 1); Put0(Ror, x.r, x.r, y.r); DEC(RH, 2)
  856. END ;
  857. SetCC(x, MI)
  858. END Bit;
  859. PROCEDURE Register*(VAR x: Item);
  860. BEGIN (*x.mode = Const*)
  861. Put0(Mov, RH, 0, x.a MOD 10H); x.mode := Reg; x.r := RH; incR
  862. END Register;
  863. PROCEDURE H*(VAR x: Item);
  864. BEGIN (*x.mode = Const*)
  865. Put0(Mov + U + x.a MOD 2 * V, RH, 0, 0); x.mode := Reg; x.r := RH; incR
  866. END H;
  867. PROCEDURE Adr*(VAR x: Item);
  868. BEGIN
  869. IF x.mode IN {ORB.Var, ORB.Par, RegI} THEN loadAdr(x)
  870. ELSIF (x.mode = ORB.Const) & (x.type.form = ORB.Proc) THEN load(x)
  871. ELSIF (x.mode = ORB.Const) & (x.type.form = ORB.String) THEN loadStringAdr(x)
  872. ELSE ORS.Mark("not addressable")
  873. END
  874. END Adr;
  875. PROCEDURE Condition*(VAR x: Item);
  876. BEGIN (*x.mode = Const*) SetCC(x, x.a)
  877. END Condition;
  878. PROCEDURE Open*(v: INTEGER);
  879. BEGIN pc := 0; tdx := 0; strx := 0; RH := 0; fixorgP := 0; fixorgD := 0; fixorgT := 0; check := v # 0; version := v;
  880. IF v = 0 THEN pc := 1;
  881. REPEAT code[pc] := 0; INC(pc) UNTIL pc = 8
  882. END
  883. END Open;
  884. PROCEDURE SetDataSize*(dc: LONGINT);
  885. BEGIN varsize := dc
  886. END SetDataSize;
  887. PROCEDURE Header*;
  888. BEGIN entry := pc*4;
  889. IF version = 0 THEN code[0] := 0E7000000H-1 + pc; Put1a(Mov, SP, 0, StkOrg0) (*RISC-0*)
  890. ELSE Put1(Sub, SP, SP, 4); Put2(Str, LNK, SP, 0)
  891. END
  892. END Header;
  893. PROCEDURE NofPtrs(typ: ORB.Type): LONGINT;
  894. VAR fld: ORB.Object; n: LONGINT;
  895. BEGIN
  896. IF (typ.form = ORB.Pointer) OR (typ.form = ORB.NilTyp) THEN n := 1
  897. ELSIF typ.form = ORB.Record THEN
  898. fld := typ.dsc; n := 0;
  899. WHILE fld # NIL DO n := NofPtrs(fld.type) + n; fld := fld.next END
  900. ELSIF typ.form = ORB.Array THEN n := NofPtrs(typ.base) * typ.len
  901. ELSE n := 0
  902. END ;
  903. RETURN n
  904. END NofPtrs;
  905. PROCEDURE FindPtrs(VAR R: Files.Rider; typ: ORB.Type; adr: LONGINT);
  906. VAR fld: ORB.Object; i, s: LONGINT;
  907. BEGIN
  908. IF (typ.form = ORB.Pointer) OR (typ.form = ORB.NilTyp) THEN Files.WriteInt(R, adr)
  909. ELSIF typ.form = ORB.Record THEN
  910. fld := typ.dsc;
  911. WHILE fld # NIL DO FindPtrs(R, fld.type, fld.val + adr); fld := fld.next END
  912. ELSIF typ.form = ORB.Array THEN
  913. s := typ.base.size;
  914. FOR i := 0 TO typ.len-1 DO FindPtrs(R, typ.base, i*s + adr) END
  915. END
  916. END FindPtrs;
  917. PROCEDURE Close*(VAR modid: ORS.Ident; key, nofent: LONGINT);
  918. VAR obj: ORB.Object;
  919. i, comsize, nofimps, nofptrs, size: LONGINT;
  920. name: ORS.Ident;
  921. F: Files.File; R: Files.Rider;
  922. BEGIN (*exit code*)
  923. IF version = 0 THEN Put1(Mov, 0, 0, 0); Put3(BR, 7, 0) (*RISC-0*)
  924. ELSE Put2(Ldr, LNK, SP, 0); Put1(Add, SP, SP, 4); Put3(BR, 7, LNK)
  925. END ;
  926. obj := ORB.topScope.next; nofimps := 0; comsize := 4; nofptrs := 0;
  927. WHILE obj # NIL DO
  928. IF (obj.class = ORB.Mod) & (obj.dsc # ORB.system) THEN INC(nofimps) (*count imports*)
  929. ELSIF (obj.exno # 0) & (obj.class = ORB.Const) & (obj.type.form = ORB.Proc)
  930. & (obj.type.nofpar = 0) & (obj.type.base = ORB.noType) THEN i := 0; (*count commands*)
  931. WHILE obj.name[i] # 0X DO INC(i) END ;
  932. i := (i+4) DIV 4 * 4; INC(comsize, i+4)
  933. ELSIF obj.class = ORB.Var THEN INC(nofptrs, NofPtrs(obj.type)) (*count pointers*)
  934. END ;
  935. obj := obj.next
  936. END ;
  937. size := varsize + strx + comsize + (pc + nofimps + nofent + nofptrs + 1)*4; (*varsize includes type descriptors*)
  938. ORB.MakeFileName(name, modid, ".rsc"); (*write code file*)
  939. F := Files.New(name); Files.Set(R, F, 0); Files.WriteString(R, modid); Files.WriteInt(R, key); Files.Write(R, CHR(version));
  940. Files.WriteInt(R, size);
  941. obj := ORB.topScope.next;
  942. WHILE (obj # NIL) & (obj.class = ORB.Mod) DO (*imports*)
  943. IF obj.dsc # ORB.system THEN Files.WriteString(R, obj(ORB.Module).orgname); Files.WriteInt(R, obj.val) END ;
  944. obj := obj.next
  945. END ;
  946. Files.Write(R, 0X);
  947. Files.WriteInt(R, tdx*4);
  948. i := 0;
  949. WHILE i < tdx DO Files.WriteInt(R, data[i]); INC(i) END ; (*type descriptors*)
  950. Files.WriteInt(R, varsize - tdx*4); (*data*)
  951. Files.WriteInt(R, strx);
  952. FOR i := 0 TO strx-1 DO Files.Write(R, str[i]) END ; (*strings*)
  953. Files.WriteInt(R, pc); (*code len*)
  954. FOR i := 0 TO pc-1 DO Files.WriteInt(R, code[i]) END ; (*program*)
  955. obj := ORB.topScope.next;
  956. WHILE obj # NIL DO (*commands*)
  957. IF (obj.exno # 0) & (obj.class = ORB.Const) & (obj.type.form = ORB.Proc) &
  958. (obj.type.nofpar = 0) & (obj.type.base = ORB.noType) THEN
  959. Files.WriteString(R, obj.name); Files.WriteInt(R, obj.val)
  960. END ;
  961. obj := obj.next
  962. END ;
  963. Files.Write(R, 0X);
  964. Files.WriteInt(R, nofent); Files.WriteInt(R, entry);
  965. obj := ORB.topScope.next;
  966. WHILE obj # NIL DO (*entries*)
  967. IF obj.exno # 0 THEN
  968. IF (obj.class = ORB.Const) & (obj.type.form = ORB.Proc) OR (obj.class = ORB.Var) THEN
  969. Files.WriteInt(R, obj.val);
  970. ELSIF obj.class = ORB.Typ THEN
  971. IF obj.type.form = ORB.Record THEN Files.WriteInt(R, obj.type.len MOD 10000H)
  972. ELSIF (obj.type.form = ORB.Pointer) & ((obj.type.base.typobj = NIL) OR (obj.type.base.typobj.exno = 0)) THEN
  973. Files.WriteInt(R, obj.type.base.len MOD 10000H)
  974. END
  975. END
  976. END ;
  977. obj := obj.next
  978. END ;
  979. obj := ORB.topScope.next;
  980. WHILE obj # NIL DO (*pointer variables*)
  981. IF obj.class = ORB.Var THEN FindPtrs(R, obj.type, obj.val) END ;
  982. obj := obj.next
  983. END ;
  984. Files.WriteInt(R, -1);
  985. Files.WriteInt(R, fixorgP); Files.WriteInt(R, fixorgD); Files.WriteInt(R, fixorgT); Files.WriteInt(R, entry);
  986. Files.Write(R, "O"); Files.Register(F)
  987. END Close;
  988. BEGIN relmap[0] := 1; relmap[1] := 9; relmap[2] := 5; relmap[3] := 6; relmap[4] := 14; relmap[5] := 13;
  989. END ORG.