Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 7 of 7) sorted by relevance

/lib/
Dsbitmap.c44 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift, in sbitmap_init_node() argument
58 if (depth >= 4) { in sbitmap_init_node()
59 while ((4U << shift) > depth) in sbitmap_init_node()
68 sb->depth = depth; in sbitmap_init_node()
69 sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word); in sbitmap_init_node()
71 if (depth == 0) { in sbitmap_init_node()
81 sb->map[i].depth = min(depth, bits_per_word); in sbitmap_init_node()
82 depth -= sb->map[i].depth; in sbitmap_init_node()
89 void sbitmap_resize(struct sbitmap *sb, unsigned int depth) in sbitmap_resize() argument
97 sb->depth = depth; in sbitmap_resize()
[all …]
Dgeneric-radix-tree.c20 static inline int genradix_depth_shift(unsigned depth) in genradix_depth_shift() argument
22 return PAGE_SHIFT + GENRADIX_ARY_SHIFT * depth; in genradix_depth_shift()
28 static inline size_t genradix_depth_size(unsigned depth) in genradix_depth_size() argument
30 return 1UL << genradix_depth_shift(depth); in genradix_depth_size()
Dfault-inject.c69 int depth = attr->stacktrace_depth; in fail_stacktrace() local
74 if (depth == 0) in fail_stacktrace()
77 nr_entries = stack_trace_save(entries, depth, 1); in fail_stacktrace()
Dvsprintf.c847 int depth; in dentry_name() local
852 depth = fmt[1] - '0'; in dentry_name()
855 depth = 1; in dentry_name()
859 for (i = 0; i < depth; i++, d = p) { in dentry_name()
1893 static const char *device_node_name_for_depth(const struct device_node *np, int depth) in device_node_name_for_depth() argument
1895 for ( ; np && depth; depth--) in device_node_name_for_depth()
1904 int depth; in device_node_gen_full_name() local
1911 for (depth = 0; parent->parent; depth++) in device_node_gen_full_name()
1914 for ( ; depth >= 0; depth--) { in device_node_gen_full_name()
1916 buf = string(buf, end, device_node_name_for_depth(np, depth), in device_node_gen_full_name()
/lib/zlib_deflate/
Ddeftree.c361 #define smaller(tree, n, m, depth) \ argument
363 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
382 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()
386 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
559 s->depth[n] = 0; in build_tree()
573 s->depth[node] = 0; in build_tree()
597 s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1); in build_tree()
Ddefutil.h186 uch depth[2*L_CODES+1]; member
/lib/zstd/
Dcompress.c1897 …y_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 searchMethod, const U32 depth) in ZSTD_compressBlock_lazy_generic() argument
1935 if (depth == 0) in ZSTD_compressBlock_lazy_generic()
1953 if (depth >= 1) in ZSTD_compressBlock_lazy_generic()
1975 if ((depth == 2) && (ip < ilimit)) { in ZSTD_compressBlock_lazy_generic()
2058 …t_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 searchMethod, const U32 depth) in ZSTD_compressBlock_lazy_extDict_generic() argument
2104 if (depth == 0) in ZSTD_compressBlock_lazy_extDict_generic()
2123 if (depth >= 1) in ZSTD_compressBlock_lazy_extDict_generic()
2159 if ((depth == 2) && (ip < ilimit)) { in ZSTD_compressBlock_lazy_extDict_generic()