1801 struct WeightedLeaf {  struct
1806   WeightedLeaf() {}  in WeightedLeaf()  function
1808   WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) :  in WeightedLeaf()  argument
1813   static bool Compare(const WeightedLeaf &A, const WeightedLeaf &B) {  in Compare()  argument
1825   SmallVector<WeightedLeaf, 8> Q;
1827   WeightedLeaf ConstElt;
1843   const WeightedLeaf &top() {  in top()
1849   WeightedLeaf pop() {  in pop()
1854     std::pop_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in pop()
1858   void push(WeightedLeaf L, bool SeparateConst=true) {  in push()
1871       std::push_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in push()
1877   void pushToBottom(WeightedLeaf L) {  in pushToBottom()
1884   WeightedLeaf findSHL(uint64_t MaxAmount);
1886   WeightedLeaf findMULbyConst();
1893 WeightedLeaf LeafPrioQueue::findSHL(uint64_t MaxAmount) {  in findSHL()
1895   WeightedLeaf Result;  in findSHL()
1898     const WeightedLeaf &L = Q[Pos];  in findSHL()
1914     std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in findSHL()
1920 WeightedLeaf LeafPrioQueue::findMULbyConst() {  in findMULbyConst()
1922   WeightedLeaf Result;  in findMULbyConst()
1925     const WeightedLeaf &L = Q[Pos];  in findMULbyConst()
1941     std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);  in findMULbyConst()
2102   WeightedLeaf Mul1, Mul2;  in balanceSubTree()
2104   WeightedLeaf GA;  in balanceSubTree()
2152           Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
2155           Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
2165         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));  in balanceSubTree()
2174         GA = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
2176         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));  in balanceSubTree()
2228     Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder));  in balanceSubTree()
2279     WeightedLeaf SHL = Leaves.findSHL(31);  in balanceSubTree()
2305     WeightedLeaf L0 = Leaves.pop();  in balanceSubTree()
2309     WeightedLeaf L1 = Leaves.findMULbyConst();  in balanceSubTree()
2355     Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder));  in balanceSubTree()