ntdll: Simplify the platform-specific dispatcher interface.
[wine.git] / server / change.c
blobb02a9cd65bff5680504d21b675ad441bef34ff12
1 /*
2 * Server-side change notification management
4 * Copyright (C) 1998 Alexandre Julliard
5 * Copyright (C) 2006 Mike McCormack
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
22 #include "config.h"
23 #include "wine/port.h"
25 #include <assert.h>
26 #include <fcntl.h>
27 #include <stdio.h>
28 #include <stdlib.h>
29 #include <signal.h>
30 #include <sys/stat.h>
31 #include <sys/types.h>
32 #include <limits.h>
33 #include <dirent.h>
34 #include <errno.h>
35 #ifdef HAVE_POLL_H
36 # include <poll.h>
37 #endif
38 #ifdef HAVE_SYS_INOTIFY_H
39 #include <sys/inotify.h>
40 #endif
42 #include "ntstatus.h"
43 #define WIN32_NO_STATUS
44 #include "windef.h"
46 #include "file.h"
47 #include "handle.h"
48 #include "thread.h"
49 #include "request.h"
50 #include "process.h"
51 #include "security.h"
52 #include "winternl.h"
54 /* dnotify support */
56 #ifdef linux
57 #ifndef F_NOTIFY
58 #define F_NOTIFY 1026
59 #define DN_ACCESS 0x00000001 /* File accessed */
60 #define DN_MODIFY 0x00000002 /* File modified */
61 #define DN_CREATE 0x00000004 /* File created */
62 #define DN_DELETE 0x00000008 /* File removed */
63 #define DN_RENAME 0x00000010 /* File renamed */
64 #define DN_ATTRIB 0x00000020 /* File changed attributes */
65 #define DN_MULTISHOT 0x80000000 /* Don't remove notifier */
66 #endif
67 #endif
69 /* inotify support */
71 struct inode;
73 static void free_inode( struct inode *inode );
75 static struct fd *inotify_fd;
77 struct change_record {
78 struct list entry;
79 unsigned int cookie;
80 struct filesystem_event event;
83 struct dir
85 struct object obj; /* object header */
86 struct fd *fd; /* file descriptor to the directory */
87 mode_t mode; /* file stat.st_mode */
88 uid_t uid; /* file stat.st_uid */
89 struct list entry; /* entry in global change notifications list */
90 unsigned int filter; /* notification filter */
91 volatile int notified; /* SIGIO counter */
92 int want_data; /* return change data */
93 int subtree; /* do we want to watch subdirectories? */
94 struct list change_records; /* data for the change */
95 struct list in_entry; /* entry in the inode dirs list */
96 struct inode *inode; /* inode of the associated directory */
97 struct process *client_process; /* client process that has a cache for this directory */
98 int client_entry; /* entry in client process cache */
101 static struct fd *dir_get_fd( struct object *obj );
102 static struct security_descriptor *dir_get_sd( struct object *obj );
103 static int dir_set_sd( struct object *obj, const struct security_descriptor *sd,
104 unsigned int set_info );
105 static void dir_dump( struct object *obj, int verbose );
106 static int dir_close_handle( struct object *obj, struct process *process, obj_handle_t handle );
107 static void dir_destroy( struct object *obj );
109 static const struct object_ops dir_ops =
111 sizeof(struct dir), /* size */
112 &file_type, /* type */
113 dir_dump, /* dump */
114 add_queue, /* add_queue */
115 remove_queue, /* remove_queue */
116 default_fd_signaled, /* signaled */
117 no_satisfied, /* satisfied */
118 no_signal, /* signal */
119 dir_get_fd, /* get_fd */
120 default_map_access, /* map_access */
121 dir_get_sd, /* get_sd */
122 dir_set_sd, /* set_sd */
123 no_get_full_name, /* get_full_name */
124 no_lookup_name, /* lookup_name */
125 no_link_name, /* link_name */
126 NULL, /* unlink_name */
127 no_open_file, /* open_file */
128 no_kernel_obj_list, /* get_kernel_obj_list */
129 dir_close_handle, /* close_handle */
130 dir_destroy /* destroy */
133 static int dir_get_poll_events( struct fd *fd );
134 static enum server_fd_type dir_get_fd_type( struct fd *fd );
136 static const struct fd_ops dir_fd_ops =
138 dir_get_poll_events, /* get_poll_events */
139 default_poll_event, /* poll_event */
140 dir_get_fd_type, /* get_fd_type */
141 no_fd_read, /* read */
142 no_fd_write, /* write */
143 no_fd_flush, /* flush */
144 default_fd_get_file_info, /* get_file_info */
145 no_fd_get_volume_info, /* get_volume_info */
146 default_fd_ioctl, /* ioctl */
147 default_fd_queue_async, /* queue_async */
148 default_fd_reselect_async /* reselect_async */
151 static struct list change_list = LIST_INIT(change_list);
153 /* per-process structure to keep track of cache entries on the client size */
154 struct dir_cache
156 unsigned int size;
157 unsigned int count;
158 unsigned char state[1];
161 enum dir_cache_state
163 DIR_CACHE_STATE_FREE,
164 DIR_CACHE_STATE_INUSE,
165 DIR_CACHE_STATE_RELEASED
168 /* return an array of cache entries that can be freed on the client side */
169 static int *get_free_dir_cache_entries( struct process *process, data_size_t *size )
171 int *ret;
172 struct dir_cache *cache = process->dir_cache;
173 unsigned int i, j, count;
175 if (!cache) return NULL;
176 for (i = count = 0; i < cache->count && count < *size / sizeof(*ret); i++)
177 if (cache->state[i] == DIR_CACHE_STATE_RELEASED) count++;
178 if (!count) return NULL;
180 if ((ret = malloc( count * sizeof(*ret) )))
182 for (i = j = 0; j < count; i++)
184 if (cache->state[i] != DIR_CACHE_STATE_RELEASED) continue;
185 cache->state[i] = DIR_CACHE_STATE_FREE;
186 ret[j++] = i;
188 *size = count * sizeof(*ret);
190 return ret;
193 /* allocate a new client-side directory cache entry */
194 static int alloc_dir_cache_entry( struct dir *dir, struct process *process )
196 unsigned int i = 0;
197 struct dir_cache *cache = process->dir_cache;
199 if (cache)
200 for (i = 0; i < cache->count; i++)
201 if (cache->state[i] == DIR_CACHE_STATE_FREE) goto found;
203 if (!cache || cache->count == cache->size)
205 unsigned int size = cache ? cache->size * 2 : 256;
206 if (!(cache = realloc( cache, offsetof( struct dir_cache, state[size] ))))
208 set_error( STATUS_NO_MEMORY );
209 return -1;
211 process->dir_cache = cache;
212 cache->size = size;
214 cache->count = i + 1;
216 found:
217 cache->state[i] = DIR_CACHE_STATE_INUSE;
218 return i;
221 /* release a directory cache entry; it will be freed on the client side on the next cache request */
222 static void release_dir_cache_entry( struct dir *dir )
224 struct dir_cache *cache;
226 if (!dir->client_process) return;
227 cache = dir->client_process->dir_cache;
228 cache->state[dir->client_entry] = DIR_CACHE_STATE_RELEASED;
229 release_object( dir->client_process );
230 dir->client_process = NULL;
233 static void dnotify_adjust_changes( struct dir *dir )
235 #if defined(F_SETSIG) && defined(F_NOTIFY)
236 int fd = get_unix_fd( dir->fd );
237 unsigned int filter = dir->filter;
238 unsigned int val;
239 if ( 0 > fcntl( fd, F_SETSIG, SIGIO) )
240 return;
242 val = DN_MULTISHOT;
243 if (filter & FILE_NOTIFY_CHANGE_FILE_NAME)
244 val |= DN_RENAME | DN_DELETE | DN_CREATE;
245 if (filter & FILE_NOTIFY_CHANGE_DIR_NAME)
246 val |= DN_RENAME | DN_DELETE | DN_CREATE;
247 if (filter & FILE_NOTIFY_CHANGE_ATTRIBUTES)
248 val |= DN_ATTRIB;
249 if (filter & FILE_NOTIFY_CHANGE_SIZE)
250 val |= DN_MODIFY;
251 if (filter & FILE_NOTIFY_CHANGE_LAST_WRITE)
252 val |= DN_MODIFY;
253 if (filter & FILE_NOTIFY_CHANGE_LAST_ACCESS)
254 val |= DN_ACCESS;
255 if (filter & FILE_NOTIFY_CHANGE_CREATION)
256 val |= DN_CREATE;
257 if (filter & FILE_NOTIFY_CHANGE_SECURITY)
258 val |= DN_ATTRIB;
259 fcntl( fd, F_NOTIFY, val );
260 #endif
263 /* insert change in the global list */
264 static inline void insert_change( struct dir *dir )
266 sigset_t sigset;
268 sigemptyset( &sigset );
269 sigaddset( &sigset, SIGIO );
270 sigprocmask( SIG_BLOCK, &sigset, NULL );
271 list_add_head( &change_list, &dir->entry );
272 sigprocmask( SIG_UNBLOCK, &sigset, NULL );
275 /* remove change from the global list */
276 static inline void remove_change( struct dir *dir )
278 sigset_t sigset;
280 sigemptyset( &sigset );
281 sigaddset( &sigset, SIGIO );
282 sigprocmask( SIG_BLOCK, &sigset, NULL );
283 list_remove( &dir->entry );
284 sigprocmask( SIG_UNBLOCK, &sigset, NULL );
287 static void dir_dump( struct object *obj, int verbose )
289 struct dir *dir = (struct dir *)obj;
290 assert( obj->ops == &dir_ops );
291 fprintf( stderr, "Dirfile fd=%p filter=%08x\n", dir->fd, dir->filter );
294 /* enter here directly from SIGIO signal handler */
295 void do_change_notify( int unix_fd )
297 struct dir *dir;
299 /* FIXME: this is O(n) ... probably can be improved */
300 LIST_FOR_EACH_ENTRY( dir, &change_list, struct dir, entry )
302 if (get_unix_fd( dir->fd ) != unix_fd) continue;
303 dir->notified = 1;
304 break;
308 /* SIGIO callback, called synchronously with the poll loop */
309 void sigio_callback(void)
311 struct dir *dir;
313 LIST_FOR_EACH_ENTRY( dir, &change_list, struct dir, entry )
315 if (!dir->notified) continue;
316 dir->notified = 0;
317 fd_async_wake_up( dir->fd, ASYNC_TYPE_WAIT, STATUS_ALERTED );
321 static struct fd *dir_get_fd( struct object *obj )
323 struct dir *dir = (struct dir *)obj;
324 assert( obj->ops == &dir_ops );
325 return (struct fd *)grab_object( dir->fd );
328 static int get_dir_unix_fd( struct dir *dir )
330 return get_unix_fd( dir->fd );
333 static struct security_descriptor *dir_get_sd( struct object *obj )
335 struct dir *dir = (struct dir *)obj;
336 int unix_fd;
337 struct stat st;
338 struct security_descriptor *sd;
339 assert( obj->ops == &dir_ops );
341 unix_fd = get_dir_unix_fd( dir );
343 if (unix_fd == -1 || fstat( unix_fd, &st ) == -1)
344 return obj->sd;
346 /* mode and uid the same? if so, no need to re-generate security descriptor */
347 if (obj->sd &&
348 (st.st_mode & (S_IRWXU|S_IRWXO)) == (dir->mode & (S_IRWXU|S_IRWXO)) &&
349 (st.st_uid == dir->uid))
350 return obj->sd;
352 sd = mode_to_sd( st.st_mode,
353 security_unix_uid_to_sid( st.st_uid ),
354 token_get_primary_group( current->process->token ));
355 if (!sd) return obj->sd;
357 dir->mode = st.st_mode;
358 dir->uid = st.st_uid;
359 free( obj->sd );
360 obj->sd = sd;
361 return sd;
364 static int dir_set_sd( struct object *obj, const struct security_descriptor *sd,
365 unsigned int set_info )
367 struct dir *dir = (struct dir *)obj;
368 const SID *owner;
369 struct stat st;
370 mode_t mode;
371 int unix_fd;
373 assert( obj->ops == &dir_ops );
375 unix_fd = get_dir_unix_fd( dir );
377 if (unix_fd == -1 || fstat( unix_fd, &st ) == -1) return 1;
379 if (set_info & OWNER_SECURITY_INFORMATION)
381 owner = sd_get_owner( sd );
382 if (!owner)
384 set_error( STATUS_INVALID_SECURITY_DESCR );
385 return 0;
387 if (!obj->sd || !security_equal_sid( owner, sd_get_owner( obj->sd ) ))
389 /* FIXME: get Unix uid and call fchown */
392 else if (obj->sd)
393 owner = sd_get_owner( obj->sd );
394 else
395 owner = token_get_user( current->process->token );
397 if (set_info & DACL_SECURITY_INFORMATION)
399 /* keep the bits that we don't map to access rights in the ACL */
400 mode = st.st_mode & (S_ISUID|S_ISGID|S_ISVTX);
401 mode |= sd_to_mode( sd, owner );
403 if (((st.st_mode ^ mode) & (S_IRWXU|S_IRWXG|S_IRWXO)) && fchmod( unix_fd, mode ) == -1)
405 file_set_error();
406 return 0;
409 return 1;
412 static struct change_record *get_first_change_record( struct dir *dir )
414 struct list *ptr = list_head( &dir->change_records );
415 if (!ptr) return NULL;
416 list_remove( ptr );
417 return LIST_ENTRY( ptr, struct change_record, entry );
420 static int dir_close_handle( struct object *obj, struct process *process, obj_handle_t handle )
422 struct dir *dir = (struct dir *)obj;
424 if (obj->handle_count == 1) release_dir_cache_entry( dir ); /* closing last handle, release cache */
425 return 1; /* ok to close */
428 static void dir_destroy( struct object *obj )
430 struct change_record *record;
431 struct dir *dir = (struct dir *)obj;
432 assert (obj->ops == &dir_ops);
434 if (dir->filter)
435 remove_change( dir );
437 if (dir->inode)
439 list_remove( &dir->in_entry );
440 free_inode( dir->inode );
443 while ((record = get_first_change_record( dir ))) free( record );
445 release_dir_cache_entry( dir );
446 release_object( dir->fd );
448 if (inotify_fd && list_empty( &change_list ))
450 release_object( inotify_fd );
451 inotify_fd = NULL;
455 struct dir *get_dir_obj( struct process *process, obj_handle_t handle, unsigned int access )
457 return (struct dir *)get_handle_obj( process, handle, access, &dir_ops );
460 static int dir_get_poll_events( struct fd *fd )
462 return 0;
465 static enum server_fd_type dir_get_fd_type( struct fd *fd )
467 return FD_TYPE_DIR;
470 #ifdef HAVE_SYS_INOTIFY_H
472 #define HASH_SIZE 31
474 struct inode {
475 struct list ch_entry; /* entry in the children list */
476 struct list children; /* children of this inode */
477 struct inode *parent; /* parent of this inode */
478 struct list dirs; /* directory handles watching this inode */
479 struct list ino_entry; /* entry in the inode hash */
480 struct list wd_entry; /* entry in the watch descriptor hash */
481 dev_t dev; /* device number */
482 ino_t ino; /* device's inode number */
483 int wd; /* inotify's watch descriptor */
484 char *name; /* basename name of the inode */
487 static struct list inode_hash[ HASH_SIZE ];
488 static struct list wd_hash[ HASH_SIZE ];
490 static int inotify_add_dir( char *path, unsigned int filter );
492 static struct inode *inode_from_wd( int wd )
494 struct list *bucket = &wd_hash[ wd % HASH_SIZE ];
495 struct inode *inode;
497 LIST_FOR_EACH_ENTRY( inode, bucket, struct inode, wd_entry )
498 if (inode->wd == wd)
499 return inode;
501 return NULL;
504 static inline struct list *get_hash_list( dev_t dev, ino_t ino )
506 return &inode_hash[ (ino ^ dev) % HASH_SIZE ];
509 static struct inode *find_inode( dev_t dev, ino_t ino )
511 struct list *bucket = get_hash_list( dev, ino );
512 struct inode *inode;
514 LIST_FOR_EACH_ENTRY( inode, bucket, struct inode, ino_entry )
515 if (inode->ino == ino && inode->dev == dev)
516 return inode;
518 return NULL;
521 static struct inode *create_inode( dev_t dev, ino_t ino )
523 struct inode *inode;
525 inode = malloc( sizeof *inode );
526 if (inode)
528 list_init( &inode->children );
529 list_init( &inode->dirs );
530 inode->ino = ino;
531 inode->dev = dev;
532 inode->wd = -1;
533 inode->parent = NULL;
534 inode->name = NULL;
535 list_add_tail( get_hash_list( dev, ino ), &inode->ino_entry );
537 return inode;
540 static struct inode *get_inode( dev_t dev, ino_t ino )
542 struct inode *inode;
544 inode = find_inode( dev, ino );
545 if (inode)
546 return inode;
547 return create_inode( dev, ino );
550 static void inode_set_wd( struct inode *inode, int wd )
552 if (inode->wd != -1)
553 list_remove( &inode->wd_entry );
554 inode->wd = wd;
555 list_add_tail( &wd_hash[ wd % HASH_SIZE ], &inode->wd_entry );
558 static void inode_set_name( struct inode *inode, const char *name )
560 free (inode->name);
561 inode->name = name ? strdup( name ) : NULL;
564 static void free_inode( struct inode *inode )
566 int subtree = 0, watches = 0;
567 struct inode *tmp, *next;
568 struct dir *dir;
570 LIST_FOR_EACH_ENTRY( dir, &inode->dirs, struct dir, in_entry )
572 subtree |= dir->subtree;
573 watches++;
576 if (!subtree && !inode->parent)
578 LIST_FOR_EACH_ENTRY_SAFE( tmp, next, &inode->children,
579 struct inode, ch_entry )
581 assert( tmp != inode );
582 assert( tmp->parent == inode );
583 free_inode( tmp );
587 if (watches)
588 return;
590 if (inode->parent)
591 list_remove( &inode->ch_entry );
593 /* disconnect remaining children from the parent */
594 LIST_FOR_EACH_ENTRY_SAFE( tmp, next, &inode->children, struct inode, ch_entry )
596 list_remove( &tmp->ch_entry );
597 tmp->parent = NULL;
600 if (inode->wd != -1)
602 inotify_rm_watch( get_unix_fd( inotify_fd ), inode->wd );
603 list_remove( &inode->wd_entry );
605 list_remove( &inode->ino_entry );
607 free( inode->name );
608 free( inode );
611 static struct inode *inode_add( struct inode *parent,
612 dev_t dev, ino_t ino, const char *name )
614 struct inode *inode;
616 inode = get_inode( dev, ino );
617 if (!inode)
618 return NULL;
620 if (!inode->parent)
622 list_add_tail( &parent->children, &inode->ch_entry );
623 inode->parent = parent;
624 assert( inode != parent );
626 inode_set_name( inode, name );
628 return inode;
631 static struct inode *inode_from_name( struct inode *inode, const char *name )
633 struct inode *i;
635 LIST_FOR_EACH_ENTRY( i, &inode->children, struct inode, ch_entry )
636 if (i->name && !strcmp( i->name, name ))
637 return i;
638 return NULL;
641 static int inotify_get_poll_events( struct fd *fd );
642 static void inotify_poll_event( struct fd *fd, int event );
644 static const struct fd_ops inotify_fd_ops =
646 inotify_get_poll_events, /* get_poll_events */
647 inotify_poll_event, /* poll_event */
648 NULL, /* flush */
649 NULL, /* get_fd_type */
650 NULL, /* ioctl */
651 NULL, /* queue_async */
652 NULL /* reselect_async */
655 static int inotify_get_poll_events( struct fd *fd )
657 return POLLIN;
660 static void inotify_do_change_notify( struct dir *dir, unsigned int action,
661 unsigned int cookie, const char *relpath )
663 struct change_record *record;
665 assert( dir->obj.ops == &dir_ops );
667 if (dir->want_data)
669 size_t len = strlen(relpath);
670 record = malloc( offsetof(struct change_record, event.name[len]) );
671 if (!record)
672 return;
674 record->cookie = cookie;
675 record->event.action = action;
676 memcpy( record->event.name, relpath, len );
677 record->event.len = len;
679 list_add_tail( &dir->change_records, &record->entry );
682 fd_async_wake_up( dir->fd, ASYNC_TYPE_WAIT, STATUS_ALERTED );
685 static unsigned int filter_from_event( struct inotify_event *ie )
687 unsigned int filter = 0;
689 if (ie->mask & (IN_MOVED_FROM | IN_MOVED_TO | IN_DELETE | IN_CREATE))
690 filter |= FILE_NOTIFY_CHANGE_FILE_NAME | FILE_NOTIFY_CHANGE_DIR_NAME;
691 if (ie->mask & IN_MODIFY)
692 filter |= FILE_NOTIFY_CHANGE_SIZE | FILE_NOTIFY_CHANGE_LAST_WRITE | FILE_NOTIFY_CHANGE_LAST_ACCESS;
693 if (ie->mask & IN_ATTRIB)
694 filter |= FILE_NOTIFY_CHANGE_ATTRIBUTES | FILE_NOTIFY_CHANGE_SECURITY;
695 if (ie->mask & IN_CREATE)
696 filter |= FILE_NOTIFY_CHANGE_CREATION;
698 if (ie->mask & IN_ISDIR)
699 filter &= ~FILE_NOTIFY_CHANGE_FILE_NAME;
700 else
701 filter &= ~FILE_NOTIFY_CHANGE_DIR_NAME;
703 return filter;
706 /* scan up the parent directories for watches */
707 static unsigned int filter_from_inode( struct inode *inode, int is_parent )
709 unsigned int filter = 0;
710 struct dir *dir;
712 /* combine filters from parents watching subtrees */
713 while (inode)
715 LIST_FOR_EACH_ENTRY( dir, &inode->dirs, struct dir, in_entry )
716 if (dir->subtree || !is_parent)
717 filter |= dir->filter;
718 is_parent = 1;
719 inode = inode->parent;
722 return filter;
725 static char *inode_get_path( struct inode *inode, int sz )
727 struct list *head;
728 char *path;
729 int len;
731 if (!inode)
732 return NULL;
734 head = list_head( &inode->dirs );
735 if (head)
737 int unix_fd = get_unix_fd( LIST_ENTRY( head, struct dir, in_entry )->fd );
738 path = malloc ( 32 + sz );
739 if (path)
740 sprintf( path, "/proc/self/fd/%u/", unix_fd );
741 return path;
744 if (!inode->name)
745 return NULL;
747 len = strlen( inode->name );
748 path = inode_get_path( inode->parent, sz + len + 1 );
749 if (!path)
750 return NULL;
752 strcat( path, inode->name );
753 strcat( path, "/" );
755 return path;
758 static void inode_check_dir( struct inode *parent, const char *name )
760 char *path;
761 unsigned int filter;
762 struct inode *inode;
763 struct stat st;
764 int wd = -1;
766 path = inode_get_path( parent, strlen(name) );
767 if (!path)
768 return;
770 strcat( path, name );
772 if (stat( path, &st ) < 0)
773 goto end;
775 filter = filter_from_inode( parent, 1 );
776 if (!filter)
777 goto end;
779 inode = inode_add( parent, st.st_dev, st.st_ino, name );
780 if (!inode || inode->wd != -1)
781 goto end;
783 wd = inotify_add_dir( path, filter );
784 if (wd != -1)
785 inode_set_wd( inode, wd );
786 else
787 free_inode( inode );
789 end:
790 free( path );
793 static int prepend( char **path, const char *segment )
795 int extra;
796 char *p;
798 extra = strlen( segment ) + 1;
799 if (*path)
801 int len = strlen( *path ) + 1;
802 p = realloc( *path, len + extra );
803 if (!p) return 0;
804 memmove( &p[ extra ], p, len );
805 p[ extra - 1 ] = '/';
806 memcpy( p, segment, extra - 1 );
808 else
810 p = malloc( extra );
811 if (!p) return 0;
812 memcpy( p, segment, extra );
815 *path = p;
817 return 1;
820 static void inotify_notify_all( struct inotify_event *ie )
822 unsigned int filter, action;
823 struct inode *inode, *i;
824 char *path = NULL;
825 struct dir *dir;
827 inode = inode_from_wd( ie->wd );
828 if (!inode)
830 fprintf( stderr, "no inode matches %d\n", ie->wd);
831 return;
834 filter = filter_from_event( ie );
836 if (ie->mask & IN_CREATE)
838 if (ie->mask & IN_ISDIR)
839 inode_check_dir( inode, ie->name );
841 action = FILE_ACTION_ADDED;
843 else if (ie->mask & IN_DELETE)
844 action = FILE_ACTION_REMOVED;
845 else if (ie->mask & IN_MOVED_FROM)
846 action = FILE_ACTION_RENAMED_OLD_NAME;
847 else if (ie->mask & IN_MOVED_TO)
848 action = FILE_ACTION_RENAMED_NEW_NAME;
849 else
850 action = FILE_ACTION_MODIFIED;
853 * Work our way up the inode hierarchy
854 * extending the relative path as we go
855 * and notifying all recursive watches.
857 if (!prepend( &path, ie->name ))
858 return;
860 for (i = inode; i; i = i->parent)
862 LIST_FOR_EACH_ENTRY( dir, &i->dirs, struct dir, in_entry )
863 if ((filter & dir->filter) && (i==inode || dir->subtree))
864 inotify_do_change_notify( dir, action, ie->cookie, path );
866 if (!i->name || !prepend( &path, i->name ))
867 break;
870 free( path );
872 if (ie->mask & IN_DELETE)
874 i = inode_from_name( inode, ie->name );
875 if (i)
876 free_inode( i );
880 static void inotify_poll_event( struct fd *fd, int event )
882 int r, ofs, unix_fd;
883 char buffer[0x1000];
884 struct inotify_event *ie;
886 unix_fd = get_unix_fd( fd );
887 r = read( unix_fd, buffer, sizeof buffer );
888 if (r < 0)
890 fprintf(stderr,"inotify_poll_event(): inotify read failed!\n");
891 return;
894 for( ofs = 0; ofs < r - offsetof(struct inotify_event, name); )
896 ie = (struct inotify_event*) &buffer[ofs];
897 ofs += offsetof( struct inotify_event, name[ie->len] );
898 if (ofs > r) break;
899 if (ie->len) inotify_notify_all( ie );
903 static inline struct fd *create_inotify_fd( void )
905 int unix_fd;
907 unix_fd = inotify_init();
908 if (unix_fd<0)
909 return NULL;
910 return create_anonymous_fd( &inotify_fd_ops, unix_fd, NULL, 0 );
913 static int map_flags( unsigned int filter )
915 unsigned int mask;
917 /* always watch these so we can track subdirectories in recursive watches */
918 mask = (IN_MOVED_FROM | IN_MOVED_TO | IN_DELETE | IN_CREATE | IN_DELETE_SELF);
920 if (filter & FILE_NOTIFY_CHANGE_ATTRIBUTES)
921 mask |= IN_ATTRIB;
922 if (filter & FILE_NOTIFY_CHANGE_SIZE)
923 mask |= IN_MODIFY;
924 if (filter & FILE_NOTIFY_CHANGE_LAST_WRITE)
925 mask |= IN_MODIFY;
926 if (filter & FILE_NOTIFY_CHANGE_LAST_ACCESS)
927 mask |= IN_MODIFY;
928 if (filter & FILE_NOTIFY_CHANGE_SECURITY)
929 mask |= IN_ATTRIB;
931 return mask;
934 static int inotify_add_dir( char *path, unsigned int filter )
936 int wd = inotify_add_watch( get_unix_fd( inotify_fd ),
937 path, map_flags( filter ) );
938 if (wd != -1)
939 set_fd_events( inotify_fd, POLLIN );
940 return wd;
943 static int init_inotify( void )
945 int i;
947 if (inotify_fd)
948 return 1;
950 inotify_fd = create_inotify_fd();
951 if (!inotify_fd)
952 return 0;
954 for (i=0; i<HASH_SIZE; i++)
956 list_init( &inode_hash[i] );
957 list_init( &wd_hash[i] );
960 return 1;
963 static int inotify_adjust_changes( struct dir *dir )
965 unsigned int filter;
966 struct inode *inode;
967 struct stat st;
968 char path[32];
969 int wd, unix_fd;
971 if (!inotify_fd)
972 return 0;
974 unix_fd = get_unix_fd( dir->fd );
976 inode = dir->inode;
977 if (!inode)
979 /* check if this fd is already being watched */
980 if (-1 == fstat( unix_fd, &st ))
981 return 0;
983 inode = get_inode( st.st_dev, st.st_ino );
984 if (!inode)
985 inode = create_inode( st.st_dev, st.st_ino );
986 if (!inode)
987 return 0;
988 list_add_tail( &inode->dirs, &dir->in_entry );
989 dir->inode = inode;
992 filter = filter_from_inode( inode, 0 );
994 sprintf( path, "/proc/self/fd/%u", unix_fd );
995 wd = inotify_add_dir( path, filter );
996 if (wd == -1) return 0;
998 inode_set_wd( inode, wd );
1000 return 1;
1003 static char *get_basename( const char *link )
1005 char *buffer, *name = NULL;
1006 int r, n = 0x100;
1008 while (1)
1010 buffer = malloc( n );
1011 if (!buffer) return NULL;
1013 r = readlink( link, buffer, n );
1014 if (r < 0)
1015 break;
1017 if (r < n)
1019 name = buffer;
1020 break;
1022 free( buffer );
1023 n *= 2;
1026 if (name)
1028 while (r > 0 && name[ r - 1 ] == '/' )
1029 r--;
1030 name[ r ] = 0;
1032 name = strrchr( name, '/' );
1033 if (name)
1034 name = strdup( &name[1] );
1037 free( buffer );
1038 return name;
1041 static int dir_add_to_existing_notify( struct dir *dir )
1043 struct inode *inode, *parent;
1044 unsigned int filter = 0;
1045 struct stat st, st_new;
1046 char link[35], *name;
1047 int wd, unix_fd;
1049 if (!inotify_fd)
1050 return 0;
1052 unix_fd = get_unix_fd( dir->fd );
1054 /* check if it's in the list of inodes we want to watch */
1055 if (-1 == fstat( unix_fd, &st_new ))
1056 return 0;
1057 inode = find_inode( st_new.st_dev, st_new.st_ino );
1058 if (inode)
1059 return 0;
1061 /* lookup the parent */
1062 sprintf( link, "/proc/self/fd/%u/..", unix_fd );
1063 if (-1 == stat( link, &st ))
1064 return 0;
1067 * If there's no parent, stop. We could keep going adding
1068 * ../ to the path until we hit the root of the tree or
1069 * find a recursively watched ancestor.
1070 * Assume it's too expensive to search up the tree for now.
1072 parent = find_inode( st.st_dev, st.st_ino );
1073 if (!parent)
1074 return 0;
1076 if (parent->wd == -1)
1077 return 0;
1079 filter = filter_from_inode( parent, 1 );
1080 if (!filter)
1081 return 0;
1083 sprintf( link, "/proc/self/fd/%u", unix_fd );
1084 name = get_basename( link );
1085 if (!name)
1086 return 0;
1087 inode = inode_add( parent, st_new.st_dev, st_new.st_ino, name );
1088 free( name );
1089 if (!inode)
1090 return 0;
1092 /* Couldn't find this inode at the start of the function, must be new */
1093 assert( inode->wd == -1 );
1095 wd = inotify_add_dir( link, filter );
1096 if (wd != -1)
1097 inode_set_wd( inode, wd );
1099 return 1;
1102 #else
1104 static int init_inotify( void )
1106 return 0;
1109 static int inotify_adjust_changes( struct dir *dir )
1111 return 0;
1114 static void free_inode( struct inode *inode )
1116 assert( 0 );
1119 static int dir_add_to_existing_notify( struct dir *dir )
1121 return 0;
1124 #endif /* HAVE_SYS_INOTIFY_H */
1126 struct object *create_dir_obj( struct fd *fd, unsigned int access, mode_t mode )
1128 struct dir *dir;
1130 dir = alloc_object( &dir_ops );
1131 if (!dir)
1132 return NULL;
1134 list_init( &dir->change_records );
1135 dir->filter = 0;
1136 dir->notified = 0;
1137 dir->want_data = 0;
1138 dir->inode = NULL;
1139 grab_object( fd );
1140 dir->fd = fd;
1141 dir->mode = mode;
1142 dir->uid = ~(uid_t)0;
1143 dir->client_process = NULL;
1144 set_fd_user( fd, &dir_fd_ops, &dir->obj );
1146 dir_add_to_existing_notify( dir );
1148 return &dir->obj;
1151 /* retrieve (or allocate) the client-side directory cache entry */
1152 DECL_HANDLER(get_directory_cache_entry)
1154 struct dir *dir;
1155 int *free_entries;
1156 data_size_t free_size;
1158 if (!(dir = get_dir_obj( current->process, req->handle, 0 ))) return;
1160 if (!dir->client_process)
1162 if ((dir->client_entry = alloc_dir_cache_entry( dir, current->process )) == -1) goto done;
1163 dir->client_process = (struct process *)grab_object( current->process );
1166 if (dir->client_process == current->process) reply->entry = dir->client_entry;
1167 else set_error( STATUS_SHARING_VIOLATION );
1169 done: /* allow freeing entries even on failure */
1170 free_size = get_reply_max_size();
1171 free_entries = get_free_dir_cache_entries( current->process, &free_size );
1172 if (free_entries) set_reply_data_ptr( free_entries, free_size );
1174 release_object( dir );
1177 /* enable change notifications for a directory */
1178 DECL_HANDLER(read_directory_changes)
1180 struct dir *dir;
1181 struct async *async;
1183 if (!req->filter)
1185 set_error(STATUS_INVALID_PARAMETER);
1186 return;
1189 dir = get_dir_obj( current->process, req->async.handle, 0 );
1190 if (!dir)
1191 return;
1193 /* requests don't timeout */
1194 if (!(async = create_async( dir->fd, current, &req->async, NULL ))) goto end;
1195 fd_queue_async( dir->fd, async, ASYNC_TYPE_WAIT );
1197 /* assign it once */
1198 if (!dir->filter)
1200 init_inotify();
1201 insert_change( dir );
1202 dir->filter = req->filter;
1203 dir->subtree = req->subtree;
1204 dir->want_data = req->want_data;
1207 /* if there's already a change in the queue, send it */
1208 if (!list_empty( &dir->change_records ))
1209 fd_async_wake_up( dir->fd, ASYNC_TYPE_WAIT, STATUS_ALERTED );
1211 /* setup the real notification */
1212 if (!inotify_adjust_changes( dir ))
1213 dnotify_adjust_changes( dir );
1215 set_error(STATUS_PENDING);
1217 release_object( async );
1218 end:
1219 release_object( dir );
1222 DECL_HANDLER(read_change)
1224 struct change_record *record, *next;
1225 struct dir *dir;
1226 struct list events;
1227 char *data, *event;
1228 int size = 0;
1230 dir = get_dir_obj( current->process, req->handle, 0 );
1231 if (!dir)
1232 return;
1234 list_init( &events );
1235 list_move_tail( &events, &dir->change_records );
1236 release_object( dir );
1238 if (list_empty( &events ))
1240 set_error( STATUS_NO_DATA_DETECTED );
1241 return;
1244 LIST_FOR_EACH_ENTRY( record, &events, struct change_record, entry )
1246 size += (offsetof(struct filesystem_event, name[record->event.len])
1247 + sizeof(int)-1) / sizeof(int) * sizeof(int);
1250 if (size > get_reply_max_size())
1251 set_error( STATUS_BUFFER_TOO_SMALL );
1252 else if ((data = mem_alloc( size )) != NULL)
1254 event = data;
1255 LIST_FOR_EACH_ENTRY( record, &events, struct change_record, entry )
1257 data_size_t len = offsetof( struct filesystem_event, name[record->event.len] );
1259 /* FIXME: rename events are sometimes reported as delete/create */
1260 if (record->event.action == FILE_ACTION_RENAMED_OLD_NAME)
1262 struct list *elem = list_next( &events, &record->entry );
1263 if (elem)
1264 next = LIST_ENTRY(elem, struct change_record, entry);
1266 if (elem && next->cookie == record->cookie)
1267 next->cookie = 0;
1268 else
1269 record->event.action = FILE_ACTION_REMOVED;
1271 else if (record->event.action == FILE_ACTION_RENAMED_NEW_NAME && record->cookie)
1272 record->event.action = FILE_ACTION_ADDED;
1274 memcpy( event, &record->event, len );
1275 event += len;
1276 if (len % sizeof(int))
1278 memset( event, 0, sizeof(int) - len % sizeof(int) );
1279 event += sizeof(int) - len % sizeof(int);
1282 set_reply_data_ptr( data, size );
1285 LIST_FOR_EACH_ENTRY_SAFE( record, next, &events, struct change_record, entry )
1287 list_remove( &record->entry );
1288 free( record );