diff options
| author | Thomas Schmucker <ts@its1.de> | 2020-10-09 13:27:38 +0200 |
|---|---|---|
| committer | Thomas Schmucker <ts@its1.de> | 2020-10-09 13:27:38 +0200 |
| commit | 75f37eea80df999bb06cb97e10525dec60ccba57 (patch) | |
| tree | d5a0ffec4b3a3a38fb485430e6d99f019ecab017 /ringbuff.c | |
| parent | 6fb072f62c2f50118dd5cb377d10c76ece51e5fb (diff) | |
| download | data-structures-75f37eea80df999bb06cb97e10525dec60ccba57.tar.gz data-structures-75f37eea80df999bb06cb97e10525dec60ccba57.tar.bz2 data-structures-75f37eea80df999bb06cb97e10525dec60ccba57.zip | |
umgebende Klammern ...
Diffstat (limited to 'ringbuff.c')
| -rw-r--r-- | ringbuff.c | 12 |
1 files changed, 8 insertions, 4 deletions
| @@ -28,8 +28,9 @@ ring_push_front(struct ring_buffer *rb, T data) | |||
| 28 | { | 28 | { |
| 29 | const size_t prev = (rb->tail + NELEM(rb->array) - 1) % NELEM(rb->array); | 29 | const size_t prev = (rb->tail + NELEM(rb->array) - 1) % NELEM(rb->array); |
| 30 | 30 | ||
| 31 | if ( prev == rb->head ) | 31 | if ( prev == rb->head ) { |
| 32 | return false; | 32 | return false; |
| 33 | } | ||
| 33 | 34 | ||
| 34 | rb->array[prev] = data; | 35 | rb->array[prev] = data; |
| 35 | rb->tail = prev; | 36 | rb->tail = prev; |
| @@ -44,8 +45,9 @@ ring_push_back(struct ring_buffer *rb, T data) | |||
| 44 | { | 45 | { |
| 45 | const size_t next = (rb->head + 1) % NELEM(rb->array); | 46 | const size_t next = (rb->head + 1) % NELEM(rb->array); |
| 46 | 47 | ||
| 47 | if ( next == rb->tail ) | 48 | if ( next == rb->tail ) { |
| 48 | return false; | 49 | return false; |
| 50 | } | ||
| 49 | 51 | ||
| 50 | rb->array[rb->head] = data; | 52 | rb->array[rb->head] = data; |
| 51 | rb->head = next; | 53 | rb->head = next; |
| @@ -58,8 +60,9 @@ ring_push_back(struct ring_buffer *rb, T data) | |||
| 58 | bool | 60 | bool |
| 59 | ring_pop_front(struct ring_buffer *rb, T *data) | 61 | ring_pop_front(struct ring_buffer *rb, T *data) |
| 60 | { | 62 | { |
| 61 | if ( rb->head == rb->tail ) | 63 | if ( rb->head == rb->tail ) { |
| 62 | return false; | 64 | return false; |
| 65 | } | ||
| 63 | 66 | ||
| 64 | const size_t next = (rb->tail + 1) % NELEM(rb->array); | 67 | const size_t next = (rb->tail + 1) % NELEM(rb->array); |
| 65 | 68 | ||
| @@ -74,8 +77,9 @@ ring_pop_front(struct ring_buffer *rb, T *data) | |||
| 74 | bool | 77 | bool |
| 75 | ring_pop_back(struct ring_buffer *rb, T *data) | 78 | ring_pop_back(struct ring_buffer *rb, T *data) |
| 76 | { | 79 | { |
| 77 | if ( rb->head == rb->tail ) | 80 | if ( rb->head == rb->tail ) { |
| 78 | return false; | 81 | return false; |
| 82 | } | ||
| 79 | 83 | ||
| 80 | const size_t prev = (rb->head + NELEM(rb->array) - 1) % NELEM(rb->array); | 84 | const size_t prev = (rb->head + NELEM(rb->array) - 1) % NELEM(rb->array); |
| 81 | 85 | ||
