[388] | 1 | /*
|
---|
| 2 | * TOPPERS Software
|
---|
| 3 | * Toyohashi Open Platform for Embedded Real-Time Systems
|
---|
| 4 | *
|
---|
| 5 | * Copyright (C) 2000 by Embedded and Real-Time Systems Laboratory
|
---|
| 6 | * Toyohashi Univ. of Technology, JAPAN
|
---|
| 7 | * Copyright (C) 2006-2011 by Embedded and Real-Time Systems Laboratory
|
---|
| 8 | * Graduate School of Information Science, Nagoya Univ., JAPAN
|
---|
| 9 | *
|
---|
| 10 | * ä¸è¨èä½æ¨©è
|
---|
| 11 | ã¯ï¼ä»¥ä¸ã®(1)ï½(4)ã®æ¡ä»¶ãæºããå ´åã«éãï¼æ¬ã½ããã¦ã§
|
---|
| 12 | * ã¢ï¼æ¬ã½ããã¦ã§ã¢ãæ¹å¤ãããã®ãå«ãï¼ä»¥ä¸åãï¼ã使ç¨ã»è¤è£½ã»æ¹
|
---|
| 13 | * å¤ã»åé
|
---|
| 14 | å¸ï¼ä»¥ä¸ï¼å©ç¨ã¨å¼ã¶ï¼ãããã¨ãç¡åã§è¨±è«¾ããï¼
|
---|
| 15 | * (1) æ¬ã½ããã¦ã§ã¢ãã½ã¼ã¹ã³ã¼ãã®å½¢ã§å©ç¨ããå ´åã«ã¯ï¼ä¸è¨ã®èä½
|
---|
| 16 | * 権表示ï¼ãã®å©ç¨æ¡ä»¶ããã³ä¸è¨ã®ç¡ä¿è¨¼è¦å®ãï¼ãã®ã¾ã¾ã®å½¢ã§ã½ã¼
|
---|
| 17 | * ã¹ã³ã¼ãä¸ã«å«ã¾ãã¦ãããã¨ï¼
|
---|
| 18 | * (2) æ¬ã½ããã¦ã§ã¢ãï¼ã©ã¤ãã©ãªå½¢å¼ãªã©ï¼ä»ã®ã½ããã¦ã§ã¢éçºã«ä½¿
|
---|
| 19 | * ç¨ã§ããå½¢ã§åé
|
---|
| 20 | å¸ããå ´åã«ã¯ï¼åé
|
---|
| 21 | å¸ã«ä¼´ãããã¥ã¡ã³ãï¼å©ç¨
|
---|
| 22 | * è
|
---|
| 23 | ããã¥ã¢ã«ãªã©ï¼ã«ï¼ä¸è¨ã®èä½æ¨©è¡¨ç¤ºï¼ãã®å©ç¨æ¡ä»¶ããã³ä¸è¨
|
---|
| 24 | * ã®ç¡ä¿è¨¼è¦å®ãæ²è¼ãããã¨ï¼
|
---|
| 25 | * (3) æ¬ã½ããã¦ã§ã¢ãï¼æ©å¨ã«çµã¿è¾¼ããªã©ï¼ä»ã®ã½ããã¦ã§ã¢éçºã«ä½¿
|
---|
| 26 | * ç¨ã§ããªãå½¢ã§åé
|
---|
| 27 | å¸ããå ´åã«ã¯ï¼æ¬¡ã®ããããã®æ¡ä»¶ãæºããã
|
---|
| 28 | * ã¨ï¼
|
---|
| 29 | * (a) åé
|
---|
| 30 | å¸ã«ä¼´ãããã¥ã¡ã³ãï¼å©ç¨è
|
---|
| 31 | ããã¥ã¢ã«ãªã©ï¼ã«ï¼ä¸è¨ã®è
|
---|
| 32 | * ä½æ¨©è¡¨ç¤ºï¼ãã®å©ç¨æ¡ä»¶ããã³ä¸è¨ã®ç¡ä¿è¨¼è¦å®ãæ²è¼ãããã¨ï¼
|
---|
| 33 | * (b) åé
|
---|
| 34 | å¸ã®å½¢æ
|
---|
| 35 | ãï¼å¥ã«å®ããæ¹æ³ã«ãã£ã¦ï¼TOPPERSããã¸ã§ã¯ãã«
|
---|
| 36 | * å ±åãããã¨ï¼
|
---|
| 37 | * (4) æ¬ã½ããã¦ã§ã¢ã®å©ç¨ã«ããç´æ¥çã¾ãã¯éæ¥çã«çãããããªãæ
|
---|
| 38 | * 害ãããï¼ä¸è¨èä½æ¨©è
|
---|
| 39 | ããã³TOPPERSããã¸ã§ã¯ããå
|
---|
| 40 | 責ãããã¨ï¼
|
---|
| 41 | * ã¾ãï¼æ¬ã½ããã¦ã§ã¢ã®ã¦ã¼ã¶ã¾ãã¯ã¨ã³ãã¦ã¼ã¶ããã®ãããªãç
|
---|
| 42 | * ç±ã«åºã¥ãè«æ±ãããï¼ä¸è¨èä½æ¨©è
|
---|
| 43 | ããã³TOPPERSããã¸ã§ã¯ãã
|
---|
| 44 | * å
|
---|
| 45 | 責ãããã¨ï¼
|
---|
| 46 | *
|
---|
| 47 | * æ¬ã½ããã¦ã§ã¢ã¯ï¼ç¡ä¿è¨¼ã§æä¾ããã¦ãããã®ã§ããï¼ä¸è¨èä½æ¨©è
|
---|
| 48 | ã
|
---|
| 49 | * ãã³TOPPERSããã¸ã§ã¯ãã¯ï¼æ¬ã½ããã¦ã§ã¢ã«é¢ãã¦ï¼ç¹å®ã®ä½¿ç¨ç®ç
|
---|
| 50 | * ã«å¯¾ããé©åæ§ãå«ãã¦ï¼ãããªãä¿è¨¼ãè¡ããªãï¼ã¾ãï¼æ¬ã½ããã¦ã§
|
---|
| 51 | * ã¢ã®å©ç¨ã«ããç´æ¥çã¾ãã¯éæ¥çã«çãããããªãæ害ã«é¢ãã¦ãï¼ã
|
---|
| 52 | * ã®è²¬ä»»ãè² ããªãï¼
|
---|
| 53 | *
|
---|
| 54 | * $Id: queue.h 388 2019-05-22 11:25:18Z coas-nagasima $
|
---|
| 55 | */
|
---|
| 56 |
|
---|
| 57 | /*
|
---|
| 58 | * ãã¥ã¼æä½ã©ã¤ãã©ãª
|
---|
| 59 | *
|
---|
| 60 | * ãã®ãã¥ã¼æä½ã©ã¤ãã©ãªã§ã¯ï¼ãã¥ã¼ããããå«ããªã³ã°æ§é ã®ããã«
|
---|
| 61 | * ãªã³ã¯ãã¥ã¼ãæ±ãï¼å
|
---|
| 62 | ·ä½çã«ã¯ï¼ãã¥ã¼ãããã®æ¬¡ã¨ã³ããªã¯ãã¥ã¼ã®
|
---|
| 63 | * å
|
---|
| 64 | é ã®ã¨ã³ããªï¼åã¨ã³ããªã¯ãã¥ã¼ã®æ«å°¾ã®ã¨ã³ããªã¨ããï¼ã¾ãï¼ã
|
---|
| 65 | * ã¥ã¼ã®å
|
---|
| 66 | é ã®ã¨ã³ããªã®åã¨ã³ããªã¨ï¼ãã¥ã¼ã®æ«å°¾ã®ã¨ã³ããªã®æ¬¡ã¨ã³
|
---|
| 67 | * ããªã¯ï¼ãã¥ã¼ãããã¨ããï¼ç©ºã®ãã¥ã¼ã¯ï¼æ¬¡ã¨ã³ããªï¼åã¨ã³ããªã¨
|
---|
| 68 | * ãèªåèªèº«ãæããã¥ã¼ãããã§ããããï¼
|
---|
| 69 | */
|
---|
| 70 |
|
---|
| 71 | #ifndef TOPPERS_QUEUE_H
|
---|
| 72 | #define TOPPERS_QUEUE_H
|
---|
| 73 |
|
---|
| 74 | #ifdef __cplusplus
|
---|
| 75 | extern "C" {
|
---|
| 76 | #endif
|
---|
| 77 |
|
---|
| 78 | #include <t_stddef.h>
|
---|
| 79 | #include <t_syslog.h>
|
---|
| 80 |
|
---|
| 81 | /*
|
---|
| 82 | * ãã¥ã¼ã®ãã¼ã¿æ§é ã®å®ç¾©
|
---|
| 83 | */
|
---|
| 84 | typedef struct queue {
|
---|
| 85 | struct queue *p_next; /* 次ã¨ã³ããªã¸ã®ãã¤ã³ã¿ */
|
---|
| 86 | struct queue *p_prev; /* åã¨ã³ããªã¸ã®ãã¤ã³ã¿ */
|
---|
| 87 | } QUEUE;
|
---|
| 88 |
|
---|
| 89 | /*
|
---|
| 90 | * ãã¥ã¼ã®åæå
|
---|
| 91 | *
|
---|
| 92 | * p_queueã«ã¯ãã¥ã¼ããããæå®ããï¼
|
---|
| 93 | */
|
---|
| 94 | Inline void
|
---|
| 95 | queue_initialize(QUEUE *p_queue)
|
---|
| 96 | {
|
---|
| 97 | p_queue->p_prev = p_queue;
|
---|
| 98 | p_queue->p_next = p_queue;
|
---|
| 99 | }
|
---|
| 100 |
|
---|
| 101 | /*
|
---|
| 102 | * ãã¥ã¼ã®åã¨ã³ããªã¸ã®æ¿å
|
---|
| 103 | ¥
|
---|
| 104 | *
|
---|
| 105 | * p_queueã®åã«p_entryãæ¿å
|
---|
| 106 | ¥ããï¼p_queueã«ãã¥ã¼ããããæå®ããå ´
|
---|
| 107 | * åã«ã¯ï¼ãã¥ã¼ã®æ«å°¾ã«p_entryãæ¿å
|
---|
| 108 | ¥ãããã¨ã«ãªãï¼
|
---|
| 109 | */
|
---|
| 110 | Inline void
|
---|
| 111 | queue_insert_prev(QUEUE *p_queue, QUEUE *p_entry)
|
---|
| 112 | {
|
---|
| 113 | p_entry->p_prev = p_queue->p_prev;
|
---|
| 114 | p_entry->p_next = p_queue;
|
---|
| 115 | p_queue->p_prev->p_next = p_entry;
|
---|
| 116 | p_queue->p_prev = p_entry;
|
---|
| 117 | }
|
---|
| 118 |
|
---|
| 119 | /*
|
---|
| 120 | * ãã¥ã¼ã®æ¬¡ã¨ã³ããªã¸ã®æ¿å
|
---|
| 121 | ¥
|
---|
| 122 | *
|
---|
| 123 | * p_queueã®æ¬¡ã«p_entryãæ¿å
|
---|
| 124 | ¥ããï¼p_queueã«ãã¥ã¼ããããæå®ããå ´
|
---|
| 125 | * åã«ã¯ï¼ãã¥ã¼ã®å
|
---|
| 126 | é ã«p_entryãæ¿å
|
---|
| 127 | ¥ãããã¨ã«ãªãï¼
|
---|
| 128 | */
|
---|
| 129 | Inline void
|
---|
| 130 | queue_insert_next(QUEUE *p_queue, QUEUE *p_entry)
|
---|
| 131 | {
|
---|
| 132 | p_entry->p_prev = p_queue;
|
---|
| 133 | p_entry->p_next = p_queue->p_next;
|
---|
| 134 | p_queue->p_next->p_prev = p_entry;
|
---|
| 135 | p_queue->p_next = p_entry;
|
---|
| 136 | }
|
---|
| 137 |
|
---|
| 138 | /*
|
---|
| 139 | * ã¨ã³ããªã®åé¤
|
---|
| 140 | *
|
---|
| 141 | * p_entryããã¥ã¼ããåé¤ããï¼
|
---|
| 142 | */
|
---|
| 143 | Inline void
|
---|
| 144 | queue_delete(QUEUE *p_entry)
|
---|
| 145 | {
|
---|
| 146 | p_entry->p_prev->p_next = p_entry->p_next;
|
---|
| 147 | p_entry->p_next->p_prev = p_entry->p_prev;
|
---|
| 148 | }
|
---|
| 149 |
|
---|
| 150 | /*
|
---|
| 151 | * ãã¥ã¼ã®æ¬¡ã¨ã³ããªã®ååºã
|
---|
| 152 | *
|
---|
| 153 | * p_queueã®æ¬¡ã¨ã³ããªããã¥ã¼ããåé¤ãï¼åé¤ããã¨ã³ããªãè¿ãï¼
|
---|
| 154 | * p_queueã«ãã¥ã¼ããããæå®ããå ´åã«ã¯ï¼ãã¥ã¼ã®å
|
---|
| 155 | é ã®ã¨ã³ããªã
|
---|
| 156 | * åãåºããã¨ã«ãªãï¼p_queueã«ç©ºã®ãã¥ã¼ãæå®ãã¦å¼ã³åºãã¦ã¯ãªã
|
---|
| 157 | * ãªãï¼
|
---|
| 158 | */
|
---|
| 159 | Inline QUEUE *
|
---|
| 160 | queue_delete_next(QUEUE *p_queue)
|
---|
| 161 | {
|
---|
| 162 | QUEUE *p_entry;
|
---|
| 163 |
|
---|
| 164 | assert(p_queue->p_next != p_queue);
|
---|
| 165 | p_entry = p_queue->p_next;
|
---|
| 166 | p_queue->p_next = p_entry->p_next;
|
---|
| 167 | p_entry->p_next->p_prev = p_queue;
|
---|
| 168 | return(p_entry);
|
---|
| 169 | }
|
---|
| 170 |
|
---|
| 171 | /*
|
---|
| 172 | * ãã¥ã¼ã空ãã©ããã®ãã§ãã¯
|
---|
| 173 | *
|
---|
| 174 | * p_queueã«ã¯ãã¥ã¼ããããæå®ããï¼
|
---|
| 175 | */
|
---|
| 176 | Inline bool_t
|
---|
| 177 | queue_empty(QUEUE *p_queue)
|
---|
| 178 | {
|
---|
| 179 | if (p_queue->p_next == p_queue) {
|
---|
| 180 | assert(p_queue->p_prev == p_queue);
|
---|
| 181 | return(true);
|
---|
| 182 | }
|
---|
| 183 | return(false);
|
---|
| 184 | }
|
---|
| 185 |
|
---|
| 186 | #ifdef __cplusplus
|
---|
| 187 | }
|
---|
| 188 | #endif
|
---|
| 189 |
|
---|
| 190 | #endif /* TOPPERS_QUEUE_H */
|
---|