git-annex/Utility/libkqueue.c
Joey Hess e213ef310f git-annex (5.20140717) unstable; urgency=high
* Fix minor FD leak in journal code. Closes: #754608
  * direct: Fix handling of case where a work tree subdirectory cannot
    be written to due to permissions.
  * migrate: Avoid re-checksumming when migrating from hashE to hash backend.
  * uninit: Avoid failing final removal in some direct mode repositories
    due to file modes.
  * S3: Deal with AWS ACL configurations that do not allow creating or
    checking the location of a bucket, but only reading and writing content to
    it.
  * resolvemerge: New plumbing command that runs the automatic merge conflict
    resolver.
  * Deal with change in git 2.0 that made indirect mode merge conflict
    resolution leave behind old files.
  * sync: Fix git sync with local git remotes even when they don't have an
    annex.uuid set. (The assistant already did so.)
  * Set gcrypt-publish-participants when setting up a gcrypt repository,
    to avoid unncessary passphrase prompts.
    This is a security/usability tradeoff. To avoid exposing the gpg key
    ids who can decrypt the repository, users can unset
    gcrypt-publish-participants.
  * Install nautilus hooks even when ~/.local/share/nautilus/ does not yet
    exist, since it is not automatically created for Gnome 3 users.
  * Windows: Move .vbs files out of git\bin, to avoid that being in the
    PATH, which caused some weird breakage. (Thanks, divB)
  * Windows: Fix locking issue that prevented the webapp starting
    (since 5.20140707).

# imported from the archive
2014-07-17 11:27:25 -04:00

74 lines
1.6 KiB
C

/* kqueue interface, C mini-library
*
* Copyright 2012 Joey Hess <joey@kitenet.net>
*
* License: BSD-2-clause
*/
#include <stdio.h>
#include <dirent.h>
#include <fcntl.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/event.h>
#include <sys/time.h>
#include <errno.h>
/* The specified fds are added to the set of fds being watched for changes.
* Fds passed to prior calls still take effect, so it's most efficient to
* not pass the same fds repeatedly.
*
* Returns the fd that changed, or -1 on error.
*/
signed int helper(const int kq, const int fdcnt, const int *fdlist, int nodelay) {
int i, nev;
struct kevent evlist[1];
struct kevent chlist[fdcnt];
struct timespec avoiddelay = {0, 0};
struct timespec *timeout = nodelay ? &avoiddelay : NULL;
for (i = 0; i < fdcnt; i++) {
EV_SET(&chlist[i], fdlist[i], EVFILT_VNODE,
EV_ADD | EV_ENABLE | EV_CLEAR,
NOTE_WRITE,
0, 0);
}
nev = kevent(kq, chlist, fdcnt, evlist, 1, timeout);
if (nev == 1)
return evlist[0].ident;
else
return -1;
}
/* Initializes a new, empty kqueue. */
int init_kqueue() {
int kq;
if ((kq = kqueue()) == -1) {
perror("kqueue");
exit(1);
}
return kq;
}
/* Adds fds to the set that should be watched. */
void addfds_kqueue(const int kq, const int fdcnt, const int *fdlist) {
helper(kq, fdcnt, fdlist, 1);
}
/* Waits for a change event on a kqueue. */
signed int waitchange_kqueue(const int kq) {
return helper(kq, 0, NULL, 0);
}
/*
main () {
int list[1];
int kq;
list[0]=open(".", O_RDONLY);
kq = init_kqueue();
addfds_kqueue(kq, 1, list)
printf("change: %i\n", waitchange_kqueue(kq));
}
*/