1 //===- IntegersSubsetMapping.h - Mapping subset ==> Successor ---*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
11 /// IntegersSubsetMapping is mapping from A to B, where
12 /// Items in A is subsets of integers,
13 /// Items in B some pointers (Successors).
14 /// If user which to add another subset for successor that is already
15 /// exists in mapping, IntegersSubsetMapping merges existing subset with
18 //===----------------------------------------------------------------------===//
23 #include "llvm/Support/IntegersSubset.h"
30 template <class SuccessorClass,
31 class IntegersSubsetTy = IntegersSubset,
32 class IntTy = IntItem>
33 class IntegersSubsetMapping {
34 // FIXME: To much similar iterators typedefs, similar names.
35 // - Rename RangeIterator to the cluster iterator.
36 // - Remove unused "add" methods.
37 // - Class contents needs cleaning.
40 typedef IntRange<IntTy> RangeTy;
42 struct RangeEx : public RangeTy {
43 RangeEx() : Weight(1) {}
44 RangeEx(const RangeTy &R) : RangeTy(R), Weight(1) {}
45 RangeEx(const IntTy &C) : RangeTy(C), Weight(1) {}
46 RangeEx(const IntTy &L, const IntTy &H) : RangeTy(L, H), Weight(1) {}
47 RangeEx(const IntTy &L, const IntTy &H, unsigned W) :
48 RangeTy(L, H), Weight(W) {}
52 typedef std::pair<RangeEx, SuccessorClass*> Cluster;
54 typedef std::list<RangeTy> RangesCollection;
55 typedef typename RangesCollection::iterator RangesCollectionIt;
56 typedef typename RangesCollection::const_iterator RangesCollectionConstIt;
57 typedef IntegersSubsetMapping<SuccessorClass, IntegersSubsetTy, IntTy> self;
61 typedef std::list<Cluster> CaseItems;
62 typedef typename CaseItems::iterator CaseItemIt;
63 typedef typename CaseItems::const_iterator CaseItemConstIt;
65 // TODO: Change unclean CRS prefixes to SubsetMap for example.
66 typedef std::map<SuccessorClass*, RangesCollection > CRSMap;
67 typedef typename CRSMap::iterator CRSMapIt;
70 bool operator()(const Cluster &C1, const Cluster &C2) {
71 return C1.first < C2.first;
77 bool SingleNumbersOnly;
79 bool isIntersected(CaseItemIt& LItem, CaseItemIt& RItem) {
80 return LItem->first.getHigh() >= RItem->first.getLow();
83 bool isJoinable(CaseItemIt& LItem, CaseItemIt& RItem) {
84 if (LItem->second != RItem->second) {
85 assert(!isIntersected(LItem, RItem) &&
86 "Intersected items with different successors!");
89 APInt RLow = RItem->first.getLow();
90 if (RLow != APInt::getNullValue(RLow.getBitWidth()))
92 return LItem->first.getHigh() >= RLow;
97 std::vector<Cluster> clustersVector;
98 clustersVector.reserve(Items.size());
99 clustersVector.insert(clustersVector.begin(), Items.begin(), Items.end());
100 std::sort(clustersVector.begin(), clustersVector.end(), ClustersCmp());
102 Items.insert(Items.begin(), clustersVector.begin(), clustersVector.end());
107 enum DiffProcessState {
114 class DiffStateMachine {
116 DiffProcessState State;
118 SuccessorClass *CurrentLSuccessor;
119 SuccessorClass *CurrentRSuccessor;
122 self *IntersectionMapping;
128 IntegersSubsetMapping<SuccessorClass, IntegersSubsetTy, IntTy> MappingTy;
130 DiffStateMachine(MappingTy *L,
131 MappingTy *Intersection,
133 State(ALL_IS_CLOSED),
135 IntersectionMapping(Intersection),
139 void onLOpen(const IntTy &Pt, SuccessorClass *S) {
142 if (Pt > OpenPt/*Don't add empty ranges.*/ && RightMapping)
143 RightMapping->add(OpenPt, Pt-1, CurrentRSuccessor);
144 State = INTERSECT_OPENED;
150 assert(0 && "Got unexpected point.");
153 CurrentLSuccessor = S;
157 void onLClose(const IntTy &Pt) {
160 assert(Pt >= OpenPt &&
161 "Subset is not sorted or contains overlapped ranges");
163 LeftMapping->add(OpenPt, Pt, CurrentLSuccessor);
164 State = ALL_IS_CLOSED;
166 case INTERSECT_OPENED:
167 if (IntersectionMapping)
168 IntersectionMapping->add(OpenPt, Pt, CurrentLSuccessor);
173 assert(0 && "Got unexpected point.");
178 void onROpen(const IntTy &Pt, SuccessorClass *S) {
181 if (Pt > OpenPt && LeftMapping)
182 LeftMapping->add(OpenPt, Pt-1, CurrentLSuccessor);
183 State = INTERSECT_OPENED;
189 assert(0 && "Got unexpected point.");
192 CurrentRSuccessor = S;
196 void onRClose(const IntTy &Pt) {
199 assert(Pt >= OpenPt &&
200 "Subset is not sorted or contains overlapped ranges");
202 RightMapping->add(OpenPt, Pt, CurrentRSuccessor);
203 State = ALL_IS_CLOSED;
205 case INTERSECT_OPENED:
206 if (IntersectionMapping)
207 IntersectionMapping->add(OpenPt, Pt, CurrentLSuccessor);
212 assert(0 && "Got unexpected point.");
217 void onLROpen(const IntTy &Pt,
219 SuccessorClass *RS) {
222 State = INTERSECT_OPENED;
225 assert(0 && "Got unexpected point.");
228 CurrentLSuccessor = LS;
229 CurrentRSuccessor = RS;
233 void onLRClose(const IntTy &Pt) {
235 case INTERSECT_OPENED:
236 if (IntersectionMapping)
237 IntersectionMapping->add(OpenPt, Pt, CurrentLSuccessor);
238 State = ALL_IS_CLOSED;
241 assert(0 && "Got unexpected point.");
246 bool isLOpened() { return State == L_OPENED; }
247 bool isROpened() { return State == R_OPENED; }
250 void diff_single_numbers(self *LExclude, self *Intersection, self *RExclude,
253 CaseItemConstIt L = Items.begin(), R = RHS.Items.begin();
254 CaseItemConstIt el = Items.end(), er = RHS.Items.end();
255 while (L != el && R != er) {
256 const Cluster &LCluster = *L;
257 const RangeEx &LRange = LCluster.first;
258 const Cluster &RCluster = *R;
259 const RangeEx &RRange = RCluster.first;
261 if (LRange.getLow() < RRange.getLow()) {
263 LExclude->add(LRange.getLow(), LCluster.second);
265 } else if (LRange.getLow() > RRange.getLow()) {
267 RExclude->add(RRange.getLow(), RCluster.second);
271 Intersection->add(LRange.getLow(), LCluster.second);
277 if (L != Items.end()) {
280 LExclude->add(L->first, L->second);
282 } while (L != Items.end());
283 } else if (R != RHS.Items.end()) {
286 RExclude->add(R->first, R->second);
288 } while (R != RHS.Items.end());
294 // Don't public CaseItems itself. Don't allow edit the Items directly.
295 // Just present the user way to iterate over the internal collection
296 // sharing iterator, begin() and end(). Editing should be controlled by
298 typedef CaseItemIt RangeIterator;
300 typedef std::pair<SuccessorClass*, IntegersSubsetTy> Case;
301 typedef std::list<Case> Cases;
302 typedef typename Cases::iterator CasesIt;
304 IntegersSubsetMapping() {
306 SingleNumbersOnly = true;
310 RangeIterator DummyErrItem;
311 return verify(DummyErrItem);
314 bool verify(RangeIterator& errItem) {
318 for (CaseItemIt j = Items.begin(), i = j++, e = Items.end();
320 if (isIntersected(i, j) && i->second != j->second) {
328 bool isOverlapped(self &RHS) {
329 if (Items.empty() || RHS.empty())
332 for (CaseItemIt L = Items.begin(), R = RHS.Items.begin(),
333 el = Items.end(), er = RHS.Items.end(); L != el && R != er;) {
335 const RangeTy &LRange = L->first;
336 const RangeTy &RRange = R->first;
338 if (LRange.getLow() > RRange.getLow()) {
339 if (RRange.isSingleNumber() || LRange.getLow() > RRange.getHigh())
343 } else if (LRange.getLow() < RRange.getLow()) {
344 if (LRange.isSingleNumber() || LRange.getHigh() < RRange.getLow())
348 } else // iRange.getLow() == jRange.getLow()
356 if (Items.size() < 2)
359 CaseItems OldItems = Items;
361 const IntTy *Low = &OldItems.begin()->first.getLow();
362 const IntTy *High = &OldItems.begin()->first.getHigh();
364 SuccessorClass *Successor = OldItems.begin()->second;
365 for (CaseItemIt j = OldItems.begin(), i = j++, e = OldItems.end();
367 if (isJoinable(i, j)) {
368 const IntTy *CurHigh = &j->first.getHigh();
370 if (*CurHigh > *High)
373 RangeEx R(*Low, *High, Weight);
375 Low = &j->first.getLow();
376 High = &j->first.getHigh();
378 Successor = j->second;
381 RangeEx R(*Low, *High, Weight);
383 // We recollected the Items, but we kept it sorted.
387 /// Adds a constant value.
388 void add(const IntTy &C, SuccessorClass *S = 0) {
394 void add(const IntTy &Low, const IntTy &High, SuccessorClass *S = 0) {
395 RangeTy R(Low, High);
398 void add(const RangeTy &R, SuccessorClass *S = 0) {
402 void add(const RangeEx &R, SuccessorClass *S = 0) {
403 Items.push_back(std::make_pair(R, S));
404 if (!R.isSingleNumber())
405 SingleNumbersOnly = false;
408 /// Adds all ranges and values from given ranges set to the current
410 void add(const IntegersSubsetTy &CRS, SuccessorClass *S = 0) {
411 for (unsigned i = 0, e = CRS.getNumItems(); i < e; ++i) {
412 RangeTy R = CRS.getItem(i);
417 void add(self& RHS) {
418 Items.insert(Items.end(), RHS.Items.begin(), RHS.Items.end());
419 if (!RHS.SingleNumbersOnly)
420 SingleNumbersOnly = false;
423 void add(self& RHS, SuccessorClass *S) {
424 for (CaseItemIt i = RHS.Items.begin(), e = RHS.Items.end(); i != e; ++i)
428 void add(const RangesCollection& RHS, SuccessorClass *S = 0) {
429 for (RangesCollectionConstIt i = RHS.begin(), e = RHS.end(); i != e; ++i)
433 /// Removes items from set.
434 void removeItem(RangeIterator i) { Items.erase(i); }
436 /// Moves whole case from current mapping to the NewMapping object.
437 void detachCase(self& NewMapping, SuccessorClass *Succ) {
438 for (CaseItemIt i = Items.begin(); i != Items.end();)
439 if (i->second == Succ) {
440 NewMapping.add(i->first, i->second);
446 /// Removes all clusters for given successor.
447 void removeCase(SuccessorClass *Succ) {
448 for (CaseItemIt i = Items.begin(); i != Items.end();)
449 if (i->second == Succ) {
455 /// Find successor that satisfies given value.
456 SuccessorClass *findSuccessor(const IntTy& Val) {
457 for (CaseItemIt i = Items.begin(); i != Items.end(); ++i) {
458 if (i->first.isInRange(Val))
464 /// Calculates the difference between this mapping and RHS.
465 /// THIS without RHS is placed into LExclude,
466 /// RHS without THIS is placed into RExclude,
467 /// THIS intersect RHS is placed into Intersection.
468 void diff(self *LExclude, self *Intersection, self *RExclude,
471 if (SingleNumbersOnly && RHS.SingleNumbersOnly) {
472 diff_single_numbers(LExclude, Intersection, RExclude, RHS);
476 DiffStateMachine Machine(LExclude, Intersection, RExclude);
478 CaseItemConstIt L = Items.begin(), R = RHS.Items.begin();
479 CaseItemConstIt el = Items.end(), er = RHS.Items.end();
480 while (L != el && R != er) {
481 const Cluster &LCluster = *L;
482 const RangeEx &LRange = LCluster.first;
483 const Cluster &RCluster = *R;
484 const RangeEx &RRange = RCluster.first;
486 if (LRange.getHigh() < RRange.getLow()) {
487 Machine.onLOpen(LRange.getLow(), LCluster.second);
488 Machine.onLClose(LRange.getHigh());
493 if (LRange.getLow() > RRange.getHigh()) {
494 Machine.onROpen(RRange.getLow(), RCluster.second);
495 Machine.onRClose(RRange.getHigh());
500 if (LRange.isSingleNumber() && RRange.isSingleNumber()) {
501 Machine.onLROpen(LRange.getLow(), LCluster.second, RCluster.second);
502 Machine.onLRClose(LRange.getLow());
508 if (LRange.isSingleNumber()) {
509 Machine.onLOpen(LRange.getLow(), LCluster.second);
510 Machine.onLClose(LRange.getLow());
512 while(L != Items.end() && L->first.getHigh() < RRange.getHigh()) {
513 Machine.onLOpen(LRange.getLow(), LCluster.second);
514 Machine.onLClose(LRange.getLow());
518 } else if (RRange.isSingleNumber()) {
519 Machine.onROpen(R->first.getLow(), R->second);
520 Machine.onRClose(R->first.getHigh());
522 while(R != RHS.Items.end() && R->first.getHigh() < LRange.getHigh()) {
523 Machine.onROpen(R->first.getLow(), R->second);
524 Machine.onRClose(R->first.getHigh());
529 if (LRange.getLow() < RRange.getLow()) {
530 // May be opened in previous iteration.
531 if (!Machine.isLOpened())
532 Machine.onLOpen(LRange.getLow(), LCluster.second);
533 Machine.onROpen(RRange.getLow(), RCluster.second);
535 else if (RRange.getLow() < LRange.getLow()) {
536 if (!Machine.isROpened())
537 Machine.onROpen(RRange.getLow(), RCluster.second);
538 Machine.onLOpen(LRange.getLow(), LCluster.second);
541 Machine.onLROpen(LRange.getLow(), LCluster.second, RCluster.second);
543 if (LRange.getHigh() < RRange.getHigh()) {
544 Machine.onLClose(LRange.getHigh());
546 while(L != Items.end() && L->first.getHigh() < RRange.getHigh()) {
547 Machine.onLOpen(L->first.getLow(), L->second);
548 Machine.onLClose(L->first.getHigh());
552 else if (RRange.getHigh() < LRange.getHigh()) {
553 Machine.onRClose(RRange.getHigh());
555 while(R != RHS.Items.end() && R->first.getHigh() < LRange.getHigh()) {
556 Machine.onROpen(R->first.getLow(), R->second);
557 Machine.onRClose(R->first.getHigh());
562 Machine.onLRClose(LRange.getHigh());
568 if (L != Items.end()) {
569 if (Machine.isLOpened()) {
570 Machine.onLClose(L->first.getHigh());
574 while (L != Items.end()) {
575 LExclude->add(L->first, L->second);
578 } else if (R != RHS.Items.end()) {
579 if (Machine.isROpened()) {
580 Machine.onRClose(R->first.getHigh());
584 while (R != RHS.Items.end()) {
585 RExclude->add(R->first, R->second);
591 /// Builds the finalized case objects.
592 void getCases(Cases& TheCases, bool PreventMerging = false) {
593 //FIXME: PreventMerging is a temporary parameter.
594 //Currently a set of passes is still knows nothing about
595 //switches with case ranges, and if these passes meet switch
596 //with complex case that crashs the application.
597 if (PreventMerging) {
598 for (RangeIterator i = this->begin(); i != this->end(); ++i) {
599 RangesCollection SingleRange;
600 SingleRange.push_back(i->first);
601 TheCases.push_back(std::make_pair(i->second,
602 IntegersSubsetTy(SingleRange)));
607 for (RangeIterator i = this->begin(); i != this->end(); ++i)
608 TheCRSMap[i->second].push_back(i->first);
609 for (CRSMapIt i = TheCRSMap.begin(), e = TheCRSMap.end(); i != e; ++i)
610 TheCases.push_back(std::make_pair(i->first, IntegersSubsetTy(i->second)));
613 /// Builds the finalized case objects ignoring successor values, as though
614 /// all ranges belongs to the same successor.
615 IntegersSubsetTy getCase() {
616 RangesCollection Ranges;
617 for (RangeIterator i = this->begin(); i != this->end(); ++i)
618 Ranges.push_back(i->first);
619 return IntegersSubsetTy(Ranges);
622 /// Returns pointer to value of case if it is single-numbered or 0
624 const IntTy* getCaseSingleNumber(SuccessorClass *Succ) {
625 const IntTy* Res = 0;
626 for (CaseItemIt i = Items.begin(); i != Items.end(); ++i)
627 if (i->second == Succ) {
628 if (!i->first.isSingleNumber())
633 Res = &(i->first.getLow());
638 /// Returns true if there is no ranges and values inside.
639 bool empty() const { return Items.empty(); }
643 // Don't reset Sorted flag:
644 // 1. For empty mapping it matters nothing.
645 // 2. After first item will added Sorted flag will cleared.
648 // Returns number of clusters
649 unsigned size() const {
653 RangeIterator begin() { return Items.begin(); }
654 RangeIterator end() { return Items.end(); }
658 typedef IntegersSubsetMapping<BasicBlock> IntegersSubsetToBB;
662 #endif /* CRSBUILDER_H_ */