/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/include/libxml/ |
H A D | xinclude.h | 17 #include <libxml/tree.h> 102 xmlXIncludeProcessTree (xmlNodePtr tree); 104 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 118 xmlNodePtr tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/ipkg-install/usr/include/libxml2/libxml/ |
H A D | xinclude.h | 17 #include <libxml/tree.h> 102 xmlXIncludeProcessTree (xmlNodePtr tree); 104 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 118 xmlNodePtr tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/ipkg-install/usr/share/doc/libxml2-2.7.2/html/ |
H A D | parse1.c | 3 * synopsis: Parse an XML file to a tree and free it 5 * into a tree and and xmlFreeDoc() to free the resulting tree 14 #include <libxml/tree.h> 20 * Parse the resource and free the resulting tree 24 xmlDocPtr doc; /* the resulting document tree */
|
H A D | parse3.c | 3 * synopsis: Parse an XML document in memory to a tree and free it 5 * into a tree and and xmlFreeDoc() to free the resulting tree 14 #include <libxml/tree.h> 23 * Parse the in memory document and free the resulting tree 27 xmlDocPtr doc; /* the resulting document tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
H A D | trees.c | 13 * 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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/libgrep/ |
H A D | kwset.c | 50 /* Balanced tree of edges and labels leaving a given trie node. */ 51 struct tree struct 53 struct tree *llink; /* Left link; MUST be first field. */ 54 struct tree *rlink; /* Right link (to larger labels). */ 64 struct tree *links; /* Tree of edges leaving this node. */ 131 register struct tree *link; 133 struct tree *links[12]; 135 struct tree *t, *r, *l, *rl, *lr; 147 /* Descend the tree of outgoing links for this trie node, 151 links[0] = (struct tree *) 283 enqueue(struct tree *tree, struct trie **last) argument 296 treefails(register struct tree const *tree, struct trie const *fail, struct trie *recourse) argument 331 treedelta(register struct tree const *tree, register unsigned int depth, unsigned char delta[]) argument 364 treenext(struct tree const *tree, struct trie *next[]) argument 591 register struct tree const *tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/libxml/ |
H A D | xinclude.in.h | 17 #include <libxml/tree.h> 102 xmlXIncludeProcessTree (xmlNodePtr tree); 104 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 118 xmlNodePtr tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/doc/examples/ |
H A D | parse1.c | 3 * synopsis: Parse an XML file to a tree and free it 5 * into a tree and and xmlFreeDoc() to free the resulting tree 14 #include <libxml/tree.h> 20 * Parse the resource and free the resulting tree 24 xmlDocPtr doc; /* the resulting document tree */
|
H A D | parse3.c | 3 * synopsis: Parse an XML document in memory to a tree and free it 5 * into a tree and and xmlFreeDoc() to free the resulting tree 14 #include <libxml/tree.h> 23 * Parse the in memory document and free the resulting tree 27 xmlDocPtr doc; /* the resulting document tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/include/libxml/ |
H A D | xinclude.h | 17 #include <libxml/tree.h> 102 xmlXIncludeProcessTree (xmlNodePtr tree); 104 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 118 xmlNodePtr tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/forked-daapd-0.19/src/ |
H A D | DAAPParser.h | 91 // initialized but unused variable - tree rewrite variables declared but not needed 110 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 114 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_query_return_struct 121 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 125 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_expr_return_struct 132 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 136 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_aexpr_return_struct 143 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 147 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_crit_return_struct
|
H A D | DAAPParser.c | 207 /* For use in tree output where we are accumulating rule labels via label += ruleRef 414 expr1.tree = NULL; 428 retval.tree = NULL; 442 CREATE_stream_expr; stream_expr->add(stream_expr, expr1.tree, NULL); 495 stream_retval=antlr3RewriteRuleSubtreeStreamNewAEE(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token retval", retval.tree != NULL ? retval.tree : NULL); 498 retval.tree = root_0; 505 retval.tree = root_0; // set result root 522 retval.tree = (pANTLR3_BASE_TREE)(ADAPTOR->rulePostProcessing(ADAPTOR, root_0)); 523 ADAPTOR->setTokenBoundaries(ADAPTOR, retval.tree, retva [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/forked-daapd-0.19/src/pregen/ |
H A D | DAAPParser.h | 91 // initialized but unused variable - tree rewrite variables declared but not needed 110 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 114 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_query_return_struct 121 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 125 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_expr_return_struct 132 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 136 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_aexpr_return_struct 143 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees 147 pANTLR3_BASE_TREE tree; member in struct:DAAPParser_crit_return_struct
|
H A D | DAAPParser.c | 207 /* For use in tree output where we are accumulating rule labels via label += ruleRef 414 expr1.tree = NULL; 428 retval.tree = NULL; 442 CREATE_stream_expr; stream_expr->add(stream_expr, expr1.tree, NULL); 495 stream_retval=antlr3RewriteRuleSubtreeStreamNewAEE(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token retval", retval.tree != NULL ? retval.tree : NULL); 498 retval.tree = root_0; 505 retval.tree = root_0; // set result root 522 retval.tree = (pANTLR3_BASE_TREE)(ADAPTOR->rulePostProcessing(ADAPTOR, root_0)); 523 ADAPTOR->setTokenBoundaries(ADAPTOR, retval.tree, retva [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
H A D | trees.c | 13 * 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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | trees.c | 32 * Each code tree is stored in the ZIP file in a compressed form 46 * left-to-right output (useful for code strings from the tree routines), 225 ush dad; /* father node in Huffman tree */ 238 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 239 local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */ 242 /* The static literal tree. Since the bit lengths are imposed, there is no 244 * The codes 286 and 287 are needed to build a canonical tree (see ct_init 249 /* The static distance tree. (Actually a trivial tree since all codes use 254 /* Huffman tree fo 642 ct_data near *tree = desc->dyn_tree; local 768 ct_data near *tree = desc->dyn_tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/libxml/ |
H A D | xinclude.in.h | 17 #include <libxml/tree.h> 102 xmlXIncludeProcessTree (xmlNodePtr tree); 104 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 118 xmlNodePtr tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/dtc/ |
H A D | dtc.c | 58 static void fill_fullpaths(struct node *tree, const char *prefix) argument 63 tree->fullpath = join_path(prefix, tree->name); 65 unit = strchr(tree->name, '@'); 67 tree->basenamelen = unit - tree->name; 69 tree->basenamelen = strlen(tree->name); 71 for_each_child(tree, child) 72 fill_fullpaths(child, tree [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | deftree.c | 13 * Each code tree is stored in a compressed form which is itself 88 /* The static literal tree. Since the bit lengths are imposed, there is no 90 * The codes 286 and 287 are needed to build a canonical tree (see zlib_tr_init 95 /* The static distance tree. (Actually a trivial tree since all codes use 115 const ct_data *static_tree; /* static tree or NULL */ 118 int elems; /* max number of elements in the tree */ 137 static void pqdownheap (deflate_state *s, ct_data *tree, int k); 139 static void gen_codes (ct_data *tree, int max_code, ush *bl_count); 141 static void scan_tree (deflate_state *s, ct_data *tree, in 371 pqdownheap( deflate_state *s, ct_data *tree, int k ) argument 412 ct_data *tree = desc->dyn_tree; local 495 gen_codes( ct_data *tree, int max_code, ush *bl_count ) argument 543 ct_data *tree = desc->dyn_tree; local 626 scan_tree( deflate_state *s, ct_data *tree, int max_code ) argument 672 send_tree( deflate_state *s, ct_data *tree, int max_code ) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/ |
H A D | ordered-data.c | 36 * in the tree 63 * look for a given offset in the tree, and if it can't be found return the 140 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, argument 143 struct rb_root *root = &tree->tree; 148 if (tree->last) { 149 entry = rb_entry(tree->last, struct btrfs_ordered_extent, 152 return tree->last; 158 tree->last = ret; 162 /* allocate and add a new ordered_extent into the per-inode tree 177 struct btrfs_ordered_inode_tree *tree; local 242 struct btrfs_ordered_inode_tree *tree; local 264 struct btrfs_ordered_inode_tree *tree; local 331 struct btrfs_ordered_inode_tree *tree; local 365 struct btrfs_ordered_inode_tree *tree; local 592 struct btrfs_ordered_inode_tree *tree; local 619 struct btrfs_ordered_inode_tree *tree; local 660 struct btrfs_ordered_inode_tree *tree; local 684 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; local 823 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/generic/ |
H A D | treebkg.cpp | 99 // no border for this control, it doesn't look nice together with the tree 180 wxTreeCtrl *tree = GetTreeCtrl(); 185 wxTreeItemId rootId = tree->GetRootItem(); 187 newId = tree->AppendItem(rootId, text, imageId); 193 wxTreeItemId previousId = tree->GetPrevSibling(nodeId); 194 wxTreeItemId parentId = tree->GetItemParent(nodeId); 199 newId = tree->InsertItem(parentId, previousId, text, imageId); 205 newId = tree->PrependItem(parentId, text, imageId); 227 wxTreeCtrl *tree = GetTreeCtrl(); local 229 wxTreeItemId rootId = tree 252 wxTreeCtrl *tree = GetTreeCtrl(); local 297 wxTreeCtrl *tree = GetTreeCtrl(); local 334 wxTreeCtrl *tree = GetTreeCtrl(); local 399 wxTreeCtrl *tree = GetTreeCtrl(); local 597 wxTreeCtrl *tree = GetTreeCtrl(); local 757 const wxTreeCtrl * const tree = GetTreeCtrl(); local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/x509v3/ |
H A D | pcy_node.c | 114 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
|