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

/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp454 /// initializing the Index2Node and Node2Index arrays and then tries to keep
466 Node2Index.resize(DAGSize);
475 // Temporarily use the Node2Index array as scratch space for degree counts.
476 Node2Index[NodeNum] = Degree;
495 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum])
510 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] &&
521 LowerBound = Node2Index[Y->NodeNum];
522 UpperBound = Node2Index[X->NodeNum];
558 if (s >= Node2Index
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h703 /// Node2Index - Maps the node number to its topological index.
704 std::vector<int> Node2Index; member in class:llvm::ScheduleDAGTopologicalSort

Completed in 119 milliseconds