-
Notifications
You must be signed in to change notification settings - Fork 9
/
AbsRegion.h
1495 lines (1320 loc) · 48.6 KB
/
AbsRegion.h
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
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// TODO:
// 1) If we had an Interval base-class of StridedInterval, that would be
// a better abstraction of the size field in Region.
// 2) Optimize operations on ValueSet so as to use more incrementality
// for small changes
// 3) Misaligned writes could be handled more precisely if the bounds
// of the written values were analyzed carefully.
// 4) Writing regions indirectly through ValueSet write function is a
// bit too heavy-weight, optimize that.
// 5) add collect functionality to collect equivalent chunks remaining
// after splitting.
// 6) implement restrict in Region
// 7) finish more precise implementation of misaligned writes
// 8) handle misaligned joins/widen more precisely
#ifndef ABSTRACT_REGION_H
#define ABSTRACT_REGION_H
#include "ValSet.h"
#include "Utilities.h"
#include "HashFunctions.h"
#include "MemMap.h"
#include "Registers.h"
#include "AbsDomStridedInterval.h"
#include "warning.h"
namespace absdomain {
// Info: The T type has to satisfy all requirements described in
// RedBlackTree.h, and it has to inherit AbstractDomain.
template <typename T>
class Region : public utils::pt::Counted {
public:
typedef Region<T> _Self;
typedef typename boost::intrusive_ptr<_Self> RegionPtr;
typedef boost::intrusive_ptr<T> TPtr;
typedef std::pair<RegionPtr, TPtr> AlocPair;
typedef typename ValueSet<T>::VSetPtr VSetPtr;
typedef std::pair<TPtr, VSetPtr> ContentPair;
typedef typename std::vector<ContentPair> ContentVector;
typedef typename ContentVector::const_iterator content_iterator;
typedef typename utils::RedBlackTree<ContentPair> RBTree;
typedef typename RBTree::RedBlackTreePtr RBTreePtr;
typedef typename std::vector<std::pair<TPtr,splt::SplitTy> >
PairVector;
typedef typename PairVector::const_iterator split_iterator;
private:
typedef memmap::MemMap MemMap;
static THREADLOCAL int counter;
static THREADLOCAL const MemMap* mmap;
RBTreePtr rbt;
StridedIntervalPtr size;
const int id : 28;
const rg::RegionTy regty : 4;
Region(rg::RegionTy ty, int i, StridedIntervalPtr size) :
rbt(RBTree::get()), size(size), id(i), regty(ty) {
assert(check() && "Invalid region constructed.");
assert(i < (1 << 28) && "Id out of bounds.");
assert(rbt.get() && "Empty RB tree?");
}
Region(const Region& r) : rbt(r.rbt), size(r.size), id(r.id),
regty(r.regty) {
assert(check() && "Invalid region constructed.");
assert(rbt.get() && "Empty RB tree?");
}
Region(const Region& r, rg::RegionTy ty) : rbt(r.rbt), size(r.size),
id(r.id), regty(ty) {
assert(check() && "Invalid region constructed.");
assert(rbt.get() && "Empty RB tree?");
}
Region(const Region& r, RBTreePtr p) : rbt(p), size(r.size),
id(r.id), regty(r.regty) {
assert(check() && "Invalid region constructed.");
assert(rbt.get() && "Empty RB tree?");
}
void split(_Self&, ContentVector&, ContentVector&,
std::vector<TPtr>&, std::vector<TPtr>&, PairVector&);
static bool weaklyUpdatable(rg::RegionTy);
static bool stronglyUpdatable(rg::RegionTy);
struct LessOrEqual {
bool operator()(const ContentPair& a, const ContentPair& b)
const;
};
static TPtr getIntervalFor(reg::RegEnumTy ty) {
assert(ty < reg::TERM_REG && "Register index out of bounds.");
const struct regs* r = ®s[(unsigned)ty];
return T::get(r->begin, r->end, r->size);
}
public:
typedef typename RBTree::const_iterator const_iterator;
static RegionPtr getFresh(rg::RegionTy ty = rg::STRONG_GLOBAL,
StridedIntervalPtr size = StridedInterval::getTop());
static int getNextId() {
return counter;
}
static rg::RegionTy weak2strong(rg::RegionTy);
static rg::RegionTy strong2weak(rg::RegionTy);
// Set memory map containing values initialized by the static
// initializers.
static void setMemMap(const MemMap* m) { mmap = m; }
RegionPtr getWeaklyUpdatable() {
// Register region is always strongly updatable
return isStronglyUpdatable() ? RegionPtr(new
Region(*this, strong2weak(getRegionType()))) : RegionPtr(this);
}
RegionPtr getStronglyUpdatable() {
// Register region is always strongly updatable
return isWeaklyUpdatable() ? RegionPtr(new
Region(*this, weak2strong(getRegionType()))) : RegionPtr(this);
}
static void shutdown() { RBTree::shutdown(); }
const_iterator begin() const {
return const_cast<const RBTree&>(*rbt).begin();
}
const_iterator end() const {
return const_cast<const RBTree&>(*rbt).end();
}
bool isStronglyUpdatable() const { return stronglyUpdatable(regty);}
bool isWeaklyUpdatable() const { return weaklyUpdatable(regty); }
rg::RegionTy getRegionType() const { return regty; }
int getId() const { return id; }
bool subsumes(const _Self& a) const;
bool subsumedBy(const _Self& a) const { return a.subsumes(*this); }
bool withinBoundsOf(const _Self&) const;
bool isGlobal() const {
return regty == rg::WEAK_GLOBAL || regty == rg::STRONG_GLOBAL;
}
bool isRegister() const {
return regty == rg::WEAK_REGISTER || regty ==
rg::STRONG_REGISTER;
}
bool isStack() const {
return regty == rg::STRONG_STACK || regty == rg::WEAK_STACK;
}
bool isHeap() const {
return regty == rg::STRONG_HEAP || regty == rg::WEAK_HEAP;
}
VSetPtr read(TPtr) const;
VSetPtr read(reg::RegEnumTy ty) {
assert(isRegister() &&
"Can't use this function for non-register regions.");
return read(getIntervalFor(ty));
}
RegionPtr write(TPtr, VSetPtr);
RegionPtr write(TPtr, AlocPair);
RegionPtr write(reg::RegEnumTy ty, VSetPtr p) {
assert(rbt.get() && "About to dereference a NULL ptr.");
assert(isRegister() &&
"Can't use this function for non-register regions.");
return write(getIntervalFor(ty), p);
}
RegionPtr write(reg::RegEnumTy, AlocPair);
RegionPtr join(_Self&);
RegionPtr meet(_Self&);
RegionPtr widen(_Self&);
// Warning: In the classes that inherit abstract domain, the last
// two parameters (lower and upper bound) have to be TOP, if no
// restriction should be performed. Since Region is not an abstract
// domain in the classical sense (i.e., no operators are defined on
// regions), TOP/BOT are not defined for regions. Thus, the role of
// TOP is played by *this. So, if you want to avoid restricting
// upper (or lower) bound, pass *this as the corresponding
// parameters.
//RegionPtr rwiden(_Self&, _Self&, _Self&);
// Adds n to all addresses, effectively shifting the address space.
RegionPtr discardFrame(int);
int getHash() const;
// Number of distinctive addresses
int getSize() const { return rbt->treeSize(); }
// Actual range of valid sizes of the memory region
StridedIntervalPtr getSizeRange() const { return size; }
void print(std::ostream&, bool multi_line = false) const;
// Implemented as friends for symmetry
template <typename T2>
friend bool operator==(const Region<T2>&, const Region<T2>&);
template <typename T2>
friend bool operator!=(const Region<T2>&, const Region<T2>&);
// *** Debug ***
bool check() const;
static bool checkWrite(TPtr, AlocPair);
static bool checkWrite(TPtr, VSetPtr);
};
template <class T>
inline std::ostream& operator<<(std::ostream& os, const Region<T>& r) {
r.print(os); return os;
}
// *** Implementation ***
template <typename T>
inline rg::RegionTy Region<T>::weak2strong(rg::RegionTy ty) {
switch (ty) {
case rg::WEAK_HEAP: return rg::STRONG_HEAP;
case rg::WEAK_STACK: return rg::STRONG_STACK;
case rg::WEAK_REGISTER: return rg::STRONG_REGISTER;
case rg::WEAK_GLOBAL: return rg::STRONG_GLOBAL;
default: return ty;
}
}
template <typename T>
inline rg::RegionTy Region<T>::strong2weak(rg::RegionTy ty) {
switch (ty) {
case rg::STRONG_HEAP: return rg::WEAK_HEAP;
case rg::STRONG_STACK: return rg::WEAK_STACK;
case rg::STRONG_REGISTER: return rg::WEAK_REGISTER;
case rg::STRONG_GLOBAL: return rg::WEAK_GLOBAL;
default: return ty;
}
}
template <typename T>
inline bool Region<T>::weaklyUpdatable(rg::RegionTy ty) {
return ty < rg::STRONG_GLOBAL;
}
template <typename T>
inline bool Region<T>::stronglyUpdatable(rg::RegionTy ty) {
return ty >= rg::STRONG_GLOBAL && ty < rg::TERMINAL;
}
template <typename T>
inline bool Region<T>::checkWrite(TPtr p, AlocPair ap) {
(void)p; (void)ap;
return true;
}
template <typename T>
inline bool Region<T>::checkWrite(TPtr p, VSetPtr vs) {
for (typename ValueSet<T>::const_iterator I = vs->begin(), E =
vs->end(); I != E; ++I) {
if (!checkWrite(p, I->get())) {
return false;
}
}
return true;
}
template <typename T>
inline typename Region<T>::RegionPtr Region<T>::getFresh(rg::RegionTy
ty, StridedIntervalPtr size) {
int i = 0;
switch (ty) {
case rg::WEAK_GLOBAL:
case rg::STRONG_GLOBAL:
// Do nothing, zero is the right id
break;
case rg::WEAK_REGISTER:
case rg::STRONG_REGISTER:
i = 1;
break;
case rg::WEAK_STACK:
case rg::STRONG_STACK:
i = 2;
break;
default:
i = counter++;
}
return RegionPtr(new Region(ty, i, size));
}
template <typename T>
inline bool Region<T>::subsumes(const _Self& r) const {
assert(getId() == r.getId() &&
"Different regions can never subsume each other.");
const_iterator TI = begin(), TE = end(), RI = r.begin(), RE =
r.end();
if (RI == RE || *this == r) {
return true;
} else if (TI == TE) {
return false;
}
for (; TI != TE && RI != RE; ) {
ContentPair tcp = TI->get();
ContentPair rcp = RI->get();
TPtr tp = tcp.first;
TPtr rp = rcp.first;
//std::cout << *tp << " <> " << *rp << ' ';
if (*tp < *rp) {
// Entire tp missing in the other region
++TI;
//std::cout << "++TI ";
continue;
} else if (*rp < *tp) {
// Entire rp is missing in this region
//std::cout << "false\n";
return false;
} else if (utils::Equal<ContentPair>()(tcp, rcp)) {
//std::cout << "++TI, ++RI ";
++TI; ++RI;
continue;
} else if (tp->subsumes(*rp)) {
//std::cout << "s++RI ";
++RI;
if (tp->getHi() == rp->getHi()) {
// End reached simultaneously
++TI;
} else if (RI != RE && !tp->overlaps(*RI->get().first)) {
// tp is subsuming rp, and the next interval after rp is
// not overlapping with tp, thus, we can advance the
// iterator
++TI;
//std::cout << "sn++TI ";
}
} else if (tp->getLo() == rp->getLo() && tp->isConstant() &&
rp->isConstant()) {
++TI; ++RI;
} else {
assert(tp->overlaps(*rp) && "Unexpected condition.");
return false;
}
//std::cout << '|';
if (!tcp.second->subsumes(*rcp.second)) {
//std::cout << "THIS: " << *tcp.second << ", THAT: " <<
// *rcp.second << std::endl;
//std::cout << "false!\n";
return false;
}
//std::cout << "true\n";
}
return RI == RE;
}
// FIX
template <typename T>
inline bool Region<T>::withinBoundsOf(const _Self& r) const {
assert(false && "Not fully implemented, doesn't take chunks "
"into account.");
const_iterator TI = begin(), TE = end(), RI = r.begin(), RE =
r.end();
for (; TI != TE && RI != RE; ) {
ContentPair tcp = TI->get();
ContentPair rcp = RI->get();
TPtr tp = tcp.first;
TPtr rp = rcp.first;
if (tp->withinBoundsOf(*rp)) {
if (!tcp.second->withinBoundsOf(*rcp.second)) {
return false;
}
++TI; ++RI;
} else if (*rp < *tp) {
++RI;
} else {
return false;
}
}
return TI == TE;
}
template <typename T>
inline typename Region<T>::VSetPtr Region<T>::read(TPtr p) const {
assert(p->getStride() > 0 && "Addresses can't have zero strides.");
if (DEBUG_LEVEL >= 4) {
if (isRegister()) {
std::stringstream reg_ss;
const char* regName = getRegNameAtAddress(p->getLo(),
p->getHi());
if (regName) {
reg_ss << regName;
} else {
reg_ss << *p;
}
debug4("Interpreting read from register %s\n",
reg_ss.str().c_str());
} else {
std::stringstream region_ss;
print(region_ss, true);
std::stringstream pointer_ss;
p->print(pointer_ss);
debug4("Interpreting read from pointer %s in region %s\n",
pointer_ss.str().c_str(), region_ss.str().c_str());
}
}
if (!size->subsumes(*p)) {
WARNING("*** Read out of bounds.");
return ValueSet<T>::getBot();
} else if (p->isBot()) { // There's nothing at the bottom
return ValueSet<T>::getBot();
}
if (p->containsZero() && !isRegister() && !isStack()) {
WARNING("*** Possible NULL ptr dereference (read).");
return ValueSet<T>::getTop();
}
{
ContentPair cp = rbt->match(std::make_pair(p,
ValueSet<T>::getBot()));
if (cp.first.get()) {
return cp.second;
}
}
std::vector<ContentPair> overlapping;
ContentPair cp(p, VSetPtr(0));
rbt->findAllOverlapping(cp, overlapping);
if (overlapping.empty()) {
if (isGlobal() && mmap) {
int val = 0;
int shift = 0;
for (int adr = p->getLo(); adr < p->getHi(); adr++) {
if (mmap->isValid((unsigned)adr)) {
val |= mmap->get((unsigned)adr) << shift;
shift += CHAR_BIT;
} else {
shift = -1;
break;
}
}
if (shift > 0) {
return ValueSet<T>::get(val,sizeof(int));
}
}
// Complaining about uninitialized reads doesn't make much sense
// for registers.
if (!isRegister()) {
bool valid = false;
if (mmap) {
// Check whether we are pointing to an array of strings
// to which argv pointers point. The strings can't be
// initialized, as that would concretize symbolic
// analysis.
const size_t lower =
mmap->getLowerBound((unsigned)p->getLo());
const size_t upper = lower +
NARGV_PTRS_DEFAULT * 4 +
NARGV_PTRS_DEFAULT * NARGV_STRLEN_DEFAULT;
if (DEBUG_LEVEL >= 4) {
debug4("Comparing ptr range [0x%x,0x%x] "
"to argv area [0x%x,0x%x]\n",
(int)p->getLo(), (int)p->getHi(),
(int)lower, (int)upper);
}
if (p->getLo() >= (int)lower && p->getHi() <=
(int)upper) {
// This address is initialized, but with TOP, don't
// complain
valid = true;
}
}
if (!valid) {
WARNING("*** Read of uninitialized address.");
/*
static int cnt = 0;
if (++cnt == 1) {
exit(1);
}// */
}
}
return ValueSet<T>::getTop();
}
std::sort(overlapping.begin(), overlapping.end(), LessOrEqual());
TPtr t;
VSetPtr vs;
int shiftFor = 0;
for (typename std::vector<ContentPair>::const_iterator I =
overlapping.begin(), E = overlapping.end(); I != E; ++I) {
TPtr i = I->first;
VSetPtr c = I->second;
// Note: this is a realtively simple case, when we read a
// smaller chunk from a larger interval. It actually happens in
// practice.
if (i->subsumes(*p)) {
assert(overlapping.size() == 1 &&
"There should be only one subsuming interval.");
if (i->getStride() == p->getStride()) {
// Read of one element from an array
return c;
}
const int shift = i->getHi() - p->getHi();
assert(shift >= 0 && "Shift shouldn't be negative.");
const int bytes = p->getStride();
const int mask = (1 << (bytes * CHAR_BIT)) - 1;
VSetPtr shft = ValueSet<T>::get(shift,
utils::umax(i->getStride(), p->getStride()));
vs = *c->rshift(*shft) & *ValueSet<T>::get(mask,
p->getStride());
} else if (p->subsumes(*i)) {
if (i->getStride() == p->getStride()) {
// Read of an interval spanning multiple strides, and
// the interval overlaps a smaller interval with the
// same stride. Not much we can do here...
WARNING("*** Misaligned read discovered (middle).");
return ValueSet<T>::getTop();
} else if (!vs.get()) { // First
t = i;
vs = I->second;
shiftFor += i->getStride();
} else {
assert(t.get() && "Unexpected NULL ptr.");
if (i->getLo() != t->getHi()) {
// There's an uncovered gap.
WARNING("*** Misaligned read discovered (gap).");
// Misaligned read, partially unintialized
return ValueSet<T>::getTop();
} else {
t = i;
// Little endian
vs = *vs->lshift(*ValueSet<T>::get(shiftFor *
CHAR_BIT)) | *vs;
shiftFor += i->getStride();
}
}
} else {
// It would be possible to construct a value for a read that
// overlaps to adjacent intervals, but that's more work...
WARNING("*** Misaligned read discovered (partial)", current_instruction);
return ValueSet<T>::getTop();
}
}
assert(vs.get() && "Undefined value set?");
return vs;
}
template <typename T>
inline typename Region<T>::RegionPtr Region<T>::write(TPtr p,VSetPtr s){
assert(checkWrite(p, s) && "Invalid write.");
assert(p->getStride() > 0 && "Addresses can't have zero strides.");
if (DEBUG_LEVEL >= 4) {
if (isRegister()) {
std::stringstream reg_ss;
const char* regName = getRegNameAtAddress(p->getLo(),
p->getHi());
if (regName) {
reg_ss << regName;
} else {
reg_ss << *p;
}
debug4("Interpreting write to register %s\n",
reg_ss.str().c_str());
} else {
std::stringstream region_ss;
print(region_ss, true);
std::stringstream pointer_ss;
p->print(pointer_ss);
debug4("Interpreting write to pointer %s in region %s\n",
pointer_ss.str().c_str(), region_ss.str().c_str());
}
}
if (!size->subsumes(*p) || p->isTop()) {
WARNING("*** Write out of bounds");
return RegionPtr(this);
} else if (isStack() && p->getLo() > 0) {
WARNING("*** Write out of bounds");
} else if (p->isBot()) { // Ignore writes to bot
return RegionPtr(this);
}
if (p->containsZero() && !isRegister() && !isStack()) {
WARNING("*** Possible NULL ptr dereference (write).");
}
ContentVector overlapping;
ContentPair cp(p,s);
rbt->findAllOverlapping(cp, overlapping);
if (overlapping.empty()) { // Fresh location written
return RegionPtr(new Region(*this, rbt->insert(cp)));
}
RBTreePtr mp(rbt);
if (overlapping.size() == 1) {
TPtr i = overlapping[0].first;
VSetPtr vs = overlapping[0].second;
if (isStronglyUpdatable()) {
if (*i == *p) {
cp.second = s;
mp = mp->replace(overlapping[0], cp);
} else if (p->getStride() == i->getStride()) {
// Aligned, but split is needed, bail out
goto handle_misalignment;
} else if (i->subsumes(*p)) {
const int shift = i->getHi() - p->getHi();
const int bytes = p->getStride();
int mask = (1 << (bytes * CHAR_BIT)) - 1;
assert(shift >= 0 && "Invalid shift.");
// Construct shift and masks
VSetPtr shft = ValueSet<T>::get(bytes, i->getStride());
VSetPtr msk = ValueSet<T>::get(mask, i->getStride());
// Align written value and shift it back
VSetPtr ap = (*s->rshift(*shft) & *msk)->lshift(*shft);
// Construct a window
mask <<= bytes;
VSetPtr w = ValueSet<T>::get(~mask, i->getStride());
// Mask overwritten value
VSetPtr overw = *vs & *w;
// Fill in the window
cp.second = *overw | *ap;
// Erase the old, and insert the new val set
mp = mp->erase(overlapping[0]);
mp = mp->insert(cp);
} else if (p->subsumes(*i)) {
cp.second = s;
mp = mp->erase(overlapping[0]);
mp = mp->insert(cp);
} else {
goto handle_misalignment;
}
} else {
if (*i == *p) {
cp.second = vs->join(*s);
mp = mp->replace(overlapping[0], cp);
} else if (p->getStride() == i->getStride()) {
// Aligned, but split is needed, bail out
goto handle_misalignment;
} else if (i->subsumes(*p)) {
const int shift = i->getHi() - p->getHi();
const int bytes = p->getStride();
int mask = (1 << (bytes * CHAR_BIT)) - 1;
assert(shift >= 0 && "Invalid shift.");
// Construct a mask
VSetPtr shft = ValueSet<T>::get(bytes, i->getStride());
VSetPtr msk = ValueSet<T>::get(mask, i->getStride());
// Align both written and overwritten value
VSetPtr ai = *vs->rshift(*shft) & *msk;
VSetPtr ap = *s->rshift(*shft) & *msk;
// Join them together and shift it back
VSetPtr jn = ai->join(*ap)->lshift(*shft);
// Construct a window
mask <<= bytes;
VSetPtr w = ValueSet<T>::get(~mask, i->getStride());
// Mask overwritten value
VSetPtr overw = *vs & *w;
// Fill in the window
cp.second = *overw | *jn;
// Erase the old, and insert the new val set
mp = mp->erase(overlapping[0]);
mp = mp->insert(cp);
} else if (p->subsumes(*i)) {
const int shift = p->getHi() - i->getHi();
const int bytes = p->getStride();
int mask = (1 << (bytes * CHAR_BIT)) - 1;
assert(shift >= 0 && "Invalid shift.");
// Construct a mask and the window
VSetPtr shft = ValueSet<T>::get(bytes, p->getStride());
VSetPtr msk = ValueSet<T>::get(mask, p->getStride());
// Align both values
VSetPtr ai = *vs->rshift(*shft) & *msk;
VSetPtr ap = *s->rshift(*shft) & *msk;
// Join them together and shift it back
VSetPtr jn = ai->join(*ap)->lshift(*shft);
// Construct a window
mask <<= bytes;
VSetPtr w = ValueSet<T>::get(~mask, p->getStride());
// Mask written value
VSetPtr written = *s & *w;
// Fill in the window
cp.second = *written | *jn;
// Erase the old, and insert the new val set
mp = mp->erase(overlapping[0]);
mp = mp->insert(cp);
} else {
goto handle_misalignment;
}
}
return RegionPtr(new Region(*this, mp));
}
handle_misalignment:
// Sort the overlapping intervals
std::sort(overlapping.begin(), overlapping.end(), LessOrEqual());
// Pick over the actual intervals
std::vector<TPtr> intervals;
PairVector out;
std::transform(overlapping.begin(), overlapping.end(),
std::back_inserter(intervals),
utils::select1st<ContentPair>());
p->split(intervals, out);
// Erase all overlapping intervals
for (content_iterator I = overlapping.begin(), E =
overlapping.end(); I != E; ++I) {
mp = mp->erase(*I);
}
unsigned idx = 0;
for (split_iterator I = out.begin(), E = out.end(); I != E; ++I) {
TPtr i = I->first;
const int code = I->second;
ContentPair np;
switch (code) {
case splt::FIRST:
assert(idx < intervals.size() &&
"Index out of bounds.");
assert(i->withinBoundsOf(*intervals[idx]) &&
"Invalid interval chunk.");
if (i->getStride() == intervals[idx]->getStride()) {
// Aligned
np = std::make_pair(i, overlapping[idx].second);
} else {
// Misaligned
np = std::make_pair(i, ValueSet<T>::getTop());
}
if (i->getHi() == intervals[idx]->getHi()) {
idx++;
}
break;
case splt::SECOND:
assert(i->withinBoundsOf(*p) &&
"Invalid interval chunk.");
if (i->getStride() == p->getStride()) {
// Aligned
np = std::make_pair(i, s);
} else {
// Misaligned
np = std::make_pair(i, ValueSet<T>::getTop());
}
break;
case splt::BOTH:
assert(idx < intervals.size() &&
"Index out of bounds.");
assert(i->withinBoundsOf(*intervals[idx]) &&
"Invalid interval chunk.");
assert(i->withinBoundsOf(*p) &&
"Invalid interval chunk.");
if (i->getStride() == p->getStride()) {
// Aligned
if (isStronglyUpdatable()) {
np = std::make_pair(i, s);
} else {
np = std::make_pair(i,
s->join(*overlapping[idx].second));
}
} else {
// Misaligned
np = std::make_pair(i, ValueSet<T>::getTop());
}
if (i->getHi() == intervals[idx]->getHi()) {
idx++;
}
break;
default:
assert(false && "Unrecognized split code.");
break;
}
if (mp.get()) {
mp = mp->insert(np);
} else {
mp = RBTree::get(np);
}
#ifndef DEBUG
RegionPtr r = RegionPtr(new Region(*this, mp));
#endif
}
return RegionPtr(new Region(*this, mp));
}
template <typename T>
inline typename Region<T>::RegionPtr Region<T>::write(TPtr p, AlocPair
ap) {
assert(checkWrite(p, ap) && "Invalid write.");
return write(p, ValueSet<T>::get(ap));
}
template <typename T>
inline typename Region<T>::RegionPtr Region<T>::write(reg::RegEnumTy r,
AlocPair ap) {
return write(r, ValueSet<T>::get(ap));
}
template <typename T>
inline typename Region<T>::RegionPtr Region<T>::join(_Self& r) {
assert(getId() == r.getId() &&
"Can't join regions with different IDs.");
if (r == *this) { return RegionPtr(this); }
ContentVector cv1, cv2;
std::vector<TPtr> ptvec1, ptvec2;
PairVector out;
split(r, cv1, cv2, ptvec1, ptvec2, out);
RBTreePtr mp;
unsigned idx1 = 0, idx2 = 0;
for (split_iterator I = out.begin(), E = out.end(); I != E; ++I) {
TPtr i = I->first;
const int code = I->second;
ContentPair np;
switch (code) {
case splt::FIRST:
assert(idx1 < ptvec1.size() && "Index out of bounds.");
if (i->getStride() == ptvec1[idx1]->getStride()) {
// Aligned
np = std::make_pair(i, cv1[idx1].second);
} else {
// Misaligned
np = std::make_pair(i, ValueSet<T>::getTop());
}
if (i->getHi() == ptvec1[idx1]->getHi()) {
idx1++;
}
break;
case splt::SECOND:
assert(idx2 < ptvec2.size() && "Index out of bounds.");
if (i->getStride() == ptvec2[idx2]->getStride()) {
// Aligned
np = std::make_pair(i, cv2[idx2].second);
} else {
// Misaligned
np = std::make_pair(i, ValueSet<T>::getTop());
}
if (i->getHi() == ptvec2[idx2]->getHi()) {
idx2++;
}
break;
case splt::BOTH:
{
assert(idx1 < ptvec1.size() && "Index out of bounds.");
assert(idx2 < ptvec2.size() && "Index out of bounds.");
const bool aligned = ptvec1[idx1]->getStride() ==
ptvec2[idx2]->getStride() && i->getStride() ==
ptvec1[idx1]->getStride();
assert(cv1[idx1].first->overlaps(*cv2[idx2].first) &&
"Joining non-overlapping intervals?");
if (aligned) {
np = std::make_pair(i,
cv1[idx1].second->join(*cv2[idx2].second));
} else {
np = std::make_pair(i, ValueSet<T>::getTop());
}
if (i->getHi() == ptvec1[idx1]->getHi()) {
idx1++;
}
if (i->getHi() == ptvec2[idx2]->getHi()) {
idx2++;
}
} break;
default:
assert(false && "Unrecognized split code.");
break;
}
if (mp.get()) {
typename PairVector::const_iterator J = I;
mp = mp->insert(np);
} else {
mp = RBTree::get(np);
}
#ifndef DEBUG
RegionPtr r = RegionPtr(new Region(*this, mp));
#endif
}
RegionPtr res = RegionPtr(new Region(*this, mp));
// assert3(this->withinBoundsOf(*res) && "Invalid bnds.");
// assert3(r.withinBoundsOf(*res) && "Invalid bnds.");
return res;
}
template <typename T>
inline typename Region<T>::RegionPtr Region<T>::meet(_Self& r) {
assert(getId() == r.getId() &&
"Can't meet regions with different IDs.");
if (r == *this) { return RegionPtr(this); }
ContentVector cv1, cv2;
std::vector<TPtr> ptvec1, ptvec2;
PairVector out;
split(r, cv1, cv2, ptvec1, ptvec2, out);
RBTreePtr mp;
unsigned idx1 = 0, idx2 = 0;
for (split_iterator I = out.begin(), E = out.end(); I != E; ++I) {
TPtr i = I->first;
const int code = I->second;
ContentPair np;
switch (code) {
case splt::FIRST:
assert(idx1 < ptvec1.size() && "Index out of bounds.");
if (i->getHi() == ptvec1[idx1]->getHi()) {
idx1++;
}
break;
case splt::SECOND:
assert(idx2 < ptvec2.size() && "Index out of bounds.");
if (i->getHi() == ptvec2[idx2]->getHi()) {
idx2++;
}
break;
case splt::BOTH:
assert(idx1 < ptvec1.size() && "Index out of bounds.");
assert(idx2 < ptvec2.size() && "Index out of bounds.");
const bool aligned = ptvec1[idx1]->getStride() ==
ptvec2[idx2]->getStride() && i->getStride() ==
ptvec1[idx1]->getStride();
assert(cv1[idx1].first->overlaps(*cv2[idx2].first) &&
"Meeting non-overlapping intervals?");
if (aligned) {
np = std::make_pair(i,
cv1[idx1].second->meet(*cv2[idx2].second));
} else {
np = std::make_pair(i, ValueSet<T>::getTop());
}
if (i->getHi() == ptvec1[idx1]->getHi()) {
idx1++;
}
if (i->getHi() == ptvec2[idx2]->getHi()) {
idx2++;
}
break;
default:
assert(false && "Unrecognized split code.");
break;
}
if (mp.get()) {
typename PairVector::const_iterator J = I;
mp = mp->insert(np);
} else {
mp = RBTree::get(np);
}
#ifndef DEBUG
RegionPtr r = RegionPtr(new Region(*this, mp));
#endif
}
return RegionPtr(new Region(*this, mp));
}
template <typename T>
inline void Region<T>::split(_Self& with,
ContentVector& cv1, ContentVector& cv2,
std::vector<TPtr>& ptvec1, std::vector<TPtr>& ptvec2,
PairVector& out) {
for (const_iterator I = begin(), E = end(); I != E; ++I) {
cv1.push_back(I->get());
}
for (const_iterator I = with.begin(), E = with.end(); I != E; ++I) {
cv2.push_back(I->get());