|
|
@ -381,7 +381,8 @@ struct { \
|
|
|
|
used to link entries of this list together.
|
|
|
|
used to link entries of this list together.
|
|
|
|
|
|
|
|
|
|
|
|
Note: The link field in the appended entry is \b not modified, so if it is
|
|
|
|
Note: The link field in the appended entry is \b not modified, so if it is
|
|
|
|
actually the head of a list itself, the entire list will be appended.
|
|
|
|
actually the head of a list itself, the entire list will be appended
|
|
|
|
|
|
|
|
temporarily (until the next AST_LIST_INSERT_TAIL is performed).
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
#define AST_LIST_INSERT_TAIL(head, elm, field) do { \
|
|
|
|
#define AST_LIST_INSERT_TAIL(head, elm, field) do { \
|
|
|
|
if (!(head)->first) { \
|
|
|
|
if (!(head)->first) { \
|
|
|
@ -431,7 +432,7 @@ struct { \
|
|
|
|
while (curelm->field.next != (elm)) \
|
|
|
|
while (curelm->field.next != (elm)) \
|
|
|
|
curelm = curelm->field.next; \
|
|
|
|
curelm = curelm->field.next; \
|
|
|
|
curelm->field.next = (elm)->field.next; \
|
|
|
|
curelm->field.next = (elm)->field.next; \
|
|
|
|
if ((head)->last == curelm->field.next) \
|
|
|
|
if ((head)->last == (elm)) \
|
|
|
|
(head)->last = curelm; \
|
|
|
|
(head)->last = curelm; \
|
|
|
|
} \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
} while (0)
|
|
|
|