| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_iterator.h | 62 return static_cast<IteratorTy *>(this)->NodePtr->getParent(); 69 return static_cast<IteratorTy *>(this)->NodePtr->getParent(); 108 node_pointer NodePtr = nullptr; 112 explicit ilist_iterator(node_reference N) : NodePtr(&N) {} 114 explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {} 115 explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {} 123 : NodePtr(RHS.NodePtr) {} 130 NodePtr = RHS.NodePtr; 152 if (NodePtr) 153 return ilist_iterator<OptionsT, !IsReverse, IsConst>(*NodePtr); [all …]
|
| H A D | FoldingSet.h | 713 FoldingSetNode *NodePtr; 721 return NodePtr == RHS.NodePtr; 724 return NodePtr != RHS.NodePtr; 733 return *static_cast<T*>(NodePtr); 737 return static_cast<T*>(NodePtr);
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | CFGUpdate.h | 28 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 D | GenericDomTreeConstruction.h | 56 using NodePtr = typename DomTreeT::NodePtr; member 61 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>; 69 NodePtr IDom = nullptr; 75 SmallVector<NodePtr, 64> NumToNode = {nullptr}; 78 std::conditional_t<GraphHasNodeNumbers<NodePtr>, SmallVector<InfoRec, 64>, 79 DenseMap<NodePtr, InfoRec>> 112 static SmallVector<NodePtr, 8> getChildren(NodePtr N, BatchUpdatePtr BUI) { in getChildren() 119 static SmallVector<NodePtr, 8> getChildren(NodePtr N) { in getChildren() 121 std::conditional_t<Inversed, Inverse<NodePtr>, NodePtr>; in getChildren() 123 SmallVector<NodePtr, 8> Res(detail::reverse_if<!Inversed>(R)); in getChildren() [all …]
|
| H A D | CFGDiff.h | 52 // GraphDiff defines a CFG snapshot: given a set of Update<NodePtr>, provides 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 [all...] |
| H A D | GenericDomTree.h | 200 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); 209 GraphDiff<typename DomTreeT::NodePtr, 211 GraphDiff<typename DomTreeT::NodePtr, 222 using NodePtr = NodeT *; 223 using ParentPtr = decltype(std::declval<NodePtr>()->getParent()); 229 static ParentPtr getParent(NodePtr BB) { return BB->getParent(); } 243 using NodePtr = typename NodeTrait::NodePtr; [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ComplexDeinterleavingPass.cpp | 152 using NodePtr = std::shared_ptr<ComplexDeinterleavingCompositeNode>; typedef 171 void addOperand(NodePtr Node) { in addOperand() 222 using NodePtr = ComplexDeinterleavingCompositeNode::NodePtr; typedef in __anon87c1be940111::ComplexDeinterleavingGraph 229 NodePtr Node; 242 SmallVector<NodePtr> CompositeNodes; 243 DenseMap<std::pair<Value *, Value *>, NodePtr> CachedResult; 248 std::map<Instruction *, NodePtr> RootToNode; 298 NodePtr prepareCompositeNode(ComplexDeinterleavingOperation Operation, in prepareCompositeNode() 308 NodePtr submitCompositeNode(NodePtr Node) { in submitCompositeNode() 326 NodePtr identifyPartialMul(Instruction *Real, Instruction *Imag); [all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 99 Node *NodePtr; member 124 Node *NodePtr; member 387 auto TopNode = ShadowStack.back().NodePtr; in enterFunction() 395 CHECK_NE(Callee->NodePtr, nullptr); in enterFunction() 396 if (ShadowStack.AppendEmplace(TSC, Callee->NodePtr, CPU) == nullptr) in enterFunction() 430 auto TopNode = Top.NodePtr; in exitFunction() 516 Callee.NodePtr->CallCount, Callee.NodePtr->CumulativeLocalTime, in deepCopyInto() 523 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) == in deepCopyInto() 590 DFSStack.AppendEmplace(Callee.NodePtr, TargetCallee->NodePtr); in mergeInto()
|
| H A D | xray_profile_collector.cpp | 189 DFSStack.Append(C.NodePtr); in populateRecords()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanDominatorTree.h | 29 using NodePtr = VPBlockBase *; 32 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); } 33 static ParentPtr getParent(NodePtr B) { return B->getPlan(); }
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | FoldingSet.cpp | 396 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()
|
| /freebsd/sys/contrib/dev/acpica/compiler/ |
| H A D | asltypes.h | 236 ACPI_PARSE_OBJECT **NodePtr; member
|
| /freebsd/contrib/llvm-project/clang/lib/CodeGen/TargetBuiltins/ |
| H A D | AMDGPU.cpp | 653 llvm::Value *NodePtr = EmitScalarExpr(E->getArg(0)); in EmitAMDGPUBuiltinExpr() local 670 {NodePtr->getType(), RayDir->getType()}); in EmitAMDGPUBuiltinExpr() 671 return Builder.CreateCall(F, {NodePtr, RayExtent, RayOrigin, RayDir, in EmitAMDGPUBuiltinExpr() 685 llvm::Value *NodePtr = EmitScalarExpr(E->getArg(0)); in EmitAMDGPUBuiltinExpr() local 699 IntrinsicFunc, {NodePtr, RayExtent, InstanceMask, RayOrigin, RayDir, in EmitAMDGPUBuiltinExpr()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPULegalizerInfo.cpp | 7077 Register NodePtr = MI.getOperand(2).getReg(); in legalizeBVHIntersectRayIntrinsic() local 7095 const bool Is64 = MRI.getType(NodePtr).getSizeInBits() == 64; in legalizeBVHIntersectRayIntrinsic() 7131 Ops.push_back(NodePtr); in legalizeBVHIntersectRayIntrinsic() 7159 auto Unmerge = B.buildUnmerge({S32, S32}, NodePtr); in legalizeBVHIntersectRayIntrinsic() 7163 Ops.push_back(NodePtr); in legalizeBVHIntersectRayIntrinsic() 7228 Register NodePtr = MI.getOperand(4).getReg(); in legalizeBVHDualOrBVH8IntersectRayIntrinsic() local 7262 .addUse(NodePtr) in legalizeBVHDualOrBVH8IntersectRayIntrinsic()
|
| H A D | SIISelLowering.cpp | 9756 SDValue NodePtr = M->getOperand(2); in LowerINTRINSIC_W_CHAIN() local 9764 assert(NodePtr.getValueType() == MVT::i64); in LowerINTRINSIC_W_CHAIN() 9782 Ops.push_back(NodePtr); in LowerINTRINSIC_W_CHAIN() 9800 SDValue NodePtr = M->getOperand(2); in LowerINTRINSIC_W_CHAIN() local 9807 assert(NodePtr.getValueType() == MVT::i32 || in LowerINTRINSIC_W_CHAIN() 9808 NodePtr.getValueType() == MVT::i64); in LowerINTRINSIC_W_CHAIN() 9821 const bool Is64 = NodePtr.getValueType() == MVT::i64; in LowerINTRINSIC_W_CHAIN() 9874 Ops.push_back(NodePtr); in LowerINTRINSIC_W_CHAIN() 9893 DAG.ExtractVectorElements(DAG.getBitcast(MVT::v2i32, NodePtr), Ops, 0, in LowerINTRINSIC_W_CHAIN() 9896 Ops.push_back(NodePtr); in LowerINTRINSIC_W_CHAIN()
|