#endif
/* Returns member, or NULL if at end of list. */
-static inline void *list_entry_or_null(struct list_head *h,
- struct list_node *n,
+static inline void *list_entry_or_null(const struct list_head *h,
+ const struct list_node *n,
size_t off)
{
if (n == &h->n)
{
struct parent parent;
struct child c1, c2, c3;
+ const struct parent *p;
+ const struct child *c;
- plan_tests(12);
+ plan_tests(20);
parent.num_children = 0;
list_head_init(&parent.children);
ok1(list_prev(&parent.children, &c2, list) == &c1);
ok1(list_next(&parent.children, &c3, list) == NULL);
ok1(list_prev(&parent.children, &c3, list) == &c2);
+
+ /* Const variants */
+ p = &parent;
+ c = &c2;
+ ok1(list_next(&p->children, &c1, list) == &c2);
+ ok1(list_prev(&p->children, &c1, list) == NULL);
+ ok1(list_next(&p->children, c, list) == &c3);
+ ok1(list_prev(&p->children, c, list) == &c1);
+ ok1(list_next(&parent.children, c, list) == &c3);
+ ok1(list_prev(&parent.children, c, list) == &c1);
+ ok1(list_next(&p->children, &c3, list) == NULL);
+ ok1(list_prev(&p->children, &c3, list) == &c2);
+
return exit_status();
}