Home
last modified time | relevance | path

Searched refs:queue_t (Results 1 – 2 of 2) sorted by relevance

/external/platform/pico/common/pico_util/include/pico/util/
A Dqueue.h42 } queue_t; typedef
72 void queue_free(queue_t *q);
97 static inline uint queue_get_level(queue_t *q) { in queue_get_level()
112 static inline uint queue_get_max_level(queue_t *q) { in queue_get_max_level()
138 static inline bool queue_is_empty(queue_t *q) { in queue_is_empty()
150 static inline bool queue_is_full(queue_t *q) { in queue_is_full()
166 bool queue_try_add(queue_t *q, const void *data);
178 bool queue_try_remove(queue_t *q, void *data);
190 bool queue_try_peek(queue_t *q, void *data);
212 void queue_remove_blocking(queue_t *q, void *data);
[all …]
/external/platform/pico/common/pico_util/
A Dqueue.c20 void queue_free(queue_t *q) { in queue_free()
24 static inline void *element_ptr(queue_t *q, uint index) { in element_ptr()
29 static inline uint16_t inc_index(queue_t *q, uint16_t index) { in inc_index()
62 static bool queue_remove_internal(queue_t *q, void *data, bool block) { in queue_remove_internal()
80 static bool queue_peek_internal(queue_t *q, void *data, bool block) { in queue_peek_internal()
97 bool queue_try_add(queue_t *q, const void *data) { in queue_try_add()
101 bool queue_try_remove(queue_t *q, void *data) { in queue_try_remove()
105 bool queue_try_peek(queue_t *q, void *data) { in queue_try_peek()
109 void queue_add_blocking(queue_t *q, const void *data) { in queue_add_blocking()
113 void queue_remove_blocking(queue_t *q, void *data) { in queue_remove_blocking()
[all …]

Completed in 6 milliseconds