| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_iterator.h | 78 node_pointer NodePtr = nullptr; 93 : NodePtr(RHS.NodePtr) {} 100 NodePtr = RHS.NodePtr; 122 if (NodePtr) 129 if (NodePtr) 138 assert(!NodePtr->isKnownSentinel()); 145 return LHS.NodePtr == RHS.NodePtr; 148 return LHS.NodePtr != RHS.NodePtr; 153 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev(); 157 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext(); [all …]
|
| H A D | FoldingSet.h | 667 FoldingSetNode *NodePtr; 675 return NodePtr == RHS.NodePtr; 678 return NodePtr != RHS.NodePtr; 687 return *static_cast<T*>(NodePtr); 691 return static_cast<T*>(NodePtr);
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | CFGUpdate.h | 28 template <typename NodePtr> class Update { 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, 71 SmallDenseMap<std::pair<NodePtr, NodePtr>, int, 4> Operations; 75 NodePtr From = U.getFrom(); 76 NodePtr To = U.getTo(); [all …]
|
| H A D | GenericDomTreeConstruction.h | 56 using NodePtr = typename DomTreeT::NodePtr; member 115 static SmallVector<NodePtr, 8> getChildren(NodePtr N) { in getChildren() 117 std::conditional_t<Inversed, Inverse<NodePtr>, NodePtr>; in getChildren() 126 NodePtr getIDom(NodePtr BB) const { in getIDom() 148 static bool AlwaysDescend(NodePtr, NodePtr) { return true; } in AlwaysDescend() 151 NodePtr N; 240 NodePtr eval(NodePtr V, unsigned LastLinked, in eval() 993 auto DescendBelow = [Level, &DT](NodePtr, NodePtr To) { in DeleteReachable() 1117 auto DescendBelow = [MinLevel, &DT](NodePtr, NodePtr To) { in DeleteUnreachable() 1479 doFullDFSWalk(DT, [BB](NodePtr From, NodePtr To) { in verifyParentProperty() [all …]
|
| H A D | CFGDiff.h | 57 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 D | GenericDomTree.h | 205 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( 568 GraphDiff<NodePtr, IsPostDom> PreViewCFG(AllUpdates, [all …]
|
| /freebsd-13.1/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 99 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 D | xray_profile_collector.cpp | 192 DFSStack.Append(C.NodePtr); in populateRecords()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Support/ |
| H A D | FoldingSet.cpp | 444 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()
|
| /freebsd-13.1/sys/contrib/dev/acpica/compiler/ |
| H A D | asltypes.h | 236 ACPI_PARSE_OBJECT **NodePtr; member
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPULegalizerInfo.cpp | 4759 Register NodePtr = MI.getOperand(2).getReg(); in legalizeBVHIntrinsic() local 4775 bool Is64 = MRI.getType(NodePtr).getSizeInBits() == 64; in legalizeBVHIntrinsic() 4783 auto Unmerge = B.buildUnmerge({S32, S32}, NodePtr); in legalizeBVHIntrinsic() 4787 Ops.push_back(NodePtr); in legalizeBVHIntrinsic()
|
| H A D | SIISelLowering.cpp | 7346 SDValue NodePtr = M->getOperand(2); in LowerINTRINSIC_W_CHAIN() local 7353 assert(NodePtr.getValueType() == MVT::i32 || in LowerINTRINSIC_W_CHAIN() 7354 NodePtr.getValueType() == MVT::i64); in LowerINTRINSIC_W_CHAIN() 7364 bool Is64 = NodePtr.getValueType() == MVT::i64; in LowerINTRINSIC_W_CHAIN() 7400 DAG.ExtractVectorElements(DAG.getBitcast(MVT::v2i32, NodePtr), Ops, 0, 2); in LowerINTRINSIC_W_CHAIN() 7402 Ops.push_back(NodePtr); in LowerINTRINSIC_W_CHAIN()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/CodeGen/ |
| H A D | CGBuiltin.cpp | 16242 llvm::Value *NodePtr = EmitScalarExpr(E->getArg(0)); in EmitAMDGPUBuiltinExpr() local 16250 {NodePtr->getType(), RayDir->getType()}); in EmitAMDGPUBuiltinExpr() 16251 return Builder.CreateCall(F, {NodePtr, RayExtent, RayOrigin, RayDir, in EmitAMDGPUBuiltinExpr()
|