Searched refs:tree (Results 26 - 50 of 741) sorted by path

1234567891011>>

/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/dtc/
H A Ddtc.c44 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...]
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...]
H A Dflattree.c258 static void flatten_tree(struct node *tree, struct emitter *emit, argument
266 if (tree->deleted)
269 emit->beginnode(etarget, tree->labels);
272 emit->string(etarget, tree->fullpath, 0);
274 emit->string(etarget, tree->name, 0);
278 for_each_property(tree, prop) {
299 emit->cell(etarget, tree->basenamelen+1);
302 if ((vi->flags & FTF_VARALIGN) && ((tree->basenamelen+1) >= 8))
305 emit->string(etarget, tree->name, tree
830 struct node *tree; local
[all...]
H A Dfstree.c31 struct node *tree; local
37 tree = build_node(NULL, NULL);
64 add_property(tree, prop);
72 add_child(tree, newchild);
79 return tree;
84 struct node *tree; local
86 tree = read_fstree(dirname);
87 tree = name_node(tree, "");
89 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpui
[all...]
H A Dlivetree.c357 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 Dtreesource.c41 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/contrib/elftoolchain/addr2line/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/elfdump/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/libdwarf/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/libelftc/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/libpe/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/nm/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/readelf/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/size/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/elftoolchain/strings/
H A Dos.NetBSD.mk1 # TODO(#511): Revert after the source tree is -Wconversion clean.
/freebsd-11-stable/contrib/gcc/
H A DFREEBSD-libiberty19 splay-tree.c
33 splay-tree.h \
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 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 Dalias.h27 extern bool component_uses_parent_alias_set (tree);
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...]
H A Dbasic-block.h127 tree GTY ((tag ("1"))) t;
133 /* Location of any goto implicit in the edge, during tree-ssa. */
184 /* Declared in tree-flow.h. */
217 tree stmt_list;
241 tree phi_nodes;
382 only used for the tree CFG. */
H A Dbuiltins.c29 #include "tree.h"
30 #include "tree-gimple.h"
49 #include "tree-mudflap.h"
68 tree built_in_decls[(int) END_BUILTINS];
72 tree implicit_built_in_decls[(int) END_BUILTINS];
74 static int get_pointer_alignment (tree, unsigned int);
75 static const char *c_getstr (tree);
77 static int target_char_cast (tree, char *);
78 static rtx get_memory_rtx (tree, tree);
[all...]
H A Dc-aux-info.c2 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 Dc-common.c27 #include "tree.h"
42 #include "tree-inline.h"
43 #include "c-tree.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
105 tree short_integer_type_node;
106 tree long_integer_type_node;
107 tree long_long_integer_type_node;
109 tree short_unsigned_type_node;
110 tree long_unsigned_type_nod
[all...]

Completed in 235 milliseconds

1234567891011>>