HomeSort by: relevance | last modified time | path
    Searched defs:n_old (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
dwarf2cfi.cc 2385 size_t i, n_old, n_new, n_max;
2397 n_old = vec_safe_length (old_row->reg_save);
2399 n_max = MAX (n_old, n_new);
2405 if (i < n_old)
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;
  /src/external/gpl3/gcc.old/dist/gcc/
dwarf2cfi.cc 2380 size_t i, n_old, n_new, n_max;
2392 n_old = vec_safe_length (old_row->reg_save);
2394 n_max = MAX (n_old, n_new);
2400 if (i < n_old)
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;
  /src/external/mit/isl/dist/
isl_coalesce.c 477 int k, n_old, n_new; local
479 n_old = 2 * info[i].bmap->n_eq + info[i].bmap->n_ineq;
480 n_old += 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq;
487 return n_new > n_old;
  /src/external/gpl3/gcc.old/dist/gcc/config/riscv/
riscv.cc 2919 int n_old = riscv_flatten_aggregate_argument (type, fields, false);
2920 for (int i = 0; i < n_old; i++)
2923 n_old = -1;
2936 if ((n_old != n_new) && (warned == 0))
2958 int n_old = riscv_flatten_aggregate_argument (type, fields, false);
2959 for (int i = 0; i < n_old; i++)
2916 int n_old = riscv_flatten_aggregate_argument (type, fields, false); local
2955 int n_old = riscv_flatten_aggregate_argument (type, fields, false); local

Completed in 48 milliseconds