/haiku-fatelf/src/bin/gdb/include/ |
H A D | demangle.h | 167 /* The V3 demangler works in two passes. The first pass builds a tree 169 tree representation into a demangled string. Here we define an 170 interface to permit a caller to build their own tree 176 /* These are the component types which may be found in the tree. Many 344 /* A node in the tree representation is an instance of a struct 499 demangle_component tree. The first argument is the mangled name. 501 tree on success, or NULL on failure. On success, the third 503 block should be passed to free when the tree is no longer 511 /* This function takes a struct demangle_component tree and returns 513 options. The second is the tree t [all...] |
/haiku-fatelf/src/documentation/docbook-xsl/extensions/saxon643/com/nwalsh/saxon/ |
H A D | UnwrapLinksEmitter.java | 10 import com.icl.saxon.tree.AttributeCollection; 13 * <p>Saxon extension to unwrap links in a result tree fragment.</p> 23 * <p>The general design is this: the stylesheets construct a result tree 24 * fragment for some environment. Then the result tree fragment 27 * new result tree fragment from this event stream with top-level links unwrapped.
|
/haiku-fatelf/src/tools/docbook/libxml2/ |
H A D | SAX.c | 2 * SAX.c : Old SAX v1 handlers to build a tree. 16 #include <libxml/tree.h>
|
H A D | debugXML.c | 2 * 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 D | legacy.c | 16 #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
|
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/ |
H A D | SAX.h | 4 * build the DOM tree. 81 xmlEnumerationPtr tree);
|
H A D | SAX2.h | 2 * Summary: SAX2 parser interface used to build the DOM tree 4 * the library when building DOM tree. 79 xmlEnumerationPtr tree);
|
H A D | catalog.h | 24 #include <libxml/tree.h>
|
H A D | xmlregexp.h | 42 #include <libxml/tree.h> 124 /* Expressions are trees but the tree is opaque */
|
H A D | xmlschemas.h | 19 #include <libxml/tree.h>
|
H A D | parserInternals.h | 387 xmlEnumerationPtr *tree); 390 xmlEnumerationPtr *tree);
|
H A D | valid.h | 16 #include <libxml/tree.h> 250 xmlEnumerationPtr tree);
|
/haiku-fatelf/src/tools/docbook/libxslt/libexslt/ |
H A D | saxon.c | 10 #include <libxml/tree.h>
|
H A D | sets.c | 10 #include <libxml/tree.h>
|
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/ |
H A D | keys.c | 18 #include <libxml/tree.h> 428 * current tree.
|
/haiku-fatelf/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_rssadapt.c | 343 struct sysctl_ctx_list *ctx, struct sysctl_oid *tree) 346 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 342 rssadapt_sysctlattach(struct ieee80211vap *vap, struct sysctl_ctx_list *ctx, struct sysctl_oid *tree) argument
|
/haiku-fatelf/data/etc/bash_completion.d/ |
H A D | git | 15 # *) tree paths within 'ref:path/to/file' expressions 288 elif [ "true" = "$(git rev-parse --is-inside-work-tree 2>/dev/null)" ]; then 659 # tree. __git_merge_strategies is set to the empty string in 697 -W "$(git --git-dir="$(__gitdir)" ls-tree "$ls" \ 706 /^040000 tree /{ 865 commit-tree) : plumbing;; 873 diff-tree) : plumbing;; 888 ls-tree) : plumbing;; 903 read-tree) : plumbing;; 919 tar-tree) [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | AVLTree.h | 41 // maximal height of a tree 227 Iterator(AVL_TREE_CLASS_NAME *tree) argument 232 if (tree) 233 tree->GetIterator(this); 281 inline void _SetTo(AVL_TREE_CLASS_NAME *tree, Node *node, argument 284 fTree = tree; 649 // tree is left heavy 676 // tree is right heavy 764 // tree is right heavy 794 // tree i [all...] |
/haiku-fatelf/src/libs/ncurses/test/ |
H A D | xmas.c | 139 static int tree(void); 475 tree(); 740 tree(void) function 938 /* save a fully lit tree */
|
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/ |
H A D | BPlusTree.cpp | 114 TreeCheck(BPlusTree* tree) argument 118 fNodeSize(tree->NodeSize()), 119 fMaxLevels(tree->fHeader.MaxNumberOfLevels()), 121 fVisited(tree->Stream()->Size() / tree->NodeSize()), 122 fVisitedFragment(tree->Stream()->Size() / tree->NodeSize()) 125 sizeof(off_t) * tree->fHeader.MaxNumberOfLevels()); 256 // The B+tree header has been updated - we need to update the 288 // even access the b+tree heade 2490 TreeIterator(BPlusTree* tree) argument [all...] |
H A D | kernel_interface.cpp | 581 BPlusTree* tree = directory->Tree(); local 582 if (tree == NULL) 585 status = tree->Find((uint8*)file, (uint16)strlen(file), _vnodeID); 1098 // Get the directory's tree, and a pointer to the inode which should be 1100 BPlusTree* tree = oldDirectory->Tree(); 1101 if (tree == NULL) 1105 status = tree->Find((const uint8*)oldName, strlen(oldName), &id); 1143 BPlusTree* newTree = tree; 1202 status = tree->Remove(transaction, (const uint8*)oldName, 1208 // in its tree i 1617 BPlusTree* tree = inode->Tree(); local [all...] |
/haiku-fatelf/src/bin/gawk/ |
H A D | awkgram.y | 3045 * tree, to make sure that all the subexpressions also have no effect. 3135 stopme(NODE *tree ATTRIBUTE_UNUSED) 3192 count_args(NODE *tree) 3197 assert(tree->type == Node_K_printf 3198 || (tree->type == Node_builtin && tree->builtin == do_sprintf)); 3199 save_tree = tree; 3201 tree = tree->lnode; /* printf format string */ 3203 for (count = 0; tree ! [all...] |
H A D | field.c | 796 do_split(NODE *tree) argument 804 src = force_string(tree_eval(tree->lnode)); 806 arr = get_param(tree->rnode->lnode); 810 sep = tree->rnode->rnode->lnode;
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_rate/sample/ |
H A D | sample.c | 973 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 975 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 979 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 984 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
|
/haiku-fatelf/src/bin/gdb/libiberty/ |
H A D | Makefile.in | 150 splay-tree.c stpcpy.c stpncpy.c strcasecmp.c strchr.c strdup.c \ 171 ./safe-ctype.o ./sort.o ./spaces.o ./splay-tree.o ./strerror.o \ 215 $(INCDIR)/splay-tree.h \ 869 ./splay-tree.o: $(srcdir)/splay-tree.c config.h $(INCDIR)/ansidecl.h \ 870 $(INCDIR)/libiberty.h $(INCDIR)/splay-tree.h 872 $(COMPILE.c) $(PICFLAG) $(srcdir)/splay-tree.c -o pic/$@; \ 874 $(COMPILE.c) $(srcdir)/splay-tree.c $(OUTPUT_OPTION)
|