change.c 26.7 KB
Newer Older
1 2 3 4
/*
 * Server-side change notification management
 *
 * Copyright (C) 1998 Alexandre Julliard
5
 * Copyright (C) 2006 Mike McCormack
6 7 8 9 10 11 12 13 14 15 16 17 18
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * 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
20 21
 */

22 23 24
#include "config.h"
#include "wine/port.h"

25
#include <assert.h>
26
#include <fcntl.h>
27 28
#include <stdio.h>
#include <stdlib.h>
29
#include <signal.h>
30
#include <sys/stat.h>
31 32 33
#include <sys/types.h>
#include <limits.h>
#include <dirent.h>
34 35 36 37
#include <errno.h>
#ifdef HAVE_SYS_ERRNO_H
#include <sys/errno.h>
#endif
38

39 40
#include "ntstatus.h"
#define WIN32_NO_STATUS
41
#include "windef.h"
42

43
#include "file.h"
44 45
#include "handle.h"
#include "thread.h"
46
#include "request.h"
47
#include "winternl.h"
48

49 50
/* dnotify support */

51 52 53 54 55 56 57 58 59 60 61 62 63
#ifdef linux
#ifndef F_NOTIFY
#define F_NOTIFY 1026
#define DN_ACCESS       0x00000001      /* File accessed */
#define DN_MODIFY       0x00000002      /* File modified */
#define DN_CREATE       0x00000004      /* File created */
#define DN_DELETE       0x00000008      /* File removed */
#define DN_RENAME       0x00000010      /* File renamed */
#define DN_ATTRIB       0x00000020      /* File changed attibutes */
#define DN_MULTISHOT    0x80000000      /* Don't remove notifier */
#endif
#endif

64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127
/* inotify support */

#if defined(__linux__) && defined(__i386__)

#define SYS_inotify_init	291
#define SYS_inotify_add_watch	292
#define SYS_inotify_rm_watch	293

struct inotify_event {
    int           wd;
    unsigned int  mask;
    unsigned int  cookie;
    unsigned int  len;
    char          name[1];
};

#define IN_ACCESS        0x00000001
#define IN_MODIFY        0x00000002
#define IN_ATTRIB        0x00000004
#define IN_CLOSE_WRITE   0x00000008
#define IN_CLOSE_NOWRITE 0x00000010
#define IN_OPEN          0x00000020
#define IN_MOVED_FROM    0x00000040
#define IN_MOVED_TO      0x00000080
#define IN_CREATE        0x00000100
#define IN_DELETE        0x00000200
#define IN_DELETE_SELF   0x00000400

static inline int inotify_init( void )
{
    int ret;
    __asm__ __volatile__( "int $0x80"
                          : "=a" (ret)
                          : "0" (SYS_inotify_init));
    if (ret<0) { errno = -ret; ret = -1; }
    return ret;
}

static inline int inotify_add_watch( int fd, const char *name, unsigned int mask )
{
    int ret;
    __asm__ __volatile__( "pushl %%ebx;\n\t"
                          "movl %2,%%ebx;\n\t"
                          "int $0x80;\n\t"
                          "popl %%ebx"
                          : "=a" (ret) : "0" (SYS_inotify_add_watch),
                            "r" (fd), "c" (name), "d" (mask) );
    if (ret<0) { errno = -ret; ret = -1; }
    return ret;
}

static inline int inotify_remove_watch( int fd, int wd )
{
    int ret;
    __asm__ __volatile__( "pushl %%ebx;\n\t"
                          "movl %2,%%ebx;\n\t"
                          "int $0x80;\n\t"
                          "popl %%ebx"
                          : "=a" (ret) : "0" (SYS_inotify_rm_watch),
                            "r" (fd), "c" (wd) );
    if (ret<0) { errno = -ret; ret = -1; }
    return ret;
}

128
#define USE_INOTIFY
129 130 131

#endif

132 133 134 135 136 137
struct inode;

static void free_inode( struct inode *inode );

static struct fd *inotify_fd;

138 139 140 141 142 143 144
struct change_record {
    struct list entry;
    int action;
    int len;
    char name[1];
};

145
struct dir
146 147
{
    struct object  obj;      /* object header */
148 149 150
    struct fd     *fd;       /* file descriptor to the directory */
    struct list    entry;    /* entry in global change notifications list */
    unsigned int   filter;   /* notification filter */
151
    int            notified; /* SIGIO counter */
152
    int            want_data; /* return change data */
153
    int            subtree;  /* do we want to watch subdirectories? */
154
    struct list    change_records;   /* data for the change */
155 156
    struct list    in_entry; /* entry in the inode dirs list */
    struct inode  *inode;    /* inode of the associated directory */
157 158
};

159 160 161
static struct fd *dir_get_fd( struct object *obj );
static void dir_dump( struct object *obj, int verbose );
static void dir_destroy( struct object *obj );
162

163
static const struct object_ops dir_ops =
164
{
165 166
    sizeof(struct dir),       /* size */
    dir_dump,                 /* dump */
167 168
    add_queue,                /* add_queue */
    remove_queue,             /* remove_queue */
169
    default_fd_signaled,      /* signaled */
170
    no_satisfied,             /* satisfied */
171
    no_signal,                /* signal */
172
    dir_get_fd,               /* get_fd */
173
    default_fd_map_access,    /* map_access */
174 175
    default_get_sd,           /* get_sd */
    default_set_sd,           /* set_sd */
176
    no_lookup_name,           /* lookup_name */
177
    no_open_file,             /* open_file */
178
    fd_close_handle,          /* close_handle */
179 180 181 182
    dir_destroy               /* destroy */
};

static int dir_get_poll_events( struct fd *fd );
183
static enum server_fd_type dir_get_fd_type( struct fd *fd );
184 185 186

static const struct fd_ops dir_fd_ops =
{
187 188 189
    dir_get_poll_events,         /* get_poll_events */
    default_poll_event,          /* poll_event */
    no_flush,                    /* flush */
190
    dir_get_fd_type,             /* get_fd_type */
191
    default_fd_ioctl,            /* ioctl */
192 193 194
    default_fd_queue_async,      /* queue_async */
    default_fd_reselect_async,   /* reselect_async */
    default_fd_cancel_async      /* cancel_async */
195 196
};

197 198
static struct list change_list = LIST_INIT(change_list);

199
static void dnotify_adjust_changes( struct dir *dir )
200
{
201
#if defined(F_SETSIG) && defined(F_NOTIFY)
202 203
    int fd = get_unix_fd( dir->fd );
    unsigned int filter = dir->filter;
204 205 206 207 208
    unsigned int val;
    if ( 0 > fcntl( fd, F_SETSIG, SIGIO) )
        return;

    val = DN_MULTISHOT;
209
    if (filter & FILE_NOTIFY_CHANGE_FILE_NAME)
210
        val |= DN_RENAME | DN_DELETE | DN_CREATE;
211
    if (filter & FILE_NOTIFY_CHANGE_DIR_NAME)
212
        val |= DN_RENAME | DN_DELETE | DN_CREATE;
213
    if (filter & FILE_NOTIFY_CHANGE_ATTRIBUTES)
214
        val |= DN_ATTRIB;
215
    if (filter & FILE_NOTIFY_CHANGE_SIZE)
216
        val |= DN_MODIFY;
217
    if (filter & FILE_NOTIFY_CHANGE_LAST_WRITE)
218
        val |= DN_MODIFY;
219
    if (filter & FILE_NOTIFY_CHANGE_LAST_ACCESS)
220
        val |= DN_ACCESS;
221
    if (filter & FILE_NOTIFY_CHANGE_CREATION)
222
        val |= DN_CREATE;
223
    if (filter & FILE_NOTIFY_CHANGE_SECURITY)
224 225 226 227 228 229
        val |= DN_ATTRIB;
    fcntl( fd, F_NOTIFY, val );
#endif
}

/* insert change in the global list */
230
static inline void insert_change( struct dir *dir )
231 232 233 234 235 236
{
    sigset_t sigset;

    sigemptyset( &sigset );
    sigaddset( &sigset, SIGIO );
    sigprocmask( SIG_BLOCK, &sigset, NULL );
237
    list_add_head( &change_list, &dir->entry );
238 239 240 241
    sigprocmask( SIG_UNBLOCK, &sigset, NULL );
}

/* remove change from the global list */
242
static inline void remove_change( struct dir *dir )
243 244 245 246 247 248
{
    sigset_t sigset;

    sigemptyset( &sigset );
    sigaddset( &sigset, SIGIO );
    sigprocmask( SIG_BLOCK, &sigset, NULL );
249
    list_remove( &dir->entry );
250 251
    sigprocmask( SIG_UNBLOCK, &sigset, NULL );
}
252

253
static void dir_dump( struct object *obj, int verbose )
254
{
255 256
    struct dir *dir = (struct dir *)obj;
    assert( obj->ops == &dir_ops );
257
    fprintf( stderr, "Dirfile fd=%p filter=%08x\n", dir->fd, dir->filter );
258 259 260 261 262
}

/* enter here directly from SIGIO signal handler */
void do_change_notify( int unix_fd )
{
263
    struct dir *dir;
264 265

    /* FIXME: this is O(n) ... probably can be improved */
266
    LIST_FOR_EACH_ENTRY( dir, &change_list, struct dir, entry )
267
    {
268 269
        if (get_unix_fd( dir->fd ) != unix_fd) continue;
        interlocked_xchg_add( &dir->notified, 1 );
270 271 272 273 274 275 276
        break;
    }
}

/* SIGIO callback, called synchronously with the poll loop */
void sigio_callback(void)
{
277
    struct dir *dir;
278

279
    LIST_FOR_EACH_ENTRY( dir, &change_list, struct dir, entry )
280
    {
281 282
        if (interlocked_xchg( &dir->notified, 0 ))
            fd_async_wake_up( dir->fd, ASYNC_TYPE_WAIT, STATUS_NOTIFY_ENUM_DIR );
283
    }
284 285
}

286
static struct fd *dir_get_fd( struct object *obj )
287
{
288 289 290 291
    struct dir *dir = (struct dir *)obj;
    assert( obj->ops == &dir_ops );
    return (struct fd *)grab_object( dir->fd );
}
292

293 294 295 296 297 298 299 300
static struct change_record *get_first_change_record( struct dir *dir )
{
    struct list *ptr = list_head( &dir->change_records );
    if (!ptr) return NULL;
    list_remove( ptr );
    return LIST_ENTRY( ptr, struct change_record, entry );
}

301 302
static void dir_destroy( struct object *obj )
{
303
    struct change_record *record;
304 305
    struct dir *dir = (struct dir *)obj;
    assert (obj->ops == &dir_ops);
306

307 308 309
    if (dir->filter)
        remove_change( dir );

310 311 312 313 314
    if (dir->inode)
    {
        list_remove( &dir->in_entry );
        free_inode( dir->inode );
    }
315

316 317
    while ((record = get_first_change_record( dir ))) free( record );

318
    release_object( dir->fd );
319 320 321 322 323 324

    if (inotify_fd && list_empty( &change_list ))
    {
        release_object( inotify_fd );
        inotify_fd = NULL;
    }
325 326 327 328 329 330 331 332 333 334 335
}

static struct dir *
get_dir_obj( struct process *process, obj_handle_t handle, unsigned int access )
{
    return (struct dir *)get_handle_obj( process, handle, access, &dir_ops );
}

static int dir_get_poll_events( struct fd *fd )
{
    return 0;
336 337
}

338
static enum server_fd_type dir_get_fd_type( struct fd *fd )
339
{
340
    return FD_TYPE_DIR;
341 342
}

343 344
#ifdef USE_INOTIFY

345 346 347
#define HASH_SIZE 31

struct inode {
348 349 350
    struct list ch_entry;    /* entry in the children list */
    struct list children;    /* children of this inode */
    struct inode *parent;    /* parent of this inode */
351 352 353 354 355 356
    struct list dirs;        /* directory handles watching this inode */
    struct list ino_entry;   /* entry in the inode hash */
    struct list wd_entry;    /* entry in the watch descriptor hash */
    dev_t dev;               /* device number */
    ino_t ino;               /* device's inode number */
    int wd;                  /* inotify's watch descriptor */
357
    char *name;              /* basename name of the inode */
358 359 360 361 362
};

struct list inode_hash[ HASH_SIZE ];
struct list wd_hash[ HASH_SIZE ];

363 364
static int inotify_add_dir( char *path, unsigned int filter );

365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
static struct inode *inode_from_wd( int wd )
{
    struct list *bucket = &wd_hash[ wd % HASH_SIZE ];
    struct inode *inode;

    LIST_FOR_EACH_ENTRY( inode, bucket, struct inode, wd_entry )
        if (inode->wd == wd)
            return inode;

    return NULL;
}

static inline struct list *get_hash_list( dev_t dev, ino_t ino )
{
    return &inode_hash[ (ino ^ dev) % HASH_SIZE ];
}

382
static struct inode *find_inode( dev_t dev, ino_t ino )
383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400
{
    struct list *bucket = get_hash_list( dev, ino );
    struct inode *inode;

    LIST_FOR_EACH_ENTRY( inode, bucket, struct inode, ino_entry )
        if (inode->ino == ino && inode->dev == dev)
             return inode;

    return NULL;
}

static struct inode *create_inode( dev_t dev, ino_t ino )
{
    struct inode *inode;

    inode = malloc( sizeof *inode );
    if (inode)
    {
401
        list_init( &inode->children );
402 403 404 405
        list_init( &inode->dirs );
        inode->ino = ino;
        inode->dev = dev;
        inode->wd = -1;
406 407
        inode->parent = NULL;
        inode->name = NULL;
408 409 410 411 412
        list_add_tail( get_hash_list( dev, ino ), &inode->ino_entry );
    }
    return inode;
}

413 414 415 416 417 418 419 420 421 422
static struct inode *get_inode( dev_t dev, ino_t ino )
{
    struct inode *inode;

    inode = find_inode( dev, ino );
    if (inode)
        return inode;
    return create_inode( dev, ino );
}

423 424 425 426 427 428 429 430
static void inode_set_wd( struct inode *inode, int wd )
{
    if (inode->wd != -1)
        list_remove( &inode->wd_entry );
    inode->wd = wd;
    list_add_tail( &wd_hash[ wd % HASH_SIZE ], &inode->wd_entry );
}

431 432
static void inode_set_name( struct inode *inode, const char *name )
{
433
    free (inode->name);
434 435 436
    inode->name = name ? strdup( name ) : NULL;
}

437 438
static void free_inode( struct inode *inode )
{
439 440 441 442 443 444 445 446 447 448 449
    int subtree = 0, watches = 0;
    struct dir *dir;

    LIST_FOR_EACH_ENTRY( dir, &inode->dirs, struct dir, in_entry )
    {
        subtree |= dir->subtree;
        watches++;
    }

    if (!subtree && !inode->parent)
    {
450 451 452
        struct inode *tmp, *next;
        LIST_FOR_EACH_ENTRY_SAFE( tmp, next, &inode->children,
                                  struct inode, ch_entry )
453 454 455 456 457 458 459 460
        {
            assert( tmp != inode );
            assert( tmp->parent == inode );
            free_inode( tmp );
        }
    }

    if (watches)
461 462
        return;

463 464 465
    if (inode->parent)
        list_remove( &inode->ch_entry );

466 467 468 469 470 471
    if (inode->wd != -1)
    {
        inotify_remove_watch( get_unix_fd( inotify_fd ), inode->wd );
        list_remove( &inode->wd_entry );
    }
    list_remove( &inode->ino_entry );
472 473

    free( inode->name );
474 475 476
    free( inode );
}

477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506
static struct inode *inode_add( struct inode *parent,
                                dev_t dev, ino_t ino, const char *name )
{
    struct inode *inode;
 
    inode = get_inode( dev, ino );
    if (!inode)
        return NULL;
 
    if (!inode->parent)
    {
        list_add_tail( &parent->children, &inode->ch_entry );
        inode->parent = parent;
        assert( inode != parent );
    }
    inode_set_name( inode, name );

    return inode;
}

static struct inode *inode_from_name( struct inode *inode, const char *name )
{
    struct inode *i;

    LIST_FOR_EACH_ENTRY( i, &inode->children, struct inode, ch_entry )
        if (i->name && !strcmp( i->name, name ))
            return i;
    return NULL;
}

507 508 509 510 511
static int inotify_get_poll_events( struct fd *fd );
static void inotify_poll_event( struct fd *fd, int event );

static const struct fd_ops inotify_fd_ops =
{
512 513
    inotify_get_poll_events,     /* get_poll_events */
    inotify_poll_event,          /* poll_event */
514 515
    NULL,                        /* flush */
    NULL,                        /* get_fd_type */
516
    NULL,                        /* ioctl */
517 518 519
    NULL,                        /* queue_async */
    NULL,                        /* reselect_async */
    NULL,                        /* cancel_async */
520 521 522 523 524 525 526
};

static int inotify_get_poll_events( struct fd *fd )
{
    return POLLIN;
}

527 528
static void inotify_do_change_notify( struct dir *dir, unsigned int action,
                                      const char *relpath )
529
{
530 531
    struct change_record *record;

532 533
    assert( dir->obj.ops == &dir_ops );

534 535
    if (dir->want_data)
    {
536
        size_t len = strlen(relpath);
537
        record = malloc( offsetof(struct change_record, name[len]) );
538 539 540
        if (!record)
            return;

541 542
        record->action = action;
        memcpy( record->name, relpath, len );
543
        record->len = len;
544 545 546

        list_add_tail( &dir->change_records, &record->entry );
    }
547

548
    fd_async_wake_up( dir->fd, ASYNC_TYPE_WAIT, STATUS_ALERTED );
549 550
}

551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568
static unsigned int filter_from_event( struct inotify_event *ie )
{
    unsigned int filter = 0;

    if (ie->mask & (IN_MOVED_FROM | IN_MOVED_TO | IN_DELETE | IN_CREATE))
        filter |= FILE_NOTIFY_CHANGE_FILE_NAME | FILE_NOTIFY_CHANGE_DIR_NAME;
    if (ie->mask & IN_MODIFY)
        filter |= FILE_NOTIFY_CHANGE_SIZE | FILE_NOTIFY_CHANGE_LAST_WRITE;
    if (ie->mask & IN_ATTRIB)
        filter |= FILE_NOTIFY_CHANGE_ATTRIBUTES | FILE_NOTIFY_CHANGE_SECURITY;
    if (ie->mask & IN_ACCESS)
        filter |= FILE_NOTIFY_CHANGE_LAST_ACCESS;
    if (ie->mask & IN_CREATE)
        filter |= FILE_NOTIFY_CHANGE_CREATION;

    return filter;
}

569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588
/* scan up the parent directories for watches */
static unsigned int filter_from_inode( struct inode *inode, int is_parent )
{
    unsigned int filter = 0;
    struct dir *dir;

    /* combine filters from parents watching subtrees */
    while (inode)
    {
        LIST_FOR_EACH_ENTRY( dir, &inode->dirs, struct dir, in_entry )
            if (dir->subtree || !is_parent)
                filter |= dir->filter;
        is_parent = 1;
        inode = inode->parent;
    }

    return filter;
}

static char *inode_get_path( struct inode *inode, int sz )
589 590
{
    struct list *head;
591 592 593 594 595
    char *path;
    int len;

    if (!inode)
        return NULL;
596 597

    head = list_head( &inode->dirs );
598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627
    if (head)
    {
        int unix_fd = get_unix_fd( LIST_ENTRY( head, struct dir, in_entry )->fd );
        path = malloc ( 32 + sz );
        if (path)
            sprintf( path, "/proc/self/fd/%u/", unix_fd );
        return path;
    }

    if (!inode->name)
        return NULL;

    len = strlen( inode->name );
    path = inode_get_path( inode->parent, sz + len + 1 );
    if (!path)
        return NULL;
    
    strcat( path, inode->name );
    strcat( path, "/" );

    return path;
}

static int inode_check_dir( struct inode *parent, const char *name )
{
    char *path;
    unsigned int filter;
    struct inode *inode;
    struct stat st;
    int wd = -1, r = -1;
628

629
    path = inode_get_path( parent, strlen(name) );
630
    if (!path)
631 632 633
        return r;

    strcat( path, name );
634 635

    r = stat( path, &st );
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
    if (r < 0) goto end;

    if (!S_ISDIR(st.st_mode))
    {
        r = 0;
        goto end;
    }

    r = 1;

    filter = filter_from_inode( parent, 1 );
    if (!filter)
        goto end;

    inode = inode_add( parent, st.st_dev, st.st_ino, name );
    if (!inode || inode->wd != -1)
        goto end;

    wd = inotify_add_dir( path, filter );
    if (wd != -1)
        inode_set_wd( inode, wd );
    else
        free_inode( inode );

end:
661
    free( path );
662 663
    return r;
}
664

665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689
static int prepend( char **path, const char *segment )
{
    int extra;
    char *p;

    extra = strlen( segment ) + 1;
    if (*path)
    {
        int len = strlen( *path ) + 1;
        p = realloc( *path, len + extra );
        if (!p) return 0;
        memmove( &p[ extra ], p, len );
        p[ extra - 1 ] = '/';
        memcpy( p, segment, extra - 1 );
    }
    else
    {
        p = malloc( extra );
        if (!p) return 0;
        memcpy( p, segment, extra );
    }

    *path = p;

    return 1;
690 691
}

692 693
static void inotify_notify_all( struct inotify_event *ie )
{
694
    unsigned int filter, action;
695 696
    struct inode *inode, *i;
    char *path = NULL;
697 698 699 700 701 702 703 704 705 706
    struct dir *dir;

    inode = inode_from_wd( ie->wd );
    if (!inode)
    {
        fprintf( stderr, "no inode matches %d\n", ie->wd);
        return;
    }

    filter = filter_from_event( ie );
707 708 709
    
    if (ie->mask & IN_CREATE)
    {
710
        switch (inode_check_dir( inode, ie->name ))
711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727
        {
        case 1:
            filter &= ~FILE_NOTIFY_CHANGE_FILE_NAME;
            break;
        case 0:
            filter &= ~FILE_NOTIFY_CHANGE_DIR_NAME;
            break;
        default:
            break;
            /* Maybe the file disappeared before we could check it? */
        }
        action = FILE_ACTION_ADDED;
    }
    else if (ie->mask & IN_DELETE)
        action = FILE_ACTION_REMOVED;
    else
        action = FILE_ACTION_MODIFIED;
728

729
    /*
730
     * Work our way up the inode hierarchy
731
     *  extending the relative path as we go
732
     *  and notifying all recursive watches.
733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754
     */
    if (!prepend( &path, ie->name ))
        return;

    for (i = inode; i; i = i->parent)
    {
        LIST_FOR_EACH_ENTRY( dir, &i->dirs, struct dir, in_entry )
            if ((filter & dir->filter) && (i==inode || dir->subtree))
                inotify_do_change_notify( dir, action, path );

        if (!i->name || !prepend( &path, i->name ))
            break;
    }

    free( path );

    if (ie->mask & IN_DELETE)
    {
        i = inode_from_name( inode, ie->name );
        if (i)
            free_inode( i );
    }
755 756
}

757 758 759 760 761 762 763 764 765 766 767 768 769 770
static void inotify_poll_event( struct fd *fd, int event )
{
    int r, ofs, unix_fd;
    char buffer[0x1000];
    struct inotify_event *ie;

    unix_fd = get_unix_fd( fd );
    r = read( unix_fd, buffer, sizeof buffer );
    if (r < 0)
    {
        fprintf(stderr,"inotify_poll_event(): inotify read failed!\n");
        return;
    }

771
    for( ofs = 0; ofs < r - offsetof(struct inotify_event, name); )
772 773 774 775
    {
        ie = (struct inotify_event*) &buffer[ofs];
        if (!ie->len)
            break;
776 777
        ofs += offsetof( struct inotify_event, name[ie->len] );
        if (ofs > r) break;
778
        inotify_notify_all( ie );
779 780 781
    }
}

782
static inline struct fd *create_inotify_fd( void )
783 784 785 786 787 788
{
    int unix_fd;

    unix_fd = inotify_init();
    if (unix_fd<0)
        return NULL;
789
    return create_anonymous_fd( &inotify_fd_ops, unix_fd, NULL, 0 );
790 791
}

792
static int map_flags( unsigned int filter )
793
{
794 795 796 797
    unsigned int mask;

    /* always watch these so we can track subdirectories in recursive watches */
    mask = (IN_MOVED_FROM | IN_MOVED_TO | IN_DELETE | IN_CREATE | IN_DELETE_SELF);
798

799 800 801 802 803 804 805 806 807 808 809
    if (filter & FILE_NOTIFY_CHANGE_ATTRIBUTES)
        mask |= IN_ATTRIB;
    if (filter & FILE_NOTIFY_CHANGE_SIZE)
        mask |= IN_MODIFY;
    if (filter & FILE_NOTIFY_CHANGE_LAST_WRITE)
        mask |= IN_MODIFY;
    if (filter & FILE_NOTIFY_CHANGE_LAST_ACCESS)
        mask |= IN_ACCESS;
    if (filter & FILE_NOTIFY_CHANGE_SECURITY)
        mask |= IN_ATTRIB;

810 811 812 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 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870
    return mask;
}

static int inotify_add_dir( char *path, unsigned int filter )
{
    int wd = inotify_add_watch( get_unix_fd( inotify_fd ),
                                path, map_flags( filter ) );
    if (wd != -1)
        set_fd_events( inotify_fd, POLLIN );
    return wd;
}

static int init_inotify( void )
{
    int i;

    if (inotify_fd)
        return 1;

    inotify_fd = create_inotify_fd();
    if (!inotify_fd)
        return 0;

    for (i=0; i<HASH_SIZE; i++)
    {
        list_init( &inode_hash[i] );
        list_init( &wd_hash[i] );
    }

    return 1;
}

static int inotify_adjust_changes( struct dir *dir )
{
    unsigned int filter;
    struct inode *inode;
    struct stat st;
    char path[32];
    int wd, unix_fd;

    if (!inotify_fd)
        return 0;

    unix_fd = get_unix_fd( dir->fd );

    inode = dir->inode;
    if (!inode)
    {
        /* check if this fd is already being watched */
        if (-1 == fstat( unix_fd, &st ))
            return 0;

        inode = get_inode( st.st_dev, st.st_ino );
        if (!inode)
            inode = create_inode( st.st_dev, st.st_ino );
        if (!inode)
            return 0;
        list_add_tail( &inode->dirs, &dir->in_entry );
        dir->inode = inode;
    }

871
    filter = filter_from_inode( inode, 0 );
872 873 874 875 876 877 878

    sprintf( path, "/proc/self/fd/%u", unix_fd );
    wd = inotify_add_dir( path, filter );
    if (wd == -1) return 0;

    inode_set_wd( inode, wd );

879
    return 1;
880 881
}

882 883 884 885 886 887 888 889
static char *get_basename( const char *link )
{
    char *buffer, *name = NULL;
    int r, n = 0x100;

    while (1)
    {
        buffer = malloc( n );
890
        if (!buffer) return NULL;
891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980

        r = readlink( link, buffer, n );
        if (r < 0)
            break;

        if (r < n)
        {
            name = buffer;
            break;
        }
        free( buffer );
        n *= 2;
    }

    if (name)
    {
        while (r > 0 && name[ r - 1 ] == '/' )
            r--;
        name[ r ] = 0;

        name = strrchr( name, '/' );
        if (name)
            name = strdup( &name[1] );
    }

    free( buffer );
    return name;
}

static int dir_add_to_existing_notify( struct dir *dir )
{
    struct inode *inode, *parent;
    unsigned int filter = 0;
    struct stat st, st_new;
    char link[35], *name;
    int wd, unix_fd;

    if (!inotify_fd)
        return 0;

    unix_fd = get_unix_fd( dir->fd );

    /* check if it's in the list of inodes we want to watch */
    if (-1 == fstat( unix_fd, &st_new ))
        return 0;
    inode = find_inode( st_new.st_dev, st_new.st_ino );
    if (inode)
        return 0;

    /* lookup the parent */
    sprintf( link, "/proc/self/fd/%u/..", unix_fd );
    if (-1 == stat( link, &st ))
        return 0;

    /*
     * If there's no parent, stop.  We could keep going adding
     *  ../ to the path until we hit the root of the tree or
     *  find a recursively watched ancestor.
     * Assume it's too expensive to search up the tree for now.
     */
    parent = find_inode( st.st_dev, st.st_ino );
    if (!parent)
        return 0;

    if (parent->wd == -1)
        return 0;

    filter = filter_from_inode( parent, 1 );
    if (!filter)
        return 0;

    sprintf( link, "/proc/self/fd/%u", unix_fd );
    name = get_basename( link );
    if (!name)
        return 0;
    inode = inode_add( parent, st_new.st_dev, st_new.st_ino, name );
    free( name );
    if (!inode)
        return 0;

    /* Couldn't find this inode at the start of the function, must be new */
    assert( inode->wd == -1 );

    wd = inotify_add_dir( link, filter );
    if (wd != -1)
        inode_set_wd( inode, wd );

    return 1;
}

981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997
#else

static int init_inotify( void )
{
    return 0;
}

static int inotify_adjust_changes( struct dir *dir )
{
    return 0;
}

static void free_inode( struct inode *inode )
{
    assert( 0 );
}

998 999 1000 1001 1002
static int dir_add_to_existing_notify( struct dir *dir )
{
    return 0;
}

1003
#endif  /* USE_INOTIFY */
1004

1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021
struct object *create_dir_obj( struct fd *fd )
{
    struct dir *dir;

    dir = alloc_object( &dir_ops );
    if (!dir)
        return NULL;

    list_init( &dir->change_records );
    dir->filter = 0;
    dir->notified = 0;
    dir->want_data = 0;
    dir->inode = NULL;
    grab_object( fd );
    dir->fd = fd;
    set_fd_user( fd, &dir_fd_ops, &dir->obj );

1022 1023
    dir_add_to_existing_notify( dir );

1024 1025 1026
    return &dir->obj;
}

1027 1028 1029 1030
/* enable change notifications for a directory */
DECL_HANDLER(read_directory_changes)
{
    struct dir *dir;
1031
    struct async *async;
1032 1033 1034 1035 1036 1037 1038 1039 1040 1041

    if (!req->filter)
    {
        set_error(STATUS_INVALID_PARAMETER);
        return;
    }

    dir = get_dir_obj( current->process, req->handle, 0 );
    if (!dir)
        return;
1042

1043
    /* requests don't timeout */
1044
    if (!(async = fd_queue_async( dir->fd, &req->async, ASYNC_TYPE_WAIT, 0 ))) goto end;
1045

1046 1047 1048
    /* assign it once */
    if (!dir->filter)
    {
1049
        init_inotify();
1050 1051
        insert_change( dir );
        dir->filter = req->filter;
1052
        dir->subtree = req->subtree;
1053
        dir->want_data = req->want_data;
1054 1055
    }

1056
    /* if there's already a change in the queue, send it */
1057
    if (!list_empty( &dir->change_records ))
1058
        fd_async_wake_up( dir->fd, ASYNC_TYPE_WAIT, STATUS_ALERTED );
1059

1060
    /* setup the real notification */
1061
    if (!inotify_adjust_changes( dir ))
1062
        dnotify_adjust_changes( dir );
1063

1064
    release_object( async );
1065 1066 1067 1068
    set_error(STATUS_PENDING);

end:
    release_object( dir );
1069
}
1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090

DECL_HANDLER(read_change)
{
    struct change_record *record;
    struct dir *dir;

    dir = get_dir_obj( current->process, req->handle, 0 );
    if (!dir)
        return;

    if ((record = get_first_change_record( dir )) != NULL)
    {
        reply->action = record->action;
        set_reply_data( record->name, record->len );
        free( record );
    }
    else
        set_error( STATUS_NO_DATA_DETECTED );

    release_object( dir );
}