/freebsd-9.3-release/contrib/gcc/ |
H A D | sdbout.h | 21 extern void sdbout_symbol (tree, int); 22 extern void sdbout_types (tree);
|
H A D | convert.h | 24 extern tree convert_to_integer (tree, tree); 25 extern tree convert_to_pointer (tree, tree); 26 extern tree convert_to_real (tree, tree); 27 extern tree convert_to_comple [all...] |
H A D | tree-gimple.h | 26 #include "tree-iterator.h" 28 extern tree create_tmp_var_raw (tree, const char *); 29 extern tree create_tmp_var_name (const char *); 30 extern tree create_tmp_var (tree, const char *); 31 extern tree get_initialized_tmp_var (tree, tree *, tree *); [all...] |
H A D | tree-mudflap.h | 1 /* Mudflap: narrow-pointer bounds-checking by tree rewriting. 27 extern void mudflap_enqueue_decl (tree); 28 extern void mudflap_enqueue_constant (tree); 32 extern int mf_marked_p (tree); 33 extern tree mf_mark (tree);
|
H A D | langhooks.h | 24 /* This file should be #include-d after tree.h. */ 31 typedef void (*lang_print_tree_hook) (FILE *, tree, int indent); 38 tree (*walk_subtrees) (tree *, int *, 39 tree (*) (tree *, int *, void *), 41 int (*cannot_inline_tree_fn) (tree *); 42 int (*disregard_inline_limits) (tree); 43 tree (*add_pending_fn_decls) (void *, tree); [all...] |
H A D | tree-chrec.h | 38 extern tree chrec_not_analyzed_yet; 39 extern GTY(()) tree chrec_dont_know; 40 extern GTY(()) tree chrec_known; 46 automatically_generated_chrec_p (tree chrec) 53 /* The tree nodes aka. CHRECs. */ 56 tree_is_chrec (tree expr) 69 extern tree chrec_fold_plus (tree, tree, tree); [all...] |
H A D | hooks.h | 33 extern bool hook_bool_tree_false (tree); 34 extern bool hook_bool_tree_true (tree); 35 extern bool hook_bool_tree_hwi_hwi_tree_false (tree, HOST_WIDE_INT, HOST_WIDE_INT, 36 tree); 37 extern bool hook_bool_tree_hwi_hwi_tree_true (tree, HOST_WIDE_INT, HOST_WIDE_INT, 38 tree); 44 extern bool hook_bool_tree_tree_false (tree, tree); 45 extern bool hook_bool_tree_bool_false (tree, bool); 50 extern void hook_void_tree (tree); [all...] |
H A D | stub-objc.c | 27 #include "tree.h" 30 tree 31 objc_is_class_name (tree ARG_UNUSED (arg)) 36 tree 37 objc_is_id (tree ARG_UNUSED (arg)) 42 tree 43 objc_is_object_ptr (tree ARG_UNUSED (arg)) 48 tree 49 objc_lookup_ivar (tree other, tree ARG_UNUSE [all...] |
H A D | tree-scalar-evolution.h | 25 extern tree number_of_iterations_in_loop (struct loop *); 26 extern tree get_loop_exit_condition (struct loop *); 31 extern tree analyze_scalar_evolution (struct loop *, tree); 32 extern tree instantiate_parameters (struct loop *, tree); 37 extern bool simple_iv (struct loop *, tree, tree, affine_iv *, bool);
|
H A D | ipa-type-escape.h | 24 #include "tree.h" 26 bool ipa_type_escape_type_contained_p (tree type); 27 bool ipa_type_escape_field_does_not_clobber_p (tree record_type, tree field_type); 28 int ipa_type_escape_star_count_of_interesting_type (tree type); 29 int ipa_type_escape_star_count_of_interesting_or_array_type (tree type);
|
H A D | tree-flow.h | 29 #include "tree-gimple.h" 30 #include "tree-ssa-operands.h" 63 but are only used by the tree optimizers, so it makes better sense 94 tree name_mem_tag; 116 tree GTY((skip)) value_handle; 150 tree var; 191 tree symbol_mem_tag; 194 VEC(tree, gc) *may_aliases; 200 /* Used by the root-var object in tree-ssa-live.[ch]. */ 205 tree current_de 351 static inline VEC(tree, gc) *may_aliases (tree); variable [all...] |
H A D | tree-inline.h | 26 #include "splay-tree.h" 35 tree src_fn; 38 tree dst_fn; 49 tree retvar; 55 tree (*copy_decl) (tree, struct copy_body_data *); 58 tree block; 95 extern tree copy_body_r (tree *, int *, void *); 96 extern void insert_decl_map (copy_body_data *, tree, tre [all...] |
H A D | c-common.h | 25 #include "splay-tree.h" 124 extern GTY ((length ("(int) RID_MAX"))) tree *ridpointers; 211 extern GTY(()) tree c_global_trees[CTI_MAX]; 214 tree for size reasons. */ 218 tree GTY((length ("%h.len"))) elts[1]; 241 /* Information about a statement tree. */ 245 tree x_cur_stmt_list; 256 tree structure, we use statement-expressions. The statements 271 about the statement-tree that we are building. */ 275 /* When building a statement-tree, thi [all...] |
H A D | tree-ssa-propagate.h | 60 tree value; 70 tree mem_ref; 98 tree min; 99 tree max; 110 typedef enum ssa_prop_result (*ssa_prop_visit_stmt_fn) (tree, edge *, tree *); 111 typedef enum ssa_prop_result (*ssa_prop_visit_phi_fn) (tree); 114 /* In tree-ssa-propagate.c */ 116 tree get_rhs (tree); [all...] |
H A D | c-tree.h | 65 tree enum_min; 66 tree enum_max; 70 tree objc_info; 150 for code generation alongside a tree representing its value. */ 154 tree value; 192 tree spec; 226 tree type; 228 tree decl_attr; 232 tree attrs; 308 tree parm [all...] |
H A D | dbxout.h | 25 extern int dbxout_symbol (tree, int); 26 extern void dbxout_parms (tree); 27 extern void dbxout_reg_parms (tree); 28 extern int dbxout_syms (tree);
|
H A D | targhooks.h | 26 extern bool default_return_in_memory (tree, tree); 29 extern void default_setup_incoming_varargs (CUMULATIVE_ARGS *, enum machine_mode, tree, int *, int); 39 extern tree default_stack_protect_guard (void); 40 extern tree default_external_stack_protect_fail (void); 41 extern tree default_hidden_stack_protect_fail (void); 43 extern tree default_cxx_guard_type (void); 44 extern tree default_cxx_get_cookie_size (tree); 47 (CUMULATIVE_ARGS *, enum machine_mode mode, tree, boo [all...] |
/freebsd-9.3-release/contrib/gcc/config/ |
H A D | sol2-protos.h | 22 extern void solaris_insert_attributes (tree, tree *); 24 extern void solaris_output_init_fini (FILE *, tree);
|
H A D | darwin-protos.h | 48 extern void darwin_encode_section_info (tree, rtx, int); 49 extern void darwin_set_default_type_attributes (tree); 56 extern section *machopic_select_section (tree, int, unsigned HOST_WIDE_INT); 60 extern void darwin_unique_section (tree decl, int reloc); 61 extern void darwin_asm_named_section (const char *, unsigned int, tree); 64 extern void darwin_emit_unwind_label (FILE *, tree, int, int); 77 extern tree darwin_handle_kext_attribute (tree *, tree, tree, in [all...] |
/freebsd-9.3-release/contrib/libarchive/tar/ |
H A D | tree.h | 48 struct tree; 50 /* Initiate/terminate a tree traversal. */ 51 struct tree *tree_open(const char * /* pathname */); 52 void tree_close(struct tree *); 78 int tree_next(struct tree *); 81 int tree_errno(struct tree *); 90 void tree_descend(struct tree *); 97 int tree_current_depth(struct tree *); 101 * that can be used to access the file. Because tree does use chdir 118 const char *tree_current_path(struct tree *); [all...] |
/freebsd-9.3-release/contrib/gcc/cp/ |
H A D | name-lookup.h | 38 tree name; 39 tree type; 50 extern binding_entry binding_table_find (binding_table, tree); 73 tree value; 75 tree type; 87 tree identifier; 90 tree real_type_value; 96 extern tree identifier_type_value (tree); 97 extern void set_identifier_type_value (tree, tre [all...] |
H A D | cp-tree.h | 29 #include "splay-tree.h" 165 /* Language-specific tree checkers. */ 181 ({ const tree __t = (NODE); \ 188 ({ const tree __t = (NODE); \ 206 tree class_template_info; 207 tree label_value; 225 tree decl; 232 tree decl; 244 tree member; 296 /* Nonzero if we are presently building a statement tree, rathe [all...] |
/freebsd-9.3-release/contrib/gcc/config/i386/ |
H A D | winnt-stubs.c | 31 #include "tree.h" 38 i386_pe_type_dllimport_p (tree decl ATTRIBUTE_UNUSED) 45 i386_pe_type_dllexport_p (tree decl ATTRIBUTE_UNUSED) 52 i386_pe_adjust_class_at_definition (tree t ATTRIBUTE_UNUSED)
|
/freebsd-9.3-release/contrib/ncurses/ncurses/trace/ |
H A D | trace_tries.c | 45 recur_tries(TRIES * tree, unsigned level) argument 52 while (tree != 0) { 53 if ((my_buffer[level] = tree->ch) == 0) 56 if (tree->value != 0) { 57 _tracef("%5d: %s (%s)", tree->value, 58 _nc_visbuf((char *) my_buffer), keyname(tree->value)); 60 if (tree->child) 61 recur_tries(tree->child, level + 1); 62 tree = tree 67 _nc_trace_tries(TRIES * tree) argument [all...] |
/freebsd-9.3-release/contrib/ncurses/ncurses/base/ |
H A D | tries.c | 36 ** Functions to manage the tree of partial-completions for keycodes. 49 _nc_expand_try(TRIES * tree, unsigned code, int *count, size_t len) argument 51 TRIES *ptr = tree; 84 * Remove a code from the specified tree, freeing the unused nodes. Returns 88 _nc_remove_key(TRIES ** tree, unsigned code) argument 90 T((T_CALLED("_nc_remove_key(%p,%d)"), tree, code)); 95 while (*tree != 0) { 96 if (_nc_remove_key(&(*tree)->child, code)) { 99 if ((*tree)->value == code) { 100 if ((*tree) 120 _nc_remove_string(TRIES ** tree, const char *string) argument [all...] |