Blame view
fs/file.c
21.5 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 6 7 |
/* * linux/fs/file.c * * Copyright (C) 1998-1999, Stephen Tweedie and Bill Hawes * * Manage the dynamic fd arrays in the process files_struct. */ |
fe17f22d7 take purely descr... |
8 |
#include <linux/syscalls.h> |
630d9c472 fs: reduce the us... |
9 |
#include <linux/export.h> |
1da177e4c Linux-2.6.12-rc2 |
10 11 |
#include <linux/fs.h> #include <linux/mm.h> |
6d4831c28 vfs: avoid large ... |
12 |
#include <linux/mmzone.h> |
1da177e4c Linux-2.6.12-rc2 |
13 |
#include <linux/time.h> |
d43c36dc6 headers: remove s... |
14 |
#include <linux/sched.h> |
1da177e4c Linux-2.6.12-rc2 |
15 16 17 |
#include <linux/slab.h> #include <linux/vmalloc.h> #include <linux/file.h> |
9f3acc314 [PATCH] split lin... |
18 |
#include <linux/fdtable.h> |
1da177e4c Linux-2.6.12-rc2 |
19 |
#include <linux/bitops.h> |
ab2af1f50 [PATCH] files: fi... |
20 21 22 23 |
#include <linux/interrupt.h> #include <linux/spinlock.h> #include <linux/rcupdate.h> #include <linux/workqueue.h> |
9cfe015aa get rid of NR_OPE... |
24 |
int sysctl_nr_open __read_mostly = 1024*1024; |
eceea0b3d [PATCH] avoid mul... |
25 |
int sysctl_nr_open_min = BITS_PER_LONG; |
7f4b36f9b get rid of files_... |
26 27 28 29 |
/* our max() is unusable in constant expressions ;-/ */ #define __const_max(x, y) ((x) < (y) ? (x) : (y)) int sysctl_nr_open_max = __const_max(INT_MAX, ~(size_t)0/sizeof(void *)) & -BITS_PER_LONG; |
9cfe015aa get rid of NR_OPE... |
30 |
|
1fd36adcd Replace the fd_se... |
31 |
static void *alloc_fdmem(size_t size) |
1da177e4c Linux-2.6.12-rc2 |
32 |
{ |
6d4831c28 vfs: avoid large ... |
33 34 35 36 37 |
/* * Very large allocations can stress page reclaim, so fall back to * vmalloc() if the allocation size will be considered "large" by the VM. */ if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) { |
96c7a2ff2 fs/file.c:fdtable... |
38 |
void *data = kmalloc(size, GFP_KERNEL|__GFP_NOWARN|__GFP_NORETRY); |
6d4831c28 vfs: avoid large ... |
39 40 41 |
if (data != NULL) return data; } |
a892e2d7d vfs: use kmalloc(... |
42 |
return vmalloc(size); |
1da177e4c Linux-2.6.12-rc2 |
43 |
} |
a892e2d7d vfs: use kmalloc(... |
44 |
static void __free_fdtable(struct fdtable *fdt) |
1da177e4c Linux-2.6.12-rc2 |
45 |
{ |
f6c0a1920 fs/file.c: don't ... |
46 47 |
kvfree(fdt->fd); kvfree(fdt->open_fds); |
a892e2d7d vfs: use kmalloc(... |
48 |
kfree(fdt); |
ab2af1f50 [PATCH] files: fi... |
49 |
} |
1da177e4c Linux-2.6.12-rc2 |
50 |
|
7cf4dc3c8 move files_struct... |
51 |
static void free_fdtable_rcu(struct rcu_head *rcu) |
ab2af1f50 [PATCH] files: fi... |
52 |
{ |
ac3e3c5b1 don't bother with... |
53 |
__free_fdtable(container_of(rcu, struct fdtable, rcu)); |
ab2af1f50 [PATCH] files: fi... |
54 |
} |
ab2af1f50 [PATCH] files: fi... |
55 56 57 58 |
/* * Expand the fdset in the files_struct. Called with the files spinlock * held for write. */ |
5466b456e [PATCH] fdtable: ... |
59 |
static void copy_fdtable(struct fdtable *nfdt, struct fdtable *ofdt) |
ab2af1f50 [PATCH] files: fi... |
60 |
{ |
5466b456e [PATCH] fdtable: ... |
61 |
unsigned int cpy, set; |
ab2af1f50 [PATCH] files: fi... |
62 |
|
5466b456e [PATCH] fdtable: ... |
63 |
BUG_ON(nfdt->max_fds < ofdt->max_fds); |
5466b456e [PATCH] fdtable: ... |
64 65 66 67 68 69 70 71 72 73 74 75 |
cpy = ofdt->max_fds * sizeof(struct file *); set = (nfdt->max_fds - ofdt->max_fds) * sizeof(struct file *); memcpy(nfdt->fd, ofdt->fd, cpy); memset((char *)(nfdt->fd) + cpy, 0, set); cpy = ofdt->max_fds / BITS_PER_BYTE; set = (nfdt->max_fds - ofdt->max_fds) / BITS_PER_BYTE; memcpy(nfdt->open_fds, ofdt->open_fds, cpy); memset((char *)(nfdt->open_fds) + cpy, 0, set); memcpy(nfdt->close_on_exec, ofdt->close_on_exec, cpy); memset((char *)(nfdt->close_on_exec) + cpy, 0, set); |
1da177e4c Linux-2.6.12-rc2 |
76 |
} |
5466b456e [PATCH] fdtable: ... |
77 |
static struct fdtable * alloc_fdtable(unsigned int nr) |
1da177e4c Linux-2.6.12-rc2 |
78 |
{ |
5466b456e [PATCH] fdtable: ... |
79 |
struct fdtable *fdt; |
1fd36adcd Replace the fd_se... |
80 |
void *data; |
1da177e4c Linux-2.6.12-rc2 |
81 |
|
ab2af1f50 [PATCH] files: fi... |
82 |
/* |
5466b456e [PATCH] fdtable: ... |
83 84 85 86 87 |
* Figure out how many fds we actually want to support in this fdtable. * Allocation steps are keyed to the size of the fdarray, since it * grows far faster than any of the other dynamic data. We try to fit * the fdarray into comfortable page-tuned chunks: starting at 1024B * and growing in powers of two from there on. |
ab2af1f50 [PATCH] files: fi... |
88 |
*/ |
5466b456e [PATCH] fdtable: ... |
89 90 91 |
nr /= (1024 / sizeof(struct file *)); nr = roundup_pow_of_two(nr + 1); nr *= (1024 / sizeof(struct file *)); |
5c598b342 [PATCH] fix sysct... |
92 93 94 95 96 97 98 99 100 101 |
/* * Note that this can drive nr *below* what we had passed if sysctl_nr_open * had been set lower between the check in expand_files() and here. Deal * with that in caller, it's cheaper that way. * * We make sure that nr remains a multiple of BITS_PER_LONG - otherwise * bitmaps handling below becomes unpleasant, to put it mildly... */ if (unlikely(nr > sysctl_nr_open)) nr = ((sysctl_nr_open - 1) | (BITS_PER_LONG - 1)) + 1; |
bbea9f696 [PATCH] fdtable: ... |
102 |
|
5466b456e [PATCH] fdtable: ... |
103 104 |
fdt = kmalloc(sizeof(struct fdtable), GFP_KERNEL); if (!fdt) |
bbea9f696 [PATCH] fdtable: ... |
105 |
goto out; |
5466b456e [PATCH] fdtable: ... |
106 107 108 109 |
fdt->max_fds = nr; data = alloc_fdmem(nr * sizeof(struct file *)); if (!data) goto out_fdt; |
1fd36adcd Replace the fd_se... |
110 111 112 |
fdt->fd = data; data = alloc_fdmem(max_t(size_t, |
5466b456e [PATCH] fdtable: ... |
113 114 115 |
2 * nr / BITS_PER_BYTE, L1_CACHE_BYTES)); if (!data) goto out_arr; |
1fd36adcd Replace the fd_se... |
116 |
fdt->open_fds = data; |
5466b456e [PATCH] fdtable: ... |
117 |
data += nr / BITS_PER_BYTE; |
1fd36adcd Replace the fd_se... |
118 |
fdt->close_on_exec = data; |
5466b456e [PATCH] fdtable: ... |
119 |
|
ab2af1f50 [PATCH] files: fi... |
120 |
return fdt; |
5466b456e [PATCH] fdtable: ... |
121 122 |
out_arr: |
f6c0a1920 fs/file.c: don't ... |
123 |
kvfree(fdt->fd); |
5466b456e [PATCH] fdtable: ... |
124 |
out_fdt: |
ab2af1f50 [PATCH] files: fi... |
125 |
kfree(fdt); |
5466b456e [PATCH] fdtable: ... |
126 |
out: |
ab2af1f50 [PATCH] files: fi... |
127 128 |
return NULL; } |
1da177e4c Linux-2.6.12-rc2 |
129 |
|
ab2af1f50 [PATCH] files: fi... |
130 |
/* |
74d392aaa [PATCH] Clean up ... |
131 132 133 134 135 |
* Expand the file descriptor table. * This function will allocate a new fdtable and both fd array and fdset, of * the given size. * Return <0 error code on error; 1 on successful completion. * The files->file_lock should be held on entry, and will be held on exit. |
ab2af1f50 [PATCH] files: fi... |
136 137 138 139 140 |
*/ static int expand_fdtable(struct files_struct *files, int nr) __releases(files->file_lock) __acquires(files->file_lock) { |
74d392aaa [PATCH] Clean up ... |
141 |
struct fdtable *new_fdt, *cur_fdt; |
ab2af1f50 [PATCH] files: fi... |
142 143 |
spin_unlock(&files->file_lock); |
74d392aaa [PATCH] Clean up ... |
144 |
new_fdt = alloc_fdtable(nr); |
ab2af1f50 [PATCH] files: fi... |
145 |
spin_lock(&files->file_lock); |
74d392aaa [PATCH] Clean up ... |
146 147 |
if (!new_fdt) return -ENOMEM; |
ab2af1f50 [PATCH] files: fi... |
148 |
/* |
5c598b342 [PATCH] fix sysct... |
149 150 151 152 |
* extremely unlikely race - sysctl_nr_open decreased between the check in * caller and alloc_fdtable(). Cheaper to catch it here... */ if (unlikely(new_fdt->max_fds <= nr)) { |
a892e2d7d vfs: use kmalloc(... |
153 |
__free_fdtable(new_fdt); |
5c598b342 [PATCH] fix sysct... |
154 155 156 |
return -EMFILE; } /* |
74d392aaa [PATCH] Clean up ... |
157 158 |
* Check again since another task may have expanded the fd table while * we dropped the lock |
ab2af1f50 [PATCH] files: fi... |
159 |
*/ |
74d392aaa [PATCH] Clean up ... |
160 |
cur_fdt = files_fdtable(files); |
bbea9f696 [PATCH] fdtable: ... |
161 |
if (nr >= cur_fdt->max_fds) { |
74d392aaa [PATCH] Clean up ... |
162 163 164 |
/* Continue as planned */ copy_fdtable(new_fdt, cur_fdt); rcu_assign_pointer(files->fdt, new_fdt); |
ac3e3c5b1 don't bother with... |
165 |
if (cur_fdt != &files->fdtab) |
1983e781d trim free_fdtable... |
166 |
call_rcu(&cur_fdt->rcu, free_fdtable_rcu); |
ab2af1f50 [PATCH] files: fi... |
167 |
} else { |
74d392aaa [PATCH] Clean up ... |
168 |
/* Somebody else expanded, so undo our attempt */ |
a892e2d7d vfs: use kmalloc(... |
169 |
__free_fdtable(new_fdt); |
ab2af1f50 [PATCH] files: fi... |
170 |
} |
74d392aaa [PATCH] Clean up ... |
171 |
return 1; |
1da177e4c Linux-2.6.12-rc2 |
172 173 174 175 |
} /* * Expand files. |
74d392aaa [PATCH] Clean up ... |
176 177 178 179 180 |
* This function will expand the file structures, if the requested size exceeds * the current capacity and there is room for expansion. * Return <0 error code on error; 0 when nothing done; 1 when files were * expanded and execution may have blocked. * The files->file_lock should be held on entry, and will be held on exit. |
1da177e4c Linux-2.6.12-rc2 |
181 |
*/ |
ad47bd725 make expand_files... |
182 |
static int expand_files(struct files_struct *files, int nr) |
1da177e4c Linux-2.6.12-rc2 |
183 |
{ |
badf16621 [PATCH] files: br... |
184 |
struct fdtable *fdt; |
1da177e4c Linux-2.6.12-rc2 |
185 |
|
badf16621 [PATCH] files: br... |
186 |
fdt = files_fdtable(files); |
4e1e018ec [PATCH] fix RLIM_... |
187 |
|
74d392aaa [PATCH] Clean up ... |
188 |
/* Do we need to expand? */ |
bbea9f696 [PATCH] fdtable: ... |
189 |
if (nr < fdt->max_fds) |
74d392aaa [PATCH] Clean up ... |
190 |
return 0; |
4e1e018ec [PATCH] fix RLIM_... |
191 |
|
74d392aaa [PATCH] Clean up ... |
192 |
/* Can we expand? */ |
9cfe015aa get rid of NR_OPE... |
193 |
if (nr >= sysctl_nr_open) |
74d392aaa [PATCH] Clean up ... |
194 195 196 197 |
return -EMFILE; /* All good, so we try */ return expand_fdtable(files, nr); |
1da177e4c Linux-2.6.12-rc2 |
198 |
} |
ab2af1f50 [PATCH] files: fi... |
199 |
|
b8318b01a take __{set,clear... |
200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 |
static inline void __set_close_on_exec(int fd, struct fdtable *fdt) { __set_bit(fd, fdt->close_on_exec); } static inline void __clear_close_on_exec(int fd, struct fdtable *fdt) { __clear_bit(fd, fdt->close_on_exec); } static inline void __set_open_fd(int fd, struct fdtable *fdt) { __set_bit(fd, fdt->open_fds); } static inline void __clear_open_fd(int fd, struct fdtable *fdt) { __clear_bit(fd, fdt->open_fds); } |
02afc6267 [PATCH] dup_fd() ... |
219 220 221 222 223 224 |
static int count_open_files(struct fdtable *fdt) { int size = fdt->max_fds; int i; /* Find the last open fd */ |
1fd36adcd Replace the fd_se... |
225 226 |
for (i = size / BITS_PER_LONG; i > 0; ) { if (fdt->open_fds[--i]) |
02afc6267 [PATCH] dup_fd() ... |
227 228 |
break; } |
1fd36adcd Replace the fd_se... |
229 |
i = (i + 1) * BITS_PER_LONG; |
02afc6267 [PATCH] dup_fd() ... |
230 231 |
return i; } |
02afc6267 [PATCH] dup_fd() ... |
232 233 234 235 236 237 238 239 240 241 242 243 244 |
/* * Allocate a new files structure and copy contents from the * passed in files structure. * errorp will be valid only when the returned files_struct is NULL. */ struct files_struct *dup_fd(struct files_struct *oldf, int *errorp) { struct files_struct *newf; struct file **old_fds, **new_fds; int open_files, size, i; struct fdtable *old_fdt, *new_fdt; *errorp = -ENOMEM; |
afbec7fff [PATCH] dup_fd() ... |
245 |
newf = kmem_cache_alloc(files_cachep, GFP_KERNEL); |
02afc6267 [PATCH] dup_fd() ... |
246 247 |
if (!newf) goto out; |
afbec7fff [PATCH] dup_fd() ... |
248 249 250 251 252 253 |
atomic_set(&newf->count, 1); spin_lock_init(&newf->file_lock); newf->next_fd = 0; new_fdt = &newf->fdtab; new_fdt->max_fds = NR_OPEN_DEFAULT; |
1fd36adcd Replace the fd_se... |
254 255 |
new_fdt->close_on_exec = newf->close_on_exec_init; new_fdt->open_fds = newf->open_fds_init; |
afbec7fff [PATCH] dup_fd() ... |
256 |
new_fdt->fd = &newf->fd_array[0]; |
afbec7fff [PATCH] dup_fd() ... |
257 |
|
02afc6267 [PATCH] dup_fd() ... |
258 259 |
spin_lock(&oldf->file_lock); old_fdt = files_fdtable(oldf); |
02afc6267 [PATCH] dup_fd() ... |
260 261 262 263 |
open_files = count_open_files(old_fdt); /* * Check whether we need to allocate a larger fd array and fd set. |
02afc6267 [PATCH] dup_fd() ... |
264 |
*/ |
adbecb128 [PATCH] dup_fd() ... |
265 |
while (unlikely(open_files > new_fdt->max_fds)) { |
02afc6267 [PATCH] dup_fd() ... |
266 |
spin_unlock(&oldf->file_lock); |
9dec3c4d3 [PATCH] dup_fd() ... |
267 |
|
a892e2d7d vfs: use kmalloc(... |
268 269 |
if (new_fdt != &newf->fdtab) __free_fdtable(new_fdt); |
adbecb128 [PATCH] dup_fd() ... |
270 |
|
9dec3c4d3 [PATCH] dup_fd() ... |
271 272 273 274 275 276 277 278 |
new_fdt = alloc_fdtable(open_files - 1); if (!new_fdt) { *errorp = -ENOMEM; goto out_release; } /* beyond sysctl_nr_open; nothing to do */ if (unlikely(new_fdt->max_fds < open_files)) { |
a892e2d7d vfs: use kmalloc(... |
279 |
__free_fdtable(new_fdt); |
9dec3c4d3 [PATCH] dup_fd() ... |
280 |
*errorp = -EMFILE; |
02afc6267 [PATCH] dup_fd() ... |
281 |
goto out_release; |
9dec3c4d3 [PATCH] dup_fd() ... |
282 |
} |
9dec3c4d3 [PATCH] dup_fd() ... |
283 |
|
02afc6267 [PATCH] dup_fd() ... |
284 285 286 287 288 289 290 |
/* * Reacquire the oldf lock and a pointer to its fd table * who knows it may have a new bigger fd table. We need * the latest pointer. */ spin_lock(&oldf->file_lock); old_fdt = files_fdtable(oldf); |
adbecb128 [PATCH] dup_fd() ... |
291 |
open_files = count_open_files(old_fdt); |
02afc6267 [PATCH] dup_fd() ... |
292 293 294 295 |
} old_fds = old_fdt->fd; new_fds = new_fdt->fd; |
1fd36adcd Replace the fd_se... |
296 297 |
memcpy(new_fdt->open_fds, old_fdt->open_fds, open_files / 8); memcpy(new_fdt->close_on_exec, old_fdt->close_on_exec, open_files / 8); |
02afc6267 [PATCH] dup_fd() ... |
298 299 300 301 302 303 304 305 306 307 308 309 |
for (i = open_files; i != 0; i--) { struct file *f = *old_fds++; if (f) { get_file(f); } else { /* * The fd may be claimed in the fd bitmap but not yet * instantiated in the files array if a sibling thread * is partway through open(). So make sure that this * fd is available to the new process. */ |
1dce27c5a Wrap accesses to ... |
310 |
__clear_open_fd(open_files - i, new_fdt); |
02afc6267 [PATCH] dup_fd() ... |
311 312 313 314 315 316 317 318 319 320 321 322 |
} rcu_assign_pointer(*new_fds++, f); } spin_unlock(&oldf->file_lock); /* compute the remainder to be cleared */ size = (new_fdt->max_fds - open_files) * sizeof(struct file *); /* This is long word aligned thus could use a optimized version */ memset(new_fds, 0, size); if (new_fdt->max_fds > open_files) { |
1fd36adcd Replace the fd_se... |
323 324 |
int left = (new_fdt->max_fds - open_files) / 8; int start = open_files / BITS_PER_LONG; |
02afc6267 [PATCH] dup_fd() ... |
325 |
|
1fd36adcd Replace the fd_se... |
326 327 |
memset(&new_fdt->open_fds[start], 0, left); memset(&new_fdt->close_on_exec[start], 0, left); |
02afc6267 [PATCH] dup_fd() ... |
328 |
} |
afbec7fff [PATCH] dup_fd() ... |
329 |
rcu_assign_pointer(newf->fdt, new_fdt); |
02afc6267 [PATCH] dup_fd() ... |
330 331 332 333 334 335 336 |
return newf; out_release: kmem_cache_free(files_cachep, newf); out: return NULL; } |
ce08b62d1 change close_file... |
337 |
static struct fdtable *close_files(struct files_struct * files) |
7cf4dc3c8 move files_struct... |
338 |
{ |
7cf4dc3c8 move files_struct... |
339 340 341 |
/* * It is safe to dereference the fd table without RCU or * ->file_lock because this is the last reference to the |
ce08b62d1 change close_file... |
342 |
* files structure. |
7cf4dc3c8 move files_struct... |
343 |
*/ |
ce08b62d1 change close_file... |
344 345 |
struct fdtable *fdt = rcu_dereference_raw(files->fdt); int i, j = 0; |
7cf4dc3c8 move files_struct... |
346 347 348 349 350 351 352 353 354 355 356 |
for (;;) { unsigned long set; i = j * BITS_PER_LONG; if (i >= fdt->max_fds) break; set = fdt->open_fds[j++]; while (set) { if (set & 1) { struct file * file = xchg(&fdt->fd[i], NULL); if (file) { filp_close(file, files); |
bde6c3aa9 rcu: Provide cond... |
357 |
cond_resched_rcu_qs(); |
7cf4dc3c8 move files_struct... |
358 359 360 361 362 363 |
} } i++; set >>= 1; } } |
ce08b62d1 change close_file... |
364 365 |
return fdt; |
7cf4dc3c8 move files_struct... |
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 |
} struct files_struct *get_files_struct(struct task_struct *task) { struct files_struct *files; task_lock(task); files = task->files; if (files) atomic_inc(&files->count); task_unlock(task); return files; } void put_files_struct(struct files_struct *files) { |
7cf4dc3c8 move files_struct... |
383 |
if (atomic_dec_and_test(&files->count)) { |
ce08b62d1 change close_file... |
384 |
struct fdtable *fdt = close_files(files); |
b9e02af0a don't bother with... |
385 386 387 388 |
/* free the arrays if they are not embedded */ if (fdt != &files->fdtab) __free_fdtable(fdt); kmem_cache_free(files_cachep, files); |
7cf4dc3c8 move files_struct... |
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 |
} } void reset_files_struct(struct files_struct *files) { struct task_struct *tsk = current; struct files_struct *old; old = tsk->files; task_lock(tsk); tsk->files = files; task_unlock(tsk); put_files_struct(old); } void exit_files(struct task_struct *tsk) { struct files_struct * files = tsk->files; if (files) { task_lock(tsk); tsk->files = NULL; task_unlock(tsk); put_files_struct(files); } } |
f52111b15 [PATCH] take init... |
415 416 417 418 419 420 |
struct files_struct init_files = { .count = ATOMIC_INIT(1), .fdt = &init_files.fdtab, .fdtab = { .max_fds = NR_OPEN_DEFAULT, .fd = &init_files.fd_array[0], |
1fd36adcd Replace the fd_se... |
421 422 |
.close_on_exec = init_files.close_on_exec_init, .open_fds = init_files.open_fds_init, |
f52111b15 [PATCH] take init... |
423 |
}, |
eece09ec2 locking: Various ... |
424 |
.file_lock = __SPIN_LOCK_UNLOCKED(init_files.file_lock), |
f52111b15 [PATCH] take init... |
425 |
}; |
1027abe88 [PATCH] merge loc... |
426 427 428 429 |
/* * allocate a file descriptor, mark it busy. */ |
dcfadfa4e new helper: __all... |
430 431 |
int __alloc_fd(struct files_struct *files, unsigned start, unsigned end, unsigned flags) |
1027abe88 [PATCH] merge loc... |
432 |
{ |
1027abe88 [PATCH] merge loc... |
433 434 435 436 437 438 439 440 441 442 443 444 |
unsigned int fd; int error; struct fdtable *fdt; spin_lock(&files->file_lock); repeat: fdt = files_fdtable(files); fd = start; if (fd < files->next_fd) fd = files->next_fd; if (fd < fdt->max_fds) |
1fd36adcd Replace the fd_se... |
445 |
fd = find_next_zero_bit(fdt->open_fds, fdt->max_fds, fd); |
1027abe88 [PATCH] merge loc... |
446 |
|
f33ff9927 take rlimit check... |
447 448 449 450 451 452 453 |
/* * N.B. For clone tasks sharing a files structure, this test * will limit the total number of files that can be opened. */ error = -EMFILE; if (fd >= end) goto out; |
1027abe88 [PATCH] merge loc... |
454 455 456 457 458 459 460 461 462 463 464 465 466 |
error = expand_files(files, fd); if (error < 0) goto out; /* * If we needed to expand the fs array we * might have blocked - try again. */ if (error) goto repeat; if (start <= files->next_fd) files->next_fd = fd + 1; |
1dce27c5a Wrap accesses to ... |
467 |
__set_open_fd(fd, fdt); |
1027abe88 [PATCH] merge loc... |
468 |
if (flags & O_CLOEXEC) |
1dce27c5a Wrap accesses to ... |
469 |
__set_close_on_exec(fd, fdt); |
1027abe88 [PATCH] merge loc... |
470 |
else |
1dce27c5a Wrap accesses to ... |
471 |
__clear_close_on_exec(fd, fdt); |
1027abe88 [PATCH] merge loc... |
472 473 474 |
error = fd; #if 1 /* Sanity check */ |
add1f0995 fs: Substitute rc... |
475 |
if (rcu_access_pointer(fdt->fd[fd]) != NULL) { |
1027abe88 [PATCH] merge loc... |
476 477 478 479 480 481 482 483 484 485 |
printk(KERN_WARNING "alloc_fd: slot %d not NULL! ", fd); rcu_assign_pointer(fdt->fd[fd], NULL); } #endif out: spin_unlock(&files->file_lock); return error; } |
ad47bd725 make expand_files... |
486 |
static int alloc_fd(unsigned start, unsigned flags) |
dcfadfa4e new helper: __all... |
487 488 489 |
{ return __alloc_fd(current->files, start, rlimit(RLIMIT_NOFILE), flags); } |
1a7bd2265 make get_unused_f... |
490 |
int get_unused_fd_flags(unsigned flags) |
1027abe88 [PATCH] merge loc... |
491 |
{ |
dcfadfa4e new helper: __all... |
492 |
return __alloc_fd(current->files, 0, rlimit(RLIMIT_NOFILE), flags); |
1027abe88 [PATCH] merge loc... |
493 |
} |
1a7bd2265 make get_unused_f... |
494 |
EXPORT_SYMBOL(get_unused_fd_flags); |
56007cae9 move put_unused_f... |
495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 |
static void __put_unused_fd(struct files_struct *files, unsigned int fd) { struct fdtable *fdt = files_fdtable(files); __clear_open_fd(fd, fdt); if (fd < files->next_fd) files->next_fd = fd; } void put_unused_fd(unsigned int fd) { struct files_struct *files = current->files; spin_lock(&files->file_lock); __put_unused_fd(files, fd); spin_unlock(&files->file_lock); } EXPORT_SYMBOL(put_unused_fd); /* * Install a file pointer in the fd array. * * The VFS is full of places where we drop the files lock between * setting the open_fds bitmap and installing the file in the file * array. At any such point, we are vulnerable to a dup2() race * installing a file in the array before us. We need to detect this and * fput() the struct file we are about to overwrite in this case. * * It should never happen - if we allow dup2() do it, _really_ bad things * will follow. |
f869e8a7f expose a low-leve... |
525 526 527 528 529 530 531 |
* * NOTE: __fd_install() variant is really, really low-level; don't * use it unless you are forced to by truly lousy API shoved down * your throat. 'files' *MUST* be either current->files or obtained * by get_files_struct(current) done by whoever had given it to you, * or really bad things will happen. Normally you want to use * fd_install() instead. |
56007cae9 move put_unused_f... |
532 |
*/ |
f869e8a7f expose a low-leve... |
533 534 |
void __fd_install(struct files_struct *files, unsigned int fd, struct file *file) |
56007cae9 move put_unused_f... |
535 |
{ |
56007cae9 move put_unused_f... |
536 537 538 539 540 541 542 |
struct fdtable *fdt; spin_lock(&files->file_lock); fdt = files_fdtable(files); BUG_ON(fdt->fd[fd] != NULL); rcu_assign_pointer(fdt->fd[fd], file); spin_unlock(&files->file_lock); } |
f869e8a7f expose a low-leve... |
543 544 545 546 |
void fd_install(unsigned int fd, struct file *file) { __fd_install(current->files, fd, file); } |
56007cae9 move put_unused_f... |
547 |
EXPORT_SYMBOL(fd_install); |
0ee8cdfe6 take fget() and f... |
548 |
|
483ce1d4b take descriptor-r... |
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 |
/* * The same warnings as for __alloc_fd()/__fd_install() apply here... */ int __close_fd(struct files_struct *files, unsigned fd) { struct file *file; struct fdtable *fdt; spin_lock(&files->file_lock); fdt = files_fdtable(files); if (fd >= fdt->max_fds) goto out_unlock; file = fdt->fd[fd]; if (!file) goto out_unlock; rcu_assign_pointer(fdt->fd[fd], NULL); __clear_close_on_exec(fd, fdt); __put_unused_fd(files, fd); spin_unlock(&files->file_lock); return filp_close(file, files); out_unlock: spin_unlock(&files->file_lock); return -EBADF; } |
6a6d27de3 take close-on-exe... |
574 575 576 577 578 579 |
void do_close_on_exec(struct files_struct *files) { unsigned i; struct fdtable *fdt; /* exec unshares first */ |
6a6d27de3 take close-on-exe... |
580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 |
spin_lock(&files->file_lock); for (i = 0; ; i++) { unsigned long set; unsigned fd = i * BITS_PER_LONG; fdt = files_fdtable(files); if (fd >= fdt->max_fds) break; set = fdt->close_on_exec[i]; if (!set) continue; fdt->close_on_exec[i] = 0; for ( ; set ; fd++, set >>= 1) { struct file *file; if (!(set & 1)) continue; file = fdt->fd[fd]; if (!file) continue; rcu_assign_pointer(fdt->fd[fd], NULL); __put_unused_fd(files, fd); spin_unlock(&files->file_lock); filp_close(file, files); cond_resched(); spin_lock(&files->file_lock); } } spin_unlock(&files->file_lock); } |
1deb46e25 fs: factor out co... |
609 |
static struct file *__fget(unsigned int fd, fmode_t mask) |
0ee8cdfe6 take fget() and f... |
610 |
{ |
0ee8cdfe6 take fget() and f... |
611 |
struct files_struct *files = current->files; |
1deb46e25 fs: factor out co... |
612 |
struct file *file; |
0ee8cdfe6 take fget() and f... |
613 614 615 616 617 |
rcu_read_lock(); file = fcheck_files(files, fd); if (file) { /* File object ref couldn't be taken */ |
1deb46e25 fs: factor out co... |
618 |
if ((file->f_mode & mask) || |
0ee8cdfe6 take fget() and f... |
619 620 621 622 623 624 625 |
!atomic_long_inc_not_zero(&file->f_count)) file = NULL; } rcu_read_unlock(); return file; } |
1deb46e25 fs: factor out co... |
626 627 628 629 |
struct file *fget(unsigned int fd) { return __fget(fd, FMODE_PATH); } |
0ee8cdfe6 take fget() and f... |
630 631 632 633 |
EXPORT_SYMBOL(fget); struct file *fget_raw(unsigned int fd) { |
1deb46e25 fs: factor out co... |
634 |
return __fget(fd, 0); |
0ee8cdfe6 take fget() and f... |
635 |
} |
0ee8cdfe6 take fget() and f... |
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 |
EXPORT_SYMBOL(fget_raw); /* * Lightweight file lookup - no refcnt increment if fd table isn't shared. * * You can use this instead of fget if you satisfy all of the following * conditions: * 1) You must call fput_light before exiting the syscall and returning control * to userspace (i.e. you cannot remember the returned struct file * after * returning to userspace). * 2) You must not call filp_close on the returned struct file * in between * calls to fget_light and fput_light. * 3) You must not clone the current task in between the calls to fget_light * and fput_light. * * The fput_needed flag returned by fget_light should be passed to the * corresponding fput_light. */ |
bd2a31d52 get rid of fget_l... |
654 |
static unsigned long __fget_light(unsigned int fd, fmode_t mask) |
0ee8cdfe6 take fget() and f... |
655 |
{ |
0ee8cdfe6 take fget() and f... |
656 |
struct files_struct *files = current->files; |
ad4618344 fs: factor out co... |
657 |
struct file *file; |
0ee8cdfe6 take fget() and f... |
658 |
|
0ee8cdfe6 take fget() and f... |
659 |
if (atomic_read(&files->count) == 1) { |
a8d4b8345 introduce __fchec... |
660 |
file = __fcheck_files(files, fd); |
bd2a31d52 get rid of fget_l... |
661 662 663 |
if (!file || unlikely(file->f_mode & mask)) return 0; return (unsigned long)file; |
0ee8cdfe6 take fget() and f... |
664 |
} else { |
e6ff9a9fa fs: __fget_light(... |
665 |
file = __fget(fd, mask); |
bd2a31d52 get rid of fget_l... |
666 667 668 |
if (!file) return 0; return FDPUT_FPUT | (unsigned long)file; |
0ee8cdfe6 take fget() and f... |
669 |
} |
0ee8cdfe6 take fget() and f... |
670 |
} |
bd2a31d52 get rid of fget_l... |
671 |
unsigned long __fdget(unsigned int fd) |
ad4618344 fs: factor out co... |
672 |
{ |
bd2a31d52 get rid of fget_l... |
673 |
return __fget_light(fd, FMODE_PATH); |
ad4618344 fs: factor out co... |
674 |
} |
bd2a31d52 get rid of fget_l... |
675 |
EXPORT_SYMBOL(__fdget); |
0ee8cdfe6 take fget() and f... |
676 |
|
bd2a31d52 get rid of fget_l... |
677 |
unsigned long __fdget_raw(unsigned int fd) |
0ee8cdfe6 take fget() and f... |
678 |
{ |
bd2a31d52 get rid of fget_l... |
679 |
return __fget_light(fd, 0); |
0ee8cdfe6 take fget() and f... |
680 |
} |
fe17f22d7 take purely descr... |
681 |
|
bd2a31d52 get rid of fget_l... |
682 683 |
unsigned long __fdget_pos(unsigned int fd) { |
99aea6813 vfs: Don't let __... |
684 685 |
unsigned long v = __fdget(fd); struct file *file = (struct file *)(v & ~3); |
bd2a31d52 get rid of fget_l... |
686 |
|
99aea6813 vfs: Don't let __... |
687 |
if (file && (file->f_mode & FMODE_ATOMIC_POS)) { |
bd2a31d52 get rid of fget_l... |
688 689 690 691 692 |
if (file_count(file) > 1) { v |= FDPUT_POS_UNLOCK; mutex_lock(&file->f_pos_lock); } } |
99aea6813 vfs: Don't let __... |
693 |
return v; |
bd2a31d52 get rid of fget_l... |
694 695 696 697 698 699 700 |
} /* * We only lock f_pos if we have threads or if the file might be * shared with another process. In both cases we'll have an elevated * file count (done either by fdget() or by fork()). */ |
fe17f22d7 take purely descr... |
701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 |
void set_close_on_exec(unsigned int fd, int flag) { struct files_struct *files = current->files; struct fdtable *fdt; spin_lock(&files->file_lock); fdt = files_fdtable(files); if (flag) __set_close_on_exec(fd, fdt); else __clear_close_on_exec(fd, fdt); spin_unlock(&files->file_lock); } bool get_close_on_exec(unsigned int fd) { struct files_struct *files = current->files; struct fdtable *fdt; bool res; rcu_read_lock(); fdt = files_fdtable(files); res = close_on_exec(fd, fdt); rcu_read_unlock(); return res; } |
8280d1617 new helper: repla... |
725 726 |
static int do_dup2(struct files_struct *files, struct file *file, unsigned fd, unsigned flags) |
e983094d6 missing annotatio... |
727 |
__releases(&files->file_lock) |
fe17f22d7 take purely descr... |
728 |
{ |
8280d1617 new helper: repla... |
729 |
struct file *tofree; |
fe17f22d7 take purely descr... |
730 |
struct fdtable *fdt; |
fe17f22d7 take purely descr... |
731 732 733 734 735 736 737 738 739 740 741 742 743 744 |
/* * We need to detect attempts to do dup2() over allocated but still * not finished descriptor. NB: OpenBSD avoids that at the price of * extra work in their equivalent of fget() - they insert struct * file immediately after grabbing descriptor, mark it larval if * more work (e.g. actual opening) is needed and make sure that * fget() treats larval files as absent. Potentially interesting, * but while extra work in fget() is trivial, locking implications * and amount of surgery on open()-related paths in VFS are not. * FreeBSD fails with -EBADF in the same situation, NetBSD "solution" * deadlocks in rather amusing ways, AFAICS. All of that is out of * scope of POSIX or SUS, since neither considers shared descriptor * tables and this condition does not arise without those. */ |
fe17f22d7 take purely descr... |
745 |
fdt = files_fdtable(files); |
8280d1617 new helper: repla... |
746 747 748 |
tofree = fdt->fd[fd]; if (!tofree && fd_is_open(fd, fdt)) goto Ebusy; |
fe17f22d7 take purely descr... |
749 |
get_file(file); |
8280d1617 new helper: repla... |
750 751 |
rcu_assign_pointer(fdt->fd[fd], file); __set_open_fd(fd, fdt); |
fe17f22d7 take purely descr... |
752 |
if (flags & O_CLOEXEC) |
8280d1617 new helper: repla... |
753 |
__set_close_on_exec(fd, fdt); |
fe17f22d7 take purely descr... |
754 |
else |
8280d1617 new helper: repla... |
755 |
__clear_close_on_exec(fd, fdt); |
fe17f22d7 take purely descr... |
756 757 758 759 |
spin_unlock(&files->file_lock); if (tofree) filp_close(tofree, files); |
8280d1617 new helper: repla... |
760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 |
return fd; Ebusy: spin_unlock(&files->file_lock); return -EBUSY; } int replace_fd(unsigned fd, struct file *file, unsigned flags) { int err; struct files_struct *files = current->files; if (!file) return __close_fd(files, fd); if (fd >= rlimit(RLIMIT_NOFILE)) |
08f05c497 Return the right ... |
776 |
return -EBADF; |
8280d1617 new helper: repla... |
777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 |
spin_lock(&files->file_lock); err = expand_files(files, fd); if (unlikely(err < 0)) goto out_unlock; return do_dup2(files, file, fd, flags); out_unlock: spin_unlock(&files->file_lock); return err; } SYSCALL_DEFINE3(dup3, unsigned int, oldfd, unsigned int, newfd, int, flags) { int err = -EBADF; struct file *file; struct files_struct *files = current->files; if ((flags & ~O_CLOEXEC) != 0) return -EINVAL; |
aed976475 dup3: Return an e... |
797 798 |
if (unlikely(oldfd == newfd)) return -EINVAL; |
8280d1617 new helper: repla... |
799 |
if (newfd >= rlimit(RLIMIT_NOFILE)) |
08f05c497 Return the right ... |
800 |
return -EBADF; |
8280d1617 new helper: repla... |
801 802 803 804 805 806 807 808 809 810 811 812 |
spin_lock(&files->file_lock); err = expand_files(files, newfd); file = fcheck(oldfd); if (unlikely(!file)) goto Ebadf; if (unlikely(err < 0)) { if (err == -EMFILE) goto Ebadf; goto out_unlock; } return do_dup2(files, file, newfd, flags); |
fe17f22d7 take purely descr... |
813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 |
Ebadf: err = -EBADF; out_unlock: spin_unlock(&files->file_lock); return err; } SYSCALL_DEFINE2(dup2, unsigned int, oldfd, unsigned int, newfd) { if (unlikely(newfd == oldfd)) { /* corner case */ struct files_struct *files = current->files; int retval = oldfd; rcu_read_lock(); if (!fcheck_files(files, oldfd)) retval = -EBADF; rcu_read_unlock(); return retval; } return sys_dup3(oldfd, newfd, 0); } SYSCALL_DEFINE1(dup, unsigned int, fildes) { int ret = -EBADF; struct file *file = fget_raw(fildes); if (file) { |
8d10a0358 fs/file.c: replac... |
842 |
ret = get_unused_fd_flags(0); |
fe17f22d7 take purely descr... |
843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 |
if (ret >= 0) fd_install(ret, file); else fput(file); } return ret; } int f_dupfd(unsigned int from, struct file *file, unsigned flags) { int err; if (from >= rlimit(RLIMIT_NOFILE)) return -EINVAL; err = alloc_fd(from, flags); if (err >= 0) { get_file(file); fd_install(err, file); } return err; } |
c3c073f80 new helper: itera... |
863 864 865 866 867 868 |
int iterate_fd(struct files_struct *files, unsigned n, int (*f)(const void *, struct file *, unsigned), const void *p) { struct fdtable *fdt; |
c3c073f80 new helper: itera... |
869 870 871 872 |
int res = 0; if (!files) return 0; spin_lock(&files->file_lock); |
a77cfcb42 fix off-by-one in... |
873 874 875 876 877 878 879 880 |
for (fdt = files_fdtable(files); n < fdt->max_fds; n++) { struct file *file; file = rcu_dereference_check_fdtable(files, fdt->fd[n]); if (!file) continue; res = f(p, file, n); if (res) break; |
c3c073f80 new helper: itera... |
881 882 883 884 885 |
} spin_unlock(&files->file_lock); return res; } EXPORT_SYMBOL(iterate_fd); |