Searched refs:maxSize (Results 1 - 4 of 4) sorted by path

/seL4-refos-master/libs/libdatastruct/include/data_struct/
H A Dcqueue.h26 uint32_t maxSize; member in struct:cqueue_s
29 void cqueue_init(cqueue_t *q, uint32_t maxSize);
/seL4-refos-master/libs/libdatastruct/src/
H A Dcqueue.c17 void cqueue_init(cqueue_t *q, uint32_t maxSize) { argument
19 q->data = kmalloc(sizeof(cqueue_item_t) * maxSize);
23 q->maxSize = maxSize;
28 while (q->count >= q->maxSize) {
32 q->top = (q->top + 1) % q->maxSize;
42 uint32_t bot = (q->top >= q->count) ? (q->top - q->count) : (q->maxSize - (q->count - q->top));
43 assert(bot < q->maxSize);
56 q->maxSize = 0;
/seL4-refos-master/projects/refos/impl/libs/libdatastruct/include/data_struct/
H A Dcqueue.h26 uint32_t maxSize; member in struct:cqueue_s
29 void cqueue_init(cqueue_t *q, uint32_t maxSize);
/seL4-refos-master/projects/refos/impl/libs/libdatastruct/src/
H A Dcqueue.c17 void cqueue_init(cqueue_t *q, uint32_t maxSize) { argument
19 q->data = kmalloc(sizeof(cqueue_item_t) * maxSize);
23 q->maxSize = maxSize;
28 while (q->count >= q->maxSize) {
32 q->top = (q->top + 1) % q->maxSize;
42 uint32_t bot = (q->top >= q->count) ? (q->top - q->count) : (q->maxSize - (q->count - q->top));
43 assert(bot < q->maxSize);
56 q->maxSize = 0;

Completed in 44 milliseconds