VM_NFREEORDER
m->order = VM_NFREEORDER + 1; /* invalid */
#define VM_NFREEORDER_MAX VM_NFREEORDER
OFF_TO_IDX(*offset)) & ((1 << (VM_NFREEORDER -
} else if ((order = m->order) < VM_NFREEORDER) {
if (order < VM_NFREEORDER) {
if (order == VM_NFREEORDER)
minalign = 1ul << imin(flsl(npages - 1), VM_NFREEORDER - 1);
m->order = VM_NFREEORDER;
for (oind = order; oind < VM_NFREEORDER; oind++) {
for (oind = VM_NFREEORDER - 1; oind >= order; oind--) {
KASSERT(m->order == VM_NFREEORDER,
KASSERT(order < VM_NFREEORDER,
if (order < VM_NFREEORDER - 1) {
} while (order < VM_NFREEORDER - 1);
for (int oind = 0; oind < VM_NFREEORDER; oind++) {
order = min(ilog2(diff), VM_NFREEORDER - 1);
order = VM_NFREEORDER - 1;
max_order = min(ilog2(lo ^ (lo + npages)), VM_NFREEORDER - 1);
for (m_set = m, order = 0; m_set->order == VM_NFREEORDER &&
order < VM_NFREEORDER - 1; ) {
if (m_set->order == VM_NFREEORDER)
KASSERT(m_set->order < VM_NFREEORDER,
max_order = VM_NFREEORDER - 1;
for (oind = order; oind < VM_NFREEORDER; oind++) {
if (order < VM_NFREEORDER)
for (oind = VM_NFREEORDER - 1; oind >= 0; oind--) {
for (oind = VM_NFREEORDER - 1; oind >= 0; oind--) {
m->order = VM_NFREEORDER;
for (oind = 0; oind < VM_NFREEORDER; oind++)
KASSERT(m_buddy->order == VM_NFREEORDER,
KASSERT(order >= 0 && order < VM_NFREEORDER,
KASSERT(m->order == VM_NFREEORDER,
KASSERT(order < VM_NFREEORDER,
KASSERT(m->order == VM_NFREEORDER,
KASSERT(npages <= 1 << (VM_NFREEORDER - 1),
for (oind = 0; oind < VM_NFREEORDER; oind++) {
for (oind = VM_NFREEORDER - 1; oind >= 0; oind--) {
KASSERT(order < VM_NFREEORDER,