| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/ |
| prologue.c | 18 int leaf (void) function
31 leaf ();
32 return leaf () * val;
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/ |
| prologue.c | 18 int leaf (void) function
31 leaf ();
32 return leaf () * val;
|
| /src/external/mit/isl/dist/ |
| isl_schedule_private.h | 12 * "leaf" may be used to represent a leaf of the schedule.
14 * but an isl_schedule_node may have "leaf" as its tree if it refers to
15 * a leaf of this schedule tree.
22 struct isl_schedule_tree *leaf; member in struct:isl_schedule
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| rtree_tsd.h | 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
8 * the boundary between two leaf nodes. Furthermore, an arena may use a
37 rtree_leaf_elm_t *leaf; member in struct:rtree_ctx_cache_elm_s
|
| rtree.h | 33 /* Use compact leaf representation if virtual address encoding allows. */
43 atomic_p_t child; /* (rtree_{node,leaf}_elm_t *) */
49 * Single pointer-width field containing all three leaf element fields.
93 * number of levels, place one remainder bit per level starting at the leaf
338 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; local
339 assert(leaf != NULL);
341 return &leaf[subkey];
349 rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf; \
[all...] |
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| rtree_tsd.h | 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
8 * the boundary between two leaf nodes. Furthermore, an arena may use a
37 rtree_leaf_elm_t *leaf; member in struct:rtree_ctx_cache_elm_s
|
| rtree.h | 33 /* Use compact leaf representation if virtual address encoding allows. */
43 atomic_p_t child; /* (rtree_{node,leaf}_elm_t *) */
49 * Single pointer-width field containing all three leaf element fields.
93 * number of levels, place one remainder bit per level starting at the leaf
338 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf; local
339 assert(leaf != NULL);
341 return &leaf[subkey];
349 rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf; \
[all...] |
| /src/external/bsd/jemalloc/dist/src/ |
| rtree.c | 76 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); local
77 if (leaf == NULL) {
78 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) <<
80 if (leaf == NULL) {
88 atomic_store_p(elmp, leaf, ATOMIC_RELEASE);
92 return leaf;
101 rtree_leaf_valid(rtree_leaf_elm_t *leaf) {
102 return ((uintptr_t)leaf != (uintptr_t)0);
136 rtree_leaf_elm_t *leaf; local
139 leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child
153 rtree_leaf_elm_t *leaf; local
167 rtree_leaf_elm_t *leaf; local
[all...] |
| /src/external/bsd/libc++/dist/libcxxrt/src/ |
| dynamic_cast.cc | 37 /** Offset of the leaf object. */
208 void *leaf = ADD_TO_PTR(const_cast<void *>(sub), header->leaf_offset); local
209 return header->type->cast_to(leaf, dst);
|
| /src/include/ |
| search.h | 42 leaf enumerator in enum:__anon164
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| rtree_tsd.h | 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
8 * the boundary between two leaf nodes. Furthermore, an arena may use a
49 rtree_leaf_elm_t *leaf; member in struct:rtree_ctx_cache_elm_s
|
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| rtree_tsd.h | 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
8 * the boundary between two leaf nodes. Furthermore, an arena may use a
49 rtree_leaf_elm_t *leaf; member in struct:rtree_ctx_cache_elm_s
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 78 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef in struct:__gnu_pbds::detail::trie_traits
81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator;
82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator;
84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
88 typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_const_iterator;
90 typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iterator;
125 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef in struct:__gnu_pbds::detail::trie_traits
128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
130 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 78 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef in struct:__gnu_pbds::detail::trie_traits
81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator;
82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator;
84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
88 typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_const_iterator;
90 typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iterator;
125 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef in struct:__gnu_pbds::detail::trie_traits
128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
130 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator
[all...] |
| /src/sys/arch/hpcmips/stand/pbsdboot/ |
| vmem.c | 90 for (i = 0; p = map->leaf[i / map->leafsize][i % map->leafsize]; i++) {
93 i, map->leaf[i / map->leafsize][i % map->leafsize]);
96 i, map->leaf[i / map->leafsize][i % map->leafsize]);
99 map->leaf[i / map->leafsize][i % map->leafsize] = p;
103 if ((p = vtophysaddr((void *)map->leaf[i])) == NULL) {
104 debug_printf(TEXT("vtophysaddr() failed, leaf %d (addr=0x%x) \n"),
105 i, map->leaf[i / map->leafsize][i % map->leafsize]);
107 TEXT("vtophysaddr() failed, leaf %d (addr=0x%x) \n"),
108 i, map->leaf[i / map->leafsize][i % map->leafsize]);
111 map->leaf[i] = (void **)p
357 void **leaf = map->leaf[i \/ map->leafsize]; local
[all...] |
| pbsdboot.h | 72 void **leaf[32]; member in struct:map_s
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/ |
| tsan_mutex.cc | 26 // The leaf mutexes can be locked under any other mutexes.
58 bool leaf[N] = {}; local
65 CHECK(!leaf[i]);
66 leaf[i] = true;
75 CHECK(!leaf[i] || cnt[i] == 0);
77 // Add leaf mutexes.
79 if (!leaf[i])
82 if (i == j || leaf[j] || j == MutexTypeInvalid)
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| i915_syncmap.c | 151 static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno)
153 if (leaf->height) {
154 pr_err("%s: not a leaf, height is %d\n",
155 __func__, leaf->height);
159 if (__sync_seqno(leaf)[idx] != seqno) {
161 __func__, idx, __sync_seqno(leaf)[idx], seqno);
177 pr_err("Inserting first context=%llx did not return leaf (height=%d, prefix=%llx\n",
216 * Check that inserting a new id, creates a leaf and only that leaf.
252 pr_err("Inserting context=%llx did not return leaf (height=%d, prefix=%llx\n"
513 struct i915_syncmap *leaf = __sync_child(sync)[idx]; local
[all...] |
| /src/external/bsd/jemalloc.old/dist/src/ |
| rtree.c | 53 rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) {
78 rtree_leaf_elm_t *leaf = local
81 if (leaf != NULL) {
82 rtree_leaf_dalloc(tsdn, rtree, leaf);
135 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); local
136 if (leaf == NULL) {
137 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) <<
139 if (leaf == NULL) {
147 atomic_store_p(elmp, leaf, ATOMIC_RELEASE);
151 return leaf;
195 rtree_leaf_elm_t *leaf; local
212 rtree_leaf_elm_t *leaf; local
226 rtree_leaf_elm_t *leaf; local
[all...] |
| /src/external/bsd/jemalloc.old/dist/test/unit/ |
| rtree.c | 42 rtree_leaf_elm_t *leaf; local
49 leaf = (rtree_leaf_elm_t *)calloc(nelms, sizeof(rtree_leaf_elm_t));
50 assert_ptr_not_null(leaf, "Unexpected calloc() failure");
53 return leaf;
58 rtree_leaf_elm_t *leaf) {
60 rtree_leaf_dalloc_orig(tsdn, rtree, leaf);
64 free(leaf);
150 "Only leftmost rtree leaf should be set; i=%u", i);
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_mutex.cpp | 74 bool leaf[kMutexTypeMax]; local
75 internal_memset(&leaf, 0, sizeof(leaf));
88 CHECK(!leaf[t]);
89 leaf[t] = true;
104 // Add leaf mutexes.
106 if (!leaf[t])
110 if (z == MutexInvalid || t == z || leaf[z])
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_mutex.cpp | 74 bool leaf[kMutexTypeMax]; local
75 internal_memset(&leaf, 0, sizeof(leaf));
88 CHECK(!leaf[t]);
89 leaf[t] = true;
104 // Add leaf mutexes.
106 if (!leaf[t])
110 if (z == MutexInvalid || t == z || leaf[z])
|
| /src/common/lib/libc/gen/ |
| ptree.c | 74 * to another branching node or a leaf node. The root pointer would also
75 * point to either the first branching node or a leaf node. Leaf nodes
81 * each node has two identities: its leaf identity and its branch identity.
83 * it points to a leaf or a branch. This is not an attribute of the object
85 * the tag to determine whether it points to a leaf or branch identity, with
89 * root to the node's leaf identity, one of the branches traversed will be via
101 * that mask node is converted from being a leaf node to being a one-way
249 * identity. We know that between root and the leaf identity,
284 * change mask from a leaf to a branch
363 pt_node_t * const leaf = PT_NODE(leaf_node); local
[all...] |
| /src/sys/external/bsd/libfdt/dist/ |
| fdt_ro.c | 303 * give only the leaf name (after all /). The actual tree
306 const char *leaf; local
307 leaf = strrchr(nameptr, '/');
308 if (leaf == NULL) {
312 nameptr = leaf+1;
|
| /src/external/bsd/atf/dist/atf-c/detail/ |
| fs_test.c | 295 const char *leaf; member in struct:test
311 printf("Expected output: %s\n", t->leaf);
316 ATF_REQUIRE(atf_equal_dynstr_cstring(&ln, t->leaf));
|
