sortm(struct memarr *mp, int n)
sortm(mp, n) struct memarr *mp; int n;
sortm(struct memarr *mp, int n){	struct memarr *mpj;	int i, j;	paddr_t addr;	psize_t len;	/* Insertion sort.  This is O(n^2), but so what? */	for (i = 1; i < n; i++) {		/* save i'th entry */		addr = mp[i].addr;		len = mp[i].len;		/* find j such that i'th entry goes before j'th */		for (j = 0, mpj = mp; j < i; j++, mpj++)			if (addr < mpj->addr)				break;		/* slide up any additional entries */		ovbcopy(mpj, mpj + 1, (i - j) * sizeof(*mp));		mpj->addr = addr;		mpj->len = len;	}}