Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 14 of 14) sorted by relevance

/lib/zlib_deflate/
A Ddeftree.c150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
156 send_bits(s, tree[c].Code, tree[c].Len); }
308 (tree[n].Freq < tree[m].Freq || \
309 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
380 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
390 f = tree[n].Freq; in gen_bitlen()
507 tree[n].Len = 0; in build_tree()
518 tree[node].Freq = 1; in build_tree()
542 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
544 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
[all …]
/lib/
A Dtest_maple_tree.c3990 check_load(&tree, set[1], &tree); in maple_tree_seed()
3992 check_load(&tree, set[3], &tree); in maple_tree_seed()
3995 check_load(&tree, set[1], &tree); in maple_tree_seed()
4001 check_load(&tree, set[1], &tree); in maple_tree_seed()
4003 check_load(&tree, set[3], &tree); in maple_tree_seed()
4005 check_load(&tree, set[5], &tree); in maple_tree_seed()
4008 check_load(&tree, set[1], &tree); in maple_tree_seed()
4010 check_load(&tree, set[3], &tree); in maple_tree_seed()
4012 check_load(&tree, set[5], &tree); in maple_tree_seed()
4021 check_load(&tree, set[1], &tree); in maple_tree_seed()
[all …]
A Dmaple_tree.c226 return mt_height(mas->tree); in mas_mt_height()
481 if (mt_is_alloc(mas->tree)) in mas_parent_type()
844 return rcu_dereference_check(mas->tree->ma_root, mt_locked(mas->tree)); in mas_root()
1318 if (mt_in_rcu(mas->tree)) in mas_free()
4120 MT_BUG_ON(mas->tree, 1); in mas_wr_store_entry()
6289 mtree_unlock(mas->tree); in mas_nomem()
6291 mtree_lock(mas->tree); in mas_nomem()
6727 if (unlikely(mt_attr(mas->tree) != mt_attr(new_mas->tree)) || in mas_dup_build()
6787 new_mas->tree->ma_flags = mas->tree->ma_flags; in mas_dup_build()
7393 MT_BUG_ON(mas->tree, 1); in mas_validate_gaps()
[all …]
A Dinterval_tree_test.c246 DEFINE_MTREE(tree); in span_iteration_check()
248 MA_STATE(mas, &tree, 0, 0); in span_iteration_check()
259 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE); in span_iteration_check()
260 mt_set_in_rcu(&tree); in span_iteration_check()
263 WARN_ON_ONCE(mtree_store_range(&tree, nodes[j].start, in span_iteration_check()
301 mtree_destroy(&tree); in span_iteration_check()
A DKconfig334 Simple, embeddable, interval-tree. Can find the start of an
417 # is ridiculous for the amount of code involved. Until an out-of-tree
419 # when required. Since we're ignoring out-of-tree users, there's also
428 All drivers in the Linux kernel tree that require this function
430 are compiling an out-of tree driver which tells you that it
A DMakefile37 rbtree.o radix-tree.o timerqueue.o xarray.o \
59 generic-radix-tree.o bitmap-str.o
A DKconfig.debug596 This option generates modules.builtin.ranges in the build tree with
702 debugfs tree and debugfs is not registered as a filesystem.
857 Enable VM maple tree debugging information and extra validations.
865 Enable VM red-black tree debugging information and extra validations.
906 bool "Debug the global anon/private NOMMU mapping region tree"
909 This option causes the global tree of anonymous and private mapping
1809 Enable maple tree debugging information and extra validations.
2387 tristate "Red-Black tree test"
2406 tristate "Interval tree test"
2410 A benchmark measuring the performance of the interval tree library
[all …]
/lib/zstd/common/
A Dhuf.h164 size_t HUF_buildCTable_wksp (HUF_CElt* tree,
/lib/crypto/x86/
A Dsha512-avx-asm.S15 # COPYING in the main directory of this source tree, or the
A Dsha512-ssse3-asm.S15 # COPYING in the main directory of this source tree, or the
A Dsha256-avx-asm.S14 # COPYING in the main directory of this source tree, or the
A Dsha256-ssse3-asm.S14 # COPYING in the main directory of this source tree, or the
A Dsha256-avx2-asm.S14 # COPYING in the main directory of this source tree, or the
A Dsha512-avx2-asm.S15 # COPYING in the main directory of this source tree, or the

Completed in 43 milliseconds