PicoSDK
Select one of the symbols to view example projects that use it.
 
Outline
#include <stdlib.h>
#include <string.h>
#include "pico/util/queue.h"
queue_init_with_spinlock(queue_t *, uint, uint, uint)
queue_free(queue_t *)
element_ptr(queue_t *, uint)
inc_index(queue_t *, uint16_t)
queue_add_internal(queue_t *, const void *, bool)
queue_remove_internal(queue_t *, void *, bool)
queue_peek_internal(queue_t *, void *, bool)
queue_try_add(queue_t *, const void *)
queue_try_remove(queue_t *, void *)
queue_try_peek(queue_t *, void *)
queue_add_blocking(queue_t *, const void *)
queue_remove_blocking(queue_t *, void *)
queue_peek_blocking(queue_t *, void *)
Files
loading...
SourceVuRaspberry Pi Pico SDK and ExamplesPicoSDKsrc/common/pico_util/queue.c
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
/* * Copyright (c) 2020 Raspberry Pi (Trading) Ltd. * * SPDX-License-Identifier: BSD-3-Clause *//* ... */ #include <stdlib.h> #include <string.h> #include "pico/util/queue.h" void queue_init_with_spinlock(queue_t *q, uint element_size, uint element_count, uint spinlock_num) { lock_init(&q->core, spinlock_num); q->data = (uint8_t *)calloc(element_count + 1, element_size); q->element_count = (uint16_t)element_count; q->element_size = (uint16_t)element_size; q->wptr = 0; q->rptr = 0; }{ ... } void queue_free(queue_t *q) { free(q->data); }{ ... } static inline void *element_ptr(queue_t *q, uint index) { assert(index <= q->element_count); return q->data + index * q->element_size; }{ ... } static inline uint16_t inc_index(queue_t *q, uint16_t index) { if (++index > q->element_count) { // > because we have element_count + 1 elements index = 0; }if (++index > q->element_count) { ... } #if PICO_QUEUE_MAX_LEVEL uint16_t level = queue_get_level_unsafe(q); if (level > q->max_level) { q->max_level = level; }if (level > q->max_level) { ... } /* ... */#endif return index; }{ ... } static bool queue_add_internal(queue_t *q, const void *data, bool block) { do { uint32_t save = spin_lock_blocking(q->core.spin_lock); if (queue_get_level_unsafe(q) != q->element_count) { memcpy(element_ptr(q, q->wptr), data, q->element_size); q->wptr = inc_index(q, q->wptr); lock_internal_spin_unlock_with_notify(&q->core, save); return true; }if (queue_get_level_unsafe(q) != q->element_count) { ... } if (block) { lock_internal_spin_unlock_with_wait(&q->core, save); }if (block) { ... } else { spin_unlock(q->core.spin_lock, save); return false; }else { ... } ...} while (true); }{ ... } static bool queue_remove_internal(queue_t *q, void *data, bool block) { do { uint32_t save = spin_lock_blocking(q->core.spin_lock); if (queue_get_level_unsafe(q) != 0) { if (data) { memcpy(data, element_ptr(q, q->rptr), q->element_size); }if (data) { ... } q->rptr = inc_index(q, q->rptr); lock_internal_spin_unlock_with_notify(&q->core, save); return true; }if (queue_get_level_unsafe(q) != 0) { ... } if (block) { lock_internal_spin_unlock_with_wait(&q->core, save); }if (block) { ... } else { spin_unlock(q->core.spin_lock, save); return false; }else { ... } ...} while (true); }{ ... } static bool queue_peek_internal(queue_t *q, void *data, bool block) { do { uint32_t save = spin_lock_blocking(q->core.spin_lock); if (queue_get_level_unsafe(q) != 0) { if (data) { memcpy(data, element_ptr(q, q->rptr), q->element_size); }if (data) { ... } lock_internal_spin_unlock_with_notify(&q->core, save); return true; }if (queue_get_level_unsafe(q) != 0) { ... } if (block) { lock_internal_spin_unlock_with_wait(&q->core, save); }if (block) { ... } else { spin_unlock(q->core.spin_lock, save); return false; }else { ... } ...} while (true); }{ ... } bool queue_try_add(queue_t *q, const void *data) { return queue_add_internal(q, data, false); }{ ... } bool queue_try_remove(queue_t *q, void *data) { return queue_remove_internal(q, data, false); }{ ... } bool queue_try_peek(queue_t *q, void *data) { return queue_peek_internal(q, data, false); }{ ... } void queue_add_blocking(queue_t *q, const void *data) { queue_add_internal(q, data, true); }{ ... } void queue_remove_blocking(queue_t *q, void *data) { queue_remove_internal(q, data, true); }{ ... } void queue_peek_blocking(queue_t *q, void *data) { queue_peek_internal(q, data, true); }{ ... }
Details
Show:
from
Types: Columns: