Re: [PATCH] anobjrmap 9 priority mjb tree

[Rajesh Venkatasubramanian]

> It has similar problems, IIRC with increasing i_shared_sem contention.

Agreed.

> But I think it solves the same issues as prio_tree,

Agreed.

> is simpler,

Agreed.

> is easier to fix up to do clever locking with.

I haven't thought about it fully, so I am not sure. But, it is likely
that locking is easier with list-of-lists.

[snip]

> diff -urpN -X /home/fletch/.diff.exclude 820-numa_large_pages/mm/mmap.c 830-list-of-lists/mm/mmap.c
> --- 820-numa_large_pages/mm/mmap.c	Wed Jun 18 21:49:20 2003
> +++ 830-list-of-lists/mm/mmap.c	Wed Jun 18 23:29:38 2003
> @@ -306,6 +306,56 @@ static void __vma_link_rb(struct mm_stru
>  	rb_insert_color(&vma->vm_rb, &mm->mm_rb);
>  }
>
> +static void vma_add (struct vm_area_struct *vma,
> +						struct list_head *range_list)
> +{
> +	struct address_range *range;
> +	struct list_head *prev, *next;
> +	unsigned long start = vma->vm_pgoff;
> +	unsigned long end = vma->vm_pgoff +
> +		(((vma->vm_end - vma->vm_start) >> PAGE_SHIFT) - 1);
> +
> +	/* First, look for an existing range that matches ours */
> +	prev = range_list;
> +	list_for_each(next, range_list) {
> +		range = list_entry(next, struct address_range, ranges);
> +		if (range->start > start)
> +			break;    /* this list is sorted by start */
> +		if ((range->start == start) && (range->end == end)) {
> +			goto found;
> +		}
> +		prev = next;
> +	}

Hmm.. We do a linear O(N) search for each vma added. If the range_list
has 1000 vmas, then it is really bad. Running Ingo's test-mmap3.c or
Andrew's rmap-test.c (check 3rd test Andrew did - single process,
10,000 different vmas - with different range->start and range->end)
will be slow.

The prio_tree patch optimizes these cases with O(log N) insert algorithm.

[snip]

> +static void vma_del (struct vm_area_struct *vma)
> +{
[snip]
> +	next = vma->shared.next;	/* stash the range list we're on */
> +	list_del(&vma->shared);		/* remove us from the list of vmas */
> +	if (list_empty(next)) {		/* we were the last vma for range */
> +		range = list_entry(next, struct address_range, vmas);
> +		list_del(&range->ranges);
> +		kfree(range);
> +	}
> +}

Agree that vma_del is much simpler.

>  page_referenced_obj(struct page *page)
>  {
[snip]
> +	list_for_each_entry(range, &mapping->i_mmap, ranges) {
> +		if (range->start > index)
> +			break;     /* Sorted by start address => we are done */
> +		if (range->end < index)
> +			continue;

Again O(N) search...

> +		list_for_each_entry(vma, &range->vmas, shared)
> +			referenced += page_referenced_obj_one(vma, page);
> +	}


> @@ -512,7 +532,9 @@ static int
>  try_to_unmap_obj(struct page *page)
>  {
[snip]
> +	list_for_each_entry(range, &mapping->i_mmap, ranges) {
> +		if (range->start > index)
> +			break;     /* Sorted by start address => we are done */
> +		if (range->end < index)
> +			continue;

Here also O(N) search when each vma map a unique set of file pages...

Thanks for posting the code. Your old postings (almost a year ago)
regarding list-of-lists inspired me to develop prio_tree. Thanks.

Rajesh
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/