thread_info.h 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242
  1. /* thread_info.h: low-level thread information
  2. *
  3. * Copyright (C) 2002 David Howells (dhowells@redhat.com)
  4. * - Incorporating suggestions made by Linus Torvalds and Dave Miller
  5. */
  6. #ifndef _ASM_X86_THREAD_INFO_H
  7. #define _ASM_X86_THREAD_INFO_H
  8. #include <linux/compiler.h>
  9. #include <asm/page.h>
  10. #include <asm/percpu.h>
  11. #include <asm/types.h>
  12. /*
  13. * TOP_OF_KERNEL_STACK_PADDING is a number of unused bytes that we
  14. * reserve at the top of the kernel stack. We do it because of a nasty
  15. * 32-bit corner case. On x86_32, the hardware stack frame is
  16. * variable-length. Except for vm86 mode, struct pt_regs assumes a
  17. * maximum-length frame. If we enter from CPL 0, the top 8 bytes of
  18. * pt_regs don't actually exist. Ordinarily this doesn't matter, but it
  19. * does in at least one case:
  20. *
  21. * If we take an NMI early enough in SYSENTER, then we can end up with
  22. * pt_regs that extends above sp0. On the way out, in the espfix code,
  23. * we can read the saved SS value, but that value will be above sp0.
  24. * Without this offset, that can result in a page fault. (We are
  25. * careful that, in this case, the value we read doesn't matter.)
  26. *
  27. * In vm86 mode, the hardware frame is much longer still, so add 16
  28. * bytes to make room for the real-mode segments.
  29. *
  30. * x86_64 has a fixed-length stack frame.
  31. */
  32. #ifdef CONFIG_X86_32
  33. # ifdef CONFIG_VM86
  34. # define TOP_OF_KERNEL_STACK_PADDING 16
  35. # else
  36. # define TOP_OF_KERNEL_STACK_PADDING 8
  37. # endif
  38. #else
  39. # define TOP_OF_KERNEL_STACK_PADDING 0
  40. #endif
  41. /*
  42. * low level task data that entry.S needs immediate access to
  43. * - this struct should fit entirely inside of one cache line
  44. * - this struct shares the supervisor stack pages
  45. */
  46. #ifndef __ASSEMBLY__
  47. struct task_struct;
  48. #include <asm/cpufeature.h>
  49. #include <linux/atomic.h>
  50. struct thread_info {
  51. unsigned long flags; /* low level flags */
  52. };
  53. #define INIT_THREAD_INFO(tsk) \
  54. { \
  55. .flags = 0, \
  56. }
  57. #define init_stack (init_thread_union.stack)
  58. #else /* !__ASSEMBLY__ */
  59. #include <asm/asm-offsets.h>
  60. #endif
  61. /*
  62. * thread information flags
  63. * - these are process state flags that various assembly files
  64. * may need to access
  65. */
  66. #define TIF_SYSCALL_TRACE 0 /* syscall trace active */
  67. #define TIF_NOTIFY_RESUME 1 /* callback before returning to user */
  68. #define TIF_SIGPENDING 2 /* signal pending */
  69. #define TIF_NEED_RESCHED 3 /* rescheduling necessary */
  70. #define TIF_SINGLESTEP 4 /* reenable singlestep on user return*/
  71. #define TIF_SYSCALL_EMU 6 /* syscall emulation active */
  72. #define TIF_SYSCALL_AUDIT 7 /* syscall auditing active */
  73. #define TIF_SECCOMP 8 /* secure computing */
  74. #define TIF_USER_RETURN_NOTIFY 11 /* notify kernel of userspace return */
  75. #define TIF_UPROBE 12 /* breakpointed or singlestepping */
  76. #define TIF_PATCH_PENDING 13 /* pending live patching update */
  77. #define TIF_NOCPUID 15 /* CPUID is not accessible in userland */
  78. #define TIF_NOTSC 16 /* TSC is not accessible in userland */
  79. #define TIF_IA32 17 /* IA32 compatibility process */
  80. #define TIF_NOHZ 19 /* in adaptive nohz mode */
  81. #define TIF_MEMDIE 20 /* is terminating due to OOM killer */
  82. #define TIF_POLLING_NRFLAG 21 /* idle is polling for TIF_NEED_RESCHED */
  83. #define TIF_IO_BITMAP 22 /* uses I/O bitmap */
  84. #define TIF_FORCED_TF 24 /* true if TF in eflags artificially */
  85. #define TIF_BLOCKSTEP 25 /* set when we want DEBUGCTLMSR_BTF */
  86. #define TIF_LAZY_MMU_UPDATES 27 /* task is updating the mmu lazily */
  87. #define TIF_SYSCALL_TRACEPOINT 28 /* syscall tracepoint instrumentation */
  88. #define TIF_ADDR32 29 /* 32-bit address space on 64 bits */
  89. #define TIF_X32 30 /* 32-bit native x86-64 binary */
  90. #define TIF_FSCHECK 31 /* Check FS is USER_DS on return */
  91. #define _TIF_SYSCALL_TRACE (1 << TIF_SYSCALL_TRACE)
  92. #define _TIF_NOTIFY_RESUME (1 << TIF_NOTIFY_RESUME)
  93. #define _TIF_SIGPENDING (1 << TIF_SIGPENDING)
  94. #define _TIF_NEED_RESCHED (1 << TIF_NEED_RESCHED)
  95. #define _TIF_SINGLESTEP (1 << TIF_SINGLESTEP)
  96. #define _TIF_SYSCALL_EMU (1 << TIF_SYSCALL_EMU)
  97. #define _TIF_SYSCALL_AUDIT (1 << TIF_SYSCALL_AUDIT)
  98. #define _TIF_SECCOMP (1 << TIF_SECCOMP)
  99. #define _TIF_USER_RETURN_NOTIFY (1 << TIF_USER_RETURN_NOTIFY)
  100. #define _TIF_UPROBE (1 << TIF_UPROBE)
  101. #define _TIF_PATCH_PENDING (1 << TIF_PATCH_PENDING)
  102. #define _TIF_NOCPUID (1 << TIF_NOCPUID)
  103. #define _TIF_NOTSC (1 << TIF_NOTSC)
  104. #define _TIF_IA32 (1 << TIF_IA32)
  105. #define _TIF_NOHZ (1 << TIF_NOHZ)
  106. #define _TIF_POLLING_NRFLAG (1 << TIF_POLLING_NRFLAG)
  107. #define _TIF_IO_BITMAP (1 << TIF_IO_BITMAP)
  108. #define _TIF_FORCED_TF (1 << TIF_FORCED_TF)
  109. #define _TIF_BLOCKSTEP (1 << TIF_BLOCKSTEP)
  110. #define _TIF_LAZY_MMU_UPDATES (1 << TIF_LAZY_MMU_UPDATES)
  111. #define _TIF_SYSCALL_TRACEPOINT (1 << TIF_SYSCALL_TRACEPOINT)
  112. #define _TIF_ADDR32 (1 << TIF_ADDR32)
  113. #define _TIF_X32 (1 << TIF_X32)
  114. #define _TIF_FSCHECK (1 << TIF_FSCHECK)
  115. /*
  116. * work to do in syscall_trace_enter(). Also includes TIF_NOHZ for
  117. * enter_from_user_mode()
  118. */
  119. #define _TIF_WORK_SYSCALL_ENTRY \
  120. (_TIF_SYSCALL_TRACE | _TIF_SYSCALL_EMU | _TIF_SYSCALL_AUDIT | \
  121. _TIF_SECCOMP | _TIF_SYSCALL_TRACEPOINT | \
  122. _TIF_NOHZ)
  123. /* work to do on any return to user space */
  124. #define _TIF_ALLWORK_MASK \
  125. (_TIF_SYSCALL_TRACE | _TIF_NOTIFY_RESUME | _TIF_SIGPENDING | \
  126. _TIF_NEED_RESCHED | _TIF_SINGLESTEP | _TIF_SYSCALL_EMU | \
  127. _TIF_SYSCALL_AUDIT | _TIF_USER_RETURN_NOTIFY | _TIF_UPROBE | \
  128. _TIF_PATCH_PENDING | _TIF_NOHZ | _TIF_SYSCALL_TRACEPOINT | \
  129. _TIF_FSCHECK)
  130. /* flags to check in __switch_to() */
  131. #define _TIF_WORK_CTXSW \
  132. (_TIF_IO_BITMAP|_TIF_NOCPUID|_TIF_NOTSC|_TIF_BLOCKSTEP)
  133. #define _TIF_WORK_CTXSW_PREV (_TIF_WORK_CTXSW|_TIF_USER_RETURN_NOTIFY)
  134. #define _TIF_WORK_CTXSW_NEXT (_TIF_WORK_CTXSW)
  135. #define STACK_WARN (THREAD_SIZE/8)
  136. /*
  137. * macros/functions for gaining access to the thread information structure
  138. *
  139. * preempt_count needs to be 1 initially, until the scheduler is functional.
  140. */
  141. #ifndef __ASSEMBLY__
  142. /*
  143. * Walks up the stack frames to make sure that the specified object is
  144. * entirely contained by a single stack frame.
  145. *
  146. * Returns:
  147. * GOOD_FRAME if within a frame
  148. * BAD_STACK if placed across a frame boundary (or outside stack)
  149. * NOT_STACK unable to determine (no frame pointers, etc)
  150. */
  151. static inline int arch_within_stack_frames(const void * const stack,
  152. const void * const stackend,
  153. const void *obj, unsigned long len)
  154. {
  155. #if defined(CONFIG_FRAME_POINTER)
  156. const void *frame = NULL;
  157. const void *oldframe;
  158. oldframe = __builtin_frame_address(1);
  159. if (oldframe)
  160. frame = __builtin_frame_address(2);
  161. /*
  162. * low ----------------------------------------------> high
  163. * [saved bp][saved ip][args][local vars][saved bp][saved ip]
  164. * ^----------------^
  165. * allow copies only within here
  166. */
  167. while (stack <= frame && frame < stackend) {
  168. /*
  169. * If obj + len extends past the last frame, this
  170. * check won't pass and the next frame will be 0,
  171. * causing us to bail out and correctly report
  172. * the copy as invalid.
  173. */
  174. if (obj + len <= frame)
  175. return obj >= oldframe + 2 * sizeof(void *) ?
  176. GOOD_FRAME : BAD_STACK;
  177. oldframe = frame;
  178. frame = *(const void * const *)frame;
  179. }
  180. return BAD_STACK;
  181. #else
  182. return NOT_STACK;
  183. #endif
  184. }
  185. #else /* !__ASSEMBLY__ */
  186. #ifdef CONFIG_X86_64
  187. # define cpu_current_top_of_stack (cpu_tss + TSS_sp0)
  188. #endif
  189. #endif
  190. #ifdef CONFIG_COMPAT
  191. #define TS_I386_REGS_POKED 0x0004 /* regs poked by 32-bit ptracer */
  192. #endif
  193. #ifndef __ASSEMBLY__
  194. #ifdef CONFIG_X86_32
  195. #define in_ia32_syscall() true
  196. #else
  197. #define in_ia32_syscall() (IS_ENABLED(CONFIG_IA32_EMULATION) && \
  198. current->thread.status & TS_COMPAT)
  199. #endif
  200. /*
  201. * Force syscall return via IRET by making it look as if there was
  202. * some work pending. IRET is our most capable (but slowest) syscall
  203. * return path, which is able to restore modified SS, CS and certain
  204. * EFLAGS values that other (fast) syscall return instructions
  205. * are not able to restore properly.
  206. */
  207. #define force_iret() set_thread_flag(TIF_NOTIFY_RESUME)
  208. extern void arch_task_cache_init(void);
  209. extern int arch_dup_task_struct(struct task_struct *dst, struct task_struct *src);
  210. extern void arch_release_task_struct(struct task_struct *tsk);
  211. extern void arch_setup_new_exec(void);
  212. #define arch_setup_new_exec arch_setup_new_exec
  213. #endif /* !__ASSEMBLY__ */
  214. #endif /* _ASM_X86_THREAD_INFO_H */