Test point: 1. Any number of threads may wait on an empty FIFO simultaneously. 2. When a data item is added, it is given to the highest priority thread that has waited longest. Signed-off-by: Ningx Zhao <ningx.zhao@intel.com> |
||
|---|---|---|
| .. | ||
| main.c | ||
| test_queue_contexts.c | ||
| test_queue_fail.c | ||
| test_queue_loop.c | ||
| test_queue_user.c | ||
| test_queue.h | ||