1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>Xenomai API: include/nucleus/queue.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.5 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="examples.html"><span>Examples</span></a></li>
<li>
<form action="search.php" method="get">
<table cellspacing="0" cellpadding="0" border="0">
<tr>
<td><label> <u>S</u>earch for </label></td>
<td><input type="text" name="query" value="" size="20" accesskey="s"/></td>
</tr>
</table>
</form>
</li>
</ul>
</div>
<h1>include/nucleus/queue.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2001,2002,2003 Philippe Gerum <rpm@xenomai.org>.</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 2005 Dmitry Adamushko <dmitry.adamushko@gmail.com></span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Xenomai is free software; you can redistribute it and/or modify</span>
<a name="l00006"></a>00006 <span class="comment"> * it under the terms of the GNU General Public License as published</span>
<a name="l00007"></a>00007 <span class="comment"> * by the Free Software Foundation; either version 2 of the License,</span>
<a name="l00008"></a>00008 <span class="comment"> * or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * Xenomai is distributed in the hope that it will be useful, but</span>
<a name="l00011"></a>00011 <span class="comment"> * WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00013"></a>00013 <span class="comment"> * General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00016"></a>00016 <span class="comment"> * along with Xenomai; if not, write to the Free Software</span>
<a name="l00017"></a>00017 <span class="comment"> * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA</span>
<a name="l00018"></a>00018 <span class="comment"> * 02111-1307, USA.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef _XENO_NUCLEUS_QUEUE_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define _XENO_NUCLEUS_QUEUE_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include <nucleus/types.h></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include <nucleus/core.h></span>
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="comment">/* debug support */</span>
<a name="l00028"></a>00028 <span class="preprocessor">#include <nucleus/assert.h></span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="preprocessor">#ifndef CONFIG_XENO_OPT_DEBUG_QUEUES</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#define CONFIG_XENO_OPT_DEBUG_QUEUES 0</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span>
<a name="l00034"></a>00034 <span class="comment">/* Basic element holder */</span>
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnholder {
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="keyword">struct </span>xnholder *next;
<a name="l00039"></a>00039 <span class="keyword">struct </span>xnholder *last;
<a name="l00040"></a>00040
<a name="l00041"></a>00041 } xnholder_t;
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> inith(xnholder_t *holder)
<a name="l00044"></a>00044 {
<a name="l00045"></a>00045 <span class="comment">/* Holding queues are doubly-linked and circular */</span>
<a name="l00046"></a>00046 holder->last = holder;
<a name="l00047"></a>00047 holder->next = holder;
<a name="l00048"></a>00048 }
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> ath(xnholder_t *head, xnholder_t *holder)
<a name="l00051"></a>00051 {
<a name="l00052"></a>00052 <span class="comment">/* Inserts the new element right after the heading one */</span>
<a name="l00053"></a>00053 holder->last = head;
<a name="l00054"></a>00054 holder->next = head->next;
<a name="l00055"></a>00055 holder->next->last = holder;
<a name="l00056"></a>00056 head->next = holder;
<a name="l00057"></a>00057 }
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> dth(xnholder_t *holder)
<a name="l00060"></a>00060 {
<a name="l00061"></a>00061 holder->last->next = holder->next;
<a name="l00062"></a>00062 holder->next->last = holder->last;
<a name="l00063"></a>00063 }
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="comment">/* Basic element queue */</span>
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnqueue {
<a name="l00068"></a>00068
<a name="l00069"></a>00069 xnholder_t head;
<a name="l00070"></a>00070 <span class="keywordtype">int</span> elems;
<a name="l00071"></a>00071 <span class="preprocessor">#if defined(__KERNEL__) && XENO_DEBUG(QUEUES) && defined(CONFIG_SMP)</span>
<a name="l00072"></a>00072 <span class="preprocessor"></span> xnlock_t lock;
<a name="l00073"></a>00073 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ && XENO_DEBUG(QUEUES) && CONFIG_SMP */</span>
<a name="l00074"></a>00074
<a name="l00075"></a>00075 } xnqueue_t;
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="preprocessor">#if XENO_DEBUG(QUEUES) && defined(CONFIG_SMP)</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span><span class="preprocessor">#define XNQUEUE_INITIALIZER(q) { { &(q).head, &(q).head }, 0, XNARCH_LOCK_UNLOCKED }</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* !(XENO_DEBUG(QUEUES) && CONFIG_SMP) */</span>
<a name="l00080"></a>00080 <span class="preprocessor">#define XNQUEUE_INITIALIZER(q) { { &(q).head, &(q).head }, 0 }</span>
<a name="l00081"></a>00081 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* XENO_DEBUG(QUEUES) && CONFIG_SMP */</span>
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="preprocessor">#define DEFINE_XNQUEUE(q) xnqueue_t q = XNQUEUE_INITIALIZER(q)</span>
<a name="l00084"></a>00084 <span class="preprocessor"></span>
<a name="l00085"></a>00085 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> initq(xnqueue_t *qslot)
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087 inith(&qslot->head);
<a name="l00088"></a>00088 qslot->elems = 0;
<a name="l00089"></a>00089 <span class="preprocessor">#if defined(__KERNEL__) && XENO_DEBUG(QUEUES) && defined(CONFIG_SMP)</span>
<a name="l00090"></a>00090 <span class="preprocessor"></span> xnlock_init(&qslot->lock);
<a name="l00091"></a>00091 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ && XENO_DEBUG(QUEUES) && CONFIG_SMP */</span>
<a name="l00092"></a>00092 }
<a name="l00093"></a>00093
<a name="l00094"></a>00094 <span class="preprocessor">#if XENO_DEBUG(QUEUES)</span>
<a name="l00095"></a>00095 <span class="preprocessor"></span>
<a name="l00096"></a>00096 <span class="preprocessor">#if defined(__KERNEL__) || defined(__XENO_SIM__)</span>
<a name="l00097"></a>00097 <span class="preprocessor"></span>
<a name="l00098"></a>00098 <span class="preprocessor">#define XENO_DEBUG_CHECK_QUEUE(__qslot) \</span>
<a name="l00099"></a>00099 <span class="preprocessor"> do { \</span>
<a name="l00100"></a>00100 <span class="preprocessor"> xnholder_t *curr; \</span>
<a name="l00101"></a>00101 <span class="preprocessor"> spl_t s; \</span>
<a name="l00102"></a>00102 <span class="preprocessor"> int nelems = 0; \</span>
<a name="l00103"></a>00103 <span class="preprocessor"> xnlock_get_irqsave(&(__qslot)->lock,s); \</span>
<a name="l00104"></a>00104 <span class="preprocessor"> curr = (__qslot)->head.last; \</span>
<a name="l00105"></a>00105 <span class="preprocessor"> while (curr != &(__qslot)->head && nelems < (__qslot)->elems) \</span>
<a name="l00106"></a>00106 <span class="preprocessor"> curr = curr->last, nelems++; \</span>
<a name="l00107"></a>00107 <span class="preprocessor"> if (curr != &(__qslot)->head || nelems != (__qslot)->elems) \</span>
<a name="l00108"></a>00108 <span class="preprocessor"> xnpod_fatal("corrupted queue, qslot->elems=%d/%d, qslot=%p at %s:%d", \</span>
<a name="l00109"></a>00109 <span class="preprocessor"> nelems, \</span>
<a name="l00110"></a>00110 <span class="preprocessor"> (__qslot)->elems, \</span>
<a name="l00111"></a>00111 <span class="preprocessor"> __qslot, \</span>
<a name="l00112"></a>00112 <span class="preprocessor"> __FILE__,__LINE__); \</span>
<a name="l00113"></a>00113 <span class="preprocessor"> xnlock_put_irqrestore(&(__qslot)->lock,s); \</span>
<a name="l00114"></a>00114 <span class="preprocessor"> } while(0)</span>
<a name="l00115"></a>00115 <span class="preprocessor"></span>
<a name="l00116"></a>00116 <span class="preprocessor">#define XENO_DEBUG_INSERT_QUEUE(__qslot,__holder) \</span>
<a name="l00117"></a>00117 <span class="preprocessor"> do { \</span>
<a name="l00118"></a>00118 <span class="preprocessor"> xnholder_t *curr; \</span>
<a name="l00119"></a>00119 <span class="preprocessor"> spl_t s; \</span>
<a name="l00120"></a>00120 <span class="preprocessor"> xnlock_get_irqsave(&(__qslot)->lock,s); \</span>
<a name="l00121"></a>00121 <span class="preprocessor"> curr = (__qslot)->head.last; \</span>
<a name="l00122"></a>00122 <span class="preprocessor"> while (curr != &(__qslot)->head && (__holder) != curr) \</span>
<a name="l00123"></a>00123 <span class="preprocessor"> curr = curr->last; \</span>
<a name="l00124"></a>00124 <span class="preprocessor"> if (curr == (__holder)) \</span>
<a name="l00125"></a>00125 <span class="preprocessor"> xnpod_fatal("inserting element twice, holder=%p, qslot=%p at %s:%d", \</span>
<a name="l00126"></a>00126 <span class="preprocessor"> __holder, \</span>
<a name="l00127"></a>00127 <span class="preprocessor"> __qslot, \</span>
<a name="l00128"></a>00128 <span class="preprocessor"> __FILE__,__LINE__); \</span>
<a name="l00129"></a>00129 <span class="preprocessor"> if ((__holder)->last == NULL) \</span>
<a name="l00130"></a>00130 <span class="preprocessor"> xnpod_fatal("holder=%p not initialized, qslot=%p", \</span>
<a name="l00131"></a>00131 <span class="preprocessor"> __holder, \</span>
<a name="l00132"></a>00132 <span class="preprocessor"> __qslot); \</span>
<a name="l00133"></a>00133 <span class="preprocessor"> xnlock_put_irqrestore(&(__qslot)->lock,s); \</span>
<a name="l00134"></a>00134 <span class="preprocessor"> } while(0)</span>
<a name="l00135"></a>00135 <span class="preprocessor"></span>
<a name="l00136"></a>00136 <span class="preprocessor">#define XENO_DEBUG_REMOVE_QUEUE(__qslot,__holder) \</span>
<a name="l00137"></a>00137 <span class="preprocessor"> do { \</span>
<a name="l00138"></a>00138 <span class="preprocessor"> xnholder_t *curr; \</span>
<a name="l00139"></a>00139 <span class="preprocessor"> spl_t s; \</span>
<a name="l00140"></a>00140 <span class="preprocessor"> xnlock_get_irqsave(&(__qslot)->lock,s); \</span>
<a name="l00141"></a>00141 <span class="preprocessor"> curr = (__qslot)->head.last; \</span>
<a name="l00142"></a>00142 <span class="preprocessor"> while (curr != &(__qslot)->head && (__holder) != curr) \</span>
<a name="l00143"></a>00143 <span class="preprocessor"> curr = curr->last; \</span>
<a name="l00144"></a>00144 <span class="preprocessor"> if (curr == &(__qslot)->head) \</span>
<a name="l00145"></a>00145 <span class="preprocessor"> xnpod_fatal("removing non-linked element, holder=%p, qslot=%p at %s:%d", \</span>
<a name="l00146"></a>00146 <span class="preprocessor"> __holder, \</span>
<a name="l00147"></a>00147 <span class="preprocessor"> __qslot, \</span>
<a name="l00148"></a>00148 <span class="preprocessor"> __FILE__,__LINE__); \</span>
<a name="l00149"></a>00149 <span class="preprocessor"> xnlock_put_irqrestore(&(__qslot)->lock,s); \</span>
<a name="l00150"></a>00150 <span class="preprocessor"> } while(0)</span>
<a name="l00151"></a>00151 <span class="preprocessor"></span>
<a name="l00152"></a>00152 <span class="preprocessor">#else </span><span class="comment">/* !(__KERNEL__ || __XENO_SIM__) */</span>
<a name="l00153"></a>00153
<a name="l00154"></a>00154 <span class="comment">/* Disable queue checks in user-space code which does not run as part</span>
<a name="l00155"></a>00155 <span class="comment"> of any virtual machine, e.g. skin call interface libs. */</span>
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="preprocessor">#define XENO_DEBUG_CHECK_QUEUE(__qslot)</span>
<a name="l00158"></a>00158 <span class="preprocessor"></span><span class="preprocessor">#define XENO_DEBUG_INSERT_QUEUE(__qslot,__holder)</span>
<a name="l00159"></a>00159 <span class="preprocessor"></span><span class="preprocessor">#define XENO_DEBUG_REMOVE_QUEUE(__qslot,__holder)</span>
<a name="l00160"></a>00160 <span class="preprocessor"></span>
<a name="l00161"></a>00161 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ || __XENO_SIM__ */</span>
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="comment">/* Write the following as macros so that line numbering information</span>
<a name="l00164"></a>00164 <span class="comment"> keeps pointing at the real caller in diagnosis messages. */</span>
<a name="l00165"></a>00165
<a name="l00166"></a>00166 <span class="preprocessor">#define insertq(__qslot,__head,__holder) \</span>
<a name="l00167"></a>00167 <span class="preprocessor"> ({ XENO_DEBUG_CHECK_QUEUE(__qslot); \</span>
<a name="l00168"></a>00168 <span class="preprocessor"> XENO_DEBUG_INSERT_QUEUE(__qslot,__holder); \</span>
<a name="l00169"></a>00169 <span class="preprocessor"> ath((__head)->last,__holder); \</span>
<a name="l00170"></a>00170 <span class="preprocessor"> ++(__qslot)->elems; })</span>
<a name="l00171"></a>00171 <span class="preprocessor"></span>
<a name="l00172"></a>00172 <span class="preprocessor">#define prependq(__qslot,__holder) \</span>
<a name="l00173"></a>00173 <span class="preprocessor"> ({ XENO_DEBUG_CHECK_QUEUE(__qslot); \</span>
<a name="l00174"></a>00174 <span class="preprocessor"> XENO_DEBUG_INSERT_QUEUE(__qslot,__holder); \</span>
<a name="l00175"></a>00175 <span class="preprocessor"> ath(&(__qslot)->head,__holder); \</span>
<a name="l00176"></a>00176 <span class="preprocessor"> ++(__qslot)->elems; })</span>
<a name="l00177"></a>00177 <span class="preprocessor"></span>
<a name="l00178"></a>00178 <span class="preprocessor">#define appendq(__qslot,__holder) \</span>
<a name="l00179"></a>00179 <span class="preprocessor"> ({ XENO_DEBUG_CHECK_QUEUE(__qslot); \</span>
<a name="l00180"></a>00180 <span class="preprocessor"> XENO_DEBUG_INSERT_QUEUE(__qslot,__holder); \</span>
<a name="l00181"></a>00181 <span class="preprocessor"> ath((__qslot)->head.last,__holder); \</span>
<a name="l00182"></a>00182 <span class="preprocessor"> ++(__qslot)->elems; })</span>
<a name="l00183"></a>00183 <span class="preprocessor"></span>
<a name="l00184"></a>00184 <span class="preprocessor">#define removeq(__qslot,__holder) \</span>
<a name="l00185"></a>00185 <span class="preprocessor"> ({ XENO_DEBUG_CHECK_QUEUE(__qslot); \</span>
<a name="l00186"></a>00186 <span class="preprocessor"> XENO_DEBUG_REMOVE_QUEUE(__qslot,__holder); \</span>
<a name="l00187"></a>00187 <span class="preprocessor"> dth(__holder); \</span>
<a name="l00188"></a>00188 <span class="preprocessor"> --(__qslot)->elems; })</span>
<a name="l00189"></a>00189 <span class="preprocessor"></span>
<a name="l00190"></a>00190 <span class="preprocessor">#else </span><span class="comment">/* !XENO_DEBUG(QUEUES) */</span>
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertq(xnqueue_t *qslot,
<a name="l00193"></a>00193 xnholder_t *head, xnholder_t *holder)
<a name="l00194"></a>00194 {
<a name="l00195"></a>00195 <span class="comment">/* Insert the <holder> element before <head> */</span>
<a name="l00196"></a>00196 ath(head->last, holder);
<a name="l00197"></a>00197 ++qslot->elems;
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> prependq(xnqueue_t *qslot, xnholder_t *holder)
<a name="l00201"></a>00201 {
<a name="l00202"></a>00202 <span class="comment">/* Prepend the element to the queue */</span>
<a name="l00203"></a>00203 ath(&qslot->head, holder);
<a name="l00204"></a>00204 ++qslot->elems;
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206
<a name="l00207"></a>00207 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> appendq(xnqueue_t *qslot, xnholder_t *holder)
<a name="l00208"></a>00208 {
<a name="l00209"></a>00209 <span class="comment">/* Append the element to the queue */</span>
<a name="l00210"></a>00210 ath(qslot->head.last, holder);
<a name="l00211"></a>00211 ++qslot->elems;
<a name="l00212"></a>00212 }
<a name="l00213"></a>00213
<a name="l00214"></a>00214 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> removeq(xnqueue_t *qslot, xnholder_t *holder)
<a name="l00215"></a>00215 {
<a name="l00216"></a>00216 dth(holder);
<a name="l00217"></a>00217 --qslot->elems;
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="preprocessor">#endif </span><span class="comment">/* XENO_DEBUG(QUEUES) */</span>
<a name="l00221"></a>00221
<a name="l00222"></a>00222 <span class="keyword">static</span> <span class="keyword">inline</span> xnholder_t *getheadq(xnqueue_t *qslot)
<a name="l00223"></a>00223 {
<a name="l00224"></a>00224 xnholder_t *holder = qslot->head.next;
<a name="l00225"></a>00225 <span class="keywordflow">return</span> holder == &qslot->head ? NULL : holder;
<a name="l00226"></a>00226 }
<a name="l00227"></a>00227
<a name="l00228"></a>00228 <span class="keyword">static</span> <span class="keyword">inline</span> xnholder_t *getq(xnqueue_t *qslot)
<a name="l00229"></a>00229 {
<a name="l00230"></a>00230 xnholder_t *holder = getheadq(qslot);
<a name="l00231"></a>00231 <span class="keywordflow">if</span> (holder)
<a name="l00232"></a>00232 removeq(qslot, holder);
<a name="l00233"></a>00233 <span class="keywordflow">return</span> holder;
<a name="l00234"></a>00234 }
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="keyword">static</span> <span class="keyword">inline</span> xnholder_t *nextq(xnqueue_t *qslot, xnholder_t *holder)
<a name="l00237"></a>00237 {
<a name="l00238"></a>00238 xnholder_t *nextholder = holder->next;
<a name="l00239"></a>00239 <span class="keywordflow">return</span> nextholder == &qslot->head ? NULL : nextholder;
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241
<a name="l00242"></a>00242 <span class="keyword">static</span> <span class="keyword">inline</span> xnholder_t *popq(xnqueue_t *qslot, xnholder_t *holder)
<a name="l00243"></a>00243 {
<a name="l00244"></a>00244 xnholder_t *nextholder = nextq(qslot, holder);
<a name="l00245"></a>00245 removeq(qslot, holder);
<a name="l00246"></a>00246 <span class="keywordflow">return</span> nextholder;
<a name="l00247"></a>00247 }
<a name="l00248"></a>00248
<a name="l00249"></a>00249 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> countq(xnqueue_t *qslot)
<a name="l00250"></a>00250 {
<a name="l00251"></a>00251 <span class="keywordflow">return</span> qslot->elems;
<a name="l00252"></a>00252 }
<a name="l00253"></a>00253
<a name="l00254"></a>00254 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> emptyq_p(xnqueue_t *qslot)
<a name="l00255"></a>00255 {
<a name="l00256"></a>00256 <span class="keywordflow">return</span> qslot->head.next == &qslot->head;
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258
<a name="l00259"></a>00259 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> moveq(xnqueue_t *dstq, xnqueue_t *srcq)
<a name="l00260"></a>00260 {
<a name="l00261"></a>00261 xnholder_t *headsrc = srcq->head.next;
<a name="l00262"></a>00262 xnholder_t *tailsrc = srcq->head.last;
<a name="l00263"></a>00263 xnholder_t *headdst = &dstq->head;
<a name="l00264"></a>00264
<a name="l00265"></a>00265 headsrc->last->next = tailsrc->next;
<a name="l00266"></a>00266 tailsrc->next->last = headsrc->last;
<a name="l00267"></a>00267 headsrc->last = headdst;
<a name="l00268"></a>00268 tailsrc->next = headdst->next;
<a name="l00269"></a>00269 headdst->next->last = tailsrc;
<a name="l00270"></a>00270 headdst->next = headsrc;
<a name="l00271"></a>00271 dstq->elems += srcq->elems;
<a name="l00272"></a>00272 srcq->elems = 0;
<a name="l00273"></a>00273 }
<a name="l00274"></a>00274
<a name="l00275"></a>00275 <span class="comment">/* Prioritized element holder */</span>
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnpholder {
<a name="l00278"></a>00278
<a name="l00279"></a>00279 xnholder_t plink;
<a name="l00280"></a>00280 <span class="keywordtype">int</span> prio;
<a name="l00281"></a>00281
<a name="l00282"></a>00282 } xnpholder_t;
<a name="l00283"></a>00283
<a name="l00284"></a>00284 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> initph(xnpholder_t *holder)
<a name="l00285"></a>00285 {
<a name="l00286"></a>00286 inith(&holder->plink);
<a name="l00287"></a>00287 <span class="comment">/* Priority is set upon queue insertion */</span>
<a name="l00288"></a>00288 }
<a name="l00289"></a>00289
<a name="l00290"></a>00290 <span class="comment">/* Prioritized element queue - we only manage a descending queuing</span>
<a name="l00291"></a>00291 <span class="comment"> order (highest numbered priorities are linked first). */</span>
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnpqueue { xnqueue_t pqueue; } xnpqueue_t;
<a name="l00294"></a>00294
<a name="l00295"></a>00295 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> initpq(xnpqueue_t *pqslot)
<a name="l00296"></a>00296 {
<a name="l00297"></a>00297 initq(&pqslot->pqueue);
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299
<a name="l00300"></a>00300 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertpq(xnpqueue_t *pqslot,
<a name="l00301"></a>00301 xnpholder_t *head, xnpholder_t *holder)
<a name="l00302"></a>00302 {
<a name="l00303"></a>00303 <span class="comment">/* Insert the <holder> element before <head> */</span>
<a name="l00304"></a>00304 insertq(&pqslot->pqueue, &head->plink, &holder->plink);
<a name="l00305"></a>00305 }
<a name="l00306"></a>00306
<a name="l00307"></a>00307 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertpqf(xnpqueue_t *pqslot, xnpholder_t *holder, <span class="keywordtype">int</span> prio)
<a name="l00308"></a>00308 {
<a name="l00309"></a>00309 <span class="comment">/* Insert the element at the end of its priority group (FIFO) */</span>
<a name="l00310"></a>00310
<a name="l00311"></a>00311 xnholder_t *curr;
<a name="l00312"></a>00312
<a name="l00313"></a>00313 <span class="keywordflow">for</span> (curr = pqslot->pqueue.head.last;
<a name="l00314"></a>00314 curr != &pqslot->pqueue.head; curr = curr->last) {
<a name="l00315"></a>00315 <span class="keywordflow">if</span> (prio <= ((xnpholder_t *)curr)->prio)
<a name="l00316"></a>00316 <span class="keywordflow">break</span>;
<a name="l00317"></a>00317 }
<a name="l00318"></a>00318
<a name="l00319"></a>00319 holder->prio = prio;
<a name="l00320"></a>00320
<a name="l00321"></a>00321 insertq(&pqslot->pqueue, curr->next, &holder->plink);
<a name="l00322"></a>00322 }
<a name="l00323"></a>00323
<a name="l00324"></a>00324 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertpql(xnpqueue_t *pqslot, xnpholder_t *holder, <span class="keywordtype">int</span> prio)
<a name="l00325"></a>00325 {
<a name="l00326"></a>00326 <span class="comment">/* Insert the element at the front of its priority group (LIFO) */</span>
<a name="l00327"></a>00327
<a name="l00328"></a>00328 xnholder_t *curr;
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="keywordflow">for</span> (curr = pqslot->pqueue.head.next;
<a name="l00331"></a>00331 curr != &pqslot->pqueue.head; curr = curr->next) {
<a name="l00332"></a>00332 <span class="keywordflow">if</span> (prio >= ((xnpholder_t *)curr)->prio)
<a name="l00333"></a>00333 <span class="keywordflow">break</span>;
<a name="l00334"></a>00334 }
<a name="l00335"></a>00335
<a name="l00336"></a>00336 holder->prio = prio;
<a name="l00337"></a>00337
<a name="l00338"></a>00338 insertq(&pqslot->pqueue, curr, &holder->plink);
<a name="l00339"></a>00339 }
<a name="l00340"></a>00340
<a name="l00341"></a>00341 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *findpqh(xnpqueue_t *pqslot, <span class="keywordtype">int</span> prio)
<a name="l00342"></a>00342 {
<a name="l00343"></a>00343 <span class="comment">/* Find the element heading a given priority group */</span>
<a name="l00344"></a>00344
<a name="l00345"></a>00345 xnholder_t *curr;
<a name="l00346"></a>00346
<a name="l00347"></a>00347 <span class="keywordflow">for</span> (curr = pqslot->pqueue.head.next;
<a name="l00348"></a>00348 curr != &pqslot->pqueue.head; curr = curr->next) {
<a name="l00349"></a>00349 <span class="keywordflow">if</span> (prio >= ((xnpholder_t *)curr)->prio)
<a name="l00350"></a>00350 <span class="keywordflow">break</span>;
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <span class="keywordflow">if</span> (curr && ((xnpholder_t *)curr)->prio == prio)
<a name="l00354"></a>00354 <span class="keywordflow">return</span> (xnpholder_t *)curr;
<a name="l00355"></a>00355
<a name="l00356"></a>00356 <span class="keywordflow">return</span> NULL;
<a name="l00357"></a>00357 }
<a name="l00358"></a>00358
<a name="l00359"></a>00359 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertpqfr(xnpqueue_t *pqslot, xnpholder_t *holder, <span class="keywordtype">int</span> prio)
<a name="l00360"></a>00360 {
<a name="l00361"></a>00361 <span class="comment">/*</span>
<a name="l00362"></a>00362 <span class="comment"> * Insert the element at the front of its priority group</span>
<a name="l00363"></a>00363 <span class="comment"> * (FIFO) - Reverse queueing applied (lowest numbered</span>
<a name="l00364"></a>00364 <span class="comment"> * priorities are put at front).</span>
<a name="l00365"></a>00365 <span class="comment"> */</span>
<a name="l00366"></a>00366 xnholder_t *curr;
<a name="l00367"></a>00367
<a name="l00368"></a>00368 <span class="keywordflow">for</span> (curr = pqslot->pqueue.head.last;
<a name="l00369"></a>00369 curr != &pqslot->pqueue.head; curr = curr->last) {
<a name="l00370"></a>00370 <span class="keywordflow">if</span> (prio >= ((xnpholder_t *)curr)->prio)
<a name="l00371"></a>00371 <span class="keywordflow">break</span>;
<a name="l00372"></a>00372 }
<a name="l00373"></a>00373
<a name="l00374"></a>00374 holder->prio = prio;
<a name="l00375"></a>00375
<a name="l00376"></a>00376 insertq(&pqslot->pqueue, curr->next, &holder->plink);
<a name="l00377"></a>00377 }
<a name="l00378"></a>00378
<a name="l00379"></a>00379 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertpqlr(xnpqueue_t *pqslot, xnpholder_t *holder, <span class="keywordtype">int</span> prio)
<a name="l00380"></a>00380 {
<a name="l00381"></a>00381 <span class="comment">/*</span>
<a name="l00382"></a>00382 <span class="comment"> * Insert the element at the front of its priority group</span>
<a name="l00383"></a>00383 <span class="comment"> * (LIFO) - Reverse queueing applied (lowest numbered</span>
<a name="l00384"></a>00384 <span class="comment"> * priorities are put at front).</span>
<a name="l00385"></a>00385 <span class="comment"> */</span>
<a name="l00386"></a>00386 xnholder_t *curr;
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <span class="keywordflow">for</span> (curr = pqslot->pqueue.head.next;
<a name="l00389"></a>00389 curr != &pqslot->pqueue.head; curr = curr->next) {
<a name="l00390"></a>00390 <span class="keywordflow">if</span> (prio <= ((xnpholder_t *)curr)->prio)
<a name="l00391"></a>00391 <span class="keywordflow">break</span>;
<a name="l00392"></a>00392 }
<a name="l00393"></a>00393
<a name="l00394"></a>00394 holder->prio = prio;
<a name="l00395"></a>00395
<a name="l00396"></a>00396 insertq(&pqslot->pqueue, curr, &holder->plink);
<a name="l00397"></a>00397 }
<a name="l00398"></a>00398
<a name="l00399"></a>00399 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *findpqhr(xnpqueue_t *pqslot, <span class="keywordtype">int</span> prio)
<a name="l00400"></a>00400 {
<a name="l00401"></a>00401 <span class="comment">/*</span>
<a name="l00402"></a>00402 <span class="comment"> * Find the element heading a given priority group - Reverse</span>
<a name="l00403"></a>00403 <span class="comment"> * queueing assumed (lowest numbered priorities should be at</span>
<a name="l00404"></a>00404 <span class="comment"> * front).</span>
<a name="l00405"></a>00405 <span class="comment"> */</span>
<a name="l00406"></a>00406 xnholder_t *curr;
<a name="l00407"></a>00407
<a name="l00408"></a>00408 <span class="keywordflow">for</span> (curr = pqslot->pqueue.head.next;
<a name="l00409"></a>00409 curr != &pqslot->pqueue.head; curr = curr->next) {
<a name="l00410"></a>00410 <span class="keywordflow">if</span> (prio <= ((xnpholder_t *)curr)->prio)
<a name="l00411"></a>00411 <span class="keywordflow">break</span>;
<a name="l00412"></a>00412 }
<a name="l00413"></a>00413
<a name="l00414"></a>00414 <span class="keywordflow">if</span> (curr && ((xnpholder_t *)curr)->prio == prio)
<a name="l00415"></a>00415 <span class="keywordflow">return</span> (xnpholder_t *)curr;
<a name="l00416"></a>00416
<a name="l00417"></a>00417 <span class="keywordflow">return</span> NULL;
<a name="l00418"></a>00418 }
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> appendpq(xnpqueue_t *pqslot, xnpholder_t *holder)
<a name="l00421"></a>00421 {
<a name="l00422"></a>00422 holder->prio = 0;
<a name="l00423"></a>00423 appendq(&pqslot->pqueue, &holder->plink);
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425
<a name="l00426"></a>00426 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> prependpq(xnpqueue_t *pqslot, xnpholder_t *holder)
<a name="l00427"></a>00427 {
<a name="l00428"></a>00428 holder->prio = 0;
<a name="l00429"></a>00429 prependq(&pqslot->pqueue, &holder->plink);
<a name="l00430"></a>00430 }
<a name="l00431"></a>00431
<a name="l00432"></a>00432 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> removepq(xnpqueue_t *pqslot, xnpholder_t *holder)
<a name="l00433"></a>00433 {
<a name="l00434"></a>00434 removeq(&pqslot->pqueue, &holder->plink);
<a name="l00435"></a>00435 }
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *getheadpq(xnpqueue_t *pqslot)
<a name="l00438"></a>00438 {
<a name="l00439"></a>00439 <span class="keywordflow">return</span> (xnpholder_t *)getheadq(&pqslot->pqueue);
<a name="l00440"></a>00440 }
<a name="l00441"></a>00441
<a name="l00442"></a>00442 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *nextpq(xnpqueue_t *pqslot, xnpholder_t *holder)
<a name="l00443"></a>00443 {
<a name="l00444"></a>00444 <span class="keywordflow">return</span> (xnpholder_t *)nextq(&pqslot->pqueue, &holder->plink);
<a name="l00445"></a>00445 }
<a name="l00446"></a>00446
<a name="l00447"></a>00447 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *getpq(xnpqueue_t *pqslot)
<a name="l00448"></a>00448 {
<a name="l00449"></a>00449 <span class="keywordflow">return</span> (xnpholder_t *)getq(&pqslot->pqueue);
<a name="l00450"></a>00450 }
<a name="l00451"></a>00451
<a name="l00452"></a>00452 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *poppq(xnpqueue_t *pqslot, xnpholder_t *holder)
<a name="l00453"></a>00453 {
<a name="l00454"></a>00454 <span class="keywordflow">return</span> (xnpholder_t *)popq(&pqslot->pqueue, &holder->plink);
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456
<a name="l00457"></a>00457 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> countpq(xnpqueue_t *pqslot)
<a name="l00458"></a>00458 {
<a name="l00459"></a>00459 <span class="keywordflow">return</span> countq(&pqslot->pqueue);
<a name="l00460"></a>00460 }
<a name="l00461"></a>00461
<a name="l00462"></a>00462 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> emptypq_p(xnpqueue_t *pqslot)
<a name="l00463"></a>00463 {
<a name="l00464"></a>00464 <span class="keywordflow">return</span> emptyq_p(&pqslot->pqueue);
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <span class="comment">/* Generic prioritized element holder */</span>
<a name="l00468"></a>00468
<a name="l00469"></a>00469 <span class="keyword">typedef</span> <span class="keyword">struct </span>xngholder {
<a name="l00470"></a>00470
<a name="l00471"></a>00471 xnpholder_t glink;
<a name="l00472"></a>00472 <span class="keywordtype">void</span> *data;
<a name="l00473"></a>00473
<a name="l00474"></a>00474 } xngholder_t;
<a name="l00475"></a>00475
<a name="l00476"></a>00476 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> initgh(xngholder_t *holder, <span class="keywordtype">void</span> *data)
<a name="l00477"></a>00477 {
<a name="l00478"></a>00478 inith(&holder->glink.plink);
<a name="l00479"></a>00479 holder->data = data;
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481
<a name="l00482"></a>00482 <span class="comment">/* Generic element queue */</span>
<a name="l00483"></a>00483
<a name="l00484"></a>00484 <span class="keyword">typedef</span> <span class="keyword">struct </span>xngqueue {
<a name="l00485"></a>00485
<a name="l00486"></a>00486 xnpqueue_t gqueue;
<a name="l00487"></a>00487 xnqueue_t *freehq;
<a name="l00488"></a>00488 void (*starvation) (xnqueue_t *);
<a name="l00489"></a>00489 <span class="keywordtype">int</span> threshold;
<a name="l00490"></a>00490
<a name="l00491"></a>00491 } xngqueue_t;
<a name="l00492"></a>00492
<a name="l00493"></a>00493 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> initgq(xngqueue_t *gqslot,
<a name="l00494"></a>00494 xnqueue_t *freehq,
<a name="l00495"></a>00495 <span class="keywordtype">void</span> (*starvation) (xnqueue_t *),
<a name="l00496"></a>00496 <span class="keywordtype">int</span> threshold)
<a name="l00497"></a>00497 {
<a name="l00498"></a>00498 initpq(&gqslot->gqueue);
<a name="l00499"></a>00499 gqslot->freehq = freehq;
<a name="l00500"></a>00500 gqslot->starvation = starvation;
<a name="l00501"></a>00501 gqslot->threshold = threshold;
<a name="l00502"></a>00502 }
<a name="l00503"></a>00503
<a name="l00504"></a>00504 <span class="keyword">static</span> <span class="keyword">inline</span> xngholder_t *allocgh(xngqueue_t *gqslot)
<a name="l00505"></a>00505 {
<a name="l00506"></a>00506 <span class="keywordflow">if</span> (countq(gqslot->freehq) < gqslot->threshold)
<a name="l00507"></a>00507 gqslot->starvation(gqslot->freehq);
<a name="l00508"></a>00508
<a name="l00509"></a>00509 <span class="keywordflow">return</span> (xngholder_t *)getq(gqslot->freehq);
<a name="l00510"></a>00510 }
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> *removegh(xngqueue_t *gqslot, xngholder_t *holder)
<a name="l00513"></a>00513 {
<a name="l00514"></a>00514 removepq(&gqslot->gqueue, &holder->glink);
<a name="l00515"></a>00515 appendq(gqslot->freehq, &holder->glink.plink);
<a name="l00516"></a>00516 <span class="keywordflow">return</span> holder->data;
<a name="l00517"></a>00517 }
<a name="l00518"></a>00518
<a name="l00519"></a>00519 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertgqf(xngqueue_t *gqslot, <span class="keywordtype">void</span> *data, <span class="keywordtype">int</span> prio)
<a name="l00520"></a>00520 {
<a name="l00521"></a>00521 xngholder_t *holder = allocgh(gqslot);
<a name="l00522"></a>00522 holder->data = data;
<a name="l00523"></a>00523 <span class="keywordflow">return</span> insertpqf(&gqslot->gqueue, &holder->glink, prio);
<a name="l00524"></a>00524 }
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertgql(xngqueue_t *gqslot, <span class="keywordtype">void</span> *data, <span class="keywordtype">int</span> prio)
<a name="l00527"></a>00527 {
<a name="l00528"></a>00528 xngholder_t *holder = allocgh(gqslot);
<a name="l00529"></a>00529 holder->data = data;
<a name="l00530"></a>00530 insertpql(&gqslot->gqueue, &holder->glink, prio);
<a name="l00531"></a>00531 }
<a name="l00532"></a>00532
<a name="l00533"></a>00533 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> appendgq(xngqueue_t *gqslot, <span class="keywordtype">void</span> *data)
<a name="l00534"></a>00534 {
<a name="l00535"></a>00535 xngholder_t *holder = allocgh(gqslot);
<a name="l00536"></a>00536 holder->data = data;
<a name="l00537"></a>00537 appendpq(&gqslot->gqueue, &holder->glink);
<a name="l00538"></a>00538 }
<a name="l00539"></a>00539
<a name="l00540"></a>00540 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> prependgq(xngqueue_t *gqslot, <span class="keywordtype">void</span> *data)
<a name="l00541"></a>00541 {
<a name="l00542"></a>00542 xngholder_t *holder = allocgh(gqslot);
<a name="l00543"></a>00543 holder->data = data;
<a name="l00544"></a>00544 prependpq(&gqslot->gqueue, &holder->glink);
<a name="l00545"></a>00545 }
<a name="l00546"></a>00546
<a name="l00547"></a>00547 <span class="keyword">static</span> <span class="keyword">inline</span> xngholder_t *getheadgq(xngqueue_t *gqslot)
<a name="l00548"></a>00548 {
<a name="l00549"></a>00549 <span class="keywordflow">return</span> (xngholder_t *)getheadpq(&gqslot->gqueue);
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551
<a name="l00552"></a>00552 <span class="keyword">static</span> <span class="keyword">inline</span> xngholder_t *nextgq(xngqueue_t *gqslot, xngholder_t *holder)
<a name="l00553"></a>00553 {
<a name="l00554"></a>00554 <span class="keywordflow">return</span> (xngholder_t *)nextpq(&gqslot->gqueue, &holder->glink);
<a name="l00555"></a>00555 }
<a name="l00556"></a>00556
<a name="l00557"></a>00557 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> *getgq(xngqueue_t *gqslot)
<a name="l00558"></a>00558 {
<a name="l00559"></a>00559 xngholder_t *holder = getheadgq(gqslot);
<a name="l00560"></a>00560
<a name="l00561"></a>00561 <span class="keywordflow">if</span> (!holder)
<a name="l00562"></a>00562 <span class="keywordflow">return</span> NULL;
<a name="l00563"></a>00563
<a name="l00564"></a>00564 appendq(gqslot->freehq, &getpq(&gqslot->gqueue)->plink);
<a name="l00565"></a>00565
<a name="l00566"></a>00566 <span class="keywordflow">return</span> holder->data;
<a name="l00567"></a>00567 }
<a name="l00568"></a>00568
<a name="l00569"></a>00569 <span class="keyword">static</span> <span class="keyword">inline</span> xngholder_t *popgq(xngqueue_t *gqslot, xngholder_t *holder)
<a name="l00570"></a>00570 {
<a name="l00571"></a>00571 xngholder_t *nextholder = nextgq(gqslot, holder);
<a name="l00572"></a>00572 removegh(gqslot, holder);
<a name="l00573"></a>00573 <span class="keywordflow">return</span> nextholder;
<a name="l00574"></a>00574 }
<a name="l00575"></a>00575
<a name="l00576"></a>00576 <span class="keyword">static</span> <span class="keyword">inline</span> xngholder_t *findgq(xngqueue_t *gqslot, <span class="keywordtype">void</span> *data)
<a name="l00577"></a>00577 {
<a name="l00578"></a>00578 xnholder_t *holder;
<a name="l00579"></a>00579
<a name="l00580"></a>00580 <span class="keywordflow">for</span> (holder = gqslot->gqueue.pqueue.head.next;
<a name="l00581"></a>00581 holder != &gqslot->gqueue.pqueue.head; holder = holder->next) {
<a name="l00582"></a>00582 <span class="keywordflow">if</span> (((xngholder_t *)holder)->data == data)
<a name="l00583"></a>00583 <span class="keywordflow">return</span> (xngholder_t *)holder;
<a name="l00584"></a>00584 }
<a name="l00585"></a>00585
<a name="l00586"></a>00586 <span class="keywordflow">return</span> NULL;
<a name="l00587"></a>00587 }
<a name="l00588"></a>00588
<a name="l00589"></a>00589 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> *removegq(xngqueue_t *gqslot, <span class="keywordtype">void</span> *data)
<a name="l00590"></a>00590 {
<a name="l00591"></a>00591 xngholder_t *holder = findgq(gqslot, data);
<a name="l00592"></a>00592 <span class="keywordflow">return</span> holder ? removegh(gqslot, holder) : NULL;
<a name="l00593"></a>00593 }
<a name="l00594"></a>00594
<a name="l00595"></a>00595 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> countgq(xngqueue_t *gqslot)
<a name="l00596"></a>00596 {
<a name="l00597"></a>00597 <span class="keywordflow">return</span> countpq(&gqslot->gqueue);
<a name="l00598"></a>00598 }
<a name="l00599"></a>00599
<a name="l00600"></a>00600 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> emptygq_p(xngqueue_t *gqslot)
<a name="l00601"></a>00601 {
<a name="l00602"></a>00602 <span class="keywordflow">return</span> emptypq_p(&gqslot->gqueue);
<a name="l00603"></a>00603 }
<a name="l00604"></a>00604
<a name="l00605"></a>00605 <span class="preprocessor">#ifdef CONFIG_XENO_OPT_SCALABLE_SCHED</span>
<a name="l00606"></a>00606 <span class="preprocessor"></span>
<a name="l00607"></a>00607 <span class="comment">/* Multi-level priority queue, suitable for handling the runnable</span>
<a name="l00608"></a>00608 <span class="comment"> thread queue. We only manage a descending queuing order,</span>
<a name="l00609"></a>00609 <span class="comment"> i.e. highest numbered priorities come first. */</span>
<a name="l00610"></a>00610
<a name="l00611"></a>00611 <span class="preprocessor">#if BITS_PER_LONG * BITS_PER_LONG < XNCORE_NR_PRIO</span>
<a name="l00612"></a>00612 <span class="preprocessor"></span><span class="preprocessor">#error "Internal bitmap cannot hold so many priority levels"</span>
<a name="l00613"></a>00613 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00614"></a>00614 <span class="preprocessor"></span>
<a name="l00615"></a>00615 <span class="preprocessor">#define __MLQ_LONGS ((XNCORE_NR_PRIO+BITS_PER_LONG-1)/BITS_PER_LONG)</span>
<a name="l00616"></a>00616 <span class="preprocessor"></span>
<a name="l00617"></a>00617 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnmlqueue {
<a name="l00618"></a>00618
<a name="l00619"></a>00619 <span class="keywordtype">int</span> loprio, hiprio, elems;
<a name="l00620"></a>00620
<a name="l00621"></a>00621 u_long himap, lomap[__MLQ_LONGS];
<a name="l00622"></a>00622
<a name="l00623"></a>00623 <span class="keyword">struct </span>xnqueue queue[XNCORE_NR_PRIO];
<a name="l00624"></a>00624
<a name="l00625"></a>00625 } xnmlqueue_t;
<a name="l00626"></a>00626
<a name="l00627"></a>00627 <span class="preprocessor">#undef __MLQ_LONGS</span>
<a name="l00628"></a>00628 <span class="preprocessor"></span>
<a name="l00629"></a>00629 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> countmlq(xnmlqueue_t *mlqslot)
<a name="l00630"></a>00630 {
<a name="l00631"></a>00631 <span class="keywordflow">return</span> mlqslot->elems;
<a name="l00632"></a>00632 }
<a name="l00633"></a>00633
<a name="l00634"></a>00634 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> emptymlq_p(xnmlqueue_t *mlqslot)
<a name="l00635"></a>00635 {
<a name="l00636"></a>00636 <span class="keywordflow">return</span> mlqslot->himap == 0;
<a name="l00637"></a>00637 }
<a name="l00638"></a>00638
<a name="l00639"></a>00639 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> indexmlq(xnmlqueue_t *mlqslot, <span class="keywordtype">int</span> prio)
<a name="l00640"></a>00640 {
<a name="l00641"></a>00641 <span class="comment">/* We need to rescale the priority level to a 0-based</span>
<a name="l00642"></a>00642 <span class="comment"> range. We use ffnz() to scan the bitmap which MUST be based</span>
<a name="l00643"></a>00643 <span class="comment"> on a bit scan forward op. Therefore, the lower the index</span>
<a name="l00644"></a>00644 <span class="comment"> value, the higher the priority (since least significant</span>
<a name="l00645"></a>00645 <span class="comment"> bits will be found first when scanning the bitmaps). */</span>
<a name="l00646"></a>00646 <span class="keywordflow">return</span> mlqslot->hiprio - prio;
<a name="l00647"></a>00647 }
<a name="l00648"></a>00648
<a name="l00649"></a>00649 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> ffsmlq(xnmlqueue_t *mlqslot)
<a name="l00650"></a>00650 {
<a name="l00651"></a>00651 <span class="keywordtype">int</span> hi = ffnz(mlqslot->himap);
<a name="l00652"></a>00652 <span class="keywordtype">int</span> lo = ffnz(mlqslot->lomap[hi]);
<a name="l00653"></a>00653 <span class="keywordflow">return</span> hi * BITS_PER_LONG + lo; <span class="comment">/* Result is undefined if none set. */</span>
<a name="l00654"></a>00654 }
<a name="l00655"></a>00655
<a name="l00656"></a>00656 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> initmlq(xnmlqueue_t *mlqslot, <span class="keywordtype">int</span> loprio, <span class="keywordtype">int</span> hiprio)
<a name="l00657"></a>00657 {
<a name="l00658"></a>00658 <span class="keywordtype">int</span> prio;
<a name="l00659"></a>00659
<a name="l00660"></a>00660 mlqslot->elems = 0;
<a name="l00661"></a>00661 mlqslot->loprio = loprio;
<a name="l00662"></a>00662 mlqslot->hiprio = hiprio;
<a name="l00663"></a>00663 mlqslot->himap = 0;
<a name="l00664"></a>00664 memset(&mlqslot->lomap, 0, <span class="keyword">sizeof</span>(mlqslot->lomap));
<a name="l00665"></a>00665
<a name="l00666"></a>00666 <span class="keywordflow">for</span> (prio = 0; prio < XNCORE_NR_PRIO; prio++)
<a name="l00667"></a>00667 initq(&mlqslot->queue[prio]);
<a name="l00668"></a>00668
<a name="l00669"></a>00669 XENO_ASSERT(NUCLEUS,
<a name="l00670"></a>00670 hiprio - loprio < XNCORE_NR_PRIO,
<a name="l00671"></a>00671 xnpod_fatal(<span class="stringliteral">"priority range [%d..%d] is beyond multi-level "</span>
<a name="l00672"></a>00672 <span class="stringliteral">"queue indexing capabilities"</span>,
<a name="l00673"></a>00673 loprio, hiprio));
<a name="l00674"></a>00674 }
<a name="l00675"></a>00675
<a name="l00676"></a>00676 <span class="preprocessor">#define XNMLQUEUE_APPEND 0</span>
<a name="l00677"></a>00677 <span class="preprocessor"></span><span class="preprocessor">#define XNMLQUEUE_PREPEND 1</span>
<a name="l00678"></a>00678 <span class="preprocessor"></span>
<a name="l00679"></a>00679 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> addmlq(xnmlqueue_t *mlqslot,
<a name="l00680"></a>00680 xnpholder_t *holder, <span class="keywordtype">int</span> idx, <span class="keywordtype">int</span> mode)
<a name="l00681"></a>00681 {
<a name="l00682"></a>00682 xnqueue_t *queue = &mlqslot->queue[idx];
<a name="l00683"></a>00683 <span class="keywordtype">int</span> hi = idx / BITS_PER_LONG;
<a name="l00684"></a>00684 <span class="keywordtype">int</span> lo = idx % BITS_PER_LONG;
<a name="l00685"></a>00685
<a name="l00686"></a>00686 <span class="keywordflow">if</span> (mode == XNMLQUEUE_PREPEND) <span class="comment">/* Hopefully, this should be optimized away. */</span>
<a name="l00687"></a>00687 prependq(queue, &holder->plink);
<a name="l00688"></a>00688 <span class="keywordflow">else</span>
<a name="l00689"></a>00689 appendq(queue, &holder->plink);
<a name="l00690"></a>00690
<a name="l00691"></a>00691 holder->prio = idx;
<a name="l00692"></a>00692 mlqslot->elems++;
<a name="l00693"></a>00693 __setbits(mlqslot->himap, 1UL << hi);
<a name="l00694"></a>00694 __setbits(mlqslot->lomap[hi], 1UL << lo);
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696
<a name="l00697"></a>00697 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertmlql(xnmlqueue_t *mlqslot,
<a name="l00698"></a>00698 xnpholder_t *holder, <span class="keywordtype">int</span> prio)
<a name="l00699"></a>00699 {
<a name="l00700"></a>00700 addmlq(mlqslot, holder, indexmlq(mlqslot, prio), XNMLQUEUE_PREPEND);
<a name="l00701"></a>00701 }
<a name="l00702"></a>00702
<a name="l00703"></a>00703 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> insertmlqf(xnmlqueue_t *mlqslot,
<a name="l00704"></a>00704 xnpholder_t *holder, <span class="keywordtype">int</span> prio)
<a name="l00705"></a>00705 {
<a name="l00706"></a>00706 addmlq(mlqslot, holder, indexmlq(mlqslot, prio), XNMLQUEUE_APPEND);
<a name="l00707"></a>00707 }
<a name="l00708"></a>00708
<a name="l00709"></a>00709 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> appendmlq(xnmlqueue_t *mlqslot, xnpholder_t *holder)
<a name="l00710"></a>00710 {
<a name="l00711"></a>00711 addmlq(mlqslot, holder, indexmlq(mlqslot, mlqslot->hiprio),
<a name="l00712"></a>00712 XNMLQUEUE_APPEND);
<a name="l00713"></a>00713 }
<a name="l00714"></a>00714
<a name="l00715"></a>00715 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> prependmlq(xnmlqueue_t *mlqslot, xnpholder_t *holder)
<a name="l00716"></a>00716 {
<a name="l00717"></a>00717 addmlq(mlqslot, holder, indexmlq(mlqslot, mlqslot->loprio),
<a name="l00718"></a>00718 XNMLQUEUE_PREPEND);
<a name="l00719"></a>00719 }
<a name="l00720"></a>00720
<a name="l00721"></a>00721 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> removemlq(xnmlqueue_t *mlqslot, xnpholder_t *holder)
<a name="l00722"></a>00722 {
<a name="l00723"></a>00723 <span class="keywordtype">int</span> idx = holder->prio;
<a name="l00724"></a>00724 xnqueue_t *queue = &mlqslot->queue[idx];
<a name="l00725"></a>00725
<a name="l00726"></a>00726 mlqslot->elems--;
<a name="l00727"></a>00727
<a name="l00728"></a>00728 removeq(queue, &holder->plink);
<a name="l00729"></a>00729
<a name="l00730"></a>00730 <span class="keywordflow">if</span> (emptyq_p(queue)) {
<a name="l00731"></a>00731 <span class="keywordtype">int</span> hi = idx / BITS_PER_LONG;
<a name="l00732"></a>00732 <span class="keywordtype">int</span> lo = idx % BITS_PER_LONG;
<a name="l00733"></a>00733 __clrbits(mlqslot->lomap[hi], 1UL << lo);
<a name="l00734"></a>00734 <span class="keywordflow">if</span> (mlqslot->lomap[hi] == 0)
<a name="l00735"></a>00735 __clrbits(mlqslot->himap, 1UL << hi);
<a name="l00736"></a>00736 }
<a name="l00737"></a>00737 }
<a name="l00738"></a>00738
<a name="l00739"></a>00739 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *findmlqh(xnmlqueue_t *mlqslot, <span class="keywordtype">int</span> prio)
<a name="l00740"></a>00740 {
<a name="l00741"></a>00741 xnqueue_t *queue = &mlqslot->queue[indexmlq(mlqslot, prio)];
<a name="l00742"></a>00742 <span class="keywordflow">return</span> (xnpholder_t *)getheadq(queue);
<a name="l00743"></a>00743 }
<a name="l00744"></a>00744
<a name="l00745"></a>00745 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *getheadmlq(xnmlqueue_t *mlqslot)
<a name="l00746"></a>00746 {
<a name="l00747"></a>00747 xnpholder_t *holder;
<a name="l00748"></a>00748 xnqueue_t *queue;
<a name="l00749"></a>00749
<a name="l00750"></a>00750 <span class="keywordflow">if</span> (emptymlq_p(mlqslot))
<a name="l00751"></a>00751 <span class="keywordflow">return</span> NULL;
<a name="l00752"></a>00752
<a name="l00753"></a>00753 queue = &mlqslot->queue[ffsmlq(mlqslot)];
<a name="l00754"></a>00754 holder = (xnpholder_t *)getheadq(queue);
<a name="l00755"></a>00755
<a name="l00756"></a>00756 XENO_ASSERT(QUEUES, holder,
<a name="l00757"></a>00757 xnpod_fatal
<a name="l00758"></a>00758 (<span class="stringliteral">"corrupted multi-level queue, qslot=%p at %s:%d"</span>, mlqslot,
<a name="l00759"></a>00759 __FILE__, __LINE__);
<a name="l00760"></a>00760 );
<a name="l00761"></a>00761
<a name="l00762"></a>00762 <span class="keywordflow">return</span> holder;
<a name="l00763"></a>00763 }
<a name="l00764"></a>00764
<a name="l00765"></a>00765 <span class="keyword">static</span> <span class="keyword">inline</span> xnpholder_t *getmlq(xnmlqueue_t *mlqslot)
<a name="l00766"></a>00766 {
<a name="l00767"></a>00767 xnholder_t *holder;
<a name="l00768"></a>00768 xnqueue_t *queue;
<a name="l00769"></a>00769 <span class="keywordtype">int</span> idx, hi, lo;
<a name="l00770"></a>00770
<a name="l00771"></a>00771 <span class="keywordflow">if</span> (emptymlq_p(mlqslot))
<a name="l00772"></a>00772 <span class="keywordflow">return</span> NULL;
<a name="l00773"></a>00773
<a name="l00774"></a>00774 idx = ffsmlq(mlqslot);
<a name="l00775"></a>00775 queue = &mlqslot->queue[idx];
<a name="l00776"></a>00776 holder = getq(queue);
<a name="l00777"></a>00777
<a name="l00778"></a>00778 XENO_ASSERT(QUEUES, holder,
<a name="l00779"></a>00779 xnpod_fatal
<a name="l00780"></a>00780 (<span class="stringliteral">"corrupted multi-level queue, qslot=%p at %s:%d"</span>, mlqslot,
<a name="l00781"></a>00781 __FILE__, __LINE__);
<a name="l00782"></a>00782 );
<a name="l00783"></a>00783
<a name="l00784"></a>00784 mlqslot->elems--;
<a name="l00785"></a>00785
<a name="l00786"></a>00786 <span class="keywordflow">if</span> (emptyq_p(queue)) {
<a name="l00787"></a>00787 hi = idx / BITS_PER_LONG;
<a name="l00788"></a>00788 lo = idx % BITS_PER_LONG;
<a name="l00789"></a>00789 __clrbits(mlqslot->lomap[hi], 1UL << lo);
<a name="l00790"></a>00790 <span class="keywordflow">if</span> (mlqslot->lomap[hi] == 0)
<a name="l00791"></a>00791 __clrbits(mlqslot->himap, 1UL << hi);
<a name="l00792"></a>00792 }
<a name="l00793"></a>00793
<a name="l00794"></a>00794 <span class="keywordflow">return</span> (xnpholder_t *)holder;
<a name="l00795"></a>00795 }
<a name="l00796"></a>00796
<a name="l00797"></a>00797 <span class="preprocessor">#endif </span><span class="comment">/* CONFIG_XENO_OPT_SCALABLE_SCHED */</span>
<a name="l00798"></a>00798
<a name="l00799"></a>00799 <span class="preprocessor">#endif </span><span class="comment">/* !_XENO_NUCLEUS_QUEUE_H */</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sun Jun 8 18:08:49 2008 for Xenomai API by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.5 </small></address>
</body>
</html>
|
