source: asp_ewarm/asp-1.7.0/extension/dcre/kernel/task.c@ 61

Last change on this file since 61 was 61, checked in by ertl-honda, 11 years ago

ASP for EWARM のコミット.

File size: 11.3 KB
Line 
1/*
2 * TOPPERS/ASP Kernel
3 * Toyohashi Open Platform for Embedded Real-Time Systems/
4 * Advanced Standard Profile Kernel
5 *
6 * Copyright (C) 2000-2003 by Embedded and Real-Time Systems Laboratory
7 * Toyohashi Univ. of Technology, JAPAN
8 * Copyright (C) 2005-2010 by Embedded and Real-Time Systems Laboratory
9 * Graduate School of Information Science, Nagoya Univ., JAPAN
10 *
11 * ã‹L’˜ìŒ ŽÒ‚́CˆÈ‰º‚Ì(1)`(4)‚ÌðŒ‚ð–ž‚½‚·ê‡‚ÉŒÀ‚èC–{ƒ\ƒtƒgƒEƒF
12 * ƒAi–{ƒ\ƒtƒgƒEƒFƒA‚ð‰ü•Ï‚µ‚½‚à‚Ì‚ðŠÜ‚ށDˆÈ‰º“¯‚¶j‚ðŽg—pE•¡»E‰ü
13 * •ÏEÄ”z•ziˆÈ‰ºC—˜—p‚ƌĂԁj‚·‚邱‚Ƃ𖳏ž‚Å‹–‘ø‚·‚éD
14 * (1) –{ƒ\ƒtƒgƒEƒFƒA‚ðƒ\[ƒXƒR[ƒh‚ÌŒ`‚Å—˜—p‚·‚éê‡‚ɂ́Cã‹L‚Ì’˜ì
15 * Œ •\Ž¦C‚±‚Ì—˜—pðŒ‚¨‚æ‚щº‹L‚Ì–³•ÛØ‹K’肪C‚»‚Ì‚Ü‚Ü‚ÌŒ`‚Ń\[
16 * ƒXƒR[ƒh’†‚ÉŠÜ‚Ü‚ê‚Ä‚¢‚邱‚ƁD
17 * (2) –{ƒ\ƒtƒgƒEƒFƒA‚ðCƒ‰ƒCƒuƒ‰ƒŠŒ`Ž®‚ȂǁC‘¼‚̃\ƒtƒgƒEƒFƒAŠJ”­‚ÉŽg
18 * —p‚Å‚«‚éŒ`‚ōĔz•z‚·‚éê‡‚ɂ́CÄ”z•z‚É”º‚¤ƒhƒLƒ…
19ƒƒ“ƒgi—˜—p
20 * ŽÒƒ}ƒjƒ…
21ƒAƒ‹‚Ȃǁj‚ɁCã‹L‚Ì’˜ìŒ •\Ž¦C‚±‚Ì—˜—pðŒ‚¨‚æ‚щº‹L
22 * ‚Ì–³•ÛØ‹K’è‚ðŒfÚ‚·‚邱‚ƁD
23 * (3) –{ƒ\ƒtƒgƒEƒFƒA‚ðC‹@Ší‚É‘g‚ݍž‚ނȂǁC‘¼‚̃\ƒtƒgƒEƒFƒAŠJ”­‚ÉŽg
24 * —p‚Å‚«‚È‚¢Œ`‚ōĔz•z‚·‚éê‡‚ɂ́CŽŸ‚Ì‚¢‚¸‚ê‚©‚ÌðŒ‚ð–ž‚½‚·‚±
25 * ‚ƁD
26 * (a) Ä”z•z‚É”º‚¤ƒhƒLƒ…
27ƒƒ“ƒgi—˜—pŽÒƒ}ƒjƒ…
28ƒAƒ‹‚Ȃǁj‚ɁCã‹L‚Ì’˜
29 * ìŒ •\Ž¦C‚±‚Ì—˜—pðŒ‚¨‚æ‚щº‹L‚Ì–³•ÛØ‹K’è‚ðŒfÚ‚·‚邱‚ƁD
30 * (b) Ä”z•z‚ÌŒ`‘Ô‚ðC•Ê‚É’è‚ß‚é•û–@‚É‚æ‚Á‚āCTOPPERSƒvƒƒWƒFƒNƒg‚É
31 * •ñ‚·‚邱‚ƁD
32 * (4) –{ƒ\ƒtƒgƒEƒFƒA‚Ì—˜—p‚É‚æ‚è’¼Ú“I‚Ü‚½‚͊ԐړI‚ɐ¶‚¶‚é‚¢‚©‚Ȃ鑹
33 * ŠQ‚©‚ç‚àCã‹L’˜ìŒ ŽÒ‚¨‚æ‚ÑTOPPERSƒvƒƒWƒFƒNƒg‚ð–Ɛӂ·‚邱‚ƁD
34 * ‚Ü‚½C–{ƒ\ƒtƒgƒEƒFƒA‚̃†[ƒU‚Ü‚½‚̓Gƒ“ƒhƒ†[ƒU‚©‚ç‚Ì‚¢‚©‚Ȃ闝
35 * —R‚ÉŠî‚­¿‹‚©‚ç‚àCã‹L’˜ìŒ ŽÒ‚¨‚æ‚ÑTOPPERSƒvƒƒWƒFƒNƒg‚ð
36 * –Ɛӂ·‚邱‚ƁD
37 *
38 * –{ƒ\ƒtƒgƒEƒFƒA‚́C–³•ÛØ‚Å’ñ‹Ÿ‚³‚ê‚Ä‚¢‚é‚à‚Ì‚Å‚ ‚éDã‹L’˜ìŒ ŽÒ‚¨
39 * ‚æ‚ÑTOPPERSƒvƒƒWƒFƒNƒg‚́C–{ƒ\ƒtƒgƒEƒFƒA‚ÉŠÖ‚µ‚āC“Á’è‚ÌŽg—p–Ú“I
40 * ‚ɑ΂·‚é“K‡«‚àŠÜ‚߂āC‚¢‚©‚È‚é•ÛØ‚às‚í‚È‚¢D‚Ü‚½C–{ƒ\ƒtƒgƒEƒF
41 * ƒA‚Ì—˜—p‚É‚æ‚è’¼Ú“I‚Ü‚½‚͊ԐړI‚ɐ¶‚¶‚½‚¢‚©‚Ȃ鑹ŠQ‚ÉŠÖ‚µ‚Ä‚àC‚»
42 * ‚̐ӔC‚𕉂í‚È‚¢D
43 *
44 * $Id: task.c 2018 2010-12-31 13:43:05Z ertl-hiro $
45 */
46
47/*
48 * ƒ^ƒXƒNŠÇ—ƒ‚ƒWƒ…
49[ƒ‹
50 */
51
52#include "kernel_impl.h"
53#include "wait.h"
54#include "task.h"
55
56/*
57 * ƒgƒŒ[ƒXƒƒOƒ}ƒNƒ‚̃fƒtƒHƒ‹ƒg’è‹`
58 */
59#ifndef LOG_TEX_ENTER
60#define LOG_TEX_ENTER(p_tcb, texptn)
61#endif /* LOG_TEX_ENTER */
62
63#ifndef LOG_TEX_LEAVE
64#define LOG_TEX_LEAVE(p_tcb)
65#endif /* LOG_TEX_LEAVE */
66
67#ifdef TOPPERS_tskini
68
69/*
70 * ŽÀsó‘Ԃ̃^ƒXƒN
71 */
72TCB *p_runtsk;
73
74/*
75 * Å‚—Dæ‡ˆÊ‚̃^ƒXƒN
76 */
77TCB *p_schedtsk;
78
79/*
80 * ƒ^ƒXƒNƒfƒBƒXƒpƒbƒ`^ƒ^ƒXƒN—áŠOˆ—ƒ‹[ƒ`ƒ“‹N“®—v‹ƒtƒ‰ƒO
81 */
82bool_t reqflg;
83
84/*
85 * Š„ž‚Ý—Dæ“xƒ}ƒXƒN‘S‰ðœó‘Ô
86 */
87bool_t ipmflg;
88
89/*
90 * ƒfƒBƒXƒpƒbƒ`‹ÖŽ~ó‘Ô
91 */
92bool_t disdsp;
93
94/*
95 * ƒ^ƒXƒNƒfƒBƒXƒpƒbƒ`‰Â”\ó‘Ô
96 */
97bool_t dspflg;
98
99/*
100 * ƒŒƒfƒBƒLƒ…
101[
102 */
103QUEUE ready_queue[TNUM_TPRI];
104
105/*
106 * ƒŒƒfƒBƒLƒ…
107[ƒT[ƒ`‚Ì‚½‚߂̃rƒbƒgƒ}ƒbƒv
108 */
109uint16_t ready_primap;
110
111/*
112 * Žg—p‚µ‚Ä‚¢‚È‚¢TCB‚̃ŠƒXƒg
113 */
114QUEUE free_tcb;
115
116/*
117 * ƒ^ƒXƒNŠÇ—ƒ‚ƒWƒ…
118[ƒ‹‚̏‰Šú‰»
119 */
120void
121initialize_task(void)
122{
123 uint_t i, j;
124 TCB *p_tcb;
125 TINIB *p_tinib;
126
127 p_runtsk = p_schedtsk = NULL;
128 reqflg = false;
129 ipmflg = true;
130 disdsp = false;
131 dspflg = true;
132
133 for (i = 0; i < TNUM_TPRI; i++) {
134 queue_initialize(&(ready_queue[i]));
135 }
136 ready_primap = 0U;
137
138 for (i = 0; i < tnum_stsk; i++) {
139 j = INDEX_TSK(torder_table[i]);
140 p_tcb = &(tcb_table[j]);
141 p_tcb->p_tinib = &(tinib_table[j]);
142 p_tcb->actque = false;
143 make_dormant(p_tcb);
144 if ((p_tcb->p_tinib->tskatr & TA_ACT) != 0U) {
145 make_active(p_tcb);
146 }
147 }
148 queue_initialize(&free_tcb);
149 for (j = 0; i < tnum_tsk; i++, j++) {
150 p_tcb = &(tcb_table[i]);
151 p_tinib = &(atinib_table[j]);
152 p_tinib->tskatr = TA_NOEXS;
153 p_tcb->p_tinib = ((const TINIB *) p_tinib);
154 queue_insert_prev(&free_tcb, &(p_tcb->task_queue));
155 }
156}
157
158#endif /* TOPPERS_tskini */
159
160/*
161 * ƒrƒbƒgƒ}ƒbƒvƒT[ƒ`ŠÖ”
162 *
163 * bitmap“à‚Ì1‚̃rƒbƒg‚Ì“àCÅ‚à‰ºˆÊi‰Ej‚Ì‚à‚Ì‚ðƒT[ƒ`‚µC‚»‚̃rƒb
164 * ƒg”ԍ†‚ð•Ô‚·Dƒrƒbƒg”ԍ†‚́CÅ‰ºˆÊƒrƒbƒg‚ð0‚Æ‚·‚éDbitmap‚É0‚ðŽw’è
165 * ‚µ‚Ä‚Í‚È‚ç‚È‚¢D‚±‚̊֐”‚ł́Cbitmap‚ª16ƒrƒbƒg‚Å‚ ‚邱‚Æ‚ð‰¼’è‚µC
166 * uint16_tŒ^‚Æ‚µ‚Ä‚¢‚éD
167 *
168 * ƒrƒbƒgƒT[ƒ`–½—ß‚ðŽ‚ÂƒvƒƒZƒbƒT‚ł́CƒrƒbƒgƒT[ƒ`–½—ß‚ðŽg‚¤‚悤‚É
169 * ‘‚«’¼‚µ‚½•û‚ªŒø—¦‚ª—Ç‚¢ê‡‚ª‚ ‚éD‚±‚̂悤‚ȏꍇ‚ɂ́Cƒ^[ƒQƒbƒg
170 * ˆË‘¶•”‚ŃrƒbƒgƒT[ƒ`–½—ß‚ðŽg‚Á‚½bitmap_search‚ð’è‹`‚µC
171 * OMIT_BITMAP_SEARCH‚ðƒ}ƒNƒ’è‹`‚·‚ê‚΂悢D‚Ü‚½CƒrƒbƒgƒT[ƒ`–½—ß‚Ì
172 * ƒT[ƒ`•ûŒü‚ª‹t‚È‚Ç‚Ì——R‚Å—Dæ“x‚ƃrƒbƒg‚Ƃ̑Ήž‚ð•ÏX‚µ‚½‚¢ê‡‚É
173 * ‚́CPRIMAP_BIT‚ðƒ}ƒNƒ’è‹`‚·‚ê‚΂悢D
174 *
175 * ‚Ü‚½Cƒ‰ƒCƒuƒ‰ƒŠ‚Éffs‚ª‚ ‚é‚È‚çCŽŸ‚̂悤‚É’è‹`‚µ‚ă‰ƒCƒuƒ‰ƒŠŠÖ”‚ð
176 * Žg‚Á‚½•û‚ªŒø—¦‚ª—Ç‚¢‰Â”\«‚à‚ ‚éD
177 * #define bitmap_search(bitmap) (ffs(bitmap) - 1)
178 */
179#ifndef PRIMAP_BIT
180#define PRIMAP_BIT(pri) (1U << (pri))
181#endif /* PRIMAP_BIT */
182
183#ifndef OMIT_BITMAP_SEARCH
184
185static const unsigned char bitmap_search_table[] = { 0, 1, 0, 2, 0, 1, 0,
186 3, 0, 1, 0, 2, 0, 1, 0 };
187
188Inline uint_t
189bitmap_search(uint16_t bitmap)
190{
191 uint_t n = 0U;
192
193 assert(bitmap != 0U);
194 if ((bitmap & 0x00ffU) == 0U) {
195 bitmap >>= 8;
196 n += 8;
197 }
198 if ((bitmap & 0x0fU) == 0U) {
199 bitmap >>= 4;
200 n += 4;
201 }
202 return(n + bitmap_search_table[(bitmap & 0x0fU) - 1]);
203}
204
205#endif /* OMIT_BITMAP_SEARCH */
206
207/*
208 * —Dæ“xƒrƒbƒgƒ}ƒbƒv‚ª‹ó‚©‚̃`ƒFƒbƒN
209 */
210Inline bool_t
211primap_empty(void)
212{
213 return(ready_primap == 0U);
214}
215
216/*
217 * —Dæ“xƒrƒbƒgƒ}ƒbƒv‚̃T[ƒ`
218 */
219Inline uint_t
220primap_search(void)
221{
222 return(bitmap_search(ready_primap));
223}
224
225/*
226 * —Dæ“xƒrƒbƒgƒ}ƒbƒv‚̃Zƒbƒg
227 */
228Inline void
229primap_set(uint_t pri)
230{
231 ready_primap |= PRIMAP_BIT(pri);
232}
233
234/*
235 * —Dæ“xƒrƒbƒgƒ}ƒbƒv‚̃NƒŠƒA
236 */
237Inline void
238primap_clear(uint_t pri)
239{
240 ready_primap &= ~PRIMAP_BIT(pri);
241}
242
243/*
244 * Å‚—Dæ‡ˆÊƒ^ƒXƒN‚̃T[ƒ`
245 */
246#ifdef TOPPERS_tsksched
247
248TCB *
249search_schedtsk(void)
250{
251 uint_t schedpri;
252
253 schedpri = primap_search();
254 return((TCB *)(ready_queue[schedpri].p_next));
255}
256
257#endif /* TOPPERS_tsksched */
258
259/*
260 * ŽÀs‚Å‚«‚éó‘Ô‚Ö‚Ì‘JˆÚ
261 *
262 * Å‚—Dæ‡ˆÊ‚̃^ƒXƒN‚ðXV‚·‚é‚̂́CŽÀs‚Å‚«‚éƒ^ƒXƒN‚ª‚È‚©‚Á‚½ê‡
263 * ‚ƁCp_tcb‚Ì—Dæ“x‚ªÅ‚—Dæ‡ˆÊ‚̃^ƒXƒN‚Ì—Dæ“x‚æ‚è‚à‚‚¢ê‡‚Å‚ 
264 * ‚éD
265 */
266#ifdef TOPPERS_tskrun
267
268bool_t
269make_runnable(TCB *p_tcb)
270{
271 uint_t pri = p_tcb->priority;
272
273 queue_insert_prev(&(ready_queue[pri]), &(p_tcb->task_queue));
274 primap_set(pri);
275
276 if (p_schedtsk == (TCB *) NULL || pri < p_schedtsk->priority) {
277 p_schedtsk = p_tcb;
278 return(dspflg);
279 }
280 return(false);
281}
282
283#endif /* TOPPERS_tskrun */
284
285/*
286 * ŽÀs‚Å‚«‚éó‘Ô‚©‚瑼‚̏ó‘Ô‚Ö‚Ì‘JˆÚ
287 *
288 * Å‚—Dæ‡ˆÊ‚̃^ƒXƒN‚ðXV‚·‚é‚̂́Cp_tcb‚ªÅ‚—Dæ‡ˆÊ‚̃^ƒXƒN‚Å
289 * ‚ ‚Á‚½ê‡‚Å‚ ‚éDp_tcb‚Æ“¯‚¶—Dæ“x‚̃^ƒXƒN‚ª‘¼‚É‚ ‚éê‡‚́Cp_tcb
290 * ‚ÌŽŸ‚̃^ƒXƒN‚ªÅ‚—Dæ‡ˆÊ‚É‚È‚éD‚»‚¤‚Å‚È‚¢ê‡‚́CƒŒƒfƒBƒLƒ…
291[‚ð
292 * ƒT[ƒ`‚·‚é•K—v‚ª‚ ‚éD
293 */
294#ifdef TOPPERS_tsknrun
295
296bool_t
297make_non_runnable(TCB *p_tcb)
298{
299 uint_t pri = p_tcb->priority;
300 QUEUE *p_queue = &(ready_queue[pri]);
301
302 queue_delete(&(p_tcb->task_queue));
303 if (queue_empty(p_queue)) {
304 primap_clear(pri);
305 if (p_schedtsk == p_tcb) {
306 p_schedtsk = primap_empty() ? (TCB *) NULL : search_schedtsk();
307 return(dspflg);
308 }
309 }
310 else {
311 if (p_schedtsk == p_tcb) {
312 p_schedtsk = (TCB *)(p_queue->p_next);
313 return(dspflg);
314 }
315 }
316 return(false);
317}
318
319#endif /* TOPPERS_tsknrun */
320
321/*
322 * ‹xŽ~ó‘Ô‚Ö‚Ì‘JˆÚ
323 */
324#ifdef TOPPERS_tskdmt
325
326void
327make_dormant(TCB *p_tcb)
328{
329 p_tcb->tstat = TS_DORMANT;
330 p_tcb->priority = p_tcb->p_tinib->ipriority;
331 p_tcb->wupque = false;
332 p_tcb->enatex = false;
333 p_tcb->texptn = 0U;
334 LOG_TSKSTAT(p_tcb);
335}
336
337#endif /* TOPPERS_tskdmt */
338
339/*
340 * ‹xŽ~ó‘Ô‚©‚çŽÀs‚Å‚«‚éó‘Ô‚Ö‚Ì‘JˆÚ
341 */
342#ifdef TOPPERS_tskact
343
344bool_t
345make_active(TCB *p_tcb)
346{
347 activate_context(p_tcb);
348 p_tcb->tstat = TS_RUNNABLE;
349 LOG_TSKSTAT(p_tcb);
350 return(make_runnable(p_tcb));
351}
352
353#endif /* TOPPERS_tskact */
354
355/*
356 * ƒ^ƒXƒN‚Ì—Dæ“x‚̕ύX
357 *
358 * ƒ^ƒXƒN‚ªŽÀs‚Å‚«‚éó‘Ԃ̏ꍇ‚ɂ́CƒŒƒfƒBƒLƒ…
359[‚Ì’†‚ł̈ʒu‚ð•ÏX‚·
360 * ‚éDƒIƒuƒWƒFƒNƒg‚Ì‘Ò‚¿ƒLƒ…
361[‚Ì’†‚Å‘Ò‚¿ó‘Ô‚É‚È‚Á‚Ä‚¢‚éê‡‚ɂ́C‘Ò
362 * ‚¿ƒLƒ…
363[‚Ì’†‚ł̈ʒu‚ð•ÏX‚·‚éD
364 *
365 * Å‚—Dæ‡ˆÊ‚̃^ƒXƒN‚ðXV‚·‚é‚̂́C(1) p_tcb‚ªÅ‚—Dæ‡ˆÊ‚̃^ƒX
366 * ƒN‚Å‚ ‚Á‚āC‚»‚Ì—Dæ“x‚ð‰º‚°‚½ê‡C(2) p_tcb‚ªÅ‚—Dæ‡ˆÊ‚̃^ƒX
367 * ƒN‚Å‚Í‚È‚­C•ÏXŒã‚Ì—Dæ“x‚ªÅ‚—Dæ‡ˆÊ‚̃^ƒXƒN‚Ì—Dæ“x‚æ‚è‚à‚‚¢
368 * ê‡‚Å‚ ‚éD(1)‚̏ꍇ‚ɂ́CƒŒƒfƒBƒLƒ…
369[‚ðƒT[ƒ`‚·‚é•K—v‚ª‚ ‚éD
370 */
371#ifdef TOPPERS_tskpri
372
373bool_t
374change_priority(TCB *p_tcb, uint_t newpri)
375{
376 uint_t oldpri;
377
378 oldpri = p_tcb->priority;
379 p_tcb->priority = newpri;
380
381 if (TSTAT_RUNNABLE(p_tcb->tstat)) {
382 /*
383 * ƒ^ƒXƒN‚ªŽÀs‚Å‚«‚éó‘Ԃ̏ꍇ
384 */
385 queue_delete(&(p_tcb->task_queue));
386 if (queue_empty(&(ready_queue[oldpri]))) {
387 primap_clear(oldpri);
388 }
389 queue_insert_prev(&(ready_queue[newpri]), &(p_tcb->task_queue));
390 primap_set(newpri);
391
392 if (p_schedtsk == p_tcb) {
393 if (newpri >= oldpri) {
394 p_schedtsk = search_schedtsk();
395 return(p_schedtsk != p_tcb && dspflg);
396 }
397 }
398 else {
399 if (newpri < p_schedtsk->priority) {
400 p_schedtsk = p_tcb;
401 return(dspflg);
402 }
403 }
404 }
405 else {
406 if (TSTAT_WAIT_WOBJCB(p_tcb->tstat)) {
407 /*
408 * ƒ^ƒXƒN‚ªC“¯ŠúE’ʐMƒIƒuƒWƒFƒNƒg‚ÌŠÇ—ƒuƒƒbƒN‚Ì‹¤’Ê•”
409 * •ªiWOBJCBj‚Ì‘Ò‚¿ƒLƒ…
410[‚ɂ‚Ȃª‚ê‚Ä‚¢‚éê‡
411 */
412 wobj_change_priority(((WINFO_WOBJ *)(p_tcb->p_winfo))->p_wobjcb,
413 p_tcb);
414 }
415 }
416 return(false);
417}
418
419#endif /* TOPPERS_tskpri */
420
421/*
422 * ƒŒƒfƒBƒLƒ…
423[‚̉ñ“]
424 *
425 * Å‚—Dæ‡ˆÊ‚̃^ƒXƒN‚ðXV‚·‚é‚̂́CÅ‚—Dæ‡ˆÊ‚̃^ƒXƒN‚ªƒ^ƒXƒNƒL
426 * ƒ…
427[‚Ì––”ö‚Ɉړ®‚µ‚½ê‡‚Å‚ ‚éD
428 */
429#ifdef TOPPERS_tskrot
430
431bool_t
432rotate_ready_queue(uint_t pri)
433{
434 QUEUE *p_queue = &(ready_queue[pri]);
435 QUEUE *p_entry;
436
437 if (!queue_empty(p_queue) && p_queue->p_next->p_next != p_queue) {
438 p_entry = queue_delete_next(p_queue);
439 queue_insert_prev(p_queue, p_entry);
440 if (p_schedtsk == (TCB *) p_entry) {
441 p_schedtsk = (TCB *)(p_queue->p_next);
442 return(dspflg);
443 }
444 }
445 return(false);
446}
447
448#endif /* TOPPERS_tskrot */
449
450/*
451 * ƒ^ƒXƒN—áŠOˆ—ƒ‹[ƒ`ƒ“‚̌ďo‚µ
452 *
453 * ASPƒJ[ƒlƒ‹‚ł́Cƒ^ƒXƒN—áŠOˆ—ƒ‹[ƒ`ƒ““à‚ÅCPUƒƒbƒNó‘Ô‚É‘JˆÚ‚µC
454 * Œ³‚̏ó‘Ô‚É–ß‚³‚¸‚ɃŠƒ^[ƒ“‚µ‚½ê‡CƒJ[ƒlƒ‹‚ªŒ³‚̏ó‘Ô‚É–ß‚·D
455 */
456#ifdef TOPPERS_tsktex
457
458void
459call_texrtn(void)
460{
461 TEXPTN texptn;
462 bool_t saved_disdsp;
463
464 saved_disdsp = disdsp;
465 p_runtsk->enatex = false;
466 do {
467 texptn = p_runtsk->texptn;
468 p_runtsk->texptn = 0U;
469
470 t_unlock_cpu();
471 LOG_TEX_ENTER(p_runtsk, texptn);
472 (*((TEXRTN)(p_runtsk->p_tinib->texrtn)))(texptn,
473 p_runtsk->p_tinib->exinf);
474 LOG_TEX_LEAVE(p_runtsk);
475 if (!t_sense_lock()) {
476 t_lock_cpu();
477 }
478 if (!ipmflg) {
479 t_set_ipm(TIPM_ENAALL);
480 ipmflg = true;
481 }
482 disdsp = saved_disdsp;
483 dspflg = !disdsp;
484 p_runtsk->enatex = false;
485 if (p_runtsk != p_schedtsk && dspflg) {
486 /*
487 * ‚±‚±‚Ådispatch‚ðŒÄ‚яo‚·ˆ—‚́C‘ŠŒÝÄ‹AŒÄo‚µ‚É‚È‚Á‚Ä
488 * ‚¢‚邪Cdispatch‚ðŒÄ‚Ô‘O‚Ép_runtsk->enatex‚ðfalse‚É‚µ‚Ä
489 * ‚¨‚¯‚ÎŽxá‚ª‚È‚¢D‚»‚Ì——R‚ɂ‚¢‚ẮCuTOPPERS/ASP ƒJ[
490 * ƒlƒ‹ ÝŒvƒƒ‚v‚ðŽQÆ‚Ì‚±‚ƁD
491 */
492 dispatch();
493 }
494 } while (p_runtsk->texptn != 0U);
495 p_runtsk->enatex = true;
496}
497
498/*
499 * ƒ^ƒXƒN—áŠOˆ—ƒ‹[ƒ`ƒ“‚Ì‹N“®
500 */
501#ifndef OMIT_CALLTEX
502
503void
504calltex(void)
505{
506 if (p_runtsk->enatex && p_runtsk->texptn != 0U && ipmflg) {
507 call_texrtn();
508 }
509}
510
511#endif /* OMIT_CALLTEX */
512#endif /* TOPPERS_tsktex */
Note: See TracBrowser for help on using the repository browser.