-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLINUX386.ORL.Mod.txt
356 lines (334 loc) · 13.6 KB
/
LINUX386.ORL.Mod.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
MODULE ORL;
IMPORT Files, Texts, Oberon;
CONST
versionkey = 0AX; MT = 3; DescSize = 80;
ImageBase = 100000H;
entry = ImageBase + 52 + 32;
org = (entry + 12 + 15) DIV 16 * 16;
MTSize = 64; ModLim = 80000H;
MTOrg = org + 20H; limit = org + ModLim;
TYPE
Module = POINTER TO ModDesc;
ModuleName = ARRAY 32 OF CHAR;
ModDesc = RECORD
name: ModuleName;
next: Module;
key, num, size, refcnt: INTEGER;
data, code, imp, cmd, ent, ptr, unused: INTEGER; (*addresses*)
adr, body: INTEGER;
END;
Memory = POINTER TO MemoryDesc;
MemoryDesc = RECORD
x: ARRAY ModLim OF BYTE
END;
VAR W: Texts.Writer;
root, M: Module;
AllocPtr, res: INTEGER;
importing, imported: ModuleName;
m: Memory;
PROCEDURE Put1 (a: INTEGER; ch: CHAR);
BEGIN m.x[a-org] := ORD(ch)
END Put1;
PROCEDURE Put4 (a, x: INTEGER);
BEGIN DEC(a, org);
m.x[a] := x; m.x[a+1] := x DIV 256; m.x[a+2] := x DIV 65536; m.x[a+3] := x DIV 16777216
END Put4;
PROCEDURE Get4 (a: INTEGER; VAR x: INTEGER);
BEGIN DEC(a, org); x := m.x[a] + m.x[a+1] * 256 + m.x[a+2] * 65536 + m.x[a+3] * 16777216
END Get4;
PROCEDURE MakeFileName(VAR FName: ModuleName; name, ext: ARRAY OF CHAR);
VAR i, j: INTEGER;
BEGIN i := 0; j := 0; (*assume name suffix less than 4 characters*)
WHILE (i < LEN(ModuleName)-5) & (name[i] > 0X) DO FName[i] := name[i]; INC(i) END ;
REPEAT FName[i]:= ext[j]; INC(i); INC(j) UNTIL ext[j] = 0X;
FName[i] := 0X
END MakeFileName;
PROCEDURE ThisFile(name: ARRAY OF CHAR): Files.File;
VAR filename: ModuleName;
BEGIN MakeFileName(filename, name, ".int");
RETURN Files.Old(filename)
END ThisFile;
PROCEDURE error(n: INTEGER; name: ARRAY OF CHAR);
BEGIN res := n; importing := name
END error;
PROCEDURE Check(s: ARRAY OF CHAR);
VAR i: INTEGER; ch: CHAR;
BEGIN ch := s[0]; res := 1; i := 1;
IF (ch >= "A") & (ch <= "Z") OR (ch >= "a") & (ch <= "z") THEN
REPEAT ch := s[i]; INC(i)
UNTIL ~((ch >= "0") & (ch <= "9") OR (ch >= "A") & (ch <= "Z")
OR (ch >= "a") & (ch <= "z") OR (ch = ".")) OR (i = 32);
IF (i < 32) & (ch = 0X) THEN res := 0 END
END
END Check;
PROCEDURE FixModule(mod: Module);
VAR a, i: INTEGER;
BEGIN
a := mod.adr;
FOR i := 0 TO LEN(ModuleName) - 1 DO
Put1(a, mod.name[i]); INC(a)
END;
IF mod.next = NIL THEN i := 0 ELSE i := mod.next.adr END;
Put4(a, i); INC(a, 4);
Put4(a, mod.key); INC(a, 4);
Put4(a, mod.num); INC(a, 4);
Put4(a, mod.size); INC(a, 4);
Put4(a, mod.refcnt); INC(a, 4);
Put4(a, mod.data); INC(a, 4);
Put4(a, mod.code); INC(a, 4);
Put4(a, mod.imp); INC(a, 4);
Put4(a, mod.cmd); INC(a, 4);
Put4(a, mod.ent); INC(a, 4);
Put4(a, mod.ptr); INC(a, 4);
Put4(a, mod.unused); INC(a, 4);
END FixModule;
PROCEDURE LinkIt(name: ARRAY OF CHAR; VAR newmod: Module);
(*search module in list; if not found, load module.
res = 0: already present or loaded; res = 2: file not available; res = 3: key conflict;
res = 4: bad file version; res = 5: corrupted file; res = 7: no space*)
VAR mod, impmod: Module;
i, n, key, impkey, mno, nofimps, size: INTEGER;
p, u, v, w: INTEGER; (*addresses*)
ch: CHAR;
fixorgP, fixorgD, fixorgT: INTEGER;
disp, adr, inst, pno, vno, dest, offset: INTEGER;
name1, impname: ModuleName;
F: Files.File; R: Files.Rider;
import: ARRAY 16 OF Module;
BEGIN mod := root; error(0, name); nofimps := 0;
WHILE (mod # NIL) & (name # mod.name) DO mod := mod.next END;
IF mod = NIL THEN (*load*)
Check(name);
IF res = 0 THEN F := ThisFile(name) ELSE F := NIL END;
IF F # NIL THEN
Files.Set(R, F, 0); Files.ReadString(R, name1); Files.ReadInt(R, key); Files.Read(R, ch);
Files.ReadInt(R, size); importing := name1;
IF ch = versionkey THEN
Files.ReadString(R, impname); (*imports*)
WHILE (impname[0] # 0X) & (res = 0) DO
Files.ReadInt(R, impkey);
LinkIt(impname, impmod); import[nofimps] := impmod; importing := name1;
IF res = 0 THEN
IF impmod.key = impkey THEN INC(impmod.refcnt); INC(nofimps)
ELSE error(3, name1); imported := impname
END
END;
Files.ReadString(R, impname)
END
ELSE error(2, name1)
END
ELSE error(1, name)
END;
IF res = 0 THEN (*search for a hole in the list allocate and link*)
INC(size, DescSize); mod := root;
WHILE (mod # NIL) & ~((mod.name[0] = 0X) & (mod.size >= size)) DO mod := mod.next END;
IF mod = NIL THEN (*no large enough hole was found*)
IF AllocPtr + size < limit THEN (*allocate*)
p := AllocPtr; NEW(mod); mod.adr := p;
AllocPtr := (p + size + 100H) DIV 20H * 20H; mod.size := AllocPtr - p; mod.num := root.num + 1;
mod.next := root; root := mod
ELSE error(7, name1)
END
ELSE (*fill hole*) p := mod.adr
END
END;
IF res = 0 THEN (*read file*)
INC(p, DescSize); (*allocate descriptor*)
i := 0; REPEAT ch := name[i]; mod.name[i] := ch; INC(i) UNTIL ch = 0X; mod.key := key; mod.refcnt := 0;
mod.data := p; (*data*)
Put4(mod.num * 4 + MTOrg, p); (*module table entry*)
Files.ReadInt(R, n);
WHILE n > 0 DO Files.ReadInt(R, w); Put4(p, w); INC(p, 4); DEC(n, 4) END; (*type descriptors*)
Files.ReadInt(R, n);
WHILE n > 0 DO Put4(p, 0); INC(p, 4); DEC(n, 4) END; (*variable space*)
Files.ReadInt(R, n);
WHILE n > 0 DO Files.Read(R, ch); Put1(p, ch); INC(p); DEC(n) END; (*strings*)
mod.code := p; (*program*)
Files.ReadInt(R, n);
WHILE n > 0 DO Files.ReadInt(R, w); Put4(p, w); INC(p, 4); DEC(n) END; (*program code*)
mod.imp := p; (*copy imports*)
i := 0;
WHILE i < nofimps DO
Put4(p, import[i].adr); INC(p, 4); INC(i)
END;
mod.cmd := p; (*commands*) Files.Read(R, ch);
WHILE ch # 0X DO
REPEAT Put1(p, ch); INC(p); Files.Read(R, ch) UNTIL ch = 0X;
REPEAT Put1(p, 0X); INC(p) UNTIL p MOD 4 = 0;
Files.ReadInt(R, n); Put4(p, n); INC(p, 4); Files.Read(R, ch)
END;
REPEAT Put1(p, 0X); INC(p) UNTIL p MOD 4 = 0;
mod.ent := p; (*entries*)
Files.ReadInt(R, n);
WHILE n > 0 DO Files.ReadInt(R, w); Put4(p, w); INC(p, 4); DEC(n) END;
mod.ptr := p; (*pointer references*)
Files.ReadInt(R, w);
WHILE w >= 0 DO Put4(p, mod.data + w); INC(p, 4); Files.ReadInt(R, w) END;
Put4(p, 0); INC(p, 4);
Files.ReadInt(R, fixorgP); Files.ReadInt(R, fixorgD); Files.ReadInt(R, fixorgT);
Files.ReadInt(R, w); mod.body := mod.code + w;
Files.Read(R, ch);
IF ch # "O" THEN (*corrupted file*) mod := NIL; error(4, name) END
END;
IF res = 0 THEN
FixModule(mod);
(*fixup of CALL*)
adr := mod.code + fixorgP;
WHILE adr # mod.code DO
Get4(adr, inst);
pno := inst DIV 40000H;
mno := inst DIV 4000H MOD 10H;
disp := inst MOD 4000H;
IF mno = 0 THEN (*abs*)
Put4(adr, mod.code + pno MOD 4000H * 4);
ELSE (*import*)
impmod := import[mno - 1];
IF pno < 0 THEN (*rel*)
Get4(impmod.ent - pno*4, dest);
Put4(adr, impmod.code + dest - adr - 4);
ELSE (*abs*)
Get4(impmod.ent + pno*4, dest);
Put4(adr, impmod.code + dest)
END
END;
adr := adr - disp
END;
(*fixup of MOV*)
adr := mod.code + fixorgD;
WHILE adr # mod.code DO
Get4(adr, inst);
vno := inst DIV 10000H MOD 10000H;
mno := inst DIV 1000H MOD 10H;
disp := inst MOD 1000H;
IF mno = 0 THEN (*global*)
IF vno = 0FFFFH THEN Put4(adr, MTOrg) (* MT *)
ELSE Put4(adr, mod.data + vno) (* global var offset *)
END
ELSE (*import*)
impmod := import[mno - 1];
Get4(impmod.ent + vno*4, offset);
Put4(adr, impmod.data + offset)
END;
adr := adr - disp
END;
(*fixup of type descriptors*)
adr := mod.data + fixorgT*4;
WHILE adr # mod.data DO
Get4(adr, inst);
mno := inst DIV 1000000H MOD 10H;
vno := inst DIV 1000H MOD 1000H;
disp := inst MOD 1000H;
IF mno = 0 THEN (*global*) inst := mod.data + vno
ELSE (*import*)
impmod := import[mno - 1];
Get4(impmod.ent + vno*4, offset);
inst := impmod.data + offset
END;
Put4(adr, inst); adr := adr - disp*4
END
ELSIF res >= 3 THEN importing := name;
WHILE nofimps > 0 DO DEC(nofimps); DEC(import[nofimps].refcnt) END
END;
END;
newmod := mod
END LinkIt;
PROCEDURE WriteShort (VAR R: Files.Rider; x: INTEGER);
BEGIN Files.WriteByte(R, x); Files.WriteByte(R, x DIV 256)
END WriteShort;
PROCEDURE WriteElf(M: Module);
VAR i, len: INTEGER;
filename: ModuleName;
F: Files.File;
R: Files.Rider;
BEGIN MakeFileName(filename, M.name, ".elf");
F := Files.New(filename); Files.Set(R, F, 0);
Files.WriteInt(R, 464C457FH); (* signature *)
Files.WriteInt(R, 00010101H); (* 32bit, little endian, elf v1, sysv *)
Files.WriteInt(R, 0); Files.WriteInt(R, 0); (* pad *)
WriteShort(R, 2); (* executable *)
WriteShort(R, 3); (* 386 *)
Files.WriteInt(R, 1); (* elf version *)
Files.WriteInt(R, entry); (* entry *)
Files.WriteInt(R, 52); (* program table offset *)
Files.WriteInt(R, 0); (* section table offset *)
Files.WriteInt(R, 0); (* flags *)
WriteShort(R, 52); (* elf header size *)
WriteShort(R, 32); (* program header entry size *)
WriteShort(R, 1); (* program header entry count *)
WriteShort(R, 0); (* section entry size *)
WriteShort(R, 0); (* section entry count *)
WriteShort(R, 0); (* section id for name table *)
(* program header *)
ASSERT(Files.Pos(R) = 52);
Files.WriteInt(R, 1); (* segment load *)
Files.WriteInt(R, 0); (* file offset *)
Files.WriteInt(R, ImageBase); (* virtual image base *)
Files.WriteInt(R, ImageBase); (* physical image base *)
Files.WriteInt(R, AllocPtr - ImageBase); (* image size in file *)
Files.WriteInt(R, limit - ImageBase); (* image size in memory *)
Files.WriteInt(R, 7); (* flags: rwx *)
Files.WriteInt(R, 4096); (* align *)
(* boot code *)
ASSERT(Files.Pos(R) = entry - ImageBase);
Files.WriteByte(R, 6AH); Files.WriteByte(R, 0); (* push 0 *)
Files.WriteByte(R, 0B8H + MT); Files.WriteInt(R, MTOrg); (* mov MT,MTOrg *)
Files.WriteByte(R, 0E9H); Files.WriteInt(R, M.body - (entry + 12)); (* jmp entry *)
i := 0; len := org - ImageBase - Files.Pos(R);
WHILE i < len DO Files.WriteByte(R, 90H); INC(i) END; (*pad*)
ASSERT(Files.Pos(R) = org - ImageBase);
Put4(org+0, entry); (* MTOrg-32: Soft reset vector *)
Put4(org+4, 0); (* MTOrg-28: Interrupt vector *)
Put4(org+8, 0); (* MTOrg-24: ??? *)
Put4(org+12, limit); (* MTOrg-20: The limit of available memory *)
Put4(org+16, AllocPtr); (* MTOrg-16: The address of the end of the module space loaded *)
Put4(org+20, root.adr); (* MTOrg-12: The current root of the links of loaded modules *)
Put4(org+24, limit); (* MTOrg-8: The current limit of the module area *)
Put4(org+28, 0); (* MTOrg-4: ? *)
i := 0; len := AllocPtr - org;
WHILE i < len DO Files.WriteByte(R, m.x[i]); INC(i) END;
Files.Register(F);
Texts.WriteString(W, filename); Texts.WriteString(W, " linked");
Texts.WriteLn(W); Texts.Append(Oberon.Log, W.buf)
END WriteElf;
PROCEDURE Link*;
VAR beg, end, time: INTEGER;
T: Texts.Text;
S: Texts.Scanner;
M: Module;
BEGIN M := NIL; NEW(m); NEW(root); AllocPtr := MTOrg + 4*MTSize; res := 0;
Texts.OpenScanner(S, Oberon.Par.text, Oberon.Par.pos); Texts.Scan(S);
IF (S.class = Texts.Char) & (S.c = "^") THEN
Oberon.GetSelection(T, beg, end, time);
IF time >= 0 THEN
Texts.OpenScanner(S, T, beg); Texts.Scan(S);
IF S.class = Texts.Name THEN
LinkIt(S.s, M)
END
END
ELSE
WHILE (res = 0) & (S.class = Texts.Name) DO
LinkIt(S.s, M); Texts.Scan(S)
END
END;
IF res = 0 THEN
WriteElf(M)
ELSE
Texts.WriteString(W, "link error: "); Texts.WriteString(W, importing);
IF res = 1 THEN Texts.WriteString(W, " module not found")
ELSIF res = 2 THEN Texts.WriteString(W, " bad version")
ELSIF res = 3 THEN Texts.WriteString(W, " imports ");
Texts.WriteString(W, imported); Texts.WriteString(W, " with bad key");
ELSIF res = 4 THEN Texts.WriteString(W, " corrupted obj file")
ELSIF res = 5 THEN Texts.WriteString(W, " command not found")
ELSIF res = 7 THEN Texts.WriteString(W, " insufficient space")
END;
Texts.WriteLn(W); Texts.Append(Oberon.Log, W.buf)
END;
m := NIL; root := NIL;
Oberon.Collect(0)
END Link;
PROCEDURE Load*;
END Load;
BEGIN Texts.OpenWriter(W); Texts.WriteString(W, "OR386 Linker 30.08.2024");
Texts.WriteLn(W); Texts.Append(Oberon.Log, W.buf)
END ORL.