HomeSort by: relevance | last modified time | path
    Searched refs:next (Results 1 - 25 of 7329) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/lgpl2/userspace-rcu/dist/tests/common/
compat-rand.h 26 unsigned int next = *seed; local
29 next *= 1103515245;
30 next += 12345;
31 result = (unsigned int) (next / 65536) % 2048;
33 next *= 1103515245;
34 next += 12345;
36 result ^= (unsigned int) (next / 65536) % 1024;
38 next *= 1103515245;
39 next += 12345;
41 result ^= (unsigned int) (next / 65536) % 1024
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
break-include.c 18 int next (int i);
25 result = next (result);
53 next (int i) /* break here */ function
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
break-include.c 18 int next (int i);
25 result = next (result);
53 next (int i) /* break here */ function
  /src/tests/usr.bin/xlint/lint1/
msg_027.c 17 next enumerator in enum:__anon8049
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.ctf/
ctf-a.h 20 struct A *next; member in struct:A
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.ctf/
ctf-a.h 20 struct A *next; member in struct:A
  /src/lib/libbluetooth/
sdp_data.c 52 if (data->next + 1 > data->end)
55 return data->next[0];
68 uint8_t *p = data->next;
143 return (p - data->next);
314 if (data->next == NULL || data->end == NULL)
317 if (data->next >= data->end)
320 return _sdp_data_valid(data->next, data->end);
373 _sdp_data_print(const uint8_t *next, const uint8_t *end, int indent)
377 while (next < end) {
378 if (next + 1 > end
    [all...]
  /src/external/bsd/ipf/dist/lib/
alist_free.c 16 alist_t *a, *next; local
18 for (a = hosts; a != NULL; a = next) {
19 next = a->al_next;
  /src/usr.bin/make/unit-tests/
suff-main.exp 1 : Making next-main
  /src/usr.bin/find/
operator.c 66 (*planp) = (*planp)->next;
67 node->next = NULL;
80 PLAN *next; /* temp node holding subexpression results */ local
97 if ((next = yankexpr(planp)) == NULL)
106 if (next->type == N_CLOSEPAREN) {
115 tail = subplan = next;
117 tail->next = next;
118 tail = next;
120 tail->next = NULL
170 PLAN *next; \/* next node being processed *\/ local
229 PLAN *next; \/* next node being processed *\/ local
    [all...]
  /src/external/lgpl2/userspace-rcu/dist/include/urcu/
rculist.h 23 newp->next = head->next;
25 head->next->prev = newp;
26 rcu_assign_pointer(head->next, newp);
34 newp->next = head;
36 rcu_assign_pointer(head->prev->next, newp);
48 _new->next = old->next;
50 rcu_assign_pointer(_new->prev->next, _new);
51 _new->next->prev = _new
    [all...]
rcuhlist.h 24 newp->next = head->next;
26 if (head->next)
27 head->next->prev = newp;
28 rcu_assign_pointer(head->next, newp);
35 if (elem->next)
36 elem->next->prev = elem->prev;
37 CMM_STORE_SHARED(elem->prev->next, elem->next);
45 for (pos = rcu_dereference((head)->next); (pos) != NULL;
    [all...]
hlist.h 20 struct cds_hlist_node *next; member in struct:cds_hlist_head
24 struct cds_hlist_node *next, *prev; member in struct:cds_hlist_node
31 ptr->next = NULL;
38 { .next = NULL }
55 if (head->next)
56 head->next->prev = newp;
57 newp->next = head->next;
59 head->next = newp;
66 if (elem->next)
    [all...]
  /src/lib/libc/stdio/
glue.h 42 struct glue *next; member in struct:glue
  /src/lib/libc/stdlib/
rand.c 44 static u_long next = 1; variable
50 return (int)((next = next * 1103515245 + 12345) % ((u_long)RAND_MAX + 1));
56 next = seed;
  /src/usr.sbin/mrouted/
rsrr_var.h 45 struct rsrr_cache *next; /* next cache item */ member in struct:rsrr_cache
  /src/external/gpl3/gdb/dist/gdb/guile/lib/gdb/
iterator.scm 28 (let ((next! (lambda (iter)
35 (make-iterator l l next!)))
41 (let ((next (iterator-next! iter)))
42 (if (end-of-iteration? next)
44 (loop iter (cons next result))))))
51 (let ((next (iterator-next! iter)))
52 (if (end-of-iteration? next)
54 (loop proc iter (cons (proc next) result)))))
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/guile/lib/gdb/
iterator.scm 28 (let ((next! (lambda (iter)
35 (make-iterator l l next!)))
41 (let ((next (iterator-next! iter)))
42 (if (end-of-iteration? next)
44 (loop iter (cons next result))))))
51 (let ((next (iterator-next! iter)))
52 (if (end-of-iteration? next)
54 (loop proc iter (cons (proc next) result)))))
    [all...]
  /src/crypto/external/apache2/openssl/dist/ssl/
pqueue.c 27 item->next = NULL;
50 pitem *curr, *next; local
57 for (curr = NULL, next = pq->items;
58 next != NULL; curr = next, next = next->next) {
62 int cmp = memcmp(next->priority, item->priority, 8);
63 if (cmp > 0) { /* next > item *
101 pitem *next; local
    [all...]
  /src/crypto/external/bsd/openssl/dist/ssl/
pqueue.c 29 item->next = NULL;
55 pitem *curr, *next; local
62 for (curr = NULL, next = pq->items;
63 next != NULL; curr = next, next = next->next) {
67 int cmp = memcmp(next->priority, item->priority, 8);
68 if (cmp > 0) { /* next > item *
106 pitem *next; local
    [all...]
  /src/crypto/external/bsd/openssl.old/dist/ssl/
pqueue.c 29 item->next = NULL;
55 pitem *curr, *next; local
62 for (curr = NULL, next = pq->items;
63 next != NULL; curr = next, next = next->next) {
67 int cmp = memcmp(next->priority, item->priority, 8);
68 if (cmp > 0) { /* next > item *
106 pitem *next; local
    [all...]
  /src/games/warp/
object.c 26 if (free_root.next == &free_root)
33 obj = free_root.next;
34 free_root.next = obj->next;
35 obj->next->prev = &free_root;
39 obj->next = where;
42 obj->prev->next = obj;
61 curobj->prev->next = curobj->next;
62 curobj->next->prev = curobj->prev
    [all...]
  /src/external/ibm-public/postfix/dist/src/global/
tok822_tree.c 131 TOK822 *next = t1->next; local
133 t1->next = t2;
137 while (t2->next)
138 (t2 = t2->next)->owner = t1->owner;
140 t2->next = next;
141 if (next)
142 next->prev = t2;
153 prev->next = t2
182 TOK822 *next = tp->next; local
196 TOK822 *next = tp->next; local
266 TOK822 *next; local
    [all...]
  /src/usr.sbin/sdpd/
service.c 42 * buffer for sdpd_put_byte(), below. bytes are written at next when
47 uint8_t *next; /* current write position */ member in struct:__anon8566
68 d.next = srv->ibuf;
81 if (d.next + sizeof(uint16_t) > d.end)
84 max = be16dec(d.next);
85 d.next += sizeof(uint16_t);
93 if (d.next + 1 > d.end
94 || d.next[0] > 16
95 || d.next + 1 + d.next[0] != d.end
566 uint8_t *next; local
    [all...]
  /src/external/ibm-public/postfix/dist/src/oqmgr/
qmgr_enable.c 73 for (xport = qmgr_transport_list.next; xport; xport = xport->peers.next)
82 QMGR_QUEUE *next; local
92 for (queue = transport->queue_list.next; queue; queue = next) {
93 next = queue->peers.next;
107 if (QMGR_QUEUE_READY(queue) && queue->todo.next == 0 && queue->busy.next == 0)

Completed in 140 milliseconds

1 2 3 4 5 6 7 8 91011>>