Alan Ffrench / Mbed 2 deprecated Experiment_2_5

Important changes to repositories hosted on mbed.com

Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.

To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.

It is also possible to export all your personal repositories from the account settings page.

Dependencies:   mbed

mbed-rtos/rtx/rt_List.c@0:52468b19aa21, 2020-07-29 (annotated)

Committer:
alanffrench
Date:
Wed Jul 29 18:51:38 2020 +0000
Revision:
0:52468b19aa21
Threads

Who changed what in which revision?

UserRevisionLine numberNew contents of line
alanffrench 0:52468b19aa21 1 /*----------------------------------------------------------------------------
alanffrench 0:52468b19aa21 2 * RL-ARM - RTX
alanffrench 0:52468b19aa21 3 *----------------------------------------------------------------------------
alanffrench 0:52468b19aa21 4 * Name: RT_LIST.C
alanffrench 0:52468b19aa21 5 * Purpose: Functions for the management of different lists
alanffrench 0:52468b19aa21 6 * Rev.: V4.60
alanffrench 0:52468b19aa21 7 *----------------------------------------------------------------------------
alanffrench 0:52468b19aa21 8 *
alanffrench 0:52468b19aa21 9 * Copyright (c) 1999-2009 KEIL, 2009-2012 ARM Germany GmbH
alanffrench 0:52468b19aa21 10 * All rights reserved.
alanffrench 0:52468b19aa21 11 * Redistribution and use in source and binary forms, with or without
alanffrench 0:52468b19aa21 12 * modification, are permitted provided that the following conditions are met:
alanffrench 0:52468b19aa21 13 * - Redistributions of source code must retain the above copyright
alanffrench 0:52468b19aa21 14 * notice, this list of conditions and the following disclaimer.
alanffrench 0:52468b19aa21 15 * - Redistributions in binary form must reproduce the above copyright
alanffrench 0:52468b19aa21 16 * notice, this list of conditions and the following disclaimer in the
alanffrench 0:52468b19aa21 17 * documentation and/or other materials provided with the distribution.
alanffrench 0:52468b19aa21 18 * - Neither the name of ARM nor the names of its contributors may be used
alanffrench 0:52468b19aa21 19 * to endorse or promote products derived from this software without
alanffrench 0:52468b19aa21 20 * specific prior written permission.
alanffrench 0:52468b19aa21 21 *
alanffrench 0:52468b19aa21 22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
alanffrench 0:52468b19aa21 23 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
alanffrench 0:52468b19aa21 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
alanffrench 0:52468b19aa21 25 * ARE DISCLAIMED. IN NO EVENT SHALL COPYRIGHT HOLDERS AND CONTRIBUTORS BE
alanffrench 0:52468b19aa21 26 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
alanffrench 0:52468b19aa21 27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
alanffrench 0:52468b19aa21 28 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
alanffrench 0:52468b19aa21 29 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
alanffrench 0:52468b19aa21 30 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
alanffrench 0:52468b19aa21 31 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
alanffrench 0:52468b19aa21 32 * POSSIBILITY OF SUCH DAMAGE.
alanffrench 0:52468b19aa21 33 *---------------------------------------------------------------------------*/
alanffrench 0:52468b19aa21 34
alanffrench 0:52468b19aa21 35 #include "rt_TypeDef.h"
alanffrench 0:52468b19aa21 36 #include "RTX_Config.h"
alanffrench 0:52468b19aa21 37 #include "rt_System.h"
alanffrench 0:52468b19aa21 38 #include "rt_List.h"
alanffrench 0:52468b19aa21 39 #include "rt_Task.h"
alanffrench 0:52468b19aa21 40 #include "rt_Time.h"
alanffrench 0:52468b19aa21 41 #include "rt_HAL_CM.h"
alanffrench 0:52468b19aa21 42
alanffrench 0:52468b19aa21 43 /*----------------------------------------------------------------------------
alanffrench 0:52468b19aa21 44 * Global Variables
alanffrench 0:52468b19aa21 45 *---------------------------------------------------------------------------*/
alanffrench 0:52468b19aa21 46
alanffrench 0:52468b19aa21 47 /* List head of chained ready tasks */
alanffrench 0:52468b19aa21 48 struct OS_XCB os_rdy;
alanffrench 0:52468b19aa21 49 /* List head of chained delay tasks */
alanffrench 0:52468b19aa21 50 struct OS_XCB os_dly;
alanffrench 0:52468b19aa21 51
alanffrench 0:52468b19aa21 52
alanffrench 0:52468b19aa21 53 /*----------------------------------------------------------------------------
alanffrench 0:52468b19aa21 54 * Functions
alanffrench 0:52468b19aa21 55 *---------------------------------------------------------------------------*/
alanffrench 0:52468b19aa21 56
alanffrench 0:52468b19aa21 57
alanffrench 0:52468b19aa21 58 /*--------------------------- rt_put_prio -----------------------------------*/
alanffrench 0:52468b19aa21 59
alanffrench 0:52468b19aa21 60 void rt_put_prio (P_XCB p_CB, P_TCB p_task) {
alanffrench 0:52468b19aa21 61 /* Put task identified with "p_task" into list ordered by priority. */
alanffrench 0:52468b19aa21 62 /* "p_CB" points to head of list; list has always an element at end with */
alanffrench 0:52468b19aa21 63 /* a priority less than "p_task->prio". */
alanffrench 0:52468b19aa21 64 P_TCB p_CB2;
alanffrench 0:52468b19aa21 65 U32 prio;
alanffrench 0:52468b19aa21 66 BOOL sem_mbx = __FALSE;
alanffrench 0:52468b19aa21 67
alanffrench 0:52468b19aa21 68 if (p_CB->cb_type == SCB || p_CB->cb_type == MCB || p_CB->cb_type == MUCB) {
alanffrench 0:52468b19aa21 69 sem_mbx = __TRUE;
alanffrench 0:52468b19aa21 70 }
alanffrench 0:52468b19aa21 71 prio = p_task->prio;
alanffrench 0:52468b19aa21 72 p_CB2 = p_CB->p_lnk;
alanffrench 0:52468b19aa21 73 /* Search for an entry in the list */
alanffrench 0:52468b19aa21 74 while (p_CB2 != NULL && prio <= p_CB2->prio) {
alanffrench 0:52468b19aa21 75 p_CB = (P_XCB)p_CB2;
alanffrench 0:52468b19aa21 76 p_CB2 = p_CB2->p_lnk;
alanffrench 0:52468b19aa21 77 }
alanffrench 0:52468b19aa21 78 /* Entry found, insert the task into the list */
alanffrench 0:52468b19aa21 79 p_task->p_lnk = p_CB2;
alanffrench 0:52468b19aa21 80 p_CB->p_lnk = p_task;
alanffrench 0:52468b19aa21 81 if (sem_mbx) {
alanffrench 0:52468b19aa21 82 if (p_CB2 != NULL) {
alanffrench 0:52468b19aa21 83 p_CB2->p_rlnk = p_task;
alanffrench 0:52468b19aa21 84 }
alanffrench 0:52468b19aa21 85 p_task->p_rlnk = (P_TCB)p_CB;
alanffrench 0:52468b19aa21 86 }
alanffrench 0:52468b19aa21 87 else {
alanffrench 0:52468b19aa21 88 p_task->p_rlnk = NULL;
alanffrench 0:52468b19aa21 89 }
alanffrench 0:52468b19aa21 90 }
alanffrench 0:52468b19aa21 91
alanffrench 0:52468b19aa21 92
alanffrench 0:52468b19aa21 93 /*--------------------------- rt_get_first ----------------------------------*/
alanffrench 0:52468b19aa21 94
alanffrench 0:52468b19aa21 95 P_TCB rt_get_first (P_XCB p_CB) {
alanffrench 0:52468b19aa21 96 /* Get task at head of list: it is the task with highest priority. */
alanffrench 0:52468b19aa21 97 /* "p_CB" points to head of list. */
alanffrench 0:52468b19aa21 98 P_TCB p_first;
alanffrench 0:52468b19aa21 99
alanffrench 0:52468b19aa21 100 p_first = p_CB->p_lnk;
alanffrench 0:52468b19aa21 101 p_CB->p_lnk = p_first->p_lnk;
alanffrench 0:52468b19aa21 102 if (p_CB->cb_type == SCB || p_CB->cb_type == MCB || p_CB->cb_type == MUCB) {
alanffrench 0:52468b19aa21 103 if (p_first->p_lnk != NULL) {
alanffrench 0:52468b19aa21 104 p_first->p_lnk->p_rlnk = (P_TCB)p_CB;
alanffrench 0:52468b19aa21 105 p_first->p_lnk = NULL;
alanffrench 0:52468b19aa21 106 }
alanffrench 0:52468b19aa21 107 p_first->p_rlnk = NULL;
alanffrench 0:52468b19aa21 108 }
alanffrench 0:52468b19aa21 109 else {
alanffrench 0:52468b19aa21 110 p_first->p_lnk = NULL;
alanffrench 0:52468b19aa21 111 }
alanffrench 0:52468b19aa21 112 return (p_first);
alanffrench 0:52468b19aa21 113 }
alanffrench 0:52468b19aa21 114
alanffrench 0:52468b19aa21 115
alanffrench 0:52468b19aa21 116 /*--------------------------- rt_put_rdy_first ------------------------------*/
alanffrench 0:52468b19aa21 117
alanffrench 0:52468b19aa21 118 void rt_put_rdy_first (P_TCB p_task) {
alanffrench 0:52468b19aa21 119 /* Put task identified with "p_task" at the head of the ready list. The */
alanffrench 0:52468b19aa21 120 /* task must have at least a priority equal to highest priority in list. */
alanffrench 0:52468b19aa21 121 p_task->p_lnk = os_rdy.p_lnk;
alanffrench 0:52468b19aa21 122 p_task->p_rlnk = NULL;
alanffrench 0:52468b19aa21 123 os_rdy.p_lnk = p_task;
alanffrench 0:52468b19aa21 124 }
alanffrench 0:52468b19aa21 125
alanffrench 0:52468b19aa21 126
alanffrench 0:52468b19aa21 127 /*--------------------------- rt_get_same_rdy_prio --------------------------*/
alanffrench 0:52468b19aa21 128
alanffrench 0:52468b19aa21 129 P_TCB rt_get_same_rdy_prio (void) {
alanffrench 0:52468b19aa21 130 /* Remove a task of same priority from ready list if any exists. Other- */
alanffrench 0:52468b19aa21 131 /* wise return NULL. */
alanffrench 0:52468b19aa21 132 P_TCB p_first;
alanffrench 0:52468b19aa21 133
alanffrench 0:52468b19aa21 134 p_first = os_rdy.p_lnk;
alanffrench 0:52468b19aa21 135 if (p_first->prio == os_tsk.run->prio) {
alanffrench 0:52468b19aa21 136 os_rdy.p_lnk = os_rdy.p_lnk->p_lnk;
alanffrench 0:52468b19aa21 137 return (p_first);
alanffrench 0:52468b19aa21 138 }
alanffrench 0:52468b19aa21 139 return (NULL);
alanffrench 0:52468b19aa21 140 }
alanffrench 0:52468b19aa21 141
alanffrench 0:52468b19aa21 142
alanffrench 0:52468b19aa21 143 /*--------------------------- rt_resort_prio --------------------------------*/
alanffrench 0:52468b19aa21 144
alanffrench 0:52468b19aa21 145 void rt_resort_prio (P_TCB p_task) {
alanffrench 0:52468b19aa21 146 /* Re-sort ordered lists after the priority of 'p_task' has changed. */
alanffrench 0:52468b19aa21 147 P_TCB p_CB;
alanffrench 0:52468b19aa21 148
alanffrench 0:52468b19aa21 149 if (p_task->p_rlnk == NULL) {
alanffrench 0:52468b19aa21 150 if (p_task->state == READY) {
alanffrench 0:52468b19aa21 151 /* Task is chained into READY list. */
alanffrench 0:52468b19aa21 152 p_CB = (P_TCB)&os_rdy;
alanffrench 0:52468b19aa21 153 goto res;
alanffrench 0:52468b19aa21 154 }
alanffrench 0:52468b19aa21 155 }
alanffrench 0:52468b19aa21 156 else {
alanffrench 0:52468b19aa21 157 p_CB = p_task->p_rlnk;
alanffrench 0:52468b19aa21 158 while (p_CB->cb_type == TCB) {
alanffrench 0:52468b19aa21 159 /* Find a header of this task chain list. */
alanffrench 0:52468b19aa21 160 p_CB = p_CB->p_rlnk;
alanffrench 0:52468b19aa21 161 }
alanffrench 0:52468b19aa21 162 res:rt_rmv_list (p_task);
alanffrench 0:52468b19aa21 163 rt_put_prio ((P_XCB)p_CB, p_task);
alanffrench 0:52468b19aa21 164 }
alanffrench 0:52468b19aa21 165 }
alanffrench 0:52468b19aa21 166
alanffrench 0:52468b19aa21 167
alanffrench 0:52468b19aa21 168 /*--------------------------- rt_put_dly ------------------------------------*/
alanffrench 0:52468b19aa21 169
alanffrench 0:52468b19aa21 170 void rt_put_dly (P_TCB p_task, U16 delay) {
alanffrench 0:52468b19aa21 171 /* Put a task identified with "p_task" into chained delay wait list using */
alanffrench 0:52468b19aa21 172 /* a delay value of "delay". */
alanffrench 0:52468b19aa21 173 P_TCB p;
alanffrench 0:52468b19aa21 174 U32 delta,idelay = delay;
alanffrench 0:52468b19aa21 175
alanffrench 0:52468b19aa21 176 p = (P_TCB)&os_dly;
alanffrench 0:52468b19aa21 177 if (p->p_dlnk == NULL) {
alanffrench 0:52468b19aa21 178 /* Delay list empty */
alanffrench 0:52468b19aa21 179 delta = 0;
alanffrench 0:52468b19aa21 180 goto last;
alanffrench 0:52468b19aa21 181 }
alanffrench 0:52468b19aa21 182 delta = os_dly.delta_time;
alanffrench 0:52468b19aa21 183 while (delta < idelay) {
alanffrench 0:52468b19aa21 184 if (p->p_dlnk == NULL) {
alanffrench 0:52468b19aa21 185 /* End of list found */
alanffrench 0:52468b19aa21 186 last: p_task->p_dlnk = NULL;
alanffrench 0:52468b19aa21 187 p->p_dlnk = p_task;
alanffrench 0:52468b19aa21 188 p_task->p_blnk = p;
alanffrench 0:52468b19aa21 189 p->delta_time = (U16)(idelay - delta);
alanffrench 0:52468b19aa21 190 p_task->delta_time = 0;
alanffrench 0:52468b19aa21 191 return;
alanffrench 0:52468b19aa21 192 }
alanffrench 0:52468b19aa21 193 p = p->p_dlnk;
alanffrench 0:52468b19aa21 194 delta += p->delta_time;
alanffrench 0:52468b19aa21 195 }
alanffrench 0:52468b19aa21 196 /* Right place found */
alanffrench 0:52468b19aa21 197 p_task->p_dlnk = p->p_dlnk;
alanffrench 0:52468b19aa21 198 p->p_dlnk = p_task;
alanffrench 0:52468b19aa21 199 p_task->p_blnk = p;
alanffrench 0:52468b19aa21 200 if (p_task->p_dlnk != NULL) {
alanffrench 0:52468b19aa21 201 p_task->p_dlnk->p_blnk = p_task;
alanffrench 0:52468b19aa21 202 }
alanffrench 0:52468b19aa21 203 p_task->delta_time = (U16)(delta - idelay);
alanffrench 0:52468b19aa21 204 p->delta_time -= p_task->delta_time;
alanffrench 0:52468b19aa21 205 }
alanffrench 0:52468b19aa21 206
alanffrench 0:52468b19aa21 207
alanffrench 0:52468b19aa21 208 /*--------------------------- rt_dec_dly ------------------------------------*/
alanffrench 0:52468b19aa21 209
alanffrench 0:52468b19aa21 210 void rt_dec_dly (void) {
alanffrench 0:52468b19aa21 211 /* Decrement delta time of list head: remove tasks having a value of zero.*/
alanffrench 0:52468b19aa21 212 P_TCB p_rdy;
alanffrench 0:52468b19aa21 213
alanffrench 0:52468b19aa21 214 if (os_dly.p_dlnk == NULL) {
alanffrench 0:52468b19aa21 215 return;
alanffrench 0:52468b19aa21 216 }
alanffrench 0:52468b19aa21 217 os_dly.delta_time--;
alanffrench 0:52468b19aa21 218 while ((os_dly.delta_time == 0) && (os_dly.p_dlnk != NULL)) {
alanffrench 0:52468b19aa21 219 p_rdy = os_dly.p_dlnk;
alanffrench 0:52468b19aa21 220 if (p_rdy->p_rlnk != NULL) {
alanffrench 0:52468b19aa21 221 /* Task is really enqueued, remove task from semaphore/mailbox */
alanffrench 0:52468b19aa21 222 /* timeout waiting list. */
alanffrench 0:52468b19aa21 223 p_rdy->p_rlnk->p_lnk = p_rdy->p_lnk;
alanffrench 0:52468b19aa21 224 if (p_rdy->p_lnk != NULL) {
alanffrench 0:52468b19aa21 225 p_rdy->p_lnk->p_rlnk = p_rdy->p_rlnk;
alanffrench 0:52468b19aa21 226 p_rdy->p_lnk = NULL;
alanffrench 0:52468b19aa21 227 }
alanffrench 0:52468b19aa21 228 p_rdy->p_rlnk = NULL;
alanffrench 0:52468b19aa21 229 }
alanffrench 0:52468b19aa21 230 rt_put_prio (&os_rdy, p_rdy);
alanffrench 0:52468b19aa21 231 os_dly.delta_time = p_rdy->delta_time;
alanffrench 0:52468b19aa21 232 if (p_rdy->state == WAIT_ITV) {
alanffrench 0:52468b19aa21 233 /* Calculate the next time for interval wait. */
alanffrench 0:52468b19aa21 234 p_rdy->delta_time = p_rdy->interval_time + (U16)os_time;
alanffrench 0:52468b19aa21 235 }
alanffrench 0:52468b19aa21 236 p_rdy->state = READY;
alanffrench 0:52468b19aa21 237 os_dly.p_dlnk = p_rdy->p_dlnk;
alanffrench 0:52468b19aa21 238 if (p_rdy->p_dlnk != NULL) {
alanffrench 0:52468b19aa21 239 p_rdy->p_dlnk->p_blnk = (P_TCB)&os_dly;
alanffrench 0:52468b19aa21 240 p_rdy->p_dlnk = NULL;
alanffrench 0:52468b19aa21 241 }
alanffrench 0:52468b19aa21 242 p_rdy->p_blnk = NULL;
alanffrench 0:52468b19aa21 243 }
alanffrench 0:52468b19aa21 244 }
alanffrench 0:52468b19aa21 245
alanffrench 0:52468b19aa21 246
alanffrench 0:52468b19aa21 247 /*--------------------------- rt_rmv_list -----------------------------------*/
alanffrench 0:52468b19aa21 248
alanffrench 0:52468b19aa21 249 void rt_rmv_list (P_TCB p_task) {
alanffrench 0:52468b19aa21 250 /* Remove task identified with "p_task" from ready, semaphore or mailbox */
alanffrench 0:52468b19aa21 251 /* waiting list if enqueued. */
alanffrench 0:52468b19aa21 252 P_TCB p_b;
alanffrench 0:52468b19aa21 253
alanffrench 0:52468b19aa21 254 if (p_task->p_rlnk != NULL) {
alanffrench 0:52468b19aa21 255 /* A task is enqueued in semaphore / mailbox waiting list. */
alanffrench 0:52468b19aa21 256 p_task->p_rlnk->p_lnk = p_task->p_lnk;
alanffrench 0:52468b19aa21 257 if (p_task->p_lnk != NULL) {
alanffrench 0:52468b19aa21 258 p_task->p_lnk->p_rlnk = p_task->p_rlnk;
alanffrench 0:52468b19aa21 259 }
alanffrench 0:52468b19aa21 260 return;
alanffrench 0:52468b19aa21 261 }
alanffrench 0:52468b19aa21 262
alanffrench 0:52468b19aa21 263 p_b = (P_TCB)&os_rdy;
alanffrench 0:52468b19aa21 264 while (p_b != NULL) {
alanffrench 0:52468b19aa21 265 /* Search the ready list for task "p_task" */
alanffrench 0:52468b19aa21 266 if (p_b->p_lnk == p_task) {
alanffrench 0:52468b19aa21 267 p_b->p_lnk = p_task->p_lnk;
alanffrench 0:52468b19aa21 268 return;
alanffrench 0:52468b19aa21 269 }
alanffrench 0:52468b19aa21 270 p_b = p_b->p_lnk;
alanffrench 0:52468b19aa21 271 }
alanffrench 0:52468b19aa21 272 }
alanffrench 0:52468b19aa21 273
alanffrench 0:52468b19aa21 274
alanffrench 0:52468b19aa21 275 /*--------------------------- rt_rmv_dly ------------------------------------*/
alanffrench 0:52468b19aa21 276
alanffrench 0:52468b19aa21 277 void rt_rmv_dly (P_TCB p_task) {
alanffrench 0:52468b19aa21 278 /* Remove task identified with "p_task" from delay list if enqueued. */
alanffrench 0:52468b19aa21 279 P_TCB p_b;
alanffrench 0:52468b19aa21 280
alanffrench 0:52468b19aa21 281 p_b = p_task->p_blnk;
alanffrench 0:52468b19aa21 282 if (p_b != NULL) {
alanffrench 0:52468b19aa21 283 /* Task is really enqueued */
alanffrench 0:52468b19aa21 284 p_b->p_dlnk = p_task->p_dlnk;
alanffrench 0:52468b19aa21 285 if (p_task->p_dlnk != NULL) {
alanffrench 0:52468b19aa21 286 /* 'p_task' is in the middle of list */
alanffrench 0:52468b19aa21 287 p_b->delta_time += p_task->delta_time;
alanffrench 0:52468b19aa21 288 p_task->p_dlnk->p_blnk = p_b;
alanffrench 0:52468b19aa21 289 p_task->p_dlnk = NULL;
alanffrench 0:52468b19aa21 290 }
alanffrench 0:52468b19aa21 291 else {
alanffrench 0:52468b19aa21 292 /* 'p_task' is at the end of list */
alanffrench 0:52468b19aa21 293 p_b->delta_time = 0;
alanffrench 0:52468b19aa21 294 }
alanffrench 0:52468b19aa21 295 p_task->p_blnk = NULL;
alanffrench 0:52468b19aa21 296 }
alanffrench 0:52468b19aa21 297 }
alanffrench 0:52468b19aa21 298
alanffrench 0:52468b19aa21 299
alanffrench 0:52468b19aa21 300 /*--------------------------- rt_psq_enq ------------------------------------*/
alanffrench 0:52468b19aa21 301
alanffrench 0:52468b19aa21 302 void rt_psq_enq (OS_ID entry, U32 arg) {
alanffrench 0:52468b19aa21 303 /* Insert post service request "entry" into ps-queue. */
alanffrench 0:52468b19aa21 304 U32 idx;
alanffrench 0:52468b19aa21 305
alanffrench 0:52468b19aa21 306 idx = rt_inc_qi (os_psq->size, &os_psq->count, &os_psq->first);
alanffrench 0:52468b19aa21 307 if (idx < os_psq->size) {
alanffrench 0:52468b19aa21 308 os_psq->q[idx].id = entry;
alanffrench 0:52468b19aa21 309 os_psq->q[idx].arg = arg;
alanffrench 0:52468b19aa21 310 }
alanffrench 0:52468b19aa21 311 else {
alanffrench 0:52468b19aa21 312 os_error (OS_ERR_FIFO_OVF);
alanffrench 0:52468b19aa21 313 }
alanffrench 0:52468b19aa21 314 }
alanffrench 0:52468b19aa21 315
alanffrench 0:52468b19aa21 316
alanffrench 0:52468b19aa21 317 /*----------------------------------------------------------------------------
alanffrench 0:52468b19aa21 318 * end of file
alanffrench 0:52468b19aa21 319 *---------------------------------------------------------------------------*/
alanffrench 0:52468b19aa21 320