| /src/external/gpl2/mkhybrid/dist/libhfs_iso/ |
| node.c | 58 int n_new(node *np) function
209 if (n_new(&right) < 0)
|
| /src/external/mit/isl/dist/ |
| isl_scheduler_clustering.c | 1028 isl_size n_new; local
1034 n_new = isl_mat_rows(t_node->sched);
1035 if (n_new < 0)
1047 for (j = 0; j < n_new; ++j)
1052 graph->n_total_row += n_new;
1053 graph->n_row += n_new;
|
| isl_coalesce.c | 477 int k, n_old, n_new; local
482 n_new = 2 * bmap->n_eq;
485 ++n_new;
487 return n_new > n_old;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| dwarf2cfi.cc | 2385 size_t i, n_old, n_new, n_max;
2398 n_new = vec_safe_length (new_row->reg_save);
2399 n_max = MAX (n_old, n_new);
2407 if (i < n_new)
2382 size_t i, n_old, n_new, n_max; local
|
| tree-ssa-loop-ivopts.cc | 6131 unsigned n_old = data->regs_used, n_new = n_invs + n_cands; local
6132 unsigned regs_needed = n_new + n_old, available_regs = target_avail_regs;
6142 cost = n_new;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| dwarf2cfi.cc | 2380 size_t i, n_old, n_new, n_max;
2393 n_new = vec_safe_length (new_row->reg_save);
2394 n_max = MAX (n_old, n_new);
2402 if (i < n_new)
2377 size_t i, n_old, n_new, n_max; local
|
| tree-ssa-loop-ivopts.cc | 6081 unsigned n_old = data->regs_used, n_new = n_invs + n_cands; local
6082 unsigned regs_needed = n_new + n_old, available_regs = target_avail_regs;
6092 cost = n_new;
|
| /src/external/gpl3/gcc.old/dist/gcc/config/riscv/ |
| riscv.cc | 2928 int n_new = riscv_flatten_aggregate_argument (type, fields, true);
2929 for (int i = 0; i < n_new; i++)
2932 n_new = -1;
2936 if ((n_old != n_new) && (warned == 0))
2943 return n_new > 0 ? n_new : 0;
2967 int n_new = riscv_flatten_aggregate_argument (type, fields, true);
2968 for (int i = 0; i < n_new; i++)
2925 int n_new = riscv_flatten_aggregate_argument (type, fields, true); local
2964 int n_new = riscv_flatten_aggregate_argument (type, fields, true); local
|
