commit 2540171bde221d9da5e69de01df337b8add732b1 Author: Olaf Rempel Date: Fri Oct 6 22:05:44 2006 +0200 initial diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..12d3219 --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +*.o +*.d +isync diff --git a/AUTHORS b/AUTHORS new file mode 100644 index 0000000..093c6e0 --- /dev/null +++ b/AUTHORS @@ -0,0 +1 @@ +Olaf Rempel diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..60549be --- /dev/null +++ b/COPYING @@ -0,0 +1,340 @@ + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Library General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) 19yy + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program 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 General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) 19yy name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + , 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Library General +Public License instead of this License. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..d82c2df --- /dev/null +++ b/Makefile @@ -0,0 +1,22 @@ +# Toplevel Makefile + +SRC := $(wildcard *.c) +CFLAGS := -O2 -Wall + +# ############################ + +all: isync + +isync: $(SRC:%.c=%.o) + $(CC) $(CFLAGS) $^ -o $@ + +%.d: %.c + $(CC) $(CFLAGS) -MM -c $< -o $@ + +%.o: %.c + $(CC) $(CFLAGS) -o $@ -c $< + +clean: + rm -rf *.d *.o isync + +-include $(SRC:.c=.d) diff --git a/event.c b/event.c new file mode 100644 index 0000000..da2b17c --- /dev/null +++ b/event.c @@ -0,0 +1,323 @@ +/*************************************************************************** + * Copyright (C) 10/2006 by Olaf Rempel * + * razzor@kopf-tisch.de * + * * + * This program is free software; you can redistribute it and/or modify * + * it under the terms of the GNU General Public License as published by * + * the Free Software Foundation; either version 2 of the License, or * + * (at your option) any later version. * + * * + * This program 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 General Public License for more details. * + * * + * You should have received a copy of the GNU General Public License * + * along with this program; if not, write to the * + * Free Software Foundation, Inc., * + * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * + ***************************************************************************/ +#include +#include +#include + +#include +#include + +#include "list.h" +#include "logging.h" + +#include "event.h" + +static LIST_HEAD(readfd_list); +static LIST_HEAD(writefd_list); +static LIST_HEAD(exceptfd_list); +static LIST_HEAD(timeout_list); + + +static int modified; + +struct fd_entry { + struct list_head list; + int fd; + int type; + int (*callback)(int fd, void *privdata); + void *privdata; +}; + +struct timeout_entry { + struct list_head list; + struct timeval timeout; + struct timeval nextrun; + int (*callback)(void *privdata); + void *privdata; +}; + +int event_add_fd(int fd, int type, int (*callback)(int fd, void *privdata), void *privdata) +{ + if (fd < 0 || fd > FD_SETSIZE) + return -1; + + struct fd_entry *entry; + entry = malloc(sizeof(struct fd_entry)); + if (entry == NULL) { + log_print(LOG_ERROR, "event_add_fd(): out of memory"); + return -1; + } + + entry->fd = fd; + entry->type = type; + entry->callback = callback; + entry->privdata = privdata; + + switch (type) { + case FD_READ: + list_add_tail(&entry->list, &readfd_list); + break; + + case FD_WRITE: + list_add_tail(&entry->list, &writefd_list); + break; + + case FD_EXCEPT: + list_add_tail(&entry->list, &exceptfd_list); + break; + + default: + log_print(LOG_ERROR, "add_fd(): unknown type"); + free(entry); + return -1; + } + + modified = 1; + return 0; +} + +int event_remove_fd(int fd) +{ + struct fd_entry *entry, *tmp; + list_for_each_entry_safe(entry, tmp, &readfd_list, list) { + if (entry->fd == fd) { + list_del(&entry->list); + free(entry); + modified = 1; + return 0; + } + } + + list_for_each_entry_safe(entry, tmp, &writefd_list, list) { + if (entry->fd == fd) { + list_del(&entry->list); + free(entry); + modified = 1; + return 0; + } + } + + list_for_each_entry_safe(entry, tmp, &exceptfd_list, list) { + if (entry->fd == fd) { + list_del(&entry->list); + free(entry); + modified = 1; + return 0; + } + } + + return -1; +} + +static void calc_nextrun(struct timeval *timeout, struct timeval *nextrun) +{ + struct timeval now; + gettimeofday(&now, NULL); + + nextrun->tv_usec = now.tv_usec + timeout->tv_usec; + nextrun->tv_sec = now.tv_sec + timeout->tv_sec; + + if (nextrun->tv_usec >= 1000000) { + nextrun->tv_usec -= 1000000; + nextrun->tv_sec++; + } +} + +static void calc_timeout(struct timeval *timeout, struct timeval *nextrun) +{ + struct timeval now; + gettimeofday(&now, NULL); + + timeout->tv_usec = nextrun->tv_usec - now.tv_usec; + timeout->tv_sec = nextrun->tv_sec - now.tv_sec; + + if (timeout->tv_usec < 0) { + timeout->tv_usec += 1000000; + timeout->tv_sec--; + } +} + +static void schedule_nextrun(struct timeout_entry *entry) +{ + struct timeout_entry *search; + + list_for_each_entry(search, &timeout_list, list) { + if (search->nextrun.tv_sec > entry->nextrun.tv_sec) { + list_add_tail(&entry->list, &search->list); + return; + + } else if (search->nextrun.tv_sec == entry->nextrun.tv_sec && + search->nextrun.tv_usec > entry->nextrun.tv_usec) { + list_add_tail(&entry->list, &search->list); + return; + } + } + list_add_tail(&entry->list, &timeout_list); +} + +int event_add_timeout(struct timeval *timeout, int (*callback)(void *privdata), void *privdata) +{ + struct timeout_entry *entry; + entry = malloc(sizeof(struct timeout_entry)); + if (entry == NULL) { + log_print(LOG_ERROR, "event_add_timeout(): out of memory"); + return -1; + } + + memcpy(&entry->timeout, timeout, sizeof(entry->timeout)); + entry->callback = callback; + entry->privdata = privdata; + + calc_nextrun(&entry->timeout, &entry->nextrun); + schedule_nextrun(entry); + return 0; +} + +int event_loop(void) +{ + modified = 1; + + while (1) { + fd_set readfds, *readfds_p = NULL; + fd_set writefds, *writefds_p = NULL; + fd_set exceptfds, *exceptfds_p =NULL; + struct timeval timeout, *timeout_p = NULL; + + if (modified) { + struct fd_entry *entry; + + if (!list_empty(&readfd_list)) { + FD_ZERO(&readfds); + list_for_each_entry(entry, &readfd_list, list) + FD_SET(entry->fd, &readfds); + + readfds_p = &readfds; + } + + if (!list_empty(&writefd_list)) { + FD_ZERO(&writefds); + list_for_each_entry(entry, &writefd_list, list) + FD_SET(entry->fd, &writefds); + + writefds_p = &writefds; + } + + if (!list_empty(&exceptfd_list)) { + FD_ZERO(&exceptfds); + list_for_each_entry(entry, &exceptfd_list, list) + FD_SET(entry->fd, &exceptfds); + + exceptfds_p = &exceptfds; + } + + modified = 0; + } + + if (!list_empty(&timeout_list)) { + struct timeout_entry *entry, *tmp; + list_for_each_entry_safe(entry, tmp, &timeout_list, list) { + + calc_timeout(&timeout, &entry->nextrun); + if (timeout.tv_sec >= 0 && timeout.tv_usec > 0) { + timeout_p = &timeout; + break; + } + + // delayed timeout, exec NOW! + list_del(&entry->list); + int ret = entry->callback(entry->privdata); + if (ret == 0) { + calc_nextrun(&entry->timeout, &entry->nextrun); + schedule_nextrun(entry); + + } else { + free(entry); + } + } + } + + int i = select(FD_SETSIZE, readfds_p, writefds_p, exceptfds_p, timeout_p); + if (i < 0) { + /* On error, -1 is returned, and errno is set + * appropriately; the sets and timeout become + * undefined, so do not rely on their contents + * after an error. + */ + modified = 1; + continue; + + } else if (i == 0 && !list_empty(&timeout_list)) { + struct timeout_entry *entry; + entry = list_entry(timeout_list.next, typeof(*entry), list); + list_del(&entry->list); + + int ret = entry->callback(entry->privdata); + if (ret == 0) { + calc_nextrun(&entry->timeout, &entry->nextrun); + schedule_nextrun(entry); + + } else { + free(entry); + } + } + + if (readfds_p) { + struct fd_entry *entry, *tmp; + list_for_each_entry_safe(entry, tmp, &readfd_list, list) { + if (!FD_ISSET(entry->fd, &readfds)) + continue; + + if (entry->callback(entry->fd, entry->privdata) != 0) { + list_del(&entry->list); + free(entry); + modified = 1; + } + } + } + + if (writefds_p) { + struct fd_entry *entry, *tmp; + list_for_each_entry_safe(entry, tmp, &writefd_list, list) { + if (FD_ISSET(entry->fd, &writefds)) + continue; + + if (entry->callback(entry->fd, entry->privdata) != 0) { + list_del(&entry->list); + free(entry); + modified = 1; + } + } + } + + if (exceptfds_p) { + struct fd_entry *entry, *tmp; + list_for_each_entry_safe(entry, tmp, &exceptfd_list, list) { + if (FD_ISSET(entry->fd, &exceptfds)) + continue; + + if (entry->callback(entry->fd, entry->privdata) != 0) { + list_del(&entry->list); + free(entry); + modified = 1; + } + } + } + } +} diff --git a/event.h b/event.h new file mode 100644 index 0000000..a20d1f8 --- /dev/null +++ b/event.h @@ -0,0 +1,26 @@ +#ifndef _EVENT_H_ +#define _EVENT_H_ + +#include + +#define FD_READ 0x01 +#define FD_WRITE 0x02 +#define FD_EXCEPT 0x04 + +#define event_add_readfd(fd, callback, privdata) \ + event_add_fd(fd, FD_READ, callback, privdata) + +#define event_add_writefd(fd, callback, privdata) \ + event_add_fd(fd, FD_WRITE, callback, privdata) + +#define event_add_exceptfd(fd, callback, privdata) \ + event_add_fd(fd, FD_EXCEPT, callback, privdata) + +int event_add_fd(int fd, int type, int (*callback)(int fd, void *privdata), void *privdata); +int event_add_timeout(struct timeval *timeout, int (*callback)(void *privdata), void *privdata); + +int event_remove_fd(int fd); + +int event_loop(void); + +#endif /* _EVENT_H_ */ diff --git a/inotify.c b/inotify.c new file mode 100644 index 0000000..9f258ff --- /dev/null +++ b/inotify.c @@ -0,0 +1,344 @@ +/*************************************************************************** + * Copyright (C) 10/2006 by Olaf Rempel * + * razzor@kopf-tisch.de * + * * + * This program is free software; you can redistribute it and/or modify * + * it under the terms of the GNU General Public License as published by * + * the Free Software Foundation; either version 2 of the License, or * + * (at your option) any later version. * + * * + * This program 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 General Public License for more details. * + * * + * You should have received a copy of the GNU General Public License * + * along with this program; if not, write to the * + * Free Software Foundation, Inc., * + * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * + ***************************************************************************/ + +#include +#include +#include +#include + +#include +#include +#include +#include +#include + +#include "sys/inotify.h" + +#include "logging.h" + +#define MAX_WATCHES 8192 + +#define WATCH_MASK (IN_DONT_FOLLOW | IN_ONLYDIR | IN_MOVE | IN_DELETE | IN_CREATE) + +struct watch_entry { + int parent; + char *path; +}; + +static struct watch_entry *watch_arr; + +/* + * adds a watch + * - updates watch_arr info (parent & path) + * + * returns watch discriptor or -1 on failure + */ +static int add_watch(int inotify_fd, char *path, int parent) +{ + int wd = inotify_add_watch(inotify_fd, path, WATCH_MASK); + if (wd < 0) { + log_print(LOG_ERROR, "inotify_add_watch('%s')", path); + return -1; + } + + if (watch_arr[wd].path != NULL) { + log_print(LOG_DEBUG, "add_watch(): removing old data: '%s' = %d", + watch_arr[wd].path, wd); + watch_arr[wd].parent = -1; + free(watch_arr[wd].path); + } + + watch_arr[wd].parent = parent; + watch_arr[wd].path = strdup(path); + + log_print(LOG_DEBUG, "add_watch('%s') = %d", path, wd); + + return wd; +} + +/* + * removes a watch, and all childrens! + * - updates watch_arr info + * + * returns -1 on failure + */ +static int remove_watch_recursive(int inotify_fd, int wd) +{ + log_print(LOG_DEBUG, "remove_watch('%s')", watch_arr[wd].path); + + int i; + for (i = 0; i < MAX_WATCHES; i++) + if (watch_arr[i].parent == wd) + remove_watch_recursive(inotify_fd, i); + + int ret = inotify_rm_watch(inotify_fd, wd); + if (ret < 0) + log_print(LOG_ERROR, "inotify_rm_watch('%s')", watch_arr[wd].path); + + watch_arr[wd].parent = -1; + free(watch_arr[wd].path); + watch_arr[wd].path = NULL; + + return ret; +} + +static int add_watch_recursive_real(int inotify_fd, char *path, int parent) +{ + struct stat statbuf; + if (stat(path, &statbuf) == -1) { + log_print(LOG_ERROR, "add_watch_recursive_real(): stat('%s')", path); + return 0; + + } else if (!S_ISDIR (statbuf.st_mode)) { + return 0; + } + + int wd = add_watch(inotify_fd, path, parent); + if (wd < 0) + return 0; + + int watches = 1; + + DIR *dp = opendir(path); + if (dp == NULL) { + log_print(LOG_ERROR, "add_watch_recursive_real(): opendir('%s')", path); + + } else { + char *end = path + strlen(path); + + struct dirent *dentry; + while ((dentry = readdir(dp)) != NULL) { + if (!strcmp(dentry->d_name, ".")) + continue; + + if (!strcmp(dentry->d_name, "..")) + continue; + + *end = '/'; + strcpy(end +1, dentry->d_name); + watches += add_watch_recursive_real(inotify_fd, path, wd); + } + closedir(dp); + + *end = '\0'; + } + return watches; +} + +static char * prepare_path(int parent, char *name) +{ + char *tmppath = malloc(PATH_MAX); + if (tmppath == NULL) { + log_print(LOG_ERROR, "add_recursive_watch(): out of memory"); + return 0; + } + + if (parent != -1) { + char *tmp = tmppath + strlen(watch_arr[parent].path); + strcpy(tmppath, watch_arr[parent].path); + *tmp++ = '/'; + + strcpy(tmp, name); + + } else { + strcpy(tmppath, name); + } + + return tmppath; +} + +static int find_child_by_name(int parent, char *name) +{ + char *path = prepare_path(parent, name); + int i; + + for (i = 0; i < MAX_WATCHES; i++) { + if (watch_arr[i].parent == parent && !strcmp(watch_arr[i].path, path)) { + free(path); + return i; + } + } + + log_print(LOG_ERROR, "find_child_by_name: '%s' not found", path); + free(path); + return -1; +} + +int add_watch_recursive(int fd, char *name) +{ + char *tmppath = prepare_path(-1, name); + int num = add_watch_recursive_real(fd, tmppath, -1); + + free(tmppath); + return num; +} + + +static char * mask_to_str(int mask) +{ + char *retval = malloc(256); + *retval = '\0'; + + if (mask & IN_ACCESS) + strcat(retval, "IN_ACCESS "); + + if (mask & IN_MODIFY) + strcat(retval, "IN_MODIFY "); + + if (mask & IN_ATTRIB) + strcat(retval, "IN_ATTRIB "); + + if (mask & IN_CLOSE_WRITE) + strcat(retval, "IN_CLOSE_WRITE "); + + if (mask & IN_CLOSE_NOWRITE) + strcat(retval, "IN_CLOSE_NOWRITE "); + + if (mask & IN_OPEN) + strcat(retval, "IN_OPEN "); + + if (mask & IN_MOVED_FROM) + strcat(retval, "IN_MOVED_FROM "); + + if (mask & IN_MOVED_TO) + strcat(retval, "IN_MOVED_TO "); + + if (mask & IN_CREATE) + strcat(retval, "IN_CREATE "); + + if (mask & IN_DELETE) + strcat(retval, "IN_DELETE "); + + if (mask & IN_DELETE_SELF) + strcat(retval, "IN_DELETE_SELF "); + + if (mask & IN_MOVE_SELF) + strcat(retval, "IN_MOVE_SELF "); + + if (mask & IN_UNMOUNT) + strcat(retval, "IN_UNMOUNT "); + + if (mask & IN_Q_OVERFLOW) + strcat(retval, "IN_Q_OVERFLOW "); + + if (mask & IN_IGNORED) + strcat(retval, "IN_IGNORED "); + + if (mask & IN_ISDIR) + strcat(retval, "IN_ISDIR "); + + if (mask & IN_ONESHOT) + strcat(retval, "IN_ONESHOT "); + + return retval; +} + + + +int watch_callback(int fd, void *privdata) +{ + unsigned int size; + int i = ioctl(fd, FIONREAD, &size); + if (i < 0) { + perror ("ioctl()"); + return -1; + } + + char *buf = malloc(size); + if (buf == NULL) { + perror("malloc()"); + return -1; + } + + int len, j = 0; + len = read(fd, buf, size); + while (j < len) { + struct inotify_event *event = (struct inotify_event *) &buf[j]; + + if (event->len) + log_print(LOG_INFO, "wd=%03d mask=%08X cookie=%08X name=%s/%s %s", + event->wd, event->mask, event->cookie, watch_arr[event->wd].path, event->name, + mask_to_str(event->mask)); + else + log_print(LOG_INFO, "wd=%03d mask=%08X cookie=%08X (name=%s) %s", + event->wd, event->mask, event->cookie, watch_arr[event->wd].path, + mask_to_str(event->mask)); + + /* new directory created -> watch it */ + if ((event->mask & (IN_CREATE | IN_ISDIR)) == (IN_CREATE | IN_ISDIR)) { + char *tmp = prepare_path(event->wd, event->name); + add_watch_recursive_real(fd, tmp, event->wd); + free(tmp); + } + + /* directory removed -> remove watch info (the watch was removed by the kernel) */ + if (event->mask & IN_IGNORED) { + if (watch_arr[event->wd].path != NULL) { + log_print(LOG_DEBUG, "kernel removed watch ('%s')", watch_arr[event->wd].path); + watch_arr[event->wd].parent = -1; + free(watch_arr[event->wd].path); + watch_arr[event->wd].path = NULL; + } + } + + /* directory moved away -> find child by name-serach, then remove all his children rekursive */ + if ((event->mask & (IN_MOVED_FROM | IN_ISDIR)) == (IN_MOVED_FROM | IN_ISDIR)) { + int wd = find_child_by_name(event->wd, event->name); + remove_watch_recursive(fd, wd); + } + + /* directory moved to us -> add watches */ + if ((event->mask & (IN_MOVED_TO | IN_ISDIR)) == (IN_MOVED_TO | IN_ISDIR)) { + char *tmp = prepare_path(event->wd, event->name); + add_watch_recursive_real(fd, tmp, event->wd); + free(tmp); + } + + j += sizeof(struct inotify_event) + event->len; + } + free(buf); + + return 0; +} + + + +int inotify_open() +{ + int fd = inotify_init(); + if (fd < 0) + log_print(LOG_ERROR, "inotify_open()"); + + if (watch_arr == NULL) { + watch_arr = malloc(MAX_WATCHES * sizeof(struct watch_entry)); + if (watch_arr == NULL) { + log_print(LOG_ERROR, "inotify_open(): out of memory"); + return 0; + } + + int i; + for (i = 0; i < MAX_WATCHES; i++) { + watch_arr[i].parent = -1; + watch_arr[i].path = NULL; + } + } + + return fd; +} diff --git a/inotify.h b/inotify.h new file mode 100644 index 0000000..677fc1b --- /dev/null +++ b/inotify.h @@ -0,0 +1,8 @@ +#ifndef _INOTIFY_H_ +#define _INOTIFY_H_ + +int add_watch_recursive(int fd, char *path); +int watch_callback(int fd, void *privdata); +int inotify_open(); + +#endif /* _INOTIFY_H_ */ diff --git a/isync.c b/isync.c new file mode 100644 index 0000000..b84504e --- /dev/null +++ b/isync.c @@ -0,0 +1,41 @@ +/*************************************************************************** + * Copyright (C) 10/2006 by Olaf Rempel * + * razzor@kopf-tisch.de * + * * + * This program is free software; you can redistribute it and/or modify * + * it under the terms of the GNU General Public License as published by * + * the Free Software Foundation; either version 2 of the License, or * + * (at your option) any later version. * + * * + * This program 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 General Public License for more details. * + * * + * You should have received a copy of the GNU General Public License * + * along with this program; if not, write to the * + * Free Software Foundation, Inc., * + * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * + ***************************************************************************/ +#include +#include +#include +#include + +#include "logging.h" +#include "inotify.h" +#include "event.h" + +int main(int argc, char *argv[]) +{ + int fd = inotify_open(); + int num = add_watch_recursive(fd, "/tmp"); + + log_print(LOG_INFO, "%d watches added\n", num); + + event_add_readfd(fd, &watch_callback, NULL); + event_loop(); + + close(fd); + return 0; +} diff --git a/list.h b/list.h new file mode 100644 index 0000000..61f8d93 --- /dev/null +++ b/list.h @@ -0,0 +1,268 @@ +#ifndef _LIST_H_ +#define _LIST_H_ + +/* + * stolen from linux kernel 2.6.11 (http://kernel.org/) + * linux/include/linux/stddef.h (offsetoff) + * linux/include/linux/kernel.h (container_of) + * linux/include/linux/list.h (*list*) + * linux/include/linux/netfilter_ipv4/listhelp.h (LIST_FIND) + * + * modified by Olaf Rempel + */ +#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) + +#define container_of(ptr, type, member) ({ \ + const typeof( ((type *)0)->member ) *__mptr = (ptr); \ + (type *)( (char *)__mptr - offsetof(type,member) );}) + +struct list_head { + struct list_head *next, *prev; +}; + +#define LIST_HEAD_INIT(name) { &(name), &(name) } + +#define LIST_HEAD(name) \ + struct list_head name = LIST_HEAD_INIT(name) + +#define INIT_LIST_HEAD(ptr) do { \ + (ptr)->next = (ptr); (ptr)->prev = (ptr); \ +} while (0) + +/* + * Insert a new entry between two known consecutive entries. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_add(struct list_head *new, + struct list_head *prev, + struct list_head *next) +{ + next->prev = new; + new->next = next; + new->prev = prev; + prev->next = new; +} + +/* + * list_add - add a new entry + * @new: new entry to be added + * @head: list head to add it after + * + * Insert a new entry after the specified head. + * This is good for implementing stacks. + */ +static inline void list_add(struct list_head *new, struct list_head *head) +{ + __list_add(new, head, head->next); +} + +/* + * list_add_tail - add a new entry + * @new: new entry to be added + * @head: list head to add it before + * + * Insert a new entry before the specified head. + * This is useful for implementing queues. + */ +static inline void list_add_tail(struct list_head *new, struct list_head *head) +{ + __list_add(new, head->prev, head); +} + +/* + * Delete a list entry by making the prev/next entries + * point to each other. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_del(struct list_head * prev, struct list_head * next) +{ + next->prev = prev; + prev->next = next; +} + +/* + * list_del - deletes entry from list. + * @entry: the element to delete from the list. + * Note: list_empty on entry does not return true after this, the entry is + * in an undefined state. + */ +static inline void list_del(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); + entry->next = NULL; + entry->prev = NULL; +} + +/* + * list_del_init - deletes entry from list and reinitialize it. + * entry: the element to delete from the list. + */ +static inline void list_del_init(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); + INIT_LIST_HEAD(entry); +} + +/* + * list_move - delete from one list and add as another's head + * @list: the entry to move + * @head: the head that will precede our entry + */ +static inline void list_move(struct list_head *list, struct list_head *head) +{ + __list_del(list->prev, list->next); + list_add(list, head); +} + +/* + * list_move_tail - delete from one list and add as another's tail + * @list: the entry to move + * @head: the head that will follow our entry + */ +static inline void list_move_tail(struct list_head *list, + struct list_head *head) +{ + __list_del(list->prev, list->next); + list_add_tail(list, head); +} + +/* + * list_empty - tests whether a list is empty + * @head: the list to test. + */ +static inline int list_empty(const struct list_head *head) +{ + return head->next == head; +} + +static inline void __list_splice(struct list_head *list, + struct list_head *head) +{ + struct list_head *first = list->next; + struct list_head *last = list->prev; + struct list_head *at = head->next; + + first->prev = head; + head->next = first; + + last->next = at; + at->prev = last; +} + +/* + * list_splice - join two lists + * @list: the new list to add. + * @head: the place to add it in the first list. + */ +static inline void list_splice(struct list_head *list, struct list_head *head) +{ + if (!list_empty(list)) + __list_splice(list, head); +} + +/* + * list_splice_init - join two lists and reinitialise the emptied list. + * @list: the new list to add. + * @head: the place to add it in the first list. + * + * The list at @list is reinitialised + */ +static inline void list_splice_init(struct list_head *list, + struct list_head *head) +{ + if (!list_empty(list)) { + __list_splice(list, head); + INIT_LIST_HEAD(list); + } +} + +/* + * list_entry - get the struct for this entry + * @ptr: the &struct list_head pointer. + * @type: the type of the struct this is embedded in. + * @member: the name of the list_struct within the struct. + */ +#define list_entry(ptr, type, member) \ + container_of(ptr, type, member) + +/* + * list_for_each - iterate over a list + * @pos: the &struct list_head to use as a loop counter. + * @head: the head for your list. + */ +#define list_for_each(pos, head) \ + for (pos = (head)->next; pos != (head); pos = pos->next) + +/* + * list_for_each_prev - iterate over a list backwards + * @pos: the &struct list_head to use as a loop counter. + * @head: the head for your list. + */ +#define list_for_each_prev(pos, head) \ + for (pos = (head)->prev; pos != (head); pos = pos->prev) + +/* + * list_for_each_safe - iterate over a list safe against removal of list entry + * @pos: the &struct list_head to use as a loop counter. + * @n: another &struct list_head to use as temporary storage + * @head: the head for your list. + */ +#define list_for_each_safe(pos, n, head) \ + for (pos = (head)->next, n = pos->next; pos != (head); \ + pos = n, n = pos->next) + +/* + * list_for_each_entry - iterate over list of given type + * @pos: the type * to use as a loop counter. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry(pos, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.next, typeof(*pos), member)) + +/* + * list_for_each_entry_reverse - iterate backwards over list of given type. + * @pos: the type * to use as a loop counter. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_reverse(pos, head, member) \ + for (pos = list_entry((head)->prev, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.prev, typeof(*pos), member)) + +/* + * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry + * @pos: the type * to use as a loop counter. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_safe(pos, n, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member), \ + n = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.next, typeof(*n), member)) + + +/* Return pointer to first true entry, if any, or NULL. A macro + required to allow inlining of cmpfn. */ +#define LIST_FIND(head, cmpfn, type, args...) \ +({ \ + const struct list_head *__i, *__j = NULL; \ + \ + list_for_each(__i, (head)) \ + if (cmpfn((const type)__i , ## args)) { \ + __j = __i; \ + break; \ + } \ + (type)__j; \ +}) + +#endif /* _LIST_H_ */ diff --git a/logging.c b/logging.c new file mode 100644 index 0000000..d4fd706 --- /dev/null +++ b/logging.c @@ -0,0 +1,103 @@ +/*************************************************************************** + * Copyright (C) 06/2006 by Olaf Rempel * + * razzor@kopf-tisch.de * + * * + * This program is free software; you can redistribute it and/or modify * + * it under the terms of the GNU General Public License as published by * + * the Free Software Foundation; either version 2 of the License, or * + * (at your option) any later version. * + * * + * This program 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 General Public License for more details. * + * * + * You should have received a copy of the GNU General Public License * + * along with this program; if not, write to the * + * Free Software Foundation, Inc., * + * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * + ***************************************************************************/ +#include +#include +#include +#include +#include +#include + +#include "logging.h" + +#define BUFSIZE 8192 + +static FILE *log_fd = NULL; +static char *buffer = NULL; + +void log_print(int prio, const char *fmt, ...) +{ + va_list az; + int len; + + if (buffer == NULL) { + buffer = malloc(BUFSIZE); + if (buffer == NULL) { + fprintf(stderr, "log_print: out of memory\nBailing out!\n"); + exit(-1); + } + } + + va_start(az, fmt); + len = vsnprintf(buffer, BUFSIZE, fmt, az); + va_end(az); + + if (len < 0 || len >= BUFSIZE) { + log_print(LOG_ERROR, "log_print: arguments too long"); + errno = 0; + return; + } + + if (errno) { + strncpy(buffer + len, ": ", BUFSIZE - len); + len += 2; + strncpy(buffer + len, strerror(errno), BUFSIZE - len); + } + + if (log_fd) { + char tbuf[64]; + time_t tzgr; + + time(&tzgr); + strftime(tbuf, sizeof(tbuf), "%b %d %H:%M:%S :", localtime(&tzgr)); + + fprintf(log_fd, "%s %s\n", tbuf, buffer); + fflush(log_fd); + + } else { + fprintf(stderr, "%s\n", buffer); + } + + errno = 0; +} + +static void log_close(void) +{ + if (buffer) + free(buffer); + + fclose(log_fd); +} + +int log_init(char *logfile) +{ + log_fd = fopen(logfile, "a"); + if (log_fd == NULL) { + log_print(LOG_ERROR, "log_open('%s'): %s", logfile); + return 0; + } + + if (atexit(log_close) != 0) { + log_print(LOG_ERROR, "log_open(): atexit()"); + return 0; + } + + log_print(LOG_EVERYTIME, "=========================="); + return 1; +} diff --git a/logging.h b/logging.h new file mode 100644 index 0000000..c6e32c0 --- /dev/null +++ b/logging.h @@ -0,0 +1,16 @@ +#ifndef _LOGGING_H_ +#define _LOGGING_H_ + +#define LOG_DEBUG 5 +#define LOG_INFO 4 +#define LOG_NOTICE 3 +#define LOG_WARN 2 +#define LOG_ERROR 1 +#define LOG_CRIT 0 + +#define LOG_EVERYTIME 0 + +int log_init(char *logfile); +void log_print(int prio, const char *fmt, ... ); + +#endif /* _LOGGING_H_ */ diff --git a/sys/inotify.h b/sys/inotify.h new file mode 100644 index 0000000..5e424d8 --- /dev/null +++ b/sys/inotify.h @@ -0,0 +1,87 @@ +#ifndef _SYS_INOTIFY_H +#define _SYS_INOTIFY_H 1 + +#include + +/* Structure describing an inotify event. */ +struct inotify_event +{ + int wd; /* Watch descriptor. */ + uint32_t mask; /* Watch mask. */ + uint32_t cookie; /* Cookie to synchronize two events. */ + uint32_t len; /* Length (including NULs) of name. */ + char name __flexarr; /* Name. */ +}; + +/* the following are legal, implemented events that user-space can watch for */ +#define IN_ACCESS 0x00000001 /* File was accessed */ +#define IN_MODIFY 0x00000002 /* File was modified */ +#define IN_ATTRIB 0x00000004 /* Metadata changed */ +#define IN_CLOSE_WRITE 0x00000008 /* Writtable file was closed */ +#define IN_CLOSE_NOWRITE 0x00000010 /* Unwrittable file closed */ +#define IN_OPEN 0x00000020 /* File was opened */ +#define IN_MOVED_FROM 0x00000040 /* File was moved from X */ +#define IN_MOVED_TO 0x00000080 /* File was moved to Y */ +#define IN_CREATE 0x00000100 /* Subfile was created */ +#define IN_DELETE 0x00000200 /* Subfile was deleted */ +#define IN_DELETE_SELF 0x00000400 /* Self was deleted */ +#define IN_MOVE_SELF 0x00000800 /* Self was moved */ + +/* the following are legal events. they are sent as needed to any watch */ +#define IN_UNMOUNT 0x00002000 /* Backing fs was unmounted */ +#define IN_Q_OVERFLOW 0x00004000 /* Event queued overflowed */ +#define IN_IGNORED 0x00008000 /* File was ignored */ + +/* helper events */ +#define IN_CLOSE (IN_CLOSE_WRITE | IN_CLOSE_NOWRITE) /* close */ +#define IN_MOVE (IN_MOVED_FROM | IN_MOVED_TO) /* moves */ + +/* special flags */ +#define IN_ONLYDIR 0x01000000 /* only watch the path if it is a directory */ +#define IN_DONT_FOLLOW 0x02000000 /* don't follow a sym link */ +#define IN_MASK_ADD 0x20000000 /* add to the mask of an already existing watch */ +#define IN_ISDIR 0x40000000 /* event occurred against dir */ +#define IN_ONESHOT 0x80000000 /* only send event once */ + +/* + * All of the events - we build the list by hand so that we can add flags in + * the future and not break backward compatibility. Apps will get only the + * events that they originally wanted. Be sure to add new events here! + */ +#define IN_ALL_EVENTS (IN_ACCESS | IN_MODIFY | IN_ATTRIB | IN_CLOSE_WRITE | \ + IN_CLOSE_NOWRITE | IN_OPEN | IN_MOVED_FROM | \ + IN_MOVED_TO | IN_DELETE | IN_CREATE | IN_DELETE_SELF | \ + IN_MOVE_SELF) + +/* needed until Inotify! syscalls reach glibc */ +#include +#ifndef __NR_inotify_init +#if defined(__i386__) +# define __NR_inotify_init 291 +# define __NR_inotify_add_watch 292 +# define __NR_inotify_rm_watch 293 +#elif defined(__x86_64__) +# define __NR_inotify_init 253 +# define __NR_inotify_add_watch 254 +# define __NR_inotify_rm_watch 255 +#else +#warning "inotify unsupported on this architecture!" +#endif +#endif /* __NR_inotify_init */ + +static inline int inotify_init(void) +{ + return syscall(__NR_inotify_init); +} + +static inline int inotify_add_watch(int fd, const char *name, uint32_t mask) +{ + return syscall(__NR_inotify_add_watch, fd, name, mask); +} + +static inline int inotify_rm_watch(int fd, uint32_t wd) +{ + return syscall(__NR_inotify_rm_watch, fd, wd); +} + +#endif /* sys/inotify.h */