Home
last modified time | relevance | path

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

/lib/
A Dsbitmap.c14 unsigned depth = sb->depth; in init_alloc_hint() local
36 hint = depth ? get_random_u32_below(depth) : 0; in update_alloc_hint_before_get()
71 if (depth == 0) in sbitmap_deferred_clear()
116 sb->depth = depth; in sbitmap_init_node()
120 if (depth == 0) { in sbitmap_init_node()
153 sb->depth = depth; in sbitmap_resize()
244 if (depth) in sbitmap_find_bit()
289 depth = READ_ONCE(sb->depth); in sbitmap_get()
333 depth = READ_ONCE(sb->depth); in sbitmap_get_shallow()
493 unsigned int depth = (sbq->sb.depth + users - 1) / users; in sbitmap_queue_recalculate_wake_batch() local
[all …]
A 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 …]
A 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()
A Dfault-inject.c90 int depth = attr->stacktrace_depth; in fail_stacktrace() local
95 if (depth == 0 || (found && !attr->reject_start && !attr->reject_end)) in fail_stacktrace()
98 nr_entries = stack_trace_save(entries, depth, 1); in fail_stacktrace()
A Dmaple_tree.c1376 mas->depth = 0; in mas_start()
1380 mas->depth = 0; in mas_start()
2276 unsigned char depth = 0; in mast_spanning_rebalance() local
2281 depth++; in mast_spanning_rebalance()
2287 } while (--depth); in mast_spanning_rebalance()
2298 } while (--depth); in mast_spanning_rebalance()
2951 mas->depth = l_mas.depth; in mas_spanning_rebalance()
3251 tmp_mas.depth = mast->l->depth; in mas_push_data()
3532 wr_mas->mas->depth++; in mas_wr_walk_traverse()
7171 first, last, depth + 1, format); in mt_dump_range64()
[all …]
A Dvsprintf.c912 int depth; in dentry_name() local
917 depth = fmt[1] - '0'; in dentry_name()
920 depth = 1; in dentry_name()
924 for (i = 0; i < depth; i++, d = p) { in dentry_name()
2153 int depth; in fwnode_full_name_string() local
2156 for (depth = fwnode_count_parents(fwnode); depth >= 0; depth--) { in fwnode_full_name_string()
2161 struct fwnode_handle *__fwnode = depth ? in fwnode_full_name_string()
2162 fwnode_get_nth_parent(fwnode, depth) : fwnode; in fwnode_full_name_string()
2169 if (depth) in fwnode_full_name_string()
/lib/zlib_deflate/
A 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()
A Ddefutil.h188 uch depth[2*L_CODES+1]; member
/lib/zstd/compress/
A Dzstd_lazy.c1521 const searchMethod_e searchMethod, const U32 depth, in ZSTD_compressBlock_lazy_generic() argument
1598 if (depth==0) goto _storeSequence; in ZSTD_compressBlock_lazy_generic()
1604 if (depth==0) goto _storeSequence; in ZSTD_compressBlock_lazy_generic()
1629 if (depth>=1) in ZSTD_compressBlock_lazy_generic()
1666 if ((depth==2) && (ip<ilimit)) { in ZSTD_compressBlock_lazy_generic()
1942 const searchMethod_e searchMethod, const U32 depth) in ZSTD_compressBlock_lazy_extDict_generic() argument
1996 if (depth==0) goto _storeSequence; in ZSTD_compressBlock_lazy_extDict_generic()
2021 if (depth>=1) in ZSTD_compressBlock_lazy_extDict_generic()
2054 if ((depth==2) && (ip<ilimit)) { in ZSTD_compressBlock_lazy_extDict_generic()

Completed in 38 milliseconds