mirror of https://github.com/Qortal/Brooklyn
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
111 lines
3.2 KiB
111 lines
3.2 KiB
/* |
|
Copyright (c) 2012, Broadcom Europe Ltd |
|
All rights reserved. |
|
|
|
Redistribution and use in source and binary forms, with or without |
|
modification, are permitted provided that the following conditions are met: |
|
* Redistributions of source code must retain the above copyright |
|
notice, this list of conditions and the following disclaimer. |
|
* Redistributions in binary form must reproduce the above copyright |
|
notice, this list of conditions and the following disclaimer in the |
|
documentation and/or other materials provided with the distribution. |
|
* Neither the name of the copyright holder nor the |
|
names of its contributors may be used to endorse or promote products |
|
derived from this software without specific prior written permission. |
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY |
|
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
|
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
*/ |
|
|
|
#include "vchiq_util.h" |
|
|
|
#if !defined(__KERNEL__) |
|
#include <stdlib.h> |
|
#endif |
|
|
|
static __inline int is_pow2(int i) |
|
{ |
|
return i && !(i & (i - 1)); |
|
} |
|
|
|
int vchiu_queue_init(VCHIU_QUEUE_T *queue, int size) |
|
{ |
|
vcos_assert(is_pow2(size)); |
|
|
|
queue->size = size; |
|
queue->read = 0; |
|
queue->write = 0; |
|
|
|
vcos_event_create(&queue->pop, "vchiu"); |
|
vcos_event_create(&queue->push, "vchiu"); |
|
|
|
queue->storage = vcos_malloc(size * sizeof(VCHIQ_HEADER_T *), VCOS_FUNCTION); |
|
if (queue->storage == NULL) |
|
{ |
|
vchiu_queue_delete(queue); |
|
return 0; |
|
} |
|
return 1; |
|
} |
|
|
|
void vchiu_queue_delete(VCHIU_QUEUE_T *queue) |
|
{ |
|
vcos_event_delete(&queue->pop); |
|
vcos_event_delete(&queue->push); |
|
if (queue->storage != NULL) |
|
vcos_free(queue->storage); |
|
} |
|
|
|
int vchiu_queue_is_empty(VCHIU_QUEUE_T *queue) |
|
{ |
|
return queue->read == queue->write; |
|
} |
|
|
|
int vchiu_queue_is_full(VCHIU_QUEUE_T *queue) |
|
{ |
|
return queue->write == queue->read + queue->size; |
|
} |
|
|
|
void vchiu_queue_push(VCHIU_QUEUE_T *queue, VCHIQ_HEADER_T *header) |
|
{ |
|
while (queue->write == queue->read + queue->size) |
|
vcos_event_wait(&queue->pop); |
|
|
|
queue->storage[queue->write & (queue->size - 1)] = header; |
|
|
|
queue->write++; |
|
|
|
vcos_event_signal(&queue->push); |
|
} |
|
|
|
VCHIQ_HEADER_T *vchiu_queue_peek(VCHIU_QUEUE_T *queue) |
|
{ |
|
while (queue->write == queue->read) |
|
vcos_event_wait(&queue->push); |
|
|
|
return queue->storage[queue->read & (queue->size - 1)]; |
|
} |
|
|
|
VCHIQ_HEADER_T *vchiu_queue_pop(VCHIU_QUEUE_T *queue) |
|
{ |
|
VCHIQ_HEADER_T *header; |
|
|
|
while (queue->write == queue->read) |
|
vcos_event_wait(&queue->push); |
|
|
|
header = queue->storage[queue->read & (queue->size - 1)]; |
|
|
|
queue->read++; |
|
|
|
vcos_event_signal(&queue->pop); |
|
|
|
return header; |
|
}
|
|
|