Searched refs:tree (Results 201 - 225 of 741) sorted by relevance

1234567891011>>

/freebsd-11-stable/crypto/openssl/crypto/x509v3/
H A Dpcy_node.c114 X509_POLICY_TREE *tree)
139 if (tree) {
140 if (!tree->extra_data)
141 tree->extra_data = sk_X509_POLICY_DATA_new_null();
142 if (!tree->extra_data)
144 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))
111 level_add_node(X509_POLICY_LEVEL *level, const X509_POLICY_DATA *data, X509_POLICY_NODE *parent, X509_POLICY_TREE *tree) argument
/freebsd-11-stable/contrib/gcc/cp/
H A Dparser.c30 #include "tree.h"
31 #include "cp-tree.h"
42 #include "tree-iterator.h"
57 tree value;
62 tree qualifying_scope;
93 tree GTY((tag ("0"))) value;
844 (cp_declarator *, cp_parameter_declarator *, cp_cv_quals, tree);
846 (cp_declarator *, tree);
852 (cp_decl_specifier_seq *, cp_declarator *, tree);
854 (cp_cv_quals, tree, cp_declarato
[all...]
H A Dcxx-pretty-print.h41 tree enclosing_scope;
71 void pp_cxx_declaration (cxx_pretty_printer *, tree);
72 void pp_cxx_canonical_template_parameter (cxx_pretty_printer *, tree);
/freebsd-11-stable/contrib/gcc/
H A Dgimple-low.c26 #include "tree.h"
29 #include "tree-gimple.h"
30 #include "tree-inline.h"
34 #include "tree-flow.h"
42 #include "tree-pass.h"
47 tree block;
51 tree return_statements;
69 tree *body_p = &DECL_SAVED_TREE (current_function_decl);
70 tree bind = *body_p;
72 tree
[all...]
H A Dtree-ssa-operands.h28 typedef tree *def_operand_p;
41 tree *def_ptr;
57 tree def_var;
58 tree use_var;
67 tree use_var;
76 tree def_var;
77 tree kill_var;
157 extern void update_stmt_operands (tree);
158 extern bool verify_imm_links (FILE *f, tree var);
160 extern void copy_virtual_operands (tree, tre
[all...]
H A Dtree-ssa-dce.c59 #include "tree.h"
61 #include "tree-flow.h"
62 #include "tree-gimple.h"
63 #include "tree-dump.h"
64 #include "tree-pass.h"
68 #include "tree-scalar-evolution.h"
79 static VEC(tree,heap) *worklist;
123 static inline void mark_stmt_necessary (tree, bool);
124 static inline void mark_operand_necessary (tree, bool);
126 static void mark_stmt_if_obviously_necessary (tree, boo
[all...]
H A Dsdbout.c49 #include "tree.h"
53 static GTY(()) tree anonymous_types;
67 static GTY(()) tree preinit_symbols;
110 extern tree current_function_decl;
122 static void sdbout_global_decl (tree);
127 static void sdbout_begin_function (tree);
129 static void sdbout_toplevel_data (tree);
132 static int plain_type (tree);
133 static int template_name_p (tree);
134 static void sdbout_record_type_name (tree);
[all...]
H A Dc-decl.c40 #include "tree.h"
41 #include "tree-inline.h"
47 #include "c-tree.h"
59 #include "tree-mudflap.h"
60 #include "tree-gimple.h"
62 #include "tree-dump.h"
84 tree pending_invalid_xref;
98 static tree enum_next_value;
116 static tree current_function_prototype_arg_types;
128 /* The current statement tree
[all...]
H A Dtree-ssa-loop-im.c25 #include "tree.h"
32 #include "tree-flow.h"
33 #include "tree-dump.h"
38 #include "tree-pass.h"
70 tree stmt;
111 tree *ref; /* The reference itself. */
112 tree stmt; /* The statement in that it occurs. */
120 tree mem; /* The memory itself. */
158 for_each_index (tree *addr_p, bool (*cbck) (tree, tre argument
[all...]
H A Dvalue-prof.h45 tree value; /* The value to profile. */
46 tree stmt; /* Insn containing the value. */
106 /* In tree-profile.c. */
H A Dtree-vect-analyze.c27 #include "tree.h"
31 #include "tree-flow.h"
32 #include "tree-dump.h"
38 #include "tree-chrec.h"
39 #include "tree-data-ref.h"
40 #include "tree-scalar-evolution.h"
41 #include "tree-vectorizer.h"
57 static bool exist_non_indexing_operands_for_use_p (tree, tree);
58 static void vect_mark_relevant (VEC(tree,hea
[all...]
H A DFREEBSD-libiberty19 splay-tree.c
33 splay-tree.h \
H A Dtree-vectorizer.c27 tree codes (PLUS, MULT etc).
113 expressed using existing tree codes, to verify that an operation is
120 http://gcc.gnu.org/projects/tree-ssa/vectorization.html
128 #include "tree.h"
133 #include "tree-flow.h"
134 #include "tree-dump.h"
142 #include "tree-chrec.h"
143 #include "tree-data-ref.h"
144 #include "tree-scalar-evolution.h"
146 #include "tree
[all...]
H A Dtree-vrp.c28 #include "tree.h"
30 #include "tree-flow.h"
31 #include "tree-pass.h"
32 #include "tree-dump.h"
38 #include "tree-scalar-evolution.h"
39 #include "tree-ssa-propagate.h"
40 #include "tree-chrec.h"
47 static int compare_values (tree val1, tree val2);
48 static int compare_values_warnv (tree val
[all...]
H A Dc-parser.c44 #include "tree.h"
51 #include "c-tree.h"
87 static tree objc_method_attributes;
259 tree id;
266 ridpointers = GGC_CNEWVEC (tree, (int) RID_MAX);
328 tree value;
377 tree decl;
440 tree objc_interface_decl = objc_is_class_name (token->value);
1052 static void c_parser_declaration_or_fndef (c_parser *, bool, bool, bool, bool, tree*);
1057 static tree c_parser_struct_declaratio
[all...]
H A Dstmt.c1 /* Expands front end tree to back end RTL for GCC
23 /* This file handles the generation of rtl code from tree structure
35 #include "tree.h"
75 and PARENT fields to hold a binary tree. Initially the tree is
76 totally unbalanced, with everything on the right. We balance the tree
78 and nodes on the right having higher values. We then output the tree
86 struct case_node *left; /* Left son in binary tree */
87 struct case_node *right; /* Right son in binary tree; also node chain */
88 struct case_node *parent; /* Parent of node in binary tree */
[all...]
H A Dtree-ssa-structalias.h40 VEC(tree,heap) *processed_ptrs;
72 tree ref_all_symbol_mem_tag;
83 /* In tree-ssa-alias.c. */
84 enum escape_type is_escape_site (tree);
86 /* In tree-ssa-structalias.c. */
H A Dattribs.c26 #include "tree.h"
133 from tree.h. Depending on these flags, some attributes may be
137 tree
138 decl_attributes (tree *node, tree attributes, int flags)
140 tree a;
141 tree returned_attrs = NULL_TREE;
150 tree name = TREE_PURPOSE (a);
151 tree args = TREE_VALUE (a);
152 tree *anod
[all...]
/freebsd-11-stable/contrib/dtc/Documentation/
H A Ddtc-paper.tex44 flattened-tree representation of the system's hardware based on the
45 device tree supplied by Open Firmware on IBM\R servers and Apple\R
48 The ``blob'' representing the device tree can be created using \dtc
50 representation of the tree into the compact representation used by
55 This flattened-tree approach is now the only supported method of
63 \subsection{OF and the device tree}
67 Among other boot-time services, OF maintains a device tree that
70 the Linux kernel uses OF calls to scan the device tree and transfer it
74 The device tree consists of nodes representing devices or
85 but nothing as detailed or complete as the OF device tree
[all...]
/freebsd-11-stable/contrib/ncurses/ncurses/base/
H A Dkey_defined.c38 find_definition(TRIES * tree, const char *str) argument
44 for (ptr = tree; ptr != 0; ptr = ptr->sibling) {
/freebsd-11-stable/crypto/openssl/util/
H A Dtoutf8.sh5 git ls-tree -r --name-only HEAD | \
/freebsd-11-stable/share/mk/
H A Dbsd.dtb.mk3 # Search for kernel source tree in standard places.
12 .error Unable to locate the kernel source tree. Set SYSDIR to override.
H A Dbsd.kmod.mk3 # Search for kernel source tree in standard places.
12 .error Unable to locate the kernel source tree. Set SYSDIR to override.
H A Dbsd.sysdir.mk3 # Search for kernel source tree in standard places.
15 .error Unable to locate the kernel source tree. Set SYSDIR to override.
/freebsd-11-stable/contrib/unbound/iterator/
H A Diter_donotq.c84 if(!addr_tree_insert(&dq->tree, node, addr, addrlen, net)) {
126 addr_tree_init(&dq->tree);
137 addr_tree_init_parents(&dq->tree);
145 return addr_tree_lookup(&donotq->tree, addr, addrlen) != NULL;

Completed in 479 milliseconds

1234567891011>>