Home
last modified time | relevance | path

Searched refs:TiedEnd (Results 1 – 6 of 6) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DHexagonBlockRanges.h79 IndexRange() : Fixed(false), TiedEnd(false) {} in IndexRange()
81 : std::pair<IndexType,IndexType>(Start, End), Fixed(F), TiedEnd(T) {}
93 bool TiedEnd; // The end is not a use, but a dead def tied to a use. member
104 void add(IndexType Start, IndexType End, bool Fixed, bool TiedEnd) { in add()
105 push_back(IndexRange(Start, End, Fixed, TiedEnd)); in add()
DHexagonBlockRanges.cpp35 bool SbAE = (S < AE) || (S == AE && A.TiedEnd); // S-before-AE. in overlaps()
36 bool ASbE = (AS < E) || (AS == E && TiedEnd); // AS-before-E. in overlaps()
64 TiedEnd = A.TiedEnd; in merge()
67 TiedEnd |= A.TiedEnd; in merge()
454 OS << '[' << IR.start() << ':' << IR.end() << (IR.TiedEnd ? '}' : ']'); in operator <<()
/external/llvm-project/llvm/lib/Target/Hexagon/
DHexagonBlockRanges.h85 : std::pair<IndexType,IndexType>(Start, End), Fixed(F), TiedEnd(T) {}
99 bool TiedEnd = false; // The end is not a use, but a dead def tied to a use. member
110 void add(IndexType Start, IndexType End, bool Fixed, bool TiedEnd) { in add()
111 push_back(IndexRange(Start, End, Fixed, TiedEnd)); in add()
DHexagonBlockRanges.cpp39 bool SbAE = (S < AE) || (S == AE && A.TiedEnd); // S-before-AE. in overlaps()
40 bool ASbE = (AS < E) || (AS == E && TiedEnd); // AS-before-E. in overlaps()
66 TiedEnd = A.TiedEnd; in merge()
69 TiedEnd |= A.TiedEnd; in merge()
507 OS << '[' << IR.start() << ':' << IR.end() << (IR.TiedEnd ? '}' : ']'); in operator <<()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonBlockRanges.h82 : std::pair<IndexType,IndexType>(Start, End), Fixed(F), TiedEnd(T) {}
96 bool TiedEnd = false; // The end is not a use, but a dead def tied to a use. member
107 void add(IndexType Start, IndexType End, bool Fixed, bool TiedEnd) { in add()
108 push_back(IndexRange(Start, End, Fixed, TiedEnd)); in add()
DHexagonBlockRanges.cpp39 bool SbAE = (S < AE) || (S == AE && A.TiedEnd); // S-before-AE. in overlaps()
40 bool ASbE = (AS < E) || (AS == E && TiedEnd); // AS-before-E. in overlaps()
66 TiedEnd = A.TiedEnd; in merge()
69 TiedEnd |= A.TiedEnd; in merge()
507 OS << '[' << IR.start() << ':' << IR.end() << (IR.TiedEnd ? '}' : ']'); in operator <<()