fork.c 43 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769
  1. /*
  2. * linux/kernel/fork.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. /*
  7. * 'fork.c' contains the help-routines for the 'fork' system call
  8. * (see also entry.S and others).
  9. * Fork is rather simple, once you get the hang of it, but the memory
  10. * management can be a bitch. See 'mm/memory.c': 'copy_page_range()'
  11. */
  12. #include <linux/slab.h>
  13. #include <linux/init.h>
  14. #include <linux/unistd.h>
  15. #include <linux/smp_lock.h>
  16. #include <linux/module.h>
  17. #include <linux/vmalloc.h>
  18. #include <linux/completion.h>
  19. #include <linux/namespace.h>
  20. #include <linux/personality.h>
  21. #include <linux/mempolicy.h>
  22. #include <linux/sem.h>
  23. #include <linux/file.h>
  24. #include <linux/key.h>
  25. #include <linux/binfmts.h>
  26. #include <linux/mman.h>
  27. #include <linux/fs.h>
  28. #include <linux/nsproxy.h>
  29. #include <linux/capability.h>
  30. #include <linux/cpu.h>
  31. #include <linux/cpuset.h>
  32. #include <linux/security.h>
  33. #include <linux/swap.h>
  34. #include <linux/syscalls.h>
  35. #include <linux/jiffies.h>
  36. #include <linux/futex.h>
  37. #include <linux/rcupdate.h>
  38. #include <linux/ptrace.h>
  39. #include <linux/mount.h>
  40. #include <linux/audit.h>
  41. #include <linux/profile.h>
  42. #include <linux/rmap.h>
  43. #include <linux/acct.h>
  44. #include <linux/tsacct_kern.h>
  45. #include <linux/cn_proc.h>
  46. #include <linux/delayacct.h>
  47. #include <linux/taskstats_kern.h>
  48. #include <linux/random.h>
  49. #include <asm/pgtable.h>
  50. #include <asm/pgalloc.h>
  51. #include <asm/uaccess.h>
  52. #include <asm/mmu_context.h>
  53. #include <asm/cacheflush.h>
  54. #include <asm/tlbflush.h>
  55. /*
  56. * Protected counters by write_lock_irq(&tasklist_lock)
  57. */
  58. unsigned long total_forks; /* Handle normal Linux uptimes. */
  59. int nr_threads; /* The idle threads do not count.. */
  60. int max_threads; /* tunable limit on nr_threads */
  61. DEFINE_PER_CPU(unsigned long, process_counts) = 0;
  62. __cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */
  63. int nr_processes(void)
  64. {
  65. int cpu;
  66. int total = 0;
  67. for_each_online_cpu(cpu)
  68. total += per_cpu(process_counts, cpu);
  69. return total;
  70. }
  71. #ifndef __HAVE_ARCH_TASK_STRUCT_ALLOCATOR
  72. # define alloc_task_struct() kmem_cache_alloc(task_struct_cachep, GFP_KERNEL)
  73. # define free_task_struct(tsk) kmem_cache_free(task_struct_cachep, (tsk))
  74. static struct kmem_cache *task_struct_cachep;
  75. #endif
  76. /* SLAB cache for signal_struct structures (tsk->signal) */
  77. static struct kmem_cache *signal_cachep;
  78. /* SLAB cache for sighand_struct structures (tsk->sighand) */
  79. struct kmem_cache *sighand_cachep;
  80. /* SLAB cache for files_struct structures (tsk->files) */
  81. struct kmem_cache *files_cachep;
  82. /* SLAB cache for fs_struct structures (tsk->fs) */
  83. struct kmem_cache *fs_cachep;
  84. /* SLAB cache for vm_area_struct structures */
  85. struct kmem_cache *vm_area_cachep;
  86. /* SLAB cache for mm_struct structures (tsk->mm) */
  87. static struct kmem_cache *mm_cachep;
  88. void free_task(struct task_struct *tsk)
  89. {
  90. free_thread_info(tsk->thread_info);
  91. rt_mutex_debug_task_free(tsk);
  92. free_task_struct(tsk);
  93. }
  94. EXPORT_SYMBOL(free_task);
  95. void __put_task_struct(struct task_struct *tsk)
  96. {
  97. WARN_ON(!(tsk->exit_state & (EXIT_DEAD | EXIT_ZOMBIE)));
  98. WARN_ON(atomic_read(&tsk->usage));
  99. WARN_ON(tsk == current);
  100. security_task_free(tsk);
  101. free_uid(tsk->user);
  102. put_group_info(tsk->group_info);
  103. delayacct_tsk_free(tsk);
  104. if (!profile_handoff_task(tsk))
  105. free_task(tsk);
  106. }
  107. void __init fork_init(unsigned long mempages)
  108. {
  109. #ifndef __HAVE_ARCH_TASK_STRUCT_ALLOCATOR
  110. #ifndef ARCH_MIN_TASKALIGN
  111. #define ARCH_MIN_TASKALIGN L1_CACHE_BYTES
  112. #endif
  113. /* create a slab on which task_structs can be allocated */
  114. task_struct_cachep =
  115. kmem_cache_create("task_struct", sizeof(struct task_struct),
  116. ARCH_MIN_TASKALIGN, SLAB_PANIC, NULL, NULL);
  117. #endif
  118. /*
  119. * The default maximum number of threads is set to a safe
  120. * value: the thread structures can take up at most half
  121. * of memory.
  122. */
  123. max_threads = mempages / (8 * THREAD_SIZE / PAGE_SIZE);
  124. /*
  125. * we need to allow at least 20 threads to boot a system
  126. */
  127. if(max_threads < 20)
  128. max_threads = 20;
  129. init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
  130. init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
  131. init_task.signal->rlim[RLIMIT_SIGPENDING] =
  132. init_task.signal->rlim[RLIMIT_NPROC];
  133. }
  134. static struct task_struct *dup_task_struct(struct task_struct *orig)
  135. {
  136. struct task_struct *tsk;
  137. struct thread_info *ti;
  138. prepare_to_copy(orig);
  139. tsk = alloc_task_struct();
  140. if (!tsk)
  141. return NULL;
  142. ti = alloc_thread_info(tsk);
  143. if (!ti) {
  144. free_task_struct(tsk);
  145. return NULL;
  146. }
  147. *tsk = *orig;
  148. tsk->thread_info = ti;
  149. setup_thread_stack(tsk, orig);
  150. #ifdef CONFIG_CC_STACKPROTECTOR
  151. tsk->stack_canary = get_random_int();
  152. #endif
  153. /* One for us, one for whoever does the "release_task()" (usually parent) */
  154. atomic_set(&tsk->usage,2);
  155. atomic_set(&tsk->fs_excl, 0);
  156. #ifdef CONFIG_BLK_DEV_IO_TRACE
  157. tsk->btrace_seq = 0;
  158. #endif
  159. tsk->splice_pipe = NULL;
  160. return tsk;
  161. }
  162. #ifdef CONFIG_MMU
  163. static inline int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm)
  164. {
  165. struct vm_area_struct *mpnt, *tmp, **pprev;
  166. struct rb_node **rb_link, *rb_parent;
  167. int retval;
  168. unsigned long charge;
  169. struct mempolicy *pol;
  170. down_write(&oldmm->mmap_sem);
  171. flush_cache_mm(oldmm);
  172. /*
  173. * Not linked in yet - no deadlock potential:
  174. */
  175. down_write_nested(&mm->mmap_sem, SINGLE_DEPTH_NESTING);
  176. mm->locked_vm = 0;
  177. mm->mmap = NULL;
  178. mm->mmap_cache = NULL;
  179. mm->free_area_cache = oldmm->mmap_base;
  180. mm->cached_hole_size = ~0UL;
  181. mm->map_count = 0;
  182. cpus_clear(mm->cpu_vm_mask);
  183. mm->mm_rb = RB_ROOT;
  184. rb_link = &mm->mm_rb.rb_node;
  185. rb_parent = NULL;
  186. pprev = &mm->mmap;
  187. for (mpnt = oldmm->mmap; mpnt; mpnt = mpnt->vm_next) {
  188. struct file *file;
  189. if (mpnt->vm_flags & VM_DONTCOPY) {
  190. long pages = vma_pages(mpnt);
  191. mm->total_vm -= pages;
  192. vm_stat_account(mm, mpnt->vm_flags, mpnt->vm_file,
  193. -pages);
  194. continue;
  195. }
  196. charge = 0;
  197. if (mpnt->vm_flags & VM_ACCOUNT) {
  198. unsigned int len = (mpnt->vm_end - mpnt->vm_start) >> PAGE_SHIFT;
  199. if (security_vm_enough_memory(len))
  200. goto fail_nomem;
  201. charge = len;
  202. }
  203. tmp = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
  204. if (!tmp)
  205. goto fail_nomem;
  206. *tmp = *mpnt;
  207. pol = mpol_copy(vma_policy(mpnt));
  208. retval = PTR_ERR(pol);
  209. if (IS_ERR(pol))
  210. goto fail_nomem_policy;
  211. vma_set_policy(tmp, pol);
  212. tmp->vm_flags &= ~VM_LOCKED;
  213. tmp->vm_mm = mm;
  214. tmp->vm_next = NULL;
  215. anon_vma_link(tmp);
  216. file = tmp->vm_file;
  217. if (file) {
  218. struct inode *inode = file->f_dentry->d_inode;
  219. get_file(file);
  220. if (tmp->vm_flags & VM_DENYWRITE)
  221. atomic_dec(&inode->i_writecount);
  222. /* insert tmp into the share list, just after mpnt */
  223. spin_lock(&file->f_mapping->i_mmap_lock);
  224. tmp->vm_truncate_count = mpnt->vm_truncate_count;
  225. flush_dcache_mmap_lock(file->f_mapping);
  226. vma_prio_tree_add(tmp, mpnt);
  227. flush_dcache_mmap_unlock(file->f_mapping);
  228. spin_unlock(&file->f_mapping->i_mmap_lock);
  229. }
  230. /*
  231. * Link in the new vma and copy the page table entries.
  232. */
  233. *pprev = tmp;
  234. pprev = &tmp->vm_next;
  235. __vma_link_rb(mm, tmp, rb_link, rb_parent);
  236. rb_link = &tmp->vm_rb.rb_right;
  237. rb_parent = &tmp->vm_rb;
  238. mm->map_count++;
  239. retval = copy_page_range(mm, oldmm, mpnt);
  240. if (tmp->vm_ops && tmp->vm_ops->open)
  241. tmp->vm_ops->open(tmp);
  242. if (retval)
  243. goto out;
  244. }
  245. retval = 0;
  246. out:
  247. up_write(&mm->mmap_sem);
  248. flush_tlb_mm(oldmm);
  249. up_write(&oldmm->mmap_sem);
  250. return retval;
  251. fail_nomem_policy:
  252. kmem_cache_free(vm_area_cachep, tmp);
  253. fail_nomem:
  254. retval = -ENOMEM;
  255. vm_unacct_memory(charge);
  256. goto out;
  257. }
  258. static inline int mm_alloc_pgd(struct mm_struct * mm)
  259. {
  260. mm->pgd = pgd_alloc(mm);
  261. if (unlikely(!mm->pgd))
  262. return -ENOMEM;
  263. return 0;
  264. }
  265. static inline void mm_free_pgd(struct mm_struct * mm)
  266. {
  267. pgd_free(mm->pgd);
  268. }
  269. #else
  270. #define dup_mmap(mm, oldmm) (0)
  271. #define mm_alloc_pgd(mm) (0)
  272. #define mm_free_pgd(mm)
  273. #endif /* CONFIG_MMU */
  274. __cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock);
  275. #define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL))
  276. #define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
  277. #include <linux/init_task.h>
  278. static struct mm_struct * mm_init(struct mm_struct * mm)
  279. {
  280. atomic_set(&mm->mm_users, 1);
  281. atomic_set(&mm->mm_count, 1);
  282. init_rwsem(&mm->mmap_sem);
  283. INIT_LIST_HEAD(&mm->mmlist);
  284. mm->core_waiters = 0;
  285. mm->nr_ptes = 0;
  286. set_mm_counter(mm, file_rss, 0);
  287. set_mm_counter(mm, anon_rss, 0);
  288. spin_lock_init(&mm->page_table_lock);
  289. rwlock_init(&mm->ioctx_list_lock);
  290. mm->ioctx_list = NULL;
  291. mm->free_area_cache = TASK_UNMAPPED_BASE;
  292. mm->cached_hole_size = ~0UL;
  293. if (likely(!mm_alloc_pgd(mm))) {
  294. mm->def_flags = 0;
  295. return mm;
  296. }
  297. free_mm(mm);
  298. return NULL;
  299. }
  300. /*
  301. * Allocate and initialize an mm_struct.
  302. */
  303. struct mm_struct * mm_alloc(void)
  304. {
  305. struct mm_struct * mm;
  306. mm = allocate_mm();
  307. if (mm) {
  308. memset(mm, 0, sizeof(*mm));
  309. mm = mm_init(mm);
  310. }
  311. return mm;
  312. }
  313. /*
  314. * Called when the last reference to the mm
  315. * is dropped: either by a lazy thread or by
  316. * mmput. Free the page directory and the mm.
  317. */
  318. void fastcall __mmdrop(struct mm_struct *mm)
  319. {
  320. BUG_ON(mm == &init_mm);
  321. mm_free_pgd(mm);
  322. destroy_context(mm);
  323. free_mm(mm);
  324. }
  325. /*
  326. * Decrement the use count and release all resources for an mm.
  327. */
  328. void mmput(struct mm_struct *mm)
  329. {
  330. might_sleep();
  331. if (atomic_dec_and_test(&mm->mm_users)) {
  332. exit_aio(mm);
  333. exit_mmap(mm);
  334. if (!list_empty(&mm->mmlist)) {
  335. spin_lock(&mmlist_lock);
  336. list_del(&mm->mmlist);
  337. spin_unlock(&mmlist_lock);
  338. }
  339. put_swap_token(mm);
  340. mmdrop(mm);
  341. }
  342. }
  343. EXPORT_SYMBOL_GPL(mmput);
  344. /**
  345. * get_task_mm - acquire a reference to the task's mm
  346. *
  347. * Returns %NULL if the task has no mm. Checks PF_BORROWED_MM (meaning
  348. * this kernel workthread has transiently adopted a user mm with use_mm,
  349. * to do its AIO) is not set and if so returns a reference to it, after
  350. * bumping up the use count. User must release the mm via mmput()
  351. * after use. Typically used by /proc and ptrace.
  352. */
  353. struct mm_struct *get_task_mm(struct task_struct *task)
  354. {
  355. struct mm_struct *mm;
  356. task_lock(task);
  357. mm = task->mm;
  358. if (mm) {
  359. if (task->flags & PF_BORROWED_MM)
  360. mm = NULL;
  361. else
  362. atomic_inc(&mm->mm_users);
  363. }
  364. task_unlock(task);
  365. return mm;
  366. }
  367. EXPORT_SYMBOL_GPL(get_task_mm);
  368. /* Please note the differences between mmput and mm_release.
  369. * mmput is called whenever we stop holding onto a mm_struct,
  370. * error success whatever.
  371. *
  372. * mm_release is called after a mm_struct has been removed
  373. * from the current process.
  374. *
  375. * This difference is important for error handling, when we
  376. * only half set up a mm_struct for a new process and need to restore
  377. * the old one. Because we mmput the new mm_struct before
  378. * restoring the old one. . .
  379. * Eric Biederman 10 January 1998
  380. */
  381. void mm_release(struct task_struct *tsk, struct mm_struct *mm)
  382. {
  383. struct completion *vfork_done = tsk->vfork_done;
  384. /* Get rid of any cached register state */
  385. deactivate_mm(tsk, mm);
  386. /* notify parent sleeping on vfork() */
  387. if (vfork_done) {
  388. tsk->vfork_done = NULL;
  389. complete(vfork_done);
  390. }
  391. /*
  392. * If we're exiting normally, clear a user-space tid field if
  393. * requested. We leave this alone when dying by signal, to leave
  394. * the value intact in a core dump, and to save the unnecessary
  395. * trouble otherwise. Userland only wants this done for a sys_exit.
  396. */
  397. if (tsk->clear_child_tid
  398. && !(tsk->flags & PF_SIGNALED)
  399. && atomic_read(&mm->mm_users) > 1) {
  400. u32 __user * tidptr = tsk->clear_child_tid;
  401. tsk->clear_child_tid = NULL;
  402. /*
  403. * We don't check the error code - if userspace has
  404. * not set up a proper pointer then tough luck.
  405. */
  406. put_user(0, tidptr);
  407. sys_futex(tidptr, FUTEX_WAKE, 1, NULL, NULL, 0);
  408. }
  409. }
  410. /*
  411. * Allocate a new mm structure and copy contents from the
  412. * mm structure of the passed in task structure.
  413. */
  414. static struct mm_struct *dup_mm(struct task_struct *tsk)
  415. {
  416. struct mm_struct *mm, *oldmm = current->mm;
  417. int err;
  418. if (!oldmm)
  419. return NULL;
  420. mm = allocate_mm();
  421. if (!mm)
  422. goto fail_nomem;
  423. memcpy(mm, oldmm, sizeof(*mm));
  424. /* Initializing for Swap token stuff */
  425. mm->token_priority = 0;
  426. mm->last_interval = 0;
  427. if (!mm_init(mm))
  428. goto fail_nomem;
  429. if (init_new_context(tsk, mm))
  430. goto fail_nocontext;
  431. err = dup_mmap(mm, oldmm);
  432. if (err)
  433. goto free_pt;
  434. mm->hiwater_rss = get_mm_rss(mm);
  435. mm->hiwater_vm = mm->total_vm;
  436. return mm;
  437. free_pt:
  438. mmput(mm);
  439. fail_nomem:
  440. return NULL;
  441. fail_nocontext:
  442. /*
  443. * If init_new_context() failed, we cannot use mmput() to free the mm
  444. * because it calls destroy_context()
  445. */
  446. mm_free_pgd(mm);
  447. free_mm(mm);
  448. return NULL;
  449. }
  450. static int copy_mm(unsigned long clone_flags, struct task_struct * tsk)
  451. {
  452. struct mm_struct * mm, *oldmm;
  453. int retval;
  454. tsk->min_flt = tsk->maj_flt = 0;
  455. tsk->nvcsw = tsk->nivcsw = 0;
  456. tsk->mm = NULL;
  457. tsk->active_mm = NULL;
  458. /*
  459. * Are we cloning a kernel thread?
  460. *
  461. * We need to steal a active VM for that..
  462. */
  463. oldmm = current->mm;
  464. if (!oldmm)
  465. return 0;
  466. if (clone_flags & CLONE_VM) {
  467. atomic_inc(&oldmm->mm_users);
  468. mm = oldmm;
  469. goto good_mm;
  470. }
  471. retval = -ENOMEM;
  472. mm = dup_mm(tsk);
  473. if (!mm)
  474. goto fail_nomem;
  475. good_mm:
  476. /* Initializing for Swap token stuff */
  477. mm->token_priority = 0;
  478. mm->last_interval = 0;
  479. tsk->mm = mm;
  480. tsk->active_mm = mm;
  481. return 0;
  482. fail_nomem:
  483. return retval;
  484. }
  485. static inline struct fs_struct *__copy_fs_struct(struct fs_struct *old)
  486. {
  487. struct fs_struct *fs = kmem_cache_alloc(fs_cachep, GFP_KERNEL);
  488. /* We don't need to lock fs - think why ;-) */
  489. if (fs) {
  490. atomic_set(&fs->count, 1);
  491. rwlock_init(&fs->lock);
  492. fs->umask = old->umask;
  493. read_lock(&old->lock);
  494. fs->rootmnt = mntget(old->rootmnt);
  495. fs->root = dget(old->root);
  496. fs->pwdmnt = mntget(old->pwdmnt);
  497. fs->pwd = dget(old->pwd);
  498. if (old->altroot) {
  499. fs->altrootmnt = mntget(old->altrootmnt);
  500. fs->altroot = dget(old->altroot);
  501. } else {
  502. fs->altrootmnt = NULL;
  503. fs->altroot = NULL;
  504. }
  505. read_unlock(&old->lock);
  506. }
  507. return fs;
  508. }
  509. struct fs_struct *copy_fs_struct(struct fs_struct *old)
  510. {
  511. return __copy_fs_struct(old);
  512. }
  513. EXPORT_SYMBOL_GPL(copy_fs_struct);
  514. static inline int copy_fs(unsigned long clone_flags, struct task_struct * tsk)
  515. {
  516. if (clone_flags & CLONE_FS) {
  517. atomic_inc(&current->fs->count);
  518. return 0;
  519. }
  520. tsk->fs = __copy_fs_struct(current->fs);
  521. if (!tsk->fs)
  522. return -ENOMEM;
  523. return 0;
  524. }
  525. static int count_open_files(struct fdtable *fdt)
  526. {
  527. int size = fdt->max_fdset;
  528. int i;
  529. /* Find the last open fd */
  530. for (i = size/(8*sizeof(long)); i > 0; ) {
  531. if (fdt->open_fds->fds_bits[--i])
  532. break;
  533. }
  534. i = (i+1) * 8 * sizeof(long);
  535. return i;
  536. }
  537. static struct files_struct *alloc_files(void)
  538. {
  539. struct files_struct *newf;
  540. struct fdtable *fdt;
  541. newf = kmem_cache_alloc(files_cachep, GFP_KERNEL);
  542. if (!newf)
  543. goto out;
  544. atomic_set(&newf->count, 1);
  545. spin_lock_init(&newf->file_lock);
  546. newf->next_fd = 0;
  547. fdt = &newf->fdtab;
  548. fdt->max_fds = NR_OPEN_DEFAULT;
  549. fdt->max_fdset = EMBEDDED_FD_SET_SIZE;
  550. fdt->close_on_exec = (fd_set *)&newf->close_on_exec_init;
  551. fdt->open_fds = (fd_set *)&newf->open_fds_init;
  552. fdt->fd = &newf->fd_array[0];
  553. INIT_RCU_HEAD(&fdt->rcu);
  554. fdt->free_files = NULL;
  555. fdt->next = NULL;
  556. rcu_assign_pointer(newf->fdt, fdt);
  557. out:
  558. return newf;
  559. }
  560. /*
  561. * Allocate a new files structure and copy contents from the
  562. * passed in files structure.
  563. * errorp will be valid only when the returned files_struct is NULL.
  564. */
  565. static struct files_struct *dup_fd(struct files_struct *oldf, int *errorp)
  566. {
  567. struct files_struct *newf;
  568. struct file **old_fds, **new_fds;
  569. int open_files, size, i, expand;
  570. struct fdtable *old_fdt, *new_fdt;
  571. *errorp = -ENOMEM;
  572. newf = alloc_files();
  573. if (!newf)
  574. goto out;
  575. spin_lock(&oldf->file_lock);
  576. old_fdt = files_fdtable(oldf);
  577. new_fdt = files_fdtable(newf);
  578. size = old_fdt->max_fdset;
  579. open_files = count_open_files(old_fdt);
  580. expand = 0;
  581. /*
  582. * Check whether we need to allocate a larger fd array or fd set.
  583. * Note: we're not a clone task, so the open count won't change.
  584. */
  585. if (open_files > new_fdt->max_fdset) {
  586. new_fdt->max_fdset = 0;
  587. expand = 1;
  588. }
  589. if (open_files > new_fdt->max_fds) {
  590. new_fdt->max_fds = 0;
  591. expand = 1;
  592. }
  593. /* if the old fdset gets grown now, we'll only copy up to "size" fds */
  594. if (expand) {
  595. spin_unlock(&oldf->file_lock);
  596. spin_lock(&newf->file_lock);
  597. *errorp = expand_files(newf, open_files-1);
  598. spin_unlock(&newf->file_lock);
  599. if (*errorp < 0)
  600. goto out_release;
  601. new_fdt = files_fdtable(newf);
  602. /*
  603. * Reacquire the oldf lock and a pointer to its fd table
  604. * who knows it may have a new bigger fd table. We need
  605. * the latest pointer.
  606. */
  607. spin_lock(&oldf->file_lock);
  608. old_fdt = files_fdtable(oldf);
  609. }
  610. old_fds = old_fdt->fd;
  611. new_fds = new_fdt->fd;
  612. memcpy(new_fdt->open_fds->fds_bits, old_fdt->open_fds->fds_bits, open_files/8);
  613. memcpy(new_fdt->close_on_exec->fds_bits, old_fdt->close_on_exec->fds_bits, open_files/8);
  614. for (i = open_files; i != 0; i--) {
  615. struct file *f = *old_fds++;
  616. if (f) {
  617. get_file(f);
  618. } else {
  619. /*
  620. * The fd may be claimed in the fd bitmap but not yet
  621. * instantiated in the files array if a sibling thread
  622. * is partway through open(). So make sure that this
  623. * fd is available to the new process.
  624. */
  625. FD_CLR(open_files - i, new_fdt->open_fds);
  626. }
  627. rcu_assign_pointer(*new_fds++, f);
  628. }
  629. spin_unlock(&oldf->file_lock);
  630. /* compute the remainder to be cleared */
  631. size = (new_fdt->max_fds - open_files) * sizeof(struct file *);
  632. /* This is long word aligned thus could use a optimized version */
  633. memset(new_fds, 0, size);
  634. if (new_fdt->max_fdset > open_files) {
  635. int left = (new_fdt->max_fdset-open_files)/8;
  636. int start = open_files / (8 * sizeof(unsigned long));
  637. memset(&new_fdt->open_fds->fds_bits[start], 0, left);
  638. memset(&new_fdt->close_on_exec->fds_bits[start], 0, left);
  639. }
  640. out:
  641. return newf;
  642. out_release:
  643. free_fdset (new_fdt->close_on_exec, new_fdt->max_fdset);
  644. free_fdset (new_fdt->open_fds, new_fdt->max_fdset);
  645. free_fd_array(new_fdt->fd, new_fdt->max_fds);
  646. kmem_cache_free(files_cachep, newf);
  647. return NULL;
  648. }
  649. static int copy_files(unsigned long clone_flags, struct task_struct * tsk)
  650. {
  651. struct files_struct *oldf, *newf;
  652. int error = 0;
  653. /*
  654. * A background process may not have any files ...
  655. */
  656. oldf = current->files;
  657. if (!oldf)
  658. goto out;
  659. if (clone_flags & CLONE_FILES) {
  660. atomic_inc(&oldf->count);
  661. goto out;
  662. }
  663. /*
  664. * Note: we may be using current for both targets (See exec.c)
  665. * This works because we cache current->files (old) as oldf. Don't
  666. * break this.
  667. */
  668. tsk->files = NULL;
  669. newf = dup_fd(oldf, &error);
  670. if (!newf)
  671. goto out;
  672. tsk->files = newf;
  673. error = 0;
  674. out:
  675. return error;
  676. }
  677. /*
  678. * Helper to unshare the files of the current task.
  679. * We don't want to expose copy_files internals to
  680. * the exec layer of the kernel.
  681. */
  682. int unshare_files(void)
  683. {
  684. struct files_struct *files = current->files;
  685. int rc;
  686. BUG_ON(!files);
  687. /* This can race but the race causes us to copy when we don't
  688. need to and drop the copy */
  689. if(atomic_read(&files->count) == 1)
  690. {
  691. atomic_inc(&files->count);
  692. return 0;
  693. }
  694. rc = copy_files(0, current);
  695. if(rc)
  696. current->files = files;
  697. return rc;
  698. }
  699. EXPORT_SYMBOL(unshare_files);
  700. static inline int copy_sighand(unsigned long clone_flags, struct task_struct * tsk)
  701. {
  702. struct sighand_struct *sig;
  703. if (clone_flags & (CLONE_SIGHAND | CLONE_THREAD)) {
  704. atomic_inc(&current->sighand->count);
  705. return 0;
  706. }
  707. sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
  708. rcu_assign_pointer(tsk->sighand, sig);
  709. if (!sig)
  710. return -ENOMEM;
  711. atomic_set(&sig->count, 1);
  712. memcpy(sig->action, current->sighand->action, sizeof(sig->action));
  713. return 0;
  714. }
  715. void __cleanup_sighand(struct sighand_struct *sighand)
  716. {
  717. if (atomic_dec_and_test(&sighand->count))
  718. kmem_cache_free(sighand_cachep, sighand);
  719. }
  720. static inline int copy_signal(unsigned long clone_flags, struct task_struct * tsk)
  721. {
  722. struct signal_struct *sig;
  723. int ret;
  724. if (clone_flags & CLONE_THREAD) {
  725. atomic_inc(&current->signal->count);
  726. atomic_inc(&current->signal->live);
  727. taskstats_tgid_alloc(current);
  728. return 0;
  729. }
  730. sig = kmem_cache_alloc(signal_cachep, GFP_KERNEL);
  731. tsk->signal = sig;
  732. if (!sig)
  733. return -ENOMEM;
  734. ret = copy_thread_group_keys(tsk);
  735. if (ret < 0) {
  736. kmem_cache_free(signal_cachep, sig);
  737. return ret;
  738. }
  739. atomic_set(&sig->count, 1);
  740. atomic_set(&sig->live, 1);
  741. init_waitqueue_head(&sig->wait_chldexit);
  742. sig->flags = 0;
  743. sig->group_exit_code = 0;
  744. sig->group_exit_task = NULL;
  745. sig->group_stop_count = 0;
  746. sig->curr_target = NULL;
  747. init_sigpending(&sig->shared_pending);
  748. INIT_LIST_HEAD(&sig->posix_timers);
  749. hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_REL);
  750. sig->it_real_incr.tv64 = 0;
  751. sig->real_timer.function = it_real_fn;
  752. sig->tsk = tsk;
  753. sig->it_virt_expires = cputime_zero;
  754. sig->it_virt_incr = cputime_zero;
  755. sig->it_prof_expires = cputime_zero;
  756. sig->it_prof_incr = cputime_zero;
  757. sig->leader = 0; /* session leadership doesn't inherit */
  758. sig->tty_old_pgrp = 0;
  759. sig->utime = sig->stime = sig->cutime = sig->cstime = cputime_zero;
  760. sig->nvcsw = sig->nivcsw = sig->cnvcsw = sig->cnivcsw = 0;
  761. sig->min_flt = sig->maj_flt = sig->cmin_flt = sig->cmaj_flt = 0;
  762. sig->sched_time = 0;
  763. INIT_LIST_HEAD(&sig->cpu_timers[0]);
  764. INIT_LIST_HEAD(&sig->cpu_timers[1]);
  765. INIT_LIST_HEAD(&sig->cpu_timers[2]);
  766. taskstats_tgid_init(sig);
  767. task_lock(current->group_leader);
  768. memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim);
  769. task_unlock(current->group_leader);
  770. if (sig->rlim[RLIMIT_CPU].rlim_cur != RLIM_INFINITY) {
  771. /*
  772. * New sole thread in the process gets an expiry time
  773. * of the whole CPU time limit.
  774. */
  775. tsk->it_prof_expires =
  776. secs_to_cputime(sig->rlim[RLIMIT_CPU].rlim_cur);
  777. }
  778. acct_init_pacct(&sig->pacct);
  779. return 0;
  780. }
  781. void __cleanup_signal(struct signal_struct *sig)
  782. {
  783. exit_thread_group_keys(sig);
  784. kmem_cache_free(signal_cachep, sig);
  785. }
  786. static inline void cleanup_signal(struct task_struct *tsk)
  787. {
  788. struct signal_struct *sig = tsk->signal;
  789. atomic_dec(&sig->live);
  790. if (atomic_dec_and_test(&sig->count))
  791. __cleanup_signal(sig);
  792. }
  793. static inline void copy_flags(unsigned long clone_flags, struct task_struct *p)
  794. {
  795. unsigned long new_flags = p->flags;
  796. new_flags &= ~(PF_SUPERPRIV | PF_NOFREEZE);
  797. new_flags |= PF_FORKNOEXEC;
  798. if (!(clone_flags & CLONE_PTRACE))
  799. p->ptrace = 0;
  800. p->flags = new_flags;
  801. }
  802. asmlinkage long sys_set_tid_address(int __user *tidptr)
  803. {
  804. current->clear_child_tid = tidptr;
  805. return current->pid;
  806. }
  807. static inline void rt_mutex_init_task(struct task_struct *p)
  808. {
  809. #ifdef CONFIG_RT_MUTEXES
  810. spin_lock_init(&p->pi_lock);
  811. plist_head_init(&p->pi_waiters, &p->pi_lock);
  812. p->pi_blocked_on = NULL;
  813. #endif
  814. }
  815. /*
  816. * This creates a new process as a copy of the old one,
  817. * but does not actually start it yet.
  818. *
  819. * It copies the registers, and all the appropriate
  820. * parts of the process environment (as per the clone
  821. * flags). The actual kick-off is left to the caller.
  822. */
  823. static struct task_struct *copy_process(unsigned long clone_flags,
  824. unsigned long stack_start,
  825. struct pt_regs *regs,
  826. unsigned long stack_size,
  827. int __user *parent_tidptr,
  828. int __user *child_tidptr,
  829. int pid)
  830. {
  831. int retval;
  832. struct task_struct *p = NULL;
  833. if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
  834. return ERR_PTR(-EINVAL);
  835. /*
  836. * Thread groups must share signals as well, and detached threads
  837. * can only be started up within the thread group.
  838. */
  839. if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
  840. return ERR_PTR(-EINVAL);
  841. /*
  842. * Shared signal handlers imply shared VM. By way of the above,
  843. * thread groups also imply shared VM. Blocking this case allows
  844. * for various simplifications in other code.
  845. */
  846. if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
  847. return ERR_PTR(-EINVAL);
  848. retval = security_task_create(clone_flags);
  849. if (retval)
  850. goto fork_out;
  851. retval = -ENOMEM;
  852. p = dup_task_struct(current);
  853. if (!p)
  854. goto fork_out;
  855. rt_mutex_init_task(p);
  856. #ifdef CONFIG_TRACE_IRQFLAGS
  857. DEBUG_LOCKS_WARN_ON(!p->hardirqs_enabled);
  858. DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled);
  859. #endif
  860. retval = -EAGAIN;
  861. if (atomic_read(&p->user->processes) >=
  862. p->signal->rlim[RLIMIT_NPROC].rlim_cur) {
  863. if (!capable(CAP_SYS_ADMIN) && !capable(CAP_SYS_RESOURCE) &&
  864. p->user != &root_user)
  865. goto bad_fork_free;
  866. }
  867. atomic_inc(&p->user->__count);
  868. atomic_inc(&p->user->processes);
  869. get_group_info(p->group_info);
  870. /*
  871. * If multiple threads are within copy_process(), then this check
  872. * triggers too late. This doesn't hurt, the check is only there
  873. * to stop root fork bombs.
  874. */
  875. if (nr_threads >= max_threads)
  876. goto bad_fork_cleanup_count;
  877. if (!try_module_get(task_thread_info(p)->exec_domain->module))
  878. goto bad_fork_cleanup_count;
  879. if (p->binfmt && !try_module_get(p->binfmt->module))
  880. goto bad_fork_cleanup_put_domain;
  881. p->did_exec = 0;
  882. delayacct_tsk_init(p); /* Must remain after dup_task_struct() */
  883. copy_flags(clone_flags, p);
  884. p->pid = pid;
  885. retval = -EFAULT;
  886. if (clone_flags & CLONE_PARENT_SETTID)
  887. if (put_user(p->pid, parent_tidptr))
  888. goto bad_fork_cleanup_delays_binfmt;
  889. INIT_LIST_HEAD(&p->children);
  890. INIT_LIST_HEAD(&p->sibling);
  891. p->vfork_done = NULL;
  892. spin_lock_init(&p->alloc_lock);
  893. clear_tsk_thread_flag(p, TIF_SIGPENDING);
  894. init_sigpending(&p->pending);
  895. p->utime = cputime_zero;
  896. p->stime = cputime_zero;
  897. p->sched_time = 0;
  898. p->rchar = 0; /* I/O counter: bytes read */
  899. p->wchar = 0; /* I/O counter: bytes written */
  900. p->syscr = 0; /* I/O counter: read syscalls */
  901. p->syscw = 0; /* I/O counter: write syscalls */
  902. acct_clear_integrals(p);
  903. p->it_virt_expires = cputime_zero;
  904. p->it_prof_expires = cputime_zero;
  905. p->it_sched_expires = 0;
  906. INIT_LIST_HEAD(&p->cpu_timers[0]);
  907. INIT_LIST_HEAD(&p->cpu_timers[1]);
  908. INIT_LIST_HEAD(&p->cpu_timers[2]);
  909. p->lock_depth = -1; /* -1 = no lock */
  910. do_posix_clock_monotonic_gettime(&p->start_time);
  911. p->security = NULL;
  912. p->io_context = NULL;
  913. p->io_wait = NULL;
  914. p->audit_context = NULL;
  915. cpuset_fork(p);
  916. #ifdef CONFIG_NUMA
  917. p->mempolicy = mpol_copy(p->mempolicy);
  918. if (IS_ERR(p->mempolicy)) {
  919. retval = PTR_ERR(p->mempolicy);
  920. p->mempolicy = NULL;
  921. goto bad_fork_cleanup_cpuset;
  922. }
  923. mpol_fix_fork_child_flag(p);
  924. #endif
  925. #ifdef CONFIG_TRACE_IRQFLAGS
  926. p->irq_events = 0;
  927. #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
  928. p->hardirqs_enabled = 1;
  929. #else
  930. p->hardirqs_enabled = 0;
  931. #endif
  932. p->hardirq_enable_ip = 0;
  933. p->hardirq_enable_event = 0;
  934. p->hardirq_disable_ip = _THIS_IP_;
  935. p->hardirq_disable_event = 0;
  936. p->softirqs_enabled = 1;
  937. p->softirq_enable_ip = _THIS_IP_;
  938. p->softirq_enable_event = 0;
  939. p->softirq_disable_ip = 0;
  940. p->softirq_disable_event = 0;
  941. p->hardirq_context = 0;
  942. p->softirq_context = 0;
  943. #endif
  944. #ifdef CONFIG_LOCKDEP
  945. p->lockdep_depth = 0; /* no locks held yet */
  946. p->curr_chain_key = 0;
  947. p->lockdep_recursion = 0;
  948. #endif
  949. #ifdef CONFIG_DEBUG_MUTEXES
  950. p->blocked_on = NULL; /* not blocked yet */
  951. #endif
  952. p->tgid = p->pid;
  953. if (clone_flags & CLONE_THREAD)
  954. p->tgid = current->tgid;
  955. if ((retval = security_task_alloc(p)))
  956. goto bad_fork_cleanup_policy;
  957. if ((retval = audit_alloc(p)))
  958. goto bad_fork_cleanup_security;
  959. /* copy all the process information */
  960. if ((retval = copy_semundo(clone_flags, p)))
  961. goto bad_fork_cleanup_audit;
  962. if ((retval = copy_files(clone_flags, p)))
  963. goto bad_fork_cleanup_semundo;
  964. if ((retval = copy_fs(clone_flags, p)))
  965. goto bad_fork_cleanup_files;
  966. if ((retval = copy_sighand(clone_flags, p)))
  967. goto bad_fork_cleanup_fs;
  968. if ((retval = copy_signal(clone_flags, p)))
  969. goto bad_fork_cleanup_sighand;
  970. if ((retval = copy_mm(clone_flags, p)))
  971. goto bad_fork_cleanup_signal;
  972. if ((retval = copy_keys(clone_flags, p)))
  973. goto bad_fork_cleanup_mm;
  974. if ((retval = copy_namespaces(clone_flags, p)))
  975. goto bad_fork_cleanup_keys;
  976. retval = copy_thread(0, clone_flags, stack_start, stack_size, p, regs);
  977. if (retval)
  978. goto bad_fork_cleanup_namespaces;
  979. p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? child_tidptr : NULL;
  980. /*
  981. * Clear TID on mm_release()?
  982. */
  983. p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? child_tidptr: NULL;
  984. p->robust_list = NULL;
  985. #ifdef CONFIG_COMPAT
  986. p->compat_robust_list = NULL;
  987. #endif
  988. INIT_LIST_HEAD(&p->pi_state_list);
  989. p->pi_state_cache = NULL;
  990. /*
  991. * sigaltstack should be cleared when sharing the same VM
  992. */
  993. if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM)
  994. p->sas_ss_sp = p->sas_ss_size = 0;
  995. /*
  996. * Syscall tracing should be turned off in the child regardless
  997. * of CLONE_PTRACE.
  998. */
  999. clear_tsk_thread_flag(p, TIF_SYSCALL_TRACE);
  1000. #ifdef TIF_SYSCALL_EMU
  1001. clear_tsk_thread_flag(p, TIF_SYSCALL_EMU);
  1002. #endif
  1003. /* Our parent execution domain becomes current domain
  1004. These must match for thread signalling to apply */
  1005. p->parent_exec_id = p->self_exec_id;
  1006. /* ok, now we should be set up.. */
  1007. p->exit_signal = (clone_flags & CLONE_THREAD) ? -1 : (clone_flags & CSIGNAL);
  1008. p->pdeath_signal = 0;
  1009. p->exit_state = 0;
  1010. /*
  1011. * Ok, make it visible to the rest of the system.
  1012. * We dont wake it up yet.
  1013. */
  1014. p->group_leader = p;
  1015. INIT_LIST_HEAD(&p->thread_group);
  1016. INIT_LIST_HEAD(&p->ptrace_children);
  1017. INIT_LIST_HEAD(&p->ptrace_list);
  1018. /* Perform scheduler related setup. Assign this task to a CPU. */
  1019. sched_fork(p, clone_flags);
  1020. /* Need tasklist lock for parent etc handling! */
  1021. write_lock_irq(&tasklist_lock);
  1022. /* for sys_ioprio_set(IOPRIO_WHO_PGRP) */
  1023. p->ioprio = current->ioprio;
  1024. /*
  1025. * The task hasn't been attached yet, so its cpus_allowed mask will
  1026. * not be changed, nor will its assigned CPU.
  1027. *
  1028. * The cpus_allowed mask of the parent may have changed after it was
  1029. * copied first time - so re-copy it here, then check the child's CPU
  1030. * to ensure it is on a valid CPU (and if not, just force it back to
  1031. * parent's CPU). This avoids alot of nasty races.
  1032. */
  1033. p->cpus_allowed = current->cpus_allowed;
  1034. if (unlikely(!cpu_isset(task_cpu(p), p->cpus_allowed) ||
  1035. !cpu_online(task_cpu(p))))
  1036. set_task_cpu(p, smp_processor_id());
  1037. /* CLONE_PARENT re-uses the old parent */
  1038. if (clone_flags & (CLONE_PARENT|CLONE_THREAD))
  1039. p->real_parent = current->real_parent;
  1040. else
  1041. p->real_parent = current;
  1042. p->parent = p->real_parent;
  1043. spin_lock(&current->sighand->siglock);
  1044. /*
  1045. * Process group and session signals need to be delivered to just the
  1046. * parent before the fork or both the parent and the child after the
  1047. * fork. Restart if a signal comes in before we add the new process to
  1048. * it's process group.
  1049. * A fatal signal pending means that current will exit, so the new
  1050. * thread can't slip out of an OOM kill (or normal SIGKILL).
  1051. */
  1052. recalc_sigpending();
  1053. if (signal_pending(current)) {
  1054. spin_unlock(&current->sighand->siglock);
  1055. write_unlock_irq(&tasklist_lock);
  1056. retval = -ERESTARTNOINTR;
  1057. goto bad_fork_cleanup_namespaces;
  1058. }
  1059. if (clone_flags & CLONE_THREAD) {
  1060. p->group_leader = current->group_leader;
  1061. list_add_tail_rcu(&p->thread_group, &p->group_leader->thread_group);
  1062. if (!cputime_eq(current->signal->it_virt_expires,
  1063. cputime_zero) ||
  1064. !cputime_eq(current->signal->it_prof_expires,
  1065. cputime_zero) ||
  1066. current->signal->rlim[RLIMIT_CPU].rlim_cur != RLIM_INFINITY ||
  1067. !list_empty(&current->signal->cpu_timers[0]) ||
  1068. !list_empty(&current->signal->cpu_timers[1]) ||
  1069. !list_empty(&current->signal->cpu_timers[2])) {
  1070. /*
  1071. * Have child wake up on its first tick to check
  1072. * for process CPU timers.
  1073. */
  1074. p->it_prof_expires = jiffies_to_cputime(1);
  1075. }
  1076. }
  1077. if (likely(p->pid)) {
  1078. add_parent(p);
  1079. if (unlikely(p->ptrace & PT_PTRACED))
  1080. __ptrace_link(p, current->parent);
  1081. if (thread_group_leader(p)) {
  1082. p->signal->tty = current->signal->tty;
  1083. p->signal->pgrp = process_group(current);
  1084. p->signal->session = current->signal->session;
  1085. attach_pid(p, PIDTYPE_PGID, process_group(p));
  1086. attach_pid(p, PIDTYPE_SID, p->signal->session);
  1087. list_add_tail_rcu(&p->tasks, &init_task.tasks);
  1088. __get_cpu_var(process_counts)++;
  1089. }
  1090. attach_pid(p, PIDTYPE_PID, p->pid);
  1091. nr_threads++;
  1092. }
  1093. total_forks++;
  1094. spin_unlock(&current->sighand->siglock);
  1095. write_unlock_irq(&tasklist_lock);
  1096. proc_fork_connector(p);
  1097. return p;
  1098. bad_fork_cleanup_namespaces:
  1099. exit_task_namespaces(p);
  1100. bad_fork_cleanup_keys:
  1101. exit_keys(p);
  1102. bad_fork_cleanup_mm:
  1103. if (p->mm)
  1104. mmput(p->mm);
  1105. bad_fork_cleanup_signal:
  1106. cleanup_signal(p);
  1107. bad_fork_cleanup_sighand:
  1108. __cleanup_sighand(p->sighand);
  1109. bad_fork_cleanup_fs:
  1110. exit_fs(p); /* blocking */
  1111. bad_fork_cleanup_files:
  1112. exit_files(p); /* blocking */
  1113. bad_fork_cleanup_semundo:
  1114. exit_sem(p);
  1115. bad_fork_cleanup_audit:
  1116. audit_free(p);
  1117. bad_fork_cleanup_security:
  1118. security_task_free(p);
  1119. bad_fork_cleanup_policy:
  1120. #ifdef CONFIG_NUMA
  1121. mpol_free(p->mempolicy);
  1122. bad_fork_cleanup_cpuset:
  1123. #endif
  1124. cpuset_exit(p);
  1125. bad_fork_cleanup_delays_binfmt:
  1126. delayacct_tsk_free(p);
  1127. if (p->binfmt)
  1128. module_put(p->binfmt->module);
  1129. bad_fork_cleanup_put_domain:
  1130. module_put(task_thread_info(p)->exec_domain->module);
  1131. bad_fork_cleanup_count:
  1132. put_group_info(p->group_info);
  1133. atomic_dec(&p->user->processes);
  1134. free_uid(p->user);
  1135. bad_fork_free:
  1136. free_task(p);
  1137. fork_out:
  1138. return ERR_PTR(retval);
  1139. }
  1140. struct pt_regs * __devinit __attribute__((weak)) idle_regs(struct pt_regs *regs)
  1141. {
  1142. memset(regs, 0, sizeof(struct pt_regs));
  1143. return regs;
  1144. }
  1145. struct task_struct * __devinit fork_idle(int cpu)
  1146. {
  1147. struct task_struct *task;
  1148. struct pt_regs regs;
  1149. task = copy_process(CLONE_VM, 0, idle_regs(&regs), 0, NULL, NULL, 0);
  1150. if (!IS_ERR(task))
  1151. init_idle(task, cpu);
  1152. return task;
  1153. }
  1154. static inline int fork_traceflag (unsigned clone_flags)
  1155. {
  1156. if (clone_flags & CLONE_UNTRACED)
  1157. return 0;
  1158. else if (clone_flags & CLONE_VFORK) {
  1159. if (current->ptrace & PT_TRACE_VFORK)
  1160. return PTRACE_EVENT_VFORK;
  1161. } else if ((clone_flags & CSIGNAL) != SIGCHLD) {
  1162. if (current->ptrace & PT_TRACE_CLONE)
  1163. return PTRACE_EVENT_CLONE;
  1164. } else if (current->ptrace & PT_TRACE_FORK)
  1165. return PTRACE_EVENT_FORK;
  1166. return 0;
  1167. }
  1168. /*
  1169. * Ok, this is the main fork-routine.
  1170. *
  1171. * It copies the process, and if successful kick-starts
  1172. * it and waits for it to finish using the VM if required.
  1173. */
  1174. long do_fork(unsigned long clone_flags,
  1175. unsigned long stack_start,
  1176. struct pt_regs *regs,
  1177. unsigned long stack_size,
  1178. int __user *parent_tidptr,
  1179. int __user *child_tidptr)
  1180. {
  1181. struct task_struct *p;
  1182. int trace = 0;
  1183. struct pid *pid = alloc_pid();
  1184. long nr;
  1185. if (!pid)
  1186. return -EAGAIN;
  1187. nr = pid->nr;
  1188. if (unlikely(current->ptrace)) {
  1189. trace = fork_traceflag (clone_flags);
  1190. if (trace)
  1191. clone_flags |= CLONE_PTRACE;
  1192. }
  1193. p = copy_process(clone_flags, stack_start, regs, stack_size, parent_tidptr, child_tidptr, nr);
  1194. /*
  1195. * Do this prior waking up the new thread - the thread pointer
  1196. * might get invalid after that point, if the thread exits quickly.
  1197. */
  1198. if (!IS_ERR(p)) {
  1199. struct completion vfork;
  1200. if (clone_flags & CLONE_VFORK) {
  1201. p->vfork_done = &vfork;
  1202. init_completion(&vfork);
  1203. }
  1204. if ((p->ptrace & PT_PTRACED) || (clone_flags & CLONE_STOPPED)) {
  1205. /*
  1206. * We'll start up with an immediate SIGSTOP.
  1207. */
  1208. sigaddset(&p->pending.signal, SIGSTOP);
  1209. set_tsk_thread_flag(p, TIF_SIGPENDING);
  1210. }
  1211. if (!(clone_flags & CLONE_STOPPED))
  1212. wake_up_new_task(p, clone_flags);
  1213. else
  1214. p->state = TASK_STOPPED;
  1215. if (unlikely (trace)) {
  1216. current->ptrace_message = nr;
  1217. ptrace_notify ((trace << 8) | SIGTRAP);
  1218. }
  1219. if (clone_flags & CLONE_VFORK) {
  1220. wait_for_completion(&vfork);
  1221. if (unlikely (current->ptrace & PT_TRACE_VFORK_DONE)) {
  1222. current->ptrace_message = nr;
  1223. ptrace_notify ((PTRACE_EVENT_VFORK_DONE << 8) | SIGTRAP);
  1224. }
  1225. }
  1226. } else {
  1227. free_pid(pid);
  1228. nr = PTR_ERR(p);
  1229. }
  1230. return nr;
  1231. }
  1232. #ifndef ARCH_MIN_MMSTRUCT_ALIGN
  1233. #define ARCH_MIN_MMSTRUCT_ALIGN 0
  1234. #endif
  1235. static void sighand_ctor(void *data, struct kmem_cache *cachep, unsigned long flags)
  1236. {
  1237. struct sighand_struct *sighand = data;
  1238. if ((flags & (SLAB_CTOR_VERIFY | SLAB_CTOR_CONSTRUCTOR)) ==
  1239. SLAB_CTOR_CONSTRUCTOR)
  1240. spin_lock_init(&sighand->siglock);
  1241. }
  1242. void __init proc_caches_init(void)
  1243. {
  1244. sighand_cachep = kmem_cache_create("sighand_cache",
  1245. sizeof(struct sighand_struct), 0,
  1246. SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_DESTROY_BY_RCU,
  1247. sighand_ctor, NULL);
  1248. signal_cachep = kmem_cache_create("signal_cache",
  1249. sizeof(struct signal_struct), 0,
  1250. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
  1251. files_cachep = kmem_cache_create("files_cache",
  1252. sizeof(struct files_struct), 0,
  1253. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
  1254. fs_cachep = kmem_cache_create("fs_cache",
  1255. sizeof(struct fs_struct), 0,
  1256. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
  1257. vm_area_cachep = kmem_cache_create("vm_area_struct",
  1258. sizeof(struct vm_area_struct), 0,
  1259. SLAB_PANIC, NULL, NULL);
  1260. mm_cachep = kmem_cache_create("mm_struct",
  1261. sizeof(struct mm_struct), ARCH_MIN_MMSTRUCT_ALIGN,
  1262. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
  1263. }
  1264. /*
  1265. * Check constraints on flags passed to the unshare system call and
  1266. * force unsharing of additional process context as appropriate.
  1267. */
  1268. static inline void check_unshare_flags(unsigned long *flags_ptr)
  1269. {
  1270. /*
  1271. * If unsharing a thread from a thread group, must also
  1272. * unshare vm.
  1273. */
  1274. if (*flags_ptr & CLONE_THREAD)
  1275. *flags_ptr |= CLONE_VM;
  1276. /*
  1277. * If unsharing vm, must also unshare signal handlers.
  1278. */
  1279. if (*flags_ptr & CLONE_VM)
  1280. *flags_ptr |= CLONE_SIGHAND;
  1281. /*
  1282. * If unsharing signal handlers and the task was created
  1283. * using CLONE_THREAD, then must unshare the thread
  1284. */
  1285. if ((*flags_ptr & CLONE_SIGHAND) &&
  1286. (atomic_read(&current->signal->count) > 1))
  1287. *flags_ptr |= CLONE_THREAD;
  1288. /*
  1289. * If unsharing namespace, must also unshare filesystem information.
  1290. */
  1291. if (*flags_ptr & CLONE_NEWNS)
  1292. *flags_ptr |= CLONE_FS;
  1293. }
  1294. /*
  1295. * Unsharing of tasks created with CLONE_THREAD is not supported yet
  1296. */
  1297. static int unshare_thread(unsigned long unshare_flags)
  1298. {
  1299. if (unshare_flags & CLONE_THREAD)
  1300. return -EINVAL;
  1301. return 0;
  1302. }
  1303. /*
  1304. * Unshare the filesystem structure if it is being shared
  1305. */
  1306. static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp)
  1307. {
  1308. struct fs_struct *fs = current->fs;
  1309. if ((unshare_flags & CLONE_FS) &&
  1310. (fs && atomic_read(&fs->count) > 1)) {
  1311. *new_fsp = __copy_fs_struct(current->fs);
  1312. if (!*new_fsp)
  1313. return -ENOMEM;
  1314. }
  1315. return 0;
  1316. }
  1317. /*
  1318. * Unshare the namespace structure if it is being shared
  1319. */
  1320. static int unshare_namespace(unsigned long unshare_flags, struct namespace **new_nsp, struct fs_struct *new_fs)
  1321. {
  1322. struct namespace *ns = current->nsproxy->namespace;
  1323. if ((unshare_flags & CLONE_NEWNS) && ns) {
  1324. if (!capable(CAP_SYS_ADMIN))
  1325. return -EPERM;
  1326. *new_nsp = dup_namespace(current, new_fs ? new_fs : current->fs);
  1327. if (!*new_nsp)
  1328. return -ENOMEM;
  1329. }
  1330. return 0;
  1331. }
  1332. /*
  1333. * Unsharing of sighand for tasks created with CLONE_SIGHAND is not
  1334. * supported yet
  1335. */
  1336. static int unshare_sighand(unsigned long unshare_flags, struct sighand_struct **new_sighp)
  1337. {
  1338. struct sighand_struct *sigh = current->sighand;
  1339. if ((unshare_flags & CLONE_SIGHAND) &&
  1340. (sigh && atomic_read(&sigh->count) > 1))
  1341. return -EINVAL;
  1342. else
  1343. return 0;
  1344. }
  1345. /*
  1346. * Unshare vm if it is being shared
  1347. */
  1348. static int unshare_vm(unsigned long unshare_flags, struct mm_struct **new_mmp)
  1349. {
  1350. struct mm_struct *mm = current->mm;
  1351. if ((unshare_flags & CLONE_VM) &&
  1352. (mm && atomic_read(&mm->mm_users) > 1)) {
  1353. return -EINVAL;
  1354. }
  1355. return 0;
  1356. }
  1357. /*
  1358. * Unshare file descriptor table if it is being shared
  1359. */
  1360. static int unshare_fd(unsigned long unshare_flags, struct files_struct **new_fdp)
  1361. {
  1362. struct files_struct *fd = current->files;
  1363. int error = 0;
  1364. if ((unshare_flags & CLONE_FILES) &&
  1365. (fd && atomic_read(&fd->count) > 1)) {
  1366. *new_fdp = dup_fd(fd, &error);
  1367. if (!*new_fdp)
  1368. return error;
  1369. }
  1370. return 0;
  1371. }
  1372. /*
  1373. * Unsharing of semundo for tasks created with CLONE_SYSVSEM is not
  1374. * supported yet
  1375. */
  1376. static int unshare_semundo(unsigned long unshare_flags, struct sem_undo_list **new_ulistp)
  1377. {
  1378. if (unshare_flags & CLONE_SYSVSEM)
  1379. return -EINVAL;
  1380. return 0;
  1381. }
  1382. #ifndef CONFIG_IPC_NS
  1383. static inline int unshare_ipcs(unsigned long flags, struct ipc_namespace **ns)
  1384. {
  1385. if (flags & CLONE_NEWIPC)
  1386. return -EINVAL;
  1387. return 0;
  1388. }
  1389. #endif
  1390. /*
  1391. * unshare allows a process to 'unshare' part of the process
  1392. * context which was originally shared using clone. copy_*
  1393. * functions used by do_fork() cannot be used here directly
  1394. * because they modify an inactive task_struct that is being
  1395. * constructed. Here we are modifying the current, active,
  1396. * task_struct.
  1397. */
  1398. asmlinkage long sys_unshare(unsigned long unshare_flags)
  1399. {
  1400. int err = 0;
  1401. struct fs_struct *fs, *new_fs = NULL;
  1402. struct namespace *ns, *new_ns = NULL;
  1403. struct sighand_struct *sigh, *new_sigh = NULL;
  1404. struct mm_struct *mm, *new_mm = NULL, *active_mm = NULL;
  1405. struct files_struct *fd, *new_fd = NULL;
  1406. struct sem_undo_list *new_ulist = NULL;
  1407. struct nsproxy *new_nsproxy = NULL, *old_nsproxy = NULL;
  1408. struct uts_namespace *uts, *new_uts = NULL;
  1409. struct ipc_namespace *ipc, *new_ipc = NULL;
  1410. check_unshare_flags(&unshare_flags);
  1411. /* Return -EINVAL for all unsupported flags */
  1412. err = -EINVAL;
  1413. if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND|
  1414. CLONE_VM|CLONE_FILES|CLONE_SYSVSEM|
  1415. CLONE_NEWUTS|CLONE_NEWIPC))
  1416. goto bad_unshare_out;
  1417. if ((err = unshare_thread(unshare_flags)))
  1418. goto bad_unshare_out;
  1419. if ((err = unshare_fs(unshare_flags, &new_fs)))
  1420. goto bad_unshare_cleanup_thread;
  1421. if ((err = unshare_namespace(unshare_flags, &new_ns, new_fs)))
  1422. goto bad_unshare_cleanup_fs;
  1423. if ((err = unshare_sighand(unshare_flags, &new_sigh)))
  1424. goto bad_unshare_cleanup_ns;
  1425. if ((err = unshare_vm(unshare_flags, &new_mm)))
  1426. goto bad_unshare_cleanup_sigh;
  1427. if ((err = unshare_fd(unshare_flags, &new_fd)))
  1428. goto bad_unshare_cleanup_vm;
  1429. if ((err = unshare_semundo(unshare_flags, &new_ulist)))
  1430. goto bad_unshare_cleanup_fd;
  1431. if ((err = unshare_utsname(unshare_flags, &new_uts)))
  1432. goto bad_unshare_cleanup_semundo;
  1433. if ((err = unshare_ipcs(unshare_flags, &new_ipc)))
  1434. goto bad_unshare_cleanup_uts;
  1435. if (new_ns || new_uts || new_ipc) {
  1436. old_nsproxy = current->nsproxy;
  1437. new_nsproxy = dup_namespaces(old_nsproxy);
  1438. if (!new_nsproxy) {
  1439. err = -ENOMEM;
  1440. goto bad_unshare_cleanup_ipc;
  1441. }
  1442. }
  1443. if (new_fs || new_ns || new_sigh || new_mm || new_fd || new_ulist ||
  1444. new_uts || new_ipc) {
  1445. task_lock(current);
  1446. if (new_nsproxy) {
  1447. current->nsproxy = new_nsproxy;
  1448. new_nsproxy = old_nsproxy;
  1449. }
  1450. if (new_fs) {
  1451. fs = current->fs;
  1452. current->fs = new_fs;
  1453. new_fs = fs;
  1454. }
  1455. if (new_ns) {
  1456. ns = current->nsproxy->namespace;
  1457. current->nsproxy->namespace = new_ns;
  1458. new_ns = ns;
  1459. }
  1460. if (new_sigh) {
  1461. sigh = current->sighand;
  1462. rcu_assign_pointer(current->sighand, new_sigh);
  1463. new_sigh = sigh;
  1464. }
  1465. if (new_mm) {
  1466. mm = current->mm;
  1467. active_mm = current->active_mm;
  1468. current->mm = new_mm;
  1469. current->active_mm = new_mm;
  1470. activate_mm(active_mm, new_mm);
  1471. new_mm = mm;
  1472. }
  1473. if (new_fd) {
  1474. fd = current->files;
  1475. current->files = new_fd;
  1476. new_fd = fd;
  1477. }
  1478. if (new_uts) {
  1479. uts = current->nsproxy->uts_ns;
  1480. current->nsproxy->uts_ns = new_uts;
  1481. new_uts = uts;
  1482. }
  1483. if (new_ipc) {
  1484. ipc = current->nsproxy->ipc_ns;
  1485. current->nsproxy->ipc_ns = new_ipc;
  1486. new_ipc = ipc;
  1487. }
  1488. task_unlock(current);
  1489. }
  1490. if (new_nsproxy)
  1491. put_nsproxy(new_nsproxy);
  1492. bad_unshare_cleanup_ipc:
  1493. if (new_ipc)
  1494. put_ipc_ns(new_ipc);
  1495. bad_unshare_cleanup_uts:
  1496. if (new_uts)
  1497. put_uts_ns(new_uts);
  1498. bad_unshare_cleanup_semundo:
  1499. bad_unshare_cleanup_fd:
  1500. if (new_fd)
  1501. put_files_struct(new_fd);
  1502. bad_unshare_cleanup_vm:
  1503. if (new_mm)
  1504. mmput(new_mm);
  1505. bad_unshare_cleanup_sigh:
  1506. if (new_sigh)
  1507. if (atomic_dec_and_test(&new_sigh->count))
  1508. kmem_cache_free(sighand_cachep, new_sigh);
  1509. bad_unshare_cleanup_ns:
  1510. if (new_ns)
  1511. put_namespace(new_ns);
  1512. bad_unshare_cleanup_fs:
  1513. if (new_fs)
  1514. put_fs_struct(new_fs);
  1515. bad_unshare_cleanup_thread:
  1516. bad_unshare_out:
  1517. return err;
  1518. }