Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A 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 …]
H A DFoldingSet.h694 FoldingSetNode *NodePtr;
702 return NodePtr == RHS.NodePtr;
705 return NodePtr != RHS.NodePtr;
714 return *static_cast<T*>(NodePtr);
718 return static_cast<T*>(NodePtr);
/openbsd-src/gnu/llvm/llvm/include/llvm/Support/
H A 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,
64 SmallVectorImpl<Update<NodePtr>> &Result,
71 SmallDenseMap<std::pair<NodePtr, NodePtr>, int, 4> Operations;
[all …]
H A DGenericDomTreeConstruction.h57 using NodePtr = typename DomTreeT::NodePtr; member
62 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>;
69 NodePtr Label = nullptr;
70 NodePtr IDom = nullptr;
71 SmallVector<NodePtr, 2> ReverseChildren;
76 std::vector<NodePtr> NumToNode = {nullptr};
77 DenseMap<NodePtr, InfoRec> NodeToInfo;
109 static SmallVector<NodePtr, 8> getChildren(NodePtr N, BatchUpdatePtr BUI) { in getChildren()
116 static SmallVector<NodePtr, 8> getChildren(NodePtr N) { in getChildren()
118 std::conditional_t<Inversed, Inverse<NodePtr>, NodePtr>; in getChildren()
[all …]
H A 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()
H A DGenericDomTree.h206 void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
207 typename DomTreeT::NodePtr To);
210 void DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
211 typename DomTreeT::NodePtr To);
215 GraphDiff<typename DomTreeT::NodePtr,
217 GraphDiff<typename DomTreeT::NodePtr,
228 using NodePtr = NodeT *;
229 using ParentPtr = decltype(std::declval<NodePtr>()->getParent());
235 static ParentPtr getParent(NodePtr BB) { return BB->getParent(); }
249 using NodePtr = typename NodeTrait::NodePtr;
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp132 using NodePtr = std::shared_ptr<ComplexDeinterleavingCompositeNode>; typedef
149 void addOperand(NodePtr Node) { Operands.push_back(Node.get()); } in addOperand()
195 using NodePtr = ComplexDeinterleavingCompositeNode::NodePtr; typedef in __anon57316e8b0111::ComplexDeinterleavingGraph
202 NodePtr RootNode;
203 SmallVector<NodePtr> CompositeNodes;
206 NodePtr prepareCompositeNode(ComplexDeinterleavingOperation Operation, in prepareCompositeNode()
212 NodePtr submitCompositeNode(NodePtr Node) { in submitCompositeNode()
221 NodePtr getContainingComposite(Value *R, Value *I) { in getContainingComposite()
240 NodePtr identifyPartialMul(Instruction *Real, Instruction *Imag);
245 NodePtr identifyNodeWithImplicitAdd(
[all …]
/openbsd-src/gnu/llvm/compiler-rt/lib/xray/tests/unit/
H A 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 …]
H A 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()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DVPlanDominatorTree.h28 using NodePtr = VPBlockBase *;
31 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); }
32 static ParentPtr getParent(NodePtr B) { return B->getPlan(); }
/openbsd-src/gnu/llvm/compiler-rt/lib/xray/
H A 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()
H A Dxray_profile_collector.cpp192 DFSStack.Append(C.NodePtr); in populateRecords()
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DFoldingSet.cpp396 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
401 void *Probe = NodePtr->getNextInBucket(); in advance()
404 NodePtr = NextNodeInBucket; in advance()
415 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.other/
H A Dconv7.C24 template<class T, class Ref, class NodePtr, class ListPtr>
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPULegalizerInfo.cpp5406 Register NodePtr = MI.getOperand(2).getReg(); in legalizeBVHIntrinsic() local
5423 const bool Is64 = MRI.getType(NodePtr).getSizeInBits() == 64; in legalizeBVHIntrinsic()
5455 Ops.push_back(NodePtr); in legalizeBVHIntrinsic()
5483 auto Unmerge = B.buildUnmerge({S32, S32}, NodePtr); in legalizeBVHIntrinsic()
5487 Ops.push_back(NodePtr); in legalizeBVHIntrinsic()
H A DSIISelLowering.cpp7729 SDValue NodePtr = M->getOperand(2); in LowerINTRINSIC_W_CHAIN() local
7736 assert(NodePtr.getValueType() == MVT::i32 || in LowerINTRINSIC_W_CHAIN()
7737 NodePtr.getValueType() == MVT::i64); in LowerINTRINSIC_W_CHAIN()
7748 const bool Is64 = NodePtr.getValueType() == MVT::i64; in LowerINTRINSIC_W_CHAIN()
7803 Ops.push_back(NodePtr); in LowerINTRINSIC_W_CHAIN()
7822 DAG.ExtractVectorElements(DAG.getBitcast(MVT::v2i32, NodePtr), Ops, 0, in LowerINTRINSIC_W_CHAIN()
7825 Ops.push_back(NodePtr); in LowerINTRINSIC_W_CHAIN()
/openbsd-src/gnu/llvm/clang/lib/CodeGen/
H A DCGBuiltin.cpp17172 llvm::Value *NodePtr = EmitScalarExpr(E->getArg(0)); in EmitAMDGPUBuiltinExpr() local
17189 {NodePtr->getType(), RayDir->getType()}); in EmitAMDGPUBuiltinExpr()
17190 return Builder.CreateCall(F, {NodePtr, RayExtent, RayOrigin, RayDir, in EmitAMDGPUBuiltinExpr()