Go to the source code of this file.
Defines | |
#define | _Q_INVALIDATE(a) |
#define | SLIST_HEAD(name, type) |
#define | SLIST_HEAD_INITIALIZER(head) { NULL } |
#define | SLIST_ENTRY(type) |
#define | SLIST_FIRST(head) ((head)->slh_first) |
#define | SLIST_END(head) NULL |
#define | SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) |
#define | SLIST_NEXT(elm, field) ((elm)->field.sle_next) |
#define | SLIST_FOREACH(var, head, field) |
#define | SLIST_FOREACH_PREVPTR(var, varp, head, field) |
#define | SLIST_INIT(head) |
#define | SLIST_INSERT_AFTER(slistelm, elm, field) |
#define | SLIST_INSERT_HEAD(head, elm, field) |
#define | SLIST_REMOVE_NEXT(head, elm, field) |
#define | SLIST_REMOVE_HEAD(head, field) |
#define | SLIST_REMOVE(head, elm, type, field) |
#define | LIST_HEAD(name, type) |
#define | LIST_HEAD_INITIALIZER(head) { NULL } |
#define | LIST_ENTRY(type) |
#define | LIST_FIRST(head) ((head)->lh_first) |
#define | LIST_END(head) NULL |
#define | LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) |
#define | LIST_NEXT(elm, field) ((elm)->field.le_next) |
#define | LIST_FOREACH(var, head, field) |
#define | LIST_INIT(head) |
#define | LIST_INSERT_AFTER(listelm, elm, field) |
#define | LIST_INSERT_BEFORE(listelm, elm, field) |
#define | LIST_INSERT_HEAD(head, elm, field) |
#define | LIST_REMOVE(elm, field) |
#define | LIST_REPLACE(elm, elm2, field) |
#define | SIMPLEQ_HEAD(name, type) |
#define | SIMPLEQ_HEAD_INITIALIZER(head) { NULL, &(head).sqh_first } |
#define | SIMPLEQ_ENTRY(type) |
#define | SIMPLEQ_FIRST(head) ((head)->sqh_first) |
#define | SIMPLEQ_END(head) NULL |
#define | SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) |
#define | SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) |
#define | SIMPLEQ_FOREACH(var, head, field) |
#define | SIMPLEQ_INIT(head) |
#define | SIMPLEQ_INSERT_HEAD(head, elm, field) |
#define | SIMPLEQ_INSERT_TAIL(head, elm, field) |
#define | SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) |
#define | SIMPLEQ_REMOVE_HEAD(head, field) |
#define | TAILQ_HEAD(name, type) |
#define | TAILQ_HEAD_INITIALIZER(head) { NULL, &(head).tqh_first } |
#define | TAILQ_ENTRY(type) |
#define | TAILQ_FIRST(head) ((head)->tqh_first) |
#define | TAILQ_END(head) NULL |
#define | TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) |
#define | TAILQ_LAST(head, headname) (*(((struct headname *)((head)->tqh_last))->tqh_last)) |
#define | TAILQ_PREV(elm, headname, field) (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) |
#define | TAILQ_EMPTY(head) (TAILQ_FIRST(head) == TAILQ_END(head)) |
#define | TAILQ_FOREACH(var, head, field) |
#define | TAILQ_FOREACH_REVERSE(var, head, headname, field) |
#define | TAILQ_INIT(head) |
#define | TAILQ_INSERT_HEAD(head, elm, field) |
#define | TAILQ_INSERT_TAIL(head, elm, field) |
#define | TAILQ_INSERT_AFTER(head, listelm, elm, field) |
#define | TAILQ_INSERT_BEFORE(listelm, elm, field) |
#define | TAILQ_REMOVE(head, elm, field) |
#define | TAILQ_REPLACE(head, elm, elm2, field) |
#define | CIRCLEQ_HEAD(name, type) |
#define | CIRCLEQ_HEAD_INITIALIZER(head) { CIRCLEQ_END(&head), CIRCLEQ_END(&head) } |
#define | CIRCLEQ_ENTRY(type) |
#define | CIRCLEQ_FIRST(head) ((head)->cqh_first) |
#define | CIRCLEQ_LAST(head) ((head)->cqh_last) |
#define | CIRCLEQ_END(head) ((void *)(head)) |
#define | CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) |
#define | CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) |
#define | CIRCLEQ_EMPTY(head) (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) |
#define | CIRCLEQ_FOREACH(var, head, field) |
#define | CIRCLEQ_FOREACH_REVERSE(var, head, field) |
#define | CIRCLEQ_INIT(head) |
#define | CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) |
#define | CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) |
#define | CIRCLEQ_INSERT_HEAD(head, elm, field) |
#define | CIRCLEQ_INSERT_TAIL(head, elm, field) |
#define | CIRCLEQ_REMOVE(head, elm, field) |
#define | CIRCLEQ_REPLACE(head, elm, elm2, field) |
#define CIRCLEQ_EMPTY | ( | head | ) | (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) |
Definition at line 436 of file queue.h.
Referenced by client_remove_from_container().
#define CIRCLEQ_END | ( | head | ) | ((void *)(head)) |
Definition at line 433 of file queue.h.
Referenced by move_current_window_in_container().
#define CIRCLEQ_ENTRY | ( | type | ) |
#define CIRCLEQ_FIRST | ( | head | ) | ((head)->cqh_first) |
Definition at line 431 of file queue.h.
Referenced by focus_window_in_container().
#define CIRCLEQ_FOREACH | ( | var, | |||
head, | |||||
field | ) |
for((var) = CIRCLEQ_FIRST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_NEXT(var, field))
Definition at line 439 of file queue.h.
Referenced by button_press_stackwin(), container_mode(), dump_table(), ignore_enter_notify_forall(), render_container(), switch_layout_mode(), workspace_map_clients(), and workspace_unmap_clients().
#define CIRCLEQ_FOREACH_REVERSE | ( | var, | |||
head, | |||||
field | ) |
for((var) = CIRCLEQ_LAST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_PREV(var, field))
#define CIRCLEQ_HEAD | ( | name, | |||
type | ) |
#define CIRCLEQ_HEAD_INITIALIZER | ( | head | ) | { CIRCLEQ_END(&head), CIRCLEQ_END(&head) } |
#define CIRCLEQ_INIT | ( | head | ) |
do { \ (head)->cqh_first = CIRCLEQ_END(head); \ (head)->cqh_last = CIRCLEQ_END(head); \ } while (0)
Definition at line 452 of file queue.h.
Referenced by new_container().
#define CIRCLEQ_INSERT_AFTER | ( | head, | |||
listelm, | |||||
elm, | |||||
field | ) |
do { \ (elm)->field.cqe_next = (listelm)->field.cqe_next; \ (elm)->field.cqe_prev = (listelm); \ if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm); \ else \ (listelm)->field.cqe_next->field.cqe_prev = (elm); \ (listelm)->field.cqe_next = (elm); \ } while (0)
Definition at line 457 of file queue.h.
Referenced by move_current_window(), move_current_window_in_container(), reparent_window(), and toggle_floating_mode().
#define CIRCLEQ_INSERT_BEFORE | ( | head, | |||
listelm, | |||||
elm, | |||||
field | ) |
do { \ (elm)->field.cqe_next = (listelm); \ (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \ if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm); \ else \ (listelm)->field.cqe_prev->field.cqe_next = (elm); \ (listelm)->field.cqe_prev = (elm); \ } while (0)
Definition at line 467 of file queue.h.
Referenced by move_current_window_in_container().
#define CIRCLEQ_INSERT_HEAD | ( | head, | |||
elm, | |||||
field | ) |
do { \ (elm)->field.cqe_next = (head)->cqh_first; \ (elm)->field.cqe_prev = CIRCLEQ_END(head); \ if ((head)->cqh_last == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm); \ else \ (head)->cqh_first->field.cqe_prev = (elm); \ (head)->cqh_first = (elm); \ } while (0)
#define CIRCLEQ_INSERT_TAIL | ( | head, | |||
elm, | |||||
field | ) |
do { \ (elm)->field.cqe_next = CIRCLEQ_END(head); \ (elm)->field.cqe_prev = (head)->cqh_last; \ if ((head)->cqh_first == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm); \ else \ (head)->cqh_last->field.cqe_next = (elm); \ (head)->cqh_last = (elm); \ } while (0)
Definition at line 487 of file queue.h.
Referenced by move_current_window(), move_current_window_to_workspace(), reparent_window(), and toggle_floating_mode().
#define CIRCLEQ_LAST | ( | head | ) | ((head)->cqh_last) |
Definition at line 432 of file queue.h.
Referenced by focus_window_in_container().
#define CIRCLEQ_NEXT | ( | elm, | |||
field | ) | ((elm)->field.cqe_next) |
Definition at line 434 of file queue.h.
Referenced by move_current_window_in_container().
#define CIRCLEQ_PREV | ( | elm, | |||
field | ) | ((elm)->field.cqe_prev) |
Definition at line 435 of file queue.h.
Referenced by move_current_window_in_container().
#define CIRCLEQ_REMOVE | ( | head, | |||
elm, | |||||
field | ) |
do { \ if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm)->field.cqe_prev; \ else \ (elm)->field.cqe_next->field.cqe_prev = \ (elm)->field.cqe_prev; \ if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm)->field.cqe_next; \ else \ (elm)->field.cqe_prev->field.cqe_next = \ (elm)->field.cqe_next; \ _Q_INVALIDATE((elm)->field.cqe_prev); \ _Q_INVALIDATE((elm)->field.cqe_next); \ } while (0)
Definition at line 497 of file queue.h.
Referenced by client_remove_from_container(), and move_current_window_in_container().
#define CIRCLEQ_REPLACE | ( | head, | |||
elm, | |||||
elm2, | |||||
field | ) |
do { \ if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \ CIRCLEQ_END(head)) \ (head)->cqh_last = (elm2); \ else \ (elm2)->field.cqe_next->field.cqe_prev = (elm2); \ if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \ CIRCLEQ_END(head)) \ (head)->cqh_first = (elm2); \ else \ (elm2)->field.cqe_prev->field.cqe_next = (elm2); \ _Q_INVALIDATE((elm)->field.cqe_prev); \ _Q_INVALIDATE((elm)->field.cqe_next); \ } while (0)
#define LIST_EMPTY | ( | head | ) | (LIST_FIRST(head) == LIST_END(head)) |
#define LIST_ENTRY | ( | type | ) |
#define LIST_FOREACH | ( | var, | |||
head, | |||||
field | ) |
for((var) = LIST_FIRST(head); \ (var)!= LIST_END(head); \ (var) = LIST_NEXT(var, field))
#define LIST_HEAD | ( | name, | |||
type | ) |
#define LIST_INIT | ( | head | ) |
do { \ LIST_FIRST(head) = LIST_END(head); \ } while (0)
#define LIST_INSERT_AFTER | ( | listelm, | |||
elm, | |||||
field | ) |
#define LIST_INSERT_BEFORE | ( | listelm, | |||
elm, | |||||
field | ) |
#define LIST_INSERT_HEAD | ( | head, | |||
elm, | |||||
field | ) |
#define LIST_REMOVE | ( | elm, | |||
field | ) |
do { \ if ((elm)->field.le_next != NULL) \ (elm)->field.le_next->field.le_prev = \ (elm)->field.le_prev; \ *(elm)->field.le_prev = (elm)->field.le_next; \ _Q_INVALIDATE((elm)->field.le_prev); \ _Q_INVALIDATE((elm)->field.le_next); \ } while (0)
#define LIST_REPLACE | ( | elm, | |||
elm2, | |||||
field | ) |
do { \ if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \ (elm2)->field.le_next->field.le_prev = \ &(elm2)->field.le_next; \ (elm2)->field.le_prev = (elm)->field.le_prev; \ *(elm2)->field.le_prev = (elm2); \ _Q_INVALIDATE((elm)->field.le_prev); \ _Q_INVALIDATE((elm)->field.le_next); \ } while (0)
#define SIMPLEQ_EMPTY | ( | head | ) | (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) |
#define SIMPLEQ_ENTRY | ( | type | ) |
#define SIMPLEQ_FOREACH | ( | var, | |||
head, | |||||
field | ) |
for((var) = SIMPLEQ_FIRST(head); \ (var) != SIMPLEQ_END(head); \ (var) = SIMPLEQ_NEXT(var, field))
#define SIMPLEQ_HEAD | ( | name, | |||
type | ) |
#define SIMPLEQ_HEAD_INITIALIZER | ( | head | ) | { NULL, &(head).sqh_first } |
#define SIMPLEQ_INIT | ( | head | ) |
#define SIMPLEQ_INSERT_AFTER | ( | head, | |||
listelm, | |||||
elm, | |||||
field | ) |
#define SIMPLEQ_INSERT_HEAD | ( | head, | |||
elm, | |||||
field | ) |
#define SIMPLEQ_INSERT_TAIL | ( | head, | |||
elm, | |||||
field | ) |
#define SIMPLEQ_REMOVE_HEAD | ( | head, | |||
field | ) |
#define SLIST_EMPTY | ( | head | ) | (SLIST_FIRST(head) == SLIST_END(head)) |
Definition at line 112 of file queue.h.
Referenced by handle_unmap_notify_event(), load_configuration(), parse_file(), and randr_query_outputs().
#define SLIST_END | ( | head | ) | NULL |
Definition at line 111 of file queue.h.
Referenced by event_is_ignored(), IPC_HANDLER(), move_floating_window_to_workspace(), parse_command(), travel_focus_stack(), and workspace_show().
#define SLIST_ENTRY | ( | type | ) |
#define SLIST_FIRST | ( | head | ) | ((head)->slh_first) |
Definition at line 110 of file queue.h.
Referenced by check_crossing_screen_boundary(), decorate_window(), event_is_ignored(), handle_hints(), handle_unmap_notify_event(), IPC_HANDLER(), load_configuration(), parse_command(), parse_file(), randr_query_outputs(), set_focus(), travel_focus_stack(), and workspace_show().
#define SLIST_FOREACH | ( | var, | |||
head, | |||||
field | ) |
for((var) = SLIST_FIRST(head); \ (var) != SLIST_END(head); \ (var) = SLIST_NEXT(var, field))
Definition at line 115 of file queue.h.
Referenced by client_mark(), event_is_ignored(), floating_toggle_hide(), get_last_focused_client(), get_matching_client(), get_stack_window(), handle_enter_notify(), handle_expose_event(), jump_to_mark(), move_floating_window_to_workspace(), output_change_mode(), parse_file(), render_bars(), render_workspace(), restore_geometry(), set_focus(), switch_mode(), toggle_floating_mode(), travel_focus_stack(), workspace_assign_to(), workspace_height(), workspace_map_clients(), workspace_unmap_clients(), and workspace_update_urgent_flag().
#define SLIST_FOREACH_PREVPTR | ( | var, | |||
varp, | |||||
head, | |||||
field | ) |
for ((varp) = &SLIST_FIRST((head)); \ ((var) = *(varp)) != SLIST_END(head); \ (varp) = &SLIST_NEXT((var), field))
#define SLIST_HEAD | ( | name, | |||
type | ) |
struct name { \ struct type *slh_first; /* first element */ \ }
Definition at line 94 of file queue.h.
Referenced by parse_file().
#define SLIST_HEAD_INITIALIZER | ( | head | ) | { NULL } |
Definition at line 99 of file queue.h.
Referenced by parse_file().
#define SLIST_INIT | ( | head | ) |
{ \ SLIST_FIRST(head) = SLIST_END(head); \ }
Definition at line 128 of file queue.h.
Referenced by initialize_output(), and load_configuration().
#define SLIST_INSERT_AFTER | ( | slistelm, | |||
elm, | |||||
field | ) |
do { \ (elm)->field.sle_next = (slistelm)->field.sle_next; \ (slistelm)->field.sle_next = (elm); \ } while (0)
Definition at line 132 of file queue.h.
Referenced by reparent_window().
#define SLIST_INSERT_HEAD | ( | head, | |||
elm, | |||||
field | ) |
do { \ (elm)->field.sle_next = (head)->slh_first; \ (head)->slh_first = (elm); \ } while (0)
Definition at line 137 of file queue.h.
Referenced by floating_assign_to_workspace(), load_configuration(), move_current_window(), move_current_window_to_workspace(), parse_file(), randr_query_outputs(), reparent_window(), set_focus(), SLIST_HEAD(), switch_layout_mode(), and yyparse().
#define SLIST_NEXT | ( | elm, | |||
field | ) | ((elm)->field.sle_next) |
Definition at line 113 of file queue.h.
Referenced by event_is_ignored().
#define SLIST_REMOVE | ( | head, | |||
elm, | |||||
type, | |||||
field | ) |
do { \ if ((head)->slh_first == (elm)) { \ SLIST_REMOVE_HEAD((head), field); \ } else { \ struct type *curelm = (head)->slh_first; \ \ while (curelm->field.sle_next != (elm)) \ curelm = curelm->field.sle_next; \ curelm->field.sle_next = \ curelm->field.sle_next->field.sle_next; \ _Q_INVALIDATE((elm)->field.sle_next); \ } \ } while (0)
Definition at line 150 of file queue.h.
Referenced by client_remove_from_container(), event_is_ignored(), floating_assign_to_workspace(), handle_unmap_notify_event(), leave_stack_mode(), load_configuration(), and set_focus().
#define SLIST_REMOVE_HEAD | ( | head, | |||
field | ) |
do { \ (head)->slh_first = (head)->slh_first->field.sle_next; \ } while (0)
Definition at line 146 of file queue.h.
Referenced by parse_file(), and randr_query_outputs().
#define SLIST_REMOVE_NEXT | ( | head, | |||
elm, | |||||
field | ) |
#define TAILQ_EMPTY | ( | head | ) | (TAILQ_FIRST(head) == TAILQ_END(head)) |
Definition at line 332 of file queue.h.
Referenced by load_configuration(), and randr_query_outputs().
#define TAILQ_END | ( | head | ) | NULL |
Definition at line 325 of file queue.h.
Referenced by button_press_bar(), client_set_below_floating(), floating_focus_direction(), get_binding(), next_previous_workspace(), randr_query_outputs(), render_container(), and toggle_floating_mode().
#define TAILQ_ENTRY | ( | type | ) |
#define TAILQ_FIRST | ( | head | ) | ((head)->tqh_first) |
Definition at line 324 of file queue.h.
Referenced by client_set_below_floating(), load_configuration(), main(), next_previous_workspace(), and render_container().
#define TAILQ_FOREACH | ( | var, | |||
head, | |||||
field | ) |
for((var) = TAILQ_FIRST(head); \ (var) != TAILQ_END(head); \ (var) = TAILQ_NEXT(var, field))
Definition at line 335 of file queue.h.
Referenced by button_press_bar(), client_enter_fullscreen(), client_leave_fullscreen(), client_mark(), ewmh_update_workarea(), floating_toggle_hide(), get_binding(), get_first_output(), get_first_workspace_for_output(), get_matching_client(), get_output_by_id(), get_output_by_name(), get_output_containing(), get_output_most(), get_screen_at(), grab_all_keys(), handle_expose_event(), handle_signal(), handle_unmap_notify_event(), init_workspaces(), initialize_output(), initialize_xinerama(), IPC_HANDLER(), ipc_receive_message(), ipc_send_event(), ipc_shutdown(), jump_to_mark(), load_configuration(), main(), output_change_mode(), randr_query_outputs(), render_internal_bar(), render_layout(), render_workspace(), reparent_window(), restore_geometry(), table_get(), table_remove(), TAILQ_HEAD(), translate_keysyms(), workspace_get(), workspace_map_clients(), and yyparse().
#define TAILQ_FOREACH_REVERSE | ( | var, | |||
head, | |||||
headname, | |||||
field | ) |
for((var) = TAILQ_LAST(head, headname); \ (var) != TAILQ_END(head); \ (var) = TAILQ_PREV(var, headname, field))
#define TAILQ_HEAD | ( | name, | |||
type | ) |
#define TAILQ_HEAD_INITIALIZER | ( | head | ) | { NULL, &(head).tqh_first } |
#define TAILQ_INIT | ( | head | ) |
do { \ (head)->tqh_first = NULL; \ (head)->tqh_last = &(head)->tqh_first; \ } while (0)
Definition at line 348 of file queue.h.
Referenced by init_table(), load_configuration(), workspace_get(), and yyparse().
#define TAILQ_INSERT_AFTER | ( | head, | |||
listelm, | |||||
elm, | |||||
field | ) |
do { \ if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ (elm)->field.tqe_next->field.tqe_prev = \ &(elm)->field.tqe_next; \ else \ (head)->tqh_last = &(elm)->field.tqe_next; \ (listelm)->field.tqe_next = (elm); \ (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ } while (0)
#define TAILQ_INSERT_BEFORE | ( | listelm, | |||
elm, | |||||
field | ) |
#define TAILQ_INSERT_HEAD | ( | head, | |||
elm, | |||||
field | ) |
do { \ if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ (head)->tqh_first->field.tqe_prev = \ &(elm)->field.tqe_next; \ else \ (head)->tqh_last = &(elm)->field.tqe_next; \ (head)->tqh_first = (elm); \ (elm)->field.tqe_prev = &(head)->tqh_first; \ } while (0)
Definition at line 353 of file queue.h.
Referenced by query_screens().
#define TAILQ_INSERT_TAIL | ( | head, | |||
elm, | |||||
field | ) |
do { \ (elm)->field.tqe_next = NULL; \ (elm)->field.tqe_prev = (head)->tqh_last; \ *(head)->tqh_last = (elm); \ (head)->tqh_last = &(elm)->field.tqe_next; \ } while (0)
Definition at line 363 of file queue.h.
Referenced by disable_randr(), floating_assign_to_workspace(), handle_output(), init_table(), ipc_new_client(), query_screens(), reparent_window(), table_put(), TAILQ_HEAD(), toggle_floating_mode(), workspace_get(), and yyparse().
#define TAILQ_LAST | ( | head, | |||
headname | ) | (*(((struct headname *)((head)->tqh_last))->tqh_last)) |
Definition at line 327 of file queue.h.
Referenced by next_previous_workspace(), and workspace_get().
#define TAILQ_NEXT | ( | elm, | |||
field | ) | ((elm)->field.tqe_next) |
Definition at line 326 of file queue.h.
Referenced by button_press_bar(), floating_focus_direction(), next_previous_workspace(), and randr_query_outputs().
#define TAILQ_PREV | ( | elm, | |||
headname, | |||||
field | ) | (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) |
Definition at line 330 of file queue.h.
Referenced by button_press_bar(), floating_focus_direction(), and next_previous_workspace().
#define TAILQ_REMOVE | ( | head, | |||
elm, | |||||
field | ) |
do { \ if (((elm)->field.tqe_next) != NULL) \ (elm)->field.tqe_next->field.tqe_prev = \ (elm)->field.tqe_prev; \ else \ (head)->tqh_last = (elm)->field.tqe_prev; \ *(elm)->field.tqe_prev = (elm)->field.tqe_next; \ _Q_INVALIDATE((elm)->field.tqe_prev); \ _Q_INVALIDATE((elm)->field.tqe_next); \ } while (0)
Definition at line 387 of file queue.h.
Referenced by floating_assign_to_workspace(), handle_unmap_notify_event(), ipc_receive_message(), load_configuration(), table_remove(), and toggle_floating_mode().
#define TAILQ_REPLACE | ( | head, | |||
elm, | |||||
elm2, | |||||
field | ) |
do { \ if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \ (elm2)->field.tqe_next->field.tqe_prev = \ &(elm2)->field.tqe_next; \ else \ (head)->tqh_last = &(elm2)->field.tqe_next; \ (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \ *(elm2)->field.tqe_prev = (elm2); \ _Q_INVALIDATE((elm)->field.tqe_prev); \ _Q_INVALIDATE((elm)->field.tqe_next); \ } while (0)