| /external/swiftshader/third_party/marl/include/marl/ |
| D | dag.h | 84 using NodeIndex = size_t;
89 static const constexpr NodeIndex RootIndex = 0;
90 static const constexpr NodeIndex InvalidNodeIndex =
91 ~static_cast<NodeIndex>(0);
107 containers::vector<NodeIndex, NumReservedNumOuts> outs;
119 MARL_NO_EXPORT inline bool notify(RunContext*, NodeIndex);
123 MARL_NO_EXPORT inline void invoke(RunContext*, NodeIndex, WaitGroup*);
150 bool DAGBase<T>::notify(RunContext* ctx, NodeIndex nodeIdx) {
164 void DAGBase<T>::invoke(RunContext* ctx, NodeIndex nodeIdx, WaitGroup* wg) {
178 NodeIndex toInvoke = InvalidNodeIndex;
[all …]
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceLiveness.cpp | 89 SizeT NodeIndex = VMetadata->getLocalUseNode(Var)->getIndex(); in initInternal() local
90 LiveIndex = Nodes[NodeIndex].NumLocals++; in initInternal()
91 Nodes[NodeIndex].LiveToVarMap[LiveIndex] = Var; in initInternal()
138 SizeT NodeIndex = Node->getIndex(); in getVariable() local
139 return Nodes[NodeIndex].LiveToVarMap[LiveIndex - NumGlobals]; in getVariable()
|
| D | IceTargetLowering.cpp | 845 SizeT NodeIndex = VMetadata->getLocalUseNode(Var)->getIndex(); in getVarStackSlotParams() local
846 LocalsSize[NodeIndex] += Increment; in getVarStackSlotParams()
847 if (LocalsSize[NodeIndex] > *SpillAreaSizeBytes) in getVarStackSlotParams()
848 *SpillAreaSizeBytes = LocalsSize[NodeIndex]; in getVarStackSlotParams()
912 SizeT NodeIndex = VMetadata->getLocalUseNode(Var)->getIndex(); in assignVarStackSlots() local
913 LocalsSize[NodeIndex] += Increment; in assignVarStackSlots()
916 LocalsSize[NodeIndex]; in assignVarStackSlots()
|
| D | IceLoopAnalyzer.cpp | 270 for (auto NodeIndex : LoopBody) { in ComputeLoopInfo() local
271 CfgNode *Cur = Func->getNodes()[NodeIndex]; in ComputeLoopInfo()
|
| D | IceCfg.cpp | 608 for (auto NodeIndex : Body) { in findLoopInvariantInstructions() local
609 auto *Node = Nodes[NodeIndex]; in findLoopInvariantInstructions()
715 SizeT NodeIndex = 0; in shortCircuitJumps() local
717 Node->resetIndex(NodeIndex++); in shortCircuitJumps()
|
| D | IceTargetLoweringMIPS32.cpp | 131 SizeT NodeIndex = VMetadata->getLocalUseNode(Var)->getIndex(); in assignVarStackSlots() local
132 LocalsSize[NodeIndex] += Increment; in assignVarStackSlots()
135 LocalsSize[NodeIndex]; in assignVarStackSlots()
|
| /external/angle/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 270 inline int32_t NodeIndex(GraphId id) { in NodeIndex() function
361 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
472 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
479 xn->out.erase(NodeIndex(y)); in RemoveEdge()
480 yn->in.erase(NodeIndex(x)); in RemoveEdge()
495 const int32_t x = NodeIndex(idx); in InsertEdge()
496 const int32_t y = NodeIndex(idy); in InsertEdge()
629 const int32_t x = NodeIndex(idx); in FindPath()
630 const int32_t y = NodeIndex(idy); in FindPath()
|
| /external/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 269 inline int32_t NodeIndex(GraphId id) { in NodeIndex() function
360 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
478 xn->out.erase(NodeIndex(y)); in RemoveEdge()
479 yn->in.erase(NodeIndex(x)); in RemoveEdge()
494 const int32_t x = NodeIndex(idx); in InsertEdge()
495 const int32_t y = NodeIndex(idy); in InsertEdge()
628 const int32_t x = NodeIndex(idx); in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
|
| /external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 269 inline int32_t NodeIndex(GraphId id) { in NodeIndex() function
360 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
478 xn->out.erase(NodeIndex(y)); in RemoveEdge()
479 yn->in.erase(NodeIndex(x)); in RemoveEdge()
494 const int32_t x = NodeIndex(idx); in InsertEdge()
495 const int32_t y = NodeIndex(idy); in InsertEdge()
628 const int32_t x = NodeIndex(idx); in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
|
| /external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| D | graphcycles.cc | 270 inline int32_t NodeIndex(GraphId id) { in NodeIndex() function
361 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
472 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
479 xn->out.erase(NodeIndex(y)); in RemoveEdge()
480 yn->in.erase(NodeIndex(x)); in RemoveEdge()
495 const int32_t x = NodeIndex(idx); in InsertEdge()
496 const int32_t y = NodeIndex(idy); in InsertEdge()
629 const int32_t x = NodeIndex(idx); in FindPath()
630 const int32_t y = NodeIndex(idy); in FindPath()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 269 inline int32_t NodeIndex(GraphId id) { in NodeIndex() function
360 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
478 xn->out.erase(NodeIndex(y)); in RemoveEdge()
479 yn->in.erase(NodeIndex(x)); in RemoveEdge()
494 const int32_t x = NodeIndex(idx); in InsertEdge()
495 const int32_t y = NodeIndex(idy); in InsertEdge()
628 const int32_t x = NodeIndex(idx); in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
|
| /external/libtextclassifier/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 269 inline int32_t NodeIndex(GraphId id) { in NodeIndex() function
360 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
478 xn->out.erase(NodeIndex(y)); in RemoveEdge()
479 yn->in.erase(NodeIndex(x)); in RemoveEdge()
494 const int32_t x = NodeIndex(idx); in InsertEdge()
495 const int32_t y = NodeIndex(idy); in InsertEdge()
628 const int32_t x = NodeIndex(idx); in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
|