| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DDG.cpp | 135 : DDGNode(NodeKind::PiBlock), NodeList(List) { in PiBlockDDGNode()
136 assert(!NodeList.empty() && "pi-block node constructed with an empty list."); in PiBlockDDGNode()
140 : DDGNode(N), NodeList(N.NodeList) { in PiBlockDDGNode()
141 assert(getKind() == NodeKind::PiBlock && !NodeList.empty() && in PiBlockDDGNode()
146 : DDGNode(std::move(N)), NodeList(std::move(N.NodeList)) { in PiBlockDDGNode()
147 assert(getKind() == NodeKind::PiBlock && !NodeList.empty() && in PiBlockDDGNode()
151 PiBlockDDGNode::~PiBlockDDGNode() { NodeList.clear(); } in ~PiBlockDDGNode()
|
| H A D | BlockFrequencyInfoImpl.cpp | 717 LoopData::NodeList &Headers, LoopData::NodeList &Others) { in findIrreducibleHeaders()
789 LoopData::NodeList Headers; in createIrreducibleLoop()
790 LoopData::NodeList Others; in createIrreducibleLoop()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/AST/ |
| H A D | ParentMapContext.cpp | 54 matchParents(const DynTypedNodeList &NodeList,
280 match(const DynTypedNodeList &NodeList, in match()
282 if (const auto *TypedNode = NodeList[0].get<T>()) { in match()
295 return std::tuple_cat(std::make_tuple(false, NodeList), in match()
302 match(const DynTypedNodeList &NodeList, in match()
304 if (const auto *TypedNode = NodeList[0].get<T>()) { in match()
308 return std::make_tuple(true, NodeList, TypedNode); in match()
310 return std::make_tuple(false, NodeList, nullptr); in match()
316 matchParents(const DynTypedNodeList &NodeList, in matchParents() argument
318 return MatchParents<T, U...>::match(NodeList, ParentMap); in matchParents()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonOptAddrMode.cpp | 95 const NodeList &UNodeList);
97 bool analyzeUses(unsigned DefR, const NodeList &UNodeList,
101 const NodeList &UNodeList);
103 unsigned LRExtReg, const NodeList &UNodeList);
104 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
213 NodeList &UNodeList) { in allValidCandidates()
245 NodeList &UNodeList) { in getAllRealUses()
432 const NodeList &UNodeList, in analyzeUses()
453 NodeList AddaslUseList; in analyzeUses()
612 NodeList UNodeList; in changeAddAsl()
[all …]
|
| H A D | HexagonRDFOpt.cpp | 200 NodeList Refs = IA.Addr->members(DFG); in removeOperand()
256 NodeList Defs; in rewrite()
|
| H A D | RDFDeadCode.cpp | 186 NodeList DRNs, DINs; in erase()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 109 NodeList Liveness::getAllReachingDefs(RegisterRef RefRR, in getAllReachingDefs()
112 NodeList RDefs; // Return value. in getAllReachingDefs()
275 NodeList Ds; in getAllReachingDefs()
328 NodeList RDs = getAllReachingDefs(RefRR, RefA, false, true, DefRRs); in getAllReachingDefsRecImpl()
365 NodeList Ins = BA.Addr->members(DFG); in getNearestAliasedRef()
379 NodeList Refs = I.Addr->members(DFG); in getNearestAliasedRef()
468 NodeList Phis; in computePhiInfo()
470 NodeList Blocks = FA.Addr->members(DFG); in computePhiInfo()
486 NodeList PhiRefs = PhiA.Addr->members(DFG); in computePhiInfo()
600 NodeList Ds = getAllReachingDefs(UR, PUA, true, false, NoRegs); in computePhiInfo()
[all …]
|
| H A D | RDFGraph.cpp | 201 const NodeList &List;
581 NodeList Ms = members_if(EqBB, G); in findBlock()
886 NodeList Blocks = Func.Addr->members(*this); in build()
929 NodeList Preds; in build()
1049 NodeList Rel = getRelatedRefs(IA, DA); in pushClobbers()
1095 NodeList Rel = getRelatedRefs(IA, DA); in pushDefs()
1129 NodeList Refs; in getRelatedRefs()
1466 NodeList Preds; in buildPhis()
1539 NodeList Refs = PA.Addr->members(*this); in removeUnusedPhis()
1770 auto getAllNodes = [this] (NodeId N) -> NodeList { in unlinkDefDF()
[all …]
|
| H A D | CodeGenPrepare.cpp | 3238 SmallVector<PHINode *, 32> NodeList; member in __anon5386100c0c11::PhiNodeSet
3256 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
3257 NodeList.push_back(Ptr); in insert()
3277 NodeList.clear(); in clear()
3290 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); } in end()
3309 while (CurrentIndex < NodeList.size()) { in SkipRemovedElements()
3310 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
3324 assert(CurrentIndex < Set->NodeList.size() && in operator *()
3326 return Set->NodeList[CurrentIndex]; in operator *()
3330 assert(CurrentIndex < Set->NodeList.size() && in operator ++()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAnnotateKernelFeatures.cpp | 39 SmallVector<CallGraphNode*, 8> NodeList; member in __anon6544baff0111::AMDGPUAnnotateKernelFeatures
214 for (auto *Node : reverse(NodeList)) { in processUniformWorkGroupAttribute()
399 NodeList.push_back(I); in runOnSCC()
402 NodeList.clear(); in runOnSCC()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFLiveness.h | 83 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
86 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) {
91 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) {
|
| H A D | RDFGraph.h | 512 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>; variable
605 NodeList members(const DataFlowGraph &G) const;
607 NodeList members_if(Predicate P, const DataFlowGraph &G) const;
761 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
909 NodeList CodeNode::members_if(Predicate P, const DataFlowGraph &G) const { in members_if()
910 NodeList MM; in members_if()
944 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeList> &P);
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DDG.h | 184 NodeList = N.NodeList;
190 NodeList = std::move(N.NodeList);
196 assert(!NodeList.empty() && "Node list is empty."); in getNodes()
197 return NodeList; in getNodes()
211 PiNodeList NodeList;
|
| H A D | BlockFrequencyInfoImpl.h | 225 using NodeList = SmallVector<BlockNode, 4>; member
232 NodeList Nodes; ///< Header and the members of the loop.
267 NodeList::const_iterator members_begin() const { in members_begin()
271 NodeList::const_iterator members_end() const { return Nodes.end(); } in members_end()
272 iterator_range<NodeList::const_iterator> members() const { in members()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Demangle/ |
| H A D | MicrosoftDemangle.cpp | 37 struct NodeList { struct
39 NodeList *Next = nullptr; argument
1572 NodeList *Head = Arena.alloc<NodeList>(); in demangleNameScopeChain()
1579 NodeList *NewHead = Arena.alloc<NodeList>(); in demangleNameScopeChain()
2087 NodeList *Head = Arena.alloc<NodeList>(); in demangleArrayType()
2088 NodeList *Tail = Head; in demangleArrayType()
2125 NodeList *Head = Arena.alloc<NodeList>(); in demangleFunctionParameterList()
2126 NodeList **Current = &Head; in demangleFunctionParameterList()
2186 NodeList *Head = nullptr; in demangleTemplateParameterList()
2187 NodeList **Current = &Head; in demangleTemplateParameterList()
[all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Object/ |
| H A D | MachO.h | 111 using NodeList = SmallVector<NodeState, 16>; variable
112 using node_iterator = NodeList::const_iterator;
118 NodeList Stack;
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 419 rdf::NodeList AnalyzedChildDefs; in getGadgetGraph()
474 NodeList Defs = ArgPhi.Addr->members_if(DataFlowGraph::IsDef, DFG); in getGadgetGraph()
486 NodeList Defs = SA.Addr->members_if(DataFlowGraph::IsDef, DFG); in getGadgetGraph()
|