/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/libxml2-2.7.2/doc/examples/ |
H A D | io1.c | 17 #include <libxml/tree.h>
|
H A D | parse4.c | 3 * synopsis: Parse an XML document chunk by chunk to a tree and free it 6 * into a tree and and xmlFreeDoc() to free the resulting tree 15 #include <libxml/tree.h> 41 * Parse the resource and free the resulting tree 47 xmlDocPtr doc; /* the resulting document tree */ 62 * are not used since we want to build a tree and not use a SAX
|
H A D | tree2.c | 3 * synopsis: Creates a tree 13 #include <libxml/tree.h> 115 fprintf(stderr, "tree support not compiled in\n");
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/libxml2-2.7.2/include/libxml/ |
H A D | pattern.h | 4 * either in a tree or based on a parser state. 15 #include <libxml/tree.h>
|
H A D | schematron.h | 18 #include <libxml/tree.h>
|
H A D | uri.h | 15 #include <libxml/tree.h> 48 * This function is in tree.h:
|
H A D | xlink.h | 14 #include <libxml/tree.h>
|
H A D | xmlsave.h | 14 #include <libxml/tree.h>
|
H A D | debugXML.h | 3 * Description: Interfaces to a set of routines used for debugging the tree 15 #include <libxml/tree.h> 193 xmlNodePtr tree,
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/libxml/ |
H A D | pattern.in.h | 4 * either in a tree or based on a parser state. 15 #include <libxml/tree.h>
|
H A D | schematron.in.h | 18 #include <libxml/tree.h>
|
H A D | uri.in.h | 15 #include <libxml/tree.h> 43 * This function is in tree.h:
|
H A D | xlink.in.h | 14 #include <libxml/tree.h>
|
H A D | xmlsave.in.h | 14 #include <libxml/tree.h>
|
H A D | debugXML.in.h | 3 * Description: Interfaces to a set of routines used for debugging the tree 15 #include <libxml/tree.h> 193 xmlNodePtr tree,
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/powerpc/kernel/ |
H A D | irq.c | 52 #include <linux/radix-tree.h> 549 /* radix tree not lockless safe ! we use a brlock-type mecanism 550 * for now, until we can use a lockless radix tree 753 /* Check if radix tree allocated yet */ 754 if (host->revmap_data.tree.gfp_mask == 0) 757 radix_tree_delete(&host->revmap_data.tree, hwirq); 810 struct radix_tree_root *tree; local 817 /* Check if the radix tree exist yet. We test the value of 821 tree = &host->revmap_data.tree; [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/hfsplus_journal/ |
H A D | inode.c | 45 struct hfs_btree *tree; local 52 tree = HFSPLUS_SB(sb).ext_tree; 55 tree = HFSPLUS_SB(sb).cat_tree; 58 tree = HFSPLUS_SB(sb).attr_tree; 64 if (tree->node_size >= PAGE_CACHE_SIZE) { 65 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); 66 spin_lock(&tree->hash_lock); 67 node = hfs_bnode_findhash(tree, nidx); 76 spin_unlock(&tree->hash_lock); 78 nidx = page->index << (PAGE_CACHE_SHIFT - tree [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/hfs/ |
H A D | inode.c | 53 struct hfs_btree *tree; local 60 tree = HFS_SB(sb)->ext_tree; 63 tree = HFS_SB(sb)->cat_tree; 69 if (tree->node_size >= PAGE_CACHE_SIZE) { 70 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); 71 spin_lock(&tree->hash_lock); 72 node = hfs_bnode_findhash(tree, nidx); 81 spin_unlock(&tree->hash_lock); 83 nidx = page->index << (PAGE_CACHE_SHIFT - tree->node_size_shift); 84 i = 1 << (PAGE_CACHE_SHIFT - tree [all...] |
H A D | btree.h | 46 struct hfs_btree *tree; member in struct:hfs_bnode 72 struct hfs_btree *tree; member in struct:hfs_find_data 134 #define HFS_NODE_HEADER 0x01 /* The tree header node (node 0) */ 139 __be16 depth; /* (V) The number of levels in this B-tree */ 157 #define HFS_NODE_HEADER 0x01 /* The tree header node (node 0) */ 161 #define BTREE_ATTR_BADCLOSE 0x00000001 /* b-tree not closed properly. not 167 b-tree but not in extents 168 b-tree (hfsplus). */
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 315 ush dad; /* father node in Huffman tree */ 328 ct_data *dyn_tree; /* the dynamic tree */ 330 static_tree_desc *stat_desc; /* the corresponding static tree */ 438 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 439 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 440 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 442 struct tree_desc_s l_desc; /* desc. for literal tree */ 443 struct tree_desc_s d_desc; /* desc. for distance tree */ 444 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 447 /* number of codes at each bit length for an optimal tree */ 2250 ct_data *tree = desc->dyn_tree; local 2379 ct_data *tree = desc->dyn_tree; local 4633 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon1501::__anon1502 [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/firewire/ |
H A D | fw-topology.c | 121 * setting the gap count. As we build the tree bottom up in 128 * containted in a child tree, in which case the max hop count is just 157 * build_tree - Build the tree representation of the topology 158 * @self_ids: array of self IDs to create the tree from 162 * This function builds the tree representation of the topology given 164 * of the tree, the function checks that the self IDs are valid and 382 struct fw_node *tree; local 385 tree = node1->ports[port].node; 386 node0->ports[port].node = tree; 387 for (i = 0; i < tree [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509/ |
H A D | x509_vfy.h | 255 X509_POLICY_TREE *tree; /* Valid policy tree */ member in struct:x509_store_ctx_st 504 void X509_policy_tree_free(X509_POLICY_TREE *tree); 506 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree); 508 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i); 511 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree); variable 514 X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree); variable
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/openssl-0.9.8e/include/openssl/ |
H A D | x509_vfy.h | 255 X509_POLICY_TREE *tree; /* Valid policy tree */ member in struct:x509_store_ctx_st 504 void X509_policy_tree_free(X509_POLICY_TREE *tree); 506 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree); 508 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i); 511 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree); variable 514 X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree); variable
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/libxml/ |
H A D | debugXML.in.h | 3 * Description: Interfaces to a set of routines used for debugging the tree 15 #include <libxml/tree.h> 193 xmlNodePtr tree,
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/iproute2/tc/ |
H A D | m_ematch.h | 126 static inline void print_ematch_tree(struct ematch *tree) argument 130 for (t = tree; t; t = t->next) {
|