Searched refs:tree (Results 176 - 200 of 741) sorted by relevance

1234567891011>>

/freebsd-11-stable/tools/tools/notescheck/
H A Dnotescheck.py19 print("Where 'path' is a path to a kernel source tree.", file=sys.stderr)
21 # These files are used to determine if a path is a valid kernel source tree.
159 def find_platforms(tree):
161 for file in glob.glob(tree + '*/conf/NOTES'):
162 if not file.startswith(tree):
165 platforms.append(file[len(tree):].split('/')[0])
334 tree = sys.argv[1]
335 if tree[-1] != '/':
336 tree = tree
[all...]
/freebsd-11-stable/usr.bin/ctags/
H A DMakefile5 SRCS= C.c ctags.c fortran.c lisp.c print.c tree.c yacc.c
/freebsd-11-stable/sys/contrib/zlib/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
87 /* The static literal tree. Since the bit lengths are imposed, there is no
89 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
94 /* The static distance tree. (Actually a trivial tree since all codes use
118 const ct_data *static_tree; /* static tree or NULL */
121 int elems; /* max number of elements in the tree */
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, in
490 ct_data *tree = desc->dyn_tree; local
619 ct_data *tree = desc->dyn_tree; local
[all...]
/freebsd-11-stable/contrib/unbound/edns-subnet/
H A Daddrtree.h2 * edns-subnet/addrtree.h -- radix tree for edns subnet cache.
38 * The addrtree is a radix tree designed for edns subnet. Most notable
44 * (sourcemask). While traversing the tree the first matching node is
54 * tree the scope of all visited nodes is updated. This ensures we are
67 /** Number of elements in the tree (not always equal to number of
73 /** Size of tree in bytes */
122 * Size of tree in bytes.
123 * @param tree: Tree.
124 * @return size of tree in bytes.
126 size_t addrtree_size(const struct addrtree *tree);
[all...]
/freebsd-11-stable/contrib/unbound/iterator/
H A Diter_donotq.h61 rbtree_type tree; member in struct:iter_donotq
/freebsd-11-stable/usr.bin/dtc/
H A Ddtc.cc116 class device_tree tree; local
132 tree.write_symbols = true;
232 tree.set_phandle_format(device_tree::BOTH);
236 tree.set_phandle_format(device_tree::EPAPR);
240 tree.set_phandle_format(device_tree::LINUX);
284 tree.add_include_path(optarg);
291 tree.set_empty_reserve_map_entries(strtoll(optarg, 0, 10));
294 tree.set_blob_minimum_size(strtoll(optarg, 0, 10));
297 tree.set_blob_padding(strtoll(optarg, 0, 10));
300 if (!tree
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dc-pretty-print.c28 #include "c-tree.h"
29 #include "tree-iterator.h"
50 static void pp_c_initializer_list (c_pretty_printer *, tree);
51 static void pp_c_brace_enclosed_initializer_list (c_pretty_printer *, tree);
53 static void pp_c_multiplicative_expression (c_pretty_printer *, tree);
54 static void pp_c_additive_expression (c_pretty_printer *, tree);
55 static void pp_c_shift_expression (c_pretty_printer *, tree);
56 static void pp_c_relational_expression (c_pretty_printer *, tree);
57 static void pp_c_equality_expression (c_pretty_printer *, tree);
58 static void pp_c_and_expression (c_pretty_printer *, tree);
[all...]
H A Dtree-eh.c25 #include "tree.h"
31 #include "tree-flow.h"
32 #include "tree-dump.h"
33 #include "tree-inline.h"
34 #include "tree-iterator.h"
35 #include "tree-pass.h"
89 record_stmt_eh_region (struct eh_region *region, tree t)
98 add_stmt_to_eh_region_fn (struct function *ifun, tree t, int num)
127 add_stmt_to_eh_region (tree t, int num)
133 remove_stmt_from_eh_region_fn (struct function *ifun, tree
[all...]
H A Dtree-ssa-ccp.c25 propagation engine (tree-ssa-propagate.c). Constant assignments of
195 #include "tree.h"
206 #include "tree-dump.h"
207 #include "tree-flow.h"
208 #include "tree-pass.h"
209 #include "tree-ssa-propagate.h"
283 ccp_decl_initial_min_invariant (tree t)
327 get_default_value (tree var)
329 tree sym = SSA_NAME_VAR (var);
358 tree stm
[all...]
H A Dtree-ssa-live.h40 tree *partition_to_var;
65 extern int var_union (var_map, tree, tree);
66 extern void change_partition_var (var_map, tree, int);
69 extern void register_ssa_partition_check (tree ssa_var);
73 static inline tree var_to_partition_to_var (var_map, tree);
74 static inline tree partition_to_var (var_map, int);
75 static inline int var_to_partition (var_map, tree);
76 static inline tree version_to_va
[all...]
H A Dtree-cfg.c27 #include "tree.h"
39 #include "tree-flow.h"
41 #include "tree-dump.h"
42 #include "tree-pass.h"
48 #include "tree-ssa-propagate.h"
51 for a function tree. */
80 tree case_labels;
98 static void make_blocks (tree);
111 static inline bool stmt_starts_bb_p (tree, tree);
[all...]
H A Dintegrate.c29 #include "tree.h"
48 #include "tree-pass.h"
66 static void set_block_origin_self (tree);
67 static void set_block_abstract_flags (tree, int);
74 function_attribute_inlinable_p (tree fndecl)
78 tree a;
82 tree name = TREE_PURPOSE (a);
99 the given node is NULL, recursively descend the decl/block tree which
106 set_block_origin_self (tree stmt)
113 tree local_dec
[all...]
H A Dtree-ssa.c25 #include "tree.h"
39 #include "tree-flow.h"
40 #include "tree-gimple.h"
41 #include "tree-inline.h"
45 #include "tree-dump.h"
46 #include "tree-pass.h"
56 tree phi;
57 tree list = NULL, *last = &list;
58 tree src, dst, node;
85 tree ph
[all...]
H A Dtree-data-ref.c83 #include "tree.h"
89 #include "tree-flow.h"
90 #include "tree-dump.h"
93 #include "tree-chrec.h"
94 #include "tree-data-ref.h"
95 #include "tree-scalar-evolution.h"
96 #include "tree-pass.h"
125 static tree object_analysis (tree, tree, boo
[all...]
H A Dlambda-code.c27 #include "tree.h"
32 #include "tree-flow.h"
33 #include "tree-dump.h"
38 #include "tree-chrec.h"
39 #include "tree-data-ref.h"
40 #include "tree-pass.h"
41 #include "tree-scalar-evolution.h"
119 struct loop *, VEC(tree,heap) *,
120 VEC(tree,heap) *, VEC(int,heap) *,
121 VEC(tree,hea
[all...]
H A Dfold-const.c1 /* Fold a constant sub-tree into a single node for C-compiler
34 fold takes a tree as argument and returns a simplified tree.
36 size_binop takes a tree code for an arithmetic operation
37 and two operands that are trees, and produces a tree for the
40 size_int takes an integer value, and creates a tree constant
52 #include "tree.h"
93 static bool negate_expr_p (tree);
94 static tree negate_expr (tree);
[all...]
H A Dtree-sra.c30 #include "tree.h"
39 #include "tree-inline.h"
40 #include "tree-flow.h"
41 #include "tree-gimple.h"
42 #include "tree-dump.h"
43 #include "tree-pass.h"
97 /* A tree of the elements. Used when we want to traverse everything. */
109 tree element;
112 tree type;
115 tree replacemen
[all...]
H A Domp-low.c29 #include "tree.h"
31 #include "tree-gimple.h"
32 #include "tree-inline.h"
35 #include "tree-flow.h"
41 #include "tree-pass.h"
63 callback functions for tree-inline.c (e.g., omp_copy_decl)
68 /* The tree of contexts corresponding to the encountered constructs. */
70 tree stmt;
75 tree record_type;
76 tree sender_dec
[all...]
H A Dtree-ssa-loop-unswitch.c25 #include "tree.h"
32 #include "tree-flow.h"
33 #include "tree-dump.h"
38 #include "tree-pass.h"
73 tree-ssa-loop-im.c ensures that all the suitable conditions are in this
77 tree);
79 static tree tree_may_unswitch_on (basic_block, struct loop *);
114 static tree
117 tree stmt, def, cond, use;
150 static tree
[all...]
H A Ddbxout.c77 #include "tree.h"
183 When we first notice a data type (a tree node),
203 static GTY(()) tree preinit_symbols;
317 static void dbxout_typedefs (tree);
318 static void dbxout_type_index (tree);
319 static void dbxout_args (tree);
320 static void dbxout_type_fields (tree);
321 static void dbxout_type_method_1 (tree);
322 static void dbxout_type_methods (tree);
323 static void dbxout_range_type (tree);
[all...]
H A Dipa-pure-const.c38 #include "tree.h"
39 #include "tree-flow.h"
40 #include "tree-inline.h"
41 #include "tree-pass.h"
47 #include "tree-gimple.h"
92 tree t, bool checking_write)
153 tree t, bool checking_write)
161 /* Examine tree T for references. */
164 check_tree (funct_state local, tree t, bool checking_write)
169 /* Any tree whic
[all...]
H A Dtree-if-conv.c22 /* This pass implements tree level if-conversion transformation of loops.
87 #include "tree.h"
95 #include "tree-flow.h"
96 #include "tree-dump.h"
98 #include "tree-chrec.h"
99 #include "tree-data-ref.h"
100 #include "tree-scalar-evolution.h"
101 #include "tree-pass.h"
106 static tree tree_if_convert_stmt (struct loop *loop, tree, tre
[all...]
/freebsd-11-stable/contrib/gcc/config/i386/
H A Dwinnt-cxx.c31 #include "tree.h"
32 #include "cp/cp-tree.h" /* this is why we're a separate module */
39 i386_pe_type_dllimport_p (tree decl)
65 tree.c:merge_dllimport_decl_attributes. If this is the key method, the
105 i386_pe_type_dllexport_p (tree decl)
118 static inline void maybe_add_dllimport (tree decl)
125 i386_pe_adjust_class_at_definition (tree t)
127 tree member;
141 (See tree.c: merge_dllimport_decl_attributes).
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dzfs_rlock.c41 * AVL tree
43 * An AVL tree is used to maintain the state of the existing ranges
45 * The starting range offset is used for searching and sorting the tree.
50 * locks. On entry to zfs_lock_range() a rl_t is allocated; the tree
51 * searched that finds no overlap, and *this* rl_t is placed in the tree.
106 avl_tree_t *tree = &zp->z_range_avl; local
149 if (avl_numnodes(tree) == 0) {
151 avl_add(tree, new);
158 rl = avl_find(tree, new, &where);
162 rl = (rl_t *)avl_nearest(tree, wher
191 zfs_range_proxify(avl_tree_t *tree, rl_t *rl) argument
223 zfs_range_split(avl_tree_t *tree, rl_t *rl, uint64_t off) argument
254 zfs_range_new_proxy(avl_tree_t *tree, uint64_t off, uint64_t len) argument
271 zfs_range_add_reader(avl_tree_t *tree, rl_t *new, rl_t *prev, avl_index_t where) argument
358 avl_tree_t *tree = &zp->z_range_avl; local
465 avl_tree_t *tree = &zp->z_range_avl; local
[all...]
/freebsd-11-stable/contrib/gcc/cp/
H A Doptimize.c1 /* Perform optimizations on tree structure.
27 #include "tree.h"
28 #include "cp-tree.h"
39 #include "tree-inline.h"
43 #include "tree-dump.h"
44 #include "tree-gimple.h"
48 static void update_cloned_parm (tree, tree, bool);
56 update_cloned_parm (tree parm, tree cloned_par
[all...]

Completed in 213 milliseconds

1234567891011>>