1631 struct WeightedLeaf {  struct
1636   WeightedLeaf() : Value(SDValue()) { }  in WeightedLeaf()  argument
1638   WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) :  in WeightedLeaf()  argument
1643   static bool Compare(const WeightedLeaf &A, const WeightedLeaf &B) {  in Compare()  argument
1655   SmallVector<WeightedLeaf, 8> Q;
1657   WeightedLeaf ConstElt;
1673   const WeightedLeaf &top() {  in top()
1679   WeightedLeaf pop() {  in pop()
1684     std::pop_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in pop()
1688   void push(WeightedLeaf L, bool SeparateConst=true) {  in push()
1701       std::push_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in push()
1707   void pushToBottom(WeightedLeaf L) {  in pushToBottom()
1714   WeightedLeaf findSHL(uint64_t MaxAmount);
1716   WeightedLeaf findMULbyConst();
1723 WeightedLeaf LeafPrioQueue::findSHL(uint64_t MaxAmount) {  in findSHL()
1725   WeightedLeaf Result;  in findSHL()
1728     const WeightedLeaf &L = Q[Pos];  in findSHL()
1744     std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in findSHL()
1750 WeightedLeaf LeafPrioQueue::findMULbyConst() {  in findMULbyConst()
1752   WeightedLeaf Result;  in findMULbyConst()
1755     const WeightedLeaf &L = Q[Pos];  in findMULbyConst()
1771     std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in findMULbyConst()
1932   WeightedLeaf Mul1, Mul2;  in balanceSubTree()
1934   WeightedLeaf GA;  in balanceSubTree()
1982           Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
1985           Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
1995         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));  in balanceSubTree()
2004         GA = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
2006         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));  in balanceSubTree()
2058     Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder));  in balanceSubTree()
2109     WeightedLeaf SHL = Leaves.findSHL(31);  in balanceSubTree()
2135     WeightedLeaf L0 = Leaves.pop();  in balanceSubTree()
2139     WeightedLeaf L1 = Leaves.findMULbyConst();  in balanceSubTree()
2185     Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder));  in balanceSubTree()