Searched refs:tree (Results 76 - 100 of 741) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/gcc/
H A Dc-common.c27 #include "tree.h"
42 #include "tree-inline.h"
43 #include "c-tree.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
105 tree short_integer_type_node;
106 tree long_integer_type_node;
107 tree long_long_integer_type_node;
109 tree short_unsigned_type_node;
110 tree long_unsigned_type_nod
[all...]
H A Dintegrate.h36 extern bool function_attribute_inlinable_p (tree);
H A Dc-dump.c26 #include "tree.h"
27 #include "c-tree.h"
28 #include "tree-dump.h"
33 dump_stmt (dump_info_p di, tree t)
39 /* Dump any C-specific tree codes and attributes of common codes. */
42 c_dump_tree (void *dump_info, tree t)
H A Dc-gimplify.c1 /* Tree lowering pass. This pass gimplifies the tree representation built
31 #include "tree.h"
33 #include "c-tree.h"
35 #include "tree-gimple.h"
38 #include "tree-flow.h"
39 #include "tree-inline.h"
46 #include "tree-dump.h"
74 /* Convert the tree representation of FNDECL from C frontend trees to
78 c_genericize (tree fndecl)
84 /* Dump the C-specific tree I
[all...]
H A Ddebug.c64 debug_nothing_tree (tree decl ATTRIBUTE_UNUSED)
69 debug_nothing_tree_tree (tree t1 ATTRIBUTE_UNUSED,
70 tree t2 ATTRIBUTE_UNUSED)
75 debug_true_tree (tree block ATTRIBUTE_UNUSED)
108 debug_nothing_tree_int (tree decl ATTRIBUTE_UNUSED,
H A Dc-pretty-print.h25 #include "tree.h"
42 typedef void (*c_pretty_print_fn) (c_pretty_printer *, tree);
45 a tree that represents a C construct. Any pretty-printer for a
176 void pp_c_space_for_pointer_operator (c_pretty_printer *, tree);
179 void pp_c_tree_decl_identifier (c_pretty_printer *, tree);
180 void pp_c_function_definition (c_pretty_printer *, tree);
181 void pp_c_attributes (c_pretty_printer *, tree);
182 void pp_c_type_qualifier_list (c_pretty_printer *, tree);
183 void pp_c_parameter_type_list (c_pretty_printer *, tree);
184 void pp_c_declaration (c_pretty_printer *, tree);
[all...]
H A Dc-objc-common.c25 #include "tree.h"
29 #include "c-tree.h"
35 #include "tree-inline.h"
39 #include "tree-mudflap.h"
47 c_missing_noreturn_ok_p (tree decl)
59 c_disregard_inline_limits (tree fn)
69 c_cannot_inline_tree_fn (tree *fnp)
71 tree fn = *fnp;
114 c_warn_unused_global_decl (tree decl)
167 tree
[all...]
H A Dtree-vect-transform.c27 #include "tree.h"
32 #include "tree-flow.h"
33 #include "tree-dump.h"
39 #include "tree-data-ref.h"
40 #include "tree-chrec.h"
41 #include "tree-scalar-evolution.h"
42 #include "tree-vectorizer.h"
44 #include "tree-pass.h"
49 static bool vect_transform_stmt (tree, block_stmt_iterator *);
50 static void vect_align_data_ref (tree);
[all...]
H A Dtree-ssa-operands.c25 #include "tree.h"
29 #include "tree-flow.h"
30 #include "tree-inline.h"
31 #include "tree-pass.h"
44 operands are represented as pointers into the stmt's operand tree. Thus
45 any manipulation of the real operands will be reflected in the actual tree.
47 variable for the SSA_NAME may, or may not occur in the stmt's tree.
48 Manipulation of the virtual operands will not be reflected in the stmt tree.
51 from a stmt tree.
53 The operand tree i
[all...]
H A Dtree-vect-generic.c24 #include "tree.h"
33 #include "tree-flow.h"
34 #include "tree-gimple.h"
35 #include "tree-iterator.h"
36 #include "tree-pass.h"
43 static tree
44 build_replicated_const (tree type, tree inner_type, HOST_WIDE_INT value)
49 tree ret;
74 static GTY(()) tree vector_inner_typ
[all...]
H A Dtree-chrec.c32 #include "tree.h"
36 #include "tree-flow.h"
37 #include "tree-chrec.h"
38 #include "tree-pass.h"
40 #include "tree-scalar-evolution.h"
50 is_not_constant_evolution (tree cst)
57 static inline tree
59 tree type,
60 tree poly,
61 tree cs
[all...]
H A Dexpr.h34 #include "tree.h"
94 as the sum of a tree-expression and a constant. This structure is
101 tree var;
126 /* Add the value of the tree INC to the `struct args_size' TO. */
130 tree inc = (INC); \
142 tree dec = (DEC); \
153 /* Convert the implicit sum in a `struct args_size' into a tree
342 extern rtx expand_builtin (tree, rtx, rtx, enum machine_mode, int);
343 extern tree std_build_builtin_va_list (void);
344 extern void std_expand_builtin_va_start (tree, rt
[all...]
H A Dtoplev.h70 extern void rest_of_decl_compilation (tree, int, int);
71 extern void rest_of_type_compilation (tree, int);
72 extern void tree_rest_of_compilation (tree);
77 extern void announce_function (tree);
81 extern void warn_deprecated_use (tree);
83 extern void error_unavailable_use (tree);
97 extern void wrapup_global_declaration_1 (tree);
98 extern bool wrapup_global_declaration_2 (tree);
99 extern bool wrapup_global_declarations (tree *, int);
100 extern void check_global_declaration_1 (tree);
[all...]
H A Dtree-gimple.c28 #include "tree.h"
29 #include "tree-gimple.h"
30 #include "tree-flow.h"
36 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
43 is_gimple_formal_tmp_rhs (tree t)
88 is_gimple_reg_rhs (tree t)
111 is_gimple_mem_rhs (tree t)
129 rhs_predicate_for (tree lhs)
142 is_gimple_lvalue (tree t)
154 is_gimple_condexpr (tree
[all...]
/freebsd-11-stable/contrib/gcc/cp/
H A Dexpr.c1 /* Convert language-specific tree expression to rtl instructions,
29 #include "tree.h"
32 #include "cp-tree.h"
40 tree
41 cplus_expand_constant (tree cst)
47 tree type = TREE_TYPE (cst);
48 tree member;
71 tree delta;
72 tree pfn;
88 /* Hook used by expand_expr to expand language-specific tree code
[all...]
H A Dsemantics.c2 building tree structure, checking semantic consistency, and
32 #include "tree.h"
33 #include "cp-tree.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
47 #include "tree-iterator.h"
56 static tree maybe_convert_cond (tree);
57 static tree simplify_aggr_init_exprs_r (tree *, in
[all...]
H A Dcp-objcp-common.c26 #include "tree.h"
27 #include "cp-tree.h"
40 cxx_get_alias_set (tree t)
57 cxx_warn_unused_global_decl (tree decl)
75 tree
76 cp_expr_size (tree exp)
78 tree type = TREE_TYPE (exp);
135 language-independent logic in tree.c. */
138 cp_var_mod_type_p (tree type, tree f
[all...]
H A Dcvt.c33 #include "tree.h"
35 #include "cp-tree.h"
41 static tree cp_convert_to_pointer (tree, tree, bool);
42 static tree convert_to_pointer_force (tree, tree);
43 static tree build_type_conversion (tree, tre
[all...]
H A Dmethod.c30 #include "tree.h"
31 #include "cp-tree.h"
39 #include "tree-pass.h"
60 static tree thunk_adjust (tree, bool, HOST_WIDE_INT, tree);
61 static void do_build_assign_ref (tree);
62 static void do_build_copy_constructor (tree);
63 static tree synthesize_exception_spec (tree, tre
826 synthesize_exception_spec(tree type, tree (*extractor) (tree, void*), void *client) argument
[all...]
H A Dmangle.c53 #include "tree.h"
55 #include "cp-tree.h"
98 VEC(tree,gc) *substitutions;
101 tree GTY ((skip)) entity;
144 static GTY(()) tree subst_identifiers[SUBID_MAX];
164 static int decl_is_template_id (const tree, tree* const);
168 static inline tree canonicalize_for_substitution (tree);
169 static void add_substitution (tree);
[all...]
/freebsd-11-stable/share/man/man3/
H A DMakefile24 tree.3
167 MLINKS+= tree.3 RB_EMPTY.3 \
168 tree.3 RB_ENTRY.3 \
169 tree.3 RB_FIND.3 \
170 tree.3 RB_FOREACH.3 \
171 tree.3 RB_FOREACH_REVERSE.3 \
172 tree.3 RB_GENERATE.3 \
173 tree.3 RB_GENERATE_STATIC.3 \
174 tree.3 RB_HEAD.3 \
175 tree
[all...]
/freebsd-11-stable/crypto/openssl/crypto/x509v3/
H A Dpcy_tree.c67 * Enable this to print out the complete policy tree at various point during
98 static void tree_print(char *str, X509_POLICY_TREE *tree, argument
107 curr = tree->levels + tree->nlevel;
111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
112 for (plev = tree->levels; plev != curr; plev++) {
114 plev - tree->levels, plev->flags);
135 * Initialize policy tree. Return values:
139 * 2 Policy tree is empty.
147 X509_POLICY_TREE *tree; local
366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
428 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
488 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
561 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument
604 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument
663 tree_evaluate(X509_POLICY_TREE *tree) argument
693 X509_policy_tree_free(X509_POLICY_TREE *tree) argument
736 X509_POLICY_TREE *tree = NULL; local
[all...]
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c32 * AVL - generic AVL tree implementation for kernel use
36 * Here is a very brief overview. An AVL tree is a binary search tree that is
41 * This relaxation from a perfectly balanced binary tree allows doing
42 * insertion and deletion relatively efficiently. Searching the tree is
45 * The key to insertion and deletion is a set of tree manipulations called
63 * there is no recursion stack present to move "up" in the tree,
85 * allows using half as much code (and hence cache footprint) for tree
89 * adjacent to where a new value would be inserted in the tree. The value
110 * Code that deals with binary tree dat
136 avl_walk(avl_tree_t *tree, void *oldnode, int left) argument
183 avl_first(avl_tree_t *tree) argument
202 avl_last(avl_tree_t *tree) argument
226 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction) argument
255 avl_find(avl_tree_t *tree, const void *value, avl_index_t *where) argument
303 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) argument
482 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where) argument
572 avl_insert_here( avl_tree_t *tree, void *new_data, void *here, int direction) argument
632 avl_add(avl_tree_t *tree, void *new_node) argument
678 avl_remove(avl_tree_t *tree, void *data) argument
903 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), size_t size, size_t offset) argument
926 avl_destroy(avl_tree_t *tree) argument
938 avl_numnodes(avl_tree_t *tree) argument
945 avl_is_empty(avl_tree_t *tree) argument
973 avl_destroy_nodes(avl_tree_t *tree, void **cookie) argument
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/
H A Dtoken.c62 * Returns number of tokens in a tree
65 svn_diff__get_node_count(svn_diff__tree_t *tree) argument
67 return tree->node_count;
71 * Support functions to build a tree of token positions
75 svn_diff__tree_create(svn_diff__tree_t **tree, apr_pool_t *pool) argument
77 *tree = apr_pcalloc(pool, sizeof(**tree));
78 (*tree)->pool = pool;
79 (*tree)->node_count = 0;
84 tree_insert_token(svn_diff__node_t **node, svn_diff__tree_t *tree, argument
150 svn_diff__get_tokens(svn_diff__position_t **position_list, svn_diff__tree_t *tree, void *diff_baton, const svn_diff_fns2_t *vtable, svn_diff_datasource_e datasource, apr_off_t prefix_lines, apr_pool_t *pool) argument
[all...]
/freebsd-11-stable/contrib/gcc/config/
H A Dsol2.c25 #include "tree.h"
32 tree solaris_pending_aligns, solaris_pending_inits, solaris_pending_finis;
41 solaris_insert_attributes (tree decl, tree *attributes)
43 tree *x, next;
48 tree name = TREE_PURPOSE (*x);
49 tree value = TREE_VALUE (*x);
69 tree name = TREE_PURPOSE (*x);
86 tree name = TREE_PURPOSE (*x);
104 solaris_output_init_fini (FILE *file, tree dec
[all...]

Completed in 168 milliseconds

1234567891011>>