/freebsd-11-stable/contrib/gcc/ |
H A D | cfgexpand.c | 25 #include "tree.h" 32 #include "tree-flow.h" 34 #include "tree-dump.h" 35 #include "tree-pass.h" 101 tree decl; 156 get_decl_align_unit (tree decl) 206 add_stack_var (tree decl) 284 aggregate_contains_union_type (tree type) 286 tree field; 321 tree type_ 551 expand_stack_vars(bool (pred) tree)) argument [all...] |
H A D | function.c | 1 /* Expands front end tree to back end RTL for GCC. 25 /* This file handles the generation of rtl code from tree structure 44 #include "tree.h" 65 #include "tree-gimple.h" 66 #include "tree-pass.h" 180 tree type; 204 static void pad_below (struct args_size *, enum machine_mode, tree); 205 static void reorder_blocks_1 (rtx, tree, VEC(tree,heap) **); 206 static int all_blocks (tree, tre [all...] |
H A D | tree-loop-linear.c | 28 #include "tree.h" 34 #include "tree-flow.h" 35 #include "tree-dump.h" 40 #include "tree-chrec.h" 41 #include "tree-data-ref.h" 42 #include "tree-scalar-evolution.h" 43 #include "tree-pass.h" 137 tree stmt = DR_STMT (dr); 146 tree chrec = DR_ACCESS_FN (dr, it); 147 tree tstrid [all...] |
H A D | tree-ssa-copyrename.c | 26 #include "tree.h" 32 #include "tree-flow.h" 33 #include "tree-gimple.h" 34 #include "tree-inline.h" 37 #include "tree-dump.h" 38 #include "tree-ssa-live.h" 39 #include "tree-pass.h" 113 copy_rename_partition_coalesce (var_map map, tree var1, tree var2, FILE *debug) 116 tree root [all...] |
H A D | tree-ssa-loop-prefetch.c | 25 #include "tree.h" 32 #include "tree-flow.h" 33 #include "tree-dump.h" 38 #include "tree-pass.h" 43 #include "tree-chrec.h" 44 #include "tree-scalar-evolution.h" 178 tree base; /* Base of the reference. */ 192 tree stmt; /* Statement in that the reference appears. */ 193 tree mem; /* The reference. */ 233 find_or_create_group (struct mem_ref_group **groups, tree bas [all...] |
H A D | tree-optimize.c | 1 /* Top-level control of tree optimizations. 26 #include "tree.h" 36 #include "tree-flow.h" 37 #include "tree-dump.h" 44 #include "tree-inline.h" 45 #include "tree-mudflap.h" 46 #include "tree-pass.h" 100 because after the tree optimizers have run such cleanups may 130 because after the tree optimizers have run such cleanups may 160 /* Pass: do the actions required to finish with tree [all...] |
H A D | tree-ssa-live.c | 26 #include "tree.h" 32 #include "tree-flow.h" 33 #include "tree-gimple.h" 34 #include "tree-inline.h" 38 #include "tree-dump.h" 39 #include "tree-ssa-live.h" 45 static inline void set_if_valid (var_map, bitmap, tree); 47 tree, basic_block); 48 static inline void register_ssa_partition (var_map, tree, bool); 50 var_map, bitmap, tree); [all...] |
H A D | cgraphunit.c | 26 tree based frontends and the backend (and middle end) 79 This function is responsible for lowering tree nodes not understood by 83 ??? On the tree-ssa genericizing should take place here and we will avoid 118 suitable for it. For tree-ssa we may consider another pass doing 146 #include "tree.h" 148 #include "tree-flow.h" 149 #include "tree-inline.h" 166 #include "tree-gimple.h" 167 #include "tree-pass.h" 173 static tree record_referenc [all...] |
H A D | dwarf2out.c | 41 #include "tree.h" 140 VEC(tree,gc) because we want to tell the garbage collector about 142 static GTY(()) VEC(tree,gc) *incomplete_types; 149 static GTY(()) VEC(tree,gc) *decl_scope_table; 227 tree decl; 450 expand_builtin_init_dwarf_reg_sizes (tree address) 1994 tree label; 3626 static bool dwarf2out_ignore_block (tree); 3627 static void dwarf2out_global_decl (tree); 3628 static void dwarf2out_type_decl (tree, in [all...] |
H A D | xcoffout.c | 31 #include "tree.h" 116 static void xcoffout_block (tree, int, tree); 155 xcoff_assign_fundamental_type_number (tree decl) 339 This function works by walking the tree structure of blocks, 345 xcoffout_block (tree block, int depth, tree args) 386 tree decl = current_function_decl; 410 xcoffout_declare_function (FILE *file, tree decl, const char *name)
|
H A D | tree-ssa-loop-ivcanon.c | 40 #include "tree.h" 47 #include "tree-flow.h" 48 #include "tree-dump.h" 50 #include "tree-pass.h" 52 #include "tree-chrec.h" 53 #include "tree-scalar-evolution.h" 56 #include "tree-inline.h" 73 create_canonical_iv (struct loop *loop, edge exit, tree niter) 76 tree cond, type, var; 158 loop tree [all...] |
/freebsd-11-stable/contrib/gcc/config/ |
H A D | sol2.h | 241 extern GTY(()) tree solaris_pending_aligns; 242 extern GTY(()) tree solaris_pending_inits; 243 extern GTY(()) tree solaris_pending_finis;
|
/freebsd-11-stable/share/misc/ |
H A D | Makefile | 8 FILES= ascii birthtoken bsd-family-tree committers-doc.dot committers-ports.dot \
|
/freebsd-11-stable/sys/mips/atheros/ |
H A D | ar71xx_wdog.c | 104 struct sysctl_oid *tree = device_get_sysctl_tree(sc->dev); local 106 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 109 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 112 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
|
/freebsd-11-stable/contrib/unbound/util/ |
H A D | tcp_conn_limit.h | 60 rbtree_type tree; member in struct:tcl_list 68 /** node in address tree */
|
H A D | edns.h | 61 /** region to allocate tree nodes in */ 69 /** node in address tree, used for tree lookups. Need to be the first 100 * @param tree: tree containing EDNS strings per address prefix. 101 * @param addr: address to use for tree lookup 103 * @return: matching tree node, NULL otherwise 106 edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,
|
/freebsd-11-stable/contrib/libarchive/libarchive/ |
H A D | archive_read_disk_posix.c | 28 /* This is the tree-walking code for POSIX systems. */ 197 struct tree { struct 257 /* Definitions for tree.flags bitmap. */ 266 tree_dir_next_posix(struct tree *t); 275 /* Initiate/terminate a tree traversal. */ 276 static struct tree *tree_open(const char *, int, int); 277 static struct tree *tree_reopen(struct tree *, const char *, int); 278 static void tree_close(struct tree *); 279 static void tree_free(struct tree *); [all...] |
/freebsd-11-stable/contrib/ldns/ldns/ |
H A D | rbtree.h | 2 * rbtree.h -- generic red-black tree 39 * Red black tree. Implementation taken from NSD 3.0.5, adjusted for use 80 /** An entire red black tree */ 82 /** definition for tree struct */ 84 /** The root of the red-black tree */ 87 /** The number of the nodes in the tree */ 98 * Create new tree (malloced) with given key compare function. 100 * @return: new tree, empty. 105 * Free the complete tree (but not its keys) 106 * @param rbtree The tree t [all...] |
/freebsd-11-stable/contrib/gcc/config/s390/ |
H A D | s390-protos.h | 123 tree, int); 125 extern rtx s390_function_arg (CUMULATIVE_ARGS *, enum machine_mode, tree, int); 126 extern rtx s390_function_value (tree, enum machine_mode); 127 extern void s390_va_start (tree, rtx);
|
/freebsd-11-stable/usr.bin/dtc/ |
H A D | checking.cc | 119 checker::visit_node(device_tree *tree, const node_ptr &n) argument 123 if (!check_node(tree, n)) 130 if (!check_property(tree, n, *i)) 139 if (!visit_node(tree, *i)) 166 property_checker::check_property(device_tree *tree, const node_ptr &n, property_ptr p) argument 170 if (!check(tree, n, p)) 241 check_manager::run_checks(device_tree *tree, bool keep_going) argument 246 success &= i.second->check_tree(tree);
|
/freebsd-11-stable/contrib/unbound/iterator/ |
H A D | iter_hints.c | 78 traverse_postorder(&hints->tree, &delhintnode, NULL); 179 if(!name_tree_insert(&hints->tree, &node->node, dp->name, dp->namelen, 434 name_tree_init(&hints->tree); 455 name_tree_init_parents(&hints->tree); 464 stub = (struct iter_hints_stub*)name_tree_find(&hints->tree, 481 r = (struct iter_hints_stub*)name_tree_lookup(&hints->tree, qname, 510 return name_tree_next_root(&hints->tree, qclass); 520 RBTREE_FOR(p, struct iter_hints_stub*, &hints->tree) { 531 if((z=(struct iter_hints_stub*)name_tree_find(&hints->tree, 533 (void)rbtree_delete(&hints->tree, [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/ |
H A D | diff.c | 134 svn_diff__tree_t *tree; local 151 svn_diff__tree_create(&tree, treepool); 156 /* Insert the data into the tree */ 158 tree, 165 tree, 171 num_tokens = svn_diff__get_node_count(tree); 179 /* We don't need the nodes in the tree either anymore, nor the tree itself */
|
/freebsd-11-stable/contrib/dtc/ |
H A D | livetree.c | 357 struct node *tree, uint32_t boot_cpuid_phys) 364 dti->dt = tree; 399 struct property *get_property_by_label(struct node *tree, const char *label, argument 405 *node = tree; 407 for_each_property(tree, prop) { 415 for_each_child(tree, c) { 425 struct marker *get_marker_label(struct node *tree, const char *label, argument 432 *node = tree; 434 for_each_property(tree, p) { 442 for_each_child(tree, 355 build_dt_info(unsigned int dtsflags, struct reserve_info *reservelist, struct node *tree, uint32_t boot_cpuid_phys) argument 464 get_node_by_path(struct node *tree, const char *path) argument 490 get_node_by_label(struct node *tree, const char *label) argument 510 get_node_by_phandle(struct node *tree, cell_t phandle) argument 531 get_node_by_ref(struct node *tree, const char *ref) argument 572 guess_boot_cpuid(struct node *tree) argument [all...] |
H A D | treesource.c | 41 die("Unable to parse input tree\n"); 44 die("Syntax error parsing input tree\n"); 236 static void write_tree_source_node(FILE *f, struct node *tree, int level) argument 243 for_each_label(tree->labels, l) 245 if (tree->name && (*tree->name)) 246 fprintf(f, "%s {\n", tree->name); 250 for_each_property(tree, prop) { 257 for_each_child(tree, child) {
|
/freebsd-11-stable/usr.bin/gzip/ |
H A D | unpack.c | 42 * 06 - Level for the huffman tree (<=24) 45 * tree levels, each level would consume 1 byte (See [1]). 56 * have at most 256 symbols in the huffman tree. pack(1) rejects empty 69 * Represent the huffman tree in a similar way that pack(1) would 77 int treelevels; /* Levels for the huffman tree */ 86 char **tree; /* Decoding huffman tree (pointers to member in struct:__anon8623 87 * first symbol of each tree level */ 109 free(unpackd->tree); 147 * Read file header and construct the tree [all...] |