Commit 6c431a13 authored by KOSAKI Motohiro's avatar KOSAKI Motohiro Committed by james toy

On ia64, the following test program exit abnormally, because glibc thread

library called abort().

 ========================================================
 (gdb) bt
 #0  0xa000000000010620 in __kernel_syscall_via_break ()
 #1  0x20000000003208e0 in raise () from /lib/libc.so.6.1
 #2  0x2000000000324090 in abort () from /lib/libc.so.6.1
 #3  0x200000000027c3e0 in __deallocate_stack () from /lib/libpthread.so.0
 #4  0x200000000027f7c0 in start_thread () from /lib/libpthread.so.0
 #5  0x200000000047ef60 in __clone2 () from /lib/libc.so.6.1
 ========================================================

The fact is, glibc call munmap() when thread exitng time for freeing
stack, and it assume munlock() never fail.  However, munmap() often make
vma splitting and it with many mapcount make -ENOMEM.

Oh well, that's crazy, because stack unmapping never increase mapcount. 
The maxcount exceeding is only temporary.  internal temporary exceeding
shouldn't make ENOMEM.

This patch does it.

 test_max_mapcount.c
 ==================================================================
  #include<stdio.h>
  #include<stdlib.h>
  #include<string.h>
  #include<pthread.h>
  #include<errno.h>
  #include<unistd.h>

  #define THREAD_NUM 30000
  #define MAL_SIZE (8*1024*1024)

 void *wait_thread(void *args)
 {
 	void *addr;

 	addr = malloc(MAL_SIZE);
 	sleep(10);

 	return NULL;
 }

 void *wait_thread2(void *args)
 {
 	sleep(60);

 	return NULL;
 }

 int main(int argc, char *argv[])
 {
 	int i;
 	pthread_t thread[THREAD_NUM], th;
 	int ret, count = 0;
 	pthread_attr_t attr;

 	ret = pthread_attr_init(&attr);
 	if(ret) {
 		perror("pthread_attr_init");
 	}

 	ret = pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
 	if(ret) {
 		perror("pthread_attr_setdetachstate");
 	}

 	for (i = 0; i < THREAD_NUM; i++) {
 		ret = pthread_create(&th, &attr, wait_thread, NULL);
 		if(ret) {
 			fprintf(stderr, "[%d] ", count);
 			perror("pthread_create");
 		} else {
 			printf("[%d] create OK.\n", count);
 		}
 		count++;

 		ret = pthread_create(&thread[i], &attr, wait_thread2, NULL);
 		if(ret) {
 			fprintf(stderr, "[%d] ", count);
 			perror("pthread_create");
 		} else {
 			printf("[%d] create OK.\n", count);
 		}
 		count++;
 	}

 	sleep(3600);
 	return 0;
 }
 ==================================================================
Signed-off-by: default avatarKOSAKI Motohiro <kosaki.motohiro@jp.fujitsu.com>
Signed-off-by: default avatarHugh Dickins <hugh.dickins@tiscali.co.uk>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
parent e7ff8c38
...@@ -1825,10 +1825,10 @@ detach_vmas_to_be_unmapped(struct mm_struct *mm, struct vm_area_struct *vma, ...@@ -1825,10 +1825,10 @@ detach_vmas_to_be_unmapped(struct mm_struct *mm, struct vm_area_struct *vma,
} }
/* /*
* Split a vma into two pieces at address 'addr', a new vma is allocated * __split_vma() bypasses sysctl_max_map_count checking. We use this on the
* either for the first part or the tail. * munmap path where it doesn't make sense to fail.
*/ */
int split_vma(struct mm_struct * mm, struct vm_area_struct * vma, static int __split_vma(struct mm_struct * mm, struct vm_area_struct * vma,
unsigned long addr, int new_below) unsigned long addr, int new_below)
{ {
struct mempolicy *pol; struct mempolicy *pol;
...@@ -1838,9 +1838,6 @@ int split_vma(struct mm_struct * mm, struct vm_area_struct * vma, ...@@ -1838,9 +1838,6 @@ int split_vma(struct mm_struct * mm, struct vm_area_struct * vma,
~(huge_page_mask(hstate_vma(vma))))) ~(huge_page_mask(hstate_vma(vma)))))
return -EINVAL; return -EINVAL;
if (mm->map_count >= sysctl_max_map_count)
return -ENOMEM;
new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL); new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
if (!new) if (!new)
return -ENOMEM; return -ENOMEM;
...@@ -1880,6 +1877,19 @@ int split_vma(struct mm_struct * mm, struct vm_area_struct * vma, ...@@ -1880,6 +1877,19 @@ int split_vma(struct mm_struct * mm, struct vm_area_struct * vma,
return 0; return 0;
} }
/*
* Split a vma into two pieces at address 'addr', a new vma is allocated
* either for the first part or the tail.
*/
int split_vma(struct mm_struct * mm, struct vm_area_struct * vma,
unsigned long addr, int new_below)
{
if (mm->map_count >= sysctl_max_map_count)
return -ENOMEM;
return __split_vma(mm, vma, addr, new_below);
}
/* Munmap is split into 2 main parts -- this part which finds /* Munmap is split into 2 main parts -- this part which finds
* what needs doing, and the areas themselves, which do the * what needs doing, and the areas themselves, which do the
* work. This now handles partial unmappings. * work. This now handles partial unmappings.
...@@ -1915,7 +1925,17 @@ int do_munmap(struct mm_struct *mm, unsigned long start, size_t len) ...@@ -1915,7 +1925,17 @@ int do_munmap(struct mm_struct *mm, unsigned long start, size_t len)
* places tmp vma above, and higher split_vma places tmp vma below. * places tmp vma above, and higher split_vma places tmp vma below.
*/ */
if (start > vma->vm_start) { if (start > vma->vm_start) {
int error = split_vma(mm, vma, start, 0); int error;
/*
* Make sure that map_count on return from munmap() will
* not exceed its limit; but let map_count go just above
* its limit temporarily, to help free resources as expected.
*/
if (end < vma->vm_end && mm->map_count >= sysctl_max_map_count)
return -ENOMEM;
error = __split_vma(mm, vma, start, 0);
if (error) if (error)
return error; return error;
prev = vma; prev = vma;
...@@ -1924,7 +1944,7 @@ int do_munmap(struct mm_struct *mm, unsigned long start, size_t len) ...@@ -1924,7 +1944,7 @@ int do_munmap(struct mm_struct *mm, unsigned long start, size_t len)
/* Does it split the last one? */ /* Does it split the last one? */
last = find_vma(mm, end); last = find_vma(mm, end);
if (last && end > last->vm_start) { if (last && end > last->vm_start) {
int error = split_vma(mm, last, end, 1); int error = __split_vma(mm, last, end, 1);
if (error) if (error)
return error; return error;
} }
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment