| /src/external/bsd/jemalloc.old/dist/src/ |
| rtree.c | 12 rtree_new(rtree_t *rtree, base_t *base, bool zeroed) {
15 memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */
20 rtree->base = base;
22 if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE,
31 rtree_node_alloc(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
32 return (rtree_node_elm_t *)base_alloc(tsdn, rtree->base,
37 rtree_leaf_alloc(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
38 return (rtree_leaf_elm_t *)base_alloc(tsdn, rtree->base,
43 rtree_node_init(tsdn_t *tsdn, rtree_t *rtree, unsigned level
[all...] |
| emap.c | 15 return rtree_new(&emap->rtree, base, zeroed);
27 rtree_leaf_elm_t *elm1 = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
32 rtree_leaf_elm_lookup(tsdn, &emap->rtree, rtree_ctx,
36 rtree_leaf_elm_state_update(tsdn, &emap->rtree, elm1, elm2, state);
57 * This is subtle; the rtree code asserts that its input pointer is
69 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
77 &emap->rtree, elm, /* dependent */ true);
124 *r_elm_a = rtree_leaf_elm_lookup(tsdn, &emap->rtree, rtree_ctx,
131 *r_elm_b = rtree_leaf_elm_lookup(tsdn, &emap->rtree, rtree_ctx,
151 rtree_leaf_elm_write(tsdn, &emap->rtree, elm_a, contents)
[all...] |
| /src/external/bsd/jemalloc/dist/src/ |
| rtree.c | 12 rtree_new(rtree_t *rtree, base_t *base, bool zeroed) {
15 memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */
20 rtree->base = base;
22 if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE,
31 rtree_node_alloc(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
33 tsdn, rtree->base, nelms * sizeof(rtree_node_elm_t));
37 rtree_leaf_alloc(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
39 tsdn, rtree->base, nelms * sizeof(rtree_leaf_elm_t));
44 tsdn_t *tsdn, rtree_t *rtree, unsigned level, atomic_p_t *elmp)
[all...] |
| emap.c | 15 return rtree_new(&emap->rtree, base, zeroed);
27 rtree_leaf_elm_t *elm1 = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
33 : rtree_leaf_elm_lookup(tsdn, &emap->rtree, rtree_ctx,
37 rtree_leaf_elm_state_update(tsdn, &emap->rtree, elm1, elm2, state);
58 * This is subtle; the rtree code asserts that its input pointer is
70 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &emap->rtree,
78 tsdn, &emap->rtree, elm, /* dependent */ false);
125 *r_elm_a = rtree_leaf_elm_lookup(tsdn, &emap->rtree, rtree_ctx,
132 *r_elm_b = rtree_leaf_elm_lookup(tsdn, &emap->rtree, rtree_ctx,
152 rtree_leaf_elm_write(tsdn, &emap->rtree, elm_a, contents)
[all...] |
| 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.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/ |
| rtree.h | 128 # error Unsupported rtree height
132 bool rtree_new(rtree_t *rtree, base_t *base, bool zeroed);
134 rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
172 * because the rtree update became visible in memory before the
175 * dependent on a previous rtree write, which means a stale read
180 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree,
239 rtree_leaf_elm_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
242 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
282 rtree_leaf_elm_write_commit(tsdn_t *tsdn, rtree_t *rtree,
297 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree,
[all...] |
| 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/ |
| rtree.h | 128 # error Unsupported rtree height
132 bool rtree_new(rtree_t *rtree, base_t *base, bool zeroed);
134 rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
172 * because the rtree update became visible in memory before the
175 * dependent on a previous rtree write, which means a stale read
180 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree,
239 rtree_leaf_elm_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
242 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
282 rtree_leaf_elm_write_commit(tsdn_t *tsdn, rtree_t *rtree,
297 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree,
[all...] |
| 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/ |
| rtree.h | 132 # error Unsupported rtree height
136 bool rtree_new(rtree_t *rtree, base_t *base, bool zeroed);
138 rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
176 * because the rtree update became visible in memory before the
179 * dependent on a previous rtree write, which means a stale read
185 tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) {
247 tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) {
249 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
294 rtree_leaf_elm_write_commit(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
309 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm
[all...] |
| 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/ |
| rtree.h | 132 # error Unsupported rtree height
136 bool rtree_new(rtree_t *rtree, base_t *base, bool zeroed);
138 rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
176 * because the rtree update became visible in memory before the
179 * dependent on a previous rtree write, which means a stale read
185 tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) {
247 tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) {
249 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
294 rtree_leaf_elm_write_commit(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
309 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm
[all...] |
| 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/usr.bin/netstat/ |
| route.c | 101 routepr(u_long rtree)
109 if (rtree == 0) {
114 kget(rtree, rt_nodes);
|
| /src/external/gpl2/lvm2/dist/tools/ |
| Makefile | 94 lvm.cflow lvm.xref lvm.tree lvm.rxref lvm.rtree \
160 lvm.rtree: $(SOURCES)
164 cflow: lvm.cflow lvm.xref lvm.tree lvm.rtree lvm.rxref
|
| Makefile.in | 94 lvm.cflow lvm.xref lvm.tree lvm.rxref lvm.rtree \
160 lvm.rtree: $(SOURCES)
164 cflow: lvm.cflow lvm.xref lvm.tree lvm.rtree lvm.rxref
|
| /src/external/bsd/jemalloc/dist/ |
| Makefile | 150 $(srcroot)src/rtree.c \
288 $(srcroot)test/unit/rtree.c \
|
| /src/external/public-domain/sqlite/dist/ |
| configure | 1470 --enable-rtree include rtree support [default=yes]
14504 # --enable-rtree
14506 # Check whether --enable-rtree was given.
14514 { printf "%s\n" "$as_me:${as_lineno-$LINENO}: checking RTREE extension" >&5
14515 printf %s "checking RTREE extension... " >&6; }
|
| sqlite3.c | 11142 /* The double-precision datatype used by RTree depends on the
11155 ** SELECT ... FROM <rtree> WHERE <rtree col> MATCH $zGeom(... params ...)
11181 ** SELECT ... FROM <rtree> WHERE <rtree col> MATCH $zQueryFunc(... params ...)
[all...] |
