Searched refs:curr (Results 1 - 16 of 16) sorted by relevance

/barrelfish-2018-10-04/usr/replay/
H A Dhash.c26 hash_entry_t *curr; local
32 for (curr = hash->table[i]; curr != NULL; curr = curr->next)
33 printf("[%lu] => %lu", curr->key, curr->val);
42 hash_entry_t *curr; local
44 for (curr = hash->table[i]; curr !
55 hash_entry_t *new_entry, *curr; local
83 hash_entry_t *curr; local
105 hash_entry_t *curr, *prev; local
[all...]
/barrelfish-2018-10-04/usr/bench/mdb_bench/
H A Dold_mdb.c31 struct cte *curr = old_start; local
33 int cmp = compare_caps(C(curr), C(cte), true);
38 curr = N(curr)->right;
39 if (curr == old_start) {
44 N(cte)->left = N(curr)->left;
45 N(cte)->right = curr;
87 for (struct cte *curr = N(cte)->right;
88 curr != cte;
89 curr
[all...]
H A Dmain.c64 struct capability *curr = &cte->cap; local
65 assert(curr->type == ObjType_RAM);
67 name, num_caps, run, curr->u.ram.base, curr->u.ram.bytes,
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509v3/
H A Dpcy_tree.c97 X509_POLICY_LEVEL *curr)
104 if (!curr)
105 curr = tree->levels + tree->nlevel;
107 curr++;
109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
110 for (plev = tree->levels; plev != curr; plev++)
310 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument
313 X509_POLICY_LEVEL *last = curr - 1;
322 if (!level_add_node(curr, data, node, NULL))
329 if (!level_add_node(curr, dat
96 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
340 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument
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
589 X509_POLICY_LEVEL *curr; local
699 X509_POLICY_LEVEL *curr = tree->levels + 1; local
730 X509_POLICY_LEVEL *curr; local
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ssl/
H A Dssl_ciph.c596 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, argument
599 if (curr == *tail) return;
600 if (curr == *head)
601 *head=curr->next;
602 if (curr->prev != NULL)
603 curr->prev->next=curr->next;
604 if (curr->next != NULL)
605 curr->next->prev=curr
612 ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument
850 CIPHER_ORDER *head, *tail, *curr, *curr2, *last; local
978 CIPHER_ORDER *curr; local
1284 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
[all...]
/barrelfish-2018-10-04/usr/monitor/capops/
H A Ddeletestep.c207 struct delete_queue_node *curr = pending_head; local
211 for ( ; curr; curr = curr->next) {
212 DEBUG_CAPOPS("%s: adding %p to ev q.\n", __FUNCTION__, curr);
213 event_queue_add(&delete_queue, &curr->qn, curr->cont);
/barrelfish-2018-10-04/lib/zlib/
H A Dinftrees.c44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
205 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/pqueue/
H A Dpqueue.c113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
123 curr = next, next = next->next)
132 if (curr == NULL)
135 curr->next = item;
145 curr->next = item;
/barrelfish-2018-10-04/lib/libc/sys/
H A D__vdso_gettimeofday.c62 uint32_t curr, gen; local
70 curr = atomic_load_acq_32(&tk->tk_current);
71 th = &tk->tk_th[curr];
88 } while (curr != tk->tk_current || gen == 0 || gen != th->th_gen);
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ehci/
H A Dusb_ehci.c436 uint32_t curr, next; local
439 curr = bit;
440 while (curr & bit) {
444 next = (curr ^ bit) | (bit / 2);
446 qh_curr = hc->qh_intr_last[curr];
451 curr++;
/barrelfish-2018-10-04/lib/lua/src/
H A Dlgc.c735 GCObject *curr = *p; local
736 int marked = gch(curr)->marked;
737 if (isdeadm(ow, marked)) { /* is 'curr' dead? */
738 *p = gch(curr)->next; /* remove 'curr' from list */
739 freeobj(L, curr); /* erase 'curr' */
744 if (gch(curr)->tt == LUA_TTHREAD)
745 sweepthread(L, gco2th(curr)); /* sweep thread's upvalues */
747 gch(curr)
848 GCObject *curr; local
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dbitmap.h119 extern word next_greater_member(uword *bitmap, word curr, word *next_ptr);
121 extern word next_smaller_member(uword *bitmap, word curr, word *next_ptr);
123 extern word next_greater_non_member(uword *bitmap, word curr, word *next_ptr);
125 extern word next_smaller_non_member(uword *bitmap, word curr, word *next_ptr);
H A Dbitmap.c1804 /* Returns RES_EMPTY if there is no element larger than curr. */
1805 /* Returns RES_SLACK if next is not curr+1. */
1807 next_greater_member(uword *bitmap, word curr, word *next_ptr) argument
1817 next = curr - offset + 1;
1851 if (next == curr + 1) {
1884 /* Returns RES_EMPTY if there is no element smaller than curr. */
1885 /* Returns RES_SLACK if next is not curr-1. */
1887 next_smaller_member(uword *bitmap, word curr, word *next_ptr) argument
1897 next = curr - offset - 1;
1931 if (next == curr
1962 next_greater_non_member(uword *bitmap, word curr, word *next_ptr) argument
2029 next_smaller_non_member(uword *bitmap, word curr, word *next_ptr) argument
[all...]
/barrelfish-2018-10-04/lib/libc/rpc/
H A Dsvc_auth_des.c391 short curr; local
397 curr = authdes_lru[i];
399 prev = curr;
/barrelfish-2018-10-04/tools/schedsim/
H A Dsimulator.c77 } curr = { 0, 0, 0, 0, 0, 0, 0, 0 }; variable in typeref:struct:kcb
78 struct kcb *kcb_current = &curr;
/barrelfish-2018-10-04/usr/drivers/rtl8029/
H A Drtl8029.c380 uint8_t curr = rtl8029as_curr_rd(&rtl); local
385 while(curr_page != curr) {

Completed in 133 milliseconds