Home
last modified time | relevance | path

Searched refs:subtree (Results 1 – 25 of 128) sorted by relevance

123456

/external/ltp/testcases/kernel/fs/fs_bind/rbind/
D00_Descriptions.txt42 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.
47 test22 - shared subtree with private child to slave subtree.
48 test23 - shared subtree with private child to private subtree.
49 test24 - shared subtree with unclonable child to private subtree.
50 test25 - shared subtree with slave child to shared subtree.
51 test26 - shared subtree with slave child to private subtree.
[all …]
/external/ltp/testcases/kernel/fs/fs_bind/move/
D00_Descriptions.txt26 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/
D00_Descriptions.txt42 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.
144 shared subtree with shared child to private subtree.
149 shared subtree with shared child to slave subtree.
154 shared subtree with shared child to uncloneable subtree.
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DIntervalMap.cpp21 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); in replaceRoot()
39 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
43 NR = NR.subtree(NR.size() - 1); in getLeftSibling()
64 NodeRef NR = subtree(l); in moveLeft()
69 NR = NR.subtree(NR.size() - 1); in moveLeft()
89 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
93 NR = NR.subtree(0); in getRightSibling()
109 NodeRef NR = subtree(l); in moveRight()
113 NR = NR.subtree(0); in moveRight()
/external/llvm-project/llvm/lib/Support/
DIntervalMap.cpp22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); in replaceRoot()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
44 NR = NR.subtree(NR.size() - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
70 NR = NR.subtree(NR.size() - 1); in moveLeft()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
94 NR = NR.subtree(0); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
114 NR = NR.subtree(0); in moveRight()
/external/llvm/lib/Support/
DIntervalMap.cpp22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); in replaceRoot()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
44 NR = NR.subtree(NR.size() - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
70 NR = NR.subtree(NR.size() - 1); in moveLeft()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
94 NR = NR.subtree(0); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
114 NR = NR.subtree(0); in moveRight()
/external/tensorflow/tensorflow/compiler/xla/python/
Dtypes.cc220 TF_ASSIGN_OR_RETURN(PythonBufferTree subtree, in GetPythonBufferTree()
222 tree.leaves.reserve(tree.leaves.size() + subtree.leaves.size()); in GetPythonBufferTree()
223 std::move(subtree.leaves.begin(), subtree.leaves.end(), in GetPythonBufferTree()
225 tree.arrays.reserve(tree.arrays.size() + subtree.arrays.size()); in GetPythonBufferTree()
226 std::move(subtree.arrays.begin(), subtree.arrays.end(), in GetPythonBufferTree()
228 host_shapes[i] = std::move(subtree.shape); in GetPythonBufferTree()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
DPKIXNameConstraintValidator.java142 GeneralSubtree subtree = permitted[i]; in intersectPermittedSubtree() local
143 Integer tagNo = Integers.valueOf(subtree.getBase().getTagNo()); in intersectPermittedSubtree()
148 ((Set)subtreesMap.get(tagNo)).add(subtree); in intersectPermittedSubtree()
221 public void addExcludedSubtree(GeneralSubtree subtree) in addExcludedSubtree() argument
223 GeneralName base = subtree.getBase(); in addExcludedSubtree()
307 ASN1Sequence subtree) in withinDNSubtree() argument
309 if (subtree.size() < 1) in withinDNSubtree()
314 if (subtree.size() > dns.size()) in withinDNSubtree()
320 RDN subtreeRdnStart = RDN.getInstance(subtree.getObjectAt(0)); in withinDNSubtree()
331 if (subtree.size() > dns.size() - start) in withinDNSubtree()
[all …]
DNameConstraints.java71 private GeneralSubtree[] createArray(ASN1Sequence subtree) in createArray() argument
73 GeneralSubtree[] ar = new GeneralSubtree[subtree.size()]; in createArray()
77 ar[i] = GeneralSubtree.getInstance(subtree.getObjectAt(i)); in createArray()
/external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/asn1/x509/
DPKIXNameConstraintValidator.java146 GeneralSubtree subtree = permitted[i]; in intersectPermittedSubtree() local
147 Integer tagNo = Integers.valueOf(subtree.getBase().getTagNo()); in intersectPermittedSubtree()
152 ((Set)subtreesMap.get(tagNo)).add(subtree); in intersectPermittedSubtree()
225 public void addExcludedSubtree(GeneralSubtree subtree) in addExcludedSubtree() argument
227 GeneralName base = subtree.getBase(); in addExcludedSubtree()
311 ASN1Sequence subtree) in withinDNSubtree() argument
313 if (subtree.size() < 1) in withinDNSubtree()
318 if (subtree.size() > dns.size()) in withinDNSubtree()
324 RDN subtreeRdnStart = RDN.getInstance(subtree.getObjectAt(0)); in withinDNSubtree()
335 if (subtree.size() > dns.size() - start) in withinDNSubtree()
[all …]
DNameConstraints.java75 private GeneralSubtree[] createArray(ASN1Sequence subtree) in createArray() argument
77 GeneralSubtree[] ar = new GeneralSubtree[subtree.size()]; in createArray()
81 ar[i] = GeneralSubtree.getInstance(subtree.getObjectAt(i)); in createArray()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/asn1/x509/
DPKIXNameConstraintValidator.java146 GeneralSubtree subtree = permitted[i]; in intersectPermittedSubtree() local
147 Integer tagNo = Integers.valueOf(subtree.getBase().getTagNo()); in intersectPermittedSubtree()
152 ((Set)subtreesMap.get(tagNo)).add(subtree); in intersectPermittedSubtree()
225 public void addExcludedSubtree(GeneralSubtree subtree) in addExcludedSubtree() argument
227 GeneralName base = subtree.getBase(); in addExcludedSubtree()
311 ASN1Sequence subtree) in withinDNSubtree() argument
313 if (subtree.size() < 1) in withinDNSubtree()
318 if (subtree.size() > dns.size()) in withinDNSubtree()
324 RDN subtreeRdnStart = RDN.getInstance(subtree.getObjectAt(0)); in withinDNSubtree()
335 if (subtree.size() > dns.size() - start) in withinDNSubtree()
[all …]
DNameConstraints.java75 private GeneralSubtree[] createArray(ASN1Sequence subtree) in createArray() argument
77 GeneralSubtree[] ar = new GeneralSubtree[subtree.size()]; in createArray()
81 ar[i] = GeneralSubtree.getInstance(subtree.getObjectAt(i)); in createArray()
/external/fonttools/Lib/fontTools/colorLib/
Dbuilder.py619 subtree = leaves[i : i + full_step]
620 if len(subtree) < full_step:
621 unassigned = subtree
623 while len(subtree) > n:
624 subtree = [subtree[k : k + n] for k in range(0, len(subtree), n)]
625 root.append(subtree)
629 subtree = _build_n_ary_tree(unassigned, n)
630 if len(subtree) <= n - len(root):
632 root.extend(subtree)
634 root.append(subtree)
/external/jemalloc_new/src/
Drtree.c63 rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *subtree, in rtree_delete_subtree() argument
69 (rtree_node_elm_t *)atomic_load_p(&subtree[i].child, in rtree_delete_subtree()
79 (rtree_leaf_elm_t *)atomic_load_p(&subtree[i].child, in rtree_delete_subtree()
87 if (subtree != rtree->root) { in rtree_delete_subtree()
88 rtree_node_dalloc(tsdn, rtree, subtree); in rtree_delete_subtree()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
DPKIXNameConstraintValidator.java126 public void addExcludedSubtree(GeneralSubtree subtree) in addExcludedSubtree() argument
128 validator.addExcludedSubtree(subtree); in addExcludedSubtree()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jce/provider/
DPKIXNameConstraintValidator.java130 public void addExcludedSubtree(GeneralSubtree subtree) in addExcludedSubtree() argument
132 validator.addExcludedSubtree(subtree); in addExcludedSubtree()
/external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/jce/provider/
DPKIXNameConstraintValidator.java130 public void addExcludedSubtree(GeneralSubtree subtree) in addExcludedSubtree() argument
132 validator.addExcludedSubtree(subtree); in addExcludedSubtree()
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DTreePatternParser.cs76 object subtree = ParseTree(); in ParseTree()
77 adaptor.AddChild(root, subtree); in ParseTree()
/external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DTreePatternParser.cs88 object subtree = ParseTree(); in ParseTree()
89 adaptor.AddChild( root, subtree ); in ParseTree()
/external/llvm-project/llvm/include/llvm/ADT/
DIntervalMap.h520 NodeRef &subtree(unsigned i) const { in subtree() function
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree() function
706 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree() function
741 return subtree(safeFind(0, x)); in safeLookup()
753 subtree(i) = Node; in insert()
782 : node(&Node.subtree(0)), size(Node.size()), offset(Offset) {} in Entry()
784 NodeRef &subtree(unsigned i) const { in subtree() function
821 NodeRef &subtree(unsigned Level) const { in subtree() function
822 return path[Level].subtree(path[Level].offset); in subtree()
828 path[Level] = Entry(subtree(Level - 1), offset(Level)); in reset()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DIntervalMap.h520 NodeRef &subtree(unsigned i) const { in subtree() function
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree() function
706 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree() function
741 return subtree(safeFind(0, x)); in safeLookup()
753 subtree(i) = Node; in insert()
782 : node(&Node.subtree(0)), size(Node.size()), offset(Offset) {} in Entry()
784 NodeRef &subtree(unsigned i) const { in subtree() function
821 NodeRef &subtree(unsigned Level) const { in subtree() function
822 return path[Level].subtree(path[Level].offset); in subtree()
828 path[Level] = Entry(subtree(Level - 1), offset(Level)); in reset()
[all …]
/external/llvm/include/llvm/ADT/
DIntervalMap.h517 NodeRef &subtree(unsigned i) const { in subtree() function
701 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree() function
704 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree() function
739 return subtree(safeFind(0, x)); in safeLookup()
751 subtree(i) = Node; in insert()
780 : node(&Node.subtree(0)), size(Node.size()), offset(Offset) {} in Entry()
782 NodeRef &subtree(unsigned i) const { in subtree() function
819 NodeRef &subtree(unsigned Level) const { in subtree() function
820 return path[Level].subtree(path[Level].offset); in subtree()
826 path[Level] = Entry(subtree(Level - 1), offset(Level)); in reset()
[all …]
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
DTreePatternParser.java75 Object subtree = parseTree(); in parseTree() local
76 adaptor.addChild(root, subtree); in parseTree()
/external/seccomp-tests/
DREADME.md40 3. Filter the branch to just the subtree containing the Seccomp test suite:
63 git subtree merge -P linux/ upstream-master
78 branch into the seccomp-tests repository and subtree merge it (as FETCH\_HEAD). This will avoid

123456