2 * Server-side file descriptor management
4 * Copyright (C) 2000, 2003 Alexandre Julliard
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
23 #include "wine/port.h"
37 #ifdef HAVE_SYS_POLL_H
40 #ifdef HAVE_LINUX_MAJOR_H
41 #include <linux/major.h>
43 #ifdef HAVE_SYS_STATVFS_H
44 #include <sys/statvfs.h>
49 #ifdef HAVE_SYS_PARAM_H
50 #include <sys/param.h>
52 #ifdef HAVE_SYS_MOUNT_H
53 #include <sys/mount.h>
55 #ifdef HAVE_SYS_STATFS_H
56 #include <sys/statfs.h>
58 #ifdef HAVE_SYS_EVENT_H
59 #include <sys/event.h>
68 #include <sys/types.h>
72 #define WIN32_NO_STATUS
81 #if defined(HAVE_SYS_EPOLL_H) && defined(HAVE_EPOLL_CREATE)
82 # include <sys/epoll.h>
84 #elif defined(linux) && defined(__i386__) && defined(HAVE_STDINT_H)
86 # define EPOLLIN POLLIN
87 # define EPOLLOUT POLLOUT
88 # define EPOLLERR POLLERR
89 # define EPOLLHUP POLLHUP
90 # define EPOLL_CTL_ADD 1
91 # define EPOLL_CTL_DEL 2
92 # define EPOLL_CTL_MOD 3
94 typedef union epoll_data
108 #define SYSCALL_RET(ret) do { \
109 if (ret < 0) { errno = -ret; ret = -1; } \
113 static inline int epoll_create( int size
)
116 __asm__( "pushl %%ebx; movl %2,%%ebx; int $0x80; popl %%ebx"
117 : "=a" (ret
) : "0" (254 /*NR_epoll_create*/), "r" (size
) );
121 static inline int epoll_ctl( int epfd
, int op
, int fd
, const struct epoll_event
*event
)
124 __asm__( "pushl %%ebx; movl %2,%%ebx; int $0x80; popl %%ebx"
126 : "0" (255 /*NR_epoll_ctl*/), "r" (epfd
), "c" (op
), "d" (fd
), "S" (event
), "m" (*event
) );
130 static inline int epoll_wait( int epfd
, struct epoll_event
*events
, int maxevents
, int timeout
)
133 __asm__( "pushl %%ebx; movl %2,%%ebx; int $0x80; popl %%ebx"
135 : "0" (256 /*NR_epoll_wait*/), "r" (epfd
), "c" (events
), "d" (maxevents
), "S" (timeout
)
141 #endif /* linux && __i386__ && HAVE_STDINT_H */
144 /* Because of the stupid Posix locking semantics, we need to keep
145 * track of all file descriptors referencing a given file, and not
146 * close a single one until all the locks are gone (sigh).
149 /* file descriptor object */
151 /* closed_fd is used to keep track of the unix fd belonging to a closed fd object */
154 struct list entry
; /* entry in inode closed list */
155 int unix_fd
; /* the unix file descriptor */
156 char unlink
[1]; /* name to unlink on close (if any) */
161 struct object obj
; /* object header */
162 const struct fd_ops
*fd_ops
; /* file descriptor operations */
163 struct inode
*inode
; /* inode that this fd belongs to */
164 struct list inode_entry
; /* entry in inode fd list */
165 struct closed_fd
*closed
; /* structure to store the unix fd at destroy time */
166 struct object
*user
; /* object using this file descriptor */
167 struct list locks
; /* list of locks on this fd */
168 unsigned int access
; /* file access (FILE_READ_DATA etc.) */
169 unsigned int sharing
; /* file sharing mode */
170 int unix_fd
; /* unix file descriptor */
171 int signaled
:1; /* is the fd signaled? */
172 int fs_locks
:1; /* can we use filesystem locks for this fd? */
173 int unmounted
:1;/* has the device been unmounted? */
174 int poll_index
; /* index of fd in poll array */
175 struct async_queue
*read_q
; /* async readers of this fd */
176 struct async_queue
*write_q
; /* async writers of this fd */
177 struct async_queue
*wait_q
; /* other async waiters of this fd */
180 static void fd_dump( struct object
*obj
, int verbose
);
181 static void fd_destroy( struct object
*obj
);
183 static const struct object_ops fd_ops
=
185 sizeof(struct fd
), /* size */
187 no_add_queue
, /* add_queue */
188 NULL
, /* remove_queue */
190 NULL
, /* satisfied */
191 no_signal
, /* signal */
192 no_get_fd
, /* get_fd */
193 no_map_access
, /* map_access */
194 no_lookup_name
, /* lookup_name */
195 no_open_file
, /* open_file */
196 no_close_handle
, /* close_handle */
197 fd_destroy
/* destroy */
202 #define DEVICE_HASH_SIZE 7
203 #define INODE_HASH_SIZE 17
207 struct object obj
; /* object header */
208 struct list entry
; /* entry in device hash list */
209 dev_t dev
; /* device number */
210 int removable
; /* removable device? (or -1 if unknown) */
211 struct list inode_hash
[INODE_HASH_SIZE
]; /* inodes hash table */
214 static void device_dump( struct object
*obj
, int verbose
);
215 static void device_destroy( struct object
*obj
);
217 static const struct object_ops device_ops
=
219 sizeof(struct device
), /* size */
220 device_dump
, /* dump */
221 no_add_queue
, /* add_queue */
222 NULL
, /* remove_queue */
224 NULL
, /* satisfied */
225 no_signal
, /* signal */
226 no_get_fd
, /* get_fd */
227 no_map_access
, /* map_access */
228 no_lookup_name
, /* lookup_name */
229 no_open_file
, /* open_file */
230 no_close_handle
, /* close_handle */
231 device_destroy
/* destroy */
238 struct object obj
; /* object header */
239 struct list entry
; /* inode hash list entry */
240 struct device
*device
; /* device containing this inode */
241 ino_t ino
; /* inode number */
242 struct list open
; /* list of open file descriptors */
243 struct list locks
; /* list of file locks */
244 struct list closed
; /* list of file descriptors to close at destroy time */
247 static void inode_dump( struct object
*obj
, int verbose
);
248 static void inode_destroy( struct object
*obj
);
250 static const struct object_ops inode_ops
=
252 sizeof(struct inode
), /* size */
253 inode_dump
, /* dump */
254 no_add_queue
, /* add_queue */
255 NULL
, /* remove_queue */
257 NULL
, /* satisfied */
258 no_signal
, /* signal */
259 no_get_fd
, /* get_fd */
260 no_map_access
, /* map_access */
261 no_lookup_name
, /* lookup_name */
262 no_open_file
, /* open_file */
263 no_close_handle
, /* close_handle */
264 inode_destroy
/* destroy */
267 /* file lock object */
271 struct object obj
; /* object header */
272 struct fd
*fd
; /* fd owning this lock */
273 struct list fd_entry
; /* entry in list of locks on a given fd */
274 struct list inode_entry
; /* entry in inode list of locks */
275 int shared
; /* shared lock? */
276 file_pos_t start
; /* locked region is interval [start;end) */
278 struct process
*process
; /* process owning this lock */
279 struct list proc_entry
; /* entry in list of locks owned by the process */
282 static void file_lock_dump( struct object
*obj
, int verbose
);
283 static int file_lock_signaled( struct object
*obj
, struct thread
*thread
);
285 static const struct object_ops file_lock_ops
=
287 sizeof(struct file_lock
), /* size */
288 file_lock_dump
, /* dump */
289 add_queue
, /* add_queue */
290 remove_queue
, /* remove_queue */
291 file_lock_signaled
, /* signaled */
292 no_satisfied
, /* satisfied */
293 no_signal
, /* signal */
294 no_get_fd
, /* get_fd */
295 no_map_access
, /* map_access */
296 no_lookup_name
, /* lookup_name */
297 no_open_file
, /* open_file */
298 no_close_handle
, /* close_handle */
299 no_destroy
/* destroy */
303 #define OFF_T_MAX (~((file_pos_t)1 << (8*sizeof(off_t)-1)))
304 #define FILE_POS_T_MAX (~(file_pos_t)0)
306 static file_pos_t max_unix_offset
= OFF_T_MAX
;
308 #define DUMP_LONG_LONG(val) do { \
309 if (sizeof(val) > sizeof(unsigned long) && (val) > ~0UL) \
310 fprintf( stderr, "%lx%08lx", (unsigned long)((unsigned long long)(val) >> 32), (unsigned long)(val) ); \
312 fprintf( stderr, "%lx", (unsigned long)(val) ); \
317 /****************************************************************/
318 /* timeouts support */
322 struct list entry
; /* entry in sorted timeout list */
323 struct timeval when
; /* timeout expiry (absolute time) */
324 timeout_callback callback
; /* callback function */
325 void *private; /* callback private data */
328 static struct list timeout_list
= LIST_INIT(timeout_list
); /* sorted timeouts list */
329 struct timeval current_time
;
331 /* add a timeout user */
332 struct timeout_user
*add_timeout_user( const struct timeval
*when
, timeout_callback func
,
335 struct timeout_user
*user
;
338 if (!(user
= mem_alloc( sizeof(*user
) ))) return NULL
;
340 user
->callback
= func
;
341 user
->private = private;
343 /* Now insert it in the linked list */
345 LIST_FOR_EACH( ptr
, &timeout_list
)
347 struct timeout_user
*timeout
= LIST_ENTRY( ptr
, struct timeout_user
, entry
);
348 if (!time_before( &timeout
->when
, when
)) break;
350 list_add_before( ptr
, &user
->entry
);
354 /* remove a timeout user */
355 void remove_timeout_user( struct timeout_user
*user
)
357 list_remove( &user
->entry
);
361 /* add a timeout in milliseconds to an absolute time */
362 void add_timeout( struct timeval
*when
, int timeout
)
366 long sec
= timeout
/ 1000;
367 if ((when
->tv_usec
+= (timeout
- 1000*sec
) * 1000) >= 1000000)
369 when
->tv_usec
-= 1000000;
377 /****************************************************************/
380 static struct fd
**poll_users
; /* users array */
381 static struct pollfd
*pollfd
; /* poll fd array */
382 static int nb_users
; /* count of array entries actually in use */
383 static int active_users
; /* current number of active users */
384 static int allocated_users
; /* count of allocated entries in the array */
385 static struct fd
**freelist
; /* list of free entries in the array */
387 static int get_next_timeout(void);
391 static int epoll_fd
= -1;
393 static inline void init_epoll(void)
395 epoll_fd
= epoll_create( 128 );
398 /* set the events that epoll waits for on this fd; helper for set_fd_events */
399 static inline void set_fd_epoll_events( struct fd
*fd
, int user
, int events
)
401 struct epoll_event ev
;
404 if (epoll_fd
== -1) return;
406 if (events
== -1) /* stop waiting on this fd completely */
408 if (pollfd
[user
].fd
== -1) return; /* already removed */
411 else if (pollfd
[user
].fd
== -1)
413 if (pollfd
[user
].events
) return; /* stopped waiting on it, don't restart */
418 if (pollfd
[user
].events
== events
) return; /* nothing to do */
423 memset(&ev
.data
, 0, sizeof(ev
.data
));
426 if (epoll_ctl( epoll_fd
, ctl
, fd
->unix_fd
, &ev
) == -1)
428 if (errno
== ENOMEM
) /* not enough memory, give up on epoll */
433 else perror( "epoll_ctl" ); /* should not happen */
437 static inline void remove_epoll_user( struct fd
*fd
, int user
)
439 if (epoll_fd
== -1) return;
441 if (pollfd
[user
].fd
!= -1)
443 struct epoll_event dummy
;
444 epoll_ctl( epoll_fd
, EPOLL_CTL_DEL
, fd
->unix_fd
, &dummy
);
448 static inline void main_loop_epoll(void)
451 struct epoll_event events
[128];
453 assert( POLLIN
== EPOLLIN
);
454 assert( POLLOUT
== EPOLLOUT
);
455 assert( POLLERR
== EPOLLERR
);
456 assert( POLLHUP
== EPOLLHUP
);
458 if (epoll_fd
== -1) return;
462 timeout
= get_next_timeout();
464 if (!active_users
) break; /* last user removed by a timeout */
465 if (epoll_fd
== -1) break; /* an error occurred with epoll */
467 ret
= epoll_wait( epoll_fd
, events
, sizeof(events
)/sizeof(events
[0]), timeout
);
468 gettimeofday( ¤t_time
, NULL
);
470 /* put the events into the pollfd array first, like poll does */
471 for (i
= 0; i
< ret
; i
++)
473 int user
= events
[i
].data
.u32
;
474 pollfd
[user
].revents
= events
[i
].events
;
477 /* read events from the pollfd array, as set_fd_events may modify them */
478 for (i
= 0; i
< ret
; i
++)
480 int user
= events
[i
].data
.u32
;
481 if (pollfd
[user
].revents
) fd_poll_event( poll_users
[user
], pollfd
[user
].revents
);
486 #elif defined(HAVE_KQUEUE)
488 static int kqueue_fd
= -1;
490 static inline void init_epoll(void)
492 #ifndef __APPLE__ /* kqueue support is broken in the MacOS kernel so we can't use it */
493 kqueue_fd
= kqueue();
497 static inline void set_fd_epoll_events( struct fd
*fd
, int user
, int events
)
501 if (kqueue_fd
== -1) return;
503 EV_SET( &ev
[0], fd
->unix_fd
, EVFILT_READ
, 0, NOTE_LOWAT
, 1, (void *)user
);
504 EV_SET( &ev
[1], fd
->unix_fd
, EVFILT_WRITE
, 0, NOTE_LOWAT
, 1, (void *)user
);
506 if (events
== -1) /* stop waiting on this fd completely */
508 if (pollfd
[user
].fd
== -1) return; /* already removed */
509 ev
[0].flags
|= EV_DELETE
;
510 ev
[1].flags
|= EV_DELETE
;
512 else if (pollfd
[user
].fd
== -1)
514 if (pollfd
[user
].events
) return; /* stopped waiting on it, don't restart */
515 ev
[0].flags
|= EV_ADD
| ((events
& POLLIN
) ? EV_ENABLE
: EV_DISABLE
);
516 ev
[1].flags
|= EV_ADD
| ((events
& POLLOUT
) ? EV_ENABLE
: EV_DISABLE
);
520 if (pollfd
[user
].events
== events
) return; /* nothing to do */
521 ev
[0].flags
|= (events
& POLLIN
) ? EV_ENABLE
: EV_DISABLE
;
522 ev
[1].flags
|= (events
& POLLOUT
) ? EV_ENABLE
: EV_DISABLE
;
525 if (kevent( kqueue_fd
, ev
, 2, NULL
, 0, NULL
) == -1)
527 if (errno
== ENOMEM
) /* not enough memory, give up on kqueue */
532 else perror( "kevent" ); /* should not happen */
536 static inline void remove_epoll_user( struct fd
*fd
, int user
)
538 if (kqueue_fd
== -1) return;
540 if (pollfd
[user
].fd
!= -1)
544 EV_SET( &ev
[0], fd
->unix_fd
, EVFILT_READ
, EV_DELETE
, 0, 0, 0 );
545 EV_SET( &ev
[1], fd
->unix_fd
, EVFILT_WRITE
, EV_DELETE
, 0, 0, 0 );
546 kevent( kqueue_fd
, ev
, 2, NULL
, 0, NULL
);
550 static inline void main_loop_epoll(void)
553 struct kevent events
[128];
555 if (kqueue_fd
== -1) return;
559 timeout
= get_next_timeout();
561 if (!active_users
) break; /* last user removed by a timeout */
562 if (kqueue_fd
== -1) break; /* an error occurred with kqueue */
568 ts
.tv_sec
= timeout
/ 1000;
569 ts
.tv_nsec
= (timeout
% 1000) * 1000000;
570 ret
= kevent( kqueue_fd
, NULL
, 0, events
, sizeof(events
)/sizeof(events
[0]), &ts
);
572 else ret
= kevent( kqueue_fd
, NULL
, 0, events
, sizeof(events
)/sizeof(events
[0]), NULL
);
574 gettimeofday( ¤t_time
, NULL
);
576 /* put the events into the pollfd array first, like poll does */
577 for (i
= 0; i
< ret
; i
++)
579 long user
= (long)events
[i
].udata
;
580 pollfd
[user
].revents
= 0;
582 for (i
= 0; i
< ret
; i
++)
584 long user
= (long)events
[i
].udata
;
585 if (events
[i
].filter
== EVFILT_READ
) pollfd
[user
].revents
|= POLLIN
;
586 else if (events
[i
].filter
== EVFILT_WRITE
) pollfd
[user
].revents
|= POLLOUT
;
587 if (events
[i
].flags
& EV_EOF
) pollfd
[user
].revents
|= POLLHUP
;
588 if (events
[i
].flags
& EV_ERROR
) pollfd
[user
].revents
|= POLLERR
;
591 /* read events from the pollfd array, as set_fd_events may modify them */
592 for (i
= 0; i
< ret
; i
++)
594 long user
= (long)events
[i
].udata
;
595 if (pollfd
[user
].revents
) fd_poll_event( poll_users
[user
], pollfd
[user
].revents
);
596 pollfd
[user
].revents
= 0;
601 #else /* HAVE_KQUEUE */
603 static inline void init_epoll(void) { }
604 static inline void set_fd_epoll_events( struct fd
*fd
, int user
, int events
) { }
605 static inline void remove_epoll_user( struct fd
*fd
, int user
) { }
606 static inline void main_loop_epoll(void) { }
608 #endif /* USE_EPOLL */
611 /* add a user in the poll array and return its index, or -1 on failure */
612 static int add_poll_user( struct fd
*fd
)
617 ret
= freelist
- poll_users
;
618 freelist
= (struct fd
**)poll_users
[ret
];
622 if (nb_users
== allocated_users
)
624 struct fd
**newusers
;
625 struct pollfd
*newpoll
;
626 int new_count
= allocated_users
? (allocated_users
+ allocated_users
/ 2) : 16;
627 if (!(newusers
= realloc( poll_users
, new_count
* sizeof(*poll_users
) ))) return -1;
628 if (!(newpoll
= realloc( pollfd
, new_count
* sizeof(*pollfd
) )))
631 poll_users
= newusers
;
636 poll_users
= newusers
;
638 if (!allocated_users
) init_epoll();
639 allocated_users
= new_count
;
644 pollfd
[ret
].events
= 0;
645 pollfd
[ret
].revents
= 0;
646 poll_users
[ret
] = fd
;
651 /* remove a user from the poll list */
652 static void remove_poll_user( struct fd
*fd
, int user
)
655 assert( poll_users
[user
] == fd
);
657 remove_epoll_user( fd
, user
);
658 pollfd
[user
].fd
= -1;
659 pollfd
[user
].events
= 0;
660 pollfd
[user
].revents
= 0;
661 poll_users
[user
] = (struct fd
*)freelist
;
662 freelist
= &poll_users
[user
];
666 /* process pending timeouts and return the time until the next timeout, in milliseconds */
667 static int get_next_timeout(void)
669 if (!list_empty( &timeout_list
))
671 struct list expired_list
, *ptr
;
673 /* first remove all expired timers from the list */
675 list_init( &expired_list
);
676 while ((ptr
= list_head( &timeout_list
)) != NULL
)
678 struct timeout_user
*timeout
= LIST_ENTRY( ptr
, struct timeout_user
, entry
);
680 if (!time_before( ¤t_time
, &timeout
->when
))
682 list_remove( &timeout
->entry
);
683 list_add_tail( &expired_list
, &timeout
->entry
);
688 /* now call the callback for all the removed timers */
690 while ((ptr
= list_head( &expired_list
)) != NULL
)
692 struct timeout_user
*timeout
= LIST_ENTRY( ptr
, struct timeout_user
, entry
);
693 list_remove( &timeout
->entry
);
694 timeout
->callback( timeout
->private );
698 if ((ptr
= list_head( &timeout_list
)) != NULL
)
700 struct timeout_user
*timeout
= LIST_ENTRY( ptr
, struct timeout_user
, entry
);
701 int diff
= (timeout
->when
.tv_sec
- current_time
.tv_sec
) * 1000
702 + (timeout
->when
.tv_usec
- current_time
.tv_usec
+ 999) / 1000;
703 if (diff
< 0) diff
= 0;
707 return -1; /* no pending timeouts */
710 /* server main poll() loop */
715 gettimeofday( ¤t_time
, NULL
);
718 /* fall through to normal poll loop */
722 timeout
= get_next_timeout();
724 if (!active_users
) break; /* last user removed by a timeout */
726 ret
= poll( pollfd
, nb_users
, timeout
);
727 gettimeofday( ¤t_time
, NULL
);
731 for (i
= 0; i
< nb_users
; i
++)
733 if (pollfd
[i
].revents
)
735 fd_poll_event( poll_users
[i
], pollfd
[i
].revents
);
744 /****************************************************************/
745 /* device functions */
747 static struct list device_hash
[DEVICE_HASH_SIZE
];
749 static int is_device_removable( dev_t dev
, int unix_fd
)
751 #if defined(linux) && defined(HAVE_FSTATFS)
754 /* check for floppy disk */
755 if (major(dev
) == FLOPPY_MAJOR
) return 1;
757 if (fstatfs( unix_fd
, &stfs
) == -1) return 0;
758 return (stfs
.f_type
== 0x9660 || /* iso9660 */
759 stfs
.f_type
== 0x9fa1 || /* supermount */
760 stfs
.f_type
== 0x15013346); /* udf */
761 #elif defined(__FreeBSD__) || defined(__FreeBSD_kernel__) || defined(__APPLE__)
764 if (fstatfs( unix_fd
, &stfs
) == -1) return 0;
765 return (!strncmp("cd9660", stfs
.f_fstypename
, sizeof(stfs
.f_fstypename
)) ||
766 !strncmp("udf", stfs
.f_fstypename
, sizeof(stfs
.f_fstypename
)));
767 #elif defined(__NetBSD__)
770 if (fstatvfs( unix_fd
, &stfs
) == -1) return 0;
771 return (!strncmp("cd9660", stfs
.f_fstypename
, sizeof(stfs
.f_fstypename
)) ||
772 !strncmp("udf", stfs
.f_fstypename
, sizeof(stfs
.f_fstypename
)));
774 # include <sys/dkio.h>
775 # include <sys/vtoc.h>
776 struct dk_cinfo dkinf
;
777 if (ioctl( unix_fd
, DKIOCINFO
, &dkinf
) == -1) return 0;
778 return (dkinf
.dki_ctype
== DKC_CDROM
||
779 dkinf
.dki_ctype
== DKC_NCRFLOPPY
||
780 dkinf
.dki_ctype
== DKC_SMSFLOPPY
||
781 dkinf
.dki_ctype
== DKC_INTEL82072
||
782 dkinf
.dki_ctype
== DKC_INTEL82077
);
788 /* retrieve the device object for a given fd, creating it if needed */
789 static struct device
*get_device( dev_t dev
, int unix_fd
)
791 struct device
*device
;
792 unsigned int i
, hash
= dev
% DEVICE_HASH_SIZE
;
794 if (device_hash
[hash
].next
)
796 LIST_FOR_EACH_ENTRY( device
, &device_hash
[hash
], struct device
, entry
)
797 if (device
->dev
== dev
) return (struct device
*)grab_object( device
);
799 else list_init( &device_hash
[hash
] );
801 /* not found, create it */
803 if (unix_fd
== -1) return NULL
;
804 if ((device
= alloc_object( &device_ops
)))
807 device
->removable
= is_device_removable( dev
, unix_fd
);
808 for (i
= 0; i
< INODE_HASH_SIZE
; i
++) list_init( &device
->inode_hash
[i
] );
809 list_add_head( &device_hash
[hash
], &device
->entry
);
814 static void device_dump( struct object
*obj
, int verbose
)
816 struct device
*device
= (struct device
*)obj
;
817 fprintf( stderr
, "Device dev=" );
818 DUMP_LONG_LONG( device
->dev
);
819 fprintf( stderr
, "\n" );
822 static void device_destroy( struct object
*obj
)
824 struct device
*device
= (struct device
*)obj
;
827 for (i
= 0; i
< INODE_HASH_SIZE
; i
++)
828 assert( list_empty(&device
->inode_hash
[i
]) );
830 list_remove( &device
->entry
); /* remove it from the hash table */
834 /****************************************************************/
835 /* inode functions */
837 /* close all pending file descriptors in the closed list */
838 static void inode_close_pending( struct inode
*inode
, int keep_unlinks
)
840 struct list
*ptr
= list_head( &inode
->closed
);
844 struct closed_fd
*fd
= LIST_ENTRY( ptr
, struct closed_fd
, entry
);
845 struct list
*next
= list_next( &inode
->closed
, ptr
);
847 if (fd
->unix_fd
!= -1)
849 close( fd
->unix_fd
);
852 if (!keep_unlinks
|| !fd
->unlink
[0]) /* get rid of it unless there's an unlink pending on that file */
861 static void inode_dump( struct object
*obj
, int verbose
)
863 struct inode
*inode
= (struct inode
*)obj
;
864 fprintf( stderr
, "Inode device=%p ino=", inode
->device
);
865 DUMP_LONG_LONG( inode
->ino
);
866 fprintf( stderr
, "\n" );
869 static void inode_destroy( struct object
*obj
)
871 struct inode
*inode
= (struct inode
*)obj
;
874 assert( list_empty(&inode
->open
) );
875 assert( list_empty(&inode
->locks
) );
877 list_remove( &inode
->entry
);
879 while ((ptr
= list_head( &inode
->closed
)))
881 struct closed_fd
*fd
= LIST_ENTRY( ptr
, struct closed_fd
, entry
);
883 if (fd
->unix_fd
!= -1) close( fd
->unix_fd
);
886 /* make sure it is still the same file */
888 if (!stat( fd
->unlink
, &st
) && st
.st_dev
== inode
->device
->dev
&& st
.st_ino
== inode
->ino
)
890 if (S_ISDIR(st
.st_mode
)) rmdir( fd
->unlink
);
891 else unlink( fd
->unlink
);
896 release_object( inode
->device
);
899 /* retrieve the inode object for a given fd, creating it if needed */
900 static struct inode
*get_inode( dev_t dev
, ino_t ino
, int unix_fd
)
902 struct device
*device
;
904 unsigned int hash
= ino
% INODE_HASH_SIZE
;
906 if (!(device
= get_device( dev
, unix_fd
))) return NULL
;
908 LIST_FOR_EACH_ENTRY( inode
, &device
->inode_hash
[hash
], struct inode
, entry
)
910 if (inode
->ino
== ino
)
912 release_object( device
);
913 return (struct inode
*)grab_object( inode
);
917 /* not found, create it */
918 if ((inode
= alloc_object( &inode_ops
)))
920 inode
->device
= device
;
922 list_init( &inode
->open
);
923 list_init( &inode
->locks
);
924 list_init( &inode
->closed
);
925 list_add_head( &device
->inode_hash
[hash
], &inode
->entry
);
927 else release_object( device
);
932 /* add fd to the inode list of file descriptors to close */
933 static void inode_add_closed_fd( struct inode
*inode
, struct closed_fd
*fd
)
935 if (!list_empty( &inode
->locks
))
937 list_add_head( &inode
->closed
, &fd
->entry
);
939 else if (fd
->unlink
[0]) /* close the fd but keep the structure around for unlink */
941 if (fd
->unix_fd
!= -1) close( fd
->unix_fd
);
943 list_add_head( &inode
->closed
, &fd
->entry
);
945 else /* no locks on this inode and no unlink, get rid of the fd */
947 if (fd
->unix_fd
!= -1) close( fd
->unix_fd
);
953 /****************************************************************/
954 /* file lock functions */
956 static void file_lock_dump( struct object
*obj
, int verbose
)
958 struct file_lock
*lock
= (struct file_lock
*)obj
;
959 fprintf( stderr
, "Lock %s fd=%p proc=%p start=",
960 lock
->shared
? "shared" : "excl", lock
->fd
, lock
->process
);
961 DUMP_LONG_LONG( lock
->start
);
962 fprintf( stderr
, " end=" );
963 DUMP_LONG_LONG( lock
->end
);
964 fprintf( stderr
, "\n" );
967 static int file_lock_signaled( struct object
*obj
, struct thread
*thread
)
969 struct file_lock
*lock
= (struct file_lock
*)obj
;
970 /* lock is signaled if it has lost its owner */
971 return !lock
->process
;
974 /* set (or remove) a Unix lock if possible for the given range */
975 static int set_unix_lock( struct fd
*fd
, file_pos_t start
, file_pos_t end
, int type
)
979 if (!fd
->fs_locks
) return 1; /* no fs locks possible for this fd */
982 if (start
== end
) return 1; /* can't set zero-byte lock */
983 if (start
> max_unix_offset
) return 1; /* ignore it */
985 fl
.l_whence
= SEEK_SET
;
987 if (!end
|| end
> max_unix_offset
) fl
.l_len
= 0;
988 else fl
.l_len
= end
- start
;
989 if (fcntl( fd
->unix_fd
, F_SETLK
, &fl
) != -1) return 1;
994 /* check whether locks work at all on this file system */
995 if (fcntl( fd
->unix_fd
, F_GETLK
, &fl
) != -1)
997 set_error( STATUS_FILE_LOCK_CONFLICT
);
1003 /* no locking on this fs, just ignore it */
1007 set_error( STATUS_FILE_LOCK_CONFLICT
);
1010 /* this can happen if we try to set a write lock on a read-only file */
1011 /* we just ignore that error */
1012 if (fl
.l_type
== F_WRLCK
) return 1;
1013 set_error( STATUS_ACCESS_DENIED
);
1019 /* this can happen if off_t is 64-bit but the kernel only supports 32-bit */
1020 /* in that case we shrink the limit and retry */
1021 if (max_unix_offset
> INT_MAX
)
1023 max_unix_offset
= INT_MAX
;
1034 /* check if interval [start;end) overlaps the lock */
1035 static inline int lock_overlaps( struct file_lock
*lock
, file_pos_t start
, file_pos_t end
)
1037 if (lock
->end
&& start
>= lock
->end
) return 0;
1038 if (end
&& lock
->start
>= end
) return 0;
1042 /* remove Unix locks for all bytes in the specified area that are no longer locked */
1043 static void remove_unix_locks( struct fd
*fd
, file_pos_t start
, file_pos_t end
)
1051 } *first
, *cur
, *next
, *buffer
;
1056 if (!fd
->inode
) return;
1057 if (!fd
->fs_locks
) return;
1058 if (start
== end
|| start
> max_unix_offset
) return;
1059 if (!end
|| end
> max_unix_offset
) end
= max_unix_offset
+ 1;
1061 /* count the number of locks overlapping the specified area */
1063 LIST_FOR_EACH( ptr
, &fd
->inode
->locks
)
1065 struct file_lock
*lock
= LIST_ENTRY( ptr
, struct file_lock
, inode_entry
);
1066 if (lock
->start
== lock
->end
) continue;
1067 if (lock_overlaps( lock
, start
, end
)) count
++;
1070 if (!count
) /* no locks at all, we can unlock everything */
1072 set_unix_lock( fd
, start
, end
, F_UNLCK
);
1076 /* allocate space for the list of holes */
1077 /* max. number of holes is number of locks + 1 */
1079 if (!(buffer
= malloc( sizeof(*buffer
) * (count
+1) ))) return;
1083 first
->start
= start
;
1087 /* build a sorted list of unlocked holes in the specified area */
1089 LIST_FOR_EACH( ptr
, &fd
->inode
->locks
)
1091 struct file_lock
*lock
= LIST_ENTRY( ptr
, struct file_lock
, inode_entry
);
1092 if (lock
->start
== lock
->end
) continue;
1093 if (!lock_overlaps( lock
, start
, end
)) continue;
1095 /* go through all the holes touched by this lock */
1096 for (cur
= first
; cur
; cur
= cur
->next
)
1098 if (cur
->end
<= lock
->start
) continue; /* hole is before start of lock */
1099 if (lock
->end
&& cur
->start
>= lock
->end
) break; /* hole is after end of lock */
1101 /* now we know that lock is overlapping hole */
1103 if (cur
->start
>= lock
->start
) /* lock starts before hole, shrink from start */
1105 cur
->start
= lock
->end
;
1106 if (cur
->start
&& cur
->start
< cur
->end
) break; /* done with this lock */
1107 /* now hole is empty, remove it */
1108 if (cur
->next
) cur
->next
->prev
= cur
->prev
;
1109 if (cur
->prev
) cur
->prev
->next
= cur
->next
;
1110 else if (!(first
= cur
->next
)) goto done
; /* no more holes at all */
1112 else if (!lock
->end
|| cur
->end
<= lock
->end
) /* lock larger than hole, shrink from end */
1114 cur
->end
= lock
->start
;
1115 assert( cur
->start
< cur
->end
);
1117 else /* lock is in the middle of hole, split hole in two */
1120 next
->next
= cur
->next
;
1122 next
->start
= lock
->end
;
1123 next
->end
= cur
->end
;
1124 cur
->end
= lock
->start
;
1125 assert( next
->start
< next
->end
);
1126 assert( cur
->end
< next
->start
);
1128 break; /* done with this lock */
1133 /* clear Unix locks for all the holes */
1135 for (cur
= first
; cur
; cur
= cur
->next
)
1136 set_unix_lock( fd
, cur
->start
, cur
->end
, F_UNLCK
);
1142 /* create a new lock on a fd */
1143 static struct file_lock
*add_lock( struct fd
*fd
, int shared
, file_pos_t start
, file_pos_t end
)
1145 struct file_lock
*lock
;
1147 if (!fd
->inode
) /* not a regular file */
1149 set_error( STATUS_INVALID_HANDLE
);
1153 if (!(lock
= alloc_object( &file_lock_ops
))) return NULL
;
1154 lock
->shared
= shared
;
1155 lock
->start
= start
;
1158 lock
->process
= current
->process
;
1160 /* now try to set a Unix lock */
1161 if (!set_unix_lock( lock
->fd
, lock
->start
, lock
->end
, lock
->shared
? F_RDLCK
: F_WRLCK
))
1163 release_object( lock
);
1166 list_add_head( &fd
->locks
, &lock
->fd_entry
);
1167 list_add_head( &fd
->inode
->locks
, &lock
->inode_entry
);
1168 list_add_head( &lock
->process
->locks
, &lock
->proc_entry
);
1172 /* remove an existing lock */
1173 static void remove_lock( struct file_lock
*lock
, int remove_unix
)
1175 struct inode
*inode
= lock
->fd
->inode
;
1177 list_remove( &lock
->fd_entry
);
1178 list_remove( &lock
->inode_entry
);
1179 list_remove( &lock
->proc_entry
);
1180 if (remove_unix
) remove_unix_locks( lock
->fd
, lock
->start
, lock
->end
);
1181 if (list_empty( &inode
->locks
)) inode_close_pending( inode
, 1 );
1182 lock
->process
= NULL
;
1183 wake_up( &lock
->obj
, 0 );
1184 release_object( lock
);
1187 /* remove all locks owned by a given process */
1188 void remove_process_locks( struct process
*process
)
1192 while ((ptr
= list_head( &process
->locks
)))
1194 struct file_lock
*lock
= LIST_ENTRY( ptr
, struct file_lock
, proc_entry
);
1195 remove_lock( lock
, 1 ); /* this removes it from the list */
1199 /* remove all locks on a given fd */
1200 static void remove_fd_locks( struct fd
*fd
)
1202 file_pos_t start
= FILE_POS_T_MAX
, end
= 0;
1205 while ((ptr
= list_head( &fd
->locks
)))
1207 struct file_lock
*lock
= LIST_ENTRY( ptr
, struct file_lock
, fd_entry
);
1208 if (lock
->start
< start
) start
= lock
->start
;
1209 if (!lock
->end
|| lock
->end
> end
) end
= lock
->end
- 1;
1210 remove_lock( lock
, 0 );
1212 if (start
< end
) remove_unix_locks( fd
, start
, end
+ 1 );
1215 /* add a lock on an fd */
1216 /* returns handle to wait on */
1217 obj_handle_t
lock_fd( struct fd
*fd
, file_pos_t start
, file_pos_t count
, int shared
, int wait
)
1220 file_pos_t end
= start
+ count
;
1222 /* don't allow wrapping locks */
1223 if (end
&& end
< start
)
1225 set_error( STATUS_INVALID_PARAMETER
);
1229 /* check if another lock on that file overlaps the area */
1230 LIST_FOR_EACH( ptr
, &fd
->inode
->locks
)
1232 struct file_lock
*lock
= LIST_ENTRY( ptr
, struct file_lock
, inode_entry
);
1233 if (!lock_overlaps( lock
, start
, end
)) continue;
1234 if (lock
->shared
&& shared
) continue;
1238 set_error( STATUS_FILE_LOCK_CONFLICT
);
1241 set_error( STATUS_PENDING
);
1242 return alloc_handle( current
->process
, lock
, SYNCHRONIZE
, 0 );
1245 /* not found, add it */
1246 if (add_lock( fd
, shared
, start
, end
)) return 0;
1247 if (get_error() == STATUS_FILE_LOCK_CONFLICT
)
1249 /* Unix lock conflict -> tell client to wait and retry */
1250 if (wait
) set_error( STATUS_PENDING
);
1255 /* remove a lock on an fd */
1256 void unlock_fd( struct fd
*fd
, file_pos_t start
, file_pos_t count
)
1259 file_pos_t end
= start
+ count
;
1261 /* find an existing lock with the exact same parameters */
1262 LIST_FOR_EACH( ptr
, &fd
->locks
)
1264 struct file_lock
*lock
= LIST_ENTRY( ptr
, struct file_lock
, fd_entry
);
1265 if ((lock
->start
== start
) && (lock
->end
== end
))
1267 remove_lock( lock
, 1 );
1271 set_error( STATUS_FILE_LOCK_CONFLICT
);
1275 /****************************************************************/
1276 /* file descriptor functions */
1278 static void fd_dump( struct object
*obj
, int verbose
)
1280 struct fd
*fd
= (struct fd
*)obj
;
1281 fprintf( stderr
, "Fd unix_fd=%d user=%p", fd
->unix_fd
, fd
->user
);
1282 if (fd
->inode
) fprintf( stderr
, " inode=%p unlink='%s'", fd
->inode
, fd
->closed
->unlink
);
1283 fprintf( stderr
, "\n" );
1286 static void fd_destroy( struct object
*obj
)
1288 struct fd
*fd
= (struct fd
*)obj
;
1290 free_async_queue( fd
->read_q
);
1291 free_async_queue( fd
->write_q
);
1292 free_async_queue( fd
->wait_q
);
1294 remove_fd_locks( fd
);
1295 list_remove( &fd
->inode_entry
);
1296 if (fd
->poll_index
!= -1) remove_poll_user( fd
, fd
->poll_index
);
1299 inode_add_closed_fd( fd
->inode
, fd
->closed
);
1300 release_object( fd
->inode
);
1302 else /* no inode, close it right away */
1304 if (fd
->unix_fd
!= -1) close( fd
->unix_fd
);
1308 /* set the events that select waits for on this fd */
1309 void set_fd_events( struct fd
*fd
, int events
)
1311 int user
= fd
->poll_index
;
1312 assert( poll_users
[user
] == fd
);
1314 set_fd_epoll_events( fd
, user
, events
);
1316 if (events
== -1) /* stop waiting on this fd completely */
1318 pollfd
[user
].fd
= -1;
1319 pollfd
[user
].events
= POLLERR
;
1320 pollfd
[user
].revents
= 0;
1322 else if (pollfd
[user
].fd
!= -1 || !pollfd
[user
].events
)
1324 pollfd
[user
].fd
= fd
->unix_fd
;
1325 pollfd
[user
].events
= events
;
1329 /* prepare an fd for unmounting its corresponding device */
1330 static inline void unmount_fd( struct fd
*fd
)
1332 assert( fd
->inode
);
1334 async_wake_up( fd
->read_q
, STATUS_VOLUME_DISMOUNTED
);
1335 async_wake_up( fd
->write_q
, STATUS_VOLUME_DISMOUNTED
);
1337 if (fd
->poll_index
!= -1) set_fd_events( fd
, -1 );
1339 if (fd
->unix_fd
!= -1) close( fd
->unix_fd
);
1343 fd
->closed
->unix_fd
= -1;
1344 fd
->closed
->unlink
[0] = 0;
1346 /* stop using Unix locks on this fd (existing locks have been removed by close) */
1350 /* allocate an fd object, without setting the unix fd yet */
1351 static struct fd
*alloc_fd_object(void)
1353 struct fd
*fd
= alloc_object( &fd_ops
);
1355 if (!fd
) return NULL
;
1367 fd
->poll_index
= -1;
1371 list_init( &fd
->inode_entry
);
1372 list_init( &fd
->locks
);
1374 if ((fd
->poll_index
= add_poll_user( fd
)) == -1)
1376 release_object( fd
);
1382 /* allocate a pseudo fd object, for objects that need to behave like files but don't have a unix fd */
1383 struct fd
*alloc_pseudo_fd( const struct fd_ops
*fd_user_ops
, struct object
*user
)
1385 struct fd
*fd
= alloc_object( &fd_ops
);
1387 if (!fd
) return NULL
;
1389 fd
->fd_ops
= fd_user_ops
;
1399 fd
->poll_index
= -1;
1403 list_init( &fd
->inode_entry
);
1404 list_init( &fd
->locks
);
1408 /* check if the desired access is possible without violating */
1409 /* the sharing mode of other opens of the same file */
1410 static int check_sharing( struct fd
*fd
, unsigned int access
, unsigned int sharing
)
1412 unsigned int existing_sharing
= FILE_SHARE_READ
| FILE_SHARE_WRITE
| FILE_SHARE_DELETE
;
1413 unsigned int existing_access
= 0;
1416 /* if access mode is 0, sharing mode is ignored */
1417 if (!access
) sharing
= existing_sharing
;
1418 fd
->access
= access
;
1419 fd
->sharing
= sharing
;
1421 LIST_FOR_EACH( ptr
, &fd
->inode
->open
)
1423 struct fd
*fd_ptr
= LIST_ENTRY( ptr
, struct fd
, inode_entry
);
1426 existing_sharing
&= fd_ptr
->sharing
;
1427 existing_access
|= fd_ptr
->access
;
1431 if ((access
& FILE_UNIX_READ_ACCESS
) && !(existing_sharing
& FILE_SHARE_READ
)) return 0;
1432 if ((access
& FILE_UNIX_WRITE_ACCESS
) && !(existing_sharing
& FILE_SHARE_WRITE
)) return 0;
1433 if ((access
& DELETE
) && !(existing_sharing
& FILE_SHARE_DELETE
)) return 0;
1434 if ((existing_access
& FILE_UNIX_READ_ACCESS
) && !(sharing
& FILE_SHARE_READ
)) return 0;
1435 if ((existing_access
& FILE_UNIX_WRITE_ACCESS
) && !(sharing
& FILE_SHARE_WRITE
)) return 0;
1436 if ((existing_access
& DELETE
) && !(sharing
& FILE_SHARE_DELETE
)) return 0;
1440 /* sets the user of an fd that previously had no user */
1441 void set_fd_user( struct fd
*fd
, const struct fd_ops
*user_ops
, struct object
*user
)
1443 assert( fd
->fd_ops
== NULL
);
1444 fd
->fd_ops
= user_ops
;
1448 /* open() wrapper that returns a struct fd with no fd user set */
1449 struct fd
*open_fd( const char *name
, int flags
, mode_t
*mode
, unsigned int access
,
1450 unsigned int sharing
, unsigned int options
)
1453 struct closed_fd
*closed_fd
;
1455 const char *unlink_name
= "";
1458 if ((options
& FILE_DELETE_ON_CLOSE
) && !(access
& DELETE
))
1460 set_error( STATUS_INVALID_PARAMETER
);
1464 if (!(fd
= alloc_fd_object())) return NULL
;
1466 if (options
& FILE_DELETE_ON_CLOSE
) unlink_name
= name
;
1467 if (!(closed_fd
= mem_alloc( sizeof(*closed_fd
) + strlen(unlink_name
) )))
1469 release_object( fd
);
1473 /* create the directory if needed */
1474 if ((options
& FILE_DIRECTORY_FILE
) && (flags
& O_CREAT
))
1476 if (mkdir( name
, 0777 ) == -1)
1478 if (errno
!= EEXIST
|| (flags
& O_EXCL
))
1484 flags
&= ~(O_CREAT
| O_EXCL
| O_TRUNC
);
1487 if ((access
& FILE_UNIX_WRITE_ACCESS
) && !(options
& FILE_DIRECTORY_FILE
))
1489 if (access
& FILE_UNIX_READ_ACCESS
) rw_mode
= O_RDWR
;
1490 else rw_mode
= O_WRONLY
;
1492 else rw_mode
= O_RDONLY
;
1494 if ((fd
->unix_fd
= open( name
, rw_mode
| (flags
& ~O_TRUNC
), *mode
)) == -1)
1496 /* if we tried to open a directory for write access, retry read-only */
1497 if (errno
!= EISDIR
||
1498 !(access
& FILE_UNIX_WRITE_ACCESS
) ||
1499 (fd
->unix_fd
= open( name
, O_RDONLY
| (flags
& ~O_TRUNC
), *mode
)) == -1)
1506 closed_fd
->unix_fd
= fd
->unix_fd
;
1507 closed_fd
->unlink
[0] = 0;
1508 fstat( fd
->unix_fd
, &st
);
1511 /* only bother with an inode for normal files and directories */
1512 if (S_ISREG(st
.st_mode
) || S_ISDIR(st
.st_mode
))
1514 struct inode
*inode
= get_inode( st
.st_dev
, st
.st_ino
, fd
->unix_fd
);
1518 /* we can close the fd because there are no others open on the same file,
1519 * otherwise we wouldn't have failed to allocate a new inode
1524 fd
->closed
= closed_fd
;
1525 list_add_head( &inode
->open
, &fd
->inode_entry
);
1527 /* check directory options */
1528 if ((options
& FILE_DIRECTORY_FILE
) && !S_ISDIR(st
.st_mode
))
1530 release_object( fd
);
1531 set_error( STATUS_NOT_A_DIRECTORY
);
1534 if ((options
& FILE_NON_DIRECTORY_FILE
) && S_ISDIR(st
.st_mode
))
1536 release_object( fd
);
1537 set_error( STATUS_FILE_IS_A_DIRECTORY
);
1540 if (!check_sharing( fd
, access
, sharing
))
1542 release_object( fd
);
1543 set_error( STATUS_SHARING_VIOLATION
);
1546 strcpy( closed_fd
->unlink
, unlink_name
);
1547 if (flags
& O_TRUNC
) ftruncate( fd
->unix_fd
, 0 );
1549 else /* special file */
1551 if (options
& FILE_DIRECTORY_FILE
)
1553 set_error( STATUS_NOT_A_DIRECTORY
);
1556 if (unlink_name
[0]) /* we can't unlink special files */
1558 set_error( STATUS_INVALID_PARAMETER
);
1566 release_object( fd
);
1571 /* create an fd for an anonymous file */
1572 /* if the function fails the unix fd is closed */
1573 struct fd
*create_anonymous_fd( const struct fd_ops
*fd_user_ops
, int unix_fd
, struct object
*user
)
1575 struct fd
*fd
= alloc_fd_object();
1579 set_fd_user( fd
, fd_user_ops
, user
);
1580 fd
->unix_fd
= unix_fd
;
1587 /* retrieve the object that is using an fd */
1588 void *get_fd_user( struct fd
*fd
)
1593 /* retrieve the unix fd for an object */
1594 int get_unix_fd( struct fd
*fd
)
1596 if (fd
->unix_fd
== -1)
1598 if (fd
->unmounted
) set_error( STATUS_VOLUME_DISMOUNTED
);
1599 else set_error( STATUS_BAD_DEVICE_TYPE
);
1604 /* check if two file descriptors point to the same file */
1605 int is_same_file_fd( struct fd
*fd1
, struct fd
*fd2
)
1607 return fd1
->inode
== fd2
->inode
;
1610 /* check if fd is on a removable device */
1611 int is_fd_removable( struct fd
*fd
)
1613 return (fd
->inode
&& fd
->inode
->device
->removable
);
1616 /* set or clear the fd signaled state */
1617 void set_fd_signaled( struct fd
*fd
, int signaled
)
1619 fd
->signaled
= signaled
;
1620 if (signaled
) wake_up( fd
->user
, 0 );
1623 /* handler for close_handle that refuses to close fd-associated handles in other processes */
1624 int fd_close_handle( struct object
*obj
, struct process
*process
, obj_handle_t handle
)
1626 return (!current
|| current
->process
== process
);
1629 /* callback for event happening in the main poll() loop */
1630 void fd_poll_event( struct fd
*fd
, int event
)
1632 return fd
->fd_ops
->poll_event( fd
, event
);
1635 /* check if events are pending and if yes return which one(s) */
1636 int check_fd_events( struct fd
*fd
, int events
)
1640 if (fd
->unix_fd
== -1) return POLLERR
;
1641 if (fd
->inode
) return events
; /* regular files are always signaled */
1643 pfd
.fd
= fd
->unix_fd
;
1644 pfd
.events
= events
;
1645 if (poll( &pfd
, 1, 0 ) <= 0) return 0;
1649 /* default signaled() routine for objects that poll() on an fd */
1650 int default_fd_signaled( struct object
*obj
, struct thread
*thread
)
1652 struct fd
*fd
= get_obj_fd( obj
);
1653 int ret
= fd
->signaled
;
1654 release_object( fd
);
1658 int default_fd_get_poll_events( struct fd
*fd
)
1662 if (async_waiting( fd
->read_q
)) events
|= POLLIN
;
1663 if (async_waiting( fd
->write_q
)) events
|= POLLOUT
;
1667 /* default handler for poll() events */
1668 void default_poll_event( struct fd
*fd
, int event
)
1670 if (event
& (POLLIN
| POLLERR
| POLLHUP
)) async_wake_up( fd
->read_q
, STATUS_ALERTED
);
1671 if (event
& (POLLOUT
| POLLERR
| POLLHUP
)) async_wake_up( fd
->write_q
, STATUS_ALERTED
);
1673 /* if an error occurred, stop polling this fd to avoid busy-looping */
1674 if (event
& (POLLERR
| POLLHUP
)) set_fd_events( fd
, -1 );
1675 else if (!fd
->inode
) set_fd_events( fd
, fd
->fd_ops
->get_poll_events( fd
) );
1678 struct async
*fd_queue_async( struct fd
*fd
, const async_data_t
*data
, int type
, int count
)
1680 struct async_queue
*queue
;
1681 struct async
*async
;
1685 case ASYNC_TYPE_READ
:
1686 if (!fd
->read_q
&& !(fd
->read_q
= create_async_queue( fd
))) return NULL
;
1689 case ASYNC_TYPE_WRITE
:
1690 if (!fd
->write_q
&& !(fd
->write_q
= create_async_queue( fd
))) return NULL
;
1691 queue
= fd
->write_q
;
1693 case ASYNC_TYPE_WAIT
:
1694 if (!fd
->wait_q
&& !(fd
->wait_q
= create_async_queue( fd
))) return NULL
;
1701 if ((async
= create_async( current
, queue
, data
)))
1704 set_fd_events( fd
, fd
->fd_ops
->get_poll_events( fd
) );
1705 else /* regular files are always ready for read and write */
1706 if (type
!= ASYNC_TYPE_WAIT
) async_wake_up( queue
, STATUS_ALERTED
);
1711 void fd_async_wake_up( struct fd
*fd
, int type
, unsigned int status
)
1715 case ASYNC_TYPE_READ
:
1716 async_wake_up( fd
->read_q
, status
);
1718 case ASYNC_TYPE_WRITE
:
1719 async_wake_up( fd
->write_q
, status
);
1721 case ASYNC_TYPE_WAIT
:
1722 async_wake_up( fd
->wait_q
, status
);
1729 void fd_reselect_async( struct fd
*fd
, struct async_queue
*queue
)
1731 fd
->fd_ops
->reselect_async( fd
, queue
);
1734 void default_fd_queue_async( struct fd
*fd
, const async_data_t
*data
, int type
, int count
)
1737 struct async
*async
;
1739 fd
->fd_ops
->get_file_info( fd
, &flags
);
1740 if (!(flags
& (FD_FLAG_OVERLAPPED
|FD_FLAG_TIMEOUT
)))
1742 set_error( STATUS_INVALID_HANDLE
);
1745 if ((async
= fd_queue_async( fd
, data
, type
, count
)))
1747 release_object( async
);
1748 set_error( STATUS_PENDING
);
1752 /* default reselect_async() fd routine */
1753 void default_fd_reselect_async( struct fd
*fd
, struct async_queue
*queue
)
1755 if (queue
!= fd
->wait_q
)
1757 int poll_events
= fd
->fd_ops
->get_poll_events( fd
);
1758 int events
= check_fd_events( fd
, poll_events
);
1759 if (events
) fd
->fd_ops
->poll_event( fd
, events
);
1760 else set_fd_events( fd
, poll_events
);
1764 /* default cancel_async() fd routine */
1765 void default_fd_cancel_async( struct fd
*fd
)
1767 async_wake_up( fd
->read_q
, STATUS_CANCELLED
);
1768 async_wake_up( fd
->write_q
, STATUS_CANCELLED
);
1769 async_wake_up( fd
->wait_q
, STATUS_CANCELLED
);
1772 /* default flush() routine */
1773 void no_flush( struct fd
*fd
, struct event
**event
)
1775 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
1778 /* default get_file_info() routine */
1779 enum server_fd_type
no_get_file_info( struct fd
*fd
, int *flags
)
1782 return FD_TYPE_INVALID
;
1785 /* default queue_async() routine */
1786 void no_queue_async( struct fd
*fd
, const async_data_t
*data
, int type
, int count
)
1788 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
1791 /* default cancel_async() routine */
1792 void no_cancel_async( struct fd
*fd
)
1794 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
1797 static inline int is_valid_mounted_device( struct stat
*st
)
1799 #if defined(linux) || defined(__sun__)
1800 return S_ISBLK( st
->st_mode
);
1802 /* disks are char devices on *BSD */
1803 return S_ISCHR( st
->st_mode
);
1807 /* close all Unix file descriptors on a device to allow unmounting it */
1808 static void unmount_device( struct fd
*device_fd
)
1812 struct device
*device
;
1813 struct inode
*inode
;
1815 int unix_fd
= get_unix_fd( device_fd
);
1817 if (unix_fd
== -1) return;
1819 if (fstat( unix_fd
, &st
) == -1 || !is_valid_mounted_device( &st
))
1821 set_error( STATUS_INVALID_PARAMETER
);
1825 if (!(device
= get_device( st
.st_rdev
, -1 ))) return;
1827 for (i
= 0; i
< INODE_HASH_SIZE
; i
++)
1829 LIST_FOR_EACH_ENTRY( inode
, &device
->inode_hash
[i
], struct inode
, entry
)
1831 LIST_FOR_EACH_ENTRY( fd
, &inode
->open
, struct fd
, inode_entry
)
1835 inode_close_pending( inode
, 0 );
1838 /* remove it from the hash table */
1839 list_remove( &device
->entry
);
1840 list_init( &device
->entry
);
1841 release_object( device
);
1844 /* same as get_handle_obj but retrieve the struct fd associated to the object */
1845 static struct fd
*get_handle_fd_obj( struct process
*process
, obj_handle_t handle
,
1846 unsigned int access
)
1848 struct fd
*fd
= NULL
;
1851 if ((obj
= get_handle_obj( process
, handle
, access
, NULL
)))
1853 fd
= get_obj_fd( obj
);
1854 release_object( obj
);
1859 /* flush a file buffers */
1860 DECL_HANDLER(flush_file
)
1862 struct fd
*fd
= get_handle_fd_obj( current
->process
, req
->handle
, 0 );
1863 struct event
* event
= NULL
;
1867 fd
->fd_ops
->flush( fd
, &event
);
1870 reply
->event
= alloc_handle( current
->process
, event
, SYNCHRONIZE
, 0 );
1872 release_object( fd
);
1876 /* open a file object */
1877 DECL_HANDLER(open_file_object
)
1879 struct unicode_str name
;
1880 struct directory
*root
= NULL
;
1881 struct object
*obj
, *result
;
1883 get_req_unicode_str( &name
);
1884 if (req
->rootdir
&& !(root
= get_directory_obj( current
->process
, req
->rootdir
, 0 )))
1887 if ((obj
= open_object_dir( root
, &name
, req
->attributes
, NULL
)))
1889 if ((result
= obj
->ops
->open_file( obj
, req
->access
, req
->sharing
, req
->options
)))
1891 reply
->handle
= alloc_handle( current
->process
, result
, req
->access
, req
->attributes
);
1892 release_object( result
);
1894 release_object( obj
);
1897 if (root
) release_object( root
);
1900 /* get a Unix fd to access a file */
1901 DECL_HANDLER(get_handle_fd
)
1905 if ((fd
= get_handle_fd_obj( current
->process
, req
->handle
, req
->access
)))
1907 reply
->type
= fd
->fd_ops
->get_file_info( fd
, &reply
->flags
);
1908 if (reply
->type
!= FD_TYPE_INVALID
)
1910 if (is_fd_removable(fd
)) reply
->flags
|= FD_FLAG_REMOVABLE
;
1913 int unix_fd
= get_unix_fd( fd
);
1914 if (unix_fd
!= -1) send_client_fd( current
->process
, unix_fd
, req
->handle
);
1917 else set_error( STATUS_OBJECT_TYPE_MISMATCH
);
1918 release_object( fd
);
1922 /* get ready to unmount a Unix device */
1923 DECL_HANDLER(unmount_device
)
1927 if ((fd
= get_handle_fd_obj( current
->process
, req
->handle
, 0 )))
1929 unmount_device( fd
);
1930 release_object( fd
);
1934 /* create / reschedule an async I/O */
1935 DECL_HANDLER(register_async
)
1937 unsigned int access
;
1942 case ASYNC_TYPE_READ
:
1943 access
= FILE_READ_DATA
;
1945 case ASYNC_TYPE_WRITE
:
1946 access
= FILE_WRITE_DATA
;
1949 set_error( STATUS_INVALID_PARAMETER
);
1953 if ((fd
= get_handle_fd_obj( current
->process
, req
->handle
, access
)))
1955 fd
->fd_ops
->queue_async( fd
, &req
->async
, req
->type
, req
->count
);
1956 release_object( fd
);
1960 /* cancels all async I/O */
1961 DECL_HANDLER(cancel_async
)
1963 struct fd
*fd
= get_handle_fd_obj( current
->process
, req
->handle
, 0 );
1966 /* Note: we don't kill the queued APC_ASYNC_IO on this thread because
1967 * NtCancelIoFile() will force the pending APC to be run. Since,
1968 * Windows only guarantees that the current thread will have no async
1969 * operation on the current fd when NtCancelIoFile returns, this shall
1972 fd
->fd_ops
->cancel_async( fd
);
1973 release_object( fd
);