Home
last modified time | relevance | path

Searched refs:NodeList (Results 1 – 12 of 12) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonOptAddrMode.cpp95 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()
611 NodeList UNodeList; in changeAddAsl()
[all …]
H A DRDFLiveness.cpp108 NodeList Liveness::getAllReachingDefs(RegisterRef RefRR, in getAllReachingDefs()
111 NodeList RDefs; // Return value. in getAllReachingDefs()
237 NodeList Ds; in getAllReachingDefs()
290 NodeList RDs = getAllReachingDefs(RefRR, RefA, false, true, DefRRs); in getAllReachingDefsRecImpl()
327 NodeList Ins = BA.Addr->members(DFG); in getNearestAliasedRef()
341 NodeList Refs = I.Addr->members(DFG); in getNearestAliasedRef()
430 NodeList Phis; in computePhiInfo()
432 NodeList Blocks = FA.Addr->members(DFG); in computePhiInfo()
448 NodeList PhiRefs = PhiA.Addr->members(DFG); in computePhiInfo()
562 NodeList Ds = getAllReachingDefs(UR, PUA, true, false, NoRegs); in computePhiInfo()
[all …]
H A DRDFLiveness.h59 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
62 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) { in getAllReachingDefs()
67 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) { in getAllReachingDefs()
H A DRDFGraph.cpp210 const NodeList &List;
600 NodeList Ms = members_if(EqBB, G); in findBlock()
903 NodeList Blocks = Func.Addr->members(*this); in build()
946 NodeList Preds; in build()
1071 NodeList Rel = getRelatedRefs(IA, DA); in pushClobbers()
1117 NodeList Rel = getRelatedRefs(IA, DA); in pushDefs()
1151 NodeList Refs; in getRelatedRefs()
1488 NodeList Preds; in buildPhis()
1561 NodeList Refs = PA.Addr->members(*this); in removeUnusedPhis()
1792 auto getAllNodes = [this] (NodeId N) -> NodeList { in unlinkDefDF()
[all …]
H A DRDFGraph.h513 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>; variable
606 NodeList members(const DataFlowGraph &G) const;
608 NodeList members_if(Predicate P, const DataFlowGraph &G) const;
766 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
914 NodeList CodeNode::members_if(Predicate P, const DataFlowGraph &G) const { in members_if()
915 NodeList MM; in members_if()
H A DHexagonRDFOpt.cpp200 NodeList Refs = IA.Addr->members(DFG); in removeOperand()
256 NodeList Defs; in rewrite()
H A DRDFDeadCode.cpp186 NodeList DRNs, DINs; in erase()
/freebsd-12.1/contrib/llvm/lib/Demangle/
H A DMicrosoftDemangle.cpp38 struct NodeList { struct
40 NodeList *Next = nullptr; argument
1452 NodeList *Head = Arena.alloc<NodeList>(); in demangleNameScopeChain()
1459 NodeList *NewHead = Arena.alloc<NodeList>(); in demangleNameScopeChain()
1935 NodeList *Head = Arena.alloc<NodeList>(); in demangleArrayType()
1936 NodeList *Tail = Head; in demangleArrayType()
1973 NodeList *Head = Arena.alloc<NodeList>(); in demangleFunctionParameterList()
1974 NodeList **Current = &Head; in demangleFunctionParameterList()
2036 NodeList *Head; in demangleTemplateParameterList()
2037 NodeList **Current = &Head; in demangleTemplateParameterList()
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp684 LoopData::NodeList &Headers, LoopData::NodeList &Others) { in findIrreducibleHeaders()
756 LoopData::NodeList Headers; in createIrreducibleLoop()
757 LoopData::NodeList Others; in createIrreducibleLoop()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h221 using NodeList = SmallVector<BlockNode, 4>;
228 NodeList Nodes; ///< Header and the members of the loop.
263 NodeList::const_iterator members_begin() const {
267 NodeList::const_iterator members_end() const { return Nodes.end(); }
268 iterator_range<NodeList::const_iterator> members() const {
/freebsd-12.1/contrib/llvm/include/llvm/Object/
H A DMachO.h112 using NodeList = SmallVector<NodeState, 16>; variable
113 using node_iterator = NodeList::const_iterator;
119 NodeList Stack;
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp2710 SmallVector<PHINode *, 32> NodeList; member in __anon6227213d0811::PhiNodeSet
2728 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
2729 NodeList.push_back(Ptr); in insert()
2751 NodeList.clear(); in clear()
2764 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); } in end()
2783 while (CurrentIndex < NodeList.size()) { in SkipRemovedElements()
2784 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
2798 assert(CurrentIndex < Set->NodeList.size() && in operator *()
2800 return Set->NodeList[CurrentIndex]; in operator *()
2804 assert(CurrentIndex < Set->NodeList.size() && in operator ++()