poll.h 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. #ifndef _LINUX_POLL_H
  2. #define _LINUX_POLL_H
  3. #include <asm/poll.h>
  4. #ifdef __KERNEL__
  5. #include <linux/compiler.h>
  6. #include <linux/wait.h>
  7. #include <linux/string.h>
  8. #include <linux/fs.h>
  9. #include <linux/sched.h>
  10. #include <asm/uaccess.h>
  11. /* ~832 bytes of stack space used max in sys_select/sys_poll before allocating
  12. additional memory. */
  13. #define MAX_STACK_ALLOC 832
  14. #define FRONTEND_STACK_ALLOC 256
  15. #define SELECT_STACK_ALLOC FRONTEND_STACK_ALLOC
  16. #define POLL_STACK_ALLOC FRONTEND_STACK_ALLOC
  17. #define WQUEUES_STACK_ALLOC (MAX_STACK_ALLOC - FRONTEND_STACK_ALLOC)
  18. #define N_INLINE_POLL_ENTRIES (WQUEUES_STACK_ALLOC / sizeof(struct poll_table_entry))
  19. #define DEFAULT_POLLMASK (POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM)
  20. struct poll_table_struct;
  21. /*
  22. * structures and helpers for f_op->poll implementations
  23. */
  24. typedef void (*poll_queue_proc)(struct file *, wait_queue_head_t *, struct poll_table_struct *);
  25. typedef struct poll_table_struct {
  26. poll_queue_proc qproc;
  27. } poll_table;
  28. static inline void poll_wait(struct file * filp, wait_queue_head_t * wait_address, poll_table *p)
  29. {
  30. if (p && wait_address)
  31. p->qproc(filp, wait_address, p);
  32. }
  33. static inline void init_poll_funcptr(poll_table *pt, poll_queue_proc qproc)
  34. {
  35. pt->qproc = qproc;
  36. }
  37. struct poll_table_entry {
  38. struct file * filp;
  39. wait_queue_t wait;
  40. wait_queue_head_t * wait_address;
  41. };
  42. /*
  43. * Structures and helpers for sys_poll/sys_poll
  44. */
  45. struct poll_wqueues {
  46. poll_table pt;
  47. struct poll_table_page * table;
  48. int error;
  49. int inline_index;
  50. struct poll_table_entry inline_entries[N_INLINE_POLL_ENTRIES];
  51. };
  52. extern void poll_initwait(struct poll_wqueues *pwq);
  53. extern void poll_freewait(struct poll_wqueues *pwq);
  54. /*
  55. * Scaleable version of the fd_set.
  56. */
  57. typedef struct {
  58. unsigned long *in, *out, *ex;
  59. unsigned long *res_in, *res_out, *res_ex;
  60. } fd_set_bits;
  61. /*
  62. * How many longwords for "nr" bits?
  63. */
  64. #define FDS_BITPERLONG (8*sizeof(long))
  65. #define FDS_LONGS(nr) (((nr)+FDS_BITPERLONG-1)/FDS_BITPERLONG)
  66. #define FDS_BYTES(nr) (FDS_LONGS(nr)*sizeof(long))
  67. /*
  68. * We do a VERIFY_WRITE here even though we are only reading this time:
  69. * we'll write to it eventually..
  70. *
  71. * Use "unsigned long" accesses to let user-mode fd_set's be long-aligned.
  72. */
  73. static inline
  74. int get_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
  75. {
  76. nr = FDS_BYTES(nr);
  77. if (ufdset)
  78. return copy_from_user(fdset, ufdset, nr) ? -EFAULT : 0;
  79. memset(fdset, 0, nr);
  80. return 0;
  81. }
  82. static inline unsigned long __must_check
  83. set_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
  84. {
  85. if (ufdset)
  86. return __copy_to_user(ufdset, fdset, FDS_BYTES(nr));
  87. return 0;
  88. }
  89. static inline
  90. void zero_fd_set(unsigned long nr, unsigned long *fdset)
  91. {
  92. memset(fdset, 0, FDS_BYTES(nr));
  93. }
  94. #define MAX_INT64_SECONDS (((s64)(~((u64)0)>>1)/HZ)-1)
  95. extern int do_select(int n, fd_set_bits *fds, s64 *timeout);
  96. extern int do_sys_poll(struct pollfd __user * ufds, unsigned int nfds,
  97. s64 *timeout);
  98. extern int core_sys_select(int n, fd_set __user *inp, fd_set __user *outp,
  99. fd_set __user *exp, s64 *timeout);
  100. #endif /* KERNEL */
  101. #endif /* _LINUX_POLL_H */