reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1957 if (Child.getNode() != N && RootWeights.count(Child.getNode())) { 1957 if (Child.getNode() != N && RootWeights.count(Child.getNode())) { 1960 int Weight = RootWeights[Child.getNode()]; 1962 Child = balanceSubTree(Child.getNode()); 1962 Child = balanceSubTree(Child.getNode()); 1964 Weight = getWeight(Child.getNode()); 1973 NodeHeights[Child] = 1; 1978 (Child.getOpcode() == ISD::MUL || Child.getOpcode() == ISD::SHL) && 1978 (Child.getOpcode() == ISD::MUL || Child.getOpcode() == ISD::SHL) && 1979 Child.hasOneUse() && (PowerOf2 = getPowerOf2Factor(Child))) { 1979 Child.hasOneUse() && (PowerOf2 = getPowerOf2Factor(Child))) { 1984 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); 1987 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); 1997 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); 1998 } else if (!isOpcodeHandled(Child.getNode())) { 2000 int Weight = getWeight(Child.getNode()); 2002 NodeHeights[Child] = getHeight(Child.getNode()); 2002 NodeHeights[Child] = getHeight(Child.getNode()); 2005 if (isTargetConstant(Child) && !GA.Value.getNode()) 2006 GA = WeightedLeaf(Child, Weight, InsertionOrder++); 2008 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); 2012 unsigned ChildOpcode = Child.getOpcode(); 2019 Op1 = getMultiplierForSHL(Child.getNode()); 2021 Op1 = Child->getOperand(1); 2023 if (!NodeHeights.count(Op1) || !NodeHeights.count(Child->getOperand(0))) { 2024 assert(!NodeHeights.count(Child) && "Parent visited before children?"); 2026 Worklist.push_back(Child); 2028 Worklist.push_back(Child->getOperand(0)); 2031 if (std::abs(NodeHeights[Op1] - NodeHeights[Child->getOperand(0)]) > 1) 2034 NodeHeights[Child] = std::max(NodeHeights[Op1], 2035 NodeHeights[Child->getOperand(0)]) + 1;