/freebsd-11-stable/contrib/gcc/cp/ |
H A D | lex.c | 31 #include "tree.h" 32 #include "cp-tree.h" 44 static tree parse_strconst_pragma (const char *, int); 52 static void copy_lang_type (tree); 92 /* A mapping from tree codes to operator name information. */ 107 tree identifier; 315 tree id; 320 ridpointers = GGC_CNEWVEC (tree, (int) RID_MAX); 461 static tree 464 tree resul [all...] |
H A D | error.c | 26 #include "tree.h" 27 #include "cp-tree.h" 45 static const char *args_to_string (tree, int); 48 static const char *cv_to_string (tree, int); 49 static const char *decl_to_string (tree, int); 50 static const char *expr_to_string (tree); 51 static const char *fndecl_to_string (tree, int); 54 static const char *type_to_string (tree, int); 56 static void dump_type (tree, int); 57 static void dump_typename (tree, in [all...] |
H A D | cxx-pretty-print.c | 28 #include "cp-tree.h" 31 static void pp_cxx_unqualified_id (cxx_pretty_printer *, tree); 32 static void pp_cxx_nested_name_specifier (cxx_pretty_printer *, tree); 33 static void pp_cxx_qualified_id (cxx_pretty_printer *, tree); 34 static void pp_cxx_assignment_expression (cxx_pretty_printer *, tree); 35 static void pp_cxx_expression (cxx_pretty_printer *, tree); 36 static void pp_cxx_template_argument_list (cxx_pretty_printer *, tree); 37 static void pp_cxx_type_specifier_seq (cxx_pretty_printer *, tree); 38 static void pp_cxx_ptr_operator (cxx_pretty_printer *, tree); 39 static void pp_cxx_type_id (cxx_pretty_printer *, tree); [all...] |
H A D | cp-lang.c | 26 #include "tree.h" 27 #include "cp-tree.h" 64 #include "tree.def" 68 #include "cp-tree.def" 72 /* Table indexed by tree code giving number of expression 79 #include "tree.def" 83 #include "cp-tree.def" 87 /* Names of tree components. 88 Used for printing out the tree and error messages. */ 92 #include "tree [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | function.h | 25 #include "tree.h" 196 tree decl; 281 tree static_chain_decl; 286 tree nonlocal_goto_save_area; 351 VEC(tree,gc) *ib_boundaries_block; 354 tree unexpanded_var_list; 372 tree stack_protect_guard; 533 struct function *find_function_data (tree); 540 extern void number_blocks (tree); 542 extern void clear_block_marks (tree); [all...] |
H A D | tree-complex.c | 25 #include "tree.h" 29 #include "tree-flow.h" 30 #include "tree-gimple.h" 31 #include "tree-iterator.h" 32 #include "tree-pass.h" 33 #include "tree-ssa-propagate.h" 61 static VEC(tree, heap) *complex_ssa_name_components; 64 associated tree. */ 65 static tree 77 cvc_insert (unsigned int uid, tree t [all...] |
H A D | value-prof.c | 37 #include "tree-flow.h" 38 #include "tree-flow-inline.h" 41 #include "tree.h" 44 #include "tree-pass.h" 74 static tree tree_divmod_fixed_value (tree, tree, tree, tree, 75 tree, in [all...] |
H A D | c-typeck.c | 34 #include "tree.h" 36 #include "c-tree.h" 45 #include "tree-iterator.h" 46 #include "tree-gimple.h" 47 #include "tree-flow.h" 79 static bool types_are_block_compatible (tree lhptee, tree rhptee); 80 static tree build_block_call (tree, tree, tre [all...] |
H A D | tree-into-ssa.c | 26 #include "tree.h" 38 #include "tree-flow.h" 39 #include "tree-gimple.h" 40 #include "tree-inline.h" 44 #include "tree-dump.h" 45 #include "tree-pass.h" 66 tree var; 105 static VEC(tree,heap) *block_defs_stack; 127 typedef VEC(tree, heap) *tree_vec; 147 tree nam [all...] |
H A D | tree-tailcall.c | 25 #include "tree.h" 31 #include "tree-flow.h" 32 #include "tree-dump.h" 35 #include "tree-pass.h" 114 tree mult, add; 122 static tree m_acc, a_acc; 136 tree var; 163 tree param; 199 static tree 200 independent_of_stmt_p (tree exp [all...] |
H A D | tree-outof-ssa.c | 26 #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-ssa-live.h" 47 #include "tree-pass.h" 83 VEC(tree,heap) *nodes; 101 VEC(tree,heap) *const_copies; 106 static tree create_tem [all...] |
H A D | tree-ssa-loop-niter.c | 25 #include "tree.h" 33 #include "tree-flow.h" 34 #include "tree-dump.h" 36 #include "tree-pass.h" 38 #include "tree-chrec.h" 39 #include "tree-scalar-evolution.h" 40 #include "tree-data-ref.h" 44 #include "tree-inline.h" 59 zero_p (tree arg) 74 nonzero_p (tree ar [all...] |
H A D | tree-ssa-reassoc.c | 28 #include "tree.h" 31 #include "tree-inline.h" 32 #include "tree-flow.h" 33 #include "tree-gimple.h" 34 #include "tree-dump.h" 36 #include "tree-iterator.h" 37 #include "tree-pass.h" 76 tree from the leaves to the roots, merging as you go, and putting the 173 tree op; 191 find_operand_rank (tree [all...] |
H A D | tree-nested.c | 25 #include "tree.h" 29 #include "tree-dump.h" 30 #include "tree-inline.h" 31 #include "tree-gimple.h" 32 #include "tree-iterator.h" 33 #include "tree-flow.h" 82 tree old; 83 tree new; 96 tree context; 97 tree new_local_var_chai [all...] |
H A D | tree-object-size.c | 26 #include "tree.h" 28 #include "tree-flow.h" 29 #include "tree-pass.h" 30 #include "tree-ssa-propagate.h" 44 static tree compute_object_offset (tree, tree); 45 static unsigned HOST_WIDE_INT addr_object_size (tree, int); 46 static unsigned HOST_WIDE_INT alloc_object_size (tree, int); 47 static tree pass_through_cal [all...] |
H A D | tree-ssa-sink.c | 27 #include "tree.h" 30 #include "tree-inline.h" 31 #include "tree-flow.h" 32 #include "tree-gimple.h" 33 #include "tree-dump.h" 37 #include "tree-iterator.h" 40 #include "tree-pass.h" 86 find_bb_for_arg (tree phi, tree def) 111 all_immediate_uses_same_place (tree stm [all...] |
H A D | emit-rtl.h | 31 extern void set_mem_expr (rtx, tree);
|
H A D | tree-iterator.c | 1 /* Iterator routines for manipulating GENERIC and GIMPLE tree statements. 25 #include "tree.h" 26 #include "tree-gimple.h" 27 #include "tree-iterator.h" 34 static GTY ((deletable (""))) tree stmt_list_cache; 36 tree 39 tree list = stmt_list_cache; 54 free_stmt_list (tree t) 68 tsi_link_before (tree_stmt_iterator *i, tree t, enum tsi_iterator_update mode) 144 tsi_link_after (tree_stmt_iterator *i, tree [all...] |
H A D | c-convert.c | 32 #include "tree.h" 36 #include "c-tree.h" 56 In tree.c: get_narrower and get_unwidened. */ 70 tree 71 convert (tree type, tree expr) 73 tree e = expr;
|
/freebsd-11-stable/contrib/gcc/config/sparc/ |
H A D | sparc-protos.h | 28 extern struct rtx_def *function_value (tree, enum machine_mode, int); 30 enum machine_mode, tree, int); 32 enum machine_mode, tree, int, int); 34 extern void init_cumulative_args (CUMULATIVE_ARGS *, tree, rtx, tree); 35 extern void sparc_va_start (tree, rtx); 37 extern unsigned long sparc_type_code (tree); 40 extern enum direction function_arg_padding (enum machine_mode, tree);
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | prefix_string.c | 1 /* prefix_string.c --- implement strings based on a prefix tree 26 /* A node in the tree represents a common prefix. The root node is the 30 * The nodes in the tree store only up to 8 chars of the respective common 34 * Strings are the leaf nodes in the tree and use a specialized, smaller 45 /* String type and tree leaf. 54 * NUL-terminated, if this is indeed a tree leaf. We use the same struct 55 * within node_t for inner tree nodes, too. There, DATA[7] is not NUL, 61 /* A node inside the tree, i.e. not a string and not a leaf (unless this is 87 /* The actual tree structure. */ 90 /* the common tree roo 115 auto_realloc_sub_nodes(svn_prefix_tree__t *tree, node_t *node) argument 164 svn_prefix_tree__t *tree = apr_pcalloc(pool, sizeof(*tree)); local 174 svn_prefix_string__create(svn_prefix_tree__t *tree, const char *s) argument [all...] |
/freebsd-11-stable/usr.bin/dtc/ |
H A D | checking.hh | 47 * Base class for all checkers. This will visit the entire tree and perform 51 * tree. 70 bool visit_node(device_tree *tree, const node_ptr &n); 104 * Runs the checker on the specified device tree. 106 bool check_tree(fdt::device_tree *tree) argument 108 return visit_node(tree, tree->get_root()); 129 virtual bool check_property(device_tree *tree, const node_ptr &n, property_ptr p); 139 virtual bool check(device_tree *tree, const node_ptr &n, property_ptr p) = 0; 154 virtual bool check(device_tree *tree, cons 218 check(device_tree *tree, const node_ptr &, property_ptr p) argument [all...] |
/freebsd-11-stable/contrib/gcc/config/rs6000/ |
H A D | rs6000-protos.h | 31 extern void init_cumulative_args (CUMULATIVE_ARGS *, tree, rtx, int, int, int); 32 extern void rs6000_va_start (tree, rtx); 115 extern unsigned int rs6000_special_round_type_align (tree, unsigned int, 118 tree, int, int); 119 extern int function_arg_boundary (enum machine_mode, tree); 120 extern rtx function_arg (CUMULATIVE_ARGS *, enum machine_mode, tree, int); 121 extern tree altivec_resolve_overloaded_builtin (tree, tree); 122 extern rtx rs6000_function_value (tree, tre [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
H A D | trees.c | 14 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/freebsd-11-stable/gnu/usr.bin/grep/ |
H A D | kwset.c | 51 /* Balanced tree of edges and labels leaving a given trie node. */ 52 struct tree struct 54 struct tree *llink; /* Left link; MUST be first field. */ 55 struct tree *rlink; /* Right link (to larger labels). */ 65 struct tree *links; /* Tree of edges leaving this node. */ 132 register struct tree *link; 134 struct tree *links[12]; 136 struct tree *t, *r, *l, *rl, *lr; 148 /* Descend the tree of outgoing links for this trie node, 152 links[0] = (struct tree *) 284 enqueue(struct tree *tree, struct trie **last) argument 297 treefails(register struct tree const *tree, struct trie const *fail, struct trie *recourse) argument 332 treedelta(register struct tree const *tree, register unsigned int depth, unsigned char delta[]) argument 365 treenext(struct tree const *tree, struct trie *next[]) argument 592 register struct tree const *tree; local [all...] |