Home
last modified time | relevance | path

Searched refs:trees (Results 1 – 25 of 95) sorted by relevance

1234

/freebsd-12.1/contrib/gcc/
H A Dpredict.def92 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (81), 0)
98 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)", HITRATE (79), 0)
99 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)", HITRATE (71), 0)
100 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
107 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (67), 0)
H A DLANGUAGES36 All trees that represent sizes in bits should have a TREE_TYPE of
43 in trees, care should be taken to change the tree's type again to sizetype.
H A Dtree-ssa-live.c884 tpa->trees = VEC_alloc (tree, heap, x); in tpa_init()
927 VEC_free (tree, heap, tpa->trees); in tpa_delete()
962 swap_t = VEC_index (tree, tpa->trees, last); in tpa_compact()
967 VEC_replace (tree, tpa->trees, last, in tpa_compact()
968 VEC_index (tree, tpa->trees, x)); in tpa_compact()
975 VEC_replace (tree, tpa->trees, x, swap_t); in tpa_compact()
1054 VEC_safe_push (tree, heap, rv->trees, t); in root_var_init()
1063 t = VEC_index (tree, rv->trees, x); in root_var_init()
1119 if (t == VEC_index (tree, tv->trees, y)) in type_var_init()
1124 VEC_safe_push (tree, heap, tv->trees, t); in type_var_init()
H A Dcommon.opt574 Optimize induction variables on trees
942 Enable SSA-CCP optimization on trees
950 Enable loop header copying on trees
962 Enable copy propagation on trees
982 Enable Full Redundancy Elimination (FRE) on trees
986 Enable loop invariant motion on trees
990 Enable linear loop transforms on trees
1002 Enable SSA-PRE optimization on trees
1010 Enable SSA code sinking on trees
1026 Perform Value Range Propagation on trees
[all …]
H A Dtree-ssa-live.h341 VEC(tree,heap) *trees;
379 return VEC_index (tree, tpa->trees, i); in tpa_tree()
H A Dbuiltin-attrs.def78 /* Construct trees for identifiers. */
/freebsd-12.1/bin/sh/tests/parser/
H A Dheredoc7.03 # Some of these created malformed parse trees with null pointers for here
12 # Some of these created malformed parse trees with null pointers for here
/freebsd-12.1/sys/libkern/
H A Dzlib.c3856 s->sub.trees.index = 0;
3860 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
3863 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3867 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
3868 s->sub.trees.bb = 7;
3869 t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
3880 s->sub.trees.index = 0;
3890 t = s->sub.trees.bb;
3898 s->sub.trees.blens[s->sub.trees.index++] = c;
3928 s->sub.trees.tb = Z_NULL;
[all …]
/freebsd-12.1/crypto/openssl/crypto/x509v3/
H A Dv3_ncons.c27 STACK_OF(GENERAL_SUBTREE) *trees, BIO *bp,
166 STACK_OF(GENERAL_SUBTREE) *trees, in do_i2r_name_constraints()
171 if (sk_GENERAL_SUBTREE_num(trees) > 0) in do_i2r_name_constraints()
173 for (i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++) { in do_i2r_name_constraints()
174 tree = sk_GENERAL_SUBTREE_value(trees, i); in do_i2r_name_constraints()
/freebsd-12.1/contrib/subversion/subversion/libsvn_wc/
H A DREADME40 Updates and commits are about merging two trees that share a common
42 the trees comes from the working copy, the other from the repository.
43 But when thinking about how to merge two such trees, we can ignore the
80 So below we consider the general problem of how to merge two trees
149 situation is more complex for trees. There is sometimes no way for a
/freebsd-12.1/lib/libz/
H A DMakefile38 SRCS+= trees.c
/freebsd-12.1/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
H A Drfc1951.txt194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
214 The code trees for each block appear in a compact form just before
537 read representation of code trees (see
795 new block with fresh trees would be useful, or when the block size
/freebsd-12.1/sys/contrib/zlib/
H A DChangeLog314 - Update trees.c to be able to generate modified trees.h
556 - Add ush casts in trees.c to avoid pedantic runtime errors
624 trees.c, according to the txtvsbin.txt document [Truta]
681 - Add cast in trees.c t avoid a warning [Oberhumer]
766 - Fix trees.c to update strm->data_type (no one ever noticed!)
826 - Cast a type in a debug statement in trees.c
1008 - Remove MAX #define in trees.c (conflicted with some libraries)
1163 - use constant arrays for the static trees in trees.c instead of computing
1165 trees.h, compile with GEN_TREES_H and run "make test".
1320 - static_init_done in trees.c is an int
[all …]
/freebsd-12.1/sys/modules/zfs/
H A DMakefile64 SRCS+= trees.c
/freebsd-12.1/usr.sbin/makefs/tests/
H A Dmakefs_cd9660_tests.sh187 $MAKEFS -o allow-deep-trees $TEST_IMAGE $TEST_INPUTS_DIR
/freebsd-12.1/contrib/dtc/
H A DREADME.license25 encourage widespread and correct usage of flattened device trees,
/freebsd-12.1/contrib/dtc/Documentation/
H A Ddts-format.txt8 constructs used to represent device trees.
H A Ddtc-paper.tex14 \title{Device trees everywhere}
384 The device trees for embedded boards are usually quite simple, and
469 makes it easy to create interrupt trees without having to explicitly
529 that \dtc could include to make creating device trees more convenient:
541 board-specific purpose. For example, many of Apple's device trees
/freebsd-12.1/contrib/gcclibs/libmudflap/
H A Dmf-runtime.c677 static mfsplay_tree trees [__MF_TYPE_MAX+1]; in __mf_object_tree() local
679 if (UNLIKELY (trees[type] == NULL)) in __mf_object_tree()
680 trees[type] = mfsplay_tree_new (); in __mf_object_tree()
681 return trees[type]; in __mf_object_tree()
/freebsd-12.1/sys/gnu/dts/arm/
H A Domap5-board-common.dtsi154 /* TI trees use GPIO instead of msecure, see also muxing */
246 /* TI trees use GPIO mode; msecure mode does not work reliably? */
/freebsd-12.1/contrib/mandoc/
H A Dconfigure.local.example61 # trees by default.
198 # into the manual trees. To allow mandoc to follow such symlinks,
/freebsd-12.1/bin/sh/
H A Dnodetypes35 # This file describes the nodes used in parse trees. Unindented lines
/freebsd-12.1/contrib/gcc/doc/
H A Dtree-ssa.texi53 representing an entire function in trees. To this end, it was necessary to
91 GIMPLE retains much of the structure of the parse trees: lexical
131 convert the front end trees to GIMPLE@. Usually such a hook will involve
132 much of the same code for expanding front end trees to RTL@. This function
133 can return fully lowered GIMPLE, or it can return GENERIC trees and let the
142 trees to GIMPLE, and hand that off to the back end rather than first
150 which would work better with higher-level trees, but currently the
944 trees, and choose the appropriate macro:
/freebsd-12.1/contrib/bsnmp/snmp_mibII/
H A DmibII_tree.def31 # Definition of the standard interfaces and ip trees.

1234