Searched refs:tree (Results 201 - 225 of 694) sorted by relevance

1234567891011>>

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/
H A Dzlib.c315 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::__anon5041::__anon5042
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/
H A Dzlib.c315 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
4630 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon20257::__anon20258
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509/
H A Dx509_vfy.h255 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-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/include/openssl/
H A Dx509_vfy.h255 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-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/firewire/
H A Dcore-topology.c138 * setting the gap count. As we build the tree bottom up in
145 * containted in a child tree, in which case the max hop count is just
178 * This function builds the tree representation of the topology given
180 * of the tree, the function checks that the self IDs are valid and
405 struct fw_node *tree; local
408 tree = node1->ports[port];
409 node0->ports[port] = tree;
410 for (i = 0; i < tree->port_count; i++) {
411 if (tree->ports[i] == node1) {
412 tree
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/
H A Dtreectrl.tex14 A tree control presents information as a hierarchy, with items that may be expanded
15 to show further items. Items in a tree control are referenced by wxTreeItemId handles,
18 To intercept events from a tree control, use the event table macros described in \helpref{wxTreeEvent}{wxtreeevent}.
36 if you wish the user to be able to edit labels in the tree control.}
45 row of the tree control window. (This flag is ignored under Windows unless you
78 To process input from a tree control, use these event handler macros to direct input to member
116 library are known to have bugs with handling the tree control colours: the
135 Constructor, creating and showing a tree control.
163 Destructor, destroying the tree control.
171 Adds the root node to the tree, returnin
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/
H A Dauditfilter.c147 krule->watch || krule->inode_f || krule->tree ||
642 audit_tree_path(krule->tree));
694 if (strcmp(audit_tree_path(a->tree),
695 audit_tree_path(b->tree)))
776 * never dereferences tree and we can't get false positives there
781 new->tree = old->tree;
867 struct audit_tree *tree = entry->rule.tree; local
885 if (tree)
946 struct audit_tree *tree = entry->rule.tree; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/tc/
H A Dm_ematch.h126 static inline void print_ematch_tree(struct ematch *tree) argument
130 for (t = tree; t; t = t->next) {
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/include/libxml/
H A DdebugXML.h3 * Description: Interfaces to a set of routines used for debugging the tree
15 #include <libxml/tree.h>
193 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 DdebugXML.h3 * Description: Interfaces to a set of routines used for debugging the tree
15 #include <libxml/tree.h>
193 xmlNodePtr tree,
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/
H A Dvolumes.h155 void btrfs_mapping_init(struct btrfs_mapping_tree *tree);
156 void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfs/
H A Dbtree.h46 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-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/libxml/
H A DdebugXML.in.h3 * Description: Interfaces to a set of routines used for debugging the tree
15 #include <libxml/tree.h>
193 xmlNodePtr tree,
H A Dxinclude.c17 #include <libxml/tree.h>
90 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree);
882 * Build a node list tree copy of the XPointer result.
885 * The caller has to free the node tree.
916 * list is the pointer to the root of the output tree
917 * listParent is a pointer to the parent of output tree (within
919 * last is a pointer to the last node added to the output tree
924 * Check if our output tree needs a parent
1054 /* don't consider it part of the tree content */
1094 * Build a node list tree cop
2318 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree) argument
2434 xmlNodePtr tree; local
2496 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, int flags) argument
2525 xmlXIncludeProcessTree(xmlNodePtr tree) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/include/libxml/
H A DdebugXML.h3 * Description: Interfaces to a set of routines used for debugging the tree
15 #include <libxml/tree.h>
193 xmlNodePtr tree,
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/include/
H A Dantlr3basetreeadaptor.h2 * Definition of the ANTLR3 base tree adaptor.
76 void * (*dupTree) (struct ANTLR3_BASE_TREE_ADAPTOR_struct * adaptor, void * tree);
77 void * (*dupTreeTT) (struct ANTLR3_BASE_TREE_ADAPTOR_struct * adaptor, void * t, void * tree);
131 /// Produce a DOT (see graphviz freeware suite) from a base tree
139 /// If parent is null, don't do anything; must be at root of overall tree.
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/src/
H A Dantlr3rewritestreams.c2 /// Implementation of token/tree streams that are used by the
3 /// tree re-write rules to manipulate the tokens and trees produced
110 pANTLR3_BASE_TREE tree; local
117 // tree nodes. Hence we check to see if any of them were nilNodes as
128 tree = (pANTLR3_BASE_TREE)(stream->elements->elements[i-1].element);
129 if (tree != NULL && tree->isNilNode(tree))
132 // tree->reuse(tree);
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/mxml-2.7/
H A Dmxml.spec41 - Data is stored in a linked-list tree structure, preserving
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libcsc-0.82.3/include/
H A Dlibcsc.h58 11apr02 drj Added binary tree subsystem.
381 CSCbinTreeType const tree,
386 CSCbinTreeType const tree,
392 CSCbinTreeType const tree,
398 CSCbinTreeType const tree,
404 CSCbinTreeType const tree,
410 CSCbinTreeType const tree,
415 CSCbinTreeType const tree,
423 CSCbinTreeType const tree
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/libxml/
H A DdebugXML.in.h3 * Description: Interfaces to a set of routines used for debugging the tree
15 #include <libxml/tree.h>
193 xmlNodePtr tree,
H A Dxinclude.c17 #include <libxml/tree.h>
90 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree);
882 * Build a node list tree copy of the XPointer result.
885 * The caller has to free the node tree.
916 * list is the pointer to the root of the output tree
917 * listParent is a pointer to the parent of output tree (within
919 * last is a pointer to the last node added to the output tree
924 * Check if our output tree needs a parent
1054 /* don't consider it part of the tree content */
1094 * Build a node list tree cop
2318 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree) argument
2434 xmlNodePtr tree; local
2496 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, int flags) argument
2525 xmlXIncludeProcessTree(xmlNodePtr tree) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/
H A Dxinclude.c17 #include <libxml/tree.h>
90 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree);
895 * Build a node list tree copy of the XPointer result.
898 * The caller has to free the node tree.
929 * list is the pointer to the root of the output tree
930 * listParent is a pointer to the parent of output tree (within
932 * last is a pointer to the last node added to the output tree
937 * Check if our output tree needs a parent
1067 /* don't consider it part of the tree content */
1107 * Build a node list tree cop
2326 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree) argument
2442 xmlNodePtr tree; local
2504 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, int flags) argument
2533 xmlXIncludeProcessTree(xmlNodePtr tree) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/
H A Dxinclude.c17 #include <libxml/tree.h>
90 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree);
895 * Build a node list tree copy of the XPointer result.
898 * The caller has to free the node tree.
929 * list is the pointer to the root of the output tree
930 * listParent is a pointer to the parent of output tree (within
932 * last is a pointer to the last node added to the output tree
937 * Check if our output tree needs a parent
1067 /* don't consider it part of the tree content */
1107 * Build a node list tree cop
2326 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree) argument
2442 xmlNodePtr tree; local
2504 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, int flags) argument
2533 xmlXIncludeProcessTree(xmlNodePtr tree) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/doc/examples/
H A Dxpath2.c16 #include <libxml/tree.h>
156 * they get removed. Mixing XPath and modifications on a tree must be
165 * elements from the tree *except* namespace nodes where the XPath
166 * semantic is different from the implementation in libxml2 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 Dxpath2.c16 #include <libxml/tree.h>
156 * they get removed. Mixing XPath and modifications on a tree must be
165 * elements from the tree *except* namespace nodes where the XPath
166 * semantic is different from the implementation in libxml2 tree.

Completed in 301 milliseconds

1234567891011>>