Searched refs:item (Results 1 - 25 of 200) sorted by relevance

12345678

/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/pqueue/
H A Dpq_test.c65 pitem *item; local
70 item = pitem_new(3, NULL);
71 pqueue_insert(pq, item);
73 item = pitem_new(1, NULL);
74 pqueue_insert(pq, item);
76 item = pitem_new(2, NULL);
77 pqueue_insert(pq, item);
79 item = pqueue_find(pq, 1);
80 fprintf(stderr, "found %ld\n", item->priority);
82 item
[all...]
H A Dpqueue.c73 pitem *item = (pitem *) OPENSSL_malloc(sizeof(pitem)); local
74 if (item == NULL) return NULL;
76 memcpy(item->priority,prio64be,sizeof(item->priority));
78 item->data = data;
79 item->next = NULL;
81 return item;
85 pitem_free(pitem *item) argument
87 if (item == NULL) return;
89 OPENSSL_free(item);
111 pqueue_insert(pqueue_s *pq, pitem *item) argument
159 pitem *item = pq->items; local
205 pitem *item = pq->items; local
225 pqueue_next(pitem **item) argument
243 pitem *item = pq->items; local
[all...]
/barrelfish-2018-10-04/lib/bulk_transfer/backends/sm/
H A Dws_helpers.c12 errval_t bulk_sm_multiple_event_dispatch_non_block(struct bulk_sm_ws_item *item) argument
14 assert(item);
18 while (item) {
19 if (item->ws) {
20 err = event_dispatch_non_block(item->ws);
31 item = item->next;
43 errval_t bulk_sm_multiple_event_dispatch(struct bulk_sm_ws_item *item) argument
46 errval_t err = bulk_sm_multiple_event_dispatch_non_block(item);
/barrelfish-2018-10-04/tools/flounder/
H A Dintro.tex8 \item \verb!init_device_irq!
9 \item \verb!init_device!
10 \item \verb!get_cap!
15 \item \verb!transmit_next_cap_response!
16 \item \verb!transmit_next_cap_error!
17 \item \verb!init_device_error!
18 \item \verb!init_device_response!
26 \item \verb!if_service_response!:
28 \item \verb!if_server_response_vtbl *! \verb!f!
30 \item \ver
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Dinternal.tex108 \item[toplevel directory] Configuration and install scripts
109 \item[legal/] Licence texts.
111 \item[Kernel/] The kernel of the {\eclipse}, for historical reasons sometime
116 \item[src/] C sources and header files for the runtime
119 \item[lib/] Prolog and {\eclipse} sources
121 \item[kernel.pl,events.pl,...] Built-in predicate implementation
122 \item[lists.pl,calendar.ecl,...] Basic libraries
123 \item[version.pl] current patch number
127 \item[Shm/] A memory management library in C, used for heap management in
130 \item[ecrc_solver
[all...]
H A Dbuiltins.tex28 \item setof.pl
37 \item emu.c
38 \item bip_arith.c
39 \item bigrat.c
40 \item intervals.c
61 \item bip_array.c - nonlogical variables and arrays, references
62 \item bip_bag.c - bag built-ins
63 \item bip_record.c - record built-ins
64 \item bip_shelf.c - shelf built-ins
65 \item bip_stor
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Dkernel-lst.tex38 \item[bang_arity(+RelationName, ?Arity)]{Get the number of attributes in a relation.}
40 \item[bang_attribute(+RelationName, +Position, ?Spec)]{Get the specification of an attribute in a relation.}
42 \item[bang_cardinality(+RelationName, ?Count)]{Get the number of tuples in a relation.}
44 \item[bang_createrel(?RelationName, ?SpecList, +OptionList)]{Create a relation.}
46 \item[bang_delete(+RelationName, +Condition)]{Delete all tuples in relation that are selected by condition.}
48 \item[bang_delete_tup(+RelationName, +Tuple)]{Delete all occurrences of the tuple from the relation.}
50 \item[bang_delete_tup(+RelationName, +Tuple, -Status)]{Delete all occurrences of the tuple from the relation and return a status.}
52 \item[bang_destroyrel(+RelationName)]{Destroy a relation i.e. remove it from the database.}
54 \item[bang_diff(+Rel1, +Rel2, +Condition, +Projection, ?RelOut)]{Relational difference operation, also known as complementary join.}
56 \item[bang_dif
[all...]
H A Dknowbase-lst.tex36 \item[+RelationName \hspace {1mm} $<$$-$$-$$-$ \hspace {1mm} +Expression]{Set evaluation of a deductive algebraic expression and deletion from a deductive relation.}
38 \item[+RelationName \hspace {1mm} $<$+++ \hspace {1mm} +Expression]{Set evaluation of a deductive algebraic expression and insertion into a deductive relation.}
40 \item[+RelationName1 \hspace {1mm} $<$@@$>$ \hspace {1mm} +RelationName2]{Test for schema compatibility.}
42 \item[?RelationName \hspace {1mm} $<$$-$$-$$>$ \hspace {1mm} ?Synonym]{Add, remove or query synonyms for relations.}
44 \item[?RelationName \hspace {1mm} $<$==$>$ \hspace {1mm} ?SpecList)]{Create or remove a relation. Query relation format.}
46 \item[expand +Expression]{Set evaluation of a deductive algebraic expression and display on standard output.}
48 \item[?RelationName expand +Expression]{Set evaluation of a deductive algebraic expression and creation of a deductive target relation.}
50 \item[isdr +Expression]{Set evaluation of a deductive algebraic expression and display on standard output.}
52 \item[?RelationName isdr +Expression]{Set evaluation of a deductive algebraic expression and creation of a deductive target relation.}
54 \item[closek
[all...]
H A Ddatabase-lst.tex37 \item[+Expression \hspace{1mm} ++$>$ \hspace{1mm} ?TupleList]{Set retrieval specified by an algebraic expression.}
39 \item[+RelationName \hspace{1mm} $<$++ \hspace{1mm} +Expression]{Set insertion of an algebraic expression or a list of tuples.}
41 \item[+RelationName \hspace{1mm} $<$$-$$-$ \hspace{1mm} +Expression]{Set deletion of an algebraic expression or a list of tuples.}
43 \item[+RelationName1 \hspace{1mm} $<$@$>$ \hspace{1mm} +RelationName2]{Test for schema compatibility.}
45 \item[?RelationName \hspace{1mm} $<$$-$$>$ \hspace{1mm} ?Synonym]{Add, remove or query synonyms for relations.}
47 \item[?RelationName \hspace{1mm} $<$=$>$ \hspace{1mm} ?SpecList)]{Create or remove a relation. Query relation format.}
49 \item[?RelationName isr +Expression]{Set evaluation of an algebraic expression and creation of a target relation.}
51 \item[arity(+RelationName, ?Arity)]{Get the number of attributes in a relation.}
53 \item[cardinality(+RelationName, ?Count)]{Get the number of tuples in a relation.}
55 \item[del_tu
[all...]
/barrelfish-2018-10-04/lib/libc/stdlib/
H A Dhcreate.c60 hsearch(ENTRY item, ACTION action) argument
70 if (hsearch_r(item, action, &retval, &global_hashtable) == 0)
/barrelfish-2018-10-04/lib/vfs/
H A Dvfs_cache.h20 // - FS_CACHE_NOTPRESENT: There is no item with the given key in the cache.
21 errval_t fs_cache_acquire(struct fs_cache *cache, uint32_t key, void **item);
24 // fs_cache_release. Calling put multiple times with the same (key, item) pair
27 // - FS_CACHE_CONFLICT: An item with same key but different data pointer is
31 errval_t fs_cache_put(struct fs_cache *cache, uint32_t key, void *item);
36 // - FS_CACHE_NOTPRESENT: There is no item with the given key in the cache.
/barrelfish-2018-10-04/lib/libc/db/test/hash.tests/
H A Dtseq.c59 DBT item, key, res; local
71 * put info in structure, and structure in the item
73 for ( stat = (dbp->seq) (dbp, &res, &item, 1 );
75 stat = (dbp->seq) (dbp, &res, &item, 0 ) ) {
79 bcopy ( item.data, cp, item.size );
80 cp[item.size] = 0;
H A Dtcreat3.c58 DBT item, key; local
81 item.data = wp2;
86 * put info in structure, and structure in the item
89 item.size = strlen(wp2);
94 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
96 item.data);
H A Dtdel.c59 DBT item, key; local
83 item.data = wp2;
88 * put info in structure, and structure in the item
91 item.size = strlen(wp2);
96 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
98 item.data);
H A Dthash4.c61 DBT item, key, res; local
86 item.data = wp2;
91 * put info in structure, and structure in the item
94 item.size = strlen(wp2);
99 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
101 item.data);
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsstyle.tex33 \item There is one directory containing all code and its documentation (using
35 \item Filenames\index{file name} are of the form \notation{[a-z][a-z_]+} with
37 \item One file per module, one module per file.
38 \item Each module is documented with comment directives.
39 \item All required interfaces are defined in separate spec files which are
42 \item The actual data of the problem is loaded dynamically from the Java
45 \item The file name is equal to the module name.
46 \item Predicate names\index{predicate name} are of the form
49 \item Variable names\index{variable name} are of the form
52 \item Th
[all...]
H A Dumsflags.tex45 \newcommand{\idxnewitem}[1]{\index{#1}\item[#1]}
51 \item[Access mode : ] read/write
52 \item[Type : ] Integer
53 \item[Description : ] Specifies current nesting level of recursive
59 \item[Access mode : ] read/write
60 \item[Type : ] Atomic constant {\tt on} or {\tt off}
61 \item[Default : ] {\tt off}
62 \item[Description : ]
72 \item[Access mode : ] read/write
73 \item[Typ
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/demos/tunala/
H A Dtunala.c85 static int tunala_item_io(tunala_selector_t *selector, tunala_item_t *item);
565 * the next item is moving to us! */
591 /* Move to the next item */
953 tunala_item_t *item; local
964 item = world->tunnels + (world->tunnels_used++);
965 state_machine_init(&item->sm);
966 item->clean_read = item->clean_send =
967 item->dirty_read = item
995 tunala_item_t *item = world->tunnels + idx; local
1017 tunala_item_io(tunala_selector_t *selector, tunala_item_t *item) argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Pds/src/
H A Dnsrv_int.c80 ht_item_t * * item; /* hash table */ member in struct:__anon1733
153 ht_item_t * item; local
161 item = bport_id_htd->item[i];
162 while (item) {
163 printf(" key: %d \n", * (int *) item->key);
164 printf("signature: %s \n", item->signature);
165 printf(" bport_id: 0x%x \n", * (int *) item->data);
166 item = item
176 ht_item_t * item; local
495 ht_item_t * * item; local
524 ht_item_t * * item; local
872 ht_item_t * * item; local
924 ht_item_t * item; local
1544 ht_item_t * item; local
1640 ht_item_t * item; local
1735 ht_item_t * item; local
[all...]
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/
H A Dlinux_radix.c59 void *item; local
62 item = NULL;
70 item = node->slots[radix_pos(index, 0)];
72 out: return (item);
79 void *item; local
83 item = NULL;
97 item = node->slots[idx];
101 if (item)
117 out: return (item);
121 void *item) {
120 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/project/
H A Dorganisation.tex30 \item /usr/local/eclipse (alias /vol/members/Eclipse alias \verb.M:\Eclipse. on
35 \item /usr/local/eclipse/eclipse_home contains \eclipse\ development resources,
41 \item \htmladdnormallink{http://www.icparc.ic.ac.uk/eclipse/}
43 \item \htmladdnormallink{file:/usr/local/eclipse/eclipse_home/public_html/index.html}
48 \item \htmladdnormallink{http://www.icparc.ic.ac.uk/eclipse/icparc_only/index.html}
50 \item \htmladdnormallink{file:/usr/local/eclipse/eclipse_home/public_html/icparc_only/index.html}
55 \item \htmladdnormallink{file:/usr/local/eclipse/eclipse_home/EclipseForum/index.html}
84 \item[cvs] for version control
85 \item[tkcvs] a cvs gui
86 \item[gmak
[all...]
/barrelfish-2018-10-04/doc/013-capability-mgmt/
H A Dtype_system.tex12 \item[Name] Each type has a unique name.
14 \item[Origin] A capability type is either \emph{primitive}, which
23 \item[Retypability] Some types of capability may be \emph{retyped} to
28 \item[Mint parameters] It is possible to specify type-specific
33 \item[Interpretation of rights] The interpretation of the primitive
38 \item[Transferability to another core] Depending on its type, it may
41 \item[Last copy deleted] The type specific operations to perform when
46 \item[Concrete representations] Each capability type has one or more
52 \item[Invocations] Most capability types support one or more
93 \item[Origi
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/engine/
H A Deng_lib.c161 ENGINE_CLEANUP_ITEM *item = OPENSSL_malloc(sizeof( local
163 if(!item) return NULL;
164 item->cb = cb;
165 return item;
169 ENGINE_CLEANUP_ITEM *item; local
171 item = int_cleanup_item(cb);
172 if(item)
173 sk_ENGINE_CLEANUP_ITEM_insert(cleanup_stack, item, 0);
177 ENGINE_CLEANUP_ITEM *item; local
179 item
184 engine_cleanup_cb_free(ENGINE_CLEANUP_ITEM *item) argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsample.tex28 \item Prefer task-oriented structure over feature-oriented one.
31 \item Make short paragraphs with meaningful headings.
32 \item Don't use subsubsections.
33 \item Provide frequent summaries.
34 \item Go for 50\% examples or pictures.
35 \item Use tables and overviews where possible.
36 \item Refer to where more detailed documentation can be found.
42 \item
46 \item For pieces of code use
50 \item Fo
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/
H A Dbn_ctx.c81 /* How many bignums are in each "pool item"; */
159 BN_POOL_ITEM *item = ctx->pool.head; local
164 fprintf(stderr,"%03x ", item->vals[bnidx++ % BN_CTX_POOL_SIZE].dmax);
166 item = item->next;
386 BN_POOL_ITEM *item = p->head; local
387 while(item)
390 BIGNUM *bn = item->vals;
396 item = item
409 BN_POOL_ITEM *item = OPENSSL_malloc(sizeof(BN_POOL_ITEM)); local
[all...]

Completed in 220 milliseconds

12345678