Searched defs:rear (Results 1 - 7 of 7) sorted by relevance

/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dzfs_rlock.c225 rl_t *front, *rear; local
233 /* create the rear proxy range lock */
234 rear = kmem_alloc(sizeof (rl_t), KM_SLEEP);
235 rear->r_off = off;
236 rear->r_len = rl->r_off + rl->r_len - off;
237 rear->r_cnt = rl->r_cnt;
238 rear->r_type = RL_READER;
239 rear->r_proxy = B_TRUE;
240 rear->r_write_wanted = B_FALSE;
241 rear
[all...]
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Drandom.c117 * fptr and rptr are two pointers into the state info, a front and a rear
123 * (The position of the rear pointer, rptr, is really 0 (as explained above
137 * the front and rear pointers have wrapped.
147 * that srandom() advances the front and rear pointers 10*rand_deg
148 * times, and hence the rear pointer which starts at 0 will also
151 * position of the rear pointer is just
234 * multiplexed with the current value of the rear pointer; this is so
313 int rear; local
320 rear = new_state[0] / MAX_TYPES;
341 rp->rptr = &rp->state[rear];
[all...]
/illumos-gate/usr/src/lib/libc/port/gen/
H A Drandom.c134 * fptr and rptr are two pointers into the state info, a front and a rear
140 * (The position of the rear pointer, rptr, is really 0 (as explained above
154 * the front and rear pointers have wrapped.
164 * that srandom() advances the front and rear pointers 10*rand_deg
165 * times, and hence the rear pointer which starts at 0 will also
168 * position of the rear pointer is just
213 * multiplexed with the current value of the rear pointer; this is so
305 unsigned int rear; local
312 rear = new_state[0]/MAX_TYPES;
335 rp->rptr = &rp->state[ rear ];
[all...]
/illumos-gate/usr/src/cmd/refer/
H A Dglue5.c346 struct words **front, **rear; local
351 front = rear = queue;
354 *rear++ = s->nst;
355 if (rear >= &queue[QSIZE - 1]) overflo();
361 while (rear != front) {
368 *rear = (q = s->nst);
369 if (front < rear)
370 if (rear >= &queue[QSIZE-1])
372 else rear = queue;
373 else rear
[all...]
/illumos-gate/usr/src/uts/common/io/bnxe/577xx/hsi/mcp/
H A Dmulti_thread_def.h90 u32 rear; /* For queuing */ member in struct:tasks_queue_t
/illumos-gate/usr/src/lib/libast/common/uwin/
H A Drandom.c152 advances the front and rear pointers 10*rand_deg times, and hence the
153 rear pointer which starts at 0 will also end up at zero; thus the zeroeth
155 position of the rear pointer is just
169 /* FPTR and RPTR are two pointers into the state info, a front and a rear
175 (The position of the rear pointer, rptr, is really 0 (as explained above
192 the front and rear pointers have wrapped. */
233 value of the rear pointer; this is so successive calls to initstate won't
307 register int rear = new_state[0] / MAX_TYPES;
335 rptr = &state[rear];
336 fptr = &state[(rear
304 register int rear = new_state[0] / MAX_TYPES; local
[all...]
/illumos-gate/usr/src/cmd/fgrep/
H A Dfgrep.c618 * front and rear are pointers used to traverse the global words
621 struct words **front, **rear; local
632 front = rear = queue;
635 *rear++ = s->nst;
640 if (rear >= &queue[qsize - 1]) {
642 rearoffset = rear - queue;
650 rear = queue + rearoffset;
657 while (rear != front) {
661 *rear++ = (q = s->nst);
663 * Reallocate the queue if the rear pointe
[all...]

Completed in 95 milliseconds