NPDPG
for (i = 0; i < NPDPG; i++)
for (i = NDML2_ENTRIES; i < NPDPG * ndmpdp; i++) {
if (p > NPDPG)
p = NPDPG;
while (cur_pa < max_pa && j < NPDPG) {
for (i = 0; i < NPDPG; i++) {
for (j = k; j < NPDPG; j++)
for (i = 0; i < NPDPG; i++)