reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
412 hash = isl_space_get_tuple_hash(graph->node[i].space); 415 graph->node[i].space, 1); 418 entry->data = &graph->node[i]; 440 return entry ? entry->data : graph->node + graph->n; 448 return node && node >= &graph->node[0] && node < &graph->node[graph->n]; 448 return node && node >= &graph->node[0] && node < &graph->node[graph->n]; 674 graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n); 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 726 if (graph->node) 728 clear_node(graph, &graph->node[i]); 729 free(graph->node); 1012 node = &graph->node[graph->n]; 1105 id = construct_compressed_id(set, &graph->node[graph->n]); 1456 f = graph_has_any_edge(graph, &graph->node[j], &graph->node[i]); 1456 f = graph_has_any_edge(graph, &graph->node[j], &graph->node[i]); 1459 return graph_has_any_edge(graph, &graph->node[i], &graph->node[j]); 1459 return graph_has_any_edge(graph, &graph->node[i], &graph->node[j]); 1469 return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); 1469 return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); 1490 graph->node[g->order[i]].scc = graph->scc; 1529 return graph->node[*i1].scc - graph->node[*i2].scc; 1529 return graph->node[*i1].scc - graph->node[*i2].scc; 2485 struct isl_sched_node *node = &graph->node[i]; 2516 *n_ineq += graph->node[i].nparam + 2 * graph->node[i].nvar; 2516 *n_ineq += graph->node[i].nparam + 2 * graph->node[i].nvar; 2630 struct isl_sched_node *node = &graph->node[i]; 2678 int pos = 1 + node_par_coef_offset(&graph->node[i]); 2680 for (j = 0; j < graph->node[i].nparam; ++j) 2704 struct isl_sched_node *node = &graph->node[i]; 2756 nparam = isl_space_dim(graph->node[0].space, isl_dim_param); 2760 struct isl_sched_node *node = &graph->node[graph->sorted[i]]; 2895 struct isl_sched_node *node = &graph->node[i]; 2970 struct isl_sched_node *node = &graph->node[i]; 3395 if (pred(&graph->node[i], data)) 3402 set = isl_set_universe(isl_space_copy(graph->node[i].space)); 3406 if (!pred(&graph->node[i], data)) 3408 set = isl_set_universe(isl_space_copy(graph->node[i].space)); 3468 if (!node_pred(&src->node[i], data)) 3472 dst->node[j].space = isl_space_copy(src->node[i].space); 3472 dst->node[j].space = isl_space_copy(src->node[i].space); 3473 dst->node[j].compressed = src->node[i].compressed; 3473 dst->node[j].compressed = src->node[i].compressed; 3474 dst->node[j].hull = isl_set_copy(src->node[i].hull); 3474 dst->node[j].hull = isl_set_copy(src->node[i].hull); 3475 dst->node[j].compress = 3476 isl_multi_aff_copy(src->node[i].compress); 3477 dst->node[j].decompress = 3478 isl_multi_aff_copy(src->node[i].decompress); 3479 dst->node[j].nvar = src->node[i].nvar; 3479 dst->node[j].nvar = src->node[i].nvar; 3480 dst->node[j].nparam = src->node[i].nparam; 3480 dst->node[j].nparam = src->node[i].nparam; 3481 dst->node[j].sched = isl_mat_copy(src->node[i].sched); 3481 dst->node[j].sched = isl_mat_copy(src->node[i].sched); 3482 dst->node[j].sched_map = isl_map_copy(src->node[i].sched_map); 3482 dst->node[j].sched_map = isl_map_copy(src->node[i].sched_map); 3483 dst->node[j].coincident = src->node[i].coincident; 3483 dst->node[j].coincident = src->node[i].coincident; 3484 dst->node[j].sizes = isl_multi_val_copy(src->node[i].sizes); 3484 dst->node[j].sizes = isl_multi_val_copy(src->node[i].sizes); 3485 dst->node[j].bounds = isl_basic_set_copy(src->node[i].bounds); 3485 dst->node[j].bounds = isl_basic_set_copy(src->node[i].bounds); 3486 dst->node[j].max = isl_vec_copy(src->node[i].max); 3486 dst->node[j].max = isl_vec_copy(src->node[i].max); 3489 if (!dst->node[j].space || !dst->node[j].sched) 3489 if (!dst->node[j].space || !dst->node[j].sched) 3491 if (dst->node[j].compressed && 3492 (!dst->node[j].hull || !dst->node[j].compress || 3492 (!dst->node[j].hull || !dst->node[j].compress || 3493 !dst->node[j].decompress)) 3576 struct isl_sched_node *node = &graph->node[i]; 3602 if (node_pred(&graph->node[i], data)) 3696 struct isl_sched_node *node = &graph->node[i]; 3796 ma = node_extract_partial_schedule_multi_aff(&graph->node[0], start, n); 3803 ma = node_extract_partial_schedule_multi_aff(&graph->node[i], 3813 graph->node[0].coincident[start + i]); 4189 struct isl_sched_node *node = &graph->node[graph->sorted[i]]; 4275 row = isl_mat_rows(graph->node[0].sched) - 1; 4278 struct isl_sched_node *node = &graph->node[i]; 4293 struct isl_sched_node *node = &graph->node[i]; 4358 struct isl_sched_node *node = &graph->node[i]; 4583 struct isl_sched_node *node = &graph->node[i]; 4593 tl = zero_out_node_coef(tl, &graph->node[i], pos); 4901 space = isl_space_copy(graph->node[0].space); 5910 if (scc_cluster[graph->node[i].scc] == scc_cluster[graph->node[j].scc]) 5910 if (scc_cluster[graph->node[i].scc] == scc_cluster[graph->node[j].scc]) 5913 return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); 5913 return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); 5950 data.src = graph->edge[edge].src - graph->node; 5951 data.dst = graph->edge[edge].dst - graph->node; 5968 int scc = graph->node[g->order[i]].scc; 6002 space = isl_space_copy(scc->node[0].space); 6067 struct isl_sched_node *node = &c->scc[i].node[j]; 6275 struct isl_sched_node *node = &scc->node[j]; 6315 struct isl_sched_node *node = &scc->node[j]; 6377 if (!graph->node[0].coincident[i]) 6747 struct isl_sched_node *node = &graph->node[i]; 6999 if (graph->node[i].cluster != pos) 7001 s = graph->node[i].scc; 7003 swap_sched(&c->cluster[pos].node[j], &c->scc[s].node[k]); 7003 swap_sched(&c->cluster[pos].node[j], &c->scc[s].node[k]); 7020 if (graph->node[i].cluster == graph->node[j].cluster) 7020 if (graph->node[i].cluster == graph->node[j].cluster) 7022 return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); 7022 return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); 7046 graph->node[i].cluster = c->scc_cluster[graph->node[i].scc]; 7046 graph->node[i].cluster = c->scc_cluster[graph->node[i].scc]; 7063 c->scc_cluster[graph->node[i].scc] = graph->node[i].cluster; 7063 c->scc_cluster[graph->node[i].scc] = graph->node[i].cluster;