/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/include/ |
H A D | antlr3commontree.h | 1 /** Interface for an ANTLR3 common tree which is what gets 54 /// Start token index that encases this tree 58 /// End token that encases this tree 62 /// A single token, this is the payload for the tree 76 /// Pointer to the tree factory that manufactured this 78 /// to manufacture another auto-tracked common tree structure 85 /// payload. You can further abstract common tree so long 90 /// general tree duplication stuff. 95 /// the tree adaptor (see comments there) should allocate the 101 /// JIMS_TREE (note that the base tree i [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/libxml/ |
H A D | c14n.in.h | 27 #include <libxml/tree.h>
|
H A D | dict.in.h | 15 #include <libxml/tree.h>
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/avahi-0.6.25/avahi-sharp/ |
H A D | Makefile.am | 67 avahi-sharp-docs.zip: avahi-sharp-docs.tree 69 avahi-sharp-docs.tree: $(srcdir)/en/*/* 73 monodoc_DATA = avahi-sharp-docs.zip avahi-sharp-docs.tree avahi-sharp-docs.source
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/avahi-0.6.25/avahi-ui-sharp/ |
H A D | Makefile.am | 54 avahi-ui-sharp-docs.zip: avahi-ui-sharp-docs.tree 56 avahi-ui-sharp-docs.tree: $(srcdir)/en/*/* 60 monodoc_DATA = avahi-ui-sharp-docs.zip avahi-ui-sharp-docs.tree avahi-ui-sharp-docs.source
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/avahi-0.6.25/avahi-sharp/ |
H A D | Makefile.am | 67 avahi-sharp-docs.zip: avahi-sharp-docs.tree 69 avahi-sharp-docs.tree: $(srcdir)/en/*/* 73 monodoc_DATA = avahi-sharp-docs.zip avahi-sharp-docs.tree avahi-sharp-docs.source
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/avahi-0.6.25/avahi-ui-sharp/ |
H A D | Makefile.am | 54 avahi-ui-sharp-docs.zip: avahi-ui-sharp-docs.tree 56 avahi-ui-sharp-docs.tree: $(srcdir)/en/*/* 60 monodoc_DATA = avahi-ui-sharp-docs.zip avahi-ui-sharp-docs.tree avahi-ui-sharp-docs.source
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/ |
H A D | compression.c | 166 struct extent_io_tree *tree; local 190 tree = &BTRFS_I(inode)->io_tree; 278 struct extent_io_tree *tree; local 297 tree = &BTRFS_I(inode)->io_tree; 299 tree->ops->writepage_end_io_hook(cb->compressed_pages[0], 449 struct extent_io_tree *tree; local 456 tree = &BTRFS_I(inode)->io_tree; 497 lock_extent(tree, last_offset, end, GFP_NOFS); 507 unlock_extent(tree, last_offset, end, GFP_NOFS); 535 unlock_extent(tree, last_offse 561 struct extent_io_tree *tree; local [all...] |
H A D | ordered-data.h | 25 struct rb_root tree; member in struct:btrfs_ordered_inode_tree 32 * checksum items are inserted into the tree after all the blocks in 58 * It is used to make sure metadata is inserted into the tree only once 63 * IO is done and any metadata is inserted into the tree. 67 #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */ 134 t->tree = RB_ROOT;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/tc/ |
H A D | m_ematch.c | 175 static int parse_tree(struct nlmsghdr *n, struct ematch *tree) argument 180 for (t = tree; t; t = t->next) { 229 static int flatten_tree(struct ematch *head, struct ematch *tree) argument 237 if (tree->child) { 239 t->next = tree->child; 240 count += flatten_tree(head, tree->child); 243 if (tree->relation == 0) 246 tree = tree->next; 476 fprintf(stderr, "Missing ematch tree heade [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/mlx4/ |
H A D | srq.c | 8 * COPYING in the main directory of this source tree, or the 67 srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1)); 134 err = radix_tree_insert(&srq_table->tree, srq->srqn, srq); 171 radix_tree_delete(&srq_table->tree, srq->srqn); 197 radix_tree_delete(&srq_table->tree, srq->srqn); 244 INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC);
|
H A D | cq.c | 11 * COPYING in the main directory of this source tree, or the 80 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree, 99 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1)); 219 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq); 258 radix_tree_delete(&cq_table->tree, cq->cqn); 287 radix_tree_delete(&cq_table->tree, cq->cqn); 305 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/dtc/ |
H A D | dtc.h | 190 struct node *get_node_by_path(struct node *tree, const char *path); 191 struct node *get_node_by_label(struct node *tree, const char *label); 192 struct node *get_node_by_phandle(struct node *tree, cell_t phandle); 193 struct node *get_node_by_ref(struct node *tree, const char *ref); 196 /* Boot info (tree plus memreserve information */ 215 struct node *dt; /* the device tree */ 220 struct node *tree, uint32_t boot_cpuid_phys);
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ocfs2/ |
H A D | refcounttree.c | 206 struct ocfs2_refcount_tree *tree = NULL; local 209 tree = rb_entry(n, struct ocfs2_refcount_tree, rf_node); 211 if (blkno < tree->rf_blkno) 213 else if (blkno > tree->rf_blkno) 216 return tree; 253 static void ocfs2_free_refcount_tree(struct ocfs2_refcount_tree *tree) argument 255 ocfs2_metadata_cache_exit(&tree->rf_ci); 256 ocfs2_simple_drop_lockres(OCFS2_SB(tree->rf_sb), &tree->rf_lockres); 257 ocfs2_lock_res_free(&tree 262 ocfs2_erase_refcount_tree_from_list_no_lock(struct ocfs2_super *osb, struct ocfs2_refcount_tree *tree) argument 270 ocfs2_erase_refcount_tree_from_list(struct ocfs2_super *osb, struct ocfs2_refcount_tree *tree) argument 280 struct ocfs2_refcount_tree *tree = local 287 ocfs2_refcount_tree_get(struct ocfs2_refcount_tree *tree) argument 293 ocfs2_refcount_tree_put(struct ocfs2_refcount_tree *tree) argument 336 struct ocfs2_refcount_tree *tree, *new = NULL; local 424 __ocfs2_lock_refcount_tree(struct ocfs2_super *osb, struct ocfs2_refcount_tree *tree, int rw) argument 458 struct ocfs2_refcount_tree *tree = NULL; local 526 ocfs2_unlock_refcount_tree(struct ocfs2_super *osb, struct ocfs2_refcount_tree *tree, int rw) argument 541 struct ocfs2_refcount_tree *tree; local 570 struct ocfs2_refcount_tree *new_tree = NULL, *tree = NULL; local 2292 struct ocfs2_refcount_tree *tree; local 2531 struct ocfs2_refcount_tree *tree; local [all...] |
H A D | refcounttree.h | 38 struct ocfs2_refcount_tree **tree, 41 struct ocfs2_refcount_tree *tree, 62 * Some refcount caller need to do more work after we modify the data b-tree
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/ |
H A D | testRelax.c | 51 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");
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/ |
H A D | testRelax.c | 51 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");
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/include/libxml/ |
H A D | Makefile.am | 15 tree.h \
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/powerpc/include/asm/ |
H A D | irq.h | 14 #include <linux/radix-tree.h> 59 * we use an open firmware device-tree. We do have references to struct 94 /* Translate device-tree interrupt specifier from raw format coming 115 #define IRQ_HOST_MAP_TREE 3 /* radix tree */ 121 struct radix_tree_root tree; member in union:irq_host::__anon9934 147 * @of_node: optional device-tree node of the interrupt controller 157 * this call as well. For a IRQ_HOST_MAP_TREE, the radix tree will be allocated 170 * @node: device-tree node of the interrupt controller 182 * aren't properly represented in the device-tree. 245 * This is for use by irq controllers that use a radix tree revers [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/netatalk-2.2.5/contrib/misc/ |
H A D | cnid.lua | 36 local function fname(buffer, pinfo, tree, len, ofs) 40 local subtree = tree:add(buffer(ofs, len +4), buffer(ofs +4, len):string()) 47 function dbd_proto.dissector(buffer, pinfo, tree) 52 local subtree = tree:add(dbd_proto,buffer(),"Netatalk DBD Wire Protocol")
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/include/libxml/ |
H A D | Makefile.am | 15 tree.h \
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavutil/ |
H A D | Makefile | 72 tree.o \ 80 md5 opt parseutils rational sha tree
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 190 ush dad; /* father node in Huffman tree */ 203 ct_data *dyn_tree; /* the dynamic tree */ 205 static_tree_desc *stat_desc; /* the corresponding static tree */ 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 317 struct tree_desc_s l_desc; /* desc. for literal tree */ 318 struct tree_desc_s d_desc; /* desc. for distance tree */ 319 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 322 /* number of codes at each bit length for an optimal tree */ 1852 ct_data *tree = desc->dyn_tree; local 1981 ct_data *tree = desc->dyn_tree; local 4103 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon5078::__anon5079 [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/ |
H A D | zlib.c | 190 ush dad; /* father node in Huffman tree */ 203 ct_data *dyn_tree; /* the dynamic tree */ 205 static_tree_desc *stat_desc; /* the corresponding static tree */ 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 317 struct tree_desc_s l_desc; /* desc. for literal tree */ 318 struct tree_desc_s d_desc; /* desc. for distance tree */ 319 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 322 /* number of codes at each bit length for an optimal tree */ 1852 ct_data *tree = desc->dyn_tree; local 1981 ct_data *tree = desc->dyn_tree; local 4103 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon20292::__anon20293 [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/doc/examples/ |
H A D | io1.c | 17 #include <libxml/tree.h>
|