| /external/jemalloc/include/jemalloc/internal/ |
| rb.h | 165 a_prefix##new(a_rbt_type *rbtree); \
167 a_prefix##empty(a_rbt_type *rbtree); \
169 a_prefix##first(a_rbt_type *rbtree); \
171 a_prefix##last(a_rbt_type *rbtree); \
173 a_prefix##next(a_rbt_type *rbtree, a_type *node); \
175 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
177 a_prefix##search(a_rbt_type *rbtree, const a_type *key); \
179 a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key); \
181 a_prefix##psearch(a_rbt_type *rbtree, const a_type *key); \
183 a_prefix##insert(a_rbt_type *rbtree, a_type *node);
[all...] |
| /external/syslinux/com32/sysdump/ |
| rbtree.h | 43 struct rbtree { struct
45 struct rbtree *left, *right;
49 struct rbtree *rb_insert(struct rbtree *, struct rbtree *);
50 struct rbtree *rb_search(struct rbtree *, uint64_t);
51 void rb_destroy(struct rbtree *);
|
| rbtree.c | 35 * rbtree.c
47 #include "rbtree.h"
49 struct rbtree *rb_search(struct rbtree *tree, uint64_t key)
51 struct rbtree *best = NULL;
66 static bool is_red(struct rbtree *h)
71 static struct rbtree *rotate_left(struct rbtree *h)
73 struct rbtree *x = h->right;
81 static struct rbtree *rotate_right(struct rbtree *h
[all...] |
| acpi.c | 21 #include "rbtree.h"
57 static struct rbtree *rb_types, *rb_addrs;
59 static bool rb_has(struct rbtree **tree, uint64_t key)
61 struct rbtree *node;
|
| /external/blktrace/btt/ |
| Android.mk | 8 ../rbtree.c mmap.c trace_plug.c bno_dump.c \
|
| Makefile | 19 ../rbtree.o mmap.o trace_plug.o bno_dump.o unplug_hist.o q2d.o \
|
| /external/autotest/client/profilers/blktrace/ |
| blktrace.tar.bz2 | |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| sparsetreemap.go | 103 rbtree := (*RBTint32)(m)
114 _ = rbtree.Insert(right, entry)
117 _ = rbtree.Insert(left, entry)
121 _, d := rbtree.Lub(left) // Lub (not EQ) of left is either right or a sparse child
126 _, d = rbtree.Lub(tme.index.exit - tme.adjust)
150 rbtree := (*RBTint32)(m)
151 if rbtree == nil {
158 _, v := rbtree.Glb(blockIndex.entry + adjust)
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| sparsetreemap.go | 103 rbtree := (*RBTint32)(m)
114 _ = rbtree.Insert(right, entry)
117 _ = rbtree.Insert(left, entry)
121 _, d := rbtree.Lub(left) // Lub (not EQ) of left is either right or a sparse child
126 _, d = rbtree.Lub(tme.index.exit - tme.adjust)
150 rbtree := (*RBTint32)(m)
151 if rbtree == nil {
158 _, v := rbtree.Glb(blockIndex.entry + adjust)
|
| /external/fio/os/ |
| os-netbsd.h | 13 /* XXX hack to avoid confilcts between rbtree.h and <sys/rb.h> */
|
| os-openbsd.h | 13 /* XXX hack to avoid conflicts between rbtree.h and <sys/tree.h> */
|
| /external/blktrace/ |
| Makefile | 25 blkparse: blkparse.o blkparse_fmt.o rbtree.o act_mask.o
37 blkiomon: blkiomon.o rbtree.o
|
| Android.mk | 8 LOCAL_SRC_FILES := blkparse.c blkparse_fmt.c rbtree.c act_mask.c strverscmp.c
|
| rbtree.h | 19 linux/include/linux/rbtree.h
31 not trivial work to rebalance the rbtree if necessary.
|
| blktrace.h | 9 #include "rbtree.h"
|
| rbtree.c | 20 linux/lib/rbtree.c
23 #include "rbtree.h"
|
| /external/e2fsprogs/lib/ext2fs/ |
| Android.bp | 74 "rbtree.c",
|
| rbtree.h | 19 linux/include/linux/rbtree.h
31 rbtree, if necessary.
|
| rbtree.c | 20 linux/lib/rbtree.c
23 #include "rbtree.h"
|
| /external/fio/lib/ |
| rbtree.h | 19 linux/include/linux/rbtree.h
31 not trivial work to rebalance the rbtree if necessary.
|
| rbtree.c | 20 linux/lib/rbtree.c
23 #include "rbtree.h"
|
| /external/fio/ |
| iolog.h | 4 #include "lib/rbtree.h"
|
| /external/syslinux/bios/com32/sysdump/ |
| sysdump.elf | |
| /external/syslinux/efi32/com32/sysdump/ |
| sysdump.elf | |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/gcc-4.8.3/python/libstdcxx/v6/ |
| printers.py | 345 def __init__(self, rbtree):
346 self.size = rbtree['_M_t']['_M_impl']['_M_node_count']
347 self.node = rbtree['_M_t']['_M_impl']['_M_header']['_M_left']
[all...] |
