isl_schedule_node_has_next_sibling: use isl_schedule_tree_n_children
authorSven Verdoolaege <sven.verdoolaege@gmail.com>
Thu, 9 Aug 2018 10:17:48 +0000 (9 12:17 +0200)
committerSven Verdoolaege <sven.verdoolaege@gmail.com>
Sat, 25 Aug 2018 08:16:06 +0000 (25 10:16 +0200)
Do so instead of using an open coded version.

Signed-off-by: Sven Verdoolaege <sven.verdoolaege@gmail.com>
isl_schedule_node.c

index 5ac4be1..1a7ce80 100644 (file)
@@ -1004,10 +1004,10 @@ isl_bool isl_schedule_node_has_next_sibling(__isl_keep isl_schedule_node *node)
 
        n = isl_schedule_tree_list_n_schedule_tree(node->ancestors);
        tree = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n - 1);
-       if (!tree)
-               return isl_bool_error;
-       n_child = isl_schedule_tree_list_n_schedule_tree(tree->children);
+       n_child = isl_schedule_tree_n_children(tree);
        isl_schedule_tree_free(tree);
+       if (n_child < 0)
+               return isl_bool_error;
 
        return node->child_pos[n - 1] + 1 < n_child;
 }