Home
last modified time | relevance | path

Searched full:trees (Results 1 – 25 of 356) sorted by relevance

12345678910>>...15

/freebsd-src/share/man/man3/
H A Dtree.3105 .Nd "implementations of splay and rank-balanced (wavl) trees"
210 These macros define data structures for different types of trees:
211 splay trees and rank-balanced (wavl) trees.
243 .Sh SPLAY TREES
380 .Sh RANK-BALANCED TREES
381 Rank-balanced (RB) trees are a framework for defining height-balanced
382 binary search trees, including AVL and red-black trees.
389 (wavl) trees, whic
[all...]
H A Darb.398 .Nd "array-based red-black trees"
185 These macros define data structures for and array-based red-black trees.
234 trees require entries to be allocated as an array, and uses array
451 Given that ARB trees have an intrinsic upper bound on the number of entries,
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDomTreeUpdater.h65 /// erased from available trees if it exists and finally get deleted.
68 /// all available trees are up-to-date. Assert if any instruction of DelBB is
74 /// erased from available trees if it exists. Then the callback will
78 /// all available trees are up-to-date. Assert if any instruction of DelBB is
/freebsd-src/tools/boot/
H A Dfull-test.sh5 # trees - binary trees that we use to make image
6 # trees/${ARCH}/$thing
27 TREES=${STAND_ROOT}/trees
50 mkdir -p ${CACHE} ${TREES} ${IMAGES} ${BIOS}
111 dir=${TREES}/${ma_combo}/freebsd
197 dir=${TREES}/${ma_combo}/test-stand
219 dir=${TREES}/${ma_combo}/linuxboot
220 dir2=${TREES}/${ma_combo}/test-stand
221 dir3=${TREES}/${ma_combo}/freebsd
222 initrd=${TREES}/${ma_combo}/initrd.img
[all …]
H A DTEST-NOTES5 o trees has the different trees we use to create images
6 o trees/${ARCH}/$PART have each architecture's tree images
/freebsd-src/usr.sbin/etcupdate/
H A Detcupdate.899 These copies are stored in two trees known as the
103 trees.
138 trees.
140 it compares the two trees merging changes into the destination directory.
151 trees.
176 trees.
415 trees as well as unresolved conflicts.
424 trees.
512 trees will not be changed.
541 trees ar
[all...]
/freebsd-src/sys/modules/zlib/
H A DMakefile15 SRCS+= trees.c
23 CWARNFLAGS.trees.c+=${NO_WSTRICT_PROTOTYPES} # trees.c:232
/freebsd-src/sys/contrib/dev/ath/ath_hal/ar9300/
H A Dposeidon_reg_map_macro.h18 /* File: /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint/top/poseidon_reg_map_macro.h…
22 /* Path: /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint/top */
24 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/env/blueprint/ath_ansic.codegen*/
26 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint/top -I*/
27 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint -I */
28 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/env/blueprint -I*/
29 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint/sysconfig*/
31 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint/top */
35 /* Sources: /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/rtl/rtc/blueprint/rtc_reg.rdl*/
36 /* /trees/kcwo/kcwo-dev/depot/chips/poseidon/1.0/blueprint/sysconfig/mac_pcu_reg_syscon…
[all …]
H A Dscorpion_reg_map.h17 /* File: /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint/top/scorpion_reg_map.h*/
21 /* Path: /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint/top*/
24 /* /trees/irshad/irshad-scorpion/chips/scorpion/1.0/flow/blueprint/ath_ansic.codegen*/
26 /* /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint/top*/
27 /* -I /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint */
29 /* /trees/irshad/irshad-scorpion/chips/scorpion/1.0/flow/blueprint*/
31 /* /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint/sysconfig*/
33 /* /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint/top*/
37 /* Sources: /trees/irshad/irshad-scorpion/chips/scorpion/1.0/blueprint/sysconfig/mac_dcu_reg_sys…
38 /* /trees/irshad/irshad-scorpion/chips/scorpion/1.0/rtl/rtc/rtc_reg.rdl*/
[all …]
/freebsd-src/contrib/dialog/samples/
H A Dradiolist321 "Dog" "No, that's not my dog." ON "Hint: this likes trees" \
23 "Chicken" "Normally not a pet." off "Hint: not often in trees" \
24 "Cat" "No, never put a dog and a cat together!" off "Hint: may be found in trees" \
H A Dradiolist421 "Dog" "No, that's not my dog." ON "Hint: this likes trees" \
23 "Chicken" "Normally not a pet." off "Hint: not often in trees" \
24 "Cat" "No, never put a dog and a cat together!" off "Hint: may be found in trees" \
/freebsd-src/sys/contrib/zlib/
H A Ddeflate.h200 /* used by trees.c: */
213 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
217 * The same heap array is used to build all trees.
221 /* Depth of each subtree used as tie breaker for trees of equal frequency
244 * - creating new Huffman trees less frequently may not provide fast
249 * trees more frequently.
256 ulg opt_len; /* bit length of current block with optimal trees */
257 ulg static_len; /* bit length of current block with static trees */
304 /* in trees.c */
H A Dtrees.c1 /* trees.c -- output deflated data using Huffman coding
10 * The "deflation" process uses several Huffman trees. The more
84 /* non ANSI compilers may not accept trees.h */
114 # include "trees.h"
376 * Generate the file trees.h describing the static trees.
388 FILE *header = fopen("trees.h", "w"); in gen_trees_header()
391 Assert (header != NULL, "Can't open trees.h"); in gen_trees_header()
442 /* Initialize the trees. */ in init_block()
801 /* Determine the bit length frequencies for literal and distance trees */ in build_bl_tree()
820 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", in build_bl_tree()
[all …]
/freebsd-src/sys/contrib/openzfs/module/zfs/
H A Dspace_reftree.c34 * Space reference trees.
42 * N range trees is the subset of the reference tree with refcnt >= 1.
43 * The intersection of N range trees is the subset with refcnt >= N.
46 * are hard to perform in the 'range tree domain', so we convert the trees
/freebsd-src/share/man/man9/
H A Dvm_map_entry_resize_free.9122 amortized using splay trees.
146 This is a common technique in splay trees and is also
226 .%T Self-Adjusting Binary Search Trees
233 Splay trees were added to the VM map in
/freebsd-src/bin/sh/tests/parser/
H A Dheredoc7.02 # Some of these created malformed parse trees with null pointers for here
11 # Some of these created malformed parse trees with null pointers for here
/freebsd-src/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DBuildTree.h1 //===- BuildTree.h - build syntax trees -----------------------*- C++ -*-=====//
28 // Create syntax trees from subtrees not backed by the source code.
41 // Synthesis of Trees
H A DMutations.h1 //===- Mutations.h - mutate syntax trees --------------------*- C++ ---*-=====//
8 // Defines high-level APIs for transforming syntax trees and producing the
/freebsd-src/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp545 // Most declarations own a semicolon in syntax trees, but not in clang AST. in maybeAppendSemicolon()
564 /// A collection of trees covering the input tokens.
567 /// node and update the list of trees accordingly.
581 Trees.insert(Trees.end(), {&T, L}); in Forest()
587 auto It = Trees.lower_bound(Range.begin()); in assignRole()
588 assert(It != Trees.end() && "no node found"); in assignRole()
590 assert((std::next(It) == Trees.end() || in assignRole()
601 auto BeginChildren = Trees.lower_bound(Range.begin()); in shrinkToFitList()
602 assert((BeginChildren == Trees in shrinkToFitList()
688 std::map<const syntax::Token *, syntax::Node *> Trees; global() member
[all...]
/freebsd-src/sys/contrib/openzfs/include/sys/
H A Dmetaslab_impl.h312 * Each metaslab maintains a set of in-core trees to track metaslab
317 * freed, they are added to the free tree (ms_freeing). These trees
320 * of in-core trees is maintained to track deferred frees
407 * The following range trees are accessed only from syncing context.
457 * The ranges in the ms_freed and ms_defer[] range trees are all
461 * all sync passes are consolidated into the range trees.
466 * ms_freed/ms_defer[] range trees (and their histograms).
469 * range trees' histograms from the spacemap's histogram,
470 * because the range trees' histograms may have entries in
/freebsd-src/contrib/kyua/utils/config/
H A Dtree.hpp54 /// Our trees are "strictly-keyed": keys must be defined as "existent" before
57 /// get defined: because trees are used to hold configuration, we want to catch
78 /// Note that trees are shallow-copied unless a deep copy is requested with
/freebsd-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/rename_dirs/
H A Drename_dirs_001_pos.ksh36 # Create two directory trees in ZFS filesystem, and concurrently rename
37 # directory across the two trees. ZFS should be able to handle the race
/freebsd-src/sys/contrib/zlib/doc/
H A Dalgorithm.txt14 match distances are compressed with another tree. The trees are stored
18 it would be useful to start another block with fresh trees. (This is
84 of the first table is nine bits. Also the distance trees have 30 possible
120 At least for deflate's output that generates new trees every several 10's of
/freebsd-src/contrib/llvm-project/clang/include/clang/Rewrite/Core/
H A DDeltaTree.h19 /// features. B-Trees are generally more memory and cache efficient than
20 /// binary trees, because they store multiple keys/values in each node. This
/freebsd-src/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h46 * This is a generic implementation of AVL trees for use in the Solaris kernel.
50 * AVL trees provide an alternative to using an ordered linked list. Using AVL
51 * trees will usually be faster, however they requires more storage. An ordered
282 * Swaps the contents of the two trees.

12345678910>>...15