Lines Matching refs:RangeTree
122 struct RangeTree { struct
150 ~RangeTree() { in ~RangeTree() argument
579 LLVM_DUMP_METHOD void RangeTree::dump() const { in dump()
585 LLVM_DUMP_METHOD void RangeTree::dump(const Node *N) const { in dump()
601 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const { in order()
609 void RangeTree::nodesWith(Node *N, int32_t P, bool CheckA, in nodesWith()
621 RangeTree::Node *RangeTree::add(Node *N, const OffsetRange &R) { in add()
637 RangeTree::Node *RangeTree::remove(Node *N, const Node *D) { in remove()
664 RangeTree::Node *RangeTree::rotateLeft(Node *Lower, Node *Higher) { in rotateLeft()
679 RangeTree::Node *RangeTree::rotateRight(Node *Lower, Node *Higher) { in rotateRight()
1328 using CandData = std::pair<unsigned, SmallVector<RangeTree::Node*,8>>; in assignInits()
1331 RangeTree Tree; in assignInits()
1334 SmallVector<RangeTree::Node*,8> Nodes; in assignInits()
1337 auto MaxAlign = [](const SmallVectorImpl<RangeTree::Node*> &Nodes, in assignInits()
1339 for (RangeTree::Node *N : Nodes) { in assignInits()
1355 for (RangeTree::Node *N : Nodes) { in assignInits()
1378 [](unsigned Acc, const RangeTree::Node *N) { in assignInits()
1396 for (RangeTree::Node *N : Tree.nodesWith(Best)) { in assignInits()