| OLD | NEW |
| 1 //===- subzero/src/IceRegAlloc.h - Linear-scan reg. allocation --*- C++ -*-===// | 1 //===- subzero/src/IceRegAlloc.h - Linear-scan reg. allocation --*- C++ -*-===// |
| 2 // | 2 // |
| 3 // The Subzero Code Generator | 3 // The Subzero Code Generator |
| 4 // | 4 // |
| 5 // This file is distributed under the University of Illinois Open Source | 5 // This file is distributed under the University of Illinois Open Source |
| 6 // License. See LICENSE.TXT for details. | 6 // License. See LICENSE.TXT for details. |
| 7 // | 7 // |
| 8 //===----------------------------------------------------------------------===// | 8 //===----------------------------------------------------------------------===// |
| 9 // | 9 // |
| 10 // This file declares the LinearScan data structure used during | 10 // This file declares the LinearScan data structure used during |
| (...skipping 15 matching lines...) Expand all Loading... |
| 26 LinearScan &operator=(const LinearScan &) = delete; | 26 LinearScan &operator=(const LinearScan &) = delete; |
| 27 | 27 |
| 28 public: | 28 public: |
| 29 LinearScan(Cfg *Func) | 29 LinearScan(Cfg *Func) |
| 30 : Func(Func), FindPreference(false), FindOverlap(false) {} | 30 : Func(Func), FindPreference(false), FindOverlap(false) {} |
| 31 void init(RegAllocKind Kind); | 31 void init(RegAllocKind Kind); |
| 32 void scan(const llvm::SmallBitVector &RegMask); | 32 void scan(const llvm::SmallBitVector &RegMask); |
| 33 void dump(Cfg *Func) const; | 33 void dump(Cfg *Func) const; |
| 34 | 34 |
| 35 private: | 35 private: |
| 36 typedef std::vector<Variable *> OrderedRanges; |
| 37 typedef std::vector<Variable *> UnorderedRanges; |
| 38 |
| 36 void initForGlobal(); | 39 void initForGlobal(); |
| 37 void initForInfOnly(); | 40 void initForInfOnly(); |
| 41 // Move an item from the From set to the To set. From[Index] is |
| 42 // pushed onto the end of To[], then the item is efficiently removed |
| 43 // from From[] by effectively swapping it with the last item in |
| 44 // From[] and then popping it from the back. As such, the caller is |
| 45 // best off iterating over From[] in reverse order to avoid the need |
| 46 // for special handling of the iterator. |
| 47 void moveItem(UnorderedRanges &From, SizeT Index, UnorderedRanges &To) { |
| 48 To.push_back(From[Index]); |
| 49 From[Index] = From.back(); |
| 50 From.pop_back(); |
| 51 } |
| 38 | 52 |
| 39 Cfg *const Func; | 53 Cfg *const Func; |
| 40 typedef std::vector<Variable *> OrderedRanges; | |
| 41 typedef std::list<Variable *> UnorderedRanges; | |
| 42 OrderedRanges Unhandled; | 54 OrderedRanges Unhandled; |
| 43 // UnhandledPrecolored is a subset of Unhandled, specially collected | 55 // UnhandledPrecolored is a subset of Unhandled, specially collected |
| 44 // for faster processing. | 56 // for faster processing. |
| 45 OrderedRanges UnhandledPrecolored; | 57 OrderedRanges UnhandledPrecolored; |
| 46 UnorderedRanges Active, Inactive, Handled; | 58 UnorderedRanges Active, Inactive, Handled; |
| 47 std::vector<InstNumberT> Kills; | 59 std::vector<InstNumberT> Kills; |
| 48 bool FindPreference; | 60 bool FindPreference; |
| 49 bool FindOverlap; | 61 bool FindOverlap; |
| 50 // TODO(stichnot): We're not really using FindOverlap yet, but we | 62 // TODO(stichnot): We're not really using FindOverlap yet, but we |
| 51 // may want a flavor of register allocation where FindPreference is | 63 // may want a flavor of register allocation where FindPreference is |
| 52 // useful but we didn't want to initialize VMetadata with VMK_All | 64 // useful but we didn't want to initialize VMetadata with VMK_All |
| 53 // and therefore we can't safely allow overlap. | 65 // and therefore we can't safely allow overlap. |
| 54 }; | 66 }; |
| 55 | 67 |
| 56 } // end of namespace Ice | 68 } // end of namespace Ice |
| 57 | 69 |
| 58 #endif // SUBZERO_SRC_ICEREGALLOC_H | 70 #endif // SUBZERO_SRC_ICEREGALLOC_H |
| OLD | NEW |