Austin Blackstone / Mbed 2 deprecated client-lwip-lightswitch-demo-expanded

mbed client lightswitch demo

Dependencies:   mbed Socket lwip-eth lwip-sys lwip

Fork of mbed-client-classic-example-lwip by Austin Blackstone

mbed-rtos/rtx/TARGET_ARM7/rt_List.c@11:cada08fc8a70, 2016-06-09 (annotated)

Committer:
mbedAustin
Date:
Thu Jun 09 17:08:36 2016 +0000
Revision:
11:cada08fc8a70
Commit for public Consumption

Who changed what in which revision?

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