Home
last modified time | relevance | path

Searched refs:dequeue (Results 1 – 10 of 10) sorted by relevance

/mirbsd/src/usr.bin/grep/
Dqueue.c49 static queue_t *dequeue(void);
85 free_item(dequeue()); in enqueue()
89 dequeue(void) in dequeue() function
109 while ((item = dequeue()) != NULL) { in printqueue()
120 while ((item = dequeue()) != NULL) in clearqueue()
/mirbsd/src/gnu/usr.bin/perl/ext/Thread/
DQueue.pmx25 my $foo = $q->dequeue; # The "bar" is still in the queue.
50 =item dequeue
52 The C<dequeue> method removes a scalar from the head of the queue and
53 returns it. If the queue is currently empty, C<dequeue> will block the
58 The C<dequeue_nb> method, like the C<dequeue> method, removes a scalar from
59 the head of the queue and returns it. Unlike C<dequeue>, though,
82 sub dequeue : locked : method {
Dqueue.tx20 my $el = $q->dequeue;
/mirbsd/src/gnu/usr.bin/perl/lib/Thread/
DQueue.pm73 sub dequeue { subroutine
DQueue.t35 my $el = $q->dequeue;
/mirbsd/src/sys/altq/
Daltq_subr.c94 altq_attach(ifq, type, discipline, enqueue, dequeue, request, clfier, classify) in altq_attach() argument
99 struct mbuf *(*dequeue)(struct ifaltq *, int);
116 ifq->altq_dequeue = dequeue;
/mirbsd/src/usr.bin/tsort/
Dtsort.c147 static struct node *dequeue(struct array *);
424 #define DEQUEUE(h) ( hints_flag ? dequeue(h) : (h)->t[--(h)->entries] )
427 dequeue(struct array *h) in dequeue() function
/mirbsd/src/gnu/usr.bin/perl/pod/
Dperlothrtut.pod600 while ($DataElement = $DataQueue->dequeue) {
613 it with dequeue(). A queue has no fixed size, and can grow as needed
616 If a queue is empty, dequeue() blocks until another thread enqueues
931 23 while (my $num = $upstream->dequeue) {
Dperlthrtut.pod581 while ($DataElement = $DataQueue->dequeue) {
595 the front of it with dequeue(). A queue has no fixed size, and can grow
598 If a queue is empty, dequeue() blocks until another thread enqueues
825 23 while (my $num = $upstream->dequeue) {
Dperltoc.pod20504 new, enqueue LIST, dequeue, dequeue_nb, pending