|
0
|
1 module dmd.expression.Cmp;
|
|
|
2
|
|
114
|
3 import dmd.common;
|
|
0
|
4 import dmd.IntegerExp;
|
|
|
5 import dmd.Loc;
|
|
|
6 import dmd.TOK;
|
|
|
7 import dmd.Type;
|
|
|
8 import dmd.Expression;
|
|
|
9 import dmd.StringExp;
|
|
|
10 import dmd.GlobalExpressions;
|
|
|
11
|
|
|
12 import core.stdc.string;
|
|
|
13
|
|
|
14 Expression Cmp(TOK op, Type type, Expression e1, Expression e2)
|
|
|
15 {
|
|
|
16 Expression e;
|
|
|
17 Loc loc = e1.loc;
|
|
|
18 ulong n;
|
|
|
19 real r1;
|
|
|
20 real r2;
|
|
|
21
|
|
|
22 //printf("Cmp(e1 = %s, e2 = %s)\n", e1.toChars(), e2.toChars());
|
|
|
23
|
|
|
24 if (e1.op == TOKstring && e2.op == TOKstring)
|
|
|
25 {
|
|
|
26 StringExp es1 = cast(StringExp)e1;
|
|
|
27 StringExp es2 = cast(StringExp)e2;
|
|
|
28 size_t sz = es1.sz;
|
|
|
29 assert(sz == es2.sz);
|
|
|
30
|
|
|
31 size_t len = es1.len;
|
|
|
32 if (es2.len < len)
|
|
|
33 len = es2.len;
|
|
|
34
|
|
|
35 int cmp = memcmp(es1.string_, es2.string_, sz * len);
|
|
|
36 if (cmp == 0)
|
|
|
37 cmp = es1.len - es2.len;
|
|
|
38
|
|
|
39 switch (op)
|
|
|
40 {
|
|
|
41 case TOKlt: n = cmp < 0; break;
|
|
|
42 case TOKle: n = cmp <= 0; break;
|
|
|
43 case TOKgt: n = cmp > 0; break;
|
|
|
44 case TOKge: n = cmp >= 0; break;
|
|
|
45
|
|
|
46 case TOKleg: n = 1; break;
|
|
|
47 case TOKlg: n = cmp != 0; break;
|
|
|
48 case TOKunord: n = 0; break;
|
|
|
49 case TOKue: n = cmp == 0; break;
|
|
|
50 case TOKug: n = cmp > 0; break;
|
|
|
51 case TOKuge: n = cmp >= 0; break;
|
|
|
52 case TOKul: n = cmp < 0; break;
|
|
|
53 case TOKule: n = cmp <= 0; break;
|
|
|
54
|
|
|
55 default:
|
|
|
56 assert(0);
|
|
|
57 }
|
|
|
58 }
|
|
|
59 else if (e1.isConst() != 1 || e2.isConst() != 1)
|
|
|
60 return EXP_CANT_INTERPRET;
|
|
|
61 else if (e1.type.isreal())
|
|
|
62 {
|
|
|
63 r1 = e1.toReal();
|
|
|
64 r2 = e2.toReal();
|
|
|
65 goto L1;
|
|
|
66 }
|
|
|
67 else if (e1.type.isimaginary())
|
|
|
68 {
|
|
|
69 r1 = e1.toImaginary();
|
|
|
70 r2 = e2.toImaginary();
|
|
|
71 L1:
|
|
|
72
|
|
|
73 // DMC is the only compiler I know of that handles NAN arguments
|
|
|
74 // correctly in comparisons.
|
|
|
75 switch (op)
|
|
|
76 {
|
|
|
77 case TOKlt: n = r1 < r2; break;
|
|
|
78 case TOKle: n = r1 <= r2; break;
|
|
|
79 case TOKgt: n = r1 > r2; break;
|
|
|
80 case TOKge: n = r1 >= r2; break;
|
|
|
81 case TOKleg: n = r1 <>= r2; break;
|
|
|
82 case TOKlg: n = r1 <> r2; break;
|
|
|
83 case TOKunord: n = r1 !<>= r2; break;
|
|
|
84 case TOKue: n = r1 !<> r2; break;
|
|
|
85 case TOKug: n = r1 !<= r2; break;
|
|
|
86 case TOKuge: n = r1 !< r2; break;
|
|
|
87 case TOKul: n = r1 !>= r2; break;
|
|
|
88 case TOKule: n = r1 !> r2; break;
|
|
|
89
|
|
|
90 default: assert(0);
|
|
|
91 }
|
|
|
92 }
|
|
|
93 else if (e1.type.iscomplex())
|
|
|
94 {
|
|
|
95 assert(0);
|
|
|
96 }
|
|
|
97 else
|
|
|
98 {
|
|
|
99 long n1;
|
|
|
100 long n2;
|
|
|
101
|
|
|
102 n1 = e1.toInteger();
|
|
|
103 n2 = e2.toInteger();
|
|
|
104
|
|
|
105 if (e1.type.isunsigned() || e2.type.isunsigned())
|
|
|
106 {
|
|
|
107 switch (op)
|
|
|
108 {
|
|
|
109 case TOKlt: n = (cast(ulong) n1) < (cast(ulong) n2); break;
|
|
|
110 case TOKle: n = (cast(ulong) n1) <= (cast(ulong) n2); break;
|
|
|
111 case TOKgt: n = (cast(ulong) n1) > (cast(ulong) n2); break;
|
|
|
112 case TOKge: n = (cast(ulong) n1) >= (cast(ulong) n2); break;
|
|
|
113 case TOKleg: n = 1; break;
|
|
|
114 case TOKlg: n = (cast(ulong) n1) != (cast(ulong) n2); break;
|
|
|
115 case TOKunord: n = 0; break;
|
|
|
116 case TOKue: n = (cast(ulong) n1) == (cast(ulong) n2); break;
|
|
|
117 case TOKug: n = (cast(ulong) n1) > (cast(ulong) n2); break;
|
|
|
118 case TOKuge: n = (cast(ulong) n1) >= (cast(ulong) n2); break;
|
|
|
119 case TOKul: n = (cast(ulong) n1) < (cast(ulong) n2); break;
|
|
|
120 case TOKule: n = (cast(ulong) n1) <= (cast(ulong) n2); break;
|
|
|
121
|
|
|
122 default: assert(0);
|
|
|
123 }
|
|
|
124 }
|
|
|
125 else
|
|
|
126 {
|
|
|
127 switch (op)
|
|
|
128 {
|
|
|
129 case TOKlt: n = n1 < n2; break;
|
|
|
130 case TOKle: n = n1 <= n2; break;
|
|
|
131 case TOKgt: n = n1 > n2; break;
|
|
|
132 case TOKge: n = n1 >= n2; break;
|
|
|
133 case TOKleg: n = 1; break;
|
|
|
134 case TOKlg: n = n1 != n2; break;
|
|
|
135 case TOKunord: n = 0; break;
|
|
|
136 case TOKue: n = n1 == n2; break;
|
|
|
137 case TOKug: n = n1 > n2; break;
|
|
|
138 case TOKuge: n = n1 >= n2; break;
|
|
|
139 case TOKul: n = n1 < n2; break;
|
|
|
140 case TOKule: n = n1 <= n2; break;
|
|
|
141 default: assert(0);
|
|
|
142 }
|
|
|
143 }
|
|
|
144 }
|
|
|
145
|
|
|
146 e = new IntegerExp(loc, n, type);
|
|
|
147
|
|
|
148 return e;
|
|
|
149 } |
