Searched refs:FirstControlIndex (Results 1 – 7 of 7) sorted by relevance
| /external/v8/src/compiler/ |
| D | node-properties.cc | 49 return FirstControlIndex(node) + node->op()->ControlInputCount(); in PastControlIndex()
84 return node->InputAt(FirstControlIndex(node) + index); in GetControlInput()
123 return IsInputRange(edge, FirstControlIndex(node), in IsControlEdge()
166 node->ReplaceInput(FirstControlIndex(node) + index, control); in ReplaceControlInput()
|
| D | graph-visualizer.cc | 148 os_ << ",\"rankInputs\":[0," << NodeProperties::FirstControlIndex(node) in PrintNode()
150 os_ << ",\"rankWithInput\":[" << NodeProperties::FirstControlIndex(node) in PrintNode()
154 os_ << ",\"rankInputs\":[" << NodeProperties::FirstControlIndex(node) in PrintNode()
226 } else if (index < NodeProperties::FirstControlIndex(from)) { in PrintEdge()
|
| D | node-properties.h | 33 static int FirstControlIndex(Node* node) { return PastEffectIndex(node); } in FirstControlIndex() function
|
| D | control-equivalence.cc | 185 for (int i = NodeProperties::FirstControlIndex(node); i < max; i++) { in DetermineParticipation()
|
| D | scheduler.cc | 152 NodeProperties::FirstControlIndex(node) == index; in IsCoupledControlEdge()
239 for (int i = NodeProperties::FirstControlIndex(node); i < max; i++) { in Run()
274 for (int i = NodeProperties::FirstControlIndex(node); i < max; i++) { in Run()
|
| D | loop-analysis.cc | 329 return index != NodeProperties::FirstControlIndex(use) && in IsBackedge()
|
| D | simplified-lowering.cc | 759 for (int i = std::max(index, NodeProperties::FirstControlIndex(node)); in ProcessRemainingInputs()
1438 EnqueueInput(node, NodeProperties::FirstControlIndex(node)); in VisitNode()
1443 EnqueueInput(node, NodeProperties::FirstControlIndex(node)); in VisitNode()
|