Context Navigation

← Previous Revision
Latest Revision
Next Revision →
Blame
Revision Log

source: ssp_qb_r5f100le_cs/trunk/kernel/kernel.tf@ 93

Last change on this file since 93 was 93, checked in by nmir-saito, 9 years ago
add Combined package of SSP kernel for QB-R5F100LE-TB(RL78 processor)
File size: 48.1 KB

Line
1	$ ======================================================================
2	$
3	$ TOPPERS/SSP Kernel
4	$ Smallest Set Profile Kernel
5	$
6	$ Copyright (C) 2007 by TAKAGI Nobuhisa
7	$ Copyright (C) 2007-2009 by Embedded and Real-Time Systems Laboratory
8	$ Graduate School of Information Science, Nagoya Univ., JAPAN
9	$ Copyright (C) 2010-2015 by Naoki Saito
10	$ Nagoya Municipal Industrial Research Institute, JAPAN
11	$
12	$ ãLì ÒÍCÈºÌ (1)`(4) Ìðð½·êÉÀèC{\tgEF
13	$ Ai{\tgEFAðüÏµ½àÌðÜÞDÈº¯¶jðgpE¡»EüÏE
14	$ ÄzziÈºCpÆÄÔj·é±Æð³Åø·éD
15	$ (1) {\tgEFAð\[XR[hÌ`Åp·éêÉÍCãLÌì
16	$ \¦C±Ìpð¨æÑºLÌ³ÛØKèªC»ÌÜÜÌ`Å\[X
17	$ R[hÉÜÜêÄ¢é±ÆD
18	$ (2) {\tgEFAðCCu`®ÈÇC¼Ì\tgEFAJÉgp
19	$ Å«é`ÅÄzz·éêÉÍCÄzzÉº¤hL
20	gipÒ}
21	$ j
22	AÈÇjÉCãLÌì \¦C±Ìpð¨æÑºLÌ³Û
23	$ ØKèðfÚ·é±ÆD
24	$ (3) {\tgEFAðC@íÉgÝÞÈÇC¼Ì\tgEFAJÉgp
25	$ Å«È¢`ÅÄzz·éêÉÍCÌ¢¸ê©Ìðð½·±ÆD
26	$ (a) ÄzzÉº¤hL
27	gipÒ}j
28	AÈÇjÉCãLÌì
29	$ \¦C±Ìpð¨æÑºLÌ³ÛØKèðfÚ·é±ÆD
30	$ (b) ÄzzÌ`ÔðCÊÉèßéû@ÉæÁÄCTOPPERSvWFNgÉñ
31	$ ·é±ÆD
32	$ (4) {\tgEFAÌpÉæè¼ÚIÜ½ÍÔÚIÉ¶¶é¢©Èé¹Q
33	$ ©çàCãLì Ò¨æÑTOPPERSvWFNgðÆÓ·é±ÆDÜ½C
34	$ {\tgEFAÌ[UÜ½ÍGh[U©çÌ¢©ÈéRÉîÃ
35	$ ¿©çàCãLì Ò¨æÑTOPPERSvWFNgðÆÓ·é±ÆD
36	$
37	$ {\tgEFAÍC³ÛØÅñ³êÄ¢éàÌÅ éDãLì Ò¨æ
38	$ ÑTOPPERSvWFNgÍC{\tgEFAÉÖµÄCÁèÌgpÚIÉÎ·
39	$ éK«àÜßÄC¢©ÈéÛØàsíÈ¢DÜ½C{\tgEFAÌp
40	$ Éæè¼ÚIÜ½ÍÔÚIÉ¶¶½¢©Èé¹QÉÖµÄàC»ÌÓCð
41	$ íÈ¢D
42	$
43	$ ======================================================================
44
45	$ OoÍ
46	$ wèµ½¾¯sªÉ^uðÂ¯Ä\¦·éD
47	$ R[hyÑoÍÌÂÇ«ð°é½ßÉg¤D
48	$ ø : ARGV[1] : sªÉ}ü·é^uÌ
49	$ Ôl : ó¶ñ
50	$ Ó : RESULTðìµÄ¢é½ßC¼ÌÖÌoÍðÛ¶·éOÉÄÑo·Æã«³êéD
51	$
52	$FUNCTION LOG$
53	$FOREACH i RANGE(1,ARGV[1])$$TAB$$END$
54	$RESULT = {}$
55	$END$
56
57	$ =====================================================================
58	$ OÌ`FbN
59	$ =====================================================================
60
61	$ ^XNª1ÂÈã¶Ý·é±ÆÌ`FbN
62	$IF !LENGTH(TSK.ID_LIST)$
63	$ERROR$$FORMAT("no task is registered")$$END$
64	$END$
65
66	$ =====================================================================
67	$ kernel_cfg.h Ì¶¬
68	$ =====================================================================
69
70	$FILE "kernel_cfg.h"$
71
72	/* kernel_cfg.h */$NL$
73	#ifndef TOPPERS_KERNEL_CFG_H$NL$
74	#define TOPPERS_KERNEL_CFG_H$NL$
75	$NL$
76	#define TNUM_TSKID $LENGTH(TSK.ID_LIST)$$NL$
77	#define TNUM_FLGID $LENGTH(FLG.ID_LIST)$$NL$
78	#define TNUM_DTQID $LENGTH(DTQ.ID_LIST)$$NL$
79	#define TNUM_CYCID $LENGTH(CYC.ORDER_LIST)$$NL$
80	#define TNUM_ALMID $LENGTH(ALM.ORDER_LIST)$$NL$
81	$NL$
82
83	$ // ^XNIDðN®Dæx(tskapri)Ì¢É reallocate_tskapri ÖèÄC
84	$ // è`ð kernel_cfg.h ÖoÍ·éD
85	$tsk_apriorder_list={}$
86	$tsk_epri_list={}$
87	$tsk_index = 1$
88	$FOREACH id SORT(TSK.ORDER_LIST, "TSK.ATSKPRI")$
89	$tsk_apriorder_list = APPEND(tsk_apriorder_list, TSK.TSKID[id])$
90	$reallocate_tskapri[TSK.TSKID[id]] = tsk_index$
91	#define $TSK.TSKID[id]$ $tsk_index$$NL$
92
93	$ DEF_EPR Åè`³êÄ¢È¢^XNÌÀsDæxªCN®DæxÆ¯¶ÉÈéæ¤É·éD
94	$tsk_epri_list = APPEND(tsk_epri_list, ALT(TSK.EXEPRI[TSK.TSKID[id]], TSK.ATSKPRI[TSK.TSKID[id]]))$
95	$tsk_index = tsk_index + 1$
96	$END$
97	$FOREACH id FLG.ID_LIST$
98	#define $id$ $+id$$NL$
99	$END$
100	$FOREACH id DTQ.ID_LIST$
101	#define $id$ $+id$$NL$
102	$END$
103	$FOREACH id CYC.ID_LIST$
104	#define $id$ $+id$$NL$
105	$END$
106	$FOREACH id ALM.ID_LIST$
107	#define $id$ $+id$$NL$
108	$END$
109
110	#endif /* TOPPERS_KERNEL_CFG_H */$NL$
111
112	$ =====================================================================
113	$ kernel_cfg.cÌ¶¬
114	$ =====================================================================
115
116	$FILE "kernel_cfg.c"$
117
118	/* kernel_cfg.c */$NL$
119	#include "kernel/kernel_int.h"$NL$
120	#include "kernel_cfg.h"$NL$
121	$NL$
122	#ifndef TOPPERS_EMPTY_LABEL$NL$
123	#define TOPPERS_EMPTY_LABEL(x,y) x y[0]$NL$
124	#endif$NL$
125	$NL$
126
127	$ ---------------------------------------------------------------------
128	$ CN[hfBNeBui#includej
129	$ ---------------------------------------------------------------------
130	/*$NL$
131	$SPC$* Include Directives (#include)$NL$
132	$SPC$*/$NL$
133	$NL$
134	$INCLUDES$
135	$NL$
136
137	$ ---------------------------------------------------------------------
138	$ IuWFNgÌIDÔðÛ·éÏ
139	$ ---------------------------------------------------------------------
140	$IF USE_EXTERNAL_ID$
141	/*$NL$
142	$SPC$* Variables for Object ID$NL$
143	$SPC$*/$NL$
144	$NL$
145	$FOREACH id TSK.ID_LIST$
146	const ID $id$_id$SPC$=$SPC$$+id$;$NL$
147	$END$
148	$FOREACH id FLG.ID_LIST$
149	const ID $id$_id$SPC$=$SPC$$+id$;$NL$
150	$END$
151	$FOREACH id DTQ.ID_LIST$
152	const ID $id$_id$SPC$=$SPC$$+id$;$NL$
153	$END$
154	$FOREACH id CYC.ID_LIST$
155	const ID $id$_id$SPC$=$SPC$$+id$;$NL$
156	$END$
157	$FOREACH id ALM.ID_LIST$
158	const ID $id$_id$SPC$=$SPC$$+id$;$NL$
159	$END$
160	$END$
161
162	$ ---------------------------------------------------------------------
163	$ g[XO}NÌftHgè`
164	$ ---------------------------------------------------------------------
165	/*$NL$
166	$SPC$* Default Definitions of Trace Log Macros$NL$
167	$SPC$*/$NL$
168	$NL$
169	#ifndef LOG_ISR_ENTER$NL$
170	#define LOG_ISR_ENTER(intno)$NL$
171	#endif /* LOG_ISR_ENTER */$NL$
172	$NL$
173	#ifndef LOG_ISR_LEAVE$NL$
174	#define LOG_ISR_LEAVE(intno)$NL$
175	#endif /* LOG_ISR_LEAVE */$NL$
176	$NL$
177
178
179	$ ---------------------------------------------------------------------
180	$ ^XNÉÖ·éoÍ
181	$ ---------------------------------------------------------------------
182
183	$
184	$ ÀsDæxÌRtBM
185	[VÉ¬÷µ½©Ç¤©
186	$
187	$ DEF_EPR ÉG[ª¶µ½êC±ÌÏª0ÉÈéD
188	$ DEF_EPR ÉG[ª¶µ½©Ç¤©ð»fµÄ
189	$ ÁèÌÀsðubN·é½ßÉgp·éD
190	$
191	$configurated_defepr_successfully = 1$
192
193	/*$NL$
194	$SPC$* Task Management Functions$NL$
195	$SPC$*/$NL$
196	$NL$
197
198	$ ^XNIDÔÌÅål
199	const ID _kernel_tmax_tskid = (TMIN_TSKID + TNUM_TSKID - 1);$NL$
200	$NL$
201
202	$ ready_primap Ìúl
203	$init_rdypmap = 0$
204	$tsk_index = 1$
205
206	$ ^XN®«D
207	const ATR _kernel_tinib_tskatr[TNUM_TSKID] = {
208	$JOINEACH tskid tsk_apriorder_list ","$
209	$ // TA_ACT , TA_RSTR Ü½Í TA_NULL Å éiE_RSATRj
210	$IF (TSK.TSKATR[tskid] & ~(TA_ACT \| TA_RSTR \| ALT(TARGET_TSKATR,0))) != 0$
211	$ERROR TSK.TEXT_LINE[tskid]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "tskatr", TSK.TSKATR[tskid], tskid, "CRE_TSK")$$END$
212	$END$
213
214	($TSK.TSKATR[tskid]$)
215
216	$IF TSK.TSKATR[tskid] & TA_ACT$
217	$init_rdypmap = init_rdypmap + tsk_index$
218	$END$
219	$tsk_index = tsk_index << 1$
220	$END$
221	};$NL$
222
223	const uint_t$TAB$_kernel_init_rdypmap = $init_rdypmap$U;$NL$
224
225	$ g£îñ(exinf)D G[ÍRpCÜ½ÍAvÌeXgÅo·é½ßC±±ÅÍµÈ¢D
226	const intptr_t _kernel_tinib_exinf[TNUM_TSKID] = {
227	$JOINEACH tskid tsk_apriorder_list ","$
228	(intptr_t)($TSK.EXINF[tskid]$)
229	$END$
230	};$NL$
231
232	$ N®Ôn(task)DG[ÍRpCÜ½ÍAvÌeXgÅo·é½ßC±±ÅÍµÈ¢D
233	const TASK _kernel_tinib_task[TNUM_TSKID] = {
234	$JOINEACH tskid tsk_apriorder_list ","$
235	($TSK.TASK[tskid]$)
236	$END$
237	};$NL$
238
239	$ N®Dæx(atskpri)D
240	$FOREACH tskid tsk_apriorder_list$
241	$ // atskpri Í TMIN_TPRI ÈãCTMAX_TPRI ÈºÅ éDiE_PARj
242	$IF !(TMIN_TPRI <= TSK.ATSKPRI[tskid] && TSK.ATSKPRI[tskid] <= TMAX_TPRI)$
243	$ERROR TSK.TEXT_LINE[tskid]$E_PAR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "atskpri", TSK.ATSKPRI[tskid], tskid, "CRE_TSK")$$END$
244	$END$
245
246	$ // atskpri Íd¡ªÈ¢DiE_PARj
247	$FOREACH tskid2 tsk_apriorder_list$
248	$IF tskid != tskid2 && TSK.ATSKPRI[tskid] == TSK.ATSKPRI[tskid2] $
249	$ERROR TSK.TEXT_LINE[tskid]$E_PAR: $FORMAT(_("%1% of %2% (%3%) in %4% is duplicated"), "atskpri", tskid, TSK.ATSKPRI[tskid], "CRE_TSK")$$END$
250	$END$
251	$END$
252	$END$
253
254	$ ÀsDæx(exepri)D
255	const uint_t _kernel_tinib_epriority[TNUM_TSKID] = {
256	$epri_allocated = 0$
257	$tsk_index = 0$
258	$JOINEACH tskid tsk_apriorder_list ","$
259	$epri = AT(tsk_epri_list, tsk_index)$
260
261	$ // exepri Í TMIN_TPRI Èã©Â TMAX_TPRI ÈºÅ éD(E_PAR)
262	$IF TMIN_TPRI > epri \|\| TMAX_TPRI < epri$
263	$configurated_defepr_successfully = 0$
264	$ERROR TSK.TEXT_LINE[tskid]$E_PAR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "exepri", epri, tskid, "DEF_EPR")$$END$
265	$END$
266
267	$ // exepri Í atskpri ÈºÌlðàÂ(DæxÆµÄÍ¯¶©»êæè¢)D(E_ILUSE)
268	$IF epri <= TMAX_TPRI && epri > TSK.ATSKPRI[tskid]$
269	$configurated_defepr_successfully = 0$
270	$ERROR TSK.TEXT_LINE[tskid]$E_ILUSE: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "exepri", epri, tskid, "DEF_EPR")$$END$
271	$END$
272
273	$ // exepri Ìà\»ðèµ reallocate_tskepri Éi[D
274	$FOREACH tskid2 tsk_apriorder_list $
275	$IF epri_allocated != 1 && epri <= TSK.ATSKPRI[tskid2]$
276	INT_PRIORITY($reallocate_tskapri[TSK.TSKID[tskid2]]$)
277	$reallocate_tskepri[tskid] = reallocate_tskapri[TSK.TSKID[tskid2]]$
278	$epri_allocated = 1$
279	$END$
280	$END$
281	$epri_allocated = 0$
282	$tsk_index = tsk_index + 1$
283	$END$
284	};$NL$$NL$
285
286	$
287	$ // DæxèÄÊðoÍ
288	$
289	/*$NL$
290	$SPC$* Task priority configuration result:$NL$
291	$FOREACH tskid SORT(TSK.ORDER_LIST, "TSK.ATSKPRI")$
292	$SPC$* $TAB$$TSK.TSKID[tskid]$:$TAB$ IPRI = $reallocate_tskapri[TSK.TSKID[tskid]]$, EXEPRI = $reallocate_tskepri[tskid]$$NL$
293	$END$
294	$SPC$*/$NL$$NL$
295
296	$
297	$ ^XNÌÅåX^bNgpÊÌvZ
298	$
299
300	$ X^bNTCYÉÖ·éG[`FbN
301	$FOREACH tskid TSK.ID_LIST$
302	$ // stkszª0©C^[Qbgè`ÌÅ¬liTARGET_MIN_STKSZjæèà¬³¢êiE_PARj
303	$IF TSK.STKSZ[tskid] == 0 \|\| (LENGTH(TARGET_MIN_STKSZ) &&
304	TSK.STKSZ[tskid] < TARGET_MIN_STKSZ)$
305	$ERROR TSK.TEXT_LINE[tskid]$E_PAR: $FORMAT(_("%1% `%2%\' of `%3%\' in %4% is too small"), "stksz", TSK.STKSZ[tskid], tskid, "CRE_TSK")$$END$
306	$END$
307	$END$
308
309	$
310	$ Öè`
311	$
312	$
313	$ Ö1: N®DæxÌá¢É\[eBO·é½ßÌärÖ
314	$
315	$FUNCTION compare_tskapri_rev$
316	$RESULT = reallocate_tskapri[ARGV[2]] - reallocate_tskapri[ARGV[1]]$
317	$END$
318
319	$
320	$ Ö2: wèµ½^XNÉÎ·éX^bNgpÊÌÅåðvZ·éÖ
321	$ ø : ARGV[1] : ^XNID(à\», N®DæxÌà\»Éµ¢)
322	$ Ôl : RESULT : Y^XNÉÎ·éX^bNgpÊÌÅålD
323	$ ±ÌlÍCY^XNÌÀsJn©çI¹ÜÅÌÔÉ
324	$ »Ì^XNÉÎ·évGvgðl¶µÄX^bNgpÊð
325	$ vZµ½êÉCÂ\«Ì égÝí¹ÌÅÅåÆÈélðÔ·D
326	$
327	$nest_level = 0$
328	$
329	$FUNCTION calc_stksz$
330	$ // ÏXg
331	$nest_level = nest_level + 1$
332	$arg[nest_level] = ARGV[1]$
333	$calculated_stack_size = 0$
334
335	$ // Jn
336	$SPC$* $LOG(nest_level-1)$Calculation start (Task ID = $arg[nest_level]$, StackSize[$arg[nest_level]$]=$TSK.STKSZ[arg[nest_level]]$)$NL$
337
338	$ // wèµ½^XNID ÌX^bNvZª®¹µÄ¢é©
339	$IF LENGTH(done[arg[nest_level]]) == 0$
340
341	$SPC$* $LOG(nest_level)$Task list with higher priority than $arg[nest_level]$ = $higher_pri_tsklist[arg[nest_level]]$$NL$
342
343	$ // (1) ®¹µÄ¢È¢ê
344	$ // ÏÌú»
345	$max_stksz[arg[nest_level]] = 0$
346	$higher_pri_maxstksz[arg[nest_level]] = 0$
347
348	$ // Y^XNID ÌÀsDæxæè¢N®DæxðÂ^XNª¶Ý·éê
349	$IF LENGTH(higher_pri_tsklist[arg[nest_level]]) > 0$
350	$ // »ê¼êÌDæx^XNÉÎµ
351	$FOREACH id higher_pri_tsklist[arg[nest_level]]$
352	$ // ÄAÄo·éÆÏªã«³êé½ßCÛ¶µÄ¨
353	$id_saved[nest_level] = id$
354	$ // X^bNvZðÀs·é
355	$calculated_stack_size = calc_stksz(id_saved[nest_level])$
356	$ // Û¶µ½ÏðA
357	$id = id_saved[nest_level]$
358
359	$IF higher_pri_maxstksz[arg[nest_level]] < calculated_stack_size$
360	$ // L¯µÄ¨
361	$higher_pri_maxstksz[arg[nest_level]] = calculated_stack_size$
362	$END$
363	$END$
364	$END$
365
366	$SPC$* $LOG(nest_level)$higher_pri_maxstksz[$arg[nest_level]$] = $higher_pri_maxstksz[arg[nest_level]]$$NL$
367
368	$ // Dæx^XNÌX^bNgpÊÉCY^XNÌgpÊðÁZ·é
369	$max_stksz[arg[nest_level]] = higher_pri_maxstksz[arg[nest_level]] + TSK.STKSZ[arg[nest_level]]$
370
371	$SPC$* $LOG(nest_level)$DONE(max_stksz[$arg[nest_level]$] = $max_stksz[arg[nest_level]]$)$NL$
372
373	$ // Y^XNIDÉÎµÄÍvZðÏÜ¹½Æ¢¤L^ðcµÄ¨
374	$done[arg[nest_level]] = 1$
375
376	$ELSE$
377	$ // (2) vZªùÉ®¹µÄ¢éêCvZðXLbv·éD
378
379	$SPC$* $LOG(nest_level)$SKIP(max_stksz[$arg[nest_level]$] = $max_stksz[arg[nest_level]]$)$NL$
380	$END$
381
382	$ // ©ÏàèÌÅålðÔ·
383	$RESULT = max_stksz[arg[nest_level]]$
384	$nest_level = nest_level - 1$
385	$END$
386
387	$
388	$ Öè`±±ÜÅC±±©çX^bNvZÌJn
389	$
390
391	$
392	$ Ü¸ÍØ\¢Ìf[^\¢ì¬
393	$
394	$FOREACH id LSORT(tsk_apriorder_list, "compare_tskapri_rev")$
395
396	$ // e^XNÉC»ÌÀsDæxæèà¢N®DæxðÂ^XNÌXgðìéD
397	$ // »êÍvGvg³êéÂ\«Ì é^XNÌêÆÈéD
398	$FOREACH id2 LSORT(tsk_apriorder_list, "compare_tskapri_rev")$
399	$IF reallocate_tskepri[id] > reallocate_tskapri[id2]$
400	$higher_pri_tsklist[id] = APPEND(higher_pri_tsklist[id], id2)$
401	$END$
402	$END$
403
404	$ // vGvg·éE³êéÖWð¦·Ø\¢Ìª(root)ÆÈé^XNÌTõD
405	$ // ÎÛ^XN(id)ÌN®Dæx(reallocate_tskapri[id])æèá¢
406	$ // (lÆµÄÍå«¢)N®DæxðàÂ^XNÌ higher_pri_tsklist ÉC
407	$ // ÎÛ^XN(id) ªÜÜêÈ¯êÎCªÆÈéD
408	$is_root = 1$
409	$FOREACH id2 LSORT(tsk_apriorder_list, "compare_tskapri_rev")$
410	$IF (is_root == 1) && (reallocate_tskapri[id] < reallocate_tskapri[id2])$
411	$IF LENGTH(FIND(higher_pri_tsklist[id2], id)) > 0$
412	$is_root = 0$
413	$END$
414	$END$
415	$END$
416	$ // ª(root)ÆÈé^XNÈçÎCXgÖÇÁ
417	$IF is_root == 1$
418	$root_apri = APPEND(root_apri, id)$
419	$END$
420	$END$
421
422	$
423	$ oÍJn
424	$
425
426	/* $NL$
427	$SPC$* Task Stack Size Estimation: $NL$
428	$SPC$* $NL$
429
430	$ // ªÆÈée^XNÉÎµÄC»ÌÅå^XNgpÊðvZµCXgÖÇÁ·éD
431	$FOREACH root_id root_apri$
432	$stksz_estimated = APPEND(stksz_estimated, calc_stksz(root_id))$
433	$END$
434
435	$ // ^XNÌX^bNgpÊÌÅålðè
436	$ // XgÌvfÌÅålª^XNÌÅåX^bNgpÊÆÈéD
437	$max_tsk_stksz = 0$
438	$FOREACH size stksz_estimated$
439	$IF size > max_tsk_stksz$
440	$max_tsk_stksz = size$
441	$END$
442	$END$
443
444	$ // mF
445	$SPC$* List of Estimated Total Stack Sizes of Tasks = $stksz_estimated$$NL$
446	$SPC$* Estimated Maximum Total Stack Size of Tasks = $max_tsk_stksz$$NL$
447	$SPC$*/ $NL$
448	#define TOPPERS_TSTKSZ ($max_tsk_stksz$)$NL$$NL$
449
450
451	$ SÄÌPÊÌX^bNÍ¤L³êéD
452	$ »Ì½ßCX^bNTCYÉÖ·é`FbNÍ
453	$ ¤LX^bNÝèÌÆ±ëÅÜÆßÄs¤D
454
455	$ X^bNÌæªÔn(stk)D
456	$FOREACH tskid tsk_apriorder_list$
457	$ // íÉ NULL Å éD(E_PAR)
458	$IF !EQ(TSK.STK[tskid], "NULL")$
459	$ERROR TSK.TEXT_LINE[tskid]$E_PAR: $FORMAT(("'%1%' of %2% must be NULL."), "stk", "CRE_TSK")$$END$
460	$END$
461	$END$
462
463	$ ---------------------------------------------------------------------
464	$ CxgtO
465	$ ---------------------------------------------------------------------
466	/*$NL$
467	$SPC$* Eventflag Functions$NL$
468	$SPC$*/$NL$
469	$NL$
470
471	$ Ggª (UINT8_MAX - TMIN_FLGID)Âæè½¢êÍCG[Æ·é --> »_ÅÍRgAEg
472	$ $IF LENGTH(ALM.ORDER_LIST) > (UINT8_MAX - TMIN_FLGID)$
473	$ $ERROR$$FORMAT("The number of CRE_FLG must be equal to or less than (UINT8_MAX - TMIN_FLGID).")$$END$
474	$ $END$
475
476	$ CxgtOIDÔÌÅål
477	const ID _kernel_tmax_flgid = (TMIN_FLGID + TNUM_FLGID - 1);$NL$
478	$NL$
479
480	$ // iflgptnªFLGPTNÉi[Å«È¢êiE_PARj
481	$FOREACH flgid FLG.ORDER_LIST$
482	$IF (FLG.IFLGPTN[flgid] & ~((1 << TBIT_FLGPTN) - 1)) != 0$
483	$ERROR FLG.TEXT_LINE[flgid]$E_PAR: $FORMAT(_("too large %1% `%2%\' of `%3%\' in %4%"), "iflgptn", FLG.IFLGPTN[flgid], flgid, "CRE_FLG")$$END$
484	$END$
485	$END$
486
487	$ CxgtOú»ubNÌ¶¬
488	$IF LENGTH(FLG.ID_LIST)$
489
490	$ CxgtO®«
491	const ATR _kernel_flginib_atr[TNUM_FLGID] = {
492	$JOINEACH flgid FLG.ORDER_LIST ","$
493	$ // flgatrªimTA_CLRnjÅÈ¢êiE_RSATRj
494	$IF (FLG.FLGATR[flgid] & ~(TA_CLR)) != 0$
495	$ERROR FLG.TEXT_LINE[flgid]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "flgatr", FLG.FLGATR[flgid], flgid, "CRE_FLG")$$END$
496	$END$
497	($FLG.FLGATR[flgid]$)
498	$END$
499	};$NL$
500
501	$ CxgtOp^[Ìúl
502	const FLGPTN _kernel_flginib_iflgptn[TNUM_FLGID] = {
503	$JOINEACH flgid FLG.ORDER_LIST ","$
504	($FLG.IFLGPTN[flgid]$)
505	$END$
506	};$NL$
507
508	$ // CxgtOÌ»ÝÌtOp^[ði[·éÏ
509	FLGPTN _kernel_flgcb_flgptn[TNUM_FLGID];$NL$
510	$ELSE$
511	TOPPERS_EMPTY_LABEL(const ATR, _kernel_flginib_atr);$NL$
512	TOPPERS_EMPTY_LABEL(const FLGPTN, _kernel_flginib_iflgptn);$NL$
513	TOPPERS_EMPTY_LABEL(FLGPTN, _kernel_flgcb_flgptn);$NL$
514	$END$
515	$NL$
516
517	$ ---------------------------------------------------------------------
518	$ f[^L
519	[
520	$ ---------------------------------------------------------------------
521	/*$NL$
522	$SPC$* Dataqueue Functions$NL$
523	$SPC$*/$NL$
524	$NL$
525
526	$ f[^L
527	[IDÔÌÅål
528	const ID _kernel_tmax_dtqid = (TMIN_DTQID + TNUM_DTQID - 1);$NL$
529	$NL$
530
531	$IF LENGTH(DTQ.ID_LIST)$
532	$FOREACH dtqid DTQ.ORDER_LIST$
533	$ // dtqatrª TA_NULL ÅÈ¢êiE_RSATRj
534	$IF (DTQ.DTQATR[dtqid] != TA_NULL) $
535	$ERROR DTQ.TEXT_LINE[dtqid]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "dtqatr", DTQ.DTQATR[dtqid], dtqid, "CRE_DTQ")$$END$
536	$END$
537
538	$ // dtqmbªNULLÅÈ¢êiE_NOSPTj
539	$IF !EQ(DTQ.DTQMB[dtqid], "NULL")$
540	$ERROR DTQ.TEXT_LINE[dtqid]$E_NOSPT: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "dtqmb", DTQ.DTQMB[dtqid], dtqid, "CRE_DTQ")$$END$
541	$END$
542
543	$ // dtqcntª0Å éê
544	$IF EQ(+DTQ.DTQCNT[dtqid], 0)$
545	$ERROR DTQ.TEXT_LINE[dtqid]$E_PAR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "dtqmb", DTQ.DTQCNT[dtqid], dtqid, "CRE_DTQ")$$END$
546	$END$
547
548
549	$ // f[^L
550	[Ìæ
551	$IF DTQ.DTQCNT[dtqid]$
552	static intptr_t _kernel_dtqmb_$dtqid$[$DTQ.DTQCNT[dtqid]$];$NL$
553	$END$
554	$END$
555
556	$ // f[^L
557	[ú»ubNÌ¶¬(®«)
558	const ATR _kernel_dtqinib_atr[TNUM_DTQID] = {
559	$JOINEACH dtqid DTQ.ORDER_LIST ",\n"$
560	$SPC$($DTQ.DTQATR[dtqid]$)
561	$END$
562	};$NL$
563	$NL$
564
565	$ // f[^L
566	[ú»ubNÌ¶¬(TCY)
567	const uint8_t _kernel_dtqinib_size[TNUM_DTQID] = {
568	$JOINEACH dtqid DTQ.ORDER_LIST ",\n"$
569	$SPC$($DTQ.DTQCNT[dtqid]$)
570	$END$
571	};$NL$
572	$NL$
573
574	$ // f[^L
575	[ú»ubNÌ¶¬(ÇÌæ)
576	intptr_t * const _kernel_dtqinib_data[TNUM_DTQID] = {
577	$JOINEACH dtqid DTQ.ORDER_LIST ",\n"$
578	$IF DTQ.DTQCNT[dtqid]$(_kernel_dtqmb_$dtqid$)$ELSE$NULL$END$
579	$END$
580	};$NL$
581	$NL$
582
583	$ // f[^L
584	[Rg[ubN
585	uint8_t _kernel_dtqcb_count[TNUM_DTQID];$NL$
586	uint8_t _kernel_dtqcb_head[TNUM_DTQID];$NL$
587	uint8_t _kernel_dtqcb_tail[TNUM_DTQID];$NL$
588	$ELSE$
589	TOPPERS_EMPTY_LABEL(const ATR, _kernel_dtqinib_atr);$NL$
590	TOPPERS_EMPTY_LABEL(intptr_t * const, _kernel_dtqinib_data);$NL$
591	TOPPERS_EMPTY_LABEL(const uint8_t, _kernel_dtqinib_size);$NL$
592	TOPPERS_EMPTY_LABEL(uint8_t, _kernel_dtqcb_count);$NL$
593	TOPPERS_EMPTY_LABEL(uint8_t, _kernel_dtqcb_head);$NL$
594	TOPPERS_EMPTY_LABEL(uint8_t, _kernel_dtqcb_tail);$NL$
595	$END$
596	$NL$
597
598
599	$ ---------------------------------------------------------------------
600	$ ÝÇ@\
601	$ ---------------------------------------------------------------------
602	/*$NL$
603	$SPC$* Interrupt Management Functions$NL$
604	$SPC$*/$NL$
605	$NL$
606
607	$ // INTNO_ATTISR_VALID Ìvfªd¡µÄ¢È¢©Ç¤©Ì`FbN
608	$i = 0$
609	$FOREACH intno INTNO_ATTISR_VALID$
610	$j = 0$
611	$FOREACH intno2 INTNO_ATTISR_VALID$
612	$IF i < j && intno == intno2$
613	$ERROR$ $FORMAT(_("intno (%1%) of INTNO_ATTISR_VALID is duplicated"), intno)$$END$
614	$END$
615	$j = j + 1$
616	$END$
617	$i = i + 1$
618	$END$
619
620	$ // INHNO_ATTISR_VALID Ìvfªd¡µÄ¢È¢©Ç¤©Ì`FbN
621	$i = 0$
622	$FOREACH intno INHNO_ATTISR_VALID$
623	$j = 0$
624	$FOREACH intno2 INHNO_ATTISR_VALID$
625	$IF i < j && intno == intno2$
626	$ERROR$ $FORMAT(_("intno (%1%) of INHNO_ATTISR_VALID is duplicated"), intno)$$END$
627	$END$
628	$j = j + 1$
629	$END$
630	$i = i + 1$
631	$END$
632
633
634	$ // ATT_ISR ÅgpÂ\ÈÝÔÆC»êÉÎ·éÝnhÔÌª¯¶©Ç¤©
635	$ // eXgÌvfÍd¡µÄ¢È¢±ÆðOñÆµÄ¢éD
636	$IF LENGTH(INTNO_ATTISR_VALID) != LENGTH(INHNO_ATTISR_VALID)$
637	$ERROR$length of `INTNO_ATTISR_VALID' is different from length of `INHNO_ATTISR_VALID'$END$
638	$END$
639
640
641	$ // ÝÔÆÝnhÔÌÏ·e[uÌì¬
642	$ // ÝÔÌXgÆÝnhÔÌXgÍÎ·évfª¯¶ÔÅ
643	$ // »êéæ¤ÉÀ×çêÄ¢é±ÆðOñÆ·éD
644	$i = 0$
645	$FOREACH intno INTNO_ATTISR_VALID$
646
647	$ // INTNO_ATTISR_VALID ÉÜÜêélÍ INTNO_CFGINT_VALID ÉàÜÜêé×«Å éD
648	$ // INTNO_ATTISR_VALID Í INTNO_CFGINT_VALID ÌªWÉÈéÍ¸D
649	$IF LENGTH(FIND(INTNO_CFGINT_VALID, intno)) == 0$
650	$ERROR$all elements of `INTNO_ATTISR_VALID' must be included in `INTNO_CFGINT_VALID'$END$
651	$END$
652
653	$inhno = AT(INHNO_ATTISR_VALID, i)$
654	$INHNO[intno] = inhno$
655	$INTNO[inhno] = intno$
656	$i = i + 1$
657	$END$
658
659
660	$ // INTNO_CFGINT_VALID Ìvfª INTNO_VALID ÉÜÜêé©Ç¤©Ì`FbN
661	$ // INTNO_CFGINT_VALID Í INTNO_VALID ÌªWÉÈéÍ¸D
662	$FOREACH intno INTNO_CFGINT_VALID$
663	$IF LENGTH(FIND(INTNO_VALID, intno)) == 0$
664	$ERROR$all elements of `INTNO_CFGINT_VALID' must be included in `INTNO_VALID'$END$
665	$END$
666	$END$
667
668
669	$ // INHNO_ATTISR_VALID Ìvfª INHNO_VALID ÉÜÜêé©Ç¤©Ì`FbN
670	$ // INHNO_ATTISR_VALID Í INHNO_VALID ÌªWÉÈéÍ¸D
671	$FOREACH inhno INHNO_ATTISR_VALID$
672	$IF LENGTH(FIND(INHNO_VALID, inhno)) == 0$
673	$ERROR$all elements of `INHNO_ATTISR_VALID' must be included in `INHNO_VALID'$END$
674	$END$
675	$END$
676
677
678	$ // ÝvCÉÖ·éG[`FbN
679	$i = 0$
680	$FOREACH intno INT.ORDER_LIST$
681	$ // intnoªCFG_INTÉÎ·éÝÔÆµÄ³µÈ¢êiE_PARj
682	$IF !LENGTH(FIND(INTNO_CFGINT_VALID, INT.INTNO[intno]))$
683	$ERROR INT.TEXT_LINE[intno]$E_PAR: $FORMAT(_("illegal %1% `%2%\' in %3%"), "intno", INT.INTNO[intno], "CFG_INT")$$END$
684	$END$
685
686	$ // intnoªCFG_INTÉæÁÄÝèÏÝÌêiE_OBJj
687	$j = 0$
688	$FOREACH intno2 INT.ORDER_LIST$
689	$IF INT.INTNO[intno] == INT.INTNO[intno2] && j < i$
690	$ERROR INT.TEXT_LINE[intno]$E_OBJ: $FORMAT(_("%1% `%2%\' in %3% is duplicated"), "intno", INT.INTNO[intno], "CFG_INT")$$END$
691	$END$
692	$j = j + 1$
693	$END$
694
695	$ // intatrª TA_ENAINT, TA_EDGE, Ü½Í»Ì¼^[QbgÅpÂ\È®«Ì¢¸êÅàÈ¢êiE_RSATRj
696	$IF (INT.INTATR[intno] & ~(TA_ENAINT\|TA_EDGE\|ALT(TARGET_INTATR,0))) != 0$
697	$ERROR INT.TEXT_LINE[intno]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of %3% `%4%\' in %5%"), "intatr", INT.INTATR[intno], "intno", INT.INTNO[intno], "CFG_INT")$$END$
698	$END$
699
700	$ // intpriªCFG_INTÉÎ·éÝDæxÆµÄ³µÈ¢êiE_PARj
701	$IF !LENGTH(FIND(INTPRI_CFGINT_VALID, INT.INTPRI[intno]))$
702	$ERROR INT.TEXT_LINE[intno]$E_PAR: $FORMAT(_("illegal %1% `%2%\' in %3%"), "intpri", INT.INTPRI[intno], "CFG_INT")$$END$
703	$END$
704
705	$ // J[lÇÌÝÆµÄÅè³êÄ¢éÝÉCTMIN_INTPRI æèà¬³¢lªwè³ê½êiE_OBJj
706	$IF LENGTH(FIND(INTNO_FIX_KERNEL, intno))$
707	$IF INT.INTPRI[intno] < TMIN_INTPRI$
708	$ERROR INT.TEXT_LINE[intno]$E_OBJ: $FORMAT(_("%1% `%2%\' must not have higher priority than %3%"), "intno", INT.INTNO[intno], "TMIN_INTPRI")$$END$
709	$END$
710	$END$
711
712	$ // J[lÇOÌÝÆµÄÅè³êÄ¢éÝÉCTMIN_INTPRI æèà¬³¢lªwè³êÈ©Á½êiE_OBJj
713	$IF LENGTH(FIND(INTNO_FIX_NONKERNEL, intno))$
714	$IF INT.INTPRI[intno] >= TMIN_INTPRI$
715	$ERROR INT.TEXT_LINE[intno]$E_OBJ: $FORMAT(_("%1% `%2%\' must have higher priority than %3%"), "intno", INT.INTNO[intno], "TMIN_INTPRI")$$END$
716	$END$
717	$END$
718	$i = i + 1$
719	$END$
720
721
722	$ ÝnhÉÖ·éG[`FbN
723	$i = 0$
724	$FOREACH inhno INH.ORDER_LIST$
725	$ // ÝnhÔ(inhno)ª³µÈ¢êiE_PARj
726	$IF !LENGTH(FIND(INHNO_DEFINH_VALID, INH.INHNO[inhno]))$
727	$ERROR INH.TEXT_LINE[inhno]$E_PAR: $FORMAT(_("illegal %1% `%2%\' in %3%"), "inhno", INH.INHNO[inhno], "DEF_INH")$$END$
728	$END$
729
730	$ // ¯¶ÝnhÔÉÎ·éDEF_INHª¡¶Ý·éêiE_OBJj
731	$j = 0$
732	$FOREACH inhno2 INH.ORDER_LIST$
733	$IF INH.INHNO[inhno] == INH.INHNO[inhno2] && j < i$
734	$ERROR INH.TEXT_LINE[inhno]$E_OBJ: $FORMAT(_("%1% `%2%\' in %3% is duplicated"), "inhno", INH.INHNO[inhno], "DEF_INH")$$END$
735	$END$
736	$j = j + 1$
737	$END$
738
739	$ // Ýnh®«(inhatr) ª TA_NULL, TA_NONKERNEL, yÑ»Ì¼^[QbgË¶ÅpÂ\È®«Ì¢¸êÅàÈ¢iE_RSATRj
740	$IF (INH.INHATR[inhno] & ~(TA_NONKERNEL\|ALT(TARGET_INHATR,0))) != 0$
741	$ERROR INH.TEXT_LINE[inhno]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of %3% `%4%\' in %5%"), "inhatr", INH.INHATR[inhno], "inhno", INH.INHNO[inhno], "DEF_INH")$$END$
742	$END$
743
744	$ // J[lÇÉÅè³êÄ¢éÝnhÉCTA_NONKERNEL ®«ªÝè³êÄ¢éiE_RSATRj
745	$IF LENGTH(FIND(INHNO_FIX_KERNEL, inhno))$
746	$IF (INH.INHATR[inhno] & TA_NONKERNEL) != 0$
747	$ERROR INH.TEXT_LINE[inhno]$E_RSATR: $FORMAT(_("%1% `%2%\' must not be non-kernel interrupt"), "inhno", INH.INHNO[inhno])$$END$
748	$END$
749	$END$
750
751	$ // J[lÇOÉÅè³êÄ¢éÝnhÉCTA_NONKERNEL ®«ªÝè³êÄ¢È¢iE_RSATRj
752	$IF LENGTH(FIND(INHNO_FIX_NONKERNEL, inhno))$
753	$IF (INH.INHATR[inhno] & TA_NONKERNEL) == 0$
754	$ERROR INH.TEXT_LINE[inhno]$E_RSATR: $FORMAT(_("%1% `%2%\' must be non-kernel interrupt"), "inhno", INH.INHNO[inhno])$$END$
755	$END$
756	$END$
757
758
759	$ // ÝÔÆ1Î1Î·éÝnhÔ(ATT_ISRÅwèÂ\ÈÝnhÔ)ÍCÈºÌ`FbNàs¤D
760	$ // INHNO_ATTISR_VALID ÉÜÜêÈ¢ÝnhÔÍ`FbN³êÈ¢±ÆÉÈéD
761	$IF LENGTH(INTNO[INH.INHNO[inhno]]) > 0$
762	$intno = INTNO[INH.INHNO[inhno]]$
763
764	$ // Ýnho^æÌÝvCª®«Ýè³êÄ¢È¢(CFG_INTªÈ¢)iE_OBJj
765	$IF !LENGTH(INT.INTNO[intno])$
766	$ERROR INH.TEXT_LINE[inhno]$E_OBJ: $FORMAT(_("%1% `%2%\' corresponding to %3% `%4%\' is not configured with %5%"), "intno", INT.INTNO[intno], "inhno", INH.INHNO[inhno], "CFG_INT")$$END$
767	$ELSE$
768	$IF (INH.INHATR[inhno] & TA_NONKERNEL) == 0$
769	$ // inhatrÉTA_NONKERNELªwè³êÄ¨ç¸CinhnoÉÎ
770	$ // ·éintnoÉÎµÄCFG_INTÅÝè³ê½ÝDæxª
771	$ // TMIN_INTPRIæèà¬³¢êiE_OBJj
772	$IF INT.INTPRI[intno] < TMIN_INTPRI$
773	$ERROR INT.TEXT_LINE[intno]$E_OBJ: $FORMAT(_("%1% `%2%\' configured for %3% `%4%\' is higher than %5%"), "intpri", INT.INTPRI[intno], "inhno", INH.INHNO[inhno], "TMIN_INTPRI")$$END$
774	$END$
775	$ELSE$
776	$ // inhatrÉTA_NONKERNELªwè³êÄ¨èCinhnoÉÎ
777	$ // ·éintnoÉÎµÄCFG_INTÅÝè³ê½ÝDæxª
778	$ // TMIN_INTPRIÈãÅ éêiE_OBJj
779	$IF INT.INTPRI[intno] >= TMIN_INTPRI$
780	$ERROR INT.TEXT_LINE[intno]$E_OBJ: $FORMAT(_("%1% `%2%\' configured for %3% `%4%\' is lower than or equal to %5%"), "intpri", INT.INTPRI[intno], "inhno", INH.INHNO[inhno], "TMIN_INTPRI")$$END$
781	$END$
782	$END$
783	$END$
784	$END$
785	$i = i + 1$
786	$END$
787
788	$ ÝT[rX[`iISRjÉÖ·éG[`FbNÆÝnhÌ¶¬
789	$FOREACH order ISR.ORDER_LIST$
790	$ // isratrªiTA_NULLjÅÈ¢êiE_RSATRj
791	$IF (ISR.ISRATR[order] & ~ALT(TARGET_ISRATR,0)) != 0$
792	$ERROR ISR.TEXT_LINE[order]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of %3% `%4%\' in %5%"), "isratr", ISR.ISRATR[order], "isr", ISR.ISR[order], "ATT_ISR")$$END$
793	$END$
794
795	$ // intnoªATT_ISRÉÎ·éÝÔÆµÄ³µÈ¢êiE_PARj
796	$IF !LENGTH(FIND(INTNO_ATTISR_VALID, ISR.INTNO[order]))$
797	$ERROR ISR.TEXT_LINE[order]$E_PAR: $FORMAT(_("illegal %1% `%2%\' in %3%"), "intno", ISR.INTNO[order], "ATT_ISR")$$END$
798	$END$
799
800	$ // (TMIN_ISRPRI <= isrpri && isrpri <= TMAX_ISRPRI)ÅÈ¢êiE_PARj
801	$IF !(TMIN_ISRPRI <= ISR.ISRPRI[order] && ISR.ISRPRI[order] <= TMAX_ISRPRI)$
802	$ERROR ISR.TEXT_LINE[order]$E_PAR: $FORMAT(_("illegal %1% `%2%\' in %3%"), "isrpri", ISR.ISRPRI[order], "ATT_ISR")$$END$
803	$END$
804	$END$
805
806
807	$FOREACH intno INTNO_ATTISR_VALID$
808	$inhno = INHNO[intno]$
809
810	$ // ÝÔintnoÉÎµÄo^³ê½ISRÌXgÌì¬
811	$isr_order_list = {}$
812	$FOREACH order ISR.ORDER_LIST$
813	$IF ISR.INTNO[order] == intno$
814	$isr_order_list = APPEND(isr_order_list, order)$
815	$order_for_error = order$
816	$END$
817	$END$
818
819	$ // ÝÔintnoÉÎµÄo^³ê½ISRª¶Ý·éê
820	$IF LENGTH(isr_order_list) > 0$
821	$ // intnoÉÎ·éinhnoÉÎµÄDEF_INHª éêiE_OBJj
822	$IF LENGTH(INH.INHNO[inhno])$
823	$ERROR ISR.TEXT_LINE[order_for_error]$E_OBJ: $FORMAT(_("%1% `%2%\' in %3% is duplicated with %4% `%5%\'"), "intno", ISR.INTNO[order_for_error], "ATT_ISR", "inhno", INH.INHNO[inhno])$$END$
824	$END$
825
826	$ // intnoÉÎ·éCFG_INTªÈ¢êiE_OBJj
827	$IF !LENGTH(INT.INTNO[intno])$
828	$ERROR ISR.TEXT_LINE[order_for_error]$E_OBJ: $FORMAT(_("%1% `%2%\' is not configured with %3%"), "intno", ISR.INTNO[order_for_error], "CFG_INT")$$END$
829	$ELSE$
830	$ // intnoÉÎµÄCFG_INTÅÝè³ê½ÝDæxªTMIN_INTPRI
831	$ // æèà¬³¢êiE_OBJj
832	$IF INT.INTPRI[intno] < TMIN_INTPRI$
833	$ERROR INT.TEXT_LINE[intno]$E_OBJ: $FORMAT(_("%1% `%2%\' configured for %3% `%4%\' is higher than %5%"), "intpri", INT.INTPRI[intno], "intno", ISR.INTNO[order_for_error], "TMIN_INTPRI")$$END$
834	$END$
835	$END$
836
837	$ // DEF_INH(inhno, { TA_NULL, _kernel_inthdr_<intno> } );
838	$INH.INHNO[inhno] = inhno$
839	$INH.INHATR[inhno] = VALUE("TA_NULL", 0)$
840	$INH.INTHDR[inhno] = CONCAT("_kernel_inthdr_", intno)$
841	$INH.ORDER_LIST = APPEND(INH.ORDER_LIST, inhno)$
842
843	$ // ISRpÌÝnh
844	void$NL$
845	_kernel_inthdr_$intno$(void)$NL$
846	{$NL$
847	$IF LENGTH(isr_order_list) > 1$
848	$TAB$PRI saved_ipm;$NL$
849	$NL$
850	$TAB$i_begin_int($intno$);$NL$
851	$TAB$saved_ipm = i_get_ipm();$NL$
852	$ELSE$
853	$TAB$i_begin_int($intno$);$NL$
854	$END$
855	$ // ISRðDæxÉÄÑo·
856	$JOINEACH order SORT(isr_order_list, "ISR.ISRPRI") "\tif (i_sense_lock()) {\n\t\ti_unlock_cpu();\n\t}\n\ti_set_ipm(saved_ipm);\n"$
857	$TAB$LOG_ISR_ENTER($intno$);$NL$
858	$TAB$((ISR)($ISR.ISR[order]$))((intptr_t)($ISR.EXINF[order]$));$NL$
859	$TAB$LOG_ISR_LEAVE($intno$);$NL$
860	$END$
861	$TAB$i_end_int($intno$);$NL$
862	}$NL$
863	$END$
864	$END$
865	$NL$
866
867	$
868	$ ÝÇ@\Ì½ßÌWIÈú»îñÌ¶¬
869	$
870	$ ÝnhÌú»ÉKvÈîñ
871	$IF !OMIT_INITIALIZE_INTERRUPT \|\| ALT(USE_INHINIB_TABLE,0)$
872
873	$ Ýnh
874	#define TNUM_INHNO $LENGTH(INH.ORDER_LIST)$$NL$
875	const uint_t _kernel_tnum_inhno = TNUM_INHNO;$NL$
876	$NL$
877	$FOREACH inhno INH.ORDER_LIST$
878	INTHDR_ENTRY($INH.INHNO[inhno]$, $+INH.INHNO[inhno]$, $INH.INTHDR[inhno]$)$NL$$NL$
879	$END$
880
881	$ Ýnhú»e[u
882	$IF LENGTH(INH.ORDER_LIST)$
883	const INHNO _kernel_inhinib_inhno[TNUM_INHNO] = {
884	$JOINEACH inhno INH.ORDER_LIST ","$
885	($INH.INHNO[inhno]$)
886	$END$
887	};$NL$
888
889	const ATR _kernel_inhinib_inhatr[TNUM_INHNO] = {
890	$JOINEACH inhno INH.ORDER_LIST ","$
891	($INH.INHATR[inhno]$)
892	$END$
893	};$NL$
894
895	const FP _kernel_inhinib_entry[TNUM_INHNO] = {
896	$JOINEACH inhno INH.ORDER_LIST ","$
897	(FP)(INT_ENTRY($INH.INHNO[inhno]$, $INH.INTHDR[inhno]$))
898	$END$
899	};$NL$
900	$ELSE$
901	TOPPERS_EMPTY_LABEL(const INHNO, _kernel_inhinib_inhno);$NL$
902	TOPPERS_EMPTY_LABEL(const ATR, _kernel_inhinib_inhatr);$NL$
903	TOPPERS_EMPTY_LABEL(const FP, _kernel_inhinib_entry);$NL$
904	$END$$NL$
905	$END$
906
907	$ ÝvCÌú»ÉKvÈîñ
908	$IF !OMIT_INITIALIZE_INTERRUPT \|\| ALT(USE_INTINIB_TABLE,0)$
909
910	$ ÝvC
911	#define TNUM_INTNO $LENGTH(INT.ORDER_LIST)$$NL$
912	const uint_t _kernel_tnum_intno = TNUM_INTNO;$NL$
913	$NL$
914
915	$ ÝvCú»e[u
916	$IF LENGTH(INT.ORDER_LIST)$
917	const INTNO _kernel_intinib_intno[TNUM_INTNO] = {
918	$JOINEACH intno INT.ORDER_LIST ","$
919	($INT.INTNO[intno]$)
920	$END$
921	};$NL$
922
923	const ATR _kernel_intinib_intatr[TNUM_INTNO] = {
924	$JOINEACH intno INT.ORDER_LIST ","$
925	($INT.INTATR[intno]$)
926	$END$
927	};$NL$
928
929	const PRI _kernel_intinib_intpri[TNUM_INTNO] = {
930	$JOINEACH intno INT.ORDER_LIST ","$
931	($INT.INTPRI[intno]$)
932	$END$
933	};$NL$
934	$ELSE$
935	TOPPERS_EMPTY_LABEL(const INTNO, _kernel_intinib_intno);$NL$
936	TOPPERS_EMPTY_LABEL(const ATR, _kernel_intinib_intatr);$NL$
937	TOPPERS_EMPTY_LABEL(const PRI, _kernel_intinib_intpri);$NL$
938	$END$
939	$NL$
940	$END$
941
942	$ ---------------------------------------------------------------------
943	$ CPUáOnh
944	$ ---------------------------------------------------------------------
945	/*$NL$
946	$SPC$* CPU Exception Handler$NL$
947	$SPC$*/$NL$
948	$NL$
949
950	$ // EXCNO_DEFEXC_VALID Ìvfª EXCNO_VALID ÉÜÜêé©Ç¤©Ì`FbN
951	$ // EXCNO_DEFEXC_VALID Í EXCNO_VALID ÌªWÉÈéÍ¸D
952	$FOREACH excno EXCNO_DEFEXC_VALID$
953	$IF LENGTH(FIND(EXCNO_VALID, excno)) == 0$
954	$ERROR$all elements of `EXCNO_DEFEXC_VALID' must be included in `EXCNO_VALID'$END$
955	$END$
956	$END$
957
958
959	$ CPUáOnhÉÖ·éG[`FbN
960	$i = 0$
961	$FOREACH excno EXC.ORDER_LIST$
962	$ // excnoªDEF_EXCÉÎ·éCPUáOnhÔÆµÄ³µÈ¢êiE_PARj
963	$IF !LENGTH(FIND(EXCNO_DEFEXC_VALID, EXC.EXCNO[excno]))$
964	$ERROR EXC.TEXT_LINE[excno]$E_PAR: $FORMAT(_("illegal %1% `%2%\' in %3%"), "excno", EXC.EXCNO[excno], "DEF_EXC")$$END$
965	$END$
966
967	$ // excnoªDEF_EXCÉæÁÄÝèÏÝÌêiE_OBJj
968	$j = 0$
969	$FOREACH excno2 EXC.ORDER_LIST$
970	$IF EXC.EXCNO[excno] == EXC.EXCNO[excno2] && j < i$
971	$ERROR EXC.TEXT_LINE[excno]$E_OBJ: $FORMAT(_("%1% `%2%\' in %3% is duplicated"), "excno", EXC.EXCNO[excno], "DEF_EXC")$$END$
972	$END$
973	$j = j + 1$
974	$END$
975
976	$ // excatrªiTA_NULLjÅÈ¢êiE_RSATRj
977	$IF (EXC.EXCATR[excno] & ~ALT(TARGET_EXCATR,0)) != 0$
978	$ERROR EXC.TEXT_LINE[excno]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of %3% `%4%\' in %5%"), "excatr", EXC.EXCATR[excno], "excno", EXC.EXCNO[excno], "DEF_EXC")$$END$
979	$END$
980	$i = i + 1$
981	$END$
982
983	$ CPUáOnhÌ½ßÌWIÈú»îñÌ¶¬
984	$IF !ALT(OMIT_INITIALIZE_EXCEPTION,0)$
985
986	$ CPUáOnh
987	#define TNUM_EXCNO $LENGTH(EXC.ORDER_LIST)$$NL$
988	const uint_t _kernel_tnum_excno = TNUM_EXCNO;$NL$
989	$NL$
990	$FOREACH excno EXC.ORDER_LIST$
991	EXCHDR_ENTRY($EXC.EXCNO[excno]$, $+EXC.EXCNO[excno]$, $EXC.EXCHDR[excno]$)$NL$$NL$
992	$END$
993
994	$ CPUáOnhú»e[u
995	$IF LENGTH(EXC.ORDER_LIST)$
996	const EXCNO _kernel_excinib_excno[TNUM_EXCNO] = {
997	$JOINEACH excno EXC.ORDER_LIST ","$
998	($EXC.EXCNO[excno]$)
999	$END$
1000	};$NL$
1001
1002	const ATR _kernel_excinib_excatr[TNUM_EXCNO] = {
1003	$JOINEACH excno EXC.ORDER_LIST ","$
1004	($EXC.EXCATR[excno]$)
1005	$END$
1006	};$NL$
1007
1008	const FP _kernel_excinib_entry[TNUM_EXCNO] = {
1009	$JOINEACH excno EXC.ORDER_LIST ","$
1010	(FP)(EXC_ENTRY($EXC.EXCNO[excno]$, $EXC.EXCHDR[excno]$))
1011	$END$
1012	};$NL$
1013	$ELSE$
1014	TOPPERS_EMPTY_LABEL(const EXCNO, _kernel_excinib_excno);$NL$
1015	TOPPERS_EMPTY_LABEL(const ATR, _kernel_excinib_excatr);$NL$
1016	TOPPERS_EMPTY_LABEL(const FP, _kernel_excinib_entry);$NL$
1017	$END$
1018	$NL$
1019	$END$
1020
1021
1022	$ ---------------------------------------------------------------------
1023	$ üúnh
1024	$ ---------------------------------------------------------------------
1025
1026	/*$NL$
1027	$SPC$* Cyclic Handler Functions$NL$
1028	$SPC$*/$NL$
1029	$NL$
1030
1031	$ üúnhIDÔÌÅål
1032	const ID _kernel_tmax_cycid = (TMIN_CYCID + TNUM_CYCID - 1);$NL$
1033
1034	$ üúnhÌ^CCxgIDItZbg
1035	$ üúnhÌ^CCxgIDÍ0©çJn
1036	const uint_t _kernel_cycevtid_offset = 0;$NL$
1037	$NL$
1038
1039	$ Ggª TMAX_MAXCYC(kernel.h) Âæè½¢êÍCG[Æ·é
1040	$IF LENGTH(CYC.ORDER_LIST) > TMAX_MAXCYC$
1041	$ERROR$$FORMAT(_("The number of CRE_CYC must be equal to or less than %1%."), +VALUE("TMAX_MAXCYC", TMAX_MAXCYC))$$END$
1042	$END$
1043
1044	$IF LENGTH(CYC.ORDER_LIST)$
1045	$ üúnh®«
1046	$CYCACT = 0$
1047	$FOREACH cycid CYC.ORDER_LIST$
1048	$ // üúnh®«(cycatr) ª TA_NULL, TA_STA Ì¢¸êÅàÈ¢iE_RSATRj
1049	$IF (CYC.CYCATR[cycid] & ~TA_STA) != 0$
1050	$ERROR CYC.TEXT_LINE[cycid]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "cycatr", CYC.CYCATR[cycid], cycid, "CRE_CYC")$$END$
1051	$END$
1052
1053	$IF(CYC.CYCATR[cycid] & TA_STA)$
1054	$CYCACT = CYCACT \| (1 << (cycid-1))$
1055	$END$
1056	$END$
1057	const uint16_t _kernel_cycinib_cycact = $CYCACT$;$NL$
1058
1059	$ üúnhg£îñ
1060	const intptr_t _kernel_cycinib_exinf[TNUM_CYCID] = {
1061	$JOINEACH cycid CYC.ORDER_LIST ","$
1062	(intptr_t)($CYC.EXINF[cycid]$)
1063	$END$
1064	};$NL$
1065
1066	$ üúnhAhX
1067	const CYCHDR _kernel_cycinib_cychdr[TNUM_CYCID] = {
1068	$JOINEACH cycid CYC.ORDER_LIST ","$
1069	($CYC.CYCHDR[cycid]$)
1070	$END$
1071	};$NL$
1072
1073	$ üúnhüú
1074	const RELTIM _kernel_cycinib_cyctim[TNUM_CYCID] = {
1075	$JOINEACH cycid CYC.ORDER_LIST ","$
1076	$ // cyctim Í 0 æèå«CTMAX_RELTIM ÈºÅ éD(E_PAR)
1077	$IF CYC.CYCTIM[cycid] <= 0 \|\| TMAX_RELTIM < CYC.CYCTIM[cycid] $
1078	$ERROR CYC.TEXT_LINE[cycid]$E_PAR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "cyctim", CYC.CYCTIM[cycid], cycid, "CRE_CYC")$$END$
1079	$END$
1080
1081	($CYC.CYCTIM[cycid]$)
1082	$END$
1083	};$NL$
1084
1085	$ üúnhÊ
1086	const RELTIM _kernel_cycinib_cycphs[TNUM_CYCID] = {
1087	$JOINEACH cycid CYC.ORDER_LIST ","$
1088	$ // cycphs Í 0 ÈãCTMAX_RELTIM ÈºÅ éD(E_PAR)
1089	$IF CYC.CYCPHS[cycid] < 0 \|\| TMAX_RELTIM < CYC.CYCPHS[cycid] $
1090	$ERROR CYC.TEXT_LINE[cycid]$E_PAR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "cycphs", CYC.CYCPHS[cycid], cycid, "CRE_CYC")$$END$
1091	$END$
1092
1093	$ // Êª0©ÂC®«ª TA_STA ÌêÍx
1094	$IF CYC.CYCPHS[cycid] == 0 && (CYC.CYCATR[cycid] & TA_STA) != 0$
1095	$WARNING CYC.TEXT_LINE[cycid]$$FORMAT(_("%1% is not recommended when %2% is set to %3% in %4%"), "cycphs==0", "TA_STA", "cycatr", "CRE_CYC")$$END$
1096	$END$
1097
1098	($CYC.CYCPHS[cycid]$)
1099	$END$
1100	};$NL$
1101	$NL$
1102
1103	$ üúnhÌñN®
1104	EVTTIM _kernel_cyccb_evttim[TNUM_CYCID];$NL$
1105
1106	$ELSE$
1107	const uint16_t _kernel_cycinib_cycact = 0;$NL$
1108	TOPPERS_EMPTY_LABEL(const intptr_t, _kernel_cycinib_exinf);$NL$
1109	TOPPERS_EMPTY_LABEL(const CYCHDR, _kernel_cycinib_cychdr);$NL$
1110	TOPPERS_EMPTY_LABEL(const RELTIM, _kernel_cycinib_cyctim);$NL$
1111	TOPPERS_EMPTY_LABEL(const RELTIM, _kernel_cycinib_cycphs);$NL$
1112	TOPPERS_EMPTY_LABEL(EVTTIM, _kernel_cyccb_evttim);$NL$
1113	$END$
1114
1115	$ üúnh®ìóÔ
1116	uint16_t _kernel_cyccb_cycact;$NL$
1117
1118	$NL$
1119	$NL$
1120
1121	$ ---------------------------------------------------------------------
1122	$ A[nh
1123	$ ---------------------------------------------------------------------
1124
1125	/*$NL$
1126	$SPC$* Alarm Handler Functions$NL$
1127	$SPC$*/$NL$
1128	$NL$
1129
1130	$ Ggª TMAX_MAXALM(kernel.h) Âæè½¢êÍCG[Æ·é
1131	$IF LENGTH(ALM.ORDER_LIST) > TMAX_MAXALM$
1132	$ERROR$$FORMAT(_("The number of CRE_ALM must be equal to or less than %1%."), +VALUE("TMAX_MAXALM",TMAX_MAXALM))$$END$
1133	$END$
1134
1135	$ A[nhÌÅåIDl
1136	const ID _kernel_tmax_almid = (TMIN_ALMID + TNUM_ALMID - 1);$NL$
1137
1138	$ A[nhÌ^CCxgIDItZbg
1139	const uint_t _kernel_almevtid_offset = $LENGTH(CYC.ORDER_LIST)$;$NL$
1140	$NL$
1141
1142	$FOREACH almid ALM.ORDER_LIST$
1143	$ // almatrªiTA_NULLjÅÈ¢êiE_RSATRj
1144	$IF ALM.ALMATR[almid] != 0$
1145	$ERROR ALM.TEXT_LINE[almid]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of `%3%\' in %4%"), "almatr", ALM.ALMATR[almid], almid, "CRE_ALM")$$END$
1146	$END$
1147	$END$
1148
1149	$IF LENGTH(ALM.ORDER_LIST)$
1150	$ A[nhæªÔn
1151	const ALMHDR _kernel_alminib_almhdr[TNUM_ALMID] = {
1152	$JOINEACH almid ALM.ORDER_LIST ","$
1153	($ALM.ALMHDR[almid]$)
1154	$END$
1155	};$NL$
1156
1157	$ A[nhg£îñ
1158	const intptr_t _kernel_alminib_exinf[TNUM_ALMID] = {
1159	$JOINEACH almid ALM.ORDER_LIST ","$
1160	(intptr_t)($ALM.EXINF[almid]$)
1161	$END$
1162	};$NL$
1163	$NL$
1164	$ELSE$
1165	TOPPERS_EMPTY_LABEL(const ALMHDR, _kernel_alminib_almhdr);$NL$
1166	TOPPERS_EMPTY_LABEL(const intptr_t, _kernel_alminib_exinf);$NL$
1167	$NL$
1168	$END$
1169
1170	$ A[nhóÔ
1171	uint16_t _kernel_almcb_almact;$NL$
1172	$NL$
1173
1174
1175	$ ---------------------------------------------------------------------
1176	$ ^CCxgÇ
1177	$ ---------------------------------------------------------------------
1178
1179	/*$NL$
1180	$SPC$* Time Event Management$NL$
1181	$SPC$*/$NL$
1182	$NL$
1183
1184	$TNUM_TMEVT = LENGTH(CYC.ORDER_LIST) + LENGTH(ALM.ORDER_LIST)$
1185
1186	#define TNUM_TMEVT $TNUM_TMEVT$$NL$
1187	$NL$
1188
1189	$ ^CCxgubNÌTCY
1190	const uint_t _kernel_tnum_tmevt_queue = TNUM_TMEVT;$NL$$NL$
1191
1192	$IF TNUM_TMEVT != 0$
1193	$ ^CCxgL
1194	[
1195	QUEUE _kernel_tmevt_queue[TNUM_TMEVT+1];$NL$
1196	$ ^CCxgÔ
1197	EVTTIM _kernel_tmevt_time[TNUM_TMEVT];$NL$
1198	$ ^CCxgÌR[obN
1199	CBACK _kernel_tmevt_callback[TNUM_TMEVT];$NL$
1200	$ ^CCxgR[obNÌø
1201	uintptr_t _kernel_tmevt_arg[TNUM_TMEVT];$NL$
1202	$NL$$NL$
1203	$ELSE$
1204	TOPPERS_EMPTY_LABEL(QUEUE, _kernel_tmevt_queue);$NL$
1205	TOPPERS_EMPTY_LABEL(EVTTIM, _kernel_tmevt_time);$NL$
1206	TOPPERS_EMPTY_LABEL(CBACK, _kernel_tmevt_callback);$NL$
1207	TOPPERS_EMPTY_LABEL(uintptr_t, _kernel_tmevt_arg);$NL$
1208	$NL$$NL$
1209	$END$
1210
1211	$ ---------------------------------------------------------------------
1212	$ ñ^XNReLXgpX^bNÌæ
1213	$ ---------------------------------------------------------------------
1214	/*$NL$
1215	$SPC$* Interrupt Context Stack Size$NL$
1216	$SPC$*/$NL$$NL$
1217
1218	$ // Ïè`
1219	$ // ñ^XNReLXgpX^bNÌæÌTCY
1220	$interrupt_context_stksz = 0$
1221
1222	$ // DEF_ICS ÌGgª¶Ý·é©?
1223	$IF !LENGTH(ICS.ORDER_LIST)$
1224	$ // È¢êDTCYÍùèl (DEFAULT_ISTKSZ) ðg¤
1225	#define TOPPERS_ISTKSZ DEFAULT_ISTKSZ$NL$$NL$
1226	$interrupt_context_stksz = DEFAULT_ISTKSZ$
1227	$ELSE$
1228	$ // DEF_ICS ÌGgª éê
1229
1230	$
1231	$ // G[`FbN
1232	$
1233	$ // ÃIAPIuDEF_ICSvª¡ éiE_OBJj
1234	$IF LENGTH(ICS.ORDER_LIST) > 1$
1235	$ERROR$E_OBJ: $FORMAT(_("too many %1%"), "DEF_ICS")$$END$
1236	$END$
1237	$ // DEF_ICS Å0ðwèµ½ê(E_PAR)
1238	$IF ICS.ISTKSZ[1] == 0$
1239	$ERROR ICS.TEXT_LINE[1]$E_PAR: $FORMAT(_("%1% in %2% is 0"), "istksz", "DEF_ICS")$$END$
1240	$END$
1241	$ // íÉ NULL Å éD(E_PAR)
1242	$IF !EQ(ICS.ISTK[1], "NULL")$
1243	$ERROR ICS.TEXT_LINE[1]$E_PAR: $FORMAT(("'%1%' of %2% must be NULL."), "istk", "DEF_ICS")$$END$
1244	$END$
1245
1246	#define TOPPERS_ISTKSZ ($ICS.ISTKSZ[1]$)$NL$
1247	$interrupt_context_stksz = ICS.ISTKSZ[1]$
1248	$NL$
1249	$END$
1250	$NL$
1251
1252	$ ---------------------------------------------------------------------
1253	$ ¤LX^bNÌæ
1254	$ SSPÅÍ·×ÄÌPÊÌX^bNð¤L·é½ßC
1255	$ ±±ÅVXeSÌÌX^bNÌæðmÛ·éD
1256	$ ---------------------------------------------------------------------
1257
1258	$
1259	$ ¤LX^bNÌRtBM
1260	[VÉ¬÷µ½©Ç¤©
1261	$
1262	$ DEF_STK ÉG[ª¶µ½êC±ÌÏª0ÉÈéD
1263	$ DEF_STK ÉG[ª¶µ½©Ç¤©ð»fµÄ
1264	$ ÁèÌÀsðubN·é½ßÉgp·éD
1265	$
1266	$configurated_defstk_successfully = 1$
1267
1268	/*$NL$
1269	$SPC$* Stack Area for System$NL$
1270	$SPC$*/$NL$
1271	$NL$
1272
1273	$ // Ïè`
1274	$ // èÄçê½¤LX^bNÌæÌTCY
1275	$allocated_stack_size = 0$
1276
1277	$ // DEF_STK ÌGgª¶Ý·é©?
1278	$IF !LENGTH(STK.ORDER_LIST)$
1279	$ // (1) DEF_STK ÌGgªÈ¢ê
1280	static STK_T _kernel_stack[COUNT_STK_T(TOPPERS_TSTKSZ+TOPPERS_ISTKSZ)];$NL$
1281	#define TOPPERS_STK _kernel_stack$NL$
1282	#define TOPPERS_STKSZ ROUND_STK_T(TOPPERS_TSTKSZ+TOPPERS_ISTKSZ)$NL$
1283	$NL$
1284
1285	$allocated_stack_size = max_tsk_stksz + interrupt_context_stksz$
1286	$ELSE$
1287	$ // (2) DEF_STK ÌGgª éê
1288
1289	$ // G[`FbN
1290	$ // ÃIAPIuDEF_STKvª¡ éiE_OBJj
1291	$IF LENGTH(STK.ORDER_LIST) > 1$
1292	$configurated_defstk_successfully = 0$
1293	$ERROR$E_OBJ: $FORMAT(_("too many %1%"), "DEF_STK")$$END$
1294	$END$
1295	$ // DEF_STK Ì stksz Å 0 ðwèµ½ê(E_PAR)
1296	$IF STK.STKSZ[1] == 0$
1297	$configurated_defstk_successfully = 0$
1298	$ERROR STK.TEXT_LINE[1]$E_PAR: $FORMAT(_("%1% in %2% is 0"), "stksz", "DEF_STK")$$END$
1299	$END$
1300
1301	$IF EQ(STK.STK[1], "NULL")$
1302	$ // stk ª NULL ÌêCX^bNÌæð©®t¯
1303	static STK_T _kernel_stack[COUNT_STK_T($STK.STKSZ[1]$)];$NL$
1304	#define TOPPERS_STK _kernel_stack$NL$
1305	#define TOPPERS_STKSZ ROUND_STK_T($STK.STKSZ[1]$)$NL$
1306	$ELSE$
1307	$ // stk ª NULL ÈOÌêiAv¤ÅX^bNÌæðpÓ·éêj
1308
1309	$ // stkszª^[QbgÉèÜéACgTCYÌ{ÉACg³êÄ¢È¢êiE_PARj
1310	$IF LENGTH(CHECK_STKSZ_ALIGN) && (STK.STKSZ[1] & (CHECK_STKSZ_ALIGN - 1))$
1311	$configurated_defstk_successfully = 0$
1312	$ERROR STK.TEXT_LINE[1]$E_PAR: $FORMAT(_("%1% `%2%\' in %3% is not aligned"), "stksz", STK.STKSZ[1], "DEF_STK")$$END$
1313	$END$
1314
1315	#define TOPPERS_STK ($STK.STK[1]$)$NL$
1316	#define TOPPERS_STKSZ ($STK.STKSZ[1]$)$NL$
1317	$END$
1318
1319	$allocated_stack_size = STK.STKSZ[1]$
1320	$END$
1321	$NL$
1322
1323	$ ¤LX^bNpÌX^bNÌæ
1324	const SIZE _kernel_stksz = TOPPERS_STKSZ;$NL$
1325	STK_T *const _kernel_stk = TOPPERS_STK;$NL$
1326	$NL$
1327	#ifdef TOPPERS_ISTKPT$NL$
1328	STK_T *const _kernel_istkpt = TOPPERS_ISTKPT(TOPPERS_STK, TOPPERS_STKSZ);$NL$
1329	#endif /* TOPPERS_ISTKPT */$NL$
1330	$NL$
1331
1332	$
1333	$ // DæxèÄ¨æÑX^bNÝèÉÖ·éÊðWoÍÖ\¦
1334	$
1335	$IF configurated_defepr_successfully == 1 && configurated_defstk_successfully == 1$
1336	$FILE "stdout"$
1337	=====================================$NL$
1338	Task priority configuration result:$NL$
1339	$FOREACH tskid SORT(TSK.ORDER_LIST, "TSK.ATSKPRI")$
1340	$TAB$$TSK.TSKID[tskid]$:$TAB$ IPRI = $reallocate_tskapri[TSK.TSKID[tskid]]$, EXEPRI = $reallocate_tskepri[tskid]$$NL$
1341	$END$
1342	=====================================$NL$
1343
1344	=====================================$NL$
1345	Stack size configuration result:$NL$
1346	$TAB$Estimated task stack size = $max_tsk_stksz$$NL$
1347	$TAB$Specified interrupt stack size = $interrupt_context_stksz$(value=$FORMAT("%d",+interrupt_context_stksz)$)$NL$
1348	$TAB$Allocated total stack size = $allocated_stack_size$(value=$FORMAT("%d",+allocated_stack_size)$)$NL$
1349	$ // TCYÌ`FbNDX^bNTCYÌèlªÀÛÉÄçê½TCYæèå«¢êCx·éD
1350	$IF (max_tsk_stksz+interrupt_context_stksz) > allocated_stack_size$
1351	$TAB$!!!WARNING!!!: Estimated stack size is more than the allocated stack size.$NL$
1352	$WARNING STK.TEXT_LINE[1]$ $FORMAT("Estimated stack size is more than the allocated stack size.")$$END$
1353	$END$
1354	=====================================$NL$
1355	$END$
1356	$
1357	$ // oÍæð³ÉßµÄ¨
1358	$
1359	$FILE "kernel_cfg.c"$
1360
1361
1362	$ ---------------------------------------------------------------------
1363	$ eW
1364	[Ìú»Ö
1365	$ ---------------------------------------------------------------------
1366	/*$NL$
1367	$SPC$* Module Initialization Function$NL$
1368	$SPC$*/$NL$
1369	$NL$
1370	void$NL$
1371	_kernel_initialize_object(void)$NL$
1372	{$NL$
1373	$IF TNUM_TMEVT > 0$
1374	$TAB$_kernel_initialize_time_event();$NL$
1375	$END$
1376	$TAB$_kernel_initialize_task();$NL$
1377	$TAB$_kernel_initialize_interrupt();$NL$
1378	$TAB$_kernel_initialize_exception();$NL$
1379	$IF LENGTH(CYC.ID_LIST)$
1380	$TAB$_kernel_initialize_cyclic();$NL$
1381	$END$
1382	$IF LENGTH(ALM.ID_LIST)$
1383	$TAB$_kernel_initialize_alarm();$NL$
1384	$END$
1385	$IF LENGTH(FLG.ID_LIST)$
1386	$TAB$_kernel_initialize_eventflag();$NL$
1387	$END$
1388	$IF LENGTH(DTQ.ID_LIST)$
1389	$TAB$_kernel_initialize_dataqueue();$NL$
1390	$END$
1391	}$NL$
1392	$NL$
1393
1394	$ ---------------------------------------------------------------------
1395	$ ú»[`ÌÀsÖ
1396	$ ---------------------------------------------------------------------
1397	/*$NL$
1398	$SPC$* Initialization Routine$NL$
1399	$SPC$*/$NL$
1400	$NL$
1401	void$NL$
1402	_kernel_call_inirtn(void)$NL$
1403	{$NL$
1404	$FOREACH order INI.ORDER_LIST$
1405	$ // iniatrªiTA_NULLjÅÈ¢êiE_RSATRj
1406	$IF INI.INIATR[order] != 0$
1407	$ERROR INI.TEXT_LINE[order]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of %3% `%4%\' in %5%"), "iniatr", INI.INIATR[order], "inirtn", INI.INIRTN[order], "ATT_INI")$$END$
1408	$END$
1409	$TAB$((INIRTN)($INI.INIRTN[order]$))((intptr_t)($INI.EXINF[order]$));$NL$
1410	$END$
1411	}$NL$
1412	$NL$
1413
1414	$ ---------------------------------------------------------------------
1415	$ I¹[`ÌÀsÖ
1416	$ ---------------------------------------------------------------------
1417	/*$NL$
1418	$SPC$* Termination Routine$NL$
1419	$SPC$*/$NL$
1420	$NL$
1421	void$NL$
1422	_kernel_call_terrtn(void)$NL$
1423	{$NL$
1424	$FOREACH rorder TER.RORDER_LIST$
1425	$ // teratrªiTA_NULLjÅÈ¢êiE_RSATRj
1426	$IF TER.TERATR[rorder] != 0$
1427	$ERROR TER.TEXT_LINE[rorder]$E_RSATR: $FORMAT(_("illegal %1% `%2%\' of %3% `%4%\' in %5%"), "teratr", TER.TERATR[rorder], "terrtn", TER.TERRTN[rorder], "ATT_TER")$$END$
1428	$END$
1429	$TAB$((TERRTN)($TER.TERRTN[rorder]$))((intptr_t)($TER.EXINF[rorder]$));$NL$
1430	$END$
1431	}$NL$
1432	$NL$
1433
1434

Note: See TracBrowser for help on using the repository browser.

Download in other formats: