HomeSort by: relevance | last modified time | path
    Searched refs:DFSNodeData (Results 1 - 2 of 2) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ScheduleDFS.h 102 std::vector<NodeData> DFSNodeData;
125 bool empty() const { return DFSNodeData.empty(); }
129 DFSNodeData.clear();
137 DFSNodeData.resize(NumSUnits);
146 return DFSNodeData[SU->NodeNum].InstrCount;
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth());
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node");
173 return DFSNodeData[SU->NodeNum].SubtreeID;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 1250 SchedDFSImpl(SchedDFSResult &r): R(r), SubtreeClasses(R.DFSNodeData.size()) {
1251 RootSet.setUniverse(R.DFSNodeData.size());
1259 return R.DFSNodeData[SU->NodeNum].SubtreeID
1266 R.DFSNodeData[SU->NodeNum].InstrCount =
1276 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;
1285 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;
1290 if ((InstrCount - R.DFSNodeData[PredNum].InstrCount) < R.SubtreeLimit)
1294 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) {
1316 R.DFSNodeData[Succ->NodeNum].InstrCount
1317 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount
    [all...]

Completed in 32 milliseconds