futex.h 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  1. #ifndef _LINUX_FUTEX_H
  2. #define _LINUX_FUTEX_H
  3. #include <linux/sched.h>
  4. union ktime;
  5. /* Second argument to futex syscall */
  6. #define FUTEX_WAIT 0
  7. #define FUTEX_WAKE 1
  8. #define FUTEX_FD 2
  9. #define FUTEX_REQUEUE 3
  10. #define FUTEX_CMP_REQUEUE 4
  11. #define FUTEX_WAKE_OP 5
  12. #define FUTEX_LOCK_PI 6
  13. #define FUTEX_UNLOCK_PI 7
  14. #define FUTEX_TRYLOCK_PI 8
  15. /*
  16. * Support for robust futexes: the kernel cleans up held futexes at
  17. * thread exit time.
  18. */
  19. /*
  20. * Per-lock list entry - embedded in user-space locks, somewhere close
  21. * to the futex field. (Note: user-space uses a double-linked list to
  22. * achieve O(1) list add and remove, but the kernel only needs to know
  23. * about the forward link)
  24. *
  25. * NOTE: this structure is part of the syscall ABI, and must not be
  26. * changed.
  27. */
  28. struct robust_list {
  29. struct robust_list __user *next;
  30. };
  31. /*
  32. * Per-thread list head:
  33. *
  34. * NOTE: this structure is part of the syscall ABI, and must only be
  35. * changed if the change is first communicated with the glibc folks.
  36. * (When an incompatible change is done, we'll increase the structure
  37. * size, which glibc will detect)
  38. */
  39. struct robust_list_head {
  40. /*
  41. * The head of the list. Points back to itself if empty:
  42. */
  43. struct robust_list list;
  44. /*
  45. * This relative offset is set by user-space, it gives the kernel
  46. * the relative position of the futex field to examine. This way
  47. * we keep userspace flexible, to freely shape its data-structure,
  48. * without hardcoding any particular offset into the kernel:
  49. */
  50. long futex_offset;
  51. /*
  52. * The death of the thread may race with userspace setting
  53. * up a lock's links. So to handle this race, userspace first
  54. * sets this field to the address of the to-be-taken lock,
  55. * then does the lock acquire, and then adds itself to the
  56. * list, and then clears this field. Hence the kernel will
  57. * always have full knowledge of all locks that the thread
  58. * _might_ have taken. We check the owner TID in any case,
  59. * so only truly owned locks will be handled.
  60. */
  61. struct robust_list __user *list_op_pending;
  62. };
  63. /*
  64. * Are there any waiters for this robust futex:
  65. */
  66. #define FUTEX_WAITERS 0x80000000
  67. /*
  68. * The kernel signals via this bit that a thread holding a futex
  69. * has exited without unlocking the futex. The kernel also does
  70. * a FUTEX_WAKE on such futexes, after setting the bit, to wake
  71. * up any possible waiters:
  72. */
  73. #define FUTEX_OWNER_DIED 0x40000000
  74. /*
  75. * The rest of the robust-futex field is for the TID:
  76. */
  77. #define FUTEX_TID_MASK 0x3fffffff
  78. /*
  79. * This limit protects against a deliberately circular list.
  80. * (Not worth introducing an rlimit for it)
  81. */
  82. #define ROBUST_LIST_LIMIT 2048
  83. #ifdef __KERNEL__
  84. long do_futex(u32 __user *uaddr, int op, u32 val, union ktime *timeout,
  85. u32 __user *uaddr2, u32 val2, u32 val3);
  86. extern int
  87. handle_futex_death(u32 __user *uaddr, struct task_struct *curr, int pi);
  88. /*
  89. * Futexes are matched on equal values of this key.
  90. * The key type depends on whether it's a shared or private mapping.
  91. * Don't rearrange members without looking at hash_futex().
  92. *
  93. * offset is aligned to a multiple of sizeof(u32) (== 4) by definition.
  94. * We set bit 0 to indicate if it's an inode-based key.
  95. */
  96. union futex_key {
  97. struct {
  98. unsigned long pgoff;
  99. struct inode *inode;
  100. int offset;
  101. } shared;
  102. struct {
  103. unsigned long address;
  104. struct mm_struct *mm;
  105. int offset;
  106. } private;
  107. struct {
  108. unsigned long word;
  109. void *ptr;
  110. int offset;
  111. } both;
  112. };
  113. int get_futex_key(u32 __user *uaddr, union futex_key *key);
  114. void get_futex_key_refs(union futex_key *key);
  115. void drop_futex_key_refs(union futex_key *key);
  116. #ifdef CONFIG_FUTEX
  117. extern void exit_robust_list(struct task_struct *curr);
  118. extern void exit_pi_state_list(struct task_struct *curr);
  119. #else
  120. static inline void exit_robust_list(struct task_struct *curr)
  121. {
  122. }
  123. static inline void exit_pi_state_list(struct task_struct *curr)
  124. {
  125. }
  126. #endif
  127. #endif /* __KERNEL__ */
  128. #define FUTEX_OP_SET 0 /* *(int *)UADDR2 = OPARG; */
  129. #define FUTEX_OP_ADD 1 /* *(int *)UADDR2 += OPARG; */
  130. #define FUTEX_OP_OR 2 /* *(int *)UADDR2 |= OPARG; */
  131. #define FUTEX_OP_ANDN 3 /* *(int *)UADDR2 &= ~OPARG; */
  132. #define FUTEX_OP_XOR 4 /* *(int *)UADDR2 ^= OPARG; */
  133. #define FUTEX_OP_OPARG_SHIFT 8 /* Use (1 << OPARG) instead of OPARG. */
  134. #define FUTEX_OP_CMP_EQ 0 /* if (oldval == CMPARG) wake */
  135. #define FUTEX_OP_CMP_NE 1 /* if (oldval != CMPARG) wake */
  136. #define FUTEX_OP_CMP_LT 2 /* if (oldval < CMPARG) wake */
  137. #define FUTEX_OP_CMP_LE 3 /* if (oldval <= CMPARG) wake */
  138. #define FUTEX_OP_CMP_GT 4 /* if (oldval > CMPARG) wake */
  139. #define FUTEX_OP_CMP_GE 5 /* if (oldval >= CMPARG) wake */
  140. /* FUTEX_WAKE_OP will perform atomically
  141. int oldval = *(int *)UADDR2;
  142. *(int *)UADDR2 = oldval OP OPARG;
  143. if (oldval CMP CMPARG)
  144. wake UADDR2; */
  145. #define FUTEX_OP(op, oparg, cmp, cmparg) \
  146. (((op & 0xf) << 28) | ((cmp & 0xf) << 24) \
  147. | ((oparg & 0xfff) << 12) | (cmparg & 0xfff))
  148. #endif