Home
last modified time | relevance | path

Searched refs:NodeSet (Results 1 – 25 of 43) sorted by relevance

12

/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFLiveness.h70 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
73 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) { in getAllReachedUses()
77 std::pair<NodeSet,bool> getAllReachingDefsRec(RegisterRef RefRR,
78 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
140 std::pair<NodeSet,bool> getAllReachingDefsRecImpl(RegisterRef RefRR,
141 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
DHexagonCommonGEP.cpp71 using NodeSet = std::set<GepNode *>; typedef
307 in_set(const NodeSet &S) : NS(S) {} in in_set()
314 const NodeSet &NS;
449 NodeSet &Nodes) { in nodes_for_root()
468 using NodeSymRel = std::set<NodeSet>;
474 static const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) { in node_class()
539 using NodeSetMap = std::map<unsigned, NodeSet>; in common()
554 NodeSet &S = I->second; in common()
555 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) { in common()
564 NodeSet C; in common()
[all …]
DRDFLiveness.cpp268 std::pair<NodeSet,bool>
270 NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
274 std::pair<NodeSet,bool>
276 NodeSet &Visited, const NodeSet &Defs, unsigned Nest, unsigned MaxNest) { in getAllReachingDefsRecImpl()
278 return { NodeSet(), false }; in getAllReachingDefsRecImpl()
293 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
297 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
379 NodeSet Liveness::getAllReachedUses(RegisterRef RefRR, in getAllReachedUses()
381 NodeSet Uses; in getAllReachedUses()
411 NodeSet T; in getAllReachedUses()
[all …]
/external/llvm-project/llvm/include/llvm/CodeGen/
DRDFLiveness.h95 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
98 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) {
102 std::pair<NodeSet,bool> getAllReachingDefsRec(RegisterRef RefRR,
103 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
164 std::pair<NodeSet,bool> getAllReachingDefsRecImpl(RegisterRef RefRR,
165 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
DMachinePipeliner.h53 class NodeSet; variable
138 using NodeSetType = SmallVector<NodeSet, 8>;
292 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
311 class NodeSet {
324 NodeSet() = default;
325 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
371 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
403 bool operator>(const NodeSet &RHS) const {
414 bool operator==(const NodeSet &RHS) const {
419 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); }
DRegAllocPBQP.h436 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
458 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
464 NodeSet::iterator NItr = in reduce()
496 using NodeSet = std::set<NodeId>; variable
497 NodeSet OptimallyReducibleNodes;
498 NodeSet ConservativelyAllocatableNodes;
499 NodeSet NotProvablyAllocatableNodes;
/external/apache-xml/src/main/java/org/apache/xpath/
DNodeSet.java59 public class NodeSet class
66 public NodeSet() in NodeSet() method in NodeSet
77 public NodeSet(int blocksize) in NodeSet() method in NodeSet
89 public NodeSet(NodeList nodelist) in NodeSet() method in NodeSet
103 public NodeSet(NodeSet nodelist) in NodeSet() method in NodeSet
117 public NodeSet(NodeIterator ni) in NodeSet() method in NodeSet
130 public NodeSet(Node node) in NodeSet() method in NodeSet
160 NodeSet clone = (NodeSet) clone(); in cloneWithReset()
471 public void addNodes(NodeSet ns) in addNodes()
848 NodeSet clone = (NodeSet) super.clone(); in clone()
[all …]
/external/llvm/lib/Target/Hexagon/
DRDFLiveness.h34 typedef std::map<RegisterRef,NodeSet> RefMap;
43 NodeSet getAllReachingDefsRec(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
44 NodeSet &Visited, const NodeSet &Defs);
45 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
DHexagonCommonGEP.cpp53 typedef std::set<GepNode*> NodeSet; typedef
281 in_set(const NodeSet &S) : NS(S) {} in in_set()
286 const NodeSet &NS;
427 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) { in nodes_for_root()
447 typedef std::set<NodeSet> NodeSymRel;
451 const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) { in node_class()
517 typedef std::map<unsigned,NodeSet> NodeSetMap; in common()
532 NodeSet &S = I->second; in common()
533 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) { in common()
542 NodeSet C; in common()
[all …]
DRDFLiveness.cpp240 NodeSet Liveness::getAllReachingDefsRec(RegisterRef RefRR, in getAllReachingDefsRec()
241 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
256 NodeSet TmpDefs = Defs; in getAllReachingDefsRec()
260 NodeSet Result = Defs; in getAllReachingDefsRec()
281 NodeSet Liveness::getAllReachedUses(RegisterRef RefRR, in getAllReachedUses()
283 NodeSet Uses; in getAllReachedUses()
309 NodeSet T; in getAllReachedUses()
349 NodeSet PhiDefs; in computePhiInfo()
838 NodeSet Rest; in traverse()
/external/llvm-project/llvm/lib/Target/X86/
DImmutableGraph.h111 class NodeSet {
116 NodeSet(const ImmutableGraph &G, bool ContainsAll = false)
139 NodeSet &operator|=(const NodeSet &RHS) {
145 NodeSet &operator&=(const NodeSet &RHS) {
151 NodeSet &operator^=(const NodeSet &RHS) {
164 const NodeSet &Set;
173 iterator(const NodeSet &Set, size_type Begin) in iterator()
303 using NodeSet = typename GraphT::NodeSet; variable
354 static std::unique_ptr<GraphT> trim(const GraphT &G, const NodeSet &TrimNodes, in trim()
DX86LoadValueInjectionLoadHardening.cpp155 using NodeSet = MachineGadgetGraph::NodeSet; typedef in __anon2656d5e80111::X86LoadValueInjectionLoadHardeningPass
171 NodeSet &ElimNodes /* in, out */) const;
369 rdf::NodeSet Uses; in getGadgetGraph()
544 NodeSet &ElimNodes /* in, out */) const { in elimMitigatedEdgesAndNodes()
561 NodeSet ReachableNodes{G}; in elimMitigatedEdgesAndNodes()
600 NodeSet ElimNodes{*Graph}; in trimMitigatedEdges()
653 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachinePipeliner.h53 class NodeSet; variable
144 using NodeSetType = SmallVector<NodeSet, 8>;
298 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
317 class NodeSet {
330 NodeSet() = default;
331 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
365 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
397 bool operator>(const NodeSet &RHS) const {
408 bool operator==(const NodeSet &RHS) const {
413 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); }
DRegAllocPBQP.h434 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
456 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
462 NodeSet::iterator NItr = in reduce()
494 using NodeSet = std::set<NodeId>; variable
495 NodeSet OptimallyReducibleNodes;
496 NodeSet ConservativelyAllocatableNodes;
497 NodeSet NotProvablyAllocatableNodes;
/external/llvm-project/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp71 using NodeSet = std::set<GepNode *>; typedef
297 in_set(const NodeSet &S) : NS(S) {} in in_set()
304 const NodeSet &NS;
439 NodeSet &Nodes) { in nodes_for_root()
458 using NodeSymRel = std::set<NodeSet>;
464 static const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) { in node_class()
529 using NodeSetMap = std::map<unsigned, NodeSet>; in common()
544 NodeSet &S = I->second; in common()
545 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) { in common()
554 NodeSet C; in common()
[all …]
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc161 class NodeSet { class
163 NodeSet() { Init(); } in NodeSet() function in absl::synchronization_internal::__anon56580e9d0111::NodeSet
255 NodeSet(const NodeSet&) = delete;
256 NodeSet& operator=(const NodeSet&) = delete;
284 NodeSet in; // List of immediate predecessor nodes in graph
285 NodeSet out; // List of immediate successor nodes in graph
382 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
637 NodeSet seen; in FindPath()
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc160 class NodeSet { class
162 NodeSet() { Init(); } in NodeSet() function in absl::synchronization_internal::__anon2b87d9ce0111::NodeSet
254 NodeSet(const NodeSet&) = delete;
255 NodeSet& operator=(const NodeSet&) = delete;
283 NodeSet in; // List of immediate predecessor nodes in graph
284 NodeSet out; // List of immediate successor nodes in graph
381 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
636 NodeSet seen; in FindPath()
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc160 class NodeSet { class
162 NodeSet() { Init(); } in NodeSet() function in absl::synchronization_internal::__anon7b8391bd0111::NodeSet
254 NodeSet(const NodeSet&) = delete;
255 NodeSet& operator=(const NodeSet&) = delete;
283 NodeSet in; // List of immediate predecessor nodes in graph
284 NodeSet out; // List of immediate successor nodes in graph
381 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
636 NodeSet seen; in FindPath()
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles.cc161 class NodeSet { class
163 NodeSet() { Init(); } in NodeSet() function in absl::synchronization_internal::__anon33c5fe6f0111::NodeSet
255 NodeSet(const NodeSet&) = delete;
256 NodeSet& operator=(const NodeSet&) = delete;
284 NodeSet in; // List of immediate predecessor nodes in graph
285 NodeSet out; // List of immediate successor nodes in graph
382 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
637 NodeSet seen; in FindPath()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc160 class NodeSet { class
162 NodeSet() { Init(); } in NodeSet() function in absl::synchronization_internal::__anonaf4c44af0111::NodeSet
254 NodeSet(const NodeSet&) = delete;
255 NodeSet& operator=(const NodeSet&) = delete;
283 NodeSet in; // List of immediate predecessor nodes in graph
284 NodeSet out; // List of immediate successor nodes in graph
381 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
636 NodeSet seen; in FindPath()
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc160 class NodeSet { class
162 NodeSet() { Init(); } in NodeSet() function in absl::synchronization_internal::__anon3e2d679e0111::NodeSet
254 NodeSet(const NodeSet&) = delete;
255 NodeSet& operator=(const NodeSet&) = delete;
283 NodeSet in; // List of immediate predecessor nodes in graph
284 NodeSet out; // List of immediate successor nodes in graph
381 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
636 NodeSet seen; in FindPath()
/external/llvm-project/llvm/test/CodeGen/Hexagon/
Dswp-carried-dep1.mir6 # CHECK: Rec NodeSet
7 # CHECK: Rec NodeSet
8 # CHECK: Rec NodeSet
9 # CHECK: Rec NodeSet
Dswp-carried-dep2.mir7 # CHECK: Rec NodeSet
8 # CHECK: Rec NodeSet
/external/llvm-project/llvm/lib/CodeGen/
DRDFLiveness.cpp308 std::pair<NodeSet,bool>
310 NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
314 std::pair<NodeSet,bool>
316 NodeSet &Visited, const NodeSet &Defs, unsigned Nest, unsigned MaxNest) { in getAllReachingDefsRecImpl()
318 return { NodeSet(), false }; in getAllReachingDefsRecImpl()
333 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
337 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
419 NodeSet Liveness::getAllReachedUses(RegisterRef RefRR, in getAllReachedUses()
421 NodeSet Uses; in getAllReachedUses()
451 NodeSet T; in getAllReachedUses()
[all …]
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h500 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
522 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
529 NodeSet::iterator NItr = in reduce()
559 typedef std::set<NodeId> NodeSet; typedef
560 NodeSet OptimallyReducibleNodes;
561 NodeSet ConservativelyAllocatableNodes;
562 NodeSet NotProvablyAllocatableNodes;

12