Blame view
fs/select.c
24.2 KB
1da177e4c
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
/* * This file contains the procedures for the handling of select and poll * * Created for Linux based loosely upon Mathius Lattner's minix * patches by Peter MacDonald. Heavily edited by Linus. * * 4 February 1994 * COFF/ELF binary emulation. If the process has the STICKY_TIMEOUTS * flag set in its personality we do *not* modify the given timeout * parameter to reflect time remaining. * * 24 January 2000 * Changed sys_poll()/do_poll() to use PAGE_SIZE chunk-based allocation * of fds to overcome nfds < 16390 descriptors limit (Tigran Aivazian). */ |
022a16924
|
16 |
#include <linux/kernel.h> |
a99bbaf5e
|
17 |
#include <linux/sched.h> |
1da177e4c
|
18 19 20 |
#include <linux/syscalls.h> #include <linux/module.h> #include <linux/slab.h> |
1da177e4c
|
21 22 23 |
#include <linux/poll.h> #include <linux/personality.h> /* for STICKY_TIMEOUTS */ #include <linux/file.h> |
9f3acc314
|
24 |
#include <linux/fdtable.h> |
1da177e4c
|
25 |
#include <linux/fs.h> |
b835996f6
|
26 |
#include <linux/rcupdate.h> |
8ff3e8e85
|
27 |
#include <linux/hrtimer.h> |
1da177e4c
|
28 29 |
#include <asm/uaccess.h> |
90d6e24a3
|
30 31 32 33 34 35 36 37 38 39 40 41 |
/* * Estimate expected accuracy in ns from a timeval. * * After quite a bit of churning around, we've settled on * a simple thing of taking 0.1% of the timeout as the * slack, with a cap of 100 msec. * "nice" tasks get a 0.5% slack instead. * * Consider this comment an open invitation to come up with even * better solutions.. */ |
5ae87e79e
|
42 |
#define MAX_SLACK (100 * NSEC_PER_MSEC) |
96d2ab484
|
43 |
static long __estimate_accuracy(struct timespec *tv) |
90d6e24a3
|
44 |
{ |
96d2ab484
|
45 |
long slack; |
90d6e24a3
|
46 |
int divfactor = 1000; |
5ae87e79e
|
47 48 |
if (tv->tv_sec < 0) return 0; |
4ce105d30
|
49 |
if (task_nice(current) > 0) |
90d6e24a3
|
50 |
divfactor = divfactor / 5; |
5ae87e79e
|
51 52 |
if (tv->tv_sec > MAX_SLACK / (NSEC_PER_SEC/divfactor)) return MAX_SLACK; |
90d6e24a3
|
53 54 |
slack = tv->tv_nsec / divfactor; slack += tv->tv_sec * (NSEC_PER_SEC/divfactor); |
5ae87e79e
|
55 56 |
if (slack > MAX_SLACK) return MAX_SLACK; |
96d2ab484
|
57 |
|
90d6e24a3
|
58 59 |
return slack; } |
95aac7b1c
|
60 |
long select_estimate_accuracy(struct timespec *tv) |
90d6e24a3
|
61 62 63 64 65 66 67 |
{ unsigned long ret; struct timespec now; /* * Realtime tasks get a slack of 0 for obvious reasons. */ |
4ce105d30
|
68 |
if (rt_task(current)) |
90d6e24a3
|
69 70 71 72 73 74 75 76 77 |
return 0; ktime_get_ts(&now); now = timespec_sub(*tv, now); ret = __estimate_accuracy(&now); if (ret < current->timer_slack_ns) return current->timer_slack_ns; return ret; } |
1da177e4c
|
78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 |
struct poll_table_page { struct poll_table_page * next; struct poll_table_entry * entry; struct poll_table_entry entries[0]; }; #define POLL_TABLE_FULL(table) \ ((unsigned long)((table)->entry+1) > PAGE_SIZE + (unsigned long)(table)) /* * Ok, Peter made a complicated, but straightforward multiple_wait() function. * I have rewritten this, taking some shortcuts: This code may not be easy to * follow, but it should be free of race-conditions, and it's practical. If you * understand what I'm doing here, then you understand how the linux * sleep/wakeup mechanism works. * * Two very simple procedures, poll_wait() and poll_freewait() make all the * work. poll_wait() is an inline-function defined in <linux/poll.h>, * as all select/poll functions have to call it to add an entry to the * poll table. */ |
75c96f858
|
99 100 |
static void __pollwait(struct file *filp, wait_queue_head_t *wait_address, poll_table *p); |
1da177e4c
|
101 102 103 104 |
void poll_initwait(struct poll_wqueues *pwq) { init_poll_funcptr(&pwq->pt, __pollwait); |
5f820f648
|
105 |
pwq->polling_task = current; |
b2add73db
|
106 |
pwq->triggered = 0; |
1da177e4c
|
107 108 |
pwq->error = 0; pwq->table = NULL; |
70674f95c
|
109 |
pwq->inline_index = 0; |
1da177e4c
|
110 |
} |
1da177e4c
|
111 |
EXPORT_SYMBOL(poll_initwait); |
70674f95c
|
112 113 |
static void free_poll_entry(struct poll_table_entry *entry) { |
ccf6780dc
|
114 |
remove_wait_queue(entry->wait_address, &entry->wait); |
70674f95c
|
115 116 |
fput(entry->filp); } |
1da177e4c
|
117 118 119 |
void poll_freewait(struct poll_wqueues *pwq) { struct poll_table_page * p = pwq->table; |
70674f95c
|
120 121 122 |
int i; for (i = 0; i < pwq->inline_index; i++) free_poll_entry(pwq->inline_entries + i); |
1da177e4c
|
123 124 125 126 127 128 129 |
while (p) { struct poll_table_entry * entry; struct poll_table_page *old; entry = p->entry; do { entry--; |
70674f95c
|
130 |
free_poll_entry(entry); |
1da177e4c
|
131 132 133 134 135 136 |
} while (entry > p->entries); old = p; p = p->next; free_page((unsigned long) old); } } |
1da177e4c
|
137 |
EXPORT_SYMBOL(poll_freewait); |
5f820f648
|
138 |
static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p) |
1da177e4c
|
139 |
{ |
1da177e4c
|
140 |
struct poll_table_page *table = p->table; |
70674f95c
|
141 142 |
if (p->inline_index < N_INLINE_POLL_ENTRIES) return p->inline_entries + p->inline_index++; |
1da177e4c
|
143 144 145 146 147 148 |
if (!table || POLL_TABLE_FULL(table)) { struct poll_table_page *new_table; new_table = (struct poll_table_page *) __get_free_page(GFP_KERNEL); if (!new_table) { p->error = -ENOMEM; |
70674f95c
|
149 |
return NULL; |
1da177e4c
|
150 151 152 153 154 155 |
} new_table->entry = new_table->entries; new_table->next = table; p->table = new_table; table = new_table; } |
70674f95c
|
156 157 |
return table->entry++; } |
4938d7e02
|
158 |
static int __pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key) |
5f820f648
|
159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 |
{ struct poll_wqueues *pwq = wait->private; DECLARE_WAITQUEUE(dummy_wait, pwq->polling_task); /* * Although this function is called under waitqueue lock, LOCK * doesn't imply write barrier and the users expect write * barrier semantics on wakeup functions. The following * smp_wmb() is equivalent to smp_wmb() in try_to_wake_up() * and is paired with set_mb() in poll_schedule_timeout. */ smp_wmb(); pwq->triggered = 1; /* * Perform the default wake up operation using a dummy * waitqueue. * * TODO: This is hacky but there currently is no interface to * pass in @sync. @sync is scheduled to be removed and once * that happens, wake_up_process() can be used directly. */ return default_wake_function(&dummy_wait, mode, sync, key); } |
4938d7e02
|
183 184 185 186 187 188 189 190 191 |
static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key) { struct poll_table_entry *entry; entry = container_of(wait, struct poll_table_entry, wait); if (key && !((unsigned long)key & entry->key)) return 0; return __pollwake(wait, mode, sync, key); } |
70674f95c
|
192 193 194 195 |
/* Add a new entry */ static void __pollwait(struct file *filp, wait_queue_head_t *wait_address, poll_table *p) { |
5f820f648
|
196 197 |
struct poll_wqueues *pwq = container_of(p, struct poll_wqueues, pt); struct poll_table_entry *entry = poll_get_entry(pwq); |
70674f95c
|
198 199 200 201 202 |
if (!entry) return; get_file(filp); entry->filp = filp; entry->wait_address = wait_address; |
4938d7e02
|
203 |
entry->key = p->key; |
5f820f648
|
204 205 |
init_waitqueue_func_entry(&entry->wait, pollwake); entry->wait.private = pwq; |
ccf6780dc
|
206 |
add_wait_queue(wait_address, &entry->wait); |
1da177e4c
|
207 |
} |
5f820f648
|
208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 |
int poll_schedule_timeout(struct poll_wqueues *pwq, int state, ktime_t *expires, unsigned long slack) { int rc = -EINTR; set_current_state(state); if (!pwq->triggered) rc = schedule_hrtimeout_range(expires, slack, HRTIMER_MODE_ABS); __set_current_state(TASK_RUNNING); /* * Prepare for the next iteration. * * The following set_mb() serves two purposes. First, it's * the counterpart rmb of the wmb in pollwake() such that data * written before wake up is always visible after wake up. * Second, the full barrier guarantees that triggered clearing * doesn't pass event check of the next iteration. Note that * this problem doesn't exist for the first iteration as * add_wait_queue() has full barrier semantics. */ set_mb(pwq->triggered, 0); return rc; } EXPORT_SYMBOL(poll_schedule_timeout); |
b773ad40a
|
234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 |
/** * poll_select_set_timeout - helper function to setup the timeout value * @to: pointer to timespec variable for the final timeout * @sec: seconds (from user space) * @nsec: nanoseconds (from user space) * * Note, we do not use a timespec for the user space value here, That * way we can use the function for timeval and compat interfaces as well. * * Returns -EINVAL if sec/nsec are not normalized. Otherwise 0. */ int poll_select_set_timeout(struct timespec *to, long sec, long nsec) { struct timespec ts = {.tv_sec = sec, .tv_nsec = nsec}; if (!timespec_valid(&ts)) return -EINVAL; /* Optimize for the zero timeout value here */ if (!sec && !nsec) { to->tv_sec = to->tv_nsec = 0; } else { ktime_get_ts(to); *to = timespec_add_safe(*to, ts); } return 0; } static int poll_select_copy_remaining(struct timespec *end_time, void __user *p, int timeval, int ret) { struct timespec rts; struct timeval rtv; if (!p) return ret; if (current->personality & STICKY_TIMEOUTS) goto sticky; /* No update for zero timeout */ if (!end_time->tv_sec && !end_time->tv_nsec) return ret; ktime_get_ts(&rts); rts = timespec_sub(*end_time, rts); if (rts.tv_sec < 0) rts.tv_sec = rts.tv_nsec = 0; if (timeval) { |
65329bf46
|
284 285 |
if (sizeof(rtv) > sizeof(rtv.tv_sec) + sizeof(rtv.tv_usec)) memset(&rtv, 0, sizeof(rtv)); |
b773ad40a
|
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 |
rtv.tv_sec = rts.tv_sec; rtv.tv_usec = rts.tv_nsec / NSEC_PER_USEC; if (!copy_to_user(p, &rtv, sizeof(rtv))) return ret; } else if (!copy_to_user(p, &rts, sizeof(rts))) return ret; /* * If an application puts its timeval in read-only memory, we * don't want the Linux-specific update to the timeval to * cause a fault after the select has completed * successfully. However, because we're not updating the * timeval, we can't restart the system call. */ sticky: if (ret == -ERESTARTNOHAND) ret = -EINTR; return ret; } |
1da177e4c
|
308 309 310 311 312 313 314 315 316 317 318 |
#define FDS_IN(fds, n) (fds->in + n) #define FDS_OUT(fds, n) (fds->out + n) #define FDS_EX(fds, n) (fds->ex + n) #define BITS(fds, n) (*FDS_IN(fds, n)|*FDS_OUT(fds, n)|*FDS_EX(fds, n)) static int max_select_fd(unsigned long n, fd_set_bits *fds) { unsigned long *open_fds; unsigned long set; int max; |
badf16621
|
319 |
struct fdtable *fdt; |
1da177e4c
|
320 321 322 323 |
/* handle last in-complete long-word first */ set = ~(~0UL << (n & (__NFDBITS-1))); n /= __NFDBITS; |
badf16621
|
324 325 |
fdt = files_fdtable(current->files); open_fds = fdt->open_fds->fds_bits+n; |
1da177e4c
|
326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 |
max = 0; if (set) { set &= BITS(fds, n); if (set) { if (!(set & ~*open_fds)) goto get_max; return -EBADF; } } while (n) { open_fds--; n--; set = BITS(fds, n); if (!set) continue; if (set & ~*open_fds) return -EBADF; if (max) continue; get_max: do { max++; set >>= 1; } while (set); max += n * __NFDBITS; } return max; } |
1da177e4c
|
355 356 357 |
#define POLLIN_SET (POLLRDNORM | POLLRDBAND | POLLIN | POLLHUP | POLLERR) #define POLLOUT_SET (POLLWRBAND | POLLWRNORM | POLLOUT | POLLERR) #define POLLEX_SET (POLLPRI) |
4938d7e02
|
358 359 360 361 362 363 364 365 366 367 368 |
static inline void wait_key_set(poll_table *wait, unsigned long in, unsigned long out, unsigned long bit) { if (wait) { wait->key = POLLEX_SET; if (in & bit) wait->key |= POLLIN_SET; if (out & bit) wait->key |= POLLOUT_SET; } } |
8ff3e8e85
|
369 |
int do_select(int n, fd_set_bits *fds, struct timespec *end_time) |
1da177e4c
|
370 |
{ |
8ff3e8e85
|
371 |
ktime_t expire, *to = NULL; |
1da177e4c
|
372 373 |
struct poll_wqueues table; poll_table *wait; |
8ff3e8e85
|
374 |
int retval, i, timed_out = 0; |
90d6e24a3
|
375 |
unsigned long slack = 0; |
1da177e4c
|
376 |
|
b835996f6
|
377 |
rcu_read_lock(); |
1da177e4c
|
378 |
retval = max_select_fd(n, fds); |
b835996f6
|
379 |
rcu_read_unlock(); |
1da177e4c
|
380 381 382 383 384 385 386 |
if (retval < 0) return retval; n = retval; poll_initwait(&table); wait = &table.pt; |
8ff3e8e85
|
387 |
if (end_time && !end_time->tv_sec && !end_time->tv_nsec) { |
1da177e4c
|
388 |
wait = NULL; |
8ff3e8e85
|
389 390 |
timed_out = 1; } |
96d2ab484
|
391 |
if (end_time && !timed_out) |
231f3d393
|
392 |
slack = select_estimate_accuracy(end_time); |
90d6e24a3
|
393 |
|
1da177e4c
|
394 395 396 |
retval = 0; for (;;) { unsigned long *rinp, *routp, *rexp, *inp, *outp, *exp; |
1da177e4c
|
397 398 399 400 401 402 |
inp = fds->in; outp = fds->out; exp = fds->ex; rinp = fds->res_in; routp = fds->res_out; rexp = fds->res_ex; for (i = 0; i < n; ++rinp, ++routp, ++rexp) { unsigned long in, out, ex, all_bits, bit = 1, mask, j; unsigned long res_in = 0, res_out = 0, res_ex = 0; |
99ac48f54
|
403 |
const struct file_operations *f_op = NULL; |
1da177e4c
|
404 405 406 407 408 409 410 411 412 413 |
struct file *file = NULL; in = *inp++; out = *outp++; ex = *exp++; all_bits = in | out | ex; if (all_bits == 0) { i += __NFDBITS; continue; } for (j = 0; j < __NFDBITS; ++j, ++i, bit <<= 1) { |
e4a1f129f
|
414 |
int fput_needed; |
1da177e4c
|
415 416 417 418 |
if (i >= n) break; if (!(bit & all_bits)) continue; |
e4a1f129f
|
419 |
file = fget_light(i, &fput_needed); |
1da177e4c
|
420 421 422 |
if (file) { f_op = file->f_op; mask = DEFAULT_POLLMASK; |
4938d7e02
|
423 424 425 426 |
if (f_op && f_op->poll) { wait_key_set(wait, in, out, bit); mask = (*f_op->poll)(file, wait); } |
e4a1f129f
|
427 |
fput_light(file, fput_needed); |
1da177e4c
|
428 429 430 |
if ((mask & POLLIN_SET) && (in & bit)) { res_in |= bit; retval++; |
4938d7e02
|
431 |
wait = NULL; |
1da177e4c
|
432 433 434 435 |
} if ((mask & POLLOUT_SET) && (out & bit)) { res_out |= bit; retval++; |
4938d7e02
|
436 |
wait = NULL; |
1da177e4c
|
437 438 439 440 |
} if ((mask & POLLEX_SET) && (ex & bit)) { res_ex |= bit; retval++; |
4938d7e02
|
441 |
wait = NULL; |
1da177e4c
|
442 443 |
} } |
1da177e4c
|
444 445 446 447 448 449 450 |
} if (res_in) *rinp = res_in; if (res_out) *routp = res_out; if (res_ex) *rexp = res_ex; |
55d853849
|
451 |
cond_resched(); |
1da177e4c
|
452 453 |
} wait = NULL; |
8ff3e8e85
|
454 |
if (retval || timed_out || signal_pending(current)) |
1da177e4c
|
455 |
break; |
f5264481c
|
456 |
if (table.error) { |
1da177e4c
|
457 458 459 |
retval = table.error; break; } |
9f72949f6
|
460 |
|
8ff3e8e85
|
461 462 463 464 465 466 467 468 |
/* * If this is the first loop and we have a timeout * given, then we convert to ktime_t and set the to * pointer to the expiry value. */ if (end_time && !to) { expire = timespec_to_ktime(*end_time); to = &expire; |
9f72949f6
|
469 |
} |
8ff3e8e85
|
470 |
|
5f820f648
|
471 472 |
if (!poll_schedule_timeout(&table, TASK_INTERRUPTIBLE, to, slack)) |
8ff3e8e85
|
473 |
timed_out = 1; |
1da177e4c
|
474 |
} |
1da177e4c
|
475 476 |
poll_freewait(&table); |
1da177e4c
|
477 478 |
return retval; } |
1da177e4c
|
479 480 481 482 483 484 485 486 |
/* * We can actually return ERESTARTSYS instead of EINTR, but I'd * like to be certain this leads to no problems. So I return * EINTR just for safety. * * Update: ERESTARTSYS breaks at least the xview clock binary, so * I'm trying ERESTARTNOHAND which restart only when you want to. */ |
a2dcb44c3
|
487 |
int core_sys_select(int n, fd_set __user *inp, fd_set __user *outp, |
8ff3e8e85
|
488 |
fd_set __user *exp, struct timespec *end_time) |
1da177e4c
|
489 490 |
{ fd_set_bits fds; |
29ff2db55
|
491 |
void *bits; |
bbea9f696
|
492 |
int ret, max_fds; |
b04eb6aa0
|
493 |
unsigned int size; |
badf16621
|
494 |
struct fdtable *fdt; |
70674f95c
|
495 |
/* Allocate small arguments on the stack to save memory and be faster */ |
30c14e40e
|
496 |
long stack_fds[SELECT_STACK_ALLOC/sizeof(long)]; |
1da177e4c
|
497 |
|
1da177e4c
|
498 499 500 |
ret = -EINVAL; if (n < 0) goto out_nofds; |
bbea9f696
|
501 |
/* max_fds can increase, so grab it once to avoid race */ |
b835996f6
|
502 |
rcu_read_lock(); |
badf16621
|
503 |
fdt = files_fdtable(current->files); |
bbea9f696
|
504 |
max_fds = fdt->max_fds; |
b835996f6
|
505 |
rcu_read_unlock(); |
bbea9f696
|
506 507 |
if (n > max_fds) n = max_fds; |
1da177e4c
|
508 509 510 511 512 513 |
/* * We need 6 bitmaps (in/out/ex for both incoming and outgoing), * since we used fdset we need to allocate memory in units of * long-words. */ |
1da177e4c
|
514 |
size = FDS_BYTES(n); |
b04eb6aa0
|
515 516 517 518 |
bits = stack_fds; if (size > sizeof(stack_fds) / 6) { /* Not enough space in on-stack array; must use kmalloc */ ret = -ENOMEM; |
70674f95c
|
519 |
bits = kmalloc(6 * size, GFP_KERNEL); |
b04eb6aa0
|
520 521 522 |
if (!bits) goto out_nofds; } |
29ff2db55
|
523 524 525 526 527 528 |
fds.in = bits; fds.out = bits + size; fds.ex = bits + 2*size; fds.res_in = bits + 3*size; fds.res_out = bits + 4*size; fds.res_ex = bits + 5*size; |
1da177e4c
|
529 530 531 532 533 534 535 536 |
if ((ret = get_fd_set(n, inp, fds.in)) || (ret = get_fd_set(n, outp, fds.out)) || (ret = get_fd_set(n, exp, fds.ex))) goto out; zero_fd_set(n, fds.res_in); zero_fd_set(n, fds.res_out); zero_fd_set(n, fds.res_ex); |
8ff3e8e85
|
537 |
ret = do_select(n, &fds, end_time); |
1da177e4c
|
538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 |
if (ret < 0) goto out; if (!ret) { ret = -ERESTARTNOHAND; if (signal_pending(current)) goto out; ret = 0; } if (set_fd_set(n, inp, fds.res_in) || set_fd_set(n, outp, fds.res_out) || set_fd_set(n, exp, fds.res_ex)) ret = -EFAULT; out: |
70674f95c
|
554 555 |
if (bits != stack_fds) kfree(bits); |
1da177e4c
|
556 557 558 |
out_nofds: return ret; } |
5a8a82b1d
|
559 560 |
SYSCALL_DEFINE5(select, int, n, fd_set __user *, inp, fd_set __user *, outp, fd_set __user *, exp, struct timeval __user *, tvp) |
9f72949f6
|
561 |
{ |
8ff3e8e85
|
562 |
struct timespec end_time, *to = NULL; |
9f72949f6
|
563 564 565 566 567 568 |
struct timeval tv; int ret; if (tvp) { if (copy_from_user(&tv, tvp, sizeof(tv))) return -EFAULT; |
8ff3e8e85
|
569 |
to = &end_time; |
4d36a9e65
|
570 571 572 |
if (poll_select_set_timeout(to, tv.tv_sec + (tv.tv_usec / USEC_PER_SEC), (tv.tv_usec % USEC_PER_SEC) * NSEC_PER_USEC)) |
9f72949f6
|
573 |
return -EINVAL; |
9f72949f6
|
574 |
} |
8ff3e8e85
|
575 576 |
ret = core_sys_select(n, inp, outp, exp, to); ret = poll_select_copy_remaining(&end_time, tvp, 1, ret); |
9f72949f6
|
577 578 579 |
return ret; } |
f3de272b8
|
580 |
#ifdef HAVE_SET_RESTORE_SIGMASK |
c9da9f212
|
581 582 583 |
static long do_pselect(int n, fd_set __user *inp, fd_set __user *outp, fd_set __user *exp, struct timespec __user *tsp, const sigset_t __user *sigmask, size_t sigsetsize) |
9f72949f6
|
584 |
{ |
9f72949f6
|
585 |
sigset_t ksigmask, sigsaved; |
8ff3e8e85
|
586 |
struct timespec ts, end_time, *to = NULL; |
9f72949f6
|
587 588 589 590 591 |
int ret; if (tsp) { if (copy_from_user(&ts, tsp, sizeof(ts))) return -EFAULT; |
8ff3e8e85
|
592 593 |
to = &end_time; if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec)) |
9f72949f6
|
594 |
return -EINVAL; |
9f72949f6
|
595 596 597 598 599 600 601 602 603 604 605 606 |
} if (sigmask) { /* XXX: Don't preclude handling different sized sigset_t's. */ if (sigsetsize != sizeof(sigset_t)) return -EINVAL; if (copy_from_user(&ksigmask, sigmask, sizeof(ksigmask))) return -EFAULT; sigdelsetmask(&ksigmask, sigmask(SIGKILL)|sigmask(SIGSTOP)); sigprocmask(SIG_SETMASK, &ksigmask, &sigsaved); } |
62568510b
|
607 |
ret = core_sys_select(n, inp, outp, exp, to); |
8ff3e8e85
|
608 |
ret = poll_select_copy_remaining(&end_time, tsp, 0, ret); |
9f72949f6
|
609 610 611 612 613 614 615 616 617 618 |
if (ret == -ERESTARTNOHAND) { /* * Don't restore the signal mask yet. Let do_signal() deliver * the signal on the way back to userspace, before the signal * mask is restored. */ if (sigmask) { memcpy(¤t->saved_sigmask, &sigsaved, sizeof(sigsaved)); |
4e4c22c71
|
619 |
set_restore_sigmask(); |
9f72949f6
|
620 621 622 623 624 625 626 627 628 629 630 631 632 |
} } else if (sigmask) sigprocmask(SIG_SETMASK, &sigsaved, NULL); return ret; } /* * Most architectures can't handle 7-argument syscalls. So we provide a * 6-argument version where the sixth argument is a pointer to a structure * which has a pointer to the sigset_t itself followed by a size_t containing * the sigset size. */ |
d4e82042c
|
633 634 635 |
SYSCALL_DEFINE6(pselect6, int, n, fd_set __user *, inp, fd_set __user *, outp, fd_set __user *, exp, struct timespec __user *, tsp, void __user *, sig) |
9f72949f6
|
636 637 638 639 640 641 |
{ size_t sigsetsize = 0; sigset_t __user *up = NULL; if (sig) { if (!access_ok(VERIFY_READ, sig, sizeof(void *)+sizeof(size_t)) |
e110ab94e
|
642 |
|| __get_user(up, (sigset_t __user * __user *)sig) |
9f72949f6
|
643 |
|| __get_user(sigsetsize, |
e110ab94e
|
644 |
(size_t __user *)(sig+sizeof(void *)))) |
9f72949f6
|
645 646 |
return -EFAULT; } |
c9da9f212
|
647 |
return do_pselect(n, inp, outp, exp, tsp, up, sigsetsize); |
9f72949f6
|
648 |
} |
f3de272b8
|
649 |
#endif /* HAVE_SET_RESTORE_SIGMASK */ |
9f72949f6
|
650 |
|
5d0e52830
|
651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 |
#ifdef __ARCH_WANT_SYS_OLD_SELECT struct sel_arg_struct { unsigned long n; fd_set __user *inp, *outp, *exp; struct timeval __user *tvp; }; SYSCALL_DEFINE1(old_select, struct sel_arg_struct __user *, arg) { struct sel_arg_struct a; if (copy_from_user(&a, arg, sizeof(a))) return -EFAULT; return sys_select(a.n, a.inp, a.outp, a.exp, a.tvp); } #endif |
1da177e4c
|
667 668 669 670 671 672 673 |
struct poll_list { struct poll_list *next; int len; struct pollfd entries[0]; }; #define POLLFD_PER_PAGE ((PAGE_SIZE-sizeof(struct poll_list)) / sizeof(struct pollfd)) |
4a4b69f79
|
674 675 676 677 678 679 680 681 |
/* * Fish for pollable events on the pollfd->fd file descriptor. We're only * interested in events matching the pollfd->events mask, and the result * matching that mask is both recorded in pollfd->revents and returned. The * pwait poll_table will be used by the fd-provided poll handler for waiting, * if non-NULL. */ static inline unsigned int do_pollfd(struct pollfd *pollfd, poll_table *pwait) |
1da177e4c
|
682 |
{ |
4a4b69f79
|
683 684 685 686 687 688 689 690 691 692 693 694 695 |
unsigned int mask; int fd; mask = 0; fd = pollfd->fd; if (fd >= 0) { int fput_needed; struct file * file; file = fget_light(fd, &fput_needed); mask = POLLNVAL; if (file != NULL) { mask = DEFAULT_POLLMASK; |
4938d7e02
|
696 697 698 699 |
if (file->f_op && file->f_op->poll) { if (pwait) pwait->key = pollfd->events | POLLERR | POLLHUP; |
4a4b69f79
|
700 |
mask = file->f_op->poll(file, pwait); |
4938d7e02
|
701 |
} |
4a4b69f79
|
702 703 704 |
/* Mask out unneeded events. */ mask &= pollfd->events | POLLERR | POLLHUP; fput_light(file, fput_needed); |
1da177e4c
|
705 |
} |
1da177e4c
|
706 |
} |
4a4b69f79
|
707 708 709 |
pollfd->revents = mask; return mask; |
1da177e4c
|
710 711 712 |
} static int do_poll(unsigned int nfds, struct poll_list *list, |
8ff3e8e85
|
713 |
struct poll_wqueues *wait, struct timespec *end_time) |
1da177e4c
|
714 |
{ |
1da177e4c
|
715 |
poll_table* pt = &wait->pt; |
8ff3e8e85
|
716 717 |
ktime_t expire, *to = NULL; int timed_out = 0, count = 0; |
90d6e24a3
|
718 |
unsigned long slack = 0; |
1da177e4c
|
719 |
|
9f72949f6
|
720 |
/* Optimise the no-wait case */ |
8ff3e8e85
|
721 |
if (end_time && !end_time->tv_sec && !end_time->tv_nsec) { |
1da177e4c
|
722 |
pt = NULL; |
8ff3e8e85
|
723 724 |
timed_out = 1; } |
9bf084f70
|
725 |
|
96d2ab484
|
726 |
if (end_time && !timed_out) |
231f3d393
|
727 |
slack = select_estimate_accuracy(end_time); |
90d6e24a3
|
728 |
|
1da177e4c
|
729 730 |
for (;;) { struct poll_list *walk; |
9f72949f6
|
731 |
|
4a4b69f79
|
732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 |
for (walk = list; walk != NULL; walk = walk->next) { struct pollfd * pfd, * pfd_end; pfd = walk->entries; pfd_end = pfd + walk->len; for (; pfd != pfd_end; pfd++) { /* * Fish for events. If we found one, record it * and kill the poll_table, so we don't * needlessly register any other waiters after * this. They'll get immediately deregistered * when we break out and return. */ if (do_pollfd(pfd, pt)) { count++; pt = NULL; } } |
1da177e4c
|
750 |
} |
4a4b69f79
|
751 752 753 754 |
/* * All waiters have already been registered, so don't provide * a poll_table to them on the next loop iteration. */ |
1da177e4c
|
755 |
pt = NULL; |
9bf084f70
|
756 757 758 759 760 |
if (!count) { count = wait->error; if (signal_pending(current)) count = -EINTR; } |
8ff3e8e85
|
761 |
if (count || timed_out) |
1da177e4c
|
762 |
break; |
9f72949f6
|
763 |
|
8ff3e8e85
|
764 765 766 767 768 769 770 771 |
/* * If this is the first loop and we have a timeout * given, then we convert to ktime_t and set the to * pointer to the expiry value. */ if (end_time && !to) { expire = timespec_to_ktime(*end_time); to = &expire; |
9f72949f6
|
772 |
} |
5f820f648
|
773 |
if (!poll_schedule_timeout(wait, TASK_INTERRUPTIBLE, to, slack)) |
8ff3e8e85
|
774 |
timed_out = 1; |
1da177e4c
|
775 |
} |
1da177e4c
|
776 777 |
return count; } |
70674f95c
|
778 779 |
#define N_STACK_PPS ((sizeof(stack_pps) - sizeof(struct poll_list)) / \ sizeof(struct pollfd)) |
8ff3e8e85
|
780 781 |
int do_sys_poll(struct pollfd __user *ufds, unsigned int nfds, struct timespec *end_time) |
1da177e4c
|
782 783 |
{ struct poll_wqueues table; |
252e5725c
|
784 |
int err = -EFAULT, fdcount, len, size; |
30c14e40e
|
785 786 787 788 |
/* Allocate small arguments on the stack to save memory and be faster - use long to make sure the buffer is aligned properly on 64 bit archs to avoid unaligned access */ long stack_pps[POLL_STACK_ALLOC/sizeof(long)]; |
252e5725c
|
789 790 791 |
struct poll_list *const head = (struct poll_list *)stack_pps; struct poll_list *walk = head; unsigned long todo = nfds; |
1da177e4c
|
792 |
|
d554ed895
|
793 |
if (nfds > rlimit(RLIMIT_NOFILE)) |
1da177e4c
|
794 |
return -EINVAL; |
252e5725c
|
795 796 797 798 799 800 |
len = min_t(unsigned int, nfds, N_STACK_PPS); for (;;) { walk->next = NULL; walk->len = len; if (!len) break; |
1da177e4c
|
801 |
|
252e5725c
|
802 803 804 805 806 807 808 |
if (copy_from_user(walk->entries, ufds + nfds-todo, sizeof(struct pollfd) * walk->len)) goto out_fds; todo -= walk->len; if (!todo) break; |
1da177e4c
|
809 |
|
252e5725c
|
810 811 812 813 814 |
len = min(todo, POLLFD_PER_PAGE); size = sizeof(struct poll_list) + sizeof(struct pollfd) * len; walk = walk->next = kmalloc(size, GFP_KERNEL); if (!walk) { err = -ENOMEM; |
1da177e4c
|
815 816 |
goto out_fds; } |
1da177e4c
|
817 |
} |
9f72949f6
|
818 |
|
252e5725c
|
819 |
poll_initwait(&table); |
8ff3e8e85
|
820 |
fdcount = do_poll(nfds, head, &table, end_time); |
252e5725c
|
821 |
poll_freewait(&table); |
1da177e4c
|
822 |
|
252e5725c
|
823 |
for (walk = head; walk; walk = walk->next) { |
1da177e4c
|
824 825 |
struct pollfd *fds = walk->entries; int j; |
252e5725c
|
826 827 |
for (j = 0; j < walk->len; j++, ufds++) if (__put_user(fds[j].revents, &ufds->revents)) |
1da177e4c
|
828 |
goto out_fds; |
1da177e4c
|
829 |
} |
252e5725c
|
830 |
|
1da177e4c
|
831 |
err = fdcount; |
1da177e4c
|
832 |
out_fds: |
252e5725c
|
833 834 835 836 837 |
walk = head->next; while (walk) { struct poll_list *pos = walk; walk = walk->next; kfree(pos); |
1da177e4c
|
838 |
} |
252e5725c
|
839 |
|
1da177e4c
|
840 841 |
return err; } |
9f72949f6
|
842 |
|
3075d9da0
|
843 844 |
static long do_restart_poll(struct restart_block *restart_block) { |
8ff3e8e85
|
845 846 847 |
struct pollfd __user *ufds = restart_block->poll.ufds; int nfds = restart_block->poll.nfds; struct timespec *to = NULL, end_time; |
3075d9da0
|
848 |
int ret; |
8ff3e8e85
|
849 850 851 852 853 854 855 |
if (restart_block->poll.has_timeout) { end_time.tv_sec = restart_block->poll.tv_sec; end_time.tv_nsec = restart_block->poll.tv_nsec; to = &end_time; } ret = do_sys_poll(ufds, nfds, to); |
3075d9da0
|
856 857 |
if (ret == -EINTR) { restart_block->fn = do_restart_poll; |
3075d9da0
|
858 859 860 861 |
ret = -ERESTART_RESTARTBLOCK; } return ret; } |
5a8a82b1d
|
862 863 |
SYSCALL_DEFINE3(poll, struct pollfd __user *, ufds, unsigned int, nfds, long, timeout_msecs) |
9f72949f6
|
864 |
{ |
8ff3e8e85
|
865 |
struct timespec end_time, *to = NULL; |
3075d9da0
|
866 |
int ret; |
9f72949f6
|
867 |
|
8ff3e8e85
|
868 869 870 871 |
if (timeout_msecs >= 0) { to = &end_time; poll_select_set_timeout(to, timeout_msecs / MSEC_PER_SEC, NSEC_PER_MSEC * (timeout_msecs % MSEC_PER_SEC)); |
9f72949f6
|
872 |
} |
8ff3e8e85
|
873 |
ret = do_sys_poll(ufds, nfds, to); |
3075d9da0
|
874 875 |
if (ret == -EINTR) { struct restart_block *restart_block; |
8ff3e8e85
|
876 |
|
3075d9da0
|
877 878 |
restart_block = ¤t_thread_info()->restart_block; restart_block->fn = do_restart_poll; |
8ff3e8e85
|
879 880 881 882 883 884 885 886 887 |
restart_block->poll.ufds = ufds; restart_block->poll.nfds = nfds; if (timeout_msecs >= 0) { restart_block->poll.tv_sec = end_time.tv_sec; restart_block->poll.tv_nsec = end_time.tv_nsec; restart_block->poll.has_timeout = 1; } else restart_block->poll.has_timeout = 0; |
3075d9da0
|
888 889 890 |
ret = -ERESTART_RESTARTBLOCK; } return ret; |
9f72949f6
|
891 |
} |
f3de272b8
|
892 |
#ifdef HAVE_SET_RESTORE_SIGMASK |
d4e82042c
|
893 894 895 |
SYSCALL_DEFINE5(ppoll, struct pollfd __user *, ufds, unsigned int, nfds, struct timespec __user *, tsp, const sigset_t __user *, sigmask, size_t, sigsetsize) |
9f72949f6
|
896 897 |
{ sigset_t ksigmask, sigsaved; |
8ff3e8e85
|
898 |
struct timespec ts, end_time, *to = NULL; |
9f72949f6
|
899 900 901 902 903 |
int ret; if (tsp) { if (copy_from_user(&ts, tsp, sizeof(ts))) return -EFAULT; |
8ff3e8e85
|
904 905 906 |
to = &end_time; if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec)) return -EINVAL; |
9f72949f6
|
907 908 909 910 911 912 913 914 915 916 917 918 |
} if (sigmask) { /* XXX: Don't preclude handling different sized sigset_t's. */ if (sigsetsize != sizeof(sigset_t)) return -EINVAL; if (copy_from_user(&ksigmask, sigmask, sizeof(ksigmask))) return -EFAULT; sigdelsetmask(&ksigmask, sigmask(SIGKILL)|sigmask(SIGSTOP)); sigprocmask(SIG_SETMASK, &ksigmask, &sigsaved); } |
8ff3e8e85
|
919 |
ret = do_sys_poll(ufds, nfds, to); |
9f72949f6
|
920 921 922 923 924 925 926 927 928 929 930 |
/* We can restart this syscall, usually */ if (ret == -EINTR) { /* * Don't restore the signal mask yet. Let do_signal() deliver * the signal on the way back to userspace, before the signal * mask is restored. */ if (sigmask) { memcpy(¤t->saved_sigmask, &sigsaved, sizeof(sigsaved)); |
4e4c22c71
|
931 |
set_restore_sigmask(); |
9f72949f6
|
932 933 934 935 |
} ret = -ERESTARTNOHAND; } else if (sigmask) sigprocmask(SIG_SETMASK, &sigsaved, NULL); |
8ff3e8e85
|
936 |
ret = poll_select_copy_remaining(&end_time, tsp, 0, ret); |
9f72949f6
|
937 938 939 |
return ret; } |
f3de272b8
|
940 |
#endif /* HAVE_SET_RESTORE_SIGMASK */ |