Lines Matching defs:upa
2467 int upa, apl; /* units per alloc, allocs per line */
2478 upa = ai->alloc_size / ai->unit_size;
2479 width = upa * (cpu_width + 1) + group_width + 3;
2490 BUG_ON(gi->nr_units % upa);
2491 for (alloc_end += gi->nr_units / upa;
2499 for (unit_end += upa; unit < unit_end; unit++)
2816 int upa, max_upa, best_upa; /* units_per_alloc */
2842 upa = alloc_size / min_unit_size;
2843 while (alloc_size % upa || (offset_in_page(alloc_size / upa)))
2844 upa--;
2845 max_upa = upa;
2870 * Wasted space is caused by a ratio imbalance of upa to group_cnt.
2876 for (upa = max_upa; upa; upa--) {
2879 if (alloc_size % upa || (offset_in_page(alloc_size / upa)))
2883 int this_allocs = DIV_ROUND_UP(group_cnt[group], upa);
2885 wasted += this_allocs * upa - group_cnt[group];
2890 * greater-than comparison ensures upa==1 always
2900 best_upa = upa;
2903 upa = best_upa;
2907 nr_units += roundup(group_cnt[group], upa);
2916 cpu_map += roundup(group_cnt[group], upa);
2922 ai->unit_size = alloc_size / upa;
2939 gi->nr_units = roundup(gi->nr_units, upa);
3203 int upa;
3212 upa = ai->alloc_size/ai->unit_size;
3213 nr_g0_units = roundup(num_possible_cpus(), upa);