fork.c 56 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354
  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/module.h>
  16. #include <linux/vmalloc.h>
  17. #include <linux/completion.h>
  18. #include <linux/personality.h>
  19. #include <linux/mempolicy.h>
  20. #include <linux/sem.h>
  21. #include <linux/file.h>
  22. #include <linux/fdtable.h>
  23. #include <linux/iocontext.h>
  24. #include <linux/key.h>
  25. #include <linux/binfmts.h>
  26. #include <linux/mman.h>
  27. #include <linux/mmu_notifier.h>
  28. #include <linux/fs.h>
  29. #include <linux/mm.h>
  30. #include <linux/vmacache.h>
  31. #include <linux/nsproxy.h>
  32. #include <linux/capability.h>
  33. #include <linux/cpu.h>
  34. #include <linux/cgroup.h>
  35. #include <linux/security.h>
  36. #include <linux/hugetlb.h>
  37. #include <linux/seccomp.h>
  38. #include <linux/swap.h>
  39. #include <linux/syscalls.h>
  40. #include <linux/jiffies.h>
  41. #include <linux/futex.h>
  42. #include <linux/compat.h>
  43. #include <linux/kthread.h>
  44. #include <linux/task_io_accounting_ops.h>
  45. #include <linux/rcupdate.h>
  46. #include <linux/ptrace.h>
  47. #include <linux/mount.h>
  48. #include <linux/audit.h>
  49. #include <linux/memcontrol.h>
  50. #include <linux/ftrace.h>
  51. #include <linux/proc_fs.h>
  52. #include <linux/profile.h>
  53. #include <linux/rmap.h>
  54. #include <linux/ksm.h>
  55. #include <linux/acct.h>
  56. #include <linux/tsacct_kern.h>
  57. #include <linux/cn_proc.h>
  58. #include <linux/freezer.h>
  59. #include <linux/kaiser.h>
  60. #include <linux/delayacct.h>
  61. #include <linux/taskstats_kern.h>
  62. #include <linux/random.h>
  63. #include <linux/tty.h>
  64. #include <linux/blkdev.h>
  65. #include <linux/fs_struct.h>
  66. #include <linux/magic.h>
  67. #include <linux/perf_event.h>
  68. #include <linux/posix-timers.h>
  69. #include <linux/user-return-notifier.h>
  70. #include <linux/oom.h>
  71. #include <linux/khugepaged.h>
  72. #include <linux/signalfd.h>
  73. #include <linux/uprobes.h>
  74. #include <linux/aio.h>
  75. #include <linux/compiler.h>
  76. #include <linux/sysctl.h>
  77. #include <linux/kcov.h>
  78. #include <asm/pgtable.h>
  79. #include <asm/pgalloc.h>
  80. #include <asm/uaccess.h>
  81. #include <asm/mmu_context.h>
  82. #include <asm/cacheflush.h>
  83. #include <asm/tlbflush.h>
  84. #include <trace/events/sched.h>
  85. #define CREATE_TRACE_POINTS
  86. #include <trace/events/task.h>
  87. /*
  88. * Minimum number of threads to boot the kernel
  89. */
  90. #define MIN_THREADS 20
  91. /*
  92. * Maximum number of threads
  93. */
  94. #define MAX_THREADS FUTEX_TID_MASK
  95. /*
  96. * Protected counters by write_lock_irq(&tasklist_lock)
  97. */
  98. unsigned long total_forks; /* Handle normal Linux uptimes. */
  99. int nr_threads; /* The idle threads do not count.. */
  100. int max_threads; /* tunable limit on nr_threads */
  101. DEFINE_PER_CPU(unsigned long, process_counts) = 0;
  102. __cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */
  103. #ifdef CONFIG_PROVE_RCU
  104. int lockdep_tasklist_lock_is_held(void)
  105. {
  106. return lockdep_is_held(&tasklist_lock);
  107. }
  108. EXPORT_SYMBOL_GPL(lockdep_tasklist_lock_is_held);
  109. #endif /* #ifdef CONFIG_PROVE_RCU */
  110. int nr_processes(void)
  111. {
  112. int cpu;
  113. int total = 0;
  114. for_each_possible_cpu(cpu)
  115. total += per_cpu(process_counts, cpu);
  116. return total;
  117. }
  118. void __weak arch_release_task_struct(struct task_struct *tsk)
  119. {
  120. }
  121. #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
  122. static struct kmem_cache *task_struct_cachep;
  123. static inline struct task_struct *alloc_task_struct_node(int node)
  124. {
  125. return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node);
  126. }
  127. static inline void free_task_struct(struct task_struct *tsk)
  128. {
  129. kmem_cache_free(task_struct_cachep, tsk);
  130. }
  131. #endif
  132. void __weak arch_release_thread_stack(unsigned long *stack)
  133. {
  134. }
  135. #ifndef CONFIG_ARCH_THREAD_STACK_ALLOCATOR
  136. /*
  137. * Allocate pages if THREAD_SIZE is >= PAGE_SIZE, otherwise use a
  138. * kmemcache based allocator.
  139. */
  140. # if THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)
  141. #ifdef CONFIG_VMAP_STACK
  142. /*
  143. * vmalloc() is a bit slow, and calling vfree() enough times will force a TLB
  144. * flush. Try to minimize the number of calls by caching stacks.
  145. */
  146. #define NR_CACHED_STACKS 2
  147. static DEFINE_PER_CPU(struct vm_struct *, cached_stacks[NR_CACHED_STACKS]);
  148. #endif
  149. static unsigned long *alloc_thread_stack_node(struct task_struct *tsk, int node)
  150. {
  151. #ifdef CONFIG_VMAP_STACK
  152. void *stack;
  153. int i;
  154. local_irq_disable();
  155. for (i = 0; i < NR_CACHED_STACKS; i++) {
  156. struct vm_struct *s = this_cpu_read(cached_stacks[i]);
  157. if (!s)
  158. continue;
  159. this_cpu_write(cached_stacks[i], NULL);
  160. tsk->stack_vm_area = s;
  161. local_irq_enable();
  162. return s->addr;
  163. }
  164. local_irq_enable();
  165. stack = __vmalloc_node_range(THREAD_SIZE, THREAD_SIZE,
  166. VMALLOC_START, VMALLOC_END,
  167. THREADINFO_GFP | __GFP_HIGHMEM,
  168. PAGE_KERNEL,
  169. 0, node, __builtin_return_address(0));
  170. /*
  171. * We can't call find_vm_area() in interrupt context, and
  172. * free_thread_stack() can be called in interrupt context,
  173. * so cache the vm_struct.
  174. */
  175. if (stack)
  176. tsk->stack_vm_area = find_vm_area(stack);
  177. return stack;
  178. #else
  179. struct page *page = alloc_pages_node(node, THREADINFO_GFP,
  180. THREAD_SIZE_ORDER);
  181. return page ? page_address(page) : NULL;
  182. #endif
  183. }
  184. static inline void free_thread_stack(struct task_struct *tsk)
  185. {
  186. kaiser_unmap_thread_stack(tsk->stack);
  187. #ifdef CONFIG_VMAP_STACK
  188. if (task_stack_vm_area(tsk)) {
  189. unsigned long flags;
  190. int i;
  191. local_irq_save(flags);
  192. for (i = 0; i < NR_CACHED_STACKS; i++) {
  193. if (this_cpu_read(cached_stacks[i]))
  194. continue;
  195. this_cpu_write(cached_stacks[i], tsk->stack_vm_area);
  196. local_irq_restore(flags);
  197. return;
  198. }
  199. local_irq_restore(flags);
  200. vfree(tsk->stack);
  201. return;
  202. }
  203. #endif
  204. __free_pages(virt_to_page(tsk->stack), THREAD_SIZE_ORDER);
  205. }
  206. # else
  207. static struct kmem_cache *thread_stack_cache;
  208. static unsigned long *alloc_thread_stack_node(struct task_struct *tsk,
  209. int node)
  210. {
  211. return kmem_cache_alloc_node(thread_stack_cache, THREADINFO_GFP, node);
  212. }
  213. static void free_thread_stack(struct task_struct *tsk)
  214. {
  215. kmem_cache_free(thread_stack_cache, tsk->stack);
  216. }
  217. void thread_stack_cache_init(void)
  218. {
  219. thread_stack_cache = kmem_cache_create("thread_stack", THREAD_SIZE,
  220. THREAD_SIZE, 0, NULL);
  221. BUG_ON(thread_stack_cache == NULL);
  222. }
  223. # endif
  224. #endif
  225. /* SLAB cache for signal_struct structures (tsk->signal) */
  226. static struct kmem_cache *signal_cachep;
  227. /* SLAB cache for sighand_struct structures (tsk->sighand) */
  228. struct kmem_cache *sighand_cachep;
  229. /* SLAB cache for files_struct structures (tsk->files) */
  230. struct kmem_cache *files_cachep;
  231. /* SLAB cache for fs_struct structures (tsk->fs) */
  232. struct kmem_cache *fs_cachep;
  233. /* SLAB cache for vm_area_struct structures */
  234. struct kmem_cache *vm_area_cachep;
  235. /* SLAB cache for mm_struct structures (tsk->mm) */
  236. static struct kmem_cache *mm_cachep;
  237. static void account_kernel_stack(struct task_struct *tsk, int account)
  238. {
  239. void *stack = task_stack_page(tsk);
  240. struct vm_struct *vm = task_stack_vm_area(tsk);
  241. BUILD_BUG_ON(IS_ENABLED(CONFIG_VMAP_STACK) && PAGE_SIZE % 1024 != 0);
  242. if (vm) {
  243. int i;
  244. BUG_ON(vm->nr_pages != THREAD_SIZE / PAGE_SIZE);
  245. for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
  246. mod_zone_page_state(page_zone(vm->pages[i]),
  247. NR_KERNEL_STACK_KB,
  248. PAGE_SIZE / 1024 * account);
  249. }
  250. /* All stack pages belong to the same memcg. */
  251. memcg_kmem_update_page_stat(vm->pages[0], MEMCG_KERNEL_STACK_KB,
  252. account * (THREAD_SIZE / 1024));
  253. } else {
  254. /*
  255. * All stack pages are in the same zone and belong to the
  256. * same memcg.
  257. */
  258. struct page *first_page = virt_to_page(stack);
  259. mod_zone_page_state(page_zone(first_page), NR_KERNEL_STACK_KB,
  260. THREAD_SIZE / 1024 * account);
  261. memcg_kmem_update_page_stat(first_page, MEMCG_KERNEL_STACK_KB,
  262. account * (THREAD_SIZE / 1024));
  263. }
  264. }
  265. static void release_task_stack(struct task_struct *tsk)
  266. {
  267. if (WARN_ON(tsk->state != TASK_DEAD))
  268. return; /* Better to leak the stack than to free prematurely */
  269. account_kernel_stack(tsk, -1);
  270. arch_release_thread_stack(tsk->stack);
  271. free_thread_stack(tsk);
  272. tsk->stack = NULL;
  273. #ifdef CONFIG_VMAP_STACK
  274. tsk->stack_vm_area = NULL;
  275. #endif
  276. }
  277. #ifdef CONFIG_THREAD_INFO_IN_TASK
  278. void put_task_stack(struct task_struct *tsk)
  279. {
  280. if (atomic_dec_and_test(&tsk->stack_refcount))
  281. release_task_stack(tsk);
  282. }
  283. #endif
  284. void free_task(struct task_struct *tsk)
  285. {
  286. #ifndef CONFIG_THREAD_INFO_IN_TASK
  287. /*
  288. * The task is finally done with both the stack and thread_info,
  289. * so free both.
  290. */
  291. release_task_stack(tsk);
  292. #else
  293. /*
  294. * If the task had a separate stack allocation, it should be gone
  295. * by now.
  296. */
  297. WARN_ON_ONCE(atomic_read(&tsk->stack_refcount) != 0);
  298. #endif
  299. rt_mutex_debug_task_free(tsk);
  300. ftrace_graph_exit_task(tsk);
  301. put_seccomp_filter(tsk);
  302. arch_release_task_struct(tsk);
  303. free_task_struct(tsk);
  304. }
  305. EXPORT_SYMBOL(free_task);
  306. static inline void free_signal_struct(struct signal_struct *sig)
  307. {
  308. taskstats_tgid_free(sig);
  309. sched_autogroup_exit(sig);
  310. /*
  311. * __mmdrop is not safe to call from softirq context on x86 due to
  312. * pgd_dtor so postpone it to the async context
  313. */
  314. if (sig->oom_mm)
  315. mmdrop_async(sig->oom_mm);
  316. kmem_cache_free(signal_cachep, sig);
  317. }
  318. static inline void put_signal_struct(struct signal_struct *sig)
  319. {
  320. if (atomic_dec_and_test(&sig->sigcnt))
  321. free_signal_struct(sig);
  322. }
  323. void __put_task_struct(struct task_struct *tsk)
  324. {
  325. WARN_ON(!tsk->exit_state);
  326. WARN_ON(atomic_read(&tsk->usage));
  327. WARN_ON(tsk == current);
  328. cgroup_free(tsk);
  329. task_numa_free(tsk);
  330. security_task_free(tsk);
  331. exit_creds(tsk);
  332. delayacct_tsk_free(tsk);
  333. put_signal_struct(tsk->signal);
  334. if (!profile_handoff_task(tsk))
  335. free_task(tsk);
  336. }
  337. EXPORT_SYMBOL_GPL(__put_task_struct);
  338. void __init __weak arch_task_cache_init(void) { }
  339. /*
  340. * set_max_threads
  341. */
  342. static void set_max_threads(unsigned int max_threads_suggested)
  343. {
  344. u64 threads;
  345. /*
  346. * The number of threads shall be limited such that the thread
  347. * structures may only consume a small part of the available memory.
  348. */
  349. if (fls64(totalram_pages) + fls64(PAGE_SIZE) > 64)
  350. threads = MAX_THREADS;
  351. else
  352. threads = div64_u64((u64) totalram_pages * (u64) PAGE_SIZE,
  353. (u64) THREAD_SIZE * 8UL);
  354. if (threads > max_threads_suggested)
  355. threads = max_threads_suggested;
  356. max_threads = clamp_t(u64, threads, MIN_THREADS, MAX_THREADS);
  357. }
  358. #ifdef CONFIG_ARCH_WANTS_DYNAMIC_TASK_STRUCT
  359. /* Initialized by the architecture: */
  360. int arch_task_struct_size __read_mostly;
  361. #endif
  362. void __init fork_init(void)
  363. {
  364. int i;
  365. #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
  366. #ifndef ARCH_MIN_TASKALIGN
  367. #define ARCH_MIN_TASKALIGN L1_CACHE_BYTES
  368. #endif
  369. /* create a slab on which task_structs can be allocated */
  370. task_struct_cachep = kmem_cache_create("task_struct",
  371. arch_task_struct_size, ARCH_MIN_TASKALIGN,
  372. SLAB_PANIC|SLAB_NOTRACK|SLAB_ACCOUNT, NULL);
  373. #endif
  374. /* do the arch specific task caches init */
  375. arch_task_cache_init();
  376. set_max_threads(MAX_THREADS);
  377. init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
  378. init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
  379. init_task.signal->rlim[RLIMIT_SIGPENDING] =
  380. init_task.signal->rlim[RLIMIT_NPROC];
  381. for (i = 0; i < UCOUNT_COUNTS; i++) {
  382. init_user_ns.ucount_max[i] = max_threads/2;
  383. }
  384. }
  385. int __weak arch_dup_task_struct(struct task_struct *dst,
  386. struct task_struct *src)
  387. {
  388. *dst = *src;
  389. return 0;
  390. }
  391. void set_task_stack_end_magic(struct task_struct *tsk)
  392. {
  393. unsigned long *stackend;
  394. stackend = end_of_stack(tsk);
  395. *stackend = STACK_END_MAGIC; /* for overflow detection */
  396. }
  397. static struct task_struct *dup_task_struct(struct task_struct *orig, int node)
  398. {
  399. struct task_struct *tsk;
  400. unsigned long *stack;
  401. struct vm_struct *stack_vm_area;
  402. int err;
  403. if (node == NUMA_NO_NODE)
  404. node = tsk_fork_get_node(orig);
  405. tsk = alloc_task_struct_node(node);
  406. if (!tsk)
  407. return NULL;
  408. stack = alloc_thread_stack_node(tsk, node);
  409. if (!stack)
  410. goto free_tsk;
  411. stack_vm_area = task_stack_vm_area(tsk);
  412. err = arch_dup_task_struct(tsk, orig);
  413. /*
  414. * arch_dup_task_struct() clobbers the stack-related fields. Make
  415. * sure they're properly initialized before using any stack-related
  416. * functions again.
  417. */
  418. tsk->stack = stack;
  419. err= kaiser_map_thread_stack(tsk->stack);
  420. if (err)
  421. goto free_stack;
  422. #ifdef CONFIG_VMAP_STACK
  423. tsk->stack_vm_area = stack_vm_area;
  424. #endif
  425. #ifdef CONFIG_THREAD_INFO_IN_TASK
  426. atomic_set(&tsk->stack_refcount, 1);
  427. #endif
  428. if (err)
  429. goto free_stack;
  430. #ifdef CONFIG_SECCOMP
  431. /*
  432. * We must handle setting up seccomp filters once we're under
  433. * the sighand lock in case orig has changed between now and
  434. * then. Until then, filter must be NULL to avoid messing up
  435. * the usage counts on the error path calling free_task.
  436. */
  437. tsk->seccomp.filter = NULL;
  438. #endif
  439. setup_thread_stack(tsk, orig);
  440. clear_user_return_notifier(tsk);
  441. clear_tsk_need_resched(tsk);
  442. set_task_stack_end_magic(tsk);
  443. #ifdef CONFIG_CC_STACKPROTECTOR
  444. tsk->stack_canary = get_random_long();
  445. #endif
  446. /*
  447. * One for us, one for whoever does the "release_task()" (usually
  448. * parent)
  449. */
  450. atomic_set(&tsk->usage, 2);
  451. #ifdef CONFIG_BLK_DEV_IO_TRACE
  452. tsk->btrace_seq = 0;
  453. #endif
  454. tsk->splice_pipe = NULL;
  455. tsk->task_frag.page = NULL;
  456. tsk->wake_q.next = NULL;
  457. account_kernel_stack(tsk, 1);
  458. kcov_task_init(tsk);
  459. return tsk;
  460. free_stack:
  461. free_thread_stack(tsk);
  462. free_tsk:
  463. free_task_struct(tsk);
  464. return NULL;
  465. }
  466. #ifdef CONFIG_MMU
  467. static __latent_entropy int dup_mmap(struct mm_struct *mm,
  468. struct mm_struct *oldmm)
  469. {
  470. struct vm_area_struct *mpnt, *tmp, *prev, **pprev;
  471. struct rb_node **rb_link, *rb_parent;
  472. int retval;
  473. unsigned long charge;
  474. uprobe_start_dup_mmap();
  475. if (down_write_killable(&oldmm->mmap_sem)) {
  476. retval = -EINTR;
  477. goto fail_uprobe_end;
  478. }
  479. flush_cache_dup_mm(oldmm);
  480. uprobe_dup_mmap(oldmm, mm);
  481. /*
  482. * Not linked in yet - no deadlock potential:
  483. */
  484. down_write_nested(&mm->mmap_sem, SINGLE_DEPTH_NESTING);
  485. /* No ordering required: file already has been exposed. */
  486. RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm));
  487. mm->total_vm = oldmm->total_vm;
  488. mm->data_vm = oldmm->data_vm;
  489. mm->exec_vm = oldmm->exec_vm;
  490. mm->stack_vm = oldmm->stack_vm;
  491. rb_link = &mm->mm_rb.rb_node;
  492. rb_parent = NULL;
  493. pprev = &mm->mmap;
  494. retval = ksm_fork(mm, oldmm);
  495. if (retval)
  496. goto out;
  497. retval = khugepaged_fork(mm, oldmm);
  498. if (retval)
  499. goto out;
  500. prev = NULL;
  501. for (mpnt = oldmm->mmap; mpnt; mpnt = mpnt->vm_next) {
  502. struct file *file;
  503. if (mpnt->vm_flags & VM_DONTCOPY) {
  504. vm_stat_account(mm, mpnt->vm_flags, -vma_pages(mpnt));
  505. continue;
  506. }
  507. charge = 0;
  508. if (mpnt->vm_flags & VM_ACCOUNT) {
  509. unsigned long len = vma_pages(mpnt);
  510. if (security_vm_enough_memory_mm(oldmm, len)) /* sic */
  511. goto fail_nomem;
  512. charge = len;
  513. }
  514. tmp = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
  515. if (!tmp)
  516. goto fail_nomem;
  517. *tmp = *mpnt;
  518. INIT_LIST_HEAD(&tmp->anon_vma_chain);
  519. retval = vma_dup_policy(mpnt, tmp);
  520. if (retval)
  521. goto fail_nomem_policy;
  522. tmp->vm_mm = mm;
  523. if (anon_vma_fork(tmp, mpnt))
  524. goto fail_nomem_anon_vma_fork;
  525. tmp->vm_flags &=
  526. ~(VM_LOCKED|VM_LOCKONFAULT|VM_UFFD_MISSING|VM_UFFD_WP);
  527. tmp->vm_next = tmp->vm_prev = NULL;
  528. tmp->vm_userfaultfd_ctx = NULL_VM_UFFD_CTX;
  529. file = tmp->vm_file;
  530. if (file) {
  531. struct inode *inode = file_inode(file);
  532. struct address_space *mapping = file->f_mapping;
  533. get_file(file);
  534. if (tmp->vm_flags & VM_DENYWRITE)
  535. atomic_dec(&inode->i_writecount);
  536. i_mmap_lock_write(mapping);
  537. if (tmp->vm_flags & VM_SHARED)
  538. atomic_inc(&mapping->i_mmap_writable);
  539. flush_dcache_mmap_lock(mapping);
  540. /* insert tmp into the share list, just after mpnt */
  541. vma_interval_tree_insert_after(tmp, mpnt,
  542. &mapping->i_mmap);
  543. flush_dcache_mmap_unlock(mapping);
  544. i_mmap_unlock_write(mapping);
  545. }
  546. /*
  547. * Clear hugetlb-related page reserves for children. This only
  548. * affects MAP_PRIVATE mappings. Faults generated by the child
  549. * are not guaranteed to succeed, even if read-only
  550. */
  551. if (is_vm_hugetlb_page(tmp))
  552. reset_vma_resv_huge_pages(tmp);
  553. /*
  554. * Link in the new vma and copy the page table entries.
  555. */
  556. *pprev = tmp;
  557. pprev = &tmp->vm_next;
  558. tmp->vm_prev = prev;
  559. prev = tmp;
  560. __vma_link_rb(mm, tmp, rb_link, rb_parent);
  561. rb_link = &tmp->vm_rb.rb_right;
  562. rb_parent = &tmp->vm_rb;
  563. mm->map_count++;
  564. retval = copy_page_range(mm, oldmm, mpnt);
  565. if (tmp->vm_ops && tmp->vm_ops->open)
  566. tmp->vm_ops->open(tmp);
  567. if (retval)
  568. goto out;
  569. }
  570. /* a new mm has just been created */
  571. arch_dup_mmap(oldmm, mm);
  572. retval = 0;
  573. out:
  574. up_write(&mm->mmap_sem);
  575. flush_tlb_mm(oldmm);
  576. up_write(&oldmm->mmap_sem);
  577. fail_uprobe_end:
  578. uprobe_end_dup_mmap();
  579. return retval;
  580. fail_nomem_anon_vma_fork:
  581. mpol_put(vma_policy(tmp));
  582. fail_nomem_policy:
  583. kmem_cache_free(vm_area_cachep, tmp);
  584. fail_nomem:
  585. retval = -ENOMEM;
  586. vm_unacct_memory(charge);
  587. goto out;
  588. }
  589. static inline int mm_alloc_pgd(struct mm_struct *mm)
  590. {
  591. mm->pgd = pgd_alloc(mm);
  592. if (unlikely(!mm->pgd))
  593. return -ENOMEM;
  594. return 0;
  595. }
  596. static inline void mm_free_pgd(struct mm_struct *mm)
  597. {
  598. pgd_free(mm, mm->pgd);
  599. }
  600. #else
  601. static int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm)
  602. {
  603. down_write(&oldmm->mmap_sem);
  604. RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm));
  605. up_write(&oldmm->mmap_sem);
  606. return 0;
  607. }
  608. #define mm_alloc_pgd(mm) (0)
  609. #define mm_free_pgd(mm)
  610. #endif /* CONFIG_MMU */
  611. __cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock);
  612. #define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL))
  613. #define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
  614. static unsigned long default_dump_filter = MMF_DUMP_FILTER_DEFAULT;
  615. static int __init coredump_filter_setup(char *s)
  616. {
  617. default_dump_filter =
  618. (simple_strtoul(s, NULL, 0) << MMF_DUMP_FILTER_SHIFT) &
  619. MMF_DUMP_FILTER_MASK;
  620. return 1;
  621. }
  622. __setup("coredump_filter=", coredump_filter_setup);
  623. #include <linux/init_task.h>
  624. static void mm_init_aio(struct mm_struct *mm)
  625. {
  626. #ifdef CONFIG_AIO
  627. spin_lock_init(&mm->ioctx_lock);
  628. mm->ioctx_table = NULL;
  629. #endif
  630. }
  631. static void mm_init_owner(struct mm_struct *mm, struct task_struct *p)
  632. {
  633. #ifdef CONFIG_MEMCG
  634. mm->owner = p;
  635. #endif
  636. }
  637. static void mm_init_uprobes_state(struct mm_struct *mm)
  638. {
  639. #ifdef CONFIG_UPROBES
  640. mm->uprobes_state.xol_area = NULL;
  641. #endif
  642. }
  643. static struct mm_struct *mm_init(struct mm_struct *mm, struct task_struct *p,
  644. struct user_namespace *user_ns)
  645. {
  646. mm->mmap = NULL;
  647. mm->mm_rb = RB_ROOT;
  648. mm->vmacache_seqnum = 0;
  649. atomic_set(&mm->mm_users, 1);
  650. atomic_set(&mm->mm_count, 1);
  651. init_rwsem(&mm->mmap_sem);
  652. INIT_LIST_HEAD(&mm->mmlist);
  653. mm->core_state = NULL;
  654. atomic_long_set(&mm->nr_ptes, 0);
  655. mm_nr_pmds_init(mm);
  656. mm->map_count = 0;
  657. mm->locked_vm = 0;
  658. mm->pinned_vm = 0;
  659. memset(&mm->rss_stat, 0, sizeof(mm->rss_stat));
  660. spin_lock_init(&mm->page_table_lock);
  661. mm_init_cpumask(mm);
  662. mm_init_aio(mm);
  663. mm_init_owner(mm, p);
  664. RCU_INIT_POINTER(mm->exe_file, NULL);
  665. mmu_notifier_mm_init(mm);
  666. clear_tlb_flush_pending(mm);
  667. #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
  668. mm->pmd_huge_pte = NULL;
  669. #endif
  670. mm_init_uprobes_state(mm);
  671. if (current->mm) {
  672. mm->flags = current->mm->flags & MMF_INIT_MASK;
  673. mm->def_flags = current->mm->def_flags & VM_INIT_DEF_MASK;
  674. } else {
  675. mm->flags = default_dump_filter;
  676. mm->def_flags = 0;
  677. }
  678. if (mm_alloc_pgd(mm))
  679. goto fail_nopgd;
  680. if (init_new_context(p, mm))
  681. goto fail_nocontext;
  682. mm->user_ns = get_user_ns(user_ns);
  683. return mm;
  684. fail_nocontext:
  685. mm_free_pgd(mm);
  686. fail_nopgd:
  687. free_mm(mm);
  688. return NULL;
  689. }
  690. static void check_mm(struct mm_struct *mm)
  691. {
  692. int i;
  693. for (i = 0; i < NR_MM_COUNTERS; i++) {
  694. long x = atomic_long_read(&mm->rss_stat.count[i]);
  695. if (unlikely(x))
  696. printk(KERN_ALERT "BUG: Bad rss-counter state "
  697. "mm:%p idx:%d val:%ld\n", mm, i, x);
  698. }
  699. if (atomic_long_read(&mm->nr_ptes))
  700. pr_alert("BUG: non-zero nr_ptes on freeing mm: %ld\n",
  701. atomic_long_read(&mm->nr_ptes));
  702. if (mm_nr_pmds(mm))
  703. pr_alert("BUG: non-zero nr_pmds on freeing mm: %ld\n",
  704. mm_nr_pmds(mm));
  705. #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
  706. VM_BUG_ON_MM(mm->pmd_huge_pte, mm);
  707. #endif
  708. }
  709. /*
  710. * Allocate and initialize an mm_struct.
  711. */
  712. struct mm_struct *mm_alloc(void)
  713. {
  714. struct mm_struct *mm;
  715. mm = allocate_mm();
  716. if (!mm)
  717. return NULL;
  718. memset(mm, 0, sizeof(*mm));
  719. return mm_init(mm, current, current_user_ns());
  720. }
  721. /*
  722. * Called when the last reference to the mm
  723. * is dropped: either by a lazy thread or by
  724. * mmput. Free the page directory and the mm.
  725. */
  726. void __mmdrop(struct mm_struct *mm)
  727. {
  728. BUG_ON(mm == &init_mm);
  729. mm_free_pgd(mm);
  730. destroy_context(mm);
  731. mmu_notifier_mm_destroy(mm);
  732. check_mm(mm);
  733. put_user_ns(mm->user_ns);
  734. free_mm(mm);
  735. }
  736. EXPORT_SYMBOL_GPL(__mmdrop);
  737. static inline void __mmput(struct mm_struct *mm)
  738. {
  739. VM_BUG_ON(atomic_read(&mm->mm_users));
  740. uprobe_clear_state(mm);
  741. exit_aio(mm);
  742. ksm_exit(mm);
  743. khugepaged_exit(mm); /* must run before exit_mmap */
  744. exit_mmap(mm);
  745. mm_put_huge_zero_page(mm);
  746. set_mm_exe_file(mm, NULL);
  747. if (!list_empty(&mm->mmlist)) {
  748. spin_lock(&mmlist_lock);
  749. list_del(&mm->mmlist);
  750. spin_unlock(&mmlist_lock);
  751. }
  752. if (mm->binfmt)
  753. module_put(mm->binfmt->module);
  754. set_bit(MMF_OOM_SKIP, &mm->flags);
  755. mmdrop(mm);
  756. }
  757. /*
  758. * Decrement the use count and release all resources for an mm.
  759. */
  760. void mmput(struct mm_struct *mm)
  761. {
  762. might_sleep();
  763. if (atomic_dec_and_test(&mm->mm_users))
  764. __mmput(mm);
  765. }
  766. EXPORT_SYMBOL_GPL(mmput);
  767. #ifdef CONFIG_MMU
  768. static void mmput_async_fn(struct work_struct *work)
  769. {
  770. struct mm_struct *mm = container_of(work, struct mm_struct, async_put_work);
  771. __mmput(mm);
  772. }
  773. void mmput_async(struct mm_struct *mm)
  774. {
  775. if (atomic_dec_and_test(&mm->mm_users)) {
  776. INIT_WORK(&mm->async_put_work, mmput_async_fn);
  777. schedule_work(&mm->async_put_work);
  778. }
  779. }
  780. #endif
  781. /**
  782. * set_mm_exe_file - change a reference to the mm's executable file
  783. *
  784. * This changes mm's executable file (shown as symlink /proc/[pid]/exe).
  785. *
  786. * Main users are mmput() and sys_execve(). Callers prevent concurrent
  787. * invocations: in mmput() nobody alive left, in execve task is single
  788. * threaded. sys_prctl(PR_SET_MM_MAP/EXE_FILE) also needs to set the
  789. * mm->exe_file, but does so without using set_mm_exe_file() in order
  790. * to do avoid the need for any locks.
  791. */
  792. void set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
  793. {
  794. struct file *old_exe_file;
  795. /*
  796. * It is safe to dereference the exe_file without RCU as
  797. * this function is only called if nobody else can access
  798. * this mm -- see comment above for justification.
  799. */
  800. old_exe_file = rcu_dereference_raw(mm->exe_file);
  801. if (new_exe_file)
  802. get_file(new_exe_file);
  803. rcu_assign_pointer(mm->exe_file, new_exe_file);
  804. if (old_exe_file)
  805. fput(old_exe_file);
  806. }
  807. /**
  808. * get_mm_exe_file - acquire a reference to the mm's executable file
  809. *
  810. * Returns %NULL if mm has no associated executable file.
  811. * User must release file via fput().
  812. */
  813. struct file *get_mm_exe_file(struct mm_struct *mm)
  814. {
  815. struct file *exe_file;
  816. rcu_read_lock();
  817. exe_file = rcu_dereference(mm->exe_file);
  818. if (exe_file && !get_file_rcu(exe_file))
  819. exe_file = NULL;
  820. rcu_read_unlock();
  821. return exe_file;
  822. }
  823. EXPORT_SYMBOL(get_mm_exe_file);
  824. /**
  825. * get_task_exe_file - acquire a reference to the task's executable file
  826. *
  827. * Returns %NULL if task's mm (if any) has no associated executable file or
  828. * this is a kernel thread with borrowed mm (see the comment above get_task_mm).
  829. * User must release file via fput().
  830. */
  831. struct file *get_task_exe_file(struct task_struct *task)
  832. {
  833. struct file *exe_file = NULL;
  834. struct mm_struct *mm;
  835. task_lock(task);
  836. mm = task->mm;
  837. if (mm) {
  838. if (!(task->flags & PF_KTHREAD))
  839. exe_file = get_mm_exe_file(mm);
  840. }
  841. task_unlock(task);
  842. return exe_file;
  843. }
  844. EXPORT_SYMBOL(get_task_exe_file);
  845. /**
  846. * get_task_mm - acquire a reference to the task's mm
  847. *
  848. * Returns %NULL if the task has no mm. Checks PF_KTHREAD (meaning
  849. * this kernel workthread has transiently adopted a user mm with use_mm,
  850. * to do its AIO) is not set and if so returns a reference to it, after
  851. * bumping up the use count. User must release the mm via mmput()
  852. * after use. Typically used by /proc and ptrace.
  853. */
  854. struct mm_struct *get_task_mm(struct task_struct *task)
  855. {
  856. struct mm_struct *mm;
  857. task_lock(task);
  858. mm = task->mm;
  859. if (mm) {
  860. if (task->flags & PF_KTHREAD)
  861. mm = NULL;
  862. else
  863. atomic_inc(&mm->mm_users);
  864. }
  865. task_unlock(task);
  866. return mm;
  867. }
  868. EXPORT_SYMBOL_GPL(get_task_mm);
  869. struct mm_struct *mm_access(struct task_struct *task, unsigned int mode)
  870. {
  871. struct mm_struct *mm;
  872. int err;
  873. err = mutex_lock_killable(&task->signal->cred_guard_mutex);
  874. if (err)
  875. return ERR_PTR(err);
  876. mm = get_task_mm(task);
  877. if (mm && mm != current->mm &&
  878. !ptrace_may_access(task, mode)) {
  879. mmput(mm);
  880. mm = ERR_PTR(-EACCES);
  881. }
  882. mutex_unlock(&task->signal->cred_guard_mutex);
  883. return mm;
  884. }
  885. static void complete_vfork_done(struct task_struct *tsk)
  886. {
  887. struct completion *vfork;
  888. task_lock(tsk);
  889. vfork = tsk->vfork_done;
  890. if (likely(vfork)) {
  891. tsk->vfork_done = NULL;
  892. complete(vfork);
  893. }
  894. task_unlock(tsk);
  895. }
  896. static int wait_for_vfork_done(struct task_struct *child,
  897. struct completion *vfork)
  898. {
  899. int killed;
  900. freezer_do_not_count();
  901. killed = wait_for_completion_killable(vfork);
  902. freezer_count();
  903. if (killed) {
  904. task_lock(child);
  905. child->vfork_done = NULL;
  906. task_unlock(child);
  907. }
  908. put_task_struct(child);
  909. return killed;
  910. }
  911. /* Please note the differences between mmput and mm_release.
  912. * mmput is called whenever we stop holding onto a mm_struct,
  913. * error success whatever.
  914. *
  915. * mm_release is called after a mm_struct has been removed
  916. * from the current process.
  917. *
  918. * This difference is important for error handling, when we
  919. * only half set up a mm_struct for a new process and need to restore
  920. * the old one. Because we mmput the new mm_struct before
  921. * restoring the old one. . .
  922. * Eric Biederman 10 January 1998
  923. */
  924. void mm_release(struct task_struct *tsk, struct mm_struct *mm)
  925. {
  926. /* Get rid of any futexes when releasing the mm */
  927. #ifdef CONFIG_FUTEX
  928. if (unlikely(tsk->robust_list)) {
  929. exit_robust_list(tsk);
  930. tsk->robust_list = NULL;
  931. }
  932. #ifdef CONFIG_COMPAT
  933. if (unlikely(tsk->compat_robust_list)) {
  934. compat_exit_robust_list(tsk);
  935. tsk->compat_robust_list = NULL;
  936. }
  937. #endif
  938. if (unlikely(!list_empty(&tsk->pi_state_list)))
  939. exit_pi_state_list(tsk);
  940. #endif
  941. uprobe_free_utask(tsk);
  942. /* Get rid of any cached register state */
  943. deactivate_mm(tsk, mm);
  944. /*
  945. * Signal userspace if we're not exiting with a core dump
  946. * because we want to leave the value intact for debugging
  947. * purposes.
  948. */
  949. if (tsk->clear_child_tid) {
  950. if (!(tsk->signal->flags & SIGNAL_GROUP_COREDUMP) &&
  951. atomic_read(&mm->mm_users) > 1) {
  952. /*
  953. * We don't check the error code - if userspace has
  954. * not set up a proper pointer then tough luck.
  955. */
  956. put_user(0, tsk->clear_child_tid);
  957. sys_futex(tsk->clear_child_tid, FUTEX_WAKE,
  958. 1, NULL, NULL, 0);
  959. }
  960. tsk->clear_child_tid = NULL;
  961. }
  962. /*
  963. * All done, finally we can wake up parent and return this mm to him.
  964. * Also kthread_stop() uses this completion for synchronization.
  965. */
  966. if (tsk->vfork_done)
  967. complete_vfork_done(tsk);
  968. }
  969. /*
  970. * Allocate a new mm structure and copy contents from the
  971. * mm structure of the passed in task structure.
  972. */
  973. static struct mm_struct *dup_mm(struct task_struct *tsk)
  974. {
  975. struct mm_struct *mm, *oldmm = current->mm;
  976. int err;
  977. mm = allocate_mm();
  978. if (!mm)
  979. goto fail_nomem;
  980. memcpy(mm, oldmm, sizeof(*mm));
  981. if (!mm_init(mm, tsk, mm->user_ns))
  982. goto fail_nomem;
  983. err = dup_mmap(mm, oldmm);
  984. if (err)
  985. goto free_pt;
  986. mm->hiwater_rss = get_mm_rss(mm);
  987. mm->hiwater_vm = mm->total_vm;
  988. if (mm->binfmt && !try_module_get(mm->binfmt->module))
  989. goto free_pt;
  990. return mm;
  991. free_pt:
  992. /* don't put binfmt in mmput, we haven't got module yet */
  993. mm->binfmt = NULL;
  994. mmput(mm);
  995. fail_nomem:
  996. return NULL;
  997. }
  998. static int copy_mm(unsigned long clone_flags, struct task_struct *tsk)
  999. {
  1000. struct mm_struct *mm, *oldmm;
  1001. int retval;
  1002. tsk->min_flt = tsk->maj_flt = 0;
  1003. tsk->nvcsw = tsk->nivcsw = 0;
  1004. #ifdef CONFIG_DETECT_HUNG_TASK
  1005. tsk->last_switch_count = tsk->nvcsw + tsk->nivcsw;
  1006. #endif
  1007. tsk->mm = NULL;
  1008. tsk->active_mm = NULL;
  1009. /*
  1010. * Are we cloning a kernel thread?
  1011. *
  1012. * We need to steal a active VM for that..
  1013. */
  1014. oldmm = current->mm;
  1015. if (!oldmm)
  1016. return 0;
  1017. /* initialize the new vmacache entries */
  1018. vmacache_flush(tsk);
  1019. if (clone_flags & CLONE_VM) {
  1020. atomic_inc(&oldmm->mm_users);
  1021. mm = oldmm;
  1022. goto good_mm;
  1023. }
  1024. retval = -ENOMEM;
  1025. mm = dup_mm(tsk);
  1026. if (!mm)
  1027. goto fail_nomem;
  1028. good_mm:
  1029. tsk->mm = mm;
  1030. tsk->active_mm = mm;
  1031. return 0;
  1032. fail_nomem:
  1033. return retval;
  1034. }
  1035. static int copy_fs(unsigned long clone_flags, struct task_struct *tsk)
  1036. {
  1037. struct fs_struct *fs = current->fs;
  1038. if (clone_flags & CLONE_FS) {
  1039. /* tsk->fs is already what we want */
  1040. spin_lock(&fs->lock);
  1041. if (fs->in_exec) {
  1042. spin_unlock(&fs->lock);
  1043. return -EAGAIN;
  1044. }
  1045. fs->users++;
  1046. spin_unlock(&fs->lock);
  1047. return 0;
  1048. }
  1049. tsk->fs = copy_fs_struct(fs);
  1050. if (!tsk->fs)
  1051. return -ENOMEM;
  1052. return 0;
  1053. }
  1054. static int copy_files(unsigned long clone_flags, struct task_struct *tsk)
  1055. {
  1056. struct files_struct *oldf, *newf;
  1057. int error = 0;
  1058. /*
  1059. * A background process may not have any files ...
  1060. */
  1061. oldf = current->files;
  1062. if (!oldf)
  1063. goto out;
  1064. if (clone_flags & CLONE_FILES) {
  1065. atomic_inc(&oldf->count);
  1066. goto out;
  1067. }
  1068. newf = dup_fd(oldf, &error);
  1069. if (!newf)
  1070. goto out;
  1071. tsk->files = newf;
  1072. error = 0;
  1073. out:
  1074. return error;
  1075. }
  1076. static int copy_io(unsigned long clone_flags, struct task_struct *tsk)
  1077. {
  1078. #ifdef CONFIG_BLOCK
  1079. struct io_context *ioc = current->io_context;
  1080. struct io_context *new_ioc;
  1081. if (!ioc)
  1082. return 0;
  1083. /*
  1084. * Share io context with parent, if CLONE_IO is set
  1085. */
  1086. if (clone_flags & CLONE_IO) {
  1087. ioc_task_link(ioc);
  1088. tsk->io_context = ioc;
  1089. } else if (ioprio_valid(ioc->ioprio)) {
  1090. new_ioc = get_task_io_context(tsk, GFP_KERNEL, NUMA_NO_NODE);
  1091. if (unlikely(!new_ioc))
  1092. return -ENOMEM;
  1093. new_ioc->ioprio = ioc->ioprio;
  1094. put_io_context(new_ioc);
  1095. }
  1096. #endif
  1097. return 0;
  1098. }
  1099. static int copy_sighand(unsigned long clone_flags, struct task_struct *tsk)
  1100. {
  1101. struct sighand_struct *sig;
  1102. if (clone_flags & CLONE_SIGHAND) {
  1103. atomic_inc(&current->sighand->count);
  1104. return 0;
  1105. }
  1106. sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
  1107. rcu_assign_pointer(tsk->sighand, sig);
  1108. if (!sig)
  1109. return -ENOMEM;
  1110. atomic_set(&sig->count, 1);
  1111. memcpy(sig->action, current->sighand->action, sizeof(sig->action));
  1112. return 0;
  1113. }
  1114. void __cleanup_sighand(struct sighand_struct *sighand)
  1115. {
  1116. if (atomic_dec_and_test(&sighand->count)) {
  1117. signalfd_cleanup(sighand);
  1118. /*
  1119. * sighand_cachep is SLAB_DESTROY_BY_RCU so we can free it
  1120. * without an RCU grace period, see __lock_task_sighand().
  1121. */
  1122. kmem_cache_free(sighand_cachep, sighand);
  1123. }
  1124. }
  1125. /*
  1126. * Initialize POSIX timer handling for a thread group.
  1127. */
  1128. static void posix_cpu_timers_init_group(struct signal_struct *sig)
  1129. {
  1130. unsigned long cpu_limit;
  1131. cpu_limit = READ_ONCE(sig->rlim[RLIMIT_CPU].rlim_cur);
  1132. if (cpu_limit != RLIM_INFINITY) {
  1133. sig->cputime_expires.prof_exp = secs_to_cputime(cpu_limit);
  1134. sig->cputimer.running = true;
  1135. }
  1136. /* The timer lists. */
  1137. INIT_LIST_HEAD(&sig->cpu_timers[0]);
  1138. INIT_LIST_HEAD(&sig->cpu_timers[1]);
  1139. INIT_LIST_HEAD(&sig->cpu_timers[2]);
  1140. }
  1141. static int copy_signal(unsigned long clone_flags, struct task_struct *tsk)
  1142. {
  1143. struct signal_struct *sig;
  1144. if (clone_flags & CLONE_THREAD)
  1145. return 0;
  1146. sig = kmem_cache_zalloc(signal_cachep, GFP_KERNEL);
  1147. tsk->signal = sig;
  1148. if (!sig)
  1149. return -ENOMEM;
  1150. sig->nr_threads = 1;
  1151. atomic_set(&sig->live, 1);
  1152. atomic_set(&sig->sigcnt, 1);
  1153. /* list_add(thread_node, thread_head) without INIT_LIST_HEAD() */
  1154. sig->thread_head = (struct list_head)LIST_HEAD_INIT(tsk->thread_node);
  1155. tsk->thread_node = (struct list_head)LIST_HEAD_INIT(sig->thread_head);
  1156. init_waitqueue_head(&sig->wait_chldexit);
  1157. sig->curr_target = tsk;
  1158. init_sigpending(&sig->shared_pending);
  1159. INIT_LIST_HEAD(&sig->posix_timers);
  1160. seqlock_init(&sig->stats_lock);
  1161. prev_cputime_init(&sig->prev_cputime);
  1162. hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
  1163. sig->real_timer.function = it_real_fn;
  1164. task_lock(current->group_leader);
  1165. memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim);
  1166. task_unlock(current->group_leader);
  1167. posix_cpu_timers_init_group(sig);
  1168. tty_audit_fork(sig);
  1169. sched_autogroup_fork(sig);
  1170. sig->oom_score_adj = current->signal->oom_score_adj;
  1171. sig->oom_score_adj_min = current->signal->oom_score_adj_min;
  1172. sig->has_child_subreaper = current->signal->has_child_subreaper ||
  1173. current->signal->is_child_subreaper;
  1174. mutex_init(&sig->cred_guard_mutex);
  1175. return 0;
  1176. }
  1177. static void copy_seccomp(struct task_struct *p)
  1178. {
  1179. #ifdef CONFIG_SECCOMP
  1180. /*
  1181. * Must be called with sighand->lock held, which is common to
  1182. * all threads in the group. Holding cred_guard_mutex is not
  1183. * needed because this new task is not yet running and cannot
  1184. * be racing exec.
  1185. */
  1186. assert_spin_locked(&current->sighand->siglock);
  1187. /* Ref-count the new filter user, and assign it. */
  1188. get_seccomp_filter(current);
  1189. p->seccomp = current->seccomp;
  1190. /*
  1191. * Explicitly enable no_new_privs here in case it got set
  1192. * between the task_struct being duplicated and holding the
  1193. * sighand lock. The seccomp state and nnp must be in sync.
  1194. */
  1195. if (task_no_new_privs(current))
  1196. task_set_no_new_privs(p);
  1197. /*
  1198. * If the parent gained a seccomp mode after copying thread
  1199. * flags and between before we held the sighand lock, we have
  1200. * to manually enable the seccomp thread flag here.
  1201. */
  1202. if (p->seccomp.mode != SECCOMP_MODE_DISABLED)
  1203. set_tsk_thread_flag(p, TIF_SECCOMP);
  1204. #endif
  1205. }
  1206. SYSCALL_DEFINE1(set_tid_address, int __user *, tidptr)
  1207. {
  1208. current->clear_child_tid = tidptr;
  1209. return task_pid_vnr(current);
  1210. }
  1211. static void rt_mutex_init_task(struct task_struct *p)
  1212. {
  1213. raw_spin_lock_init(&p->pi_lock);
  1214. #ifdef CONFIG_RT_MUTEXES
  1215. p->pi_waiters = RB_ROOT;
  1216. p->pi_waiters_leftmost = NULL;
  1217. p->pi_blocked_on = NULL;
  1218. #endif
  1219. }
  1220. /*
  1221. * Initialize POSIX timer handling for a single task.
  1222. */
  1223. static void posix_cpu_timers_init(struct task_struct *tsk)
  1224. {
  1225. tsk->cputime_expires.prof_exp = 0;
  1226. tsk->cputime_expires.virt_exp = 0;
  1227. tsk->cputime_expires.sched_exp = 0;
  1228. INIT_LIST_HEAD(&tsk->cpu_timers[0]);
  1229. INIT_LIST_HEAD(&tsk->cpu_timers[1]);
  1230. INIT_LIST_HEAD(&tsk->cpu_timers[2]);
  1231. }
  1232. static inline void
  1233. init_task_pid(struct task_struct *task, enum pid_type type, struct pid *pid)
  1234. {
  1235. task->pids[type].pid = pid;
  1236. }
  1237. /*
  1238. * This creates a new process as a copy of the old one,
  1239. * but does not actually start it yet.
  1240. *
  1241. * It copies the registers, and all the appropriate
  1242. * parts of the process environment (as per the clone
  1243. * flags). The actual kick-off is left to the caller.
  1244. */
  1245. static __latent_entropy struct task_struct *copy_process(
  1246. unsigned long clone_flags,
  1247. unsigned long stack_start,
  1248. unsigned long stack_size,
  1249. int __user *child_tidptr,
  1250. struct pid *pid,
  1251. int trace,
  1252. unsigned long tls,
  1253. int node)
  1254. {
  1255. int retval;
  1256. struct task_struct *p;
  1257. if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
  1258. return ERR_PTR(-EINVAL);
  1259. if ((clone_flags & (CLONE_NEWUSER|CLONE_FS)) == (CLONE_NEWUSER|CLONE_FS))
  1260. return ERR_PTR(-EINVAL);
  1261. /*
  1262. * Thread groups must share signals as well, and detached threads
  1263. * can only be started up within the thread group.
  1264. */
  1265. if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
  1266. return ERR_PTR(-EINVAL);
  1267. /*
  1268. * Shared signal handlers imply shared VM. By way of the above,
  1269. * thread groups also imply shared VM. Blocking this case allows
  1270. * for various simplifications in other code.
  1271. */
  1272. if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
  1273. return ERR_PTR(-EINVAL);
  1274. /*
  1275. * Siblings of global init remain as zombies on exit since they are
  1276. * not reaped by their parent (swapper). To solve this and to avoid
  1277. * multi-rooted process trees, prevent global and container-inits
  1278. * from creating siblings.
  1279. */
  1280. if ((clone_flags & CLONE_PARENT) &&
  1281. current->signal->flags & SIGNAL_UNKILLABLE)
  1282. return ERR_PTR(-EINVAL);
  1283. /*
  1284. * If the new process will be in a different pid or user namespace
  1285. * do not allow it to share a thread group with the forking task.
  1286. */
  1287. if (clone_flags & CLONE_THREAD) {
  1288. if ((clone_flags & (CLONE_NEWUSER | CLONE_NEWPID)) ||
  1289. (task_active_pid_ns(current) !=
  1290. current->nsproxy->pid_ns_for_children))
  1291. return ERR_PTR(-EINVAL);
  1292. }
  1293. retval = security_task_create(clone_flags);
  1294. if (retval)
  1295. goto fork_out;
  1296. retval = -ENOMEM;
  1297. p = dup_task_struct(current, node);
  1298. if (!p)
  1299. goto fork_out;
  1300. ftrace_graph_init_task(p);
  1301. rt_mutex_init_task(p);
  1302. #ifdef CONFIG_PROVE_LOCKING
  1303. DEBUG_LOCKS_WARN_ON(!p->hardirqs_enabled);
  1304. DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled);
  1305. #endif
  1306. retval = -EAGAIN;
  1307. if (atomic_read(&p->real_cred->user->processes) >=
  1308. task_rlimit(p, RLIMIT_NPROC)) {
  1309. if (p->real_cred->user != INIT_USER &&
  1310. !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN))
  1311. goto bad_fork_free;
  1312. }
  1313. current->flags &= ~PF_NPROC_EXCEEDED;
  1314. retval = copy_creds(p, clone_flags);
  1315. if (retval < 0)
  1316. goto bad_fork_free;
  1317. /*
  1318. * If multiple threads are within copy_process(), then this check
  1319. * triggers too late. This doesn't hurt, the check is only there
  1320. * to stop root fork bombs.
  1321. */
  1322. retval = -EAGAIN;
  1323. if (nr_threads >= max_threads)
  1324. goto bad_fork_cleanup_count;
  1325. delayacct_tsk_init(p); /* Must remain after dup_task_struct() */
  1326. p->flags &= ~(PF_SUPERPRIV | PF_WQ_WORKER);
  1327. p->flags |= PF_FORKNOEXEC;
  1328. INIT_LIST_HEAD(&p->children);
  1329. INIT_LIST_HEAD(&p->sibling);
  1330. rcu_copy_process(p);
  1331. p->vfork_done = NULL;
  1332. spin_lock_init(&p->alloc_lock);
  1333. init_sigpending(&p->pending);
  1334. p->utime = p->stime = p->gtime = 0;
  1335. p->utimescaled = p->stimescaled = 0;
  1336. prev_cputime_init(&p->prev_cputime);
  1337. #ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN
  1338. seqcount_init(&p->vtime_seqcount);
  1339. p->vtime_snap = 0;
  1340. p->vtime_snap_whence = VTIME_INACTIVE;
  1341. #endif
  1342. #if defined(SPLIT_RSS_COUNTING)
  1343. memset(&p->rss_stat, 0, sizeof(p->rss_stat));
  1344. #endif
  1345. p->default_timer_slack_ns = current->timer_slack_ns;
  1346. task_io_accounting_init(&p->ioac);
  1347. acct_clear_integrals(p);
  1348. posix_cpu_timers_init(p);
  1349. p->start_time = ktime_get_ns();
  1350. p->real_start_time = ktime_get_boot_ns();
  1351. p->io_context = NULL;
  1352. p->audit_context = NULL;
  1353. cgroup_fork(p);
  1354. #ifdef CONFIG_NUMA
  1355. p->mempolicy = mpol_dup(p->mempolicy);
  1356. if (IS_ERR(p->mempolicy)) {
  1357. retval = PTR_ERR(p->mempolicy);
  1358. p->mempolicy = NULL;
  1359. goto bad_fork_cleanup_threadgroup_lock;
  1360. }
  1361. #endif
  1362. #ifdef CONFIG_CPUSETS
  1363. p->cpuset_mem_spread_rotor = NUMA_NO_NODE;
  1364. p->cpuset_slab_spread_rotor = NUMA_NO_NODE;
  1365. seqcount_init(&p->mems_allowed_seq);
  1366. #endif
  1367. #ifdef CONFIG_TRACE_IRQFLAGS
  1368. p->irq_events = 0;
  1369. p->hardirqs_enabled = 0;
  1370. p->hardirq_enable_ip = 0;
  1371. p->hardirq_enable_event = 0;
  1372. p->hardirq_disable_ip = _THIS_IP_;
  1373. p->hardirq_disable_event = 0;
  1374. p->softirqs_enabled = 1;
  1375. p->softirq_enable_ip = _THIS_IP_;
  1376. p->softirq_enable_event = 0;
  1377. p->softirq_disable_ip = 0;
  1378. p->softirq_disable_event = 0;
  1379. p->hardirq_context = 0;
  1380. p->softirq_context = 0;
  1381. #endif
  1382. p->pagefault_disabled = 0;
  1383. #ifdef CONFIG_LOCKDEP
  1384. p->lockdep_depth = 0; /* no locks held yet */
  1385. p->curr_chain_key = 0;
  1386. p->lockdep_recursion = 0;
  1387. #endif
  1388. #ifdef CONFIG_DEBUG_MUTEXES
  1389. p->blocked_on = NULL; /* not blocked yet */
  1390. #endif
  1391. #ifdef CONFIG_BCACHE
  1392. p->sequential_io = 0;
  1393. p->sequential_io_avg = 0;
  1394. #endif
  1395. /* Perform scheduler related setup. Assign this task to a CPU. */
  1396. retval = sched_fork(clone_flags, p);
  1397. if (retval)
  1398. goto bad_fork_cleanup_policy;
  1399. retval = perf_event_init_task(p);
  1400. if (retval)
  1401. goto bad_fork_cleanup_policy;
  1402. retval = audit_alloc(p);
  1403. if (retval)
  1404. goto bad_fork_cleanup_perf;
  1405. /* copy all the process information */
  1406. shm_init_task(p);
  1407. retval = copy_semundo(clone_flags, p);
  1408. if (retval)
  1409. goto bad_fork_cleanup_audit;
  1410. retval = copy_files(clone_flags, p);
  1411. if (retval)
  1412. goto bad_fork_cleanup_semundo;
  1413. retval = copy_fs(clone_flags, p);
  1414. if (retval)
  1415. goto bad_fork_cleanup_files;
  1416. retval = copy_sighand(clone_flags, p);
  1417. if (retval)
  1418. goto bad_fork_cleanup_fs;
  1419. retval = copy_signal(clone_flags, p);
  1420. if (retval)
  1421. goto bad_fork_cleanup_sighand;
  1422. retval = copy_mm(clone_flags, p);
  1423. if (retval)
  1424. goto bad_fork_cleanup_signal;
  1425. retval = copy_namespaces(clone_flags, p);
  1426. if (retval)
  1427. goto bad_fork_cleanup_mm;
  1428. retval = copy_io(clone_flags, p);
  1429. if (retval)
  1430. goto bad_fork_cleanup_namespaces;
  1431. retval = copy_thread_tls(clone_flags, stack_start, stack_size, p, tls);
  1432. if (retval)
  1433. goto bad_fork_cleanup_io;
  1434. if (pid != &init_struct_pid) {
  1435. pid = alloc_pid(p->nsproxy->pid_ns_for_children);
  1436. if (IS_ERR(pid)) {
  1437. retval = PTR_ERR(pid);
  1438. goto bad_fork_cleanup_thread;
  1439. }
  1440. }
  1441. p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? child_tidptr : NULL;
  1442. /*
  1443. * Clear TID on mm_release()?
  1444. */
  1445. p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? child_tidptr : NULL;
  1446. #ifdef CONFIG_BLOCK
  1447. p->plug = NULL;
  1448. #endif
  1449. #ifdef CONFIG_FUTEX
  1450. p->robust_list = NULL;
  1451. #ifdef CONFIG_COMPAT
  1452. p->compat_robust_list = NULL;
  1453. #endif
  1454. INIT_LIST_HEAD(&p->pi_state_list);
  1455. p->pi_state_cache = NULL;
  1456. #endif
  1457. /*
  1458. * sigaltstack should be cleared when sharing the same VM
  1459. */
  1460. if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM)
  1461. sas_ss_reset(p);
  1462. /*
  1463. * Syscall tracing and stepping should be turned off in the
  1464. * child regardless of CLONE_PTRACE.
  1465. */
  1466. user_disable_single_step(p);
  1467. clear_tsk_thread_flag(p, TIF_SYSCALL_TRACE);
  1468. #ifdef TIF_SYSCALL_EMU
  1469. clear_tsk_thread_flag(p, TIF_SYSCALL_EMU);
  1470. #endif
  1471. clear_all_latency_tracing(p);
  1472. /* ok, now we should be set up.. */
  1473. p->pid = pid_nr(pid);
  1474. if (clone_flags & CLONE_THREAD) {
  1475. p->exit_signal = -1;
  1476. p->group_leader = current->group_leader;
  1477. p->tgid = current->tgid;
  1478. } else {
  1479. if (clone_flags & CLONE_PARENT)
  1480. p->exit_signal = current->group_leader->exit_signal;
  1481. else
  1482. p->exit_signal = (clone_flags & CSIGNAL);
  1483. p->group_leader = p;
  1484. p->tgid = p->pid;
  1485. }
  1486. p->nr_dirtied = 0;
  1487. p->nr_dirtied_pause = 128 >> (PAGE_SHIFT - 10);
  1488. p->dirty_paused_when = 0;
  1489. p->pdeath_signal = 0;
  1490. INIT_LIST_HEAD(&p->thread_group);
  1491. p->task_works = NULL;
  1492. threadgroup_change_begin(current);
  1493. /*
  1494. * Ensure that the cgroup subsystem policies allow the new process to be
  1495. * forked. It should be noted the the new process's css_set can be changed
  1496. * between here and cgroup_post_fork() if an organisation operation is in
  1497. * progress.
  1498. */
  1499. retval = cgroup_can_fork(p);
  1500. if (retval)
  1501. goto bad_fork_free_pid;
  1502. /*
  1503. * Make it visible to the rest of the system, but dont wake it up yet.
  1504. * Need tasklist lock for parent etc handling!
  1505. */
  1506. write_lock_irq(&tasklist_lock);
  1507. /* CLONE_PARENT re-uses the old parent */
  1508. if (clone_flags & (CLONE_PARENT|CLONE_THREAD)) {
  1509. p->real_parent = current->real_parent;
  1510. p->parent_exec_id = current->parent_exec_id;
  1511. } else {
  1512. p->real_parent = current;
  1513. p->parent_exec_id = current->self_exec_id;
  1514. }
  1515. spin_lock(&current->sighand->siglock);
  1516. /*
  1517. * Copy seccomp details explicitly here, in case they were changed
  1518. * before holding sighand lock.
  1519. */
  1520. copy_seccomp(p);
  1521. /*
  1522. * Process group and session signals need to be delivered to just the
  1523. * parent before the fork or both the parent and the child after the
  1524. * fork. Restart if a signal comes in before we add the new process to
  1525. * it's process group.
  1526. * A fatal signal pending means that current will exit, so the new
  1527. * thread can't slip out of an OOM kill (or normal SIGKILL).
  1528. */
  1529. recalc_sigpending();
  1530. if (signal_pending(current)) {
  1531. retval = -ERESTARTNOINTR;
  1532. goto bad_fork_cancel_cgroup;
  1533. }
  1534. if (unlikely(!(ns_of_pid(pid)->nr_hashed & PIDNS_HASH_ADDING))) {
  1535. retval = -ENOMEM;
  1536. goto bad_fork_cancel_cgroup;
  1537. }
  1538. if (likely(p->pid)) {
  1539. ptrace_init_task(p, (clone_flags & CLONE_PTRACE) || trace);
  1540. init_task_pid(p, PIDTYPE_PID, pid);
  1541. if (thread_group_leader(p)) {
  1542. init_task_pid(p, PIDTYPE_PGID, task_pgrp(current));
  1543. init_task_pid(p, PIDTYPE_SID, task_session(current));
  1544. if (is_child_reaper(pid)) {
  1545. ns_of_pid(pid)->child_reaper = p;
  1546. p->signal->flags |= SIGNAL_UNKILLABLE;
  1547. }
  1548. p->signal->leader_pid = pid;
  1549. p->signal->tty = tty_kref_get(current->signal->tty);
  1550. list_add_tail(&p->sibling, &p->real_parent->children);
  1551. list_add_tail_rcu(&p->tasks, &init_task.tasks);
  1552. attach_pid(p, PIDTYPE_PGID);
  1553. attach_pid(p, PIDTYPE_SID);
  1554. __this_cpu_inc(process_counts);
  1555. } else {
  1556. current->signal->nr_threads++;
  1557. atomic_inc(&current->signal->live);
  1558. atomic_inc(&current->signal->sigcnt);
  1559. list_add_tail_rcu(&p->thread_group,
  1560. &p->group_leader->thread_group);
  1561. list_add_tail_rcu(&p->thread_node,
  1562. &p->signal->thread_head);
  1563. }
  1564. attach_pid(p, PIDTYPE_PID);
  1565. nr_threads++;
  1566. }
  1567. total_forks++;
  1568. spin_unlock(&current->sighand->siglock);
  1569. syscall_tracepoint_update(p);
  1570. write_unlock_irq(&tasklist_lock);
  1571. proc_fork_connector(p);
  1572. cgroup_post_fork(p);
  1573. threadgroup_change_end(current);
  1574. perf_event_fork(p);
  1575. trace_task_newtask(p, clone_flags);
  1576. uprobe_copy_process(p, clone_flags);
  1577. return p;
  1578. bad_fork_cancel_cgroup:
  1579. spin_unlock(&current->sighand->siglock);
  1580. write_unlock_irq(&tasklist_lock);
  1581. cgroup_cancel_fork(p);
  1582. bad_fork_free_pid:
  1583. threadgroup_change_end(current);
  1584. if (pid != &init_struct_pid)
  1585. free_pid(pid);
  1586. bad_fork_cleanup_thread:
  1587. exit_thread(p);
  1588. bad_fork_cleanup_io:
  1589. if (p->io_context)
  1590. exit_io_context(p);
  1591. bad_fork_cleanup_namespaces:
  1592. exit_task_namespaces(p);
  1593. bad_fork_cleanup_mm:
  1594. if (p->mm)
  1595. mmput(p->mm);
  1596. bad_fork_cleanup_signal:
  1597. if (!(clone_flags & CLONE_THREAD))
  1598. free_signal_struct(p->signal);
  1599. bad_fork_cleanup_sighand:
  1600. __cleanup_sighand(p->sighand);
  1601. bad_fork_cleanup_fs:
  1602. exit_fs(p); /* blocking */
  1603. bad_fork_cleanup_files:
  1604. exit_files(p); /* blocking */
  1605. bad_fork_cleanup_semundo:
  1606. exit_sem(p);
  1607. bad_fork_cleanup_audit:
  1608. audit_free(p);
  1609. bad_fork_cleanup_perf:
  1610. perf_event_free_task(p);
  1611. bad_fork_cleanup_policy:
  1612. #ifdef CONFIG_NUMA
  1613. mpol_put(p->mempolicy);
  1614. bad_fork_cleanup_threadgroup_lock:
  1615. #endif
  1616. delayacct_tsk_free(p);
  1617. bad_fork_cleanup_count:
  1618. atomic_dec(&p->cred->user->processes);
  1619. exit_creds(p);
  1620. bad_fork_free:
  1621. p->state = TASK_DEAD;
  1622. put_task_stack(p);
  1623. free_task(p);
  1624. fork_out:
  1625. return ERR_PTR(retval);
  1626. }
  1627. static inline void init_idle_pids(struct pid_link *links)
  1628. {
  1629. enum pid_type type;
  1630. for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) {
  1631. INIT_HLIST_NODE(&links[type].node); /* not really needed */
  1632. links[type].pid = &init_struct_pid;
  1633. }
  1634. }
  1635. struct task_struct *fork_idle(int cpu)
  1636. {
  1637. struct task_struct *task;
  1638. task = copy_process(CLONE_VM, 0, 0, NULL, &init_struct_pid, 0, 0,
  1639. cpu_to_node(cpu));
  1640. if (!IS_ERR(task)) {
  1641. init_idle_pids(task->pids);
  1642. init_idle(task, cpu);
  1643. }
  1644. return task;
  1645. }
  1646. /*
  1647. * Ok, this is the main fork-routine.
  1648. *
  1649. * It copies the process, and if successful kick-starts
  1650. * it and waits for it to finish using the VM if required.
  1651. */
  1652. long _do_fork(unsigned long clone_flags,
  1653. unsigned long stack_start,
  1654. unsigned long stack_size,
  1655. int __user *parent_tidptr,
  1656. int __user *child_tidptr,
  1657. unsigned long tls)
  1658. {
  1659. struct task_struct *p;
  1660. int trace = 0;
  1661. long nr;
  1662. /*
  1663. * Determine whether and which event to report to ptracer. When
  1664. * called from kernel_thread or CLONE_UNTRACED is explicitly
  1665. * requested, no event is reported; otherwise, report if the event
  1666. * for the type of forking is enabled.
  1667. */
  1668. if (!(clone_flags & CLONE_UNTRACED)) {
  1669. if (clone_flags & CLONE_VFORK)
  1670. trace = PTRACE_EVENT_VFORK;
  1671. else if ((clone_flags & CSIGNAL) != SIGCHLD)
  1672. trace = PTRACE_EVENT_CLONE;
  1673. else
  1674. trace = PTRACE_EVENT_FORK;
  1675. if (likely(!ptrace_event_enabled(current, trace)))
  1676. trace = 0;
  1677. }
  1678. p = copy_process(clone_flags, stack_start, stack_size,
  1679. child_tidptr, NULL, trace, tls, NUMA_NO_NODE);
  1680. add_latent_entropy();
  1681. /*
  1682. * Do this prior waking up the new thread - the thread pointer
  1683. * might get invalid after that point, if the thread exits quickly.
  1684. */
  1685. if (!IS_ERR(p)) {
  1686. struct completion vfork;
  1687. struct pid *pid;
  1688. trace_sched_process_fork(current, p);
  1689. pid = get_task_pid(p, PIDTYPE_PID);
  1690. nr = pid_vnr(pid);
  1691. if (clone_flags & CLONE_PARENT_SETTID)
  1692. put_user(nr, parent_tidptr);
  1693. if (clone_flags & CLONE_VFORK) {
  1694. p->vfork_done = &vfork;
  1695. init_completion(&vfork);
  1696. get_task_struct(p);
  1697. }
  1698. wake_up_new_task(p);
  1699. /* forking complete and child started to run, tell ptracer */
  1700. if (unlikely(trace))
  1701. ptrace_event_pid(trace, pid);
  1702. if (clone_flags & CLONE_VFORK) {
  1703. if (!wait_for_vfork_done(p, &vfork))
  1704. ptrace_event_pid(PTRACE_EVENT_VFORK_DONE, pid);
  1705. }
  1706. put_pid(pid);
  1707. } else {
  1708. nr = PTR_ERR(p);
  1709. }
  1710. return nr;
  1711. }
  1712. #ifndef CONFIG_HAVE_COPY_THREAD_TLS
  1713. /* For compatibility with architectures that call do_fork directly rather than
  1714. * using the syscall entry points below. */
  1715. long do_fork(unsigned long clone_flags,
  1716. unsigned long stack_start,
  1717. unsigned long stack_size,
  1718. int __user *parent_tidptr,
  1719. int __user *child_tidptr)
  1720. {
  1721. return _do_fork(clone_flags, stack_start, stack_size,
  1722. parent_tidptr, child_tidptr, 0);
  1723. }
  1724. #endif
  1725. /*
  1726. * Create a kernel thread.
  1727. */
  1728. pid_t kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
  1729. {
  1730. return _do_fork(flags|CLONE_VM|CLONE_UNTRACED, (unsigned long)fn,
  1731. (unsigned long)arg, NULL, NULL, 0);
  1732. }
  1733. #ifdef __ARCH_WANT_SYS_FORK
  1734. SYSCALL_DEFINE0(fork)
  1735. {
  1736. #ifdef CONFIG_MMU
  1737. return _do_fork(SIGCHLD, 0, 0, NULL, NULL, 0);
  1738. #else
  1739. /* can not support in nommu mode */
  1740. return -EINVAL;
  1741. #endif
  1742. }
  1743. #endif
  1744. #ifdef __ARCH_WANT_SYS_VFORK
  1745. SYSCALL_DEFINE0(vfork)
  1746. {
  1747. return _do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, 0,
  1748. 0, NULL, NULL, 0);
  1749. }
  1750. #endif
  1751. #ifdef __ARCH_WANT_SYS_CLONE
  1752. #ifdef CONFIG_CLONE_BACKWARDS
  1753. SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
  1754. int __user *, parent_tidptr,
  1755. unsigned long, tls,
  1756. int __user *, child_tidptr)
  1757. #elif defined(CONFIG_CLONE_BACKWARDS2)
  1758. SYSCALL_DEFINE5(clone, unsigned long, newsp, unsigned long, clone_flags,
  1759. int __user *, parent_tidptr,
  1760. int __user *, child_tidptr,
  1761. unsigned long, tls)
  1762. #elif defined(CONFIG_CLONE_BACKWARDS3)
  1763. SYSCALL_DEFINE6(clone, unsigned long, clone_flags, unsigned long, newsp,
  1764. int, stack_size,
  1765. int __user *, parent_tidptr,
  1766. int __user *, child_tidptr,
  1767. unsigned long, tls)
  1768. #else
  1769. SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
  1770. int __user *, parent_tidptr,
  1771. int __user *, child_tidptr,
  1772. unsigned long, tls)
  1773. #endif
  1774. {
  1775. return _do_fork(clone_flags, newsp, 0, parent_tidptr, child_tidptr, tls);
  1776. }
  1777. #endif
  1778. #ifndef ARCH_MIN_MMSTRUCT_ALIGN
  1779. #define ARCH_MIN_MMSTRUCT_ALIGN 0
  1780. #endif
  1781. static void sighand_ctor(void *data)
  1782. {
  1783. struct sighand_struct *sighand = data;
  1784. spin_lock_init(&sighand->siglock);
  1785. init_waitqueue_head(&sighand->signalfd_wqh);
  1786. }
  1787. void __init proc_caches_init(void)
  1788. {
  1789. sighand_cachep = kmem_cache_create("sighand_cache",
  1790. sizeof(struct sighand_struct), 0,
  1791. SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_DESTROY_BY_RCU|
  1792. SLAB_NOTRACK|SLAB_ACCOUNT, sighand_ctor);
  1793. signal_cachep = kmem_cache_create("signal_cache",
  1794. sizeof(struct signal_struct), 0,
  1795. SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_NOTRACK|SLAB_ACCOUNT,
  1796. NULL);
  1797. files_cachep = kmem_cache_create("files_cache",
  1798. sizeof(struct files_struct), 0,
  1799. SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_NOTRACK|SLAB_ACCOUNT,
  1800. NULL);
  1801. fs_cachep = kmem_cache_create("fs_cache",
  1802. sizeof(struct fs_struct), 0,
  1803. SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_NOTRACK|SLAB_ACCOUNT,
  1804. NULL);
  1805. /*
  1806. * FIXME! The "sizeof(struct mm_struct)" currently includes the
  1807. * whole struct cpumask for the OFFSTACK case. We could change
  1808. * this to *only* allocate as much of it as required by the
  1809. * maximum number of CPU's we can ever have. The cpumask_allocation
  1810. * is at the end of the structure, exactly for that reason.
  1811. */
  1812. mm_cachep = kmem_cache_create("mm_struct",
  1813. sizeof(struct mm_struct), ARCH_MIN_MMSTRUCT_ALIGN,
  1814. SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_NOTRACK|SLAB_ACCOUNT,
  1815. NULL);
  1816. vm_area_cachep = KMEM_CACHE(vm_area_struct, SLAB_PANIC|SLAB_ACCOUNT);
  1817. mmap_init();
  1818. nsproxy_cache_init();
  1819. }
  1820. /*
  1821. * Check constraints on flags passed to the unshare system call.
  1822. */
  1823. static int check_unshare_flags(unsigned long unshare_flags)
  1824. {
  1825. if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND|
  1826. CLONE_VM|CLONE_FILES|CLONE_SYSVSEM|
  1827. CLONE_NEWUTS|CLONE_NEWIPC|CLONE_NEWNET|
  1828. CLONE_NEWUSER|CLONE_NEWPID|CLONE_NEWCGROUP))
  1829. return -EINVAL;
  1830. /*
  1831. * Not implemented, but pretend it works if there is nothing
  1832. * to unshare. Note that unsharing the address space or the
  1833. * signal handlers also need to unshare the signal queues (aka
  1834. * CLONE_THREAD).
  1835. */
  1836. if (unshare_flags & (CLONE_THREAD | CLONE_SIGHAND | CLONE_VM)) {
  1837. if (!thread_group_empty(current))
  1838. return -EINVAL;
  1839. }
  1840. if (unshare_flags & (CLONE_SIGHAND | CLONE_VM)) {
  1841. if (atomic_read(&current->sighand->count) > 1)
  1842. return -EINVAL;
  1843. }
  1844. if (unshare_flags & CLONE_VM) {
  1845. if (!current_is_single_threaded())
  1846. return -EINVAL;
  1847. }
  1848. return 0;
  1849. }
  1850. /*
  1851. * Unshare the filesystem structure if it is being shared
  1852. */
  1853. static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp)
  1854. {
  1855. struct fs_struct *fs = current->fs;
  1856. if (!(unshare_flags & CLONE_FS) || !fs)
  1857. return 0;
  1858. /* don't need lock here; in the worst case we'll do useless copy */
  1859. if (fs->users == 1)
  1860. return 0;
  1861. *new_fsp = copy_fs_struct(fs);
  1862. if (!*new_fsp)
  1863. return -ENOMEM;
  1864. return 0;
  1865. }
  1866. /*
  1867. * Unshare file descriptor table if it is being shared
  1868. */
  1869. static int unshare_fd(unsigned long unshare_flags, struct files_struct **new_fdp)
  1870. {
  1871. struct files_struct *fd = current->files;
  1872. int error = 0;
  1873. if ((unshare_flags & CLONE_FILES) &&
  1874. (fd && atomic_read(&fd->count) > 1)) {
  1875. *new_fdp = dup_fd(fd, &error);
  1876. if (!*new_fdp)
  1877. return error;
  1878. }
  1879. return 0;
  1880. }
  1881. /*
  1882. * unshare allows a process to 'unshare' part of the process
  1883. * context which was originally shared using clone. copy_*
  1884. * functions used by do_fork() cannot be used here directly
  1885. * because they modify an inactive task_struct that is being
  1886. * constructed. Here we are modifying the current, active,
  1887. * task_struct.
  1888. */
  1889. SYSCALL_DEFINE1(unshare, unsigned long, unshare_flags)
  1890. {
  1891. struct fs_struct *fs, *new_fs = NULL;
  1892. struct files_struct *fd, *new_fd = NULL;
  1893. struct cred *new_cred = NULL;
  1894. struct nsproxy *new_nsproxy = NULL;
  1895. int do_sysvsem = 0;
  1896. int err;
  1897. /*
  1898. * If unsharing a user namespace must also unshare the thread group
  1899. * and unshare the filesystem root and working directories.
  1900. */
  1901. if (unshare_flags & CLONE_NEWUSER)
  1902. unshare_flags |= CLONE_THREAD | CLONE_FS;
  1903. /*
  1904. * If unsharing vm, must also unshare signal handlers.
  1905. */
  1906. if (unshare_flags & CLONE_VM)
  1907. unshare_flags |= CLONE_SIGHAND;
  1908. /*
  1909. * If unsharing a signal handlers, must also unshare the signal queues.
  1910. */
  1911. if (unshare_flags & CLONE_SIGHAND)
  1912. unshare_flags |= CLONE_THREAD;
  1913. /*
  1914. * If unsharing namespace, must also unshare filesystem information.
  1915. */
  1916. if (unshare_flags & CLONE_NEWNS)
  1917. unshare_flags |= CLONE_FS;
  1918. err = check_unshare_flags(unshare_flags);
  1919. if (err)
  1920. goto bad_unshare_out;
  1921. /*
  1922. * CLONE_NEWIPC must also detach from the undolist: after switching
  1923. * to a new ipc namespace, the semaphore arrays from the old
  1924. * namespace are unreachable.
  1925. */
  1926. if (unshare_flags & (CLONE_NEWIPC|CLONE_SYSVSEM))
  1927. do_sysvsem = 1;
  1928. err = unshare_fs(unshare_flags, &new_fs);
  1929. if (err)
  1930. goto bad_unshare_out;
  1931. err = unshare_fd(unshare_flags, &new_fd);
  1932. if (err)
  1933. goto bad_unshare_cleanup_fs;
  1934. err = unshare_userns(unshare_flags, &new_cred);
  1935. if (err)
  1936. goto bad_unshare_cleanup_fd;
  1937. err = unshare_nsproxy_namespaces(unshare_flags, &new_nsproxy,
  1938. new_cred, new_fs);
  1939. if (err)
  1940. goto bad_unshare_cleanup_cred;
  1941. if (new_fs || new_fd || do_sysvsem || new_cred || new_nsproxy) {
  1942. if (do_sysvsem) {
  1943. /*
  1944. * CLONE_SYSVSEM is equivalent to sys_exit().
  1945. */
  1946. exit_sem(current);
  1947. }
  1948. if (unshare_flags & CLONE_NEWIPC) {
  1949. /* Orphan segments in old ns (see sem above). */
  1950. exit_shm(current);
  1951. shm_init_task(current);
  1952. }
  1953. if (new_nsproxy)
  1954. switch_task_namespaces(current, new_nsproxy);
  1955. task_lock(current);
  1956. if (new_fs) {
  1957. fs = current->fs;
  1958. spin_lock(&fs->lock);
  1959. current->fs = new_fs;
  1960. if (--fs->users)
  1961. new_fs = NULL;
  1962. else
  1963. new_fs = fs;
  1964. spin_unlock(&fs->lock);
  1965. }
  1966. if (new_fd) {
  1967. fd = current->files;
  1968. current->files = new_fd;
  1969. new_fd = fd;
  1970. }
  1971. task_unlock(current);
  1972. if (new_cred) {
  1973. /* Install the new user namespace */
  1974. commit_creds(new_cred);
  1975. new_cred = NULL;
  1976. }
  1977. }
  1978. bad_unshare_cleanup_cred:
  1979. if (new_cred)
  1980. put_cred(new_cred);
  1981. bad_unshare_cleanup_fd:
  1982. if (new_fd)
  1983. put_files_struct(new_fd);
  1984. bad_unshare_cleanup_fs:
  1985. if (new_fs)
  1986. free_fs_struct(new_fs);
  1987. bad_unshare_out:
  1988. return err;
  1989. }
  1990. /*
  1991. * Helper to unshare the files of the current task.
  1992. * We don't want to expose copy_files internals to
  1993. * the exec layer of the kernel.
  1994. */
  1995. int unshare_files(struct files_struct **displaced)
  1996. {
  1997. struct task_struct *task = current;
  1998. struct files_struct *copy = NULL;
  1999. int error;
  2000. error = unshare_fd(CLONE_FILES, &copy);
  2001. if (error || !copy) {
  2002. *displaced = NULL;
  2003. return error;
  2004. }
  2005. *displaced = task->files;
  2006. task_lock(task);
  2007. task->files = copy;
  2008. task_unlock(task);
  2009. return 0;
  2010. }
  2011. int sysctl_max_threads(struct ctl_table *table, int write,
  2012. void __user *buffer, size_t *lenp, loff_t *ppos)
  2013. {
  2014. struct ctl_table t;
  2015. int ret;
  2016. int threads = max_threads;
  2017. int min = MIN_THREADS;
  2018. int max = MAX_THREADS;
  2019. t = *table;
  2020. t.data = &threads;
  2021. t.extra1 = &min;
  2022. t.extra2 = &max;
  2023. ret = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
  2024. if (ret || !write)
  2025. return ret;
  2026. set_max_threads(threads);
  2027. return 0;
  2028. }