Searched refs:tree (Results 276 - 300 of 741) sorted by relevance

<<11121314151617181920>>

/freebsd-11-stable/contrib/gcc/
H A Dstringpool.c36 #include "tree.h"
107 tree
121 tree
136 tree
H A Dexpr.c1 /* Convert tree expression to rtl instructions, for GNU compiler.
30 #include "tree.h"
51 #include "tree-iterator.h"
52 #include "tree-pass.h"
53 #include "tree-flow.h"
131 static tree emit_block_move_libcall_fn (int);
139 static tree clear_storage_libcall_fn (int);
144 tree, tree, int, int);
145 static void store_constructor (tree, rt
[all...]
H A DMakefile.in393 SPLAY_TREE_H= $(srcdir)/../include/splay-tree.h
762 TREE_H = tree.h tree.def $(MACHMODE_H) tree-check.h $(BUILTINS_DEF) \
794 C_TREE_H = c-tree.h $(C_COMMON_H) toplev.h $(DIAGNOSTIC_H)
804 TREE_DUMP_H = tree-dump.h $(SPLAY_TREE_H)
805 TREE_GIMPLE_H = tree-gimple.h tree-iterator.h
806 TREE_FLOW_H = tree-flow.h tree
[all...]
H A Dtree-ssa-structalias.c37 #include "tree.h"
39 #include "tree-flow.h"
40 #include "tree-inline.h"
42 #include "c-tree.h"
43 #include "tree-gimple.h"
47 #include "tree-pass.h"
50 #include "splay-tree.h"
52 #include "tree-ssa-structalias.h"
169 tree nonlocal_all;
186 static unsigned int create_variable_info_for (tree, cons
[all...]
H A Dc-lex.c30 #include "tree.h"
33 #include "c-tree.h"
42 #include "splay-tree.h"
62 static tree interpret_integer (const cpp_token *, unsigned int);
63 static tree interpret_float (const cpp_token *, unsigned int);
68 static enum cpp_ttype lex_string (const cpp_token *, tree *, bool);
69 static tree lex_charconst (const cpp_token *);
333 c_lex_with_flags (tree *value, location_t *loc, unsigned char *cpp_flags)
516 tree upper = TYPE_MAX_VALUE (integer_types[itk]);
544 tree uppe
[all...]
H A Dc-format.c28 #include "tree.h"
78 static bool decode_format_attr (tree, function_format_info *, int);
81 static bool check_format_string (tree argument,
84 static bool get_constant (tree expr, unsigned HOST_WIDE_INT *value,
90 tree
91 handle_format_arg_attribute (tree *node, tree ARG_UNUSED (name),
92 tree args, int flags, bool *no_add_attrs)
94 tree type = *node;
95 tree format_num_exp
[all...]
H A Dflags.h74 extern bool should_emit_struct_debug (tree type_decl, enum debug_info_usage);
190 not just because the tree inliner turned us off. */
305 extern bool flag_instrument_functions_exclude_p (tree fndecl);
/freebsd-11-stable/sys/dev/gpio/
H A Dgpiobacklight.c107 struct sysctl_oid *tree; local
132 tree = device_get_sysctl_tree(dev);
133 sc->sc_oid = SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
/freebsd-11-stable/sys/arm/ti/am335x/
H A Dam335x_scm.c110 struct sysctl_oid_list *tree; local
128 tree = SYSCTL_CHILDREN(device_get_sysctl_tree(dev));
129 sc->sc_temp_oid = SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,
/freebsd-11-stable/contrib/xz/src/liblzma/common/
H A Dindex.c45 /// \brief AVL tree to hold index_stream or index_group structures
50 /// Leftmost node. Since the tree will be filled sequentially,
52 /// the tree.
55 /// The rightmost node in the tree. Since the tree is filled
59 /// Number of nodes in the tree
72 /// Every Record group is part of index_stream.groups tree.
108 /// Every index_stream is a node in the tree of Streams.
117 /// Record groups of this Stream are stored in a tree.
118 /// It's a T-tree wit
182 index_tree_init(index_tree *tree) argument
215 index_tree_end(index_tree *tree, const lzma_allocator *allocator, void (*free_func)(void *node, const lzma_allocator *allocator)) argument
230 index_tree_append(index_tree *tree, index_tree_node *node) argument
315 index_tree_locate(const index_tree *tree, lzma_vli target) argument
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/
H A Ddiff.h119 * Returns number of tokens in a tree
122 svn_diff__get_node_count(svn_diff__tree_t *tree);
125 * Support functions to build a tree of token positions
128 svn_diff__tree_create(svn_diff__tree_t **tree, apr_pool_t *pool);
137 svn_diff__tree_t *tree,
/freebsd-11-stable/contrib/subversion/subversion/include/private/
H A Dsvn_element.h116 /** Versioned payload of an element, excluding tree structure information.
140 /** Versioned payload of a node, excluding tree structure information.
264 * In other words, an el-rev node in a (mixed-rev) directory-tree.
307 * complete tree at all times.
313 /* A (sub)tree of elements.
315 * An element tree is described by the content of element ROOT_EID in E_MAP,
337 /* Create an element tree object.
348 svn_element__tree_get(const svn_element__tree_t *tree,
352 svn_element__tree_set(svn_element__tree_t *tree,
377 svn_element__tree_get_path_by_eid(const svn_element__tree_t *tree,
[all...]
/freebsd-11-stable/sys/dev/ena/
H A Dena_sysctl.c86 struct sysctl_oid *tree; local
92 tree = device_get_sysctl_tree(dev);
93 child = SYSCTL_CHILDREN(tree);
132 struct sysctl_oid *tree; local
147 tree = device_get_sysctl_tree(dev);
148 child = SYSCTL_CHILDREN(tree);
306 struct sysctl_oid *tree; local
315 tree = device_get_sysctl_tree(dev);
316 child = SYSCTL_CHILDREN(tree);
357 struct sysctl_oid *tree; local
[all...]
/freebsd-11-stable/contrib/unbound/util/data/
H A Dmsgencode.c68 * A tree of dnames and their offsets in the packet is kept.
73 * It is a binary tree, not a rbtree or balanced tree, as the effort
78 /** left node in tree, all smaller to this */
80 /** right node in tree, all larger than this */
83 /** the parent node - not for tree, but zone parent. One less label */
94 * Find domain name in tree, returns exact and closest match.
95 * @param tree: root of tree.
100 * can be null if the tree i
107 compress_tree_search(struct compress_tree_node** tree, uint8_t* dname, int labs, struct compress_tree_node** match, int* matchlabels, struct compress_tree_node*** insertpt) argument
147 compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname, int labs, struct compress_tree_node*** insertpt) argument
287 compress_owner(struct ub_packed_rrset_key* key, sldns_buffer* pkt, struct regional* region, struct compress_tree_node** tree, size_t owner_pos, uint16_t* owner_ptr, int owner_labs) argument
336 compress_any_dname(uint8_t* dname, sldns_buffer* pkt, int labs, struct regional* region, struct compress_tree_node** tree) argument
367 compress_rdata(sldns_buffer* pkt, uint8_t* rdata, size_t todolen, struct regional* region, struct compress_tree_node** tree, const sldns_rr_descriptor* desc) argument
449 packed_rrset_encode(struct ub_packed_rrset_key* key, sldns_buffer* pkt, uint16_t* num_rrs, time_t timenow, struct regional* region, int do_data, int do_sig, struct compress_tree_node** tree, sldns_pkt_section s, uint16_t qtype, int dnssec, size_t rr_offset) argument
544 insert_section(struct reply_info* rep, size_t num_rrsets, uint16_t* num_rrs, sldns_buffer* pkt, size_t rrsets_before, time_t timenow, struct regional* region, struct compress_tree_node** tree, sldns_pkt_section s, uint16_t qtype, int dnssec, size_t rr_offset) argument
599 insert_query(struct query_info* qinfo, struct compress_tree_node** tree, sldns_buffer* buffer, struct regional* region) argument
677 struct compress_tree_node* tree = 0; local
[all...]
/freebsd-11-stable/contrib/ldns/
H A Ddnssec_verify.c374 /* just throw in all signatures, the tree builder must sort
455 ldns_dnssec_trust_tree_free(ldns_dnssec_trust_tree *tree) argument
458 if (tree) {
459 for (i = 0; i < tree->parent_count; i++) {
460 ldns_dnssec_trust_tree_free(tree->parents[i]);
463 LDNS_FREE(tree);
467 ldns_dnssec_trust_tree_depth(ldns_dnssec_trust_tree *tree) argument
473 for (i = 0; i < tree->parent_count; i++) {
474 parent = ldns_dnssec_trust_tree_depth(tree->parents[i]);
501 ldns_dnssec_trust_tree *tree,
499 ldns_dnssec_trust_tree_print_sm_fmt(FILE *out, const ldns_output_format *fmt, ldns_dnssec_trust_tree *tree, size_t tabs, bool extended, uint8_t *sibmap, size_t treedepth) argument
632 ldns_dnssec_trust_tree_print_fmt(FILE *out, const ldns_output_format *fmt, ldns_dnssec_trust_tree *tree, size_t tabs, bool extended) argument
642 ldns_dnssec_trust_tree_print(FILE *out, ldns_dnssec_trust_tree *tree, size_t tabs, bool extended) argument
653 ldns_dnssec_trust_tree_add_parent(ldns_dnssec_trust_tree *tree, const ldns_dnssec_trust_tree *parent, const ldns_rr *signature, const ldns_status parent_status) argument
1041 ldns_dnssec_trust_tree_contains_keys(ldns_dnssec_trust_tree *tree, ldns_rr_list *trusted_keys) argument
[all...]
/freebsd-11-stable/contrib/libgnuregex/
H A Dregcomp.c795 /* Parse the regular expression, and build a structure tree. */
801 /* Analyze the tree and create the nfa. */
1149 /* Analyze the structure tree, and calculate "first", "next", "edest",
1213 implement parse tree visits. Instead, we use parent pointers and
1223 /* Descend down the tree, preferably to the left (or to the right
1338 bin_tree_t *op, *cls, *tree1, *tree;
1356 tree = create_tree (dfa, op, tree1, CONCAT);
1357 if (BE (tree == NULL || tree1 == NULL || op == NULL || cls == NULL, 0))
1365 return tree;
1391 /* Pass 2: compute NEXT on the tree
1331 bin_tree_t *op, *cls, *tree1, *tree; local
2108 bin_tree_t *tree, *eor, *root; local
2142 bin_tree_t *tree, *branch = NULL; local
2182 bin_tree_t *tree, *exp; local
2228 bin_tree_t *tree; local
2444 bin_tree_t *tree; local
2485 bin_tree_t *tree = NULL, *old_tree = NULL; local
3587 bin_tree_t *tree; local
3740 bin_tree_t *tree; local
[all...]
/freebsd-11-stable/contrib/gcc/cp/
H A Dptree.c29 #include "tree.h"
30 #include "cp-tree.h"
33 cxx_print_decl (FILE *file, tree node, int indent)
64 cxx_print_type (FILE *file, tree node, int indent)
152 cxx_print_identifier (FILE *file, tree node, int indent)
169 cxx_print_xnode (FILE *file, tree node, int indent)
H A Drepo.c33 #include "tree.h"
34 #include "cp-tree.h"
47 static GTY(()) tree pending_repo;
196 tree id = get_identifier (buf + 2);
227 tree t;
259 tree val = TREE_VALUE (t);
260 tree name = DECL_ASSEMBLER_NAME (val);
278 repo_emit_p (tree decl)
295 tree type = NULL_TREE;
321 tree clon
[all...]
H A Dcp-objcp-common.h27 extern tree objcp_tsubst_copy_and_build (tree, tree, tsubst_flags_t,
28 tree, bool);
H A Ddump.c27 #include "tree.h"
28 #include "cp-tree.h"
29 #include "tree-dump.h"
31 static void dump_access (dump_info_p, tree);
33 static void dump_op (dump_info_p, tree);
39 dump_access (dump_info_p di, tree t)
53 dump_op (dump_info_p di, tree t)
207 cp_dump_tree (void* dump_info, tree t)
271 tree binfo;
272 tree base_binf
[all...]
/freebsd-11-stable/usr.bin/xlint/lint1/
H A DMakefile5 SRCS= cgram.y scan.l mem1.c mem.c err.c main1.c decl.c tree.c func.c \
/freebsd-11-stable/sbin/dhclient/
H A DMakefile38 tree.c conflex.c errwarn.c inet.c packet.c convert.c tables.c \
/freebsd-11-stable/contrib/unbound/iterator/
H A Diter_hints.h55 * Hints are stored in this tree. Sort order is specially chosen.
62 rbtree_type tree; member in struct:iter_hints
69 /** tree sorted by name, class */
141 * the tree parents.
154 * recalcs the tree parents.
/freebsd-11-stable/contrib/unbound/daemon/
H A Dacl_list.h81 rbtree_type tree; member in struct:acl_list
89 /** node in address tree */
/freebsd-11-stable/contrib/libucl/src/
H A DMakefile.am30 tree.h

Completed in 338 milliseconds

<<11121314151617181920>>