reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
404 graph->node_table = isl_hash_table_alloc(ctx, graph->n); 408 for (i = 0; i < graph->n; ++i) { 440 return entry ? entry->data : graph->node + graph->n; 448 return node && node >= &graph->node[0] && node < &graph->node[graph->n]; 672 graph->n = n_node; 674 graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n); 675 graph->sorted = isl_calloc_array(ctx, int, graph->n); 677 struct isl_trivial_region, graph->n); 689 for(i = 0; i < graph->n; ++i) 727 for (i = 0; i < graph->n; ++i) 753 graph->n++; 775 graph->n = 0; 1012 node = &graph->node[graph->n]; 1013 graph->n++; 1105 id = construct_compressed_id(set, &graph->node[graph->n]); 1403 graph->n = isl_union_set_n_set(domain); 1406 if (graph_alloc(ctx, graph, graph->n, 1413 graph->n = 0; 1481 g = isl_tarjan_graph_init(ctx, graph->n, follows, graph); 1487 n = graph->n; 1536 return isl_sort(graph->sorted, graph->n, sizeof(int), &cmp_scc, graph); 2460 *n_ineq += graph->n; 2484 for (i = 0; i < graph->n; ++i) { 2515 for (i = 0; i < graph->n; ++i) 2629 for (i = 0; i < graph->n; ++i) { 2677 for (i = 0; i < graph->n; ++i) { 2703 for (i = 0; i < graph->n; ++i) { 2759 for (i = 0; i < graph->n; ++i) { 2894 for (i = 0; i < graph->n; ++i) { 2906 sol = isl_tab_basic_set_non_trivial_lexmin(lp, 2, graph->n, 2908 for (i = 0; i < graph->n; ++i) 2969 for (i = 0; i < graph->n; ++i) { 3394 for (i = 0; i < graph->n; ++i) 3398 if (i >= graph->n) 3405 for (i = i + 1; i < graph->n; ++i) { 3464 dst->n = 0; 3465 for (i = 0; i < src->n; ++i) { 3471 j = dst->n; 3487 dst->n++; 3575 for (i = 0; i < graph->n; ++i) { 3601 for (i = 0; i < graph->n; ++i) 3695 for (i = 0; i < graph->n; ++i) { 3787 if (graph->n < 1) 3800 for (i = 1; i < graph->n; ++i) { 4188 for (i = 0; i < graph->n; ++i) { 4267 if (graph->n <= 1) 4277 for (i = 0; i < graph->n; ++i) { 4292 for (i = 0; i < graph->n; ++i) { 4357 for (i = 0; i < graph->n; ++i) { 4582 for (i = 0; i < graph->n; ++i) { 4591 if (i < graph->n) { 5264 if (graph->n < 1) 5269 if (graph->n == 1) 5282 if (graph->scc < graph->n) { 5953 g = isl_tarjan_graph_component(ctx, graph->n, data.dst, 6064 for (j = 0; j < c->scc[i].n; ++j) { 6274 for (j = 0; j < scc->n; ++j) { 6314 for (j = 0; j < scc->n; ++j) { 6746 for (i = 0; i < graph->n; ++i) { 6995 for (i = 0; i < graph->n; ++i) { 7045 for (i = 0; i < graph->n; ++i) 7062 for (i = 0; i < graph->n; ++i) 7299 if (graph->weak && graph->scc == graph->n) { 7396 if (graph.n > 0)