/external/ltp/testcases/kernel/fs/fs_bind/rbind/ |
00_Descriptions.txt | 42 test17 - shared subtree with shared child to shared subtree. 43 test18 - shared subtree with shared child to private subtree. 44 test19 - shared subtree with shared child to slave subtree. 45 test20 - shared subtree with shared child to uncloneable subtree. 46 test21 - shared subtree with private child to shared subtree [all...] |
/external/ltp/testcases/kernel/fs/fs_bind/move/ |
00_Descriptions.txt | 26 test02 - shared subtree to private parent. 27 test03 - shared subtree to slave parent. 28 test04 - shared subtree to uncloneable parent. 29 test05 - private subtree to shared parent. 30 test06 - private subtree to private parent. 31 test07 - private subtree to slave parent. 32 test08 - private subtree to uncloneable parent. 33 test09 - slave subtree to shared parent. 34 test10 - slave subtree to private parent. 35 test11 - slave subtree to slave parent [all...] |
/external/ltp/testcases/kernel/fs/fs_bind/bind/ |
00_Descriptions.txt | 42 test17 - shared subtree with shared child to shared subtree. 43 test18 - shared subtree with shared child to private subtree. 44 test19 - shared subtree with shared child to slave subtree. 45 test20 - shared subtree with shared child to uncloneable subtree. 139 shared subtree with shared child to shared subtree [all...] |
/libcore/ojluni/src/main/java/sun/security/x509/ |
RFC822Name.java | 232 * Return subtree depth of this name for purposes of determining 239 String subtree=name; local 243 int atNdx = subtree.lastIndexOf('@'); 246 subtree=subtree.substring(atNdx+1); 250 for (; subtree.lastIndexOf('.') >= 0; i++) { 251 subtree=subtree.substring(0,subtree.lastIndexOf('.'));
|
NameConstraintsExtension.java | 94 GeneralSubtree subtree = excluded.get(i); local 95 if (subtree.getMinimum() != 0) 97 if (subtree.getMaximum() != -1) 104 GeneralSubtree subtree = permitted.get(i); local 105 if (subtree.getMinimum() != 0) 107 if (subtree.getMaximum() != -1) 509 // if name matches or narrows any excluded subtree, 540 // and Name does not match or narrow some permitted subtree,
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
NameConstraintValidator.java | 17 void addExcludedSubtree(GeneralSubtree subtree);
|
NameConstraints.java | 71 private GeneralSubtree[] createArray(ASN1Sequence subtree) 73 GeneralSubtree[] ar = new GeneralSubtree[subtree.size()]; 77 ar[i] = GeneralSubtree.getInstance(subtree.getObjectAt(i));
|
PKIXNameConstraintValidator.java | 119 * with the given subtree. 130 GeneralSubtree subtree = permitted[i]; local 131 Integer tagNo = Integers.valueOf(subtree.getBase().getTagNo()); 136 ((Set)subtreesMap.get(tagNo)).add(subtree); 143 // go through all subtree groups 191 * Adds a subtree to the excluded set of these name constraints. 193 * @param subtree A subtree with an excluded GeneralName. 195 public void addExcludedSubtree(GeneralSubtree subtree) 197 GeneralName base = subtree.getBase() 368 ASN1Sequence subtree = (ASN1Sequence)it.next(); local 392 ASN1Sequence subtree = (ASN1Sequence)it.next(); local 421 ASN1Sequence subtree = (ASN1Sequence)_iter.next(); local 456 ASN1Sequence subtree = (ASN1Sequence)it.next(); local [all...] |
/external/llvm/lib/Support/ |
IntervalMap.cpp | 22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); 39 // NR is the subtree containing our left sibling. 40 NodeRef NR = path[l].subtree(path[l].offset - 1); 44 NR = NR.subtree(NR.size() - 1); 63 // NR is the subtree containing our left sibling. 65 NodeRef NR = subtree(l); 67 // Get the rightmost node in the subtree. 70 NR = NR.subtree(NR.size() - 1); 89 // NR is the subtree containing our right sibling. 90 NodeRef NR = path[l].subtree(path[l].offset + 1) [all...] |
/external/swiftshader/third_party/LLVM/lib/Support/ |
IntervalMap.cpp | 22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); 39 // NR is the subtree containing our left sibling. 40 NodeRef NR = path[l].subtree(path[l].offset - 1); 44 NR = NR.subtree(NR.size() - 1); 63 // NR is the subtree containing our left sibling. 65 NodeRef NR = subtree(l); 67 // Get the rightmost node in the subtree. 70 NR = NR.subtree(NR.size() - 1); 89 // NR is the subtree containing our right sibling. 90 NodeRef NR = path[l].subtree(path[l].offset + 1) [all...] |
/external/jemalloc/include/jemalloc/internal/ |
rtree.h | 48 * A non-NULL subtree points to a subtree rooted along the hypothetical 51 * subtree pointers may remain NULL. 55 * accessed via subtrees[2], the subtree prefixed by 0x0000 (excluding 71 rtree_node_elm_t *subtree; member in union:rtree_level_s::__anon21095 88 * bits to which subtree level to start at. 221 rtree_node_elm_t *subtree; local 224 subtree = rtree->levels[level].subtree; 225 if (!dependent && unlikely(!rtree_node_valid(subtree))) 234 rtree_node_elm_t *subtree; local [all...] |
/external/jemalloc/src/ |
rtree.c | 37 rtree->levels[0].subtree = NULL; 43 rtree->levels[i].subtree = NULL; 50 rtree->levels[height-1].subtree = NULL; 87 rtree_node_elm_t *subtree = rtree->levels[i].subtree; local 88 if (subtree != NULL) 89 rtree_delete_subtree(rtree, subtree, i); 124 return (rtree_node_init(rtree, level, &rtree->levels[level].subtree));
|
/libcore/luni/src/test/java/libcore/xml/ |
NodeTest.java | 75 private List<Node> flattenSubtree(Node subtree) { 77 traverse(subtree, result);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
PKIXNameConstraintValidator.java | 48 ASN1Sequence subtree) 50 if (subtree.size() < 1) 55 if (subtree.size() > dns.size()) 60 for (int j = subtree.size() - 1; j >= 0; j--) 62 if (!subtree.getObjectAt(j).equals(dns.getObjectAt(j))) 99 ASN1Sequence subtree = (ASN1Sequence)it.next(); local 101 if (withinDNSubtree(dns, subtree)) 108 "Subject distinguished name is not from a permitted subtree"); 123 ASN1Sequence subtree = (ASN1Sequence)it.next(); local 125 if (withinDNSubtree(dns, subtree)) 152 ASN1Sequence subtree = (ASN1Sequence)_iter.next(); local 187 ASN1Sequence subtree = (ASN1Sequence)it.next(); local 1544 GeneralSubtree subtree = permitted[i]; local [all...] |
/external/ipsec-tools/src/racoon/ |
isakmp_xauth.h | 138 int subtree; member in struct:xauth_ldap_config
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreePatternParser.cs | 76 object subtree = ParseTree(); 77 adaptor.AddChild(root, subtree);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
TreePatternParser.cs | 88 object subtree = ParseTree(); 89 adaptor.AddChild( root, subtree );
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
TreePatternParser.java | 75 Object subtree = parseTree(); local 76 adaptor.addChild(root, subtree);
|
/external/protobuf/java/core/src/test/java/com/google/protobuf/ |
TextFormatParseInfoTreeTest.java | 163 TextFormatParseInfoTree subtree = root.getNestedTrees(OPTIONAL_NESTED_MESSAGE).get(0); local 164 assertNotNull(subtree);
|
/external/llvm/include/llvm/ADT/ |
IntervalMap.h | 514 /// subtree - Access the i'th subtree reference in a branch node. 517 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 684 // The key array in a branch node holds the rightmost stop key of each subtree. 688 // It is unusual for a branch node to only have one subtree, but it can happen 701 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 704 NodeRef &subtree(unsigned i) { return this->first[i]; } 706 /// findFrom - Find the first subtree after i that may contain x. 711 /// This is the first subtree that can possibly contain x. 720 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
IntervalMap.h | 493 /// subtree - Access the i'th subtree reference in a branch node. 496 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 663 // The key array in a branch node holds the rightmost stop key of each subtree. 667 // It is unusual for a branch node to only have one subtree, but it can happen 680 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 683 NodeRef &subtree(unsigned i) { return this->first[i]; } 685 /// findFrom - Find the first subtree after i that may contain x. 690 /// This is the first subtree that can possibly contain x. 699 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
IntervalMap.h | 516 /// subtree - Access the i'th subtree reference in a branch node. 519 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 685 // The key array in a branch node holds the rightmost stop key of each subtree. 689 // It is unusual for a branch node to only have one subtree, but it can happen 702 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 705 NodeRef &subtree(unsigned i) { return this->first[i]; } 707 /// findFrom - Find the first subtree after i that may contain x. 712 /// This is the first subtree that can possibly contain x. 721 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
IntervalMap.h | 516 /// subtree - Access the i'th subtree reference in a branch node. 519 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 685 // The key array in a branch node holds the rightmost stop key of each subtree. 689 // It is unusual for a branch node to only have one subtree, but it can happen 702 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 705 NodeRef &subtree(unsigned i) { return this->first[i]; } 707 /// findFrom - Find the first subtree after i that may contain x. 712 /// This is the first subtree that can possibly contain x. 721 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
IntervalMap.h | 516 /// subtree - Access the i'th subtree reference in a branch node. 519 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 685 // The key array in a branch node holds the rightmost stop key of each subtree. 689 // It is unusual for a branch node to only have one subtree, but it can happen 702 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 705 NodeRef &subtree(unsigned i) { return this->first[i]; } 707 /// findFrom - Find the first subtree after i that may contain x. 712 /// This is the first subtree that can possibly contain x. 721 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
IntervalMap.h | 516 /// subtree - Access the i'th subtree reference in a branch node. 519 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef 685 // The key array in a branch node holds the rightmost stop key of each subtree. 689 // It is unusual for a branch node to only have one subtree, but it can happen 702 const NodeRef &subtree(unsigned i) const { return this->first[i]; } 705 NodeRef &subtree(unsigned i) { return this->first[i]; } 707 /// findFrom - Find the first subtree after i that may contain x. 712 /// This is the first subtree that can possibly contain x. 721 /// safeFind - Find a subtree that is known to exist. This is the same a [all...] |