reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
672 graph->n = n_node; 673 graph->n_edge = n_edge; 674 graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n); 674 graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n); 675 graph->sorted = isl_calloc_array(ctx, int, graph->n); 675 graph->sorted = isl_calloc_array(ctx, int, graph->n); 676 graph->region = isl_alloc_array(ctx, 677 struct isl_trivial_region, graph->n); 678 graph->edge = isl_calloc_array(ctx, 679 struct isl_sched_edge, graph->n_edge); 681 graph->intra_hmap = isl_map_to_basic_set_alloc(ctx, 2 * n_edge); 682 graph->intra_hmap_param = isl_map_to_basic_set_alloc(ctx, 2 * n_edge); 683 graph->inter_hmap = isl_map_to_basic_set_alloc(ctx, 2 * n_edge); 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 686 !graph->sorted) 689 for(i = 0; i < graph->n; ++i) 690 graph->sorted[i] = i;