i3
|
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 | TAILQ_SWAP(first, second, head, 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 _Q_INVALIDATE | ( | a | ) |
#define CIRCLEQ_EMPTY | ( | head | ) | (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) |
#define CIRCLEQ_END | ( | head | ) | ((void *)(head)) |
Definition at line 446 of file queue.h.
Referenced by x_push_changes().
#define CIRCLEQ_ENTRY | ( | type | ) |
#define CIRCLEQ_FIRST | ( | head | ) | ((head)->cqh_first) |
#define CIRCLEQ_FOREACH | ( | var, | |
head, | |||
field | |||
) |
for((var) = CIRCLEQ_FIRST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_NEXT(var, field))
Definition at line 452 of file queue.h.
Referenced by CIRCLEQ_HEAD(), and x_push_changes().
#define CIRCLEQ_FOREACH_REVERSE | ( | var, | |
head, | |||
field | |||
) |
for((var) = CIRCLEQ_LAST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_PREV(var, field))
Definition at line 457 of file queue.h.
Referenced by x_mask_event_mask(), and x_push_changes().
#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)
#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)
#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)
#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)
Definition at line 490 of file queue.h.
Referenced by x_con_init(), and x_raise_con().
#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 500 of file queue.h.
Referenced by x_push_changes().
#define CIRCLEQ_LAST | ( | head | ) | ((head)->cqh_last) |
#define CIRCLEQ_NEXT | ( | elm, | |
field | |||
) | ((elm)->field.cqe_next) |
#define CIRCLEQ_PREV | ( | elm, | |
field | |||
) | ((elm)->field.cqe_prev) |
Definition at line 448 of file queue.h.
Referenced by x_push_changes().
#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 510 of file queue.h.
Referenced by x_con_kill(), x_push_changes(), and x_raise_con().
#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_FIRST | ( | head | ) | ((head)->lh_first) |
#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_HEAD_INITIALIZER | ( | head | ) | { NULL } |
#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 | |||
) |
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_END | ( | head | ) | NULL |
#define SIMPLEQ_ENTRY | ( | type | ) |
#define SIMPLEQ_FIRST | ( | head | ) | ((head)->sqh_first) |
#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_NEXT | ( | elm, | |
field | |||
) | ((elm)->field.sqe_next) |
#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 load_configuration(), and parse_file().
#define SLIST_END | ( | head | ) | NULL |
Definition at line 111 of file queue.h.
Referenced by event_is_ignored().
#define SLIST_ENTRY | ( | type | ) |
#define SLIST_FIRST | ( | head | ) | ((head)->slh_first) |
Definition at line 110 of file queue.h.
Referenced by event_is_ignored(), load_configuration(), and parse_file().
#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 event_is_ignored(), parse_file(), and switch_mode().
#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 load_configuration().
#define SLIST_INSERT_AFTER | ( | slistelm, | |
elm, | |||
field | |||
) |
#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 load_configuration(), parse_file(), SLIST_HEAD(), 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 event_is_ignored(), and load_configuration().
#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().
#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 _tree_next(), _workspace_show(), cmd_criteria_init(), con_attach(), con_descend_focused(), con_get_fullscreen_con(), con_is_leaf(), con_next_focused(), con_on_remove_child(), con_set_layout(), floating_enable(), init_ws_for_output(), ipc_shutdown(), json_end_array(), load_configuration(), randr_query_outputs(), render_con(), startup_monitor_event(), tree_flatten(), ws_force_orientation(), and x_deco_recurse().
#define TAILQ_END | ( | head | ) | NULL |
Definition at line 325 of file queue.h.
Referenced by cmd_criteria_match_windows(), cmd_resize_tiling_direction(), con_attach(), con_get_next(), con_next_focused(), con_set_layout(), floating_enable(), get_binding(), level_down(), randr_query_outputs(), and tiling_resize_for_border().
#define TAILQ_ENTRY | ( | type | ) |
#define TAILQ_FIRST | ( | head | ) | ((head)->tqh_first) |
Definition at line 324 of file queue.h.
Referenced by _tree_next(), cmd_criteria_init(), cmd_criteria_match_windows(), cmd_focus_window_mode(), cmd_move_workspace_to_output(), con_attach(), con_descend_direction(), con_descend_focused(), con_get_fullscreen_con(), con_minimum_size(), con_next_focused(), con_set_layout(), floating_enable(), floating_maybe_reassign_ws(), handle_motion_notify(), init_ws_for_output(), ipc_shutdown(), json_end_array(), level_down(), load_configuration(), manage_window(), output_change_mode(), parse_file(), randr_query_outputs(), render_con(), scratchpad_move(), scratchpad_show(), tree_close(), tree_flatten(), tree_restore(), ws_force_orientation(), x_draw_decoration(), and x_push_node().
#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 _get_sticky(), _is_con_mapped(), _workspace_show(), assignment_for(), check_for_duplicate_bindings(), cmd_border(), cmd_criteria_init(), cmd_criteria_match_windows(), cmd_floating(), cmd_focus(), cmd_focus_output(), cmd_focus_window_mode(), cmd_fullscreen(), cmd_kill(), cmd_layout(), cmd_mark(), cmd_move_con_to_output(), cmd_move_con_to_workspace(), cmd_move_con_to_workspace_name(), cmd_move_con_to_workspace_number(), cmd_move_scratchpad(), cmd_move_workspace_to_output(), cmd_rename_workspace(), cmd_resize_tiling_width_height(), cmd_scratchpad_show(), cmd_workspace_number(), con_attach(), con_by_frame_id(), con_by_window_id(), con_descend_tiling_focused(), con_fix_percent(), con_for_window(), con_get_fullscreen_con(), con_minimum_size(), con_num_children(), create_workspace_on_output(), dump_node(), ewmh_update_current_desktop(), ewmh_update_workarea(), floating_enable(), get_binding(), get_first_output(), get_output_by_id(), get_output_by_name(), get_output_containing(), get_output_most(), get_output_next(), get_screen_at(), get_urgency_flag(), grab_all_keys(), handle_button_press(), handle_enter_notify(), handle_motion_notify(), handle_signal(), init_ws_for_output(), IPC_HANDLER(), ipc_receive_message(), ipc_send_event(), json_end_array(), load_configuration(), main(), mark_unmapped(), match_matches_window(), output_change_mode(), output_get_content(), output_init_con(), randr_query_outputs(), render_con(), render_l_output(), restore_geometry(), run_assignments(), startup_monitor_event(), startup_workspace_for_window(), TAILQ_HEAD(), total_outputs_dimensions(), translate_keysyms(), workspace_get(), workspace_next(), workspace_reassign_sticky(), x_deco_recurse(), x_push_node(), x_push_node_unmaps(), xinerama_init(), 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))
Definition at line 340 of file queue.h.
Referenced by json_end_array(), render_con(), and workspace_prev().
#define TAILQ_HEAD | ( | name, | |
type | |||
) |
struct name { \ struct type *tqh_first; /* first element */ \ struct type **tqh_last; /* addr of last next element */ \ }
Definition at line 306 of file queue.h.
Referenced by con_get_fullscreen_con().
#define TAILQ_HEAD_INITIALIZER | ( | head | ) | { NULL, &(head).tqh_first } |
Definition at line 312 of file queue.h.
Referenced by con_get_fullscreen_con().
#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 cmd_criteria_init(), cmd_criteria_match_windows(), con_new(), load_configuration(), 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)
Definition at line 370 of file queue.h.
Referenced by con_attach(), insert_con_into(), and manage_window().
#define TAILQ_INSERT_BEFORE | ( | listelm, | |
elm, | |||
field | |||
) |
do { \ (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ (elm)->field.tqe_next = (listelm); \ *(listelm)->field.tqe_prev = (elm); \ (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \ } while (0)
Definition at line 380 of file queue.h.
Referenced by con_attach(), insert_con_into(), and tree_flatten().
#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 con_attach(), con_focus(), fake_outputs_init(), handle_output(), insert_con_into(), json_end_array(), query_screens(), tree_flatten(), tree_move(), and tree_restore().
#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 attach_to_workspace(), cmd_criteria_init(), cmd_criteria_match_windows(), con_attach(), con_get_fullscreen_con(), con_new(), disable_randr(), fake_outputs_init(), floating_enable(), floating_raise_con(), handle_output(), ipc_new_client(), json_int(), migrate_i3bar_exec(), output_init_con(), query_screens(), start_application(), TAILQ_HEAD(), tree_flatten(), and yyparse().
#define TAILQ_LAST | ( | head, | |
headname | |||
) | (*(((struct headname *)((head)->tqh_last))->tqh_last)) |
Definition at line 327 of file queue.h.
Referenced by _tree_next(), and con_descend_direction().
#define TAILQ_NEXT | ( | elm, | |
field | |||
) | ((elm)->field.tqe_next) |
Definition at line 326 of file queue.h.
Referenced by _tree_next(), cmd_criteria_match_windows(), cmd_resize_tiling_direction(), con_attach(), con_get_next(), con_next_focused(), init_ws_for_output(), parse_file(), randr_query_outputs(), route_click(), scratchpad_move(), tiling_resize_for_border(), tree_close(), tree_flatten(), tree_move(), workspace_next(), workspace_next_on_output(), and x_draw_decoration().
#define TAILQ_PREV | ( | elm, | |
headname, | |||
field | |||
) | (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) |
Definition at line 330 of file queue.h.
Referenced by _tree_next(), cmd_resize_tiling_direction(), con_get_next(), con_next_focused(), route_click(), tiling_resize_for_border(), tree_move(), workspace_prev(), and workspace_prev_on_output().
#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 cmd_criteria_init(), con_detach(), con_focus(), con_get_fullscreen_con(), floating_disable(), floating_enable(), floating_raise_con(), ipc_receive_message(), ipc_shutdown(), json_end_array(), load_configuration(), manage_window(), parse_file(), startup_monitor_event(), tree_close(), tree_flatten(), tree_move(), and tree_restore().
#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)
Definition at line 398 of file queue.h.
Referenced by tree_split().
#define TAILQ_SWAP | ( | first, | |
second, | |||
head, | |||
field | |||
) |
do { \ *((first)->field.tqe_prev) = (second); \ (second)->field.tqe_prev = (first)->field.tqe_prev; \ (first)->field.tqe_prev = &((second)->field.tqe_next); \ (first)->field.tqe_next = (second)->field.tqe_next; \ if ((second)->field.tqe_next) \ (second)->field.tqe_next->field.tqe_prev = &((first)->field.tqe_next); \ (second)->field.tqe_next = first; \ if ((head)->tqh_last == &((second)->field.tqe_next)) \ (head)->tqh_last = &((first)->field.tqe_next); \ } while (0)
Definition at line 411 of file queue.h.
Referenced by tree_move().