Home
last modified time | relevance | path

Searched refs:DFSNodeData (Results 1 – 25 of 34) sorted by relevance

12

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/CodeGen/
H A DScheduleDFS.h102 std::vector<NodeData> DFSNodeData; variable
125 bool empty() const { return DFSNodeData.empty(); } in empty()
129 DFSNodeData.clear(); in clear()
137 DFSNodeData.resize(NumSUnits); in resize()
146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/CodeGen/
H A DScheduleDFS.h103 std::vector<NodeData> DFSNodeData; variable
126 bool empty() const { return DFSNodeData.empty(); } in empty()
130 DFSNodeData.clear(); in clear()
138 DFSNodeData.resize(NumSUnits); in resize()
147 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
174 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/CodeGen/
H A DScheduleDFS.h103 std::vector<NodeData> DFSNodeData; variable
126 bool empty() const { return DFSNodeData.empty(); } in empty()
130 DFSNodeData.clear(); in clear()
138 DFSNodeData.resize(NumSUnits); in resize()
147 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
174 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1248 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1256 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1263 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1273 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1282 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1291 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1313 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1314 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1344 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1369 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1244 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1252 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1259 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1269 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1278 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1287 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1309 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1310 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1340 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1365 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1245 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1253 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1260 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1270 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1279 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1288 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1310 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1311 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1341 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1366 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1244 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1252 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1259 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1269 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1278 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1287 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1309 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1310 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1340 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1365 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1249 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1257 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1264 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1274 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1283 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1292 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1314 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1315 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1345 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1370 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1249 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1257 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1264 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1274 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1283 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1292 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1314 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1315 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1345 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1370 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1248 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1256 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1263 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1273 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1282 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1291 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1313 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1314 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1344 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1369 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1245 RootSet.setUniverse(R.DFSNodeData.size()); in SchedDFSImpl()
1253 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1260 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1270 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1279 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1288 if (R.DFSNodeData[PredNum].SubtreeID == PredNum) { in visitPostorderNode()
1310 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
1311 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1341 R.DFSNodeData[Idx].SubtreeID = SubtreeClasses[Idx]; in finalize()
1366 if (R.DFSNodeData[PredNum].SubtreeID != PredNum) in joinPredSubtree()
[all …]

12