Searched refs:tree (Results 76 - 100 of 694) sorted by relevance

1234567891011>>

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/x509v3/
H A Dpcy_node.c114 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
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/util/
H A Dtoutf8.sh5 git ls-tree -r --name-only HEAD | \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/util/
H A Dtoutf8.sh5 git ls-tree -r --name-only HEAD | \
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/mips/fw/arc/
H A DMakefile6 misc.o salone.o time.o tree.o
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/forked-daapd-0.19/src/
H A DRSPParser.c238 /* For use in tree output where we are accumulating rule labels via label += ruleRef
541 expr1.tree = NULL;
555 retval.tree = NULL;
569 CREATE_stream_expr; stream_expr->add(stream_expr, expr1.tree, NULL);
622 stream_retval=antlr3RewriteRuleSubtreeStreamNewAEE(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token retval", retval.tree != NULL ? retval.tree : NULL);
625 retval.tree = root_0;
632 retval.tree = root_0; // set result root
649 retval.tree = (pANTLR3_BASE_TREE)(ADAPTOR->rulePostProcessing(ADAPTOR, root_0));
650 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 DRSPParser.c238 /* For use in tree output where we are accumulating rule labels via label += ruleRef
541 expr1.tree = NULL;
555 retval.tree = NULL;
569 CREATE_stream_expr; stream_expr->add(stream_expr, expr1.tree, NULL);
622 stream_retval=antlr3RewriteRuleSubtreeStreamNewAEE(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token retval", retval.tree != NULL ? retval.tree : NULL);
625 retval.tree = root_0;
632 retval.tree = root_0; // set result root
649 retval.tree = (pANTLR3_BASE_TREE)(ADAPTOR->rulePostProcessing(ADAPTOR, root_0));
650 ADAPTOR->setTokenBoundaries(ADAPTOR, retval.tree, retva
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/
H A Dgzip.c712 * Each code tree is stored in the ZIP file in a compressed form
787 /* number of codes at each bit length for an optimal tree */
846 ush dad; /* father node in Huffman tree */
860 ct_data *dyn_tree; /* the dynamic tree */
861 ct_data *static_tree; /* corresponding static tree or NULL */
864 int elems; /* max number of elements in the tree */
879 ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */
880 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */
884 /* The static literal tree. Since the bit lengths are imposed, there is no
886 * The codes 286 and 287 are needed to build a canonical tree (se
1027 pqdownheap(ct_data * tree, int k) argument
1064 ct_data *tree = desc->dyn_tree; local
1158 gen_codes(ct_data * tree, int max_code) argument
1218 ct_data *tree = desc->dyn_tree; local
1308 scan_tree(ct_data * tree, int max_code) argument
1361 send_tree(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 Dextent_map.c28 * extent_map_tree_init - initialize extent map tree
29 * @tree: tree to initialize
30 * @mask: flags for memory allocations during tree operations
32 * Initialize the extent tree @tree. Should be called for each new inode
35 void extent_map_tree_init(struct extent_map_tree *tree, gfp_t mask) argument
37 tree->map = RB_ROOT;
38 rwlock_init(&tree->lock);
108 * search through the tree fo
186 unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len) argument
246 add_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) argument
313 lookup_extent_mapping(struct extent_map_tree *tree, u64 start, u64 len) argument
365 search_extent_mapping(struct extent_map_tree *tree, u64 start, u64 len) argument
410 remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/
H A Dvp56.h326 const VP56Tree *tree,
329 while (tree->val > 0) {
330 if (vp56_rac_get_prob(c, probs[tree->prob_idx]))
331 tree += tree->val;
333 tree++;
335 return -tree->val;
344 int vp8_rac_get_tree_with_offset(VP56RangeCoder *c, const int8_t (*tree)[2], argument
348 i = tree[i][vp56_rac_get_prob(c, probs[i])];
357 int vp8_rac_get_tree(VP56RangeCoder *c, const int8_t (*tree)[ argument
325 vp56_rac_get_tree(VP56RangeCoder *c, const VP56Tree *tree, const uint8_t *probs) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/
H A Dtags.sh24 tree=
26 tree=${srctree}/
33 for arch in `ls ${tree}arch`; do
51 find ${tree}arch/$1 $ignore $prune -name "$2" -print;
57 include=$(find ${tree}arch/$1/ -name include -type d);
67 find ${tree}include $ignore -name config -prune -o -name "$1" -print;
70 # find sources in rest of tree
74 find ${tree}* $ignore \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/regex/
H A Dregc_color.c55 union tree *t;
56 union tree *nextt;
73 /* upper levels of tree */
74 for (t = &cm->tree[0], j = NBYTS-1; j > 0; t = nextt, j--) {
80 t = &cm->tree[NBYTS-1];
95 union tree *cb;
99 cmtreefree(cm, cm->tree, 0);
111 - cmtreefree - free a non-terminal part of a colormap tree
112 ^ static VOID cmtreefree(struct colormap *, union tree *, int);
115 cmtreefree(cm, tree, leve
[all...]
H A Dregguts.h179 * A colormap is a tree -- more precisely, a DAG -- indexed at each level
181 * lower sections of the tree can be shared, it can exploit the usual
182 * sparseness of such a mapping table. The tree is always NBYTS levels
188 /* the tree itself */
193 union tree *pptr[BYTTAB];
195 union tree { union
212 union tree *block; /* block of solid color, if any */
227 union tree tree[NBYTS]; /* tree to member in struct:colormap
409 struct subre *tree; member in struct:guts
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/aMule-2.3.1/src/webserver/default/
H A DMakefile.am65 tree-closed.gif \
66 tree-leaf.gif \
67 tree-open.gif \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509v3/
H A Dv3_ncons.c173 GENERAL_SUBTREE *tree;
179 tree = sk_GENERAL_SUBTREE_value(trees, i);
181 if (tree->base->type == GEN_IPADD)
182 print_nc_ipadd(bp, tree->base->d.ip);
184 GENERAL_NAME_print(bp, tree->base);
185 tree = sk_GENERAL_SUBTREE_value(trees, i);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/doc/examples/
H A Dparse2.c3 * synopsis: Parse and validate an XML file to a tree and free the result
5 * the file, creating a tree, check the validation result
6 * and xmlFreeDoc() to free the resulting tree.
15 #include <libxml/tree.h>
21 * Parse and validate the resource and free the resulting tree
26 xmlDocPtr doc; /* the resulting document 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 Dparse2.c3 * synopsis: Parse and validate an XML file to a tree and free the result
5 * the file, creating a tree, check the validation result
6 * and xmlFreeDoc() to free the resulting tree.
15 #include <libxml/tree.h>
21 * Parse and validate the resource and free the resulting tree
26 xmlDocPtr doc; /* the resulting document tree */
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ocfs2/
H A Duptodate.c174 unsigned int tree, to_purge, purged; local
180 tree = !(ci->ci_flags & OCFS2_CACHE_FL_INLINE);
184 tree ? "array" : "tree",
187 /* If we're a tree, save off the root so that we can safely
188 * initialize the cache. We do the work to free tree members
190 if (tree)
200 if (tree && purged != to_purge)
317 * exist in the tree.
359 /* tree shoul
364 ocfs2_expand_cache(struct ocfs2_caching_info *ci, struct ocfs2_meta_cache_item **tree) argument
405 struct ocfs2_meta_cache_item *tree[OCFS2_CACHE_INFO_MAX_ARRAY] = local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/examples/libsmbclient/
H A DMakefile18 tree \
35 tree: tree.o
36 @echo Linking tree
H A Dtree.c4 SMB client GTK+ tree-based application
24 /* example-gtk+ application, ripped off from the gtk+ tree.c sample */
35 guint32 type; /* Type of tree item, an SMBC_TYPE */
70 * We walk back up the tree, picking up pieces until we hit a server or
83 /* Walk back up the tree, getting the private data */
158 g_print ("select_child called for root tree %p, subtree %p, child %p\n",
311 g_print ("unselect_child called for root tree %p, subtree %p, child %p\n",
332 /* Get the level of the tree which the item is in */
408 /* Add it to the parent tree */
458 static void cb_selection_changed( GtkWidget *tree )
614 GtkWidget *window, *scrolled_win, *scrolled_win2, *tree; local
685 GTK_SIGNAL_FUNC(cb_select_child), tree); local
687 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local
689 GTK_SIGNAL_FUNC(cb_selection_changed), tree); local
692 tree); local
742 GTK_SIGNAL_FUNC(cb_select_child), tree); local
744 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local
796 GTK_SIGNAL_FUNC(cb_select_child), tree); local
798 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/doc/examples/
H A Dparse2.c3 * synopsis: Parse and validate an XML file to a tree and free the result
5 * the file, creating a tree, check the validation result
6 * and xmlFreeDoc() to free the resulting tree.
15 #include <libxml/tree.h>
21 * Parse and validate the resource and free the resulting tree
26 xmlDocPtr doc; /* the resulting document tree */
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/client/
H A Dtree.c3 SMB client GTK+ tree-based application
23 /* example-gtk+ application, ripped off from the gtk+ tree.c sample */
34 guint32 type; /* Type of tree item, an SMBC_TYPE */
68 * We walk back up the tree, picking up pieces until we hit a server or
81 /* Walk back up the tree, getting the private data */
156 g_print ("select_child called for root tree %p, subtree %p, child %p\n",
309 g_print ("unselect_child called for root tree %p, subtree %p, child %p\n",
330 /* Get the level of the tree which the item is in */
406 /* Add it to the parent tree */
456 static void cb_selection_changed( GtkWidget *tree )
612 GtkWidget *window, *scrolled_win, *scrolled_win2, *tree; local
683 GTK_SIGNAL_FUNC(cb_select_child), tree); local
685 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local
687 GTK_SIGNAL_FUNC(cb_selection_changed), tree); local
690 tree); local
740 GTK_SIGNAL_FUNC(cb_select_child), tree); local
742 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local
794 GTK_SIGNAL_FUNC(cb_select_child), tree); local
796 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/dtc/
H A Dtreesource.c39 die("Unable to parse input tree\n");
42 die("Syntax error parsing input tree\n");
233 static void write_tree_source_node(FILE *f, struct node *tree, int level) argument
239 if (tree->label)
240 fprintf(f, "%s: ", tree->label);
241 if (tree->name && (*tree->name))
242 fprintf(f, "%s {\n", tree->name);
246 for_each_property(tree, prop) {
253 for_each_child(tree, chil
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/
H A Dzdeflate.cpp110 SecBlockWithHint<HuffmanNode, 2*286> tree(nCodes);
113 tree[i].symbol = i;
114 tree[i].freq = codeCounts[i];
116 sort(tree.begin(), tree.end(), FreqLessThan());
117 size_t treeBegin = upper_bound(tree.begin(), tree.end(), 0, FreqLessThan()) - tree.begin();
123 tree.resize(nCodes + nCodes - treeBegin - 1);
126 for (i=nCodes; i<tree
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/
H A Dtreedata.tex5 destroyed automatically by the tree and, as this class has virtual destructor,
6 it means that the memory and any other resources associated with a tree item
9 critical: in many applications, each tree leaf will have wxTreeItemData
12 Also please note that because the objects of this class are deleted by the tree
38 associated with the tree item using the wxTreeItemData as a
H A Dttreectl.tex5 The tree control displays its items in a tree like structure. Each item has its
8 shown). Each item in the tree is identified by its {\it itemId} which is of
32 with all tree items. If you wish to do it, you should derive a class from {\it
38 \helpref{SetItemData(NULL)}{wxtreectrlsetitemdata} to prevent the tree from
43 the tree at the moment of its creation. However, for large trees it may be
45 items to the tree until the branch containing the items is expanded: so, in the
53 The tree control provides functions for enumerating its items. There are 3
59 is opaque to the caller but is used by the tree control itself to allow
66 Among other features of the tree contro
[all...]

Completed in 148 milliseconds

1234567891011>>