vm: optimisation: avl tree for virtual regions

- regions were preivous stored in a linked list, as 'normally'
    there are just 2 or 3 (text, data, stack), but that's slow
    if lots of regions are made with mmap()

  - measurable performance improvement with gcc and clang

servers/vm/Makefile

@@ -4,8 +4,7 @@
 PROG=	vm
 SRCS=	main.c alloc.c utility.c exec.c exit.c fork.c break.c \
 	signal.c mmap.c slaballoc.c region.c pagefaults.c addravl.c \
-	physravl.c rs.c queryexit.c yieldedavl.c
+	physravl.c rs.c queryexit.c yieldedavl.c regionavl.c
-
 
 DPADD+=	${LIBSYS}
 LDADD+=	-lsys

servers/vm/cavl_if.h

@@ -90,6 +90,8 @@ L__SC AVL_HANDLE L__(search_least)(L__(avl) *tree);
 
 L__SC AVL_HANDLE L__(search_greatest)(L__(avl) *tree);
 
+L__SC AVL_HANDLE L__(search_root)(L__(avl) *tree);
+
 L__SC AVL_HANDLE L__(remove)(L__(avl) *tree, AVL_KEY k);
 
 L__SC AVL_HANDLE L__(subst)(L__(avl) *tree, AVL_HANDLE new_node);

servers/vm/cavl_impl.h

@@ -501,6 +501,12 @@ L__SC AVL_HANDLE L__(search_least)(L__(avl) *L__tree)
 
 #endif
 
+L__SC AVL_HANDLE L__(search_root)(L__(avl) *L__tree)
+  {
+    return L__tree->root;
+  }
+
+
 #if (L__IMPL_MASK & AVL_IMPL_SEARCH_GREATEST)
 
 L__SC AVL_HANDLE L__(search_greatest)(L__(avl) *L__tree)

servers/vm/exec.c

@@ -182,9 +182,12 @@ SANITYCHECK(SCL_DETAIL);
 
   assert(!(vmpold->vm_flags & VMF_INUSE));
   *vmpold = *rmp;	/* copy current state. */
-  rmp->vm_regions = NULL; /* exec()ing process regions thrown out. */
+#if SANITYCHECKS
-SANITYCHECK(SCL_DETAIL);
+  map_setparent(vmpold);
+#endif
 
+  region_init(&rmp->vm_regions_avl); /* exec()ing process regions thrown out. */
+SANITYCHECK(SCL_DETAIL);
 
   /* Build new process in current slot, without freeing old
    * one. If it fails, revert.
@@ -212,6 +215,7 @@ SANITYCHECK(SCL_DETAIL);
       pt_free(&rmp->vm_pt);
     }
     *rmp = *vmpold;	/* undo. */
+    map_setparent(rmp);
     clear_proc(vmpold);	/* disappear. */
     SANITYCHECK(SCL_DETAIL);
     if(hadpt) {

servers/vm/exit.c

@@ -31,7 +31,7 @@ PUBLIC void free_proc(struct vmproc *vmp)
 		vmp->vm_flags &= ~VMF_HASPT;
 		pt_free(&vmp->vm_pt);
 	}
-	vmp->vm_regions = NULL;
+	region_init(&vmp->vm_regions_avl);
 #if VMSTATS
 	vmp->vm_bytecopies = 0;
 #endif
@@ -39,7 +39,7 @@ PUBLIC void free_proc(struct vmproc *vmp)
 
 PUBLIC void clear_proc(struct vmproc *vmp)
 {
-	vmp->vm_regions = NULL;
+	region_init(&vmp->vm_regions_avl);
 	vmp->vm_callback = NULL;	/* No pending vfs callback. */
 	vmp->vm_flags = 0;		/* Clear INUSE, so slot is free. */
 	vmp->vm_heap = NULL;

servers/vm/fork.c

@@ -69,7 +69,7 @@ PUBLIC int do_fork(message *msg)
   origpt = vmc->vm_pt;
   *vmc = *vmp;
   vmc->vm_slot = childproc;
-  vmc->vm_regions = NULL;
+  region_init(&vmc->vm_regions_avl);
   yielded_init(&vmc->vm_yielded_blocks);
   vmc->vm_endpoint = NONE;	/* In case someone tries to use it. */
   vmc->vm_pt = origpt;

servers/vm/proto.h

@@ -158,6 +158,7 @@ _PROTOTYPE(void map_printmap, (struct vmproc *vmp));
 _PROTOTYPE(int map_writept, (struct vmproc *vmp));
 _PROTOTYPE(void printregionstats, (struct vmproc *vmp));
 _PROTOTYPE(phys_bytes map_lookup_phys, (struct vmproc *vmp, u32_t tag));
+_PROTOTYPE(void map_setparent, (struct vmproc *vmp));
 
 _PROTOTYPE(struct vir_region * map_region_lookup_tag, (struct vmproc *vmp, u32_t tag));
 _PROTOTYPE(void map_region_set_tag, (struct vir_region *vr, u32_t tag));

servers/vm/region.c

@@ -120,15 +120,37 @@ PUBLIC void map_printmap(vmp)
 struct vmproc *vmp;
 {
 	struct vir_region *vr;
+	region_iter iter;
 
 	printf("memory regions in process %d:\n", vmp->vm_endpoint);
-	for(vr = vmp->vm_regions; vr; vr = vr->next) {
+
+	region_start_iter_least(&vmp->vm_regions_avl, &iter);
+	while((vr = region_get_iter(&iter))) {
 		map_printregion(vmp, vr);
+		region_incr_iter(&iter);
 	}
 }
 
+PRIVATE struct vir_region *getnextvr(struct vir_region *vr)
+{
+	struct vir_region *nextvr;
+	region_iter v_iter;
+	SLABSANE(vr);
+	region_start_iter(&vr->parent->vm_regions_avl, &v_iter, vr->vaddr, AVL_EQUAL);
+	assert(region_get_iter(&v_iter));
+	assert(region_get_iter(&v_iter) == vr);
+	region_incr_iter(&v_iter);
+	nextvr = region_get_iter(&v_iter);
+	if(!nextvr) return NULL;
+	SLABSANE(nextvr);
+	assert(vr->parent == nextvr->parent);
+	assert(vr->vaddr < nextvr->vaddr);
+	assert(vr->vaddr + vr->length <= nextvr->vaddr);
+	return nextvr;
+}
 
 #if SANITYCHECKS
+
 /*===========================================================================*
  *				map_sanitycheck_pt			     *
  *===========================================================================*/
@@ -173,10 +195,12 @@ PUBLIC void map_sanitycheck(char *file, int line)
  */
 #define ALLREGIONS(regioncode, physcode)			\
 	for(vmp = vmproc; vmp < &vmproc[VMP_NR]; vmp++) {	\
+		region_iter v_iter;				\
 		struct vir_region *vr;				\
 		if(!(vmp->vm_flags & VMF_INUSE))		\
 			continue;				\
-		for(vr = vmp->vm_regions; vr; vr = vr->next) {	\
+		region_start_iter_least(&vmp->vm_regions_avl, &v_iter);	\
+		while((vr = region_get_iter(&v_iter))) {	\
 			physr_iter iter;			\
 			struct phys_region *pr;			\
 			regioncode;				\
@@ -185,6 +209,7 @@ PUBLIC void map_sanitycheck(char *file, int line)
 				physcode;			\
 				physr_incr_iter(&iter);		\
 			}					\
+			region_incr_iter(&v_iter);		\
 		}						\
 	}
 
@@ -197,15 +222,19 @@ PUBLIC void map_sanitycheck(char *file, int line)
 	ALLREGIONS(;,USE(pr->ph, pr->ph->seencount = 0;););
 	ALLREGIONS(;,USE(pr->ph, pr->ph->seencount++;);
 		if(pr->ph->seencount == 1) {
+			if(!(pr->parent->flags & VR_DIRECT)) {
 				MYASSERT(usedpages_add(pr->ph->phys,
 					pr->ph->length) == OK);
 			}
+		}
 	);
 
 	/* Do consistency check. */
-	ALLREGIONS(if(vr->next) {
+	ALLREGIONS({ struct vir_region *nextvr = getnextvr(vr);
-			MYASSERT(vr->vaddr < vr->next->vaddr);
+		if(nextvr) {
-			MYASSERT(vr->vaddr + vr->length <= vr->next->vaddr);
+			MYASSERT(vr->vaddr < nextvr->vaddr);
+			MYASSERT(vr->vaddr + vr->length <= nextvr->vaddr);
+		}
 		}
 		MYASSERT(!(vr->vaddr % VM_PAGE_SIZE));,	
 		if(pr->ph->refcount != pr->ph->seencount) {
@@ -343,10 +372,13 @@ PRIVATE vir_bytes region_find_slot(struct vmproc *vmp,
 		vir_bytes minv, vir_bytes maxv, vir_bytes length,
 		struct vir_region **prev)
 {
-	struct vir_region *firstregion = vmp->vm_regions, *prevregion = NULL;
+	struct vir_region *firstregion, *prevregion = NULL;
 	vir_bytes startv;
 	int foundflag = 0;
 
+	/* XXX start search closer to minv to optimise. */
+	firstregion = region_search_least(&vmp->vm_regions_avl);
+
 	SANITYCHECK(SCL_FUNCTIONS);
 
 	/* Length must be reasonable. */
@@ -391,9 +423,14 @@ PRIVATE vir_bytes region_find_slot(struct vmproc *vmp,
 
 	if(!foundflag) {
 		struct vir_region *vr;
-		for(vr = vmp->vm_regions; vr && !foundflag; vr = vr->next) {
+		region_iter iter;
+		region_start_iter_least(&vmp->vm_regions_avl, &iter);
+		while((vr = region_get_iter(&iter)) && !foundflag) {
+			struct vir_region *nextvr;
+			region_incr_iter(&iter);
+			nextvr = region_get_iter(&iter);
 			FREEVRANGE(vr->vaddr + vr->length,
-			  vr->next ? vr->next->vaddr : VM_DATATOP,
+			  nextvr ? nextvr->vaddr : VM_DATATOP,
 				prevregion = vr;);
 		}
 	}
@@ -495,19 +532,15 @@ USE(newregion,
 	}
 
 	/* Link it. */
-	if(prevregion) {
+	region_insert(&vmp->vm_regions_avl, newregion);
-		assert(prevregion->vaddr < newregion->vaddr);
-		USE(newregion, newregion->next = prevregion->next;);
-		USE(prevregion, prevregion->next = newregion;);
-	} else {
-		USE(newregion, newregion->next = vmp->vm_regions;);
-		vmp->vm_regions = newregion;
-	}
 
 #if SANITYCHECKS
 	assert(startv == newregion->vaddr);
-	if(newregion->next) {
+	{
-		assert(newregion->vaddr < newregion->next->vaddr);
+		struct vir_region *nextvr;
+		if((nextvr = getnextvr(newregion))) {
+			assert(newregion->vaddr < nextvr->vaddr);
+		}
 	}
 #endif
 
@@ -585,6 +618,8 @@ PRIVATE int map_subfree(struct vmproc *vmp,
 
 #if SANITYCHECKS
 	{
+	SLABSANE(region);
+	SLABSANE(region->phys);
 	physr_start_iter_least(region->phys, &iter);
 	while((pr = physr_get_iter(&iter))) {
 		struct phys_region *others;
@@ -674,7 +709,7 @@ PRIVATE vir_bytes free_yielded_proc(struct vmproc *vmp)
 	SANITYCHECK(SCL_FUNCTIONS);
 
 	/* Free associated regions. */
-	while((yb = yielded_search_least(&vmp->vm_yielded_blocks))) {
+	while((yb = yielded_search_root(&vmp->vm_yielded_blocks))) {
 		SLABSANE(yb);
 		total += freeyieldednode(yb, 1);
 		y++;
@@ -768,22 +803,22 @@ PUBLIC vir_bytes free_yielded(vir_bytes max_bytes)
 PUBLIC int map_free_proc(vmp)
 struct vmproc *vmp;
 {
-	struct vir_region *r, *nextr;
+	struct vir_region *r;
 
-	for(r = vmp->vm_regions; r; r = nextr) {
+	while((r = region_search_root(&vmp->vm_regions_avl))) {
-		nextr = r->next;
 		SANITYCHECK(SCL_DETAIL);
 #if SANITYCHECKS
 		nocheck++;
 #endif
+		region_remove(&vmp->vm_regions_avl, r->vaddr); /* For sanity checks. */
 		map_free(vmp, r);
-		vmp->vm_regions = nextr;	/* For sanity checks. */
 #if SANITYCHECKS
 		nocheck--;
 #endif
 		SANITYCHECK(SCL_DETAIL);
 	}
-	vmp->vm_regions = NULL;
+
+	region_init(&vmp->vm_regions_avl);
 
 	/* Free associated yielded blocks. */
 	free_yielded_proc(vmp);
@@ -804,10 +839,12 @@ vir_bytes offset;
 
 	SANITYCHECK(SCL_FUNCTIONS);
 
-	if(!vmp->vm_regions)
+#if SANITYCHECKS
+	if(!region_search_root(&vmp->vm_regions_avl))
 		panic("process has no regions: %d", vmp->vm_endpoint);
+#endif
 
-	for(r = vmp->vm_regions; r; r = r->next) {
+	if((r = region_search(&vmp->vm_regions_avl, offset, AVL_LESS_EQUAL))) {
 		if(offset >= r->vaddr && offset < r->vaddr + r->length)
 			return r;
 	}
@@ -1126,14 +1163,16 @@ PUBLIC int map_pin_memory(struct vmproc *vmp)
 {
 	struct vir_region *vr;
 	int r;
-
+	region_iter iter;
+	region_start_iter_least(&vmp->vm_regions_avl, &iter);
 	/* Scan all memory regions. */
-	for(vr = vmp->vm_regions; vr; vr = vr->next) {
+	while((vr = region_get_iter(&iter))) {
 		/* Make sure region is mapped to physical memory and writable.*/
 		r = map_handle_memory(vmp, vr, 0, vr->length, 1);
 		if(r != OK) {
 		    panic("map_pin_memory: map_handle_memory failed: %d", r);
 		}
+		region_incr_iter(&iter);
 	}
 
 	return OK;
@@ -1311,7 +1350,7 @@ PRIVATE struct vir_region *map_copy_region(struct vmproc *vmp, struct vir_region
 	}
 	USE(newvr,
 		*newvr = *vr;
-		newvr->next = NULL;
+		newvr->lower = newvr->higher = NULL;
 		newvr->phys = phavl;
 	);
 	physr_init(newvr->phys);
@@ -1399,12 +1438,15 @@ PUBLIC int map_writept(struct vmproc *vmp)
 	struct vir_region *vr;
 	struct phys_region *ph;
 	int r;
+	region_iter v_iter;
+	region_start_iter_least(&vmp->vm_regions_avl, &v_iter);
 
-	for(vr = vmp->vm_regions; vr; vr = vr->next) {
+	while((vr = region_get_iter(&v_iter))) {
-		physr_iter iter;
+		physr_iter ph_iter;
-		physr_start_iter_least(vr->phys, &iter);
+		physr_start_iter_least(vr->phys, &ph_iter);
-		while((ph = physr_get_iter(&iter))) {
+
-			physr_incr_iter(&iter);
+		while((ph = physr_get_iter(&ph_iter))) {
+			physr_incr_iter(&ph_iter);
 
 			/* If this phys block is shared as SMAP, then do
 			 * not update the page table. */
@@ -1418,6 +1460,7 @@ PUBLIC int map_writept(struct vmproc *vmp)
 				return r;
 			}
 		}
+		region_incr_iter(&v_iter);
 	}
 
 	return OK;
@@ -1431,9 +1474,9 @@ struct vmproc *dst;
 struct vmproc *src;
 {
 /* Copy all the memory regions from the src process to the dst process. */
-	dst->vm_regions = NULL;
+	region_init(&dst->vm_regions_avl);
 
-	return map_proc_copy_from(dst, src, src->vm_regions);
+	return map_proc_copy_from(dst, src, NULL);
 }
 
 /*========================================================================*
@@ -1444,18 +1487,23 @@ struct vmproc *dst;
 struct vmproc *src;
 struct vir_region *start_src_vr;
 {
-	struct vir_region *vr, *prevvr = NULL;
+	struct vir_region *vr;
+	region_iter v_iter;
 
+	if(!start_src_vr)
+		start_src_vr = region_search_least(&src->vm_regions_avl);
+
+	assert(start_src_vr);
 	assert(start_src_vr->parent == src);
+	region_start_iter(&src->vm_regions_avl, &v_iter,
+		start_src_vr->vaddr, AVL_EQUAL);
+	assert(region_get_iter(&v_iter) == start_src_vr);
 
 	/* Copy source regions after the destination's last region (if any). */
-	for(vr = dst->vm_regions; vr; vr = vr->next) {
-		prevvr =  vr;
-	}
 
 	SANITYCHECK(SCL_FUNCTIONS);
 
-	for(vr = start_src_vr; vr; vr = vr->next) {
+	while((vr = region_get_iter(&v_iter))) {
 		physr_iter iter_orig, iter_new;
 		struct vir_region *newvr;
 		struct phys_region *orig_ph, *new_ph;
@@ -1464,8 +1512,7 @@ struct vir_region *start_src_vr;
 			return ENOMEM;
 		}
 		USE(newvr, newvr->parent = dst;);
-		if(prevvr) { USE(prevvr, prevvr->next = newvr;); }
+		region_insert(&dst->vm_regions_avl, newvr);
-		else { dst->vm_regions = newvr; }
 		physr_start_iter_least(vr->phys, &iter_orig);
 		physr_start_iter_least(newvr->phys, &iter_new);
 		while((orig_ph = physr_get_iter(&iter_orig))) {
@@ -1504,7 +1551,7 @@ struct vir_region *start_src_vr;
 			physr_incr_iter(&iter_new);
 		}
 		assert(!physr_get_iter(&iter_new));
-		prevvr = newvr;
+		region_incr_iter(&v_iter);
 	}
 
 	map_writept(src);
@@ -1524,7 +1571,7 @@ PUBLIC struct vir_region *map_proc_kernel(struct vmproc *vmp)
 	/* We assume these are the first regions to be mapped to
 	 * make the function a bit simpler (free all regions on error).
 	 */
-	assert(!vmp->vm_regions);
+	assert(!region_search_root(&vmp->vm_regions_avl));
 	assert(vmproc[VMP_SYSTEM].vm_flags & VMF_INUSE);
 	assert(!(KERNEL_TEXT % VM_PAGE_SIZE));
 	assert(!(KERNEL_TEXT_LEN % VM_PAGE_SIZE));
@@ -1549,6 +1596,8 @@ PUBLIC int map_region_extend(struct vmproc *vmp, struct vir_region *vr,
 	vir_bytes delta)
 {
 	vir_bytes end;
+	struct vir_region *nextvr;
+	region_iter v_iter;
 
 	assert(vr);
 	assert(vr->flags & VR_ANON);
@@ -1563,7 +1612,9 @@ PUBLIC int map_region_extend(struct vmproc *vmp, struct vir_region *vr,
 		return ENOMEM;
 	}
 
-	if(!vr->next || end + delta <= vr->next->vaddr) {
+	nextvr = getnextvr(vr);
+
+	if(!nextvr || end + delta <= nextvr->vaddr) {
 		USE(vr, vr->length += delta;);
 		return OK;
 	}
@@ -1594,10 +1645,14 @@ struct vmproc *vmp;
 u32_t tag;
 {
 	struct vir_region *vr;
+	region_iter v_iter;
+	region_start_iter_least(&vmp->vm_regions_avl, &v_iter);
 
-	for(vr = vmp->vm_regions; vr; vr = vr->next)
+	while((vr = region_get_iter(&v_iter))) {
 		if(vr->tag == tag)
 			return vr;
+		region_incr_iter(&v_iter);
+	}
 
 	return NULL;
 }
@@ -1615,29 +1670,16 @@ PUBLIC u32_t map_region_get_tag(struct vir_region *vr)
 /*========================================================================*
  *				map_unmap_region	     	  	*
  *========================================================================*/
-PUBLIC int map_unmap_region(struct vmproc *vmp, struct vir_region *region,
+PUBLIC int map_unmap_region(struct vmproc *vmp, struct vir_region *r,
 	vir_bytes len)
 {
 /* Shrink the region by 'len' bytes, from the start. Unreference
  * memory it used to reference if any.
  */
-	struct vir_region *r, *nextr, *prev = NULL;
 	vir_bytes regionstart;
 
 	SANITYCHECK(SCL_FUNCTIONS);
 
-	for(r = vmp->vm_regions; r; r = r->next) {
-		if(r == region)
-			break;
-
-		prev = r;
-	}
-
-	SANITYCHECK(SCL_DETAIL);
-
-	if(r == NULL)
-		panic("map_unmap_region: region not found");
-
 	if(len > r->length || (len % VM_PAGE_SIZE)) {
 		printf("VM: bogus length 0x%lx\n", len);
 		return EINVAL;
@@ -1652,11 +1694,7 @@ PUBLIC int map_unmap_region(struct vmproc *vmp, struct vir_region *region,
 
 	if(len == r->length) {
 		/* Whole region disappears. Unlink and free it. */
-		if(!prev) {
+		region_remove(&vmp->vm_regions_avl, r->vaddr);
-			vmp->vm_regions = r->next;
-		} else {
-			USE(prev, prev->next = r->next;);
-		}
 		map_free(vmp, r);
 	} else {
 		struct phys_region *pr;
@@ -1741,15 +1779,7 @@ PUBLIC int map_remap(struct vmproc *dvmp, vir_bytes da, size_t size,
 	vr->parent = dvmp;);
 	assert(vr->flags & VR_SHARED);
 
-	if (prev) {
+	region_insert(&dvmp->vm_regions_avl, vr);
-		USE(vr,
-		vr->next = prev->next;);
-		USE(prev, prev->next = vr;);
-	} else {
-		USE(vr,
-		vr->next = dvmp->vm_regions;);
-		dvmp->vm_regions = vr;
-	}
 
 	physr_start_iter_least(vr->phys, &iter);
 	while((ph = physr_get_iter(&iter))) {
@@ -1847,10 +1877,12 @@ PUBLIC void get_usage_info(struct vmproc *vmp, struct vm_usage_info *vui)
 	physr_iter iter;
 	struct phys_region *ph;
 	vir_bytes len;
+	region_iter v_iter;
+	region_start_iter_least(&vmp->vm_regions_avl, &v_iter);
 
 	memset(vui, 0, sizeof(*vui));
 
-	for(vr = vmp->vm_regions; vr; vr = vr->next) {
+	while((vr = region_get_iter(&v_iter))) {
 		physr_start_iter_least(vr->phys, &iter);
 		while((ph = physr_get_iter(&iter))) {
 			len = ph->ph->length;
@@ -1869,6 +1901,7 @@ PUBLIC void get_usage_info(struct vmproc *vmp, struct vm_usage_info *vui)
 			}
 			physr_incr_iter(&iter);
 		}
+		region_incr_iter(&v_iter);
 	}
 }
 
@@ -1881,17 +1914,16 @@ PUBLIC int get_region_info(struct vmproc *vmp, struct vm_region_info *vri,
 	struct vir_region *vr;
 	vir_bytes next;
 	int count;
+	region_iter v_iter;
 
 	next = *nextp;
 
 	if (!max) return 0;
 
-	for(vr = vmp->vm_regions; vr; vr = vr->next)
+	region_start_iter(&vmp->vm_regions_avl, &v_iter, next, AVL_GREATER_EQUAL);
-		if (vr->vaddr >= next) break;
+	if(!(vr = region_get_iter(&v_iter))) return 0;
 
-	if (!vr) return 0;
+	for(count = 0; (vr = region_get_iter(&v_iter)) && count < max; count++, vri++) {
-
-	for(count = 0; vr && count < max; vr = vr->next, count++, vri++) {
 		vri->vri_addr = arch_map2info(vmp, vr->vaddr, &vri->vri_seg,
 			&vri->vri_prot);
 		vri->vri_length = vr->length;
@@ -1903,6 +1935,7 @@ PUBLIC int get_region_info(struct vmproc *vmp, struct vm_region_info *vri,
 		vri->vri_flags = (vr->flags & VR_SHARED) ? MAP_SHARED : 0;
 
 		next = vr->vaddr + vr->length;
+		region_incr_iter(&v_iter);
 	}
 
 	*nextp = next;
@@ -1918,8 +1951,11 @@ PUBLIC void printregionstats(struct vmproc *vmp)
 	struct phys_region *pr;
 	physr_iter iter;
 	vir_bytes used = 0, weighted = 0;
+	region_iter v_iter;
+	region_start_iter_least(&vmp->vm_regions_avl, &v_iter);
 
-	for(vr = vmp->vm_regions; vr; vr = vr->next) {
+	while((vr = region_get_iter(&v_iter))) {
+		region_incr_iter(&v_iter);
 		if(vr->flags & VR_DIRECT)
 			continue;
 		physr_start_iter_least(vr->phys, &iter);
@@ -2549,3 +2585,13 @@ PUBLIC int do_yieldblockgetblock(message *m)
 	return r;
 }
 
+void map_setparent(struct vmproc *vmp)
+{
+	region_iter iter;
+	struct vir_region *vr;
+        region_start_iter_least(&vmp->vm_regions_avl, &iter);
+        while((vr = region_get_iter(&iter))) {
+                USE(vr, vr->parent = vmp;);
+                region_incr_iter(&iter);
+        }
+}

servers/vm/region.h

@@ -34,15 +34,18 @@ struct phys_block {
 	struct phys_region	*firstregion;	
 };
 
-struct vir_region {
+typedef struct vir_region {
-	struct vir_region *next; /* next virtual region in this process */
 	vir_bytes	vaddr;	/* virtual address, offset from pagetable */
 	vir_bytes	length;	/* length in bytes */
 	physr_avl	*phys;	/* avl tree of physical memory blocks */
 	u16_t		flags;
 	u32_t tag;		/* Opaque to mapping code. */
 	struct vmproc *parent;	/* Process that owns this vir_region. */
-};
+
+	/* AVL fields */
+	struct vir_region *lower, *higher;
+	int		factor;
+} region_t;
 
 /* Mapping flags: */
 #define VR_WRITABLE	0x001	/* Process may write here. */

servers/vm/regionavl.c

@@ -0,0 +1,11 @@
+
+#include <stddef.h>
+#include <minix/u64.h>
+
+#include "proto.h"
+#include "sanitycheck.h"
+#include "region.h"
+#include "regionavl_defs.h"
+#include "cavl_if.h"
+#include "cavl_impl.h"
+

servers/vm/regionavl.h

@@ -0,0 +1,10 @@
+
+#ifndef _REGIONAVL_H 
+#define _REGIONAVL_H 
+
+#include "region.h"
+#include "regionavl_defs.h"
+#include "cavl_if.h"
+#include "unavl.h"
+
+#endif

servers/vm/regionavl_defs.h

@@ -0,0 +1,17 @@
+#include <minix/u64.h>
+
+#define AVL_UNIQUE(id) region_ ## id
+#define AVL_HANDLE region_t *
+#define AVL_KEY vir_bytes
+#define AVL_MAX_DEPTH 30 /* good for 2 million nodes */
+#define AVL_NULL NULL
+#define AVL_GET_LESS(h, a) (h)->lower
+#define AVL_GET_GREATER(h, a) (h)->higher
+#define AVL_SET_LESS(h1, h2) USE((h1), (h1)->lower = h2;);
+#define AVL_SET_GREATER(h1, h2) USE((h1), (h1)->higher = h2;);
+#define AVL_GET_BALANCE_FACTOR(h) (h)->factor
+#define AVL_SET_BALANCE_FACTOR(h, f) USE((h), (h)->factor = f;);
+#define AVL_SET_ROOT(h, v) (h)->root = v;
+#define AVL_COMPARE_KEY_KEY(k1, k2) ((k1) > (k2) ? 1 : ((k1) < (k2) ? -1 : 0))
+#define AVL_COMPARE_KEY_NODE(k, h) AVL_COMPARE_KEY_KEY((k), (h)->vaddr)
+#define AVL_COMPARE_NODE_NODE(h1, h2) AVL_COMPARE_KEY_KEY((h1)->vaddr, (h2)->vaddr)

servers/vm/utility.c

@@ -292,7 +292,6 @@ PUBLIC int swap_proc_slot(struct vmproc *src_vmp, struct vmproc *dst_vmp)
  *===========================================================================*/
 PUBLIC int swap_proc_dyn_data(struct vmproc *src_vmp, struct vmproc *dst_vmp)
 {
-	struct vir_region *vr;
 	int is_vm;
 	int r;
 
@@ -320,12 +319,8 @@ PUBLIC int swap_proc_dyn_data(struct vmproc *src_vmp, struct vmproc *dst_vmp)
 #endif
 
 	/* Swap vir_regions' parents. */
-	for(vr = src_vmp->vm_regions; vr; vr = vr->next) {
+	map_setparent(src_vmp);
-		USE(vr, vr->parent = src_vmp;);
+	map_setparent(dst_vmp);
-	}
-	for(vr = dst_vmp->vm_regions; vr; vr = vr->next) {
-		USE(vr, vr->parent = dst_vmp;);
-	}
 
 	/* For regular processes, transfer regions above the stack now.
 	 * In case of rollback, we need to skip this step. To sandbox the
@@ -333,6 +328,7 @@ PUBLIC int swap_proc_dyn_data(struct vmproc *src_vmp, struct vmproc *dst_vmp)
 	 * the regions between the two instances as COW.
 	 */
 	if(!is_vm && (dst_vmp->vm_flags & VMF_HASPT)) {
+		struct vir_region *vr;
 		vr = map_lookup(dst_vmp, arch_vir2map(dst_vmp, dst_vmp->vm_stacktop));
 		if(vr && !map_lookup(src_vmp, arch_vir2map(src_vmp, src_vmp->vm_stacktop))) {
 #if LU_DEBUG

servers/vm/vmproc.h

@@ -10,6 +10,7 @@
 #include "vm.h"
 #include "physravl.h"
 #include "yieldedavl.h"
+#include "regionavl.h"
 
 struct vmproc;
 
@@ -29,7 +30,7 @@ struct vmproc {
 	time_t vm_ctime;	/* inode changed time */
 
 	/* Regions in virtual address space. */
-	struct vir_region *vm_regions;
+	region_avl vm_regions_avl;
 	yielded_avl	vm_yielded_blocks;	 /* avl of yielded physblocks */
 
 	/* Heap for brk() to extend. */