Lines Matching defs:idx
27 uint32_t idx;
31 for (idx = 0; idx < bf->bheads_count; idx++)
33 next = bf->bheads[idx].free.next;
36 VTLOG("[%d]: 0x%x\n", idx, next);
114 uint32_t list, idx;
123 for (idx = list; idx < bf->bheads_count; idx++)
125 addr = bf->bheads[idx].free.next;
140 bf->bheads[idx].free.next = next;
141 if (next) bf->tables[0][next].free.prev = idx;
142 STAT_ADD(bf, bcounts[idx], -1);
144 STAT_ADD(bf, breakups, idx - list);
145 while (idx != list)
147 idx--;
148 vtd_bchunk_free(bf, addr + (1 << idx), idx);
273 uint32_t idx;
281 idx = vtd_log2up(buddybits);
283 if (idx < 9) idx = 9;
285 bf->bheads_count, bf->table_bitmap_size, bf->tables[0], (1 << idx));
287 for (; idx < buddybits; idx++)
289 vtd_bchunk_free(bf, (1 << idx), idx);
317 int idx;
326 for (idx = 0; idx < 1*999; idx++)
329 VTLOG("fixed 0x%x, 0x%x\n", 0x40 + idx, (idx << 1) ^ (idx >> 3));
330 vtd_balloc_fixed(bf, 0x40 + idx, (idx << 1) ^ (idx >> 3));
331 VTLOG("unfix 0x%x, 0x%x\n", 0x40 + idx, (idx << 1) ^ (idx >> 3));
332 vtd_bfree_fixed(bf, 0x40 + idx, (idx << 1) ^ (idx >> 3));
352 idx = (r & 255);
353 if (allocs[idx])
355 L VTLOG("free(0x%x, 0x%x)\n", allocs[idx], sizes[idx]);
356 vtd_bfree(bf, allocs[idx], sizes[idx]);
358 allocs[idx] = sizes[idx] = 0;
360 sizes[idx] = (r >> 20);
361 if (!sizes[idx]) sizes[idx] = 1;
362 allocs[idx] = vtd_balloc(bf, sizes[idx], aligns[idx]);
363 L VTLOG("alloc(0x%x) 0x%x\n", sizes[idx], allocs[idx]);
367 for (idx = 0; idx < arrayCount(allocs); idx++)
369 if (allocs[idx])
371 L VTLOG("free(0x%x, 0x%x)\n", allocs[idx], sizes[idx]);
372 vtd_bfree(bf, allocs[idx], sizes[idx]);
374 allocs[idx] = sizes[idx] = 0;
381 for (idx = 0; idx < bits; idx++)
384 check = (idx < vtd_log2up(bits)) ? 0 : (1 << idx);
385 vtassert(check == bf->bheads[idx].free.next);