V M / Mbed 2 deprecated NRF24L01_receiver

NRF com

Dependencies:   mbed nRF24L01P

mbed-rtos/rtx/rt_List.c@0:fdfe93cb9255, 2013-05-27 (annotated)

Committer:
vmihalcut
Date:
Mon May 27 06:06:31 2013 +0000
Revision:
0:fdfe93cb9255
NRF24L01 receiver

Who changed what in which revision?

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