1803   int Weight;  member
1808   WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) :  in WeightedLeaf()
1809     Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) {  in WeightedLeaf()
1810     assert(Weight >= 0 && "Weight must be >= 0");  in WeightedLeaf()
1815     return A.Weight == B.Weight ?  in Compare()
1817             (A.Weight > B.Weight);  in Compare()
1878     L.Weight = 1000;  in pushToBottom()
1904     if (!Result.Value.getNode() || Result.Weight > L.Weight ||  in findSHL()
1905         (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder))  in findSHL()
1931     if (!Result.Value.getNode() || Result.Weight > L.Weight ||  in findMULbyConst()
1932         (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder))  in findMULbyConst()
2063     int Weight;  in balanceSubTree()  local
2065       Weight = getWeight(balanceSubTree(Op0N).getNode());  in balanceSubTree()
2068       Weight = getWeight(Op0N);  in balanceSubTree()
2072       Weight += getWeight(balanceSubTree(Op1N).getNode());  in balanceSubTree()
2075       Weight += getWeight(Op1N);  in balanceSubTree()
2077     RootWeights[N] = Weight;  in balanceSubTree()
2081     LLVM_DEBUG(dbgs() << "--> No need to balance root (Weight=" << Weight  in balanceSubTree()
2128       int Weight = RootWeights[Child.getNode()];  in balanceSubTree()  local
2129       if (Weight == -1) {  in balanceSubTree()
2132         Weight = getWeight(Child.getNode());  in balanceSubTree()
2133       } else if (Weight == -2) {  in balanceSubTree()
2142       CurrentWeight += Weight;  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()
2168       int Weight = getWeight(Child.getNode());  in balanceSubTree()  local
2171       CurrentWeight += Weight;  in balanceSubTree()
2174         GA = WeightedLeaf(Child, Weight, InsertionOrder++);  in balanceSubTree()
2176         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));  in balanceSubTree()
2217     int Weight = Mul1.Weight + Mul2.Weight;  in balanceSubTree()  local
2228     Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder));  in balanceSubTree()
2260       GA.Weight += Leaves.top().Weight;  in balanceSubTree()
2285       GA.Weight = SHL.Weight; // Specifically ignore the GA weight here  in balanceSubTree()
2313     assert(L0.Weight <= L1.Weight && "Priority queue is broken!");  in balanceSubTree()
2316     int V0Weight = L0.Weight;  in balanceSubTree()
2318     int V1Weight = L1.Weight;  in balanceSubTree()
2354     int Weight = V0Weight + V1Weight;  in balanceSubTree()  local
2355     Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder));  in balanceSubTree()
2357     LLVM_DEBUG(dbgs() << "--> Built new node (Weight=" << Weight  in balanceSubTree()
2394   RootWeights[NewRoot.getNode()] = Leaves.top().Weight;  in balanceSubTree()