HomeSort by: relevance | last modified time | path
    Searched refs:NodeList (Results 1 - 17 of 17) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
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(); }
BlockFrequencyInfoImpl.cpp 703 LoopData::NodeList &Headers, LoopData::NodeList &Others) {
775 LoopData::NodeList Headers;
776 LoopData::NodeList Others;
  /src/external/apache2/llvm/dist/clang/lib/AST/
ParentMapContext.cpp 54 matchParents(const DynTypedNodeList &NodeList,
280 match(const DynTypedNodeList &NodeList,
282 if (const auto *TypedNode = NodeList[0].get<T>()) {
295 return std::tuple_cat(std::make_tuple(false, NodeList),
302 match(const DynTypedNodeList &NodeList,
304 if (const auto *TypedNode = NodeList[0].get<T>()) {
308 return std::make_tuple(true, NodeList, TypedNode);
310 return std::make_tuple(false, NodeList, nullptr);
316 matchParents(const DynTypedNodeList &NodeList,
318 return MatchParents<T, U...>::match(NodeList, ParentMap)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
RDFLiveness.h 83 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
86 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) {
91 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) {
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;
761 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
909 NodeList CodeNode::members_if(Predicate P, const DataFlowGraph &G) const {
910 NodeList MM;
944 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeList> &P);
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUAnnotateKernelFeatures.cpp 39 SmallVector<CallGraphNode*, 8> NodeList;
214 for (auto *Node : reverse(NodeList)) {
399 NodeList.push_back(I);
402 NodeList.clear();
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
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 &UNodeList)
    [all...]
HexagonRDFOpt.cpp 200 NodeList Refs = IA.Addr->members(DFG);
256 NodeList Defs;
RDFDeadCode.cpp 186 NodeList DRNs, DINs;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RDFLiveness.cpp 109 NodeList Liveness::getAllReachingDefs(RegisterRef RefRR,
112 NodeList RDefs; // Return value.
275 NodeList Ds;
328 NodeList RDs = getAllReachingDefs(RefRR, RefA, false, true, DefRRs);
365 NodeList Ins = BA.Addr->members(DFG);
379 NodeList Refs = I.Addr->members(DFG);
468 NodeList Phis;
470 NodeList Blocks = FA.Addr->members(DFG);
486 NodeList PhiRefs = PhiA.Addr->members(DFG);
600 NodeList Ds = getAllReachingDefs(UR, PUA, true, false, NoRegs)
    [all...]
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;
1049 NodeList Rel = getRelatedRefs(IA, DA);
1095 NodeList Rel = getRelatedRefs(IA, DA);
1125 NodeList DataFlowGraph::getRelatedRefs(NodeAddr<InstrNode*> IA
    [all...]
CodeGenPrepare.cpp 3234 SmallVector<PHINode *, 32> NodeList;
3237 /// NodeList defined above) is the source of truth on whether an element
3252 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
3253 NodeList.push_back(Ptr);
3273 NodeList.clear();
3286 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); }
3301 /// If the element of NodeList at CurrentIndex is valid, it does not
3303 /// to point to the end of the NodeList.
3305 while (CurrentIndex < NodeList.size()) {
3306 auto it = NodeMap.find(NodeList[CurrentIndex])
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
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;
BlockFrequencyInfoImpl.h 219 using NodeList = SmallVector<BlockNode, 4>;
226 NodeList Nodes; ///< Header and the members of the loop.
261 NodeList::const_iterator members_begin() const {
265 NodeList::const_iterator members_end() const { return Nodes.end(); }
266 iterator_range<NodeList::const_iterator> members() const {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Object/
MachO.h 111 using NodeList = SmallVector<NodeState, 16>;
112 using node_iterator = NodeList::const_iterator;
118 NodeList Stack;
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
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);
  /src/external/apache2/llvm/dist/llvm/lib/Demangle/
MicrosoftDemangle.cpp 37 struct NodeList {
39 NodeList *Next = nullptr;
1557 static NodeArrayNode *nodeListToNodeArray(ArenaAllocator &Arena, NodeList *Head,
1572 NodeList *Head = Arena.alloc<NodeList>();
1579 NodeList *NewHead = Arena.alloc<NodeList>();
2085 NodeList *Head = Arena.alloc<NodeList>();
2086 NodeList *Tail = Head
    [all...]

Completed in 69 milliseconds