X-Git-Url: http://git.ozlabs.org/?a=blobdiff_plain;f=ccan%2Ftlist%2Ftlist.h;h=37882ee7bbdcc62f0eaa38097a3c9b66eacc05fa;hb=78b06543e80fc76b953b6a65684dce312da7e660;hp=937a834c0184fb4d54928ca57db9668a929b1f8c;hpb=919b97d6e573eb794d7819f1af8da29023d6b193;p=ccan diff --git a/ccan/tlist/tlist.h b/ccan/tlist/tlist.h index 937a834c..37882ee7 100644 --- a/ccan/tlist/tlist.h +++ b/ccan/tlist/tlist.h @@ -9,17 +9,18 @@ * @suffix: the name to use (struct tlist_@suffix) * @type: the type the list will contain (void for any type) * - * This declares a structure "struct tlist_@suffix" to use for - * lists containing this type. The actual list can be accessed using - * ".raw" or tlist_raw(). + * This declares a structure "struct tlist_@suffix" to use for lists + * containing this type. The actual list can be accessed using + * tlist_raw(). For maximum portability, place tlists embedded in + * structures as the last member. * * Example: * // Defines struct tlist_children * TLIST_TYPE(children, struct child); * struct parent { * const char *name; - * struct tlist_children children; * unsigned int num_children; + * struct tlist_children children; * }; * * struct child { @@ -29,8 +30,7 @@ */ #define TLIST_TYPE(suffix, type) \ struct tlist_##suffix { \ - struct list_head raw; \ - TCON(type *canary); \ + TCON_WRAP(struct list_head, type *canary); \ } /** @@ -45,7 +45,7 @@ * Example: * static struct tlist_children my_list = TLIST_INIT(my_list); */ -#define TLIST_INIT(name) { LIST_HEAD_INIT(name.raw) } +#define TLIST_INIT(name) TCON_WRAP_INIT(LIST_HEAD_INIT(*tcon_unwrap(&name))) /** * tlist_check - check head of a list for consistency @@ -74,7 +74,7 @@ * } */ #define tlist_check(h, abortstr) \ - list_check(&(h)->raw, (abortstr)) + list_check(tcon_unwrap(h), (abortstr)) /** * tlist_init - initialize a tlist @@ -87,7 +87,7 @@ * tlist_init(&parent->children); * parent->num_children = 0; */ -#define tlist_init(h) list_head_init(&(h)->raw) +#define tlist_init(h) list_head_init(tcon_unwrap(h)) /** * tlist_raw - unwrap the typed list and check the type @@ -98,7 +98,7 @@ * variable is of an unexpected type. It is used internally where we * need to access the raw underlying list. */ -#define tlist_raw(h, expr) (&tcon_check((h), canary, (expr))->raw) +#define tlist_raw(h, expr) tcon_unwrap(tcon_check((h), canary, (expr))) /** * tlist_add - add an entry at the start of a linked list. @@ -173,7 +173,7 @@ * Example: * assert(tlist_empty(&parent->children) == (parent->num_children == 0)); */ -#define tlist_empty(h) list_empty(&(h)->raw) +#define tlist_empty(h) list_empty(tcon_unwrap(h)) /** * tlist_top - get the first entry in a list @@ -190,7 +190,7 @@ */ #define tlist_top(h, member) \ ((tcon_type((h), canary)) \ - list_top_(&(h)->raw, \ + list_top_(tcon_unwrap((h)), \ (char *)(&(h)->_tcon[0].canary->member) - \ (char *)((h)->_tcon[0].canary))) @@ -209,10 +209,34 @@ */ #define tlist_tail(h, member) \ ((tcon_type((h), canary)) \ - list_tail_(&(h)->raw, \ + list_tail_(tcon_unwrap(h), \ (char *)(&(h)->_tcon[0].canary->member) - \ (char *)((h)->_tcon[0].canary))) +/** + * tlist_next - get the next entry in a list + * @h: the tlist + * @n: the list element + * @member: the list_node member of the type + * + * Returns the element of list @h immediately after @n, or NULL, if @n + * is the last element in the list. + */ +#define tlist_next(h, n, member) \ + list_next(tlist_raw((h), (n)), (n), member) + +/** + * tlist_prev - get the previous entry in a list + * @h: the tlist + * @n: the list element + * @member: the list_node member of the type + * + * Returns the element of list @h immediately before @n, or NULL, if + * @n is the first element in the list. + */ +#define tlist_prev(h, n, member) \ + list_prev(tlist_raw((h), (n)), (n), member) + /** * tlist_for_each - iterate through a list. * @h: the tlist