-
Notifications
You must be signed in to change notification settings - Fork 0
/
Symbol.java
822 lines (708 loc) · 23.2 KB
/
Symbol.java
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
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.ListIterator;
import omf.*;
/*
* Created on Feb 4, 2006
* Feb 4, 2006 1:28:12 PM
*/
/**
* @author Kelvin Feb 4, 2006 1:28:12 PM
*/
public class Symbol
{
public ArrayList expression;
public ArrayList<String> using;
public OMF_Segment segment;
public String segmentname;
public int location;
public int offset;
public int size;
public int type;
public int displacement;
public int file;
public OMF_Data data;
private int fState;
private SymbolMath fReduced;
private SymbolTable fLocal;
private SymbolTable fGlobal;
static private final int STATE_UNKNOWN = 0;
static private final int STATE_REDUCING = 1;
static private final int STATE_REDUCED = 2;
static private final int STATE_ERROR = -1;
public Symbol(SymbolTable local, SymbolTable global)
{
fState = STATE_UNKNOWN;
fLocal = local;
fGlobal = global;
fReduced = null;
data = null;
displacement = 0;
type = 0;
size = 0;
offset = 0;
location = 0;
file = 1;
segmentname = null;
using = null;
expression = null;
}
private void Error(int error, String arg) throws LinkError
{
fReduced = new SymbolMath(0);
fState = STATE_ERROR;
throw new LinkError(error, this, arg);
}
/*
* return a list of missing labels.
*/
public void FindMissing(HashSet<String> out)
{
if (expression != null)
{
ListIterator iter;
iter = expression.listIterator();
while (iter.hasNext())
{
Object o = iter.next();
if (o instanceof OMF_Label)
{
OMF_Label lab = (OMF_Label) o;
String name = lab.toString();
int opcode = lab.Opcode();
if (opcode == OMF_Expression.EXPR_COUNT)
continue;
if (opcode == OMF_Expression.EXPR_WEAK)
continue;
try
{
Symbol sym;
sym = fLocal.FindEntry(name, using);
if (sym != null)
continue;
sym = fGlobal.FindEntry(name, using);
if (sym != null)
continue;
out.add(name);
}
catch (LinkError e)
{
}
}
}
}
}
/*
* reduce a symbol to a constant or a label. throws an error if the symbol
* can't be reduced (undefined, too complex, or recursive).
*/
public SymbolMath Reduce() throws LinkError
{
if (fState == STATE_REDUCED || fState == STATE_ERROR)
return fReduced;
if (fState == STATE_REDUCING)
{
// oops - recursive.
// throw an error.
Error(LinkError.E_RECURSIVE, null);
}
// if expression is null, then this is a label and the value is the
// location.
if (expression == null)
{
fState = STATE_REDUCED;
fReduced = new SymbolLabel(location, segment, file);
return fReduced;
}
// otherwise, this is an expression that must be evaluated.
Stack<SymbolMath> stack = new Stack<SymbolMath>();
fState = STATE_REDUCING;
// now evaluate the expression...
ListIterator iter;
iter = expression.listIterator();
while (iter.hasNext())
{
Object o = iter.next();
if (o instanceof OMF_Label)
{
OMF_Label lab = (OMF_Label) o;
String name = lab.toString();
Symbol sym = fLocal.FindEntry(name, using);
if (sym == null)
{
sym = fGlobal.FindEntry(name, using);
}
// TODO - check using.
// sym is either an OMF_Local or OMF_Equ.
// if it's an Equ, we need to reduce the expression.
// WEAK and COUNT operations don't care if the symbol is
// undefined.
switch (lab.Opcode()) {
case OMF_Expression.EXPR_COUNT:
stack.push(new SymbolMath(sym == null ? 0 : 1));
continue;
case OMF_Expression.EXPR_WEAK:
// not an error.
if (sym == null)
{
stack.push(new SymbolMath(0));
continue;
} else
{
stack.push(sym.Reduce().Copy());
}
continue;
}
if (sym == null)
{
Error(LinkError.E_UNRESOLVED, name);
}
switch (lab.Opcode()) {
case OMF_Expression.EXPR_LEN:
stack.push(new SymbolMath(sym.size));
break;
case OMF_Expression.EXPR_LABEL:
stack.push(sym.Reduce().Copy());
continue;
case OMF_Expression.EXPR_TYPE:
stack.push(new SymbolMath(sym.type));
break;
default:
Error(LinkError.E_BADOP, Integer.toString(lab.Opcode()));
}
continue;
}
if (o instanceof OMF_Number)
{
OMF_Number num = (OMF_Number) o;
switch (num.Opcode()) {
case OMF_Expression.EXPR_CLC:
// TODO - verify this is correct
stack.push(new SymbolMath(location));
break;
case OMF_Expression.EXPR_ABS:
stack.push(new SymbolMath(num.Value()));
break;
case OMF_Expression.EXPR_REL:
// convert to
stack.push(new SymbolLabel(location - offset + num.Value(),
segment, file));
// TODO - verify this is correct
// stack.push(new SymbolMath(location - offset +
// num.Value()));
break;
default:
Error(LinkError.E_BADOP, Integer.toString(num.Opcode()));
}
}
// integer signifies a mathematical operator
if (o instanceof Integer)
{
SymbolMath s1, s2;
boolean err = false;
int val = ((Integer) o).intValue();
if (val == OMF_Expression.EXPR_END)
break;
/*
* the stack operations and math operations will throw an
* exception, so this code will catch and rethrow.
*/
try
{
switch (val) {
// negate the value
case OMF_Expression.EXPR_NEG:
s1 = stack.pop();
stack.push(s1.negate());
break;
case OMF_Expression.EXPR_ADD:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.add(s1));
break;
case OMF_Expression.EXPR_SUB:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.subtract(s1));
break;
case OMF_Expression.EXPR_MUL:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.multiply(s1));
break;
case OMF_Expression.EXPR_DIV:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.divide(s1));
break;
case OMF_Expression.EXPR_MOD:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.modulo(s1));
break;
case OMF_Expression.EXPR_SHIFT:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.bit_shift(s1));
break;
case OMF_Expression.EXPR_BAND:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.bit_and(s1));
break;
case OMF_Expression.EXPR_BOR:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.bit_or(s1));
break;
case OMF_Expression.EXPR_BNOT:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.bit_not(s1));
break;
case OMF_Expression.EXPR_BEOR:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.bit_eor(s1));
break;
case OMF_Expression.EXPR_LAND:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_and(s1));
break;
case OMF_Expression.EXPR_LOR:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_or(s1));
break;
case OMF_Expression.EXPR_LNOT:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_not(s1));
break;
case OMF_Expression.EXPR_LEOR:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_eor(s1));
break;
case OMF_Expression.EXPR_GT:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_gt(s1));
break;
case OMF_Expression.EXPR_LT:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_lt(s1));
break;
case OMF_Expression.EXPR_GE:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_ge(s1));
break;
case OMF_Expression.EXPR_LE:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_le(s1));
break;
case OMF_Expression.EXPR_EQ:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_eq(s1));
break;
case OMF_Expression.EXPR_NE:
s1 = stack.pop();
s2 = stack.pop();
stack.push(s2.logical_ne(s1));
break;
default:
err = true;
}
}
catch (Exception e)
{
// TODO -- check if stack or math error
Error(LinkError.E_COMPLEX, null);
}
if (err)
{
Error(LinkError.E_BADOP, Integer.toString(val));
}
}
}
// done iterating through the expression.
// at this point, stack should have 1 item, otherwise it's an error.
if (stack.size() != 1)
Error(LinkError.E_EXPRESSION, null);
fReduced = stack.remove(0);
fState = STATE_REDUCED;
return fReduced;
}
}
// TODO -- if labels are in different segments, should convert to a SymbolLabel.
class SymbolMath implements Cloneable
{
public int value;
public SymbolMath(Integer i)
{
value = i.intValue();
}
public SymbolMath(int v)
{
value = v;
}
public int Value()
{
return value;
}
public int Shift()
{
return 0;
}
public boolean isReloc()
{
return false;
}
public OMF_Relocation Reloc(OMF_Segment omf, int size, int offset)
{
return null;
}
public Object clone()
{
try
{
return super.clone();
}
catch (Exception e)
{
return null;
}
}
// might be better to have a refCount variable.
// retain would just increment the refcount
// add/subtract/etc would check if refcount > 0, and
// return a new copy in that case.
// could reduce extra copies.
public SymbolMath Copy()
{
return (SymbolMath) clone();
}
public SymbolMath add(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
return sym.add(this);
value += sym.value;
return this;
}
public SymbolMath subtract(SymbolMath sym) throws Exception
{
// slightly incorrect, but it's easier to handle it here.
if (sym instanceof SymbolLabel)
{
// eg 5-label .... weird but valid.
SymbolLabel l = (SymbolLabel) sym;
if (l.Shift() != 0)
throw new Exception();
l.value = value - l.value;
return sym;
}
value -= sym.value;
return this;
}
public SymbolMath multiply(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value *= sym.value;
return this;
}
public SymbolMath divide(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value /= sym.value;
return this;
}
public SymbolMath modulo(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value %= sym.value;
return this;
}
public SymbolMath bit_shift(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
if (sym.value > 0)
value >>= sym.value;
else
{
value <<= (-sym.value);
}
return this;
}
public SymbolMath bit_and(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value &= sym.value;
return this;
}
public SymbolMath bit_or(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value |= sym.value;
return this;
}
public SymbolMath bit_eor(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value ^= sym.value;
return this;
}
public SymbolMath bit_not(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value &= ~sym.value;
return this;
}
public SymbolMath negate() throws Exception
{
value = -value;
return this;
}
public SymbolMath logical_and(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = ((value != 0) && (sym.value != 0)) ? 1 : 0;
return this;
}
public SymbolMath logical_or(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = ((value != 0) || (sym.value != 0)) ? 1 : 0;
return this;
}
public SymbolMath logical_eor(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
if (value == 0)
{
value = (sym.value == 0) ? 0 : 1;
} else
{
value = (sym.value == 0) ? 1 : 0;
}
return this;
}
public SymbolMath logical_not(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value != sym.value) ? 1 : 0;
return this;
}
public SymbolMath logical_gt(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value > sym.value) ? 1 : 0;
return this;
}
public SymbolMath logical_lt(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value < sym.value) ? 1 : 0;
return this;
}
public SymbolMath logical_eq(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value == sym.value) ? 1 : 0;
return this;
}
public SymbolMath logical_ne(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value != sym.value) ? 1 : 0;
return this;
}
public SymbolMath logical_ge(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value >= sym.value) ? 1 : 0;
return this;
}
public SymbolMath logical_le(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
value = (value <= sym.value) ? 1 : 0;
return this;
}
}
class SymbolLabel extends SymbolMath
{
public OMF_Segment segment;
public int fShift;
private int fFile;
public SymbolLabel(int v, OMF_Segment seg, int file)
{
super(v);
segment = seg;
fShift = 0;
fFile = file;
}
public int Shift()
{
return fShift;
}
public boolean isReloc()
{
return true;
}
/**
* return a relocation record. will be either OMF_Reloc of OMF_Interseg,
*/
public OMF_Relocation Reloc(OMF_Segment seg, int size, int offset)
{
if (seg == segment)
{
return new OMF_Reloc(size, fShift, offset, value);
}
return new OMF_Interseg(size, fShift, offset, seg.File(),
segment.SegmentNumber(), value);
// return null;
}
// these operations are supported:
public SymbolMath add(SymbolMath sym) throws Exception
{
// can't modify if it's shifted.
if (fShift != 0)
throw new Exception();
if (sym instanceof SymbolLabel)
{
SymbolLabel l = (SymbolLabel) sym;
// can only add if it's in the same segment.
if (l.segment != segment)
throw new Exception();
if (l.fShift != 0)
throw new Exception();
value += l.value;
} else
value += sym.value;
return this;
}
public SymbolMath subtract(SymbolMath sym) throws Exception
{
// can't modify if it's shifted.
if (fShift != 0)
throw new Exception();
if (sym instanceof SymbolLabel)
{
SymbolLabel l = (SymbolLabel) sym;
// can only add if it's in the same segment.
if (l.segment != segment)
throw new Exception();
if (l.fShift != 0)
throw new Exception();
value -= l.value;
} else
value -= sym.value;
return this;
}
public SymbolMath bit_shift(SymbolMath sym) throws Exception
{
if (sym instanceof SymbolLabel)
throw new Exception();
fShift += sym.value;
return this;
}
// these ones are not.
public SymbolMath multiply(SymbolMath sym) throws Exception
{
// for powers of 2, we could shift...but orca doesn't.
throw new Exception();
}
public SymbolMath divide(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath modulo(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath bit_and(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath bit_or(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath bit_eor(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath bit_not(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath negate(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_and(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_or(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_eor(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_not(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_gt(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_lt(SymbolMath sym) throws Exception
{
throw new Exception();
}
// TODO - logical eq/ne/ should work if both are labels.
public SymbolMath logical_eq(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_ne(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_ge(SymbolMath sym) throws Exception
{
throw new Exception();
}
public SymbolMath logical_le(SymbolMath sym) throws Exception
{
throw new Exception();
}
}