commit - 00dfcb9257905221d15c8cdf62614113ecc07057
commit + 191379307b0c8d7c44e8b958cce3288b86b54d7e
blob - eb9d8bd3823486c3d3913e5b12a23435f511f328
blob + 9f0c3c9a7ab7018ee59cef631cc0d19eeb453e01
--- lib/commit_graph.c
+++ lib/commit_graph.c
}
/*
- * If a child node is known, being looping over the list there
- * instead of from the list head.
- * All parent commits *should* appear before their children unless
- * commit timestamps are broken (in which case the ordering of
- * commits will be broken in some way in any case).
+ * If a child node is known, begin looping over the list there
+ * instead of beginning from the list head. Parent commits are
+ * traversed before their children.
*/
n = child_node ? child_node : TAILQ_FIRST(&graph->iter_list);