aurelio carella / Mbed OS mbed-os-example-ble-GattServer_ECG

20200716 read Status Register each second

Dependencies:   SDFileSystem mbed-os-example-ble-GattServer max32630fthr

HSP/RpcServer/RpcFifo.cpp@21:51e162c130a9, 2020-07-16 (annotated)

Committer:
aureliocarella
Date:
Thu Jul 16 14:59:04 2020 +0000
Revision:
21:51e162c130a9
20200716

Who changed what in which revision?

UserRevisionLine numberNew contents of line
aureliocarella 21:51e162c130a9 1 /*******************************************************************************
aureliocarella 21:51e162c130a9 2 * Copyright (C) 2016 Maxim Integrated Products, Inc., All Rights Reserved.
aureliocarella 21:51e162c130a9 3 *
aureliocarella 21:51e162c130a9 4 * Permission is hereby granted, free of charge, to any person obtaining a
aureliocarella 21:51e162c130a9 5 * copy of this software and associated documentation files (the "Software"),
aureliocarella 21:51e162c130a9 6 * to deal in the Software without restriction, including without limitation
aureliocarella 21:51e162c130a9 7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
aureliocarella 21:51e162c130a9 8 * and/or sell copies of the Software, and to permit persons to whom the
aureliocarella 21:51e162c130a9 9 * Software is furnished to do so, subject to the following conditions:
aureliocarella 21:51e162c130a9 10 *
aureliocarella 21:51e162c130a9 11 * The above copyright notice and this permission notice shall be included
aureliocarella 21:51e162c130a9 12 * in all copies or substantial portions of the Software.
aureliocarella 21:51e162c130a9 13 *
aureliocarella 21:51e162c130a9 14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
aureliocarella 21:51e162c130a9 15 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
aureliocarella 21:51e162c130a9 16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
aureliocarella 21:51e162c130a9 17 * IN NO EVENT SHALL MAXIM INTEGRATED BE LIABLE FOR ANY CLAIM, DAMAGES
aureliocarella 21:51e162c130a9 18 * OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
aureliocarella 21:51e162c130a9 19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
aureliocarella 21:51e162c130a9 20 * OTHER DEALINGS IN THE SOFTWARE.
aureliocarella 21:51e162c130a9 21 *
aureliocarella 21:51e162c130a9 22 * Except as contained in this notice, the name of Maxim Integrated
aureliocarella 21:51e162c130a9 23 * Products, Inc. shall not be used except as stated in the Maxim Integrated
aureliocarella 21:51e162c130a9 24 * Products, Inc. Branding Policy.
aureliocarella 21:51e162c130a9 25 *
aureliocarella 21:51e162c130a9 26 * The mere transfer of this software does not imply any licenses
aureliocarella 21:51e162c130a9 27 * of trade secrets, proprietary technology, copyrights, patents,
aureliocarella 21:51e162c130a9 28 * trademarks, maskwork rights, or any other form of intellectual
aureliocarella 21:51e162c130a9 29 * property whatsoever. Maxim Integrated Products, Inc. retains all
aureliocarella 21:51e162c130a9 30 * ownership rights.
aureliocarella 21:51e162c130a9 31 *******************************************************************************
aureliocarella 21:51e162c130a9 32 */
aureliocarella 21:51e162c130a9 33 #include "mbed.h"
aureliocarella 21:51e162c130a9 34 #include "RpcFifo.h"
aureliocarella 21:51e162c130a9 35
aureliocarella 21:51e162c130a9 36 /****************************************************************************/
aureliocarella 21:51e162c130a9 37 void fifo_init(fifo_t *fifo, void *mem, unsigned int length) {
aureliocarella 21:51e162c130a9 38 // atomic FIFO access
aureliocarella 21:51e162c130a9 39 __disable_irq();
aureliocarella 21:51e162c130a9 40
aureliocarella 21:51e162c130a9 41 fifo->rindex = 0;
aureliocarella 21:51e162c130a9 42 fifo->windex = 0;
aureliocarella 21:51e162c130a9 43 fifo->data = mem;
aureliocarella 21:51e162c130a9 44 fifo->length = length;
aureliocarella 21:51e162c130a9 45
aureliocarella 21:51e162c130a9 46 __enable_irq();
aureliocarella 21:51e162c130a9 47 }
aureliocarella 21:51e162c130a9 48
aureliocarella 21:51e162c130a9 49 /****************************************************************************/
aureliocarella 21:51e162c130a9 50 int fifo_put8(fifo_t *fifo, uint8_t element) {
aureliocarella 21:51e162c130a9 51 // Check if FIFO is full
aureliocarella 21:51e162c130a9 52 if ((fifo->windex == (fifo->rindex - 1)) ||
aureliocarella 21:51e162c130a9 53 ((fifo->rindex == 0) && (fifo->windex == (fifo->length - 1)))) {
aureliocarella 21:51e162c130a9 54 return -1;
aureliocarella 21:51e162c130a9 55 }
aureliocarella 21:51e162c130a9 56
aureliocarella 21:51e162c130a9 57 // atomic FIFO access
aureliocarella 21:51e162c130a9 58 __disable_irq();
aureliocarella 21:51e162c130a9 59
aureliocarella 21:51e162c130a9 60 // Put data into FIFO
aureliocarella 21:51e162c130a9 61 ((uint8_t *)(fifo->data))[fifo->windex] = element;
aureliocarella 21:51e162c130a9 62
aureliocarella 21:51e162c130a9 63 // Increment pointer
aureliocarella 21:51e162c130a9 64 fifo->windex++;
aureliocarella 21:51e162c130a9 65 if (fifo->windex == fifo->length) {
aureliocarella 21:51e162c130a9 66 fifo->windex = 0;
aureliocarella 21:51e162c130a9 67 }
aureliocarella 21:51e162c130a9 68
aureliocarella 21:51e162c130a9 69 __enable_irq();
aureliocarella 21:51e162c130a9 70
aureliocarella 21:51e162c130a9 71 return 0;
aureliocarella 21:51e162c130a9 72 }
aureliocarella 21:51e162c130a9 73
aureliocarella 21:51e162c130a9 74 /****************************************************************************/
aureliocarella 21:51e162c130a9 75 int fifo_get8(fifo_t *fifo, uint8_t *element) {
aureliocarella 21:51e162c130a9 76 // Check if FIFO is empty
aureliocarella 21:51e162c130a9 77 if (fifo->rindex == fifo->windex)
aureliocarella 21:51e162c130a9 78 return -1;
aureliocarella 21:51e162c130a9 79
aureliocarella 21:51e162c130a9 80 // atomic FIFO access
aureliocarella 21:51e162c130a9 81 __disable_irq();
aureliocarella 21:51e162c130a9 82
aureliocarella 21:51e162c130a9 83 // Get data from FIFO
aureliocarella 21:51e162c130a9 84 *element = ((uint8_t *)(fifo->data))[fifo->rindex];
aureliocarella 21:51e162c130a9 85
aureliocarella 21:51e162c130a9 86 // Increment pointer
aureliocarella 21:51e162c130a9 87 fifo->rindex++;
aureliocarella 21:51e162c130a9 88 if (fifo->rindex == fifo->length) {
aureliocarella 21:51e162c130a9 89 fifo->rindex = 0;
aureliocarella 21:51e162c130a9 90 }
aureliocarella 21:51e162c130a9 91
aureliocarella 21:51e162c130a9 92 __enable_irq();
aureliocarella 21:51e162c130a9 93
aureliocarella 21:51e162c130a9 94 return 0;
aureliocarella 21:51e162c130a9 95 }
aureliocarella 21:51e162c130a9 96
aureliocarella 21:51e162c130a9 97 /****************************************************************************/
aureliocarella 21:51e162c130a9 98 int fifo_put16(fifo_t *fifo, uint16_t element) {
aureliocarella 21:51e162c130a9 99 // Check if FIFO is full
aureliocarella 21:51e162c130a9 100 if ((fifo->windex == (fifo->rindex - 1)) ||
aureliocarella 21:51e162c130a9 101 ((fifo->rindex == 0) && (fifo->windex == (fifo->length - 1)))) {
aureliocarella 21:51e162c130a9 102 return -1;
aureliocarella 21:51e162c130a9 103 }
aureliocarella 21:51e162c130a9 104
aureliocarella 21:51e162c130a9 105 // atomic FIFO access
aureliocarella 21:51e162c130a9 106 __disable_irq();
aureliocarella 21:51e162c130a9 107
aureliocarella 21:51e162c130a9 108 // Put data into FIFO
aureliocarella 21:51e162c130a9 109 ((uint16_t *)(fifo->data))[fifo->windex] = element;
aureliocarella 21:51e162c130a9 110
aureliocarella 21:51e162c130a9 111 // Increment pointer
aureliocarella 21:51e162c130a9 112 fifo->windex++;
aureliocarella 21:51e162c130a9 113 if (fifo->windex == fifo->length) {
aureliocarella 21:51e162c130a9 114 fifo->windex = 0;
aureliocarella 21:51e162c130a9 115 }
aureliocarella 21:51e162c130a9 116
aureliocarella 21:51e162c130a9 117 __enable_irq();
aureliocarella 21:51e162c130a9 118
aureliocarella 21:51e162c130a9 119 return 0;
aureliocarella 21:51e162c130a9 120 }
aureliocarella 21:51e162c130a9 121
aureliocarella 21:51e162c130a9 122 /****************************************************************************/
aureliocarella 21:51e162c130a9 123 int fifo_get16(fifo_t *fifo, uint16_t *element) {
aureliocarella 21:51e162c130a9 124 // Check if FIFO is empty
aureliocarella 21:51e162c130a9 125 if (fifo->rindex == fifo->windex)
aureliocarella 21:51e162c130a9 126 return -1;
aureliocarella 21:51e162c130a9 127
aureliocarella 21:51e162c130a9 128 // atomic FIFO access
aureliocarella 21:51e162c130a9 129 __disable_irq();
aureliocarella 21:51e162c130a9 130
aureliocarella 21:51e162c130a9 131 // Get data from FIFO
aureliocarella 21:51e162c130a9 132 *element = ((uint16_t *)(fifo->data))[fifo->rindex];
aureliocarella 21:51e162c130a9 133
aureliocarella 21:51e162c130a9 134 // Increment pointer
aureliocarella 21:51e162c130a9 135 fifo->rindex++;
aureliocarella 21:51e162c130a9 136 if (fifo->rindex == fifo->length) {
aureliocarella 21:51e162c130a9 137 fifo->rindex = 0;
aureliocarella 21:51e162c130a9 138 }
aureliocarella 21:51e162c130a9 139
aureliocarella 21:51e162c130a9 140 __enable_irq();
aureliocarella 21:51e162c130a9 141
aureliocarella 21:51e162c130a9 142 return 0;
aureliocarella 21:51e162c130a9 143 }
aureliocarella 21:51e162c130a9 144
aureliocarella 21:51e162c130a9 145 /****************************************************************************/
aureliocarella 21:51e162c130a9 146 int fifo_put32(fifo_t *fifo, uint32_t element) {
aureliocarella 21:51e162c130a9 147 // Check if FIFO is full
aureliocarella 21:51e162c130a9 148 if ((fifo->windex == (fifo->rindex - 1)) ||
aureliocarella 21:51e162c130a9 149 ((fifo->rindex == 0) && (fifo->windex == (fifo->length - 1)))) {
aureliocarella 21:51e162c130a9 150 return -1;
aureliocarella 21:51e162c130a9 151 }
aureliocarella 21:51e162c130a9 152
aureliocarella 21:51e162c130a9 153 // atomic FIFO access
aureliocarella 21:51e162c130a9 154 __disable_irq();
aureliocarella 21:51e162c130a9 155
aureliocarella 21:51e162c130a9 156 // Put data into FIFO
aureliocarella 21:51e162c130a9 157 ((uint32_t *)(fifo->data))[fifo->windex] = element;
aureliocarella 21:51e162c130a9 158
aureliocarella 21:51e162c130a9 159 // Increment pointer
aureliocarella 21:51e162c130a9 160 fifo->windex++;
aureliocarella 21:51e162c130a9 161 if (fifo->windex == fifo->length) {
aureliocarella 21:51e162c130a9 162 fifo->windex = 0;
aureliocarella 21:51e162c130a9 163 }
aureliocarella 21:51e162c130a9 164
aureliocarella 21:51e162c130a9 165 __enable_irq();
aureliocarella 21:51e162c130a9 166
aureliocarella 21:51e162c130a9 167 return 0;
aureliocarella 21:51e162c130a9 168 }
aureliocarella 21:51e162c130a9 169
aureliocarella 21:51e162c130a9 170 /****************************************************************************/
aureliocarella 21:51e162c130a9 171 int fifo_get32(fifo_t *fifo, uint32_t *element) {
aureliocarella 21:51e162c130a9 172 // Check if FIFO is empty
aureliocarella 21:51e162c130a9 173 if (fifo->rindex == fifo->windex)
aureliocarella 21:51e162c130a9 174 return -1;
aureliocarella 21:51e162c130a9 175
aureliocarella 21:51e162c130a9 176 // atomic FIFO access
aureliocarella 21:51e162c130a9 177 __disable_irq();
aureliocarella 21:51e162c130a9 178
aureliocarella 21:51e162c130a9 179 // Get data from FIFO
aureliocarella 21:51e162c130a9 180 *element = ((uint32_t *)(fifo->data))[fifo->rindex];
aureliocarella 21:51e162c130a9 181
aureliocarella 21:51e162c130a9 182 // Increment pointer
aureliocarella 21:51e162c130a9 183 fifo->rindex++;
aureliocarella 21:51e162c130a9 184 if (fifo->rindex == fifo->length) {
aureliocarella 21:51e162c130a9 185 fifo->rindex = 0;
aureliocarella 21:51e162c130a9 186 }
aureliocarella 21:51e162c130a9 187
aureliocarella 21:51e162c130a9 188 __enable_irq();
aureliocarella 21:51e162c130a9 189
aureliocarella 21:51e162c130a9 190 return 0;
aureliocarella 21:51e162c130a9 191 }
aureliocarella 21:51e162c130a9 192 /****************************************************************************/
aureliocarella 21:51e162c130a9 193 void fifo_clear(fifo_t *fifo) {
aureliocarella 21:51e162c130a9 194 // atomic FIFO access
aureliocarella 21:51e162c130a9 195 __disable_irq();
aureliocarella 21:51e162c130a9 196
aureliocarella 21:51e162c130a9 197 fifo->rindex = 0;
aureliocarella 21:51e162c130a9 198 fifo->windex = 0;
aureliocarella 21:51e162c130a9 199
aureliocarella 21:51e162c130a9 200 __enable_irq();
aureliocarella 21:51e162c130a9 201 }
aureliocarella 21:51e162c130a9 202
aureliocarella 21:51e162c130a9 203 /****************************************************************************/
aureliocarella 21:51e162c130a9 204 int fifo_empty(fifo_t *fifo) { return (fifo->rindex == fifo->windex); }
aureliocarella 21:51e162c130a9 205
aureliocarella 21:51e162c130a9 206 /****************************************************************************/
aureliocarella 21:51e162c130a9 207 int fifo_full(fifo_t *fifo) {
aureliocarella 21:51e162c130a9 208 int retval;
aureliocarella 21:51e162c130a9 209
aureliocarella 21:51e162c130a9 210 // atomic FIFO access
aureliocarella 21:51e162c130a9 211 __disable_irq();
aureliocarella 21:51e162c130a9 212 retval = ((fifo->windex == (fifo->rindex - 1)) ||
aureliocarella 21:51e162c130a9 213 ((fifo->rindex == 0) && (fifo->windex == (fifo->length - 1))));
aureliocarella 21:51e162c130a9 214 __enable_irq();
aureliocarella 21:51e162c130a9 215
aureliocarella 21:51e162c130a9 216 return retval;
aureliocarella 21:51e162c130a9 217 }
aureliocarella 21:51e162c130a9 218
aureliocarella 21:51e162c130a9 219 /****************************************************************************/
aureliocarella 21:51e162c130a9 220 unsigned int fifo_level(fifo_t *fifo) {
aureliocarella 21:51e162c130a9 221 uint16_t value;
aureliocarella 21:51e162c130a9 222
aureliocarella 21:51e162c130a9 223 // atomic FIFO access
aureliocarella 21:51e162c130a9 224 __disable_irq();
aureliocarella 21:51e162c130a9 225
aureliocarella 21:51e162c130a9 226 if (fifo->windex >= fifo->rindex) {
aureliocarella 21:51e162c130a9 227 value = fifo->windex - fifo->rindex;
aureliocarella 21:51e162c130a9 228 } else {
aureliocarella 21:51e162c130a9 229 value = fifo->length - fifo->rindex + fifo->windex;
aureliocarella 21:51e162c130a9 230 }
aureliocarella 21:51e162c130a9 231
aureliocarella 21:51e162c130a9 232 __enable_irq();
aureliocarella 21:51e162c130a9 233
aureliocarella 21:51e162c130a9 234 return value;
aureliocarella 21:51e162c130a9 235 }
aureliocarella 21:51e162c130a9 236
aureliocarella 21:51e162c130a9 237 /****************************************************************************/
aureliocarella 21:51e162c130a9 238 unsigned int fifo_remaining(fifo_t *fifo) {
aureliocarella 21:51e162c130a9 239 uint16_t value;
aureliocarella 21:51e162c130a9 240
aureliocarella 21:51e162c130a9 241 // atomic FIFO access
aureliocarella 21:51e162c130a9 242 __disable_irq();
aureliocarella 21:51e162c130a9 243
aureliocarella 21:51e162c130a9 244 if (fifo->rindex > fifo->windex) {
aureliocarella 21:51e162c130a9 245 value = fifo->rindex - fifo->windex - 1;
aureliocarella 21:51e162c130a9 246 } else {
aureliocarella 21:51e162c130a9 247 value = fifo->length - fifo->windex + fifo->rindex - 1;
aureliocarella 21:51e162c130a9 248 }
aureliocarella 21:51e162c130a9 249
aureliocarella 21:51e162c130a9 250 __enable_irq();
aureliocarella 21:51e162c130a9 251
aureliocarella 21:51e162c130a9 252 return value;
aureliocarella 21:51e162c130a9 253 }
aureliocarella 21:51e162c130a9 254