i3
Defines
include/queue.h File Reference
This graph shows which files directly or indirectly include this file:

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 Documentation

#define _Q_INVALIDATE (   a)

Definition at line 88 of file queue.h.

#define CIRCLEQ_EMPTY (   head)    (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))

Definition at line 449 of file queue.h.

#define CIRCLEQ_END (   head)    ((void *)(head))

Definition at line 446 of file queue.h.

Referenced by x_push_changes().

#define CIRCLEQ_ENTRY (   type)
Value:
struct {                                                                \
        struct type *cqe_next;          /* next element */              \
        struct type *cqe_prev;          /* previous element */          \
}

Definition at line 435 of file queue.h.

#define CIRCLEQ_FIRST (   head)    ((head)->cqh_first)

Definition at line 444 of file queue.h.

#define CIRCLEQ_FOREACH (   var,
  head,
  field 
)
Value:
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 
)
Value:
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 
)
Value:
struct name {                                                           \
        struct type *cqh_first;         /* first element */             \
        struct type *cqh_last;          /* last element */              \
}

Definition at line 426 of file queue.h.

#define CIRCLEQ_HEAD_INITIALIZER (   head)    { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }

Definition at line 432 of file queue.h.

#define CIRCLEQ_INIT (   head)
Value:
do {                                            \
        (head)->cqh_first = CIRCLEQ_END(head);                          \
        (head)->cqh_last = CIRCLEQ_END(head);                           \
} while (0)

Definition at line 465 of file queue.h.

#define CIRCLEQ_INSERT_AFTER (   head,
  listelm,
  elm,
  field 
)
Value:
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 470 of file queue.h.

#define CIRCLEQ_INSERT_BEFORE (   head,
  listelm,
  elm,
  field 
)
Value:
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 480 of file queue.h.

#define CIRCLEQ_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
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 
)
Value:
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)

Definition at line 445 of file queue.h.

#define CIRCLEQ_NEXT (   elm,
  field 
)    ((elm)->field.cqe_next)

Definition at line 447 of file queue.h.

#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 
)
Value:
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 
)
Value:
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)

Definition at line 525 of file queue.h.

#define LIST_EMPTY (   head)    (LIST_FIRST(head) == LIST_END(head))

Definition at line 186 of file queue.h.

#define LIST_END (   head)    NULL

Definition at line 185 of file queue.h.

#define LIST_ENTRY (   type)
Value:
struct {                                                                \
        struct type *le_next;   /* next element */                      \
        struct type **le_prev;  /* address of previous next element */  \
}

Definition at line 175 of file queue.h.

#define LIST_FIRST (   head)    ((head)->lh_first)

Definition at line 184 of file queue.h.

#define LIST_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = LIST_FIRST(head);                                   \
            (var)!= LIST_END(head);                                     \
            (var) = LIST_NEXT(var, field))

Definition at line 189 of file queue.h.

#define LIST_HEAD (   name,
  type 
)
Value:
struct name {                                                           \
        struct type *lh_first;  /* first element */                     \
}

Definition at line 167 of file queue.h.

#define LIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 172 of file queue.h.

#define LIST_INIT (   head)
Value:
do {                                            \
        LIST_FIRST(head) = LIST_END(head);                              \
} while (0)

Definition at line 197 of file queue.h.

#define LIST_INSERT_AFTER (   listelm,
  elm,
  field 
)
Value:
do {                    \
        if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)  \
                (listelm)->field.le_next->field.le_prev =               \
                    &(elm)->field.le_next;                              \
        (listelm)->field.le_next = (elm);                               \
        (elm)->field.le_prev = &(listelm)->field.le_next;               \
} while (0)

Definition at line 201 of file queue.h.

#define LIST_INSERT_BEFORE (   listelm,
  elm,
  field 
)
Value:
do {                    \
        (elm)->field.le_prev = (listelm)->field.le_prev;                \
        (elm)->field.le_next = (listelm);                               \
        *(listelm)->field.le_prev = (elm);                              \
        (listelm)->field.le_prev = &(elm)->field.le_next;               \
} while (0)

Definition at line 209 of file queue.h.

#define LIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do {                            \
        if (((elm)->field.le_next = (head)->lh_first) != NULL)          \
                (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
        (head)->lh_first = (elm);                                       \
        (elm)->field.le_prev = &(head)->lh_first;                       \
} while (0)

Definition at line 216 of file queue.h.

#define LIST_NEXT (   elm,
  field 
)    ((elm)->field.le_next)

Definition at line 187 of file queue.h.

#define LIST_REMOVE (   elm,
  field 
)
Value:
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)

Definition at line 223 of file queue.h.

#define LIST_REPLACE (   elm,
  elm2,
  field 
)
Value:
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)

Definition at line 232 of file queue.h.

#define SIMPLEQ_EMPTY (   head)    (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))

Definition at line 264 of file queue.h.

#define SIMPLEQ_END (   head)    NULL

Definition at line 263 of file queue.h.

#define SIMPLEQ_ENTRY (   type)
Value:
struct {                                                                \
        struct type *sqe_next;  /* next element */                      \
}

Definition at line 254 of file queue.h.

#define SIMPLEQ_FIRST (   head)    ((head)->sqh_first)

Definition at line 262 of file queue.h.

#define SIMPLEQ_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = SIMPLEQ_FIRST(head);                                \
            (var) != SIMPLEQ_END(head);                                 \
            (var) = SIMPLEQ_NEXT(var, field))

Definition at line 267 of file queue.h.

#define SIMPLEQ_HEAD (   name,
  type 
)
Value:
struct name {                                                           \
        struct type *sqh_first; /* first element */                     \
        struct type **sqh_last; /* addr of last next element */         \
}

Definition at line 245 of file queue.h.

#define SIMPLEQ_HEAD_INITIALIZER (   head)    { NULL, &(head).sqh_first }

Definition at line 251 of file queue.h.

#define SIMPLEQ_INIT (   head)
Value:
do {                                            \
        (head)->sqh_first = NULL;                                       \
        (head)->sqh_last = &(head)->sqh_first;                          \
} while (0)

Definition at line 275 of file queue.h.

#define SIMPLEQ_INSERT_AFTER (   head,
  listelm,
  elm,
  field 
)
Value:
do {            \
        if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
                (head)->sqh_last = &(elm)->field.sqe_next;              \
        (listelm)->field.sqe_next = (elm);                              \
} while (0)

Definition at line 292 of file queue.h.

#define SIMPLEQ_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do {                    \
        if (((elm)->field.sqe_next = (head)->sqh_first) == NULL)        \
                (head)->sqh_last = &(elm)->field.sqe_next;              \
        (head)->sqh_first = (elm);                                      \
} while (0)

Definition at line 280 of file queue.h.

#define SIMPLEQ_INSERT_TAIL (   head,
  elm,
  field 
)
Value:
do {                    \
        (elm)->field.sqe_next = NULL;                                   \
        *(head)->sqh_last = (elm);                                      \
        (head)->sqh_last = &(elm)->field.sqe_next;                      \
} while (0)

Definition at line 286 of file queue.h.

#define SIMPLEQ_NEXT (   elm,
  field 
)    ((elm)->field.sqe_next)

Definition at line 265 of file queue.h.

#define SIMPLEQ_REMOVE_HEAD (   head,
  field 
)
Value:
do {                    \
        if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
                (head)->sqh_last = &(head)->sqh_first;                  \
} while (0)

Definition at line 298 of file queue.h.

#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)
Value:
struct {                                                                \
        struct type *sle_next;  /* next element */                      \
}

Definition at line 102 of file queue.h.

#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 
)
Value:
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 
)
Value:
for ((varp) = &SLIST_FIRST((head));                             \
            ((var) = *(varp)) != SLIST_END(head);                       \
            (varp) = &SLIST_NEXT((var), field))

Definition at line 120 of file queue.h.

#define SLIST_HEAD (   name,
  type 
)
Value:
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)
Value:
{                                               \
        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 
)
Value:
do {                    \
        (elm)->field.sle_next = (slistelm)->field.sle_next;             \
        (slistelm)->field.sle_next = (elm);                             \
} while (0)

Definition at line 132 of file queue.h.

#define SLIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
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(), and SLIST_HEAD().

#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 
)
Value:
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 
)
Value:
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 
)
Value:
do {                    \
        (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next;  \
} while (0)

Definition at line 142 of file queue.h.

#define TAILQ_EMPTY (   head)    (TAILQ_FIRST(head) == TAILQ_END(head))
#define TAILQ_END (   head)    NULL
#define TAILQ_ENTRY (   type)
Value:
struct {                                                                \
        struct type *tqe_next;  /* next element */                      \
        struct type **tqe_prev; /* address of previous next element */  \
}

Definition at line 315 of file queue.h.

#define TAILQ_FIRST (   head)    ((head)->tqh_first)
#define TAILQ_FOREACH (   var,
  head,
  field 
)
#define TAILQ_FOREACH_REVERSE (   var,
  head,
  headname,
  field 
)
Value:
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 render_con(), and workspace_prev().

#define TAILQ_HEAD (   name,
  type 
)
Value:
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)
Value:
do {                                            \
        (head)->tqh_first = NULL;                                       \
        (head)->tqh_last = &(head)->tqh_first;                          \
} while (0)

Definition at line 348 of file queue.h.

Referenced by con_new(), and load_configuration().

#define TAILQ_INSERT_AFTER (   head,
  listelm,
  elm,
  field 
)
Value:
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 
)
Value:
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 
)
Value:
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(), handle_output(), insert_con_into(), query_screens(), tree_flatten(), and tree_move().

#define TAILQ_INSERT_TAIL (   head,
  elm,
  field 
)
Value:
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(), con_attach(), con_get_fullscreen_con(), con_new(), disable_randr(), floating_disable(), floating_enable(), floating_raise_con(), handle_output(), ipc_new_client(), json_start_map(), migrate_i3bar_exec(), output_init_con(), query_screens(), start_application(), and tree_flatten().

#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)
#define TAILQ_PREV (   elm,
  headname,
  field 
)    (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
#define TAILQ_REMOVE (   head,
  elm,
  field 
)
Value:
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 con_detach(), con_focus(), con_get_fullscreen_con(), floating_disable(), floating_enable(), floating_raise_con(), ipc_receive_message(), ipc_shutdown(), load_configuration(), manage_window(), parse_file(), startup_monitor_event(), tree_close(), tree_flatten(), and tree_move().

#define TAILQ_REPLACE (   head,
  elm,
  elm2,
  field 
)
Value:
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 
)
Value:
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().