Home
last modified time | relevance | path

Searched refs:NodePtr (Results 1 – 25 of 30) sorted by relevance

12

/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
Dilist_iterator.h78 node_pointer NodePtr;
82 explicit ilist_iterator(node_reference N) : NodePtr(&N) {}
84 explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {}
85 explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {}
86 ilist_iterator() : NodePtr(nullptr) {}
94 : NodePtr(RHS.NodePtr) {}
101 NodePtr = RHS.NodePtr;
110 if (NodePtr)
111 return ilist_iterator<OptionsT, !IsReverse, IsConst>(*NodePtr);
117 if (NodePtr)
[all …]
DFoldingSet.h635 FoldingSetNode *NodePtr;
643 return NodePtr == RHS.NodePtr;
646 return NodePtr != RHS.NodePtr;
655 return *static_cast<T*>(NodePtr);
659 return static_cast<T*>(NodePtr);
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
Dilist_iterator.h78 node_pointer NodePtr = nullptr;
82 explicit ilist_iterator(node_reference N) : NodePtr(&N) {}
84 explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {}
85 explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {}
94 : NodePtr(RHS.NodePtr) {}
101 NodePtr = RHS.NodePtr;
123 if (NodePtr)
124 return ilist_iterator<OptionsT, !IsReverse, IsConst>(*NodePtr);
130 if (NodePtr)
133 false>::node_reference>(*NodePtr));
[all …]
DFoldingSet.h621 FoldingSetNode *NodePtr;
629 return NodePtr == RHS.NodePtr;
632 return NodePtr != RHS.NodePtr;
641 return *static_cast<T*>(NodePtr);
645 return static_cast<T*>(NodePtr);
/external/llvm-project/llvm/include/llvm/ADT/
Dilist_iterator.h78 node_pointer NodePtr = nullptr;
82 explicit ilist_iterator(node_reference N) : NodePtr(&N) {}
84 explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {}
85 explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {}
93 : NodePtr(RHS.NodePtr) {}
100 NodePtr = RHS.NodePtr;
122 if (NodePtr)
123 return ilist_iterator<OptionsT, !IsReverse, IsConst>(*NodePtr);
129 if (NodePtr)
132 false>::node_reference>(*NodePtr));
[all …]
DFoldingSet.h667 FoldingSetNode *NodePtr;
675 return NodePtr == RHS.NodePtr;
678 return NodePtr != RHS.NodePtr;
687 return *static_cast<T*>(NodePtr);
691 return static_cast<T*>(NodePtr);
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DCFGUpdate.h28 template <typename NodePtr> class Update {
29 using NodeKindPair = PointerIntPair<NodePtr, 1, UpdateKind>;
30 NodePtr From;
34 Update(UpdateKind Kind, NodePtr From, NodePtr To) in Update()
38 NodePtr getFrom() const { return From; } in getFrom()
39 NodePtr getTo() const { return ToAndKind.getPointer(); } in getTo()
62 template <typename NodePtr>
63 void LegalizeUpdates(ArrayRef<Update<NodePtr>> AllUpdates, in LegalizeUpdates()
64 SmallVectorImpl<Update<NodePtr>> &Result, in LegalizeUpdates()
71 SmallDenseMap<std::pair<NodePtr, NodePtr>, int, 4> Operations; in LegalizeUpdates()
[all …]
DGenericDomTreeConstruction.h54 using NodePtr = typename DomTreeT::NodePtr; member
65 NodePtr Label = nullptr;
66 NodePtr IDom = nullptr;
67 SmallVector<NodePtr, 2> ReverseChildren;
72 std::vector<NodePtr> NumToNode = {nullptr};
73 DenseMap<NodePtr, InfoRec> NodeToInfo;
79 using NodePtrAndKind = PointerIntPair<NodePtr, 1, UpdateKind>;
88 DenseMap<NodePtr, SmallVector<NodePtrAndKind, 4>> FutureSuccessors;
89 DenseMap<NodePtr, SmallVector<NodePtrAndKind, 4>> FuturePredecessors;
110 using ResultTy = SmallVector<NodePtr, 8>;
[all …]
/external/llvm-project/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h56 using NodePtr = typename DomTreeT::NodePtr; member
61 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>;
68 NodePtr Label = nullptr;
69 NodePtr IDom = nullptr;
70 SmallVector<NodePtr, 2> ReverseChildren;
75 std::vector<NodePtr> NumToNode = {nullptr};
76 DenseMap<NodePtr, InfoRec> NodeToInfo;
108 static SmallVector<NodePtr, 8> getChildren(NodePtr N, BatchUpdatePtr BUI) { in getChildren()
115 static SmallVector<NodePtr, 8> getChildren(NodePtr N) { in getChildren()
117 std::conditional_t<Inversed, Inverse<NodePtr>, NodePtr>; in getChildren()
[all …]
DCFGUpdate.h27 template <typename NodePtr> class Update {
28 using NodeKindPair = PointerIntPair<NodePtr, 1, UpdateKind>;
29 NodePtr From;
33 Update(UpdateKind Kind, NodePtr From, NodePtr To) in Update()
37 NodePtr getFrom() const { return From; } in getFrom()
38 NodePtr getTo() const { return ToAndKind.getPointer(); } in getTo()
61 template <typename NodePtr>
62 void LegalizeUpdates(ArrayRef<Update<NodePtr>> AllUpdates,
63 SmallVectorImpl<Update<NodePtr>> &Result,
70 SmallDenseMap<std::pair<NodePtr, NodePtr>, int, 4> Operations;
[all …]
DCFGDiff.h57 template <typename NodePtr, bool InverseGraph = false> class GraphDiff {
59 SmallVector<NodePtr, 2> DI[2];
61 using UpdateMapType = SmallDenseMap<NodePtr, DeletesInserts>;
74 SmallVector<cfg::Update<NodePtr>, 4> LegalizedUpdates;
95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates,
97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
113 cfg::Update<NodePtr> popUpdateForIncrementalUpdates() { in popUpdateForIncrementalUpdates()
134 using VectRet = SmallVector<NodePtr, 8>;
135 template <bool InverseEdge> VectRet getChildren(NodePtr N) const { in getChildren()
137 std::conditional_t<InverseEdge, Inverse<NodePtr>, NodePtr>; in getChildren()
DGenericDomTree.h205 void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
206 typename DomTreeT::NodePtr To);
209 void DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
210 typename DomTreeT::NodePtr To);
214 GraphDiff<typename DomTreeT::NodePtr,
216 GraphDiff<typename DomTreeT::NodePtr,
233 using NodePtr = NodeT *;
240 using UpdateType = cfg::Update<NodePtr>;
545 GraphDiff<NodePtr, IsPostDominator> PreViewCFG(
559 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
[all …]
/external/deqp-deps/SPIRV-Tools/source/opt/
Dtree_iterator.h49 using NodePtr = NodeTy*; variable
56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator()
72 NodePtr operator->() const { return current_; }
97 std::pair<NodePtr, NodeIterator>& next_it = parent_iterators_.top(); in MoveToNextNode()
110 NodePtr current_;
115 std::stack<std::pair<NodePtr, NodeIterator>> parent_iterators_;
143 using NodePtr = NodeTy*; variable
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin()
154 static inline PostOrderTreeDFIterator end(NodePtr sentinel_node) { in end()
168 NodePtr operator->() const { return current_; }
[all …]
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dtree_iterator.h49 using NodePtr = NodeTy*; variable
56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator()
72 NodePtr operator->() const { return current_; }
97 std::pair<NodePtr, NodeIterator>& next_it = parent_iterators_.top(); in MoveToNextNode()
110 NodePtr current_;
115 std::stack<std::pair<NodePtr, NodeIterator>> parent_iterators_;
143 using NodePtr = NodeTy*; variable
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin()
154 static inline PostOrderTreeDFIterator end(NodePtr sentinel_node) { in end()
168 NodePtr operator->() const { return current_; }
[all …]
/external/llvm-project/openmp/libomptarget/src/
DMemoryManager.cpp181 NodeTy *NodePtr = nullptr; in allocate() local
193 NodePtr = &Itr->get(); in allocate()
199 if (NodePtr != nullptr) in allocate()
200 DP("Find one node " DPxMOD " in the bucket.\n", DPxPTR(NodePtr)); in allocate()
205 if (NodePtr == nullptr) { in allocate()
217 NodePtr = &Itr.first->second; in allocate()
221 DPxPTR(NodePtr), DPxPTR(TgtPtr), Size); in allocate()
224 assert(NodePtr && "NodePtr should not be nullptr at this point"); in allocate()
226 return NodePtr->Ptr; in allocate()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFGDiff.h80 template <typename NodePtr, bool InverseGraph = false> class GraphDiff {
81 using UpdateMapType = SmallDenseMap<NodePtr, SmallVector<NodePtr, 2>>;
88 SmallVector<NodePtr, 1> Empty;
104 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates) { in GraphDiff()
105 SmallVector<cfg::Update<NodePtr>, 4> LegalizedUpdates; in GraphDiff()
106 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph); in GraphDiff()
118 bool ignoreChild(const NodePtr BB, NodePtr EdgeEnd, bool InverseEdge) const { in ignoreChild()
128 iterator_range<typename SmallVectorImpl<NodePtr>::const_iterator>
129 getAddedChildren(const NodePtr BB, bool InverseEdge) const { in getAddedChildren()
/external/llvm-project/compiler-rt/lib/xray/tests/unit/
Dsegmented_array_test.cpp194 uint64_t *NodePtr = nullptr; member
195 ShadowStackEntry(uint64_t T, uint64_t *N) : EntryTSC(T), NodePtr(N) {} in ShadowStackEntry()
208 ASSERT_EQ(P->NodePtr, &Dummy); in TEST()
210 ASSERT_EQ(Back.NodePtr, &Dummy); in TEST()
219 uint64_t *TopNode = Top.NodePtr; in TEST()
245 ASSERT_EQ(P->NodePtr, &Dummy); in TEST()
247 ASSERT_EQ(Back.NodePtr, &Dummy); in TEST()
256 uint64_t *TopNode = Top.NodePtr; in TEST()
267 ASSERT_EQ(P->NodePtr, &Dummy); in TEST()
269 ASSERT_EQ(Back.NodePtr, &Dummy); in TEST()
[all …]
Dfunction_call_trie_test.cpp173 const auto &F2 = *F1.Callees[0].NodePtr; in TEST()
177 const auto &F3 = *F2.Callees[0].NodePtr; in TEST()
212 F = F->Callees[0].NodePtr; in TEST()
249 ->NodePtr; in TEST()
254 ->NodePtr; in TEST()
298 const auto &F1 = *R0.Callees[0].NodePtr; in TEST()
304 const auto &F2 = *F1.Callees[0].NodePtr; in TEST()
/external/llvm/include/llvm/ADT/
Dilist.h205 pointer NodePtr;
208 explicit ilist_iterator(pointer NP) : NodePtr(NP) {}
209 explicit ilist_iterator(reference NR) : NodePtr(&NR) {}
210 ilist_iterator() : NodePtr(nullptr) {}
216 : NodePtr(RHS.getNodePtrUnchecked()) {}
222 NodePtr = RHS.getNodePtrUnchecked();
226 void reset(pointer NP) { NodePtr = NP; }
229 explicit operator pointer() const { return NodePtr; }
230 reference operator*() const { return *NodePtr; }
235 return NodePtr == RHS.getNodePtrUnchecked();
[all …]
DFoldingSet.h625 FoldingSetNode *NodePtr;
631 return NodePtr == RHS.NodePtr;
634 return NodePtr != RHS.NodePtr;
643 return *static_cast<T*>(NodePtr);
647 return static_cast<T*>(NodePtr);
/external/llvm-project/compiler-rt/lib/xray/
Dxray_function_call_trie.h99 Node *NodePtr; member
124 Node *NodePtr; member
391 auto TopNode = ShadowStack.back().NodePtr; in enterFunction()
399 CHECK_NE(Callee->NodePtr, nullptr); in enterFunction()
400 if (ShadowStack.AppendEmplace(TSC, Callee->NodePtr, CPU) == nullptr) in enterFunction()
434 auto TopNode = Top.NodePtr; in exitFunction()
520 Callee.NodePtr->CallCount, Callee.NodePtr->CumulativeLocalTime, in deepCopyInto()
527 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) == in deepCopyInto()
594 DFSStack.AppendEmplace(Callee.NodePtr, TargetCallee->NodePtr); in mergeInto()
/external/llvm/lib/Support/
DFoldingSet.cpp434 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
439 void *Probe = NodePtr->getNextInBucket(); in advance()
442 NodePtr = NextNodeInBucket; in advance()
453 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DFoldingSet.cpp435 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
440 void *Probe = NodePtr->getNextInBucket(); in advance()
443 NodePtr = NextNodeInBucket; in advance()
454 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()
/external/swiftshader/third_party/llvm-subzero/lib/Support/
DFoldingSet.cpp434 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
439 void *Probe = NodePtr->getNextInBucket(); in advance()
442 NodePtr = NextNodeInBucket; in advance()
453 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()
/external/llvm-project/llvm/lib/Support/
DFoldingSet.cpp444 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
449 void *Probe = NodePtr->getNextInBucket(); in advance()
452 NodePtr = NextNodeInBucket; in advance()
463 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()

12