2 Unix SMB/CIFS implementation.
4 Copyright (C) Andrew Tridgell 2006
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program 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
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
21 this is the change notify database. It implements mechanisms for
22 storing current change notify waiters in a tdb, and checking if a
23 given event matches any of the stored notify waiiters.
27 #include "librpc/gen_ndr/ndr_notify.h"
29 struct notify_context {
30 struct db_context *db_recursive;
31 struct db_context *db_onelevel;
32 struct server_id server;
33 struct messaging_context *messaging_ctx;
34 struct notify_list *list;
35 struct notify_array *array;
37 struct sys_notify_context *sys_notify_ctx;
43 struct notify_list *next, *prev;
45 void (*callback)(void *, const struct notify_event *);
46 void *sys_notify_handle;
50 #define NOTIFY_KEY "notify array"
52 #define NOTIFY_ENABLE "notify:enable"
53 #define NOTIFY_ENABLE_DEFAULT True
55 static NTSTATUS notify_remove_all(struct notify_context *notify,
56 const struct server_id *server);
57 static void notify_handler(struct messaging_context *msg_ctx, void *private_data,
58 uint32_t msg_type, struct server_id server_id, DATA_BLOB *data);
61 destroy the notify context
63 static int notify_destructor(struct notify_context *notify)
65 messaging_deregister(notify->messaging_ctx, MSG_PVFS_NOTIFY, notify);
67 if (notify->list != NULL) {
68 notify_remove_all(notify, ¬ify->server);
75 Open up the notify.tdb database. You should close it down using
76 talloc_free(). We need the messaging_ctx to allow for notifications
79 struct notify_context *notify_init(TALLOC_CTX *mem_ctx, struct server_id server,
80 struct messaging_context *messaging_ctx,
81 struct event_context *ev,
82 connection_struct *conn)
84 struct notify_context *notify;
86 if (!lp_change_notify(conn->params)) {
90 notify = talloc(mem_ctx, struct notify_context);
95 notify->db_recursive = db_open(notify, lock_path("notify.tdb"),
96 0, TDB_SEQNUM|TDB_CLEAR_IF_FIRST,
97 O_RDWR|O_CREAT, 0644);
98 if (notify->db_recursive == NULL) {
103 notify->db_onelevel = db_open(notify, lock_path("notify_onelevel.tdb"),
104 0, TDB_CLEAR_IF_FIRST,
105 O_RDWR|O_CREAT, 0644);
106 if (notify->db_onelevel == NULL) {
111 notify->server = server;
112 notify->messaging_ctx = messaging_ctx;
114 notify->array = NULL;
115 notify->seqnum = notify->db_recursive->get_seqnum(
116 notify->db_recursive);
117 notify->key = string_term_tdb_data(NOTIFY_KEY);
119 talloc_set_destructor(notify, notify_destructor);
121 /* register with the messaging subsystem for the notify
123 messaging_register(notify->messaging_ctx, notify,
124 MSG_PVFS_NOTIFY, notify_handler);
126 notify->sys_notify_ctx = sys_notify_context_create(conn, notify, ev);
132 lock and fetch the record
134 static NTSTATUS notify_fetch_locked(struct notify_context *notify, struct db_record **rec)
136 *rec = notify->db_recursive->fetch_locked(notify->db_recursive,
137 notify, notify->key);
139 return NT_STATUS_INTERNAL_DB_CORRUPTION;
145 load the notify array
147 static NTSTATUS notify_load(struct notify_context *notify, struct db_record *rec)
154 seqnum = notify->db_recursive->get_seqnum(notify->db_recursive);
156 if (seqnum == notify->seqnum && notify->array != NULL) {
160 notify->seqnum = seqnum;
162 talloc_free(notify->array);
163 notify->array = TALLOC_ZERO_P(notify, struct notify_array);
164 NT_STATUS_HAVE_NO_MEMORY(notify->array);
167 if (notify->db_recursive->fetch(notify->db_recursive, notify,
168 notify->key, &dbuf) != 0) {
169 return NT_STATUS_INTERNAL_DB_CORRUPTION;
175 blob.data = (uint8 *)dbuf.dptr;
176 blob.length = dbuf.dsize;
178 status = NT_STATUS_OK;
179 if (blob.length > 0) {
180 enum ndr_err_code ndr_err;
181 ndr_err = ndr_pull_struct_blob(&blob, notify->array, NULL, notify->array,
182 (ndr_pull_flags_fn_t)ndr_pull_notify_array);
183 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
184 status = ndr_map_error2ntstatus(ndr_err);
188 if (DEBUGLEVEL >= 10) {
189 DEBUG(10, ("notify_load:\n"));
190 NDR_PRINT_DEBUG(notify_array, notify->array);
194 talloc_free(dbuf.dptr);
201 compare notify entries for sorting
203 static int notify_compare(const struct notify_entry *e1, const struct notify_entry *e2)
205 return strcmp(e1->path, e2->path);
209 save the notify array
211 static NTSTATUS notify_save(struct notify_context *notify, struct db_record *rec)
216 enum ndr_err_code ndr_err;
219 /* if possible, remove some depth arrays */
220 while (notify->array->num_depths > 0 &&
221 notify->array->depth[notify->array->num_depths-1].num_entries == 0) {
222 notify->array->num_depths--;
225 /* we might just be able to delete the record */
226 if (notify->array->num_depths == 0) {
227 return rec->delete_rec(rec);
230 tmp_ctx = talloc_new(notify);
231 NT_STATUS_HAVE_NO_MEMORY(tmp_ctx);
233 ndr_err = ndr_push_struct_blob(&blob, tmp_ctx, NULL, notify->array,
234 (ndr_push_flags_fn_t)ndr_push_notify_array);
235 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
236 talloc_free(tmp_ctx);
237 return ndr_map_error2ntstatus(ndr_err);
240 if (DEBUGLEVEL >= 10) {
241 DEBUG(10, ("notify_save:\n"));
242 NDR_PRINT_DEBUG(notify_array, notify->array);
245 dbuf.dptr = blob.data;
246 dbuf.dsize = blob.length;
248 status = rec->store(rec, dbuf, TDB_REPLACE);
249 talloc_free(tmp_ctx);
256 handle incoming notify messages
258 static void notify_handler(struct messaging_context *msg_ctx, void *private_data,
259 uint32_t msg_type, struct server_id server_id, DATA_BLOB *data)
261 struct notify_context *notify = talloc_get_type(private_data, struct notify_context);
262 enum ndr_err_code ndr_err;
263 struct notify_event ev;
264 TALLOC_CTX *tmp_ctx = talloc_new(notify);
265 struct notify_list *listel;
267 if (tmp_ctx == NULL) {
271 ndr_err = ndr_pull_struct_blob(data, tmp_ctx, NULL, &ev,
272 (ndr_pull_flags_fn_t)ndr_pull_notify_event);
273 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
274 talloc_free(tmp_ctx);
278 for (listel=notify->list;listel;listel=listel->next) {
279 if (listel->private_data == ev.private_data) {
280 listel->callback(listel->private_data, &ev);
285 talloc_free(tmp_ctx);
289 callback from sys_notify telling us about changes from the OS
291 static void sys_notify_callback(struct sys_notify_context *ctx,
292 void *ptr, struct notify_event *ev)
294 struct notify_list *listel = talloc_get_type(ptr, struct notify_list);
295 ev->private_data = listel;
296 DEBUG(10, ("sys_notify_callback called with action=%d, for %s\n",
297 ev->action, ev->path));
298 listel->callback(listel->private_data, ev);
302 add an entry to the notify array
304 static NTSTATUS notify_add_array(struct notify_context *notify, struct db_record *rec,
305 struct notify_entry *e,
306 void *private_data, int depth)
309 struct notify_depth *d;
310 struct notify_entry *ee;
312 /* possibly expand the depths array */
313 if (depth >= notify->array->num_depths) {
314 d = talloc_realloc(notify->array, notify->array->depth,
315 struct notify_depth, depth+1);
316 NT_STATUS_HAVE_NO_MEMORY(d);
317 for (i=notify->array->num_depths;i<=depth;i++) {
320 notify->array->depth = d;
321 notify->array->num_depths = depth+1;
323 d = ¬ify->array->depth[depth];
325 /* expand the entries array */
326 ee = talloc_realloc(notify->array->depth, d->entries, struct notify_entry,
328 NT_STATUS_HAVE_NO_MEMORY(ee);
331 d->entries[d->num_entries] = *e;
332 d->entries[d->num_entries].private_data = private_data;
333 d->entries[d->num_entries].server = notify->server;
334 d->entries[d->num_entries].path_len = strlen(e->path);
337 d->max_mask |= e->filter;
338 d->max_mask_subdir |= e->subdir_filter;
340 TYPESAFE_QSORT(d->entries, d->num_entries, notify_compare);
342 /* recalculate the maximum masks */
344 d->max_mask_subdir = 0;
346 for (i=0;i<d->num_entries;i++) {
347 d->max_mask |= d->entries[i].filter;
348 d->max_mask_subdir |= d->entries[i].subdir_filter;
351 return notify_save(notify, rec);
355 Add a non-recursive watch
358 static void notify_add_onelevel(struct notify_context *notify,
359 struct notify_entry *e, void *private_data)
361 struct notify_entry_array *array;
362 struct db_record *rec;
365 enum ndr_err_code ndr_err;
368 array = talloc_zero(talloc_tos(), struct notify_entry_array);
373 rec = notify->db_onelevel->fetch_locked(
374 notify->db_onelevel, talloc_tos(),
375 make_tdb_data((uint8_t *)&e->dir_id, sizeof(e->dir_id)));
377 DEBUG(10, ("notify_add_onelevel: fetch_locked for %s failed"
378 "\n", file_id_string_tos(&e->dir_id)));
383 blob.data = (uint8_t *)rec->value.dptr;
384 blob.length = rec->value.dsize;
386 if (blob.length > 0) {
387 ndr_err = ndr_pull_struct_blob(
388 &blob, array, NULL, array,
389 (ndr_pull_flags_fn_t)ndr_pull_notify_entry_array);
390 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
391 DEBUG(10, ("ndr_pull_notify_entry_array failed: %s\n",
392 ndr_errstr(ndr_err)));
396 if (DEBUGLEVEL >= 10) {
397 DEBUG(10, ("notify_add_onelevel:\n"));
398 NDR_PRINT_DEBUG(notify_entry_array, array);
402 array->entries = talloc_realloc(array, array->entries,
404 array->num_entries+1);
405 if (array->entries == NULL) {
409 array->entries[array->num_entries] = *e;
410 array->entries[array->num_entries].private_data = private_data;
411 array->entries[array->num_entries].server = notify->server;
412 array->num_entries += 1;
414 ndr_err = ndr_push_struct_blob(
415 &blob, rec, NULL, array,
416 (ndr_push_flags_fn_t)ndr_push_notify_entry_array);
417 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
418 DEBUG(10, ("ndr_push_notify_entry_array failed: %s\n",
419 ndr_errstr(ndr_err)));
424 if (DEBUGLEVEL >= 10) {
425 DEBUG(10, ("notify_add_onelevel:\n"));
426 NDR_PRINT_DEBUG(notify_entry_array, array);
429 dbuf.dptr = blob.data;
430 dbuf.dsize = blob.length;
432 status = rec->store(rec, dbuf, TDB_REPLACE);
434 if (!NT_STATUS_IS_OK(status)) {
435 DEBUG(10, ("notify_add_onelevel: store failed: %s\n",
445 add a notify watch. This is called when a notify is first setup on a open
448 NTSTATUS notify_add(struct notify_context *notify, struct notify_entry *e0,
449 void (*callback)(void *, const struct notify_event *),
452 struct notify_entry e = *e0;
454 char *tmp_path = NULL;
455 struct notify_list *listel;
458 struct db_record *rec;
460 /* see if change notify is enabled at all */
461 if (notify == NULL) {
462 return NT_STATUS_NOT_IMPLEMENTED;
465 status = notify_fetch_locked(notify, &rec);
466 NT_STATUS_NOT_OK_RETURN(status);
468 status = notify_load(notify, rec);
469 if (!NT_STATUS_IS_OK(status)) {
474 /* cope with /. on the end of the path */
475 len = strlen(e.path);
476 if (len > 1 && e.path[len-1] == '.' && e.path[len-2] == '/') {
477 tmp_path = talloc_strndup(notify, e.path, len-2);
478 if (tmp_path == NULL) {
479 status = NT_STATUS_NO_MEMORY;
485 depth = count_chars(e.path, '/');
487 listel = TALLOC_ZERO_P(notify, struct notify_list);
488 if (listel == NULL) {
489 status = NT_STATUS_NO_MEMORY;
493 listel->private_data = private_data;
494 listel->callback = callback;
495 listel->depth = depth;
496 DLIST_ADD(notify->list, listel);
498 /* ignore failures from sys_notify */
499 if (notify->sys_notify_ctx != NULL) {
501 this call will modify e.filter and e.subdir_filter
502 to remove bits handled by the backend
504 status = sys_notify_watch(notify->sys_notify_ctx, &e,
505 sys_notify_callback, listel,
506 &listel->sys_notify_handle);
507 if (NT_STATUS_IS_OK(status)) {
508 talloc_steal(listel, listel->sys_notify_handle);
513 notify_add_onelevel(notify, &e, private_data);
514 status = NT_STATUS_OK;
517 /* if the system notify handler couldn't handle some of the
518 filter bits, or couldn't handle a request for recursion
519 then we need to install it in the array used for the
520 intra-samba notify handling */
521 if (e.filter != 0 || e.subdir_filter != 0) {
522 status = notify_add_array(notify, rec, &e, private_data, depth);
527 talloc_free(tmp_path);
532 NTSTATUS notify_remove_onelevel(struct notify_context *notify,
533 const struct file_id *fid,
536 struct notify_entry_array *array;
537 struct db_record *rec;
540 enum ndr_err_code ndr_err;
544 if (notify == NULL) {
545 return NT_STATUS_NOT_IMPLEMENTED;
548 array = talloc_zero(talloc_tos(), struct notify_entry_array);
550 return NT_STATUS_NO_MEMORY;
553 rec = notify->db_onelevel->fetch_locked(
554 notify->db_onelevel, array,
555 make_tdb_data((uint8_t *)fid, sizeof(*fid)));
557 DEBUG(10, ("notify_remove_onelevel: fetch_locked for %s failed"
558 "\n", file_id_string_tos(fid)));
560 return NT_STATUS_INTERNAL_DB_CORRUPTION;
563 blob.data = (uint8_t *)rec->value.dptr;
564 blob.length = rec->value.dsize;
566 if (blob.length > 0) {
567 ndr_err = ndr_pull_struct_blob(
568 &blob, array, NULL, array,
569 (ndr_pull_flags_fn_t)ndr_pull_notify_entry_array);
570 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
571 DEBUG(10, ("ndr_pull_notify_entry_array failed: %s\n",
572 ndr_errstr(ndr_err)));
574 return ndr_map_error2ntstatus(ndr_err);
576 if (DEBUGLEVEL >= 10) {
577 DEBUG(10, ("notify_remove_onelevel:\n"));
578 NDR_PRINT_DEBUG(notify_entry_array, array);
582 for (i=0; i<array->num_entries; i++) {
583 if ((private_data == array->entries[i].private_data) &&
584 cluster_id_equal(¬ify->server,
585 &array->entries[i].server)) {
590 if (i == array->num_entries) {
592 return NT_STATUS_OBJECT_NAME_NOT_FOUND;
595 array->entries[i] = array->entries[array->num_entries-1];
596 array->num_entries -= 1;
598 if (array->num_entries == 0) {
599 rec->delete_rec(rec);
604 ndr_err = ndr_push_struct_blob(
605 &blob, rec, NULL, array,
606 (ndr_push_flags_fn_t)ndr_push_notify_entry_array);
607 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
608 DEBUG(10, ("ndr_push_notify_entry_array failed: %s\n",
609 ndr_errstr(ndr_err)));
611 return ndr_map_error2ntstatus(ndr_err);
614 if (DEBUGLEVEL >= 10) {
615 DEBUG(10, ("notify_add_onelevel:\n"));
616 NDR_PRINT_DEBUG(notify_entry_array, array);
619 dbuf.dptr = blob.data;
620 dbuf.dsize = blob.length;
622 status = rec->store(rec, dbuf, TDB_REPLACE);
624 if (!NT_STATUS_IS_OK(status)) {
625 DEBUG(10, ("notify_add_onelevel: store failed: %s\n",
633 remove a notify watch. Called when the directory handle is closed
635 NTSTATUS notify_remove(struct notify_context *notify, void *private_data)
638 struct notify_list *listel;
640 struct notify_depth *d;
641 struct db_record *rec;
643 /* see if change notify is enabled at all */
644 if (notify == NULL) {
645 return NT_STATUS_NOT_IMPLEMENTED;
648 for (listel=notify->list;listel;listel=listel->next) {
649 if (listel->private_data == private_data) {
650 DLIST_REMOVE(notify->list, listel);
654 if (listel == NULL) {
655 return NT_STATUS_OBJECT_NAME_NOT_FOUND;
658 depth = listel->depth;
662 status = notify_fetch_locked(notify, &rec);
663 NT_STATUS_NOT_OK_RETURN(status);
665 status = notify_load(notify, rec);
666 if (!NT_STATUS_IS_OK(status)) {
671 if (depth >= notify->array->num_depths) {
673 return NT_STATUS_OBJECT_NAME_NOT_FOUND;
676 /* we only have to search at the depth of this element */
677 d = ¬ify->array->depth[depth];
679 for (i=0;i<d->num_entries;i++) {
680 if (private_data == d->entries[i].private_data &&
681 cluster_id_equal(¬ify->server, &d->entries[i].server)) {
685 if (i == d->num_entries) {
687 return NT_STATUS_OBJECT_NAME_NOT_FOUND;
690 if (i < d->num_entries-1) {
691 memmove(&d->entries[i], &d->entries[i+1],
692 sizeof(d->entries[i])*(d->num_entries-(i+1)));
696 status = notify_save(notify, rec);
704 remove all notify watches for a messaging server
706 static NTSTATUS notify_remove_all(struct notify_context *notify,
707 const struct server_id *server)
710 int i, depth, del_count=0;
711 struct db_record *rec;
713 status = notify_fetch_locked(notify, &rec);
714 NT_STATUS_NOT_OK_RETURN(status);
716 status = notify_load(notify, rec);
717 if (!NT_STATUS_IS_OK(status)) {
722 /* we have to search for all entries across all depths, looking for matches
724 for (depth=0;depth<notify->array->num_depths;depth++) {
725 struct notify_depth *d = ¬ify->array->depth[depth];
726 for (i=0;i<d->num_entries;i++) {
727 if (cluster_id_equal(server, &d->entries[i].server)) {
728 if (i < d->num_entries-1) {
729 memmove(&d->entries[i], &d->entries[i+1],
730 sizeof(d->entries[i])*(d->num_entries-(i+1)));
740 status = notify_save(notify, rec);
750 send a notify message to another messaging server
752 static NTSTATUS notify_send(struct notify_context *notify, struct notify_entry *e,
753 const char *path, uint32_t action)
755 struct notify_event ev;
758 enum ndr_err_code ndr_err;
763 ev.private_data = e->private_data;
765 tmp_ctx = talloc_new(notify);
767 ndr_err = ndr_push_struct_blob(&data, tmp_ctx, NULL, &ev,
768 (ndr_push_flags_fn_t)ndr_push_notify_event);
769 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
770 talloc_free(tmp_ctx);
771 return ndr_map_error2ntstatus(ndr_err);
774 status = messaging_send(notify->messaging_ctx, e->server,
775 MSG_PVFS_NOTIFY, &data);
776 talloc_free(tmp_ctx);
780 void notify_onelevel(struct notify_context *notify, uint32_t action,
781 uint32_t filter, struct file_id fid, const char *name)
783 struct notify_entry_array *array;
786 bool have_dead_entries = false;
789 if (notify == NULL) {
793 array = talloc_zero(talloc_tos(), struct notify_entry_array);
798 if (notify->db_onelevel->fetch(
799 notify->db_onelevel, array,
800 make_tdb_data((uint8_t *)&fid, sizeof(fid)),
806 blob.data = (uint8 *)dbuf.dptr;
807 blob.length = dbuf.dsize;
809 if (blob.length > 0) {
810 enum ndr_err_code ndr_err;
811 ndr_err = ndr_pull_struct_blob(
812 &blob, array, NULL, array,
813 (ndr_pull_flags_fn_t)ndr_pull_notify_entry_array);
814 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
815 DEBUG(10, ("ndr_pull_notify_entry_array failed: %s\n",
816 ndr_errstr(ndr_err)));
820 if (DEBUGLEVEL >= 10) {
821 DEBUG(10, ("notify_onelevel:\n"));
822 NDR_PRINT_DEBUG(notify_entry_array, array);
826 for (i=0; i<array->num_entries; i++) {
827 struct notify_entry *e = &array->entries[i];
829 if ((e->filter & filter) != 0) {
832 status = notify_send(notify, e, name, action);
834 status, NT_STATUS_INVALID_HANDLE)) {
836 * Mark the entry as dead. All entries have a
837 * path set. The marker used here is setting
841 have_dead_entries = true;
846 if (!have_dead_entries) {
851 for (i=0; i<array->num_entries; i++) {
852 struct notify_entry *e = &array->entries[i];
853 if (e->path != NULL) {
856 DEBUG(10, ("Deleting notify entries for process %s because "
857 "it's gone\n", procid_str_static(&e->server)));
859 * Potential TODO: This might need optimizing,
860 * notify_remove_onelevel() does a fetch_locked() operation at
861 * every call. But this would only matter if a process with
862 * MANY notifies has died without shutting down properly.
864 notify_remove_onelevel(notify, &e->dir_id, e->private_data);
872 trigger a notify message for anyone waiting on a matching event
874 This function is called a lot, and needs to be very fast. The unusual data structure
875 and traversal is designed to be fast in the average case, even for large numbers of
878 void notify_trigger(struct notify_context *notify,
879 uint32_t action, uint32_t filter, const char *path)
883 const char *p, *next_p;
885 DEBUG(10, ("notify_trigger called action=0x%x, filter=0x%x, "
886 "path=%s\n", (unsigned)action, (unsigned)filter, path));
888 /* see if change notify is enabled at all */
889 if (notify == NULL) {
894 status = notify_load(notify, NULL);
895 if (!NT_STATUS_IS_OK(status)) {
899 /* loop along the given path, working with each directory depth separately */
901 p && depth < notify->array->num_depths;
903 int p_len = p - path;
905 struct notify_depth *d = ¬ify->array->depth[depth];
906 next_p = strchr(p+1, '/');
908 /* see if there are any entries at this depth */
909 if (d->num_entries == 0) continue;
911 /* try to skip based on the maximum mask. If next_p is
912 NULL then we know it will be a 'this directory'
913 match, otherwise it must be a subdir match */
914 if (next_p != NULL) {
915 if (0 == (filter & d->max_mask_subdir)) {
919 if (0 == (filter & d->max_mask)) {
924 /* we know there is an entry here worth looking
925 for. Use a bisection search to find the first entry
926 with a matching path */
928 max_i = d->num_entries-1;
930 while (min_i < max_i) {
931 struct notify_entry *e;
935 cmp = strncmp(path, e->path, p_len);
937 if (p_len == e->path_len) {
942 } else if (cmp < 0) {
949 if (min_i != max_i) {
954 /* we now know that the entries start at min_i */
955 for (i=min_i;i<d->num_entries;i++) {
956 struct notify_entry *e = &d->entries[i];
957 if (p_len != e->path_len ||
958 strncmp(path, e->path, p_len) != 0) break;
959 if (next_p != NULL) {
960 if (0 == (filter & e->subdir_filter)) {
964 if (0 == (filter & e->filter)) {
968 status = notify_send(notify, e, path + e->path_len + 1,
972 status, NT_STATUS_INVALID_HANDLE)) {
973 struct server_id server = e->server;
975 DEBUG(10, ("Deleting notify entries for "
976 "process %s because it's gone\n",
977 procid_str_static(&e->server)));
978 notify_remove_all(notify, &server);