isl_scheduler.c: graph_find_compressed_node: extract out is_node

This reduces some clutter from graph_find_compressed_node and will make it easier to change the graph that is expected to contain the node in the next commit. Signed-off-by: Sven Verdoolaege <[email protected]>
opencompl · Jul 30, 2017 · 2dcebe4 · 2dcebe4
1 parent d1b1363
commit 2dcebe4
Showing 1 changed file with 9 additions and 1 deletion.
diff --git a/isl_scheduler.c b/isl_scheduler.c
@@ -421,6 +421,14 @@ static struct isl_sched_node *graph_find_node(isl_ctx *ctx,
 	return entry ? entry->data : NULL;
 }
 
+/* Is "node" a node in "graph"?
+ */
+static int is_node(struct isl_sched_graph *graph,
+	struct isl_sched_node *node)
+{
+	return node && node >= &graph->node[0] && node < &graph->node[graph->n];
+}
+
 static int edge_has_src_and_dst(const void *entry, const void *val)
 {
 	const struct isl_sched_edge *edge = entry;
@@ -3887,7 +3895,7 @@ static struct isl_sched_node *graph_find_compressed_node(isl_ctx *ctx,
 	if (!node)
 		return NULL;
 
-	if (!(node >= &graph->node[0] && node < &graph->node[graph->n]))
+	if (!is_node(graph, node))
 		isl_die(ctx, isl_error_internal,
 			"space points to invalid node", return NULL);