Searched refs:tree (Results 1 - 25 of 741) sorted by path

1234567891011>>

/freebsd-11-stable/contrib/binutils/binutils/
H A Dcoffdump.c23 This module reads a type tree generated by coffgrok and prints
476 struct coff_ofile *tree; local
548 tree = coff_grok (abfd);
550 coff_dump (tree);
H A Dsrconv.c98 static struct coff_ofile *tree; variable in typeref:struct:coff_ofile
1180 wr_globals (tree, sfile, nest + 1);
1693 prescan (struct coff_ofile *tree) argument
1699 common_section = tree->sections + 3;
1701 for (s = tree->symbol_list_head;
1876 tree = coff_grok (abfd);
1879 prescan (tree);
1881 wr_module (tree);
/freebsd-11-stable/contrib/binutils/include/
H A Ddemangle.h190 /* The V3 demangler works in two passes. The first pass builds a tree
192 tree representation into a demangled string. Here we define an
193 interface to permit a caller to build their own tree
199 /* These are the component types which may be found in the tree. Many
370 /* A node in the tree representation is an instance of a struct
525 demangle_component tree. The first argument is the mangled name.
527 tree on success, or NULL on failure. On success, the third
529 block should be passed to free when the tree is no longer
535 /* This function takes a struct demangle_component tree and returns
537 options. The second is the tree t
[all...]
/freebsd-11-stable/contrib/binutils/ld/
H A Dldexp.c207 fold_unary (etree_type *tree) argument
209 exp_fold_tree_1 (tree->unary.child);
212 switch (tree->type.node_code)
279 fold_binary (etree_type *tree) argument
281 exp_fold_tree_1 (tree->binary.lhs);
285 if (expld.result.valid_p && tree->type.node_code == SEGMENT_START)
291 segment_name = tree->binary.rhs->name.name;
306 exp_fold_tree_1 (tree->binary.rhs);
316 && tree->type.node_code == '+')
324 && (tree
466 fold_trinary(etree_type *tree) argument
476 fold_name(etree_type *tree) argument
680 exp_fold_tree_1(etree_type *tree) argument
823 exp_fold_tree(etree_type *tree, asection *current_section, bfd_vma *dotp) argument
832 exp_fold_tree_no_dot(etree_type *tree) argument
965 exp_print_tree(etree_type *tree) argument
1046 exp_get_vma(etree_type *tree, bfd_vma def, char *name) argument
1060 exp_get_value_int(etree_type *tree, int def, char *name) argument
1066 exp_get_fill(etree_type *tree, fill_type *def, char *name) argument
1124 exp_get_abs_int(etree_type *tree, int def, char *name) argument
[all...]
H A Dldlang.c369 lang_section_bst_type **tree; local
371 tree = &wild->tree;
375 /* Append at the right end of tree. */
376 while (*tree)
377 tree = &((*tree)->right);
378 return tree;
381 while (*tree)
384 if (compare_section (sec->spec.sorted, section, (*tree)
403 lang_section_bst_type **tree; local
421 output_section_callback_tree_to_list(lang_wild_statement_type *ptr, lang_section_bst_type *tree, void *output) argument
2555 lang_section_bst_type *tree; local
3494 etree_type *tree; local
4186 os_region_check(lang_output_section_statement_type *os, lang_memory_region_type *region, etree_type *tree, bfd_vma base) argument
4633 etree_type *tree = s->assignment_statement.exp; local
[all...]
H A Dldlang.h313 /* Binary search tree structure to efficiently sort sections by
333 lang_section_bst_type *tree; member in struct:lang_wild_statement_struct
/freebsd-11-stable/contrib/binutils/libiberty/
H A DMakefile.in152 splay-tree.c stpcpy.c stpncpy.c strcasecmp.c strchr.c strdup.c \
177 ./safe-ctype.o ./sort.o ./spaces.o ./splay-tree.o ./strerror.o \
222 $(INCDIR)/splay-tree.h \
983 ./splay-tree.o: $(srcdir)/splay-tree.c config.h $(INCDIR)/ansidecl.h \
984 $(INCDIR)/libiberty.h $(INCDIR)/splay-tree.h
986 $(COMPILE.c) $(PICFLAG) $(srcdir)/splay-tree.c -o pic/$@; \
988 $(COMPILE.c) $(srcdir)/splay-tree.c $(OUTPUT_OPTION)
/freebsd-11-stable/contrib/bmake/
H A Dbsd.after-import.mk23 # it helps to know where the top of the tree is.
/freebsd-11-stable/contrib/bmake/mk/
H A Dauto.obj.mk45 # we are already in obj tree!
H A Ddirdeps.mk28 # If a tree does not support that, simply using plain Makefile.depend
66 # dependencies of the tree wrt the initial directory (_DEP_RELDIR).
332 # we can avoid the overhead of re-computing the tree dependencies.
H A Ddpadd.mk98 # the DPADD paths will be to the obj tree so we need to subst anyway.
H A Dgendirdeps.mk252 # but we cannot assume that all of the tree is present,
327 echo '# local dependencies - needed for -jN in clean tree'; \
H A Dmeta.subdir.mk37 # the alternative is a walk through the tree though
/freebsd-11-stable/contrib/bmake/mk/sys/
H A DHP-UX.mk25 # the build tree available :-)
/freebsd-11-stable/contrib/bsnmp/gensnmptree/
H A Dgensnmptree.c41 * top := tree | typedef | include
43 * tree := head elements ')'
67 * element := tree | leaf | column
128 * A node in the OID tree
154 struct tree { struct in union:node::__anon117
156 } tree; member in union:node::__anon117
851 TAILQ_INIT(&node->u.tree.subs);
855 TAILQ_INSERT_TAIL(&node->u.tree.subs, sub, link);
863 * Parse a top level element. Return the tree if it was a tree, NUL
[all...]
/freebsd-11-stable/contrib/bsnmp/lib/
H A Dsnmpagent.c55 struct snmp_node *tree; variable in typeref:struct:snmp_node
128 for (tp = tree; tp < tree + tree_size; tp++) {
161 for (tp = tree; tp < tree + tree_size; tp++) {
197 * Execute a GET operation. The tree is rooted at the global 'root'.
300 for (tp = tree; tp < tree + tree_size; tp++) {
302 /* the tree OID is a sub-oid of the requested OID. */
372 if (++tp == tree
[all...]
H A Dsnmpagent.h107 extern struct snmp_node *tree;
/freebsd-11-stable/contrib/bsnmp/snmp_mibII/
H A DmibII_route.c35 #include <sys/tree.h>
37 #include "tree.h"
/freebsd-11-stable/contrib/bsnmp/snmp_ntp/
H A Dsnmp_ntp.c235 .tree = ntp_ctree,
/freebsd-11-stable/contrib/bsnmp/snmp_target/
H A Dtarget_snmp.c837 .tree = target_ctree,
/freebsd-11-stable/contrib/bsnmp/snmp_usm/
H A Dusm_snmp.c615 .tree = usm_ctree,
/freebsd-11-stable/contrib/bsnmp/snmp_vacm/
H A Dvacm_snmp.c1023 .tree = vacm_ctree,
/freebsd-11-stable/contrib/bsnmp/snmpd/
H A Dconfig.c52 #include "tree.h"
816 for (node = tree; node < &tree[tree_size]; node++)
819 if (node == &tree[tree_size])
1253 for (node = tree; node < &tree[tree_size]; node++)
1261 if (node == &tree[tree_size])
1280 for (node = tree; node < &tree[tree_size]; node++)
1287 if (node == &tree[tree_siz
[all...]
H A Dmain.c65 #include "tree.h"
1270 switch (tree[i].type) {
1273 sprintf(buf, "LEAF: %s %s", tree[i].name,
1274 asn_oid2str(&tree[i].oid));
1278 sprintf(buf, "COL: %s %s", tree[i].name,
1279 asn_oid2str(&tree[i].oid));
1600 * Initialize the tree.
1602 if ((tree = malloc(sizeof(struct snmp_node) * CTREE_SIZE)) == NULL) {
1606 memcpy(tree, ctree, sizeof(struct snmp_node) * CTREE_SIZE);
2278 * Merge the given tree fo
[all...]
H A Dsnmpmod.h299 /* the tree this module is going to server */
300 const struct snmp_node *tree; member in struct:snmp_module

Completed in 319 milliseconds

1234567891011>>