Searched refs:tree (Results 51 - 75 of 741) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/gcc/
H A Dtree-dump.h25 #include "splay-tree.h"
26 #include "tree-pass.h"
48 /* The queued tree node. */
62 tree node;
75 /* The tree nodes which we have already written out. The
89 extern void dump_stmt (dump_info_p, tree);
90 extern void queue_and_dump_index (dump_info_p, const char *, tree, int);
91 extern void queue_and_dump_type (dump_info_p, tree);
92 extern void dump_function (enum tree_dump_index, tree);
93 extern void dump_function_to_file (tree, FIL
[all...]
H A Dc-pragma.h90 extern void maybe_apply_pragma_weak (tree);
92 extern tree maybe_apply_renaming_pragma (tree, tree);
93 extern void add_to_renaming_pragma_list (tree, tree);
95 extern enum cpp_ttype pragma_lex (tree *);
100 extern enum cpp_ttype c_lex_with_flags (tree *, location_t *, unsigned char *);
H A Dipa-utils.h24 #include "tree.h"
28 extern tree memory_identifier_string;
44 tree get_base_var (tree);
H A Doutput.h155 extern void declare_weak (tree);
157 extern void merge_weak (tree, tree);
171 extern void assemble_alias (tree, tree);
173 extern void default_assemble_visibility (tree, int);
177 extern void assemble_asm (tree);
183 extern void assemble_start_function (tree, const char *);
187 extern void assemble_end_function (tree, const char *);
198 extern void assemble_variable (tree, in
[all...]
H A Dtree-vectorizer.h97 tree exit_cond;
100 tree num_iters;
132 VEC(tree,heap) *may_misalign_stmts;
180 tree stmt;
195 tree vectype;
198 tree vectorized_stmt;
220 tree related_stmt;
246 static inline stmt_vec_info vinfo_for_stmt (tree stmt);
256 vinfo_for_stmt (tree stmt)
300 Simple Loop Peeling Utilities - in tree
[all...]
H A Dtree-ssa-threadedge.c26 #include "tree.h"
38 #include "tree-dump.h"
39 #include "tree-flow.h"
42 #include "tree-pass.h"
43 #include "tree-ssa-propagate.h"
83 static tree
84 lhs_of_dominating_assert (tree op, basic_block bb, tree stmt)
87 tree use_stmt;
117 remove_temporary_equivalences (VEC(tree, hea
212 record_temporary_equivalences_from_stmts_at_dest(edge e, VEC(tree, heap) **stack, tree (*simplify) (tree, tree)) argument
354 simplify_control_stmt_condition(edge e, tree stmt, tree dummy_cond, tree (*simplify) (tree, tree), bool handle_dominating_asserts) argument
494 thread_across_edge(tree dummy_cond, edge e, bool handle_dominating_asserts, VEC(tree, heap) **stack, tree (*simplify) (tree, tree)) argument
[all...]
H A Dcgraph.h24 #include "tree.h"
117 tree decl;
172 tree inline_decl;
183 tree call_stmt;
204 tree decl;
238 tree asm_str;
269 tree, gcov_type, int);
270 struct cgraph_node *cgraph_node (tree);
271 struct cgraph_node *cgraph_node_for_asm (tree asmname);
272 struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree);
[all...]
H A Dalias.h27 extern bool component_uses_parent_alias_set (tree);
H A Dtree-ssanames.c25 #include "tree.h"
28 #include "tree-flow.h"
62 VEC(tree,gc) *ssa_names;
66 static GTY (()) tree free_ssanames;
82 ssa_names = VEC_alloc (tree, gc, 50);
91 VEC_quick_push (tree, ssa_names, NULL_TREE);
100 VEC_free (tree, gc, ssa_names);
120 tree
121 make_ssa_name (tree var, tree stm
[all...]
H A Dtree-ssa-alias-warnings.c27 #include "tree.h"
28 #include "tree-dump.h"
29 #include "tree-flow.h"
35 #include "tree-ssa-structalias.h"
36 #include "tree-ssa-propagate.h"
196 /* Get main type of tree TYPE, stripping array dimensions and qualifiers. */
198 static tree
199 get_main_type (tree type)
211 static tree
212 get_otype (tree objec
[all...]
/freebsd-11-stable/contrib/elftoolchain/addr2line/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/gcc/cp/
H A Dsearch.c30 #include "tree.h"
31 #include "cp-tree.h"
38 static int is_subobject_of_p (tree, tree);
39 static tree dfs_lookup_base (tree, void *);
40 static tree dfs_dcast_hint_pre (tree, void *);
41 static tree dfs_dcast_hint_post (tree, voi
1541 dfs_walk_all(tree binfo, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1584 dfs_walk_once_r(tree binfo, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1661 dfs_walk_once(tree binfo, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1706 dfs_walk_once_accessible_r(tree binfo, bool friends_p, bool once, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
1776 dfs_walk_once_accessible(tree binfo, bool friends_p, tree (*pre_fn) (tree, void *), tree (*post_fn) (tree, void *), void *data) argument
[all...]
H A Dinit.c29 #include "tree.h"
32 #include "cp-tree.h"
39 static bool begin_init_stmts (tree *, tree *);
40 static tree finish_init_stmts (bool, tree, tree);
41 static void construct_virtual_base (tree, tree);
42 static void expand_aggr_init_1 (tree, tre
[all...]
H A Drtti.c28 #include "tree.h"
29 #include "cp-tree.h"
69 tree type; /* The RECORD_TYPE for this type_info object */
71 tree vtable; /* The VAR_DECL of the vtable. Only filled at end of
74 tree name; /* IDENTIFIER_NODE for the ABI specified name of
98 VEC(tree,gc) *unemitted_tinfo_decls;
105 static tree build_headof (tree);
106 static tree ifnonnull (tree, tre
[all...]
H A Dexcept.c30 #include "tree.h"
34 #include "cp-tree.h"
39 #include "tree-inline.h"
40 #include "tree-iterator.h"
43 static void push_eh_cleanup (tree);
44 static tree prepare_eh_type (tree);
45 static tree build_eh_type_type (tree);
46 static tree do_begin_catc
[all...]
H A Dclass.c30 #include "tree.h"
31 #include "cp-tree.h"
39 #include "tree-dump.h"
52 tree name;
55 tree type;
59 tree access;
72 tree binfo;
74 tree derived;
77 tree rtti_binfo;
80 tree init
[all...]
H A Dtree.c27 #include "tree.h"
28 #include "cp-tree.h"
35 #include "tree-inline.h"
40 static tree bot_manip (tree *, int *, void *);
41 static tree bot_replace (tree *, int *, void *);
42 static tree build_cplus_array_type_1 (tree, tree);
[all...]
/freebsd-11-stable/contrib/dtc/
H A Dfstree.c31 struct node *tree; local
37 tree = build_node(NULL, NULL);
64 add_property(tree, prop);
72 add_child(tree, newchild);
79 return tree;
84 struct node *tree; local
86 tree = read_fstree(dirname);
87 tree = name_node(tree, "");
89 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpui
[all...]
/freebsd-11-stable/contrib/unbound/util/storage/
H A Ddnstree.h52 * The tree itself is a rbtree_type.
58 /** parent in tree */
74 * The tree itself is a rbtree_type.
80 /** parent in tree */
91 * Init a name tree to be empty
92 * @param tree: to init.
94 void name_tree_init(rbtree_type* tree);
97 * insert element into name tree.
98 * @param tree: name tree
[all...]
/freebsd-11-stable/contrib/unbound/edns-subnet/
H A Daddrtree.c2 * edns-subnet/addrtree.c -- radix tree for edns subnet cache.
36 * addrtree -- radix tree for edns subnet cache.
83 * @param tree: Tree the node lives in.
90 node_create(struct addrtree *tree, void *elem, addrlen_t scope, argument
97 tree->node_count++;
109 * @param tree: tree the node lives in
114 node_size(const struct addrtree *tree, const struct addrnode *n) argument
117 (n->elem?tree->sizefunc(n->elem):0);
124 struct addrtree *tree; local
153 clean_node(struct addrtree *tree, struct addrnode *node) argument
163 lru_pop(struct addrtree *tree, struct addrnode *node) argument
184 lru_push(struct addrtree *tree, struct addrnode *node) argument
199 lru_update(struct addrtree *tree, struct addrnode *node) argument
213 purge_node(struct addrtree *tree, struct addrnode *node) argument
242 lru_cleanup(struct addrtree *tree) argument
270 addrtree_size(const struct addrtree *tree) argument
275 addrtree_delete(struct addrtree *tree) argument
359 addrtree_insert(struct addrtree *tree, const addrkey_t *addr, addrlen_t sourcemask, addrlen_t scope, void *elem, time_t ttl, time_t now) argument
474 addrtree_find(struct addrtree *tree, const addrkey_t *addr, addrlen_t sourcemask, time_t now) argument
[all...]
/freebsd-11-stable/gnu/usr.bin/cc/cc_int/
H A DMakefile21 double-int.o tree-chrec.o tree-scalar-evolution.o tree-data-ref.o \
22 tree-cfg.o tree-dfa.o tree-eh.o tree-ssa.o tree-optimize.o tree-gimple.o \
23 gimplify.o tree
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_disk_private.h38 struct tree;
63 struct tree *tree; member in struct:archive_read_disk
64 int (*open_on_current_dir)(struct tree*, const char *, int);
65 int (*tree_current_dir_fd)(struct tree*);
66 int (*tree_enter_working_dir)(struct tree*);
/freebsd-11-stable/contrib/ldns/ldns/
H A Dradix.h2 * radix.h -- generic radix tree
39 * Radix tree. Implementation taken from NSD 4, adjusted for use in ldns.
67 /** A node in a radix tree */
89 /** An entire radix tree */
93 /** Number of nodes in tree. */
98 * Create a new radix tree.
99 * @return: new radix tree.
105 * Initialize radix tree.
106 * @param tree: uninitialized radix tree
[all...]
/freebsd-11-stable/contrib/gcc/config/i386/
H A Di386-protos.h128 extern int ix86_function_arg_boundary (enum machine_mode, tree);
129 extern int ix86_return_in_memory (tree);
130 extern void ix86_va_start (tree, rtx);
131 extern rtx ix86_va_arg (tree, tree);
161 extern void init_cumulative_args (CUMULATIVE_ARGS *, tree, rtx, tree);
162 extern rtx function_arg (CUMULATIVE_ARGS *, enum machine_mode, tree, int);
164 tree, int);
165 extern rtx ix86_function_value (tree, tre
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_delta/
H A Dcompose_delta.c45 /* A node in the range index tree. */
56 /* 'left' and 'right' link the node into a splay tree. */
218 /* The range index tree. */ member in struct:range_index_t
221 range_index_node_t *tree;
226 /* Create a range index tree. Allocate from POOL. */
231 ndx->tree = NULL;
237 /* Allocate a node for the range index tree. */
253 /* Free a node from the range index tree. */
265 /* Splay the index tree, using OFFSET as the key. */
270 range_index_node_t *tree
267 range_index_node_t *tree = ndx->tree; local
[all...]

Completed in 320 milliseconds

1234567891011>>