StarPU Handbook
|
Data Structures | |
struct | starpu_task_list |
struct starpu_task_list |
Store a double-chained list of tasks
Data Fields | ||
---|---|---|
struct starpu_task * | head |
head of the list |
struct starpu_task * | tail |
tail of the list |
void starpu_task_list_init | ( | struct starpu_task_list * | list | ) |
Initialize a list structure
void starpu_task_list_push_front | ( | struct starpu_task_list * | list, |
struct starpu_task * | task | ||
) |
Push task
at the front of list
void starpu_task_list_push_back | ( | struct starpu_task_list * | list, |
struct starpu_task * | task | ||
) |
Push task
at the back of list
struct starpu_task* starpu_task_list_front | ( | const struct starpu_task_list * | list | ) |
Get the front of list
(without removing it)
struct starpu_task* starpu_task_list_back | ( | const struct starpu_task_list * | list | ) |
Get the back of list
(without removing it)
int starpu_task_list_empty | ( | const struct starpu_task_list * | list | ) |
Test if list
is empty
void starpu_task_list_erase | ( | struct starpu_task_list * | list, |
struct starpu_task * | task | ||
) |
Remove task
from list
struct starpu_task* starpu_task_list_pop_front | ( | struct starpu_task_list * | list | ) |
Remove the element at the front of list
struct starpu_task* starpu_task_list_pop_back | ( | struct starpu_task_list * | list | ) |
Remove the element at the back of list
struct starpu_task* starpu_task_list_begin | ( | const struct starpu_task_list * | list | ) |
Get the first task of list
.
struct starpu_task* starpu_task_list_end | ( | const struct starpu_task_list *list | STARPU_ATTRIBUTE_UNUSED | ) |
Get the end of list
.
struct starpu_task* starpu_task_list_next | ( | const struct starpu_task * | task | ) |
Get the next task of list
. This is not erase-safe.
int starpu_task_list_ismember | ( | const struct starpu_task_list * | list, |
const struct starpu_task * | look | ||
) |
Test whether the given task look
is contained in the list
.