Home
last modified time | relevance | path

Searched refs:level (Results 1 – 10 of 10) sorted by relevance

/lib/
Dgeneric-radix-tree.c58 unsigned level = genradix_root_to_depth(r); in __genradix_ptr() local
60 if (ilog2(offset) >= genradix_depth_shift(level)) in __genradix_ptr()
66 if (!level) in __genradix_ptr()
69 level--; in __genradix_ptr()
71 n = n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr()
72 offset &= genradix_depth_size(level) - 1; in __genradix_ptr()
109 unsigned level; in __genradix_ptr_alloc() local
116 level = genradix_root_to_depth(r); in __genradix_ptr_alloc()
118 if (n && ilog2(offset) < genradix_depth_shift(level)) in __genradix_ptr_alloc()
129 ((unsigned long) new_node | (n ? level + 1 : 0))); in __genradix_ptr_alloc()
[all …]
Dassoc_array.c154 int level; member
159 int level; member
180 int level, sc_level, next_sc_level; in assoc_array_walk() local
189 level = 0; in assoc_array_walk()
199 segments = ops->get_key_chunk(index_key, level); in assoc_array_walk()
200 pr_devel("segments[%d]: %lx\n", level, segments); in assoc_array_walk()
207 slot = segments >> (level & ASSOC_ARRAY_KEY_CHUNK_MASK); in assoc_array_walk()
212 slot, level, (unsigned long)ptr & 3); in assoc_array_walk()
219 result->terminal_node.level = level; in assoc_array_walk()
230 level += ASSOC_ARRAY_LEVEL_STEP; in assoc_array_walk()
[all …]
Dbtree.c389 unsigned long *key, int level) in find_level() argument
394 for (height = head->height; height > level; height--) { in find_level()
449 unsigned long *key, void *val, int level, in btree_insert_level() argument
456 if (head->height < level) { in btree_insert_level()
463 node = find_level(head, geo, key, level); in btree_insert_level()
478 new, level + 1, gfp); in btree_insert_level()
519 unsigned long *key, int level);
520 static void merge(struct btree_head *head, struct btree_geo *geo, int level, in merge() argument
536 btree_remove_level(head, geo, bkey(geo, parent, lpos), level + 1); in merge()
541 unsigned long *key, int level, unsigned long *child, int fill) in rebalance() argument
[all …]
Dhexdump.c239 void print_hex_dump(const char *level, const char *prefix_str, int prefix_type, in print_hex_dump() argument
260 level, prefix_str, ptr + i, linebuf); in print_hex_dump()
263 printk("%s%s%.8x: %s\n", level, prefix_str, i, linebuf); in print_hex_dump()
266 printk("%s%s%s\n", level, prefix_str, linebuf); in print_hex_dump()
DKconfig.kasan129 bool "KASan: use 4-level paging"
132 Compiling the kernel with KASan disables automatic 3-level vs
133 4-level paging selection. 3-level paging is used by default (up
135 4-level paging instead.
Ddecompress_unlzo.c46 u8 level = 0; in parse_header() local
68 level = *parse++; in parse_header()
DKconfig.debug49 Note: This does not affect the log level of un-prefixed printk()
65 int "Default message log level (1-7)"
69 Default log level for printk statements with no specified priority.
75 Note: This does not affect what message level gets printed on the console
104 Compiles debug level messages into the kernel, which would not
432 Many embedded boards have a disconnected TTL level serial which can
2043 tristate "Test level of stack variable initialization"
/lib/zlib_deflate/
Ddeflate.c169 int level, in zlib_deflateInit2() argument
190 if (level == Z_DEFAULT_COMPRESSION) level = 6; in zlib_deflateInit2()
199 windowBits < 9 || windowBits > 15 || level < 0 || level > 9 || in zlib_deflateInit2()
245 s->level = level; in zlib_deflateInit2()
355 uInt level_flags = (s->level-1) >> 1; in zlib_deflate()
407 bstate = (*(configuration_table[s->level].func))(s, flush); in zlib_deflate()
529 s->max_lazy_match = configuration_table[s->level].max_lazy; in lm_init()
530 s->good_match = configuration_table[s->level].good_length; in lm_init()
531 s->nice_match = configuration_table[s->level].nice_length; in lm_init()
532 s->max_chain_length = configuration_table[s->level].max_chain; in lm_init()
Ddefutil.h158 int level; /* compression level (1..9) */ member
Ddeftree.c867 if (s->level > 0) {
993 if ((s->last_lit & 0xfff) == 0 && s->level > 2) {