Searched refs:tree (Results 1 - 25 of 89) sorted by relevance

1234

/barrelfish-master/lib/openssl-1.0.0d/crypto/x509v3/
H A Dpcy_lib.c70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
72 if (!tree)
74 return tree->nlevel;
78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument
80 if (!tree || (i < 0) || (i >= tree->nlevel))
82 return tree->levels + i;
86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)
88 if (!tree)
90 return tree
[all...]
H A Dpcy_tree.c65 /* Enable this to print out the complete policy tree at various point during
96 static void tree_print(char *str, X509_POLICY_TREE *tree, argument
105 curr = tree->levels + tree->nlevel;
109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
110 for (plev = tree->levels; plev != curr; plev++)
113 plev - tree->levels, plev->flags);
134 /* Initialize policy tree. Return values:
138 * 2 Policy tree is empty.
146 X509_POLICY_TREE *tree; local
374 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
402 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
442 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
504 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
586 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument
632 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument
696 tree_evaluate(X509_POLICY_TREE *tree) argument
728 X509_policy_tree_free(X509_POLICY_TREE *tree) argument
773 X509_POLICY_TREE *tree = NULL; local
[all...]
H A Dpcy_node.c115 X509_POLICY_TREE *tree)
144 if (tree)
146 if (!tree->extra_data)
147 tree->extra_data = sk_X509_POLICY_DATA_new_null();
148 if (!tree->extra_data)
150 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))
112 level_add_node(X509_POLICY_LEVEL *level, const X509_POLICY_DATA *data, X509_POLICY_NODE *parent, X509_POLICY_TREE *tree) argument
H A Dpcy_int.h159 /* This is the tree 'level' data */
207 X509_POLICY_TREE *tree);
H A Dv3_ncons.c180 GENERAL_SUBTREE *tree;
186 tree = sk_GENERAL_SUBTREE_value(trees, i);
188 if (tree->base->type == GEN_IPADD)
189 print_nc_ipadd(bp, tree->base->d.ip);
191 GENERAL_NAME_print(bp, tree->base);
/barrelfish-master/lib/dma/
H A Ddma_mem_mgr.c19 * XXX: we are using a ordered linked list here instead of a proper tree structure
25 * represents a tree of registered memory regions
62 static errval_t mem_tree_init(struct dma_mem_tree *tree) argument
64 tree->root = NULL;
65 tree->num_entries = 0;
76 static struct dma_mem_node *mem_tree_find_nearest(struct dma_mem_tree *tree, argument
79 struct dma_mem_node *node = tree->root;
80 struct dma_mem_node *ret = tree->root;
93 static struct dma_mem_node *mem_tree_lookup(struct dma_mem_tree *tree, argument
97 if (tree
115 mem_tree_insert(struct dma_mem_tree *tree, struct dma_mem_node *entry) argument
156 mem_tree_remove(struct dma_mem_tree *tree, lpaddr_t base) argument
[all...]
/barrelfish-master/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DTool.java62 * @param tree Tree, tree structure to display
64 public void handleTree(Tree tree){ argument
65 if (show.equals("tree") && type.equals("layout")) {
68 Layout layout = Layout.layoutNode(tree.getRootNode(),
69 compact,tree.getNrNodes()+1,1);
70 layout.draw(this,layout.getBox(),compact,tree.getNrNodes()+1,
73 for(int i=0; i< tree.getNrNodes();i++) {
74 Layout layout = Layout.layoutNode(tree.getRootNode(),compact,i,1);
81 for(int i=0; i< Math.min(-k,tree
[all...]
H A DViz.java42 static private Tree tree; field in class:Viz
46 * @param args String array with three entries config tree and viz files, all in XML format
68 * @param treeFilename String filename for the tree log
100 // the tree exists for marking purposes
101 tree = treeHandler.tree;
121 // run all Tree Tools on the tree data structure
123 tool.handleTree(tree);
159 Node node = tree.getMap().get(treeNode);
173 return getAttribute("show",attributes,"tree");
243 private Tree tree; field in class:Viz.TreeHandler
[all...]
/barrelfish-master/lib/zlib/
H A Dtrees.c12 * 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...]
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/
H A Dsrq.c9 * COPYING in the main directory of this source tree, or the
51 srq = radix_tree_lookup(&srq_table->tree, srqn & (priv->dev.caps.num_srqs - 1));
164 err = radix_tree_insert(&srq_table->tree, srq->srqn, srq);
202 radix_tree_delete(&srq_table->tree, srq->srqn);
219 radix_tree_delete(&srq_table->tree, srq->srqn);
263 INIT_RADIX_TREE(&srq_table->tree);
287 srq = radix_tree_lookup(&srq_table->tree, srqn & (priv->dev.caps.num_srqs - 1));
H A Dcq.c12 * COPYING in the main directory of this source tree, or the
72 cq = radix_tree_lookup(&priv->cq_table.tree,
101 cq = radix_tree_lookup(&cq_table->tree, cqn & (priv->dev.caps.num_cqs - 1));
299 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
344 radix_tree_delete(&cq_table->tree, cq->cqn);
367 radix_tree_delete(&cq_table->tree, cq->cqn);
384 INIT_RADIX_TREE(&cq_table->tree);
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dassoc.pl17 % Purpose: Binary tree implementation of "association lists".
22 % This stores association pairs in a tree structure; the empty tree
24 % empty tree
26 % To add to tree T the pair "bee-flea" giving the tree U
33 % Create a new tree by putting a new pair into an existing one.
36 put_assoc(Key, t, Val, New) :- !, % Empty tree
54 % get_assoc gets the Val associated with Key in a tree.
89 % Converts the tree t
[all...]
H A Dtrees.pl14 where N is the number of elements in the tree. The way get_label
16 is matched against the whole tree when the position number finally
21 to match the old tree and a pattern to match the new tree.
52 % treats the tree as an array of N elements and returns the Index-th.
96 % In fact this routine is perfectly happy constructing either tree given
113 % constructs a new tree the same shape as the old which moreover has the
155 % operation can be done by converting the tree to a list, mapping or
156 % checking the list, and converting the result, if any, back to a tree.
157 % It is also easier for a human to read a list than a tree, a
[all...]
/barrelfish-master/doc/003-hake/
H A DHake.tex29 \vhEntry{1.1}{11.04.2010}{TR}{Support for out-of-tree builds}
50 Suppose you have a fresh Barrelfish source tree in:
54 To build a tree, create a directory for it, \texttt{cd} to that
74 rebuild Hake to reconfigure your build tree.
86 around the source tree.
90 Hakefiles spread throughout the source tree.
96 the source tree.
100 When you run Hake in a Barrelfish source tree, it does the following things:
103 source tree. The list of files Hake ignores is currently hardcoded
106 \item From this, Hake extracts a list of all Hakefiles in the tree
[all...]
/barrelfish-master/usr/eclipseclp/Opium/demo/
H A Dyoyo2.pl26 Finding a minimum-cost spanning tree of a graph.
29 an arbitrary spanning tree in a graph, given on p. 231.
33 % mcs : minimum-cost spanning tree
42 tree(Tree),
45 tree(Graph) :-
H A Ddigin.pl21 CORRECT: all the possibilities to build a sorted binary tree \n\
27 % vertical display of a tree.
54 % to construct a tree
/barrelfish-master/usr/eclipseclp/Kernel/src/
H A Dsch_types.h57 /* EDGE of scheduler tree */
61 struct st_id_ds tree; /* SUP-tree|SUB-tree */ member in struct:st_edge_ds
67 /* KNOT of scheduler tree */
76 unsigned jroot:1; /* job-search tree root: Y/N */
/barrelfish-master/lib/openssl-1.0.0d/VMS/
H A Dinstall.com1 $! INSTALL.COM -- Installs the files in a given directory tree
6 $! P1 root of the directory tree
/barrelfish-master/lib/openssl-1.0.0d/apps/
H A Dinstall.com1 $! INSTALL.COM -- Installs the files in a given directory tree
6 $! P1 root of the directory tree
/barrelfish-master/lib/openssl-1.0.0d/crypto/x509/
H A Dx509_vfy.h261 X509_POLICY_TREE *tree; /* Valid policy tree */ member in struct:x509_store_ctx_st
540 void X509_policy_tree_free(X509_POLICY_TREE *tree);
542 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree);
544 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i);
547 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree); variable
550 X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree); variable
/barrelfish-master/include/openssl/
H A Dx509_vfy.h261 X509_POLICY_TREE *tree; /* Valid policy tree */ member in struct:x509_store_ctx_st
540 void X509_policy_tree_free(X509_POLICY_TREE *tree);
542 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree);
544 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i);
547 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree); variable
550 X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree); variable
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dsearch.tex110 Full tree search& complete& constructive& no\\
122 \index{tree search}
123 \index{search tree}
126 search tree (Figure \ref{figsearchtree}). The nodes in this tree
129 a tree structure, the search space can be traversed systematically and
136 \caption{Search space structured using a search tree}
139 Figure \ref{figtreesearch} shows a sample tree search, namely a depth-first
157 \caption{A tree search (depth-first)}
236 systematic tree searc
[all...]
/barrelfish-master/lib/openssl-1.0.0d/
H A Dinstall.com1 $! INSTALL.COM -- Installs the files in a given directory tree
6 $! P1 root of the directory tree
/barrelfish-master/lib/openssl-1.0.0d/ssl/
H A Dinstall.com1 $! INSTALL.COM -- Installs the files in a given directory tree
6 $! P1 root of the directory tree
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dheaps.pl42 A heap is a labelled binary tree where the key of each node is less
52 number of elements in the tree, Free is a list of integers which
53 specifies unused positions in the tree, and Tree is a tree made of
58 The nodes of the tree are notionally numbered like this:
67 the heap so far is M, and the tree currently has K elements, the tree
68 is some subtreee of the tree of this form having exactly M elements,
70 positions in the M-element tree are currently unoccupied. This free
89 insertion in the key. If the free list is empty, the tree wil
[all...]

Completed in 192 milliseconds

1234