Home
last modified time | relevance | path

Searched +defs:tree +defs:h (Results 1 – 6 of 6) sorted by relevance

/linux/lib/zlib_deflate/
H A Ddeftree.c150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
154 # define send_code(s, c, tree) \ argument
296 #define pqremove(s, tree, top) \ argument
307 #define smaller(tree, n, m, depth) \ argument
319 ct_data *tree, /* the tree to restore */ in pqdownheap()
358 ct_data *tree = desc->dyn_tree; in gen_bitlen() local
364 int h; /* heap index */ in gen_bitlen() local
442 ct_data *tree, /* the tree to decorate */ in gen_codes()
489 ct_data *tree = desc->dyn_tree; in build_tree() local
574 ct_data *tree, /* the tree to be scanned */ in scan_tree()
[all …]
/linux/drivers/sh/intc/
H A Dinternals.h15 #define _INTC_SHIFT(h) (h & 0x1f) argument
16 #define _INTC_WIDTH(h) ((h >> 5) & 0xf) argument
17 #define _INTC_FN(h) ((h >> 9) & 0xf) argument
18 #define _INTC_MODE(h) ((h >> 13) & 0x7) argument
19 #define _INTC_ADDR_E(h) ((h >> 16) & 0xff) argument
20 #define _INTC_ADDR_D(h) ((h >> 24) & 0xff) argument
57 struct radix_tree_root tree; member
/linux/fs/unicode/
H A Dmkutf8data.c345 struct tree { struct
350 struct tree *next; argument
355 int *(*leaf_index)(struct tree *, void *); argument
378 * Example lookup function for a tree. argument
380 static void *lookup(struct tree *tree, const char *key) in lookup()
417 static void tree_walk(struct tree *tree) in tree_walk()
533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert()
654 static void prune(struct tree *tree) in prune()
815 static void mark_nodes(struct tree *tree) in mark_nodes()
942 static int index_nodes(struct tree *tree, int index) in index_nodes()
[all …]
/linux/drivers/md/
H A Ddm-bufio.c252 struct list_head *h = lru->cursor; in lru_evict() local
413 struct buffer_tree *tree) in cache_read_lock()
423 struct buffer_tree *tree) in cache_read_unlock()
433 struct buffer_tree *tree) in cache_write_lock()
443 struct buffer_tree *tree) in cache_write_unlock()
621 struct buffer_tree *tree, sector_t block) in cache_get()
706 static void cache_mark(struct dm_buffer_cache *bc, struct buffer_tree *tree, in cache_mark()
842 static bool cache_insert(struct dm_buffer_cache *bc, struct buffer_tree *tree, in cache_insert()
869 static bool cache_remove(struct dm_buffer_cache *bc, struct buffer_tree *tree, in cache_remove()
1752 struct buffer_tree *tree, struct dm_buffer *b) in cache_put_and_wake()
[all …]
/linux/tools/perf/ui/stdio/
H A Dhist.c309 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat()
360 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, in callchain__fprintf_folded()
871 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf() local
/linux/kernel/
H A Dauditfilter.c905 int h; in audit_find_rule() local
943 struct audit_tree *tree = entry->rule.tree; in audit_add_rule() local