Searched refs:wcc (Results 1 - 3 of 3) sorted by relevance
| /haiku-buildtools/gcc/zlib/watcom/ |
| H A D | watcom_l.mak | 17 CC = wcc
|
| /haiku-buildtools/binutils/zlib/watcom/ |
| H A D | watcom_l.mak | 17 CC = wcc
|
| /haiku-buildtools/isl/ |
| H A D | isl_schedule.c | 1963 * If the subgraph is known to consist of a single component, then wcc should
1972 int data, int wcc)
1995 if (wcc && compute_schedule_wcc(ctx, &split) < 0)
1997 if (!wcc && compute_schedule(ctx, &split) < 0)
2845 int wcc, i; local
2861 for (wcc = 0; wcc < graph->scc; ++wcc) {
2864 if (graph->node[i].scc == wcc)
2868 if (graph->edge[i].src->scc == wcc
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
[all...] |
Completed in 81 milliseconds