OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Parents
(Results
1 - 5
of
5
) sorted by null
/external/clang/lib/StaticAnalyzer/Checkers/
TraversalChecker.cpp
41
const ParentMap &
Parents
= C.getLocationContext()->getParentMap();
42
Parent =
Parents
.getParent(Condition);
DeadStoresChecker.cpp
125
ParentMap&
Parents
;
135
BugReporter& br, AnalysisDeclContext* ac, ParentMap&
parents
,
137
: cfg(cfg), Ctx(ctx), BR(br), AC(ac),
Parents
(
parents
),
285
DeadStoreKind dsk =
Parents
.isConsumedExpr(B)
296
const Stmt *parent =
Parents
.getParentIgnoreParenCasts(U);
/external/clang/utils/TableGen/
ClangDiagnosticsEmitter.cpp
70
const std::vector<Record*> &
Parents
= DiagGroupParents.getParents(Group);
71
for (unsigned i = 0, e =
Parents
.size(); i != e; ++i) {
72
CatName = getCategoryFromDiagGroup(
Parents
[i], DiagGroupParents);
344
const std::vector<Record*> &
Parents
= DiagGroupParents.getParents(Group);
345
for (unsigned i = 0, e =
Parents
.size(); i != e; ++i)
346
if (isSubGroupOfGroup(
Parents
[i], GName))
386
const std::vector<Record*> &
Parents
= DiagGroupParents.getParents(Group);
387
for (unsigned i = 0, e =
Parents
.size(); i != e; ++i)
388
markGroup(
Parents
[i]);
445
const std::vector<Record*> &
Parents
= DiagGroupParents.getParents(Group)
[
all
...]
/external/clang/lib/ASTMatchers/
ASTMatchFinder.cpp
436
// Once there are multiple
parents
, the breadth first search order does not
448
ASTContext::ParentVector
Parents
= ActiveASTContext->getParents(Node);
449
if (
Parents
.empty()) {
458
if (
Parents
.size() == 1) {
460
const ast_type_traits::DynTypedNode Parent =
Parents
[0];
468
// Multiple
parents
- BFS over the rest of the nodes.
470
std::deque<ast_type_traits::DynTypedNode> Queue(
Parents
.begin(),
471
Parents
.end());
/external/clang/include/clang/AST/
ASTContext.h
387
/// \brief Contains
parents
of a node.
390
/// \brief Maps from a node to its
parents
.
393
/// \brief Returns the
parents
of the given node.
395
/// Note that this will lazily compute the
parents
of all nodes
408
/// more complex by statements in templates having multiple
parents
- those
412
/// where to search for the
parents
, for example when looking at a statement
[
all
...]
Completed in 215 milliseconds