Thread Queue Handler Data Definition

Data Structures
struct	Thread_queue_Control
Defines
#define	TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS   4
#define	TASK_QUEUE_DATA_PRIORITIES_PER_HEADER   64
#define	TASK_QUEUE_DATA_REVERSE_SEARCH_MASK   0x20
Enumerations
enum	Thread_queue_Disciplines { THREAD_QUEUE_DISCIPLINE_FIFO, THREAD_QUEUE_DISCIPLINE_PRIORITY }

---

Detailed Description

This handler defines the data shared between the thread and thread queue handlers. Having this handler define these data structure avoids potentially circular references.

---

Define Documentation

#define TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS   4

This is one of the constants used to manage the priority queues.

There are four chains used to maintain a priority -- each chain manages a distinct set of task priorities. The number of chains is determined by TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS. The following set must be consistent.

The set below configures 4 headers -- each contains 64 priorities. Header x manages priority range (x*64) through ((x*64)+63). If the priority is more than half way through the priority range it is in, then the search is performed from the rear of the chain. This halves the search time to find the insertion point.

#define TASK_QUEUE_DATA_PRIORITIES_PER_HEADER   64

This is one of the constants used to manage the priority queues. TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS for more details.

Referenced by _Thread_queue_Header_number().

#define TASK_QUEUE_DATA_REVERSE_SEARCH_MASK   0x20

This is one of the constants used to manage the priority queues. TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS for more details.

Referenced by _Thread_queue_Is_reverse_search().

---

Enumeration Type Documentation

enum Thread_queue_Disciplines

The following enumerated type details all of the disciplines supported by the Thread Queue Handler.