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

  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Refactoring/
ASTSelection.h 101 ArrayRef<SelectedASTNode::ReferenceType> getParents() { return Parents; }
138 ArrayRef<SelectedASTNode::ReferenceType> Parents,
140 : SelectedNode(SelectedNode), Parents(Parents.begin(), Parents.end()),
147 llvm::SmallVector<SelectedASTNode::ReferenceType, 8> Parents;
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/
ASTSelection.cpp 252 llvm::SmallVector<SelectedASTNode::ReferenceType, 8> Parents;
292 const Stmt *Parent = Parents[Parents.size() - 1].get().Node.get<Stmt>();
296 // Look through the implicit casts in the parents.
298 for (; (ParentIndex + 1) <= Parents.size() && isa<ImplicitCastExpr>(Parent);
301 Parents[Parents.size() - ParentIndex - 1].get().Node.get<Stmt>();
309 Node = Parents[Parents.size() - ParentIndex];
311 Parents.pop_back()
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/Rename/
USRLocFinder.cpp 372 auto Parents = Context.getParents(Loc);
374 if (!Parents.empty()) {
379 if (const auto *NSL = Parents[0].get<NestedNameSpecifierLoc>()) {
384 if (const auto *TL = Parents[0].get<TypeLoc>())
483 auto Parents = Context.getParents(Node);
484 // FIXME: figure out how to handle it when there are multiple parents.
485 if (Parents.size() != 1)
487 if (ASTNodeKind::getFromNodeKind<Decl>().isBaseOf(Parents[0].getNodeKind()))
488 return Parents[0].template get<Decl>();
489 return getClosestAncestorDecl(Parents[0])
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/
ParentMapContext.cpp 1 //===- ParentMapContext.cpp - Map of parents using DynTypedNode -*- C++ -*-===//
10 // multiple parents.
26 void ParentMapContext::clear() { Parents.reset(); }
63 /// Contains parents of a node.
66 /// Maps from a node to its parents. This is used for nodes that have
336 /// parents as defined by the \c RecursiveASTVisitor.
357 /// Parents is the parent storage (either PointerParents or OtherParents).
359 void addParent(MapNodeTy MapNode, MapTy *Parents) {
373 auto &NodeOrVector = (*Parents)[MapNode];
405 MapTy *Parents) {
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
TraversalChecker.cpp 42 const ParentMap &Parents = C.getLocationContext()->getParentMap();
43 Parent = Parents.getParent(Condition);
DeadStoresChecker.cpp 139 ParentMap& Parents;
150 ParentMap &parents,
153 : cfg(cfg), Ctx(ctx), BR(br), Checker(checker), AC(ac), Parents(parents),
355 DeadStoreKind dsk = Parents.isConsumedExpr(B)
366 const Stmt *parent = Parents.getParentIgnoreParenCasts(U);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
DIEHash.cpp 85 SmallVector<const DIE *, 1> Parents;
88 Parents.push_back(Cur);
96 for (SmallVectorImpl<const DIE *>::reverse_iterator I = Parents.rbegin(),
97 E = Parents.rend();
DwarfUnit.cpp 661 SmallVector<const DIScope *, 1> Parents;
663 Parents.push_back(Context);
674 for (const DIScope *Ctx : make_range(Parents.rbegin(), Parents.rend())) {
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
ParentMapContext.h 1 //===- ParentMapContext.h - Map of parents using DynTypedNode -------*- C++ -*-===//
10 // multiple parents.
29 /// Returns the parents of the given node (within the traversal scope).
31 /// Note that this will lazily compute the parents of all nodes
44 /// more complex by statements in templates having multiple parents - those
48 /// where to search for the parents, for example when looking at a statement
72 std::unique_ptr<ParentMap> Parents;
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
ClangDiagnosticsEmitter.cpp 71 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group);
72 for (unsigned i = 0, e = Parents.size(); i != e; ++i) {
73 CatName = getCategoryFromDiagGroup(Parents[i], DiagGroupParents);
302 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group);
303 for (unsigned i = 0, e = Parents.size(); i != e; ++i)
304 if (isSubGroupOfGroup(Parents[i], GName))
347 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group);
348 for (unsigned i = 0, e = Parents.size(); i != e; ++i)
349 markGroup(Parents[i]);
406 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 924 // Once there are multiple parents, the breadth first search order does not
935 // These are the memoizable nodes in the chain of unique parents, which
936 // terminates when a node has multiple parents, or matches, or is the root.
949 DynTypedNodeList Parents{ArrayRef<DynTypedNode>()}; // after loop: size != 1
969 Parents = ActiveASTContext->getParents(Node);
970 // Either no parents or multiple parents: leave chain+memoize mode and
972 if (Parents.size() != 1)
976 Node = *Parents.begin();
985 if (Parents.empty())
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 86 // Returns true if the nodes' parents are matched.
387 const auto &Parents = AST.getParents(*S);
388 if (Parents.empty())
390 const auto &P = Parents[0];
  /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
ASTMatchers.h 7565 const auto &Parents = Finder->getASTContext().getParents(Node);
7567 llvm::SmallVector<DynTypedNode, 8> Stack(Parents.begin(), Parents.end());
7616 const auto &Parents = Finder->getASTContext().getParents(Node);
7618 llvm::SmallVector<DynTypedNode, 8> Stack(Parents.begin(), Parents.end());
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
traits.d 4535 template walkThru(Parents...)
4537 static if (Parents.length > 0)
4539 CollectOverloads!(Parents[0]),
4540 walkThru!(Parents[1 .. $])
4546 static if (is(Node Parents == super))
4547 alias CollectOverloads = AliasSeq!(inSight, walkThru!Parents);

Completed in 290 milliseconds