ORG.Mod.txt 40 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115
  1. MODULE ORG; (* N.Wirth, 16.4.2016 / 4.4.2017 / 17.9.2018 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 (*fetch tag into RH*)
  315. IF varpar THEN Put2(Ldr, RH, SP, x.a+4+frame)
  316. ELSE load(x);
  317. pc0 := pc; Put3(BC, EQ, 0); (*NIL belongs to every pointer type*)
  318. Put2(Ldr, RH, x.r, -8)
  319. END ;
  320. Put2(Ldr, RH, RH, T.nofpar*4); incR;
  321. loadTypTagAdr(T); (*tag of T*)
  322. Put0(Cmp, RH-1, RH-1, RH-2); DEC(RH, 2);
  323. IF ~varpar THEN fix(pc0, pc - pc0 - 1) END ;
  324. IF isguard THEN
  325. IF check THEN Trap(NE, 2) END
  326. ELSE SetCC(x, EQ);
  327. IF ~varpar THEN DEC(RH) END
  328. END
  329. END TypeTest;
  330. (* Code generation for Boolean operators *)
  331. PROCEDURE Not*(VAR x: Item); (* x := ~x *)
  332. VAR t: LONGINT;
  333. BEGIN
  334. IF x.mode # Cond THEN loadCond(x) END ;
  335. x.r := negated(x.r); t := x.a; x.a := x.b; x.b := t
  336. END Not;
  337. PROCEDURE And1*(VAR x: Item); (* x := x & *)
  338. BEGIN
  339. IF x.mode # Cond THEN loadCond(x) END ;
  340. Put3(BC, negated(x.r), x.a); x.a := pc-1; FixLink(x.b); x.b := 0
  341. END And1;
  342. PROCEDURE And2*(VAR x, y: Item);
  343. BEGIN
  344. IF y.mode # Cond THEN loadCond(y) END ;
  345. x.a := merged(y.a, x.a); x.b := y.b; x.r := y.r
  346. END And2;
  347. PROCEDURE Or1*(VAR x: Item); (* x := x OR *)
  348. BEGIN
  349. IF x.mode # Cond THEN loadCond(x) END ;
  350. Put3(BC, x.r, x.b); x.b := pc-1; FixLink(x.a); x.a := 0
  351. END Or1;
  352. PROCEDURE Or2*(VAR x, y: Item);
  353. BEGIN
  354. IF y.mode # Cond THEN loadCond(y) END ;
  355. x.a := y.a; x.b := merged(y.b, x.b); x.r := y.r
  356. END Or2;
  357. (* Code generation for arithmetic operators *)
  358. PROCEDURE Neg*(VAR x: Item); (* x := -x *)
  359. BEGIN
  360. IF x.type.form = ORB.Int THEN
  361. IF x.mode = ORB.Const THEN x.a := -x.a
  362. ELSE load(x); Put1(Mov, RH, 0, 0); Put0(Sub, x.r, RH, x.r)
  363. END
  364. ELSIF x.type.form = ORB.Real THEN
  365. IF x.mode = ORB.Const THEN x.a := x.a + 7FFFFFFFH + 1
  366. ELSE load(x); Put1(Mov, RH, 0, 0); Put0(Fsb, x.r, RH, x.r)
  367. END
  368. ELSE (*form = Set*)
  369. IF x.mode = ORB.Const THEN x.a := -x.a-1
  370. ELSE load(x); Put1(Xor, x.r, x.r, -1)
  371. END
  372. END
  373. END Neg;
  374. PROCEDURE AddOp*(op: LONGINT; VAR x, y: Item); (* x := x +- y *)
  375. BEGIN
  376. IF op = ORS.plus THEN
  377. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN x.a := x.a + y.a
  378. ELSIF y.mode = ORB.Const THEN load(x);
  379. IF y.a # 0 THEN Put1a(Add, x.r, x.r, y.a) END
  380. ELSE load(x); load(y); Put0(Add, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  381. END
  382. ELSE (*op = ORS.minus*)
  383. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN x.a := x.a - y.a
  384. ELSIF y.mode = ORB.Const THEN load(x);
  385. IF y.a # 0 THEN Put1a(Sub, x.r, x.r, y.a) END
  386. ELSE load(x); load(y); Put0(Sub, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  387. END
  388. END
  389. END AddOp;
  390. PROCEDURE log2(m: LONGINT; VAR e: LONGINT): LONGINT;
  391. BEGIN e := 0;
  392. WHILE ~ODD(m) DO m := m DIV 2; INC(e) END ;
  393. RETURN m
  394. END log2;
  395. PROCEDURE MulOp*(VAR x, y: Item); (* x := x * y *)
  396. VAR e: LONGINT;
  397. BEGIN
  398. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN x.a := x.a * y.a
  399. ELSIF (y.mode = ORB.Const) & (y.a >= 2) & (log2(y.a, e) = 1) THEN load(x); Put1(Lsl, x.r, x.r, e)
  400. ELSIF y.mode = ORB.Const THEN load(x); Put1a(Mul, x.r, x.r, y.a)
  401. 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
  402. ELSIF x.mode = ORB.Const THEN load(y); Put1a(Mul, y.r, y.r, x.a); x.mode := Reg; x.r := y.r
  403. ELSE load(x); load(y); Put0(Mul, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  404. END
  405. END MulOp;
  406. PROCEDURE DivOp*(op: LONGINT; VAR x, y: Item); (* x := x op y *)
  407. VAR e: LONGINT;
  408. BEGIN
  409. IF op = ORS.div THEN
  410. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN
  411. IF y.a > 0 THEN x.a := x.a DIV y.a ELSE ORS.Mark("bad divisor") END
  412. ELSIF (y.mode = ORB.Const) & (y.a >= 2) & (log2(y.a, e) = 1) THEN load(x); Put1(Asr, x.r, x.r, e)
  413. ELSIF y.mode = ORB.Const THEN
  414. IF y.a > 0 THEN load(x); Put1a(Div, x.r, x.r, y.a) ELSE ORS.Mark("bad divisor") END
  415. ELSE load(y);
  416. IF check THEN Trap(LE, 6) END ;
  417. load(x); Put0(Div, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  418. END
  419. ELSE (*op = ORS.mod*)
  420. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN
  421. IF y.a > 0 THEN x.a := x.a MOD y.a ELSE ORS.Mark("bad modulus") END
  422. ELSIF (y.mode = ORB.Const) & (y.a >= 2) & (log2(y.a, e) = 1) THEN load(x);
  423. 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
  424. ELSIF y.mode = ORB.Const THEN
  425. 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
  426. ELSE load(y);
  427. IF check THEN Trap(LE, 6) END ;
  428. load(x); Put0(Div, RH-2, x.r, y.r); Put0(Mov+U, RH-2, 0, 0); DEC(RH); x.r := RH-1
  429. END
  430. END
  431. END DivOp;
  432. (* Code generation for REAL operators *)
  433. PROCEDURE RealOp*(op: INTEGER; VAR x, y: Item); (* x := x op y *)
  434. BEGIN load(x); load(y);
  435. IF op = ORS.plus THEN Put0(Fad, RH-2, x.r, y.r)
  436. ELSIF op = ORS.minus THEN Put0(Fsb, RH-2, x.r, y.r)
  437. ELSIF op = ORS.times THEN Put0(Fml, RH-2, x.r, y.r)
  438. ELSIF op = ORS.rdiv THEN Put0(Fdv, RH-2, x.r, y.r)
  439. END ;
  440. DEC(RH); x.r := RH-1
  441. END RealOp;
  442. (* Code generation for set operators *)
  443. PROCEDURE Singleton*(VAR x: Item); (* x := {x} *)
  444. BEGIN
  445. IF x.mode = ORB.Const THEN x.a := LSL(1, x.a)
  446. ELSE load(x); Put1(Mov, RH, 0, 1); Put0(Lsl, x.r, RH, x.r)
  447. END
  448. END Singleton;
  449. PROCEDURE Set*(VAR x, y: Item); (* x := {x .. y} *)
  450. BEGIN
  451. IF (x.mode = ORB.Const) & ( y.mode = ORB.Const) THEN
  452. IF x.a <= y.a THEN x.a := LSL(2, y.a) - LSL(1, x.a) ELSE x.a := 0 END
  453. ELSE
  454. IF (x.mode = ORB.Const) & (x.a <= 16) THEN x.a := LSL(-1, x.a)
  455. ELSE load(x); Put1(Mov, RH, 0, -1); Put0(Lsl, x.r, RH, x.r)
  456. END ;
  457. IF (y.mode = ORB.Const) & (y.a < 16) THEN Put1(Mov, RH, 0, LSL(-2, y.a)); y.mode := Reg; y.r := RH; incR
  458. ELSE load(y); Put1(Mov, RH, 0, -2); Put0(Lsl, y.r, RH, y.r)
  459. END ;
  460. IF x.mode = ORB.Const THEN
  461. IF x.a # 0 THEN Put1(Xor, y.r, y.r, -1); Put1a(And, RH-1, y.r, x.a) END ;
  462. x.mode := Reg; x.r := RH-1
  463. ELSE DEC(RH); Put0(Ann, RH-1, x.r, y.r)
  464. END
  465. END
  466. END Set;
  467. PROCEDURE In*(VAR x, y: Item); (* x := x IN y *)
  468. BEGIN load(y);
  469. IF x.mode = ORB.Const THEN Put1(Ror, y.r, y.r, (x.a + 1) MOD 20H); DEC(RH)
  470. ELSE load(x); Put1(Add, x.r, x.r, 1); Put0(Ror, y.r, y.r, x.r); DEC(RH, 2)
  471. END ;
  472. SetCC(x, MI)
  473. END In;
  474. PROCEDURE SetOp*(op: LONGINT; VAR x, y: Item); (* x := x op y *)
  475. VAR xset, yset: SET; (*x.type.form = Set*)
  476. BEGIN
  477. IF (x.mode = ORB.Const) & (y.mode = ORB.Const) THEN
  478. xset := SYSTEM.VAL(SET, x.a); yset := SYSTEM.VAL(SET, y.a);
  479. IF op = ORS.plus THEN xset := xset + yset
  480. ELSIF op = ORS.minus THEN xset := xset - yset
  481. ELSIF op = ORS.times THEN xset := xset * yset
  482. ELSIF op = ORS.rdiv THEN xset := xset / yset
  483. END ;
  484. x.a := SYSTEM.VAL(LONGINT, xset)
  485. ELSIF y.mode = ORB.Const THEN
  486. load(x);
  487. IF op = ORS.plus THEN Put1a(Ior, x.r, x.r, y.a)
  488. ELSIF op = ORS.minus THEN Put1a(Ann, x.r, x.r, y.a)
  489. ELSIF op = ORS.times THEN Put1a(And, x.r, x.r, y.a)
  490. ELSIF op = ORS.rdiv THEN Put1a(Xor, x.r, x.r, y.a)
  491. END ;
  492. ELSE load(x); load(y);
  493. IF op = ORS.plus THEN Put0(Ior, RH-2, x.r, y.r)
  494. ELSIF op = ORS.minus THEN Put0(Ann, RH-2, x.r, y.r)
  495. ELSIF op = ORS.times THEN Put0(And, RH-2, x.r, y.r)
  496. ELSIF op = ORS.rdiv THEN Put0(Xor, RH-2, x.r, y.r)
  497. END ;
  498. DEC(RH); x.r := RH-1
  499. END
  500. END SetOp;
  501. (* Code generation for relations *)
  502. PROCEDURE IntRelation*(op: INTEGER; VAR x, y: Item); (* x := x < y *)
  503. BEGIN
  504. IF (y.mode = ORB.Const) & (y.type.form # ORB.Proc) THEN
  505. load(x);
  506. 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 ;
  507. DEC(RH)
  508. ELSE
  509. IF (x.mode = Cond) OR (y.mode = Cond) THEN ORS.Mark("not implemented") END ;
  510. load(x); load(y); Put0(Cmp, x.r, x.r, y.r); DEC(RH, 2)
  511. END ;
  512. SetCC(x, relmap[op - ORS.eql])
  513. END IntRelation;
  514. PROCEDURE RealRelation*(op: INTEGER; VAR x, y: Item); (* x := x < y *)
  515. BEGIN load(x);
  516. IF (y.mode = ORB.Const) & (y.a = 0) THEN DEC(RH)
  517. ELSE load(y); Put0(Fsb, x.r, x.r, y.r); DEC(RH, 2)
  518. END ;
  519. SetCC(x, relmap[op - ORS.eql])
  520. END RealRelation;
  521. PROCEDURE StringRelation*(op: INTEGER; VAR x, y: Item); (* x := x < y *)
  522. (*x, y are char arrays or strings*)
  523. BEGIN
  524. IF x.type.form = ORB.String THEN loadStringAdr(x) ELSE loadAdr(x) END ;
  525. IF y.type.form = ORB.String THEN loadStringAdr(y) ELSE loadAdr(y) END ;
  526. Put2(Ldr+1, RH, x.r, 0); Put1(Add, x.r, x.r, 1);
  527. Put2(Ldr+1, RH+1, y.r, 0); Put1(Add, y.r, y.r, 1);
  528. Put0(Cmp, RH+2, RH, RH+1); Put3(BC, NE, 2);
  529. Put1(Cmp, RH+2, RH, 0); Put3(BC, NE, -8);
  530. DEC(RH, 2); SetCC(x, relmap[op - ORS.eql])
  531. END StringRelation;
  532. (* Code generation of Assignments *)
  533. PROCEDURE StrToChar*(VAR x: Item);
  534. BEGIN x.type := ORB.charType; DEC(strx, 4); x.a := ORD(str[x.a])
  535. END StrToChar;
  536. PROCEDURE Store*(VAR x, y: Item); (* x := y *)
  537. VAR op: LONGINT;
  538. BEGIN load(y);
  539. IF x.type.size = 1 THEN op := Str+1 ELSE op := Str END ;
  540. IF x.mode = ORB.Var THEN
  541. IF x.r > 0 THEN (*local*) Put2(op, y.r, SP, x.a + frame)
  542. ELSE GetSB(x.r); Put2(op, y.r, RH, x.a)
  543. END
  544. ELSIF x.mode = ORB.Par THEN Put2(Ldr, RH, SP, x.a + frame); Put2(op, y.r, RH, x.b);
  545. ELSIF x.mode = RegI THEN Put2(op, y.r, x.r, x.a); DEC(RH);
  546. ELSE ORS.Mark("bad mode in Store")
  547. END ;
  548. DEC(RH)
  549. END Store;
  550. PROCEDURE StoreStruct*(VAR x, y: Item); (* x := y, frame = 0 *)
  551. VAR s, pc0: LONGINT;
  552. BEGIN
  553. IF y.type.size # 0 THEN
  554. loadAdr(x); loadAdr(y);
  555. IF (x.type.form = ORB.Array) & (x.type.len > 0) THEN
  556. IF y.type.len >= 0 THEN
  557. IF x.type.size = y.type.size THEN Put1a(Mov, RH, 0, (y.type.size+3) DIV 4)
  558. ELSE ORS.Mark("different length/size, not implemented")
  559. END
  560. ELSE (*y open array*) Put2(Ldr, RH, SP, y.a+4); s := y.type.base.size; (*element size*)
  561. pc0 := pc; Put3(BC, EQ, 0);
  562. IF s = 1 THEN Put1(Add, RH, RH, 3); Put1(Asr, RH, RH, 2)
  563. ELSIF s # 4 THEN Put1a(Mul, RH, RH, s DIV 4)
  564. END ;
  565. IF check THEN
  566. Put1a(Mov, RH+1, 0, (x.type.size+3) DIV 4); Put0(Cmp, RH+1, RH, RH+1); Trap(GT, 3)
  567. END ;
  568. fix(pc0, pc + 5 - pc0)
  569. END
  570. ELSIF x.type.form = ORB.Record THEN Put1a(Mov, RH, 0, x.type.size DIV 4)
  571. ELSE ORS.Mark("inadmissible assignment")
  572. END ;
  573. Put2(Ldr, RH+1, y.r, 0); Put1(Add, y.r, y.r, 4);
  574. Put2(Str, RH+1, x.r, 0); Put1(Add, x.r, x.r, 4);
  575. Put1(Sub, RH, RH, 1); Put3(BC, NE, -6)
  576. END ;
  577. RH := 0
  578. END StoreStruct;
  579. PROCEDURE CopyString*(VAR x, y: Item); (* x := y *)
  580. VAR len: LONGINT;
  581. BEGIN loadAdr(x); len := x.type.len;
  582. IF len >= 0 THEN
  583. IF len < y.b THEN ORS.Mark("string too long") END
  584. ELSIF check THEN Put2(Ldr, RH, SP, x.a+4); (*open array len, frame = 0*)
  585. Put1(Cmp,RH, RH, y.b); Trap(LT, 3)
  586. END ;
  587. loadStringAdr(y);
  588. Put2(Ldr, RH, y.r, 0); Put1(Add, y.r, y.r, 4);
  589. Put2(Str, RH, x.r, 0); Put1(Add, x.r, x.r, 4);
  590. Put1(Asr, RH, RH, 24); Put3(BC, NE, -6); RH := 0
  591. END CopyString;
  592. (* Code generation for parameters *)
  593. PROCEDURE OpenArrayParam*(VAR x: Item);
  594. BEGIN loadAdr(x);
  595. IF x.type.len >= 0 THEN Put1a(Mov, RH, 0, x.type.len) ELSE Put2(Ldr, RH, SP, x.a+4+frame) END ;
  596. incR
  597. END OpenArrayParam;
  598. PROCEDURE VarParam*(VAR x: Item; ftype: ORB.Type);
  599. VAR xmd: INTEGER;
  600. BEGIN xmd := x.mode; loadAdr(x);
  601. IF (ftype.form = ORB.Array) & (ftype.len < 0) THEN (*open array*)
  602. IF x.type.len >= 0 THEN Put1a(Mov, RH, 0, x.type.len) ELSE Put2(Ldr, RH, SP, x.a+4+frame) END ;
  603. incR
  604. ELSIF ftype.form = ORB.Record THEN
  605. IF xmd = ORB.Par THEN Put2(Ldr, RH, SP, x.a+4+frame); incR ELSE loadTypTagAdr(x.type) END
  606. END
  607. END VarParam;
  608. PROCEDURE ValueParam*(VAR x: Item);
  609. BEGIN load(x)
  610. END ValueParam;
  611. PROCEDURE StringParam*(VAR x: Item);
  612. BEGIN loadStringAdr(x); Put1(Mov, RH, 0, x.b); incR (*len*)
  613. END StringParam;
  614. (*For Statements*)
  615. PROCEDURE For0*(VAR x, y: Item);
  616. BEGIN load(y)
  617. END For0;
  618. PROCEDURE For1*(VAR x, y, z, w: Item; VAR L: LONGINT);
  619. BEGIN
  620. IF z.mode = ORB.Const THEN Put1a(Cmp, RH, y.r, z.a)
  621. ELSE load(z); Put0(Cmp, RH-1, y.r, z.r); DEC(RH)
  622. END ;
  623. L := pc;
  624. IF w.a > 0 THEN Put3(BC, GT, 0)
  625. ELSIF w.a < 0 THEN Put3(BC, LT, 0)
  626. ELSE ORS.Mark("zero increment"); Put3(BC, MI, 0)
  627. END ;
  628. Store(x, y)
  629. END For1;
  630. PROCEDURE For2*(VAR x, y, w: Item);
  631. BEGIN load(x); DEC(RH); Put1a(Add, x.r, x.r, w.a)
  632. END For2;
  633. (* Branches, procedure calls, procedure prolog and epilog *)
  634. PROCEDURE Here*(): LONGINT;
  635. BEGIN RETURN pc
  636. END Here;
  637. PROCEDURE FJump*(VAR L: LONGINT);
  638. BEGIN Put3(BC, 7, L); L := pc-1
  639. END FJump;
  640. PROCEDURE CFJump*(VAR x: Item);
  641. BEGIN
  642. IF x.mode # Cond THEN loadCond(x) END ;
  643. Put3(BC, negated(x.r), x.a); FixLink(x.b); x.a := pc-1
  644. END CFJump;
  645. PROCEDURE BJump*(L: LONGINT);
  646. BEGIN Put3(BC, 7, L-pc-1)
  647. END BJump;
  648. PROCEDURE CBJump*(VAR x: Item; L: LONGINT);
  649. BEGIN
  650. IF x.mode # Cond THEN loadCond(x) END ;
  651. Put3(BC, negated(x.r), L-pc-1); FixLink(x.b); FixLinkWith(x.a, L)
  652. END CBJump;
  653. PROCEDURE Fixup*(VAR x: Item);
  654. BEGIN FixLink(x.a)
  655. END Fixup;
  656. PROCEDURE SaveRegs(r: LONGINT); (* R[0 .. r-1]*)
  657. VAR r0: LONGINT;
  658. BEGIN (*r > 0*) r0 := 0;
  659. Put1(Sub, SP, SP, r*4); INC(frame, 4*r);
  660. REPEAT Put2(Str, r0, SP, (r-r0-1)*4); INC(r0) UNTIL r0 = r
  661. END SaveRegs;
  662. PROCEDURE RestoreRegs(r: LONGINT); (*R[0 .. r-1]*)
  663. VAR r0: LONGINT;
  664. BEGIN (*r > 0*) r0 := r;
  665. REPEAT DEC(r0); Put2(Ldr, r0, SP, (r-r0-1)*4) UNTIL r0 = 0;
  666. Put1(Add, SP, SP, r*4); DEC(frame, 4*r)
  667. END RestoreRegs;
  668. PROCEDURE PrepCall*(VAR x: Item; VAR r: LONGINT);
  669. BEGIN (*x.type.form = ORB.Proc*)
  670. IF x.mode > ORB.Par THEN load(x) END ;
  671. r := RH;
  672. IF RH > 0 THEN SaveRegs(RH); RH := 0 END
  673. END PrepCall;
  674. PROCEDURE Call*(VAR x: Item; r: LONGINT);
  675. BEGIN (*x.type.form = ORB.Proc*)
  676. IF x.mode = ORB.Const THEN
  677. IF x.r >= 0 THEN Put3(BL, 7, (x.a DIV 4)-pc-1)
  678. ELSE (*imported*)
  679. IF pc - fixorgP < 1000H THEN
  680. Put3(BL, 7, ((-x.r) * 100H + x.a) * 1000H + pc-fixorgP); fixorgP := pc-1
  681. ELSE ORS.Mark("fixup impossible")
  682. END
  683. END
  684. ELSE
  685. IF x.mode <= ORB.Par THEN load(x); DEC(RH)
  686. ELSE Put2(Ldr, RH, SP, 0); Put1(Add, SP, SP, 4); DEC(r); DEC(frame, 4)
  687. END ;
  688. IF check THEN Trap(EQ, 5) END ;
  689. Put3(BLR, 7, RH)
  690. END ;
  691. IF x.type.base.form = ORB.NoTyp THEN (*procedure*) RH := 0
  692. ELSE (*function*)
  693. IF r > 0 THEN Put0(Mov, r, 0, 0); RestoreRegs(r) END ;
  694. x.mode := Reg; x.r := r; RH := r+1
  695. END
  696. END Call;
  697. PROCEDURE Enter*(parblksize, locblksize: LONGINT; int: BOOLEAN);
  698. VAR a, r: LONGINT;
  699. BEGIN frame := 0;
  700. IF ~int THEN (*procedure prolog*)
  701. IF locblksize >= 10000H THEN ORS.Mark("too many locals") END ;
  702. a := 4; r := 0;
  703. Put1(Sub, SP, SP, locblksize); Put2(Str, LNK, SP, 0);
  704. WHILE a < parblksize DO Put2(Str, r, SP, a); INC(r); INC(a, 4) END
  705. ELSE (*interrupt procedure*)
  706. Put1(Sub, SP, SP, locblksize); Put2(Str, 0, SP, 0); Put2(Str, 1, SP, 4); Put2(Str, 2, SP, 8)
  707. (*R0, R1, R2 saved on stack*)
  708. END
  709. END Enter;
  710. PROCEDURE Return*(form: INTEGER; VAR x: Item; size: LONGINT; int: BOOLEAN);
  711. BEGIN
  712. IF form # ORB.NoTyp THEN load(x) END ;
  713. IF ~int THEN (*procedure epilog*)
  714. Put2(Ldr, LNK, SP, 0); Put1(Add, SP, SP, size); Put3(BR, 7, LNK)
  715. ELSE (*interrupt return, restore R2, R1, R0*)
  716. Put2(Ldr, 2, SP, 8); Put2(Ldr, 1, SP, 4); Put2(Ldr, 0, SP, 0); Put1(Add, SP, SP, size);
  717. Put3(BR, 7, 10H) (*RTI*)
  718. END ;
  719. RH := 0
  720. END Return;
  721. (* In-line code procedures*)
  722. PROCEDURE Increment*(upordown: LONGINT; VAR x, y: Item);
  723. VAR op, zr, v: LONGINT;
  724. BEGIN (*frame = 0*)
  725. IF upordown = 0 THEN op := Add ELSE op := Sub END ;
  726. IF x.type = ORB.byteType THEN v := 1 ELSE v := 0 END ;
  727. IF y.type.form = ORB.NoTyp THEN y.mode := ORB.Const; y.a := 1 END ;
  728. IF (x.mode = ORB.Var) & (x.r > 0) THEN
  729. zr := RH; Put2(Ldr+v, zr, SP, x.a); incR;
  730. IF y.mode = ORB.Const THEN Put1a(op, zr, zr, y.a) ELSE load(y); Put0(op, zr, zr, y.r); DEC(RH) END ;
  731. Put2(Str+v, zr, SP, x.a); DEC(RH)
  732. ELSE loadAdr(x); zr := RH; Put2(Ldr+v, RH, x.r, 0); incR;
  733. IF y.mode = ORB.Const THEN Put1a(op, zr, zr, y.a) ELSE load(y); Put0(op, zr, zr, y.r); DEC(RH) END ;
  734. Put2(Str+v, zr, x.r, 0); DEC(RH, 2)
  735. END
  736. END Increment;
  737. PROCEDURE Include*(inorex: LONGINT; VAR x, y: Item);
  738. VAR op, zr: LONGINT;
  739. BEGIN loadAdr(x); zr := RH; Put2(Ldr, RH, x.r, 0); incR;
  740. IF inorex = 0 THEN op := Ior ELSE op := Ann END ;
  741. IF y.mode = ORB.Const THEN Put1a(op, zr, zr, LSL(1, y.a))
  742. ELSE load(y); Put1(Mov, RH, 0, 1); Put0(Lsl, y.r, RH, y.r); Put0(op, zr, zr, y.r); DEC(RH)
  743. END ;
  744. Put2(Str, zr, x.r, 0); DEC(RH, 2)
  745. END Include;
  746. PROCEDURE Assert*(VAR x: Item);
  747. VAR cond: LONGINT;
  748. BEGIN
  749. IF x.mode # Cond THEN loadCond(x) END ;
  750. IF x.a = 0 THEN cond := negated(x.r)
  751. ELSE Put3(BC, x.r, x.b); FixLink(x.a); x.b := pc-1; cond := 7
  752. END ;
  753. Trap(cond, 7); FixLink(x.b)
  754. END Assert;
  755. PROCEDURE New*(VAR x: Item);
  756. BEGIN loadAdr(x); loadTypTagAdr(x.type.base); Trap(7, 0); RH := 0
  757. END New;
  758. PROCEDURE Pack*(VAR x, y: Item);
  759. VAR z: Item;
  760. BEGIN z := x; load(x); load(y);
  761. Put1(Lsl, y.r, y.r, 23); Put0(Add, x.r, x.r, y.r); DEC(RH); Store(z, x)
  762. END Pack;
  763. PROCEDURE Unpk*(VAR x, y: Item);
  764. VAR z, e0: Item;
  765. BEGIN z := x; load(x); e0.mode := Reg; e0.r := RH; e0.type := ORB.intType;
  766. Put1(Asr, RH, x.r, 23); Put1(Sub, RH, RH, 127); Store(y, e0); incR;
  767. Put1(Lsl, RH, RH, 23); Put0(Sub, x.r, x.r, RH); Store(z, x)
  768. END Unpk;
  769. PROCEDURE Led*(VAR x: Item);
  770. BEGIN load(x); Put1(Mov, RH, 0, -60); Put2(Str, x.r, RH, 0); DEC(RH)
  771. END Led;
  772. PROCEDURE Get*(VAR x, y: Item);
  773. BEGIN load(x); x.type := y.type; x.mode := RegI; x.a := 0; Store(y, x)
  774. END Get;
  775. PROCEDURE Put*(VAR x, y: Item);
  776. BEGIN load(x); x.type := y.type; x.mode := RegI; x.a := 0; Store(x, y)
  777. END Put;
  778. PROCEDURE Copy*(VAR x, y, z: Item);
  779. BEGIN load(x); load(y);
  780. IF z.mode = ORB.Const THEN
  781. IF z.a > 0 THEN load(z) ELSE ORS.Mark("bad count") END
  782. ELSE load(z);
  783. IF check THEN Trap(LT, 3) END ;
  784. Put3(BC, EQ, 6)
  785. END ;
  786. Put2(Ldr, RH, x.r, 0); Put1(Add, x.r, x.r, 4);
  787. Put2(Str, RH, y.r, 0); Put1(Add, y.r, y.r, 4);
  788. Put1(Sub, z.r, z.r, 1); Put3(BC, NE, -6); DEC(RH, 3)
  789. END Copy;
  790. PROCEDURE LDPSR*(VAR x: Item);
  791. BEGIN (*x.mode = Const*) Put3(0, 15, x.a + 20H)
  792. END LDPSR;
  793. PROCEDURE LDREG*(VAR x, y: Item);
  794. BEGIN
  795. IF y.mode = ORB.Const THEN Put1a(Mov, x.a, 0, y.a)
  796. ELSE load(y); Put0(Mov, x.a, 0, y.r); DEC(RH)
  797. END
  798. END LDREG;
  799. (*In-line code functions*)
  800. PROCEDURE Abs*(VAR x: Item);
  801. BEGIN
  802. IF x.mode = ORB.Const THEN x.a := ABS(x.a)
  803. ELSE load(x);
  804. IF x.type.form = ORB.Real THEN Put1(Lsl, x.r, x.r, 1); Put1(Ror, x.r, x.r, 1)
  805. ELSE Put1(Cmp, x.r, x.r, 0); Put3(BC, GE, 2); Put1(Mov, RH, 0, 0); Put0(Sub, x.r, RH, x.r)
  806. END
  807. END
  808. END Abs;
  809. PROCEDURE Odd*(VAR x: Item);
  810. BEGIN load(x); Put1(And, x.r, x.r, 1); SetCC(x, NE); DEC(RH)
  811. END Odd;
  812. PROCEDURE Floor*(VAR x: Item);
  813. BEGIN load(x); Put1(Mov+U, RH, 0, 4B00H); Put0(Fad+V, x.r, x.r, RH)
  814. END Floor;
  815. PROCEDURE Float*(VAR x: Item);
  816. BEGIN load(x); Put1(Mov+U, RH, 0, 4B00H); Put0(Fad+U, x.r, x.r, RH)
  817. END Float;
  818. PROCEDURE Ord*(VAR x: Item);
  819. BEGIN
  820. IF x.mode IN {ORB.Var, ORB.Par, RegI, Cond} THEN load(x) END
  821. END Ord;
  822. PROCEDURE Len*(VAR x: Item);
  823. BEGIN
  824. IF x.type.len >= 0 THEN
  825. IF x.mode = RegI THEN DEC(RH) END ;
  826. x.mode := ORB.Const; x.a := x.type.len
  827. ELSE (*open array*) Put2(Ldr, RH, SP, x.a + 4 + frame); x.mode := Reg; x.r := RH; incR
  828. END
  829. END Len;
  830. PROCEDURE Shift*(fct: LONGINT; VAR x, y: Item);
  831. VAR op: LONGINT;
  832. BEGIN load(x);
  833. IF fct = 0 THEN op := Lsl ELSIF fct = 1 THEN op := Asr ELSE op := Ror END ;
  834. IF y.mode = ORB.Const THEN Put1(op, x.r, x.r, y.a MOD 20H)
  835. ELSE load(y); Put0(op, RH-2, x.r, y.r); DEC(RH); x.r := RH-1
  836. END
  837. END Shift;
  838. PROCEDURE ADC*(VAR x, y: Item);
  839. BEGIN load(x); load(y); Put0(Add+2000H, x.r, x.r, y.r); DEC(RH)
  840. END ADC;
  841. PROCEDURE SBC*(VAR x, y: Item);
  842. BEGIN load(x); load(y); Put0(Sub+2000H, x.r, x.r, y.r); DEC(RH)
  843. END SBC;
  844. PROCEDURE UML*(VAR x, y: Item);
  845. BEGIN load(x); load(y); Put0(Mul+2000H, x.r, x.r, y.r); DEC(RH)
  846. END UML;
  847. PROCEDURE Bit*(VAR x, y: Item);
  848. BEGIN load(x); Put2(Ldr, x.r, x.r, 0);
  849. IF y.mode = ORB.Const THEN Put1(Ror, x.r, x.r, y.a+1); DEC(RH)
  850. ELSE load(y); Put1(Add, y.r, y.r, 1); Put0(Ror, x.r, x.r, y.r); DEC(RH, 2)
  851. END ;
  852. SetCC(x, MI)
  853. END Bit;
  854. PROCEDURE Register*(VAR x: Item);
  855. BEGIN (*x.mode = Const*)
  856. Put0(Mov, RH, 0, x.a MOD 10H); x.mode := Reg; x.r := RH; incR
  857. END Register;
  858. PROCEDURE H*(VAR x: Item);
  859. BEGIN (*x.mode = Const*)
  860. Put0(Mov + U + x.a MOD 2 * V, RH, 0, 0); x.mode := Reg; x.r := RH; incR
  861. END H;
  862. PROCEDURE Adr*(VAR x: Item);
  863. BEGIN
  864. IF x.mode IN {ORB.Var, ORB.Par, RegI} THEN loadAdr(x)
  865. ELSIF (x.mode = ORB.Const) & (x.type.form = ORB.Proc) THEN load(x)
  866. ELSIF (x.mode = ORB.Const) & (x.type.form = ORB.String) THEN loadStringAdr(x)
  867. ELSE ORS.Mark("not addressable")
  868. END
  869. END Adr;
  870. PROCEDURE Condition*(VAR x: Item);
  871. BEGIN (*x.mode = Const*) SetCC(x, x.a)
  872. END Condition;
  873. PROCEDURE Open*(v: INTEGER);
  874. BEGIN pc := 0; tdx := 0; strx := 0; RH := 0; fixorgP := 0; fixorgD := 0; fixorgT := 0; check := v # 0; version := v;
  875. IF v = 0 THEN pc := 1;
  876. REPEAT code[pc] := 0; INC(pc) UNTIL pc = 8
  877. END
  878. END Open;
  879. PROCEDURE SetDataSize*(dc: LONGINT);
  880. BEGIN varsize := dc
  881. END SetDataSize;
  882. PROCEDURE Header*;
  883. BEGIN entry := pc*4;
  884. IF version = 0 THEN code[0] := 0E7000000H-1 + pc; Put1a(Mov, SP, 0, StkOrg0) (*RISC-0*)
  885. ELSE Put1(Sub, SP, SP, 4); Put2(Str, LNK, SP, 0)
  886. END
  887. END Header;
  888. PROCEDURE NofPtrs(typ: ORB.Type): LONGINT;
  889. VAR fld: ORB.Object; n: LONGINT;
  890. BEGIN
  891. IF (typ.form = ORB.Pointer) OR (typ.form = ORB.NilTyp) THEN n := 1
  892. ELSIF typ.form = ORB.Record THEN
  893. fld := typ.dsc; n := 0;
  894. WHILE fld # NIL DO n := NofPtrs(fld.type) + n; fld := fld.next END
  895. ELSIF typ.form = ORB.Array THEN n := NofPtrs(typ.base) * typ.len
  896. ELSE n := 0
  897. END ;
  898. RETURN n
  899. END NofPtrs;
  900. PROCEDURE FindPtrs(VAR R: Files.Rider; typ: ORB.Type; adr: LONGINT);
  901. VAR fld: ORB.Object; i, s: LONGINT;
  902. BEGIN
  903. IF (typ.form = ORB.Pointer) OR (typ.form = ORB.NilTyp) THEN Files.WriteInt(R, adr)
  904. ELSIF typ.form = ORB.Record THEN
  905. fld := typ.dsc;
  906. WHILE fld # NIL DO FindPtrs(R, fld.type, fld.val + adr); fld := fld.next END
  907. ELSIF typ.form = ORB.Array THEN
  908. s := typ.base.size;
  909. FOR i := 0 TO typ.len-1 DO FindPtrs(R, typ.base, i*s + adr) END
  910. END
  911. END FindPtrs;
  912. PROCEDURE Close*(VAR modid: ORS.Ident; key, nofent: LONGINT);
  913. VAR obj: ORB.Object;
  914. i, comsize, nofimps, nofptrs, size: LONGINT;
  915. name: ORS.Ident;
  916. F: Files.File; R: Files.Rider;
  917. BEGIN (*exit code*)
  918. IF version = 0 THEN Put1(Mov, 0, 0, 0); Put3(BR, 7, 0) (*RISC-0*)
  919. ELSE Put2(Ldr, LNK, SP, 0); Put1(Add, SP, SP, 4); Put3(BR, 7, LNK)
  920. END ;
  921. obj := ORB.topScope.next; nofimps := 0; comsize := 4; nofptrs := 0;
  922. WHILE obj # NIL DO
  923. IF (obj.class = ORB.Mod) & (obj.dsc # ORB.system) THEN INC(nofimps) (*count imports*)
  924. ELSIF (obj.exno # 0) & (obj.class = ORB.Const) & (obj.type.form = ORB.Proc)
  925. & (obj.type.nofpar = 0) & (obj.type.base = ORB.noType) THEN i := 0; (*count commands*)
  926. WHILE obj.name[i] # 0X DO INC(i) END ;
  927. i := (i+4) DIV 4 * 4; INC(comsize, i+4)
  928. ELSIF obj.class = ORB.Var THEN INC(nofptrs, NofPtrs(obj.type)) (*count pointers*)
  929. END ;
  930. obj := obj.next
  931. END ;
  932. size := varsize + strx + comsize + (pc + nofimps + nofent + nofptrs + 1)*4; (*varsize includes type descriptors*)
  933. ORB.MakeFileName(name, modid, ".rsc"); (*write code file*)
  934. F := Files.New(name); Files.Set(R, F, 0); Files.WriteString(R, modid); Files.WriteInt(R, key); Files.Write(R, CHR(version));
  935. Files.WriteInt(R, size);
  936. obj := ORB.topScope.next;
  937. WHILE (obj # NIL) & (obj.class = ORB.Mod) DO (*imports*)
  938. IF obj.dsc # ORB.system THEN Files.WriteString(R, obj(ORB.Module).orgname); Files.WriteInt(R, obj.val) END ;
  939. obj := obj.next
  940. END ;
  941. Files.Write(R, 0X);
  942. Files.WriteInt(R, tdx*4);
  943. i := 0;
  944. WHILE i < tdx DO Files.WriteInt(R, data[i]); INC(i) END ; (*type descriptors*)
  945. Files.WriteInt(R, varsize - tdx*4); (*data*)
  946. Files.WriteInt(R, strx);
  947. FOR i := 0 TO strx-1 DO Files.Write(R, str[i]) END ; (*strings*)
  948. Files.WriteInt(R, pc); (*code len*)
  949. FOR i := 0 TO pc-1 DO Files.WriteInt(R, code[i]) END ; (*program*)
  950. obj := ORB.topScope.next;
  951. WHILE obj # NIL DO (*commands*)
  952. IF (obj.exno # 0) & (obj.class = ORB.Const) & (obj.type.form = ORB.Proc) &
  953. (obj.type.nofpar = 0) & (obj.type.base = ORB.noType) THEN
  954. Files.WriteString(R, obj.name); Files.WriteInt(R, obj.val)
  955. END ;
  956. obj := obj.next
  957. END ;
  958. Files.Write(R, 0X);
  959. Files.WriteInt(R, nofent); Files.WriteInt(R, entry);
  960. obj := ORB.topScope.next;
  961. WHILE obj # NIL DO (*entries*)
  962. IF obj.exno # 0 THEN
  963. IF (obj.class = ORB.Const) & (obj.type.form = ORB.Proc) OR (obj.class = ORB.Var) THEN
  964. Files.WriteInt(R, obj.val);
  965. ELSIF obj.class = ORB.Typ THEN
  966. IF obj.type.form = ORB.Record THEN Files.WriteInt(R, obj.type.len MOD 10000H)
  967. ELSIF (obj.type.form = ORB.Pointer) & ((obj.type.base.typobj = NIL) OR (obj.type.base.typobj.exno = 0)) THEN
  968. Files.WriteInt(R, obj.type.base.len MOD 10000H)
  969. END
  970. END
  971. END ;
  972. obj := obj.next
  973. END ;
  974. obj := ORB.topScope.next;
  975. WHILE obj # NIL DO (*pointer variables*)
  976. IF obj.class = ORB.Var THEN FindPtrs(R, obj.type, obj.val) END ;
  977. obj := obj.next
  978. END ;
  979. Files.WriteInt(R, -1);
  980. Files.WriteInt(R, fixorgP); Files.WriteInt(R, fixorgD); Files.WriteInt(R, fixorgT); Files.WriteInt(R, entry);
  981. Files.Write(R, "O"); Files.Register(F)
  982. END Close;
  983. BEGIN relmap[0] := 1; relmap[1] := 9; relmap[2] := 5; relmap[3] := 6; relmap[4] := 14; relmap[5] := 13;
  984. END ORG.