| /prebuilts/go/darwin-x86/doc/progs/ |
| json4.go | 16 Parents []string
22 b := []byte(`{"Name":"Bob","Age":20,"Parents":["Morticia", "Gomez"]}`)
35 Parents: []string{"Morticia", "Gomez"},
|
| json3.go | 15 b := []byte(`{"Name":"Wednesday","Age":6,"Parents":["Gomez","Morticia"]}`)
29 "Parents": []interface{}{
42 "Parents": []interface{}{
|
| /prebuilts/go/linux-x86/doc/progs/ |
| json4.go | 16 Parents []string
22 b := []byte(`{"Name":"Bob","Age":20,"Parents":["Morticia", "Gomez"]}`)
35 Parents: []string{"Morticia", "Gomez"},
|
| json3.go | 15 b := []byte(`{"Name":"Wednesday","Age":6,"Parents":["Gomez","Morticia"]}`)
29 "Parents": []interface{}{
42 "Parents": []interface{}{
|
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDriver1CommandsLib/ |
| Devices.c | 30 @param[in, out] Parents On successful return this buffer will be
51 IN OUT UINTN *Parents,
66 || Parents == NULL
76 *Parents = 0;
87 Status = PARSE_HANDLE_DATABASE_PARENTS(TheHandle, Parents, NULL);
88 if (/*!EFI_ERROR(Status) && */Parents != NULL && Children != NULL) {
89 if (*Parents == 0) {
146 UINTN Parents;
233 Status = GetDeviceHandleInfo(*HandleListWalker, &Type, &Cfg, &Diag, &Parents, &Devices, &Children, &Name, Language);
234 if (Name != NULL && (Parents != 0 || Devices != 0 || Children != 0)) {
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| TraversalChecker.cpp | 43 const ParentMap &Parents = C.getLocationContext()->getParentMap();
44 Parent = Parents.getParent(Condition);
|
| DeadStoresChecker.cpp | 129 ParentMap& Parents;
140 ParentMap &parents,
142 : cfg(cfg), Ctx(ctx), BR(br), Checker(checker), AC(ac), Parents(parents),
295 DeadStoreKind dsk = Parents.isConsumedExpr(B)
306 const Stmt *parent = Parents.getParentIgnoreParenCasts(U);
|
| /external/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);
345 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group);
346 for (unsigned i = 0, e = Parents.size(); i != e; ++i)
347 if (isSubGroupOfGroup(Parents[i], GName))
388 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group);
389 for (unsigned i = 0, e = Parents.size(); i != e; ++i)
390 markGroup(Parents[i]);
447 const std::vector<Record*> &Parents = DiagGroupParents.getParents(Group)
[all...] |
| /external/llvm/lib/Analysis/ |
| LazyCallGraph.cpp | 242 assert(TargetSCC.getOuterRefSCC().Parents.count(this) &&
250 // Walk up the parents of this SCC and verify that we eventually find C.
257 for (const RefSCC *ParentC : AncestorC->Parents)
739 TargetC.Parents.insert(this);
781 // We build up a DFS stack of the parents chains.
818 // added to the connected set now that we've processed all of its parents.
826 // Otherwise remember that its parents don't ever connect.
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIEHash.cpp | 87 SmallVector<const DIE *, 1> Parents;
90 Parents.push_back(Cur);
98 for (SmallVectorImpl<const DIE *>::reverse_iterator I = Parents.rbegin(),
99 E = Parents.rend();
|
| DwarfUnit.cpp | 768 SmallVector<const DIScope *, 1> Parents;
770 Parents.push_back(Context);
781 for (const DIScope *Ctx : make_range(Parents.rbegin(), Parents.rend())) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 530 SmallPtrSet<RefSCC *, 1> Parents;
543 Parents.clear();
610 parent_iterator parent_begin() const { return Parents.begin(); }
611 parent_iterator parent_end() const { return Parents.end(); }
613 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
625 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 444 SmallPtrSet<RefSCC *, 1> Parents;
514 parent_iterator parent_begin() const { return Parents.begin(); }
515 parent_iterator parent_end() const { return Parents.end(); }
517 iterator_range<parent_iterator> parents() const { function in class:llvm::LazyCallGraph::Edge::RefSCC
529 return Parents.count(const_cast<RefSCC *>(&C));
[all...] |
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 609 // Once there are multiple parents, the breadth first search order does not
652 const auto &Parents = ActiveASTContext->getParents(Node);
653 assert(!Parents.empty() && "Found node that is not in the parent map.");
654 if (Parents.size() == 1) {
656 const ast_type_traits::DynTypedNode Parent = Parents[0];
669 // Multiple parents - BFS over the rest of the nodes.
671 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(),
672 Parents.end());
[all...] |
| /build/kati/ |
| dep.go | 32 Parents []*DepNode
352 ni.Parents = append(ni.Parents, n)
365 ni.Parents = append(ni.Parents, n)
|
| serialize.go | 120 Parents []int
208 var parents []int
209 for _, d := range n.Parents {
210 parents = append(parents, ns.serializeTarget(d.Output))
248 Parents: parents,
572 for _, o := range n.Parents {
577 d.Parents = append(d.Parents, c
[all...] |
| depgraph.go | 61 for _, d := range n.Parents {
|
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | [all...] |
