| OLD | NEW |
| 1 //===- subzero/src/IceRegAlloc.cpp - Linear-scan implementation -----------===// | 1 //===- subzero/src/IceRegAlloc.cpp - Linear-scan implementation -----------===// |
| 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 /// \file | 10 /// \file |
| (...skipping 802 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 813 } | 813 } |
| 814 if (BuildDefs::dump() && Verbose) { | 814 if (BuildDefs::dump() && Verbose) { |
| 815 Ostream &Str = Ctx->getStrDump(); | 815 Ostream &Str = Ctx->getStrDump(); |
| 816 if (!Item->hasRegTmp()) { | 816 if (!Item->hasRegTmp()) { |
| 817 Str << "Not assigning "; | 817 Str << "Not assigning "; |
| 818 Item->dump(Func); | 818 Item->dump(Func); |
| 819 Str << "\n"; | 819 Str << "\n"; |
| 820 } else { | 820 } else { |
| 821 Str << (AssignedRegNum == Item->getRegNum() ? "Reassigning " | 821 Str << (AssignedRegNum == Item->getRegNum() ? "Reassigning " |
| 822 : "Assigning ") | 822 : "Assigning ") |
| 823 << Target->getRegName(AssignedRegNum, IceType_i32) << "(r" | 823 << Target->getRegName(AssignedRegNum, Item->getType()) << "(r" |
| 824 << AssignedRegNum << ") to "; | 824 << AssignedRegNum << ") to "; |
| 825 Item->dump(Func); | 825 Item->dump(Func); |
| 826 Str << "\n"; | 826 Str << "\n"; |
| 827 } | 827 } |
| 828 } | 828 } |
| 829 Item->setRegNum(AssignedRegNum); | 829 Item->setRegNum(AssignedRegNum); |
| 830 } | 830 } |
| 831 } | 831 } |
| 832 | 832 |
| 833 // Implements the linear-scan algorithm. Based on "Linear Scan Register | 833 // Implements the linear-scan algorithm. Based on "Linear Scan Register |
| (...skipping 194 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1028 Str << "\n"; | 1028 Str << "\n"; |
| 1029 } | 1029 } |
| 1030 Str << "++++++ Inactive:\n"; | 1030 Str << "++++++ Inactive:\n"; |
| 1031 for (const Variable *Item : Inactive) { | 1031 for (const Variable *Item : Inactive) { |
| 1032 dumpLiveRange(Item, Func); | 1032 dumpLiveRange(Item, Func); |
| 1033 Str << "\n"; | 1033 Str << "\n"; |
| 1034 } | 1034 } |
| 1035 } | 1035 } |
| 1036 | 1036 |
| 1037 } // end of namespace Ice | 1037 } // end of namespace Ice |
| OLD | NEW |