| /external/ltp/testcases/kernel/fs/fs_bind/move/ |
| test12 | 29 tst_resm TINFO "move: slave subtree to uncloneable parent."
92 tst_resm TFAIL "move/test12: FAILED: move: slave subtree to uncloneable parent."
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/options/ |
| IteratorOptions.java | 20 /** Just do the immediate children of the root, default is subtree. */
22 /** Just do the leaf nodes, default is all nodes in the subtree. */
|
| /libcore/ojluni/src/main/java/sun/security/x509/ |
| 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,
|
| OIDName.java | 139 * <li>NAME_NARROWS = 1: input name narrows name (is lower in the naming subtree)
140 * <li>NAME_WIDENS = 2: input name widens name (is higher in the naming subtree)
165 * Return subtree depth of this name for purposes of determining
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/ |
| ast.c | 146 void (*before)(AST *), /* apply this to root of subtree before preordering it */
147 void (*after)(AST *)) /* apply this to root of subtree after preordering it */
152 (*before)(), /* apply this to root of subtree before preordering it */
153 (*after)(); /* apply this to root of subtree after preordering it */
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/ |
| ast.c | 146 void (*before)(AST *), /* apply this to root of subtree before preordering it */
147 void (*after)(AST *)) /* apply this to root of subtree after preordering it */
152 (*before)(), /* apply this to root of subtree before preordering it */
153 (*after)(); /* apply this to root of subtree after preordering it */
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleSubtreeStream.js | 8 /** Treat next element as a single node even if it's a subtree.
|
| /external/clang/tools/clang-check/ |
| ClangCheck.cpp | 41 "\tFor example, to run clang-check on all files in a subtree of the\n"
44 "\t find path/in/subtree -name '*.cpp'|xargs clang-check\n"
48 "\t find path/in/subtree -name '*.cpp'|xargs clang-check -p build/path\n"
50 "\tNote, that path/in/subtree and current directory should follow the\n"
|
| /external/libxml2/include/libxml/ |
| xmlsave.h | 3 * Description: API to save document or subtree of document
|
| /external/skia/experimental/svg/model/ |
| SkSVGNode.h | 75 // the node/subtree rendering is disabled.
|
| /external/skqp/experimental/svg/model/ |
| SkSVGNode.h | 75 // the node/subtree rendering is disabled.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| ftw.h | 51 /* Valid only for FTW_D: Don't walk through the subtree. */
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/ |
| XMPIterator.java | 52 * they qualify, default is to visit the complete subtree.
71 * Skip the subtree below the current node when <code>next()</code> is
78 * Skip the subtree below and remaining siblings of the current node when
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeIterator.java | 20 * the set of nodes in a <code>NodeList</code>, the document subtree
25 * document-order traversal of a document subtree. Instances of these
61 * <code>NodeIterators</code> may reject a complete subtree rather than
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3rewritestreams.c | 370 // Subtree rewrite stream
386 // Install the subtree based overrides
408 // Install the subtree based overrides
431 // Install the subtree based overrides
564 /// Return a duplicate node/subtree if stream is out of elements and
619 /// a tree node or subtree. Deal with the optimization of single-
678 /// subtree. Dup'ing a token means just creating another AST node
692 /// subtree. Dup'ing a token means just creating another AST node
706 /// subtree. Dup'ing a token means just creating another AST node
778 /// Treat next element as a single node even if it's a subtree
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| move_to_front.h | 50 // size: size of the subtree of a node (including the node).
113 // The size of the node's subtree, including the node.
586 // Descend into the left subtree. The rank is still valid.
589 // Descend into the right subtree. We leave behind the left subtree and
648 // Added node to the right subtree.
659 // Added node to the left subtree.
731 // The height of the subtree was not changed.
735 // Removed node from the right subtree.
744 // Removed node from the left subtree
[all...] |
| /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-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...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
