| /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/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 | 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.old/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/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,
232 return rtree_read(tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr).edata;
265 tsdn, &emap->rtree, rtree_ctx, (uintptr_t)ptr)
[all...] |
| /src/external/bsd/jemalloc.old/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;
|
| /src/external/bsd/jemalloc/dist/src/ |
| base.c | 16 * of metadata), since more metadata (e.g. rtree nodes) come from a0's base.
644 void *rtree = base_alloc_impl( local
646 if (rtree == NULL) {
652 return rtree;
|
