Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 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 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 | /* * This file contains the procedures for the handling of select * * Created for Linux based loosely upon Mathius Lattner's minix * patches by Peter MacDonald. Heavily edited by Linus. */ #include <linux/types.h> #include <linux/time.h> #include <linux/fs.h> #include <linux/kernel.h> #include <linux/sched.h> #include <linux/string.h> #include <linux/stat.h> #include <linux/signal.h> #include <linux/errno.h> #include <asm/segment.h> #include <asm/system.h> #define ROUND_UP(x,y) (((x)+(y)-1)/(y)) /* * 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, select_wait() and free_wait() make all the work. * select_wait() is a inline-function defined in <linux/sched.h>, as all select * functions have to call it to add an entry to the select table. */ /* * I rewrote this again to make the select_table size variable, take some * more shortcuts, improve responsiveness, and remove another race that * Linus noticed. -- jrs */ static void free_wait(select_table * p) { struct select_table_entry * entry = p->entry + p->nr; while (p->nr > 0) { p->nr--; entry--; remove_wait_queue(entry->wait_address,&entry->wait); } } /* * The check function checks the ready status of a file using the vfs layer. * * If the file was not ready we were added to its wait queue. But in * case it became ready just after the check and just before it called * select_wait, we call it again, knowing we are already on its * wait queue this time. The second call is not necessary if the * select_table is NULL indicating an earlier file check was ready * and we aren't going to sleep on the select_table. -- jrs */ static int check(int flag, select_table * wait, struct file * file) { struct inode * inode; struct file_operations *fops; int (*select) (struct inode *, struct file *, int, select_table *); inode = file->f_inode; if ((fops = file->f_op) && (select = fops->select)) return select(inode, file, flag, wait) || (wait && select(inode, file, flag, NULL)); if (S_ISREG(inode->i_mode)) return 1; return 0; } static int do_select(int n, fd_set *in, fd_set *out, fd_set *ex, fd_set *res_in, fd_set *res_out, fd_set *res_ex) { int count; select_table wait_table, *wait; struct select_table_entry *entry; unsigned long set; int i,j; int max = -1; for (j = 0 ; j < __FDSET_LONGS ; j++) { i = j << 5; if (i >= n) break; set = in->fds_bits[j] | out->fds_bits[j] | ex->fds_bits[j]; for ( ; set ; i++,set >>= 1) { if (i >= n) goto end_check; if (!(set & 1)) continue; if (!current->filp[i]) return -EBADF; if (!current->filp[i]->f_inode) return -EBADF; max = i; } } end_check: n = max + 1; if(!(entry = (struct select_table_entry*) __get_free_page(GFP_KERNEL))) return -ENOMEM; FD_ZERO(res_in); FD_ZERO(res_out); FD_ZERO(res_ex); count = 0; wait_table.nr = 0; wait_table.entry = entry; wait = &wait_table; repeat: current->state = TASK_INTERRUPTIBLE; for (i = 0 ; i < n ; i++) { if (FD_ISSET(i,in) && check(SEL_IN,wait,current->filp[i])) { FD_SET(i, res_in); count++; wait = NULL; } if (FD_ISSET(i,out) && check(SEL_OUT,wait,current->filp[i])) { FD_SET(i, res_out); count++; wait = NULL; } if (FD_ISSET(i,ex) && check(SEL_EX,wait,current->filp[i])) { FD_SET(i, res_ex); count++; wait = NULL; } } wait = NULL; if (!count && current->timeout && !(current->signal & ~current->blocked)) { schedule(); goto repeat; } free_wait(&wait_table); free_page((unsigned long) entry); current->state = TASK_RUNNING; return count; } /* * We do a VERIFY_WRITE here even though we are only reading this time: * we'll write to it eventually.. */ static int __get_fd_set(int nr, unsigned long * fs_pointer, unsigned long * fdset) { int error; FD_ZERO(fdset); if (!fs_pointer) return 0; error = verify_area(VERIFY_WRITE,fs_pointer,sizeof(fd_set)); if (error) return error; while (nr > 0) { *fdset = get_fs_long(fs_pointer); fdset++; fs_pointer++; nr -= 32; } return 0; } static void __set_fd_set(int nr, unsigned long * fs_pointer, unsigned long * fdset) { if (!fs_pointer) return; while (nr > 0) { put_fs_long(*fdset, fs_pointer); fdset++; fs_pointer++; nr -= 32; } } #define get_fd_set(nr,fsp,fdp) \ __get_fd_set(nr, (unsigned long *) (fsp), (unsigned long *) (fdp)) #define set_fd_set(nr,fsp,fdp) \ __set_fd_set(nr, (unsigned long *) (fsp), (unsigned long *) (fdp)) /* * We can actually return ERESTARTSYS insetad 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. */ asmlinkage int sys_select( unsigned long *buffer ) { /* Perform the select(nd, in, out, ex, tv) system call. */ int i; fd_set res_in, in, *inp; fd_set res_out, out, *outp; fd_set res_ex, ex, *exp; int n; struct timeval *tvp; unsigned long timeout; i = verify_area(VERIFY_READ, buffer, 20); if (i) return i; n = get_fs_long(buffer++); if (n < 0) return -EINVAL; if (n > NR_OPEN) n = NR_OPEN; inp = (fd_set *) get_fs_long(buffer++); outp = (fd_set *) get_fs_long(buffer++); exp = (fd_set *) get_fs_long(buffer++); tvp = (struct timeval *) get_fs_long(buffer); if ((i = get_fd_set(n, inp, &in)) || (i = get_fd_set(n, outp, &out)) || (i = get_fd_set(n, exp, &ex))) return i; timeout = ~0UL; if (tvp) { i = verify_area(VERIFY_WRITE, tvp, sizeof(*tvp)); if (i) return i; timeout = ROUND_UP(get_fs_long((unsigned long *)&tvp->tv_usec),(1000000/HZ)); timeout += get_fs_long((unsigned long *)&tvp->tv_sec) * HZ; if (timeout) timeout += jiffies + 1; } current->timeout = timeout; i = do_select(n, &in, &out, &ex, &res_in, &res_out, &res_ex); if (current->timeout > jiffies) timeout = current->timeout - jiffies; else timeout = 0; current->timeout = 0; if (tvp) { put_fs_long(timeout/HZ, (unsigned long *) &tvp->tv_sec); timeout %= HZ; timeout *= (1000000/HZ); put_fs_long(timeout, (unsigned long *) &tvp->tv_usec); } if (i < 0) return i; if (!i && (current->signal & ~current->blocked)) return -ERESTARTNOHAND; set_fd_set(n, inp, &res_in); set_fd_set(n, outp, &res_out); set_fd_set(n, exp, &res_ex); return i; } |