Searched refs:Node2Index (Results 1 - 2 of 2) sorted by relevance

/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp398 /// initializing the Index2Node and Node2Index arrays and then tries to keep
410 Node2Index.resize(DAGSize);
417 // Temporarily use the Node2Index array as scratch space for degree counts.
418 Node2Index[NodeNum] = Degree;
436 if (!--Node2Index[SU->NodeNum])
451 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] &&
462 LowerBound = Node2Index[Y->NodeNum];
463 UpperBound = Node2Index[X->NodeNum];
498 if (Node2Index[
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h655 /// Node2Index - Maps the node number to its topological index.
656 std::vector<int> Node2Index; member in class:llvm::ScheduleDAGTopologicalSort

Completed in 42 milliseconds