Home
last modified time | relevance | path

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

/lib/
Dsbitmap.c14 unsigned depth = sb->depth; in init_alloc_hint() local
20 if (depth && !sb->round_robin) { in init_alloc_hint()
24 *per_cpu_ptr(sb->alloc_hint, i) = get_random_u32_below(depth); in init_alloc_hint()
30 unsigned int depth) in update_alloc_hint_before_get() argument
35 if (unlikely(hint >= depth)) { in update_alloc_hint_before_get()
36 hint = depth ? get_random_u32_below(depth) : 0; in update_alloc_hint_before_get()
44 unsigned int depth, in update_alloc_hint_after_get() argument
54 if (hint >= depth - 1) in update_alloc_hint_after_get()
64 unsigned int depth, unsigned int alloc_hint, bool wrap) in sbitmap_deferred_clear() argument
71 if (depth == 0) in sbitmap_deferred_clear()
[all …]
Dbootconfig.c296 int depth = 0, ret = 0, total = 0; in xbc_node_compose_key_after() local
305 keys[depth++] = xbc_node_index(node); in xbc_node_compose_key_after()
306 if (depth == XBC_DEPTH_MAX) in xbc_node_compose_key_after()
313 while (--depth >= 0) { in xbc_node_compose_key_after()
314 node = xbc_nodes + keys[depth]; in xbc_node_compose_key_after()
316 depth ? "." : ""); in xbc_node_compose_key_after()
789 int i, depth, len, wlen; in xbc_verify_tree() local
814 depth = 1; in xbc_verify_tree()
827 depth++; in xbc_verify_tree()
828 if (depth > XBC_DEPTH_MAX) in xbc_verify_tree()
[all …]
Dnlattr.c64 struct nlattr **tb, unsigned int depth);
92 unsigned int validate, unsigned int depth) in nla_validate_array() argument
111 NULL, depth + 1); in nla_validate_array()
395 struct netlink_ext_ack *extack, unsigned int depth) in validate_nla() argument
515 depth + 1); in validate_nla()
538 extack, validate, depth); in validate_nla()
608 struct nlattr **tb, unsigned int depth) in __nla_validate_parse() argument
613 if (depth >= MAX_POLICY_RECURSION_DEPTH) { in __nla_validate_parse()
636 validate, extack, depth); in __nla_validate_parse()
Dmaple_tree.c205 MAS_BUG_ON(mas, mas->depth > MAPLE_HEIGHT_MAX); in mas_set_height()
206 new_flags |= mas->depth << MT_FLAGS_HEIGHT_OFFSET; in mas_set_height()
1360 mas->depth = 0; in mas_start()
1364 mas->depth = 1; in mas_start()
2261 unsigned char depth = 0; in mast_spanning_rebalance() local
2266 depth++; in mast_spanning_rebalance()
2272 } while (--depth); in mast_spanning_rebalance()
2283 } while (--depth); in mast_spanning_rebalance()
2841 l_mas.depth = 0; in mas_spanning_rebalance()
2869 l_mas.depth++; in mas_spanning_rebalance()
[all …]
Dfault-inject.c70 int depth = attr->stacktrace_depth; in fail_stacktrace() local
75 if (depth == 0 || (found && !attr->reject_start && !attr->reject_end)) in fail_stacktrace()
78 nr_entries = stack_trace_save(entries, depth, 1); in fail_stacktrace()
Dvsprintf.c905 int depth; in dentry_name() local
910 depth = fmt[1] - '0'; in dentry_name()
913 depth = 1; in dentry_name()
917 for (i = 0; i < depth; i++, d = p) { in dentry_name()
2089 int depth; in fwnode_full_name_string() local
2092 for (depth = fwnode_count_parents(fwnode); depth >= 0; depth--) { in fwnode_full_name_string()
2097 struct fwnode_handle *__fwnode = depth ? in fwnode_full_name_string()
2098 fwnode_get_nth_parent(fwnode, depth) : fwnode; in fwnode_full_name_string()
2105 if (depth) in fwnode_full_name_string()
/lib/zlib_deflate/
Ddeftree.c307 #define smaller(tree, n, m, depth) \ argument
309 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
328 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()
332 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
505 s->depth[n] = 0; in build_tree()
519 s->depth[node] = 0; in build_tree()
543 s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1); in build_tree()
Ddefutil.h188 uch depth[2*L_CODES+1]; member
/lib/zstd/compress/
Dzstd_lazy.c1480 const searchMethod_e searchMethod, const U32 depth, in ZSTD_compressBlock_lazy_generic() argument
1555 if (depth==0) goto _storeSequence; in ZSTD_compressBlock_lazy_generic()
1561 if (depth==0) goto _storeSequence; in ZSTD_compressBlock_lazy_generic()
1577 if (depth>=1) in ZSTD_compressBlock_lazy_generic()
1614 if ((depth==2) && (ip<ilimit)) { in ZSTD_compressBlock_lazy_generic()
1868 const searchMethod_e searchMethod, const U32 depth) in ZSTD_compressBlock_lazy_extDict_generic() argument
1921 if (depth==0) goto _storeSequence; in ZSTD_compressBlock_lazy_extDict_generic()
1937 if (depth>=1) in ZSTD_compressBlock_lazy_extDict_generic()
1970 if ((depth==2) && (ip<ilimit)) { in ZSTD_compressBlock_lazy_extDict_generic()