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
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
|
{****************************************************************}
{ CODE GENERATOR TEST PROGRAM }
{****************************************************************}
{ NODE TESTED : secondin() }
{****************************************************************}
{ PRE-REQUISITES: secondload() }
{ secondassign() }
{ secondtypeconv() }
{ secondadd() for sets }
{ secondsetelement() }
{ secondcalln() }
{ secondfuncret() }
{****************************************************************}
{ DEFINES: }
{ FPC = Target is FreePascal compiler }
{****************************************************************}
{ REMARKS: }
{ }
{ }
{ }
{****************************************************************}
type
{ DO NOT CHANGE THE VALUES OF THESE ENUMERATIONS! }
{ This will fit into a 32-bit small set }
tsmallenum = (dA,dB,dC,dd,de,df,dg,dh,di,dj,dk,dl,dm,dn,dop,dp,dq,dr);
{ This will fit into a normal 32-byte set }
tbigenum = (A_ABCD,
A_ADD,A_ADDA,A_ADDI,A_ADDQ,A_ADDX,A_AND,A_ANDI,
A_ASL,A_ASR,A_BCC,A_BCS,A_BEQ,A_BGE,A_BGT,A_BHI,
A_BLE,A_BLS,A_BLT,A_BMI,A_BNE,A_BPL,A_BVC,A_BVS,
A_BCHG,A_BCLR,A_BRA,A_BSET,A_BSR,A_BTST,A_CHK,
A_CLR,A_CMP,A_CMPA,A_CMPI,A_CMPM,A_DBCC,A_DBCS,A_DBEQ,A_DBGE,
A_DBGT,A_DBHI,A_DBLE,A_DBLS,A_DBLT,A_DBMI,A_DBNE,A_DBRA,
A_DBPL,A_DBT,A_DBVC,A_DBVS,A_DBF,A_DIVS,A_DIVU,
A_EOR,A_EORI,A_EXG,A_ILLEGAL,A_EXT,A_JMP,A_JSR,
A_LEA,A_LINK,A_LSL,A_LSR,A_MOVE,A_MOVEA,A_MOVEI,A_MOVEQ,
A_MOVEM,A_MOVEP,A_MULS,A_MULU,A_NBCD,A_NEG,A_NEGX,
A_NOP,A_NOT,A_OR,A_ORI,A_PEA,A_ROL,A_ROR,A_ROXL,
A_ROXR,A_RTR,A_RTS,A_SBCD,A_SCC,A_SCS,A_SEQ,A_SGE,
A_SGT,A_SHI,A_SLE,A_SLS,A_SLT,A_SMI,A_SNE,
A_SPL,A_ST,A_SVC,A_SVS,A_SF,A_SUB,A_SUBA,A_SUBI,A_SUBQ,
A_SUBX,A_SWAP,A_TAS,A_TRAP,A_TRAPV,A_TST,A_UNLK,
A_RTE,A_RESET,A_STOP,
A_BKPT,A_MOVEC,A_MOVES,A_RTD,
A_BFCHG,A_BFCLR,A_BFEXTS,A_BFEXTU,A_BFFFO,
A_BFINS,A_BFSET,A_BFTST,A_CALLM,A_CAS,A_CAS2,
A_CHK2,A_CMP2,A_DIVSL,A_DIVUL,A_EXTB,A_PACK,A_RTM,
A_TRAPCC,A_TRACS,A_TRAPEQ,A_TRAPF,A_TRAPGE,A_TRAPGT,
A_TRAPHI,A_TRAPLE,A_TRAPLS,A_TRAPLT,A_TRAPMI,A_TRAPNE,
A_TRAPPL,A_TRAPT,A_TRAPVC,A_TRAPVS,A_UNPK,
{ FPU Processor instructions - directly supported only. }
{ IEEE aware and misc. condition codes not supported }
A_FABS,A_FADD,
A_FBEQ,A_FBNE,A_FBNGT,A_FBGT,A_FBGE,A_FBNGE,
A_FBLT,A_FBNLT,A_FBLE,A_FBGL,A_FBNGL,A_FBGLE,A_FBNGLE,
A_FDBEQ,A_FDBNE,A_FDBGT,A_FDBNGT,A_FDBGE,A_FDBNGE,
A_FDBLT,A_FDBNLT,A_FDBLE,A_FDBGL,A_FDBNGL,A_FDBGLE,A_FBDNGLE,
A_FSEQ,A_FSNE,A_FSGT,A_FSNGT,A_FSGE,A_FSNGE,
A_FSLT,A_FSNLT,A_FSLE,A_FSGL,A_FSNGL,A_FSGLE,A_FSNGLE,
A_FCMP,A_FDIV,A_FMOVE,A_FMOVEM,
A_FMUL,A_FNEG,A_FNOP,A_FSQRT,A_FSUB,A_FSGLDIV,
A_FSFLMUL,A_FTST,
A_FTRAPEQ,A_FTRAPNE,A_FTRAPGT,A_FTRAPNGT,A_FTRAPGE,A_FTRAPNGE,
A_FTRAPLT,A_FTRAPNLT,A_FTRAPLE,A_FTRAPGL,A_FTRAPNGL,A_FTRAPGLE,A_FTRAPNGLE,
A_CPRESTORE,A_CPSAVE,
A_FRESTORE,A_FSAVE,A_PFLUSH,A_PFLUSHA,A_PLOAD,A_PMOVE,A_PTEST,
A_LABEL,A_NONE);
{ this is also a normal set }
tregister = (R_NO,
R_EAX,R_ECX,R_EDX,R_EBX,R_ESP,R_EBP,R_ESI,R_EDI,
R_AX,R_CX,R_DX,R_BX,R_SP,R_BP,R_SI,R_DI,
R_AL,R_CL,R_DL,R_BL,R_AH,R_CH,R_BH,R_DH,
R_CS,R_DS,R_ES,R_SS,R_FS,R_GS,
R_ST,R_ST0,R_ST1,R_ST2,R_ST3,R_ST4,R_ST5,R_ST6,R_ST7,
R_DR0,R_DR1,R_DR2,R_DR3,R_DR6,R_DR7,
R_CR0,R_CR2,R_CR3,R_CR4,
R_TR3,R_TR4,R_TR5,R_TR6,R_TR7,
R_MM0,R_MM1,R_MM2,R_MM3,R_MM4,R_MM5,R_MM6,R_MM7,
R_XMM0,R_XMM1,R_XMM2,R_XMM3,R_XMM4,R_XMM5,R_XMM6,R_XMM7
);
const
LoReg = R_EAX;
HiReg = R_DH;
type
tnormalset = set of tbigenum;
tsmallset = set of tsmallenum;
tregset = set of LoReg..HiReg;
procedure checkpassed(passed : boolean);
begin
if passed then
WriteLn('Passed!')
else
begin
WriteLn('Failure.');
Halt(1);
end;
end;
var
NewRegsEncountered : TRegSet;
function Reg32 : tregister;
begin
Reg32:=R_EAX;
end;
{*******************************************************************}
{ The following cases are possible }
{ jump table usage }
{ small set or normal set }
{ source location : REFERENCE,MEMORY,CONSTANT or REGISTER }
{*******************************************************************}
{ NO GENERATION OF JUMP TABLE }
{ SMALL SET }
procedure smallsettestone;
var
op1 : tsmallset;
op2 : tsmallset;
op3 : tsmallset;
op : tsmallenum;
passed : boolean;
begin
passed := true;
Write('Small set in operator test (without case table)...');
{ LEFT : LOC_REFERENCE (not a constant node) }
{ RIGHT : LOC_REFERENCE }
op1 := [DI];
op2 := [DI];
op := DI;
if not (op in op1) then
passed := false;
{ LEFT : LOC_REFERENCE (a constant node) }
{ RIGHT: LOC_REFERENCE }
op1 := [DL];
op := DI;
if not (DL in op1) then
passed := false;
{ LEFT : LOC_REFERENCE (a constant node) }
{ THIS CAN NEVER HAPPEN - EVALUATED AT COMPILE TIME BY COMPILER }
op1 := [DB];
op := DB;
if not (DB in [DA..DL]) then
passed := false;
{ LEFT : LOC_REFERENCE (not a constant node) }
{ RIGHT : LOC_REGISTER,LOC_CREGISTER }
op := DF;
op2 := [DB];
op3 := [DF];
if not (op in (op2+op3)) then
passed := false;
{ LEFT : LOC_REGISTER (a constant node) }
{ RIGHT : LOC_REGISTER,LOC_CREGISTER }
op2 := [DB];
op3 := [DF];
if not (DB in (op2+op3)) then
passed := false;
checkpassed(passed);
end;
{ returns result in register }
function getsmallop : tsmallenum;
begin
getsmallop := DQ;
end;
{ NO GENERATION OF JUMP TABLE }
{ SMALL SET }
procedure smallsettestthree;
var
op1 : tsmallset;
op2 : tsmallset;
op3 : tsmallset;
op : tsmallenum;
passed : boolean;
begin
passed := true;
Write('Small set in operator test (without case table)...');
{ LEFT : LOC_REGISTER (not a constant node) }
{ RIGHT : LOC_REFERENCE }
op1 := [DQ];
op2 := [DQ];
if not (getsmallop in op1) then
passed := false;
{ LEFT : LOC_REGISTER (not a constant node) }
{ RIGHT : LOC_REGISTER }
op := DF;
op2 := [DB,DQ];
op3 := [DF];
if not (getsmallop in (op2+op3)) then
passed := false;
checkpassed(passed);
end;
{ GENERATION OF JUMP TABLE }
{ SMALL SET }
procedure smallsettesttwo;
var
op1 : tsmallset;
op2 : tsmallset;
op : tsmallenum;
passed : boolean;
begin
Write('Small set in operator test (with case table)...');
passed := true;
op := DN;
{ LEFT : LOC_REFERENCE }
{ RIGHT: range constant set (carry flag) }
if not (op in [DB..DN]) then
passed := false;
{ LEFT : LOC_REFERENCE }
{ RIGHT: NOT range constant set (zero flag) }
op := DH;
if not (op in [DB,DH,DP]) then
passed := false;
{ LEFT : LOC_REFERENCE }
{ RIGHT : range constant set with full set }
op:=DK;
if not (op in [dA,dB,dC,dd,de,df,dg,dh,di,dj,dk,dl,dm,dn,dop,dp,dq,dr]) then
passed := false;
{ LEFT : LOC_REGISTER }
{ RIGHT : NOT range constant set (zero flag) }
op := DH;
if not (getsmallop in [DA,DB..DN,DQ]) then
passed := false;
{ LEFT : LOC_REGISTER }
{ RIGHT : range constant set with full set }
if not (getsmallop in [dA,dB,dC,dd,de,df,dg,dh,di,dj,dk,dl,dm,dn,dop,dp,dq,dr]) then
passed := false;
checkpassed(passed);
end;
{ returns result in register }
function getop : tbigenum;
begin
getop := A_BFSET;
end;
{ NO JUMP TABLE }
{ NORMAL SETS }
procedure settestone;
var
op1 : tnormalset;
op2 : tnormalset;
op : tbigenum;
passed : boolean;
begin
Write('Normal set in operator test (without case table)...');
passed := true;
{ RIGHT NODE = immediate value in reference field ?? }
{ RIGHT node = ordconstn (how is this possible?) - it goes through }
{ analizeset! }
{ Left : LOC_REGISTER }
{ right : LOC_REFERENCE (call to sys) }
if not (getop in [A_BFSET,A_MOVE,A_TRAP,A_CMP,A_CMPI,A_FADD,A_LABEL,A_ASL,A_ADDX]) then
passed := false;
op := A_MOVE;
{ Left : LOC_REFERENCE }
{ right : LOC_REFERENCE }
if not (op in [A_BFSET,A_MOVE,A_TRAP,A_CMP,A_CMPI,A_FADD,A_LABEL,A_ASL,A_ADDX]) then
passed := false;
{ Left : ordinal constant }
{ right : LOC_REFERENCE }
op1 := [A_MOVE,A_TRAP];
if not (A_MOVE in op1) then
passed := false;
checkpassed(passed);
end;
{ WITH JUMP TABLE }
{ NORMAL SETS }
procedure settesttwo;
var
op1 : tnormalset;
op2 : tnormalset;
bs : set of boolean;
op : tbigenum;
passed : boolean;
begin
Write('Normal set in operator test (with case table)...');
passed := true;
{ Left : LOC_REGISTER }
{ right : LOC_REFERENCE with ranges }
if not (getop in [A_BFSET,A_MOVE,A_ASL..A_BCC]) then
passed := false;
{ Left : LOC_REGISTER }
{ right : LOC_REFERENCE no ranges }
if not (getop in [A_BFSET,A_MOVE]) then
passed := false;
{ Left : LOC_REGISTER }
{ right : no set at all }
if getop in [] then
passed:=false;
{ Left : LOC_REGISTER }
{ right : complete set definition }
if not (getop in [A_ABCD..A_NONE]) then
passed:=false;
op := A_MOVE;
{ Left : LOC_REFERENCE }
{ right : LOC_REFERENCE with ranges }
if not (getop in [A_BFSET,A_MOVE,A_ASL..A_BCC]) then
passed := false;
op:= A_MOVE;
if not (getop in [A_BFSET,A_MOVE]) then
passed := false;
{ Left : LOC_REFERENCE }
{ right : no set at all }
op := A_MOVE;
if op in [] then
passed:=false;
{ Left : LOC_REFERENCE }
{ right : complete set definition }
op:=A_MOVE;
if not (op in [A_ABCD..A_NONE]) then
passed:=false;
checkpassed(passed);
{ LEFT : LOC_JUMP }
{ RIGHT : LOC_REGISTER,LOC_CREGISTER }
bs:=[false,true];
op:=A_MOVE;
passed:=true;
if not(not(op in [A_BFSET,A_MOVE,A_ASL..A_BCC]) in bs) then
passed := false;
if not((op in [A_BFSET,A_MOVE,A_ASL..A_BCC]) in bs) then
passed := false;
bs:=[false];
if ((op in [A_BFSET,A_MOVE,A_ASL..A_BCC]) in bs) then
passed := false;
checkpassed(passed);
end;
{ WITH JUMP TABLE }
{ NORMAL SETS }
procedure settestthree;
var
passed : boolean;
begin
Write('Normal set in operator test II (without case table)...');
passed := false;
NewRegsEncountered := [R_EAX..R_EDX];
If (Reg32 in NewRegsEncountered) Then
passed := true;
checkpassed(passed);
end;
Begin
smallsettestone;
smallsettesttwo;
smallsettestthree;
settestone;
settesttwo;
settestthree;
end.
|