Searched refs:n_edge (Results 1 - 1 of 1) sorted by relevance
| /haiku-buildtools/isl/ |
| H A D | isl_schedule.c | 152 * n_edge is the number of edges
192 int n_edge; member in struct:isl_sched_graph
420 int n_node, int n_edge)
425 graph->n_edge = n_edge;
430 struct isl_sched_edge, graph->n_edge);
432 graph->intra_hmap = isl_hmap_map_basic_set_alloc(ctx, 2 * n_edge);
433 graph->inter_hmap = isl_hmap_map_basic_set_alloc(ctx, 2 * n_edge);
435 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) ||
466 for (i = 0; i < graph->n_edge;
419 graph_alloc(isl_ctx *ctx, struct isl_sched_graph *graph, int n_node, int n_edge) argument
1968 compute_sub_schedule(isl_ctx *ctx, struct isl_sched_graph *graph, int n, int n_edge, int (*node_pred)(struct isl_sched_node *node, int data), int (*edge_pred)(struct isl_sched_edge *edge, int data), int data, int wcc) argument
2394 int n_edge; local
2629 int n_edge; local
2846 int n, n_edge; local
[all...] |
Completed in 35 milliseconds