| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | ParentMapContext.cpp | 54 matchParents(const DynTypedNodeList &NodeList,
289 match(const DynTypedNodeList &NodeList, in match()
291 if (const auto *TypedNode = NodeList[0].get<T>()) { in match()
298 [TypedNode](bool, DynTypedNodeList NodeList, auto... TupleTail) { in match() argument
299 return std::make_tuple(true, NodeList, TypedNode, TupleTail...); in match()
305 return std::tuple_cat(std::make_tuple(false, NodeList), in match()
312 match(const DynTypedNodeList &NodeList, in match()
314 if (const auto *TypedNode = NodeList[0].get<T>()) { in match()
318 return std::make_tuple(true, NodeList, TypedNode); in match()
320 return std::make_tuple(false, NodeList, nullptr); in match()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DDG.cpp | 134 : DDGNode(NodeKind::PiBlock), NodeList(List) { in PiBlockDDGNode()
135 assert(!NodeList.empty() && "pi-block node constructed with an empty list."); in PiBlockDDGNode()
139 : DDGNode(N), NodeList(N.NodeList) { in PiBlockDDGNode()
140 assert(getKind() == NodeKind::PiBlock && !NodeList.empty() && in PiBlockDDGNode()
145 : DDGNode(std::move(N)), NodeList(std::move(N.NodeList)) { in PiBlockDDGNode()
146 assert(getKind() == NodeKind::PiBlock && !NodeList.empty() && in PiBlockDDGNode()
150 PiBlockDDGNode::~PiBlockDDGNode() { NodeList.clear(); } in ~PiBlockDDGNode()
|
| H A D | BlockFrequencyInfoImpl.cpp | 693 LoopData::NodeList &Headers, LoopData::NodeList &Others) { in findIrreducibleHeaders()
765 LoopData::NodeList Headers; in createIrreducibleLoop()
766 LoopData::NodeList Others; in createIrreducibleLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonOptAddrMode.cpp | 97 const NodeList &UNodeList);
99 bool analyzeUses(unsigned DefR, const NodeList &UNodeList,
103 const NodeList &UNodeList);
105 unsigned LRExtReg, const NodeList &UNodeList);
106 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
107 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
164 const NodeList &UNodeList) { in canRemoveAddasl()
217 NodeList &UNodeList) { in allValidCandidates()
249 NodeList &UNodeList) { in getAllRealUses()
290 const NodeList &UNodeList) { in isSafeToExtLR()
[all …]
|
| H A D | HexagonRDFOpt.cpp | 205 NodeList Refs = IA.Addr->members(DFG); in removeOperand()
261 NodeList Defs; in rewrite()
|
| H A D | RDFDeadCode.cpp | 187 NodeList DRNs, DINs; in erase()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 104 NodeList Liveness::getAllReachingDefs(RegisterRef RefRR, in getAllReachingDefs()
108 NodeList RDefs; // Return value. in getAllReachingDefs()
270 NodeList Ds; in getAllReachingDefs()
324 NodeList RDs = getAllReachingDefs(RefRR, RefA, false, true, DefRRs); in getAllReachingDefsRecImpl()
360 NodeList Ins = BA.Addr->members(DFG); in getNearestAliasedRef()
374 NodeList Refs = I.Addr->members(DFG); in getNearestAliasedRef()
463 NodeList Phis; in computePhiInfo()
465 NodeList Blocks = FA.Addr->members(DFG); in computePhiInfo()
482 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 | 175 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeList> &P) { in operator <<()
198 PrintListV(const NodeList &L, const DataFlowGraph &G) : List(L), G(G) {} in PrintListV()
201 const NodeList &List;
520 NodeList CodeNode::members(const DataFlowGraph &G) const { in members()
572 NodeList Ms = members_if(EqBB, G); in findBlock()
911 NodeList Blocks = TheFunc.Addr->members(*this); in build()
946 NodeList Preds; in build()
1056 NodeList Rel = getRelatedRefs(IA, DA); in pushClobbers()
1104 NodeList Rel = getRelatedRefs(IA, DA); in pushDefs()
1136 NodeList DataFlowGraph::getRelatedRefs(Instr IA, Ref RA) const { in getRelatedRefs()
[all …]
|
| H A D | CodeGenPrepare.cpp | 3583 SmallVector<PHINode *, 32> NodeList; member in __anon1d600f580d11::PhiNodeSet
3601 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
3602 NodeList.push_back(Ptr); in insert()
3622 NodeList.clear(); in clear()
3635 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); } in end()
3650 while (CurrentIndex < NodeList.size()) { in SkipRemovedElements()
3651 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
3665 assert(CurrentIndex < Set->NodeList.size() && in operator *()
3667 return Set->NodeList[CurrentIndex]; in operator *()
3671 assert(CurrentIndex < Set->NodeList.size() && in operator ++()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFLiveness.h | 66 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode *> RefA,
70 NodeList getAllReachingDefs(NodeAddr<RefNode *> RefA) {
75 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode *> RefA) {
|
| H A D | RDFGraph.h | 550 using NodeList = SmallVector<Node, 4>; variable
624 NodeList members(const DataFlowGraph &G) const;
626 NodeList members_if(Predicate P, const DataFlowGraph &G) const;
797 NodeList getRelatedRefs(Instr IA, Ref RA) const;
946 NodeList CodeNode::members_if(Predicate P, const DataFlowGraph &G) const { in members_if()
947 NodeList MM; in members_if()
980 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeList> &P);
|
| /freebsd/contrib/llvm-project/llvm/lib/Demangle/ |
| H A D | MicrosoftDemangle.cpp | 38 struct NodeList { struct
40 NodeList *Next = nullptr; argument
1602 static NodeArrayNode *nodeListToNodeArray(ArenaAllocator &Arena, NodeList *Head, in nodeListToNodeArray()
1617 NodeList *Head = Arena.alloc<NodeList>(); in demangleNameScopeChain()
1624 NodeList *NewHead = Arena.alloc<NodeList>(); in demangleNameScopeChain()
2154 NodeList *Head = Arena.alloc<NodeList>(); in demangleArrayType()
2155 NodeList *Tail = Head; in demangleArrayType()
2166 Tail->Next = Arena.alloc<NodeList>(); in demangleArrayType()
2193 NodeList *Head = Arena.alloc<NodeList>(); in demangleFunctionParameterList()
2194 NodeList **Current = &Head; in demangleFunctionParameterList()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DDG.h | 184 NodeList = std::move(N.NodeList);
190 assert(!NodeList.empty() && "Node list is empty."); in getNodes()
191 return NodeList; in getNodes()
205 PiNodeList NodeList;
|
| H A D | BlockFrequencyInfoImpl.h | 226 using NodeList = SmallVector<BlockNode, 4>; member
233 NodeList Nodes; ///< Header and the members of the loop.
268 NodeList::const_iterator members_begin() const { in members_begin()
272 NodeList::const_iterator members_end() const { return Nodes.end(); } in members_end()
273 iterator_range<NodeList::const_iterator> members() const { in members()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 418 rdf::NodeList AnalyzedChildDefs; in getGadgetGraph()
472 NodeList Defs = ArgPhi.Addr->members_if(DataFlowGraph::IsDef, DFG); in getGadgetGraph()
484 NodeList Defs = SA.Addr->members_if(DataFlowGraph::IsDef, DFG); in getGadgetGraph()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Object/ |
| H A D | MachO.h | 112 using NodeList = SmallVector<NodeState, 16>; variable
113 using node_iterator = NodeList::const_iterator;
119 NodeList Stack;
|