HomeSort by: relevance | last modified time | path
    Searched refs:am_slots (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/uvm/
uvm_amap.c 190 amap->am_slots = kmem_alloc(totalslots * sizeof(int), kmflags);
191 if (amap->am_slots == NULL)
208 kmem_free(amap->am_slots, totalslots * sizeof(int));
330 kmem_free(amap->am_slots, slots * sizeof(*amap->am_slots));
530 amap->am_slots[i] += (slotarea - slotoff);
601 /* do am_slots */
602 oldsl = amap->am_slots;
608 amap->am_slots = newsl;
698 * all mappings of a shared amap.] we traverse am_anon or am_slots
    [all...]
uvm_amap.h 160 int *am_slots; /* contig array of active slots */ member in struct:vm_amap
161 int *am_bckptr; /* back pointer array to am_slots */
170 * note that am_slots, am_bckptr, and am_anon are arrays. this allows
184 * am_bckptr: D/C, 1, D/C, 0 (points to am_slots entry)
186 * am_slots: 3, 1, D/C, D/C (says slots 3 and 1 are in use)
189 * to find the entry in am_slots for an anon, look at am_bckptr[slot],
190 * thus the entry for slot 3 in am_slots[] is at am_slots[am_bckptr[3]].
192 * true: am_slots[am_bckptr[X]] == X
194 * note that am_slots is always contig-packed
    [all...]
  /src/usr.bin/pmap/
pmap.c 607 int *am_slots; local
622 "am_slots = %p,\n"
632 D(amap, amap)->am_slots,
653 l = D(amap, amap)->am_maxslot * sizeof(*am_slots);
654 am_slots = ecalloc(D(amap, amap)->am_maxslot, sizeof(*am_slots));
655 _KDEREF(kd, (u_long)D(amap, amap)->am_slots, am_slots, l);
667 printf(" page# %9s %8s", "am_bckptr", "am_slots");
683 printf(" %8x", am_slots[i])
    [all...]

Completed in 56 milliseconds