@@ -22,7 +22,7 @@
* ULIST_ITER_INIT(&uiter);
*
* while ((elem = ulist_next(ulist, &uiter)) {
- * for (all child nodes n in elem)
+ * for (all child nodes n in elem)
* ulist_add(ulist, n);
* do something useful with the node;
* }
@@ -266,11 +266,11 @@ struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter)
return NULL;
if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes)
return NULL;
- if (uiter->cur_list) {
+ if (uiter->cur_list)
uiter->cur_list = uiter->cur_list->next;
- } else {
+ else
uiter->cur_list = ulist->nodes.next;
- }
+
node = list_entry(uiter->cur_list, struct ulist_node, list);
return node;
}