Searched defs:tree (Results 1 - 25 of 36) sorted by relevance

12

/vbox/src/libs/libxml2-2.6.31/
H A DtestRelax.c51 static int tree = 0; variable
76 if ((!strcmp(argv[i], "-tree")) || (!strcmp(argv[i], "--tree"))) {
77 tree++;
131 if (tree)
173 printf("\t--debug : dump a debug tree of the in-memory document\n");
176 printf("\t--tree : print the intermediate Relax-NG document tree\n");
H A DtestXPath.c32 #include <libxml/tree.h>
47 static int tree = 0; variable
99 if (tree)
161 else if ((!strcmp(argv[i], "-tree")) || (!strcmp(argv[i], "--tree")))
162 tree++;
207 printf("\t--tree : show the compiled XPath tree\n");
H A Dlegacy.c16 #include <libxml/tree.h>
990 * @tree: the tree of enumerated value set
998 xmlEnumerationPtr tree)
1002 tree);
1010 * @content: the element value tree
996 attributeDecl(void *ctx, const xmlChar * elem, const xmlChar * fullname, int type, int def, const xmlChar * defaultValue, xmlEnumerationPtr tree) argument
H A DtestSAX.c49 #include <libxml/tree.h>
469 const xmlChar * defaultValue, xmlEnumerationPtr tree)
480 xmlFreeEnumeration(tree);
467 attributeDeclDebug(void *ctx ATTRIBUTE_UNUSED, const xmlChar * elem, const xmlChar * name, int type, int def, const xmlChar * defaultValue, xmlEnumerationPtr tree) argument
H A DSAX2.c2 * SAX2.c : Default SAX2 handler to build a tree.
16 #include <libxml/tree.h>
692 * @tree: the tree of enumerated value set
699 xmlEnumerationPtr tree)
729 (xmlAttributeDefault) def, defaultValue, tree);
733 (xmlAttributeDefault) def, defaultValue, tree);
738 xmlFreeEnumeration(tree);
760 * @content: the element value tree
1450 * the element should be instantiated in the tree i
697 xmlSAX2AttributeDecl(void *ctx, const xmlChar *elem, const xmlChar *fullname, int type, int def, const xmlChar *defaultValue, xmlEnumerationPtr tree) argument
[all...]
H A DdebugXML.c2 * debugXML.c : This is a set of routines used for debugging the tree
22 #include <libxml/tree.h>
535 if (attr->tree != NULL) {
537 xmlEnumerationPtr cur = attr->tree;
1863 "%s is an XSLT value tree\n", arg);
2495 * @node: a node in the tree
2666 * @tree: a node defining a subtree
2670 * show the structure of the subtree under node @tree
2671 * If @tree is null, the command works on the current node.
2677 char *arg ATTRIBUTE_UNUSED, xmlNodePtr tree,
2676 xmlShellDu(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr tree, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument
[all...]
H A Dxinclude.c17 #include <libxml/tree.h>
90 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree);
886 * Build a node list tree copy of the XPointer result.
889 * The caller has to free the node tree.
920 * list is the pointer to the root of the output tree
921 * listParent is a pointer to the parent of output tree (within
923 * last is a pointer to the last node added to the output tree
928 * Check if our output tree needs a parent
1058 /* don't consider it part of the tree content */
1098 * Build a node list tree cop
2315 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree) argument
2431 xmlNodePtr tree; local
2493 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, int flags) argument
2522 xmlXIncludeProcessTree(xmlNodePtr tree) argument
[all...]
H A Dxmllint.c76 #include <libxml/tree.h>
1094 const xmlChar * defaultValue, xmlEnumerationPtr tree)
1105 xmlFreeEnumeration(tree);
2128 * build an XML tree from a string;
2823 printf("\t--debug : dump a debug tree of the in-memory document\n");
2836 printf("\t--noout : don't output the result tree\n");
2895 printf("\t--dtdattr : loaddtd + populate the tree with inherited attributes \n");
2914 printf("\t--sax : do not build a tree but work just at the SAX level\n");
1092 attributeDeclDebug(void *ctx ATTRIBUTE_UNUSED, const xmlChar * elem, const xmlChar * name, int type, int def, const xmlChar * defaultValue, xmlEnumerationPtr tree) argument
H A Druntest.c29 #include <libxml/tree.h>
994 const xmlChar * defaultValue, xmlEnumerationPtr tree)
1005 xmlFreeEnumeration(tree);
1721 * Parse to tree based tests *
3687 * build an XML tree from a the file; we need to add default
992 attributeDeclDebug(void *ctx ATTRIBUTE_UNUSED, const xmlChar * elem, const xmlChar * name, int type, int def, const xmlChar * defaultValue, xmlEnumerationPtr tree) argument
/vbox/src/VBox/Devices/EFI/Firmware/BaseTools/Source/C/VfrCompile/Pccts/h/
H A Dast.c1 /* Abstract syntax tree manipulation functions
38 /* ensure that tree manipulation variables are current after a rule
126 * example: print tree in child-sibling LISP-format (AST has token field)
128 * void show(tree)
129 * AST *tree;
131 * if ( tree == NULL ) return;
132 * printf(" %s", zztokens[tree->token]);
138 * LISPdump() { zzpre_ast(tree, show, before, after); }
144 AST *tree,
145 void (*func)(AST *), /* apply this to each tree nod
143 zzpre_ast( AST *tree, void (*func)(AST *), void (*before)(AST *), void (*after)(AST *)) argument
204 zzfree_ast(AST *tree) argument
[all...]
H A DASTBase.cpp1 /* Abstract syntax tree manipulation functions
41 /* ensure that tree manipulation variables are current after a rule
88 ASTBase *tree = this; local
90 while ( tree!= NULL )
92 if ( tree->_down != NULL ) {
93 tree->preorder_before_action(pData); // MR1
95 tree->preorder_action(pData);
96 if ( tree->_down!=NULL )
98 tree->_down->preorder(pData);
99 tree
109 ASTBase* tree = this; local
[all...]
/vbox/src/libs/xpcom18a4/xpcom/typelib/xpidl/
H A Dxpidl.h133 IDL_tree tree; member in struct:TreeState
180 * source decompiled from state->tree.
H A Dxpidl_typelib.c133 if (IDL_NODE_TYPE(tfd->tree) == IDLN_IDENT) {
134 IDL_tree_type node_type = IDL_NODE_TYPE((up = IDL_NODE_UP(tfd->tree)));
142 char *iface = IDL_IDENT(tfd->tree).str;
154 char *iid = (char *)IDL_tree_property_get(tfd->tree, "uuid");
156 IDL_tree_property_get(tfd->tree, "namespace");
173 IDL_IDENT(tfd->tree).str, IDL_NODE_TYPE_NAME(up));
181 /* Find all the interfaces referenced in the tree (uses add_interface_maybe) */
187 switch (IDL_NODE_TYPE(tfd->tree)) {
189 node = IDL_ATTR_DCL(tfd->tree).param_type_spec;
192 IDL_tree_walk_in_order(IDL_OP_DCL(tfd->tree)
952 fill_pd_from_param(TreeState *state, XPTParamDescriptor *pd, IDL_tree tree) argument
[all...]
/vbox/src/VBox/Devices/Graphics/shaderlib/libWineStub/include/wine/
H A Drbtree.h2 * Red-black search tree support
89 static inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size) argument
91 struct wine_rb_stack *stack = &tree->stack;
96 struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
186 static inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
190 if (!tree->root) return;
192 for (entry = &tree->root;;)
198 wine_rb_stack_push(&tree->stack, entry);
206 wine_rb_stack_push(&tree->stack, entry);
215 if (!tree
220 wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions) argument
233 wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
238 wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
247 wine_rb_get(const struct wine_rb_tree *tree, const void *key) argument
259 wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry) argument
300 wine_rb_remove(struct wine_rb_tree *tree, const void *key) argument
[all...]
/vbox/src/VBox/Devices/Graphics/shaderlib/wine/include/wine/
H A Drbtree.h2 * Red-black search tree support
83 static inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size) argument
85 struct wine_rb_stack *stack = &tree->stack;
90 struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
180 static inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
184 if (!tree->root) return;
186 for (entry = &tree->root;;)
192 wine_rb_stack_push(&tree->stack, entry);
200 wine_rb_stack_push(&tree->stack, entry);
209 if (!tree
214 wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions) argument
227 wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
232 wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
241 wine_rb_get(const struct wine_rb_tree *tree, const void *key) argument
253 wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry) argument
294 wine_rb_remove(struct wine_rb_tree *tree, const void *key) argument
[all...]
/vbox/src/VBox/Devices/Graphics/shaderlib/wine/vbox/libWineStub/include/wine/
H A Drbtree.h2 * Red-black search tree support
89 static inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size) argument
91 struct wine_rb_stack *stack = &tree->stack;
96 struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
186 static inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
190 if (!tree->root) return;
192 for (entry = &tree->root;;)
198 wine_rb_stack_push(&tree->stack, entry);
206 wine_rb_stack_push(&tree->stack, entry);
215 if (!tree
220 wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions) argument
233 wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
238 wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
247 wine_rb_get(const struct wine_rb_tree *tree, const void *key) argument
259 wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry) argument
300 wine_rb_remove(struct wine_rb_tree *tree, const void *key) argument
[all...]
/vbox/src/VBox/Additions/WINNT/Graphics/Wine_new/vbox/libWineStub/include/wine/
H A Drbtree.h2 * Red-black search tree support
83 static inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size) argument
85 struct wine_rb_stack *stack = &tree->stack;
90 struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
180 static inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
184 if (!tree->root) return;
186 for (entry = &tree->root;;)
192 wine_rb_stack_push(&tree->stack, entry);
200 wine_rb_stack_push(&tree->stack, entry);
209 if (!tree
214 wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions) argument
227 wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
232 wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
241 wine_rb_get(const struct wine_rb_tree *tree, const void *key) argument
253 wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry) argument
294 wine_rb_remove(struct wine_rb_tree *tree, const void *key) argument
[all...]
/vbox/src/VBox/Additions/WINNT/Graphics/Wine/include/wine/
H A Drbtree.h2 * Red-black search tree support
83 static inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size) argument
85 struct wine_rb_stack *stack = &tree->stack;
90 struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
180 static inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
184 if (!tree->root) return;
186 for (entry = &tree->root;;)
192 wine_rb_stack_push(&tree->stack, entry);
200 wine_rb_stack_push(&tree->stack, entry);
209 if (!tree
214 wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions) argument
227 wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
232 wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
241 wine_rb_get(const struct wine_rb_tree *tree, const void *key) argument
253 wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry) argument
294 wine_rb_remove(struct wine_rb_tree *tree, const void *key) argument
[all...]
/vbox/src/VBox/Additions/WINNT/Graphics/Wine/vbox/libWineStub/include/wine/
H A Drbtree.h2 * Red-black search tree support
89 static inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size) argument
91 struct wine_rb_stack *stack = &tree->stack;
96 struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
186 static inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
190 if (!tree->root) return;
192 for (entry = &tree->root;;)
198 wine_rb_stack_push(&tree->stack, entry);
206 wine_rb_stack_push(&tree->stack, entry);
215 if (!tree
220 wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions) argument
233 wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
238 wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context) argument
247 wine_rb_get(const struct wine_rb_tree *tree, const void *key) argument
259 wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry) argument
300 wine_rb_remove(struct wine_rb_tree *tree, const void *key) argument
[all...]
/vbox/src/libs/zlib-1.2.6/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
87 /* The static literal tree. Since the bit lengths are imposed, there is no
89 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
94 /* The static distance tree. (Actually a trivial tree since all codes use
118 const ct_data *static_tree; /* static tree or NULL */
121 int elems; /* max number of elements in the tree */
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, in
492 ct_data *tree = desc->dyn_tree; local
621 ct_data *tree = desc->dyn_tree; local
[all...]
/vbox/src/VBox/Devices/EFI/Firmware/BaseTools/Source/C/VfrCompile/Pccts/antlr/
H A Dgen.c551 require(p!=NULL, "can't make context tree for NULL pred tree");
580 fatal_internal("pred tree is orphan OR or AND list");
586 fatal_internal("pred tree context is empty");
616 fatal("pred tree is really wacked");
955 fatal_internal("genPredTreeOrig: predicate tree is wacked");
1130 fatal_internal("predicate tree is wacked");
1200 require(t!=NULL, "genExprTreeOriginal: NULL tree");
1270 static void MR_genOneLine(Tree *tree,int k) argument
1272 static void MR_genOneLine(tree,
1303 MR_genMultiLine(Tree *tree,int k) argument
1361 genExprTree(Tree *tree,int k) argument
[all...]
H A Dmrhoist.c266 void MR_dumpTreeF(FILE *f,int depth,Tree *tree,int across) argument
268 void MR_dumpTreeF(f,depth,tree,across)
270 Tree *tree;
277 if (tree == NULL ) return;
278 if (tree->down != NULL ) {
283 if (tree->token == ALT ) {
285 } else if (tree->token==EpToken ) {
286 fprintf(output,"(%d)%13s",tree->v.rk," ");
288 fprintf(output," %-16s",TerminalString(tree->token));
290 if (tree
308 MR_dumpTreeX(int depth,Tree *tree,int across) argument
2276 MR_projectTreeOntoSet(Tree *tree,int ck,set *ckset) argument
2680 MR_suppressK_client(Tree *tree,int tokensInChain[]) argument
[all...]
/vbox/src/VBox/Additions/solaris/SharedFolders/
H A Dvboxfs_vnode.c121 * sfnode_compare() is needed for AVL tree functionality.
294 avl_tree_t *tree; local
307 tree = &stale_sfnodes;
309 tree = &sfnodes;
310 if (avl_find(tree, node, &where) == NULL)
312 avl_remove(tree, node);
/vbox/src/libs/libxml2-2.6.31/include/libxml/
H A Dtree.h2 * Summary: interfaces for tree manipulation
3 * Description: this module describes the structures found in an tree resulting
5 * various processing on that tree
62 * 2) when creating a tree, xmlNs->href is stored in the dict of xmlDoc.
110 * The different element types carried by an XML tree.
227 xmlEnumerationPtr tree; /* or the enumeration tree if any */ member in struct:_xmlAttribute
444 * A node in an XML tree.
497 struct _xmlNode *children; /* the document tree */
910 xmlSetTreeDoc (xmlNodePtr tree,
[all...]
/vbox/src/libs/libxml2-2.6.31/python/
H A Dlibxml.c19 #include <libxml/tree.h>
1155 const xmlChar * defaultValue, xmlEnumerationPtr tree)
1167 for (node = tree; node != NULL; node = node->next) {
1172 for (node = tree; node != NULL; node = node->next) {
1150 pythonAttributeDecl(void *user_data, const xmlChar * elem, const xmlChar * name, int type, int def, const xmlChar * defaultValue, xmlEnumerationPtr tree) argument

Completed in 550 milliseconds

12