Searched refs:enqueued (Results 1 - 6 of 6) sorted by relevance

/barrelfish-2018-10-04/usr/monitor/capops/
H A Ddeletestep.c11 static bool enqueued; variable
45 enqueued = false;
67 if (!suspended && !enqueued) {
69 enqueued = true;
91 enqueued = true;
109 assert(enqueued);
110 enqueued = false;
141 if (!enqueued) {
142 DEBUG_CAPOPS("%s: !enqueued, adding to queue\n", __FUNCTION__);
144 enqueued
[all...]
/barrelfish-2018-10-04/lib/net/
H A Dnetif.c262 assert(nb->enqueued == 0);
264 nb->enqueued = 1;
326 assert(nb->enqueued == 0);
328 nb->enqueued = 1;
466 if (nb->magic != 0xdeadbeefcafebabe || nb->enqueued != 1 || nb->allocated != 1 || nb->flags != buf.flags) {
468 p, nb->region->regionid, nb->offset, nb->magic, nb->enqueued, nb->allocated, nb->flags, buf.flags);
473 assert(nb->enqueued == 1);
476 nb->enqueued = 0;
511 assert(nb->enqueued == 0);
H A Dnetworking_internal.h103 bool enqueued; member in struct:net_buf_p
H A Dnetbufs.c149 nb->enqueued = 0;
227 assert(nb->enqueued == 0);
270 assert(nb->enqueued == 0);
/barrelfish-2018-10-04/doc/026-device-queues/
H A Ddevif.tex121 queue on the stack can do an arbitrary transformation on the buffer that was enqueued
162 buffers from the just registered region can be enqueued and the ownership
248 can not be enqueued twice without dequeuing it beforehand, otherwise the behaviour is undefined.
275 \item \texttt{regionid\_t region\_id}: the id of a memory region the enqueued buffer belongs to.
277 \item \texttt{genoffset\_t length}: the length of the enqueued buffer.
338 \item \texttt{genoffset\_t* length}: return pointer to the length of the enqueued buffer.
371 actually a buffer in the queue. When a buffer is enqueued, there
373 all the buffers that are enqueued to this point will eventually processed and the ownership
444 entail correctly how the transfer of an address happens. An address that is enqueued might
675 If a buffer is enqueued, i
[all...]
/barrelfish-2018-10-04/doc/011-idc/
H A DIDC.tex584 If it returns success, the message has been successfully enqueued for

Completed in 50 milliseconds