HomeSort by: relevance | last modified time | path
    Searched defs:rtree (Results 1 - 7 of 7) sorted by relevancy

  /src/external/bsd/jemalloc.old/dist/test/unit/
rtree.c 3 #include "jemalloc/internal/rtree.h"
19 rtree_t *rtree = &test_rtree; local
22 expect_false(rtree_new(rtree, base, false),
25 expect_true(rtree_read_independent(tsdn, rtree, &rtree_ctx, PAGE,
26 &contents), "rtree_read_independent() should fail on empty rtree.");
60 rtree_t *rtree = &test_rtree; local
63 expect_false(rtree_new(rtree, base, false),
72 expect_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, contents_a),
74 expect_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, contents_a),
76 rtree_contents_t read_contents_a = rtree_read(tsdn, rtree, &rtree_ctx
118 rtree_t *rtree = &test_rtree; local
163 rtree_t *rtree = &test_rtree; local
261 rtree_t *rtree = &test_rtree; local
    [all...]
  /src/external/bsd/jemalloc/dist/test/unit/
rtree.c 3 #include "jemalloc/internal/rtree.h"
19 rtree_t *rtree = &test_rtree; local
23 rtree_new(rtree, base, false), "Unexpected rtree_new() failure");
26 rtree_read_independent(tsdn, rtree, &rtree_ctx, PAGE, &contents),
27 "rtree_read_independent() should fail on empty rtree.");
61 rtree_t *rtree = &test_rtree; local
65 rtree_new(rtree, base, false), "Unexpected rtree_new() failure");
73 expect_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, contents_a),
75 expect_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, contents_a),
78 tsdn, rtree, &rtree_ctx, PAGE)
122 rtree_t *rtree = &test_rtree; local
171 rtree_t *rtree = &test_rtree; local
273 rtree_t *rtree = &test_rtree; local
    [all...]
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
emap.h 5 #include "jemalloc/internal/rtree.h"
18 rtree_t rtree; member in struct:emap_s
21 /* Used to pass rtree lookup context down the path. */
50 * it, even if technically the edata can still be discovered from the rtree.
162 rtree_contents_t contents = rtree_read(tsdn, &emap->rtree, rtree_ctx,
183 * be discovered from the emap, however the state tracked in the rtree
187 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
193 rtree_contents_t contents = rtree_leaf_elm_read(tsdn, &emap->rtree, elm,
229 return rtree_read(tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr).edata;
238 rtree_metadata_t metadata = rtree_metadata_read(tsdn, &emap->rtree,
    [all...]
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
emap.h 5 #include "jemalloc/internal/rtree.h"
18 rtree_t rtree; member in struct:emap_s
21 /* Used to pass rtree lookup context down the path. */
50 * it, even if technically the edata can still be discovered from the rtree.
162 rtree_contents_t contents = rtree_read(tsdn, &emap->rtree, rtree_ctx,
183 * be discovered from the emap, however the state tracked in the rtree
187 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
193 rtree_contents_t contents = rtree_leaf_elm_read(tsdn, &emap->rtree, elm,
229 return rtree_read(tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr).edata;
238 rtree_metadata_t metadata = rtree_metadata_read(tsdn, &emap->rtree,
    [all...]
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
emap.h 6 #include "jemalloc/internal/rtree.h"
19 rtree_t rtree; member in struct:emap_s
22 /* Used to pass rtree lookup context down the path. */
52 * it, even if technically the edata can still be discovered from the rtree.
165 tsdn, &emap->rtree, rtree_ctx, (uintptr_t)edata_base_get(edata));
185 * be discovered from the emap, however the state tracked in the rtree
189 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
195 rtree_contents_t contents = rtree_leaf_elm_read(tsdn, &emap->rtree, elm,
231 return rtree_read(tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr).edata;
264 tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr)
    [all...]
  /src/external/bsd/jemalloc/include/jemalloc/internal/
emap.h 6 #include "jemalloc/internal/rtree.h"
19 rtree_t rtree; member in struct:emap_s
22 /* Used to pass rtree lookup context down the path. */
52 * it, even if technically the edata can still be discovered from the rtree.
165 tsdn, &emap->rtree, rtree_ctx, (uintptr_t)edata_base_get(edata));
185 * be discovered from the emap, however the state tracked in the rtree
189 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
195 rtree_contents_t contents = rtree_leaf_elm_read(tsdn, &emap->rtree, elm,
231 return rtree_read(tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr).edata;
264 tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr)
    [all...]
  /src/external/bsd/jemalloc/dist/src/
base.c 12 * of metadata), since more metadata (e.g. rtree nodes) come from a0's base.
624 void *rtree = base_alloc_impl( local
626 if (rtree == NULL) {
632 return rtree;

Completed in 45 milliseconds