| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DDG.cpp | 135 : DDGNode(NodeKind::PiBlock), NodeList(List) {
136 assert(!NodeList.empty() && "pi-block node constructed with an empty list.");
140 : DDGNode(N), NodeList(N.NodeList) {
141 assert(getKind() == NodeKind::PiBlock && !NodeList.empty() &&
146 : DDGNode(std::move(N)), NodeList(std::move(N.NodeList)) {
147 assert(getKind() == NodeKind::PiBlock && !NodeList.empty() &&
151 PiBlockDDGNode::~PiBlockDDGNode() { NodeList.clear(); }
|
| H A D | BlockFrequencyInfoImpl.cpp | 701 LoopData::NodeList &Headers, LoopData::NodeList &Others) {
773 LoopData::NodeList Headers;
774 LoopData::NodeList Others;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFLiveness.h | 58 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
61 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) {
66 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) {
|
| H A D | RDFGraph.h | 512 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>;
605 NodeList members(const DataFlowGraph &G) const;
607 NodeList members_if(Predicate P, const DataFlowGraph &G) const;
765 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
913 NodeList CodeNode::members_if(Predicate P, const DataFlowGraph &G) const {
914 NodeList MM;
948 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeList> &P);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAnnotateKernelFeatures.cpp | 47 SmallVector<CallGraphNode*, 8> NodeList; member in class:__anon3903::AMDGPUAnnotateKernelFeatures
230 for (auto *Node : reverse(NodeList)) {
378 NodeList.push_back(I);
381 NodeList.clear();
|
| /freebsd-13-stable/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);
105 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
160 const NodeList &UNodeList) {
213 NodeList &UNodeList) {
245 NodeList &UNodeList) {
286 const NodeList
[all...] |
| H A D | HexagonRDFOpt.cpp | 200 NodeList Refs = IA.Addr->members(DFG);
256 NodeList Defs;
|
| H A D | RDFDeadCode.cpp | 186 NodeList DRNs, DINs;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 106 NodeList Liveness::getAllReachingDefs(RegisterRef RefRR,
109 NodeList RDefs; // Return value.
235 NodeList Ds;
288 NodeList RDs = getAllReachingDefs(RefRR, RefA, false, true, DefRRs);
325 NodeList Ins = BA.Addr->members(DFG);
339 NodeList Refs = I.Addr->members(DFG);
428 NodeList Phis;
430 NodeList Blocks = FA.Addr->members(DFG);
446 NodeList PhiRefs = PhiA.Addr->members(DFG);
560 NodeList D
[all...] |
| H A D | RDFGraph.cpp | 174 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeList> &P) {
198 PrintListV(const NodeList &L, const DataFlowGraph &G) : List(L), G(G) {}
201 const NodeList &List;
527 NodeList CodeNode::members(const DataFlowGraph &G) const {
581 NodeList Ms = members_if(EqBB, G);
886 NodeList Blocks = Func.Addr->members(*this);
929 NodeList Preds;
1054 NodeList Rel = getRelatedRefs(IA, DA);
1100 NodeList Rel = getRelatedRefs(IA, DA);
1130 NodeList DataFlowGrap
[all...] |
| H A D | CodeGenPrepare.cpp | 3083 SmallVector<PHINode *, 32> NodeList;
3086 /// NodeList defined above) is the source of truth on whether an element
3101 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
3102 NodeList.push_back(Ptr);
3124 NodeList.clear();
3137 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); }
3152 /// If the element of NodeList at CurrentIndex is valid, it does not
3154 /// to point to the end of the NodeList.
3156 while (CurrentIndex < NodeList.size()) {
3157 auto it = NodeMap.find(NodeList[CurrentInde
[all...] |
| /freebsd-13-stable/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.");
197 return NodeList;
211 PiNodeList NodeList; member in class:llvm::PiBlockDDGNode
|
| H A D | BlockFrequencyInfoImpl.h | 220 using NodeList = SmallVector<BlockNode, 4>;
227 NodeList Nodes; ///< Header and the members of the loop.
262 NodeList::const_iterator members_begin() const {
266 NodeList::const_iterator members_end() const { return Nodes.end(); }
267 iterator_range<NodeList::const_iterator> members() const {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Object/ |
| H A D | MachO.h | 111 using NodeList = SmallVector<NodeState, 16>;
112 using node_iterator = NodeList::const_iterator;
118 NodeList Stack;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 419 rdf::NodeList AnalyzedChildDefs;
474 NodeList Defs = ArgPhi.Addr->members_if(DataFlowGraph::IsDef, DFG);
486 NodeList Defs = SA.Addr->members_if(DataFlowGraph::IsDef, DFG);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Demangle/ |
| H A D | MicrosoftDemangle.cpp | 37 struct NodeList { struct
39 NodeList *Next = nullptr;
1557 static NodeArrayNode *nodeListToNodeArray(ArenaAllocator &Arena, NodeList *Head,
1572 NodeList *Head = Arena.alloc<NodeList>();
1579 NodeList *NewHead = Arena.alloc<NodeList>();
2083 NodeList *Head = Arena.alloc<NodeList>();
2084 NodeList *Tai
[all...] |