HomeSort by relevance Sort by last modified time
    Searched full:subtree (Results 1 - 25 of 757) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /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/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
NameConstraintValidator.java 17 void addExcludedSubtree(GeneralSubtree subtree);
  /external/valgrind/coregrind/m_demangle/
demangle.h 253 right (a component type with only one subtree puts it in the left
254 subtree). */
260 /* A qualified name. The left subtree is a class or namespace or
261 some such thing, and the right subtree is a name qualified by
264 /* A local name. The left subtree describes a function, and the
265 right subtree is a name which is local to that function. */
267 /* A typed name. The left subtree is a name, and the right subtree
270 /* A template. The left subtree is a template name, and the right
271 subtree is a template argument list. *
    [all...]
  /toolchain/binutils/binutils-2.27/include/
demangle.h 226 right (a component type with only one subtree puts it in the left
227 subtree). */
233 /* A qualified name. The left subtree is a class or namespace or
234 some such thing, and the right subtree is a name qualified by
237 /* A local name. The left subtree describes a function, and the
238 right subtree is a name which is local to that function. */
240 /* A typed name. The left subtree is a name, and the right subtree
243 /* A template. The left subtree is a template name, and the right
244 subtree is a template argument list. *
    [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...]
  /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::__anon22492
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/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/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));
  /device/google/cuttlefish/shared/sepolicy/
init.te 4 # Write to /configfs files. Needed only for /config/usb_gadget subtree.
  /external/llvm/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/
ScheduleDFS.h 30 /// ILPValues summarize the DAG subtree rooted at each node. ILPValues are
31 /// valid for all nodes regardless of their subtree membership.
74 /// is the root of a subtree. Later it is set to its parent to indicate an
75 /// interior node. Finally, it is set to a representative subtree ID during
84 /// \brief Per-Subtree data computed during DFS.
108 // For each subtree discovered during DFS, record its connections to other
112 /// Cache the current connection level of each subtree.
144 /// \brief Get the number of instructions in the given subtree and its
150 /// \brief Get the number of instructions in the given subtree not including
166 /// \brief Get the ID of the subtree the given DAG node belongs to
    [all...]

Completed in 2200 milliseconds

1 2 3 4 5 6 7 8 91011>>