| /openbsd-src/gnu/llvm/clang/lib/AST/ |
| H A D | ParentMapContext.cpp | 54 matchParents(const DynTypedNodeList &NodeList,
270 match(const DynTypedNodeList &NodeList, in match()
272 if (const auto *TypedNode = NodeList[0].get<T>()) { in match()
279 [TypedNode](bool, DynTypedNodeList NodeList, auto... TupleTail) { in match() argument
280 return std::make_tuple(true, NodeList, TypedNode, TupleTail...); in match()
286 return std::tuple_cat(std::make_tuple(false, NodeList), in match()
293 match(const DynTypedNodeList &NodeList, in match()
295 if (const auto *TypedNode = NodeList[0].get<T>()) { in match()
299 return std::make_tuple(true, NodeList, TypedNode); in match()
301 return std::make_tuple(false, NodeList, nullptr); in match()
[all …]
|
| /openbsd-src/gnu/llvm/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 | 716 LoopData::NodeList &Headers, LoopData::NodeList &Others) { in findIrreducibleHeaders()
788 LoopData::NodeList Headers; in createIrreducibleLoop()
789 LoopData::NodeList Others; in createIrreducibleLoop()
|
| /openbsd-src/gnu/llvm/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);
105 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
162 const NodeList &UNodeList) { in canRemoveAddasl()
215 NodeList &UNodeList) { in allValidCandidates()
247 NodeList &UNodeList) { in getAllRealUses()
288 const NodeList &UNodeList) { in isSafeToExtLR()
[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()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 108 NodeList Liveness::getAllReachingDefs(RegisterRef RefRR, in getAllReachingDefs()
111 NodeList RDefs; // Return value. in getAllReachingDefs()
274 NodeList Ds; in getAllReachingDefs()
327 NodeList RDs = getAllReachingDefs(RefRR, RefA, false, true, DefRRs); in getAllReachingDefsRecImpl()
363 NodeList Ins = BA.Addr->members(DFG); in getNearestAliasedRef()
377 NodeList Refs = I.Addr->members(DFG); in getNearestAliasedRef()
466 NodeList Phis; in computePhiInfo()
468 NodeList Blocks = FA.Addr->members(DFG); in computePhiInfo()
484 NodeList PhiRefs = PhiA.Addr->members(DFG); in computePhiInfo()
598 NodeList Ds = getAllReachingDefs(UR, PUA, true, false, NoRegs); in computePhiInfo()
[all …]
|
| H A D | RDFGraph.cpp | 172 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeList> &P) { in operator <<()
196 PrintListV(const NodeList &L, const DataFlowGraph &G) : List(L), G(G) {} in PrintListV()
199 const NodeList &List;
525 NodeList CodeNode::members(const DataFlowGraph &G) const { in members()
579 NodeList Ms = members_if(EqBB, G); in findBlock()
887 NodeList Blocks = Func.Addr->members(*this); in build()
930 NodeList Preds; in build()
1038 NodeList Rel = getRelatedRefs(IA, DA); in pushClobbers()
1084 NodeList Rel = getRelatedRefs(IA, DA); in pushDefs()
1114 NodeList DataFlowGraph::getRelatedRefs(NodeAddr<InstrNode*> IA, in getRelatedRefs()
[all …]
|
| H A D | CodeGenPrepare.cpp | 3360 SmallVector<PHINode *, 32> NodeList; member in __anon88ab83af0c11::PhiNodeSet
3378 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
3379 NodeList.push_back(Ptr); in insert()
3399 NodeList.clear(); in clear()
3412 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); } in end()
3427 while (CurrentIndex < NodeList.size()) { in SkipRemovedElements()
3428 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
3442 assert(CurrentIndex < Set->NodeList.size() && in operator *()
3444 return Set->NodeList[CurrentIndex]; in operator *()
3448 assert(CurrentIndex < Set->NodeList.size() && in operator ++()
|
| /openbsd-src/gnu/llvm/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 | 513 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>; variable
606 NodeList members(const DataFlowGraph &G) const;
608 NodeList members_if(Predicate P, const DataFlowGraph &G) const;
764 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
915 NodeList CodeNode::members_if(Predicate P, const DataFlowGraph &G) const { in members_if()
916 NodeList MM; in members_if()
952 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeList> &P);
|
| /openbsd-src/gnu/llvm/llvm/lib/Demangle/ |
| H A D | MicrosoftDemangle.cpp | 37 struct NodeList { struct
39 NodeList *Next = nullptr; argument
1546 static NodeArrayNode *nodeListToNodeArray(ArenaAllocator &Arena, NodeList *Head, in nodeListToNodeArray()
1561 NodeList *Head = Arena.alloc<NodeList>(); in demangleNameScopeChain()
1568 NodeList *NewHead = Arena.alloc<NodeList>(); in demangleNameScopeChain()
2076 NodeList *Head = Arena.alloc<NodeList>(); in demangleArrayType()
2077 NodeList *Tail = Head; in demangleArrayType()
2088 Tail->Next = Arena.alloc<NodeList>(); in demangleArrayType()
2114 NodeList *Head = Arena.alloc<NodeList>(); in demangleFunctionParameterList()
2115 NodeList **Current = &Head; in demangleFunctionParameterList()
[all …]
|
| /openbsd-src/gnu/llvm/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 | 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()
|
| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/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;
|