4 * Copyright (C) 1991, 1992 Linus Torvalds
8 * 'fork.c' contains the help-routines for the 'fork' system call
9 * (see also entry.S and others).
10 * Fork is rather simple, once you get the hang of it, but the memory
11 * management can be a bitch. See 'mm/memory.c': 'copy_page_range()'
14 #include <linux/config.h>
15 #include <linux/slab.h>
16 #include <linux/init.h>
17 #include <linux/unistd.h>
18 #include <linux/smp_lock.h>
19 #include <linux/module.h>
20 #include <linux/vmalloc.h>
21 #include <linux/completion.h>
22 #include <linux/namespace.h>
23 #include <linux/personality.h>
24 #include <linux/mempolicy.h>
25 #include <linux/sem.h>
26 #include <linux/file.h>
27 #include <linux/binfmts.h>
28 #include <linux/mman.h>
30 #include <linux/cpu.h>
31 #include <linux/security.h>
32 #include <linux/syscalls.h>
33 #include <linux/jiffies.h>
34 #include <linux/futex.h>
35 #include <linux/ptrace.h>
36 #include <linux/mount.h>
37 #include <linux/audit.h>
38 #include <linux/rmap.h>
40 #include <asm/pgtable.h>
41 #include <asm/pgalloc.h>
42 #include <asm/uaccess.h>
43 #include <asm/mmu_context.h>
44 #include <asm/cacheflush.h>
45 #include <asm/tlbflush.h>
47 /* The idle threads do not count..
48 * Protected by write_lock_irq(&tasklist_lock)
53 unsigned long total_forks; /* Handle normal Linux uptimes. */
55 DEFINE_PER_CPU(unsigned long, process_counts) = 0;
57 rwlock_t tasklist_lock __cacheline_aligned = RW_LOCK_UNLOCKED; /* outer */
59 EXPORT_SYMBOL(tasklist_lock);
61 int nr_processes(void)
66 for_each_online_cpu(cpu)
67 total += per_cpu(process_counts, cpu);
72 #ifndef __HAVE_ARCH_TASK_STRUCT_ALLOCATOR
73 # define alloc_task_struct() kmem_cache_alloc(task_struct_cachep, GFP_KERNEL)
74 # define free_task_struct(tsk) kmem_cache_free(task_struct_cachep, (tsk))
75 static kmem_cache_t *task_struct_cachep;
78 static void free_task(struct task_struct *tsk)
80 free_thread_info(tsk->thread_info);
81 free_task_struct(tsk);
84 void __put_task_struct(struct task_struct *tsk)
86 WARN_ON(!(tsk->state & (TASK_DEAD | TASK_ZOMBIE)));
87 WARN_ON(atomic_read(&tsk->usage));
88 WARN_ON(tsk == current);
90 if (unlikely(tsk->audit_context))
92 security_task_free(tsk);
94 put_group_info(tsk->group_info);
98 void fastcall add_wait_queue(wait_queue_head_t *q, wait_queue_t * wait)
102 wait->flags &= ~WQ_FLAG_EXCLUSIVE;
103 spin_lock_irqsave(&q->lock, flags);
104 __add_wait_queue(q, wait);
105 spin_unlock_irqrestore(&q->lock, flags);
108 EXPORT_SYMBOL(add_wait_queue);
110 void fastcall add_wait_queue_exclusive(wait_queue_head_t *q, wait_queue_t * wait)
114 wait->flags |= WQ_FLAG_EXCLUSIVE;
115 spin_lock_irqsave(&q->lock, flags);
116 __add_wait_queue_tail(q, wait);
117 spin_unlock_irqrestore(&q->lock, flags);
120 EXPORT_SYMBOL(add_wait_queue_exclusive);
122 void fastcall remove_wait_queue(wait_queue_head_t *q, wait_queue_t * wait)
126 spin_lock_irqsave(&q->lock, flags);
127 __remove_wait_queue(q, wait);
128 spin_unlock_irqrestore(&q->lock, flags);
131 EXPORT_SYMBOL(remove_wait_queue);
135 * Note: we use "set_current_state()" _after_ the wait-queue add,
136 * because we need a memory barrier there on SMP, so that any
137 * wake-function that tests for the wait-queue being active
138 * will be guaranteed to see waitqueue addition _or_ subsequent
139 * tests in this thread will see the wakeup having taken place.
141 * The spin_unlock() itself is semi-permeable and only protects
142 * one way (it only protects stuff inside the critical region and
143 * stops them from bleeding out - it would still allow subsequent
144 * loads to move into the the critical region).
146 void fastcall prepare_to_wait(wait_queue_head_t *q, wait_queue_t *wait, int state)
150 wait->flags &= ~WQ_FLAG_EXCLUSIVE;
151 spin_lock_irqsave(&q->lock, flags);
152 if (list_empty(&wait->task_list))
153 __add_wait_queue(q, wait);
154 set_current_state(state);
155 spin_unlock_irqrestore(&q->lock, flags);
158 EXPORT_SYMBOL(prepare_to_wait);
161 prepare_to_wait_exclusive(wait_queue_head_t *q, wait_queue_t *wait, int state)
165 wait->flags |= WQ_FLAG_EXCLUSIVE;
166 spin_lock_irqsave(&q->lock, flags);
167 if (list_empty(&wait->task_list))
168 __add_wait_queue_tail(q, wait);
169 set_current_state(state);
170 spin_unlock_irqrestore(&q->lock, flags);
173 EXPORT_SYMBOL(prepare_to_wait_exclusive);
175 void fastcall finish_wait(wait_queue_head_t *q, wait_queue_t *wait)
179 __set_current_state(TASK_RUNNING);
181 * We can check for list emptiness outside the lock
183 * - we use the "careful" check that verifies both
184 * the next and prev pointers, so that there cannot
185 * be any half-pending updates in progress on other
186 * CPU's that we haven't seen yet (and that might
187 * still change the stack area.
189 * - all other users take the lock (ie we can only
190 * have _one_ other CPU that looks at or modifies
193 if (!list_empty_careful(&wait->task_list)) {
194 spin_lock_irqsave(&q->lock, flags);
195 list_del_init(&wait->task_list);
196 spin_unlock_irqrestore(&q->lock, flags);
200 EXPORT_SYMBOL(finish_wait);
202 int autoremove_wake_function(wait_queue_t *wait, unsigned mode, int sync, void *key)
204 int ret = default_wake_function(wait, mode, sync, key);
207 list_del_init(&wait->task_list);
211 EXPORT_SYMBOL(autoremove_wake_function);
213 void __init fork_init(unsigned long mempages)
215 #ifndef __HAVE_ARCH_TASK_STRUCT_ALLOCATOR
216 #ifndef ARCH_MIN_TASKALIGN
217 #define ARCH_MIN_TASKALIGN L1_CACHE_BYTES
219 /* create a slab on which task_structs can be allocated */
221 kmem_cache_create("task_struct", sizeof(struct task_struct),
222 ARCH_MIN_TASKALIGN, SLAB_PANIC, NULL, NULL);
226 * The default maximum number of threads is set to a safe
227 * value: the thread structures can take up at most half
230 max_threads = mempages / (THREAD_SIZE/PAGE_SIZE) / 8;
232 * we need to allow at least 20 threads to boot a system
237 init_task.rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
238 init_task.rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
241 static struct task_struct *dup_task_struct(struct task_struct *orig)
243 struct task_struct *tsk;
244 struct thread_info *ti;
246 prepare_to_copy(orig);
248 tsk = alloc_task_struct();
252 ti = alloc_thread_info(tsk);
254 free_task_struct(tsk);
258 *ti = *orig->thread_info;
260 tsk->thread_info = ti;
263 /* One for us, one for whoever does the "release_task()" (usually parent) */
264 atomic_set(&tsk->usage,2);
269 static inline int dup_mmap(struct mm_struct * mm, struct mm_struct * oldmm)
271 struct vm_area_struct * mpnt, *tmp, **pprev;
272 struct rb_node **rb_link, *rb_parent;
274 unsigned long charge = 0;
275 struct mempolicy *pol;
277 down_write(&oldmm->mmap_sem);
278 flush_cache_mm(current->mm);
281 mm->mmap_cache = NULL;
282 mm->free_area_cache = TASK_UNMAPPED_BASE;
285 cpus_clear(mm->cpu_vm_mask);
287 rb_link = &mm->mm_rb.rb_node;
292 * Add it to the mmlist after the parent.
293 * Doing it this way means that we can order the list,
294 * and fork() won't mess up the ordering significantly.
295 * Add it first so that swapoff can see any swap entries.
297 spin_lock(&mmlist_lock);
298 list_add(&mm->mmlist, ¤t->mm->mmlist);
300 spin_unlock(&mmlist_lock);
302 for (mpnt = current->mm->mmap ; mpnt ; mpnt = mpnt->vm_next) {
305 if(mpnt->vm_flags & VM_DONTCOPY)
307 if (mpnt->vm_flags & VM_ACCOUNT) {
308 unsigned int len = (mpnt->vm_end - mpnt->vm_start) >> PAGE_SHIFT;
309 if (security_vm_enough_memory(len))
313 tmp = kmem_cache_alloc(vm_area_cachep, SLAB_KERNEL);
317 pol = mpol_copy(vma_policy(mpnt));
318 retval = PTR_ERR(pol);
320 goto fail_nomem_policy;
321 vma_set_policy(tmp, pol);
322 tmp->vm_flags &= ~VM_LOCKED;
326 vma_prio_tree_init(tmp);
329 struct inode *inode = file->f_dentry->d_inode;
331 if (tmp->vm_flags & VM_DENYWRITE)
332 atomic_dec(&inode->i_writecount);
334 /* insert tmp into the share list, just after mpnt */
335 spin_lock(&file->f_mapping->i_mmap_lock);
336 flush_dcache_mmap_lock(file->f_mapping);
337 vma_prio_tree_add(tmp, mpnt);
338 flush_dcache_mmap_unlock(file->f_mapping);
339 spin_unlock(&file->f_mapping->i_mmap_lock);
343 * Link in the new vma and copy the page table entries:
344 * link in first so that swapoff can see swap entries,
345 * and try_to_unmap_one's find_vma find the new vma.
347 spin_lock(&mm->page_table_lock);
349 pprev = &tmp->vm_next;
351 __vma_link_rb(mm, tmp, rb_link, rb_parent);
352 rb_link = &tmp->vm_rb.rb_right;
353 rb_parent = &tmp->vm_rb;
356 retval = copy_page_range(mm, current->mm, tmp);
357 spin_unlock(&mm->page_table_lock);
359 if (tmp->vm_ops && tmp->vm_ops->open)
360 tmp->vm_ops->open(tmp);
368 flush_tlb_mm(current->mm);
369 up_write(&oldmm->mmap_sem);
372 kmem_cache_free(vm_area_cachep, tmp);
376 vm_unacct_memory(charge);
379 static inline int mm_alloc_pgd(struct mm_struct * mm)
381 mm->pgd = pgd_alloc(mm);
382 if (unlikely(!mm->pgd))
387 static inline void mm_free_pgd(struct mm_struct * mm)
392 #define dup_mmap(mm, oldmm) (0)
393 #define mm_alloc_pgd(mm) (0)
394 #define mm_free_pgd(mm)
395 #endif /* CONFIG_MMU */
397 spinlock_t mmlist_lock __cacheline_aligned_in_smp = SPIN_LOCK_UNLOCKED;
400 #define allocate_mm() (kmem_cache_alloc(mm_cachep, SLAB_KERNEL))
401 #define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
403 #include <linux/init_task.h>
405 static struct mm_struct * mm_init(struct mm_struct * mm)
407 atomic_set(&mm->mm_users, 1);
408 atomic_set(&mm->mm_count, 1);
409 init_rwsem(&mm->mmap_sem);
410 mm->core_waiters = 0;
411 mm->page_table_lock = SPIN_LOCK_UNLOCKED;
412 mm->ioctx_list_lock = RW_LOCK_UNLOCKED;
413 mm->ioctx_list = NULL;
414 mm->default_kioctx = (struct kioctx)INIT_KIOCTX(mm->default_kioctx, *mm);
415 mm->free_area_cache = TASK_UNMAPPED_BASE;
417 if (likely(!mm_alloc_pgd(mm))) {
419 #ifdef __HAVE_ARCH_MMAP_TOP
420 mm->mmap_top = mmap_top();
429 * Allocate and initialize an mm_struct.
431 struct mm_struct * mm_alloc(void)
433 struct mm_struct * mm;
437 memset(mm, 0, sizeof(*mm));
444 * Called when the last reference to the mm
445 * is dropped: either by a lazy thread or by
446 * mmput. Free the page directory and the mm.
448 void fastcall __mmdrop(struct mm_struct *mm)
450 BUG_ON(mm == &init_mm);
457 * Decrement the use count and release all resources for an mm.
459 void mmput(struct mm_struct *mm)
461 if (atomic_dec_and_lock(&mm->mm_users, &mmlist_lock)) {
462 list_del(&mm->mmlist);
464 spin_unlock(&mmlist_lock);
472 * Checks if the use count of an mm is non-zero and if so
473 * returns a reference to it after bumping up the use count.
474 * If the use count is zero, it means this mm is going away,
477 struct mm_struct *mmgrab(struct mm_struct *mm)
479 spin_lock(&mmlist_lock);
480 if (!atomic_read(&mm->mm_users))
483 atomic_inc(&mm->mm_users);
484 spin_unlock(&mmlist_lock);
488 /* Please note the differences between mmput and mm_release.
489 * mmput is called whenever we stop holding onto a mm_struct,
490 * error success whatever.
492 * mm_release is called after a mm_struct has been removed
493 * from the current process.
495 * This difference is important for error handling, when we
496 * only half set up a mm_struct for a new process and need to restore
497 * the old one. Because we mmput the new mm_struct before
498 * restoring the old one. . .
499 * Eric Biederman 10 January 1998
501 void mm_release(struct task_struct *tsk, struct mm_struct *mm)
503 struct completion *vfork_done = tsk->vfork_done;
505 /* Get rid of any cached register state */
506 deactivate_mm(tsk, mm);
508 /* notify parent sleeping on vfork() */
510 tsk->vfork_done = NULL;
511 complete(vfork_done);
513 if (tsk->clear_child_tid && atomic_read(&mm->mm_users) > 1) {
514 u32 __user * tidptr = tsk->clear_child_tid;
515 tsk->clear_child_tid = NULL;
518 * We don't check the error code - if userspace has
519 * not set up a proper pointer then tough luck.
522 sys_futex(tidptr, FUTEX_WAKE, 1, NULL, NULL);
526 static int copy_mm(unsigned long clone_flags, struct task_struct * tsk)
528 struct mm_struct * mm, *oldmm;
531 tsk->min_flt = tsk->maj_flt = 0;
532 tsk->cmin_flt = tsk->cmaj_flt = 0;
533 tsk->nvcsw = tsk->nivcsw = tsk->cnvcsw = tsk->cnivcsw = 0;
536 tsk->active_mm = NULL;
539 * Are we cloning a kernel thread?
541 * We need to steal a active VM for that..
547 if (clone_flags & CLONE_VM) {
548 atomic_inc(&oldmm->mm_users);
551 * There are cases where the PTL is held to ensure no
552 * new threads start up in user mode using an mm, which
553 * allows optimizing out ipis; the tlb_gather_mmu code
556 spin_unlock_wait(&oldmm->page_table_lock);
565 /* Copy the current MM stuff.. */
566 memcpy(mm, oldmm, sizeof(*mm));
570 if (init_new_context(tsk,mm))
573 retval = dup_mmap(mm, oldmm);
589 * If init_new_context() failed, we cannot use mmput() to free the mm
590 * because it calls destroy_context()
597 static inline struct fs_struct *__copy_fs_struct(struct fs_struct *old)
599 struct fs_struct *fs = kmem_cache_alloc(fs_cachep, GFP_KERNEL);
600 /* We don't need to lock fs - think why ;-) */
602 atomic_set(&fs->count, 1);
603 fs->lock = RW_LOCK_UNLOCKED;
604 fs->umask = old->umask;
605 read_lock(&old->lock);
606 fs->rootmnt = mntget(old->rootmnt);
607 fs->root = dget(old->root);
608 fs->pwdmnt = mntget(old->pwdmnt);
609 fs->pwd = dget(old->pwd);
611 fs->altrootmnt = mntget(old->altrootmnt);
612 fs->altroot = dget(old->altroot);
614 fs->altrootmnt = NULL;
617 read_unlock(&old->lock);
622 struct fs_struct *copy_fs_struct(struct fs_struct *old)
624 return __copy_fs_struct(old);
627 EXPORT_SYMBOL_GPL(copy_fs_struct);
629 static inline int copy_fs(unsigned long clone_flags, struct task_struct * tsk)
631 if (clone_flags & CLONE_FS) {
632 atomic_inc(¤t->fs->count);
635 tsk->fs = __copy_fs_struct(current->fs);
641 static int count_open_files(struct files_struct *files, int size)
645 /* Find the last open fd */
646 for (i = size/(8*sizeof(long)); i > 0; ) {
647 if (files->open_fds->fds_bits[--i])
650 i = (i+1) * 8 * sizeof(long);
654 static int copy_files(unsigned long clone_flags, struct task_struct * tsk)
656 struct files_struct *oldf, *newf;
657 struct file **old_fds, **new_fds;
658 int open_files, nfds, size, i, error = 0;
661 * A background process may not have any files ...
663 oldf = current->files;
667 if (clone_flags & CLONE_FILES) {
668 atomic_inc(&oldf->count);
673 * Note: we may be using current for both targets (See exec.c)
674 * This works because we cache current->files (old) as oldf. Don't
679 newf = kmem_cache_alloc(files_cachep, SLAB_KERNEL);
683 atomic_set(&newf->count, 1);
685 newf->file_lock = SPIN_LOCK_UNLOCKED;
687 newf->max_fds = NR_OPEN_DEFAULT;
688 newf->max_fdset = __FD_SETSIZE;
689 newf->close_on_exec = &newf->close_on_exec_init;
690 newf->open_fds = &newf->open_fds_init;
691 newf->fd = &newf->fd_array[0];
693 /* We don't yet have the oldf readlock, but even if the old
694 fdset gets grown now, we'll only copy up to "size" fds */
695 size = oldf->max_fdset;
696 if (size > __FD_SETSIZE) {
698 spin_lock(&newf->file_lock);
699 error = expand_fdset(newf, size-1);
700 spin_unlock(&newf->file_lock);
704 spin_lock(&oldf->file_lock);
706 open_files = count_open_files(oldf, size);
709 * Check whether we need to allocate a larger fd array.
710 * Note: we're not a clone task, so the open count won't
713 nfds = NR_OPEN_DEFAULT;
714 if (open_files > nfds) {
715 spin_unlock(&oldf->file_lock);
717 spin_lock(&newf->file_lock);
718 error = expand_fd_array(newf, open_files-1);
719 spin_unlock(&newf->file_lock);
722 nfds = newf->max_fds;
723 spin_lock(&oldf->file_lock);
729 memcpy(newf->open_fds->fds_bits, oldf->open_fds->fds_bits, open_files/8);
730 memcpy(newf->close_on_exec->fds_bits, oldf->close_on_exec->fds_bits, open_files/8);
732 for (i = open_files; i != 0; i--) {
733 struct file *f = *old_fds++;
738 spin_unlock(&oldf->file_lock);
740 /* compute the remainder to be cleared */
741 size = (newf->max_fds - open_files) * sizeof(struct file *);
743 /* This is long word aligned thus could use a optimized version */
744 memset(new_fds, 0, size);
746 if (newf->max_fdset > open_files) {
747 int left = (newf->max_fdset-open_files)/8;
748 int start = open_files / (8 * sizeof(unsigned long));
750 memset(&newf->open_fds->fds_bits[start], 0, left);
751 memset(&newf->close_on_exec->fds_bits[start], 0, left);
760 free_fdset (newf->close_on_exec, newf->max_fdset);
761 free_fdset (newf->open_fds, newf->max_fdset);
762 kmem_cache_free(files_cachep, newf);
767 * Helper to unshare the files of the current task.
768 * We don't want to expose copy_files internals to
769 * the exec layer of the kernel.
772 int unshare_files(void)
774 struct files_struct *files = current->files;
780 /* This can race but the race causes us to copy when we don't
781 need to and drop the copy */
782 if(atomic_read(&files->count) == 1)
784 atomic_inc(&files->count);
787 rc = copy_files(0, current);
789 current->files = files;
793 EXPORT_SYMBOL(unshare_files);
795 static inline int copy_sighand(unsigned long clone_flags, struct task_struct * tsk)
797 struct sighand_struct *sig;
799 if (clone_flags & (CLONE_SIGHAND | CLONE_THREAD)) {
800 atomic_inc(¤t->sighand->count);
803 sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
807 spin_lock_init(&sig->siglock);
808 atomic_set(&sig->count, 1);
809 memcpy(sig->action, current->sighand->action, sizeof(sig->action));
813 static inline int copy_signal(unsigned long clone_flags, struct task_struct * tsk)
815 struct signal_struct *sig;
817 if (clone_flags & CLONE_THREAD) {
818 atomic_inc(¤t->signal->count);
821 sig = kmem_cache_alloc(signal_cachep, GFP_KERNEL);
825 atomic_set(&sig->count, 1);
827 sig->group_exit_code = 0;
828 sig->group_exit_task = NULL;
829 sig->group_stop_count = 0;
830 sig->curr_target = NULL;
831 init_sigpending(&sig->shared_pending);
832 INIT_LIST_HEAD(&sig->posix_timers);
834 sig->tty = current->signal->tty;
835 sig->pgrp = process_group(current);
836 sig->session = current->signal->session;
837 sig->leader = 0; /* session leadership doesn't inherit */
838 sig->tty_old_pgrp = 0;
843 static inline void copy_flags(unsigned long clone_flags, struct task_struct *p)
845 unsigned long new_flags = p->flags;
847 new_flags &= ~PF_SUPERPRIV;
848 new_flags |= PF_FORKNOEXEC;
849 if (!(clone_flags & CLONE_PTRACE))
851 p->flags = new_flags;
854 asmlinkage long sys_set_tid_address(int __user *tidptr)
856 current->clear_child_tid = tidptr;
862 * This creates a new process as a copy of the old one,
863 * but does not actually start it yet.
865 * It copies the registers, and all the appropriate
866 * parts of the process environment (as per the clone
867 * flags). The actual kick-off is left to the caller.
869 struct task_struct *copy_process(unsigned long clone_flags,
870 unsigned long stack_start,
871 struct pt_regs *regs,
872 unsigned long stack_size,
873 int __user *parent_tidptr,
874 int __user *child_tidptr)
877 struct task_struct *p = NULL;
879 if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
880 return ERR_PTR(-EINVAL);
883 * Thread groups must share signals as well, and detached threads
884 * can only be started up within the thread group.
886 if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
887 return ERR_PTR(-EINVAL);
890 * Shared signal handlers imply shared VM. By way of the above,
891 * thread groups also imply shared VM. Blocking this case allows
892 * for various simplifications in other code.
894 if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
895 return ERR_PTR(-EINVAL);
897 retval = security_task_create(clone_flags);
902 p = dup_task_struct(current);
908 if (atomic_read(&p->user->processes) >=
909 p->rlim[RLIMIT_NPROC].rlim_cur) {
910 if (!capable(CAP_SYS_ADMIN) && !capable(CAP_SYS_RESOURCE) &&
911 p->user != &root_user)
915 atomic_inc(&p->user->__count);
916 atomic_inc(&p->user->processes);
917 get_group_info(p->group_info);
920 * If multiple threads are within copy_process(), then this check
921 * triggers too late. This doesn't hurt, the check is only there
922 * to stop root fork bombs.
924 if (nr_threads >= max_threads)
925 goto bad_fork_cleanup_count;
927 if (!try_module_get(p->thread_info->exec_domain->module))
928 goto bad_fork_cleanup_count;
930 if (p->binfmt && !try_module_get(p->binfmt->module))
931 goto bad_fork_cleanup_put_domain;
934 copy_flags(clone_flags, p);
935 if (clone_flags & CLONE_IDLETASK)
938 p->pid = alloc_pidmap();
940 goto bad_fork_cleanup;
943 if (clone_flags & CLONE_PARENT_SETTID)
944 if (put_user(p->pid, parent_tidptr))
945 goto bad_fork_cleanup;
947 p->proc_dentry = NULL;
949 INIT_LIST_HEAD(&p->children);
950 INIT_LIST_HEAD(&p->sibling);
951 init_waitqueue_head(&p->wait_chldexit);
952 p->vfork_done = NULL;
953 spin_lock_init(&p->alloc_lock);
954 spin_lock_init(&p->proc_lock);
956 clear_tsk_thread_flag(p, TIF_SIGPENDING);
957 init_sigpending(&p->pending);
959 p->it_real_value = p->it_virt_value = p->it_prof_value = 0;
960 p->it_real_incr = p->it_virt_incr = p->it_prof_incr = 0;
961 init_timer(&p->real_timer);
962 p->real_timer.data = (unsigned long) p;
964 p->utime = p->stime = 0;
965 p->cutime = p->cstime = 0;
966 p->lock_depth = -1; /* -1 = no lock */
967 p->start_time = get_jiffies_64();
969 p->io_context = NULL;
970 p->audit_context = NULL;
972 p->mempolicy = mpol_copy(p->mempolicy);
973 if (IS_ERR(p->mempolicy)) {
974 retval = PTR_ERR(p->mempolicy);
976 goto bad_fork_cleanup;
981 if ((retval = security_task_alloc(p)))
982 goto bad_fork_cleanup_policy;
983 if ((retval = audit_alloc(p)))
984 goto bad_fork_cleanup_security;
985 /* copy all the process information */
986 if ((retval = copy_semundo(clone_flags, p)))
987 goto bad_fork_cleanup_audit;
988 if ((retval = copy_files(clone_flags, p)))
989 goto bad_fork_cleanup_semundo;
990 if ((retval = copy_fs(clone_flags, p)))
991 goto bad_fork_cleanup_files;
992 if ((retval = copy_sighand(clone_flags, p)))
993 goto bad_fork_cleanup_fs;
994 if ((retval = copy_signal(clone_flags, p)))
995 goto bad_fork_cleanup_sighand;
996 if ((retval = copy_mm(clone_flags, p)))
997 goto bad_fork_cleanup_signal;
998 if ((retval = copy_namespace(clone_flags, p)))
999 goto bad_fork_cleanup_mm;
1000 retval = copy_thread(0, clone_flags, stack_start, stack_size, p, regs);
1002 goto bad_fork_cleanup_namespace;
1004 p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? child_tidptr : NULL;
1006 * Clear TID on mm_release()?
1008 p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? child_tidptr: NULL;
1011 * Syscall tracing should be turned off in the child regardless
1014 clear_tsk_thread_flag(p, TIF_SYSCALL_TRACE);
1016 /* Our parent execution domain becomes current domain
1017 These must match for thread signalling to apply */
1019 p->parent_exec_id = p->self_exec_id;
1021 /* ok, now we should be set up.. */
1022 p->exit_signal = (clone_flags & CLONE_THREAD) ? -1 : (clone_flags & CSIGNAL);
1023 p->pdeath_signal = 0;
1025 /* Perform scheduler related setup */
1029 * Ok, make it visible to the rest of the system.
1030 * We dont wake it up yet.
1033 p->group_leader = p;
1034 INIT_LIST_HEAD(&p->ptrace_children);
1035 INIT_LIST_HEAD(&p->ptrace_list);
1037 /* Need tasklist lock for parent etc handling! */
1038 write_lock_irq(&tasklist_lock);
1040 * Check for pending SIGKILL! The new thread should not be allowed
1041 * to slip out of an OOM kill. (or normal SIGKILL.)
1043 if (sigismember(¤t->pending.signal, SIGKILL)) {
1044 write_unlock_irq(&tasklist_lock);
1046 goto bad_fork_cleanup_namespace;
1049 /* CLONE_PARENT re-uses the old parent */
1050 if (clone_flags & CLONE_PARENT)
1051 p->real_parent = current->real_parent;
1053 p->real_parent = current;
1054 p->parent = p->real_parent;
1056 if (clone_flags & CLONE_THREAD) {
1057 spin_lock(¤t->sighand->siglock);
1059 * Important: if an exit-all has been started then
1060 * do not create this new thread - the whole thread
1061 * group is supposed to exit anyway.
1063 if (current->signal->group_exit) {
1064 spin_unlock(¤t->sighand->siglock);
1065 write_unlock_irq(&tasklist_lock);
1067 goto bad_fork_cleanup_namespace;
1069 p->tgid = current->tgid;
1070 p->group_leader = current->group_leader;
1072 if (current->signal->group_stop_count > 0) {
1074 * There is an all-stop in progress for the group.
1075 * We ourselves will stop as soon as we check signals.
1076 * Make the new thread part of that group stop too.
1078 current->signal->group_stop_count++;
1079 set_tsk_thread_flag(p, TIF_SIGPENDING);
1082 spin_unlock(¤t->sighand->siglock);
1086 if (p->ptrace & PT_PTRACED)
1087 __ptrace_link(p, current->parent);
1089 attach_pid(p, PIDTYPE_PID, p->pid);
1090 if (thread_group_leader(p)) {
1091 attach_pid(p, PIDTYPE_TGID, p->tgid);
1092 attach_pid(p, PIDTYPE_PGID, process_group(p));
1093 attach_pid(p, PIDTYPE_SID, p->signal->session);
1095 __get_cpu_var(process_counts)++;
1097 link_pid(p, p->pids + PIDTYPE_TGID, &p->group_leader->pids[PIDTYPE_TGID].pid);
1100 write_unlock_irq(&tasklist_lock);
1105 return ERR_PTR(retval);
1108 bad_fork_cleanup_namespace:
1110 bad_fork_cleanup_mm:
1113 mmdrop(p->active_mm);
1114 bad_fork_cleanup_signal:
1116 bad_fork_cleanup_sighand:
1118 bad_fork_cleanup_fs:
1119 exit_fs(p); /* blocking */
1120 bad_fork_cleanup_files:
1121 exit_files(p); /* blocking */
1122 bad_fork_cleanup_semundo:
1124 bad_fork_cleanup_audit:
1126 bad_fork_cleanup_security:
1127 security_task_free(p);
1128 bad_fork_cleanup_policy:
1130 mpol_free(p->mempolicy);
1134 free_pidmap(p->pid);
1136 module_put(p->binfmt->module);
1137 bad_fork_cleanup_put_domain:
1138 module_put(p->thread_info->exec_domain->module);
1139 bad_fork_cleanup_count:
1140 put_group_info(p->group_info);
1141 atomic_dec(&p->user->processes);
1148 static inline int fork_traceflag (unsigned clone_flags)
1150 if (clone_flags & (CLONE_UNTRACED | CLONE_IDLETASK))
1152 else if (clone_flags & CLONE_VFORK) {
1153 if (current->ptrace & PT_TRACE_VFORK)
1154 return PTRACE_EVENT_VFORK;
1155 } else if ((clone_flags & CSIGNAL) != SIGCHLD) {
1156 if (current->ptrace & PT_TRACE_CLONE)
1157 return PTRACE_EVENT_CLONE;
1158 } else if (current->ptrace & PT_TRACE_FORK)
1159 return PTRACE_EVENT_FORK;
1165 * Ok, this is the main fork-routine.
1167 * It copies the process, and if successful kick-starts
1168 * it and waits for it to finish using the VM if required.
1170 long do_fork(unsigned long clone_flags,
1171 unsigned long stack_start,
1172 struct pt_regs *regs,
1173 unsigned long stack_size,
1174 int __user *parent_tidptr,
1175 int __user *child_tidptr)
1177 struct task_struct *p;
1181 if (unlikely(current->ptrace)) {
1182 trace = fork_traceflag (clone_flags);
1184 clone_flags |= CLONE_PTRACE;
1187 p = copy_process(clone_flags, stack_start, regs, stack_size, parent_tidptr, child_tidptr);
1189 * Do this prior waking up the new thread - the thread pointer
1190 * might get invalid after that point, if the thread exits quickly.
1192 pid = IS_ERR(p) ? PTR_ERR(p) : p->pid;
1195 struct completion vfork;
1197 if (clone_flags & CLONE_VFORK) {
1198 p->vfork_done = &vfork;
1199 init_completion(&vfork);
1202 if ((p->ptrace & PT_PTRACED) || (clone_flags & CLONE_STOPPED)) {
1204 * We'll start up with an immediate SIGSTOP.
1206 sigaddset(&p->pending.signal, SIGSTOP);
1207 set_tsk_thread_flag(p, TIF_SIGPENDING);
1210 if (!(clone_flags & CLONE_STOPPED)) {
1212 * Do the wakeup last. On SMP we treat fork() and
1213 * CLONE_VM separately, because fork() has already
1214 * created cache footprint on this CPU (due to
1215 * copying the pagetables), hence migration would
1216 * probably be costy. Threads on the other hand
1217 * have less traction to the current CPU, and if
1218 * there's an imbalance then the scheduler can
1219 * migrate this fresh thread now, before it
1220 * accumulates a larger cache footprint:
1222 if (clone_flags & CLONE_VM)
1223 wake_up_forked_thread(p);
1225 wake_up_forked_process(p);
1227 int cpu = get_cpu();
1229 p->state = TASK_STOPPED;
1230 if (cpu_is_offline(task_cpu(p)))
1231 set_task_cpu(p, cpu);
1237 if (unlikely (trace)) {
1238 current->ptrace_message = pid;
1239 ptrace_notify ((trace << 8) | SIGTRAP);
1242 if (clone_flags & CLONE_VFORK) {
1243 wait_for_completion(&vfork);
1244 if (unlikely (current->ptrace & PT_TRACE_VFORK_DONE))
1245 ptrace_notify ((PTRACE_EVENT_VFORK_DONE << 8) | SIGTRAP);
1248 * Let the child process run first, to avoid most of the
1249 * COW overhead when the child exec()s afterwards.
1256 /* SLAB cache for signal_struct structures (tsk->signal) */
1257 kmem_cache_t *signal_cachep;
1259 /* SLAB cache for sighand_struct structures (tsk->sighand) */
1260 kmem_cache_t *sighand_cachep;
1262 /* SLAB cache for files_struct structures (tsk->files) */
1263 kmem_cache_t *files_cachep;
1265 /* SLAB cache for fs_struct structures (tsk->fs) */
1266 kmem_cache_t *fs_cachep;
1268 /* SLAB cache for vm_area_struct structures */
1269 kmem_cache_t *vm_area_cachep;
1271 /* SLAB cache for mm_struct structures (tsk->mm) */
1272 kmem_cache_t *mm_cachep;
1274 void __init proc_caches_init(void)
1276 sighand_cachep = kmem_cache_create("sighand_cache",
1277 sizeof(struct sighand_struct), 0,
1278 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
1279 signal_cachep = kmem_cache_create("signal_cache",
1280 sizeof(struct signal_struct), 0,
1281 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
1282 files_cachep = kmem_cache_create("files_cache",
1283 sizeof(struct files_struct), 0,
1284 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
1285 fs_cachep = kmem_cache_create("fs_cache",
1286 sizeof(struct fs_struct), 0,
1287 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
1288 vm_area_cachep = kmem_cache_create("vm_area_struct",
1289 sizeof(struct vm_area_struct), 0,
1290 SLAB_PANIC, NULL, NULL);
1291 mm_cachep = kmem_cache_create("mm_struct",
1292 sizeof(struct mm_struct), 0,
1293 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);