process.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664
  1. /*
  2. * This file is subject to the terms and conditions of the GNU General Public
  3. * License. See the file "COPYING" in the main directory of this archive
  4. * for more details.
  5. *
  6. * Copyright (C) 1994 - 1999, 2000 by Ralf Baechle and others.
  7. * Copyright (C) 2005, 2006 by Ralf Baechle (ralf@linux-mips.org)
  8. * Copyright (C) 1999, 2000 Silicon Graphics, Inc.
  9. * Copyright (C) 2004 Thiemo Seufer
  10. * Copyright (C) 2013 Imagination Technologies Ltd.
  11. */
  12. #include <linux/errno.h>
  13. #include <linux/sched.h>
  14. #include <linux/tick.h>
  15. #include <linux/kernel.h>
  16. #include <linux/mm.h>
  17. #include <linux/stddef.h>
  18. #include <linux/unistd.h>
  19. #include <linux/export.h>
  20. #include <linux/ptrace.h>
  21. #include <linux/mman.h>
  22. #include <linux/personality.h>
  23. #include <linux/sys.h>
  24. #include <linux/init.h>
  25. #include <linux/completion.h>
  26. #include <linux/kallsyms.h>
  27. #include <linux/random.h>
  28. #include <linux/prctl.h>
  29. #include <asm/asm.h>
  30. #include <asm/bootinfo.h>
  31. #include <asm/cpu.h>
  32. #include <asm/dsp.h>
  33. #include <asm/fpu.h>
  34. #include <asm/msa.h>
  35. #include <asm/pgtable.h>
  36. #include <asm/mipsregs.h>
  37. #include <asm/processor.h>
  38. #include <asm/reg.h>
  39. #include <asm/uaccess.h>
  40. #include <asm/io.h>
  41. #include <asm/elf.h>
  42. #include <asm/isadep.h>
  43. #include <asm/inst.h>
  44. #include <asm/stacktrace.h>
  45. #include <asm/irq_regs.h>
  46. #ifdef CONFIG_HOTPLUG_CPU
  47. void arch_cpu_idle_dead(void)
  48. {
  49. /* What the heck is this check doing ? */
  50. if (!cpumask_test_cpu(smp_processor_id(), &cpu_callin_map))
  51. play_dead();
  52. }
  53. #endif
  54. asmlinkage void ret_from_fork(void);
  55. asmlinkage void ret_from_kernel_thread(void);
  56. void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
  57. {
  58. unsigned long status;
  59. /* New thread loses kernel privileges. */
  60. status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
  61. status |= KU_USER;
  62. regs->cp0_status = status;
  63. lose_fpu(0);
  64. clear_thread_flag(TIF_MSA_CTX_LIVE);
  65. clear_used_math();
  66. init_dsp();
  67. regs->cp0_epc = pc;
  68. regs->regs[29] = sp;
  69. }
  70. void exit_thread(void)
  71. {
  72. }
  73. void flush_thread(void)
  74. {
  75. }
  76. int arch_dup_task_struct(struct task_struct *dst, struct task_struct *src)
  77. {
  78. /*
  79. * Save any process state which is live in hardware registers to the
  80. * parent context prior to duplication. This prevents the new child
  81. * state becoming stale if the parent is preempted before copy_thread()
  82. * gets a chance to save the parent's live hardware registers to the
  83. * child context.
  84. */
  85. preempt_disable();
  86. if (is_msa_enabled())
  87. save_msa(current);
  88. else if (is_fpu_owner())
  89. _save_fp(current);
  90. save_dsp(current);
  91. preempt_enable();
  92. *dst = *src;
  93. return 0;
  94. }
  95. /*
  96. * Copy architecture-specific thread state
  97. */
  98. int copy_thread(unsigned long clone_flags, unsigned long usp,
  99. unsigned long kthread_arg, struct task_struct *p)
  100. {
  101. struct thread_info *ti = task_thread_info(p);
  102. struct pt_regs *childregs, *regs = current_pt_regs();
  103. unsigned long childksp;
  104. p->set_child_tid = p->clear_child_tid = NULL;
  105. childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
  106. /* set up new TSS. */
  107. childregs = (struct pt_regs *) childksp - 1;
  108. /* Put the stack after the struct pt_regs. */
  109. childksp = (unsigned long) childregs;
  110. p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
  111. if (unlikely(p->flags & PF_KTHREAD)) {
  112. /* kernel thread */
  113. unsigned long status = p->thread.cp0_status;
  114. memset(childregs, 0, sizeof(struct pt_regs));
  115. ti->addr_limit = KERNEL_DS;
  116. p->thread.reg16 = usp; /* fn */
  117. p->thread.reg17 = kthread_arg;
  118. p->thread.reg29 = childksp;
  119. p->thread.reg31 = (unsigned long) ret_from_kernel_thread;
  120. #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
  121. status = (status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
  122. ((status & (ST0_KUC | ST0_IEC)) << 2);
  123. #else
  124. status |= ST0_EXL;
  125. #endif
  126. childregs->cp0_status = status;
  127. return 0;
  128. }
  129. /* user thread */
  130. *childregs = *regs;
  131. childregs->regs[7] = 0; /* Clear error flag */
  132. childregs->regs[2] = 0; /* Child gets zero as return value */
  133. if (usp)
  134. childregs->regs[29] = usp;
  135. ti->addr_limit = USER_DS;
  136. p->thread.reg29 = (unsigned long) childregs;
  137. p->thread.reg31 = (unsigned long) ret_from_fork;
  138. /*
  139. * New tasks lose permission to use the fpu. This accelerates context
  140. * switching for most programs since they don't use the fpu.
  141. */
  142. childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
  143. clear_tsk_thread_flag(p, TIF_USEDFPU);
  144. clear_tsk_thread_flag(p, TIF_USEDMSA);
  145. clear_tsk_thread_flag(p, TIF_MSA_CTX_LIVE);
  146. #ifdef CONFIG_MIPS_MT_FPAFF
  147. clear_tsk_thread_flag(p, TIF_FPUBOUND);
  148. #endif /* CONFIG_MIPS_MT_FPAFF */
  149. if (clone_flags & CLONE_SETTLS)
  150. ti->tp_value = regs->regs[7];
  151. return 0;
  152. }
  153. #ifdef CONFIG_CC_STACKPROTECTOR
  154. #include <linux/stackprotector.h>
  155. unsigned long __stack_chk_guard __read_mostly;
  156. EXPORT_SYMBOL(__stack_chk_guard);
  157. #endif
  158. struct mips_frame_info {
  159. void *func;
  160. unsigned long func_size;
  161. int frame_size;
  162. int pc_offset;
  163. };
  164. #define J_TARGET(pc,target) \
  165. (((unsigned long)(pc) & 0xf0000000) | ((target) << 2))
  166. static inline int is_ra_save_ins(union mips_instruction *ip)
  167. {
  168. #ifdef CONFIG_CPU_MICROMIPS
  169. union mips_instruction mmi;
  170. /*
  171. * swsp ra,offset
  172. * swm16 reglist,offset(sp)
  173. * swm32 reglist,offset(sp)
  174. * sw32 ra,offset(sp)
  175. * jradiussp - NOT SUPPORTED
  176. *
  177. * microMIPS is way more fun...
  178. */
  179. if (mm_insn_16bit(ip->halfword[0])) {
  180. mmi.word = (ip->halfword[0] << 16);
  181. return (mmi.mm16_r5_format.opcode == mm_swsp16_op &&
  182. mmi.mm16_r5_format.rt == 31) ||
  183. (mmi.mm16_m_format.opcode == mm_pool16c_op &&
  184. mmi.mm16_m_format.func == mm_swm16_op);
  185. }
  186. else {
  187. mmi.halfword[0] = ip->halfword[1];
  188. mmi.halfword[1] = ip->halfword[0];
  189. return (mmi.mm_m_format.opcode == mm_pool32b_op &&
  190. mmi.mm_m_format.rd > 9 &&
  191. mmi.mm_m_format.base == 29 &&
  192. mmi.mm_m_format.func == mm_swm32_func) ||
  193. (mmi.i_format.opcode == mm_sw32_op &&
  194. mmi.i_format.rs == 29 &&
  195. mmi.i_format.rt == 31);
  196. }
  197. #else
  198. /* sw / sd $ra, offset($sp) */
  199. return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
  200. ip->i_format.rs == 29 &&
  201. ip->i_format.rt == 31;
  202. #endif
  203. }
  204. static inline int is_jump_ins(union mips_instruction *ip)
  205. {
  206. #ifdef CONFIG_CPU_MICROMIPS
  207. /*
  208. * jr16,jrc,jalr16,jalr16
  209. * jal
  210. * jalr/jr,jalr.hb/jr.hb,jalrs,jalrs.hb
  211. * jraddiusp - NOT SUPPORTED
  212. *
  213. * microMIPS is kind of more fun...
  214. */
  215. union mips_instruction mmi;
  216. mmi.word = (ip->halfword[0] << 16);
  217. if ((mmi.mm16_r5_format.opcode == mm_pool16c_op &&
  218. (mmi.mm16_r5_format.rt & mm_jr16_op) == mm_jr16_op) ||
  219. ip->j_format.opcode == mm_jal32_op)
  220. return 1;
  221. if (ip->r_format.opcode != mm_pool32a_op ||
  222. ip->r_format.func != mm_pool32axf_op)
  223. return 0;
  224. return ((ip->u_format.uimmediate >> 6) & mm_jalr_op) == mm_jalr_op;
  225. #else
  226. if (ip->j_format.opcode == j_op)
  227. return 1;
  228. if (ip->j_format.opcode == jal_op)
  229. return 1;
  230. if (ip->r_format.opcode != spec_op)
  231. return 0;
  232. return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
  233. #endif
  234. }
  235. static inline int is_sp_move_ins(union mips_instruction *ip)
  236. {
  237. #ifdef CONFIG_CPU_MICROMIPS
  238. /*
  239. * addiusp -imm
  240. * addius5 sp,-imm
  241. * addiu32 sp,sp,-imm
  242. * jradiussp - NOT SUPPORTED
  243. *
  244. * microMIPS is not more fun...
  245. */
  246. if (mm_insn_16bit(ip->halfword[0])) {
  247. union mips_instruction mmi;
  248. mmi.word = (ip->halfword[0] << 16);
  249. return (mmi.mm16_r3_format.opcode == mm_pool16d_op &&
  250. mmi.mm16_r3_format.simmediate && mm_addiusp_func) ||
  251. (mmi.mm16_r5_format.opcode == mm_pool16d_op &&
  252. mmi.mm16_r5_format.rt == 29);
  253. }
  254. return ip->mm_i_format.opcode == mm_addiu32_op &&
  255. ip->mm_i_format.rt == 29 && ip->mm_i_format.rs == 29;
  256. #else
  257. /* addiu/daddiu sp,sp,-imm */
  258. if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
  259. return 0;
  260. if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
  261. return 1;
  262. #endif
  263. return 0;
  264. }
  265. static int get_frame_info(struct mips_frame_info *info)
  266. {
  267. #ifdef CONFIG_CPU_MICROMIPS
  268. union mips_instruction *ip = (void *) (((char *) info->func) - 1);
  269. #else
  270. union mips_instruction *ip = info->func;
  271. #endif
  272. unsigned max_insns = info->func_size / sizeof(union mips_instruction);
  273. unsigned i;
  274. info->pc_offset = -1;
  275. info->frame_size = 0;
  276. if (!ip)
  277. goto err;
  278. if (max_insns == 0)
  279. max_insns = 128U; /* unknown function size */
  280. max_insns = min(128U, max_insns);
  281. for (i = 0; i < max_insns; i++, ip++) {
  282. if (is_jump_ins(ip))
  283. break;
  284. if (!info->frame_size) {
  285. if (is_sp_move_ins(ip))
  286. {
  287. #ifdef CONFIG_CPU_MICROMIPS
  288. if (mm_insn_16bit(ip->halfword[0]))
  289. {
  290. unsigned short tmp;
  291. if (ip->halfword[0] & mm_addiusp_func)
  292. {
  293. tmp = (((ip->halfword[0] >> 1) & 0x1ff) << 2);
  294. info->frame_size = -(signed short)(tmp | ((tmp & 0x100) ? 0xfe00 : 0));
  295. } else {
  296. tmp = (ip->halfword[0] >> 1);
  297. info->frame_size = -(signed short)(tmp & 0xf);
  298. }
  299. ip = (void *) &ip->halfword[1];
  300. ip--;
  301. } else
  302. #endif
  303. info->frame_size = - ip->i_format.simmediate;
  304. }
  305. continue;
  306. }
  307. if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
  308. info->pc_offset =
  309. ip->i_format.simmediate / sizeof(long);
  310. break;
  311. }
  312. }
  313. if (info->frame_size && info->pc_offset >= 0) /* nested */
  314. return 0;
  315. if (info->pc_offset < 0) /* leaf */
  316. return 1;
  317. /* prologue seems boggus... */
  318. err:
  319. return -1;
  320. }
  321. static struct mips_frame_info schedule_mfi __read_mostly;
  322. #ifdef CONFIG_KALLSYMS
  323. static unsigned long get___schedule_addr(void)
  324. {
  325. return kallsyms_lookup_name("__schedule");
  326. }
  327. #else
  328. static unsigned long get___schedule_addr(void)
  329. {
  330. union mips_instruction *ip = (void *)schedule;
  331. int max_insns = 8;
  332. int i;
  333. for (i = 0; i < max_insns; i++, ip++) {
  334. if (ip->j_format.opcode == j_op)
  335. return J_TARGET(ip, ip->j_format.target);
  336. }
  337. return 0;
  338. }
  339. #endif
  340. static int __init frame_info_init(void)
  341. {
  342. unsigned long size = 0;
  343. #ifdef CONFIG_KALLSYMS
  344. unsigned long ofs;
  345. #endif
  346. unsigned long addr;
  347. addr = get___schedule_addr();
  348. if (!addr)
  349. addr = (unsigned long)schedule;
  350. #ifdef CONFIG_KALLSYMS
  351. kallsyms_lookup_size_offset(addr, &size, &ofs);
  352. #endif
  353. schedule_mfi.func = (void *)addr;
  354. schedule_mfi.func_size = size;
  355. get_frame_info(&schedule_mfi);
  356. /*
  357. * Without schedule() frame info, result given by
  358. * thread_saved_pc() and get_wchan() are not reliable.
  359. */
  360. if (schedule_mfi.pc_offset < 0)
  361. printk("Can't analyze schedule() prologue at %p\n", schedule);
  362. return 0;
  363. }
  364. arch_initcall(frame_info_init);
  365. /*
  366. * Return saved PC of a blocked thread.
  367. */
  368. unsigned long thread_saved_pc(struct task_struct *tsk)
  369. {
  370. struct thread_struct *t = &tsk->thread;
  371. /* New born processes are a special case */
  372. if (t->reg31 == (unsigned long) ret_from_fork)
  373. return t->reg31;
  374. if (schedule_mfi.pc_offset < 0)
  375. return 0;
  376. return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
  377. }
  378. #ifdef CONFIG_KALLSYMS
  379. /* generic stack unwinding function */
  380. unsigned long notrace unwind_stack_by_address(unsigned long stack_page,
  381. unsigned long *sp,
  382. unsigned long pc,
  383. unsigned long *ra)
  384. {
  385. struct mips_frame_info info;
  386. unsigned long size, ofs;
  387. int leaf;
  388. extern void ret_from_irq(void);
  389. extern void ret_from_exception(void);
  390. if (!stack_page)
  391. return 0;
  392. /*
  393. * If we reached the bottom of interrupt context,
  394. * return saved pc in pt_regs.
  395. */
  396. if (pc == (unsigned long)ret_from_irq ||
  397. pc == (unsigned long)ret_from_exception) {
  398. struct pt_regs *regs;
  399. if (*sp >= stack_page &&
  400. *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
  401. regs = (struct pt_regs *)*sp;
  402. pc = regs->cp0_epc;
  403. if (__kernel_text_address(pc)) {
  404. *sp = regs->regs[29];
  405. *ra = regs->regs[31];
  406. return pc;
  407. }
  408. }
  409. return 0;
  410. }
  411. if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
  412. return 0;
  413. /*
  414. * Return ra if an exception occurred at the first instruction
  415. */
  416. if (unlikely(ofs == 0)) {
  417. pc = *ra;
  418. *ra = 0;
  419. return pc;
  420. }
  421. info.func = (void *)(pc - ofs);
  422. info.func_size = ofs; /* analyze from start to ofs */
  423. leaf = get_frame_info(&info);
  424. if (leaf < 0)
  425. return 0;
  426. if (*sp < stack_page ||
  427. *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
  428. return 0;
  429. if (leaf)
  430. /*
  431. * For some extreme cases, get_frame_info() can
  432. * consider wrongly a nested function as a leaf
  433. * one. In that cases avoid to return always the
  434. * same value.
  435. */
  436. pc = pc != *ra ? *ra : 0;
  437. else
  438. pc = ((unsigned long *)(*sp))[info.pc_offset];
  439. *sp += info.frame_size;
  440. *ra = 0;
  441. return __kernel_text_address(pc) ? pc : 0;
  442. }
  443. EXPORT_SYMBOL(unwind_stack_by_address);
  444. /* used by show_backtrace() */
  445. unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
  446. unsigned long pc, unsigned long *ra)
  447. {
  448. unsigned long stack_page = (unsigned long)task_stack_page(task);
  449. return unwind_stack_by_address(stack_page, sp, pc, ra);
  450. }
  451. #endif
  452. /*
  453. * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
  454. */
  455. unsigned long get_wchan(struct task_struct *task)
  456. {
  457. unsigned long pc = 0;
  458. #ifdef CONFIG_KALLSYMS
  459. unsigned long sp;
  460. unsigned long ra = 0;
  461. #endif
  462. if (!task || task == current || task->state == TASK_RUNNING)
  463. goto out;
  464. if (!task_stack_page(task))
  465. goto out;
  466. pc = thread_saved_pc(task);
  467. #ifdef CONFIG_KALLSYMS
  468. sp = task->thread.reg29 + schedule_mfi.frame_size;
  469. while (in_sched_functions(pc))
  470. pc = unwind_stack(task, &sp, pc, &ra);
  471. #endif
  472. out:
  473. return pc;
  474. }
  475. /*
  476. * Don't forget that the stack pointer must be aligned on a 8 bytes
  477. * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
  478. */
  479. unsigned long arch_align_stack(unsigned long sp)
  480. {
  481. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  482. sp -= get_random_int() & ~PAGE_MASK;
  483. return sp & ALMASK;
  484. }
  485. static void arch_dump_stack(void *info)
  486. {
  487. struct pt_regs *regs;
  488. regs = get_irq_regs();
  489. if (regs)
  490. show_regs(regs);
  491. dump_stack();
  492. }
  493. void arch_trigger_all_cpu_backtrace(bool include_self)
  494. {
  495. smp_call_function(arch_dump_stack, NULL, 1);
  496. }
  497. int mips_get_process_fp_mode(struct task_struct *task)
  498. {
  499. int value = 0;
  500. if (!test_tsk_thread_flag(task, TIF_32BIT_FPREGS))
  501. value |= PR_FP_MODE_FR;
  502. if (test_tsk_thread_flag(task, TIF_HYBRID_FPREGS))
  503. value |= PR_FP_MODE_FRE;
  504. return value;
  505. }
  506. int mips_set_process_fp_mode(struct task_struct *task, unsigned int value)
  507. {
  508. const unsigned int known_bits = PR_FP_MODE_FR | PR_FP_MODE_FRE;
  509. unsigned long switch_count;
  510. struct task_struct *t;
  511. /* Check the value is valid */
  512. if (value & ~known_bits)
  513. return -EOPNOTSUPP;
  514. /* Avoid inadvertently triggering emulation */
  515. if ((value & PR_FP_MODE_FR) && cpu_has_fpu &&
  516. !(current_cpu_data.fpu_id & MIPS_FPIR_F64))
  517. return -EOPNOTSUPP;
  518. if ((value & PR_FP_MODE_FRE) && cpu_has_fpu && !cpu_has_fre)
  519. return -EOPNOTSUPP;
  520. /* FR = 0 not supported in MIPS R6 */
  521. if (!(value & PR_FP_MODE_FR) && cpu_has_fpu && cpu_has_mips_r6)
  522. return -EOPNOTSUPP;
  523. /* Save FP & vector context, then disable FPU & MSA */
  524. if (task->signal == current->signal)
  525. lose_fpu(1);
  526. /* Prevent any threads from obtaining live FP context */
  527. atomic_set(&task->mm->context.fp_mode_switching, 1);
  528. smp_mb__after_atomic();
  529. /*
  530. * If there are multiple online CPUs then wait until all threads whose
  531. * FP mode is about to change have been context switched. This approach
  532. * allows us to only worry about whether an FP mode switch is in
  533. * progress when FP is first used in a tasks time slice. Pretty much all
  534. * of the mode switch overhead can thus be confined to cases where mode
  535. * switches are actually occurring. That is, to here. However for the
  536. * thread performing the mode switch it may take a while...
  537. */
  538. if (num_online_cpus() > 1) {
  539. spin_lock_irq(&task->sighand->siglock);
  540. for_each_thread(task, t) {
  541. if (t == current)
  542. continue;
  543. switch_count = t->nvcsw + t->nivcsw;
  544. do {
  545. spin_unlock_irq(&task->sighand->siglock);
  546. cond_resched();
  547. spin_lock_irq(&task->sighand->siglock);
  548. } while ((t->nvcsw + t->nivcsw) == switch_count);
  549. }
  550. spin_unlock_irq(&task->sighand->siglock);
  551. }
  552. /*
  553. * There are now no threads of the process with live FP context, so it
  554. * is safe to proceed with the FP mode switch.
  555. */
  556. for_each_thread(task, t) {
  557. /* Update desired FP register width */
  558. if (value & PR_FP_MODE_FR) {
  559. clear_tsk_thread_flag(t, TIF_32BIT_FPREGS);
  560. } else {
  561. set_tsk_thread_flag(t, TIF_32BIT_FPREGS);
  562. clear_tsk_thread_flag(t, TIF_MSA_CTX_LIVE);
  563. }
  564. /* Update desired FP single layout */
  565. if (value & PR_FP_MODE_FRE)
  566. set_tsk_thread_flag(t, TIF_HYBRID_FPREGS);
  567. else
  568. clear_tsk_thread_flag(t, TIF_HYBRID_FPREGS);
  569. }
  570. /* Allow threads to use FP again */
  571. atomic_set(&task->mm->context.fp_mode_switching, 0);
  572. return 0;
  573. }