Searched refs:tree (Results 26 - 50 of 741) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/gcc/
H A Dlanghooks.c28 #include "tree.h"
29 #include "tree-inline.h"
30 #include "tree-gimple.h"
47 /* Do nothing (tree). */
50 lhd_do_nothing_t (tree ARG_UNUSED (t))
63 tree
78 /* Do nothing (return the tree node passed). */
80 tree
81 lhd_return_tree (tree t)
88 tree
[all...]
H A Dtarget.h105 void (* unwind_label) (FILE *, tree, int, int);
121 associated with the tree decl. */
122 void (* visibility) (tree, int);
142 void (* named_section) (const char *name, unsigned int flags, tree decl);
154 section *(* select_section) (tree, int, unsigned HOST_WIDE_INT);
163 void (* unique_section) (tree, int);
166 section *(* function_rodata_section) (tree);
179 void (* output_mi_thunk) (FILE *file, tree thunk_decl,
181 tree function_decl);
189 bool (* can_output_mi_thunk) (tree thunk_dec
[all...]
H A Dlanghooks-def.h31 extern HOST_WIDE_INT hook_get_alias_set_0 (tree);
43 extern void lhd_do_nothing_t (tree);
47 extern HOST_WIDE_INT lhd_get_alias_set (tree);
48 extern tree lhd_return_tree (tree);
49 extern tree lhd_return_null_tree_v (void);
50 extern tree lhd_return_null_tree (tree);
51 extern tree lhd_do_nothing_iii_return_null_tree (int, int, int);
52 extern int lhd_safe_from_p (rtx, tree);
[all...]
H A Dtree-nomudflap.c1 /* Mudflap: narrow-pointer bounds-checking by tree rewriting.
27 #include "tree.h"
28 #include "tree-inline.h"
29 #include "c-tree.h"
31 #include "tree-gimple.h"
37 #include "tree-mudflap.h"
38 #include "tree-pass.h"
45 language processors that cannot handle tree-mudflap.c directly.
55 mudflap_enqueue_decl (tree obj ATTRIBUTE_UNUSED)
61 mudflap_enqueue_constant (tree ob
[all...]
H A Ddebug.h59 bool (* ignore_block) (tree);
77 void (* begin_function) (tree decl);
86 void (* function_decl) (tree decl);
90 void (* global_decl) (tree decl);
98 void (* type_decl) (tree decl, int local);
101 void (* imported_module_or_decl) (tree decl, tree context);
105 void (* deferred_inline_function) (tree decl);
110 void (* outlining_inline_function) (tree decl);
140 extern void debug_nothing_tree (tree);
[all...]
H A Dexcept.h74 extern rtx expand_builtin_eh_return_data_regno (tree);
75 extern rtx expand_builtin_extract_return_addr (tree);
76 extern void expand_builtin_init_dwarf_reg_sizes (tree);
77 extern rtx expand_builtin_frob_return_addr (tree);
79 extern void expand_builtin_eh_return (tree, tree);
81 extern rtx expand_builtin_extend_pointer (tree);
84 typedef tree (*duplicate_eh_regions_map) (tree, void *);
94 extern struct eh_region *gen_eh_region_catch (struct eh_region *, tree);
[all...]
H A Dc-semantics.c2 tree codes used in the GNU C and C++ compilers (see c-common.def
29 #include "tree.h"
31 #include "splay-tree.h"
46 #include "tree-inline.h"
47 #include "tree-gimple.h"
50 /* Create an empty statement tree rooted at T. */
52 tree
55 tree t;
62 /* Finish the statement tree rooted at T. */
64 tree
[all...]
H A Dtree-vn.c1 /* Value Numbering routines for tree expressions.
28 #include "tree.h"
29 #include "tree-flow.h"
32 #include "tree-pass.h"
33 #include "tree-dump.h"
46 tree v;
49 tree e;
52 VEC (tree, gc) *vuses;
58 static void set_value_handle (tree e, tree
252 vn_add_with_vuses(tree expr, tree val, VEC (tree, gc) *vuses) argument
291 vn_lookup_with_vuses(tree expr, VEC (tree, gc) *vuses) argument
330 print_creation_to_file(tree v, tree expr, VEC (tree, gc) *vuses) argument
402 vn_lookup_or_add_with_vuses(tree expr, VEC (tree, gc) *vuses) argument
[all...]
H A Dipa-reference.h25 #include "tree.h"
75 bitmap ipa_reference_get_read_local (tree fn);
76 bitmap ipa_reference_get_written_local (tree fn);
77 bitmap ipa_reference_get_read_global (tree fn);
78 bitmap ipa_reference_get_written_global (tree fn);
79 bitmap ipa_reference_get_not_read_global (tree fn);
80 bitmap ipa_reference_get_not_written_global (tree fn);
H A Dtree-vect-patterns.c27 #include "tree.h"
32 #include "tree-flow.h"
33 #include "tree-dump.h"
39 #include "tree-data-ref.h"
40 #include "tree-vectorizer.h"
46 (tree (* ) (tree, tree *, tree *), block_stmt_iterator);
47 static bool widened_name_p (tree, tre
462 vect_pattern_recog_1( tree ( vect_recog_func) tree, tree *, tree *), block_stmt_iterator si) argument
[all...]
H A Dhooks.c96 hook_bool_tree_hwi_hwi_tree_false (tree a ATTRIBUTE_UNUSED,
99 tree d ATTRIBUTE_UNUSED)
105 hook_bool_tree_hwi_hwi_tree_true (tree a ATTRIBUTE_UNUSED,
108 tree d ATTRIBUTE_UNUSED)
129 default_can_output_mi_thunk_no_vcall (tree a ATTRIBUTE_UNUSED,
132 tree d ATTRIBUTE_UNUSED)
138 hook_int_tree_0 (tree a ATTRIBUTE_UNUSED)
145 hook_int_tree_tree_1 (tree a ATTRIBUTE_UNUSED, tree b ATTRIBUTE_UNUSED)
172 hook_void_tree (tree
[all...]
H A Dtree-iterator.h1 /* Iterator routines for manipulating GENERIC and GIMPLE tree statements.
23 /* This file is dependent upon the implementation of tree's. It provides an
24 abstract interface to the tree objects such that if all tree creation and
26 implementation of tree's, and not impact other code. */
35 tree container;
39 tsi_start (tree t)
50 tsi_last (tree t)
84 static inline tree *
90 static inline tree
[all...]
H A Dtree.h1 /* Front-end tree definitions for GNU compiler.
36 /* Codes of tree nodes */
41 #include "tree.def"
52 /* Number of language-independent tree codes. */
75 /* Each tree code class has an associated string representation.
165 /* Returns nonzero iff CLASS is the tree-code class of an
189 /* Number of argument-words in each kind of tree-node. */
194 /* Names of tree components. */
199 DEF_VEC_P(tree); variable
200 DEF_VEC_ALLOC_P(tree,g
[all...]
H A Ddwarf2out.h22 extern void dwarf2out_decl (tree);
/freebsd-11-stable/contrib/gcc/cp/
H A Ddecl.h36 extern tree grokdeclarator (const cp_declarator *,
38 enum decl_context, int, tree*);
42 extern tree grokparms (cp_parameter_declarator *first_parm, tree *parms);
/freebsd-11-stable/crypto/openssl/crypto/x509v3/
H A Dpcy_lib.c70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
72 if (!tree)
74 return tree->nlevel;
77 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, argument
80 if (!tree || (i < 0) || (i >= tree->nlevel))
82 return tree->levels + i;
87 *tree)
89 if (!tree)
91 return tree
[all...]
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h53 * AVL tree implementation uses 3 pointers. The following chart gives the
56 * Operation Link List AVL tree
79 * 1. Create the list/tree with: avl_create()
94 * 2d. Remove individual nodes from the list/tree with avl_remove().
102 * 4. Use avl_destroy() to destroy the AVL tree itself.
118 * Type used for the root of the AVL tree.
123 * The data nodes in the AVL tree must have a field of this type.
128 * An opaque type used to locate a position in the tree where a node
156 * Initialize an AVL tree. Arguments are:
158 * tree
[all...]
/freebsd-11-stable/contrib/elftoolchain/elfdump/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/libdwarf/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/libelftc/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/libpe/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/nm/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/readelf/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/size/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/strings/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.

Completed in 108 milliseconds

1234567891011>>