Searched refs:tree (Results 301 - 325 of 741) sorted by relevance

<<11121314151617181920>>

/freebsd-11-stable/contrib/gcc/
H A Dxcoffout.h184 extern int xcoff_assign_fundamental_type_number (tree);
185 extern void xcoffout_declare_function (FILE *, tree, const char *);
H A Ddojump.c1 /* Convert tree expression to rtl instructions, for GNU compiler.
27 #include "tree.h"
39 static void do_jump_by_parts_greater (tree, int, rtx, rtx);
40 static void do_jump_by_parts_equality (tree, rtx, rtx);
41 static void do_compare_and_jump (tree, enum rtx_code, enum rtx_code, rtx,
100 jumpifnot (tree exp, rtx label)
108 jumpif (tree exp, rtx label)
162 do_jump (tree exp, rtx if_false_label, rtx if_true_label)
167 tree type;
218 tree exp
[all...]
H A Dcfglayout.c25 #include "tree.h"
39 #include "tree-pass.h"
50 static void set_block_levels (tree, int);
51 static void change_scope (rtx, tree, tree);
55 static tree insn_scope (rtx);
236 static GTY(()) VEC(tree,gc) *block_locators_blocks;
251 tree block = NULL;
252 tree last_block = NULL;
261 block_locators_blocks = VEC_alloc (tree, g
[all...]
H A Dcgraph.c32 contrast to tree DECL nodes where we can have multiple nodes for each
86 #include "tree.h"
87 #include "tree-inline.h"
100 #include "tree-gimple.h"
101 #include "tree-dump.h"
199 cgraph_node (tree decl)
249 decl_assembler_name_equal (tree decl, tree asmname)
251 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
285 cgraph_node_for_asm (tree asmnam
[all...]
H A Dexcept.c55 #include "tree.h"
78 #include "tree-pass.h"
90 tree (*lang_protect_cleanup_actions) (void);
93 int (*lang_eh_type_covers) (tree a, tree b);
96 tree (*lang_eh_runtime_type) (tree);
111 static GTY(()) tree sjlj_fc_type_node;
162 tree type_list;
163 tree filter_lis
[all...]
H A Dc-cppbuiltin.c26 #include "tree.h"
55 static void builtin_define_with_hex_fp_value (const char *, tree,
60 static void builtin_define_type_max (const char *, tree, int);
61 static void builtin_define_type_precision (const char *, tree);
65 tree);
70 builtin_define_type_precision (const char *name, tree type)
81 tree type)
275 tree type)
692 tree type ATTRIBUTE_UNUSED, int digits,
727 builtin_define_type_max (const char *macro, tree typ
[all...]
H A Dalias.c28 #include "tree.h"
40 #include "splay-tree.h"
47 #include "tree-pass.h"
110 and vice versa.) We indicate this via a tree structure that looks
160 static tree find_base_decl (tree);
165 static bool nonoverlapping_component_refs_p (tree, tree);
166 static tree decl_for_component_ref (tree);
[all...]
H A Dpredict.c36 #include "tree.h"
56 #include "tree-flow.h"
58 #include "tree-dump.h"
59 #include "tree-pass.h"
61 #include "tree-scalar-evolution.h"
632 RTL otherwise use tree based approach. */
686 tree niter = NULL;
902 static tree
903 expr_expected_value (tree expr, bitmap visited)
909 tree de
[all...]
H A Dtree-ssa-loop-ch.c25 #include "tree.h"
32 #include "tree-flow.h"
33 #include "tree-dump.h"
34 #include "tree-pass.h"
37 #include "tree-inline.h"
39 #include "tree-inline.h"
55 tree last;
103 tree stmt = last_stmt (loop->latch);
220 tree last;
H A Dc-format.h115 tree *type;
243 tree *width_type;
246 tree *precision_type;
/freebsd-11-stable/share/mk/
H A Dbsd.port.subdir.mk4 # Autodetect if the command is being run in a ports tree that's not rooted
/freebsd-11-stable/contrib/dtc/
H A Ddtc.h214 struct property *get_property_by_label(struct node *tree, const char *label,
216 struct marker *get_marker_label(struct node *tree, const char *label,
219 struct node *get_node_by_path(struct node *tree, const char *path);
220 struct node *get_node_by_label(struct node *tree, const char *label);
221 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
222 struct node *get_node_by_ref(struct node *tree, const char *ref);
225 uint32_t guess_boot_cpuid(struct node *tree);
227 /* Boot info (tree plus memreserve information */
248 struct node *dt; /* the device tree */
258 struct node *tree, uint32_
[all...]
/freebsd-11-stable/sys/conf/
H A Ddtb.mk17 # DESTDIR The tree where the module gets installed. [not set]
34 # Search for kernel source tree in standard places.
41 .error "can't find kernel source tree"
67 # to make sure the tree is setup properly. We don't recreate it to avoid duplicate
/freebsd-11-stable/contrib/unbound/validator/
H A Dval_neg.h64 * It contains a tree of zones, every zone has a tree of data elements.
72 rbtree_type tree; member in struct:val_neg_cache
121 /** tree of NSEC data for this zone, sorted canonical
123 rbtree_type tree; member in struct:val_neg_zone
133 * The tree of these elements acts as an index onto the rrset cache.
136 * To make tree insertion and deletion logN too, all the parent (one label
252 * Insert data into the data tree of a zone
263 * May delete other data elements to keep tree coherent, or
/freebsd-11-stable/contrib/gcc/config/rs6000/
H A Drs6000.c38 #include "tree.h"
56 #include "tree-gimple.h"
157 static GTY(()) tree altivec_builtin_mask_for_load;
223 tree rs6000_builtin_types[RS6000_BTI_MAX];
224 tree rs6000_builtin_decls[RS6000_BUILTIN_COUNT];
578 static bool rs6000_function_ok_for_sibcall (tree, tree);
602 static void rs6000_assemble_visibility (tree, int);
605 static tree rs6000_handle_longcall_attribute (tree *, tre
[all...]
/freebsd-11-stable/sys/dev/iicbus/
H A Dlm75.c255 struct sysctl_oid_list *tree; local
261 tree = SYSCTL_CHILDREN(tree_node);
278 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "temperature",
281 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "thyst",
284 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "tos",
289 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "faults",
292 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "mode",
295 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "polarity",
298 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "shutdown",
/freebsd-11-stable/contrib/ldns/drill/
H A Dchasetrace.c256 ldns_dnssec_trust_tree *tree; local
368 tree = ldns_dnssec_derive_trust_tree(chain, NULL);
371 printf("\n\nDNSSEC Trust tree:\n");
372 ldns_dnssec_trust_tree_print(stdout, tree, 0, true);
376 tree_result = ldns_dnssec_trust_tree_contains_keys(tree, trusted_keys);
385 printf("No trusted keys found in tree: first error was: %s\n", ldns_get_errorstr_by_id(tree_result));
397 ldns_dnssec_trust_tree_free(tree);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/
H A Dassoc_container.hpp464 // An abstract basic tree-like (tree, trie) associative container.
494 // A concrete basic tree-based associative container.
500 class tree : public PB_DS_BASE_C_DEC class in namespace:pb_ds
509 tree() { } function in class:pb_ds::tree
513 tree(const cmp_fn& c) function in class:pb_ds::tree
520 tree(It first, It last) function in class:pb_ds::tree
528 tree(It first, It last, const cmp_fn& c) function in class:pb_ds::tree
532 tree(const tree function in class:pb_ds::tree
[all...]
/freebsd-11-stable/sys/powerpc/powermac/
H A Dnvbl.c122 struct sysctl_oid *tree; local
142 tree = device_get_sysctl_tree(dev);
144 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
/freebsd-11-stable/sys/dev/jedec_ts/
H A Djedec_ts.c242 struct sysctl_oid_list *tree; local
245 tree = SYSCTL_CHILDREN(device_get_sysctl_tree(dev));
246 SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "temp",
/freebsd-11-stable/contrib/ldns/ldns/
H A Ddnssec_verify.h73 * DNSSEC data that is needed to derive the trust tree later
96 * This tree is derived from a data_chain, and can be used
98 * and a trusted key. The tree only contains pointers to the
100 * data_chain when there is still a trust tree derived from
103 * Example tree:
118 * denial; otherwise is a tree which contains either a
145 * There is no deep free; all data in the trust tree
148 * \param[in] tree The tree to free
150 void ldns_dnssec_trust_tree_free(ldns_dnssec_trust_tree *tree);
[all...]
/freebsd-11-stable/contrib/gcc/config/
H A Ddarwin.c38 #include "tree.h"
173 tree decl = SYMBOL_REF_DECL (sym_ref);
387 tree id;
392 tree id_orig = id;
482 tree id;
950 tree id;
955 tree id_orig = id;
1061 darwin_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
1103 machopic_select_section (tree exp, int reloc,
1135 tree siz
[all...]
/freebsd-11-stable/sys/dev/mlx4/mlx4_core/
H A Dmlx4_cq.c11 * COPYING in the main directory of this source tree, or the
58 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree,
77 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1));
259 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
302 radix_tree_delete(&cq_table->tree, cq->cqn);
328 radix_tree_delete(&cq_table->tree, cq->cqn);
345 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
H A Dmlx4_srq.c8 * COPYING in the main directory of this source tree, or the
49 srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1));
176 err = radix_tree_insert(&srq_table->tree, srq->srqn, srq);
213 radix_tree_delete(&srq_table->tree, srq->srqn);
232 radix_tree_delete(&srq_table->tree, srq->srqn);
278 INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC);
303 srq = radix_tree_lookup(&srq_table->tree,
/freebsd-11-stable/contrib/gcc/config/i386/
H A Di386.c29 #include "tree.h"
52 #include "tree-gimple.h"
1370 static rtx x86_this_parameter (tree);
1371 static void x86_output_mi_thunk (FILE *, tree, HOST_WIDE_INT,
1372 HOST_WIDE_INT, tree);
1373 static bool x86_can_output_mi_thunk (tree, HOST_WIDE_INT, HOST_WIDE_INT, tree);
1377 static tree ix86_build_builtin_va_list (void);
1379 tree, int *, int);
1380 static tree ix86_gimplify_va_ar
[all...]

Completed in 222 milliseconds

<<11121314151617181920>>