/freebsd-11-stable/usr.sbin/bsnmpd/bsnmpd/ |
H A D | Makefile | 12 SRCS+= oid.h tree.c tree.h 17 CLEANFILES= oid.h tree.c tree.h 123 DEFS= tree.def 142 oid.h: tree.def Makefile 145 .ORDER: tree.c tree.h 146 tree.h: .NOMETA 147 tree [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-cfgcleanup.c | 26 #include "tree.h" 39 #include "tree-flow.h" 41 #include "tree-dump.h" 42 #include "tree-pass.h" 48 #include "tree-ssa-propagate.h" 49 #include "tree-scalar-evolution.h" 76 tree expr = bsi_stmt (bsi), val; 156 VEC(tree,gc) *modified_noreturn_calls; 166 tree stmt; 169 while (VEC_length (tree, modified_noreturn_call [all...] |
H A D | tree-stdarg.c | 26 #include "tree.h" 31 #include "tree-flow.h" 32 #include "tree-pass.h" 33 #include "tree-stdarg.h" 117 va_list_counter_bump (struct stdarg_info *si, tree counter, tree rhs, 120 tree stmt, lhs, orig_lhs; 251 static tree 252 find_va_list_reference (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, 256 tree va [all...] |
H A D | c-pragma.c | 27 #include "tree.h" 50 tree id; 70 static void push_alignment (int, tree); 71 static void pop_alignment (tree); 75 push_alignment (int alignment, tree id) 98 pop_alignment (tree id) 147 tree x, id = 0; 248 static GTY(()) tree pending_weaks; 251 static void apply_pragma_weak (tree, tree); [all...] |
H A D | coverage.c | 34 #include "tree.h" 45 #include "tree-iterator.h" 100 static GTY(()) tree tree_ctr_tables[GCOV_COUNTERS]; 103 generating counters at tree level. */ 117 static tree build_fn_info_type (unsigned); 118 static tree build_fn_info_value (const struct function_list *, tree); 119 static tree build_ctr_info_type (void); 120 static tree build_ctr_info_value (unsigned, tree); [all...] |
H A D | c-aux-info.c | 2 on information stored in GCC's tree structure. This code implements the 30 #include "tree.h" 31 #include "c-tree.h" 45 static const char *gen_formal_list_for_type (tree, formals_style); 46 static int deserves_ellipsis (tree); 47 static const char *gen_formal_list_for_func_def (tree, formals_style); 48 static const char *gen_type (const char *, tree, formals_style); 49 static const char *gen_decl (tree, int, formals_style); 105 /* Given a tree node which represents some "function type", generate the 113 gen_formal_list_for_type (tree fntyp [all...] |
H A D | ipa-prop.c | 24 #include "tree.h" 30 #include "tree-flow.h" 31 #include "tree-pass.h" 158 /* Return the tree of I-th formal of MT. */ 159 tree 165 /* Create tree map structure for MT. */ 170 XCNEWVEC (tree, ipa_method_formal_count (mt)); 188 /* Return index of the formal whose tree is PTREE in method MT. */ 190 ipa_method_tree_map (struct cgraph_node *mt, tree ptree) 206 tree fndec [all...] |
H A D | stor-layout.c | 28 #include "tree.h" 44 tree sizetype_tab[(int) TYPE_KIND_LAST]; 58 static void finalize_type_size (tree); 59 static void place_union_field (record_layout_info, tree); 62 HOST_WIDE_INT, tree); 69 static GTY(()) tree pending_sizes; 82 tree 85 tree chain = pending_sizes; 94 put_pending_size (tree expr) 108 put_pending_sizes (tree chai [all...] |
H A D | tree-ssa-dse.c | 26 #include "tree.h" 32 #include "tree-flow.h" 33 #include "tree-pass.h" 34 #include "tree-dump.h" 112 get_stmt_uid (tree stmt) 162 static tree 163 memory_ssa_name_same (tree *expr_p, int *walk_subtrees ATTRIBUTE_UNUSED, 167 tree expr = *expr_p; 168 tree def_stmt; 201 memory_address_same (tree store [all...] |
H A D | varasm.c | 36 #include "tree.h" 52 #include "tree-mudflap.h" 78 /* Number of tree-constants deferred during the expansion of this 100 tree last_assemble_variable_decl; 113 static int contains_pointers_p (tree); 115 static bool incorporeal_function_p (tree); 117 static void decode_addr_const (tree, struct addr_const *); 120 static hashval_t const_hash_1 (const tree); 121 static int compare_constant (const tree, const tree); [all...] |
H A D | cfgloop.h | 50 tree bound; /* The constant expression whose value is an upper 52 tree at_stmt; /* ... this statement during one execution of 89 hierarchy tree. */ 112 tree nb_iterations; 116 tree estimated_nb_iterations; 159 /* Pointer to root of loop hierarchy tree. */ 177 /* The loop tree currently optimized. */ 401 extern void record_estimate (struct loop *, tree, tree, tree); [all...] |
H A D | tree-ssa-loop-manip.c | 25 #include "tree.h" 32 #include "tree-flow.h" 33 #include "tree-dump.h" 36 #include "tree-pass.h" 38 #include "tree-scalar-evolution.h" 51 create_iv (tree base, tree step, tree var, struct loop *loop, 53 tree *var_before, tree *var_afte [all...] |
H A D | tree-ssa-math-opts.c | 62 The algorithm constructs a subset of the dominator tree, holding the 71 worst-case, the cost is due to creating the dominator tree subset, 74 of creating the dominator tree subset is O(n_basic_blocks) and the 83 work on just a subset of the dominator tree, as we do now, and the 93 #include "tree.h" 94 #include "tree-flow.h" 97 #include "tree-pass.h" 112 tree recip_def; 116 tree recip_def_stmt; 139 interesting block in the dominator tree [all...] |
H A D | tree-ssa-address.c | 21 /* Utility functions for manipulation with TARGET_MEM_REFs -- tree expressions 28 #include "tree.h" 35 #include "tree-flow.h" 36 #include "tree-dump.h" 37 #include "tree-pass.h" 40 #include "tree-inline.h" 243 tree 244 tree_mem_ref_addr (tree type, tree mem_ref) 246 tree add [all...] |
H A D | ipa-reference.c | 57 #include "tree.h" 58 #include "tree-flow.h" 59 #include "tree-inline.h" 60 #include "tree-pass.h" 67 #include "tree-gimple.h" 75 /* This splay tree contains all of the static variables that are 81 static GTY((param1_is(int), param2_is(tree))) 108 tree memory_identifier_string; 120 get_local_reference_vars_info (tree fn) 135 get_global_reference_vars_info (tree f [all...] |
H A D | tree-ssa-loop-ivopts.c | 69 #include "tree.h" 76 #include "tree-flow.h" 77 #include "tree-dump.h" 82 #include "tree-pass.h" 87 #include "tree-chrec.h" 88 #include "tree-scalar-evolution.h" 104 tree base; /* Initial value of the iv. */ 105 tree base_object; /* A memory object to that the induction variable points. */ 106 tree step; /* Step of the iv (constant only). */ 107 tree ssa_nam [all...] |
/freebsd-11-stable/usr.bin/find/ |
H A D | find.c | 166 FTS *tree; /* pointer to top of FTS hierarchy */ variable 180 tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL)); 181 if (tree == NULL) 185 while (errno = 0, (entry = fts_read(tree)) != NULL) { 187 if (fts_set(tree, entry, FTS_SKIP))
|
/freebsd-11-stable/contrib/unbound/util/ |
H A D | tcp_conn_limit.c | 80 traverse_postorder(&tcl->tree, tcl_list_free_node, NULL); 97 if(!addr_tree_insert(&tcl->tree, &node->node, addr, addrlen, net)) { 147 addr_tree_init(&tcl->tree); 150 addr_tree_init_parents(&tcl->tree); 185 return (struct tcl_addr*)addr_tree_lookup(&tcl->tree,
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/ |
H A D | diff4.c | 174 svn_diff__tree_t *tree; local 199 svn_diff__tree_create(&tree, subpool3); 205 tree, 212 tree, 219 tree, 226 tree, 232 num_tokens = svn_diff__get_node_count(tree); 238 /* We don't need the nodes in the tree either anymore, nor the tree itself */
|
/freebsd-11-stable/gnu/usr.bin/cc/cc_tools/ |
H A D | Makefile | 44 SPLAY_TREE_H= ${GCCLIB}/include/splay-tree.h 55 $(srcdir)/optabs.h $(srcdir)/tree.h $(srcdir)/function.h $(srcdir)/libfuncs.h $(SYMTAB_H) \ 59 $(srcdir)/c-common.h $(srcdir)/c-tree.h $(srcdir)/reload.h \ 63 $(srcdir)/dojump.c $(srcdir)/tree-profile.c \ 70 $(srcdir)/stringpool.c $(srcdir)/tree.c $(srcdir)/varasm.c \ 71 $(srcdir)/tree-mudflap.c $(srcdir)/tree-flow.h \ 73 $(srcdir)/tree-ssanames.c $(srcdir)/tree-eh.c $(srcdir)/tree [all...] |
/freebsd-11-stable/contrib/gcc/config/ |
H A D | sol2-c.c | 25 #include "tree.h" 87 tree t, x; 116 tree decl = identifier_global_value (t); 153 tree t; 171 tree decl = identifier_global_value (t); 174 tree init_list = build_tree_list (get_identifier ("init"), 176 tree attrs = tree_cons (get_identifier ("used"), NULL, init_list); 211 tree t; 229 tree decl = identifier_global_value (t); 232 tree fini_lis [all...] |
/freebsd-11-stable/contrib/dtc/ |
H A D | dtc.c | 44 static void fill_fullpaths(struct node *tree, const char *prefix) argument 49 tree->fullpath = join_path(prefix, tree->name); 51 unit = strchr(tree->name, '@'); 53 tree->basenamelen = unit - tree->name; 55 tree->basenamelen = strlen(tree->name); 57 for_each_child(tree, child) 58 fill_fullpaths(child, tree [all...] |
/freebsd-11-stable/sys/dev/ath/ |
H A D | if_ath_sysctl.c | 783 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 785 struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree); 787 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "alq", CTLFLAG_RD, 789 child = SYSCTL_CHILDREN(tree); 794 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 798 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 802 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 812 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 815 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 818 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUT 1024 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 1042 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 1060 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 1312 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local [all...] |
/freebsd-11-stable/contrib/ldns/ |
H A D | radix.c | 2 * radix.c -- generic radix tree 41 * Implementation of a radix tree. 52 static int ldns_radix_find_prefix(ldns_radix_t* tree, uint8_t* key, 73 static void ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node); 110 * Create a new radix tree. 116 ldns_radix_t* tree; local 119 tree = (ldns_radix_t *) LDNS_MALLOC(ldns_radix_t); 120 if (!tree) { 124 ldns_radix_init(tree); 125 return tree; 134 ldns_radix_init(ldns_radix_t* tree) argument 150 ldns_radix_free(ldns_radix_t* tree) argument 168 ldns_radix_insert(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len, void* data) argument 314 ldns_radix_delete(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len) argument 334 ldns_radix_search(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len) argument 380 ldns_radix_find_less_equal(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len, ldns_radix_node_t** result) argument 480 ldns_radix_first(ldns_radix_t* tree) argument 499 ldns_radix_last(ldns_radix_t* tree) argument 624 ldns_radix_printf(FILE* fd, ldns_radix_t* tree) argument 773 ldns_radix_find_prefix(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len, ldns_radix_node_t** result, radix_strlen_t* respos) argument 1337 ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node) argument [all...] |
/freebsd-11-stable/contrib/unbound/iterator/ |
H A D | iter_fwd.c | 93 if(fwd->tree) 94 traverse_postorder(fwd->tree, &delfwdnode, NULL); 95 free(fwd->tree); 129 if(!rbtree_insert(fwd->tree, &node->node)) { 148 /** initialise parent pointers in the tree */ 154 RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) { 328 fwd->tree = rbtree_create(fwd_cmp); 329 if(!fwd->tree) 350 res = rbtree_search(fwd->tree, &key); 358 /* lookup the forward zone in the tree */ [all...] |