Doubea Pierre / Mbed 2 deprecated HW3

Lab Checkoff

Dependencies:   SDFileSystem TextLCD mbed-rtos mbed wave_player FATFileSystem

mbed-rtos/rtx/rt_List.c@0:67dbd54e60d4, 2013-11-13 (annotated)

Committer:
doubster
Date:
Wed Nov 13 20:00:28 2013 +0000
Revision:
0:67dbd54e60d4
Lab Checkoff

Who changed what in which revision?

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