Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 96822904 authored by Andy Whitcroft's avatar Andy Whitcroft Committed by Linus Torvalds
Browse files

hugetlb: move reservation region support earlier 



The following patch will require use of the reservation regions support.
Move this earlier in the file.  No changes have been made to this code.

Signed-off-by: default avatarAndy Whitcroft <apw@shadowen.org>
Cc: Mel Gorman <mel@csn.ul.ie>
Acked-by: default avatarAdam Litke <agl@us.ibm.com>
Cc: Johannes Weiner <hannes@saeurebad.de>
Cc: Andy Whitcroft <apw@shadowen.org>
Cc: William Lee Irwin III <wli@holomorphy.com>
Cc: Hugh Dickins <hugh@veritas.com>
Cc: Michael Kerrisk <mtk.manpages@googlemail.com>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent cdfd4325

mm/hugetlb.c

+125 −121
Original line number Original line Diff line number Diff line
@@ -40,6 +40,131 @@ static int hugetlb_next_nid; 
 */

 */

static DEFINE_SPINLOCK(hugetlb_lock);

static DEFINE_SPINLOCK(hugetlb_lock);





/*

 * Region tracking -- allows tracking of reservations and instantiated pages

 *                    across the pages in a mapping.

 */

struct file_region {

	struct list_head link;

	long from;

	long to;

};



static long region_add(struct list_head *head, long f, long t)

{

	struct file_region *rg, *nrg, *trg;



	/* Locate the region we are either in or before. */

	list_for_each_entry(rg, head, link)

		if (f <= rg->to)

			break;



	/* Round our left edge to the current segment if it encloses us. */

	if (f > rg->from)

		f = rg->from;



	/* Check for and consume any regions we now overlap with. */

	nrg = rg;

	list_for_each_entry_safe(rg, trg, rg->link.prev, link) {

		if (&rg->link == head)

			break;

		if (rg->from > t)

			break;



		/* If this area reaches higher then extend our area to

		 * include it completely.  If this is not the first area

		 * which we intend to reuse, free it. */

		if (rg->to > t)

			t = rg->to;

		if (rg != nrg) {

			list_del(&rg->link);

			kfree(rg);

		}

	}

	nrg->from = f;

	nrg->to = t;

	return 0;

}



static long region_chg(struct list_head *head, long f, long t)

{

	struct file_region *rg, *nrg;

	long chg = 0;



	/* Locate the region we are before or in. */

	list_for_each_entry(rg, head, link)

		if (f <= rg->to)

			break;



	/* If we are below the current region then a new region is required.

	 * Subtle, allocate a new region at the position but make it zero

	 * size such that we can guarantee to record the reservation. */

	if (&rg->link == head || t < rg->from) {

		nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);

		if (!nrg)

			return -ENOMEM;

		nrg->from = f;

		nrg->to   = f;

		INIT_LIST_HEAD(&nrg->link);

		list_add(&nrg->link, rg->link.prev);



		return t - f;

	}



	/* Round our left edge to the current segment if it encloses us. */

	if (f > rg->from)

		f = rg->from;

	chg = t - f;



	/* Check for and consume any regions we now overlap with. */

	list_for_each_entry(rg, rg->link.prev, link) {

		if (&rg->link == head)

			break;

		if (rg->from > t)

			return chg;



		/* We overlap with this area, if it extends futher than

		 * us then we must extend ourselves.  Account for its

		 * existing reservation. */

		if (rg->to > t) {

			chg += rg->to - t;

			t = rg->to;

		}

		chg -= rg->to - rg->from;

	}

	return chg;

}



static long region_truncate(struct list_head *head, long end)

{

	struct file_region *rg, *trg;

	long chg = 0;



	/* Locate the region we are either in or before. */

	list_for_each_entry(rg, head, link)

		if (end <= rg->to)

			break;

	if (&rg->link == head)

		return 0;



	/* If we are in the middle of a region then adjust it. */

	if (end > rg->from) {

		chg = rg->to - end;

		rg->to = end;

		rg = list_entry(rg->link.next, typeof(*rg), link);

	}



	/* Drop any remaining regions. */

	list_for_each_entry_safe(rg, trg, rg->link.prev, link) {

		if (&rg->link == head)

			break;

		chg += rg->to - rg->from;

		list_del(&rg->link);

		kfree(rg);

	}

	return chg;

}



/*

/*

 * Convert the address within this vma to the page offset within

 * Convert the address within this vma to the page offset within

 * the mapping, in base page units.

 * the mapping, in base page units.
@@ -1429,127 +1554,6 @@ void hugetlb_change_protection(struct vm_area_struct *vma, 
	flush_tlb_range(vma, start, end);

	flush_tlb_range(vma, start, end);

}

}





struct file_region {

	struct list_head link;

	long from;

	long to;

};



static long region_add(struct list_head *head, long f, long t)

{

	struct file_region *rg, *nrg, *trg;



	/* Locate the region we are either in or before. */

	list_for_each_entry(rg, head, link)

		if (f <= rg->to)

			break;



	/* Round our left edge to the current segment if it encloses us. */

	if (f > rg->from)

		f = rg->from;



	/* Check for and consume any regions we now overlap with. */

	nrg = rg;

	list_for_each_entry_safe(rg, trg, rg->link.prev, link) {

		if (&rg->link == head)

			break;

		if (rg->from > t)

			break;



		/* If this area reaches higher then extend our area to

		 * include it completely.  If this is not the first area

		 * which we intend to reuse, free it. */

		if (rg->to > t)

			t = rg->to;

		if (rg != nrg) {

			list_del(&rg->link);

			kfree(rg);

		}

	}

	nrg->from = f;

	nrg->to = t;

	return 0;

}



static long region_chg(struct list_head *head, long f, long t)

{

	struct file_region *rg, *nrg;

	long chg = 0;



	/* Locate the region we are before or in. */

	list_for_each_entry(rg, head, link)

		if (f <= rg->to)

			break;



	/* If we are below the current region then a new region is required.

	 * Subtle, allocate a new region at the position but make it zero

	 * size such that we can guarantee to record the reservation. */

	if (&rg->link == head || t < rg->from) {

		nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);

		if (!nrg)

			return -ENOMEM;

		nrg->from = f;

		nrg->to   = f;

		INIT_LIST_HEAD(&nrg->link);

		list_add(&nrg->link, rg->link.prev);



		return t - f;

	}



	/* Round our left edge to the current segment if it encloses us. */

	if (f > rg->from)

		f = rg->from;

	chg = t - f;



	/* Check for and consume any regions we now overlap with. */

	list_for_each_entry(rg, rg->link.prev, link) {

		if (&rg->link == head)

			break;

		if (rg->from > t)

			return chg;



		/* We overlap with this area, if it extends futher than

		 * us then we must extend ourselves.  Account for its

		 * existing reservation. */

		if (rg->to > t) {

			chg += rg->to - t;

			t = rg->to;

		}

		chg -= rg->to - rg->from;

	}

	return chg;

}



static long region_truncate(struct list_head *head, long end)

{

	struct file_region *rg, *trg;

	long chg = 0;



	/* Locate the region we are either in or before. */

	list_for_each_entry(rg, head, link)

		if (end <= rg->to)

			break;

	if (&rg->link == head)

		return 0;



	/* If we are in the middle of a region then adjust it. */

	if (end > rg->from) {

		chg = rg->to - end;

		rg->to = end;

		rg = list_entry(rg->link.next, typeof(*rg), link);

	}



	/* Drop any remaining regions. */

	list_for_each_entry_safe(rg, trg, rg->link.prev, link) {

		if (&rg->link == head)

			break;

		chg += rg->to - rg->from;

		list_del(&rg->link);

		kfree(rg);

	}

	return chg;

}



int hugetlb_reserve_pages(struct inode *inode,

int hugetlb_reserve_pages(struct inode *inode,

					long from, long to,

					long from, long to,

					struct vm_area_struct *vma)

					struct vm_area_struct *vma)