View | Details | Raw Unified | Return to bug 214338 | Differences between
and this patch

Collapse All | Expand All

(-)devel/glib20/Makefile (-1 / +18 lines)
Lines 3-9 Link Here
3
3
4
PORTNAME=	glib
4
PORTNAME=	glib
5
PORTVERSION=	2.46.2
5
PORTVERSION=	2.46.2
6
PORTREVISION=	3
6
PORTREVISION=	4
7
CATEGORIES=	devel
7
CATEGORIES=	devel
8
MASTER_SITES=	GNOME
8
MASTER_SITES=	GNOME
9
DIST_SUBDIR=	gnome2
9
DIST_SUBDIR=	gnome2
Lines 110-115 Link Here
110
	@${REINPLACE_CMD} -e 's|inotify_support=yes|inotify_support=no| ; \
110
	@${REINPLACE_CMD} -e 's|inotify_support=yes|inotify_support=no| ; \
111
		s|-Werror|| ; \
111
		s|-Werror|| ; \
112
		s|#define HAVE_SYS_INOTIFY_H 1||' ${WRKSRC}/configure
112
		s|#define HAVE_SYS_INOTIFY_H 1||' ${WRKSRC}/configure
113
	@${CP} ${FILESDIR}/kqueue_fnm.c.in ${WRKSRC}/gio/kqueue/kqueue_fnm.c
114
	@${CP} ${FILESDIR}/kqueue_fnm.h.in ${WRKSRC}/gio/kqueue/kqueue_fnm.h
115
	@${RM} ${WRKSRC}/gio/kqueue/dep-list.c
116
	@${RM} ${WRKSRC}/gio/kqueue/dep-list.h
117
	@${RM} ${WRKSRC}/gio/kqueue/gkqueuefilemonitor.h
118
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-exclusions.c
119
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-exclusions.h
120
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-helper.c
121
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-helper.h
122
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-missing.c
123
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-missing.h
124
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-sub.c
125
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-sub.h
126
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-thread.c
127
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-thread.h
128
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-utils.c
129
	@${RM} ${WRKSRC}/gio/kqueue/kqueue-utils.h
113
130
114
post-install:
131
post-install:
115
	@${MKDIR} ${STAGEDIR}${PREFIX}/share/GConf/gsettings
132
	@${MKDIR} ${STAGEDIR}${PREFIX}/share/GConf/gsettings
(-)devel/glib20/files/kqueue_fnm.c.in (+536 lines)
Line 0 Link Here
1
/*-
2
 * Copyright (c) 2016 Rozhuk Ivan <rozhuk.im@gmail.com>
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 * 1. Redistributions of source code must retain the above copyright
9
 *    notice, this list of conditions and the following disclaimer.
10
 * 2. Redistributions in binary form must reproduce the above copyright
11
 *    notice, this list of conditions and the following disclaimer in the
12
 *    documentation and/or other materials provided with the distribution.
13
 *
14
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
15
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
18
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24
 * SUCH DAMAGE.
25
 *
26
 * Author: Rozhuk Ivan <rozhuk.im@gmail.com>
27
 *
28
 */
29
30
#include <sys/param.h>
31
#include <sys/types.h>
32
#include <sys/event.h>
33
#include <sys/stat.h>
34
#include <sys/fcntl.h> /* open, fcntl */
35
36
#include <inttypes.h>
37
#include <stdlib.h> /* malloc, exit */
38
#include <unistd.h> /* close, write, sysconf */
39
#include <string.h> /* bcopy, bzero, memcpy, memmove, memset, strerror... */
40
#include <errno.h>
41
#include <dirent.h> // opendir, readdir
42
43
#include "kqueue_fnm.h"
44
45
46
/* Preallocate items count. */
47
#ifndef FILES_ALLOC_BLK_SIZE
48
#	define FILES_ALLOC_BLK_SIZE	8
49
#endif
50
51
typedef struct file_info_s { /* Directory file. */
52
	struct dirent 	de;		/* d_reclen used for action. */
53
	struct stat	sb;
54
} file_info_t, *file_info_p;
55
56
57
typedef struct kqueue_file_mon_data_s {
58
	int		fd;		/* fd for notify kqueue(). */
59
	int		is_dir;
60
	char		path[(PATH_MAX + 2)];
61
	size_t		path_size;
62
	size_t		ppath_size;	/* Parent path size. */
63
	void		*udata;
64
	/* For dir. */
65
	file_info_p	files;
66
	volatile size_t	files_count;
67
	size_t		files_allocated;
68
} kqueue_file_mon_data_t;
69
70
71
typedef struct kqueue_file_nonify_monitor_s {
72
	int		fd;		/* kqueue() fd. */
73
} kqueue_fnm_t;
74
75
76
#ifdef O_EVTONLY
77
#	define OPEN_FILE_FLAGS	O_EVTONLY
78
#else
79
#	define OPEN_FILE_FLAGS	(O_RDONLY | O_NOFOLLOW)
80
#endif
81
82
#define IS_NAME_DOTS(__name)	((__name)[0] == '.' &&			\
83
				 ((__name)[1] == '\0' || 		\
84
				 ((__name)[1] == '.' && (__name)[2] == '\0')))
85
#define zalloc(__size)		calloc(1, (__size))
86
87
88
static inline int
89
mem_cmpn(const void *buf1, const size_t buf1_size,
90
    const void *buf2, const size_t buf2_size) {
91
92
	if (buf1_size != buf2_size)
93
		return (((buf1_size > buf2_size) ? 127 : -127));
94
	if (0 == buf1_size || buf1 == buf2)
95
		return (0);
96
	if (NULL == buf1)
97
		return (-127);
98
	if (NULL == buf2)
99
		return (127);
100
	return (memcmp(buf1, buf2, buf1_size));
101
}
102
103
#if !defined(__FreeBSD_version) || __FreeBSD_version < 1100000
104
static inline void *
105
reallocarray(void *buf, const size_t nmemb, const size_t size) {
106
	size_t nmemb_size;
107
108
	nmemb_size = (nmemb * size);
109
	if (0 == nmemb_size) {
110
		if (0 != nmemb &&
111
		    0 != size) { /* Overflow. */
112
			errno = ENOMEM;
113
			return (NULL);
114
		}
115
		nmemb_size ++;
116
	} else if (((nmemb | size) & (SIZE_T_MAX << (sizeof(size_t) * 4))) &&
117
	    (nmemb_size / size) != nmemb) { /* size_t overflow. */
118
		errno = ENOMEM;
119
		return (NULL);
120
	}
121
	return (realloc(buf, nmemb_size));
122
}
123
#endif
124
125
static inline int
126
realloc_items(void **items, const size_t item_size,
127
    size_t *allocated, const size_t alloc_blk_cnt, const size_t count) {
128
	size_t allocated_prev, allocated_new;
129
	uint8_t *items_new;
130
131
	if (NULL == items || NULL == allocated || 0 == alloc_blk_cnt)
132
		return (EINVAL);
133
	allocated_prev = (*allocated);
134
	if (NULL != (*items) &&
135
	    allocated_prev > count &&
136
	    allocated_prev <= (count + alloc_blk_cnt))
137
		return (0);
138
	allocated_new = (((count / alloc_blk_cnt) + 1) * alloc_blk_cnt);
139
	items_new = (uint8_t*)reallocarray((*items), item_size, allocated_new);
140
	if (NULL == items_new) /* Realloc fail! */
141
		return (ENOMEM);
142
	if (allocated_new > allocated_prev) { /* Init new mem. */
143
		bzero((items_new + (allocated_prev * item_size)),
144
		    ((allocated_new - allocated_prev) * item_size));
145
	}
146
	(*items) = items_new;
147
	(*allocated) = allocated_new;
148
149
	return (0);
150
}
151
152
153
static void
154
kqueue_file_mon_data_clean(kqueue_file_mon_data_p fmd) {
155
156
	if (NULL == fmd)
157
		return;
158
	close(fmd->fd);
159
	fmd->fd = -1;
160
	free(fmd->files);
161
	fmd->files = NULL;
162
	fmd->files_count = 0;
163
	fmd->files_allocated = 0;
164
}
165
166
static void
167
kqueue_file_mon_data_free(kqueue_file_mon_data_p fmd) {
168
169
	if (NULL == fmd)
170
		return;
171
	close(fmd->fd);
172
	free(fmd->files);
173
	free(fmd);
174
}
175
176
static kqueue_file_mon_data_p
177
kqueue_file_mon_data_alloc(const char *path, void *udata) {
178
	kqueue_file_mon_data_p fmd;
179
	DIR *d = NULL;
180
	struct dirent *de;
181
	struct stat sb;
182
183
	if (NULL == path)
184
		return (NULL);
185
	fmd = zalloc(sizeof(kqueue_file_mon_data_t));
186
	if (NULL == fmd)
187
		return (NULL);
188
	fmd->fd = open(path, OPEN_FILE_FLAGS);
189
	if (-1 == fmd->fd)
190
		goto err_out;
191
	if (0 != fstat(fmd->fd, &sb))
192
		goto err_out;
193
	/* Remember args. */
194
	fmd->is_dir = (S_ISDIR(sb.st_mode) ? 1 : 0);
195
	fmd->path_size = strlcpy(fmd->path, path, sizeof(fmd->path));
196
	fmd->udata = udata;
197
198
	/* Get parent filder name. */
199
	if (fmd->is_dir) {
200
		/* Be sure that folder contain trailing '/'. */
201
		if ('/' != fmd->path[(fmd->path_size - 1)]) {
202
			fmd->path[fmd->path_size] = '/';
203
			fmd->path[(fmd->path_size + 1)] = 0;
204
			fmd->path_size ++;
205
		}
206
		/* Skip last '/' for parent dir search. */
207
		fmd->ppath_size = (fmd->path_size - 1);
208
	} else {
209
		fmd->ppath_size = fmd->path_size;
210
	}
211
	/* Find parent dir path size. */
212
	while (0 < fmd->ppath_size && '/' != fmd->path[(fmd->ppath_size - 1)]) {
213
		fmd->ppath_size --;
214
	}
215
216
	/* Dir special processing. */
217
	if (0 == fmd->is_dir)
218
		return (fmd);
219
	/* Read and remember dir content. */
220
	d = opendir(path);
221
	if (NULL == d)
222
		goto err_out;
223
	for (;;) {
224
		if (0 != realloc_items((void**)&fmd->files, sizeof(file_info_t),
225
		    &fmd->files_allocated, FILES_ALLOC_BLK_SIZE, fmd->files_count))
226
			goto err_out;
227
		/* Get file name from folder. */
228
		if (0 != readdir_r(d, &fmd->files[fmd->files_count].de, &de))
229
			break;
230
		if (NULL == de)
231
			break;
232
		if (IS_NAME_DOTS(de->d_name))
233
			continue;
234
		/* Get file attrs. */
235
		if (0 != fstatat(fmd->fd, de->d_name,
236
		    &fmd->files[fmd->files_count].sb,
237
		    AT_SYMLINK_NOFOLLOW)) {
238
			bzero(&fmd->files[fmd->files_count].sb, sizeof(struct stat));
239
		}
240
		fmd->files_count ++;
241
	}
242
	closedir(d);
243
	return (fmd);
244
245
err_out:
246
	if (NULL != d) {
247
		closedir(d);
248
	}
249
	kqueue_file_mon_data_free(fmd);
250
	return (NULL);	
251
}
252
253
254
static inline int
255
kqueue_file_mon_data_find_de(kqueue_file_mon_data_p fmd, struct dirent *de,
256
    size_t *idx) {
257
	size_t i;
258
259
	if (NULL == fmd || NULL == de || NULL == idx)
260
		return (0);
261
	for (i = 0; i < fmd->files_count; i ++) {
262
		if (de->d_fileno != fmd->files[i].de.d_fileno ||
263
		    de->d_type != fmd->files[i].de.d_type)
264
			continue;
265
		(*idx) = i;
266
		return (1);
267
	}
268
	(*idx) = fmd->files_count;
269
	return (0);
270
}
271
272
static void
273
kqueue_handle_changes(kqueue_fnm_p kfnm, kqueue_file_mon_data_p fmd,
274
    kfnm_event_handler_cb cb_func) {
275
	DIR *d;
276
	struct dirent *de;
277
	file_info_t fi;
278
	size_t i, j, k;
279
280
	if (NULL == kfnm || NULL == fmd || NULL == cb_func)
281
		return;
282
	if (0 != fstat(fmd->fd, &fi.sb) ||
283
	    0 == fi.sb.st_nlink) {
284
		kqueue_file_mon_data_clean(fmd);
285
		cb_func(kfnm, fmd, fmd->udata, KF_EVENT_DELETED,
286
		    fmd->path, "", NULL);
287
		return;
288
	}
289
	if (0 == fmd->is_dir) {
290
		fmd->path[fmd->ppath_size] = 0;
291
		cb_func(kfnm, fmd, fmd->udata, KF_EVENT_CHANGED, fmd->path,
292
		    (fmd->path + fmd->ppath_size), NULL);
293
		fmd->path[fmd->ppath_size] = '/';
294
		return;
295
	}
296
	/* Dir processing. */
297
	d = opendir(fmd->path);
298
	if (NULL == d)
299
		return;
300
	/* Mark all as removed. */
301
	for (i = 0; i < fmd->files_count; i ++) {
302
		fmd->files[i].de.d_reclen = KF_EVENT_DELETED;
303
	}
304
305
	/* Update dir. */
306
	while (0 == readdir_r(d, &fi.de, &de)) {
307
		if (NULL == de)
308
			break;
309
		if (IS_NAME_DOTS(de->d_name))
310
			continue;
311
		/* Get file stat. */
312
		if (0 != fstatat(fmd->fd, de->d_name, &fi.sb, AT_SYMLINK_NOFOLLOW)) {
313
			bzero(&fi.sb, sizeof(struct stat)); /* Fail, set to zero. */
314
		}
315
		/* Is new file/folder? */
316
		if (0 == kqueue_file_mon_data_find_de(fmd, de, &i)) { /* Add new. */
317
			if (0 != realloc_items((void**)&fmd->files, sizeof(file_info_t),
318
			    &fmd->files_allocated, FILES_ALLOC_BLK_SIZE, fmd->files_count))
319
				goto err_out;
320
			memcpy(&fmd->files[fmd->files_count], &fi, sizeof(file_info_t));
321
			fmd->files[fmd->files_count].de.d_reclen = KF_EVENT_CREATED;
322
			fmd->files_count ++;
323
			/* Notify. */
324
			cb_func(kfnm, fmd, fmd->udata, KF_EVENT_CREATED,
325
			    fmd->path, de->d_name, NULL);
326
			continue;
327
		}
328
		/* Is renamed? */
329
		if (0 != mem_cmpn(de->d_name, de->d_namlen,
330
		    fmd->files[i].de.d_name, fmd->files[i].de.d_namlen)) {
331
			/* Notify. */
332
			cb_func(kfnm, fmd, fmd->udata, KF_EVENT_RENAMED,
333
			    fmd->path, fmd->files[i].de.d_name, de->d_name);
334
			/* Update. */
335
			memcpy(&fmd->files[i], &fi, sizeof(file_info_t));
336
			fmd->files[i].de.d_reclen = KF_EVENT_RENAMED;
337
			continue;
338
		}
339
		/* Is modified? */
340
		if (0 != memcmp(&fmd->files[i].sb, &fi.sb, sizeof(struct stat))) {
341
			memcpy(&fmd->files[i].sb, &fi.sb, sizeof(struct stat)); /* Update stat. */
342
			fmd->files[i].de.d_reclen = KF_EVENT_CHANGED;
343
			/* Notify. */
344
			cb_func(kfnm, fmd, fmd->udata, KF_EVENT_CHANGED,
345
			    fmd->path, de->d_name, NULL);
346
			continue;
347
		}
348
		/* Not changed. */
349
		fmd->files[i].de.d_reclen = KF_EVENT_NOT_CHANGED;
350
	}
351
	/* Remove marked as removed. */
352
	for (i = 0; i < fmd->files_count; i ++) {
353
		if (KF_EVENT_DELETED != fmd->files[i].de.d_reclen)
354
			continue;
355
		/* Look for next non removed item + notify. */
356
		for (j = (i + 1); j < fmd->files_count; j ++) {
357
			if (KF_EVENT_DELETED != fmd->files[j].de.d_reclen)
358
				break;
359
		}
360
		/* Notify. */
361
		for (k = i; k < j; k ++) {
362
			cb_func(kfnm, fmd, fmd->udata, KF_EVENT_DELETED,
363
			    fmd->path, fmd->files[k].de.d_name, NULL);
364
		}
365
		memmove(&fmd->files[i], &fmd->files[j],
366
		    (sizeof(file_info_t) * (fmd->files_count - j)));
367
		fmd->files_count -= (j - i);
368
	}
369
370
371
err_out:
372
	if (NULL != d) {
373
		closedir(d);
374
	}
375
	return;
376
}
377
378
static void
379
kqueue_handle_rename(kqueue_fnm_p kfnm, kqueue_file_mon_data_p fmd,
380
    kfnm_event_handler_cb cb_func) {
381
	DIR *d;
382
	struct dirent *de, dedat;
383
	struct stat sb;
384
	char old_filename[(MAXNAMLEN + 2)];
385
	size_t old_filename_size;
386
387
	if (NULL == kfnm || NULL == fmd || NULL == cb_func)
388
		return;
389
	if (0 != fstat(fmd->fd, &sb) ||
390
	    0 == sb.st_nlink) {
391
notify_removed:
392
		kqueue_file_mon_data_clean(fmd);
393
		cb_func(kfnm, fmd, fmd->udata, KF_EVENT_DELETED,
394
		    fmd->path, "", NULL);
395
		return;
396
	}
397
	/* Save old file name. */
398
	old_filename_size = (fmd->path_size - fmd->ppath_size - fmd->is_dir);
399
	memcpy(old_filename,
400
	    (fmd->path + fmd->ppath_size),
401
	    old_filename_size);
402
	old_filename[old_filename_size] = 0;
403
404
	/* Get parent folder name. */
405
	fmd->path[fmd->ppath_size] = 0;
406
	/* Try to open. */
407
	d = opendir(fmd->path);
408
	/* Restore '/' after parent folder. */
409
	fmd->path[fmd->ppath_size] = '/';
410
	if (NULL == d)
411
		return;
412
	/* Find new name by inode. */
413
	while (0 == readdir_r(d, &dedat, &de)) {
414
		if (NULL == de)
415
			break;
416
		if (de->d_fileno == sb.st_ino)
417
			break;
418
	}
419
	closedir(d);
420
	if (NULL == de)
421
		goto notify_removed; /* Not found. */
422
	/* Update name. */
423
	if ((sizeof(fmd->path) - 2) <= (fmd->ppath_size + de->d_namlen))
424
		return; /* Too long. */
425
	memcpy((fmd->path + fmd->ppath_size), de->d_name, de->d_namlen);
426
	fmd->path_size = (fmd->ppath_size + de->d_namlen);
427
	/* Add last '/' for dir. */
428
	fmd->path[fmd->path_size] = '/';
429
	fmd->path_size += fmd->is_dir;
430
	fmd->path[fmd->path_size] = 0;
431
	/* Notify. */
432
	cb_func(kfnm, fmd, fmd->udata, KF_EVENT_RENAMED,
433
	    fmd->path, old_filename, de->d_name);
434
}
435
436
437
void
438
kqueue_fnm_free(kqueue_fnm_p kfnm) {
439
440
	if (NULL == kfnm)
441
		return;
442
	close(kfnm->fd);
443
	kfnm->fd = -1;
444
	free(kfnm);
445
}
446
447
kqueue_fnm_p
448
kqueue_fnm_create(void) {
449
	kqueue_fnm_p kfnm;
450
451
	kfnm = zalloc(sizeof(kqueue_fnm_t));
452
	if (NULL == kfnm)
453
		return (NULL);
454
	kfnm->fd = kqueue();
455
	if (-1 == kfnm->fd)
456
		goto err_out;
457
	return (kfnm);
458
459
err_out:
460
	kqueue_fnm_free(kfnm);
461
	return (NULL);
462
}
463
464
kqueue_file_mon_data_p
465
kqueue_fnm_add(kqueue_fnm_p kfnm, const char *path, void *udata) {
466
	struct kevent kev;
467
	struct timespec ke_timeout;
468
	kqueue_file_mon_data_p fmd;
469
	
470
	if (NULL == kfnm || NULL == path)
471
		return (NULL);
472
	fmd = (void*)kqueue_file_mon_data_alloc(path, udata);
473
	if (NULL == fmd)
474
		return (NULL);
475
	kev.ident = fmd->fd;
476
	kev.filter = EVFILT_VNODE;
477
	kev.flags = (EV_ADD | EV_CLEAR);
478
	kev.fflags = (NOTE_DELETE | NOTE_WRITE | NOTE_EXTEND | NOTE_ATTRIB | NOTE_RENAME | NOTE_REVOKE);
479
	kev.udata = (void*)fmd;
480
	bzero(&ke_timeout, sizeof(ke_timeout));
481
	if (-1 == kevent(kfnm->fd, &kev, 1, NULL, 0, &ke_timeout)) {
482
		kqueue_file_mon_data_free(fmd);
483
		return (NULL);
484
	}
485
	return (fmd);
486
}
487
488
void
489
kqueue_fnm_del(kqueue_fnm_p kfnm, kqueue_file_mon_data_p fmd) {
490
	
491
	if (NULL == kfnm || NULL == fmd)
492
		return;
493
	kqueue_file_mon_data_free(fmd);
494
}
495
496
497
int
498
kqueue_fnm_get_ev_recv_fd(kqueue_fnm_p kfnm) {
499
500
	if (NULL == kfnm)
501
		return (-1);
502
	return (kfnm->fd);
503
}
504
505
void
506
kqueue_fnm_process_events(kqueue_fnm_p kfnm, kfnm_event_handler_cb cb_func) {
507
	struct kevent kev;
508
	struct timespec ke_timeout;
509
	kqueue_file_mon_data_p fmd;
510
511
	if (NULL == kfnm || NULL == cb_func)
512
		return;
513
	/* Get and process events. */
514
	bzero(&ke_timeout, sizeof(ke_timeout));
515
	while (0 < kevent(kfnm->fd, NULL, 0, &kev, 1, &ke_timeout)) {
516
		if (EVFILT_VNODE != kev.filter ||
517
		    0 == kev.udata)
518
			continue; /* Unknown event or no associated data, skip. */
519
		fmd = (kqueue_file_mon_data_p)kev.udata;
520
521
		if (EV_ERROR & kev.flags) {
522
			kev.flags |= NOTE_REVOKE; /* Treat error as unmount. */
523
		}
524
		if (NOTE_RENAME & kev.fflags) {
525
			kqueue_handle_rename(kfnm, fmd, cb_func);
526
		}
527
		if ((NOTE_WRITE | NOTE_EXTEND | NOTE_ATTRIB) & kev.fflags) {
528
			kqueue_handle_changes(kfnm, fmd, cb_func);
529
		}
530
		if ((NOTE_DELETE | NOTE_REVOKE) & kev.fflags) {
531
			kqueue_file_mon_data_clean(fmd);
532
			cb_func(kfnm, fmd, fmd->udata, KF_EVENT_DELETED,
533
			    fmd->path, "", NULL);
534
		}
535
	}
536
}
(-)devel/glib20/files/kqueue_fnm.h.in (+68 lines)
Line 0 Link Here
1
/*-
2
 * Copyright (c) 2016 Rozhuk Ivan <rozhuk.im@gmail.com>
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 * 1. Redistributions of source code must retain the above copyright
9
 *    notice, this list of conditions and the following disclaimer.
10
 * 2. Redistributions in binary form must reproduce the above copyright
11
 *    notice, this list of conditions and the following disclaimer in the
12
 *    documentation and/or other materials provided with the distribution.
13
 *
14
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
15
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
18
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24
 * SUCH DAMAGE.
25
 *
26
 * Author: Rozhuk Ivan <rozhuk.im@gmail.com>
27
 *
28
 */
29
30
31
 
32
#ifndef __KQUEUE_FILE_NOTIFY_MONITOR_H__
33
#define __KQUEUE_FILE_NOTIFY_MONITOR_H__
34
35
#include <sys/param.h>
36
#include <sys/types.h>
37
#include <inttypes.h>
38
39
40
typedef struct kqueue_file_nonify_monitor_s	*kqueue_fnm_p;
41
typedef struct kqueue_file_mon_data_s		*kqueue_file_mon_data_p;
42
43
typedef void (*kfnm_event_handler_cb)(kqueue_fnm_p kfnm,
44
			       kqueue_file_mon_data_p fmd, void *udata,
45
			       uint32_t event,
46
			       const char *base,
47
			       const char *filename,
48
			       const char *new_filename);
49
#define KF_EVENT_NOT_CHANGED	0 /* Internal use. */
50
#define KF_EVENT_CREATED	1
51
#define KF_EVENT_DELETED	2
52
#define KF_EVENT_RENAMED	3
53
#define KF_EVENT_CHANGED	4
54
55
56
kqueue_fnm_p	kqueue_fnm_create(void);
57
void		kqueue_fnm_free(kqueue_fnm_p kfnm);
58
59
kqueue_file_mon_data_p	kqueue_fnm_add(kqueue_fnm_p kfnm,
60
			    const char *path, void *udata);
61
void		kqueue_fnm_del(kqueue_fnm_p kfnm, kqueue_file_mon_data_p fmd);
62
63
int		kqueue_fnm_get_ev_recv_fd(kqueue_fnm_p kfnm);
64
void		kqueue_fnm_process_events(kqueue_fnm_p kfnm,
65
		    kfnm_event_handler_cb cb_func);
66
67
68
#endif /* __KQUEUE_FILE_NOTIFY_MONITOR_H__ */
(-)devel/glib20/files/patch-gio_kqueue_Makefile.am (+26 lines)
Line 0 Link Here
1
--- gio/kqueue/Makefile.am.orig	2015-10-14 14:41:16.000000000 +0300
2
+++ gio/kqueue/Makefile.am	2016-11-06 05:08:37.646089000 +0300
3
@@ -4,21 +4,8 @@
4
 
5
 libkqueue_la_SOURCES = \
6
        gkqueuefilemonitor.c \
7
-       gkqueuefilemonitor.h \
8
-       kqueue-helper.c \
9
-       kqueue-helper.h \
10
-       kqueue-thread.c \
11
-       kqueue-thread.h \
12
-       kqueue-sub.c \
13
-       kqueue-sub.h \
14
-       kqueue-missing.c \
15
-       kqueue-missing.h \
16
-       kqueue-utils.c \
17
-       kqueue-utils.h \
18
-       kqueue-exclusions.c \
19
-       kqueue-exclusions.h \
20
-       dep-list.c \
21
-       dep-list.h \
22
+       kqueue_fnm.c \
23
+       kqueue_fnm.h \
24
        $(NULL)
25
 
26
 libkqueue_la_CFLAGS = \
(-)devel/glib20/files/patch-gio_kqueue_gkqueuefilemonitor.c (+372 lines)
Line 0 Link Here
1
--- gio/kqueue/gkqueuefilemonitor.c.orig	2015-10-14 14:41:16.000000000 +0300
2
+++ gio/kqueue/gkqueuefilemonitor.c	2016-11-06 05:01:49.712277000 +0300
3
@@ -1,198 +1,203 @@
4
-/*******************************************************************************
5
-  Copyright (c) 2011, 2012 Dmitry Matveev <me@dmitrymatveev.co.uk>
6
-
7
-  Permission is hereby granted, free of charge, to any person obtaining a copy
8
-  of this software and associated documentation files (the "Software"), to deal
9
-  in the Software without restriction, including without limitation the rights
10
-  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11
-  copies of the Software, and to permit persons to whom the Software is
12
-  furnished to do so, subject to the following conditions:
13
-
14
-  The above copyright notice and this permission notice shall be included in
15
-  all copies or substantial portions of the Software.
16
-
17
-  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18
-  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19
-  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
20
-  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21
-  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22
-  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
23
-  THE SOFTWARE.
24
-*******************************************************************************/
25
+/*-
26
+ * Copyright (c) 2016 Rozhuk Ivan <rozhuk.im@gmail.com>
27
+ * All rights reserved.
28
+ *
29
+ * Redistribution and use in source and binary forms, with or without
30
+ * modification, are permitted provided that the following conditions
31
+ * are met:
32
+ * 1. Redistributions of source code must retain the above copyright
33
+ *    notice, this list of conditions and the following disclaimer.
34
+ * 2. Redistributions in binary form must reproduce the above copyright
35
+ *    notice, this list of conditions and the following disclaimer in the
36
+ *    documentation and/or other materials provided with the distribution.
37
+ *
38
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
39
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
40
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
41
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
42
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
43
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
44
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
45
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
46
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
47
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
48
+ * SUCH DAMAGE.
49
+ *
50
+ * Author: Rozhuk Ivan <rozhuk.im@gmail.com>
51
+ *
52
+ */
53
 
54
 #include "config.h"
55
 
56
-#include "gkqueuefilemonitor.h"
57
-#include "kqueue-helper.h"
58
-#include "kqueue-exclusions.h"
59
-#include <gio/gpollfilemonitor.h>
60
-#include <gio/gfile.h>
61
+#include <glib-object.h>
62
+#include <string.h>
63
+#include <gio/gfilemonitor.h>
64
+#include <gio/glocalfilemonitor.h>
65
 #include <gio/giomodule.h>
66
+#include "glib-private.h"
67
+#include <glib-unix.h>
68
+#include "kqueue_fnm.h"
69
 
70
 
71
-struct _GKqueueFileMonitor
72
-{
73
-  GLocalFileMonitor parent_instance;
74
+static GMutex			kqueue_lock;
75
+static GSource			*kqueue_source = NULL;
76
+static volatile kqueue_fnm_p	kqueue_fnm = NULL;
77
 
78
-  kqueue_sub *sub;
79
+#define G_TYPE_KQUEUE_FILE_MONITOR      (g_kqueue_file_monitor_get_type())
80
+#define G_KQUEUE_FILE_MONITOR(inst)     (G_TYPE_CHECK_INSTANCE_CAST((inst), \
81
+					 G_TYPE_KQUEUE_FILE_MONITOR, GKqueueFileMonitor))
82
 
83
-  GFileMonitor *fallback;
84
-  GFile *fbfile;
85
-};
86
+typedef GLocalFileMonitorClass	GKqueueFileMonitorClass;
87
 
88
-static gboolean g_kqueue_file_monitor_cancel (GFileMonitor* monitor);
89
+typedef struct {
90
+	GLocalFileMonitor	parent_instance;
91
+	kqueue_file_mon_data_p	fmd;
92
+} GKqueueFileMonitor;
93
 
94
+GType g_kqueue_file_monitor_get_type(void);
95
 G_DEFINE_TYPE_WITH_CODE (GKqueueFileMonitor, g_kqueue_file_monitor, G_TYPE_LOCAL_FILE_MONITOR,
96
-       g_io_extension_point_implement (G_LOCAL_FILE_MONITOR_EXTENSION_POINT_NAME,
97
+       g_io_extension_point_implement(G_LOCAL_FILE_MONITOR_EXTENSION_POINT_NAME,
98
                g_define_type_id,
99
                "kqueue",
100
-               20))
101
+               10))
102
 
103
 
104
 static void
105
-_fallback_callback (GFileMonitor      *unused,
106
-                    GFile             *first,
107
-                    GFile             *second,
108
-                    GFileMonitorEvent  event,
109
-                    gpointer           udata)
110
-{
111
-  GKqueueFileMonitor *kq_mon = G_KQUEUE_FILE_MONITOR (udata);
112
-  GFileMonitor *mon = G_FILE_MONITOR (kq_mon);
113
-  g_assert (kq_mon != NULL);
114
-  g_assert (mon != NULL);
115
-  (void) unused;
116
-
117
-  if (event == G_FILE_MONITOR_EVENT_CHANGED)
118
-    {
119
-      GLocalFileMonitor *local_monitor = G_LOCAL_FILE_MONITOR (kq_mon);
120
-
121
-      _kh_dir_diff (kq_mon->sub, local_monitor->source);
122
-    }
123
-  else
124
-    g_file_monitor_emit_event (mon, first, second, event);
125
-}
126
-
127
-
128
-static void
129
-g_kqueue_file_monitor_finalize (GObject *object)
130
-{
131
-  GKqueueFileMonitor *kqueue_monitor = G_KQUEUE_FILE_MONITOR (object);
132
-
133
-  if (kqueue_monitor->sub)
134
-    {
135
-      _kh_cancel_sub (kqueue_monitor->sub);
136
-      _kh_sub_free (kqueue_monitor->sub);
137
-      kqueue_monitor->sub = NULL;
138
-    }
139
-
140
-  if (kqueue_monitor->fallback)
141
-    g_object_unref (kqueue_monitor->fallback);
142
-
143
-  if (kqueue_monitor->fbfile)
144
-    g_object_unref (kqueue_monitor->fbfile);
145
-
146
-  if (G_OBJECT_CLASS (g_kqueue_file_monitor_parent_class)->finalize)
147
-    (*G_OBJECT_CLASS (g_kqueue_file_monitor_parent_class)->finalize) (object);
148
-}
149
-
150
-static void
151
-g_kqueue_file_monitor_start (GLocalFileMonitor *local_monitor,
152
-                             const gchar *dirname,
153
-                             const gchar *basename,
154
-                             const gchar *filename,
155
-                             GFileMonitorSource *source)
156
-{
157
-  GKqueueFileMonitor *kqueue_monitor = G_KQUEUE_FILE_MONITOR (local_monitor);
158
-  GObject *obj;
159
-  GKqueueFileMonitorClass *klass;
160
-  GObjectClass *parent_class;
161
-  kqueue_sub *sub = NULL;
162
-  gboolean ret_kh_startup = FALSE;
163
-  const gchar *path = NULL; 
164
-
165
-
166
-  ret_kh_startup = _kh_startup ();
167
-  g_assert (ret_kh_startup);
168
-
169
-  path = filename;
170
-  if (!path)
171
-    path = dirname;
172
-
173
-  /* For a directory monitor, create a subscription object anyway.
174
-   * It will be used for directory diff calculation routines. 
175
-   * Wait, directory diff in a GKqueueFileMonitor?
176
-   * Yes, it is. When a file monitor is started on an non-existent
177
-   * file, GIO uses a GKqueueFileMonitor object for that. If a directory
178
-   * will be created under that path, GKqueueFileMonitor will have to
179
-   * handle the directory notifications. */
180
-
181
-  sub = _kh_sub_new (path, TRUE, source);
182
-
183
-  /* FIXME: what to do about errors here? we can't return NULL or another
184
-   * kind of error and an assertion is probably too hard (same issue as in
185
-   * the inotify backend) */
186
-  g_assert (sub != NULL);
187
-  kqueue_monitor->sub = sub;
188
-
189
-  if (!_ke_is_excluded (path))
190
-    _kh_add_sub (sub);
191
-  else
192
-    {
193
-      GFile *file = g_file_new_for_path (path);
194
-      kqueue_monitor->fbfile = file;
195
-      kqueue_monitor->fallback = _g_poll_file_monitor_new (file);
196
-      g_signal_connect (kqueue_monitor->fallback,
197
-                        "changed",
198
-                        G_CALLBACK (_fallback_callback),
199
-                        kqueue_monitor);
200
-    }
201
+kqueue_event_handler(kqueue_fnm_p kfnm,
202
+    kqueue_file_mon_data_p fmd, void *udata, uint32_t event,
203
+    const char *base, const char *filename, const char *new_filename) {
204
+	static const uint32_t kfnm_to_glib_map[] = {
205
+		0,				/* KF_EVENT_NOT_CHANGED */
206
+		G_FILE_MONITOR_EVENT_CREATED,	/* KF_EVENT_CREATED */
207
+		G_FILE_MONITOR_EVENT_DELETED,	/* KF_EVENT_DELETED */
208
+		G_FILE_MONITOR_EVENT_RENAMED,	/* KF_EVENT_RENAMED */
209
+		G_FILE_MONITOR_EVENT_CHANGED	/* KF_EVENT_CHANGED */
210
+	};
211
+
212
+	if (NULL == kfnm || NULL == filename ||
213
+	    KF_EVENT_CREATED > event ||
214
+	    KF_EVENT_CHANGED < event)
215
+		return;
216
+	g_file_monitor_source_handle_event(udata,
217
+	    kfnm_to_glib_map[event],
218
+	    filename, new_filename, NULL,
219
+	    g_source_get_time(kqueue_source));
220
+}
221
+
222
+static gboolean
223
+g_kqueue_file_monitor_callback(gint fd, GIOCondition condition, gpointer user_data) {
224
+
225
+	/* Only one thread process events. */
226
+	g_mutex_lock(&kqueue_lock);
227
+	kqueue_fnm_process_events(kqueue_fnm, kqueue_event_handler);
228
+	g_mutex_unlock(&kqueue_lock);
229
+
230
+	return (TRUE);
231
+}
232
+
233
+static gboolean
234
+g_kqueue_file_monitor_is_supported(void) {
235
+
236
+	if (NULL != kqueue_fnm)
237
+		return (TRUE);
238
+	/* Init only once. */
239
+	g_mutex_lock(&kqueue_lock);
240
+	if (NULL != kqueue_fnm) {
241
+		g_mutex_unlock(&kqueue_lock);
242
+		return (TRUE); /* Initialized while wait lock. */
243
+	}
244
+	kqueue_fnm = kqueue_fnm_create();
245
+	if (NULL == kqueue_fnm) {
246
+		g_mutex_unlock(&kqueue_lock);
247
+		return (FALSE); /* Init fail. */
248
+	}
249
+	kqueue_source = g_unix_fd_source_new(kqueue_fnm_get_ev_recv_fd(kqueue_fnm), G_IO_IN);
250
+	g_source_set_callback(kqueue_source, (GSourceFunc)g_kqueue_file_monitor_callback, NULL, NULL);
251
+	g_source_attach(kqueue_source, GLIB_PRIVATE_CALL(g_get_worker_context)());
252
+	g_mutex_unlock(&kqueue_lock);
253
+
254
+	return (TRUE);
255
 }
256
 
257
 static gboolean
258
-g_kqueue_file_monitor_is_supported (void)
259
-{
260
-  return _kh_startup ();
261
+g_kqueue_file_monitor_cancel(GFileMonitor *monitor) {
262
+	GKqueueFileMonitor *gffm = G_KQUEUE_FILE_MONITOR(monitor);
263
+
264
+	kqueue_fnm_del(kqueue_fnm, gffm->fmd);
265
+	gffm->fmd = NULL;
266
+
267
+	return (TRUE);
268
 }
269
 
270
 static void
271
-g_kqueue_file_monitor_class_init (GKqueueFileMonitorClass *klass)
272
-{
273
-  GObjectClass *gobject_class = G_OBJECT_CLASS (klass);
274
-  GFileMonitorClass *file_monitor_class = G_FILE_MONITOR_CLASS (klass);
275
-  GLocalFileMonitorClass *local_file_monitor_class = G_LOCAL_FILE_MONITOR_CLASS (klass);
276
+g_kqueue_file_monitor_finalize(GObject *object) {
277
+	GKqueueFileMonitor *gffm = G_KQUEUE_FILE_MONITOR(object);
278
 
279
-  gobject_class->finalize = g_kqueue_file_monitor_finalize;
280
-  file_monitor_class->cancel = g_kqueue_file_monitor_cancel;
281
+	kqueue_fnm_del(kqueue_fnm, gffm->fmd);
282
+	gffm->fmd = NULL;
283
+}
284
 
285
-  local_file_monitor_class->is_supported = g_kqueue_file_monitor_is_supported;
286
-  local_file_monitor_class->start = g_kqueue_file_monitor_start;
287
-  local_file_monitor_class->mount_notify = TRUE; /* TODO: ??? */
288
+static void
289
+g_kqueue_file_monitor_start(GLocalFileMonitor *local_monitor,
290
+    const gchar *dirname, const gchar *basename,
291
+    const gchar *filename, GFileMonitorSource *source) {
292
+	GKqueueFileMonitor *gffm = G_KQUEUE_FILE_MONITOR (local_monitor);
293
+
294
+	g_assert(NULL != kqueue_fnm);
295
+	g_source_ref((GSource*)source);
296
+
297
+	if (NULL == filename) {
298
+		filename = dirname;
299
+	}
300
+	gffm->fmd = kqueue_fnm_add(kqueue_fnm, filename, source);
301
 }
302
 
303
 static void
304
-g_kqueue_file_monitor_init (GKqueueFileMonitor *monitor)
305
-{
306
+g_kqueue_file_monitor_init(GKqueueFileMonitor *monitor) {
307
+	
308
 }
309
 
310
-static gboolean
311
-g_kqueue_file_monitor_cancel (GFileMonitor *monitor)
312
-{
313
-  GKqueueFileMonitor *kqueue_monitor = G_KQUEUE_FILE_MONITOR (monitor);
314
-
315
-  if (kqueue_monitor->sub)
316
-    {
317
-      _kh_cancel_sub (kqueue_monitor->sub);
318
-      _kh_sub_free (kqueue_monitor->sub);
319
-      kqueue_monitor->sub = NULL;
320
-    }
321
-  else if (kqueue_monitor->fallback)
322
-    {
323
-      g_signal_handlers_disconnect_by_func (kqueue_monitor->fallback, _fallback_callback, kqueue_monitor);
324
-      g_file_monitor_cancel (kqueue_monitor->fallback);
325
-    }
326
+static void
327
+g_kqueue_file_monitor_class_init(GKqueueFileMonitorClass *class) {
328
+	GObjectClass *gobject_class = G_OBJECT_CLASS(class);
329
+	GFileMonitorClass *file_monitor_class = G_FILE_MONITOR_CLASS(class);
330
+
331
+	class->is_supported = g_kqueue_file_monitor_is_supported;
332
+	class->start = g_kqueue_file_monitor_start;
333
+	class->mount_notify = TRUE; /* TODO: ??? */
334
+	file_monitor_class->cancel = g_kqueue_file_monitor_cancel;
335
+	gobject_class->finalize = g_kqueue_file_monitor_finalize;
336
+}
337
+
338
+static void
339
+g_kqueue_file_monitor_class_finalize(GKqueueFileMonitorClass *class) {
340
+	
341
+}
342
+
343
+void
344
+g_io_module_load(GIOModule *module) {
345
+
346
+	g_type_module_use(G_TYPE_MODULE(module));
347
+
348
+	g_io_extension_point_implement(G_LOCAL_FILE_MONITOR_EXTENSION_POINT_NAME,
349
+	    G_TYPE_KQUEUE_FILE_MONITOR, "kqueue", 10);
350
+	g_io_extension_point_implement(G_NFS_FILE_MONITOR_EXTENSION_POINT_NAME,
351
+	    G_TYPE_KQUEUE_FILE_MONITOR, "kqueue", 10);
352
+}
353
+
354
+void
355
+g_io_module_unload(GIOModule *module) {
356
+	
357
+	g_assert_not_reached();
358
+}
359
 
360
-  if (G_FILE_MONITOR_CLASS (g_kqueue_file_monitor_parent_class)->cancel)
361
-    (*G_FILE_MONITOR_CLASS (g_kqueue_file_monitor_parent_class)->cancel) (monitor);
362
+char **
363
+g_io_module_query(void) {
364
+	char *eps[] = {
365
+		G_LOCAL_FILE_MONITOR_EXTENSION_POINT_NAME,
366
+		G_NFS_FILE_MONITOR_EXTENSION_POINT_NAME,
367
+		NULL
368
+	};
369
 
370
-  return TRUE;
371
+	return (g_strdupv(eps));
372
 }

Return to bug 214338