/**
* Compute the number of nodes in @l. Beware of linear time complexity.
**/
-static inline uns clist_size(clist *l)
+static inline uint clist_size(clist *l)
{
- uns i = 0;
+ uint i = 0;
CLIST_FOR_EACH(cnode *, n, *l)
i++;
return i;
* previous and next pointers equal to NULL. Returns 0 or 1.
*
* Nodes initialized to all zeroes are unlinked, inserting a node anywhere in a list
- * makes it linked. Normal removal functions like clist_remove() do not mark nodes
- * as unlinked, you need to call clist_unlink() instead.
+ * makes it linked. Normal removal functions like @clist_remove() do not mark nodes
+ * as unlinked, you need to call @clist_unlink() instead.
**/
static inline int clist_is_linked(cnode *n)
{