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
|
/* Compiler implementation of the D programming language
* Copyright (C) 1999-2018 by The D Language Foundation, All Rights Reserved
* written by KennyTM
* http://www.digitalmars.com
* Distributed under the Boost Software License, Version 1.0.
* http://www.boost.org/LICENSE_1_0.txt
* https://github.com/D-Programming-Language/dmd/blob/master/src/intrange.c
*/
#include <stddef.h>
#include <stdint.h>
#include "intrange.h"
#include "mars.h"
#include "mtype.h"
#include "expression.h"
// Copy the sign to the value *x*. Equivalent to `sign ? -x : x`.
static uinteger_t copySign(uinteger_t x, bool sign)
{
// return sign ? -x : x;
return (x - (uinteger_t)sign) ^ -(uinteger_t)sign;
}
#ifndef UINT64_MAX
#define UINT64_MAX 0xFFFFFFFFFFFFFFFFULL
#endif
//==================== SignExtendedNumber ======================================
SignExtendedNumber SignExtendedNumber::fromInteger(uinteger_t value_)
{
return SignExtendedNumber(value_, value_ >> 63);
}
bool SignExtendedNumber::operator==(const SignExtendedNumber& a) const
{
return value == a.value && negative == a.negative;
}
bool SignExtendedNumber::operator<(const SignExtendedNumber& a) const
{
return (negative && !a.negative)
|| (negative == a.negative && value < a.value);
}
SignExtendedNumber SignExtendedNumber::extreme(bool minimum)
{
return SignExtendedNumber(minimum-1, minimum);
}
SignExtendedNumber SignExtendedNumber::max()
{
return SignExtendedNumber(UINT64_MAX, false);
}
SignExtendedNumber SignExtendedNumber::operator-() const
{
if (value == 0)
return SignExtendedNumber(-negative);
else
return SignExtendedNumber(-value, !negative);
}
SignExtendedNumber SignExtendedNumber::operator+(const SignExtendedNumber& a) const
{
uinteger_t sum = value + a.value;
bool carry = sum < value && sum < a.value;
if (negative != a.negative)
return SignExtendedNumber(sum, !carry);
else if (negative)
return SignExtendedNumber(carry ? sum : 0, true);
else
return SignExtendedNumber(carry ? UINT64_MAX : sum, false);
}
SignExtendedNumber SignExtendedNumber::operator-(const SignExtendedNumber& a) const
{
if (a.isMinimum())
return negative ? SignExtendedNumber(value, false) : max();
else
return *this + (-a);
}
SignExtendedNumber SignExtendedNumber::operator*(const SignExtendedNumber& a) const
{
// perform *saturated* multiplication, otherwise we may get bogus ranges
// like 0x10 * 0x10 == 0x100 == 0.
/* Special handling for zeros:
INT65_MIN * 0 = 0
INT65_MIN * + = INT65_MIN
INT65_MIN * - = INT65_MAX
0 * anything = 0
*/
if (value == 0)
{
if (!negative)
return *this;
else if (a.negative)
return max();
else
return a.value == 0 ? a : *this;
}
else if (a.value == 0)
return a * *this; // don't duplicate the symmetric case.
SignExtendedNumber rv;
// these are != 0 now surely.
uinteger_t tAbs = copySign(value, negative);
uinteger_t aAbs = copySign(a.value, a.negative);
rv.negative = negative != a.negative;
if (UINT64_MAX / tAbs < aAbs)
rv.value = rv.negative-1;
else
rv.value = copySign(tAbs * aAbs, rv.negative);
return rv;
}
SignExtendedNumber SignExtendedNumber::operator/(const SignExtendedNumber& a) const
{
/* special handling for zeros:
INT65_MIN / INT65_MIN = 1
anything / INT65_MIN = 0
+ / 0 = INT65_MAX (eh?)
- / 0 = INT65_MIN (eh?)
*/
if (a.value == 0)
{
if (a.negative)
return SignExtendedNumber(value == 0 && negative);
else
return extreme(negative);
}
uinteger_t aAbs = copySign(a.value, a.negative);
uinteger_t rvVal;
if (!isMinimum())
rvVal = copySign(value, negative) / aAbs;
// Special handling for INT65_MIN
// if the denominator is not a power of 2, it is same as UINT64_MAX / x.
else if (aAbs & (aAbs-1))
rvVal = UINT64_MAX / aAbs;
// otherwise, it's the same as reversing the bits of x.
else
{
if (aAbs == 1)
return extreme(!a.negative);
rvVal = 1ULL << 63;
aAbs >>= 1;
if (aAbs & 0xAAAAAAAAAAAAAAAAULL) rvVal >>= 1;
if (aAbs & 0xCCCCCCCCCCCCCCCCULL) rvVal >>= 2;
if (aAbs & 0xF0F0F0F0F0F0F0F0ULL) rvVal >>= 4;
if (aAbs & 0xFF00FF00FF00FF00ULL) rvVal >>= 8;
if (aAbs & 0xFFFF0000FFFF0000ULL) rvVal >>= 16;
if (aAbs & 0xFFFFFFFF00000000ULL) rvVal >>= 32;
}
bool rvNeg = negative != a.negative;
rvVal = copySign(rvVal, rvNeg);
return SignExtendedNumber(rvVal, rvVal != 0 && rvNeg);
}
SignExtendedNumber SignExtendedNumber::operator%(const SignExtendedNumber& a) const
{
if (a.value == 0)
return !a.negative ? a : isMinimum() ? SignExtendedNumber(0) : *this;
uinteger_t aAbs = copySign(a.value, a.negative);
uinteger_t rvVal;
// a % b == sgn(a) * abs(a) % abs(b).
if (!isMinimum())
rvVal = copySign(value, negative) % aAbs;
// Special handling for INT65_MIN
// if the denominator is not a power of 2, it is same as UINT64_MAX%x + 1.
else if (aAbs & (aAbs - 1))
rvVal = UINT64_MAX % aAbs + 1;
// otherwise, the modulus is trivially zero.
else
rvVal = 0;
rvVal = copySign(rvVal, negative);
return SignExtendedNumber(rvVal, rvVal != 0 && negative);
}
SignExtendedNumber& SignExtendedNumber::operator++()
{
if (value != UINT64_MAX)
++ value;
else if (negative)
{
value = 0;
negative = false;
}
return *this;
}
SignExtendedNumber SignExtendedNumber::operator<<(const SignExtendedNumber& a) const
{
// assume left-shift the shift-amount is always unsigned. Thus negative
// shifts will give huge result.
if (value == 0)
return *this;
else if (a.negative)
return extreme(negative);
uinteger_t v = copySign(value, negative);
// compute base-2 log of 'v' to determine the maximum allowed bits to shift.
// Ref: http://graphics.stanford.edu/~seander/bithacks.html#IntegerLog
// Why is this a size_t? Looks like a bug.
size_t r, s;
r = (v > 0xFFFFFFFFULL) << 5; v >>= r;
s = (v > 0xFFFFULL ) << 4; v >>= s; r |= s;
s = (v > 0xFFULL ) << 3; v >>= s; r |= s;
s = (v > 0xFULL ) << 2; v >>= s; r |= s;
s = (v > 0x3ULL ) << 1; v >>= s; r |= s;
r |= (v >> 1);
uinteger_t allowableShift = 63 - r;
if (a.value > allowableShift)
return extreme(negative);
else
return SignExtendedNumber(value << a.value, negative);
}
SignExtendedNumber SignExtendedNumber::operator>>(const SignExtendedNumber& a) const
{
if (a.negative || a.value > 64)
return negative ? SignExtendedNumber(-1, true) : SignExtendedNumber(0);
else if (isMinimum())
return a.value == 0 ? *this : SignExtendedNumber(-1ULL << (64-a.value), true);
uinteger_t x = value ^ -negative;
x >>= a.value;
return SignExtendedNumber(x ^ -negative, negative);
}
//==================== IntRange ================================================
IntRange IntRange::widest()
{
return IntRange(SignExtendedNumber::min(), SignExtendedNumber::max());
}
IntRange IntRange::fromType(Type *type)
{
return fromType(type, type->isunsigned());
}
IntRange IntRange::fromType(Type *type, bool isUnsigned)
{
if (!type->isintegral())
return widest();
uinteger_t mask = type->sizemask();
SignExtendedNumber lower(0), upper(mask);
if (type->toBasetype()->ty == Tdchar)
upper.value = 0x10FFFFULL;
else if (!isUnsigned)
{
lower.value = ~(mask >> 1);
lower.negative = true;
upper.value = (mask >> 1);
}
return IntRange(lower, upper);
}
IntRange IntRange::fromNumbers2(const SignExtendedNumber numbers[2])
{
if (numbers[0] < numbers[1])
return IntRange(numbers[0], numbers[1]);
else
return IntRange(numbers[1], numbers[0]);
}
IntRange IntRange::fromNumbers4(const SignExtendedNumber numbers[4])
{
IntRange ab = fromNumbers2(numbers);
IntRange cd = fromNumbers2(numbers + 2);
if (cd.imin < ab.imin)
ab.imin = cd.imin;
if (cd.imax > ab.imax)
ab.imax = cd.imax;
return ab;
}
bool IntRange::contains(const IntRange& a) const
{
return imin <= a.imin && imax >= a.imax;
}
bool IntRange::containsZero() const
{
return (imin.negative && !imax.negative)
|| (!imin.negative && imin.value == 0);
}
IntRange& IntRange::castUnsigned(uinteger_t mask)
{
// .... 0x1eff ] [0x1f00 .. 0x1fff] [0 .. 0xff] [0x100 .. 0x1ff] [0x200 ....
//
// regular unsigned type. We just need to see if ir steps across the
// boundary of validRange. If yes, ir will represent the whole validRange,
// otherwise, we just take the modulus.
// e.g. [0x105, 0x107] & 0xff == [5, 7]
// [0x105, 0x207] & 0xff == [0, 0xff]
uinteger_t minChunk = imin.value & ~mask;
uinteger_t maxChunk = imax.value & ~mask;
if (minChunk == maxChunk && imin.negative == imax.negative)
{
imin.value &= mask;
imax.value &= mask;
}
else
{
imin.value = 0;
imax.value = mask;
}
imin.negative = imax.negative = false;
return *this;
}
IntRange& IntRange::castSigned(uinteger_t mask)
{
// .... 0x1e7f ] [0x1e80 .. 0x1f7f] [0x1f80 .. 0x7f] [0x80 .. 0x17f] [0x180 ....
//
// regular signed type. We use a technique similar to the unsigned version,
// but the chunk has to be offset by 1/2 of the range.
uinteger_t halfChunkMask = mask >> 1;
uinteger_t minHalfChunk = imin.value & ~halfChunkMask;
uinteger_t maxHalfChunk = imax.value & ~halfChunkMask;
int minHalfChunkNegativity = imin.negative; // 1 = neg, 0 = nonneg, -1 = chunk containing ::max
int maxHalfChunkNegativity = imax.negative;
if (minHalfChunk & mask)
{
minHalfChunk += halfChunkMask+1;
if (minHalfChunk == 0)
-- minHalfChunkNegativity;
}
if (maxHalfChunk & mask)
{
maxHalfChunk += halfChunkMask+1;
if (maxHalfChunk == 0)
-- maxHalfChunkNegativity;
}
if (minHalfChunk == maxHalfChunk && minHalfChunkNegativity == maxHalfChunkNegativity)
{
imin.value &= mask;
imax.value &= mask;
// sign extend if necessary.
imin.negative = imin.value & ~halfChunkMask;
imax.negative = imax.value & ~halfChunkMask;
halfChunkMask += 1;
imin.value = (imin.value ^ halfChunkMask) - halfChunkMask;
imax.value = (imax.value ^ halfChunkMask) - halfChunkMask;
}
else
{
imin = SignExtendedNumber(~halfChunkMask, true);
imax = SignExtendedNumber(halfChunkMask, false);
}
return *this;
}
IntRange& IntRange::castDchar()
{
// special case for dchar. Casting to dchar means "I'll ignore all
// invalid characters."
castUnsigned(0xFFFFFFFFULL);
if (imin.value > 0x10FFFFULL) // ??
imin.value = 0x10FFFFULL; // ??
if (imax.value > 0x10FFFFULL)
imax.value = 0x10FFFFULL;
return *this;
}
IntRange& IntRange::cast(Type *type)
{
if (!type->isintegral())
return *this;
else if (!type->isunsigned())
return castSigned(type->sizemask());
else if (type->toBasetype()->ty == Tdchar)
return castDchar();
else
return castUnsigned(type->sizemask());
}
IntRange& IntRange::castUnsigned(Type *type)
{
if (!type->isintegral())
return castUnsigned(UINT64_MAX);
else if (type->toBasetype()->ty == Tdchar)
return castDchar();
else
return castUnsigned(type->sizemask());
}
IntRange IntRange::absNeg() const
{
if (imax.negative)
return *this;
else if (!imin.negative)
return IntRange(-imax, -imin);
else
{
SignExtendedNumber imaxAbsNeg = -imax;
return IntRange(imaxAbsNeg < imin ? imaxAbsNeg : imin,
SignExtendedNumber(0));
}
}
IntRange IntRange::unionWith(const IntRange& other) const
{
return IntRange(imin < other.imin ? imin : other.imin,
imax > other.imax ? imax : other.imax);
}
void IntRange::unionOrAssign(const IntRange& other, bool& union_)
{
if (!union_ || imin > other.imin)
imin = other.imin;
if (!union_ || imax < other.imax)
imax = other.imax;
union_ = true;
}
void IntRange::splitBySign(IntRange& negRange, bool& hasNegRange,
IntRange& nonNegRange, bool& hasNonNegRange) const
{
hasNegRange = imin.negative;
if (hasNegRange)
{
negRange.imin = imin;
negRange.imax = imax.negative ? imax : SignExtendedNumber(-1, true);
}
hasNonNegRange = !imax.negative;
if (hasNonNegRange)
{
nonNegRange.imin = imin.negative ? SignExtendedNumber(0) : imin;
nonNegRange.imax = imax;
}
}
const IntRange& IntRange::dump(const char* funcName, Expression *e) const
{
printf("[(%c)%#018llx, (%c)%#018llx] @ %s ::: %s\n",
imin.negative?'-':'+', (unsigned long long)imin.value,
imax.negative?'-':'+', (unsigned long long)imax.value,
funcName, e->toChars());
return *this;
}
|