![]() |
libgpac
Documentation of the core library of GPAC
|
#include <stddef.h>
Include dependency graph for src/quickjs/list.h:
This graph shows which files directly or indirectly include this file:Data Structures | |
| struct | list_head |
Macros | |
| #define | LIST_HEAD_INIT(el) { &(el), &(el) } |
| #define | list_entry(el, type, member) ((type *)((uint8_t *)(el) - offsetof(type, member))) |
| #define | list_for_each(el, head) for(el = (head)->next; el != (head); el = el->next) |
| #define | list_for_each_safe(el, el1, head) |
| #define | list_for_each_prev(el, head) for(el = (head)->prev; el != (head); el = el->prev) |
| #define | list_for_each_prev_safe(el, el1, head) |
Functions | |
| static void | init_list_head (struct list_head *head) |
| static void | __list_add (struct list_head *el, struct list_head *prev, struct list_head *next) |
| static void | list_add (struct list_head *el, struct list_head *head) |
| static void | list_add_tail (struct list_head *el, struct list_head *head) |
| static void | list_del (struct list_head *el) |
| static int | list_empty (struct list_head *el) |
| struct list_head |
| #define LIST_HEAD_INIT | ( | el | ) | { &(el), &(el) } |
| #define list_for_each | ( | el, | |
| head | |||
| ) | for(el = (head)->next; el != (head); el = el->next) |
| #define list_for_each_safe | ( | el, | |
| el1, | |||
| head | |||
| ) |
| #define list_for_each_prev | ( | el, | |
| head | |||
| ) | for(el = (head)->prev; el != (head); el = el->prev) |
| #define list_for_each_prev_safe | ( | el, | |
| el1, | |||
| head | |||
| ) |
|
static |
Here is the caller graph for this function:
|
static |
Here is the caller graph for this function:
Here is the call graph for this function:
Here is the caller graph for this function:
Here is the call graph for this function:
Here is the caller graph for this function:
|
static |
Here is the caller graph for this function:
|
static |
Here is the caller graph for this function: