Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A Dilist_iterator.h79 node_pointer NodePtr = nullptr;
95 : NodePtr(RHS.NodePtr) {}
102 NodePtr = RHS.NodePtr;
124 if (NodePtr)
131 if (NodePtr)
140 assert(!NodePtr->isKnownSentinel());
147 return LHS.NodePtr == RHS.NodePtr;
150 return LHS.NodePtr != RHS.NodePtr;
155 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();
159 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();
[all …]
H A DFoldingSet.h622 FoldingSetNode *NodePtr;
630 return NodePtr == RHS.NodePtr;
633 return NodePtr != RHS.NodePtr;
642 return *static_cast<T*>(NodePtr);
646 return static_cast<T*>(NodePtr);
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DCFGUpdate.h29 template <typename NodePtr> class Update {
31 NodePtr From;
35 Update(UpdateKind Kind, NodePtr From, NodePtr To) in Update()
39 NodePtr getFrom() const { return From; } in getFrom()
40 NodePtr getTo() const { return ToAndKind.getPointer(); } in getTo()
63 template <typename NodePtr>
64 void LegalizeUpdates(ArrayRef<Update<NodePtr>> AllUpdates, in LegalizeUpdates()
72 SmallDenseMap<std::pair<NodePtr, NodePtr>, int, 4> Operations; in LegalizeUpdates()
76 NodePtr From = U.getFrom(); in LegalizeUpdates()
77 NodePtr To = U.getTo(); in LegalizeUpdates()
[all …]
H A DGenericDomTreeConstruction.h52 using NodePtr = typename DomTreeT::NodePtr; member
167 NodePtr getIDom(NodePtr BB) const { in getIDom()
191 static bool AlwaysDescend(NodePtr, NodePtr) { return true; } in AlwaysDescend()
194 NodePtr N;
258 NodePtr eval(NodePtr VIn, unsigned LastLinked) { in eval()
641 const NodePtr From, const NodePtr To) { in InsertEdge()
916 const NodePtr From, const NodePtr To) { in DeleteEdge()
993 auto DescendBelow = [Level, &DT](NodePtr, NodePtr To) { in DeleteReachable()
1118 auto DescendBelow = [MinLevel, &DT](NodePtr, NodePtr To) { in DeleteUnreachable()
1505 doFullDFSWalk(DT, [BB](NodePtr From, NodePtr To) { in verifyParentProperty()
[all …]
H A DGenericDomTree.h200 void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
201 typename DomTreeT::NodePtr To);
204 void DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
205 typename DomTreeT::NodePtr To);
225 using NodePtr = NodeT *;
232 using UpdateType = cfg::Update<NodePtr>;
675 for (const NodePtr Block : Roots) {
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFGDiff.h81 template <typename NodePtr, bool InverseGraph = false> class GraphDiff {
82 using UpdateMapType = SmallDenseMap<NodePtr, SmallVector<NodePtr, 2>>;
89 SmallVector<NodePtr, 1> Empty;
105 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates) { in GraphDiff()
106 SmallVector<cfg::Update<NodePtr>, 4> LegalizedUpdates; in GraphDiff()
107 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph); in GraphDiff()
119 bool ignoreChild(const NodePtr BB, NodePtr EdgeEnd, bool InverseEdge) const { in ignoreChild()
129 iterator_range<typename SmallVectorImpl<NodePtr>::const_iterator>
130 getAddedChildren(const NodePtr BB, bool InverseEdge) const { in getAddedChildren()
/freebsd-12.1/contrib/llvm/include/llvm/BinaryFormat/
H A DMsgPackTypes.h33 using NodePtr = std::shared_ptr<Node>; variable
36 using OptNodePtr = Optional<NodePtr>;
246 class ArrayNode : public Node, public std::vector<NodePtr> {
260 class MapNode : public Node, public StringMap<NodePtr> {
280 template <> struct PolymorphicTraits<msgpack::NodePtr> {
281 static NodeKind getKind(const msgpack::NodePtr &N) {
290 static msgpack::ScalarNode &getAsScalar(msgpack::NodePtr &N) {
295 static msgpack::MapNode &getAsMap(msgpack::NodePtr &N) {
300 static msgpack::ArrayNode &getAsSequence(msgpack::NodePtr &N) {
361 static msgpack::NodePtr &element(IO &IO, msgpack::ArrayNode &A,
/freebsd-12.1/contrib/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h100 Node *NodePtr; member
125 Node *NodePtr; member
392 auto TopNode = ShadowStack.back().NodePtr; in enterFunction()
400 CHECK_NE(Callee->NodePtr, nullptr); in enterFunction()
401 if (ShadowStack.AppendEmplace(TSC, Callee->NodePtr, CPU) == nullptr) in enterFunction()
435 auto TopNode = Top.NodePtr; in exitFunction()
521 Callee.NodePtr->CallCount, Callee.NodePtr->CumulativeLocalTime, in deepCopyInto()
528 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) == in deepCopyInto()
595 DFSStack.AppendEmplace(Callee.NodePtr, TargetCallee->NodePtr); in mergeInto()
H A Dxray_profile_collector.cc193 DFSStack.Append(C.NodePtr); in populateRecords()
/freebsd-12.1/contrib/llvm/lib/Support/
H A DFoldingSet.cpp436 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
441 void *Probe = NodePtr->getNextInBucket(); in advance()
444 NodePtr = NextNodeInBucket; in advance()
455 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()
/freebsd-12.1/sys/contrib/dev/acpica/compiler/
H A Dasltypes.h236 ACPI_PARSE_OBJECT **NodePtr; member