Searched refs:FirstControlIndex (Results 1 – 7 of 7) sorted by relevance
| /external/v8/src/compiler/ |
| D | node-properties.cc | 50 return FirstControlIndex(node) + node->op()->ControlInputCount(); in PastControlIndex()
85 return node->InputAt(FirstControlIndex(node) + index); in GetControlInput()
124 return IsInputRange(edge, FirstControlIndex(node), in IsControlEdge()
182 node->ReplaceInput(FirstControlIndex(node) + index, control); in ReplaceControlInput()
|
| D | graph-visualizer.cc | 293 os_ << ",\"rankInputs\":[0," << NodeProperties::FirstControlIndex(node) in PrintNode()
295 os_ << ",\"rankWithInput\":[" << NodeProperties::FirstControlIndex(node) in PrintNode()
299 os_ << ",\"rankInputs\":[" << NodeProperties::FirstControlIndex(node) in PrintNode()
378 } else if (index < NodeProperties::FirstControlIndex(from)) { in PrintEdge()
|
| D | node-properties.h | 34 static int FirstControlIndex(Node* node) { return PastEffectIndex(node); } in FirstControlIndex() function
|
| D | control-equivalence.cc | 181 for (int i = NodeProperties::FirstControlIndex(node); i < max; i++) { in DetermineParticipation()
|
| D | scheduler.cc | 178 NodeProperties::FirstControlIndex(node) == index; in IsCoupledControlEdge()
265 for (int i = NodeProperties::FirstControlIndex(node); i < max; i++) { in Run()
300 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 | 804 for (int i = std::max(index, NodeProperties::FirstControlIndex(node)); in ProcessRemainingInputs()
1537 EnqueueInput(node, NodeProperties::FirstControlIndex(node)); in VisitNode()
1542 EnqueueInput(node, NodeProperties::FirstControlIndex(node)); in VisitNode()
|