|
1 | 1 | /***************************************************************************** |
2 | 2 | * Product: DPP example for Windows |
3 | | -* Last updated for version 7.1.1 |
4 | | -* Last updated on 2022-09-22 |
| 3 | +* Last updated for version 7.1.2 |
| 4 | +* Last updated on 2022-10-06 |
5 | 5 | * |
6 | 6 | * Q u a n t u m L e a P s |
7 | 7 | * ------------------------ |
@@ -71,15 +71,15 @@ int main() { |
71 | 71 | /* start the active objects... */ |
72 | 72 | for (n = 0U; n < N_PHILO; ++n) { |
73 | 73 | QACTIVE_START(AO_Philo[n], /* AO to start */ |
74 | | - Q_PRIO(n + 1U, N_PHILO), /* QF-priority/preemption-thre. */ |
| 74 | + n + 1U, /* QF-priority */ |
75 | 75 | philoQueueSto[n], /* event queue storage */ |
76 | 76 | Q_DIM(philoQueueSto[n]), /* queue length [events] */ |
77 | 77 | (void *)0, /* stack storage (not used) */ |
78 | 78 | 0U, /* size of the stack [bytes] */ |
79 | 79 | (void *)0); /* initialization param */ |
80 | 80 | } |
81 | 81 | QACTIVE_START(AO_Table, /* AO to start */ |
82 | | - N_PHILO + 1U, /* QF-priority/preemption-thre. */ |
| 82 | + N_PHILO + 1U, /* QF-priority */ |
83 | 83 | tableQueueSto, /* event queue storage */ |
84 | 84 | Q_DIM(tableQueueSto), /* queue length [events] */ |
85 | 85 | (void *)0, /* stack storage (not used) */ |
|
0 commit comments