incron-0.5.10/0000755000175000001440000000000011737665757011627 5ustar lukusersincron-0.5.10/incron.conf.50000644000175000001440000000321711737665757014134 0ustar lukusers.TH "incron.conf" "5" "0.5.10" "Lukas Jelinek" "incron documentation" .SH "NAME" /etc/incron.conf \- main config file for inotify cron (incron) .SH "DESCRIPTION" The file \fI/etc/incron.conf\fR contains default settings for the program .BR incrond. Each line holds a single value pair in the form \fIoption\fR = \fIvalue\fR. Comment lines must have a hash sign (#) in the first line. .P The valid configuration options are: .TP \fBsystem_table_dir\fP This directory is examined by incrond for system table files. .BR Default : \fI/etc/incron.d\fR .TP \fBuser_table_dir\fP This directory is examined by incrond for user table files. .BR Default : \fI/var/spool/incron\fR .TP \fBallowed_users\fP This file contains users allowed to use incron. .BR Default : \fI/etc/incron.allow\fR .TP \fBdenied_users\fP This file contains users denied to use incron. .BR Default : \fI/etc/incron.deny\fR .TP \fBlockfile_dir\fP This directory is used for creating a lock avoiding to run multiple instances of incrond. .BR Default : \fI/var/run\fR .TP \fBlockfile_name\fP This name (appended by '.pid') is used for creating a lock avoiding to run multiple instances of incrond. .BR Default : \fIincrond\fR .TP \fBeditor\fP This name or path is used to run as an editor for editing incron tables. Default \fIno editor\fR is given, system editor used, this option overide this. .SH "SEE ALSO" incrond(8), incrontab(1), incrontab(5) .SH "AUTHOR" Lukas Jelinek (please report bugs to http://bts.aiken.cz or ). .SH "COPYING" This program is free software. It can be used, redistributed and/or modified under the terms of the GNU General Public License, version 2. incron-0.5.10/incrontab.50000644000175000001440000001162511737665757013701 0ustar lukusers.TH "incrontab" "5" "0.5.10" "Lukas Jelinek" "incron documentation" .SH "NAME" incrontab \- tables for driving inotify cron (incron) .SH "DESCRIPTION" An incrontab file contains instructions to the \fIincrond\fR(8) daemon of the general form: "run this command on these file events". There are two categories of tables: system tables (with root privileges) and user tables (with user privileges). System tables are (by default) located in /etc/incron.d and may have any names. Each system table exists separately inside incron and their watches never collide. Each user has their own table, and commands in any given incrontab will be executed as the user who owns the incrontab. System users (such as apache, postfix, nobody etc.) may have their own incrontab. incrontab files are read when the \fIincrond\fR(8) daemon starts and after any change (incrontab file are being hooked when incrond is running). Blank lines are ignored. The general line format is the following: Where \fIpath\fR is an absolute filesystem path, \fImask\fR is an event mask (in symbolic or numeric form) and \fIcommand\fR is an executable file (or a script) with its arguments. See bellow for event mask symbols. The executable file may be noted as an absolute path or only as the name itself (PATH locations are examined). Please remember that the same path may occur only once per table (otherwise only the first occurrence takes effect and an error message is emitted to the system log). .SH "EVENT SYMBOLS" These basic event mask symbols are defined: \fBIN_ACCESS\fR File was accessed (read) (*) .br \fBIN_ATTRIB\fR Metadata changed (permissions, timestamps, extended attributes, etc.) (*) .br \fBIN_CLOSE_WRITE\fR File opened for writing was closed (*) .br \fBIN_CLOSE_NOWRITE\fR File not opened for writing was closed (*) .br \fBIN_CREATE\fR File/directory created in watched directory (*) .br \fBIN_DELETE\fR File/directory deleted from watched directory (*) .br \fBIN_DELETE_SELF\fR Watched file/directory was itself deleted .br \fBIN_MODIFY\fR File was modified (*) .br \fBIN_MOVE_SELF\fR Watched file/directory was itself moved .br \fBIN_MOVED_FROM\fR File moved out of watched directory (*) .br \fBIN_MOVED_TO\fR File moved into watched directory (*) .br \fBIN_OPEN\fR File was opened (*) When monitoring a directory, the events marked with an asterisk (*) above can occur for files in the directory, in which case the name field in the returned event data identifies the name of the file within the directory. The \fBIN_ALL_EVENTS\fR symbol is defined as a bit mask of all of the above events. Two additional convenience symbols are \fBIN_MOVE\fR, which is a combination of \fBIN_MOVED_FROM\fR and \fBIN_MOVED_TO\fR, and \fBIN_CLOSE\fR which combines \fBIN_CLOSE_WRITE\fR and \fBIN_CLOSE_NOWRITE\fR. The following further symbols can be specified in the mask: \fBIN_DONT_FOLLOW\fR Don't dereference pathname if it is a symbolic link .br \fBIN_ONESHOT\fR Monitor pathname for only one event .br \fBIN_ONLYDIR\fR Only watch pathname if it is a directory Additionaly, there is a symbol which doesn't appear in the inotify symbol set. It it \fBIN_NO_LOOP\fR. This symbol disables monitoring events until the current one is completely handled (until its child process exits). .SH "WILDCARDS" The following wildards may be used inside command specification: \fB$$\fR dollar sign .br \fB$@\fR watched filesystem path (see above) .br \fB$#\fR event-related file name .br \fB$%\fR event flags (textually) .br \fB$&\fR event flags (numerically) .SH "EXAMPLE" These are some example rules which can be used in an incrontab file: \fB/tmp IN_ALL_EVENTS abcd $@/$# $%\fR \fB/usr/bin IN_ACCESS,IN_NO_LOOP abcd $#\fR \fB/home IN_CREATE /usr/local/bin/abcd $#\fR \fB/var/log 12 abcd $@/$#\fR The first line monitors all events on the /tmp directory. When an event occurs it runs a application called 'abcd' with the full path of the file as the first arguments and the event flags as the second one. The second line monitors accesses (readings) on the /usr/bin directory. The application 'abcd' is run as a handler and the appropriate event watch is disabled until the program finishes. The file name (without the directory path) is passed in as an argument. The third example is used for monitoring the /home directory for newly create files or directories (it practically means an event is sent when a new user is added). This event is processed by a program specified by an absolute path. And the final line shows how to use numeric event mask instead of textual one. The value 12 is exactly the same as IN_ATTRIB,IN_CLOSE_WRITE. .SH "SEE ALSO" incrond(8), incrontab(1), incron.conf(5) .SH "AUTHOR" Lukas Jelinek (please report bugs to http://bts.aiken.cz or ). .SH "COPYING" This program is free software. It can be used, redistributed and/or modified under the terms of the GNU General Public License, version 2. incron-0.5.10/incrontab.10000644000175000001440000000706711737665757013702 0ustar lukusers.TH "incrontab" "1" "0.5.10" "Lukas Jelinek" "incron documentation" .SH "NAME" incrontab \- table manipulator for inotify cron (incron) .SH "SYNOPSIS" \fBincrontab\fR [\fB\-u\fR \fIuser\fR] [\fB\-f\fR \fIconfig\fR] \fIfile\fR \fBincrontab\fR [\fB\-u\fR \fIuser\fR] [\fB\-f\fR \fIconfig\fR] [\fB\-l\fR | \fB\-r\fR | \fB\-e\fR | \fB\-t\fR | \fB\-d\fR] .SH "DESCRIPTION" incrontab is a table manipulator for the inotify cron (incron) system. It creates, removes, modifies and lists user tables (\fIincrontab\fR(5)). Each user (including system users even they haven't home directories) has an incron table which can't be manipulated directly (only root can effectively change these tables and is NOT recommended to do so). All informational messages of this program are printed to the standard error output (stderr). If \fI/etc/incron.allow\fR exists only users listed here may use incron. Otherwise if \fI/etc/incron.deny\fR exists only users NOT listed here may use incron. If none of these files exists everyone is allowed to use incron. (\fBImportant note:\fR This behavior is insecure and will be probably changed to be compatible with the style used by ISC Cron.) Location of these files can be changed in the configuration. The first form of this command imports a file, validates it and stores to the table. "\-" can be used for loading from the standard input. \fB\-u\fR (or \fB\-\-user\fR) option overrides the current (real) user to the given one. This option is intended for manipulation with system users' tables (such as apache, postfix, daemon etc.). It can be used only if the current user has root's effective rights. \fB\-l\fR (or \fB\-\-list\fR) option causes the current table is printed to the standard output. \fB\-r\fR (or \fB\-\-remove\fR) option causes the current table (if any) is permanently remove without any warning or confirmation. Use with caution! \fB\-e\fR (or \fB\-\-edit\fR) option causes executing an editor for editing the user table (see below for the information about editor selection). You can edit your incron table now. If the table is changed it stores the modified version. \fB\-t\fR (or \fB\-\-types\fR) option causes the list of supported event types (delimited by commas) is printed to the standard output. This feature is intended for front\-end applications to find out which event types was compiled in. \fB\-d\fR (or \fB\-\-reload\fR) option causes reloading the current table by \fIincrond\fR(8). It is done through "touching" the table (writing into it without modifying it). This feature is intended e.g. for creating watches on newly created files (with already existing rules) or for rearming IN_ONESHOT watches. \fB\-f \fR (or \fB\-\-config=\fR) option specifies another location for the configuration file (/etc/incron.conf is used by default). This feature requires root privileges. There is a few complex algorithm how to determine which editor will be user for editing. If any of the following rule succeeds the appropriate editor is used: 1. EDITOR environment variable 2. VISUAL environment variable 3. configuration value 4. etc/alternatives/editor 5. hard\-wired editor (\fIvim\fR by default) It's not recommended to use graphical editors (such as gVim, KEdit etc.) due to possible problems with connecting to the X server. .SH "SEE ALSO" incrond(8), incrontab(5), incron.conf(5) .SH "AUTHOR" Lukas Jelinek (please report bugs to http://bts.aiken.cz or ). .SH "COPYING" This program is free software. It can be used, redistributed and/or modified under the terms of the GNU General Public License, version 2. incron-0.5.10/incrond.80000644000175000001440000000641211737665757013357 0ustar lukusers.TH "incrond" "8" "0.5.10" "Lukas Jelinek" "incron documentation" .SH "NAME" incrond \- inotify cron (incron) daemon .SH "SYNOPSIS" \fBincrond\fR [ \-f \fIfile\fR ] [ \-n | \-k ] .SH "DESCRIPTION" The inotify cron daemon (\fIincrond\fR) is a daemon which monitors filesystem events and executes commands defined in system and user tables. It's use is generally similar to \fIcron\fR(8). \fIincrond\fR can be started from /etc/rc, /etc/rc.local and so on. It daemonizes itself (returns immediately) and doesn't need to be started with & and through \fInohup\fR(1). It can be run on foreground too. \fIincrond\fR uses two categories of tables \fIincrontab\fR(5). System tables are usually located in /etc/incron.d and are maintained outside of incron (e.g. by various applications). These tables work on root rights level and thus any file may be watched and commands are executed with root privileges. User tables are located in /var/spool/incron by default and have names based on user accounts. These tables use users' access rights, thus only files which the user may access are watched. Commands are executed with users' privileges. If a table (incrontab) is changed \fIincrond\fR reacts immediately and reloads the table. Currently running child processes (commands) are not affected. There are two files determining whether an user is allowed to use incron. These files have very simple syntax \- one user name per line. If /etc/incron.allow exists the user must be noted there to be allowed to use incron. Otherwise if /etc/incron.deny exists the user must not be noted there to use incron. If none of these files exists there is no other restriction whether anybody may use incron. Location of these files can be changed in the configuration. The daemon itself is currently not protected against looping. If a command executed due to an event causes the same event it leads to an infinite loop unless a flag mask containing IN_NO_LOOP is specified. Please beware of this and do not allow permission for use incron to unreliable users. \fB\-n\fR (or \fB\-\-foreground\fR) option causes running on foreground. This is useful especially for testing, debugging and optimization. \fB\-k\fR (or \fB\-\-kill\fR) option terminates a running instance of \fBincrond\fR. \fB\-f \fR (or \fB\-\-config=\fR) option specifies another location for the configuration file (/etc/incron.conf is used by default). \fBEnvironment variables:\fR For system tables, the default (the same as for incrond itself) environment variable set is used. The same applies to root's table. For non\-root user tables, the whole environment is cleared and then only these variables are set: LOGNAME, USER, USERNAME, SHELL, HOME and PATH. The variables (except PATH) take values from the user database (e.g. /etc/passwd). The PATH variable is set to /usr/local/bin:/usr/bin:/bin:/usr/X11R6/bin. .SH "SEE ALSO" incrontab(1), incrontab(5), incron.conf(5) .SH "BUGS" incrond is currently not resistent against looping. Recursive monitoring (whole subtrees) has not been implemented yet. .SH "AUTHOR" Lukas Jelinek (please report bugs to http://bts.aiken.cz or ). .SH "COPYING" This program is free software. It can be used, redistributed and/or modified under the terms of the GNU General Public License, version 2. incron-0.5.10/VERSION0000644000175000001440000000000611737665757012673 0ustar lukusers0.5.10incron-0.5.10/TODO0000644000175000001440000000010211737665757012310 0ustar lukusersCurrently pending tasks: * recursive monitoring (whole subtrees) incron-0.5.10/README0000644000175000001440000000777611737665757012530 0ustar lukusers inotify cron system (c) Lukas Jelinek, 2006, 2007, 2008, 2009, 2012 1. About 2. Requirements 3. How to use 4. Bugs, suggestions 5. Licensing 6. Documentation ======================================================================== 1. About This program is the "inotify cron" system. It consist of a daemon and a table manipulator. You can use it a similar way as the regular cron. The difference is that the inotify cron handles filesystem events rather than time periods. 2. Requirements * Linux kernel 2.6.13 or later (with inotify compiled in) * inotify headers (inotify.h, sometimes inotify-syscalls.h) installed in /sys. The most common place is /usr/include/sys. * GCC 4.x compiler (probably works also with GCC 3.4, possibly with older versions too) 3. How to build Because this version is very early it does not contain a standard portable build mechanism. There is only a Makefile which must be modified manually. On many Linux systems you need not to change anything. Please review the Makefile BEFORE you type 'make'. Especially check the PREFIX and other common variables. If done you can now build the files ('make'). The binaries must be of course installed as root. If you want to use (after editing) the example configuration file simply rename it from /etc/incron.conf.example to /etc/incron.conf (you can also use -f for one-time use of a custom configuration file). Making a release of the source tree relies on the 'VERSION' file. The file should contain only a simple version string such as '0.5.9' or (if you wish) something more comlex (e.g. '0.5.9-improved'). The doxygen program must be installed and its control file 'Doxygen' created for generating the API documentation. 4. How to use The incron daemon (incrond) must be run under root (typically from runlevel script etc.). It loads the current user tables and hooks them for later changes. The incron table manipulator may be run under any regular user since it SUIDs. For manipulation with the tables use basically the same syntax as for the crontab program. You can import a table, remove and edit the current table. The user table rows have the following syntax: Where: is a filesystem path (currently avoid whitespaces!) is a symbolic (see inotify.h; use commas for separating symbols) or numeric mask for events is an application or script to run on the events The command may contain these wildcards: $$ - a dollar sign $@ - the watched filesystem path (see above) $# - the event-related file name $% - the event flags (textually) $& - the event flags (numerically) The mask may additionaly contain a special symbol IN_NO_LOOP which disables events occurred during the event handling (to avoid loops). Example 1: You need to run program 'abc' with the full file path as an argument every time a file is changed in /var/mail. One of the solutions follows: /var/mail IN_CLOSE_WRITE abc $@/$# Example 2: You need to run program 'efg' with the full file path as the first argument and the numeric event flags as the second one. It have to monitor all events on files in /tmp. Here is it: /tmp IN_ALL_EVENTS efg $@/$# $& Since 0.4.0 also system tables are supported. They are located in /etc/incron.d and their commands use root privileges. System tables are intended to be changed directly (without incrontab). Some parameters of both incrontab and incrond can be changed by the configuration. See the example file for more information. 5. Bugs, suggestions THIS PROGRAM IS AN ALPHA VERSION. IT PROBABLY CONTAINS BUGS AND THEREFORE IT IS NOT INTENDED FOR PRODUCTION USE. If you find a bug or have a suggestion how to improve the program, please use the bug tracking system at http://bts.aiken.cz. 6. Licensing This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL). Some parts may be also covered by other licenses. Please look into the source files for detailed information. incron-0.5.10/LICENSE-X110000644000175000001440000000207111737665757013203 0ustar lukusersCopyright (c) 2006, 2007, 2008, 2009, 2012 Lukas Jelinek Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. incron-0.5.10/LICENSE-LGPL0000644000175000001440000006350011737665757013374 0ustar lukusers GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, 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 library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete 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 distribute a copy of this License along with the Library. 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 Library or any portion of it, thus forming a work based on the Library, 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) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, 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 Library, 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 Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you 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. If distribution of 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 satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be 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. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library 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. 9. 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 Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library 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 with this License. 11. 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 Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library 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 Library. 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. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library 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. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library 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 Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, 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 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. 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 LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), 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 Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. 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) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! incron-0.5.10/LICENSE-GPL0000644000175000001440000004307611737665757013266 0ustar lukusers GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, 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 Appendix: 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., 675 Mass Ave, Cambridge, MA 02139, 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. incron-0.5.10/COPYING0000644000175000001440000000056311737665757012666 0ustar lukusersinotify cron system Copyright (C) 2006,2007,2008,2009,2012 Lukas Jelinek, This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL). The program uses some parts covered also by other licenses. Please look into the source files for detailed information. incron-0.5.10/CHANGELOG0000644000175000001440000001067711737665757013054 0ustar lukusers0.5.10 2012-04-05 * some includes fixed to build correctly with GCC 4.6 (and 4.4-4.5 - #0000385, #0000447) * some type issues fixed (#0000447) * EAGAIN handling in poll() (#0000399, #0000686, #0000691) * Makefile improved as of #0000512 * typo in various files fixed (#0000412) 0.5.9 2009-06-21 * spaces in event-related file names now handled correctly (#0000174) * crashing on 'incrontab --user' fixed (#0000187) * man pages improved (bug reporting info as of #0000407) * Makefile improved ('release-clean' also removes 'doc') 0.5.8 2008-12-29 * more includes added for GCC 4.3 compatibility (#0000178) * typo in help messages fixed (#0000172) * some warnings fixed (#0000372) 0.5.7 2007-09-04 * man pages updated (mainly due to #0000157) * some includes added for GCC 4.3 compatibility (#0000158) * supplementary groups initialization (#0000167) 0.5.6 2007-04-18 * based on inotify-cxx 0.7.2 (fixes compilation problems on Debian Sarge, #0000155) 0.5.5 2007-02-14 * another bug related to environment variables fixed (#0000151) * -V (--version) malfunction fixed (#0000150) 0.5.4 2007-02-11 * bug related to persisting environment fixed (#0000149) * incrond(8) man page updated to explain how the environment is treated * buggy example configuration file fixed 0.5.3 2007-02-08 * bug related to ignoring new tables fixed (#0000142) * explicit typecasting in execlp() call (#0000145) * memory leak related to loaded tables fixed (#0000144) * documentation for 'incrontab -d' added (#0000146) * man page for incron.conf added (#0000147) 0.5.2 2007-02-04 * lockfile permissions changed to 0644 (reopened #0000137) * incorrect reporting of removing non-existing tables fixed (#0000141) 0.5.1 2007-01-28 * lockfile location problems fixed (#0000137) * lockfile configuration failure fixed (#0000140) * CRLFs inside LICENCE-GPL changed to LFs (#0000138) 0.5.0 2007-01-27 * based on inotify-cxx 0.7.1 * bug related to events names fixed (#0000134) * instance locking (only one instance allowed - also fixes #0000136) * configuration introduced (including custom cfg. files) * waiting for child processes rewritten to avoid race conditions * user can request reloading the table (#0000130) * new implementation for command line arguments * some code refactoring 0.4.0 2007-01-13 * based on inotify-cxx 0.7.0 * incrontab has a feature to find out supported event types (--types or -t) * incrond now supports command line arguments * incrond can be run on foreground (--foreground, -n) * incrond can be simply stopped (--kill, -k) * support for system tables (/etc/incron.d) added * eaccess() replaced by euiaccess() (#0000125) * each table now use its own inotify descriptor (#0000129) * descriptors are closed on executing child processes 0.3.5 2007-01-09 * based on inotify-cxx 0.6.3 * a security bug related to access rights to watched files fixed (#0000119) * crashing on table reload after removing a watched path fixed (#0000123) * 'incrontab --list' dysfunction fixed (#0000122) 0.3.4 2007-01-03 * based on inotify-cxx 0.6.2 * problems with wrong ordered setting of UID/GID fixed (#0000115, #0000117) * user tables have 0600 permission now 0.3.3 2006-12-15 * based on inotify-cxx 0.5.3 * "GID ignorance" bug fixed (#0000109) * "zombie bug" fixed (#0000105) * code cleanup and simplifying 0.3.2 2006-12-02 * problems with reiserfs fixed (#0000104) 0.3.1 2006-11-24 * user manual added * incron tables now owned by root (also fixes #0000103) 0.3.0 2006-11-12 * based on inotify-cxx 0.5.2 (fixes a problem with ignoring IN_OPEN) * two new special symbols ($% for flags as names, $& for numeric flags) * whitespaces in paths now allowed (by prepending a backslash) (#0000098) * some changes in logging etc. 0.2.3 2006-10-30 * problems with unwanted IN_NO_LOOP have been fixed (#0000097) 0.2.2 2006-10-29 * based on inotify-cxx 0.5.0 * 'uncleaned children' bug has been fixed (#0000095) * memory leak (child process arguments) has been fixed (#0000096) 0.2.1 2006-10-14 * based on inotify-cxx 0.4.1 (it should also fix crashing as described in #0000085) * build failure (due to missing 'useradd -M') on some distributions has been fixed (#0000094) * tarball structure has been fixed (#0000089) * documentation slightly improved 0.2.0 2006-10-04 * based on inotify-cxx 0.3.1 * better signal handling (no "dirty" wait() in a handler) * loop avoidance can be used * more documentation in the code 0.1.0 2006-09-15 * first alpha version incron-0.5.10/Makefile0000644000175000001440000000707011737665757013273 0ustar lukusers PREFIX = /usr/local USERDATADIR = /var/spool/incron SYSDATADIR = /etc/incron.d CFGDIR = /etc MANPATH = $(PREFIX)/share/man RELEASE = incron-`cat VERSION` RELEASEDIR = /tmp/$(RELEASE) DOCDIR = $(PREFIX)/share/doc/$(RELEASE)/ USER = root CXX ?= g++ INSTALL = install OPTIMIZE = -O2 DEBUG = -g0 WARNINGS = -Wall CXXAUX = -pipe CXXFLAGS ?= $(OPTIMIZE) $(DEBUG) $(CXXAUX) CXXFLAGS += $(WARNINGS) PROGRAMS = incrond incrontab INCROND_OBJ = icd-main.o incrontab.o inotify-cxx.o usertable.o strtok.o appinst.o incroncfg.o appargs.o INCRONTAB_OBJ = ict-main.o incrontab.o inotify-cxx.o strtok.o incroncfg.o appargs.o all: $(PROGRAMS) incrond: $(INCROND_OBJ) $(CXX) $(CXXFLAGS) $(LDFLAGS) -o $@ $(INCROND_OBJ) incrontab: $(INCRONTAB_OBJ) $(CXX) $(CXXFLAGS) $(LDFLAGS) -o $@ $(INCRONTAB_OBJ) .cpp.o: $(CXX) -c $(CPPFLAGS) $(CXXFLAGS) -o $@ $< clean: rm -f $(PROGRAMS) rm -f *.o distclean: clean install: all install-man $(INSTALL) -m 0755 -d $(DESTDIR)$(PREFIX)/bin/ $(INSTALL) -m 0755 -d $(DESTDIR)$(PREFIX)/sbin/ $(INSTALL) -m 0755 -d $(DESTDIR)$(DOCDIR)/ $(INSTALL) -m 04755 -o $(USER) incrontab $(DESTDIR)$(PREFIX)/bin/ $(INSTALL) -m 0755 incrond $(DESTDIR)$(PREFIX)/sbin/ $(INSTALL) -m 0755 -o $(USER) -d $(DESTDIR)$(USERDATADIR) $(INSTALL) -m 0755 -o $(USER) -d $(DESTDIR)$(SYSDATADIR) $(INSTALL) -m 0644 incron.conf.example $(DESTDIR)$(DOCDIR)/ install-man: incrontab.1 incrontab.5 incrond.8 incron.conf.5 $(INSTALL) -m 0755 -d $(DESTDIR)$(MANPATH)/man1 $(INSTALL) -m 0755 -d $(DESTDIR)$(MANPATH)/man5 $(INSTALL) -m 0755 -d $(DESTDIR)$(MANPATH)/man8 $(INSTALL) -m 0644 incrontab.1 $(DESTDIR)$(MANPATH)/man1 $(INSTALL) -m 0644 incrontab.5 $(DESTDIR)$(MANPATH)/man5 $(INSTALL) -m 0644 incrond.8 $(DESTDIR)$(MANPATH)/man8 $(INSTALL) -m 0644 incron.conf.5 $(DESTDIR)$(MANPATH)/man5 uninstall: uninstall-man rm -f $(DESTDIR)$(PREFIX)/bin/incrontab rm -f $(DESTDIR)$(PREFIX)/sbin/incrond rm -rf $(DESTDIR)$(DOCDIR)/ uninstall-man: rm -f $(DESTDIR)$(MANPATH)/man1/incrontab.1 rm -f $(DESTDIR)$(MANPATH)/man5/incrontab.5 rm -f $(DESTDIR)$(MANPATH)/man8/incrond.8 rm -f $(DESTDIR)$(MANPATH)/man5/incron.conf.5 update: uninstall install release: doxygen mkdir -p $(RELEASEDIR) cp -r doc $(RELEASEDIR) cp *.h $(RELEASEDIR) cp *.cpp $(RELEASEDIR) cp incron.conf.example $(RELEASEDIR) cp Makefile CHANGELOG COPYING LICENSE-GPL LICENSE-LGPL LICENSE-X11 README TODO VERSION $(RELEASEDIR) cp incrond.8 incrontab.1 incrontab.5 incron.conf.5 $(RELEASEDIR) tar -c -f $(RELEASE).tar -C $(RELEASEDIR)/.. $(RELEASE) bzip2 -9 $(RELEASE).tar tar -c -f $(RELEASE).tar -C $(RELEASEDIR)/.. $(RELEASE) gzip --best $(RELEASE).tar echo #!/bin/sh > myzip echo cd $(RELEASEDIR)/.. >> myzip echo zip -r -9 `pwd`/$(RELEASE).zip $(RELEASE) >> myzip chmod 0700 myzip ./myzip rm -f myzip sha1sum $(RELEASE).tar.bz2 > sha1.txt sha1sum $(RELEASE).tar.gz >> sha1.txt sha1sum $(RELEASE).zip >> sha1.txt rm -rf $(RELEASEDIR) release-clean: rm -rf doc rm -f $(RELEASE).tar.bz2 rm -f $(RELEASE).tar.gz rm -f $(RELEASE).zip rm -f sha1.txt .PHONY: all clean distclean install install-man uninstall uninstall-man release release-clean update .POSIX: icd-main.o: icd-main.cpp inotify-cxx.h incrontab.h usertable.h incron.h appinst.h incroncfg.h appargs.h incrontab.o: incrontab.cpp incrontab.h inotify-cxx.h strtok.h inotify-cxx.o: inotify-cxx.cpp inotify-cxx.h usertable.o: usertable.cpp usertable.h strtok.h ict-main.o: ict-main.cpp incrontab.h incron.h incroncfg.h appargs.h strtok.o: strtok.cpp strtok.h appinst.o: appinst.cpp appinst.h incroncfg.o: incroncfg.cpp incroncfg.h appargs.o: appargs.cpp appargs.h incron-0.5.10/incron.conf.example0000644000175000001440000000330011737665757015414 0ustar lukusers# # *** incron example configuration file *** # # (c) Lukas Jelinek, 2007, 2008 # # Parameter: system_table_dir # Meaning: system table directory # Description: This directory is examined by incrond for system table files. # Default: /etc/incron.d # # Example: # system_table_dir = /var/spool/incron.systables # Parameter: user_table_dir # Meaning: user table directory # Description: This directory is examined by incrond for user table files. # Default: /var/spool/incron # # Example: # user_table_dir = /var/spool/incron.usertables # Parameter: allowed_users # Meaning: allowed users list file # Description: This file contains users allowed to use incron. # Default: /etc/incron.allow # # Example: # allowed_users = /etc/incron/allow # Parameter: denied_users # Meaning: denied users list file # Description: This file contains users denied to use incron. # Default: /etc/incron.deny # # Example: # denied_users = /etc/incron/deny # Parameter: lockfile_dir # Meaning: application lock file directory # Description: This directory is used for creating a lock avoiding to run # multiple instances of incrond. # Default: /var/run # # Example: # lockfile_dir = /tmp # Parameter: lockfile_name # Meaning: application lock file name base # Description: This name (appended by '.pid') is used for creating a lock # avoiding to run multiple instances of incrond. # Default: incrond # # Example: # lockfile_name = incron.lock # Parameter: editor # Meaning: editor executable # Description: This name or path is used to run as an editor for editing # user tables. # Default: vim # # Example: # editor = nano incron-0.5.10/usertable.cpp0000644000175000001440000003341411737665757014326 0ustar lukusers /// inotify cron daemon user tables implementation /** * \file usertable.cpp * * inotify cron system * * Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * * Credits: * David Santinoli (supplementary groups) * Boris Lechner (spaces in event-related file names) * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include #include #include #include #include #include #include #include "usertable.h" #include "incroncfg.h" #include "incrontab.h" #ifdef IN_DONT_FOLLOW #define DONT_FOLLOW(mask) InotifyEvent::IsType(mask, IN_DONT_FOLLOW) #else // IN_DONT_FOLLOW #define DONT_FOLLOW(mask) (false) #endif // IN_DONT_FOLLOW // this is not enough, but... #define DEFAULT_PATH "/usr/local/bin:/usr/bin:/bin:/usr/X11R6/bin" PROC_MAP UserTable::s_procMap; extern volatile bool g_fFinish; extern SUT_MAP g_ut; void on_proc_done(InotifyWatch* pW) { pW->SetEnabled(true); } EventDispatcher::EventDispatcher(int iPipeFd, Inotify* pIn, InotifyWatch* pSys, InotifyWatch* pUser) { m_iPipeFd = iPipeFd; m_iMgmtFd = pIn->GetDescriptor(); m_pIn = pIn; m_pSys = pSys; m_pUser = pUser; m_size = 0; m_pPoll = NULL; } EventDispatcher::~EventDispatcher() { if (m_pPoll != NULL) delete[] m_pPoll; } bool EventDispatcher::ProcessEvents() { // consume pipe events if any (and report back) bool pipe = (m_pPoll[0].revents & POLLIN); if (pipe) { char c; while (read(m_pPoll[0].fd, &c, 1) > 0) {} m_pPoll[0].revents = 0; } // process table management events if any if (m_pPoll[1].revents & POLLIN) { ProcessMgmtEvents(); m_pPoll[1].revents = 0; } InotifyEvent evt; for (size_t i=2; iGetInotify(); pIn->WaitForEvents(true); // process events for this object while (pIn->GetEvent(evt)) { ((*it).second)->OnEvent(evt); } } m_pPoll[i].revents = 0; } } return pipe; } void EventDispatcher::Register(UserTable* pTab) { if (pTab != NULL) { Inotify* pIn = pTab->GetInotify(); if (pIn != NULL) { int fd = pIn->GetDescriptor(); if (fd != -1) { m_maps.insert(FDUT_MAP::value_type(fd, pTab)); Rebuild(); } } } } void EventDispatcher::Unregister(UserTable* pTab) { FDUT_MAP::iterator it = m_maps.find(pTab->GetInotify()->GetDescriptor()); if (it != m_maps.end()) { m_maps.erase(it); Rebuild(); } } void EventDispatcher::Rebuild() { // delete old data if exists if (m_pPoll != NULL) delete[] m_pPoll; // allocate memory m_size = m_maps.size() + 2; m_pPoll = new struct pollfd[m_size]; // add pipe descriptor m_pPoll[0].fd = m_iPipeFd; m_pPoll[0].events = POLLIN; m_pPoll[0].revents = 0; // add table management descriptor m_pPoll[1].fd = m_iMgmtFd; m_pPoll[1].events = POLLIN; m_pPoll[1].revents = 0; // add all inotify descriptors FDUT_MAP::iterator it = m_maps.begin(); for (size_t i=2; iWaitForEvents(true); InotifyEvent e; while (m_pIn->GetEvent(e)) { if (e.GetWatch() == m_pSys) { if (e.IsType(IN_DELETE_SELF) || e.IsType(IN_UNMOUNT)) { syslog(LOG_CRIT, "base directory destroyed, exitting"); g_fFinish = true; } else if (!e.GetName().empty()) { SUT_MAP::iterator it = g_ut.find(IncronCfg::BuildPath(m_pSys->GetPath(), e.GetName())); if (it != g_ut.end()) { UserTable* pUt = (*it).second; if (e.IsType(IN_CLOSE_WRITE) || e.IsType(IN_MOVED_TO)) { syslog(LOG_INFO, "system table %s changed, reloading", e.GetName().c_str()); pUt->Dispose(); pUt->Load(); } else if (e.IsType(IN_MOVED_FROM) || e.IsType(IN_DELETE)) { syslog(LOG_INFO, "system table %s destroyed, removing", e.GetName().c_str()); delete pUt; g_ut.erase(it); } } else if (e.IsType(IN_CLOSE_WRITE) || e.IsType(IN_MOVED_TO)) { syslog(LOG_INFO, "system table %s created, loading", e.GetName().c_str()); UserTable* pUt = new UserTable(this, e.GetName(), true); g_ut.insert(SUT_MAP::value_type(IncronTab::GetSystemTablePath(e.GetName()), pUt)); pUt->Load(); } } } else if (e.GetWatch() == m_pUser) { if (e.IsType(IN_DELETE_SELF) || e.IsType(IN_UNMOUNT)) { syslog(LOG_CRIT, "base directory destroyed, exitting"); g_fFinish = true; } else if (!e.GetName().empty()) { SUT_MAP::iterator it = g_ut.find(IncronCfg::BuildPath(m_pUser->GetPath(), e.GetName())); if (it != g_ut.end()) { UserTable* pUt = (*it).second; if (e.IsType(IN_CLOSE_WRITE) || e.IsType(IN_MOVED_TO)) { syslog(LOG_INFO, "table for user %s changed, reloading", e.GetName().c_str()); pUt->Dispose(); pUt->Load(); } else if (e.IsType(IN_MOVED_FROM) || e.IsType(IN_DELETE)) { syslog(LOG_INFO, "table for user %s destroyed, removing", e.GetName().c_str()); delete pUt; g_ut.erase(it); } } else if (e.IsType(IN_CLOSE_WRITE) || e.IsType(IN_MOVED_TO)) { if (UserTable::CheckUser(e.GetName().c_str())) { syslog(LOG_INFO, "table for user %s created, loading", e.GetName().c_str()); UserTable* pUt = new UserTable(this, e.GetName(), false); g_ut.insert(SUT_MAP::value_type(IncronTab::GetUserTablePath(e.GetName()), pUt)); pUt->Load(); } } } } } } UserTable::UserTable(EventDispatcher* pEd, const std::string& rUser, bool fSysTable) : m_user(rUser), m_fSysTable(fSysTable) { m_pEd = pEd; m_in.SetNonBlock(true); m_in.SetCloseOnExec(true); } UserTable::~UserTable() { Dispose(); } void UserTable::Load() { m_tab.Load(m_fSysTable ? IncronTab::GetSystemTablePath(m_user) : IncronTab::GetUserTablePath(m_user)); int cnt = m_tab.GetCount(); for (int i=0; iRegister(this); } void UserTable::Dispose() { m_pEd->Unregister(this); IWCE_MAP::iterator it = m_map.begin(); while (it != m_map.end()) { InotifyWatch* pW = (*it).first; m_in.Remove(pW); PROC_MAP::iterator it2 = s_procMap.begin(); while (it2 != s_procMap.end()) { if ((*it2).second.pWatch == pW) { PROC_MAP::iterator it3 = it2; it2++; s_procMap.erase(it3); } else { it2++; } } delete pW; it++; } m_map.clear(); } void UserTable::OnEvent(InotifyEvent& rEvt) { InotifyWatch* pW = rEvt.GetWatch(); IncronTabEntry* pE = FindEntry(pW); // no entry found - this shouldn't occur if (pE == NULL) return; // discard event if user has no access rights to watch path if (!(m_fSysTable || MayAccess(pW->GetPath(), DONT_FOLLOW(rEvt.GetMask())))) return; std::string cmd; const std::string& cs = pE->GetCmd(); size_t pos = 0; size_t oldpos = 0; size_t len = cs.length(); while ((pos = cs.find('$', oldpos)) != std::string::npos) { if (pos < len - 1) { size_t px = pos + 1; if (cs[px] == '$') { cmd.append(cs.substr(oldpos, pos-oldpos+1)); oldpos = pos + 2; } else { cmd.append(cs.substr(oldpos, pos-oldpos)); if (cs[px] == '@') { // base path cmd.append(pW->GetPath()); oldpos = pos + 2; } else if (cs[px] == '#') { // file name cmd.append(IncronTabEntry::GetSafePath(rEvt.GetName())); oldpos = pos + 2; } else if (cs[px] == '%') { // mask symbols std::string s; rEvt.DumpTypes(s); cmd.append(s); oldpos = pos + 2; } else if (cs[px] == '&') { // numeric mask char* s; asprintf(&s, "%u", (unsigned) rEvt.GetMask()); cmd.append(s); free(s); oldpos = pos + 2; } else { oldpos = pos + 1; } } } else { cmd.append(cs.substr(oldpos, pos-oldpos)); oldpos = pos + 1; } } cmd.append(cs.substr(oldpos)); int argc; char** argv; if (!PrepareArgs(cmd, argc, argv)) { syslog(LOG_ERR, "cannot prepare command arguments"); return; } if (m_fSysTable) syslog(LOG_INFO, "(system::%s) CMD (%s)", m_user.c_str(), cmd.c_str()); else syslog(LOG_INFO, "(%s) CMD (%s)", m_user.c_str(), cmd.c_str()); if (pE->IsNoLoop()) pW->SetEnabled(false); pid_t pid = fork(); if (pid == 0) { // for system table if (m_fSysTable) { if (execvp(argv[0], argv) != 0) // exec failed { syslog(LOG_ERR, "cannot exec process: %s", strerror(errno)); _exit(1); } } else { // for user table RunAsUser(argv); } } else if (pid > 0) { ProcData_t pd; if (pE->IsNoLoop()) { pd.onDone = on_proc_done; pd.pWatch = pW; } else { pd.onDone = NULL; pd.pWatch = NULL; } s_procMap.insert(PROC_MAP::value_type(pid, pd)); } else { if (pE->IsNoLoop()) pW->SetEnabled(true); syslog(LOG_ERR, "cannot fork process: %s", strerror(errno)); } CleanupArgs(argc, argv); } IncronTabEntry* UserTable::FindEntry(InotifyWatch* pWatch) { IWCE_MAP::iterator it = m_map.find(pWatch); if (it == m_map.end()) return NULL; return (*it).second; } bool UserTable::PrepareArgs(const std::string& rCmd, int& argc, char**& argv) { if (rCmd.empty()) return false; StringTokenizer tok(rCmd, ' ', '\\'); std::deque args; while (tok.HasMoreTokens()) { args.push_back(tok.GetNextToken()); } if (args.empty()) return false; argc = (int) args.size(); argv = new char*[argc+1]; argv[argc] = NULL; for (int i=0; i 0) { PROC_MAP::iterator it = s_procMap.find(res); if (it != s_procMap.end()) { ProcData_t pd = (*it).second; if (pd.onDone != NULL) (*pd.onDone)(pd.pWatch); s_procMap.erase(it); } } } bool UserTable::MayAccess(const std::string& rPath, bool fNoFollow) const { // first, retrieve file permissions struct stat st; int res = fNoFollow ? lstat(rPath.c_str(), &st) // don't follow symlink : stat(rPath.c_str(), &st); if (res != 0) return false; // retrieving permissions failed // file accessible to everyone if (st.st_mode & S_IRWXO) return true; // retrieve user data struct passwd* pwd = getpwnam(m_user.c_str()); // root may always access if (pwd->pw_uid == 0) return true; // file accessible to group if (st.st_mode & S_IRWXG) { // user's primary group if (pwd != NULL && pwd->pw_gid == st.st_gid) return true; // now check group database struct group *gr = getgrgid(st.st_gid); if (gr != NULL) { int pos = 0; const char* un; while ((un = gr->gr_mem[pos]) != NULL) { if (strcmp(un, m_user.c_str()) == 0) return true; pos++; } } } // file accessible to owner if (st.st_mode & S_IRWXU) { if (pwd != NULL && pwd->pw_uid == st.st_uid) return true; } return false; // no access right found } void UserTable::RunAsUser(char* const* argv) const { struct passwd* pwd = getpwnam(m_user.c_str()); if ( pwd == NULL // check query result || setgid(pwd->pw_gid) != 0 // check GID || initgroups(m_user.c_str(),pwd->pw_gid) != 0 // check supplementary groups || setuid(pwd->pw_uid) != 0) // check UID { goto failed; } if (pwd->pw_uid != 0) { if (clearenv() != 0) goto failed; if ( setenv("LOGNAME", pwd->pw_name, 1) != 0 || setenv("USER", pwd->pw_name, 1) != 0 || setenv("USERNAME", pwd->pw_name, 1) != 0 || setenv("HOME", pwd->pw_dir, 1) != 0 || setenv("SHELL", pwd->pw_shell, 1) != 0 || setenv("PATH", DEFAULT_PATH, 1) != 0) { goto failed; } } execvp(argv[0], argv); // this may return only on failure failed: syslog(LOG_ERR, "cannot exec process: %s", strerror(errno)); _exit(1); } incron-0.5.10/strtok.cpp0000644000175000001440000000554011737665757013665 0ustar lukusers /// string tokenizer implementation /** * \file strtok.cpp * * string tokenizer * * Copyright (C) 2006, 2007, 2008 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * */ #include #include "strtok.h" StringTokenizer::StringTokenizer(const std::string& rStr, char cDelim, char cPrefix) { m_str = rStr; m_cDelim = cDelim; m_cPrefix = cPrefix; m_pos = 0; m_len = rStr.length(); } std::string StringTokenizer::GetNextToken(bool fSkipEmpty) { std::string s; do { _GetNextToken(s, true); } while (fSkipEmpty && s.empty() && m_pos < m_len); return s; } std::string StringTokenizer::GetNextTokenRaw(bool fSkipEmpty) { std::string s; do { _GetNextToken(s, false); } while (fSkipEmpty && s.empty() && m_pos < m_len); return s; } std::string StringTokenizer::GetRemainder() { return m_cPrefix == '\0' ? m_str.substr(m_pos) : StripPrefix(m_str.c_str() + m_pos, m_len - m_pos); } std::string StringTokenizer::StripPrefix(const char* s, SIZE cnt) { std::ostringstream stream; SIZE pos = 0; while (pos < cnt) { if (s[pos] == m_cPrefix) { if ((pos < cnt - 1) && s[pos+1] == m_cPrefix) { stream << m_cPrefix; pos++; } } else { stream << s[pos]; } pos++; } return stream.str(); } void StringTokenizer::_GetNextToken(std::string& rToken, bool fStripPrefix) { if (m_cPrefix == '\0') { _GetNextTokenNoPrefix(rToken); } else { _GetNextTokenWithPrefix(rToken); if (fStripPrefix) rToken = StripPrefix(rToken.c_str(), rToken.length()); } } void StringTokenizer::_GetNextTokenNoPrefix(std::string& rToken) { const char* s = m_str.c_str(); for (SIZE i=m_pos; i * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * * Credits: * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include #include "inotify-cxx.h" /// procfs inotify base path #define PROCFS_INOTIFY_BASE "/proc/sys/fs/inotify/" /// dump separator (between particular entries) #define DUMP_SEP \ ({ \ if (!rStr.empty()) { \ rStr.append(","); \ } \ }) int32_t InotifyEvent::GetDescriptor() const { return m_pWatch != NULL // if watch exists ? m_pWatch->GetDescriptor() // return its descriptor : -1; // else return -1 } uint32_t InotifyEvent::GetMaskByName(const std::string& rName) { if (rName == "IN_ACCESS") return IN_ACCESS; else if (rName == "IN_MODIFY") return IN_MODIFY; else if (rName == "IN_ATTRIB") return IN_ATTRIB; else if (rName == "IN_CLOSE_WRITE") return IN_CLOSE_WRITE; else if (rName == "IN_CLOSE_NOWRITE") return IN_CLOSE_NOWRITE; else if (rName == "IN_OPEN") return IN_OPEN; else if (rName == "IN_MOVED_FROM") return IN_MOVED_FROM; else if (rName == "IN_MOVED_TO") return IN_MOVED_TO; else if (rName == "IN_CREATE") return IN_CREATE; else if (rName == "IN_DELETE") return IN_DELETE; else if (rName == "IN_DELETE_SELF") return IN_DELETE_SELF; else if (rName == "IN_UNMOUNT") return IN_UNMOUNT; else if (rName == "IN_Q_OVERFLOW") return IN_Q_OVERFLOW; else if (rName == "IN_IGNORED") return IN_IGNORED; else if (rName == "IN_CLOSE") return IN_CLOSE; else if (rName == "IN_MOVE") return IN_MOVE; else if (rName == "IN_ISDIR") return IN_ISDIR; else if (rName == "IN_ONESHOT") return IN_ONESHOT; else if (rName == "IN_ALL_EVENTS") return IN_ALL_EVENTS; #ifdef IN_DONT_FOLLOW else if (rName == "IN_DONT_FOLLOW") return IN_DONT_FOLLOW; #endif // IN_DONT_FOLLOW #ifdef IN_ONLYDIR else if (rName == "IN_ONLYDIR") return IN_ONLYDIR; #endif // IN_ONLYDIR #ifdef IN_MOVE_SELF else if (rName == "IN_MOVE_SELF") return IN_MOVE_SELF; #endif // IN_MOVE_SELF return (uint32_t) 0; } void InotifyEvent::DumpTypes(uint32_t uValue, std::string& rStr) { rStr = ""; if (IsType(uValue, IN_ALL_EVENTS)) { rStr.append("IN_ALL_EVENTS"); } else { if (IsType(uValue, IN_ACCESS)) { DUMP_SEP; rStr.append("IN_ACCESS"); } if (IsType(uValue, IN_MODIFY)) { DUMP_SEP; rStr.append("IN_MODIFY"); } if (IsType(uValue, IN_ATTRIB)) { DUMP_SEP; rStr.append("IN_ATTRIB"); } if (IsType(uValue, IN_CREATE)) { DUMP_SEP; rStr.append("IN_CREATE"); } if (IsType(uValue, IN_DELETE)) { DUMP_SEP; rStr.append("IN_DELETE"); } if (IsType(uValue, IN_DELETE_SELF)) { DUMP_SEP; rStr.append("IN_DELETE_SELF"); } if (IsType(uValue, IN_OPEN)) { DUMP_SEP; rStr.append("IN_OPEN"); } if (IsType(uValue, IN_CLOSE)) { DUMP_SEP; rStr.append("IN_CLOSE"); } #ifdef IN_MOVE_SELF if (IsType(uValue, IN_MOVE_SELF)) { DUMP_SEP; rStr.append("IN_MOVE_SELF"); } #endif // IN_MOVE_SELF else { if (IsType(uValue, IN_CLOSE_WRITE)) { DUMP_SEP; rStr.append("IN_CLOSE_WRITE"); } if (IsType(uValue, IN_CLOSE_NOWRITE)) { DUMP_SEP; rStr.append("IN_CLOSE_NOWRITE"); } } if (IsType(uValue, IN_MOVE)) { DUMP_SEP; rStr.append("IN_MOVE"); } else { if (IsType(uValue, IN_MOVED_FROM)) { DUMP_SEP; rStr.append("IN_MOVED_FROM"); } if (IsType(uValue, IN_MOVED_TO)) { DUMP_SEP; rStr.append("IN_MOVED_TO"); } } } if (IsType(uValue, IN_UNMOUNT)) { DUMP_SEP; rStr.append("IN_UNMOUNT"); } if (IsType(uValue, IN_Q_OVERFLOW)) { DUMP_SEP; rStr.append("IN_Q_OVERFLOW"); } if (IsType(uValue, IN_IGNORED)) { DUMP_SEP; rStr.append("IN_IGNORED"); } if (IsType(uValue, IN_ISDIR)) { DUMP_SEP; rStr.append("IN_ISDIR"); } if (IsType(uValue, IN_ONESHOT)) { DUMP_SEP; rStr.append("IN_ONESHOT"); } #ifdef IN_DONT_FOLLOW if (IsType(uValue, IN_DONT_FOLLOW)) { DUMP_SEP; rStr.append("IN_DONT_FOLLOW"); } #endif // IN_DONT_FOLLOW #ifdef IN_ONLYDIR if (IsType(uValue, IN_ONLYDIR)) { DUMP_SEP; rStr.append("IN_ONLYDIR"); } #endif // IN_ONLYDIR } void InotifyEvent::DumpTypes(std::string& rStr) const { DumpTypes(m_uMask, rStr); } void InotifyWatch::SetMask(uint32_t uMask) throw (InotifyException) { IN_WRITE_BEGIN if (m_wd != -1) { int wd = inotify_add_watch(m_pInotify->GetDescriptor(), m_path.c_str(), uMask); if (wd != m_wd) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("changing mask failed"), wd == -1 ? errno : EINVAL, this); } } m_uMask = uMask; IN_WRITE_END } void InotifyWatch::SetEnabled(bool fEnabled) throw (InotifyException) { IN_WRITE_BEGIN if (fEnabled == m_fEnabled) { IN_WRITE_END_NOTHROW return; } if (m_pInotify != NULL) { if (fEnabled) { m_wd = inotify_add_watch(m_pInotify->GetDescriptor(), m_path.c_str(), m_uMask); if (m_wd == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("enabling watch failed"), errno, this); } m_pInotify->m_watches.insert(IN_WATCH_MAP::value_type(m_wd, this)); } else { if (inotify_rm_watch(m_pInotify->GetDescriptor(), m_wd) != 0) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("disabling watch failed"), errno, this); } m_pInotify->m_watches.erase(m_wd); m_wd = -1; } } m_fEnabled = fEnabled; IN_WRITE_END } void InotifyWatch::__Disable() { IN_WRITE_BEGIN if (!m_fEnabled) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("event cannot occur on disabled watch"), EINVAL, this); } if (m_pInotify != NULL) { m_pInotify->m_watches.erase(m_wd); m_wd = -1; } m_fEnabled = false; IN_WRITE_END } Inotify::Inotify() throw (InotifyException) { IN_LOCK_INIT m_fd = inotify_init(); if (m_fd == -1) { IN_LOCK_DONE throw InotifyException(IN_EXC_MSG("inotify init failed"), errno, NULL); } } Inotify::~Inotify() { Close(); IN_LOCK_DONE } void Inotify::Close() { IN_WRITE_BEGIN if (m_fd != -1) { RemoveAll(); close(m_fd); m_fd = -1; } IN_WRITE_END } void Inotify::Add(InotifyWatch* pWatch) throw (InotifyException) { IN_WRITE_BEGIN // invalid descriptor - this case shouldn't occur - go away if (m_fd == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("invalid file descriptor"), EBUSY, this); } // this path already watched - go away if (FindWatch(pWatch->GetPath()) != NULL) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("path already watched"), EBUSY, this); } // for enabled watch if (pWatch->IsEnabled()) { // try to add watch to kernel int wd = inotify_add_watch(m_fd, pWatch->GetPath().c_str(), pWatch->GetMask()); // adding failed - go away if (wd == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("adding watch failed"), errno, this); } // this path already watched (but defined another way) InotifyWatch* pW = FindWatch(wd); if (pW != NULL) { // try to recover old watch because it may be modified - then go away if (inotify_add_watch(m_fd, pW->GetPath().c_str(), pW->GetMask()) < 0) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("watch collision detected and recovery failed"), errno, this); } else { // recovery failed - go away IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("path already watched (but defined another way)"), EBUSY, this); } } pWatch->m_wd = wd; m_watches.insert(IN_WATCH_MAP::value_type(pWatch->m_wd, pWatch)); } m_paths.insert(IN_WP_MAP::value_type(pWatch->m_path, pWatch)); pWatch->m_pInotify = this; IN_WRITE_END } void Inotify::Remove(InotifyWatch* pWatch) throw (InotifyException) { IN_WRITE_BEGIN // invalid descriptor - this case shouldn't occur - go away if (m_fd == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("invalid file descriptor"), EBUSY, this); } // for enabled watch if (pWatch->m_wd != -1) { // removing watch failed - go away if (inotify_rm_watch(m_fd, pWatch->m_wd) == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("removing watch failed"), errno, this); } m_watches.erase(pWatch->m_wd); pWatch->m_wd = -1; } m_paths.erase(pWatch->m_path); pWatch->m_pInotify = NULL; IN_WRITE_END } void Inotify::RemoveAll() { IN_WRITE_BEGIN IN_WP_MAP::iterator it = m_paths.begin(); while (it != m_paths.end()) { InotifyWatch* pW = (*it).second; if (pW->m_wd != -1) { inotify_rm_watch(m_fd, pW->m_wd); pW->m_wd = -1; } pW->m_pInotify = NULL; it++; } m_watches.clear(); m_paths.clear(); IN_WRITE_END } void Inotify::WaitForEvents(bool fNoIntr) throw (InotifyException) { ssize_t len = 0; do { len = read(m_fd, m_buf, INOTIFY_BUFLEN); } while (fNoIntr && len == -1 && errno == EINTR); if (len == -1 && !(errno == EWOULDBLOCK || errno == EINTR)) throw InotifyException(IN_EXC_MSG("reading events failed"), errno, this); if (len == -1) return; IN_WRITE_BEGIN ssize_t i = 0; while (i < len) { struct inotify_event* pEvt = (struct inotify_event*) &m_buf[i]; InotifyWatch* pW = FindWatch(pEvt->wd); if (pW != NULL) { InotifyEvent evt(pEvt, pW); if ( InotifyEvent::IsType(pW->GetMask(), IN_ONESHOT) || InotifyEvent::IsType(evt.GetMask(), IN_IGNORED)) pW->__Disable(); m_events.push_back(evt); } i += INOTIFY_EVENT_SIZE + (ssize_t) pEvt->len; } IN_WRITE_END } bool Inotify::GetEvent(InotifyEvent* pEvt) throw (InotifyException) { if (pEvt == NULL) throw InotifyException(IN_EXC_MSG("null pointer to event"), EINVAL, this); IN_WRITE_BEGIN bool b = !m_events.empty(); if (b) { *pEvt = m_events.front(); m_events.pop_front(); } IN_WRITE_END return b; } bool Inotify::PeekEvent(InotifyEvent* pEvt) throw (InotifyException) { if (pEvt == NULL) throw InotifyException(IN_EXC_MSG("null pointer to event"), EINVAL, this); IN_READ_BEGIN bool b = !m_events.empty(); if (b) { *pEvt = m_events.front(); } IN_READ_END return b; } InotifyWatch* Inotify::FindWatch(int iDescriptor) { IN_READ_BEGIN IN_WATCH_MAP::iterator it = m_watches.find(iDescriptor); InotifyWatch* pW = it == m_watches.end() ? NULL : (*it).second; IN_READ_END return pW; } InotifyWatch* Inotify::FindWatch(const std::string& rPath) { IN_READ_BEGIN IN_WP_MAP::iterator it = m_paths.find(rPath); InotifyWatch* pW = it == m_paths.end() ? NULL : (*it).second; IN_READ_END return pW; } void Inotify::SetNonBlock(bool fNonBlock) throw (InotifyException) { IN_WRITE_BEGIN if (m_fd == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("invalid file descriptor"), EBUSY, this); } int res = fcntl(m_fd, F_GETFL); if (res == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("cannot get inotify flags"), errno, this); } if (fNonBlock) { res |= O_NONBLOCK; } else { res &= ~O_NONBLOCK; } if (fcntl(m_fd, F_SETFL, res) == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("cannot set inotify flags"), errno, this); } IN_WRITE_END } void Inotify::SetCloseOnExec(bool fClOnEx) throw (InotifyException) { IN_WRITE_BEGIN if (m_fd == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("invalid file descriptor"), EBUSY, this); } int res = fcntl(m_fd, F_GETFD); if (res == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("cannot get inotify flags"), errno, this); } if (fClOnEx) { res |= FD_CLOEXEC; } else { res &= ~FD_CLOEXEC; } if (fcntl(m_fd, F_SETFD, res) == -1) { IN_WRITE_END_NOTHROW throw InotifyException(IN_EXC_MSG("cannot set inotify flags"), errno, this); } IN_WRITE_END } uint32_t Inotify::GetCapability(InotifyCapability_t cap) throw (InotifyException) { FILE* f = fopen(GetCapabilityPath(cap).c_str(), "r"); if (f == NULL) throw InotifyException(IN_EXC_MSG("cannot get capability"), errno, NULL); unsigned int val = 0; if (fscanf(f, "%u", &val) != 1) { fclose(f); throw InotifyException(IN_EXC_MSG("cannot get capability"), EIO, NULL); } fclose(f); return (uint32_t) val; } void Inotify::SetCapability(InotifyCapability_t cap, uint32_t val) throw (InotifyException) { FILE* f = fopen(GetCapabilityPath(cap).c_str(), "w"); if (f == NULL) throw InotifyException(IN_EXC_MSG("cannot set capability"), errno, NULL); if (fprintf(f, "%u", (unsigned int) val) <= 0) { fclose(f); throw InotifyException(IN_EXC_MSG("cannot set capability"), EIO, NULL); } fclose(f); } std::string Inotify::GetCapabilityPath(InotifyCapability_t cap) throw (InotifyException) { std::string path(PROCFS_INOTIFY_BASE); switch (cap) { case IN_MAX_EVENTS: path.append("max_queued_events"); break; case IN_MAX_INSTANCES: path.append("max_user_instances"); break; case IN_MAX_WATCHES: path.append("max_user_watches"); break; default: throw InotifyException(IN_EXC_MSG("unknown capability type"), EINVAL, NULL); } return path; } incron-0.5.10/incrontab.cpp0000644000175000001440000001164411737665757014320 0ustar lukusers /// inotify cron table manipulator classes implementation /** * \file incrontab.cpp * * inotify cron system * * Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * * Credits: * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include "inotify-cxx.h" #include "incrontab.h" #include "incroncfg.h" /* /// Allowed users #define INCRON_ALLOW_PATH "/etc/incron.allow" /// Denied users #define INCRON_DENY_PATH "/etc/incron.deny" */ /* * ALLOW/DENY SEMANTICS * * If /etc/incron.allow exists ONLY users contained here * are allowed to use incron. * * Otherwise, if /etc/incron.deny exists only user NOT * contained here are allowed to use incron. * * Otherwise all users may use incron. * */ IncronTabEntry::IncronTabEntry() : m_uMask(0), m_fNoLoop(false) { } IncronTabEntry::IncronTabEntry(const std::string& rPath, uint32_t uMask, const std::string& rCmd) : m_path(rPath), m_uMask(uMask), m_cmd(rCmd) { } std::string IncronTabEntry::ToString() const { std::ostringstream ss; std::string m; InotifyEvent::DumpTypes(m_uMask, m); if (m.empty()) { m = m_fNoLoop ? "IN_NO_LOOP" : "0"; } else { if (m_fNoLoop) m.append(",IN_NO_LOOP"); } ss << GetSafePath(m_path) << " " << m << " " << m_cmd; return ss.str(); } bool IncronTabEntry::Parse(const std::string& rStr, IncronTabEntry& rEntry) { unsigned long u; std::string s1, s2, s3; StringTokenizer tok(rStr, ' ', '\\'); if (!tok.HasMoreTokens()) return false; s1 = tok.GetNextToken(true); if (!tok.HasMoreTokens()) return false; s2 = tok.GetNextToken(true); if (!tok.HasMoreTokens()) return false; tok.SetNoPrefix(); s3 = tok.GetRemainder(); SIZE len = s3.length(); if (len > 0 && s3[len-1] == '\n') s3.resize(len-1); rEntry.m_path = s1; rEntry.m_cmd = s3; rEntry.m_uMask = 0; rEntry.m_fNoLoop = false; if (sscanf(s2.c_str(), "%lu", &u) == 1) { rEntry.m_uMask = (uint32_t) u; } else { StringTokenizer tok(s2); while (tok.HasMoreTokens()) { std::string s(tok.GetNextToken()); if (s == "IN_NO_LOOP") rEntry.m_fNoLoop = true; else rEntry.m_uMask |= InotifyEvent::GetMaskByName(s); } } return true; } std::string IncronTabEntry::GetSafePath(const std::string& rPath) { std::ostringstream stream; SIZE len = rPath.length(); for (SIZE i = 0; i < len; i++) { if (rPath[i] == ' ') { stream << "\\ "; } else if (rPath[i] == '\\') { stream << "\\\\"; } else { stream << rPath[i]; } } return stream.str(); } bool IncronTab::Load(const std::string& rPath) { m_tab.clear(); FILE* f = fopen(rPath.c_str(), "r"); if (f == NULL) return false; char s[1000]; IncronTabEntry e; while (fgets(s, 1000, f) != NULL) { if (IncronTabEntry::Parse(s, e)) { m_tab.push_back(e); } } fclose(f); return true; } bool IncronTab::Save(const std::string& rPath) { FILE* f = fopen(rPath.c_str(), "w"); if (f == NULL) return false; std::deque::iterator it = m_tab.begin(); while (it != m_tab.end()) { fputs((*it).ToString().c_str(), f); fputs("\n", f); it++; } fclose(f); return true; } bool IncronTab::CheckUser(const std::string& rUser) { char s[100], u[100]; std::string path; if (!IncronCfg::GetValue("allowed_users", path)) throw InotifyException("configuration is corrupted", EINVAL); FILE* f = fopen(path.c_str(), "r"); if (f == NULL) { if (errno == ENOENT) { if (!IncronCfg::GetValue("denied_users", path)) throw InotifyException("configuration is corrupted", EINVAL); f = fopen(path.c_str(), "r"); if (f == NULL) { return errno == ENOENT; } while (fgets(s, 100, f) != NULL) { if (sscanf(s, "%s", u) == 1) { if (rUser == u) { fclose(f); return false; } } } fclose(f); return true; } return false; } while (fgets(s, 100, f) != NULL) { if (sscanf(s, "%s", u) == 1) { if (rUser == u) { fclose(f); return true; } } } fclose(f); return false; } std::string IncronTab::GetUserTablePath(const std::string& rUser) { std::string s; if (!IncronCfg::GetValue("user_table_dir", s)) throw InotifyException("configuration is corrupted", EINVAL); return IncronCfg::BuildPath(s, rUser); } std::string IncronTab::GetSystemTablePath(const std::string& rName) { std::string s; if (!IncronCfg::GetValue("system_table_dir", s)) throw InotifyException("configuration is corrupted", EINVAL); return IncronCfg::BuildPath(s, rName); } incron-0.5.10/incroncfg.cpp0000644000175000001440000001041411737665757014303 0ustar lukusers /// inotify cron configuration implementation /** * \file incroncfg.cpp * * incron configuration * * Copyright (C) 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * * Credits: * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include "incroncfg.h" #define INCRON_CFG_DEFAULT "/etc/incron.conf" typedef std::map CFG_MAP; typedef CFG_MAP::iterator CFG_ITER; CFG_MAP IncronCfg::m_values; CFG_MAP IncronCfg::m_defaults; void IncronCfg::Init() { m_defaults.insert(CFG_MAP::value_type("system_table_dir", "/etc/incron.d")); m_defaults.insert(CFG_MAP::value_type("user_table_dir", "/var/spool/incron")); m_defaults.insert(CFG_MAP::value_type("allowed_users", "/etc/incron.allow")); m_defaults.insert(CFG_MAP::value_type("denied_users", "/etc/incron.deny")); m_defaults.insert(CFG_MAP::value_type("lockfile_dir", "/var/run")); m_defaults.insert(CFG_MAP::value_type("lockfile_name", "incrond")); m_defaults.insert(CFG_MAP::value_type("editor", "")); } void IncronCfg::Load(const std::string& rPath) { char s[1024]; std::ifstream is(rPath.c_str()); if (is.is_open()) { while (!is.eof() && !is.fail()) { is.getline(s, 1023); std::string key, val; if (ParseLine(s, key, val)) { m_values.insert(CFG_MAP::value_type(key, val)); } } is.close(); return; } if (rPath == INCRON_CFG_DEFAULT) return; is.open(INCRON_CFG_DEFAULT); if (is.is_open()) { while (!is.eof() && !is.fail()) { is.getline(s, 1023); std::string key, val; if (ParseLine(s, key, val)) { m_values.insert(CFG_MAP::value_type(key, val)); } } is.close(); } } bool IncronCfg::GetValue(const std::string& rKey, std::string& rVal) { CFG_ITER it = m_values.find(rKey); if (it != m_values.end()) { rVal = (*it).second; return true; } it = m_defaults.find(rKey); if (it != m_defaults.end()) { rVal = (*it).second; return true; } return false; } bool IncronCfg::GetValue(const std::string& rKey, int& rVal) { std::string s; if (GetValue(rKey, s)) { if (sscanf(s.c_str(), "%i", &rVal) == 1) return true; } return false; } bool IncronCfg::GetValue(const std::string& rKey, unsigned& rVal) { std::string s; if (GetValue(rKey, s)) { if (sscanf(s.c_str(), "%u", &rVal) == 1) return true; } return false; } bool IncronCfg::GetValue(const std::string& rKey, bool& rVal) { std::string s; if (GetValue(rKey, s)) { size_t len = (size_t) s.length(); for (size_t i = 0; i < len; i++) { s[i] = (char) tolower(s[i]); } rVal = (s == "1" || s == "true" || s == "yes" || s == "on" || s == "enable" || s == "enabled"); return true; } return false; } std::string IncronCfg::BuildPath(const std::string& rPath, const std::string& rName) { if (rPath.rfind('/') == rPath.length() - 1) return rPath + rName; return rPath + "/" + rName; } bool IncronCfg::ParseLine(const char* s, std::string& rKey, std::string& rVal) { // CAUTION: This code hasn't been optimized. It may be slow. char key[1024], val[1024]; if (IsComment(s)) return false; std::istringstream ss(s); ss.get(key, 1023, '='); if (ss.fail()) return false; ss.get(val, 1023); if (ss.fail()) return false; rKey = key; rVal = val; std::string::size_type a = rKey.find_first_not_of(" \t"); std::string::size_type b = rKey.find_last_not_of(" \t"); if (a == std::string::npos || b == std::string::npos) return false; rKey = rKey.substr(a, b-a+1); a = rVal.find_first_not_of(" \t="); b = rVal.find_last_not_of(" \t"); if (a == std::string::npos || b == std::string::npos) { rVal = ""; } else { rVal = rVal.substr(a, b-a+1); } return true; } bool IncronCfg::IsComment(const char* s) { const char* sx = strchr(s, '#'); // if (sx == NULL) return false; size_t len = sx - s; for (size_t i = 0; i < len; i++) { if (!(s[i] == ' ' || s[i] == '\t')) return false; } return true; } incron-0.5.10/ict-main.cpp0000644000175000001440000003345411737665757014045 0ustar lukusers /// inotify cron table manipulator main file /** * \file ict-main.cpp * * inotify cron system * * Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * * Credits: * kolter (fix for segfaulting on --user) * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include #include #include #include #include #include #include #include #include #include "inotify-cxx.h" #include "appargs.h" #include "incron.h" #include "incrontab.h" #include "incroncfg.h" /// Alternative editor #define INCRON_ALT_EDITOR "/etc/alternatives/editor" /// Default (hard-wired) editor #define INCRON_DEFAULT_EDITOR "vim" /// incrontab version string #define INCRONTAB_VERSION INCRONTAB_NAME " " INCRON_VERSION /// incrontab description string #define INCRONTAB_DESCRIPTION "incrontab - inotify cron table manipulator\n" \ "(c) Lukas Jelinek, 2006, 2007, 208" /// incrontab help string #define INCRONTAB_HELP INCRONTAB_DESCRIPTION "\n\n" \ "usage: incrontab [] \n" \ " incrontab [] \n\n" \ " may be one of the following:\n" \ " -?, --about gives short information about program\n" \ " -h, --help prints this help text\n" \ " -l, --list lists user table\n" \ " -r, --remove removes user table\n" \ " -e, --edit provides editing user table\n" \ " -t, --types list supported event types\n" \ " -d, --reload request incrond to reload user table\n" \ " -V, --version prints program version\n\n" \ "\n" \ "These options may be used:\n" \ " -u , --user= overrides current user (requires root privileges)\n" \ " -f , --config= overrides default configuration file (requires root privileges)\n\n" \ "For reporting bugs please use http://bts.aiken.cz\n" /// Copies a file to an user table. /** * \param[in] rPath path to file * \param[in] rUser user name * \return true = success, false = failure */ bool copy_from_file(const std::string& rPath, const std::string& rUser) { fprintf(stderr, "copying table from file '%s'\n", rPath.c_str()); IncronTab tab; std::string s(rPath); if (s == "-") s = "/dev/stdin"; if (!tab.Load(s)) { fprintf(stderr, "cannot load table from file '%s'\n", rPath.c_str()); return false; } std::string out(IncronTab::GetUserTablePath(rUser)); if (!tab.Save(out)) { fprintf(stderr, "cannot create table for user '%s'\n", rUser.c_str()); return false; } return true; } /// Removes an user table. /** * \param[in] rUser user name * \return true = success, false = failure */ bool remove_table(const std::string& rUser) { fprintf(stderr, "removing table for user '%s'\n", rUser.c_str()); std::string tp(IncronTab::GetUserTablePath(rUser)); if (unlink(tp.c_str()) != 0) { if (errno == ENOENT) { fprintf(stderr, "table for user '%s' does not exist\n", rUser.c_str()); return true; } else { fprintf(stderr, "cannot remove table for user '%s': %s\n", rUser.c_str(), strerror(errno)); return false; } } fprintf(stderr, "table for user '%s' successfully removed\n", rUser.c_str()); return true; } /// Lists an user table. /** * \param[in] rUser user name * \return true = success, false = failure */ bool list_table(const std::string& rUser) { std::string tp(IncronTab::GetUserTablePath(rUser)); FILE* f = fopen(tp.c_str(), "r"); if (f == NULL) { if (errno == ENOENT) { fprintf(stderr, "no table for %s\n", rUser.c_str()); return true; } else { fprintf(stderr, "cannot read table for '%s': %s\n", rUser.c_str(), strerror(errno)); return false; } } char s[1024]; while (fgets(s, 1024, f) != NULL) { fputs(s, stdout); } fclose(f); return true; } /// Allows to edit an user table. /** * \param[in] rUser user name * \return true = success, false = failure * * \attention This function is very complex and may contain * various bugs including security ones. Please keep * it in mind.. */ bool edit_table(const std::string& rUser) { std::string tp(IncronTab::GetUserTablePath(rUser)); struct passwd* ppwd = getpwnam(rUser.c_str()); if (ppwd == NULL) { fprintf(stderr, "cannot find user '%s': %s\n", rUser.c_str(), strerror(errno)); return false; } uid_t uid = ppwd->pw_uid; uid_t gid = ppwd->pw_gid; char s[NAME_MAX]; strcpy(s, "/tmp/incron.table-XXXXXX"); uid_t iu = geteuid(); uid_t ig = getegid(); if (setegid(gid) != 0 || seteuid(uid) != 0) { fprintf(stderr, "cannot change effective UID/GID for user '%s': %s\n", rUser.c_str(), strerror(errno)); return false; } int fd = mkstemp(s); if (fd == -1) { fprintf(stderr, "cannot create temporary file: %s\n", strerror(errno)); return false; } bool ok = false; FILE* out = NULL; FILE* in = NULL; time_t mt = (time_t) 0; const char* e = NULL; std::string ed; if (setegid(ig) != 0 || seteuid(iu) != 0) { fprintf(stderr, "cannot change effective UID/GID: %s\n", strerror(errno)); close(fd); goto end; } out = fdopen(fd, "w"); if (out == NULL) { fprintf(stderr, "cannot write to temporary file: %s\n", strerror(errno)); close(fd); goto end; } in = fopen(tp.c_str(), "r"); if (in == NULL) { if (errno == ENOENT) { in = fopen("/dev/null", "r"); if (in == NULL) { fprintf(stderr, "cannot get empty table for '%s': %s\n", rUser.c_str(), strerror(errno)); fclose(out); goto end; } } else { fprintf(stderr, "cannot read old table for '%s': %s\n", rUser.c_str(), strerror(errno)); fclose(out); goto end; } } char buf[1024]; while (fgets(buf, 1024, in) != NULL) { fputs(buf, out); } fclose(in); fclose(out); struct stat st; if (stat(s, &st) != 0) { fprintf(stderr, "cannot stat temporary file: %s\n", strerror(errno)); goto end; } mt = st.st_mtime; // save modification time for detecting its change // Editor selecting algorithm: // 1. Check EDITOR environment variable // 2. Check VISUAL environment variable // 3. Try to get from configuration // 4. Check presence of /etc/alternatives/editor // 5. Use hard-wired editor e = getenv("EDITOR"); if (e == NULL) { e = getenv("VISUAL"); if (e == NULL) { if (!IncronCfg::GetValue("editor", ed)) throw InotifyException("configuration is corrupted", EINVAL); if (!ed.empty()) { e = ed.c_str(); } else { if (access(INCRON_ALT_EDITOR, X_OK) == 0) e = INCRON_ALT_EDITOR; else e = INCRON_DEFAULT_EDITOR; } } } // this block is explicite due to gotos' usage simplification { pid_t pid = fork(); if (pid == 0) { if (setgid(gid) != 0 || setuid(uid) != 0) { fprintf(stderr, "cannot set user '%s': %s\n", rUser.c_str(), strerror(errno)); goto end; } execlp(e, e, s, (const char*) NULL); _exit(1); } else if (pid > 0) { int status; if (wait(&status) != pid) { perror("error while waiting for editor"); goto end; } if (!(WIFEXITED(status)) || WEXITSTATUS(status) != 0) { perror("editor finished with error"); goto end; } } else { perror("cannot start editor"); goto end; } } if (stat(s, &st) != 0) { fprintf(stderr, "cannot stat temporary file: %s\n", strerror(errno)); goto end; } if (st.st_mtime == mt) { fprintf(stderr, "table unchanged\n"); ok = true; goto end; } { IncronTab ict; if (ict.Load(s) && ict.Save(tp)) { if (chmod(tp.c_str(), S_IRUSR | S_IWUSR) != 0) { fprintf(stderr, "cannot change mode of temporary file: %s\n", strerror(errno)); } } else { fprintf(stderr, "cannot move temporary table: %s\n", strerror(errno)); goto end; } } ok = true; fprintf(stderr, "table updated\n"); end: unlink(s); return ok; } /// Prints the list of all available inotify event types. void list_types() { printf( "IN_ACCESS,IN_MODIFY,IN_ATTRIB,IN_CLOSE_WRITE,"\ "IN_CLOSE_NOWRITE,IN_OPEN,IN_MOVED_FROM,IN_MOVED_TO,"\ "IN_CREATE,IN_DELETE,IN_DELETE_SELF,IN_CLOSE,IN_MOVE,"\ "IN_ONESHOT,IN_ALL_EVENTS"); #ifdef IN_DONT_FOLLOW printf(",IN_DONT_FOLLOW"); #endif // IN_DONT_FOLLOW #ifdef IN_ONLYDIR printf(",IN_ONLYDIR"); #endif // IN_ONLYDIR #ifdef IN_MOVE_SELF printf(",IN_MOVE_SELF"); #endif // IN_MOVE_SELF printf("\n"); } /// Reloads an user table. /** * \param[in] rUser user name * \return true = success, false = otherwise */ bool reload_table(const std::string& rUser) { fprintf(stderr, "requesting table reload for user '%s'...\n", rUser.c_str()); std::string tp(IncronTab::GetUserTablePath(rUser)); int fd = open(tp.c_str(), O_WRONLY | O_APPEND); if (fd == -1) { if (errno == ENOENT) { fprintf(stderr, "no table for '%s'\n", rUser.c_str()); return true; } else { fprintf(stderr, "cannot access table for '%s': %s\n", rUser.c_str(), strerror(errno)); return false; } } close(fd); fprintf(stderr, "request done\n"); return true; } int main(int argc, char** argv) { AppArgs::Init(); if (!( AppArgs::AddOption("about", '?', AAT_NO_VALUE, false) && AppArgs::AddOption("help", 'h', AAT_NO_VALUE, false) && AppArgs::AddOption("list", 'l', AAT_NO_VALUE, false) && AppArgs::AddOption("remove", 'r', AAT_NO_VALUE, false) && AppArgs::AddOption("edit", 'e', AAT_NO_VALUE, false) && AppArgs::AddOption("types", 't', AAT_NO_VALUE, false) && AppArgs::AddOption("reload", 'd', AAT_NO_VALUE, false) && AppArgs::AddOption("user", 'u', AAT_MANDATORY_VALUE, false) && AppArgs::AddOption("config", 'f', AAT_MANDATORY_VALUE, false) && AppArgs::AddOption("version", 'V', AAT_NO_VALUE, false))) { fprintf(stderr, "error while initializing application"); return 1; } AppArgs::Parse(argc, argv); if (AppArgs::ExistsOption("help")) { fprintf(stderr, "%s\n", INCRONTAB_HELP); return 0; } if (AppArgs::ExistsOption("about")) { fprintf(stderr, "%s\n", INCRONTAB_DESCRIPTION); return 0; } if (AppArgs::ExistsOption("version")) { fprintf(stderr, "%s\n", INCRONTAB_VERSION); return 0; } bool oper = AppArgs::ExistsOption("list") || AppArgs::ExistsOption("remove") || AppArgs::ExistsOption("edit") || AppArgs::ExistsOption("types") || AppArgs::ExistsOption("reload"); size_t vals = AppArgs::GetValueCount(); if (!oper && vals == 0) { fprintf(stderr, "invalid arguments - specify operation or source file\n"); return 1; } if (oper && vals > 0) { fprintf(stderr, "invalid arguments - operation and source file cannot be combined\n"); return 1; } uid_t uid = getuid(); std::string user; bool chuser = AppArgs::GetOption("user", user); if (uid != 0 && chuser) { fprintf(stderr, "cannot override user to '%s': insufficient privileges\n", user.c_str()); return 1; } struct passwd* ppwd = NULL; if (chuser) { if ((ppwd = getpwnam(user.c_str())) != NULL) { if ( setenv("LOGNAME", ppwd->pw_name, 1) != 0 || setenv("USER", ppwd->pw_name, 1) != 0 || setenv("USERNAME", ppwd->pw_name, 1) != 0 || setenv("HOME", ppwd->pw_dir, 1) != 0 || setenv("SHELL", ppwd->pw_shell, 1) != 0) { perror("cannot set environment variables"); return 1; } } else { fprintf(stderr, "user '%s' not found\n", user.c_str()); return 1; } } else { ppwd = getpwuid(uid); if (ppwd == NULL) { fprintf(stderr, "cannot determine current user\n"); return 1; } user = ppwd->pw_name; } try { IncronCfg::Init(); std::string cfg(INCRON_CONFIG); if (AppArgs::GetOption("config", cfg)) { if (uid != 0) { fprintf(stderr, "insufficient privileges to use custom configuration (will use default)\n"); } else if (euidaccess(cfg.c_str(), R_OK) != 0) { perror("cannot read configuration file (will use default)"); } } IncronCfg::Load(cfg); if (!IncronTab::CheckUser(user)) { fprintf(stderr, "user '%s' is not allowed to use incron\n", user.c_str()); return 1; } if (!oper) { std::string file; if (!AppArgs::GetValue(0, file) || !copy_from_file(file, user)) { return 1; } } else { if (AppArgs::ExistsOption("list")) { if (!list_table(user)) return 1; } else if (AppArgs::ExistsOption("remove")) { if (!remove_table(user)) return 1; } else if (AppArgs::ExistsOption("edit")) { if (!edit_table(user)) return 1; } else if (AppArgs::ExistsOption("types")) { list_types(); } else if (AppArgs::ExistsOption("reload")) { if (!reload_table(user)) return 1; } else { fprintf(stderr, "invalid usage\n"); return 1; } } return 0; } catch (InotifyException e) { fprintf(stderr, "*** unhandled exception occurred ***\n"); fprintf(stderr, "%s\n", e.GetMessage().c_str()); fprintf(stderr, "error: (%i) %s\n", e.GetErrorNumber(), strerror(e.GetErrorNumber())); return 1; } } incron-0.5.10/icd-main.cpp0000644000175000001440000003246211737665757014023 0ustar lukusers /// inotify cron daemon main file /** * \file icd-main.cpp * * inotify cron system * * Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * * Credits: * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include #include #include #include #include #include #include #include #include #include "inotify-cxx.h" #include "appinst.h" #include "appargs.h" #include "incron.h" #include "incrontab.h" #include "usertable.h" #include "incroncfg.h" /// Logging options (console as fallback, log PID) #define INCRON_LOG_OPTS (LOG_CONS | LOG_PID) /// Logging facility (use CRON) #define INCRON_LOG_FACIL LOG_CRON /// incrond version string #define INCROND_VERSION INCROND_NAME " " INCRON_VERSION /// incrontab description string #define INCROND_DESCRIPTION "incrond - inotify cron daemon\n" \ "(c) Lukas Jelinek, 2006, 2007, 2008" /// incrontab help string #define INCROND_HELP INCROND_DESCRIPTION "\n\n" \ "usage: incrond []\n\n" \ " may be one of the following:\n" \ "These options may be used:\n" \ " -?, --about gives short information about program\n" \ " -h, --help prints this help text\n" \ " -n, --foreground runs on foreground (no daemonizing)\n" \ " -k, --kill terminates running instance of incrond\n" \ " -f , --config= overrides default configuration file (requires root privileges)\n" \ " -V, --version prints program version\n\n" \ "For reporting bugs please use http://bts.aiken.cz\n" /// User name to user table mapping table SUT_MAP g_ut; /// Finish program yes/no volatile bool g_fFinish = false; /// Pipe for notifying about dead children int g_cldPipe[2]; // Buffer for emptying child pipe #define CHILD_PIPE_BUF_LEN 32 char g_cldPipeBuf[CHILD_PIPE_BUF_LEN]; /// Daemonize true/false bool g_daemon = true; /// Second to wait on EAGAIN #define POLL_EAGAIN_WAIT 3 /// Handles a signal. /** * For SIGTERM and SIGINT it sets the program finish variable. * For SIGCHLD it writes a character into the notification pipe * (this is a workaround made due to disability to reliably * wait for dead children). * * \param[in] signo signal number */ void on_signal(int signo) { switch (signo) { case SIGTERM: case SIGINT: g_fFinish = true; break; case SIGCHLD: // first empty pipe (to prevent internal buffer overflow) do {} while (read(g_cldPipe[0], g_cldPipeBuf, CHILD_PIPE_BUF_LEN) > 0); // now write one character if (write(g_cldPipe[1], "X", 1) <= 0) { syslog(LOG_WARNING, "cannot send SIGCHLD token to notification pipe"); } break; default:; } } /// Attempts to load all (user and system) incron tables. /** * Loaded tables are registered for processing events. * * \param[in] pEd inotify event dispatcher * * \throw InotifyException thrown if base table directory cannot be read */ void load_tables(EventDispatcher* pEd) throw (InotifyException) { // WARNING - this function has not been optimized!!! std::string s; if (!IncronCfg::GetValue("system_table_dir", s)) throw InotifyException("configuration system is corrupted", EINVAL); DIR* d = opendir(s.c_str()); if (d != NULL) { syslog(LOG_NOTICE, "loading system tables"); struct dirent* pDe = NULL; while ((pDe = readdir(d)) != NULL) { std::string un(pDe->d_name); std::string path(IncronCfg::BuildPath(s, pDe->d_name)); bool ok = pDe->d_type == DT_REG; if (pDe->d_type == DT_UNKNOWN) { struct stat st; if (stat(path.c_str(), &st) == 0) ok = S_ISREG(st.st_mode); } if (ok) { syslog(LOG_INFO, "loading table %s", pDe->d_name); UserTable* pUt = new UserTable(pEd, un, true); g_ut.insert(SUT_MAP::value_type(path, pUt)); pUt->Load(); } } closedir(d); } else { syslog(LOG_WARNING, "cannot open system table directory (ignoring)"); } if (!IncronCfg::GetValue("user_table_dir", s)) throw InotifyException("configuration system is corrupted", EINVAL); d = opendir(s.c_str()); if (d == NULL) throw InotifyException("cannot open user table directory", errno); syslog(LOG_NOTICE, "loading user tables"); struct dirent* pDe = NULL; while ((pDe = readdir(d)) != NULL) { std::string un(pDe->d_name); std::string path(IncronCfg::BuildPath(s, pDe->d_name)); bool ok = pDe->d_type == DT_REG; if (pDe->d_type == DT_UNKNOWN) { struct stat st; if (stat(path.c_str(), &st) == 0) ok = S_ISREG(st.st_mode); } if (ok) { if (UserTable::CheckUser(pDe->d_name)) { syslog(LOG_INFO, "loading table for user %s", pDe->d_name); UserTable* pUt = new UserTable(pEd, un, false); g_ut.insert(SUT_MAP::value_type(path, pUt)); pUt->Load(); } else { syslog(LOG_WARNING, "table for invalid user %s found (ignored)", pDe->d_name); } } } closedir(d); } /// Deallocates all memory used by incron tables and unregisters them from the dispatcher. /** * \param[in] pEd event dispatcher */ void free_tables(EventDispatcher* pEd) { pEd->Clear(); SUT_MAP::iterator it = g_ut.begin(); while (it != g_ut.end()) { UserTable* pUt = (*it).second; delete pUt; it++; } g_ut.clear(); } /// Prepares a 'dead/done child' notification pipe. /** * This function returns no value at all and on error it * throws an exception. */ void prepare_pipe() { g_cldPipe[0] = -1; g_cldPipe[1] = -1; if (pipe(g_cldPipe) != 0) throw InotifyException("cannot create notification pipe", errno, NULL); for (int i=0; i<2; i++) { int res = fcntl(g_cldPipe[i], F_GETFL); if (res == -1) throw InotifyException("cannot get pipe flags", errno, NULL); res |= O_NONBLOCK; if (fcntl(g_cldPipe[i], F_SETFL, res) == -1) throw InotifyException("cannot set pipe flags", errno, NULL); res = fcntl(g_cldPipe[i], F_GETFD); if (res == -1) throw InotifyException("cannot get pipe flags", errno, NULL); res |= FD_CLOEXEC; if (fcntl(g_cldPipe[i], F_SETFD, res) == -1) throw InotifyException("cannot set pipe flags", errno, NULL); } } /// Checks whether a parameter string is a specific command. /** * The string is accepted if it equals either the short or long * form of the command. * * \param[in] s checked string * \param[in] shortCmd short form of command * \param[in] longCmd long form of command * \return true = string accepted, false = otherwise */ /* bool check_parameter(const char* s, const char* shortCmd, const char* longCmd) { return strcmp(s, shortCmd) == 0 || strcmp(s, longCmd) == 0; } */ /// Initializes a poll array. /** * \param[out] pfd poll structure array * \param[in] pipefd pipe file descriptor * \param[in] infd inotify infrastructure file descriptor */ void init_poll_array(struct pollfd pfd[], int pipefd, int infd) { pfd[0].fd = pipefd; pfd[0].events = (short) POLLIN; pfd[0].revents = (short) 0; pfd[1].fd = infd; pfd[1].events = (short) POLLIN; pfd[1].revents = (short) 0; } /// Main application function. /** * \param[in] argc argument count * \param[in] argv argument array * \return 0 on success, 1 on error * * \attention In daemon mode, it finishes immediately. */ int main(int argc, char** argv) { AppArgs::Init(); if (!( AppArgs::AddOption("about", '?', AAT_NO_VALUE, false) && AppArgs::AddOption("help", 'h', AAT_NO_VALUE, false) && AppArgs::AddOption("foreground", 'n', AAT_NO_VALUE, false) && AppArgs::AddOption("kill", 'k', AAT_NO_VALUE, false) && AppArgs::AddOption("config", 'f', AAT_MANDATORY_VALUE, false) && AppArgs::AddOption("version", 'V', AAT_NO_VALUE, false))) { fprintf(stderr, "error while initializing application"); return 1; } AppArgs::Parse(argc, argv); if (AppArgs::ExistsOption("help")) { fprintf(stderr, "%s\n", INCROND_HELP); return 0; } if (AppArgs::ExistsOption("about")) { fprintf(stderr, "%s\n", INCROND_DESCRIPTION); return 0; } if (AppArgs::ExistsOption("version")) { fprintf(stderr, "%s\n", INCROND_VERSION); return 0; } IncronCfg::Init(); std::string cfg; if (!AppArgs::GetOption("config", cfg)) cfg = INCRON_CONFIG; IncronCfg::Load(cfg); std::string lckdir; IncronCfg::GetValue("lockfile_dir", lckdir); std::string lckfile; IncronCfg::GetValue("lockfile_name", lckfile); AppInstance app(lckfile, lckdir); if (AppArgs::ExistsOption("kill")) { fprintf(stderr, "attempting to terminate a running instance of incrond...\n"); if (app.Terminate()) { fprintf(stderr, "the instance notified, going down\n"); return 0; } else { fprintf(stderr, "error - incrond probably not running\n"); return 1; } } if (AppArgs::ExistsOption("foreground")) g_daemon = false; openlog(INCROND_NAME, INCRON_LOG_OPTS, INCRON_LOG_FACIL); syslog(LOG_NOTICE, "starting service (version %s, built on %s %s)", INCRON_VERSION, __DATE__, __TIME__); AppArgs::Destroy(); int ret = 0; std::string sysBase; std::string userBase; if (!IncronCfg::GetValue("system_table_dir", sysBase)) throw InotifyException("configuration is corrupted", EINVAL); if (access(sysBase.c_str(), R_OK) != 0) { syslog(LOG_CRIT, "cannot read directory for system tables (%s): (%i) %s", sysBase.c_str(), errno, strerror(errno)); if (!g_daemon) fprintf(stderr, "cannot read directory for system tables (%s): (%i) %s", sysBase.c_str(), errno, strerror(errno)); ret = 1; goto error; } if (!IncronCfg::GetValue("user_table_dir", userBase)) throw InotifyException("configuration is corrupted", EINVAL); if (access(userBase.c_str(), R_OK) != 0) { syslog(LOG_CRIT, "cannot read directory for user tables (%s): (%i) %s", userBase.c_str(), errno, strerror(errno)); if (!g_daemon) fprintf(stderr, "cannot read directory for user tables (%s): (%i) %s", userBase.c_str(), errno, strerror(errno)); ret = 1; goto error; } try { if (g_daemon) if (daemon(0, 0) == -1) { syslog(LOG_CRIT, "daemonizing failed: (%i) %s", errno, strerror(errno)); fprintf(stderr, "daemonizing failed: (%i) %s\n", errno, strerror(errno)); ret = 1; goto error; } try { if (!app.Lock()) { syslog(LOG_CRIT, "another instance of incrond already running"); if (!g_daemon) fprintf(stderr, "another instance of incrond already running\n"); ret = 1; goto error; } } catch (AppInstException e) { syslog(LOG_CRIT, "instance lookup failed: (%i) %s", e.GetErrorNumber(), strerror(e.GetErrorNumber())); if (!g_daemon) fprintf(stderr, "instance lookup failed: (%i) %s\n", e.GetErrorNumber(), strerror(e.GetErrorNumber())); ret = 1; goto error; } prepare_pipe(); Inotify in; in.SetNonBlock(true); in.SetCloseOnExec(true); uint32_t wm = IN_CREATE | IN_CLOSE_WRITE | IN_DELETE | IN_MOVE | IN_DELETE_SELF | IN_UNMOUNT; InotifyWatch stw(sysBase, wm); in.Add(stw); InotifyWatch utw(userBase, wm); in.Add(utw); EventDispatcher ed(g_cldPipe[0], &in, &stw, &utw); try { load_tables(&ed); } catch (InotifyException e) { int err = e.GetErrorNumber(); syslog(LOG_CRIT, "%s: (%i) %s", e.GetMessage().c_str(), err, strerror(err)); ret = 1; goto error; } ed.Rebuild(); // not too efficient, but simple signal(SIGTERM, on_signal); signal(SIGINT, on_signal); signal(SIGCHLD, on_signal); syslog(LOG_NOTICE, "ready to process filesystem events"); while (!g_fFinish) { int res = poll(ed.GetPollData(), ed.GetSize(), -1); if (res > 0) { if (ed.ProcessEvents()) UserTable::FinishDone(); } else if (res < 0) { switch (errno) { case EINTR: // syscall interrupted - continue polling break; case EAGAIN: // not enough resources - wait a moment and try again syslog(LOG_WARNING, "polling failed due to resource shortage, retrying later..."); sleep(POLL_EAGAIN_WAIT); break; default: throw InotifyException("polling failed", errno, NULL); } } } free_tables(&ed); if (g_cldPipe[0] != -1) close(g_cldPipe[0]); if (g_cldPipe[1] != -1) close(g_cldPipe[1]); } catch (InotifyException e) { int err = e.GetErrorNumber(); syslog(LOG_CRIT, "*** unhandled exception occurred ***"); syslog(LOG_CRIT, " %s", e.GetMessage().c_str()); syslog(LOG_CRIT, " error: (%i) %s", err, strerror(err)); ret = 1; } error: syslog(LOG_NOTICE, "stopping service"); closelog(); return ret; } incron-0.5.10/appinst.cpp0000644000175000001440000000756611737665757014027 0ustar lukusers /// Application instance class implementation /** * \file appinst.cpp * * Copyright (C) 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * * Credits: * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include #include #include #include "appinst.h" /// Lockfile permissions (currently 0644) #define APPLOCK_PERM (S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH) AppInstance::AppInstance(const std::string& rName, const std::string& rBase) : m_fLocked(false) { std::string base(rBase); if (base.empty()) base = APPLOCK_BASEDIR; if (base[base.length()-1] == '/') m_path = base + rName + ".pid"; else m_path = base + "/" + rName + ".pid"; } AppInstance::~AppInstance() { try { Unlock(); } catch (AppInstException e) {} } bool AppInstance::DoLock() { int fd = open(m_path.c_str(), O_WRONLY | O_CREAT | O_EXCL, APPLOCK_PERM); if (fd != -1) { FILE* f = fdopen(fd, "w"); if (f == NULL) { AppInstException e(errno); close(fd); throw e; } if (fprintf(f, "%u", (unsigned) getpid()) <= 0) { AppInstException e(errno); fclose(f); throw e; } if (fclose(f) != 0) throw AppInstException(errno); m_fLocked = true; return true; } if (errno != EEXIST) throw AppInstException(errno); return false; } bool AppInstance::Lock() { for (int i=0; i<100; i++) { if (DoLock()) return true; FILE* f = fopen(m_path.c_str(), "r"); if (f == NULL) { if (errno != ENOENT) throw AppInstException(errno); } else { unsigned pid; ssize_t len = fscanf(f, "%u", &pid); if (len == -1) { AppInstException e(errno); fclose(f); throw e; } else if (len == 0) { AppInstException e(EIO); fclose(f); throw e; } fclose(f); int res = kill((pid_t) pid, 0); if (res == 0) return false; if (errno != ESRCH) throw AppInstException(errno); res = unlink(m_path.c_str()); if (res != 0 && errno != ENOENT) throw AppInstException(errno); } } return false; } void AppInstance::Unlock() { if (!m_fLocked) return; if (unlink(m_path.c_str()) != 0 && errno != ENOENT) throw AppInstException(errno); m_fLocked = false; } bool AppInstance::Exists() const { if (m_fLocked) return true; FILE* f = fopen(m_path.c_str(), "r"); if (f == NULL) { if (errno == ENOENT) return false; else throw AppInstException(errno); } bool ok = false; unsigned pid; if (fscanf(f, "%u", &pid) == 1) { if (kill((pid_t) pid, 0) == 0) ok = true; else if (errno != ESRCH) { AppInstException e(errno); fclose(f); throw e; } } fclose(f); return ok; } bool AppInstance::SendSignal(int iSigNo) const { FILE* f = fopen(m_path.c_str(), "r"); if (f == NULL) { if (errno == ENOENT) return false; else throw AppInstException(errno); } bool ok = false; unsigned pid; if (fscanf(f, "%u", &pid) == 1) { if (pid != (unsigned) getpid()) { if (kill((pid_t) pid, iSigNo) == 0) { ok = true; } else if (errno != ESRCH) { AppInstException e(errno); fclose(f); throw e; } } } fclose(f); return ok; } incron-0.5.10/appargs.cpp0000644000175000001440000001422211737665757013771 0ustar lukusers /// application arguments processor implementation /** * \file appargs.cpp * * application arguments processor * * Copyright (C) 2007, 2008, 2012 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * * Credits: * Christian Ruppert (new include to build with GCC 4.4+) * */ #include #include #include "strtok.h" #include "appargs.h" size_t AppArgs::s_minCnt = 0; size_t AppArgs::s_maxCnt = APPARGS_NOLIMIT; AA_LONG_MAP AppArgs::s_longMap; AA_SHORT_MAP AppArgs::s_shortMap; AA_VAL_LIST AppArgs::s_valList; void AppArgs::Init(size_t valMinCnt, size_t valMaxCnt) { s_minCnt = valMinCnt; s_maxCnt = valMaxCnt; } void AppArgs::Destroy() { AA_LONG_MAP::iterator it = s_longMap.begin(); while (it != s_longMap.end()) { delete (*it).second; it++; } s_longMap.clear(); s_shortMap.clear(); s_valList.clear(); } void AppArgs::Parse(int argc, const char* const* argv) { for (int i=1; ifound = true; pOpt->hasVal = hasVal; pOpt->val = val; } } } else { char name; std::string val; bool hasVal; ParseShort(argv[i], name, val, hasVal); AA_SHORT_MAP::iterator it = s_shortMap.find(name); if (it != s_shortMap.end()) { AppArgOption_t* pOpt = (*it).second; pOpt->found = true; if (hasVal) { pOpt->hasVal = true; pOpt->val = val; } else { if (i+1 < argc && !IsOption(argv[i+1])) { pOpt->hasVal = true; pOpt->val = argv[i+1]; i++; } else { pOpt->hasVal = false; } } } } } else { s_valList.push_back(argv[i]); } } } bool AppArgs::IsValid() { size_t size = s_valList.size(); if (size < s_minCnt || size > s_maxCnt) return false; AA_LONG_MAP::iterator it = s_longMap.begin(); while (it != s_longMap.end()) { AppArgOption_t* pOpt = (*it).second; if (pOpt->mand && !(pOpt->found)) return false; if (pOpt->type == AAT_MANDATORY_VALUE && pOpt->found && !(pOpt->hasVal)) return false; it++; } return true; } bool AppArgs::ExistsOption(const std::string& rArg) { AA_LONG_MAP::iterator it = s_longMap.find(rArg); return it != s_longMap.end() && (*it).second->found; } bool AppArgs::GetOption(const std::string& rArg, std::string& rVal) { AA_LONG_MAP::iterator it = s_longMap.find(rArg); if (it == s_longMap.end()) return false; AppArgOption_t* pOpt = (*it).second; if (!(pOpt->found) || !(pOpt->hasVal)) return false; rVal = pOpt->val; return true; } bool AppArgs::AddOption(const std::string& rName, char cShort, AppArgType_t type, bool fMandatory) { if (s_longMap.find(rName) != s_longMap.end() || s_shortMap.find(cShort) != s_shortMap.end()) return false; AppArgOption_t* pOpt = new AppArgOption_t(); pOpt->found = false; pOpt->hasVal = false; pOpt->mand = fMandatory; pOpt->type = type; s_longMap.insert(AA_LONG_MAP::value_type(rName, pOpt)); s_shortMap.insert(AA_SHORT_MAP::value_type(cShort, pOpt)); return true; } size_t AppArgs::GetValueCount() { return s_valList.size(); } bool AppArgs::GetValue(size_t index, std::string& rVal) { if (index > s_valList.size()) return false; rVal = s_valList[index]; return true; } void AppArgs::Dump() { fprintf(stderr, "Options:\n"); AA_LONG_MAP::iterator it = s_longMap.begin(); while (it != s_longMap.end()) { AppArgOption_t* pOpt = (*it).second; AA_SHORT_MAP::iterator it2 = s_shortMap.begin(); while (it2 != s_shortMap.end()) { if ((*it2).second == pOpt) { DumpOption((*it).first, (*it2).first, pOpt); } it2++; } it++; } fprintf(stderr, "Values:\n"); AA_VAL_LIST::iterator it3 = s_valList.begin(); while (it3 != s_valList.end()) { fprintf(stderr, "%s\n", (*it3).c_str()); it3++; } } bool AppArgs::IsOption(const char* pchStr) { if (strlen(pchStr) < 2) return false; return pchStr[0] == '-'; } bool AppArgs::IsLongOption(const char* pchStr) { return pchStr[1] == '-'; } bool AppArgs::ParseLong(const char* pchStr, std::string& rName, std::string& rVal, bool& rfHasVal) { StringTokenizer tok(pchStr+2, '='); if (!tok.HasMoreTokens()) return false; rName = tok.GetNextToken(); if (!tok.HasMoreTokens()) { rfHasVal = false; return true; } rVal = tok.GetRemainder(); rfHasVal = true; return true; } void AppArgs::ParseShort(const char* pchStr, char& rcName, std::string& rVal, bool& rfHasVal) { rcName = pchStr[1]; size_t len = strlen(pchStr); if (len == 2) { rfHasVal = false; return; } rVal = pchStr + 2; rfHasVal = true; } void AppArgs::DumpOption(const std::string& rName, char cShort, AppArgOption_t* pOpt) { const char* s; switch (pOpt->type) { case AAT_NO_VALUE: s = "no value"; break; case AAT_OPTIONAL_VALUE: s = "optional value"; break; case AAT_MANDATORY_VALUE: s = "mandatory value"; break; default:; s = "unknown"; } fprintf(stderr, "long='%s', short='%c', type='%s', found=%s, has_value=%s, value='%s'\n", rName.c_str(), cShort, s, pOpt->found ? "YES" : "NO", pOpt->hasVal ? "YES" : "NO", pOpt->val.c_str() ); } incron-0.5.10/usertable.h0000644000175000001440000001465111737665757013775 0ustar lukusers /// inotify cron daemon user tables header /** * \file usertable.h * * inotify cron system * * Copyright (C) 2006, 2007, 2008 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * */ #ifndef _USERTABLE_H_ #define _USERTABLE_H_ #include #include #include #include "inotify-cxx.h" #include "incrontab.h" class UserTable; /// User name to user table mapping definition typedef std::map SUT_MAP; /// Callback for calling after a process finishes. typedef void (*proc_done_cb)(InotifyWatch*); /// Child process data typedef struct { proc_done_cb onDone; ///< function called after process finishes InotifyWatch* pWatch; ///< related watch } ProcData_t; /// fd-to-usertable mapping typedef std::map FDUT_MAP; /// Watch-to-tableentry mapping typedef std::map IWCE_MAP; /// Child process list typedef std::map PROC_MAP; /// Event dispatcher class. /** * This class processes events and distributes them as needed. */ class EventDispatcher { public: /// Constructor. /** * \param[in] iPipeFd pipe descriptor * \param[in] pIn inotify object for table management * \param[in] pSys watch for system tables * \param[in] pUser watch for user tables */ EventDispatcher(int iPipeFd, Inotify* pIn, InotifyWatch* pSys, InotifyWatch* pUser); /// Destructor. ~EventDispatcher(); /// Processes events. /** * \return pipe event occurred yes/no */ bool ProcessEvents(); /// Registers an user table. /** * \param[in] pTab user table */ void Register(UserTable* pTab); /// Unregisters an user table. /** * \param[in] pTab user table */ void Unregister(UserTable* pTab); /// Returns the poll data size. /** * \return poll data size */ inline size_t GetSize() const { return m_size; } /// Returns the poll data. /** * \return poll data */ inline struct pollfd* GetPollData() { return m_pPoll; } /// Rebuilds the poll array data. void Rebuild(); /// Removes all registered user tables. /** * It doesn't cause poll data rebuilding. */ inline void Clear() { m_maps.clear(); } private: int m_iPipeFd; ///< pipe file descriptor int m_iMgmtFd; ///< table management file descriptor Inotify* m_pIn; ///< table management inotify object InotifyWatch* m_pSys; ///< watch for system tables InotifyWatch* m_pUser; ///< watch for user tables FDUT_MAP m_maps; ///< watch-to-usertable mapping size_t m_size; ///< poll data size struct pollfd* m_pPoll; ///< poll data array /// Processes events on the table management inotify object. void ProcessMgmtEvents(); }; /// User table class. /** * This class processes inotify events for an user. It creates * child processes which do appropriate actions as defined * in the user table file. */ class UserTable { public: /// Constructor. /** * \param[in] pEd event dispatcher * \param[in] rUser user name * \param[in] fSysTable system table yes/no */ UserTable(EventDispatcher* pEd, const std::string& rUser, bool fSysTable); /// Destructor. virtual ~UserTable(); /// Loads the table. /** * All loaded entries have their inotify watches and are * registered for event dispatching. * If loading fails the table remains empty. */ void Load(); /// Removes all entries from the table. /** * All entries are unregistered from the event dispatcher and * their watches are destroyed. */ void Dispose(); /// Processes an inotify event. /** * \param[in] rEvt inotify event */ void OnEvent(InotifyEvent& rEvt); /// Cleans-up all zombie child processes and enables disabled watches. /** * \attention This method must be called AFTER processing all events * which has been caused by the processes. */ static void FinishDone(); /// Checks whether the user may access a file. /** * Any access right (RWX) is sufficient. * * \param[in] rPath absolute file path * \param[in] fNoFollow don't follow a symbolic link * \return true = access granted, false = otherwise */ bool MayAccess(const std::string& rPath, bool fNoFollow) const; /// Checks whether it is a system table. /** * \return true = system table, false = user table */ bool IsSystem() const; /// Returns the related inotify object. /** * \return related inotify object */ Inotify* GetInotify() { return &m_in; } /// Checks whether an user exists and has permission to use incron. /** * It searches for the given user name in the user database. * If it failes it returns 'false'. Otherwise it checks * permission files for this user (see InCronTab::CheckUser()). * * \param[in] user user name * \return true = user has permission to use incron, false = otherwise * * \sa InCronTab::CheckUser() */ inline static bool CheckUser(const char* user) { struct passwd* pw = getpwnam(user); if (pw == NULL) return false; return IncronTab::CheckUser(user); } /// Runs a program as the table's user. /** * \attention Don't call from the main process (before forking)! */ void RunAsUser(char* const* argv) const; private: Inotify m_in; ///< inotify object EventDispatcher* m_pEd; ///< event dispatcher std::string m_user; ///< user name bool m_fSysTable; ///< system table yes/no IncronTab m_tab; ///< incron table IWCE_MAP m_map; ///< watch-to-entry mapping static PROC_MAP s_procMap; ///< child process mapping /// Finds an entry for a watch. /** * \param[in] pWatch inotify watch * \return pointer to the appropriate entry; NULL if no such entry exists */ IncronTabEntry* FindEntry(InotifyWatch* pWatch); /// Prepares arguments for creating a child process. /** * \param[in] rCmd command string * \param[out] argc argument count * \param[out] argv argument array * \return true = success, false = failure */ bool PrepareArgs(const std::string& rCmd, int& argc, char**& argv); /// Frees memory allocated for arguments. /** * \param[in] argc argument count * \param[in] argv argument array */ void CleanupArgs(int argc, char** argv); }; #endif //_USERTABLE_H_ incron-0.5.10/strtok.h0000644000175000001440000001357211737665757013336 0ustar lukusers /// string tokenizer header /** * \file strtok.h * * string tokenizer * * Copyright (C) 2006, 2007, 2008 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * */ #ifndef _STRTOK_H_ #define _STRTOK_H_ #include typedef std::string::size_type SIZE; /// Simple string tokenizer class. /** * This class implements a string tokenizer. It splits a string * by a character to a number of elements (tokens) which are * provided sequentially. * * All operations are made on a copy of the original string * (which may be in fact a copy-on-write instance). * * The original string is left unchanged. All tokens are returned * as newly created strings. * * There is possibility to specify a prefix character which * causes the consecutive character is not considered as * a delimiter. If you don't specify this character (or specify * the NUL character, 0x00) this feature is disabled. The mostly * used prefix is a backslash ('\'). * * This class is not thread-safe. * * Performance note: This class is currently not intended * to be very fast. Speed optimizations will be done later. */ class StringTokenizer { public: /// Constructor. /** * Creates a ready-to-use tokenizer. * * \param[in] rStr string for tokenizing * \param[in] cDelim delimiter (separator) character * \param[in] cPrefix character which is prepended if a * character must not separate tokens */ StringTokenizer(const std::string& rStr, char cDelim = ',', char cPrefix = '\0'); /// Destructor. ~StringTokenizer() {} /// Checks whether the tokenizer can provide more tokens. /** * \return true = more tokens available, false = otherwise */ inline bool HasMoreTokens() const { return m_pos < m_len; } /// Returns the next token. /** * If a prefix is defined it is stripped from the returned * string (e.g. 'abc\ def' is transformed to 'abc def' * while the prefix is '\'). * * \param[in] fSkipEmpty skip empty strings (more consecutive delimiters) * \return next token or "" if no more tokens available * * \sa GetNextTokenRaw() */ std::string GetNextToken(bool fSkipEmpty = false); /// Returns the next token. /** * This method always returns an unmodified string even * if it contains prefix characters. * * \param[in] fSkipEmpty skip empty strings (more consecutive delimiters) * \return next token or "" if no more tokens available * * \sa GetNextToken() */ std::string GetNextTokenRaw(bool fSkipEmpty = false); /// Returns the remainder of the source string. /** * This method returns everything what has not been * processed (tokenized) yet and moves the current * position to the end of the string. * * If a prefix is defined it is stripped from * the returned string. * * \return remainder string */ std::string GetRemainder(); /// Sets a delimiter (separator) character. /** * The new delimiter has effect only to tokens returned later; * the position in the string is not affected. * * If you specify a NUL character (0x00) here the prefix * will not be used. * * \param[in] cDelim delimiter character */ inline void SetDelimiter(char cDelim) { m_cDelim = cDelim; } /// Returns the delimiter (separator) character. /** * \return delimiter character */ inline char GetDelimiter() const { return m_cDelim; } /// Sets a prefix character. /** * The new prefix has effect only to tokens returned later; * the position in the string is not affected. * * \param[in] cPrefix prefix character * * \sa SetNoPrefix() */ inline void SetPrefix(char cPrefix) { m_cPrefix = cPrefix; } /// Returns the prefix character. /** * \return prefix character */ inline char GetPrefix() const { return m_cPrefix; } /// Sets the prefix to 'no prefix'. /** * Calling this method is equivalent to SetPrefix((char) 0). * * \sa SetPrefix() */ inline void SetNoPrefix() { SetPrefix('\0'); } /// Resets the tokenizer. /** * Re-initializes tokenizing to the start of the string. */ inline void Reset() { m_pos = 0; } private: std::string m_str; ///< tokenized string char m_cDelim; ///< delimiter character char m_cPrefix; ///< prefix character std::string::size_type m_pos; ///< current position std::string::size_type m_len; ///< string length /// Strips all prefix characters. /** * \param[in] s source string * \param[in] cnt string length * \return modified string */ std::string StripPrefix(const char* s, SIZE cnt); /// Extracts the next token (internal method). /** * The extracted token may be empty. * * \param[out] rToken extracted token * \param[in] fStripPrefix strip prefix characters yes/no */ void _GetNextToken(std::string& rToken, bool fStripPrefix); /// Extracts the next token (internal method). /** * This method does no checking about the prefix character. * * The extracted token may be empty. * * \param[out] rToken extracted token */ void _GetNextTokenNoPrefix(std::string& rToken); /// Extracts the next token (internal method). /** * This method does checking about the prefix character. * * The extracted token may be empty. * * \param[out] rToken extracted token */ void _GetNextTokenWithPrefix(std::string& rToken); }; #endif //_STRTOK_H_ incron-0.5.10/inotify-cxx.h0000644000175000001440000005505311737665757014271 0ustar lukusers /// inotify C++ interface header /** * \file inotify-cxx.h * * inotify C++ interface * * Copyright (C) 2006, 2007, 2008 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * */ #ifndef _INOTIFYCXX_H_ #define _INOTIFYCXX_H_ #include #include #include #include // Please ensure that the following headers take the right place #include #include // Use this if syscalls not defined #ifndef __NR_inotify_init #include #endif // __NR_inotify_init /// Event struct size #define INOTIFY_EVENT_SIZE (sizeof(struct inotify_event)) /// Event buffer length #define INOTIFY_BUFLEN (1024 * (INOTIFY_EVENT_SIZE + 16)) /// Helper macro for creating exception messages. /** * It prepends the message by the function name. */ #define IN_EXC_MSG(msg) (std::string(__PRETTY_FUNCTION__) + ": " + msg) /// inotify capability/limit identifiers typedef enum { IN_MAX_EVENTS = 0, ///< max. events in the kernel queue IN_MAX_INSTANCES = 1, ///< max. inotify file descriptors per process IN_MAX_WATCHES = 2 ///< max. watches per file descriptor } InotifyCapability_t; /// inotify-cxx thread safety /** * If this symbol is defined you can use this interface safely * threaded applications. Remember that it slightly degrades * performance. * * Even if INOTIFY_THREAD_SAFE is defined some classes stay * unsafe. If you must use them (must you?) in more than one * thread concurrently you need to implement explicite locking. * * You need not to define INOTIFY_THREAD_SAFE in that cases * where the application is multithreaded but all the inotify * infrastructure will be managed only in one thread. This is * the recommended way. * * Locking may fail (it is very rare but not impossible). In this * case an exception is thrown. But if unlocking fails in case * of an error it does nothing (this failure is ignored). */ #ifdef INOTIFY_THREAD_SAFE #include #define IN_LOCK_DECL mutable pthread_rwlock_t __m_lock; #define IN_LOCK_INIT \ { \ pthread_rwlockattr_t attr; \ int res = 0; \ if ((res = pthread_rwlockattr_init(&attr)) != 0) \ throw InotifyException(IN_EXC_MSG("cannot initialize lock attributes"), res, this); \ if ((res = pthread_rwlockattr_setkind_np(&attr, PTHREAD_RWLOCK_PREFER_WRITER_NP)) != 0) \ throw InotifyException(IN_EXC_MSG("cannot set lock kind"), res, this); \ if ((res = pthread_rwlock_init(&__m_lock, &attr)) != 0) \ throw InotifyException(IN_EXC_MSG("cannot initialize lock"), res, this); \ pthread_rwlockattr_destroy(&attr); \ } #define IN_LOCK_DONE pthread_rwlock_destroy(&__m_lock); #define IN_READ_BEGIN \ { \ int res = pthread_rwlock_rdlock(&__m_lock); \ if (res != 0) \ throw InotifyException(IN_EXC_MSG("locking for reading failed"), res, (void*) this); \ } #define IN_READ_END \ { \ int res = pthread_rwlock_unlock(&__m_lock); \ if (res != 0) \ throw InotifyException(IN_EXC_MSG("unlocking failed"), res, (void*) this); \ } #define IN_READ_END_NOTHROW pthread_rwlock_unlock(&__m_lock); #define IN_WRITE_BEGIN \ { \ int res = pthread_rwlock_wrlock(&__m_lock); \ if (res != 0) \ throw InotifyException(IN_EXC_MSG("locking for writing failed"), res, (void*) this); \ } #define IN_WRITE_END IN_READ_END #define IN_WRITE_END_NOTHROW IN_READ_END_NOTHROW #else // INOTIFY_THREAD_SAFE #define IN_LOCK_DECL #define IN_LOCK_INIT #define IN_LOCK_DONE #define IN_READ_BEGIN #define IN_READ_END #define IN_READ_END_NOTHROW #define IN_WRITE_BEGIN #define IN_WRITE_END #define IN_WRITE_END_NOTHROW #endif // INOTIFY_THREAD_SAFE // forward declaration class InotifyWatch; class Inotify; /// Class for inotify exceptions /** * This class allows to acquire information about exceptional * events. It makes easier to log or display error messages * and to identify problematic code locations. * * Although this class is basically thread-safe it is not intended * to be shared between threads. */ class InotifyException { public: /// Constructor /** * \param[in] rMsg message * \param[in] iErr error number (see errno.h) * \param[in] pSrc source */ InotifyException(const std::string& rMsg = "", int iErr = 0, void* pSrc = NULL) : m_msg(rMsg), m_err(iErr) { m_pSrc = pSrc; } /// Returns the exception message. /** * \return message */ inline const std::string& GetMessage() const { return m_msg; } /// Returns the exception error number. /** * If not applicable this value is 0 (zero). * * \return error number (standardized; see errno.h) */ inline int GetErrorNumber() const { return m_err; } /// Returns the exception source. /** * \return source */ inline void* GetSource() const { return m_pSrc; } protected: std::string m_msg; ///< message int m_err; ///< error number mutable void* m_pSrc; ///< source }; /// inotify event class /** * It holds all information about inotify event and provides * access to its particular values. * * This class is not (and is not intended to be) thread-safe * and therefore it must not be used concurrently in multiple * threads. */ class InotifyEvent { public: /// Constructor. /** * Creates a plain event. */ InotifyEvent() : m_uMask(0), m_uCookie(0) { m_pWatch = NULL; } /// Constructor. /** * Creates an event based on inotify event data. * For NULL pointers it works the same way as InotifyEvent(). * * \param[in] pEvt event data * \param[in] pWatch inotify watch */ InotifyEvent(const struct inotify_event* pEvt, InotifyWatch* pWatch) : m_uMask(0), m_uCookie(0) { if (pEvt != NULL) { m_uMask = (uint32_t) pEvt->mask; m_uCookie = (uint32_t) pEvt->cookie; if (pEvt->name != NULL) { m_name = pEvt->len > 0 ? pEvt->name : ""; } m_pWatch = pWatch; } else { m_pWatch = NULL; } } /// Destructor. ~InotifyEvent() {} /// Returns the event watch descriptor. /** * \return watch descriptor * * \sa InotifyWatch::GetDescriptor() */ int32_t GetDescriptor() const; /// Returns the event mask. /** * \return event mask * * \sa InotifyWatch::GetMask() */ inline uint32_t GetMask() const { return m_uMask; } /// Checks a value for the event type. /** * \param[in] uValue checked value * \param[in] uType type which is checked for * \return true = the value contains the given type, false = otherwise */ inline static bool IsType(uint32_t uValue, uint32_t uType) { return ((uValue & uType) != 0) && ((~uValue & uType) == 0); } /// Checks for the event type. /** * \param[in] uType type which is checked for * \return true = event mask contains the given type, false = otherwise */ inline bool IsType(uint32_t uType) const { return IsType(m_uMask, uType); } /// Returns the event cookie. /** * \return event cookie */ inline uint32_t GetCookie() const { return m_uCookie; } /// Returns the event name length. /** * \return event name length */ inline uint32_t GetLength() const { return (uint32_t) m_name.length(); } /// Returns the event name. /** * \return event name */ inline const std::string& GetName() const { return m_name; } /// Extracts the event name. /** * \param[out] rName event name */ inline void GetName(std::string& rName) const { rName = GetName(); } /// Returns the source watch. /** * \return source watch */ inline InotifyWatch* GetWatch() { return m_pWatch; } /// Finds the appropriate mask for a name. /** * \param[in] rName mask name * \return mask for name; 0 on failure */ static uint32_t GetMaskByName(const std::string& rName); /// Fills the string with all types contained in an event mask value. /** * \param[in] uValue event mask value * \param[out] rStr dumped event types */ static void DumpTypes(uint32_t uValue, std::string& rStr); /// Fills the string with all types contained in the event mask. /** * \param[out] rStr dumped event types */ void DumpTypes(std::string& rStr) const; private: uint32_t m_uMask; ///< mask uint32_t m_uCookie; ///< cookie std::string m_name; ///< name InotifyWatch* m_pWatch; ///< source watch }; /// inotify watch class /** * It holds information about the inotify watch on a particular * inode. * * If the INOTIFY_THREAD_SAFE is defined this class is thread-safe. */ class InotifyWatch { public: /// Constructor. /** * Creates an inotify watch. Because this watch is * inactive it has an invalid descriptor (-1). * * \param[in] rPath watched file path * \param[in] uMask mask for events * \param[in] fEnabled events enabled yes/no */ InotifyWatch(const std::string& rPath, int32_t uMask, bool fEnabled = true) : m_path(rPath), m_uMask(uMask), m_wd((int32_t) -1), m_fEnabled(fEnabled) { IN_LOCK_INIT } /// Destructor. ~InotifyWatch() { IN_LOCK_DONE } /// Returns the watch descriptor. /** * \return watch descriptor; -1 for inactive watch */ inline int32_t GetDescriptor() const { return m_wd; } /// Returns the watched file path. /** * \return file path */ inline const std::string& GetPath() const { return m_path; } /// Returns the watch event mask. /** * \return event mask */ inline uint32_t GetMask() const { return (uint32_t) m_uMask; } /// Sets the watch event mask. /** * If the watch is active (added to an instance of Inotify) * this method may fail due to unsuccessful re-setting * the watch in the kernel. * * \param[in] uMask event mask * * \throw InotifyException thrown if changing fails */ void SetMask(uint32_t uMask) throw (InotifyException); /// Returns the appropriate inotify class instance. /** * \return inotify instance */ inline Inotify* GetInotify() { return m_pInotify; } /// Enables/disables the watch. /** * If the watch is active (added to an instance of Inotify) * this method may fail due to unsuccessful re-setting * the watch in the kernel. * * Re-setting the current state has no effect. * * \param[in] fEnabled set enabled yes/no * * \throw InotifyException thrown if enabling/disabling fails */ void SetEnabled(bool fEnabled) throw (InotifyException); /// Checks whether the watch is enabled. /** * \return true = enables, false = disabled */ inline bool IsEnabled() const { return m_fEnabled; } /// Checks whether the watch is recursive. /** * A recursive watch monitors a directory itself and all * its subdirectories. This watch is a logical object * which may have many underlying kernel watches. * * \return currently always false (recursive watches not yet supported) * \attention Recursive watches are currently NOT supported. * They are planned for future versions. */ inline bool IsRecursive() const { return false; } private: friend class Inotify; std::string m_path; ///< watched file path uint32_t m_uMask; ///< event mask int32_t m_wd; ///< watch descriptor Inotify* m_pInotify; ///< inotify object bool m_fEnabled; ///< events enabled yes/no IN_LOCK_DECL /// Disables the watch (due to removing by the kernel). /** * This method must be called after receiving an event. * It ensures the watch object is consistent with the kernel * data. */ void __Disable(); }; /// Mapping from watch descriptors to watch objects. typedef std::map IN_WATCH_MAP; /// Mapping from paths to watch objects. typedef std::map IN_WP_MAP; /// inotify class /** * It holds information about the inotify device descriptor * and manages the event queue. * * If the INOTIFY_THREAD_SAFE is defined this class is thread-safe. */ class Inotify { public: /// Constructor. /** * Creates and initializes an instance of inotify communication * object (opens the inotify device). * * \throw InotifyException thrown if inotify isn't available */ Inotify() throw (InotifyException); /// Destructor. /** * Calls Close() due to clean-up. */ ~Inotify(); /// Removes all watches and closes the inotify device. void Close(); /// Adds a new watch. /** * \param[in] pWatch inotify watch * * \throw InotifyException thrown if adding failed */ void Add(InotifyWatch* pWatch) throw (InotifyException); /// Adds a new watch. /** * \param[in] rWatch inotify watch * * \throw InotifyException thrown if adding failed */ inline void Add(InotifyWatch& rWatch) throw (InotifyException) { Add(&rWatch); } /// Removes a watch. /** * If the given watch is not present it does nothing. * * \param[in] pWatch inotify watch * * \throw InotifyException thrown if removing failed */ void Remove(InotifyWatch* pWatch) throw (InotifyException); /// Removes a watch. /** * If the given watch is not present it does nothing. * * \param[in] rWatch inotify watch * * \throw InotifyException thrown if removing failed */ inline void Remove(InotifyWatch& rWatch) throw (InotifyException) { Remove(&rWatch); } /// Removes all watches. void RemoveAll(); /// Returns the count of watches. /** * This is the total count of all watches (regardless whether * enabled or not). * * \return count of watches * * \sa GetEnabledCount() */ inline size_t GetWatchCount() const { IN_READ_BEGIN size_t n = (size_t) m_paths.size(); IN_READ_END return n; } /// Returns the count of enabled watches. /** * \return count of enabled watches * * \sa GetWatchCount() */ inline size_t GetEnabledCount() const { IN_READ_BEGIN size_t n = (size_t) m_watches.size(); IN_READ_END return n; } /// Waits for inotify events. /** * It waits until one or more events occur. When called * in nonblocking mode it only retrieves occurred events * to the internal queue and exits. * * \param[in] fNoIntr if true it re-calls the system call after a handled signal * * \throw InotifyException thrown if reading events failed * * \sa SetNonBlock() */ void WaitForEvents(bool fNoIntr = false) throw (InotifyException); /// Returns the count of received and queued events. /** * This number is related to the events in the queue inside * this object, not to the events pending in the kernel. * * \return count of events */ inline size_t GetEventCount() { IN_READ_BEGIN size_t n = (size_t) m_events.size(); IN_READ_END return n; } /// Extracts a queued inotify event. /** * The extracted event is removed from the queue. * If the pointer is NULL it does nothing. * * \param[in,out] pEvt event object * * \throw InotifyException thrown if the provided pointer is NULL */ bool GetEvent(InotifyEvent* pEvt) throw (InotifyException); /// Extracts a queued inotify event. /** * The extracted event is removed from the queue. * * \param[in,out] rEvt event object * * \throw InotifyException thrown only in very anomalous cases */ bool GetEvent(InotifyEvent& rEvt) throw (InotifyException) { return GetEvent(&rEvt); } /// Extracts a queued inotify event (without removing). /** * The extracted event stays in the queue. * If the pointer is NULL it does nothing. * * \param[in,out] pEvt event object * * \throw InotifyException thrown if the provided pointer is NULL */ bool PeekEvent(InotifyEvent* pEvt) throw (InotifyException); /// Extracts a queued inotify event (without removing). /** * The extracted event stays in the queue. * * \param[in,out] rEvt event object * * \throw InotifyException thrown only in very anomalous cases */ bool PeekEvent(InotifyEvent& rEvt) throw (InotifyException) { return PeekEvent(&rEvt); } /// Searches for a watch by a watch descriptor. /** * It tries to find a watch by the given descriptor. * * \param[in] iDescriptor watch descriptor * \return pointer to a watch; NULL if no such watch exists */ InotifyWatch* FindWatch(int iDescriptor); /// Searches for a watch by a filesystem path. /** * It tries to find a watch by the given filesystem path. * * \param[in] rPath filesystem path * \return pointer to a watch; NULL if no such watch exists * * \attention The path must be exactly identical to the one * used for the searched watch. Be careful about * absolute/relative and case-insensitive paths. */ InotifyWatch* FindWatch(const std::string& rPath); /// Returns the file descriptor. /** * The descriptor can be used in standard low-level file * functions (poll(), select(), fcntl() etc.). * * \return valid file descriptor or -1 for inactive object * * \sa SetNonBlock() */ inline int GetDescriptor() const { return m_fd; } /// Enables/disables non-blocking mode. /** * Use this mode if you want to monitor the descriptor * (acquired thru GetDescriptor()) in functions such as * poll(), select() etc. * * Non-blocking mode is disabled by default. * * \param[in] fNonBlock enable/disable non-blocking mode * * \throw InotifyException thrown if setting mode failed * * \sa GetDescriptor(), SetCloseOnExec() */ void SetNonBlock(bool fNonBlock) throw (InotifyException); /// Enables/disables closing on exec. /** * Enable this if you want to close the descriptor when * executing another program. Otherwise, the descriptor * will be inherited. * * Closing on exec is disabled by default. * * \param[in] fClOnEx enable/disable closing on exec * * \throw InotifyException thrown if setting failed * * \sa GetDescriptor(), SetNonBlock() */ void SetCloseOnExec(bool fClOnEx) throw (InotifyException); /// Acquires a particular inotify capability/limit. /** * \param[in] cap capability/limit identifier * \return capability/limit value * \throw InotifyException thrown if the given value cannot be acquired */ static uint32_t GetCapability(InotifyCapability_t cap) throw (InotifyException); /// Modifies a particular inotify capability/limit. /** * \param[in] cap capability/limit identifier * \param[in] val new capability/limit value * \throw InotifyException thrown if the given value cannot be set * \attention Using this function requires root privileges. * Beware of setting extensive values - it may seriously * affect system performance and/or stability. */ static void SetCapability(InotifyCapability_t cap, uint32_t val) throw (InotifyException); /// Returns the maximum number of events in the kernel queue. /** * \return maximum number of events in the kernel queue * \throw InotifyException thrown if the given value cannot be acquired */ inline static uint32_t GetMaxEvents() throw (InotifyException) { return GetCapability(IN_MAX_EVENTS); } /// Sets the maximum number of events in the kernel queue. /** * \param[in] val new value * \throw InotifyException thrown if the given value cannot be set * \attention Using this function requires root privileges. * Beware of setting extensive values - the greater value * is set here the more physical memory may be used for the inotify * infrastructure. */ inline static void SetMaxEvents(uint32_t val) throw (InotifyException) { SetCapability(IN_MAX_EVENTS, val); } /// Returns the maximum number of inotify instances per process. /** * It means the maximum number of open inotify file descriptors * per running process. * * \return maximum number of inotify instances * \throw InotifyException thrown if the given value cannot be acquired */ inline static uint32_t GetMaxInstances() throw (InotifyException) { return GetCapability(IN_MAX_INSTANCES); } /// Sets the maximum number of inotify instances per process. /** * \param[in] val new value * \throw InotifyException thrown if the given value cannot be set * \attention Using this function requires root privileges. * Beware of setting extensive values - the greater value * is set here the more physical memory may be used for the inotify * infrastructure. */ inline static void SetMaxInstances(uint32_t val) throw (InotifyException) { SetCapability(IN_MAX_INSTANCES, val); } /// Returns the maximum number of inotify watches per instance. /** * It means the maximum number of inotify watches per inotify * file descriptor. * * \return maximum number of inotify watches * \throw InotifyException thrown if the given value cannot be acquired */ inline static uint32_t GetMaxWatches() throw (InotifyException) { return GetCapability(IN_MAX_WATCHES); } /// Sets the maximum number of inotify watches per instance. /** * \param[in] val new value * \throw InotifyException thrown if the given value cannot be set * \attention Using this function requires root privileges. * Beware of setting extensive values - the greater value * is set here the more physical memory may be used for the inotify * infrastructure. */ inline static void SetMaxWatches(uint32_t val) throw (InotifyException) { SetCapability(IN_MAX_WATCHES, val); } private: int m_fd; ///< file descriptor IN_WATCH_MAP m_watches; ///< watches (by descriptors) IN_WP_MAP m_paths; ///< watches (by paths) unsigned char m_buf[INOTIFY_BUFLEN]; ///< buffer for events std::deque m_events; ///< event queue IN_LOCK_DECL friend class InotifyWatch; static std::string GetCapabilityPath(InotifyCapability_t cap) throw (InotifyException); }; #endif //_INOTIFYCXX_H_ incron-0.5.10/incrontab.h0000644000175000001440000001176511737665757013771 0ustar lukusers /// inotify cron table manipulator classes header /** * \file incrontab.h * * inotify cron system * * Copyright (C) 2006, 2007, 2008 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * */ #ifndef _INCRONTAB_H_ #define _INCRONTAB_H_ #include #include #include "strtok.h" /* /// Incron user table base directory #define INCRON_USER_TABLE_BASE "/var/spool/incron/" /// Incron system table base directory #define INCRON_SYS_TABLE_BASE "/etc/incron.d/" */ /// Incron table entry class. class IncronTabEntry { public: /// Constructor. /** * Creates an empty entry for later use with Parse(). * * \sa Parse() */ IncronTabEntry(); /// Constructor. /** * Creates an entry based on defined parameters. * * \param[in] rPath watched filesystem path * \param[in] uMask event mask * \param[in] rCmd command string */ IncronTabEntry(const std::string& rPath, uint32_t uMask, const std::string& rCmd); /// Destructor. ~IncronTabEntry() {} /// Converts the entry to string representation. /** * This method creates a string for use in a table file. * * \return string representation */ std::string ToString() const; /// Parses a string and attempts to extract entry parameters. /** * \param[in] rStr parsed string * \param[out] rEntry parametrized entry * \return true = success, false = failure */ static bool Parse(const std::string& rStr, IncronTabEntry& rEntry); /// Returns the watch filesystem path. /** * \return watch path */ inline const std::string& GetPath() const { return m_path; } /// Returns the event mask. /** * \return event mask */ inline int32_t GetMask() const { return m_uMask; } /// Returns the command string. /** * \return command string */ inline const std::string& GetCmd() const { return m_cmd; } /// Checks whether this entry has set loop-avoidance. /** * \return true = no loop, false = loop allowed */ inline bool IsNoLoop() const { return m_fNoLoop; } /// Add backslashes before spaces in the source path. /** * It also adds backslashes before all original backslashes * of course. * * The source string is not modified and a copy is returned * instead. * * This method is intended to be used for paths in user tables. * * \param[in] rPath path to be modified * \return modified path */ static std::string GetSafePath(const std::string& rPath); protected: std::string m_path; ///< watch path uint32_t m_uMask; ///< event mask std::string m_cmd; ///< command string bool m_fNoLoop; ///< no loop yes/no }; /// Incron table class. class IncronTab { public: /// Constructor. IncronTab() {} /// Destructor. ~IncronTab() {} /// Add an entry to the table. /** * \param[in] rEntry table entry */ inline void Add(const IncronTabEntry& rEntry) { m_tab.push_back(rEntry); } /// Removes all entries. inline void Clear() { m_tab.clear(); } /// Checks whether the table is empty. /** * \return true = empty, false = otherwise */ inline bool IsEmpty() const { return m_tab.empty(); } /// Returns the count of entries. /** * \return count of entries */ inline int GetCount() const { return (int) m_tab.size(); } /// Returns an entry. /** * \return reference to the entry for the given index * * \attention This method doesn't test index bounds. If you * pass an invalid value the program may crash * and/or behave unpredictible way! */ inline IncronTabEntry& GetEntry(int index) { return m_tab[index]; } /// Loads the table. /** * \param[in] rPath path to a source table file * \return true = success, false = failure */ bool Load(const std::string& rPath); /// Saves the table. /** * \param[in] rPath path to a destination table file * \return true = success, false = failure */ bool Save(const std::string& rPath); /// Checks whether an user has permission to use incron. /** * \param[in] rUser user name * \return true = permission OK, false = otherwise */ static bool CheckUser(const std::string& rUser); /// Composes a path to an user incron table file. /** * \param[in] rUser user name * \return path to the table file * * \attention No tests (existence, permission etc.) are done. */ static std::string GetUserTablePath(const std::string& rUser); /// Composes a path to a system incron table file. /** * \param[in] rName table name (pseudouser) * \return path to the table file * * \attention No tests (existence, permission etc.) are done. */ static std::string GetSystemTablePath(const std::string& rName); protected: std::deque m_tab; ///< incron table }; #endif //_INCRONTAB_H_ incron-0.5.10/incron.h0000644000175000001440000000142411737665757013271 0ustar lukusers /// inotify cron basic definition file /** * \file incron.h * * inotify cron system * * Copyright (C) 2006, 2007, 2008, 2009 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * */ #ifndef _INCRON_H_ #define _INCRON_H_ /// Common application name #define INCRON_NAME "incron" /// Daemon name #define INCROND_NAME "incrond" /// Table manipulator name #define INCRONTAB_NAME "incrontab" /// Application version (release) #define INCRON_VERSION "0.5.10" /// Address for sending bugs #define INCRON_BUG_ADDRESS "" /// Default configuration file #define INCRON_CONFIG "/etc/incron.conf" #endif //_INCRON_H_ incron-0.5.10/incroncfg.h0000644000175000001440000000673011737665757013756 0ustar lukusers /// inotify cron configuration header /** * \file incroncfg.h * * incron configuration * * Copyright (C) 2007, 2008 Lukas Jelinek, * * This program is free software; you can use it, redistribute * it and/or modify it under the terms of the GNU General Public * License, version 2 (see LICENSE-GPL). * */ #ifndef INCRONCFG_H_ #define INCRONCFG_H_ #include #include /// Configuration class. /** * This class provides access to values loaded from * a configuration file (either a explicitly specified one * or the default one). */ class IncronCfg { public: /// Initializes default configuration values. static void Init(); /// Loads configuration values. /** * This method attempts to load configuration values * from the specified file. If it fails (e.g. the file * doesn't exist) the default file is read. As the last * resort (for the case the default file can't be loaded) * the hard-wired values are used. * * \param[in] rPath configuration file path */ static void Load(const std::string& rPath); /// Retrieves a configuration value. /** * This method attempts to find the appropriate configuration * value for the given key and stores it into the given * variable. * * \param[in] rKey value key * \param[out] rVal retrieved value * \return true = success, false = failure (invalid key) */ static bool GetValue(const std::string& rKey, std::string& rVal); /// Retrieves a configuration value. /** * This method attempts to find the appropriate configuration * value for the given key and stores it into the given * variable. * * \param[in] rKey value key * \param[out] rVal retrieved value * \return true = success, false = failure (invalid key) */ static bool GetValue(const std::string& rKey, int& rVal); /// Retrieves a configuration value. /** * This method attempts to find the appropriate configuration * value for the given key and stores it into the given * variable. * * \param[in] rKey value key * \param[out] rVal retrieved value * \return true = success, false = failure (invalid key) */ static bool GetValue(const std::string& rKey, unsigned& rVal); /// Retrieves a configuration value. /** * This method attempts to find the appropriate configuration * value for the given key and stores it into the given * variable. * * \param[in] rKey value key * \param[out] rVal retrieved value * \return true = success, false = failure (invalid key) */ static bool GetValue(const std::string& rKey, bool& rVal); /// Builds a file path. /** * This function composes a path from a base path and a file name. * * \param[in] rPath base path * \param[in] rName file name * \return full path */ static std::string BuildPath(const std::string& rPath, const std::string& rName); protected: /// Parses a line a attempts to get a key and a value. /** * \param[in] s text line * \param[out] rKey key * \param[out] rVal value * \return true = success, false = failure */ static bool ParseLine(const char* s, std::string& rKey, std::string& rVal); /// Checks whether a line is a comment. /** * \param[in] s text line * \return true = comment, false = otherwise */ static bool IsComment(const char* s); private: static std::map m_values; static std::map m_defaults; }; #endif /*INCRONCFG_H_*/ incron-0.5.10/appinst.h0000644000175000001440000000621111737665757013456 0ustar lukusers /// Application instance class header /** * \file appinst.h * * Copyright (C) 2007, 2008 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * */ #ifndef APPINST_H_ #define APPINST_H_ #include #define APPLOCK_BASEDIR "/var/run" /// Exception class. /** * This class provides information about occurred errors. */ class AppInstException { public: /// Constructor. /** * \param[in] iErr error number */ AppInstException(int iErr) : m_iErr(iErr) {} /// Returns the error number. /** * \return error number */ inline int GetErrorNumber() const { return m_iErr; } private: int m_iErr; ///< error number }; /// Application instance management class. /** * This class is intended for application which require to * be running only once (one instance only). It provides some * methods for simple locking, signaling etc. */ class AppInstance { public: /// Constructor. /** * \param[in] rName application name * \param[in] rBase lockfile base directory * * \attention If an empty base directory is given it is replaced by * the default value. */ AppInstance(const std::string& rName, const std::string& rBase = APPLOCK_BASEDIR); /// Destructor. ~AppInstance(); /// Attempts to lock the instance. /** * This method attempts to create a lockfile. If the file * already exists it checks whether its owner is still living. * If it does this method fails. Otherwise it unlinks this file * and re-attempts to create it. * * \return true = instance locked, false = otherwise */ bool Lock(); /// Unlocks the instance. /** * This method removes (unlinks) the appropriate lockfile. * If the instance hasn't been locked this method has no * effect. */ void Unlock(); /// Checks whether an instance of this application exists. /** * If this instance has acquired the lockfile the call will * be successful. Otherwise it checks for existence of * another running instance. * * \return true = instance exists, false = otherwise */ bool Exists() const; /// Sends a signal to an instance of this application. /** * This method doesn't signal the current instance. * * \param[in] iSigNo signal number * \return true = success, false = otherwise */ bool SendSignal(int iSigNo) const; /// Terminates an instance of this application. /** * This method doesn't terminate the current instance. * * \return true = success, false = otherwise */ inline bool Terminate() const { return SendSignal(SIGTERM); } protected: bool DoLock(); private: std::string m_path; ///< lock path bool m_fLocked; ///< locked yes/no }; #endif /*APPINST_H_*/ incron-0.5.10/appargs.h0000644000175000001440000001542111737665757013440 0ustar lukusers /// application arguments processor header /** * \file appargs.h * * application arguments processor * * Copyright (C) 2007, 2008 Lukas Jelinek, * * This program is free software; you can redistribute it and/or * modify it under the terms of one of the following licenses: * * \li 1. X11-style license (see LICENSE-X11) * \li 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL) * \li 3. GNU General Public License, version 2 (see LICENSE-GPL) * * If you want to help with choosing the best license for you, * please visit http://www.gnu.org/licenses/license-list.html. * */ #ifndef APPARGS_H_ #define APPARGS_H_ #include #include #include /// Option argument type typedef enum { AAT_NO_VALUE, ///< no value needed AAT_OPTIONAL_VALUE, ///< optional value AAT_MANDATORY_VALUE ///< mandatory value } AppArgType_t; #define APPARGS_NOLIMIT 0x7fffffff ///< value count has no limit /// Argument option type typedef struct { AppArgType_t type; ///< argument type bool mand; ///< mandatory yes/no bool found; ///< found in argument vector std::string val; ///< value bool hasVal; ///< value is set } AppArgOption_t; /// Mapping from long option name to option data typedef std::map AA_LONG_MAP; /// Mapping from short option name to option data typedef std::map AA_SHORT_MAP; /// Value list type typedef std::deque AA_VAL_LIST; /// Application arguments /** * This class is set-up for processing command line arguments. * Then it parses these arguments and builds data which * can be queried later. * * There are two categories of arguments: * \li options (a.k.a. switches) * \li values * * Options represent changeable parameters of the application. * Values are a kind of input data. * * Each option has one of the following types: * \li no value (two-state logic, e.g. running on foreground/background) * \li optional value (e.g. for logging: another file than default can be specified) * \li mandatory value (e.g. custom configuration file) * * Each option always have two forms - long one (introcuded by * two hyphens, e.g. --edit) and short one (introduced by one * hyphen, e.g. -e). These forms are functionally equivalent. * * Unknown options are silently ignored. */ class AppArgs { public: /// Initializes the processor. /** * \param[in] valMinCnt minimum count of values * \param[in] valMaxCnt maximum number of values (no effect if lower than valMinCnt) */ static void Init(size_t valMinCnt = 0, size_t valMaxCnt = APPARGS_NOLIMIT); /// Releases resources allocated by the processor. /** * This method should be called if the argument values are * no longer needed. */ static void Destroy(); /// Parses arguments and builds the appropriate structure. /** * \param[in] argc argument count * \param[in] argv argument vector * * \attention All errors are silently ignored. */ static void Parse(int argc, const char* const* argv); /// Checks whether the arguments have valid form. /** * Arguments are valid if: * \li all mandatory options are present * \li all options with mandatory values have their values * \li value count is between its minimum and maximum * \li there are no unknown options (if unknown options are not accepted) * * \return true = arguments valid, false = otherwise */ static bool IsValid(); /// Checks whether an option exists. /** * \param[in] rArg long option name * \return true = option exists, false = otherwise */ static bool ExistsOption(const std::string& rArg); /// Extracts an option value. /** * \param[in] rArg long option name * \param[out] rVal option value * \return true = value extracted, false = option not found or has no value */ static bool GetOption(const std::string& rArg, std::string& rVal); /// Adds an option. /** * This method is intended to be called between initilization * and parsing. It adds an option which may (or must) occur * inside the argument vector. * * \param[in] rName long option name * \param[in] cShort short (one-character) option name * \param[in] type argument type * \param[in] fMandatory option is mandatory yes/no * \return true = success, false = failure (e.g. option already exists) */ static bool AddOption(const std::string& rName, char cShort, AppArgType_t type, bool fMandatory); /// Returns the count of values. /** * \return count of values */ static size_t GetValueCount(); /// Extracts a value. /** * \param[in] index value index * \param[out] rVal extracted value * \return true = value extracted, false = otherwise */ static bool GetValue(size_t index, std::string& rVal); /// Dumps information about options and value to STDERR. /** * \attention This method may be very slow. */ static void Dump(); protected: /// Checks whether a string is an option. /** * \param[in] pchStr text string * \return true = option, false = otherwise */ static bool IsOption(const char* pchStr); /// Checks whether a string is a long option. /** * This methos assumes the string is an option * (if not the behavior is undefined). * * \param[in] pchStr text string * \return true = option, false = otherwise */ static bool IsLongOption(const char* pchStr); /// Parses a string and attempts to treat it as a long option. /** * \param[in] pchStr text string * \param[out] rName option name * \param[out] rVal value string * \param[out] rfHasVal option has value yes/no * \return true = success, false = failure */ static bool ParseLong(const char* pchStr, std::string& rName, std::string& rVal, bool& rfHasVal); /// Parses a string and attempts to treat it as a short option. /** * \param[in] pchStr text string * \param[out] rcName option name * \param[out] rVal value string * \param[out] rfHasVal option has value yes/no * * \attention This method assumes the string is a valid short option. */ static void ParseShort(const char* pchStr, char& rcName, std::string& rVal, bool& rfHasVal); /// Dumps an option to STDERR. /** * \param[in] rName long option name * \param[in] cShort short option name * \param[in] pOpt option data */ static void DumpOption(const std::string& rName, char cShort, AppArgOption_t* pOpt); private: static size_t s_minCnt; ///< minimum value count static size_t s_maxCnt; ///< maximum value count static AA_LONG_MAP s_longMap; ///< mapping from long names to data static AA_SHORT_MAP s_shortMap; ///< mapping from short names to data static AA_VAL_LIST s_valList; ///< value list }; #endif /*APPARGS_H_*/ incron-0.5.10/doc/0000755000175000001440000000000011737665757012374 5ustar lukusersincron-0.5.10/doc/man/0000755000175000001440000000000011737665757013147 5ustar lukusersincron-0.5.10/doc/man/man3/0000755000175000001440000000000011737665757014005 5ustar lukusersincron-0.5.10/doc/man/man3/StringTokenizer.30000644000175000001440000001336511737665757017242 0ustar lukusers.TH "StringTokenizer" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME StringTokenizer \- .PP Simple string tokenizer class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBStringTokenizer\fP (const std::string &rStr, char cDelim= ',', char cPrefix= '\\0')" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~StringTokenizer\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "bool \fBHasMoreTokens\fP () const " .br .RI "\fIChecks whether the tokenizer can provide more tokens'\&. \fP" .ti -1c .RI "std::string \fBGetNextToken\fP (bool fSkipEmpty=false)" .br .RI "\fIReturns the next token'\&. \fP" .ti -1c .RI "std::string \fBGetNextTokenRaw\fP (bool fSkipEmpty=false)" .br .RI "\fIReturns the next token'\&. \fP" .ti -1c .RI "std::string \fBGetRemainder\fP ()" .br .RI "\fIReturns the remainder of the source string'\&. \fP" .ti -1c .RI "void \fBSetDelimiter\fP (char cDelim)" .br .RI "\fISets a delimiter (separator) character'\&. \fP" .ti -1c .RI "char \fBGetDelimiter\fP () const " .br .RI "\fIReturns the delimiter (separator) character'\&. \fP" .ti -1c .RI "void \fBSetPrefix\fP (char cPrefix)" .br .RI "\fISets a prefix character'\&. \fP" .ti -1c .RI "char \fBGetPrefix\fP () const " .br .RI "\fIReturns the prefix character'\&. \fP" .ti -1c .RI "void \fBSetNoPrefix\fP ()" .br .RI "\fISets the prefix to 'no prefix''\&. \fP" .ti -1c .RI "void \fBReset\fP ()" .br .RI "\fIResets the tokenizer'\&. \fP" .in -1c .SH "Detailed Description" .PP Simple string tokenizer class'\&. This class implements a string tokenizer'\&. It splits a string by a character to a number of elements (tokens) which are provided sequentially'\&. .PP All operations are made on a copy of the original string (which may be in fact a copy-on-write instance)'\&. .PP The original string is left unchanged'\&. All tokens are returned as newly created strings'\&. .PP There is possibility to specify a prefix character which causes the consecutive character is not considered as a delimiter'\&. If you don't specify this character (or specify the NUL character, 0x00) this feature is disabled'\&. The mostly used prefix is a backslash ('\\')'\&. .PP This class is not thread-safe'\&. .PP Performance note: This class is currently not intended to be very fast'\&. Speed optimizations will be done later'\&. .SH "Constructor & Destructor Documentation" .PP .SS "StringTokenizer::StringTokenizer (const std::string &rStr, charcDelim = \fC','\fP, charcPrefix = \fC'\\0'\fP)" .PP Constructor'\&. Creates a ready-to-use tokenizer'\&. .PP \fBParameters:\fP .RS 4 \fIrStr\fP string for tokenizing .br \fIcDelim\fP delimiter (separator) character .br \fIcPrefix\fP character which is prepended if a character must not separate tokens .RE .PP .SS "StringTokenizer::~StringTokenizer ()\fC [inline]\fP" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "char StringTokenizer::GetDelimiter () const\fC [inline]\fP" .PP Returns the delimiter (separator) character'\&. \fBReturns:\fP .RS 4 delimiter character .RE .PP .SS "std::string StringTokenizer::GetNextToken (boolfSkipEmpty = \fCfalse\fP)" .PP Returns the next token'\&. If a prefix is defined it is stripped from the returned string (e'\&.g'\&. 'abc\\ def' is transformed to 'abc def' while the prefix is '\\')'\&. .PP \fBParameters:\fP .RS 4 \fIfSkipEmpty\fP skip empty strings (more consecutive delimiters) .RE .PP \fBReturns:\fP .RS 4 next token or '' if no more tokens available .RE .PP \fBSee also:\fP .RS 4 \fBGetNextTokenRaw()\fP .RE .PP .SS "std::string StringTokenizer::GetNextTokenRaw (boolfSkipEmpty = \fCfalse\fP)" .PP Returns the next token'\&. This method always returns an unmodified string even if it contains prefix characters'\&. .PP \fBParameters:\fP .RS 4 \fIfSkipEmpty\fP skip empty strings (more consecutive delimiters) .RE .PP \fBReturns:\fP .RS 4 next token or '' if no more tokens available .RE .PP \fBSee also:\fP .RS 4 \fBGetNextToken()\fP .RE .PP .SS "char StringTokenizer::GetPrefix () const\fC [inline]\fP" .PP Returns the prefix character'\&. \fBReturns:\fP .RS 4 prefix character .RE .PP .SS "std::string StringTokenizer::GetRemainder ()" .PP Returns the remainder of the source string'\&. This method returns everything what has not been processed (tokenized) yet and moves the current position to the end of the string'\&. .PP If a prefix is defined it is stripped from the returned string'\&. .PP \fBReturns:\fP .RS 4 remainder string .RE .PP .SS "bool StringTokenizer::HasMoreTokens () const\fC [inline]\fP" .PP Checks whether the tokenizer can provide more tokens'\&. \fBReturns:\fP .RS 4 true = more tokens available, false = otherwise .RE .PP .SS "void StringTokenizer::Reset ()\fC [inline]\fP" .PP Resets the tokenizer'\&. Re-initializes tokenizing to the start of the string'\&. .SS "void StringTokenizer::SetDelimiter (charcDelim)\fC [inline]\fP" .PP Sets a delimiter (separator) character'\&. The new delimiter has effect only to tokens returned later; the position in the string is not affected'\&. .PP If you specify a NUL character (0x00) here the prefix will not be used'\&. .PP \fBParameters:\fP .RS 4 \fIcDelim\fP delimiter character .RE .PP .SS "void StringTokenizer::SetNoPrefix ()\fC [inline]\fP" .PP Sets the prefix to 'no prefix''\&. Calling this method is equivalent to SetPrefix((char) 0)'\&. .PP \fBSee also:\fP .RS 4 \fBSetPrefix()\fP .RE .PP .SS "void StringTokenizer::SetPrefix (charcPrefix)\fC [inline]\fP" .PP Sets a prefix character'\&. The new prefix has effect only to tokens returned later; the position in the string is not affected'\&. .PP \fBParameters:\fP .RS 4 \fIcPrefix\fP prefix character .RE .PP \fBSee also:\fP .RS 4 \fBSetNoPrefix()\fP .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/incroncfg.h.30000644000175000001440000000135311737665757016271 0ustar lukusers.TH "incroncfg.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME incroncfg.h \- .PP inotify cron configuration header .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br .SS "Classes" .in +1c .ti -1c .RI "class \fBIncronCfg\fP" .br .RI "\fIConfiguration class'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify cron configuration header incron configuration .PP Copyright (C) 2007, 2008 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/InotifyWatch.30000644000175000001440000001061711737665757016506 0ustar lukusers.TH "InotifyWatch" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME InotifyWatch \- .PP inotify watch class .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBInotifyWatch\fP (const std::string &rPath, int32_t uMask, bool fEnabled=true)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~InotifyWatch\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "int32_t \fBGetDescriptor\fP () const " .br .RI "\fIReturns the watch descriptor'\&. \fP" .ti -1c .RI "const std::string & \fBGetPath\fP () const " .br .RI "\fIReturns the watched file path'\&. \fP" .ti -1c .RI "uint32_t \fBGetMask\fP () const " .br .RI "\fIReturns the watch event mask'\&. \fP" .ti -1c .RI "void \fBSetMask\fP (uint32_t uMask) throw (InotifyException)" .br .RI "\fISets the watch event mask'\&. \fP" .ti -1c .RI "\fBInotify\fP * \fBGetInotify\fP ()" .br .RI "\fIReturns the appropriate inotify class instance'\&. \fP" .ti -1c .RI "void \fBSetEnabled\fP (bool fEnabled) throw (InotifyException)" .br .RI "\fIEnables/disables the watch'\&. \fP" .ti -1c .RI "bool \fBIsEnabled\fP () const " .br .RI "\fIChecks whether the watch is enabled'\&. \fP" .ti -1c .RI "bool \fBIsRecursive\fP () const " .br .RI "\fIChecks whether the watch is recursive'\&. \fP" .in -1c .SS "Friends" .in +1c .ti -1c .RI "class \fBInotify\fP" .br .in -1c .SH "Detailed Description" .PP inotify watch class It holds information about the inotify watch on a particular inode'\&. .PP If the INOTIFY_THREAD_SAFE is defined this class is thread-safe'\&. .SH "Constructor & Destructor Documentation" .PP .SS "InotifyWatch::InotifyWatch (const std::string &rPath, int32_tuMask, boolfEnabled = \fCtrue\fP)\fC [inline]\fP" .PP Constructor'\&. Creates an inotify watch'\&. Because this watch is inactive it has an invalid descriptor (-1)'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP watched file path .br \fIuMask\fP mask for events .br \fIfEnabled\fP events enabled yes/no .RE .PP .SS "InotifyWatch::~InotifyWatch ()\fC [inline]\fP" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "int32_t InotifyWatch::GetDescriptor () const\fC [inline]\fP" .PP Returns the watch descriptor'\&. \fBReturns:\fP .RS 4 watch descriptor; -1 for inactive watch .RE .PP .SS "\fBInotify\fP* InotifyWatch::GetInotify ()\fC [inline]\fP" .PP Returns the appropriate inotify class instance'\&. \fBReturns:\fP .RS 4 inotify instance .RE .PP .SS "uint32_t InotifyWatch::GetMask () const\fC [inline]\fP" .PP Returns the watch event mask'\&. \fBReturns:\fP .RS 4 event mask .RE .PP .SS "const std::string& InotifyWatch::GetPath () const\fC [inline]\fP" .PP Returns the watched file path'\&. \fBReturns:\fP .RS 4 file path .RE .PP .SS "bool InotifyWatch::IsEnabled () const\fC [inline]\fP" .PP Checks whether the watch is enabled'\&. \fBReturns:\fP .RS 4 true = enables, false = disabled .RE .PP .SS "bool InotifyWatch::IsRecursive () const\fC [inline]\fP" .PP Checks whether the watch is recursive'\&. A recursive watch monitors a directory itself and all its subdirectories'\&. This watch is a logical object which may have many underlying kernel watches'\&. .PP \fBReturns:\fP .RS 4 currently always false (recursive watches not yet supported) .RE .PP \fBAttention:\fP .RS 4 Recursive watches are currently NOT supported'\&. They are planned for future versions'\&. .RE .PP .SS "void InotifyWatch::SetEnabled (boolfEnabled) throw (\fBInotifyException\fP)" .PP Enables/disables the watch'\&. If the watch is active (added to an instance of \fBInotify\fP) this method may fail due to unsuccessful re-setting the watch in the kernel'\&. .PP Re-setting the current state has no effect'\&. .PP \fBParameters:\fP .RS 4 \fIfEnabled\fP set enabled yes/no .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if enabling/disabling fails .RE .PP .SS "void InotifyWatch::SetMask (uint32_tuMask) throw (\fBInotifyException\fP)" .PP Sets the watch event mask'\&. If the watch is active (added to an instance of \fBInotify\fP) this method may fail due to unsuccessful re-setting the watch in the kernel'\&. .PP \fBParameters:\fP .RS 4 \fIuMask\fP event mask .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if changing fails .RE .PP .SH "Friends And Related Function Documentation" .PP .SS "friend class \fBInotify\fP\fC [friend]\fP" .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/AppArgOption_t.30000644000175000001440000000206711737665757016764 0ustar lukusers.TH "AppArgOption_t" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME AppArgOption_t \- .PP Argument option type'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Attributes" .in +1c .ti -1c .RI "\fBAppArgType_t\fP \fBtype\fP" .br .RI "\fIargument type \fP" .ti -1c .RI "bool \fBmand\fP" .br .RI "\fImandatory yes/no \fP" .ti -1c .RI "bool \fBfound\fP" .br .RI "\fIfound in argument vector \fP" .ti -1c .RI "std::string \fBval\fP" .br .RI "\fIvalue \fP" .ti -1c .RI "bool \fBhasVal\fP" .br .RI "\fIvalue is set \fP" .in -1c .SH "Detailed Description" .PP Argument option type'\&. .SH "Member Data Documentation" .PP .SS "bool \fBAppArgOption_t::found\fP" .PP found in argument vector .SS "bool \fBAppArgOption_t::hasVal\fP" .PP value is set .SS "bool \fBAppArgOption_t::mand\fP" .PP mandatory yes/no .SS "\fBAppArgType_t\fP \fBAppArgOption_t::type\fP" .PP argument type .SS "std::string \fBAppArgOption_t::val\fP" .PP value .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/AppArgs.30000644000175000001440000001772311737665757015440 0ustar lukusers.TH "AppArgs" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME AppArgs \- .PP Application arguments'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static void \fBInit\fP (size_t valMinCnt=0, size_t valMaxCnt=APPARGS_NOLIMIT)" .br .RI "\fIInitializes the processor'\&. \fP" .ti -1c .RI "static void \fBDestroy\fP ()" .br .RI "\fIReleases resources allocated by the processor'\&. \fP" .ti -1c .RI "static void \fBParse\fP (int argc, const char *const *argv)" .br .RI "\fIParses arguments and builds the appropriate structure'\&. \fP" .ti -1c .RI "static bool \fBIsValid\fP ()" .br .RI "\fIChecks whether the arguments have valid form'\&. \fP" .ti -1c .RI "static bool \fBExistsOption\fP (const std::string &rArg)" .br .RI "\fIChecks whether an option exists'\&. \fP" .ti -1c .RI "static bool \fBGetOption\fP (const std::string &rArg, std::string &rVal)" .br .RI "\fIExtracts an option value'\&. \fP" .ti -1c .RI "static bool \fBAddOption\fP (const std::string &rName, char cShort, \fBAppArgType_t\fP type, bool fMandatory)" .br .RI "\fIAdds an option'\&. \fP" .ti -1c .RI "static size_t \fBGetValueCount\fP ()" .br .RI "\fIReturns the count of values'\&. \fP" .ti -1c .RI "static bool \fBGetValue\fP (size_t index, std::string &rVal)" .br .RI "\fIExtracts a value'\&. \fP" .ti -1c .RI "static void \fBDump\fP ()" .br .RI "\fIDumps information about options and value to STDERR'\&. \fP" .in -1c .SS "Static Protected Member Functions" .in +1c .ti -1c .RI "static bool \fBIsOption\fP (const char *pchStr)" .br .RI "\fIChecks whether a string is an option'\&. \fP" .ti -1c .RI "static bool \fBIsLongOption\fP (const char *pchStr)" .br .RI "\fIChecks whether a string is a long option'\&. \fP" .ti -1c .RI "static bool \fBParseLong\fP (const char *pchStr, std::string &rName, std::string &rVal, bool &rfHasVal)" .br .RI "\fIParses a string and attempts to treat it as a long option'\&. \fP" .ti -1c .RI "static void \fBParseShort\fP (const char *pchStr, char &rcName, std::string &rVal, bool &rfHasVal)" .br .RI "\fIParses a string and attempts to treat it as a short option'\&. \fP" .ti -1c .RI "static void \fBDumpOption\fP (const std::string &rName, char cShort, \fBAppArgOption_t\fP *pOpt)" .br .RI "\fIDumps an option to STDERR'\&. \fP" .in -1c .SH "Detailed Description" .PP Application arguments'\&. This class is set-up for processing command line arguments'\&. Then it parses these arguments and builds data which can be queried later'\&. .PP There are two categories of arguments: .PD 0 .IP "\(bu" 2 options (a'\&.k'\&.a'\&. switches) .IP "\(bu" 2 values .PP Options represent changeable parameters of the application'\&. Values are a kind of input data'\&. .PP Each option has one of the following types: .PD 0 .IP "\(bu" 2 no value (two-state logic, e'\&.g'\&. running on foreground/background) .IP "\(bu" 2 optional value (e'\&.g'\&. for logging: another file than default can be specified) .IP "\(bu" 2 mandatory value (e'\&.g'\&. custom configuration file) .PP Each option always have two forms - long one (introcuded by two hyphens, e'\&.g'\&. --edit) and short one (introduced by one hyphen, e'\&.g'\&. -e)'\&. These forms are functionally equivalent'\&. .PP Unknown options are silently ignored'\&. .SH "Member Function Documentation" .PP .SS "bool AppArgs::AddOption (const std::string &rName, charcShort, \fBAppArgType_t\fPtype, boolfMandatory)\fC [static]\fP" .PP Adds an option'\&. This method is intended to be called between initilization and parsing'\&. It adds an option which may (or must) occur inside the argument vector'\&. .PP \fBParameters:\fP .RS 4 \fIrName\fP long option name .br \fIcShort\fP short (one-character) option name .br \fItype\fP argument type .br \fIfMandatory\fP option is mandatory yes/no .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure (e'\&.g'\&. option already exists) .RE .PP .SS "void AppArgs::Destroy ()\fC [static]\fP" .PP Releases resources allocated by the processor'\&. This method should be called if the argument values are no longer needed'\&. .SS "void AppArgs::Dump ()\fC [static]\fP" .PP Dumps information about options and value to STDERR'\&. \fBAttention:\fP .RS 4 This method may be very slow'\&. .RE .PP .SS "void AppArgs::DumpOption (const std::string &rName, charcShort, \fBAppArgOption_t\fP *pOpt)\fC [static, protected]\fP" .PP Dumps an option to STDERR'\&. \fBParameters:\fP .RS 4 \fIrName\fP long option name .br \fIcShort\fP short option name .br \fIpOpt\fP option data .RE .PP .SS "bool AppArgs::ExistsOption (const std::string &rArg)\fC [static]\fP" .PP Checks whether an option exists'\&. \fBParameters:\fP .RS 4 \fIrArg\fP long option name .RE .PP \fBReturns:\fP .RS 4 true = option exists, false = otherwise .RE .PP .SS "bool AppArgs::GetOption (const std::string &rArg, std::string &rVal)\fC [static]\fP" .PP Extracts an option value'\&. \fBParameters:\fP .RS 4 \fIrArg\fP long option name .br \fIrVal\fP option value .RE .PP \fBReturns:\fP .RS 4 true = value extracted, false = option not found or has no value .RE .PP .SS "bool AppArgs::GetValue (size_tindex, std::string &rVal)\fC [static]\fP" .PP Extracts a value'\&. \fBParameters:\fP .RS 4 \fIindex\fP value index .br \fIrVal\fP extracted value .RE .PP \fBReturns:\fP .RS 4 true = value extracted, false = otherwise .RE .PP .SS "size_t AppArgs::GetValueCount ()\fC [static]\fP" .PP Returns the count of values'\&. \fBReturns:\fP .RS 4 count of values .RE .PP .SS "void AppArgs::Init (size_tvalMinCnt = \fC0\fP, size_tvalMaxCnt = \fCAPPARGS_NOLIMIT\fP)\fC [static]\fP" .PP Initializes the processor'\&. \fBParameters:\fP .RS 4 \fIvalMinCnt\fP minimum count of values .br \fIvalMaxCnt\fP maximum number of values (no effect if lower than valMinCnt) .RE .PP .SS "bool AppArgs::IsLongOption (const char *pchStr)\fC [static, protected]\fP" .PP Checks whether a string is a long option'\&. This methos assumes the string is an option (if not the behavior is undefined)'\&. .PP \fBParameters:\fP .RS 4 \fIpchStr\fP text string .RE .PP \fBReturns:\fP .RS 4 true = option, false = otherwise .RE .PP .SS "bool AppArgs::IsOption (const char *pchStr)\fC [static, protected]\fP" .PP Checks whether a string is an option'\&. \fBParameters:\fP .RS 4 \fIpchStr\fP text string .RE .PP \fBReturns:\fP .RS 4 true = option, false = otherwise .RE .PP .SS "bool AppArgs::IsValid ()\fC [static]\fP" .PP Checks whether the arguments have valid form'\&. Arguments are valid if: .PD 0 .IP "\(bu" 2 all mandatory options are present .IP "\(bu" 2 all options with mandatory values have their values .IP "\(bu" 2 value count is between its minimum and maximum .IP "\(bu" 2 there are no unknown options (if unknown options are not accepted) .PP \fBReturns:\fP .RS 4 true = arguments valid, false = otherwise .RE .PP .SS "void AppArgs::Parse (intargc, const char *const *argv)\fC [static]\fP" .PP Parses arguments and builds the appropriate structure'\&. \fBParameters:\fP .RS 4 \fIargc\fP argument count .br \fIargv\fP argument vector .RE .PP \fBAttention:\fP .RS 4 All errors are silently ignored'\&. .RE .PP .SS "bool AppArgs::ParseLong (const char *pchStr, std::string &rName, std::string &rVal, bool &rfHasVal)\fC [static, protected]\fP" .PP Parses a string and attempts to treat it as a long option'\&. \fBParameters:\fP .RS 4 \fIpchStr\fP text string .br \fIrName\fP option name .br \fIrVal\fP value string .br \fIrfHasVal\fP option has value yes/no .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SS "void AppArgs::ParseShort (const char *pchStr, char &rcName, std::string &rVal, bool &rfHasVal)\fC [static, protected]\fP" .PP Parses a string and attempts to treat it as a short option'\&. \fBParameters:\fP .RS 4 \fIpchStr\fP text string .br \fIrcName\fP option name .br \fIrVal\fP value string .br \fIrfHasVal\fP option has value yes/no .RE .PP \fBAttention:\fP .RS 4 This method assumes the string is a valid short option'\&. .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/ProcData_t.30000644000175000001440000000140011737665757016104 0ustar lukusers.TH "ProcData_t" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME ProcData_t \- .PP Child process data'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Attributes" .in +1c .ti -1c .RI "\fBproc_done_cb\fP \fBonDone\fP" .br .RI "\fIfunction called after process finishes \fP" .ti -1c .RI "\fBInotifyWatch\fP * \fBpWatch\fP" .br .RI "\fIrelated watch \fP" .in -1c .SH "Detailed Description" .PP Child process data'\&. .SH "Member Data Documentation" .PP .SS "\fBproc_done_cb\fP \fBProcData_t::onDone\fP" .PP function called after process finishes .SS "\fBInotifyWatch\fP* \fBProcData_t::pWatch\fP" .PP related watch .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/strtok.cpp.30000644000175000001440000000167311737665757016207 0ustar lukusers.TH "strtok.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME strtok.cpp \- .PP string tokenizer implementation .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include 'strtok\&.h'\fP .br .SH "Detailed Description" .PP string tokenizer implementation string tokenizer .PP Copyright (C) 2006, 2007, 2008 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/incrontab.h.30000644000175000001440000000157711737665757016310 0ustar lukusers.TH "incrontab.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME incrontab.h \- .PP inotify cron table manipulator classes header .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include 'strtok\&.h'\fP .br .SS "Classes" .in +1c .ti -1c .RI "class \fBIncronTabEntry\fP" .br .RI "\fIIncron table entry class'\&. \fP" .ti -1c .RI "class \fBIncronTab\fP" .br .RI "\fIIncron table class'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify cron table manipulator classes header inotify cron system .PP Copyright (C) 2006, 2007, 2008 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/appinst.cpp.30000644000175000001440000000270211737665757016331 0ustar lukusers.TH "appinst.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME appinst.cpp \- .PP Application instance class implementation'\&. .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'appinst\&.h'\fP .br .SS "Defines" .in +1c .ti -1c .RI "#define \fBAPPLOCK_PERM\fP (S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)" .br .RI "\fILockfile permissions (currently 0644) \fP" .in -1c .SH "Detailed Description" .PP Application instance class implementation'\&. Copyright (C) 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .PP Credits: Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Define Documentation" .PP .SS "#define APPLOCK_PERM (S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)" .PP Lockfile permissions (currently 0644) .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/incrontab.cpp.30000644000175000001440000000161211737665757016631 0ustar lukusers.TH "incrontab.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME incrontab.cpp \- .PP inotify cron table manipulator classes implementation .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'inotify-cxx\&.h'\fP .br \fC#include 'incrontab\&.h'\fP .br \fC#include 'incroncfg\&.h'\fP .br .SH "Detailed Description" .PP inotify cron table manipulator classes implementation inotify cron system .PP Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .PP Credits: Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/InotifyEvent.30000644000175000001440000001235311737665757016520 0ustar lukusers.TH "InotifyEvent" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME InotifyEvent \- .PP inotify event class .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBInotifyEvent\fP ()" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fBInotifyEvent\fP (const struct inotify_event *pEvt, \fBInotifyWatch\fP *pWatch)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~InotifyEvent\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "int32_t \fBGetDescriptor\fP () const " .br .RI "\fIReturns the event watch descriptor'\&. \fP" .ti -1c .RI "uint32_t \fBGetMask\fP () const " .br .RI "\fIReturns the event mask'\&. \fP" .ti -1c .RI "bool \fBIsType\fP (uint32_t uType) const " .br .RI "\fIChecks for the event type'\&. \fP" .ti -1c .RI "uint32_t \fBGetCookie\fP () const " .br .RI "\fIReturns the event cookie'\&. \fP" .ti -1c .RI "uint32_t \fBGetLength\fP () const " .br .RI "\fIReturns the event name length'\&. \fP" .ti -1c .RI "const std::string & \fBGetName\fP () const " .br .RI "\fIReturns the event name'\&. \fP" .ti -1c .RI "void \fBGetName\fP (std::string &rName) const " .br .RI "\fIExtracts the event name'\&. \fP" .ti -1c .RI "\fBInotifyWatch\fP * \fBGetWatch\fP ()" .br .RI "\fIReturns the source watch'\&. \fP" .ti -1c .RI "void \fBDumpTypes\fP (std::string &rStr) const " .br .RI "\fIFills the string with all types contained in the event mask'\&. \fP" .in -1c .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static bool \fBIsType\fP (uint32_t uValue, uint32_t uType)" .br .RI "\fIChecks a value for the event type'\&. \fP" .ti -1c .RI "static uint32_t \fBGetMaskByName\fP (const std::string &rName)" .br .RI "\fIFinds the appropriate mask for a name'\&. \fP" .ti -1c .RI "static void \fBDumpTypes\fP (uint32_t uValue, std::string &rStr)" .br .RI "\fIFills the string with all types contained in an event mask value'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify event class It holds all information about inotify event and provides access to its particular values'\&. .PP This class is not (and is not intended to be) thread-safe and therefore it must not be used concurrently in multiple threads'\&. .SH "Constructor & Destructor Documentation" .PP .SS "InotifyEvent::InotifyEvent ()\fC [inline]\fP" .PP Constructor'\&. Creates a plain event'\&. .SS "InotifyEvent::InotifyEvent (const struct inotify_event *pEvt, \fBInotifyWatch\fP *pWatch)\fC [inline]\fP" .PP Constructor'\&. Creates an event based on inotify event data'\&. For NULL pointers it works the same way as \fBInotifyEvent()\fP'\&. .PP \fBParameters:\fP .RS 4 \fIpEvt\fP event data .br \fIpWatch\fP inotify watch .RE .PP .SS "InotifyEvent::~InotifyEvent ()\fC [inline]\fP" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "void InotifyEvent::DumpTypes (uint32_tuValue, std::string &rStr)\fC [static]\fP" .PP Fills the string with all types contained in an event mask value'\&. \fBParameters:\fP .RS 4 \fIuValue\fP event mask value .br \fIrStr\fP dumped event types .RE .PP .SS "void InotifyEvent::DumpTypes (std::string &rStr) const" .PP Fills the string with all types contained in the event mask'\&. \fBParameters:\fP .RS 4 \fIrStr\fP dumped event types .RE .PP .SS "uint32_t InotifyEvent::GetCookie () const\fC [inline]\fP" .PP Returns the event cookie'\&. \fBReturns:\fP .RS 4 event cookie .RE .PP .SS "int32_t InotifyEvent::GetDescriptor () const" .PP Returns the event watch descriptor'\&. \fBReturns:\fP .RS 4 watch descriptor .RE .PP \fBSee also:\fP .RS 4 \fBInotifyWatch::GetDescriptor()\fP .RE .PP .SS "uint32_t InotifyEvent::GetLength () const\fC [inline]\fP" .PP Returns the event name length'\&. \fBReturns:\fP .RS 4 event name length .RE .PP .SS "uint32_t InotifyEvent::GetMask () const\fC [inline]\fP" .PP Returns the event mask'\&. \fBReturns:\fP .RS 4 event mask .RE .PP \fBSee also:\fP .RS 4 \fBInotifyWatch::GetMask()\fP .RE .PP .SS "uint32_t InotifyEvent::GetMaskByName (const std::string &rName)\fC [static]\fP" .PP Finds the appropriate mask for a name'\&. \fBParameters:\fP .RS 4 \fIrName\fP mask name .RE .PP \fBReturns:\fP .RS 4 mask for name; 0 on failure .RE .PP .SS "const std::string& InotifyEvent::GetName () const\fC [inline]\fP" .PP Returns the event name'\&. \fBReturns:\fP .RS 4 event name .RE .PP .SS "void InotifyEvent::GetName (std::string &rName) const\fC [inline]\fP" .PP Extracts the event name'\&. \fBParameters:\fP .RS 4 \fIrName\fP event name .RE .PP .SS "\fBInotifyWatch\fP* InotifyEvent::GetWatch ()\fC [inline]\fP" .PP Returns the source watch'\&. \fBReturns:\fP .RS 4 source watch .RE .PP .SS "static bool InotifyEvent::IsType (uint32_tuValue, uint32_tuType)\fC [inline, static]\fP" .PP Checks a value for the event type'\&. \fBParameters:\fP .RS 4 \fIuValue\fP checked value .br \fIuType\fP type which is checked for .RE .PP \fBReturns:\fP .RS 4 true = the value contains the given type, false = otherwise .RE .PP .SS "bool InotifyEvent::IsType (uint32_tuType) const\fC [inline]\fP" .PP Checks for the event type'\&. \fBParameters:\fP .RS 4 \fIuType\fP type which is checked for .RE .PP \fBReturns:\fP .RS 4 true = event mask contains the given type, false = otherwise .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/ict-main.cpp.30000644000175000001440000001311211737665757016351 0ustar lukusers.TH "ict-main.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME ict-main.cpp \- .PP inotify cron table manipulator main file .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'inotify-cxx\&.h'\fP .br \fC#include 'appargs\&.h'\fP .br \fC#include 'incron\&.h'\fP .br \fC#include 'incrontab\&.h'\fP .br \fC#include 'incroncfg\&.h'\fP .br .SS "Defines" .in +1c .ti -1c .RI "#define \fBINCRON_ALT_EDITOR\fP '/etc/alternatives/editor'" .br .RI "\fIAlternative editor'\&. \fP" .ti -1c .RI "#define \fBINCRON_DEFAULT_EDITOR\fP 'vim'" .br .RI "\fIDefault (hard-wired) editor'\&. \fP" .ti -1c .RI "#define \fBINCRONTAB_VERSION\fP INCRONTAB_NAME ' ' INCRON_VERSION" .br .RI "\fIincrontab version string \fP" .ti -1c .RI "#define \fBINCRONTAB_DESCRIPTION\fP" .br .RI "\fIincrontab description string \fP" .ti -1c .RI "#define \fBINCRONTAB_HELP\fP" .br .RI "\fIincrontab help string \fP" .in -1c .SS "Functions" .in +1c .ti -1c .RI "bool \fBcopy_from_file\fP (const std::string &rPath, const std::string &rUser)" .br .RI "\fICopies a file to an user table'\&. \fP" .ti -1c .RI "bool \fBremove_table\fP (const std::string &rUser)" .br .RI "\fIRemoves an user table'\&. \fP" .ti -1c .RI "bool \fBlist_table\fP (const std::string &rUser)" .br .RI "\fILists an user table'\&. \fP" .ti -1c .RI "bool \fBedit_table\fP (const std::string &rUser)" .br .RI "\fIAllows to edit an user table'\&. \fP" .ti -1c .RI "void \fBlist_types\fP ()" .br .RI "\fIPrints the list of all available inotify event types'\&. \fP" .ti -1c .RI "bool \fBreload_table\fP (const std::string &rUser)" .br .RI "\fIReloads an user table'\&. \fP" .ti -1c .RI "int \fBmain\fP (int argc, char **argv)" .br .in -1c .SH "Detailed Description" .PP inotify cron table manipulator main file inotify cron system .PP Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .PP Credits: kolter (fix for segfaulting on --user) Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Define Documentation" .PP .SS "#define INCRON_ALT_EDITOR '/etc/alternatives/editor'" .PP Alternative editor'\&. .SS "#define INCRON_DEFAULT_EDITOR 'vim'" .PP Default (hard-wired) editor'\&. .SS "#define INCRONTAB_DESCRIPTION"\fBValue:\fP .PP .nf 'incrontab - inotify cron table manipulator\n' \ '(c) Lukas Jelinek, 2006, 2007, 208' .fi .PP incrontab description string .SS "#define INCRONTAB_HELP"\fBValue:\fP .PP .nf INCRONTAB_DESCRIPTION '\n\n' \ 'usage: incrontab [] \n' \ ' incrontab [] \n\n' \ ' may be one of the following:\n' \ ' -?, --about gives short information about program\n' \ ' -h, --help prints this help text\n' \ ' -l, --list lists user table\n' \ ' -r, --remove removes user table\n' \ ' -e, --edit provides editing user table\n' \ ' -t, --types list supported event types\n' \ ' -d, --reload request incrond to reload user table\n' \ ' -V, --version prints program version\n\n' \ '\n' \ 'These options may be used:\n' \ ' -u , --user= overrides current user (requires root privileges)\n' \ ' -f , --config= overrides default configuration file (requires root privileges)\n\n' \ 'For reporting bugs please use http://bts\&.aiken\&.cz\n' .fi .PP incrontab help string .SS "#define INCRONTAB_VERSION INCRONTAB_NAME ' ' INCRON_VERSION" .PP incrontab version string .SH "Function Documentation" .PP .SS "bool copy_from_file (const std::string &rPath, const std::string &rUser)" .PP Copies a file to an user table'\&. \fBParameters:\fP .RS 4 \fIrPath\fP path to file .br \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SS "bool edit_table (const std::string &rUser)" .PP Allows to edit an user table'\&. \fBParameters:\fP .RS 4 \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP \fBAttention:\fP .RS 4 This function is very complex and may contain various bugs including security ones'\&. Please keep it in mind'\&.'\&. .RE .PP .SS "bool list_table (const std::string &rUser)" .PP Lists an user table'\&. \fBParameters:\fP .RS 4 \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SS "void list_types ()" .PP Prints the list of all available inotify event types'\&. .SS "int main (intargc, char **argv)" .SS "bool reload_table (const std::string &rUser)" .PP Reloads an user table'\&. \fBParameters:\fP .RS 4 \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = success, false = otherwise .RE .PP .SS "bool remove_table (const std::string &rUser)" .PP Removes an user table'\&. \fBParameters:\fP .RS 4 \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/EventDispatcher.30000644000175000001440000000533611737665757017170 0ustar lukusers.TH "EventDispatcher" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME EventDispatcher \- .PP Event dispatcher class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBEventDispatcher\fP (int iPipeFd, \fBInotify\fP *pIn, \fBInotifyWatch\fP *pSys, \fBInotifyWatch\fP *pUser)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~EventDispatcher\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "bool \fBProcessEvents\fP ()" .br .RI "\fIProcesses events'\&. \fP" .ti -1c .RI "void \fBRegister\fP (\fBUserTable\fP *pTab)" .br .RI "\fIRegisters an user table'\&. \fP" .ti -1c .RI "void \fBUnregister\fP (\fBUserTable\fP *pTab)" .br .RI "\fIUnregisters an user table'\&. \fP" .ti -1c .RI "size_t \fBGetSize\fP () const " .br .RI "\fIReturns the poll data size'\&. \fP" .ti -1c .RI "struct pollfd * \fBGetPollData\fP ()" .br .RI "\fIReturns the poll data'\&. \fP" .ti -1c .RI "void \fBRebuild\fP ()" .br .RI "\fIRebuilds the poll array data'\&. \fP" .ti -1c .RI "void \fBClear\fP ()" .br .RI "\fIRemoves all registered user tables'\&. \fP" .in -1c .SH "Detailed Description" .PP Event dispatcher class'\&. This class processes events and distributes them as needed'\&. .SH "Constructor & Destructor Documentation" .PP .SS "EventDispatcher::EventDispatcher (intiPipeFd, \fBInotify\fP *pIn, \fBInotifyWatch\fP *pSys, \fBInotifyWatch\fP *pUser)" .PP Constructor'\&. \fBParameters:\fP .RS 4 \fIiPipeFd\fP pipe descriptor .br \fIpIn\fP inotify object for table management .br \fIpSys\fP watch for system tables .br \fIpUser\fP watch for user tables .RE .PP .SS "EventDispatcher::~EventDispatcher ()" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "void EventDispatcher::Clear ()\fC [inline]\fP" .PP Removes all registered user tables'\&. It doesn't cause poll data rebuilding'\&. .SS "struct pollfd* EventDispatcher::GetPollData ()\fC [inline, read]\fP" .PP Returns the poll data'\&. \fBReturns:\fP .RS 4 poll data .RE .PP .SS "size_t EventDispatcher::GetSize () const\fC [inline]\fP" .PP Returns the poll data size'\&. \fBReturns:\fP .RS 4 poll data size .RE .PP .SS "bool EventDispatcher::ProcessEvents ()" .PP Processes events'\&. \fBReturns:\fP .RS 4 pipe event occurred yes/no .RE .PP .SS "void EventDispatcher::Rebuild ()" .PP Rebuilds the poll array data'\&. .SS "void EventDispatcher::Register (\fBUserTable\fP *pTab)" .PP Registers an user table'\&. \fBParameters:\fP .RS 4 \fIpTab\fP user table .RE .PP .SS "void EventDispatcher::Unregister (\fBUserTable\fP *pTab)" .PP Unregisters an user table'\&. \fBParameters:\fP .RS 4 \fIpTab\fP user table .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/strtok.h.30000644000175000001440000000225711737665757015653 0ustar lukusers.TH "strtok.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME strtok.h \- .PP string tokenizer header .SH SYNOPSIS .br .PP \fC#include \fP .br .SS "Classes" .in +1c .ti -1c .RI "class \fBStringTokenizer\fP" .br .RI "\fISimple string tokenizer class'\&. \fP" .in -1c .SS "Typedefs" .in +1c .ti -1c .RI "typedef std::string::size_type \fBSIZE\fP" .br .in -1c .SH "Detailed Description" .PP string tokenizer header string tokenizer .PP Copyright (C) 2006, 2007, 2008 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .SH "Typedef Documentation" .PP .SS "typedef std::string::size_type \fBSIZE\fP" .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/Inotify.30000644000175000001440000003570711737665757015526 0ustar lukusers.TH "Inotify" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME Inotify \- .PP inotify class .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBInotify\fP () throw (InotifyException)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~Inotify\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "void \fBClose\fP ()" .br .RI "\fIRemoves all watches and closes the inotify device'\&. \fP" .ti -1c .RI "void \fBAdd\fP (\fBInotifyWatch\fP *pWatch) throw (InotifyException)" .br .RI "\fIAdds a new watch'\&. \fP" .ti -1c .RI "void \fBAdd\fP (\fBInotifyWatch\fP &rWatch) throw (InotifyException)" .br .RI "\fIAdds a new watch'\&. \fP" .ti -1c .RI "void \fBRemove\fP (\fBInotifyWatch\fP *pWatch) throw (InotifyException)" .br .RI "\fIRemoves a watch'\&. \fP" .ti -1c .RI "void \fBRemove\fP (\fBInotifyWatch\fP &rWatch) throw (InotifyException)" .br .RI "\fIRemoves a watch'\&. \fP" .ti -1c .RI "void \fBRemoveAll\fP ()" .br .RI "\fIRemoves all watches'\&. \fP" .ti -1c .RI "size_t \fBGetWatchCount\fP () const " .br .RI "\fIReturns the count of watches'\&. \fP" .ti -1c .RI "size_t \fBGetEnabledCount\fP () const " .br .RI "\fIReturns the count of enabled watches'\&. \fP" .ti -1c .RI "void \fBWaitForEvents\fP (bool fNoIntr=false) throw (InotifyException)" .br .RI "\fIWaits for inotify events'\&. \fP" .ti -1c .RI "size_t \fBGetEventCount\fP ()" .br .RI "\fIReturns the count of received and queued events'\&. \fP" .ti -1c .RI "bool \fBGetEvent\fP (\fBInotifyEvent\fP *pEvt) throw (InotifyException)" .br .RI "\fIExtracts a queued inotify event'\&. \fP" .ti -1c .RI "bool \fBGetEvent\fP (\fBInotifyEvent\fP &rEvt) throw (InotifyException)" .br .RI "\fIExtracts a queued inotify event'\&. \fP" .ti -1c .RI "bool \fBPeekEvent\fP (\fBInotifyEvent\fP *pEvt) throw (InotifyException)" .br .RI "\fIExtracts a queued inotify event (without removing)'\&. \fP" .ti -1c .RI "bool \fBPeekEvent\fP (\fBInotifyEvent\fP &rEvt) throw (InotifyException)" .br .RI "\fIExtracts a queued inotify event (without removing)'\&. \fP" .ti -1c .RI "\fBInotifyWatch\fP * \fBFindWatch\fP (int iDescriptor)" .br .RI "\fISearches for a watch by a watch descriptor'\&. \fP" .ti -1c .RI "\fBInotifyWatch\fP * \fBFindWatch\fP (const std::string &rPath)" .br .RI "\fISearches for a watch by a filesystem path'\&. \fP" .ti -1c .RI "int \fBGetDescriptor\fP () const " .br .RI "\fIReturns the file descriptor'\&. \fP" .ti -1c .RI "void \fBSetNonBlock\fP (bool fNonBlock) throw (InotifyException)" .br .RI "\fIEnables/disables non-blocking mode'\&. \fP" .ti -1c .RI "void \fBSetCloseOnExec\fP (bool fClOnEx) throw (InotifyException)" .br .RI "\fIEnables/disables closing on exec'\&. \fP" .in -1c .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static uint32_t \fBGetCapability\fP (\fBInotifyCapability_t\fP cap) throw (InotifyException)" .br .RI "\fIAcquires a particular inotify capability/limit'\&. \fP" .ti -1c .RI "static void \fBSetCapability\fP (\fBInotifyCapability_t\fP cap, uint32_t val) throw (InotifyException)" .br .RI "\fIModifies a particular inotify capability/limit'\&. \fP" .ti -1c .RI "static uint32_t \fBGetMaxEvents\fP () throw (InotifyException)" .br .RI "\fIReturns the maximum number of events in the kernel queue'\&. \fP" .ti -1c .RI "static void \fBSetMaxEvents\fP (uint32_t val) throw (InotifyException)" .br .RI "\fISets the maximum number of events in the kernel queue'\&. \fP" .ti -1c .RI "static uint32_t \fBGetMaxInstances\fP () throw (InotifyException)" .br .RI "\fIReturns the maximum number of inotify instances per process'\&. \fP" .ti -1c .RI "static void \fBSetMaxInstances\fP (uint32_t val) throw (InotifyException)" .br .RI "\fISets the maximum number of inotify instances per process'\&. \fP" .ti -1c .RI "static uint32_t \fBGetMaxWatches\fP () throw (InotifyException)" .br .RI "\fIReturns the maximum number of inotify watches per instance'\&. \fP" .ti -1c .RI "static void \fBSetMaxWatches\fP (uint32_t val) throw (InotifyException)" .br .RI "\fISets the maximum number of inotify watches per instance'\&. \fP" .in -1c .SS "Friends" .in +1c .ti -1c .RI "class \fBInotifyWatch\fP" .br .in -1c .SH "Detailed Description" .PP inotify class It holds information about the inotify device descriptor and manages the event queue'\&. .PP If the INOTIFY_THREAD_SAFE is defined this class is thread-safe'\&. .SH "Constructor & Destructor Documentation" .PP .SS "Inotify::Inotify () throw (\fBInotifyException\fP)" .PP Constructor'\&. Creates and initializes an instance of inotify communication object (opens the inotify device)'\&. .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if inotify isn't available .RE .PP .SS "Inotify::~Inotify ()" .PP Destructor'\&. Calls \fBClose()\fP due to clean-up'\&. .SH "Member Function Documentation" .PP .SS "void Inotify::Add (\fBInotifyWatch\fP *pWatch) throw (\fBInotifyException\fP)" .PP Adds a new watch'\&. \fBParameters:\fP .RS 4 \fIpWatch\fP inotify watch .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if adding failed .RE .PP .SS "void Inotify::Add (\fBInotifyWatch\fP &rWatch) throw (\fBInotifyException\fP)\fC [inline]\fP" .PP Adds a new watch'\&. \fBParameters:\fP .RS 4 \fIrWatch\fP inotify watch .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if adding failed .RE .PP .SS "void Inotify::Close ()" .PP Removes all watches and closes the inotify device'\&. .SS "\fBInotifyWatch\fP * Inotify::FindWatch (intiDescriptor)" .PP Searches for a watch by a watch descriptor'\&. It tries to find a watch by the given descriptor'\&. .PP \fBParameters:\fP .RS 4 \fIiDescriptor\fP watch descriptor .RE .PP \fBReturns:\fP .RS 4 pointer to a watch; NULL if no such watch exists .RE .PP .SS "\fBInotifyWatch\fP * Inotify::FindWatch (const std::string &rPath)" .PP Searches for a watch by a filesystem path'\&. It tries to find a watch by the given filesystem path'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP filesystem path .RE .PP \fBReturns:\fP .RS 4 pointer to a watch; NULL if no such watch exists .RE .PP \fBAttention:\fP .RS 4 The path must be exactly identical to the one used for the searched watch'\&. Be careful about absolute/relative and case-insensitive paths'\&. .RE .PP .SS "uint32_t Inotify::GetCapability (\fBInotifyCapability_t\fPcap) throw (\fBInotifyException\fP)\fC [static]\fP" .PP Acquires a particular inotify capability/limit'\&. \fBParameters:\fP .RS 4 \fIcap\fP capability/limit identifier .RE .PP \fBReturns:\fP .RS 4 capability/limit value .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be acquired .RE .PP .SS "int Inotify::GetDescriptor () const\fC [inline]\fP" .PP Returns the file descriptor'\&. The descriptor can be used in standard low-level file functions (poll(), select(), fcntl() etc'\&.)'\&. .PP \fBReturns:\fP .RS 4 valid file descriptor or -1 for inactive object .RE .PP \fBSee also:\fP .RS 4 \fBSetNonBlock()\fP .RE .PP .SS "size_t Inotify::GetEnabledCount () const\fC [inline]\fP" .PP Returns the count of enabled watches'\&. \fBReturns:\fP .RS 4 count of enabled watches .RE .PP \fBSee also:\fP .RS 4 \fBGetWatchCount()\fP .RE .PP .SS "bool Inotify::GetEvent (\fBInotifyEvent\fP *pEvt) throw (\fBInotifyException\fP)" .PP Extracts a queued inotify event'\&. The extracted event is removed from the queue'\&. If the pointer is NULL it does nothing'\&. .PP \fBParameters:\fP .RS 4 \fIpEvt\fP event object .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the provided pointer is NULL .RE .PP .SS "bool Inotify::GetEvent (\fBInotifyEvent\fP &rEvt) throw (\fBInotifyException\fP)\fC [inline]\fP" .PP Extracts a queued inotify event'\&. The extracted event is removed from the queue'\&. .PP \fBParameters:\fP .RS 4 \fIrEvt\fP event object .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown only in very anomalous cases .RE .PP .SS "size_t Inotify::GetEventCount ()\fC [inline]\fP" .PP Returns the count of received and queued events'\&. This number is related to the events in the queue inside this object, not to the events pending in the kernel'\&. .PP \fBReturns:\fP .RS 4 count of events .RE .PP .SS "static uint32_t Inotify::GetMaxEvents () throw (\fBInotifyException\fP)\fC [inline, static]\fP" .PP Returns the maximum number of events in the kernel queue'\&. \fBReturns:\fP .RS 4 maximum number of events in the kernel queue .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be acquired .RE .PP .SS "static uint32_t Inotify::GetMaxInstances () throw (\fBInotifyException\fP)\fC [inline, static]\fP" .PP Returns the maximum number of inotify instances per process'\&. It means the maximum number of open inotify file descriptors per running process'\&. .PP \fBReturns:\fP .RS 4 maximum number of inotify instances .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be acquired .RE .PP .SS "static uint32_t Inotify::GetMaxWatches () throw (\fBInotifyException\fP)\fC [inline, static]\fP" .PP Returns the maximum number of inotify watches per instance'\&. It means the maximum number of inotify watches per inotify file descriptor'\&. .PP \fBReturns:\fP .RS 4 maximum number of inotify watches .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be acquired .RE .PP .SS "size_t Inotify::GetWatchCount () const\fC [inline]\fP" .PP Returns the count of watches'\&. This is the total count of all watches (regardless whether enabled or not)'\&. .PP \fBReturns:\fP .RS 4 count of watches .RE .PP \fBSee also:\fP .RS 4 \fBGetEnabledCount()\fP .RE .PP .SS "bool Inotify::PeekEvent (\fBInotifyEvent\fP *pEvt) throw (\fBInotifyException\fP)" .PP Extracts a queued inotify event (without removing)'\&. The extracted event stays in the queue'\&. If the pointer is NULL it does nothing'\&. .PP \fBParameters:\fP .RS 4 \fIpEvt\fP event object .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the provided pointer is NULL .RE .PP .SS "bool Inotify::PeekEvent (\fBInotifyEvent\fP &rEvt) throw (\fBInotifyException\fP)\fC [inline]\fP" .PP Extracts a queued inotify event (without removing)'\&. The extracted event stays in the queue'\&. .PP \fBParameters:\fP .RS 4 \fIrEvt\fP event object .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown only in very anomalous cases .RE .PP .SS "void Inotify::Remove (\fBInotifyWatch\fP *pWatch) throw (\fBInotifyException\fP)" .PP Removes a watch'\&. If the given watch is not present it does nothing'\&. .PP \fBParameters:\fP .RS 4 \fIpWatch\fP inotify watch .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if removing failed .RE .PP .SS "void Inotify::Remove (\fBInotifyWatch\fP &rWatch) throw (\fBInotifyException\fP)\fC [inline]\fP" .PP Removes a watch'\&. If the given watch is not present it does nothing'\&. .PP \fBParameters:\fP .RS 4 \fIrWatch\fP inotify watch .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if removing failed .RE .PP .SS "void Inotify::RemoveAll ()" .PP Removes all watches'\&. .SS "void Inotify::SetCapability (\fBInotifyCapability_t\fPcap, uint32_tval) throw (\fBInotifyException\fP)\fC [static]\fP" .PP Modifies a particular inotify capability/limit'\&. \fBParameters:\fP .RS 4 \fIcap\fP capability/limit identifier .br \fIval\fP new capability/limit value .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be set .RE .PP \fBAttention:\fP .RS 4 Using this function requires root privileges'\&. Beware of setting extensive values - it may seriously affect system performance and/or stability'\&. .RE .PP .SS "void Inotify::SetCloseOnExec (boolfClOnEx) throw (\fBInotifyException\fP)" .PP Enables/disables closing on exec'\&. Enable this if you want to close the descriptor when executing another program'\&. Otherwise, the descriptor will be inherited'\&. .PP Closing on exec is disabled by default'\&. .PP \fBParameters:\fP .RS 4 \fIfClOnEx\fP enable/disable closing on exec .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if setting failed .RE .PP \fBSee also:\fP .RS 4 \fBGetDescriptor()\fP, \fBSetNonBlock()\fP .RE .PP .SS "static void Inotify::SetMaxEvents (uint32_tval) throw (\fBInotifyException\fP)\fC [inline, static]\fP" .PP Sets the maximum number of events in the kernel queue'\&. \fBParameters:\fP .RS 4 \fIval\fP new value .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be set .RE .PP \fBAttention:\fP .RS 4 Using this function requires root privileges'\&. Beware of setting extensive values - the greater value is set here the more physical memory may be used for the inotify infrastructure'\&. .RE .PP .SS "static void Inotify::SetMaxInstances (uint32_tval) throw (\fBInotifyException\fP)\fC [inline, static]\fP" .PP Sets the maximum number of inotify instances per process'\&. \fBParameters:\fP .RS 4 \fIval\fP new value .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be set .RE .PP \fBAttention:\fP .RS 4 Using this function requires root privileges'\&. Beware of setting extensive values - the greater value is set here the more physical memory may be used for the inotify infrastructure'\&. .RE .PP .SS "static void Inotify::SetMaxWatches (uint32_tval) throw (\fBInotifyException\fP)\fC [inline, static]\fP" .PP Sets the maximum number of inotify watches per instance'\&. \fBParameters:\fP .RS 4 \fIval\fP new value .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if the given value cannot be set .RE .PP \fBAttention:\fP .RS 4 Using this function requires root privileges'\&. Beware of setting extensive values - the greater value is set here the more physical memory may be used for the inotify infrastructure'\&. .RE .PP .SS "void Inotify::SetNonBlock (boolfNonBlock) throw (\fBInotifyException\fP)" .PP Enables/disables non-blocking mode'\&. Use this mode if you want to monitor the descriptor (acquired thru \fBGetDescriptor()\fP) in functions such as poll(), select() etc'\&. .PP Non-blocking mode is disabled by default'\&. .PP \fBParameters:\fP .RS 4 \fIfNonBlock\fP enable/disable non-blocking mode .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if setting mode failed .RE .PP \fBSee also:\fP .RS 4 \fBGetDescriptor()\fP, \fBSetCloseOnExec()\fP .RE .PP .SS "void Inotify::WaitForEvents (boolfNoIntr = \fCfalse\fP) throw (\fBInotifyException\fP)" .PP Waits for inotify events'\&. It waits until one or more events occur'\&. When called in nonblocking mode it only retrieves occurred events to the internal queue and exits'\&. .PP \fBParameters:\fP .RS 4 \fIfNoIntr\fP if true it re-calls the system call after a handled signal .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if reading events failed .RE .PP \fBSee also:\fP .RS 4 \fBSetNonBlock()\fP .RE .PP .SH "Friends And Related Function Documentation" .PP .SS "friend class \fBInotifyWatch\fP\fC [friend]\fP" .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/inotify-cxx.h.30000644000175000001440000001156511737665757016610 0ustar lukusers.TH "inotify-cxx.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME inotify-cxx.h \- .PP inotify C++ interface header .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br .SS "Classes" .in +1c .ti -1c .RI "class \fBInotifyException\fP" .br .RI "\fIClass for inotify exceptions'\&. \fP" .ti -1c .RI "class \fBInotifyEvent\fP" .br .RI "\fIinotify event class \fP" .ti -1c .RI "class \fBInotifyWatch\fP" .br .RI "\fIinotify watch class \fP" .ti -1c .RI "class \fBInotify\fP" .br .RI "\fIinotify class \fP" .in -1c .SS "Defines" .in +1c .ti -1c .RI "#define \fBINOTIFY_EVENT_SIZE\fP (sizeof(struct inotify_event))" .br .RI "\fIEvent struct size'\&. \fP" .ti -1c .RI "#define \fBINOTIFY_BUFLEN\fP (1024 * (INOTIFY_EVENT_SIZE + 16))" .br .RI "\fIEvent buffer length'\&. \fP" .ti -1c .RI "#define \fBIN_EXC_MSG\fP(msg) (std::string(__PRETTY_FUNCTION__) + ': ' + msg)" .br .RI "\fIHelper macro for creating exception messages'\&. \fP" .ti -1c .RI "#define \fBIN_LOCK_DECL\fP" .br .RI "\fIinotify-cxx thread safety \fP" .ti -1c .RI "#define \fBIN_LOCK_INIT\fP" .br .ti -1c .RI "#define \fBIN_LOCK_DONE\fP" .br .ti -1c .RI "#define \fBIN_READ_BEGIN\fP" .br .ti -1c .RI "#define \fBIN_READ_END\fP" .br .ti -1c .RI "#define \fBIN_READ_END_NOTHROW\fP" .br .ti -1c .RI "#define \fBIN_WRITE_BEGIN\fP" .br .ti -1c .RI "#define \fBIN_WRITE_END\fP" .br .ti -1c .RI "#define \fBIN_WRITE_END_NOTHROW\fP" .br .in -1c .SS "Typedefs" .in +1c .ti -1c .RI "typedef std::map< int32_t, .br \fBInotifyWatch\fP * > \fBIN_WATCH_MAP\fP" .br .RI "\fIMapping from watch descriptors to watch objects'\&. \fP" .ti -1c .RI "typedef std::map< std::string, .br \fBInotifyWatch\fP * > \fBIN_WP_MAP\fP" .br .RI "\fIMapping from paths to watch objects'\&. \fP" .in -1c .SS "Enumerations" .in +1c .ti -1c .RI "enum \fBInotifyCapability_t\fP { \fBIN_MAX_EVENTS\fP = 0, \fBIN_MAX_INSTANCES\fP = 1, \fBIN_MAX_WATCHES\fP = 2 }" .br .RI "\fIinotify capability/limit identifiers \fP" .in -1c .SH "Detailed Description" .PP inotify C++ interface header inotify C++ interface .PP Copyright (C) 2006, 2007, 2008 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .SH "Define Documentation" .PP .SS "#define IN_EXC_MSG(msg) (std::string(__PRETTY_FUNCTION__) + ': ' + msg)" .PP Helper macro for creating exception messages'\&. It prepends the message by the function name'\&. .SS "#define IN_LOCK_DECL" .PP inotify-cxx thread safety If this symbol is defined you can use this interface safely threaded applications'\&. Remember that it slightly degrades performance'\&. .PP Even if INOTIFY_THREAD_SAFE is defined some classes stay unsafe'\&. If you must use them (must you?) in more than one thread concurrently you need to implement explicite locking'\&. .PP You need not to define INOTIFY_THREAD_SAFE in that cases where the application is multithreaded but all the inotify infrastructure will be managed only in one thread'\&. This is the recommended way'\&. .PP Locking may fail (it is very rare but not impossible)'\&. In this case an exception is thrown'\&. But if unlocking fails in case of an error it does nothing (this failure is ignored)'\&. .SS "#define IN_LOCK_DONE" .SS "#define IN_LOCK_INIT" .SS "#define IN_READ_BEGIN" .SS "#define IN_READ_END" .SS "#define IN_READ_END_NOTHROW" .SS "#define IN_WRITE_BEGIN" .SS "#define IN_WRITE_END" .SS "#define IN_WRITE_END_NOTHROW" .SS "#define INOTIFY_BUFLEN (1024 * (INOTIFY_EVENT_SIZE + 16))" .PP Event buffer length'\&. .SS "#define INOTIFY_EVENT_SIZE (sizeof(struct inotify_event))" .PP Event struct size'\&. .SH "Typedef Documentation" .PP .SS "typedef std::map \fBIN_WATCH_MAP\fP" .PP Mapping from watch descriptors to watch objects'\&. .SS "typedef std::map \fBIN_WP_MAP\fP" .PP Mapping from paths to watch objects'\&. .SH "Enumeration Type Documentation" .PP .SS "enum \fBInotifyCapability_t\fP" .PP inotify capability/limit identifiers .PP \fBEnumerator: \fP .in +1c .TP \fB\fIIN_MAX_EVENTS \fP\fP max'\&. events in the kernel queue .TP \fB\fIIN_MAX_INSTANCES \fP\fP max'\&. inotify file descriptors per process .TP \fB\fIIN_MAX_WATCHES \fP\fP max'\&. watches per file descriptor .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/AppInstance.30000644000175000001440000000641011737665757016277 0ustar lukusers.TH "AppInstance" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME AppInstance \- .PP Application instance management class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBAppInstance\fP (const std::string &rName, const std::string &rBase=APPLOCK_BASEDIR)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~AppInstance\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "bool \fBLock\fP ()" .br .RI "\fIAttempts to lock the instance'\&. \fP" .ti -1c .RI "void \fBUnlock\fP ()" .br .RI "\fIUnlocks the instance'\&. \fP" .ti -1c .RI "bool \fBExists\fP () const " .br .RI "\fIChecks whether an instance of this application exists'\&. \fP" .ti -1c .RI "bool \fBSendSignal\fP (int iSigNo) const " .br .RI "\fISends a signal to an instance of this application'\&. \fP" .ti -1c .RI "bool \fBTerminate\fP () const " .br .RI "\fITerminates an instance of this application'\&. \fP" .in -1c .SS "Protected Member Functions" .in +1c .ti -1c .RI "bool \fBDoLock\fP ()" .br .in -1c .SH "Detailed Description" .PP Application instance management class'\&. This class is intended for application which require to be running only once (one instance only)'\&. It provides some methods for simple locking, signaling etc'\&. .SH "Constructor & Destructor Documentation" .PP .SS "AppInstance::AppInstance (const std::string &rName, const std::string &rBase = \fCAPPLOCK_BASEDIR\fP)" .PP Constructor'\&. \fBParameters:\fP .RS 4 \fIrName\fP application name .br \fIrBase\fP lockfile base directory .RE .PP \fBAttention:\fP .RS 4 If an empty base directory is given it is replaced by the default value'\&. .RE .PP .SS "AppInstance::~AppInstance ()" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "bool AppInstance::DoLock ()\fC [protected]\fP" .SS "bool AppInstance::Exists () const" .PP Checks whether an instance of this application exists'\&. If this instance has acquired the lockfile the call will be successful'\&. Otherwise it checks for existence of another running instance'\&. .PP \fBReturns:\fP .RS 4 true = instance exists, false = otherwise .RE .PP .SS "bool AppInstance::Lock ()" .PP Attempts to lock the instance'\&. This method attempts to create a lockfile'\&. If the file already exists it checks whether its owner is still living'\&. If it does this method fails'\&. Otherwise it unlinks this file and re-attempts to create it'\&. .PP \fBReturns:\fP .RS 4 true = instance locked, false = otherwise .RE .PP .SS "bool AppInstance::SendSignal (intiSigNo) const" .PP Sends a signal to an instance of this application'\&. This method doesn't signal the current instance'\&. .PP \fBParameters:\fP .RS 4 \fIiSigNo\fP signal number .RE .PP \fBReturns:\fP .RS 4 true = success, false = otherwise .RE .PP .SS "bool AppInstance::Terminate () const\fC [inline]\fP" .PP Terminates an instance of this application'\&. This method doesn't terminate the current instance'\&. .PP \fBReturns:\fP .RS 4 true = success, false = otherwise .RE .PP .SS "void AppInstance::Unlock ()" .PP Unlocks the instance'\&. This method removes (unlinks) the appropriate lockfile'\&. If the instance hasn't been locked this method has no effect'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/appargs.cpp.30000644000175000001440000000215611737665757016313 0ustar lukusers.TH "appargs.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME appargs.cpp \- .PP application arguments processor implementation .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include 'strtok\&.h'\fP .br \fC#include 'appargs\&.h'\fP .br .SH "Detailed Description" .PP application arguments processor implementation application arguments processor .PP Copyright (C) 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .PP Credits: Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/AppInstException.30000644000175000001440000000176311737665757017335 0ustar lukusers.TH "AppInstException" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME AppInstException \- .PP Exception class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBAppInstException\fP (int iErr)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "int \fBGetErrorNumber\fP () const " .br .RI "\fIReturns the error number'\&. \fP" .in -1c .SH "Detailed Description" .PP Exception class'\&. This class provides information about occurred errors'\&. .SH "Constructor & Destructor Documentation" .PP .SS "AppInstException::AppInstException (intiErr)\fC [inline]\fP" .PP Constructor'\&. \fBParameters:\fP .RS 4 \fIiErr\fP error number .RE .PP .SH "Member Function Documentation" .PP .SS "int AppInstException::GetErrorNumber () const\fC [inline]\fP" .PP Returns the error number'\&. \fBReturns:\fP .RS 4 error number .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/UserTable.30000644000175000001440000001043511737665757015762 0ustar lukusers.TH "UserTable" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME UserTable \- .PP User table class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBUserTable\fP (\fBEventDispatcher\fP *pEd, const std::string &rUser, bool fSysTable)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "virtual \fB~UserTable\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "void \fBLoad\fP ()" .br .RI "\fILoads the table'\&. \fP" .ti -1c .RI "void \fBDispose\fP ()" .br .RI "\fIRemoves all entries from the table'\&. \fP" .ti -1c .RI "void \fBOnEvent\fP (\fBInotifyEvent\fP &rEvt)" .br .RI "\fIProcesses an inotify event'\&. \fP" .ti -1c .RI "bool \fBMayAccess\fP (const std::string &rPath, bool fNoFollow) const " .br .RI "\fIChecks whether the user may access a file'\&. \fP" .ti -1c .RI "bool \fBIsSystem\fP () const " .br .RI "\fIChecks whether it is a system table'\&. \fP" .ti -1c .RI "\fBInotify\fP * \fBGetInotify\fP ()" .br .RI "\fIReturns the related inotify object'\&. \fP" .ti -1c .RI "void \fBRunAsUser\fP (char *const *argv) const " .br .RI "\fIRuns a program as the table's user'\&. \fP" .in -1c .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static void \fBFinishDone\fP ()" .br .RI "\fICleans-up all zombie child processes and enables disabled watches'\&. \fP" .ti -1c .RI "static bool \fBCheckUser\fP (const char *user)" .br .RI "\fIChecks whether an user exists and has permission to use incron'\&. \fP" .in -1c .SH "Detailed Description" .PP User table class'\&. This class processes inotify events for an user'\&. It creates child processes which do appropriate actions as defined in the user table file'\&. .SH "Constructor & Destructor Documentation" .PP .SS "UserTable::UserTable (\fBEventDispatcher\fP *pEd, const std::string &rUser, boolfSysTable)" .PP Constructor'\&. \fBParameters:\fP .RS 4 \fIpEd\fP event dispatcher .br \fIrUser\fP user name .br \fIfSysTable\fP system table yes/no .RE .PP .SS "UserTable::~UserTable ()\fC [virtual]\fP" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "static bool UserTable::CheckUser (const char *user)\fC [inline, static]\fP" .PP Checks whether an user exists and has permission to use incron'\&. It searches for the given user name in the user database'\&. If it failes it returns 'false''\&. Otherwise it checks permission files for this user (see InCronTab::CheckUser())'\&. .PP \fBParameters:\fP .RS 4 \fIuser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = user has permission to use incron, false = otherwise .RE .PP \fBSee also:\fP .RS 4 InCronTab::CheckUser() .RE .PP .SS "void UserTable::Dispose ()" .PP Removes all entries from the table'\&. All entries are unregistered from the event dispatcher and their watches are destroyed'\&. .SS "void UserTable::FinishDone ()\fC [static]\fP" .PP Cleans-up all zombie child processes and enables disabled watches'\&. \fBAttention:\fP .RS 4 This method must be called AFTER processing all events which has been caused by the processes'\&. .RE .PP .SS "\fBInotify\fP* UserTable::GetInotify ()\fC [inline]\fP" .PP Returns the related inotify object'\&. \fBReturns:\fP .RS 4 related inotify object .RE .PP .SS "bool UserTable::IsSystem () const" .PP Checks whether it is a system table'\&. \fBReturns:\fP .RS 4 true = system table, false = user table .RE .PP .SS "void UserTable::Load ()" .PP Loads the table'\&. All loaded entries have their inotify watches and are registered for event dispatching'\&. If loading fails the table remains empty'\&. .SS "bool UserTable::MayAccess (const std::string &rPath, boolfNoFollow) const" .PP Checks whether the user may access a file'\&. Any access right (RWX) is sufficient'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP absolute file path .br \fIfNoFollow\fP don't follow a symbolic link .RE .PP \fBReturns:\fP .RS 4 true = access granted, false = otherwise .RE .PP .SS "void UserTable::OnEvent (\fBInotifyEvent\fP &rEvt)" .PP Processes an inotify event'\&. \fBParameters:\fP .RS 4 \fIrEvt\fP inotify event .RE .PP .SS "void UserTable::RunAsUser (char *const *argv) const" .PP Runs a program as the table's user'\&. \fBAttention:\fP .RS 4 Don't call from the main process (before forking)! .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/usertable.cpp.30000644000175000001440000000410311737665757016636 0ustar lukusers.TH "usertable.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME usertable.cpp \- .PP inotify cron daemon user tables implementation .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'usertable\&.h'\fP .br \fC#include 'incroncfg\&.h'\fP .br \fC#include 'incrontab\&.h'\fP .br .SS "Defines" .in +1c .ti -1c .RI "#define \fBDONT_FOLLOW\fP(mask) (false)" .br .ti -1c .RI "#define \fBDEFAULT_PATH\fP '/usr/local/bin:/usr/bin:/bin:/usr/X11R6/bin'" .br .in -1c .SS "Functions" .in +1c .ti -1c .RI "void \fBon_proc_done\fP (\fBInotifyWatch\fP *pW)" .br .in -1c .SS "Variables" .in +1c .ti -1c .RI "volatile bool \fBg_fFinish\fP" .br .RI "\fIFinish program yes/no'\&. \fP" .ti -1c .RI "\fBSUT_MAP\fP \fBg_ut\fP" .br .RI "\fIUser name to user table mapping table'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify cron daemon user tables implementation inotify cron system .PP Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .PP Credits: David Santinoli (supplementary groups) Boris Lechner (spaces in event-related file names) Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Define Documentation" .PP .SS "#define DEFAULT_PATH '/usr/local/bin:/usr/bin:/bin:/usr/X11R6/bin'" .SS "#define DONT_FOLLOW(mask) (false)" .SH "Function Documentation" .PP .SS "void on_proc_done (\fBInotifyWatch\fP *pW)" .SH "Variable Documentation" .PP .SS "volatile bool \fBg_fFinish\fP" .PP Finish program yes/no'\&. .SS "\fBSUT_MAP\fP \fBg_ut\fP" .PP User name to user table mapping table'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/IncronTab.30000644000175000001440000001052311737665757015751 0ustar lukusers.TH "IncronTab" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME IncronTab \- .PP Incron table class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBIncronTab\fP ()" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~IncronTab\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "void \fBAdd\fP (const \fBIncronTabEntry\fP &rEntry)" .br .RI "\fIAdd an entry to the table'\&. \fP" .ti -1c .RI "void \fBClear\fP ()" .br .RI "\fIRemoves all entries'\&. \fP" .ti -1c .RI "bool \fBIsEmpty\fP () const " .br .RI "\fIChecks whether the table is empty'\&. \fP" .ti -1c .RI "int \fBGetCount\fP () const " .br .RI "\fIReturns the count of entries'\&. \fP" .ti -1c .RI "\fBIncronTabEntry\fP & \fBGetEntry\fP (int index)" .br .RI "\fIReturns an entry'\&. \fP" .ti -1c .RI "bool \fBLoad\fP (const std::string &rPath)" .br .RI "\fILoads the table'\&. \fP" .ti -1c .RI "bool \fBSave\fP (const std::string &rPath)" .br .RI "\fISaves the table'\&. \fP" .in -1c .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static bool \fBCheckUser\fP (const std::string &rUser)" .br .RI "\fIChecks whether an user has permission to use incron'\&. \fP" .ti -1c .RI "static std::string \fBGetUserTablePath\fP (const std::string &rUser)" .br .RI "\fIComposes a path to an user incron table file'\&. \fP" .ti -1c .RI "static std::string \fBGetSystemTablePath\fP (const std::string &rName)" .br .RI "\fIComposes a path to a system incron table file'\&. \fP" .in -1c .SS "Protected Attributes" .in +1c .ti -1c .RI "std::deque< \fBIncronTabEntry\fP > \fBm_tab\fP" .br .RI "\fIincron table \fP" .in -1c .SH "Detailed Description" .PP Incron table class'\&. .SH "Constructor & Destructor Documentation" .PP .SS "IncronTab::IncronTab ()\fC [inline]\fP" .PP Constructor'\&. .SS "IncronTab::~IncronTab ()\fC [inline]\fP" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "void IncronTab::Add (const \fBIncronTabEntry\fP &rEntry)\fC [inline]\fP" .PP Add an entry to the table'\&. \fBParameters:\fP .RS 4 \fIrEntry\fP table entry .RE .PP .SS "bool IncronTab::CheckUser (const std::string &rUser)\fC [static]\fP" .PP Checks whether an user has permission to use incron'\&. \fBParameters:\fP .RS 4 \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 true = permission OK, false = otherwise .RE .PP .SS "void IncronTab::Clear ()\fC [inline]\fP" .PP Removes all entries'\&. .SS "int IncronTab::GetCount () const\fC [inline]\fP" .PP Returns the count of entries'\&. \fBReturns:\fP .RS 4 count of entries .RE .PP .SS "\fBIncronTabEntry\fP& IncronTab::GetEntry (intindex)\fC [inline]\fP" .PP Returns an entry'\&. \fBReturns:\fP .RS 4 reference to the entry for the given index .RE .PP \fBAttention:\fP .RS 4 This method doesn't test index bounds'\&. If you pass an invalid value the program may crash and/or behave unpredictible way! .RE .PP .SS "std::string IncronTab::GetSystemTablePath (const std::string &rName)\fC [static]\fP" .PP Composes a path to a system incron table file'\&. \fBParameters:\fP .RS 4 \fIrName\fP table name (pseudouser) .RE .PP \fBReturns:\fP .RS 4 path to the table file .RE .PP \fBAttention:\fP .RS 4 No tests (existence, permission etc'\&.) are done'\&. .RE .PP .SS "std::string IncronTab::GetUserTablePath (const std::string &rUser)\fC [static]\fP" .PP Composes a path to an user incron table file'\&. \fBParameters:\fP .RS 4 \fIrUser\fP user name .RE .PP \fBReturns:\fP .RS 4 path to the table file .RE .PP \fBAttention:\fP .RS 4 No tests (existence, permission etc'\&.) are done'\&. .RE .PP .SS "bool IncronTab::IsEmpty () const\fC [inline]\fP" .PP Checks whether the table is empty'\&. \fBReturns:\fP .RS 4 true = empty, false = otherwise .RE .PP .SS "bool IncronTab::Load (const std::string &rPath)" .PP Loads the table'\&. \fBParameters:\fP .RS 4 \fIrPath\fP path to a source table file .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SS "bool IncronTab::Save (const std::string &rPath)" .PP Saves the table'\&. \fBParameters:\fP .RS 4 \fIrPath\fP path to a destination table file .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SH "Member Data Documentation" .PP .SS "std::deque<\fBIncronTabEntry\fP> \fBIncronTab::m_tab\fP\fC [protected]\fP" .PP incron table .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/appinst.h.30000644000175000001440000000240011737665757015771 0ustar lukusers.TH "appinst.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME appinst.h \- .PP Application instance class header'\&. .SH SYNOPSIS .br .PP \fC#include \fP .br .SS "Classes" .in +1c .ti -1c .RI "class \fBAppInstException\fP" .br .RI "\fIException class'\&. \fP" .ti -1c .RI "class \fBAppInstance\fP" .br .RI "\fIApplication instance management class'\&. \fP" .in -1c .SS "Defines" .in +1c .ti -1c .RI "#define \fBAPPLOCK_BASEDIR\fP '/var/run'" .br .in -1c .SH "Detailed Description" .PP Application instance class header'\&. Copyright (C) 2007, 2008 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .SH "Define Documentation" .PP .SS "#define APPLOCK_BASEDIR '/var/run'" .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/IncronTabEntry.30000644000175000001440000001072611737665757017000 0ustar lukusers.TH "IncronTabEntry" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME IncronTabEntry \- .PP Incron table entry class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBIncronTabEntry\fP ()" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fBIncronTabEntry\fP (const std::string &rPath, uint32_t uMask, const std::string &rCmd)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "\fB~IncronTabEntry\fP ()" .br .RI "\fIDestructor'\&. \fP" .ti -1c .RI "std::string \fBToString\fP () const " .br .RI "\fIConverts the entry to string representation'\&. \fP" .ti -1c .RI "const std::string & \fBGetPath\fP () const " .br .RI "\fIReturns the watch filesystem path'\&. \fP" .ti -1c .RI "int32_t \fBGetMask\fP () const " .br .RI "\fIReturns the event mask'\&. \fP" .ti -1c .RI "const std::string & \fBGetCmd\fP () const " .br .RI "\fIReturns the command string'\&. \fP" .ti -1c .RI "bool \fBIsNoLoop\fP () const " .br .RI "\fIChecks whether this entry has set loop-avoidance'\&. \fP" .in -1c .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static bool \fBParse\fP (const std::string &rStr, \fBIncronTabEntry\fP &rEntry)" .br .RI "\fIParses a string and attempts to extract entry parameters'\&. \fP" .ti -1c .RI "static std::string \fBGetSafePath\fP (const std::string &rPath)" .br .RI "\fIAdd backslashes before spaces in the source path'\&. \fP" .in -1c .SS "Protected Attributes" .in +1c .ti -1c .RI "std::string \fBm_path\fP" .br .RI "\fIwatch path \fP" .ti -1c .RI "uint32_t \fBm_uMask\fP" .br .RI "\fIevent mask \fP" .ti -1c .RI "std::string \fBm_cmd\fP" .br .RI "\fIcommand string \fP" .ti -1c .RI "bool \fBm_fNoLoop\fP" .br .RI "\fIno loop yes/no \fP" .in -1c .SH "Detailed Description" .PP Incron table entry class'\&. .SH "Constructor & Destructor Documentation" .PP .SS "IncronTabEntry::IncronTabEntry ()" .PP Constructor'\&. Creates an empty entry for later use with \fBParse()\fP'\&. .PP \fBSee also:\fP .RS 4 \fBParse()\fP .RE .PP .SS "IncronTabEntry::IncronTabEntry (const std::string &rPath, uint32_tuMask, const std::string &rCmd)" .PP Constructor'\&. Creates an entry based on defined parameters'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP watched filesystem path .br \fIuMask\fP event mask .br \fIrCmd\fP command string .RE .PP .SS "IncronTabEntry::~IncronTabEntry ()\fC [inline]\fP" .PP Destructor'\&. .SH "Member Function Documentation" .PP .SS "const std::string& IncronTabEntry::GetCmd () const\fC [inline]\fP" .PP Returns the command string'\&. \fBReturns:\fP .RS 4 command string .RE .PP .SS "int32_t IncronTabEntry::GetMask () const\fC [inline]\fP" .PP Returns the event mask'\&. \fBReturns:\fP .RS 4 event mask .RE .PP .SS "const std::string& IncronTabEntry::GetPath () const\fC [inline]\fP" .PP Returns the watch filesystem path'\&. \fBReturns:\fP .RS 4 watch path .RE .PP .SS "std::string IncronTabEntry::GetSafePath (const std::string &rPath)\fC [static]\fP" .PP Add backslashes before spaces in the source path'\&. It also adds backslashes before all original backslashes of course'\&. .PP The source string is not modified and a copy is returned instead'\&. .PP This method is intended to be used for paths in user tables'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP path to be modified .RE .PP \fBReturns:\fP .RS 4 modified path .RE .PP .SS "bool IncronTabEntry::IsNoLoop () const\fC [inline]\fP" .PP Checks whether this entry has set loop-avoidance'\&. \fBReturns:\fP .RS 4 true = no loop, false = loop allowed .RE .PP .SS "bool IncronTabEntry::Parse (const std::string &rStr, \fBIncronTabEntry\fP &rEntry)\fC [static]\fP" .PP Parses a string and attempts to extract entry parameters'\&. \fBParameters:\fP .RS 4 \fIrStr\fP parsed string .br \fIrEntry\fP parametrized entry .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SS "std::string IncronTabEntry::ToString () const" .PP Converts the entry to string representation'\&. This method creates a string for use in a table file'\&. .PP \fBReturns:\fP .RS 4 string representation .RE .PP .SH "Member Data Documentation" .PP .SS "std::string \fBIncronTabEntry::m_cmd\fP\fC [protected]\fP" .PP command string .SS "bool \fBIncronTabEntry::m_fNoLoop\fP\fC [protected]\fP" .PP no loop yes/no .SS "std::string \fBIncronTabEntry::m_path\fP\fC [protected]\fP" .PP watch path .SS "uint32_t \fBIncronTabEntry::m_uMask\fP\fC [protected]\fP" .PP event mask .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/IncronCfg.30000644000175000001440000001143611737665757015746 0ustar lukusers.TH "IncronCfg" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME IncronCfg \- .PP Configuration class'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Static Public Member Functions" .in +1c .ti -1c .RI "static void \fBInit\fP ()" .br .RI "\fIInitializes default configuration values'\&. \fP" .ti -1c .RI "static void \fBLoad\fP (const std::string &rPath)" .br .RI "\fILoads configuration values'\&. \fP" .ti -1c .RI "static bool \fBGetValue\fP (const std::string &rKey, std::string &rVal)" .br .RI "\fIRetrieves a configuration value'\&. \fP" .ti -1c .RI "static bool \fBGetValue\fP (const std::string &rKey, int &rVal)" .br .RI "\fIRetrieves a configuration value'\&. \fP" .ti -1c .RI "static bool \fBGetValue\fP (const std::string &rKey, unsigned &rVal)" .br .RI "\fIRetrieves a configuration value'\&. \fP" .ti -1c .RI "static bool \fBGetValue\fP (const std::string &rKey, bool &rVal)" .br .RI "\fIRetrieves a configuration value'\&. \fP" .ti -1c .RI "static std::string \fBBuildPath\fP (const std::string &rPath, const std::string &rName)" .br .RI "\fIBuilds a file path'\&. \fP" .in -1c .SS "Static Protected Member Functions" .in +1c .ti -1c .RI "static bool \fBParseLine\fP (const char *s, std::string &rKey, std::string &rVal)" .br .RI "\fIParses a line a attempts to get a key and a value'\&. \fP" .ti -1c .RI "static bool \fBIsComment\fP (const char *s)" .br .RI "\fIChecks whether a line is a comment'\&. \fP" .in -1c .SH "Detailed Description" .PP Configuration class'\&. This class provides access to values loaded from a configuration file (either a explicitly specified one or the default one)'\&. .SH "Member Function Documentation" .PP .SS "std::string IncronCfg::BuildPath (const std::string &rPath, const std::string &rName)\fC [static]\fP" .PP Builds a file path'\&. This function composes a path from a base path and a file name'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP base path .br \fIrName\fP file name .RE .PP \fBReturns:\fP .RS 4 full path .RE .PP .SS "bool IncronCfg::GetValue (const std::string &rKey, std::string &rVal)\fC [static]\fP" .PP Retrieves a configuration value'\&. This method attempts to find the appropriate configuration value for the given key and stores it into the given variable'\&. .PP \fBParameters:\fP .RS 4 \fIrKey\fP value key .br \fIrVal\fP retrieved value .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure (invalid key) .RE .PP .SS "bool IncronCfg::GetValue (const std::string &rKey, int &rVal)\fC [static]\fP" .PP Retrieves a configuration value'\&. This method attempts to find the appropriate configuration value for the given key and stores it into the given variable'\&. .PP \fBParameters:\fP .RS 4 \fIrKey\fP value key .br \fIrVal\fP retrieved value .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure (invalid key) .RE .PP .SS "bool IncronCfg::GetValue (const std::string &rKey, unsigned &rVal)\fC [static]\fP" .PP Retrieves a configuration value'\&. This method attempts to find the appropriate configuration value for the given key and stores it into the given variable'\&. .PP \fBParameters:\fP .RS 4 \fIrKey\fP value key .br \fIrVal\fP retrieved value .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure (invalid key) .RE .PP .SS "bool IncronCfg::GetValue (const std::string &rKey, bool &rVal)\fC [static]\fP" .PP Retrieves a configuration value'\&. This method attempts to find the appropriate configuration value for the given key and stores it into the given variable'\&. .PP \fBParameters:\fP .RS 4 \fIrKey\fP value key .br \fIrVal\fP retrieved value .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure (invalid key) .RE .PP .SS "void IncronCfg::Init ()\fC [static]\fP" .PP Initializes default configuration values'\&. .SS "bool IncronCfg::IsComment (const char *s)\fC [static, protected]\fP" .PP Checks whether a line is a comment'\&. \fBParameters:\fP .RS 4 \fIs\fP text line .RE .PP \fBReturns:\fP .RS 4 true = comment, false = otherwise .RE .PP .SS "void IncronCfg::Load (const std::string &rPath)\fC [static]\fP" .PP Loads configuration values'\&. This method attempts to load configuration values from the specified file'\&. If it fails (e'\&.g'\&. the file doesn't exist) the default file is read'\&. As the last resort (for the case the default file can't be loaded) the hard-wired values are used'\&. .PP \fBParameters:\fP .RS 4 \fIrPath\fP configuration file path .RE .PP .SS "bool IncronCfg::ParseLine (const char *s, std::string &rKey, std::string &rVal)\fC [static, protected]\fP" .PP Parses a line a attempts to get a key and a value'\&. \fBParameters:\fP .RS 4 \fIs\fP text line .br \fIrKey\fP key .br \fIrVal\fP value .RE .PP \fBReturns:\fP .RS 4 true = success, false = failure .RE .PP .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/inotify-cxx.cpp.30000644000175000001440000000323411737665757017135 0ustar lukusers.TH "inotify-cxx.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME inotify-cxx.cpp \- .PP inotify C++ interface implementation .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'inotify-cxx\&.h'\fP .br .SS "Defines" .in +1c .ti -1c .RI "#define \fBPROCFS_INOTIFY_BASE\fP '/proc/sys/fs/inotify/'" .br .RI "\fIprocfs inotify base path \fP" .ti -1c .RI "#define \fBDUMP_SEP\fP" .br .RI "\fIdump separator (between particular entries) \fP" .in -1c .SH "Detailed Description" .PP inotify C++ interface implementation inotify C++ interface .PP Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .PP Credits: Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Define Documentation" .PP .SS "#define DUMP_SEP"\fBValue:\fP .PP .nf ({ \ if (!rStr\&.empty()) { \ rStr\&.append(','); \ } \ }) .fi .PP dump separator (between particular entries) .SS "#define PROCFS_INOTIFY_BASE '/proc/sys/fs/inotify/'" .PP procfs inotify base path .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/incroncfg.cpp.30000644000175000001440000000244111737665757016623 0ustar lukusers.TH "incroncfg.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME incroncfg.cpp \- .PP inotify cron configuration implementation .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'incroncfg\&.h'\fP .br .SS "Defines" .in +1c .ti -1c .RI "#define \fBINCRON_CFG_DEFAULT\fP '/etc/incron\&.conf'" .br .in -1c .SS "Typedefs" .in +1c .ti -1c .RI "typedef std::map< std::string, .br std::string > \fBCFG_MAP\fP" .br .ti -1c .RI "typedef CFG_MAP::iterator \fBCFG_ITER\fP" .br .in -1c .SH "Detailed Description" .PP inotify cron configuration implementation incron configuration .PP Copyright (C) 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .PP Credits: Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Define Documentation" .PP .SS "#define INCRON_CFG_DEFAULT '/etc/incron\&.conf'" .SH "Typedef Documentation" .PP .SS "typedef CFG_MAP::iterator \fBCFG_ITER\fP" .SS "typedef std::map \fBCFG_MAP\fP" .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/appargs.h.30000644000175000001440000000524011737665757015755 0ustar lukusers.TH "appargs.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME appargs.h \- .PP application arguments processor header .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br .SS "Classes" .in +1c .ti -1c .RI "struct \fBAppArgOption_t\fP" .br .RI "\fIArgument option type'\&. \fP" .ti -1c .RI "class \fBAppArgs\fP" .br .RI "\fIApplication arguments'\&. \fP" .in -1c .SS "Defines" .in +1c .ti -1c .RI "#define \fBAPPARGS_NOLIMIT\fP 0x7fffffff" .br .RI "\fIvalue count has no limit \fP" .in -1c .SS "Typedefs" .in +1c .ti -1c .RI "typedef std::map< std::string, .br \fBAppArgOption_t\fP * > \fBAA_LONG_MAP\fP" .br .RI "\fIMapping from long option name to option data'\&. \fP" .ti -1c .RI "typedef std::map< char, .br \fBAppArgOption_t\fP * > \fBAA_SHORT_MAP\fP" .br .RI "\fIMapping from short option name to option data'\&. \fP" .ti -1c .RI "typedef std::deque< std::string > \fBAA_VAL_LIST\fP" .br .RI "\fIValue list type'\&. \fP" .in -1c .SS "Enumerations" .in +1c .ti -1c .RI "enum \fBAppArgType_t\fP { \fBAAT_NO_VALUE\fP, \fBAAT_OPTIONAL_VALUE\fP, \fBAAT_MANDATORY_VALUE\fP }" .br .RI "\fIOption argument type'\&. \fP" .in -1c .SH "Detailed Description" .PP application arguments processor header application arguments processor .PP Copyright (C) 2007, 2008 Lukas Jelinek, .PP This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses: .PP .PD 0 .IP "\(bu" 2 1'\&. X11-style license (see LICENSE-X11) .IP "\(bu" 2 2'\&. GNU Lesser General Public License, version 2'\&.1 (see LICENSE-LGPL) .IP "\(bu" 2 3'\&. GNU General Public License, version 2 (see LICENSE-GPL) .PP If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html. .SH "Define Documentation" .PP .SS "#define APPARGS_NOLIMIT 0x7fffffff" .PP value count has no limit .SH "Typedef Documentation" .PP .SS "typedef std::map \fBAA_LONG_MAP\fP" .PP Mapping from long option name to option data'\&. .SS "typedef std::map \fBAA_SHORT_MAP\fP" .PP Mapping from short option name to option data'\&. .SS "typedef std::deque \fBAA_VAL_LIST\fP" .PP Value list type'\&. .SH "Enumeration Type Documentation" .PP .SS "enum \fBAppArgType_t\fP" .PP Option argument type'\&. .PP \fBEnumerator: \fP .in +1c .TP \fB\fIAAT_NO_VALUE \fP\fP no value needed .TP \fB\fIAAT_OPTIONAL_VALUE \fP\fP optional value .TP \fB\fIAAT_MANDATORY_VALUE \fP\fP mandatory value .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/usertable.h.30000644000175000001440000000437511737665757016316 0ustar lukusers.TH "usertable.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME usertable.h \- .PP inotify cron daemon user tables header .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'inotify-cxx\&.h'\fP .br \fC#include 'incrontab\&.h'\fP .br .SS "Classes" .in +1c .ti -1c .RI "struct \fBProcData_t\fP" .br .RI "\fIChild process data'\&. \fP" .ti -1c .RI "class \fBEventDispatcher\fP" .br .RI "\fIEvent dispatcher class'\&. \fP" .ti -1c .RI "class \fBUserTable\fP" .br .RI "\fIUser table class'\&. \fP" .in -1c .SS "Typedefs" .in +1c .ti -1c .RI "typedef std::map< std::string, .br \fBUserTable\fP * > \fBSUT_MAP\fP" .br .RI "\fIUser name to user table mapping definition'\&. \fP" .ti -1c .RI "typedef void(* \fBproc_done_cb\fP )(\fBInotifyWatch\fP *)" .br .RI "\fICallback for calling after a process finishes'\&. \fP" .ti -1c .RI "typedef std::map< int, .br \fBUserTable\fP * > \fBFDUT_MAP\fP" .br .RI "\fIfd-to-usertable mapping \fP" .ti -1c .RI "typedef std::map< \fBInotifyWatch\fP .br *, \fBIncronTabEntry\fP * > \fBIWCE_MAP\fP" .br .RI "\fIWatch-to-tableentry mapping'\&. \fP" .ti -1c .RI "typedef std::map< pid_t, .br \fBProcData_t\fP > \fBPROC_MAP\fP" .br .RI "\fIChild process list'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify cron daemon user tables header inotify cron system .PP Copyright (C) 2006, 2007, 2008 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .SH "Typedef Documentation" .PP .SS "typedef std::map \fBFDUT_MAP\fP" .PP fd-to-usertable mapping .SS "typedef std::map<\fBInotifyWatch\fP*, \fBIncronTabEntry\fP*> \fBIWCE_MAP\fP" .PP Watch-to-tableentry mapping'\&. .SS "typedef void(* \fBproc_done_cb\fP)(\fBInotifyWatch\fP *)" .PP Callback for calling after a process finishes'\&. .SS "typedef std::map \fBPROC_MAP\fP" .PP Child process list'\&. .SS "typedef std::map \fBSUT_MAP\fP" .PP User name to user table mapping definition'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/icd-main.cpp.30000644000175000001440000001570111737665757016337 0ustar lukusers.TH "icd-main.cpp" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME icd-main.cpp \- .PP inotify cron daemon main file .SH SYNOPSIS .br .PP \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include \fP .br \fC#include 'inotify-cxx\&.h'\fP .br \fC#include 'appinst\&.h'\fP .br \fC#include 'appargs\&.h'\fP .br \fC#include 'incron\&.h'\fP .br \fC#include 'incrontab\&.h'\fP .br \fC#include 'usertable\&.h'\fP .br \fC#include 'incroncfg\&.h'\fP .br .SS "Defines" .in +1c .ti -1c .RI "#define \fBINCRON_LOG_OPTS\fP (LOG_CONS | LOG_PID)" .br .RI "\fILogging options (console as fallback, log PID) \fP" .ti -1c .RI "#define \fBINCRON_LOG_FACIL\fP LOG_CRON" .br .RI "\fILogging facility (use CRON) \fP" .ti -1c .RI "#define \fBINCROND_VERSION\fP INCROND_NAME ' ' INCRON_VERSION" .br .RI "\fIincrond version string \fP" .ti -1c .RI "#define \fBINCROND_DESCRIPTION\fP" .br .RI "\fIincrontab description string \fP" .ti -1c .RI "#define \fBINCROND_HELP\fP" .br .RI "\fIincrontab help string \fP" .ti -1c .RI "#define \fBCHILD_PIPE_BUF_LEN\fP 32" .br .ti -1c .RI "#define \fBPOLL_EAGAIN_WAIT\fP 3" .br .RI "\fISecond to wait on EAGAIN'\&. \fP" .in -1c .SS "Functions" .in +1c .ti -1c .RI "void \fBon_signal\fP (int signo)" .br .RI "\fIHandles a signal'\&. \fP" .ti -1c .RI "void \fBload_tables\fP (\fBEventDispatcher\fP *pEd) throw (InotifyException)" .br .RI "\fIAttempts to load all (user and system) incron tables'\&. \fP" .ti -1c .RI "void \fBfree_tables\fP (\fBEventDispatcher\fP *pEd)" .br .RI "\fIDeallocates all memory used by incron tables and unregisters them from the dispatcher'\&. \fP" .ti -1c .RI "void \fBprepare_pipe\fP ()" .br .RI "\fIPrepares a 'dead/done child' notification pipe'\&. \fP" .ti -1c .RI "void \fBinit_poll_array\fP (struct pollfd pfd[], int pipefd, int infd)" .br .RI "\fIChecks whether a parameter string is a specific command'\&. \fP" .ti -1c .RI "int \fBmain\fP (int argc, char **argv)" .br .RI "\fIMain application function'\&. \fP" .in -1c .SS "Variables" .in +1c .ti -1c .RI "\fBSUT_MAP\fP \fBg_ut\fP" .br .RI "\fIUser name to user table mapping table'\&. \fP" .ti -1c .RI "volatile bool \fBg_fFinish\fP = false" .br .RI "\fIFinish program yes/no'\&. \fP" .ti -1c .RI "int \fBg_cldPipe\fP [2]" .br .RI "\fIPipe for notifying about dead children'\&. \fP" .ti -1c .RI "char \fBg_cldPipeBuf\fP [CHILD_PIPE_BUF_LEN]" .br .ti -1c .RI "bool \fBg_daemon\fP = true" .br .RI "\fIDaemonize true/false'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify cron daemon main file inotify cron system .PP Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .PP Credits: Christian Ruppert (new include to build with GCC 4'\&.4+) .SH "Define Documentation" .PP .SS "#define CHILD_PIPE_BUF_LEN 32" .SS "#define INCRON_LOG_FACIL LOG_CRON" .PP Logging facility (use CRON) .SS "#define INCRON_LOG_OPTS (LOG_CONS | LOG_PID)" .PP Logging options (console as fallback, log PID) .SS "#define INCROND_DESCRIPTION"\fBValue:\fP .PP .nf 'incrond - inotify cron daemon\n' \ '(c) Lukas Jelinek, 2006, 2007, 2008' .fi .PP incrontab description string .SS "#define INCROND_HELP"\fBValue:\fP .PP .nf INCROND_DESCRIPTION '\n\n' \ 'usage: incrond []\n\n' \ ' may be one of the following:\n' \ 'These options may be used:\n' \ ' -?, --about gives short information about program\n' \ ' -h, --help prints this help text\n' \ ' -n, --foreground runs on foreground (no daemonizing)\n' \ ' -k, --kill terminates running instance of incrond\n' \ ' -f , --config= overrides default configuration file (requires root privileges)\n' \ ' -V, --version prints program version\n\n' \ 'For reporting bugs please use http://bts\&.aiken\&.cz\n' .fi .PP incrontab help string .SS "#define INCROND_VERSION INCROND_NAME ' ' INCRON_VERSION" .PP incrond version string .SS "#define POLL_EAGAIN_WAIT 3" .PP Second to wait on EAGAIN'\&. .SH "Function Documentation" .PP .SS "void free_tables (\fBEventDispatcher\fP *pEd)" .PP Deallocates all memory used by incron tables and unregisters them from the dispatcher'\&. \fBParameters:\fP .RS 4 \fIpEd\fP event dispatcher .RE .PP .SS "void init_poll_array (struct pollfdpfd[], intpipefd, intinfd)" .PP Checks whether a parameter string is a specific command'\&. The string is accepted if it equals either the short or long form of the command'\&. .PP \fBParameters:\fP .RS 4 \fIs\fP checked string .br \fIshortCmd\fP short form of command .br \fIlongCmd\fP long form of command .RE .PP \fBReturns:\fP .RS 4 true = string accepted, false = otherwise Initializes a poll array'\&. .RE .PP \fBParameters:\fP .RS 4 \fIpfd\fP poll structure array .br \fIpipefd\fP pipe file descriptor .br \fIinfd\fP inotify infrastructure file descriptor .RE .PP .SS "void load_tables (\fBEventDispatcher\fP *pEd) throw (\fBInotifyException\fP)" .PP Attempts to load all (user and system) incron tables'\&. Loaded tables are registered for processing events'\&. .PP \fBParameters:\fP .RS 4 \fIpEd\fP inotify event dispatcher .RE .PP \fBExceptions:\fP .RS 4 \fI\fBInotifyException\fP\fP thrown if base table directory cannot be read .RE .PP .SS "int main (intargc, char **argv)" .PP Main application function'\&. \fBParameters:\fP .RS 4 \fIargc\fP argument count .br \fIargv\fP argument array .RE .PP \fBReturns:\fP .RS 4 0 on success, 1 on error .RE .PP \fBAttention:\fP .RS 4 In daemon mode, it finishes immediately'\&. .RE .PP .SS "void on_signal (intsigno)" .PP Handles a signal'\&. For SIGTERM and SIGINT it sets the program finish variable'\&. For SIGCHLD it writes a character into the notification pipe (this is a workaround made due to disability to reliably wait for dead children)'\&. .PP \fBParameters:\fP .RS 4 \fIsigno\fP signal number .RE .PP .SS "void prepare_pipe ()" .PP Prepares a 'dead/done child' notification pipe'\&. This function returns no value at all and on error it throws an exception'\&. .SH "Variable Documentation" .PP .SS "int \fBg_cldPipe\fP[2]" .PP Pipe for notifying about dead children'\&. .SS "char \fBg_cldPipeBuf\fP[CHILD_PIPE_BUF_LEN]" .SS "bool \fBg_daemon\fP = true" .PP Daemonize true/false'\&. .SS "volatile bool \fBg_fFinish\fP = false" .PP Finish program yes/no'\&. .SS "\fBSUT_MAP\fP \fBg_ut\fP" .PP User name to user table mapping table'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/InotifyException.30000644000175000001440000000474611737665757017404 0ustar lukusers.TH "InotifyException" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME InotifyException \- .PP Class for inotify exceptions'\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBInotifyException\fP (const std::string &rMsg='', int iErr=0, void *pSrc=NULL)" .br .RI "\fIConstructor'\&. \fP" .ti -1c .RI "const std::string & \fBGetMessage\fP () const " .br .RI "\fIReturns the exception message'\&. \fP" .ti -1c .RI "int \fBGetErrorNumber\fP () const " .br .RI "\fIReturns the exception error number'\&. \fP" .ti -1c .RI "void * \fBGetSource\fP () const " .br .RI "\fIReturns the exception source'\&. \fP" .in -1c .SS "Protected Attributes" .in +1c .ti -1c .RI "std::string \fBm_msg\fP" .br .RI "\fImessage \fP" .ti -1c .RI "int \fBm_err\fP" .br .RI "\fIerror number \fP" .ti -1c .RI "void * \fBm_pSrc\fP" .br .RI "\fIsource \fP" .in -1c .SH "Detailed Description" .PP Class for inotify exceptions'\&. This class allows to acquire information about exceptional events'\&. It makes easier to log or display error messages and to identify problematic code locations'\&. .PP Although this class is basically thread-safe it is not intended to be shared between threads'\&. .SH "Constructor & Destructor Documentation" .PP .SS "InotifyException::InotifyException (const std::string &rMsg = \fC''\fP, intiErr = \fC0\fP, void *pSrc = \fCNULL\fP)\fC [inline]\fP" .PP Constructor'\&. \fBParameters:\fP .RS 4 \fIrMsg\fP message .br \fIiErr\fP error number (see errno'\&.h) .br \fIpSrc\fP source .RE .PP .SH "Member Function Documentation" .PP .SS "int InotifyException::GetErrorNumber () const\fC [inline]\fP" .PP Returns the exception error number'\&. If not applicable this value is 0 (zero)'\&. .PP \fBReturns:\fP .RS 4 error number (standardized; see errno'\&.h) .RE .PP .SS "const std::string& InotifyException::GetMessage () const\fC [inline]\fP" .PP Returns the exception message'\&. \fBReturns:\fP .RS 4 message .RE .PP .SS "void* InotifyException::GetSource () const\fC [inline]\fP" .PP Returns the exception source'\&. \fBReturns:\fP .RS 4 source .RE .PP .SH "Member Data Documentation" .PP .SS "int \fBInotifyException::m_err\fP\fC [protected]\fP" .PP error number .SS "std::string \fBInotifyException::m_msg\fP\fC [protected]\fP" .PP message .SS "void* \fBInotifyException::m_pSrc\fP\fC [mutable, protected]\fP" .PP source .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/man/man3/incron.h.30000644000175000001440000000330211737665757015605 0ustar lukusers.TH "incron.h" 3 "Sat Apr 7 2012" "Version 0.5.10" "incron" \" -*- nroff -*- .ad l .nh .SH NAME incron.h \- .PP inotify cron basic definition file .SH SYNOPSIS .br .PP .SS "Defines" .in +1c .ti -1c .RI "#define \fBINCRON_NAME\fP 'incron'" .br .RI "\fICommon application name'\&. \fP" .ti -1c .RI "#define \fBINCROND_NAME\fP 'incrond'" .br .RI "\fIDaemon name'\&. \fP" .ti -1c .RI "#define \fBINCRONTAB_NAME\fP 'incrontab'" .br .RI "\fITable manipulator name'\&. \fP" .ti -1c .RI "#define \fBINCRON_VERSION\fP '0\&.5\&.10'" .br .RI "\fIApplication version (release) \fP" .ti -1c .RI "#define \fBINCRON_BUG_ADDRESS\fP ''" .br .RI "\fIAddress for sending bugs'\&. \fP" .ti -1c .RI "#define \fBINCRON_CONFIG\fP '/etc/incron\&.conf'" .br .RI "\fIDefault configuration file'\&. \fP" .in -1c .SH "Detailed Description" .PP inotify cron basic definition file inotify cron system .PP Copyright (C) 2006, 2007, 2008, 2009 Lukas Jelinek, .PP This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL)'\&. .SH "Define Documentation" .PP .SS "#define INCRON_BUG_ADDRESS ''" .PP Address for sending bugs'\&. .SS "#define INCRON_CONFIG '/etc/incron\&.conf'" .PP Default configuration file'\&. .SS "#define INCRON_NAME 'incron'" .PP Common application name'\&. .SS "#define INCRON_VERSION '0\&.5\&.10'" .PP Application version (release) .SS "#define INCROND_NAME 'incrond'" .PP Daemon name'\&. .SS "#define INCRONTAB_NAME 'incrontab'" .PP Table manipulator name'\&. .SH "Author" .PP Generated automatically by Doxygen for incron from the source code'\&. incron-0.5.10/doc/html/0000755000175000001440000000000011737665757013340 5ustar lukusersincron-0.5.10/doc/html/classAppInstance-members.html0000644000175000001440000000702411737665757021114 0ustar lukusers incron: Member List
AppInstance Member List
This is the complete list of members for AppInstance, including all inherited members.
AppInstance(const std::string &rName, const std::string &rBase=APPLOCK_BASEDIR)AppInstance
DoLock()AppInstance [protected]
Exists() const AppInstance
Lock()AppInstance
SendSignal(int iSigNo) const AppInstance
Terminate() const AppInstance [inline]
Unlock()AppInstance
~AppInstance()AppInstance
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/globals_vars.html0000644000175000001440000000553711737665757016716 0ustar lukusers incron: File Members
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classStringTokenizer.html0000644000175000001440000004543511737665757020430 0ustar lukusers incron: StringTokenizer Class Reference
Public Member Functions
StringTokenizer Class Reference

Simple string tokenizer class. More...

#include <strtok.h>

List of all members.

Public Member Functions

 StringTokenizer (const std::string &rStr, char cDelim= ',', char cPrefix= '\0')
 Constructor.
 ~StringTokenizer ()
 Destructor.
bool HasMoreTokens () const
 Checks whether the tokenizer can provide more tokens.
std::string GetNextToken (bool fSkipEmpty=false)
 Returns the next token.
std::string GetNextTokenRaw (bool fSkipEmpty=false)
 Returns the next token.
std::string GetRemainder ()
 Returns the remainder of the source string.
void SetDelimiter (char cDelim)
 Sets a delimiter (separator) character.
char GetDelimiter () const
 Returns the delimiter (separator) character.
void SetPrefix (char cPrefix)
 Sets a prefix character.
char GetPrefix () const
 Returns the prefix character.
void SetNoPrefix ()
 Sets the prefix to 'no prefix'.
void Reset ()
 Resets the tokenizer.

Detailed Description

Simple string tokenizer class.

This class implements a string tokenizer. It splits a string by a character to a number of elements (tokens) which are provided sequentially.

All operations are made on a copy of the original string (which may be in fact a copy-on-write instance).

The original string is left unchanged. All tokens are returned as newly created strings.

There is possibility to specify a prefix character which causes the consecutive character is not considered as a delimiter. If you don't specify this character (or specify the NUL character, 0x00) this feature is disabled. The mostly used prefix is a backslash ('\').

This class is not thread-safe.

Performance note: This class is currently not intended to be very fast. Speed optimizations will be done later.

Constructor & Destructor Documentation

StringTokenizer::StringTokenizer ( const std::string &  rStr,
char  cDelim = ',',
char  cPrefix = '\0' 
)

Constructor.

Creates a ready-to-use tokenizer.

Parameters:
[in]rStrstring for tokenizing
[in]cDelimdelimiter (separator) character
[in]cPrefixcharacter which is prepended if a character must not separate tokens
StringTokenizer::~StringTokenizer ( ) [inline]

Destructor.

Member Function Documentation

char StringTokenizer::GetDelimiter ( ) const [inline]

Returns the delimiter (separator) character.

Returns:
delimiter character
std::string StringTokenizer::GetNextToken ( bool  fSkipEmpty = false)

Returns the next token.

If a prefix is defined it is stripped from the returned string (e.g. 'abc\ def' is transformed to 'abc def' while the prefix is '\').

Parameters:
[in]fSkipEmptyskip empty strings (more consecutive delimiters)
Returns:
next token or "" if no more tokens available
See also:
GetNextTokenRaw()
std::string StringTokenizer::GetNextTokenRaw ( bool  fSkipEmpty = false)

Returns the next token.

This method always returns an unmodified string even if it contains prefix characters.

Parameters:
[in]fSkipEmptyskip empty strings (more consecutive delimiters)
Returns:
next token or "" if no more tokens available
See also:
GetNextToken()
char StringTokenizer::GetPrefix ( ) const [inline]

Returns the prefix character.

Returns:
prefix character
std::string StringTokenizer::GetRemainder ( )

Returns the remainder of the source string.

This method returns everything what has not been processed (tokenized) yet and moves the current position to the end of the string.

If a prefix is defined it is stripped from the returned string.

Returns:
remainder string
bool StringTokenizer::HasMoreTokens ( ) const [inline]

Checks whether the tokenizer can provide more tokens.

Returns:
true = more tokens available, false = otherwise
void StringTokenizer::Reset ( ) [inline]

Resets the tokenizer.

Re-initializes tokenizing to the start of the string.

void StringTokenizer::SetDelimiter ( char  cDelim) [inline]

Sets a delimiter (separator) character.

The new delimiter has effect only to tokens returned later; the position in the string is not affected.

If you specify a NUL character (0x00) here the prefix will not be used.

Parameters:
[in]cDelimdelimiter character
void StringTokenizer::SetNoPrefix ( ) [inline]

Sets the prefix to 'no prefix'.

Calling this method is equivalent to SetPrefix((char) 0).

See also:
SetPrefix()
void StringTokenizer::SetPrefix ( char  cPrefix) [inline]

Sets a prefix character.

The new prefix has effect only to tokens returned later; the position in the string is not affected.

Parameters:
[in]cPrefixprefix character
See also:
SetNoPrefix()
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/usertable_8cpp.html0000644000175000001440000001747311737665757017162 0ustar lukusers incron: usertable.cpp File Reference
Defines | Functions | Variables
usertable.cpp File Reference

inotify cron daemon user tables implementation More...

#include <pwd.h>
#include <syslog.h>
#include <errno.h>
#include <sys/wait.h>
#include <unistd.h>
#include <grp.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <cstdio>
#include <cstring>
#include "usertable.h"
#include "incroncfg.h"
#include "incrontab.h"

Defines

#define DONT_FOLLOW(mask)   (false)
#define DEFAULT_PATH   "/usr/local/bin:/usr/bin:/bin:/usr/X11R6/bin"

Functions

void on_proc_done (InotifyWatch *pW)

Variables

volatile bool g_fFinish
 Finish program yes/no.
SUT_MAP g_ut
 User name to user table mapping table.

Detailed Description

inotify cron daemon user tables implementation

inotify cron system

Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Credits: David Santinoli (supplementary groups) Boris Lechner (spaces in event-related file names) Christian Ruppert (new include to build with GCC 4.4+)

Define Documentation

#define DEFAULT_PATH   "/usr/local/bin:/usr/bin:/bin:/usr/X11R6/bin"
#define DONT_FOLLOW (   mask)    (false)

Function Documentation

void on_proc_done ( InotifyWatch *  pW)

Variable Documentation

volatile bool g_fFinish

Finish program yes/no.

SUT_MAP g_ut

User name to user table mapping table.

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/tab_s.png0000644000175000001440000000027511737665757015142 0ustar lukusersPNG  IHDR$[IDATx P@Kg"%(IE|%I7ilm" ӏCۓ\.dOZ̤Br/(#a6 8qaF-EtA4fl]JjJC%!<#īIENDB`incron-0.5.10/doc/html/classIncronCfg.html0000644000175000001440000004275511737665757017141 0ustar lukusers incron: IncronCfg Class Reference
Static Public Member Functions | Static Protected Member Functions
IncronCfg Class Reference

Configuration class. More...

#include <incroncfg.h>

List of all members.

Static Public Member Functions

static void Init ()
 Initializes default configuration values.
static void Load (const std::string &rPath)
 Loads configuration values.
static bool GetValue (const std::string &rKey, std::string &rVal)
 Retrieves a configuration value.
static bool GetValue (const std::string &rKey, int &rVal)
 Retrieves a configuration value.
static bool GetValue (const std::string &rKey, unsigned &rVal)
 Retrieves a configuration value.
static bool GetValue (const std::string &rKey, bool &rVal)
 Retrieves a configuration value.
static std::string BuildPath (const std::string &rPath, const std::string &rName)
 Builds a file path.

Static Protected Member Functions

static bool ParseLine (const char *s, std::string &rKey, std::string &rVal)
 Parses a line a attempts to get a key and a value.
static bool IsComment (const char *s)
 Checks whether a line is a comment.

Detailed Description

Configuration class.

This class provides access to values loaded from a configuration file (either a explicitly specified one or the default one).

Member Function Documentation

std::string IncronCfg::BuildPath ( const std::string &  rPath,
const std::string &  rName 
) [static]

Builds a file path.

This function composes a path from a base path and a file name.

Parameters:
[in]rPathbase path
[in]rNamefile name
Returns:
full path
bool IncronCfg::GetValue ( const std::string &  rKey,
std::string &  rVal 
) [static]

Retrieves a configuration value.

This method attempts to find the appropriate configuration value for the given key and stores it into the given variable.

Parameters:
[in]rKeyvalue key
[out]rValretrieved value
Returns:
true = success, false = failure (invalid key)
bool IncronCfg::GetValue ( const std::string &  rKey,
int &  rVal 
) [static]

Retrieves a configuration value.

This method attempts to find the appropriate configuration value for the given key and stores it into the given variable.

Parameters:
[in]rKeyvalue key
[out]rValretrieved value
Returns:
true = success, false = failure (invalid key)
bool IncronCfg::GetValue ( const std::string &  rKey,
unsigned &  rVal 
) [static]

Retrieves a configuration value.

This method attempts to find the appropriate configuration value for the given key and stores it into the given variable.

Parameters:
[in]rKeyvalue key
[out]rValretrieved value
Returns:
true = success, false = failure (invalid key)
bool IncronCfg::GetValue ( const std::string &  rKey,
bool &  rVal 
) [static]

Retrieves a configuration value.

This method attempts to find the appropriate configuration value for the given key and stores it into the given variable.

Parameters:
[in]rKeyvalue key
[out]rValretrieved value
Returns:
true = success, false = failure (invalid key)
void IncronCfg::Init ( ) [static]

Initializes default configuration values.

bool IncronCfg::IsComment ( const char *  s) [static, protected]

Checks whether a line is a comment.

Parameters:
[in]stext line
Returns:
true = comment, false = otherwise
void IncronCfg::Load ( const std::string &  rPath) [static]

Loads configuration values.

This method attempts to load configuration values from the specified file. If it fails (e.g. the file doesn't exist) the default file is read. As the last resort (for the case the default file can't be loaded) the hard-wired values are used.

Parameters:
[in]rPathconfiguration file path
bool IncronCfg::ParseLine ( const char *  s,
std::string &  rKey,
std::string &  rVal 
) [static, protected]

Parses a line a attempts to get a key and a value.

Parameters:
[in]stext line
[out]rKeykey
[out]rValvalue
Returns:
true = success, false = failure
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/doxygen.png0000644000175000001440000000754611737665757015537 0ustar lukusersPNG  IHDRh ;-IDATx]{XysZ%ʔNF:FЪքb@;~ӎ"DHZm_4!-2UCe["_3LS|y>_ LZߦajLo}.2$Z);*.d~߳w'0@!ZZeͺwډ?O =\L[gdxr0 RrjJ*.WJN5qM[mޕSb58ļRB5SRus[2< %V'+%$fvĺRK$ C 4+xsQ}f[vZ 6c}!,Lt<ūdxH)/f襧C1v[~ 9%DDKgrN}M9Y3*/i謷%ÓU^#vr'p=]_7ySka-/!Ev902ɖF*, O!1k>QӳdxX:=GD<'fvRKUZjbi`t9cxڪVWsabiw11x%h޶9׉>oծhkG~Nls"^™d2%swW윧Dz W8c>1mBv8܉AZ Turth9kRSf/d1kbA.@+;:j ˫҉|#p4i]V~njxfv$եy| S[;BOKVցa 4x0:DN54>gxpo;Z:ɔbۇ|^T7=$4)L!/u#)9/rq%~a-poE,|gm /9/s|c /u P\a’1,;ueyK\"7-K!3>2amm r7M.(~[2Ʉ]C<b9[)v[~,_@\|8qܴ{}Qޔugr7J]|eڐ`4s5+ҡ\ٕxJ,uds&@yIeD;8nZ={ʘfQU|Xڝ)ض"tV-woJy>6谹 Frf͍ Kb(!@~) F{Ave'3H͍u @A$j"s&&b~twQ J~I J]=;=|S{瑓nʍ9˿˄.{ܴ`b ڞ)j\ΕY_E_.g0u2ݪiDWX'kqVgDO݄E 6 1cZėnNXx(]gL_M!b4+eʤd62[]Am,b@JՄ_,Wrr_g8&(QA4.ajAghSFJhheg;Lcs /RĢ,849:n`,o_~6YIqavʐv>=VEX޾5=uu^/ AeD䆸XjS#^˞3-٣[@vm X W¤v9ѽQ_{3W\؏:pajeI)tܱ8I>xdEd:4kONIq>m1!)[Vb47a@暍̱ p%5P~Z?| 30DN  } Un@ 3'T(,ϗ^.MA8a?UپJ<2S~@=hj3-G|8Y.]XRIT9XA$hIPv!vH}o)Ͷ8rߚ =*^iE«8"< Ht"Бx.ZM!b~ƒ !c bwzqT\ L*a.P7:*(Fp8O@5<917>y1zazs{/Q†9 j}SvYD*n]!rhyakj ʄg͑ d_*ll]^&}hnpȨ[.Y7..OڲX|e%L%L9e tO^ (p 3U%r J v2C z2Sf1]@ȝnp%"nJR2G+Z[?@[PcWKZ=Qi?yE`3+W;ӿfH%x2!%#M?;p)*u;p_z%#M !pWRphϦiE8gF?Kp)_+ǩXP&#j&q=n0Ln>D\J[tsI5)&~J :ÚAB@PKƴdoC)aSteLg.襩?M|ָbٚs+stٛ@`ᰱ*q:htw_Zِ^:cn{ӆݺ`N;כj*K}^4?&=zizkCcPBht'|UE1 ;&5v۵]@kS}pեy &>{f>P~ޞk^IENDB`incron-0.5.10/doc/html/appargs_8h_source.html0000644000175000001440000003436711737665757017657 0ustar lukusers incron: appargs.h Source File
incron  0.5.10
appargs.h
Go to the documentation of this file.
00001 
00003 
00023 #ifndef APPARGS_H_
00024 #define APPARGS_H_
00025 
00026 #include <cstring>
00027 #include <map>
00028 #include <deque>
00029 
00030 
00031 
00033 typedef enum
00034 {
00035   AAT_NO_VALUE,       
00036   AAT_OPTIONAL_VALUE, 
00037   AAT_MANDATORY_VALUE 
00038 } AppArgType_t;
00039 
00040 
00041 #define APPARGS_NOLIMIT 0x7fffffff ///< value count has no limit
00042 
00044 typedef struct
00045 {
00046   AppArgType_t type;  
00047   bool mand;          
00048   bool found;         
00049   std::string val;    
00050   bool hasVal;        
00051 } AppArgOption_t;
00052 
00053 
00055 typedef std::map<std::string, AppArgOption_t*> AA_LONG_MAP;
00056 
00058 typedef std::map<char, AppArgOption_t*> AA_SHORT_MAP;
00059 
00061 typedef std::deque<std::string> AA_VAL_LIST;
00062 
00063 
00065 
00088 class AppArgs
00089 {
00090 public:
00092 
00096   static void Init(size_t valMinCnt = 0, size_t valMaxCnt = APPARGS_NOLIMIT);
00097 
00099 
00103   static void Destroy();
00104 
00106 
00112   static void Parse(int argc, const char* const* argv);
00113   
00115 
00124   static bool IsValid();
00125   
00127 
00131   static bool ExistsOption(const std::string& rArg);
00132   
00134 
00139   static bool GetOption(const std::string& rArg, std::string& rVal);
00140 
00142 
00153   static bool AddOption(const std::string& rName, char cShort, AppArgType_t type, bool fMandatory);
00154   
00156 
00159   static size_t GetValueCount();
00160   
00162 
00167   static bool GetValue(size_t index, std::string& rVal);
00168   
00170 
00173   static void Dump();  
00174   
00175 protected:
00177 
00181   static bool IsOption(const char* pchStr);
00182   
00184 
00191   static bool IsLongOption(const char* pchStr);
00192   
00194 
00201   static bool ParseLong(const char* pchStr, std::string& rName, std::string& rVal, bool& rfHasVal);
00202   
00204 
00212   static void ParseShort(const char* pchStr, char& rcName, std::string& rVal, bool& rfHasVal);
00213 
00215 
00220   static void DumpOption(const std::string& rName, char cShort, AppArgOption_t* pOpt);
00221   
00222   
00223 private:
00224   static size_t s_minCnt;         
00225   static size_t s_maxCnt;         
00226 
00227   static AA_LONG_MAP s_longMap;   
00228   static AA_SHORT_MAP s_shortMap; 
00229   static AA_VAL_LIST s_valList;   
00230   
00231 };
00232 
00233 
00234 #endif /*APPARGS_H_*/
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classInotifyWatch-members.html0000644000175000001440000001053511737665757021320 0ustar lukusers incron: Member List
InotifyWatch Member List
This is the complete list of members for InotifyWatch, including all inherited members.
GetDescriptor() const InotifyWatch [inline]
GetInotify()InotifyWatch [inline]
GetMask() const InotifyWatch [inline]
GetPath() const InotifyWatch [inline]
Inotify classInotifyWatch [friend]
InotifyWatch(const std::string &rPath, int32_t uMask, bool fEnabled=true)InotifyWatch [inline]
IsEnabled() const InotifyWatch [inline]
IsRecursive() const InotifyWatch [inline]
SetEnabled(bool fEnabled)InotifyWatch
SetMask(uint32_t uMask)InotifyWatch
~InotifyWatch()InotifyWatch [inline]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/strtok_8cpp.html0000644000175000001440000000523711737665757016515 0ustar lukusers incron: strtok.cpp File Reference
strtok.cpp File Reference

string tokenizer implementation More...

#include <sstream>
#include "strtok.h"

Detailed Description

string tokenizer implementation

string tokenizer

Copyright (C) 2006, 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/globals_enum.html0000644000175000001440000000453211737665757016701 0ustar lukusers incron: File Members
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incrontab_8h.html0000644000175000001440000000645311737665757016614 0ustar lukusers incron: incrontab.h File Reference
Classes
incrontab.h File Reference

inotify cron table manipulator classes header More...

#include <string>
#include <deque>
#include "strtok.h"

Go to the source code of this file.

Classes

class  IncronTabEntry
 Incron table entry class. More...
class  IncronTab
 Incron table class. More...

Detailed Description

inotify cron table manipulator classes header

inotify cron system

Copyright (C) 2006, 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/functions_func.html0000644000175000001440000004617311737665757017264 0ustar lukusers incron: Class Members - Functions
 

- a -

- b -

- c -

- d -

- e -

- f -

- g -

- h -

- i -

- l -

- m -

- o -

- p -

- r -

- s -

- t -

- u -

- w -

- ~ -

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/inotify-cxx_8h_source.html0000644000175000001440000015405211737665757020475 0ustar lukusers incron: inotify-cxx.h Source File
incron  0.5.10
inotify-cxx.h
Go to the documentation of this file.
00001 
00003 
00026 #ifndef _INOTIFYCXX_H_
00027 #define _INOTIFYCXX_H_
00028 
00029 #include <stdint.h>
00030 #include <string>
00031 #include <deque>
00032 #include <map>
00033 
00034 // Please ensure that the following headers take the right place
00035 #include <sys/syscall.h>
00036 #include <sys/inotify.h>
00037 
00038 // Use this if syscalls not defined
00039 #ifndef __NR_inotify_init
00040 #include <sys/inotify-syscalls.h>
00041 #endif // __NR_inotify_init
00042 
00044 #define INOTIFY_EVENT_SIZE (sizeof(struct inotify_event))
00045 
00047 #define INOTIFY_BUFLEN (1024 * (INOTIFY_EVENT_SIZE + 16))
00048 
00050 
00053 #define IN_EXC_MSG(msg) (std::string(__PRETTY_FUNCTION__) + ": " + msg)
00054 
00056 typedef enum
00057 {
00058   IN_MAX_EVENTS     = 0,  
00059   IN_MAX_INSTANCES  = 1,  
00060   IN_MAX_WATCHES    = 2   
00061 } InotifyCapability_t;
00062 
00064 
00082 #ifdef INOTIFY_THREAD_SAFE
00083 
00084 #include <pthread.h>
00085 
00086 #define IN_LOCK_DECL mutable pthread_rwlock_t __m_lock;
00087 
00088 #define IN_LOCK_INIT \
00089   { \
00090     pthread_rwlockattr_t attr; \
00091     int res = 0; \
00092     if ((res = pthread_rwlockattr_init(&attr)) != 0) \
00093       throw InotifyException(IN_EXC_MSG("cannot initialize lock attributes"), res, this); \
00094     if ((res = pthread_rwlockattr_setkind_np(&attr, PTHREAD_RWLOCK_PREFER_WRITER_NP)) != 0) \
00095       throw InotifyException(IN_EXC_MSG("cannot set lock kind"), res, this); \
00096     if ((res = pthread_rwlock_init(&__m_lock, &attr)) != 0) \
00097       throw InotifyException(IN_EXC_MSG("cannot initialize lock"), res, this); \
00098     pthread_rwlockattr_destroy(&attr); \
00099   }
00100  
00101 #define IN_LOCK_DONE pthread_rwlock_destroy(&__m_lock);
00102 
00103 #define IN_READ_BEGIN \
00104   { \
00105     int res = pthread_rwlock_rdlock(&__m_lock); \
00106     if (res != 0) \
00107       throw InotifyException(IN_EXC_MSG("locking for reading failed"), res, (void*) this); \
00108   }
00109   
00110 #define IN_READ_END \
00111   { \
00112     int res = pthread_rwlock_unlock(&__m_lock); \
00113     if (res != 0) \
00114       throw InotifyException(IN_EXC_MSG("unlocking failed"), res, (void*) this); \
00115   }
00116   
00117 #define IN_READ_END_NOTHROW pthread_rwlock_unlock(&__m_lock);
00118   
00119 #define IN_WRITE_BEGIN \
00120   { \
00121     int res = pthread_rwlock_wrlock(&__m_lock); \
00122     if (res != 0) \
00123       throw InotifyException(IN_EXC_MSG("locking for writing failed"), res, (void*) this); \
00124   }
00125   
00126 #define IN_WRITE_END IN_READ_END
00127 #define IN_WRITE_END_NOTHROW IN_READ_END_NOTHROW
00128 
00129 #else // INOTIFY_THREAD_SAFE
00130 
00131 #define IN_LOCK_DECL
00132 #define IN_LOCK_INIT
00133 #define IN_LOCK_DONE
00134 #define IN_READ_BEGIN
00135 #define IN_READ_END
00136 #define IN_READ_END_NOTHROW
00137 #define IN_WRITE_BEGIN
00138 #define IN_WRITE_END
00139 #define IN_WRITE_END_NOTHROW
00140 
00141 #endif // INOTIFY_THREAD_SAFE
00142 
00143 
00144 
00145 
00146 // forward declaration
00147 class InotifyWatch;
00148 class Inotify;
00149 
00150 
00152 
00160 class InotifyException
00161 {
00162 public:
00164 
00169   InotifyException(const std::string& rMsg = "", int iErr = 0, void* pSrc = NULL)
00170   : m_msg(rMsg),
00171     m_err(iErr)
00172   {
00173     m_pSrc = pSrc;
00174   }
00175   
00177 
00180   inline const std::string& GetMessage() const
00181   {
00182     return m_msg;
00183   }
00184   
00186 
00191   inline int GetErrorNumber() const
00192   {
00193     return m_err;
00194   } 
00195   
00197 
00200   inline void* GetSource() const
00201   {
00202     return m_pSrc;
00203   }
00204 
00205 protected:
00206   std::string m_msg;      
00207   int m_err;              
00208   mutable void* m_pSrc;   
00209 };
00210 
00211 
00213 
00221 class InotifyEvent
00222 {
00223 public:
00225 
00228   InotifyEvent()
00229   : m_uMask(0),
00230     m_uCookie(0)
00231   {
00232     m_pWatch = NULL;
00233   }
00234   
00236 
00243   InotifyEvent(const struct inotify_event* pEvt, InotifyWatch* pWatch)
00244   : m_uMask(0),
00245     m_uCookie(0)
00246   {
00247     if (pEvt != NULL) {
00248       m_uMask = (uint32_t) pEvt->mask;
00249       m_uCookie = (uint32_t) pEvt->cookie;
00250       if (pEvt->name != NULL) {
00251         m_name = pEvt->len > 0
00252             ? pEvt->name
00253             : "";
00254       }
00255       m_pWatch = pWatch;
00256     }
00257     else {
00258       m_pWatch = NULL;
00259     }
00260   }
00261   
00263   ~InotifyEvent() {}
00264   
00266 
00271   int32_t GetDescriptor() const;
00272   
00274 
00279   inline uint32_t GetMask() const
00280   {
00281     return m_uMask;
00282   }
00283   
00285 
00290   inline static bool IsType(uint32_t uValue, uint32_t uType)
00291   {
00292     return ((uValue & uType) != 0) && ((~uValue & uType) == 0);
00293   }
00294   
00296 
00300   inline bool IsType(uint32_t uType) const
00301   {
00302     return IsType(m_uMask, uType);
00303   }
00304   
00306 
00309   inline uint32_t GetCookie() const
00310   {
00311     return m_uCookie;
00312   }
00313   
00315 
00318   inline uint32_t GetLength() const
00319   {
00320     return (uint32_t) m_name.length();
00321   }
00322   
00324 
00327   inline const std::string& GetName() const
00328   {
00329     return m_name;
00330   }
00331   
00333 
00336   inline void GetName(std::string& rName) const
00337   {
00338     rName = GetName();
00339   }
00340   
00342 
00345   inline InotifyWatch* GetWatch()
00346   {
00347     return m_pWatch;
00348   }
00349   
00351 
00355   static uint32_t GetMaskByName(const std::string& rName);
00356   
00358 
00362   static void DumpTypes(uint32_t uValue, std::string& rStr);
00363   
00365 
00368   void DumpTypes(std::string& rStr) const;
00369   
00370 private:
00371   uint32_t m_uMask;           
00372   uint32_t m_uCookie;         
00373   std::string m_name;         
00374   InotifyWatch* m_pWatch;     
00375 };
00376 
00377 
00378 
00380 
00386 class InotifyWatch
00387 {
00388 public:
00390 
00398   InotifyWatch(const std::string& rPath, int32_t uMask, bool fEnabled = true)
00399   : m_path(rPath),
00400     m_uMask(uMask),
00401     m_wd((int32_t) -1),
00402     m_fEnabled(fEnabled)
00403   {
00404     IN_LOCK_INIT
00405   }
00406   
00408   ~InotifyWatch()
00409   {
00410     IN_LOCK_DONE
00411   }
00412   
00414 
00417   inline int32_t GetDescriptor() const
00418   {
00419     return m_wd;
00420   }
00421   
00423 
00426   inline const std::string& GetPath() const
00427   {
00428     return m_path;
00429   }
00430   
00432 
00435   inline uint32_t GetMask() const
00436   {
00437     return (uint32_t) m_uMask;
00438   }
00439   
00441 
00450   void SetMask(uint32_t uMask) throw (InotifyException);   
00451   
00453 
00456   inline Inotify* GetInotify()
00457   {
00458     return m_pInotify;
00459   }
00460   
00462 
00473   void SetEnabled(bool fEnabled) throw (InotifyException);
00474   
00476 
00479   inline bool IsEnabled() const
00480   {
00481     return m_fEnabled;
00482   }
00483   
00485 
00494   inline bool IsRecursive() const
00495   {
00496     return false;    
00497   }
00498   
00499 private:
00500   friend class Inotify;
00501 
00502   std::string m_path;   
00503   uint32_t m_uMask;     
00504   int32_t m_wd;         
00505   Inotify* m_pInotify;  
00506   bool m_fEnabled;      
00507   
00508   IN_LOCK_DECL
00509   
00511 
00516   void __Disable();
00517 };
00518 
00519 
00521 typedef std::map<int32_t, InotifyWatch*> IN_WATCH_MAP;
00522 
00524 typedef std::map<std::string, InotifyWatch*> IN_WP_MAP;
00525 
00526 
00528 
00534 class Inotify
00535 {
00536 public:
00538 
00544   Inotify() throw (InotifyException);
00545   
00547 
00550   ~Inotify();
00551   
00553   void Close();
00554     
00556 
00561   void Add(InotifyWatch* pWatch) throw (InotifyException);
00562   
00564 
00569   inline void Add(InotifyWatch& rWatch) throw (InotifyException)
00570   {
00571     Add(&rWatch);
00572   }
00573   
00575 
00582   void Remove(InotifyWatch* pWatch) throw (InotifyException);
00583   
00585 
00592   inline void Remove(InotifyWatch& rWatch) throw (InotifyException)
00593   {
00594     Remove(&rWatch);
00595   }
00596   
00598   void RemoveAll();
00599   
00601 
00609   inline size_t GetWatchCount() const
00610   {
00611     IN_READ_BEGIN
00612     size_t n = (size_t) m_paths.size();
00613     IN_READ_END
00614     return n;
00615   }
00616   
00618 
00623   inline size_t GetEnabledCount() const
00624   {
00625     IN_READ_BEGIN
00626     size_t n = (size_t) m_watches.size();
00627     IN_READ_END
00628     return n;
00629   }
00630   
00632 
00643   void WaitForEvents(bool fNoIntr = false) throw (InotifyException);
00644   
00646 
00652   inline size_t GetEventCount()
00653   {
00654     IN_READ_BEGIN
00655     size_t n = (size_t) m_events.size();
00656     IN_READ_END
00657     return n;
00658   }
00659   
00661 
00669   bool GetEvent(InotifyEvent* pEvt) throw (InotifyException);
00670   
00672 
00679   bool GetEvent(InotifyEvent& rEvt) throw (InotifyException)
00680   {
00681     return GetEvent(&rEvt);
00682   }
00683   
00685 
00693   bool PeekEvent(InotifyEvent* pEvt) throw (InotifyException);
00694   
00696 
00703   bool PeekEvent(InotifyEvent& rEvt) throw (InotifyException)
00704   {
00705     return PeekEvent(&rEvt);
00706   }
00707   
00709 
00715   InotifyWatch* FindWatch(int iDescriptor);
00716   
00718 
00728    InotifyWatch* FindWatch(const std::string& rPath);
00729   
00731 
00739   inline int GetDescriptor() const
00740   {
00741     return m_fd;
00742   }
00743   
00745 
00758   void SetNonBlock(bool fNonBlock) throw (InotifyException);
00759   
00761 
00774   void SetCloseOnExec(bool fClOnEx) throw (InotifyException);
00775   
00777 
00782   static uint32_t GetCapability(InotifyCapability_t cap) throw (InotifyException);
00783   
00785 
00793   static void SetCapability(InotifyCapability_t cap, uint32_t val) throw (InotifyException);
00794   
00796 
00800   inline static uint32_t GetMaxEvents() throw (InotifyException)
00801   {
00802     return GetCapability(IN_MAX_EVENTS);
00803   }
00804   
00806 
00814   inline static void SetMaxEvents(uint32_t val) throw (InotifyException)
00815   {
00816     SetCapability(IN_MAX_EVENTS, val);
00817   }
00818   
00820 
00827   inline static uint32_t GetMaxInstances() throw (InotifyException)
00828   {
00829     return GetCapability(IN_MAX_INSTANCES);
00830   }
00831   
00833 
00841   inline static void SetMaxInstances(uint32_t val) throw (InotifyException)
00842   {
00843     SetCapability(IN_MAX_INSTANCES, val);
00844   }
00845   
00847 
00854   inline static uint32_t GetMaxWatches() throw (InotifyException)
00855   {
00856     return GetCapability(IN_MAX_WATCHES);
00857   }
00858   
00860 
00868   inline static void SetMaxWatches(uint32_t val) throw (InotifyException)
00869   {
00870     SetCapability(IN_MAX_WATCHES, val);
00871   }
00872 
00873 private: 
00874   int m_fd;                             
00875   IN_WATCH_MAP m_watches;               
00876   IN_WP_MAP m_paths;                    
00877   unsigned char m_buf[INOTIFY_BUFLEN];  
00878   std::deque<InotifyEvent> m_events;    
00879   
00880   IN_LOCK_DECL
00881   
00882   friend class InotifyWatch;
00883   
00884   static std::string GetCapabilityPath(InotifyCapability_t cap) throw (InotifyException);
00885 };
00886 
00887 
00888 #endif //_INOTIFYCXX_H_
00889
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/closed.png0000644000175000001440000000017611737665757015323 0ustar lukusersPNG  IHDR EIDATxA @! Pi/`Є.?,!u zlޖJh1ߘ+vRLx@ (*79H l)IENDB`incron-0.5.10/doc/html/classIncronTabEntry-members.html0000644000175000001440000001221211737665757021603 0ustar lukusers incron: Member List
IncronTabEntry Member List
This is the complete list of members for IncronTabEntry, including all inherited members.
GetCmd() const IncronTabEntry [inline]
GetMask() const IncronTabEntry [inline]
GetPath() const IncronTabEntry [inline]
GetSafePath(const std::string &rPath)IncronTabEntry [static]
IncronTabEntry()IncronTabEntry
IncronTabEntry(const std::string &rPath, uint32_t uMask, const std::string &rCmd)IncronTabEntry
IsNoLoop() const IncronTabEntry [inline]
m_cmdIncronTabEntry [protected]
m_fNoLoopIncronTabEntry [protected]
m_pathIncronTabEntry [protected]
m_uMaskIncronTabEntry [protected]
Parse(const std::string &rStr, IncronTabEntry &rEntry)IncronTabEntry [static]
ToString() const IncronTabEntry
~IncronTabEntry()IncronTabEntry [inline]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incrontab_8h_source.html0000644000175000001440000003620711737665757020174 0ustar lukusers incron: incrontab.h Source File
incron  0.5.10
incrontab.h
Go to the documentation of this file.
00001 
00003 
00017 #ifndef _INCRONTAB_H_
00018 #define _INCRONTAB_H_
00019 
00020 #include <string>
00021 #include <deque>
00022 
00023 #include "strtok.h"
00024 
00025 /*
00027 #define INCRON_USER_TABLE_BASE "/var/spool/incron/"
00028 
00030 #define INCRON_SYS_TABLE_BASE "/etc/incron.d/"
00031 */
00032 
00034 class IncronTabEntry
00035 {
00036 public:
00038 
00043   IncronTabEntry();
00044 
00046 
00053   IncronTabEntry(const std::string& rPath, uint32_t uMask, const std::string& rCmd);
00054   
00056   ~IncronTabEntry() {}
00057   
00059 
00064   std::string ToString() const;
00065   
00067 
00072   static bool Parse(const std::string& rStr, IncronTabEntry& rEntry);
00073   
00075 
00078   inline const std::string& GetPath() const
00079   {
00080     return m_path;
00081   }
00082   
00084 
00087   inline int32_t GetMask() const
00088   {
00089     return m_uMask;
00090   }
00091   
00093 
00096   inline const std::string& GetCmd() const
00097   {
00098     return m_cmd;
00099   }
00100   
00102 
00105   inline bool IsNoLoop() const
00106   {
00107     return m_fNoLoop;
00108   }
00109   
00111 
00123   static std::string GetSafePath(const std::string& rPath);
00124   
00125 protected:
00126   std::string m_path; 
00127   uint32_t m_uMask;   
00128   std::string m_cmd;  
00129   bool m_fNoLoop;     
00130 };
00131 
00132 
00134 class IncronTab
00135 {
00136 public:
00138   IncronTab() {}
00139   
00141   ~IncronTab() {}
00142   
00144 
00147   inline void Add(const IncronTabEntry& rEntry)
00148   {
00149     m_tab.push_back(rEntry);
00150   }
00151   
00153   inline void Clear()
00154   {
00155     m_tab.clear();
00156   }
00157   
00159 
00162   inline bool IsEmpty() const
00163   {
00164     return m_tab.empty();
00165   }
00166   
00168 
00171   inline int GetCount() const
00172   {
00173     return (int) m_tab.size();
00174   }
00175   
00177 
00184   inline IncronTabEntry& GetEntry(int index)
00185   {
00186     return m_tab[index];
00187   }
00188   
00190 
00194   bool Load(const std::string& rPath);
00195   
00197 
00201   bool Save(const std::string& rPath);
00202   
00204 
00208   static bool CheckUser(const std::string& rUser);
00209   
00211 
00217   static std::string GetUserTablePath(const std::string& rUser);
00218   
00220 
00226   static std::string GetSystemTablePath(const std::string& rName);
00227 
00228 protected:
00229   std::deque<IncronTabEntry> m_tab; 
00230 };
00231 
00232 
00233 #endif //_INCRONTAB_H_
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/usertable_8h.html0000644000175000001440000002220511737665757016614 0ustar lukusers incron: usertable.h File Reference
Classes | Typedefs
usertable.h File Reference

inotify cron daemon user tables header More...

#include <map>
#include <deque>
#include <sys/poll.h>
#include "inotify-cxx.h"
#include "incrontab.h"

Go to the source code of this file.

Classes

struct  ProcData_t
 Child process data. More...
class  EventDispatcher
 Event dispatcher class. More...
class  UserTable
 User table class. More...

Typedefs

typedef std::map< std::string,
UserTable * > 		SUT_MAP
 User name to user table mapping definition.
typedef void(* proc_done_cb )(InotifyWatch *)
 Callback for calling after a process finishes.
typedef std::map< int,
UserTable * > 		FDUT_MAP
 fd-to-usertable mapping
typedef std::map< InotifyWatch
*, IncronTabEntry * > 		IWCE_MAP
 Watch-to-tableentry mapping.
typedef std::map< pid_t,
ProcData_t > 		PROC_MAP
 Child process list.

Detailed Description

inotify cron daemon user tables header

inotify cron system

Copyright (C) 2006, 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Typedef Documentation

typedef std::map<int, UserTable*> FDUT_MAP

fd-to-usertable mapping

typedef std::map<InotifyWatch*, IncronTabEntry*> IWCE_MAP

Watch-to-tableentry mapping.

typedef void(* proc_done_cb)(InotifyWatch *)

Callback for calling after a process finishes.

typedef std::map<pid_t, ProcData_t> PROC_MAP

Child process list.

typedef std::map<std::string, UserTable*> SUT_MAP

User name to user table mapping definition.

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/files.html0000644000175000001440000001263611737665757015340 0ustar lukusers incron: File List
File List
Here is a list of all files with brief descriptions:
appargs.cppApplication arguments processor implementation
appargs.h [code]Application arguments processor header
appinst.cppApplication instance class implementation
appinst.h [code]Application instance class header
icd-main.cppInotify cron daemon main file
ict-main.cppInotify cron table manipulator main file
incron.h [code]Inotify cron basic definition file
incroncfg.cppInotify cron configuration implementation
incroncfg.h [code]Inotify cron configuration header
incrontab.cppInotify cron table manipulator classes implementation
incrontab.h [code]Inotify cron table manipulator classes header
inotify-cxx.cppInotify C++ interface implementation
inotify-cxx.h [code]Inotify C++ interface header
strtok.cppString tokenizer implementation
strtok.h [code]String tokenizer header
usertable.cppInotify cron daemon user tables implementation
usertable.h [code]Inotify cron daemon user tables header
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/nav_h.png0000644000175000001440000000014111737665757015135 0ustar lukusersPNG  IHDR ,@(IDATxݱ 0 A2U !kJrZoIENDB`incron-0.5.10/doc/html/appinst_8cpp.html0000644000175000001440000001000511737665757016632 0ustar lukusers incron: appinst.cpp File Reference
Defines
appinst.cpp File Reference

Application instance class implementation. More...

#include <fcntl.h>
#include <unistd.h>
#include <errno.h>
#include <signal.h>
#include <cstdio>
#include "appinst.h"

Defines

#define APPLOCK_PERM   (S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)
 Lockfile permissions (currently 0644)

Detailed Description

Application instance class implementation.

Copyright (C) 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Credits: Christian Ruppert (new include to build with GCC 4.4+)

Define Documentation

#define APPLOCK_PERM   (S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)

Lockfile permissions (currently 0644)

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/strtok_8h.html0000644000175000001440000000774011737665757016163 0ustar lukusers incron: strtok.h File Reference
Classes | Typedefs
strtok.h File Reference

string tokenizer header More...

#include <string>

Go to the source code of this file.

Classes

class  StringTokenizer
 Simple string tokenizer class. More...

Typedefs

typedef std::string::size_type SIZE

Detailed Description

string tokenizer header

string tokenizer

Copyright (C) 2006, 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Typedef Documentation

typedef std::string::size_type SIZE
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/inotify-cxx_8cpp.html0000644000175000001440000001174211737665757017446 0ustar lukusers incron: inotify-cxx.cpp File Reference
Defines
inotify-cxx.cpp File Reference

inotify C++ interface implementation More...

#include <errno.h>
#include <unistd.h>
#include <fcntl.h>
#include <cstdio>
#include "inotify-cxx.h"

Defines

#define PROCFS_INOTIFY_BASE   "/proc/sys/fs/inotify/"
 procfs inotify base path
#define DUMP_SEP
 dump separator (between particular entries)

Detailed Description

inotify C++ interface implementation

inotify C++ interface

Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Credits: Christian Ruppert (new include to build with GCC 4.4+)

Define Documentation

#define DUMP_SEP
Value:
({ \
    if (!rStr.empty()) { \
      rStr.append(","); \
    } \
  })

dump separator (between particular entries)

#define PROCFS_INOTIFY_BASE   "/proc/sys/fs/inotify/"

procfs inotify base path

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classAppInstException.html0000644000175000001440000001133511737665757020514 0ustar lukusers incron: AppInstException Class Reference
Public Member Functions
AppInstException Class Reference

Exception class. More...

#include <appinst.h>

List of all members.

Public Member Functions

 AppInstException (int iErr)
 Constructor.
int GetErrorNumber () const
 Returns the error number.

Detailed Description

Exception class.

This class provides information about occurred errors.

Constructor & Destructor Documentation

AppInstException::AppInstException ( int  iErr) [inline]

Constructor.

Parameters:
[in]iErrerror number

Member Function Documentation

int AppInstException::GetErrorNumber ( ) const [inline]

Returns the error number.

Returns:
error number
The documentation for this class was generated from the following file:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/structProcData__t.html0000644000175000001440000001062611737665757017657 0ustar lukusers incron: ProcData_t Struct Reference
Public Attributes
ProcData_t Struct Reference

Child process data. More...

#include <usertable.h>

List of all members.

Public Attributes

proc_done_cb onDone
 function called after process finishes
InotifyWatch * pWatch
 related watch

Detailed Description

Child process data.

Member Data Documentation

proc_done_cb ProcData_t::onDone

function called after process finishes

InotifyWatch* ProcData_t::pWatch

related watch

The documentation for this struct was generated from the following file:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incron_8h.html0000644000175000001440000001673311737665757016127 0ustar lukusers incron: incron.h File Reference
Defines
incron.h File Reference

inotify cron basic definition file More...

Go to the source code of this file.

Defines

#define INCRON_NAME   "incron"
 Common application name.
#define INCROND_NAME   "incrond"
 Daemon name.
#define INCRONTAB_NAME   "incrontab"
 Table manipulator name.
#define INCRON_VERSION   "0.5.10"
 Application version (release)
#define INCRON_BUG_ADDRESS   "<bugs@aiken.cz>"
 Address for sending bugs.
#define INCRON_CONFIG   "/etc/incron.conf"
 Default configuration file.

Detailed Description

inotify cron basic definition file

inotify cron system

Copyright (C) 2006, 2007, 2008, 2009 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Define Documentation

#define INCRON_BUG_ADDRESS   "<bugs@aiken.cz>"

Address for sending bugs.

#define INCRON_CONFIG   "/etc/incron.conf"

Default configuration file.

#define INCRON_NAME   "incron"

Common application name.

#define INCRON_VERSION   "0.5.10"

Application version (release)

#define INCROND_NAME   "incrond"

Daemon name.

#define INCRONTAB_NAME   "incrontab"

Table manipulator name.

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/jquery.js0000644000175000001440000024562211737665757015230 0ustar lukusers/* * jQuery JavaScript Library v1.3.2 * http://jquery.com/ * * Copyright (c) 2009 John Resig * Dual licensed under the MIT and GPL licenses. * http://docs.jquery.com/License * * Date: 2009-02-19 17:34:21 -0500 (Thu, 19 Feb 2009) * Revision: 6246 */ (function(){var l=this,g,y=l.jQuery,p=l.$,o=l.jQuery=l.$=function(E,F){return new o.fn.init(E,F)},D=/^[^<]*(<(.|\s)+>)[^>]*$|^#([\w-]+)$/,f=/^.[^:#\[\.,]*$/;o.fn=o.prototype={init:function(E,H){E=E||document;if(E.nodeType){this[0]=E;this.length=1;this.context=E;return this}if(typeof E==="string"){var G=D.exec(E);if(G&&(G[1]||!H)){if(G[1]){E=o.clean([G[1]],H)}else{var I=document.getElementById(G[3]);if(I&&I.id!=G[3]){return o().find(E)}var F=o(I||[]);F.context=document;F.selector=E;return F}}else{return o(H).find(E)}}else{if(o.isFunction(E)){return o(document).ready(E)}}if(E.selector&&E.context){this.selector=E.selector;this.context=E.context}return this.setArray(o.isArray(E)?E:o.makeArray(E))},selector:"",jquery:"1.3.2",size:function(){return this.length},get:function(E){return E===g?Array.prototype.slice.call(this):this[E]},pushStack:function(F,H,E){var G=o(F);G.prevObject=this;G.context=this.context;if(H==="find"){G.selector=this.selector+(this.selector?" ":"")+E}else{if(H){G.selector=this.selector+"."+H+"("+E+")"}}return G},setArray:function(E){this.length=0;Array.prototype.push.apply(this,E);return this},each:function(F,E){return o.each(this,F,E)},index:function(E){return o.inArray(E&&E.jquery?E[0]:E,this)},attr:function(F,H,G){var E=F;if(typeof F==="string"){if(H===g){return this[0]&&o[G||"attr"](this[0],F)}else{E={};E[F]=H}}return this.each(function(I){for(F in E){o.attr(G?this.style:this,F,o.prop(this,E[F],G,I,F))}})},css:function(E,F){if((E=="width"||E=="height")&&parseFloat(F)<0){F=g}return this.attr(E,F,"curCSS")},text:function(F){if(typeof F!=="object"&&F!=null){return this.empty().append((this[0]&&this[0].ownerDocument||document).createTextNode(F))}var E="";o.each(F||this,function(){o.each(this.childNodes,function(){if(this.nodeType!=8){E+=this.nodeType!=1?this.nodeValue:o.fn.text([this])}})});return E},wrapAll:function(E){if(this[0]){var F=o(E,this[0].ownerDocument).clone();if(this[0].parentNode){F.insertBefore(this[0])}F.map(function(){var G=this;while(G.firstChild){G=G.firstChild}return G}).append(this)}return this},wrapInner:function(E){return this.each(function(){o(this).contents().wrapAll(E)})},wrap:function(E){return this.each(function(){o(this).wrapAll(E)})},append:function(){return this.domManip(arguments,true,function(E){if(this.nodeType==1){this.appendChild(E)}})},prepend:function(){return this.domManip(arguments,true,function(E){if(this.nodeType==1){this.insertBefore(E,this.firstChild)}})},before:function(){return this.domManip(arguments,false,function(E){this.parentNode.insertBefore(E,this)})},after:function(){return this.domManip(arguments,false,function(E){this.parentNode.insertBefore(E,this.nextSibling)})},end:function(){return this.prevObject||o([])},push:[].push,sort:[].sort,splice:[].splice,find:function(E){if(this.length===1){var F=this.pushStack([],"find",E);F.length=0;o.find(E,this[0],F);return F}else{return this.pushStack(o.unique(o.map(this,function(G){return o.find(E,G)})),"find",E)}},clone:function(G){var E=this.map(function(){if(!o.support.noCloneEvent&&!o.isXMLDoc(this)){var I=this.outerHTML;if(!I){var J=this.ownerDocument.createElement("div");J.appendChild(this.cloneNode(true));I=J.innerHTML}return o.clean([I.replace(/ jQuery\d+="(?:\d+|null)"/g,"").replace(/^\s*/,"")])[0]}else{return this.cloneNode(true)}});if(G===true){var H=this.find("*").andSelf(),F=0;E.find("*").andSelf().each(function(){if(this.nodeName!==H[F].nodeName){return}var I=o.data(H[F],"events");for(var K in I){for(var J in I[K]){o.event.add(this,K,I[K][J],I[K][J].data)}}F++})}return E},filter:function(E){return this.pushStack(o.isFunction(E)&&o.grep(this,function(G,F){return E.call(G,F)})||o.multiFilter(E,o.grep(this,function(F){return F.nodeType===1})),"filter",E)},closest:function(E){var G=o.expr.match.POS.test(E)?o(E):null,F=0;return this.map(function(){var H=this;while(H&&H.ownerDocument){if(G?G.index(H)>-1:o(H).is(E)){o.data(H,"closest",F);return H}H=H.parentNode;F++}})},not:function(E){if(typeof E==="string"){if(f.test(E)){return this.pushStack(o.multiFilter(E,this,true),"not",E)}else{E=o.multiFilter(E,this)}}var F=E.length&&E[E.length-1]!==g&&!E.nodeType;return this.filter(function(){return F?o.inArray(this,E)<0:this!=E})},add:function(E){return this.pushStack(o.unique(o.merge(this.get(),typeof E==="string"?o(E):o.makeArray(E))))},is:function(E){return !!E&&o.multiFilter(E,this).length>0},hasClass:function(E){return !!E&&this.is("."+E)},val:function(K){if(K===g){var E=this[0];if(E){if(o.nodeName(E,"option")){return(E.attributes.value||{}).specified?E.value:E.text}if(o.nodeName(E,"select")){var I=E.selectedIndex,L=[],M=E.options,H=E.type=="select-one";if(I<0){return null}for(var F=H?I:0,J=H?I+1:M.length;F=0||o.inArray(this.name,K)>=0)}else{if(o.nodeName(this,"select")){var N=o.makeArray(K);o("option",this).each(function(){this.selected=(o.inArray(this.value,N)>=0||o.inArray(this.text,N)>=0)});if(!N.length){this.selectedIndex=-1}}else{this.value=K}}})},html:function(E){return E===g?(this[0]?this[0].innerHTML.replace(/ jQuery\d+="(?:\d+|null)"/g,""):null):this.empty().append(E)},replaceWith:function(E){return this.after(E).remove()},eq:function(E){return this.slice(E,+E+1)},slice:function(){return this.pushStack(Array.prototype.slice.apply(this,arguments),"slice",Array.prototype.slice.call(arguments).join(","))},map:function(E){return this.pushStack(o.map(this,function(G,F){return E.call(G,F,G)}))},andSelf:function(){return this.add(this.prevObject)},domManip:function(J,M,L){if(this[0]){var I=(this[0].ownerDocument||this[0]).createDocumentFragment(),F=o.clean(J,(this[0].ownerDocument||this[0]),I),H=I.firstChild;if(H){for(var G=0,E=this.length;G1||G>0?I.cloneNode(true):I)}}if(F){o.each(F,z)}}return this;function K(N,O){return M&&o.nodeName(N,"table")&&o.nodeName(O,"tr")?(N.getElementsByTagName("tbody")[0]||N.appendChild(N.ownerDocument.createElement("tbody"))):N}}};o.fn.init.prototype=o.fn;function z(E,F){if(F.src){o.ajax({url:F.src,async:false,dataType:"script"})}else{o.globalEval(F.text||F.textContent||F.innerHTML||"")}if(F.parentNode){F.parentNode.removeChild(F)}}function e(){return +new Date}o.extend=o.fn.extend=function(){var J=arguments[0]||{},H=1,I=arguments.length,E=false,G;if(typeof J==="boolean"){E=J;J=arguments[1]||{};H=2}if(typeof J!=="object"&&!o.isFunction(J)){J={}}if(I==H){J=this;--H}for(;H-1}},swap:function(H,G,I){var E={};for(var F in G){E[F]=H.style[F];H.style[F]=G[F]}I.call(H);for(var F in G){H.style[F]=E[F]}},css:function(H,F,J,E){if(F=="width"||F=="height"){var L,G={position:"absolute",visibility:"hidden",display:"block"},K=F=="width"?["Left","Right"]:["Top","Bottom"];function I(){L=F=="width"?H.offsetWidth:H.offsetHeight;if(E==="border"){return}o.each(K,function(){if(!E){L-=parseFloat(o.curCSS(H,"padding"+this,true))||0}if(E==="margin"){L+=parseFloat(o.curCSS(H,"margin"+this,true))||0}else{L-=parseFloat(o.curCSS(H,"border"+this+"Width",true))||0}})}if(H.offsetWidth!==0){I()}else{o.swap(H,G,I)}return Math.max(0,Math.round(L))}return o.curCSS(H,F,J)},curCSS:function(I,F,G){var L,E=I.style;if(F=="opacity"&&!o.support.opacity){L=o.attr(E,"opacity");return L==""?"1":L}if(F.match(/float/i)){F=w}if(!G&&E&&E[F]){L=E[F]}else{if(q.getComputedStyle){if(F.match(/float/i)){F="float"}F=F.replace(/([A-Z])/g,"-$1").toLowerCase();var M=q.getComputedStyle(I,null);if(M){L=M.getPropertyValue(F)}if(F=="opacity"&&L==""){L="1"}}else{if(I.currentStyle){var J=F.replace(/\-(\w)/g,function(N,O){return O.toUpperCase()});L=I.currentStyle[F]||I.currentStyle[J];if(!/^\d+(px)?$/i.test(L)&&/^\d/.test(L)){var H=E.left,K=I.runtimeStyle.left;I.runtimeStyle.left=I.currentStyle.left;E.left=L||0;L=E.pixelLeft+"px";E.left=H;I.runtimeStyle.left=K}}}}return L},clean:function(F,K,I){K=K||document;if(typeof K.createElement==="undefined"){K=K.ownerDocument||K[0]&&K[0].ownerDocument||document}if(!I&&F.length===1&&typeof F[0]==="string"){var H=/^<(\w+)\s*\/?>$/.exec(F[0]);if(H){return[K.createElement(H[1])]}}var G=[],E=[],L=K.createElement("div");o.each(F,function(P,S){if(typeof S==="number"){S+=""}if(!S){return}if(typeof S==="string"){S=S.replace(/(<(\w+)[^>]*?)\/>/g,function(U,V,T){return T.match(/^(abbr|br|col|img|input|link|meta|param|hr|area|embed)$/i)?U:V+">"});var O=S.replace(/^\s+/,"").substring(0,10).toLowerCase();var Q=!O.indexOf("",""]||!O.indexOf("",""]||O.match(/^<(thead|tbody|tfoot|colg|cap)/)&&[1,"","
"]||!O.indexOf("",""]||(!O.indexOf("",""]||!O.indexOf("",""]||!o.support.htmlSerialize&&[1,"div
","
"]||[0,"",""];L.innerHTML=Q[1]+S+Q[2];while(Q[0]--){L=L.lastChild}if(!o.support.tbody){var R=/"&&!R?L.childNodes:[];for(var M=N.length-1;M>=0;--M){if(o.nodeName(N[M],"tbody")&&!N[M].childNodes.length){N[M].parentNode.removeChild(N[M])}}}if(!o.support.leadingWhitespace&&/^\s/.test(S)){L.insertBefore(K.createTextNode(S.match(/^\s*/)[0]),L.firstChild)}S=o.makeArray(L.childNodes)}if(S.nodeType){G.push(S)}else{G=o.merge(G,S)}});if(I){for(var J=0;G[J];J++){if(o.nodeName(G[J],"script")&&(!G[J].type||G[J].type.toLowerCase()==="text/javascript")){E.push(G[J].parentNode?G[J].parentNode.removeChild(G[J]):G[J])}else{if(G[J].nodeType===1){G.splice.apply(G,[J+1,0].concat(o.makeArray(G[J].getElementsByTagName("script"))))}I.appendChild(G[J])}}return E}return G},attr:function(J,G,K){if(!J||J.nodeType==3||J.nodeType==8){return g}var H=!o.isXMLDoc(J),L=K!==g;G=H&&o.props[G]||G;if(J.tagName){var F=/href|src|style/.test(G);if(G=="selected"&&J.parentNode){J.parentNode.selectedIndex}if(G in J&&H&&!F){if(L){if(G=="type"&&o.nodeName(J,"input")&&J.parentNode){throw"type property can't be changed"}J[G]=K}if(o.nodeName(J,"form")&&J.getAttributeNode(G)){return J.getAttributeNode(G).nodeValue}if(G=="tabIndex"){var I=J.getAttributeNode("tabIndex");return I&&I.specified?I.value:J.nodeName.match(/(button|input|object|select|textarea)/i)?0:J.nodeName.match(/^(a|area)$/i)&&J.href?0:g}return J[G]}if(!o.support.style&&H&&G=="style"){return o.attr(J.style,"cssText",K)}if(L){J.setAttribute(G,""+K)}var E=!o.support.hrefNormalized&&H&&F?J.getAttribute(G,2):J.getAttribute(G);return E===null?g:E}if(!o.support.opacity&&G=="opacity"){if(L){J.zoom=1;J.filter=(J.filter||"").replace(/alpha\([^)]*\)/,"")+(parseInt(K)+""=="NaN"?"":"alpha(opacity="+K*100+")")}return J.filter&&J.filter.indexOf("opacity=")>=0?(parseFloat(J.filter.match(/opacity=([^)]*)/)[1])/100)+"":""}G=G.replace(/-([a-z])/ig,function(M,N){return N.toUpperCase()});if(L){J[G]=K}return J[G]},trim:function(E){return(E||"").replace(/^\s+|\s+$/g,"")},makeArray:function(G){var E=[];if(G!=null){var F=G.length;if(F==null||typeof G==="string"||o.isFunction(G)||G.setInterval){E[0]=G}else{while(F){E[--F]=G[F]}}}return E},inArray:function(G,H){for(var E=0,F=H.length;E0?this.clone(true):this).get();o.fn[F].apply(o(L[K]),I);J=J.concat(I)}return this.pushStack(J,E,G)}});o.each({removeAttr:function(E){o.attr(this,E,"");if(this.nodeType==1){this.removeAttribute(E)}},addClass:function(E){o.className.add(this,E)},removeClass:function(E){o.className.remove(this,E)},toggleClass:function(F,E){if(typeof E!=="boolean"){E=!o.className.has(this,F)}o.className[E?"add":"remove"](this,F)},remove:function(E){if(!E||o.filter(E,[this]).length){o("*",this).add([this]).each(function(){o.event.remove(this);o.removeData(this)});if(this.parentNode){this.parentNode.removeChild(this)}}},empty:function(){o(this).children().remove();while(this.firstChild){this.removeChild(this.firstChild)}}},function(E,F){o.fn[E]=function(){return this.each(F,arguments)}});function j(E,F){return E[0]&&parseInt(o.curCSS(E[0],F,true),10)||0}var h="jQuery"+e(),v=0,A={};o.extend({cache:{},data:function(F,E,G){F=F==l?A:F;var H=F[h];if(!H){H=F[h]=++v}if(E&&!o.cache[H]){o.cache[H]={}}if(G!==g){o.cache[H][E]=G}return E?o.cache[H][E]:H},removeData:function(F,E){F=F==l?A:F;var H=F[h];if(E){if(o.cache[H]){delete o.cache[H][E];E="";for(E in o.cache[H]){break}if(!E){o.removeData(F)}}}else{try{delete F[h]}catch(G){if(F.removeAttribute){F.removeAttribute(h)}}delete o.cache[H]}},queue:function(F,E,H){if(F){E=(E||"fx")+"queue";var G=o.data(F,E);if(!G||o.isArray(H)){G=o.data(F,E,o.makeArray(H))}else{if(H){G.push(H)}}}return G},dequeue:function(H,G){var E=o.queue(H,G),F=E.shift();if(!G||G==="fx"){F=E[0]}if(F!==g){F.call(H)}}});o.fn.extend({data:function(E,G){var H=E.split(".");H[1]=H[1]?"."+H[1]:"";if(G===g){var F=this.triggerHandler("getData"+H[1]+"!",[H[0]]);if(F===g&&this.length){F=o.data(this[0],E)}return F===g&&H[1]?this.data(H[0]):F}else{return this.trigger("setData"+H[1]+"!",[H[0],G]).each(function(){o.data(this,E,G)})}},removeData:function(E){return this.each(function(){o.removeData(this,E)})},queue:function(E,F){if(typeof E!=="string"){F=E;E="fx"}if(F===g){return o.queue(this[0],E)}return this.each(function(){var G=o.queue(this,E,F);if(E=="fx"&&G.length==1){G[0].call(this)}})},dequeue:function(E){return this.each(function(){o.dequeue(this,E)})}}); /* * Sizzle CSS Selector Engine - v0.9.3 * Copyright 2009, The Dojo Foundation * Released under the MIT, BSD, and GPL Licenses. * More information: http://sizzlejs.com/ */ (function(){var R=/((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^[\]]*\]|['"][^'"]*['"]|[^[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?/g,L=0,H=Object.prototype.toString;var F=function(Y,U,ab,ac){ab=ab||[];U=U||document;if(U.nodeType!==1&&U.nodeType!==9){return[]}if(!Y||typeof Y!=="string"){return ab}var Z=[],W,af,ai,T,ad,V,X=true;R.lastIndex=0;while((W=R.exec(Y))!==null){Z.push(W[1]);if(W[2]){V=RegExp.rightContext;break}}if(Z.length>1&&M.exec(Y)){if(Z.length===2&&I.relative[Z[0]]){af=J(Z[0]+Z[1],U)}else{af=I.relative[Z[0]]?[U]:F(Z.shift(),U);while(Z.length){Y=Z.shift();if(I.relative[Y]){Y+=Z.shift()}af=J(Y,af)}}}else{var ae=ac?{expr:Z.pop(),set:E(ac)}:F.find(Z.pop(),Z.length===1&&U.parentNode?U.parentNode:U,Q(U));af=F.filter(ae.expr,ae.set);if(Z.length>0){ai=E(af)}else{X=false}while(Z.length){var ah=Z.pop(),ag=ah;if(!I.relative[ah]){ah=""}else{ag=Z.pop()}if(ag==null){ag=U}I.relative[ah](ai,ag,Q(U))}}if(!ai){ai=af}if(!ai){throw"Syntax error, unrecognized expression: "+(ah||Y)}if(H.call(ai)==="[object Array]"){if(!X){ab.push.apply(ab,ai)}else{if(U.nodeType===1){for(var aa=0;ai[aa]!=null;aa++){if(ai[aa]&&(ai[aa]===true||ai[aa].nodeType===1&&K(U,ai[aa]))){ab.push(af[aa])}}}else{for(var aa=0;ai[aa]!=null;aa++){if(ai[aa]&&ai[aa].nodeType===1){ab.push(af[aa])}}}}}else{E(ai,ab)}if(V){F(V,U,ab,ac);if(G){hasDuplicate=false;ab.sort(G);if(hasDuplicate){for(var aa=1;aa":function(Z,U,aa){var X=typeof U==="string";if(X&&!/\W/.test(U)){U=aa?U:U.toUpperCase();for(var V=0,T=Z.length;V=0)){if(!V){T.push(Y)}}else{if(V){U[X]=false}}}}return false},ID:function(T){return T[1].replace(/\\/g,"")},TAG:function(U,T){for(var V=0;T[V]===false;V++){}return T[V]&&Q(T[V])?U[1]:U[1].toUpperCase()},CHILD:function(T){if(T[1]=="nth"){var U=/(-?)(\d*)n((?:\+|-)?\d*)/.exec(T[2]=="even"&&"2n"||T[2]=="odd"&&"2n+1"||!/\D/.test(T[2])&&"0n+"+T[2]||T[2]);T[2]=(U[1]+(U[2]||1))-0;T[3]=U[3]-0}T[0]=L++;return T},ATTR:function(X,U,V,T,Y,Z){var W=X[1].replace(/\\/g,"");if(!Z&&I.attrMap[W]){X[1]=I.attrMap[W]}if(X[2]==="~="){X[4]=" "+X[4]+" "}return X},PSEUDO:function(X,U,V,T,Y){if(X[1]==="not"){if(X[3].match(R).length>1||/^\w/.test(X[3])){X[3]=F(X[3],null,null,U)}else{var W=F.filter(X[3],U,V,true^Y);if(!V){T.push.apply(T,W)}return false}}else{if(I.match.POS.test(X[0])||I.match.CHILD.test(X[0])){return true}}return X},POS:function(T){T.unshift(true);return T}},filters:{enabled:function(T){return T.disabled===false&&T.type!=="hidden"},disabled:function(T){return T.disabled===true},checked:function(T){return T.checked===true},selected:function(T){T.parentNode.selectedIndex;return T.selected===true},parent:function(T){return !!T.firstChild},empty:function(T){return !T.firstChild},has:function(V,U,T){return !!F(T[3],V).length},header:function(T){return/h\d/i.test(T.nodeName)},text:function(T){return"text"===T.type},radio:function(T){return"radio"===T.type},checkbox:function(T){return"checkbox"===T.type},file:function(T){return"file"===T.type},password:function(T){return"password"===T.type},submit:function(T){return"submit"===T.type},image:function(T){return"image"===T.type},reset:function(T){return"reset"===T.type},button:function(T){return"button"===T.type||T.nodeName.toUpperCase()==="BUTTON"},input:function(T){return/input|select|textarea|button/i.test(T.nodeName)}},setFilters:{first:function(U,T){return T===0},last:function(V,U,T,W){return U===W.length-1},even:function(U,T){return T%2===0},odd:function(U,T){return T%2===1},lt:function(V,U,T){return UT[3]-0},nth:function(V,U,T){return T[3]-0==U},eq:function(V,U,T){return T[3]-0==U}},filter:{PSEUDO:function(Z,V,W,aa){var U=V[1],X=I.filters[U];if(X){return X(Z,W,V,aa)}else{if(U==="contains"){return(Z.textContent||Z.innerText||"").indexOf(V[3])>=0}else{if(U==="not"){var Y=V[3];for(var W=0,T=Y.length;W=0)}}},ID:function(U,T){return U.nodeType===1&&U.getAttribute("id")===T},TAG:function(U,T){return(T==="*"&&U.nodeType===1)||U.nodeName===T},CLASS:function(U,T){return(" "+(U.className||U.getAttribute("class"))+" ").indexOf(T)>-1},ATTR:function(Y,W){var V=W[1],T=I.attrHandle[V]?I.attrHandle[V](Y):Y[V]!=null?Y[V]:Y.getAttribute(V),Z=T+"",X=W[2],U=W[4];return T==null?X==="!=":X==="="?Z===U:X==="*="?Z.indexOf(U)>=0:X==="~="?(" "+Z+" ").indexOf(U)>=0:!U?Z&&T!==false:X==="!="?Z!=U:X==="^="?Z.indexOf(U)===0:X==="$="?Z.substr(Z.length-U.length)===U:X==="|="?Z===U||Z.substr(0,U.length+1)===U+"-":false},POS:function(X,U,V,Y){var T=U[2],W=I.setFilters[T];if(W){return W(X,V,U,Y)}}}};var M=I.match.POS;for(var O in I.match){I.match[O]=RegExp(I.match[O].source+/(?![^\[]*\])(?![^\(]*\))/.source)}var E=function(U,T){U=Array.prototype.slice.call(U);if(T){T.push.apply(T,U);return T}return U};try{Array.prototype.slice.call(document.documentElement.childNodes)}catch(N){E=function(X,W){var U=W||[];if(H.call(X)==="[object Array]"){Array.prototype.push.apply(U,X)}else{if(typeof X.length==="number"){for(var V=0,T=X.length;V";var T=document.documentElement;T.insertBefore(U,T.firstChild);if(!!document.getElementById(V)){I.find.ID=function(X,Y,Z){if(typeof Y.getElementById!=="undefined"&&!Z){var W=Y.getElementById(X[1]);return W?W.id===X[1]||typeof W.getAttributeNode!=="undefined"&&W.getAttributeNode("id").nodeValue===X[1]?[W]:g:[]}};I.filter.ID=function(Y,W){var X=typeof Y.getAttributeNode!=="undefined"&&Y.getAttributeNode("id");return Y.nodeType===1&&X&&X.nodeValue===W}}T.removeChild(U)})();(function(){var T=document.createElement("div");T.appendChild(document.createComment(""));if(T.getElementsByTagName("*").length>0){I.find.TAG=function(U,Y){var X=Y.getElementsByTagName(U[1]);if(U[1]==="*"){var W=[];for(var V=0;X[V];V++){if(X[V].nodeType===1){W.push(X[V])}}X=W}return X}}T.innerHTML="";if(T.firstChild&&typeof T.firstChild.getAttribute!=="undefined"&&T.firstChild.getAttribute("href")!=="#"){I.attrHandle.href=function(U){return U.getAttribute("href",2)}}})();if(document.querySelectorAll){(function(){var T=F,U=document.createElement("div");U.innerHTML="

";if(U.querySelectorAll&&U.querySelectorAll(".TEST").length===0){return}F=function(Y,X,V,W){X=X||document;if(!W&&X.nodeType===9&&!Q(X)){try{return E(X.querySelectorAll(Y),V)}catch(Z){}}return T(Y,X,V,W)};F.find=T.find;F.filter=T.filter;F.selectors=T.selectors;F.matches=T.matches})()}if(document.getElementsByClassName&&document.documentElement.getElementsByClassName){(function(){var T=document.createElement("div");T.innerHTML="
";if(T.getElementsByClassName("e").length===0){return}T.lastChild.className="e";if(T.getElementsByClassName("e").length===1){return}I.order.splice(1,0,"CLASS");I.find.CLASS=function(U,V,W){if(typeof V.getElementsByClassName!=="undefined"&&!W){return V.getElementsByClassName(U[1])}}})()}function P(U,Z,Y,ad,aa,ac){var ab=U=="previousSibling"&&!ac;for(var W=0,V=ad.length;W0){X=T;break}}}T=T[U]}ad[W]=X}}}var K=document.compareDocumentPosition?function(U,T){return U.compareDocumentPosition(T)&16}:function(U,T){return U!==T&&(U.contains?U.contains(T):true)};var Q=function(T){return T.nodeType===9&&T.documentElement.nodeName!=="HTML"||!!T.ownerDocument&&Q(T.ownerDocument)};var J=function(T,aa){var W=[],X="",Y,V=aa.nodeType?[aa]:aa;while((Y=I.match.PSEUDO.exec(T))){X+=Y[0];T=T.replace(I.match.PSEUDO,"")}T=I.relative[T]?T+"*":T;for(var Z=0,U=V.length;Z0||T.offsetHeight>0};F.selectors.filters.animated=function(T){return o.grep(o.timers,function(U){return T===U.elem}).length};o.multiFilter=function(V,T,U){if(U){V=":not("+V+")"}return F.matches(V,T)};o.dir=function(V,U){var T=[],W=V[U];while(W&&W!=document){if(W.nodeType==1){T.push(W)}W=W[U]}return T};o.nth=function(X,T,V,W){T=T||1;var U=0;for(;X;X=X[V]){if(X.nodeType==1&&++U==T){break}}return X};o.sibling=function(V,U){var T=[];for(;V;V=V.nextSibling){if(V.nodeType==1&&V!=U){T.push(V)}}return T};return;l.Sizzle=F})();o.event={add:function(I,F,H,K){if(I.nodeType==3||I.nodeType==8){return}if(I.setInterval&&I!=l){I=l}if(!H.guid){H.guid=this.guid++}if(K!==g){var G=H;H=this.proxy(G);H.data=K}var E=o.data(I,"events")||o.data(I,"events",{}),J=o.data(I,"handle")||o.data(I,"handle",function(){return typeof o!=="undefined"&&!o.event.triggered?o.event.handle.apply(arguments.callee.elem,arguments):g});J.elem=I;o.each(F.split(/\s+/),function(M,N){var O=N.split(".");N=O.shift();H.type=O.slice().sort().join(".");var L=E[N];if(o.event.specialAll[N]){o.event.specialAll[N].setup.call(I,K,O)}if(!L){L=E[N]={};if(!o.event.special[N]||o.event.special[N].setup.call(I,K,O)===false){if(I.addEventListener){I.addEventListener(N,J,false)}else{if(I.attachEvent){I.attachEvent("on"+N,J)}}}}L[H.guid]=H;o.event.global[N]=true});I=null},guid:1,global:{},remove:function(K,H,J){if(K.nodeType==3||K.nodeType==8){return}var G=o.data(K,"events"),F,E;if(G){if(H===g||(typeof H==="string"&&H.charAt(0)==".")){for(var I in G){this.remove(K,I+(H||""))}}else{if(H.type){J=H.handler;H=H.type}o.each(H.split(/\s+/),function(M,O){var Q=O.split(".");O=Q.shift();var N=RegExp("(^|\\.)"+Q.slice().sort().join(".*\\.")+"(\\.|$)");if(G[O]){if(J){delete G[O][J.guid]}else{for(var P in G[O]){if(N.test(G[O][P].type)){delete G[O][P]}}}if(o.event.specialAll[O]){o.event.specialAll[O].teardown.call(K,Q)}for(F in G[O]){break}if(!F){if(!o.event.special[O]||o.event.special[O].teardown.call(K,Q)===false){if(K.removeEventListener){K.removeEventListener(O,o.data(K,"handle"),false)}else{if(K.detachEvent){K.detachEvent("on"+O,o.data(K,"handle"))}}}F=null;delete G[O]}}})}for(F in G){break}if(!F){var L=o.data(K,"handle");if(L){L.elem=null}o.removeData(K,"events");o.removeData(K,"handle")}}},trigger:function(I,K,H,E){var G=I.type||I;if(!E){I=typeof I==="object"?I[h]?I:o.extend(o.Event(G),I):o.Event(G);if(G.indexOf("!")>=0) {I.type=G=G.slice(0,-1);I.exclusive=true}if(!H){I.stopPropagation();if(this.global[G]){o.each(o.cache,function(){if(this.events&&this.events[G]){o.event.trigger(I,K,this.handle.elem)}})}}if(!H||H.nodeType==3||H.nodeType==8){return g}I.result=g;I.target=H;K=o.makeArray(K);K.unshift(I)}I.currentTarget=H;var J=o.data(H,"handle");if(J){J.apply(H,K)}if((!H[G]||(o.nodeName(H,"a")&&G=="click"))&&H["on"+G]&&H["on"+G].apply(H,K)===false){I.result=false}if(!E&&H[G]&&!I.isDefaultPrevented()&&!(o.nodeName(H,"a")&&G=="click")){this.triggered=true;try{H[G]()}catch(L){}}this.triggered=false;if(!I.isPropagationStopped()){var F=H.parentNode||H.ownerDocument;if(F){o.event.trigger(I,K,F,true)}}},handle:function(K){var J,E;K=arguments[0]=o.event.fix(K||l.event);K.currentTarget=this;var L=K.type.split(".");K.type=L.shift();J=!L.length&&!K.exclusive;var I=RegExp("(^|\\.)"+L.slice().sort().join(".*\\.")+"(\\.|$)");E=(o.data(this,"events")||{})[K.type];for(var G in E){var H=E[G];if(J||I.test(H.type)){K.handler=H;K.data=H.data;var F=H.apply(this,arguments);if(F!==g){K.result=F;if(F===false){K.preventDefault();K.stopPropagation()}}if(K.isImmediatePropagationStopped()){break}}}},props:"altKey attrChange attrName bubbles button cancelable charCode clientX clientY ctrlKey currentTarget data detail eventPhase fromElement handler keyCode metaKey newValue originalTarget pageX pageY prevValue relatedNode relatedTarget screenX screenY shiftKey srcElement target toElement view wheelDelta which".split(" "),fix:function(H){if(H[h]){return H}var F=H;H=o.Event(F);for(var G=this.props.length,J;G;){J=this.props[--G];H[J]=F[J]}if(!H.target){H.target=H.srcElement||document}if(H.target.nodeType==3){H.target=H.target.parentNode}if(!H.relatedTarget&&H.fromElement){H.relatedTarget=H.fromElement==H.target?H.toElement:H.fromElement}if(H.pageX==null&&H.clientX!=null){var I=document.documentElement,E=document.body;H.pageX=H.clientX+(I&&I.scrollLeft||E&&E.scrollLeft||0)-(I.clientLeft||0);H.pageY=H.clientY+(I&&I.scrollTop||E&&E.scrollTop||0)-(I.clientTop||0)}if(!H.which&&((H.charCode||H.charCode===0)?H.charCode:H.keyCode)){H.which=H.charCode||H.keyCode}if(!H.metaKey&&H.ctrlKey){H.metaKey=H.ctrlKey}if(!H.which&&H.button){H.which=(H.button&1?1:(H.button&2?3:(H.button&4?2:0)))}return H},proxy:function(F,E){E=E||function(){return F.apply(this,arguments)};E.guid=F.guid=F.guid||E.guid||this.guid++;return E},special:{ready:{setup:B,teardown:function(){}}},specialAll:{live:{setup:function(E,F){o.event.add(this,F[0],c)},teardown:function(G){if(G.length){var E=0,F=RegExp("(^|\\.)"+G[0]+"(\\.|$)");o.each((o.data(this,"events").live||{}),function(){if(F.test(this.type)){E++}});if(E<1){o.event.remove(this,G[0],c)}}}}}};o.Event=function(E){if(!this.preventDefault){return new o.Event(E)}if(E&&E.type){this.originalEvent=E;this.type=E.type}else{this.type=E}this.timeStamp=e();this[h]=true};function k(){return false}function u(){return true}o.Event.prototype={preventDefault:function(){this.isDefaultPrevented=u;var E=this.originalEvent;if(!E){return}if(E.preventDefault){E.preventDefault()}E.returnValue=false},stopPropagation:function(){this.isPropagationStopped=u;var E=this.originalEvent;if(!E){return}if(E.stopPropagation){E.stopPropagation()}E.cancelBubble=true},stopImmediatePropagation:function(){this.isImmediatePropagationStopped=u;this.stopPropagation()},isDefaultPrevented:k,isPropagationStopped:k,isImmediatePropagationStopped:k};var a=function(F){var E=F.relatedTarget;while(E&&E!=this){try{E=E.parentNode}catch(G){E=this}}if(E!=this){F.type=F.data;o.event.handle.apply(this,arguments)}};o.each({mouseover:"mouseenter",mouseout:"mouseleave"},function(F,E){o.event.special[E]={setup:function(){o.event.add(this,F,a,E)},teardown:function(){o.event.remove(this,F,a)}}});o.fn.extend({bind:function(F,G,E){return F=="unload"?this.one(F,G,E):this.each(function(){o.event.add(this,F,E||G,E&&G)})},one:function(G,H,F){var E=o.event.proxy(F||H,function(I){o(this).unbind(I,E);return(F||H).apply(this,arguments)});return this.each(function(){o.event.add(this,G,E,F&&H)})},unbind:function(F,E){return this.each(function(){o.event.remove(this,F,E)})},trigger:function(E,F){return this.each(function(){o.event.trigger(E,F,this)})},triggerHandler:function(E,G){if(this[0]){var F=o.Event(E);F.preventDefault();F.stopPropagation();o.event.trigger(F,G,this[0]);return F.result}},toggle:function(G){var E=arguments,F=1;while(F=0){var E=G.slice(I,G.length);G=G.slice(0,I)}var H="GET";if(J){if(o.isFunction(J)){K=J;J=null}else{if(typeof J==="object"){J=o.param(J);H="POST"}}}var F=this;o.ajax({url:G,type:H,dataType:"html",data:J,complete:function(M,L){if(L=="success"||L=="notmodified"){F.html(E?o("
").append(M.responseText.replace(//g,"")).find(E):M.responseText)}if(K){F.each(K,[M.responseText,L,M])}}});return this},serialize:function(){return o.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?o.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||/select|textarea/i.test(this.nodeName)||/text|hidden|password|search/i.test(this.type))}).map(function(E,F){var G=o(this).val();return G==null?null:o.isArray(G)?o.map(G,function(I,H){return{name:F.name,value:I}}):{name:F.name,value:G}}).get()}});o.each("ajaxStart,ajaxStop,ajaxComplete,ajaxError,ajaxSuccess,ajaxSend".split(","),function(E,F){o.fn[F]=function(G){return this.bind(F,G)}});var r=e();o.extend({get:function(E,G,H,F){if(o.isFunction(G)){H=G;G=null}return o.ajax({type:"GET",url:E,data:G,success:H,dataType:F})},getScript:function(E,F){return o.get(E,null,F,"script")},getJSON:function(E,F,G){return o.get(E,F,G,"json")},post:function(E,G,H,F){if(o.isFunction(G)){H=G;G={}}return o.ajax({type:"POST",url:E,data:G,success:H,dataType:F})},ajaxSetup:function(E){o.extend(o.ajaxSettings,E)},ajaxSettings:{url:location.href,global:true,type:"GET",contentType:"application/x-www-form-urlencoded",processData:true,async:true,xhr:function(){return l.ActiveXObject?new ActiveXObject("Microsoft.XMLHTTP"):new XMLHttpRequest()},accepts:{xml:"application/xml, text/xml",html:"text/html",script:"text/javascript, application/javascript",json:"application/json, text/javascript",text:"text/plain",_default:"*/*"}},lastModified:{},ajax:function(M){M=o.extend(true,M,o.extend(true,{},o.ajaxSettings,M));var W,F=/=\?(&|$)/g,R,V,G=M.type.toUpperCase();if(M.data&&M.processData&&typeof M.data!=="string"){M.data=o.param(M.data)}if(M.dataType=="jsonp"){if(G=="GET"){if(!M.url.match(F)){M.url+=(M.url.match(/\?/)?"&":"?")+(M.jsonp||"callback")+"=?"}}else{if(!M.data||!M.data.match(F)){M.data=(M.data?M.data+"&":"")+(M.jsonp||"callback")+"=?"}}M.dataType="json"}if(M.dataType=="json"&&(M.data&&M.data.match(F)||M.url.match(F))){W="jsonp"+r++;if(M.data){M.data=(M.data+"").replace(F,"="+W+"$1")}M.url=M.url.replace(F,"="+W+"$1");M.dataType="script";l[W]=function(X){V=X;I();L();l[W]=g;try{delete l[W]}catch(Y){}if(H){H.removeChild(T)}}}if(M.dataType=="script"&&M.cache==null){M.cache=false}if(M.cache===false&&G=="GET"){var E=e();var U=M.url.replace(/(\?|&)_=.*?(&|$)/,"$1_="+E+"$2");M.url=U+((U==M.url)?(M.url.match(/\?/)?"&":"?")+"_="+E:"")}if(M.data&&G=="GET"){M.url+=(M.url.match(/\?/)?"&":"?")+M.data;M.data=null}if(M.global&&!o.active++){o.event.trigger("ajaxStart")}var Q=/^(\w+:)?\/\/([^\/?#]+)/.exec(M.url);if(M.dataType=="script"&&G=="GET"&&Q&&(Q[1]&&Q[1]!=location.protocol||Q[2]!=location.host)){var H=document.getElementsByTagName("head")[0];var T=document.createElement("script");T.src=M.url;if(M.scriptCharset){T.charset=M.scriptCharset}if(!W){var O=false;T.onload=T.onreadystatechange=function(){if(!O&&(!this.readyState||this.readyState=="loaded"||this.readyState=="complete")){O=true;I();L();T.onload=T.onreadystatechange=null;H.removeChild(T)}}}H.appendChild(T);return g}var K=false;var J=M.xhr();if(M.username){J.open(G,M.url,M.async,M.username,M.password)}else{J.open(G,M.url,M.async)}try{if(M.data){J.setRequestHeader("Content-Type",M.contentType)}if(M.ifModified){J.setRequestHeader("If-Modified-Since",o.lastModified[M.url]||"Thu, 01 Jan 1970 00:00:00 GMT")}J.setRequestHeader("X-Requested-With","XMLHttpRequest");J.setRequestHeader("Accept",M.dataType&&M.accepts[M.dataType]?M.accepts[M.dataType]+", */*":M.accepts._default)}catch(S){}if(M.beforeSend&&M.beforeSend(J,M)===false){if(M.global&&!--o.active){o.event.trigger("ajaxStop")}J.abort();return false}if(M.global){o.event.trigger("ajaxSend",[J,M])}var N=function(X){if(J.readyState==0){if(P){clearInterval(P);P=null;if(M.global&&!--o.active){o.event.trigger("ajaxStop")}}}else{if(!K&&J&&(J.readyState==4||X=="timeout")){K=true;if(P){clearInterval(P);P=null}R=X=="timeout"?"timeout":!o.httpSuccess(J)?"error":M.ifModified&&o.httpNotModified(J,M.url)?"notmodified":"success";if(R=="success"){try{V=o.httpData(J,M.dataType,M)}catch(Z){R="parsererror"}}if(R=="success"){var Y;try{Y=J.getResponseHeader("Last-Modified")}catch(Z){}if(M.ifModified&&Y){o.lastModified[M.url]=Y}if(!W){I()}}else{o.handleError(M,J,R)}L();if(X){J.abort()}if(M.async){J=null}}}};if(M.async){var P=setInterval(N,13);if(M.timeout>0){setTimeout(function(){if(J&&!K){N("timeout")}},M.timeout)}}try{J.send(M.data)}catch(S){o.handleError(M,J,null,S)}if(!M.async){N()}function I(){if(M.success){M.success(V,R)}if(M.global){o.event.trigger("ajaxSuccess",[J,M])}}function L(){if(M.complete){M.complete(J,R)}if(M.global){o.event.trigger("ajaxComplete",[J,M])}if(M.global&&!--o.active){o.event.trigger("ajaxStop")}}return J},handleError:function(F,H,E,G){if(F.error){F.error(H,E,G)}if(F.global){o.event.trigger("ajaxError",[H,F,G])}},active:0,httpSuccess:function(F){try{return !F.status&&location.protocol=="file:"||(F.status>=200&&F.status<300)||F.status==304||F.status==1223}catch(E){}return false},httpNotModified:function(G,E){try{var H=G.getResponseHeader("Last-Modified");return G.status==304||H==o.lastModified[E]}catch(F){}return false},httpData:function(J,H,G){var F=J.getResponseHeader("content-type"),E=H=="xml"||!H&&F&&F.indexOf("xml")>=0,I=E?J.responseXML:J.responseText;if(E&&I.documentElement.tagName=="parsererror"){throw"parsererror"}if(G&&G.dataFilter){I=G.dataFilter(I,H)}if(typeof I==="string"){if(H=="script"){o.globalEval(I)}if(H=="json"){I=l["eval"]("("+I+")")}}return I},param:function(E){var G=[];function H(I,J){G[G.length]=encodeURIComponent(I)+"="+encodeURIComponent(J)}if(o.isArray(E)||E.jquery){o.each(E,function(){H(this.name,this.value)})}else{for(var F in E){if(o.isArray(E[F])){o.each(E[F],function(){H(F,this)})}else{H(F,o.isFunction(E[F])?E[F]():E[F])}}}return G.join("&").replace(/%20/g,"+")}});var m={},n,d=[["height","marginTop","marginBottom","paddingTop","paddingBottom"],["width","marginLeft","marginRight","paddingLeft","paddingRight"],["opacity"]];function t(F,E){var G={};o.each(d.concat.apply([],d.slice(0,E)),function() {G[this]=F});return G}o.fn.extend({show:function(J,L){if(J){return this.animate(t("show",3),J,L)}else{for(var H=0,F=this.length;H").appendTo("body");K=I.css("display");if(K==="none"){K="block"}I.remove();m[G]=K}o.data(this[H],"olddisplay",K)}}for(var H=0,F=this.length;H=0;H--){if(G[H].elem==this){if(E){G[H](true)}G.splice(H,1)}}});if(!E){this.dequeue()}return this}});o.each({slideDown:t("show",1),slideUp:t("hide",1),slideToggle:t("toggle",1),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"}},function(E,F){o.fn[E]=function(G,H){return this.animate(F,G,H)}});o.extend({speed:function(G,H,F){var E=typeof G==="object"?G:{complete:F||!F&&H||o.isFunction(G)&&G,duration:G,easing:F&&H||H&&!o.isFunction(H)&&H};E.duration=o.fx.off?0:typeof E.duration==="number"?E.duration:o.fx.speeds[E.duration]||o.fx.speeds._default;E.old=E.complete;E.complete=function(){if(E.queue!==false){o(this).dequeue()}if(o.isFunction(E.old)){E.old.call(this)}};return E},easing:{linear:function(G,H,E,F){return E+F*G},swing:function(G,H,E,F){return((-Math.cos(G*Math.PI)/2)+0.5)*F+E}},timers:[],fx:function(F,E,G){this.options=E;this.elem=F;this.prop=G;if(!E.orig){E.orig={}}}});o.fx.prototype={update:function(){if(this.options.step){this.options.step.call(this.elem,this.now,this)}(o.fx.step[this.prop]||o.fx.step._default)(this);if((this.prop=="height"||this.prop=="width")&&this.elem.style){this.elem.style.display="block"}},cur:function(F){if(this.elem[this.prop]!=null&&(!this.elem.style||this.elem.style[this.prop]==null)){return this.elem[this.prop]}var E=parseFloat(o.css(this.elem,this.prop,F));return E&&E>-10000?E:parseFloat(o.curCSS(this.elem,this.prop))||0},custom:function(I,H,G){this.startTime=e();this.start=I;this.end=H;this.unit=G||this.unit||"px";this.now=this.start;this.pos=this.state=0;var E=this;function F(J){return E.step(J)}F.elem=this.elem;if(F()&&o.timers.push(F)&&!n){n=setInterval(function(){var K=o.timers;for(var J=0;J=this.options.duration+this.startTime){this.now=this.end;this.pos=this.state=1;this.update();this.options.curAnim[this.prop]=true;var E=true;for(var F in this.options.curAnim){if(this.options.curAnim[F]!==true){E=false}}if(E){if(this.options.display!=null){this.elem.style.overflow=this.options.overflow;this.elem.style.display=this.options.display;if(o.css(this.elem,"display")=="none"){this.elem.style.display="block"}}if(this.options.hide){o(this.elem).hide()}if(this.options.hide||this.options.show){for(var I in this.options.curAnim){o.attr(this.elem.style,I,this.options.orig[I])}}this.options.complete.call(this.elem)}return false}else{var J=G-this.startTime;this.state=J/this.options.duration;this.pos=o.easing[this.options.easing||(o.easing.swing?"swing":"linear")](this.state,J,0,1,this.options.duration);this.now=this.start+((this.end-this.start)*this.pos);this.update()}return true}};o.extend(o.fx,{speeds:{slow:600,fast:200,_default:400},step:{opacity:function(E){o.attr(E.elem.style,"opacity",E.now)},_default:function(E){if(E.elem.style&&E.elem.style[E.prop]!=null){E.elem.style[E.prop]=E.now+E.unit}else{E.elem[E.prop]=E.now}}}});if(document.documentElement.getBoundingClientRect){o.fn.offset=function(){if(!this[0]){return{top:0,left:0}}if(this[0]===this[0].ownerDocument.body){return o.offset.bodyOffset(this[0])}var G=this[0].getBoundingClientRect(),J=this[0].ownerDocument,F=J.body,E=J.documentElement,L=E.clientTop||F.clientTop||0,K=E.clientLeft||F.clientLeft||0,I=G.top+(self.pageYOffset||o.boxModel&&E.scrollTop||F.scrollTop)-L,H=G.left+(self.pageXOffset||o.boxModel&&E.scrollLeft||F.scrollLeft)-K;return{top:I,left:H}}}else{o.fn.offset=function(){if(!this[0]){return{top:0,left:0}}if(this[0]===this[0].ownerDocument.body){return o.offset.bodyOffset(this[0])}o.offset.initialized||o.offset.initialize();var J=this[0],G=J.offsetParent,F=J,O=J.ownerDocument,M,H=O.documentElement,K=O.body,L=O.defaultView,E=L.getComputedStyle(J,null),N=J.offsetTop,I=J.offsetLeft;while((J=J.parentNode)&&J!==K&&J!==H){M=L.getComputedStyle(J,null);N-=J.scrollTop,I-=J.scrollLeft;if(J===G){N+=J.offsetTop,I+=J.offsetLeft;if(o.offset.doesNotAddBorder&&!(o.offset.doesAddBorderForTableAndCells&&/^t(able|d|h)$/i.test(J.tagName))){N+=parseInt(M.borderTopWidth,10)||0,I+=parseInt(M.borderLeftWidth,10)||0}F=G,G=J.offsetParent}if(o.offset.subtractsBorderForOverflowNotVisible&&M.overflow!=="visible"){N+=parseInt(M.borderTopWidth,10)||0,I+=parseInt(M.borderLeftWidth,10)||0}E=M}if(E.position==="relative"||E.position==="static"){N+=K.offsetTop,I+=K.offsetLeft}if(E.position==="fixed"){N+=Math.max(H.scrollTop,K.scrollTop),I+=Math.max(H.scrollLeft,K.scrollLeft)}return{top:N,left:I}}}o.offset={initialize:function(){if(this.initialized){return}var L=document.body,F=document.createElement("div"),H,G,N,I,M,E,J=L.style.marginTop,K='
';M={position:"absolute",top:0,left:0,margin:0,border:0,width:"1px",height:"1px",visibility:"hidden"};for(E in M){F.style[E]=M[E]}F.innerHTML=K;L.insertBefore(F,L.firstChild);H=F.firstChild,G=H.firstChild,I=H.nextSibling.firstChild.firstChild;this.doesNotAddBorder=(G.offsetTop!==5);this.doesAddBorderForTableAndCells=(I.offsetTop===5);H.style.overflow="hidden",H.style.position="relative";this.subtractsBorderForOverflowNotVisible=(G.offsetTop===-5);L.style.marginTop="1px";this.doesNotIncludeMarginInBodyOffset=(L.offsetTop===0);L.style.marginTop=J;L.removeChild(F);this.initialized=true},bodyOffset:function(E){o.offset.initialized||o.offset.initialize();var G=E.offsetTop,F=E.offsetLeft;if(o.offset.doesNotIncludeMarginInBodyOffset){G+=parseInt(o.curCSS(E,"marginTop",true),10)||0,F+=parseInt(o.curCSS(E,"marginLeft",true),10)||0}return{top:G,left:F}}};o.fn.extend({position:function(){var I=0,H=0,F;if(this[0]){var G=this.offsetParent(),J=this.offset(),E=/^body|html$/i.test(G[0].tagName)?{top:0,left:0}:G.offset();J.top-=j(this,"marginTop");J.left-=j(this,"marginLeft");E.top+=j(G,"borderTopWidth");E.left+=j(G,"borderLeftWidth");F={top:J.top-E.top,left:J.left-E.left}}return F},offsetParent:function(){var E=this[0].offsetParent||document.body;while(E&&(!/^body|html$/i.test(E.tagName)&&o.css(E,"position")=="static")){E=E.offsetParent}return o(E)}});o.each(["Left","Top"],function(F,E){var G="scroll"+E;o.fn[G]=function(H){if(!this[0]){return null}return H!==g?this.each(function(){this==l||this==document?l.scrollTo(!F?H:o(l).scrollLeft(),F?H:o(l).scrollTop()):this[G]=H}):this[0]==l||this[0]==document?self[F?"pageYOffset":"pageXOffset"]||o.boxModel&&document.documentElement[G]||document.body[G]:this[0][G]}});o.each(["Height","Width"],function(I,G){var E=I?"Left":"Top",H=I?"Right":"Bottom",F=G.toLowerCase();o.fn["inner"+G]=function(){return this[0]?o.css(this[0],F,false,"padding"):null};o.fn["outer"+G]=function(K){return this[0]?o.css(this[0],F,false,K?"margin":"border"):null};var J=G.toLowerCase();o.fn[J]=function(K){return this[0]==l?document.compatMode=="CSS1Compat"&&document.documentElement["client"+G]||document.body["client"+G]:this[0]==document?Math.max(document.documentElement["client"+G],document.body["scroll"+G],document.documentElement["scroll"+G],document.body["offset"+G],document.documentElement["offset"+G]):K===g?(this.length?o.css(this[0],J):null):this.css(J,typeof K==="string"?K:K+"px")}})})(); /* * jQuery UI 1.7.2 * * Copyright (c) 2009 AUTHORS.txt (http://jqueryui.com/about) * Dual licensed under the MIT (MIT-LICENSE.txt) * and GPL (GPL-LICENSE.txt) licenses. * * http://docs.jquery.com/UI */ jQuery.ui||(function(c){var i=c.fn.remove,d=c.browser.mozilla&&(parseFloat(c.browser.version)<1.9);c.ui={version:"1.7.2",plugin:{add:function(k,l,n){var m=c.ui[k].prototype;for(var j in n){m.plugins[j]=m.plugins[j]||[];m.plugins[j].push([l,n[j]])}},call:function(j,l,k){var n=j.plugins[l];if(!n||!j.element[0].parentNode){return}for(var m=0;m0){return true}m[j]=1;l=(m[j]>0);m[j]=0;return l},isOverAxis:function(k,j,l){return(k>j)&&(k<(j+l))},isOver:function(o,k,n,m,j,l){return c.ui.isOverAxis(o,n,j)&&c.ui.isOverAxis(k,m,l)},keyCode:{BACKSPACE:8,CAPS_LOCK:20,COMMA:188,CONTROL:17,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,INSERT:45,LEFT:37,NUMPAD_ADD:107,NUMPAD_DECIMAL:110,NUMPAD_DIVIDE:111,NUMPAD_ENTER:108,NUMPAD_MULTIPLY:106,NUMPAD_SUBTRACT:109,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SHIFT:16,SPACE:32,TAB:9,UP:38}};if(d){var f=c.attr,e=c.fn.removeAttr,h="http://www.w3.org/2005/07/aaa",a=/^aria-/,b=/^wairole:/;c.attr=function(k,j,l){var m=l!==undefined;return(j=="role"?(m?f.call(this,k,j,"wairole:"+l):(f.apply(this,arguments)||"").replace(b,"")):(a.test(j)?(m?k.setAttributeNS(h,j.replace(a,"aaa:"),l):f.call(this,k,j.replace(a,"aaa:"))):f.apply(this,arguments)))};c.fn.removeAttr=function(j){return(a.test(j)?this.each(function(){this.removeAttributeNS(h,j.replace(a,""))}):e.call(this,j))}}c.fn.extend({remove:function(){c("*",this).add(this).each(function(){c(this).triggerHandler("remove")});return i.apply(this,arguments)},enableSelection:function(){return this.attr("unselectable","off").css("MozUserSelect","").unbind("selectstart.ui")},disableSelection:function(){return this.attr("unselectable","on").css("MozUserSelect","none").bind("selectstart.ui",function(){return false})},scrollParent:function(){var j;if((c.browser.msie&&(/(static|relative)/).test(this.css("position")))||(/absolute/).test(this.css("position"))){j=this.parents().filter(function(){return(/(relative|absolute|fixed)/).test(c.curCSS(this,"position",1))&&(/(auto|scroll)/).test(c.curCSS(this,"overflow",1)+c.curCSS(this,"overflow-y",1)+c.curCSS(this,"overflow-x",1))}).eq(0)}else{j=this.parents().filter(function(){return(/(auto|scroll)/).test(c.curCSS(this,"overflow",1)+c.curCSS(this,"overflow-y",1)+c.curCSS(this,"overflow-x",1))}).eq(0)}return(/fixed/).test(this.css("position"))||!j.length?c(document):j}});c.extend(c.expr[":"],{data:function(l,k,j){return !!c.data(l,j[3])},focusable:function(k){var l=k.nodeName.toLowerCase(),j=c.attr(k,"tabindex");return(/input|select|textarea|button|object/.test(l)?!k.disabled:"a"==l||"area"==l?k.href||!isNaN(j):!isNaN(j))&&!c(k)["area"==l?"parents":"closest"](":hidden").length},tabbable:function(k){var j=c.attr(k,"tabindex");return(isNaN(j)||j>=0)&&c(k).is(":focusable")}});function g(m,n,o,l){function k(q){var p=c[m][n][q]||[];return(typeof p=="string"?p.split(/,?\s+/):p)}var j=k("getter");if(l.length==1&&typeof l[0]=="string"){j=j.concat(k("getterSetter"))}return(c.inArray(o,j)!=-1)}c.widget=function(k,j){var l=k.split(".")[0];k=k.split(".")[1];c.fn[k]=function(p){var n=(typeof p=="string"),o=Array.prototype.slice.call(arguments,1);if(n&&p.substring(0,1)=="_"){return this}if(n&&g(l,k,p,o)){var m=c.data(this[0],k);return(m?m[p].apply(m,o):undefined)}return this.each(function(){var q=c.data(this,k);(!q&&!n&&c.data(this,k,new c[l][k](this,p))._init());(q&&n&&c.isFunction(q[p])&&q[p].apply(q,o))})};c[l]=c[l]||{};c[l][k]=function(o,n){var m=this;this.namespace=l;this.widgetName=k;this.widgetEventPrefix=c[l][k].eventPrefix||k;this.widgetBaseClass=l+"-"+k;this.options=c.extend({},c.widget.defaults,c[l][k].defaults,c.metadata&&c.metadata.get(o)[k],n);this.element=c(o).bind("setData."+k,function(q,p,r){if(q.target==o){return m._setData(p,r)}}).bind("getData."+k,function(q,p){if(q.target==o){return m._getData(p)}}).bind("remove",function(){return m.destroy()})};c[l][k].prototype=c.extend({},c.widget.prototype,j);c[l][k].getterSetter="option"};c.widget.prototype={_init:function(){},destroy:function(){this.element.removeData(this.widgetName).removeClass(this.widgetBaseClass+"-disabled "+this.namespace+"-state-disabled").removeAttr("aria-disabled")},option:function(l,m){var k=l,j=this;if(typeof l=="string"){if(m===undefined){return this._getData(l)}k={};k[l]=m}c.each(k,function(n,o){j._setData(n,o)})},_getData:function(j){return this.options[j]},_setData:function(j,k){this.options[j]=k;if(j=="disabled"){this.element[k?"addClass":"removeClass"](this.widgetBaseClass+"-disabled "+this.namespace+"-state-disabled").attr("aria-disabled",k)}},enable:function(){this._setData("disabled",false)},disable:function(){this._setData("disabled",true)},_trigger:function(l,m,n){var p=this.options[l],j=(l==this.widgetEventPrefix?l:this.widgetEventPrefix+l);m=c.Event(m);m.type=j;if(m.originalEvent){for(var k=c.event.props.length,o;k;){o=c.event.props[--k];m[o]=m.originalEvent[o]}}this.element.trigger(m,n);return !(c.isFunction(p)&&p.call(this.element[0],m,n)===false||m.isDefaultPrevented())}};c.widget.defaults={disabled:false};c.ui.mouse={_mouseInit:function(){var j=this;this.element.bind("mousedown."+this.widgetName,function(k){return j._mouseDown(k)}).bind("click."+this.widgetName,function(k){if(j._preventClickEvent){j._preventClickEvent=false;k.stopImmediatePropagation();return false}});if(c.browser.msie){this._mouseUnselectable=this.element.attr("unselectable");this.element.attr("unselectable","on")}this.started=false},_mouseDestroy:function(){this.element.unbind("."+this.widgetName);(c.browser.msie&&this.element.attr("unselectable",this._mouseUnselectable))},_mouseDown:function(l){l.originalEvent=l.originalEvent||{};if(l.originalEvent.mouseHandled){return}(this._mouseStarted&&this._mouseUp(l));this._mouseDownEvent=l;var k=this,m=(l.which==1),j=(typeof this.options.cancel=="string"?c(l.target).parents().add(l.target).filter(this.options.cancel).length:false);if(!m||j||!this._mouseCapture(l)){return true}this.mouseDelayMet=!this.options.delay;if(!this.mouseDelayMet){this._mouseDelayTimer=setTimeout(function(){k.mouseDelayMet=true},this.options.delay)}if(this._mouseDistanceMet(l)&&this._mouseDelayMet(l)){this._mouseStarted=(this._mouseStart(l)!==false);if(!this._mouseStarted){l.preventDefault();return true}}this._mouseMoveDelegate=function(n){return k._mouseMove(n)};this._mouseUpDelegate=function(n){return k._mouseUp(n)};c(document).bind("mousemove."+this.widgetName,this._mouseMoveDelegate).bind("mouseup."+this.widgetName,this._mouseUpDelegate);(c.browser.safari||l.preventDefault());l.originalEvent.mouseHandled=true;return true},_mouseMove:function(j){if(c.browser.msie&&!j.button){return this._mouseUp(j)}if(this._mouseStarted){this._mouseDrag(j);return j.preventDefault()}if(this._mouseDistanceMet(j)&&this._mouseDelayMet(j)){this._mouseStarted=(this._mouseStart(this._mouseDownEvent,j)!==false);(this._mouseStarted?this._mouseDrag(j):this._mouseUp(j))}return !this._mouseStarted},_mouseUp:function(j){c(document).unbind("mousemove."+this.widgetName,this._mouseMoveDelegate).unbind("mouseup."+this.widgetName,this._mouseUpDelegate);if(this._mouseStarted){this._mouseStarted=false;this._preventClickEvent=(j.target==this._mouseDownEvent.target);this._mouseStop(j)}return false},_mouseDistanceMet:function(j){return(Math.max(Math.abs(this._mouseDownEvent.pageX-j.pageX),Math.abs(this._mouseDownEvent.pageY-j.pageY))>=this.options.distance)},_mouseDelayMet:function(j){return this.mouseDelayMet},_mouseStart:function(j){},_mouseDrag:function(j){},_mouseStop:function(j){},_mouseCapture:function(j){return true}};c.ui.mouse.defaults={cancel:null,distance:1,delay:0}})(jQuery);;/* * jQuery UI Resizable 1.7.2 * * Copyright (c) 2009 AUTHORS.txt (http://jqueryui.com/about) * Dual licensed under the MIT (MIT-LICENSE.txt) * and GPL (GPL-LICENSE.txt) licenses. * * http://docs.jquery.com/UI/Resizables * * Depends: * ui.core.js */ (function(c){c.widget("ui.resizable",c.extend({},c.ui.mouse,{_init:function(){var e=this,j=this.options;this.element.addClass("ui-resizable");c.extend(this,{_aspectRatio:!!(j.aspectRatio),aspectRatio:j.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:j.helper||j.ghost||j.animate?j.helper||"ui-resizable-helper":null});if(this.element[0].nodeName.match(/canvas|textarea|input|select|button|img/i)){if(/relative/.test(this.element.css("position"))&&c.browser.opera){this.element.css({position:"relative",top:"auto",left:"auto"})}this.element.wrap(c('
').css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")}));this.element=this.element.parent().data("resizable",this.element.data("resizable"));this.elementIsWrapper=true;this.element.css({marginLeft:this.originalElement.css("marginLeft"),marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom")});this.originalElement.css({marginLeft:0,marginTop:0,marginRight:0,marginBottom:0});this.originalResizeStyle=this.originalElement.css("resize");this.originalElement.css("resize","none");this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"}));this.originalElement.css({margin:this.originalElement.css("margin")});this._proportionallyResize()}this.handles=j.handles||(!c(".ui-resizable-handle",this.element).length?"e,s,se":{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"});if(this.handles.constructor==String){if(this.handles=="all"){this.handles="n,e,s,w,se,sw,ne,nw"}var k=this.handles.split(",");this.handles={};for(var f=0;f
');if(/sw|se|ne|nw/.test(h)){g.css({zIndex:++j.zIndex})}if("se"==h){g.addClass("ui-icon ui-icon-gripsmall-diagonal-se")}this.handles[h]=".ui-resizable-"+h;this.element.append(g)}}this._renderAxis=function(p){p=p||this.element;for(var m in this.handles){if(this.handles[m].constructor==String){this.handles[m]=c(this.handles[m],this.element).show()}if(this.elementIsWrapper&&this.originalElement[0].nodeName.match(/textarea|input|select|button/i)){var n=c(this.handles[m],this.element),o=0;o=/sw|ne|nw|se|n|s/.test(m)?n.outerHeight():n.outerWidth();var l=["padding",/ne|nw|n/.test(m)?"Top":/se|sw|s/.test(m)?"Bottom":/^e$/.test(m)?"Right":"Left"].join("");p.css(l,o);this._proportionallyResize()}if(!c(this.handles[m]).length){continue}}};this._renderAxis(this.element);this._handles=c(".ui-resizable-handle",this.element).disableSelection();this._handles.mouseover(function(){if(!e.resizing){if(this.className){var i=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)}e.axis=i&&i[1]?i[1]:"se"}});if(j.autoHide){this._handles.hide();c(this.element).addClass("ui-resizable-autohide").hover(function(){c(this).removeClass("ui-resizable-autohide");e._handles.show()},function(){if(!e.resizing){c(this).addClass("ui-resizable-autohide");e._handles.hide()}})}this._mouseInit()},destroy:function(){this._mouseDestroy();var d=function(f){c(f).removeClass("ui-resizable ui-resizable-disabled ui-resizable-resizing").removeData("resizable").unbind(".resizable").find(".ui-resizable-handle").remove()};if(this.elementIsWrapper){d(this.element);var e=this.element;e.parent().append(this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")})).end().remove()}this.originalElement.css("resize",this.originalResizeStyle);d(this.originalElement)},_mouseCapture:function(e){var f=false;for(var d in this.handles){if(c(this.handles[d])[0]==e.target){f=true}}return this.options.disabled||!!f},_mouseStart:function(f){var i=this.options,e=this.element.position(),d=this.element;this.resizing=true;this.documentScroll={top:c(document).scrollTop(),left:c(document).scrollLeft()};if(d.is(".ui-draggable")||(/absolute/).test(d.css("position"))){d.css({position:"absolute",top:e.top,left:e.left})}if(c.browser.opera&&(/relative/).test(d.css("position"))){d.css({position:"relative",top:"auto",left:"auto"})}this._renderProxy();var j=b(this.helper.css("left")),g=b(this.helper.css("top"));if(i.containment){j+=c(i.containment).scrollLeft()||0;g+=c(i.containment).scrollTop()||0}this.offset=this.helper.offset();this.position={left:j,top:g};this.size=this._helper?{width:d.outerWidth(),height:d.outerHeight()}:{width:d.width(),height:d.height()};this.originalSize=this._helper?{width:d.outerWidth(),height:d.outerHeight()}:{width:d.width(),height:d.height()};this.originalPosition={left:j,top:g};this.sizeDiff={width:d.outerWidth()-d.width(),height:d.outerHeight()-d.height()};this.originalMousePosition={left:f.pageX,top:f.pageY};this.aspectRatio=(typeof i.aspectRatio=="number")?i.aspectRatio:((this.originalSize.width/this.originalSize.height)||1);var h=c(".ui-resizable-"+this.axis).css("cursor");c("body").css("cursor",h=="auto"?this.axis+"-resize":h);d.addClass("ui-resizable-resizing");this._propagate("start",f);return true},_mouseDrag:function(d){var g=this.helper,f=this.options,l={},p=this,i=this.originalMousePosition,m=this.axis;var q=(d.pageX-i.left)||0,n=(d.pageY-i.top)||0;var h=this._change[m];if(!h){return false}var k=h.apply(this,[d,q,n]),j=c.browser.msie&&c.browser.version<7,e=this.sizeDiff;if(this._aspectRatio||d.shiftKey){k=this._updateRatio(k,d)}k=this._respectSize(k,d);this._propagate("resize",d);g.css({top:this.position.top+"px",left:this.position.left+"px",width:this.size.width+"px",height:this.size.height+"px"});if(!this._helper&&this._proportionallyResizeElements.length){this._proportionallyResize()}this._updateCache(k);this._trigger("resize",d,this.ui());return false},_mouseStop:function(g){this.resizing=false;var h=this.options,l=this;if(this._helper){var f=this._proportionallyResizeElements,d=f.length&&(/textarea/i).test(f[0].nodeName),e=d&&c.ui.hasScroll(f[0],"left")?0:l.sizeDiff.height,j=d?0:l.sizeDiff.width;var m={width:(l.size.width-j),height:(l.size.height-e)},i=(parseInt(l.element.css("left"),10)+(l.position.left-l.originalPosition.left))||null,k=(parseInt(l.element.css("top"),10)+(l.position.top-l.originalPosition.top))||null;if(!h.animate){this.element.css(c.extend(m,{top:k,left:i}))}l.helper.height(l.size.height);l.helper.width(l.size.width);if(this._helper&&!h.animate){this._proportionallyResize()}}c("body").css("cursor","auto");this.element.removeClass("ui-resizable-resizing");this._propagate("stop",g);if(this._helper){this.helper.remove()}return false},_updateCache:function(d){var e=this.options;this.offset=this.helper.offset();if(a(d.left)){this.position.left=d.left}if(a(d.top)){this.position.top=d.top}if(a(d.height)){this.size.height=d.height}if(a(d.width)){this.size.width=d.width}},_updateRatio:function(g,f){var h=this.options,i=this.position,e=this.size,d=this.axis;if(g.height){g.width=(e.height*this.aspectRatio)}else{if(g.width){g.height=(e.width/this.aspectRatio)}}if(d=="sw"){g.left=i.left+(e.width-g.width);g.top=null}if(d=="nw"){g.top=i.top+(e.height-g.height);g.left=i.left+(e.width-g.width)}return g},_respectSize:function(k,f){var i=this.helper,h=this.options,q=this._aspectRatio||f.shiftKey,p=this.axis,s=a(k.width)&&h.maxWidth&&(h.maxWidthk.width),r=a(k.height)&&h.minHeight&&(h.minHeight>k.height);if(g){k.width=h.minWidth}if(r){k.height=h.minHeight}if(s){k.width=h.maxWidth}if(l){k.height=h.maxHeight}var e=this.originalPosition.left+this.originalSize.width,n=this.position.top+this.size.height;var j=/sw|nw|w/.test(p),d=/nw|ne|n/.test(p);if(g&&j){k.left=e-h.minWidth}if(s&&j){k.left=e-h.maxWidth}if(r&&d){k.top=n-h.minHeight}if(l&&d){k.top=n-h.maxHeight}var m=!k.width&&!k.height;if(m&&!k.left&&k.top){k.top=null}else{if(m&&!k.top&&k.left){k.left=null}}return k},_proportionallyResize:function(){var j=this.options;if(!this._proportionallyResizeElements.length){return}var f=this.helper||this.element;for(var e=0;e');var d=c.browser.msie&&c.browser.version<7,f=(d?1:0),g=(d?2:-1);this.helper.addClass(this._helper).css({width:this.element.outerWidth()+g,height:this.element.outerHeight()+g,position:"absolute",left:this.elementOffset.left-f+"px",top:this.elementOffset.top-f+"px",zIndex:++h.zIndex});this.helper.appendTo("body").disableSelection()}else{this.helper=this.element}},_change:{e:function(f,e,d){return{width:this.originalSize.width+e}},w:function(g,e,d){var i=this.options,f=this.originalSize,h=this.originalPosition;return{left:h.left+e,width:f.width-e}},n:function(g,e,d){var i=this.options,f=this.originalSize,h=this.originalPosition;return{top:h.top+d,height:f.height-d}},s:function(f,e,d){return{height:this.originalSize.height+d}},se:function(f,e,d){return c.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[f,e,d]))},sw:function(f,e,d){return c.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[f,e,d]))},ne:function(f,e,d){return c.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[f,e,d]))},nw:function(f,e,d){return c.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[f,e,d]))}},_propagate:function(e,d){c.ui.plugin.call(this,e,[d,this.ui()]);(e!="resize"&&this._trigger(e,d,this.ui()))},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}));c.extend(c.ui.resizable,{version:"1.7.2",eventPrefix:"resize",defaults:{alsoResize:false,animate:false,animateDuration:"slow",animateEasing:"swing",aspectRatio:false,autoHide:false,cancel:":input,option",containment:false,delay:0,distance:1,ghost:false,grid:false,handles:"e,s,se",helper:false,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:1000}});c.ui.plugin.add("resizable","alsoResize",{start:function(e,f){var d=c(this).data("resizable"),g=d.options;_store=function(h){c(h).each(function(){c(this).data("resizable-alsoresize",{width:parseInt(c(this).width(),10),height:parseInt(c(this).height(),10),left:parseInt(c(this).css("left"),10),top:parseInt(c(this).css("top"),10)})})};if(typeof(g.alsoResize)=="object"&&!g.alsoResize.parentNode){if(g.alsoResize.length){g.alsoResize=g.alsoResize[0];_store(g.alsoResize)}else{c.each(g.alsoResize,function(h,i){_store(h)})}}else{_store(g.alsoResize)}},resize:function(f,h){var e=c(this).data("resizable"),i=e.options,g=e.originalSize,k=e.originalPosition;var j={height:(e.size.height-g.height)||0,width:(e.size.width-g.width)||0,top:(e.position.top-k.top)||0,left:(e.position.left-k.left)||0},d=function(l,m){c(l).each(function(){var p=c(this),q=c(this).data("resizable-alsoresize"),o={},n=m&&m.length?m:["width","height","top","left"];c.each(n||["width","height","top","left"],function(r,t){var s=(q[t]||0)+(j[t]||0);if(s&&s>=0){o[t]=s||null}});if(/relative/.test(p.css("position"))&&c.browser.opera){e._revertToRelativePosition=true;p.css({position:"absolute",top:"auto",left:"auto"})}p.css(o)})};if(typeof(i.alsoResize)=="object"&&!i.alsoResize.nodeType){c.each(i.alsoResize,function(l,m){d(l,m)})}else{d(i.alsoResize)}},stop:function(e,f){var d=c(this).data("resizable");if(d._revertToRelativePosition&&c.browser.opera){d._revertToRelativePosition=false;el.css({position:"relative"})}c(this).removeData("resizable-alsoresize-start")}});c.ui.plugin.add("resizable","animate",{stop:function(h,m){var n=c(this).data("resizable"),i=n.options;var g=n._proportionallyResizeElements,d=g.length&&(/textarea/i).test(g[0].nodeName),e=d&&c.ui.hasScroll(g[0],"left")?0:n.sizeDiff.height,k=d?0:n.sizeDiff.width;var f={width:(n.size.width-k),height:(n.size.height-e)},j=(parseInt(n.element.css("left"),10)+(n.position.left-n.originalPosition.left))||null,l=(parseInt(n.element.css("top"),10)+(n.position.top-n.originalPosition.top))||null;n.element.animate(c.extend(f,l&&j?{top:l,left:j}:{}),{duration:i.animateDuration,easing:i.animateEasing,step:function(){var o={width:parseInt(n.element.css("width"),10),height:parseInt(n.element.css("height"),10),top:parseInt(n.element.css("top"),10),left:parseInt(n.element.css("left"),10)};if(g&&g.length){c(g[0]).css({width:o.width,height:o.height})}n._updateCache(o);n._propagate("resize",h)}})}});c.ui.plugin.add("resizable","containment",{start:function(e,q){var s=c(this).data("resizable"),i=s.options,k=s.element;var f=i.containment,j=(f instanceof c)?f.get(0):(/parent/.test(f))?k.parent().get(0):f;if(!j){return}s.containerElement=c(j);if(/document/.test(f)||f==document){s.containerOffset={left:0,top:0};s.containerPosition={left:0,top:0};s.parentData={element:c(document),left:0,top:0,width:c(document).width(),height:c(document).height()||document.body.parentNode.scrollHeight}}else{var m=c(j),h=[];c(["Top","Right","Left","Bottom"]).each(function(p,o){h[p]=b(m.css("padding"+o))});s.containerOffset=m.offset();s.containerPosition=m.position();s.containerSize={height:(m.innerHeight()-h[3]),width:(m.innerWidth()-h[1])};var n=s.containerOffset,d=s.containerSize.height,l=s.containerSize.width,g=(c.ui.hasScroll(j,"left")?j.scrollWidth:l),r=(c.ui.hasScroll(j)?j.scrollHeight:d);s.parentData={element:j,left:n.left,top:n.top,width:g,height:r}}},resize:function(f,p){var s=c(this).data("resizable"),h=s.options,e=s.containerSize,n=s.containerOffset,l=s.size,m=s.position,q=s._aspectRatio||f.shiftKey,d={top:0,left:0},g=s.containerElement;if(g[0]!=document&&(/static/).test(g.css("position"))){d=n}if(m.left<(s._helper?n.left:0)){s.size.width=s.size.width+(s._helper?(s.position.left-n.left):(s.position.left-d.left));if(q){s.size.height=s.size.width/h.aspectRatio}s.position.left=h.helper?n.left:0}if(m.top<(s._helper?n.top:0)) {s.size.height=s.size.height+(s._helper?(s.position.top-n.top):s.position.top);if(q){s.size.width=s.size.height*h.aspectRatio}s.position.top=s._helper?n.top:0}s.offset.left=s.parentData.left+s.position.left;s.offset.top=s.parentData.top+s.position.top;var k=Math.abs((s._helper?s.offset.left-d.left:(s.offset.left-d.left))+s.sizeDiff.width),r=Math.abs((s._helper?s.offset.top-d.top:(s.offset.top-n.top))+s.sizeDiff.height);var j=s.containerElement.get(0)==s.element.parent().get(0),i=/relative|absolute/.test(s.containerElement.css("position"));if(j&&i){k-=s.parentData.left}if(k+s.size.width>=s.parentData.width){s.size.width=s.parentData.width-k;if(q){s.size.height=s.size.width/s.aspectRatio}}if(r+s.size.height>=s.parentData.height){s.size.height=s.parentData.height-r;if(q){s.size.width=s.size.height*s.aspectRatio}}},stop:function(e,m){var p=c(this).data("resizable"),f=p.options,k=p.position,l=p.containerOffset,d=p.containerPosition,g=p.containerElement;var i=c(p.helper),q=i.offset(),n=i.outerWidth()-p.sizeDiff.width,j=i.outerHeight()-p.sizeDiff.height;if(p._helper&&!f.animate&&(/relative/).test(g.css("position"))){c(this).css({left:q.left-d.left-l.left,width:n,height:j})}if(p._helper&&!f.animate&&(/static/).test(g.css("position"))){c(this).css({left:q.left-d.left-l.left,width:n,height:j})}}});c.ui.plugin.add("resizable","ghost",{start:function(f,g){var d=c(this).data("resizable"),h=d.options,e=d.size;d.ghost=d.originalElement.clone();d.ghost.css({opacity:0.25,display:"block",position:"relative",height:e.height,width:e.width,margin:0,left:0,top:0}).addClass("ui-resizable-ghost").addClass(typeof h.ghost=="string"?h.ghost:"");d.ghost.appendTo(d.helper)},resize:function(e,f){var d=c(this).data("resizable"),g=d.options;if(d.ghost){d.ghost.css({position:"relative",height:d.size.height,width:d.size.width})}},stop:function(e,f){var d=c(this).data("resizable"),g=d.options;if(d.ghost&&d.helper){d.helper.get(0).removeChild(d.ghost.get(0))}}});c.ui.plugin.add("resizable","grid",{resize:function(d,l){var n=c(this).data("resizable"),g=n.options,j=n.size,h=n.originalSize,i=n.originalPosition,m=n.axis,k=g._aspectRatio||d.shiftKey;g.grid=typeof g.grid=="number"?[g.grid,g.grid]:g.grid;var f=Math.round((j.width-h.width)/(g.grid[0]||1))*(g.grid[0]||1),e=Math.round((j.height-h.height)/(g.grid[1]||1))*(g.grid[1]||1);if(/^(se|s|e)$/.test(m)){n.size.width=h.width+f;n.size.height=h.height+e}else{if(/^(ne)$/.test(m)){n.size.width=h.width+f;n.size.height=h.height+e;n.position.top=i.top-e}else{if(/^(sw)$/.test(m)){n.size.width=h.width+f;n.size.height=h.height+e;n.position.left=i.left-f}else{n.size.width=h.width+f;n.size.height=h.height+e;n.position.top=i.top-e;n.position.left=i.left-f}}}}});var b=function(d){return parseInt(d,10)||0};var a=function(d){return !isNaN(parseInt(d,10))}})(jQuery);; /** * jQuery.ScrollTo - Easy element scrolling using jQuery. * Copyright (c) 2008 Ariel Flesler - aflesler(at)gmail(dot)com * Licensed under GPL license (http://www.opensource.org/licenses/gpl-license.php). * Date: 2/8/2008 * @author Ariel Flesler * @version 1.3.2 */ ;(function($){var o=$.scrollTo=function(a,b,c){o.window().scrollTo(a,b,c)};o.defaults={axis:'y',duration:1};o.window=function(){return $($.browser.safari?'body':'html')};$.fn.scrollTo=function(l,m,n){if(typeof m=='object'){n=m;m=0}n=$.extend({},o.defaults,n);m=m||n.speed||n.duration;n.queue=n.queue&&n.axis.length>1;if(n.queue)m/=2;n.offset=j(n.offset);n.over=j(n.over);return this.each(function(){var a=this,b=$(a),t=l,c,d={},w=b.is('html,body');switch(typeof t){case'number':case'string':if(/^([+-]=)?\d+(px)?$/.test(t)){t=j(t);break}t=$(t,this);case'object':if(t.is||t.style)c=(t=$(t)).offset()}$.each(n.axis.split(''),function(i,f){var P=f=='x'?'Left':'Top',p=P.toLowerCase(),k='scroll'+P,e=a[k],D=f=='x'?'Width':'Height';if(c){d[k]=c[p]+(w?0:e-b.offset()[p]);if(n.margin){d[k]-=parseInt(t.css('margin'+P))||0;d[k]-=parseInt(t.css('border'+P+'Width'))||0}d[k]+=n.offset[p]||0;if(n.over[p])d[k]+=t[D.toLowerCase()]()*n.over[p]}else d[k]=t[p];if(/^\d+$/.test(d[k]))d[k]=d[k]<=0?0:Math.min(d[k],h(D));if(!i&&n.queue){if(e!=d[k])g(n.onAfterFirst);delete d[k]}});g(n.onAfter);function g(a){b.animate(d,m,n.easing,a&&function(){a.call(this,l)})};function h(D){var b=w?$.browser.opera?document.body:document.documentElement:a;return b['scroll'+D]-b['client'+D]}})};function j(a){return typeof a=='object'?a:{top:a,left:a}}})(jQuery); incron-0.5.10/doc/html/incron_8h_source.html0000644000175000001440000000713111737665757017477 0ustar lukusers incron: incron.h Source File
incron  0.5.10
incron.h
Go to the documentation of this file.
00001 
00003 
00017 #ifndef _INCRON_H_
00018 #define _INCRON_H_
00019 
00021 #define INCRON_NAME "incron"
00022 
00024 #define INCROND_NAME "incrond"
00025 
00027 #define INCRONTAB_NAME "incrontab"
00028 
00030 #define INCRON_VERSION "0.5.10"
00031 
00033 #define INCRON_BUG_ADDRESS "<bugs@aiken.cz>"
00034 
00036 #define INCRON_CONFIG "/etc/incron.conf"
00037 
00038 
00039 #endif //_INCRON_H_
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/open.png0000644000175000001440000000016611737665757015012 0ustar lukusersPNG  IHDR =IDATx1 ت@@ ]01QXY~Jr?D>n F͐ }\ áIENDB`incron-0.5.10/doc/html/usertable_8h_source.html0000644000175000001440000004237211737665757020203 0ustar lukusers incron: usertable.h Source File
incron  0.5.10
usertable.h
Go to the documentation of this file.
00001 
00003 
00016 #ifndef _USERTABLE_H_
00017 #define _USERTABLE_H_
00018 
00019 #include <map>
00020 #include <deque>
00021 #include <sys/poll.h>
00022 
00023 #include "inotify-cxx.h"
00024 #include "incrontab.h"
00025 
00026 
00027 class UserTable;
00028 
00030 typedef std::map<std::string, UserTable*> SUT_MAP;
00031 
00033 typedef void (*proc_done_cb)(InotifyWatch*);
00034 
00036 typedef struct
00037 {
00038   proc_done_cb onDone;  
00039   InotifyWatch* pWatch; 
00040 } ProcData_t;
00041 
00043 typedef std::map<int, UserTable*> FDUT_MAP;
00044 
00046 typedef std::map<InotifyWatch*, IncronTabEntry*> IWCE_MAP;
00047 
00049 typedef std::map<pid_t, ProcData_t> PROC_MAP;
00050 
00052 
00055 class EventDispatcher
00056 {
00057 public:
00059 
00065   EventDispatcher(int iPipeFd, Inotify* pIn, InotifyWatch* pSys, InotifyWatch* pUser);
00066   
00068   ~EventDispatcher();
00069 
00071 
00074   bool ProcessEvents();
00075   
00077 
00080   void Register(UserTable* pTab);
00081   
00083 
00086   void Unregister(UserTable* pTab);
00087   
00089 
00092   inline size_t GetSize() const
00093   {
00094     return m_size;
00095   }
00096   
00098 
00101   inline struct pollfd* GetPollData()
00102   {
00103     return m_pPoll;
00104   }
00105   
00107   void Rebuild();
00108   
00110 
00113   inline void Clear()
00114   {
00115     m_maps.clear();
00116   }
00117   
00118 private:
00119   int m_iPipeFd;    
00120   int m_iMgmtFd;    
00121   Inotify* m_pIn;   
00122   InotifyWatch* m_pSys;   
00123   InotifyWatch* m_pUser;  
00124   FDUT_MAP m_maps;  
00125   size_t m_size;    
00126   struct pollfd* m_pPoll; 
00127   
00129   void ProcessMgmtEvents();
00130 };
00131 
00132 
00134 
00139 class UserTable
00140 {
00141 public:
00143 
00148   UserTable(EventDispatcher* pEd, const std::string& rUser, bool fSysTable);
00149   
00151   virtual ~UserTable();
00152   
00154 
00159   void Load();
00160   
00162 
00166   void Dispose();
00167   
00169 
00172   void OnEvent(InotifyEvent& rEvt);
00173   
00175 
00179   static void FinishDone();
00180   
00182 
00189   bool MayAccess(const std::string& rPath, bool fNoFollow) const;
00190   
00192 
00195   bool IsSystem() const;
00196   
00198 
00201   Inotify* GetInotify()
00202   {
00203     return &m_in;
00204   }
00205   
00207 
00217   inline static bool CheckUser(const char* user)
00218   {
00219     struct passwd* pw = getpwnam(user);
00220     if (pw == NULL)
00221       return false;
00222       
00223     return IncronTab::CheckUser(user);
00224   }
00225   
00227 
00230   void RunAsUser(char* const* argv) const;
00231   
00232 private:
00233   Inotify m_in;           
00234   EventDispatcher* m_pEd; 
00235   std::string m_user;     
00236   bool m_fSysTable;       
00237   IncronTab m_tab;        
00238   IWCE_MAP m_map;         
00239 
00240   static PROC_MAP s_procMap;  
00241   
00243 
00247   IncronTabEntry* FindEntry(InotifyWatch* pWatch);
00248   
00250 
00256   bool PrepareArgs(const std::string& rCmd, int& argc, char**& argv);
00257   
00259 
00263   void CleanupArgs(int argc, char** argv);
00264   
00265 };
00266 
00267 #endif //_USERTABLE_H_
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classUserTable-members.html0000644000175000001440000001026711737665757020600 0ustar lukusers incron: Member List
UserTable Member List
This is the complete list of members for UserTable, including all inherited members.
CheckUser(const char *user)UserTable [inline, static]
Dispose()UserTable
FinishDone()UserTable [static]
GetInotify()UserTable [inline]
IsSystem() const UserTable
Load()UserTable
MayAccess(const std::string &rPath, bool fNoFollow) const UserTable
OnEvent(InotifyEvent &rEvt)UserTable
RunAsUser(char *const *argv) const UserTable
UserTable(EventDispatcher *pEd, const std::string &rUser, bool fSysTable)UserTable
~UserTable()UserTable [virtual]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classAppInstException-members.html0000644000175000001440000000445211737665757022146 0ustar lukusers incron: Member List
AppInstException Member List
This is the complete list of members for AppInstException, including all inherited members.
AppInstException(int iErr)AppInstException [inline]
GetErrorNumber() const AppInstException [inline]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/structAppArgOption__t.html0000644000175000001440000001540411737665757020524 0ustar lukusers incron: AppArgOption_t Struct Reference
Public Attributes
AppArgOption_t Struct Reference

Argument option type. More...

#include <appargs.h>

List of all members.

Public Attributes

AppArgType_t type
 argument type
bool mand
 mandatory yes/no
bool found
 found in argument vector
std::string val
 value
bool hasVal
 value is set

Detailed Description

Argument option type.

Member Data Documentation

bool AppArgOption_t::found

found in argument vector

bool AppArgOption_t::hasVal

value is set

bool AppArgOption_t::mand

mandatory yes/no

AppArgType_t AppArgOption_t::type

argument type

std::string AppArgOption_t::val

value

The documentation for this struct was generated from the following file:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/appargs_8cpp.html0000644000175000001440000000564011737665757016622 0ustar lukusers incron: appargs.cpp File Reference
appargs.cpp File Reference

application arguments processor implementation More...

#include <cstdio>
#include <cstring>
#include "strtok.h"
#include "appargs.h"

Detailed Description

application arguments processor implementation

application arguments processor

Copyright (C) 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Credits: Christian Ruppert (new include to build with GCC 4.4+)

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classIncronTab.html0000644000175000001440000004334711737665757017146 0ustar lukusers incron: IncronTab Class Reference
Public Member Functions | Static Public Member Functions | Protected Attributes
IncronTab Class Reference

Incron table class. More...

#include <incrontab.h>

List of all members.

Public Member Functions

 IncronTab ()
 Constructor.
 ~IncronTab ()
 Destructor.
void Add (const IncronTabEntry &rEntry)
 Add an entry to the table.
void Clear ()
 Removes all entries.
bool IsEmpty () const
 Checks whether the table is empty.
int GetCount () const
 Returns the count of entries.
IncronTabEntry & GetEntry (int index)
 Returns an entry.
bool Load (const std::string &rPath)
 Loads the table.
bool Save (const std::string &rPath)
 Saves the table.

Static Public Member Functions

static bool CheckUser (const std::string &rUser)
 Checks whether an user has permission to use incron.
static std::string GetUserTablePath (const std::string &rUser)
 Composes a path to an user incron table file.
static std::string GetSystemTablePath (const std::string &rName)
 Composes a path to a system incron table file.

Protected Attributes

std::deque< IncronTabEntry > m_tab
 incron table

Detailed Description

Incron table class.

Constructor & Destructor Documentation

IncronTab::IncronTab ( ) [inline]

Constructor.

IncronTab::~IncronTab ( ) [inline]

Destructor.

Member Function Documentation

void IncronTab::Add ( const IncronTabEntry &  rEntry) [inline]

Add an entry to the table.

Parameters:
[in]rEntrytable entry
bool IncronTab::CheckUser ( const std::string &  rUser) [static]

Checks whether an user has permission to use incron.

Parameters:
[in]rUseruser name
Returns:
true = permission OK, false = otherwise
void IncronTab::Clear ( ) [inline]

Removes all entries.

int IncronTab::GetCount ( ) const [inline]

Returns the count of entries.

Returns:
count of entries
IncronTabEntry& IncronTab::GetEntry ( int  index) [inline]

Returns an entry.

Returns:
reference to the entry for the given index
Attention:
This method doesn't test index bounds. If you pass an invalid value the program may crash and/or behave unpredictible way!
std::string IncronTab::GetSystemTablePath ( const std::string &  rName) [static]

Composes a path to a system incron table file.

Parameters:
[in]rNametable name (pseudouser)
Returns:
path to the table file
Attention:
No tests (existence, permission etc.) are done.
std::string IncronTab::GetUserTablePath ( const std::string &  rUser) [static]

Composes a path to an user incron table file.

Parameters:
[in]rUseruser name
Returns:
path to the table file
Attention:
No tests (existence, permission etc.) are done.
bool IncronTab::IsEmpty ( ) const [inline]

Checks whether the table is empty.

Returns:
true = empty, false = otherwise
bool IncronTab::Load ( const std::string &  rPath)

Loads the table.

Parameters:
[in]rPathpath to a source table file
Returns:
true = success, false = failure
bool IncronTab::Save ( const std::string &  rPath)

Saves the table.

Parameters:
[in]rPathpath to a destination table file
Returns:
true = success, false = failure

Member Data Documentation

std::deque<IncronTabEntry> IncronTab::m_tab [protected]

incron table

The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/icd-main_8cpp.html0000644000175000001440000006205511737665757016651 0ustar lukusers incron: icd-main.cpp File Reference
Defines | Functions | Variables
icd-main.cpp File Reference

inotify cron daemon main file More...

#include <map>
#include <signal.h>
#include <wait.h>
#include <fcntl.h>
#include <pwd.h>
#include <dirent.h>
#include <syslog.h>
#include <errno.h>
#include <sys/poll.h>
#include <sys/stat.h>
#include <cstdio>
#include <cstring>
#include "inotify-cxx.h"
#include "appinst.h"
#include "appargs.h"
#include "incron.h"
#include "incrontab.h"
#include "usertable.h"
#include "incroncfg.h"

Defines

#define INCRON_LOG_OPTS   (LOG_CONS | LOG_PID)
 Logging options (console as fallback, log PID)
#define INCRON_LOG_FACIL   LOG_CRON
 Logging facility (use CRON)
#define INCROND_VERSION   INCROND_NAME " " INCRON_VERSION
 incrond version string
#define INCROND_DESCRIPTION
 incrontab description string
#define INCROND_HELP
 incrontab help string
#define CHILD_PIPE_BUF_LEN   32
#define POLL_EAGAIN_WAIT   3
 Second to wait on EAGAIN.

Functions

void on_signal (int signo)
 Handles a signal.
void load_tables (EventDispatcher *pEd) throw (InotifyException)
 Attempts to load all (user and system) incron tables.
void free_tables (EventDispatcher *pEd)
 Deallocates all memory used by incron tables and unregisters them from the dispatcher.
void prepare_pipe ()
 Prepares a 'dead/done child' notification pipe.
void init_poll_array (struct pollfd pfd[], int pipefd, int infd)
 Checks whether a parameter string is a specific command.
int main (int argc, char **argv)
 Main application function.

Variables

SUT_MAP g_ut
 User name to user table mapping table.
volatile bool g_fFinish = false
 Finish program yes/no.
int g_cldPipe [2]
 Pipe for notifying about dead children.
char g_cldPipeBuf [CHILD_PIPE_BUF_LEN]
bool g_daemon = true
 Daemonize true/false.

Detailed Description

inotify cron daemon main file

inotify cron system

Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Credits: Christian Ruppert (new include to build with GCC 4.4+)

Define Documentation

#define CHILD_PIPE_BUF_LEN   32
#define INCRON_LOG_FACIL   LOG_CRON

Logging facility (use CRON)

#define INCRON_LOG_OPTS   (LOG_CONS | LOG_PID)

Logging options (console as fallback, log PID)

#define INCROND_DESCRIPTION
Value:
"incrond - inotify cron daemon\n" \
                            "(c) Lukas Jelinek, 2006, 2007, 2008"

incrontab description string

#define INCROND_HELP
Value:
INCROND_DESCRIPTION "\n\n" \
          "usage: incrond [<options>]\n\n" \
          "<operation> may be one of the following:\n" \
          "These options may be used:\n" \
          "  -?, --about                  gives short information about program\n" \
          "  -h, --help                   prints this help text\n" \
          "  -n, --foreground             runs on foreground (no daemonizing)\n" \
          "  -k, --kill                   terminates running instance of incrond\n" \
          "  -f <FILE>, --config=<FILE>   overrides default configuration file  (requires root privileges)\n" \
          "  -V, --version                prints program version\n\n" \
          "For reporting bugs please use http://bts.aiken.cz\n"

incrontab help string

#define INCROND_VERSION   INCROND_NAME " " INCRON_VERSION

incrond version string

#define POLL_EAGAIN_WAIT   3

Second to wait on EAGAIN.

Function Documentation

void free_tables ( EventDispatcher *  pEd)

Deallocates all memory used by incron tables and unregisters them from the dispatcher.

Parameters:
[in]pEdevent dispatcher
void init_poll_array ( struct pollfd  pfd[],
int  pipefd,
int  infd 
)

Checks whether a parameter string is a specific command.

The string is accepted if it equals either the short or long form of the command.

Parameters:
[in]schecked string
[in]shortCmdshort form of command
[in]longCmdlong form of command
Returns:
true = string accepted, false = otherwise Initializes a poll array.
Parameters:
[out]pfdpoll structure array
[in]pipefdpipe file descriptor
[in]infdinotify infrastructure file descriptor
void load_tables ( EventDispatcher *  pEd) throw (InotifyException)

Attempts to load all (user and system) incron tables.

Loaded tables are registered for processing events.

Parameters:
[in]pEdinotify event dispatcher
Exceptions:
InotifyExceptionthrown if base table directory cannot be read
int main ( int  argc,
char **  argv 
)

Main application function.

Parameters:
[in]argcargument count
[in]argvargument array
Returns:
0 on success, 1 on error
Attention:
In daemon mode, it finishes immediately.
void on_signal ( int  signo)

Handles a signal.

For SIGTERM and SIGINT it sets the program finish variable. For SIGCHLD it writes a character into the notification pipe (this is a workaround made due to disability to reliably wait for dead children).

Parameters:
[in]signosignal number
void prepare_pipe ( )

Prepares a 'dead/done child' notification pipe.

This function returns no value at all and on error it throws an exception.

Variable Documentation

int g_cldPipe[2]

Pipe for notifying about dead children.

char g_cldPipeBuf[CHILD_PIPE_BUF_LEN]
bool g_daemon = true

Daemonize true/false.

volatile bool g_fFinish = false

Finish program yes/no.

SUT_MAP g_ut

User name to user table mapping table.

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classEventDispatcher.html0000644000175000001440000003225511737665757020353 0ustar lukusers incron: EventDispatcher Class Reference
Public Member Functions
EventDispatcher Class Reference

Event dispatcher class. More...

#include <usertable.h>

List of all members.

Public Member Functions

 EventDispatcher (int iPipeFd, Inotify *pIn, InotifyWatch *pSys, InotifyWatch *pUser)
 Constructor.
 ~EventDispatcher ()
 Destructor.
bool ProcessEvents ()
 Processes events.
void Register (UserTable *pTab)
 Registers an user table.
void Unregister (UserTable *pTab)
 Unregisters an user table.
size_t GetSize () const
 Returns the poll data size.
struct pollfd * GetPollData ()
 Returns the poll data.
void Rebuild ()
 Rebuilds the poll array data.
void Clear ()
 Removes all registered user tables.

Detailed Description

Event dispatcher class.

This class processes events and distributes them as needed.

Constructor & Destructor Documentation

EventDispatcher::EventDispatcher ( int  iPipeFd,
Inotify *  pIn,
InotifyWatch *  pSys,
InotifyWatch *  pUser 
)

Constructor.

Parameters:
[in]iPipeFdpipe descriptor
[in]pIninotify object for table management
[in]pSyswatch for system tables
[in]pUserwatch for user tables
EventDispatcher::~EventDispatcher ( )

Destructor.

Member Function Documentation

void EventDispatcher::Clear ( ) [inline]

Removes all registered user tables.

It doesn't cause poll data rebuilding.

struct pollfd* EventDispatcher::GetPollData ( ) [inline, read]

Returns the poll data.

Returns:
poll data
size_t EventDispatcher::GetSize ( ) const [inline]

Returns the poll data size.

Returns:
poll data size
bool EventDispatcher::ProcessEvents ( )

Processes events.

Returns:
pipe event occurred yes/no
void EventDispatcher::Rebuild ( )

Rebuilds the poll array data.

void EventDispatcher::Register ( UserTable *  pTab)

Registers an user table.

Parameters:
[in]pTabuser table
void EventDispatcher::Unregister ( UserTable *  pTab)

Unregisters an user table.

Parameters:
[in]pTabuser table
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classInotifyEvent-members.html0000644000175000001440000001260211737665757021330 0ustar lukusers incron: Member List
InotifyEvent Member List
This is the complete list of members for InotifyEvent, including all inherited members.
DumpTypes(uint32_t uValue, std::string &rStr)InotifyEvent [static]
DumpTypes(std::string &rStr) const InotifyEvent
GetCookie() const InotifyEvent [inline]
GetDescriptor() const InotifyEvent
GetLength() const InotifyEvent [inline]
GetMask() const InotifyEvent [inline]
GetMaskByName(const std::string &rName)InotifyEvent [static]
GetName() const InotifyEvent [inline]
GetName(std::string &rName) const InotifyEvent [inline]
GetWatch()InotifyEvent [inline]
InotifyEvent()InotifyEvent [inline]
InotifyEvent(const struct inotify_event *pEvt, InotifyWatch *pWatch)InotifyEvent [inline]
IsType(uint32_t uValue, uint32_t uType)InotifyEvent [inline, static]
IsType(uint32_t uType) const InotifyEvent [inline]
~InotifyEvent()InotifyEvent [inline]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/structAppArgOption__t-members.html0000644000175000001440000000551011737665757022151 0ustar lukusers incron: Member List
AppArgOption_t Member List
This is the complete list of members for AppArgOption_t, including all inherited members.
foundAppArgOption_t
hasValAppArgOption_t
mandAppArgOption_t
typeAppArgOption_t
valAppArgOption_t
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classAppArgs.html0000644000175000001440000006763711737665757016634 0ustar lukusers incron: AppArgs Class Reference
Static Public Member Functions | Static Protected Member Functions
AppArgs Class Reference

Application arguments. More...

#include <appargs.h>

List of all members.

Static Public Member Functions

static void Init (size_t valMinCnt=0, size_t valMaxCnt=APPARGS_NOLIMIT)
 Initializes the processor.
static void Destroy ()
 Releases resources allocated by the processor.
static void Parse (int argc, const char *const *argv)
 Parses arguments and builds the appropriate structure.
static bool IsValid ()
 Checks whether the arguments have valid form.
static bool ExistsOption (const std::string &rArg)
 Checks whether an option exists.
static bool GetOption (const std::string &rArg, std::string &rVal)
 Extracts an option value.
static bool AddOption (const std::string &rName, char cShort, AppArgType_t type, bool fMandatory)
 Adds an option.
static size_t GetValueCount ()
 Returns the count of values.
static bool GetValue (size_t index, std::string &rVal)
 Extracts a value.
static void Dump ()
 Dumps information about options and value to STDERR.

Static Protected Member Functions

static bool IsOption (const char *pchStr)
 Checks whether a string is an option.
static bool IsLongOption (const char *pchStr)
 Checks whether a string is a long option.
static bool ParseLong (const char *pchStr, std::string &rName, std::string &rVal, bool &rfHasVal)
 Parses a string and attempts to treat it as a long option.
static void ParseShort (const char *pchStr, char &rcName, std::string &rVal, bool &rfHasVal)
 Parses a string and attempts to treat it as a short option.
static void DumpOption (const std::string &rName, char cShort, AppArgOption_t *pOpt)
 Dumps an option to STDERR.

Detailed Description

Application arguments.

This class is set-up for processing command line arguments. Then it parses these arguments and builds data which can be queried later.

There are two categories of arguments:

  • options (a.k.a. switches)
  • values

Options represent changeable parameters of the application. Values are a kind of input data.

Each option has one of the following types:

  • no value (two-state logic, e.g. running on foreground/background)
  • optional value (e.g. for logging: another file than default can be specified)
  • mandatory value (e.g. custom configuration file)

Each option always have two forms - long one (introcuded by two hyphens, e.g. --edit) and short one (introduced by one hyphen, e.g. -e). These forms are functionally equivalent.

Unknown options are silently ignored.

Member Function Documentation

bool AppArgs::AddOption ( const std::string &  rName,
char  cShort,
AppArgType_t  type,
bool  fMandatory 
) [static]

Adds an option.

This method is intended to be called between initilization and parsing. It adds an option which may (or must) occur inside the argument vector.

Parameters:
[in]rNamelong option name
[in]cShortshort (one-character) option name
[in]typeargument type
[in]fMandatoryoption is mandatory yes/no
Returns:
true = success, false = failure (e.g. option already exists)
void AppArgs::Destroy ( ) [static]

Releases resources allocated by the processor.

This method should be called if the argument values are no longer needed.

void AppArgs::Dump ( ) [static]

Dumps information about options and value to STDERR.

Attention:
This method may be very slow.
void AppArgs::DumpOption ( const std::string &  rName,
char  cShort,
AppArgOption_t *  pOpt 
) [static, protected]

Dumps an option to STDERR.

Parameters:
[in]rNamelong option name
[in]cShortshort option name
[in]pOptoption data
bool AppArgs::ExistsOption ( const std::string &  rArg) [static]

Checks whether an option exists.

Parameters:
[in]rArglong option name
Returns:
true = option exists, false = otherwise
bool AppArgs::GetOption ( const std::string &  rArg,
std::string &  rVal 
) [static]

Extracts an option value.

Parameters:
[in]rArglong option name
[out]rValoption value
Returns:
true = value extracted, false = option not found or has no value
bool AppArgs::GetValue ( size_t  index,
std::string &  rVal 
) [static]

Extracts a value.

Parameters:
[in]indexvalue index
[out]rValextracted value
Returns:
true = value extracted, false = otherwise
size_t AppArgs::GetValueCount ( ) [static]

Returns the count of values.

Returns:
count of values
void AppArgs::Init ( size_t  valMinCnt = 0,
size_t  valMaxCnt = APPARGS_NOLIMIT 
) [static]

Initializes the processor.

Parameters:
[in]valMinCntminimum count of values
[in]valMaxCntmaximum number of values (no effect if lower than valMinCnt)
bool AppArgs::IsLongOption ( const char *  pchStr) [static, protected]

Checks whether a string is a long option.

This methos assumes the string is an option (if not the behavior is undefined).

Parameters:
[in]pchStrtext string
Returns:
true = option, false = otherwise
bool AppArgs::IsOption ( const char *  pchStr) [static, protected]

Checks whether a string is an option.

Parameters:
[in]pchStrtext string
Returns:
true = option, false = otherwise
bool AppArgs::IsValid ( ) [static]

Checks whether the arguments have valid form.

Arguments are valid if:

  • all mandatory options are present
  • all options with mandatory values have their values
  • value count is between its minimum and maximum
  • there are no unknown options (if unknown options are not accepted)
Returns:
true = arguments valid, false = otherwise
void AppArgs::Parse ( int  argc,
const char *const *  argv 
) [static]

Parses arguments and builds the appropriate structure.

Parameters:
[in]argcargument count
[in]argvargument vector
Attention:
All errors are silently ignored.
bool AppArgs::ParseLong ( const char *  pchStr,
std::string &  rName,
std::string &  rVal,
bool &  rfHasVal 
) [static, protected]

Parses a string and attempts to treat it as a long option.

Parameters:
[in]pchStrtext string
[out]rNameoption name
[out]rValvalue string
[out]rfHasValoption has value yes/no
Returns:
true = success, false = failure
void AppArgs::ParseShort ( const char *  pchStr,
char &  rcName,
std::string &  rVal,
bool &  rfHasVal 
) [static, protected]

Parses a string and attempts to treat it as a short option.

Parameters:
[in]pchStrtext string
[out]rcNameoption name
[out]rValvalue string
[out]rfHasValoption has value yes/no
Attention:
This method assumes the string is a valid short option.
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/appinst_8h.html0000644000175000001440000001043711737665757016310 0ustar lukusers incron: appinst.h File Reference
Classes | Defines
appinst.h File Reference

Application instance class header. More...

#include <string>

Go to the source code of this file.

Classes

class  AppInstException
 Exception class. More...
class  AppInstance
 Application instance management class. More...

Defines

#define APPLOCK_BASEDIR   "/var/run"

Detailed Description

Application instance class header.

Copyright (C) 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Define Documentation

#define APPLOCK_BASEDIR   "/var/run"
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classAppArgs-members.html0000644000175000001440000001276111737665757020250 0ustar lukusers incron: Member List
AppArgs Member List
This is the complete list of members for AppArgs, including all inherited members.
AddOption(const std::string &rName, char cShort, AppArgType_t type, bool fMandatory)AppArgs [static]
Destroy()AppArgs [static]
Dump()AppArgs [static]
DumpOption(const std::string &rName, char cShort, AppArgOption_t *pOpt)AppArgs [protected, static]
ExistsOption(const std::string &rArg)AppArgs [static]
GetOption(const std::string &rArg, std::string &rVal)AppArgs [static]
GetValue(size_t index, std::string &rVal)AppArgs [static]
GetValueCount()AppArgs [static]
Init(size_t valMinCnt=0, size_t valMaxCnt=APPARGS_NOLIMIT)AppArgs [static]
IsLongOption(const char *pchStr)AppArgs [protected, static]
IsOption(const char *pchStr)AppArgs [protected, static]
IsValid()AppArgs [static]
Parse(int argc, const char *const *argv)AppArgs [static]
ParseLong(const char *pchStr, std::string &rName, std::string &rVal, bool &rfHasVal)AppArgs [protected, static]
ParseShort(const char *pchStr, char &rcName, std::string &rVal, bool &rfHasVal)AppArgs [protected, static]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incroncfg_8cpp.html0000644000175000001440000001176511737665757017142 0ustar lukusers incron: incroncfg.cpp File Reference
Defines | Typedefs
incroncfg.cpp File Reference

inotify cron configuration implementation More...

#include <fstream>
#include <sstream>
#include <cstring>
#include "incroncfg.h"

Defines

#define INCRON_CFG_DEFAULT   "/etc/incron.conf"

Typedefs

typedef std::map< std::string,
std::string > 		CFG_MAP
typedef CFG_MAP::iterator CFG_ITER

Detailed Description

inotify cron configuration implementation

incron configuration

Copyright (C) 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Credits: Christian Ruppert (new include to build with GCC 4.4+)

Define Documentation

#define INCRON_CFG_DEFAULT   "/etc/incron.conf"

Typedef Documentation

typedef CFG_MAP::iterator CFG_ITER
typedef std::map<std::string, std::string> CFG_MAP
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/strtok_8h_source.html0000644000175000001440000002340211737665757017534 0ustar lukusers incron: strtok.h Source File
incron  0.5.10
strtok.h
Go to the documentation of this file.
00001 
00003 
00023 #ifndef _STRTOK_H_
00024 #define _STRTOK_H_
00025 
00026 
00027 #include <string>
00028 
00029 typedef std::string::size_type SIZE;
00030 
00032 
00054 class StringTokenizer
00055 {
00056 public:
00058 
00066   StringTokenizer(const std::string& rStr, char cDelim = ',', char cPrefix = '\0');
00067   
00069   ~StringTokenizer() {}
00070   
00072 
00075   inline bool HasMoreTokens() const
00076   {
00077     return m_pos < m_len;
00078   }
00079   
00081 
00091   std::string GetNextToken(bool fSkipEmpty = false);
00092   
00094 
00103   std::string GetNextTokenRaw(bool fSkipEmpty = false);
00104   
00106 
00116   std::string GetRemainder();
00117     
00119 
00128   inline void SetDelimiter(char cDelim)
00129   {
00130     m_cDelim = cDelim;
00131   }
00132   
00134 
00137   inline char GetDelimiter() const
00138   {
00139     return m_cDelim;
00140   }
00141   
00143 
00151   inline void SetPrefix(char cPrefix)
00152   {
00153     m_cPrefix = cPrefix;
00154   }
00155   
00157 
00160   inline char GetPrefix() const
00161   {
00162     return m_cPrefix;
00163   }
00164   
00166 
00171   inline void SetNoPrefix()
00172   {
00173     SetPrefix('\0');
00174   }
00175   
00177 
00180   inline void Reset()
00181   {
00182     m_pos = 0;
00183   }
00184   
00185 private:
00186   std::string m_str;            
00187   char m_cDelim;                
00188   char m_cPrefix;               
00189   std::string::size_type m_pos; 
00190   std::string::size_type m_len; 
00191   
00193 
00198   std::string StripPrefix(const char* s, SIZE cnt);
00199   
00201 
00207   void _GetNextToken(std::string& rToken, bool fStripPrefix);
00208   
00210 
00217   void _GetNextTokenNoPrefix(std::string& rToken);
00218   
00220 
00227   void _GetNextTokenWithPrefix(std::string& rToken);
00228 };
00229 
00230 
00231 #endif //_STRTOK_H_
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incroncfg_8h.html0000644000175000001440000000552611737665757016605 0ustar lukusers incron: incroncfg.h File Reference
Classes
incroncfg.h File Reference

inotify cron configuration header More...

#include <cstring>
#include <map>

Go to the source code of this file.

Classes

class  IncronCfg
 Configuration class. More...

Detailed Description

inotify cron configuration header

incron configuration

Copyright (C) 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classStringTokenizer-members.html0000644000175000001440000001127411737665757022052 0ustar lukusers incron: Member List
StringTokenizer Member List
This is the complete list of members for StringTokenizer, including all inherited members.
GetDelimiter() const StringTokenizer [inline]
GetNextToken(bool fSkipEmpty=false)StringTokenizer
GetNextTokenRaw(bool fSkipEmpty=false)StringTokenizer
GetPrefix() const StringTokenizer [inline]
GetRemainder()StringTokenizer
HasMoreTokens() const StringTokenizer [inline]
Reset()StringTokenizer [inline]
SetDelimiter(char cDelim)StringTokenizer [inline]
SetNoPrefix()StringTokenizer [inline]
SetPrefix(char cPrefix)StringTokenizer [inline]
StringTokenizer(const std::string &rStr, char cDelim= ',', char cPrefix= '\0')StringTokenizer
~StringTokenizer()StringTokenizer [inline]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classIncronTabEntry.html0000644000175000001440000004577511737665757020177 0ustar lukusers incron: IncronTabEntry Class Reference
Public Member Functions | Static Public Member Functions | Protected Attributes
IncronTabEntry Class Reference

Incron table entry class. More...

#include <incrontab.h>

List of all members.

Public Member Functions

 IncronTabEntry ()
 Constructor.
 IncronTabEntry (const std::string &rPath, uint32_t uMask, const std::string &rCmd)
 Constructor.
 ~IncronTabEntry ()
 Destructor.
std::string ToString () const
 Converts the entry to string representation.
const std::string & GetPath () const
 Returns the watch filesystem path.
int32_t GetMask () const
 Returns the event mask.
const std::string & GetCmd () const
 Returns the command string.
bool IsNoLoop () const
 Checks whether this entry has set loop-avoidance.

Static Public Member Functions

static bool Parse (const std::string &rStr, IncronTabEntry &rEntry)
 Parses a string and attempts to extract entry parameters.
static std::string GetSafePath (const std::string &rPath)
 Add backslashes before spaces in the source path.

Protected Attributes

std::string m_path
 watch path
uint32_t m_uMask
 event mask
std::string m_cmd
 command string
bool m_fNoLoop
 no loop yes/no

Detailed Description

Incron table entry class.

Constructor & Destructor Documentation

IncronTabEntry::IncronTabEntry ( )

Constructor.

Creates an empty entry for later use with Parse().

See also:
Parse()
IncronTabEntry::IncronTabEntry ( const std::string &  rPath,
uint32_t  uMask,
const std::string &  rCmd 
)

Constructor.

Creates an entry based on defined parameters.

Parameters:
[in]rPathwatched filesystem path
[in]uMaskevent mask
[in]rCmdcommand string
IncronTabEntry::~IncronTabEntry ( ) [inline]

Destructor.

Member Function Documentation

const std::string& IncronTabEntry::GetCmd ( ) const [inline]

Returns the command string.

Returns:
command string
int32_t IncronTabEntry::GetMask ( ) const [inline]

Returns the event mask.

Returns:
event mask
const std::string& IncronTabEntry::GetPath ( ) const [inline]

Returns the watch filesystem path.

Returns:
watch path
std::string IncronTabEntry::GetSafePath ( const std::string &  rPath) [static]

Add backslashes before spaces in the source path.

It also adds backslashes before all original backslashes of course.

The source string is not modified and a copy is returned instead.

This method is intended to be used for paths in user tables.

Parameters:
[in]rPathpath to be modified
Returns:
modified path
bool IncronTabEntry::IsNoLoop ( ) const [inline]

Checks whether this entry has set loop-avoidance.

Returns:
true = no loop, false = loop allowed
bool IncronTabEntry::Parse ( const std::string &  rStr,
IncronTabEntry &  rEntry 
) [static]

Parses a string and attempts to extract entry parameters.

Parameters:
[in]rStrparsed string
[out]rEntryparametrized entry
Returns:
true = success, false = failure
std::string IncronTabEntry::ToString ( ) const

Converts the entry to string representation.

This method creates a string for use in a table file.

Returns:
string representation

Member Data Documentation

std::string IncronTabEntry::m_cmd [protected]

command string

bool IncronTabEntry::m_fNoLoop [protected]

no loop yes/no

std::string IncronTabEntry::m_path [protected]

watch path

uint32_t IncronTabEntry::m_uMask [protected]

event mask

The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classIncronTab-members.html0000644000175000001440000001133411737665757020565 0ustar lukusers incron: Member List
IncronTab Member List
This is the complete list of members for IncronTab, including all inherited members.
Add(const IncronTabEntry &rEntry)IncronTab [inline]
CheckUser(const std::string &rUser)IncronTab [static]
Clear()IncronTab [inline]
GetCount() const IncronTab [inline]
GetEntry(int index)IncronTab [inline]
GetSystemTablePath(const std::string &rName)IncronTab [static]
GetUserTablePath(const std::string &rUser)IncronTab [static]
IncronTab()IncronTab [inline]
IsEmpty() const IncronTab [inline]
Load(const std::string &rPath)IncronTab
m_tabIncronTab [protected]
Save(const std::string &rPath)IncronTab
~IncronTab()IncronTab [inline]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/tab_a.png0000644000175000001440000000021411737665757015111 0ustar lukusersPNG  IHDR$[SIDATx흻 @wɡ*MIFL :nN N&_ ɭɾ}ն8~Owv-A4Y)}IENDB`incron-0.5.10/doc/html/appinst_8h_source.html0000644000175000001440000001656611737665757017701 0ustar lukusers incron: appinst.h Source File
incron  0.5.10
appinst.h
Go to the documentation of this file.
00001 
00003 
00021 #ifndef APPINST_H_
00022 #define APPINST_H_
00023 
00024 
00025 #include <string>
00026 
00027 
00028 #define APPLOCK_BASEDIR "/var/run"
00029 
00030 
00032 
00035 class AppInstException
00036 {
00037 public:
00039 
00042   AppInstException(int iErr) : m_iErr(iErr) {}
00043   
00045 
00048   inline int GetErrorNumber() const
00049   {
00050     return m_iErr;
00051   }
00052   
00053 private:
00054   int m_iErr; 
00055     
00056 };
00057 
00059 
00064 class AppInstance
00065 {
00066 public:
00068 
00075   AppInstance(const std::string& rName, const std::string& rBase = APPLOCK_BASEDIR);
00076   
00078   ~AppInstance();
00079   
00081 
00089   bool Lock();
00090   
00092 
00097   void Unlock();
00098   
00100 
00107   bool Exists() const;
00108   
00110 
00116   bool SendSignal(int iSigNo) const;
00117   
00119 
00124   inline bool Terminate() const
00125   {
00126     return SendSignal(SIGTERM);
00127   }
00128   
00129 protected:
00130   bool DoLock();
00131   
00132 private:
00133   std::string m_path; 
00134   bool m_fLocked;     
00135 };
00136 
00137 #endif /*APPINST_H_*/
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/functions_rela.html0000644000175000001440000000425711737665757017251 0ustar lukusers incron: Class Members - Related Functions
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classAppInstance.html0000644000175000001440000002763711737665757017500 0ustar lukusers incron: AppInstance Class Reference
Public Member Functions | Protected Member Functions
AppInstance Class Reference

Application instance management class. More...

#include <appinst.h>

List of all members.

Public Member Functions

 AppInstance (const std::string &rName, const std::string &rBase=APPLOCK_BASEDIR)
 Constructor.
 ~AppInstance ()
 Destructor.
bool Lock ()
 Attempts to lock the instance.
void Unlock ()
 Unlocks the instance.
bool Exists () const
 Checks whether an instance of this application exists.
bool SendSignal (int iSigNo) const
 Sends a signal to an instance of this application.
bool Terminate () const
 Terminates an instance of this application.

Protected Member Functions

bool DoLock ()

Detailed Description

Application instance management class.

This class is intended for application which require to be running only once (one instance only). It provides some methods for simple locking, signaling etc.

Constructor & Destructor Documentation

AppInstance::AppInstance ( const std::string &  rName,
const std::string &  rBase = APPLOCK_BASEDIR 
)

Constructor.

Parameters:
[in]rNameapplication name
[in]rBaselockfile base directory
Attention:
If an empty base directory is given it is replaced by the default value.
AppInstance::~AppInstance ( )

Destructor.

Member Function Documentation

bool AppInstance::DoLock ( ) [protected]
bool AppInstance::Exists ( ) const

Checks whether an instance of this application exists.

If this instance has acquired the lockfile the call will be successful. Otherwise it checks for existence of another running instance.

Returns:
true = instance exists, false = otherwise
bool AppInstance::Lock ( )

Attempts to lock the instance.

This method attempts to create a lockfile. If the file already exists it checks whether its owner is still living. If it does this method fails. Otherwise it unlinks this file and re-attempts to create it.

Returns:
true = instance locked, false = otherwise
bool AppInstance::SendSignal ( int  iSigNo) const

Sends a signal to an instance of this application.

This method doesn't signal the current instance.

Parameters:
[in]iSigNosignal number
Returns:
true = success, false = otherwise
bool AppInstance::Terminate ( ) const [inline]

Terminates an instance of this application.

This method doesn't terminate the current instance.

Returns:
true = success, false = otherwise
void AppInstance::Unlock ( )

Unlocks the instance.

This method removes (unlinks) the appropriate lockfile. If the instance hasn't been locked this method has no effect.

The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/globals_defs.html0000644000175000001440000001617611737665757016665 0ustar lukusers incron: File Members
 

- a -

- c -

- d -

- i -

- p -

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classEventDispatcher-members.html0000644000175000001440000000757511737665757022012 0ustar lukusers incron: Member List
EventDispatcher Member List
This is the complete list of members for EventDispatcher, including all inherited members.
Clear()EventDispatcher [inline]
EventDispatcher(int iPipeFd, Inotify *pIn, InotifyWatch *pSys, InotifyWatch *pUser)EventDispatcher
GetPollData()EventDispatcher [inline]
GetSize() const EventDispatcher [inline]
ProcessEvents()EventDispatcher
Rebuild()EventDispatcher
Register(UserTable *pTab)EventDispatcher
Unregister(UserTable *pTab)EventDispatcher
~EventDispatcher()EventDispatcher
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incroncfg_8h_source.html0000644000175000001440000001466211737665757020166 0ustar lukusers incron: incroncfg.h Source File
incron  0.5.10
incroncfg.h
Go to the documentation of this file.
00001 
00003 
00017 #ifndef INCRONCFG_H_
00018 #define INCRONCFG_H_
00019 
00020 
00021 #include <cstring>
00022 #include <map>
00023 
00025 
00030 class IncronCfg
00031 {
00032 public:
00033 
00035   static void Init();
00036 
00038 
00047   static void Load(const std::string& rPath);
00048 
00050 
00059   static bool GetValue(const std::string& rKey, std::string& rVal);
00060   
00062 
00071   static bool GetValue(const std::string& rKey, int& rVal);
00072   
00074 
00083   static bool GetValue(const std::string& rKey, unsigned& rVal);
00084   
00086 
00095   static bool GetValue(const std::string& rKey, bool& rVal);
00096   
00098 
00105   static std::string BuildPath(const std::string& rPath, const std::string& rName);
00106   
00107 protected:
00109 
00115   static bool ParseLine(const char* s, std::string& rKey, std::string& rVal);
00116   
00118 
00122   static bool IsComment(const char* s);
00123 
00124 private:
00125   static std::map<std::string, std::string> m_values;
00126   static std::map<std::string, std::string> m_defaults;
00127 };
00128 
00129 #endif /*INCRONCFG_H_*/
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/doxygen.css0000644000175000001440000003500311737665757015530 0ustar lukusers/* The standard CSS for doxygen */ body, table, div, p, dl { font-family: Lucida Grande, Verdana, Geneva, Arial, sans-serif; font-size: 12px; } /* @group Heading Levels */ h1 { font-size: 150%; } .title { font-size: 150%; font-weight: bold; margin: 10px 2px; } h2 { font-size: 120%; } h3 { font-size: 100%; } dt { font-weight: bold; } div.multicol { -moz-column-gap: 1em; -webkit-column-gap: 1em; -moz-column-count: 3; -webkit-column-count: 3; } p.startli, p.startdd, p.starttd { margin-top: 2px; } p.endli { margin-bottom: 0px; } p.enddd { margin-bottom: 4px; } p.endtd { margin-bottom: 2px; } /* @end */ caption { font-weight: bold; } span.legend { font-size: 70%; text-align: center; } h3.version { font-size: 90%; text-align: center; } div.qindex, div.navtab{ background-color: #EBEFF6; border: 1px solid #A3B4D7; text-align: center; } div.qindex, div.navpath { width: 100%; line-height: 140%; } div.navtab { margin-right: 15px; } /* @group Link Styling */ a { color: #3D578C; font-weight: normal; text-decoration: none; } .contents a:visited { color: #4665A2; } a:hover { text-decoration: underline; } a.qindex { font-weight: bold; } a.qindexHL { font-weight: bold; background-color: #9CAFD4; color: #ffffff; border: 1px double #869DCA; } .contents a.qindexHL:visited { color: #ffffff; } a.el { font-weight: bold; } a.elRef { } a.code { color: #4665A2; } a.codeRef { color: #4665A2; } /* @end */ dl.el { margin-left: -1cm; } .fragment { font-family: monospace, fixed; font-size: 105%; } pre.fragment { border: 1px solid #C4CFE5; background-color: #FBFCFD; padding: 4px 6px; margin: 4px 8px 4px 2px; overflow: auto; word-wrap: break-word; font-size: 9pt; line-height: 125%; } div.ah { background-color: black; font-weight: bold; color: #ffffff; margin-bottom: 3px; margin-top: 3px; padding: 0.2em; border: solid thin #333; border-radius: 0.5em; -webkit-border-radius: .5em; -moz-border-radius: .5em; box-shadow: 2px 2px 3px #999; -webkit-box-shadow: 2px 2px 3px #999; -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; background-image: -webkit-gradient(linear, left top, left bottom, from(#eee), to(#000),color-stop(0.3, #444)); background-image: -moz-linear-gradient(center top, #eee 0%, #444 40%, #000); } div.groupHeader { margin-left: 16px; margin-top: 12px; font-weight: bold; } div.groupText { margin-left: 16px; font-style: italic; } body { background-color: white; color: black; margin: 0; } div.contents { margin-top: 10px; margin-left: 8px; margin-right: 8px; } td.indexkey { background-color: #EBEFF6; font-weight: bold; border: 1px solid #C4CFE5; margin: 2px 0px 2px 0; padding: 2px 10px; } td.indexvalue { background-color: #EBEFF6; border: 1px solid #C4CFE5; padding: 2px 10px; margin: 2px 0px; } tr.memlist { background-color: #EEF1F7; } p.formulaDsp { text-align: center; } img.formulaDsp { } img.formulaInl { vertical-align: middle; } div.center { text-align: center; margin-top: 0px; margin-bottom: 0px; padding: 0px; } div.center img { border: 0px; } address.footer { text-align: right; padding-right: 12px; } img.footer { border: 0px; vertical-align: middle; } /* @group Code Colorization */ span.keyword { color: #008000 } span.keywordtype { color: #604020 } span.keywordflow { color: #e08000 } span.comment { color: #800000 } span.preprocessor { color: #806020 } span.stringliteral { color: #002080 } span.charliteral { color: #008080 } span.vhdldigit { color: #ff00ff } span.vhdlchar { color: #000000 } span.vhdlkeyword { color: #700070 } span.vhdllogic { color: #ff0000 } /* @end */ /* .search { color: #003399; font-weight: bold; } form.search { margin-bottom: 0px; margin-top: 0px; } input.search { font-size: 75%; color: #000080; font-weight: normal; background-color: #e8eef2; } */ td.tiny { font-size: 75%; } .dirtab { padding: 4px; border-collapse: collapse; border: 1px solid #A3B4D7; } th.dirtab { background: #EBEFF6; font-weight: bold; } hr { height: 0px; border: none; border-top: 1px solid #4A6AAA; } hr.footer { height: 1px; } /* @group Member Descriptions */ table.memberdecls { border-spacing: 0px; padding: 0px; } .mdescLeft, .mdescRight, .memItemLeft, .memItemRight, .memTemplItemLeft, .memTemplItemRight, .memTemplParams { background-color: #F9FAFC; border: none; margin: 4px; padding: 1px 0 0 8px; } .mdescLeft, .mdescRight { padding: 0px 8px 4px 8px; color: #555; } .memItemLeft, .memItemRight, .memTemplParams { border-top: 1px solid #C4CFE5; } .memItemLeft, .memTemplItemLeft { white-space: nowrap; } .memItemRight { width: 100%; } .memTemplParams { color: #4665A2; white-space: nowrap; } /* @end */ /* @group Member Details */ /* Styles for detailed member documentation */ .memtemplate { font-size: 80%; color: #4665A2; font-weight: normal; margin-left: 9px; } .memnav { background-color: #EBEFF6; border: 1px solid #A3B4D7; text-align: center; margin: 2px; margin-right: 15px; padding: 2px; } .mempage { width: 100%; } .memitem { padding: 0; margin-bottom: 10px; margin-right: 5px; } .memname { white-space: nowrap; font-weight: bold; margin-left: 6px; } .memproto, dl.reflist dt { border-top: 1px solid #A8B8D9; border-left: 1px solid #A8B8D9; border-right: 1px solid #A8B8D9; padding: 6px 0px 6px 0px; color: #253555; font-weight: bold; text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); /* opera specific markup */ box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); border-top-right-radius: 8px; border-top-left-radius: 8px; /* firefox specific markup */ -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; -moz-border-radius-topright: 8px; -moz-border-radius-topleft: 8px; /* webkit specific markup */ -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); -webkit-border-top-right-radius: 8px; -webkit-border-top-left-radius: 8px; background-image:url('nav_f.png'); background-repeat:repeat-x; background-color: #E2E8F2; } .memdoc, dl.reflist dd { border-bottom: 1px solid #A8B8D9; border-left: 1px solid #A8B8D9; border-right: 1px solid #A8B8D9; padding: 2px 5px; background-color: #FBFCFD; border-top-width: 0; /* opera specific markup */ border-bottom-left-radius: 8px; border-bottom-right-radius: 8px; box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); /* firefox specific markup */ -moz-border-radius-bottomleft: 8px; -moz-border-radius-bottomright: 8px; -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; background-image: -moz-linear-gradient(center top, #FFFFFF 0%, #FFFFFF 60%, #F7F8FB 95%, #EEF1F7); /* webkit specific markup */ -webkit-border-bottom-left-radius: 8px; -webkit-border-bottom-right-radius: 8px; -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); background-image: -webkit-gradient(linear,center top,center bottom,from(#FFFFFF), color-stop(0.6,#FFFFFF), color-stop(0.60,#FFFFFF), color-stop(0.95,#F7F8FB), to(#EEF1F7)); } dl.reflist dt { padding: 5px; } dl.reflist dd { margin: 0px 0px 10px 0px; padding: 5px; } .paramkey { text-align: right; } .paramtype { white-space: nowrap; } .paramname { color: #602020; white-space: nowrap; } .paramname em { font-style: normal; } .params, .retval, .exception, .tparams { border-spacing: 6px 2px; } .params .paramname, .retval .paramname { font-weight: bold; vertical-align: top; } .params .paramtype { font-style: italic; vertical-align: top; } .params .paramdir { font-family: "courier new",courier,monospace; vertical-align: top; } /* @end */ /* @group Directory (tree) */ /* for the tree view */ .ftvtree { font-family: sans-serif; margin: 0px; } /* these are for tree view when used as main index */ .directory { font-size: 9pt; font-weight: bold; margin: 5px; } .directory h3 { margin: 0px; margin-top: 1em; font-size: 11pt; } /* The following two styles can be used to replace the root node title with an image of your choice. Simply uncomment the next two styles, specify the name of your image and be sure to set 'height' to the proper pixel height of your image. */ /* .directory h3.swap { height: 61px; background-repeat: no-repeat; background-image: url("yourimage.gif"); } .directory h3.swap span { display: none; } */ .directory > h3 { margin-top: 0; } .directory p { margin: 0px; white-space: nowrap; } .directory div { display: none; margin: 0px; } .directory img { vertical-align: -30%; } /* these are for tree view when not used as main index */ .directory-alt { font-size: 100%; font-weight: bold; } .directory-alt h3 { margin: 0px; margin-top: 1em; font-size: 11pt; } .directory-alt > h3 { margin-top: 0; } .directory-alt p { margin: 0px; white-space: nowrap; } .directory-alt div { display: none; margin: 0px; } .directory-alt img { vertical-align: -30%; } /* @end */ div.dynheader { margin-top: 8px; } address { font-style: normal; color: #2A3D61; } table.doxtable { border-collapse:collapse; } table.doxtable td, table.doxtable th { border: 1px solid #2D4068; padding: 3px 7px 2px; } table.doxtable th { background-color: #374F7F; color: #FFFFFF; font-size: 110%; padding-bottom: 4px; padding-top: 5px; text-align:left; } table.fieldtable { width: 100%; margin-bottom: 10px; border: 1px solid #A8B8D9; border-spacing: 0px; -moz-border-radius: 4px; -webkit-border-radius: 4px; border-radius: 4px; -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; -webkit-box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); } .fieldtable td, .fieldtable th { padding: 3px 7px 2px; } .fieldtable td.fieldtype, .fieldtable td.fieldname { white-space: nowrap; border-right: 1px solid #A8B8D9; border-bottom: 1px solid #A8B8D9; vertical-align: top; } .fieldtable td.fielddoc { border-bottom: 1px solid #A8B8D9; width: 100%; } .fieldtable tr:last-child td { border-bottom: none; } .fieldtable th { background-image:url('nav_f.png'); background-repeat:repeat-x; background-color: #E2E8F2; font-size: 90%; color: #253555; padding-bottom: 4px; padding-top: 5px; text-align:left; -moz-border-radius-topleft: 4px; -moz-border-radius-topright: 4px; -webkit-border-top-left-radius: 4px; -webkit-border-top-right-radius: 4px; border-top-left-radius: 4px; border-top-right-radius: 4px; border-bottom: 1px solid #A8B8D9; } .tabsearch { top: 0px; left: 10px; height: 36px; background-image: url('tab_b.png'); z-index: 101; overflow: hidden; font-size: 13px; } .navpath ul { font-size: 11px; background-image:url('tab_b.png'); background-repeat:repeat-x; height:30px; line-height:30px; color:#8AA0CC; border:solid 1px #C2CDE4; overflow:hidden; margin:0px; padding:0px; } .navpath li { list-style-type:none; float:left; padding-left:10px; padding-right:15px; background-image:url('bc_s.png'); background-repeat:no-repeat; background-position:right; color:#364D7C; } .navpath li.navelem a { height:32px; display:block; text-decoration: none; outline: none; } .navpath li.navelem a:hover { color:#6884BD; } .navpath li.footer { list-style-type:none; float:right; padding-left:10px; padding-right:15px; background-image:none; background-repeat:no-repeat; background-position:right; color:#364D7C; font-size: 8pt; } div.summary { float: right; font-size: 8pt; padding-right: 5px; width: 50%; text-align: right; } div.summary a { white-space: nowrap; } div.ingroups { margin-left: 5px; font-size: 8pt; padding-left: 5px; width: 50%; text-align: left; } div.ingroups a { white-space: nowrap; } div.header { background-image:url('nav_h.png'); background-repeat:repeat-x; background-color: #F9FAFC; margin: 0px; border-bottom: 1px solid #C4CFE5; } div.headertitle { padding: 5px 5px 5px 7px; } dl { padding: 0 0 0 10px; } dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug { border-left:4px solid; padding: 0 0 0 6px; } dl.note { border-color: #D0C000; } dl.warning, dl.attention { border-color: #FF0000; } dl.pre, dl.post, dl.invariant { border-color: #00D000; } dl.deprecated { border-color: #505050; } dl.todo { border-color: #00C0E0; } dl.test { border-color: #3030E0; } dl.bug { border-color: #C08050; } #projectlogo { text-align: center; vertical-align: bottom; border-collapse: separate; } #projectlogo img { border: 0px none; } #projectname { font: 300% Tahoma, Arial,sans-serif; margin: 0px; padding: 2px 0px; } #projectbrief { font: 120% Tahoma, Arial,sans-serif; margin: 0px; padding: 0px; } #projectnumber { font: 50% Tahoma, Arial,sans-serif; margin: 0px; padding: 0px; } #titlearea { padding: 0px; margin: 0px; width: 100%; border-bottom: 1px solid #5373B4; } .image { text-align: center; } .dotgraph { text-align: center; } .mscgraph { text-align: center; } .caption { font-weight: bold; } div.zoom { border: 1px solid #90A5CE; } dl.citelist { margin-bottom:50px; } dl.citelist dt { color:#334975; float:left; font-weight:bold; margin-right:10px; padding:5px; } dl.citelist dd { margin:2px 0; padding:5px 0; } @media print { #top { display: none; } #side-nav { display: none; } #nav-path { display: none; } body { overflow:visible; } h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } .summary { display: none; } .memitem { page-break-inside: avoid; } #doc-content { margin-left:0 !important; height:auto !important; width:auto !important; overflow:inherit; display:inline; } pre.fragment { overflow: visible; text-wrap: unrestricted; white-space: -moz-pre-wrap; /* Moz */ white-space: -pre-wrap; /* Opera 4-6 */ white-space: -o-pre-wrap; /* Opera 7 */ white-space: pre-wrap; /* CSS3 */ word-wrap: break-word; /* IE 5.5+ */ } } incron-0.5.10/doc/html/tabs.css0000644000175000001440000000210711737665757015003 0ustar lukusers.tabs, .tabs2, .tabs3 { background-image: url('tab_b.png'); width: 100%; z-index: 101; font-size: 13px; } .tabs2 { font-size: 10px; } .tabs3 { font-size: 9px; } .tablist { margin: 0; padding: 0; display: table; } .tablist li { float: left; display: table-cell; background-image: url('tab_b.png'); line-height: 36px; list-style: none; } .tablist a { display: block; padding: 0 20px; font-weight: bold; background-image:url('tab_s.png'); background-repeat:no-repeat; background-position:right; color: #283A5D; text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); text-decoration: none; outline: none; } .tabs3 .tablist a { padding: 0 10px; } .tablist a:hover { background-image: url('tab_h.png'); background-repeat:repeat-x; color: #fff; text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); text-decoration: none; } .tablist li.current a { background-image: url('tab_a.png'); background-repeat:repeat-x; color: #fff; text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); } incron-0.5.10/doc/html/classInotifyWatch.html0000644000175000001440000004050011737665757017663 0ustar lukusers incron: InotifyWatch Class Reference
Public Member Functions | Friends
InotifyWatch Class Reference

inotify watch class More...

#include <inotify-cxx.h>

List of all members.

Public Member Functions

 InotifyWatch (const std::string &rPath, int32_t uMask, bool fEnabled=true)
 Constructor.
 ~InotifyWatch ()
 Destructor.
int32_t GetDescriptor () const
 Returns the watch descriptor.
const std::string & GetPath () const
 Returns the watched file path.
uint32_t GetMask () const
 Returns the watch event mask.
void SetMask (uint32_t uMask) throw (InotifyException)
 Sets the watch event mask.
Inotify * GetInotify ()
 Returns the appropriate inotify class instance.
void SetEnabled (bool fEnabled) throw (InotifyException)
 Enables/disables the watch.
bool IsEnabled () const
 Checks whether the watch is enabled.
bool IsRecursive () const
 Checks whether the watch is recursive.

Friends

class Inotify

Detailed Description

inotify watch class

It holds information about the inotify watch on a particular inode.

If the INOTIFY_THREAD_SAFE is defined this class is thread-safe.

Constructor & Destructor Documentation

InotifyWatch::InotifyWatch ( const std::string &  rPath,
int32_t  uMask,
bool  fEnabled = true 
) [inline]

Constructor.

Creates an inotify watch. Because this watch is inactive it has an invalid descriptor (-1).

Parameters:
[in]rPathwatched file path
[in]uMaskmask for events
[in]fEnabledevents enabled yes/no
InotifyWatch::~InotifyWatch ( ) [inline]

Destructor.

Member Function Documentation

int32_t InotifyWatch::GetDescriptor ( ) const [inline]

Returns the watch descriptor.

Returns:
watch descriptor; -1 for inactive watch
Inotify* InotifyWatch::GetInotify ( ) [inline]

Returns the appropriate inotify class instance.

Returns:
inotify instance
uint32_t InotifyWatch::GetMask ( ) const [inline]

Returns the watch event mask.

Returns:
event mask
const std::string& InotifyWatch::GetPath ( ) const [inline]

Returns the watched file path.

Returns:
file path
bool InotifyWatch::IsEnabled ( ) const [inline]

Checks whether the watch is enabled.

Returns:
true = enables, false = disabled
bool InotifyWatch::IsRecursive ( ) const [inline]

Checks whether the watch is recursive.

A recursive watch monitors a directory itself and all its subdirectories. This watch is a logical object which may have many underlying kernel watches.

Returns:
currently always false (recursive watches not yet supported)
Attention:
Recursive watches are currently NOT supported. They are planned for future versions.
void InotifyWatch::SetEnabled ( bool  fEnabled) throw (InotifyException)

Enables/disables the watch.

If the watch is active (added to an instance of Inotify) this method may fail due to unsuccessful re-setting the watch in the kernel.

Re-setting the current state has no effect.

Parameters:
[in]fEnabledset enabled yes/no
Exceptions:
InotifyExceptionthrown if enabling/disabling fails
void InotifyWatch::SetMask ( uint32_t  uMask) throw (InotifyException)

Sets the watch event mask.

If the watch is active (added to an instance of Inotify) this method may fail due to unsuccessful re-setting the watch in the kernel.

Parameters:
[in]uMaskevent mask
Exceptions:
InotifyExceptionthrown if changing fails

Friends And Related Function Documentation

friend class Inotify [friend]
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/index.html0000644000175000001440000000263611737665757015344 0ustar lukusers incron: Main Page
incron  0.5.10
incron Documentation
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/nav_f.png0000644000175000001440000000023711737665757015141 0ustar lukusersPNG  IHDR8fIDATxIB1 Q;uۿ@h; a !ЋVC |c3sFFPS{PSsVlNF.F.2_UH mIENDB`incron-0.5.10/doc/html/globals_type.html0000644000175000001440000000702011737665757016711 0ustar lukusers incron: File Members
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/incrontab_8cpp.html0000644000175000001440000000534511737665757017146 0ustar lukusers incron: incrontab.cpp File Reference
incrontab.cpp File Reference

inotify cron table manipulator classes implementation More...

#include <sstream>
#include <cstdio>
#include <errno.h>
#include "inotify-cxx.h"
#include "incrontab.h"
#include "incroncfg.h"

Detailed Description

inotify cron table manipulator classes implementation

inotify cron system

Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Credits: Christian Ruppert (new include to build with GCC 4.4+)

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classUserTable.html0000644000175000001440000004074511737665757017154 0ustar lukusers incron: UserTable Class Reference
Public Member Functions | Static Public Member Functions
UserTable Class Reference

User table class. More...

#include <usertable.h>

List of all members.

Public Member Functions

 UserTable (EventDispatcher *pEd, const std::string &rUser, bool fSysTable)
 Constructor.
virtual ~UserTable ()
 Destructor.
void Load ()
 Loads the table.
void Dispose ()
 Removes all entries from the table.
void OnEvent (InotifyEvent &rEvt)
 Processes an inotify event.
bool MayAccess (const std::string &rPath, bool fNoFollow) const
 Checks whether the user may access a file.
bool IsSystem () const
 Checks whether it is a system table.
Inotify * GetInotify ()
 Returns the related inotify object.
void RunAsUser (char *const *argv) const
 Runs a program as the table's user.

Static Public Member Functions

static void FinishDone ()
 Cleans-up all zombie child processes and enables disabled watches.
static bool CheckUser (const char *user)
 Checks whether an user exists and has permission to use incron.

Detailed Description

User table class.

This class processes inotify events for an user. It creates child processes which do appropriate actions as defined in the user table file.

Constructor & Destructor Documentation

UserTable::UserTable ( EventDispatcher *  pEd,
const std::string &  rUser,
bool  fSysTable 
)

Constructor.

Parameters:
[in]pEdevent dispatcher
[in]rUseruser name
[in]fSysTablesystem table yes/no
UserTable::~UserTable ( ) [virtual]

Destructor.

Member Function Documentation

static bool UserTable::CheckUser ( const char *  user) [inline, static]

Checks whether an user exists and has permission to use incron.

It searches for the given user name in the user database. If it failes it returns 'false'. Otherwise it checks permission files for this user (see InCronTab::CheckUser()).

Parameters:
[in]useruser name
Returns:
true = user has permission to use incron, false = otherwise
See also:
InCronTab::CheckUser()
void UserTable::Dispose ( )

Removes all entries from the table.

All entries are unregistered from the event dispatcher and their watches are destroyed.

void UserTable::FinishDone ( ) [static]

Cleans-up all zombie child processes and enables disabled watches.

Attention:
This method must be called AFTER processing all events which has been caused by the processes.
Inotify* UserTable::GetInotify ( ) [inline]

Returns the related inotify object.

Returns:
related inotify object
bool UserTable::IsSystem ( ) const

Checks whether it is a system table.

Returns:
true = system table, false = user table
void UserTable::Load ( )

Loads the table.

All loaded entries have their inotify watches and are registered for event dispatching. If loading fails the table remains empty.

bool UserTable::MayAccess ( const std::string &  rPath,
bool  fNoFollow 
) const

Checks whether the user may access a file.

Any access right (RWX) is sufficient.

Parameters:
[in]rPathabsolute file path
[in]fNoFollowdon't follow a symbolic link
Returns:
true = access granted, false = otherwise
void UserTable::OnEvent ( InotifyEvent &  rEvt)

Processes an inotify event.

Parameters:
[in]rEvtinotify event
void UserTable::RunAsUser ( char *const *  argv) const

Runs a program as the table's user.

Attention:
Don't call from the main process (before forking)!
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/globals_func.html0000644000175000001440000000727611737665757016700 0ustar lukusers incron: File Members
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/functions.html0000644000175000001440000005233411737665757016245 0ustar lukusers incron: Class Members
Here is a list of all class members with links to the classes they belong to:

- a -

- b -

- c -

- d -

- e -

- f -

- g -

- h -

- i -

- l -

- m -

- o -

- p -

- r -

- s -

- t -

- u -

- v -

- w -

- ~ -

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/globals.html0000644000175000001440000003171011737665757015653 0ustar lukusers incron: File Members
Here is a list of all file members with links to the files they belong to:

- a -

- c -

- d -

- e -

- f -

- g -

- i -

- l -

- m -

- o -

- p -

- r -

- s -

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/appargs_8h.html0000644000175000001440000002421711737665757016270 0ustar lukusers incron: appargs.h File Reference
Classes | Defines | Typedefs | Enumerations
appargs.h File Reference

application arguments processor header More...

#include <cstring>
#include <map>
#include <deque>

Go to the source code of this file.

Classes

struct  AppArgOption_t
 Argument option type. More...
class  AppArgs
 Application arguments. More...

Defines

#define APPARGS_NOLIMIT   0x7fffffff
 value count has no limit

Typedefs

typedef std::map< std::string,
AppArgOption_t * > 		AA_LONG_MAP
 Mapping from long option name to option data.
typedef std::map< char,
AppArgOption_t * > 		AA_SHORT_MAP
 Mapping from short option name to option data.
typedef std::deque< std::string > AA_VAL_LIST
 Value list type.

Enumerations

enum  AppArgType_t { AAT_NO_VALUE, AAT_OPTIONAL_VALUE, AAT_MANDATORY_VALUE }
 Option argument type. More...

Detailed Description

application arguments processor header

application arguments processor

Copyright (C) 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Define Documentation

#define APPARGS_NOLIMIT   0x7fffffff

value count has no limit

Typedef Documentation

typedef std::map<std::string, AppArgOption_t*> AA_LONG_MAP

Mapping from long option name to option data.

typedef std::map<char, AppArgOption_t*> AA_SHORT_MAP

Mapping from short option name to option data.

typedef std::deque<std::string> AA_VAL_LIST

Value list type.

Enumeration Type Documentation

enum AppArgType_t

Option argument type.

Enumerator:
AAT_NO_VALUE 

no value needed

AAT_OPTIONAL_VALUE 

optional value

AAT_MANDATORY_VALUE 

mandatory value

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/annotated.html0000644000175000001440000001016211737665757016203 0ustar lukusers incron: Class List
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
AppArgOption_tArgument option type
AppArgsApplication arguments
AppInstanceApplication instance management class
AppInstExceptionException class
EventDispatcherEvent dispatcher class
IncronCfgConfiguration class
IncronTabIncron table class
IncronTabEntryIncron table entry class
InotifyInotify class
InotifyEventInotify event class
InotifyExceptionClass for inotify exceptions
InotifyWatchInotify watch class
ProcData_tChild process data
StringTokenizerSimple string tokenizer class
UserTableUser table class
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classInotify.html0000644000175000001440000014240411737665757016702 0ustar lukusers incron: Inotify Class Reference
Public Member Functions | Static Public Member Functions | Friends
Inotify Class Reference

inotify class More...

#include <inotify-cxx.h>

List of all members.

Public Member Functions

 Inotify () throw (InotifyException)
 Constructor.
 ~Inotify ()
 Destructor.
void Close ()
 Removes all watches and closes the inotify device.
void Add (InotifyWatch *pWatch) throw (InotifyException)
 Adds a new watch.
void Add (InotifyWatch &rWatch) throw (InotifyException)
 Adds a new watch.
void Remove (InotifyWatch *pWatch) throw (InotifyException)
 Removes a watch.
void Remove (InotifyWatch &rWatch) throw (InotifyException)
 Removes a watch.
void RemoveAll ()
 Removes all watches.
size_t GetWatchCount () const
 Returns the count of watches.
size_t GetEnabledCount () const
 Returns the count of enabled watches.
void WaitForEvents (bool fNoIntr=false) throw (InotifyException)
 Waits for inotify events.
size_t GetEventCount ()
 Returns the count of received and queued events.
bool GetEvent (InotifyEvent *pEvt) throw (InotifyException)
 Extracts a queued inotify event.
bool GetEvent (InotifyEvent &rEvt) throw (InotifyException)
 Extracts a queued inotify event.
bool PeekEvent (InotifyEvent *pEvt) throw (InotifyException)
 Extracts a queued inotify event (without removing).
bool PeekEvent (InotifyEvent &rEvt) throw (InotifyException)
 Extracts a queued inotify event (without removing).
InotifyWatch * FindWatch (int iDescriptor)
 Searches for a watch by a watch descriptor.
InotifyWatch * FindWatch (const std::string &rPath)
 Searches for a watch by a filesystem path.
int GetDescriptor () const
 Returns the file descriptor.
void SetNonBlock (bool fNonBlock) throw (InotifyException)
 Enables/disables non-blocking mode.
void SetCloseOnExec (bool fClOnEx) throw (InotifyException)
 Enables/disables closing on exec.

Static Public Member Functions

static uint32_t GetCapability (InotifyCapability_t cap) throw (InotifyException)
 Acquires a particular inotify capability/limit.
static void SetCapability (InotifyCapability_t cap, uint32_t val) throw (InotifyException)
 Modifies a particular inotify capability/limit.
static uint32_t GetMaxEvents () throw (InotifyException)
 Returns the maximum number of events in the kernel queue.
static void SetMaxEvents (uint32_t val) throw (InotifyException)
 Sets the maximum number of events in the kernel queue.
static uint32_t GetMaxInstances () throw (InotifyException)
 Returns the maximum number of inotify instances per process.
static void SetMaxInstances (uint32_t val) throw (InotifyException)
 Sets the maximum number of inotify instances per process.
static uint32_t GetMaxWatches () throw (InotifyException)
 Returns the maximum number of inotify watches per instance.
static void SetMaxWatches (uint32_t val) throw (InotifyException)
 Sets the maximum number of inotify watches per instance.

Friends

class InotifyWatch

Detailed Description

inotify class

It holds information about the inotify device descriptor and manages the event queue.

If the INOTIFY_THREAD_SAFE is defined this class is thread-safe.

Constructor & Destructor Documentation

Inotify::Inotify ( ) throw (InotifyException)

Constructor.

Creates and initializes an instance of inotify communication object (opens the inotify device).

Exceptions:
InotifyExceptionthrown if inotify isn't available
Inotify::~Inotify ( )

Destructor.

Calls Close() due to clean-up.

Member Function Documentation

void Inotify::Add ( InotifyWatch *  pWatch) throw (InotifyException)

Adds a new watch.

Parameters:
[in]pWatchinotify watch
Exceptions:
InotifyExceptionthrown if adding failed
void Inotify::Add ( InotifyWatch &  rWatch) throw (InotifyException) [inline]

Adds a new watch.

Parameters:
[in]rWatchinotify watch
Exceptions:
InotifyExceptionthrown if adding failed
void Inotify::Close ( )

Removes all watches and closes the inotify device.

InotifyWatch * Inotify::FindWatch ( int  iDescriptor)

Searches for a watch by a watch descriptor.

It tries to find a watch by the given descriptor.

Parameters:
[in]iDescriptorwatch descriptor
Returns:
pointer to a watch; NULL if no such watch exists
InotifyWatch * Inotify::FindWatch ( const std::string &  rPath)

Searches for a watch by a filesystem path.

It tries to find a watch by the given filesystem path.

Parameters:
[in]rPathfilesystem path
Returns:
pointer to a watch; NULL if no such watch exists
Attention:
The path must be exactly identical to the one used for the searched watch. Be careful about absolute/relative and case-insensitive paths.
uint32_t Inotify::GetCapability ( InotifyCapability_t  cap) throw (InotifyException) [static]

Acquires a particular inotify capability/limit.

Parameters:
[in]capcapability/limit identifier
Returns:
capability/limit value
Exceptions:
InotifyExceptionthrown if the given value cannot be acquired
int Inotify::GetDescriptor ( ) const [inline]

Returns the file descriptor.

The descriptor can be used in standard low-level file functions (poll(), select(), fcntl() etc.).

Returns:
valid file descriptor or -1 for inactive object
See also:
SetNonBlock()
size_t Inotify::GetEnabledCount ( ) const [inline]

Returns the count of enabled watches.

Returns:
count of enabled watches
See also:
GetWatchCount()
bool Inotify::GetEvent ( InotifyEvent *  pEvt) throw (InotifyException)

Extracts a queued inotify event.

The extracted event is removed from the queue. If the pointer is NULL it does nothing.

Parameters:
[in,out]pEvtevent object
Exceptions:
InotifyExceptionthrown if the provided pointer is NULL
bool Inotify::GetEvent ( InotifyEvent &  rEvt) throw (InotifyException) [inline]

Extracts a queued inotify event.

The extracted event is removed from the queue.

Parameters:
[in,out]rEvtevent object
Exceptions:
InotifyExceptionthrown only in very anomalous cases
size_t Inotify::GetEventCount ( ) [inline]

Returns the count of received and queued events.

This number is related to the events in the queue inside this object, not to the events pending in the kernel.

Returns:
count of events
static uint32_t Inotify::GetMaxEvents ( ) throw (InotifyException) [inline, static]

Returns the maximum number of events in the kernel queue.

Returns:
maximum number of events in the kernel queue
Exceptions:
InotifyExceptionthrown if the given value cannot be acquired
static uint32_t Inotify::GetMaxInstances ( ) throw (InotifyException) [inline, static]

Returns the maximum number of inotify instances per process.

It means the maximum number of open inotify file descriptors per running process.

Returns:
maximum number of inotify instances
Exceptions:
InotifyExceptionthrown if the given value cannot be acquired
static uint32_t Inotify::GetMaxWatches ( ) throw (InotifyException) [inline, static]

Returns the maximum number of inotify watches per instance.

It means the maximum number of inotify watches per inotify file descriptor.

Returns:
maximum number of inotify watches
Exceptions:
InotifyExceptionthrown if the given value cannot be acquired
size_t Inotify::GetWatchCount ( ) const [inline]

Returns the count of watches.

This is the total count of all watches (regardless whether enabled or not).

Returns:
count of watches
See also:
GetEnabledCount()
bool Inotify::PeekEvent ( InotifyEvent *  pEvt) throw (InotifyException)

Extracts a queued inotify event (without removing).

The extracted event stays in the queue. If the pointer is NULL it does nothing.

Parameters:
[in,out]pEvtevent object
Exceptions:
InotifyExceptionthrown if the provided pointer is NULL
bool Inotify::PeekEvent ( InotifyEvent &  rEvt) throw (InotifyException) [inline]

Extracts a queued inotify event (without removing).

The extracted event stays in the queue.

Parameters:
[in,out]rEvtevent object
Exceptions:
InotifyExceptionthrown only in very anomalous cases
void Inotify::Remove ( InotifyWatch *  pWatch) throw (InotifyException)

Removes a watch.

If the given watch is not present it does nothing.

Parameters:
[in]pWatchinotify watch
Exceptions:
InotifyExceptionthrown if removing failed
void Inotify::Remove ( InotifyWatch &  rWatch) throw (InotifyException) [inline]

Removes a watch.

If the given watch is not present it does nothing.

Parameters:
[in]rWatchinotify watch
Exceptions:
InotifyExceptionthrown if removing failed
void Inotify::RemoveAll ( )

Removes all watches.

void Inotify::SetCapability ( InotifyCapability_t  cap,
uint32_t  val 
) throw (InotifyException) [static]

Modifies a particular inotify capability/limit.

Parameters:
[in]capcapability/limit identifier
[in]valnew capability/limit value
Exceptions:
InotifyExceptionthrown if the given value cannot be set
Attention:
Using this function requires root privileges. Beware of setting extensive values - it may seriously affect system performance and/or stability.
void Inotify::SetCloseOnExec ( bool  fClOnEx) throw (InotifyException)

Enables/disables closing on exec.

Enable this if you want to close the descriptor when executing another program. Otherwise, the descriptor will be inherited.

Closing on exec is disabled by default.

Parameters:
[in]fClOnExenable/disable closing on exec
Exceptions:
InotifyExceptionthrown if setting failed
See also:
GetDescriptor(), SetNonBlock()
static void Inotify::SetMaxEvents ( uint32_t  val) throw (InotifyException) [inline, static]

Sets the maximum number of events in the kernel queue.

Parameters:
[in]valnew value
Exceptions:
InotifyExceptionthrown if the given value cannot be set
Attention:
Using this function requires root privileges. Beware of setting extensive values - the greater value is set here the more physical memory may be used for the inotify infrastructure.
static void Inotify::SetMaxInstances ( uint32_t  val) throw (InotifyException) [inline, static]

Sets the maximum number of inotify instances per process.

Parameters:
[in]valnew value
Exceptions:
InotifyExceptionthrown if the given value cannot be set
Attention:
Using this function requires root privileges. Beware of setting extensive values - the greater value is set here the more physical memory may be used for the inotify infrastructure.
static void Inotify::SetMaxWatches ( uint32_t  val) throw (InotifyException) [inline, static]

Sets the maximum number of inotify watches per instance.

Parameters:
[in]valnew value
Exceptions:
InotifyExceptionthrown if the given value cannot be set
Attention:
Using this function requires root privileges. Beware of setting extensive values - the greater value is set here the more physical memory may be used for the inotify infrastructure.
void Inotify::SetNonBlock ( bool  fNonBlock) throw (InotifyException)

Enables/disables non-blocking mode.

Use this mode if you want to monitor the descriptor (acquired thru GetDescriptor()) in functions such as poll(), select() etc.

Non-blocking mode is disabled by default.

Parameters:
[in]fNonBlockenable/disable non-blocking mode
Exceptions:
InotifyExceptionthrown if setting mode failed
See also:
GetDescriptor(), SetCloseOnExec()
void Inotify::WaitForEvents ( bool  fNoIntr = false) throw (InotifyException)

Waits for inotify events.

It waits until one or more events occur. When called in nonblocking mode it only retrieves occurred events to the internal queue and exits.

Parameters:
[in]fNoIntrif true it re-calls the system call after a handled signal
Exceptions:
InotifyExceptionthrown if reading events failed
See also:
SetNonBlock()

Friends And Related Function Documentation

friend class InotifyWatch [friend]
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classInotifyException.html0000644000175000001440000002517211737665757020563 0ustar lukusers incron: InotifyException Class Reference
Public Member Functions | Protected Attributes
InotifyException Class Reference

Class for inotify exceptions. More...

#include <inotify-cxx.h>

List of all members.

Public Member Functions

 InotifyException (const std::string &rMsg="", int iErr=0, void *pSrc=NULL)
 Constructor.
const std::string & GetMessage () const
 Returns the exception message.
int GetErrorNumber () const
 Returns the exception error number.
void * GetSource () const
 Returns the exception source.

Protected Attributes

std::string m_msg
 message
int m_err
 error number
void * m_pSrc
 source

Detailed Description

Class for inotify exceptions.

This class allows to acquire information about exceptional events. It makes easier to log or display error messages and to identify problematic code locations.

Although this class is basically thread-safe it is not intended to be shared between threads.

Constructor & Destructor Documentation

InotifyException::InotifyException ( const std::string &  rMsg = "",
int  iErr = 0,
void *  pSrc = NULL 
) [inline]

Constructor.

Parameters:
[in]rMsgmessage
[in]iErrerror number (see errno.h)
[in]pSrcsource

Member Function Documentation

int InotifyException::GetErrorNumber ( ) const [inline]

Returns the exception error number.

If not applicable this value is 0 (zero).

Returns:
error number (standardized; see errno.h)
const std::string& InotifyException::GetMessage ( ) const [inline]

Returns the exception message.

Returns:
message
void* InotifyException::GetSource ( ) const [inline]

Returns the exception source.

Returns:
source

Member Data Documentation

int InotifyException::m_err [protected]

error number

std::string InotifyException::m_msg [protected]

message

void* InotifyException::m_pSrc [mutable, protected]

source

The documentation for this class was generated from the following file:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/tab_b.png0000644000175000001440000000026211737665757015115 0ustar lukusersPNG  IHDR$[yIDATx ?|SVӈbB#P8O:əD>m{SI'z(!TBމy#WJDp|Å R] 6q]qD.&0=JD=@**IENDB`incron-0.5.10/doc/html/classInotifyException-members.html0000644000175000001440000000706111737665757022210 0ustar lukusers incron: Member List
InotifyException Member List
This is the complete list of members for InotifyException, including all inherited members.
GetErrorNumber() const InotifyException [inline]
GetMessage() const InotifyException [inline]
GetSource() const InotifyException [inline]
InotifyException(const std::string &rMsg="", int iErr=0, void *pSrc=NULL)InotifyException [inline]
m_errInotifyException [protected]
m_msgInotifyException [protected]
m_pSrcInotifyException [mutable, protected]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/ict-main_8cpp.html0000644000175000001440000004576111737665757016676 0ustar lukusers incron: ict-main.cpp File Reference
Defines | Functions
ict-main.cpp File Reference

inotify cron table manipulator main file More...

#include <argp.h>
#include <pwd.h>
#include <string>
#include <unistd.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <sys/inotify.h>
#include <fcntl.h>
#include <stdlib.h>
#include <limits.h>
#include <cstring>
#include <cstdio>
#include "inotify-cxx.h"
#include "appargs.h"
#include "incron.h"
#include "incrontab.h"
#include "incroncfg.h"

Defines

#define INCRON_ALT_EDITOR   "/etc/alternatives/editor"
 Alternative editor.
#define INCRON_DEFAULT_EDITOR   "vim"
 Default (hard-wired) editor.
#define INCRONTAB_VERSION   INCRONTAB_NAME " " INCRON_VERSION
 incrontab version string
#define INCRONTAB_DESCRIPTION
 incrontab description string
#define INCRONTAB_HELP
 incrontab help string

Functions

bool copy_from_file (const std::string &rPath, const std::string &rUser)
 Copies a file to an user table.
bool remove_table (const std::string &rUser)
 Removes an user table.
bool list_table (const std::string &rUser)
 Lists an user table.
bool edit_table (const std::string &rUser)
 Allows to edit an user table.
void list_types ()
 Prints the list of all available inotify event types.
bool reload_table (const std::string &rUser)
 Reloads an user table.
int main (int argc, char **argv)

Detailed Description

inotify cron table manipulator main file

inotify cron system

Copyright (C) 2006, 2007, 2008, 2012 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can use it, redistribute it and/or modify it under the terms of the GNU General Public License, version 2 (see LICENSE-GPL).

Credits: kolter (fix for segfaulting on --user) Christian Ruppert (new include to build with GCC 4.4+)

Define Documentation

#define INCRON_ALT_EDITOR   "/etc/alternatives/editor"

Alternative editor.

#define INCRON_DEFAULT_EDITOR   "vim"

Default (hard-wired) editor.

#define INCRONTAB_DESCRIPTION
Value:
"incrontab - inotify cron table manipulator\n" \
                              "(c) Lukas Jelinek, 2006, 2007, 208"

incrontab description string

#define INCRONTAB_HELP
Value:
INCRONTAB_DESCRIPTION "\n\n" \
          "usage: incrontab [<options>] <operation>\n" \
          "       incrontab [<options>] <FILE-TO-IMPORT>\n\n" \
          "<operation> may be one of the following:\n" \
          "  -?, --about                  gives short information about program\n" \
          "  -h, --help                   prints this help text\n" \
          "  -l, --list                   lists user table\n" \
          "  -r, --remove                 removes user table\n" \
          "  -e, --edit                   provides editing user table\n" \
          "  -t, --types                  list supported event types\n" \
          "  -d, --reload                 request incrond to reload user table\n" \
          "  -V, --version                prints program version\n\n" \
          "\n" \
          "These options may be used:\n" \
          "  -u <USER>, --user=<USER>     overrides current user (requires root privileges)\n" \
          "  -f <FILE>, --config=<FILE>   overrides default configuration file  (requires root privileges)\n\n" \
          "For reporting bugs please use http://bts.aiken.cz\n"

incrontab help string

#define INCRONTAB_VERSION   INCRONTAB_NAME " " INCRON_VERSION

incrontab version string

Function Documentation

bool copy_from_file ( const std::string &  rPath,
const std::string &  rUser 
)

Copies a file to an user table.

Parameters:
[in]rPathpath to file
[in]rUseruser name
Returns:
true = success, false = failure
bool edit_table ( const std::string &  rUser)

Allows to edit an user table.

Parameters:
[in]rUseruser name
Returns:
true = success, false = failure
Attention:
This function is very complex and may contain various bugs including security ones. Please keep it in mind..
bool list_table ( const std::string &  rUser)

Lists an user table.

Parameters:
[in]rUseruser name
Returns:
true = success, false = failure
void list_types ( )

Prints the list of all available inotify event types.

int main ( int  argc,
char **  argv 
)
bool reload_table ( const std::string &  rUser)

Reloads an user table.

Parameters:
[in]rUseruser name
Returns:
true = success, false = otherwise
bool remove_table ( const std::string &  rUser)

Removes an user table.

Parameters:
[in]rUseruser name
Returns:
true = success, false = failure
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/inotify-cxx_8h.html0000644000175000001440000004476611737665757017127 0ustar lukusers incron: inotify-cxx.h File Reference
Classes | Defines | Typedefs | Enumerations
inotify-cxx.h File Reference

inotify C++ interface header More...

#include <stdint.h>
#include <string>
#include <deque>
#include <map>
#include <sys/syscall.h>
#include <sys/inotify.h>
#include <sys/inotify-syscalls.h>

Go to the source code of this file.

Classes

class  InotifyException
 Class for inotify exceptions. More...
class  InotifyEvent
 inotify event class More...
class  InotifyWatch
 inotify watch class More...
class  Inotify
 inotify class More...

Defines

#define INOTIFY_EVENT_SIZE   (sizeof(struct inotify_event))
 Event struct size.
#define INOTIFY_BUFLEN   (1024 * (INOTIFY_EVENT_SIZE + 16))
 Event buffer length.
#define IN_EXC_MSG(msg)   (std::string(__PRETTY_FUNCTION__) + ": " + msg)
 Helper macro for creating exception messages.
#define IN_LOCK_DECL
 inotify-cxx thread safety
#define IN_LOCK_INIT
#define IN_LOCK_DONE
#define IN_READ_BEGIN
#define IN_READ_END
#define IN_READ_END_NOTHROW
#define IN_WRITE_BEGIN
#define IN_WRITE_END
#define IN_WRITE_END_NOTHROW

Typedefs

typedef std::map< int32_t,
InotifyWatch * > 		IN_WATCH_MAP
 Mapping from watch descriptors to watch objects.
typedef std::map< std::string,
InotifyWatch * > 		IN_WP_MAP
 Mapping from paths to watch objects.

Enumerations

enum  InotifyCapability_t { IN_MAX_EVENTS = 0, IN_MAX_INSTANCES = 1, IN_MAX_WATCHES = 2 }
 inotify capability/limit identifiers More...

Detailed Description

inotify C++ interface header

inotify C++ interface

Copyright (C) 2006, 2007, 2008 Lukas Jelinek, <lukas@aiken.cz>

This program is free software; you can redistribute it and/or modify it under the terms of one of the following licenses:

  • 1. X11-style license (see LICENSE-X11)
  • 2. GNU Lesser General Public License, version 2.1 (see LICENSE-LGPL)
  • 3. GNU General Public License, version 2 (see LICENSE-GPL)

If you want to help with choosing the best license for you, please visit http://www.gnu.org/licenses/license-list.html.

Define Documentation

#define IN_EXC_MSG (   msg)    (std::string(__PRETTY_FUNCTION__) + ": " + msg)

Helper macro for creating exception messages.

It prepends the message by the function name.

#define IN_LOCK_DECL

inotify-cxx thread safety

If this symbol is defined you can use this interface safely threaded applications. Remember that it slightly degrades performance.

Even if INOTIFY_THREAD_SAFE is defined some classes stay unsafe. If you must use them (must you?) in more than one thread concurrently you need to implement explicite locking.

You need not to define INOTIFY_THREAD_SAFE in that cases where the application is multithreaded but all the inotify infrastructure will be managed only in one thread. This is the recommended way.

Locking may fail (it is very rare but not impossible). In this case an exception is thrown. But if unlocking fails in case of an error it does nothing (this failure is ignored).

#define IN_LOCK_DONE
#define IN_LOCK_INIT
#define IN_READ_BEGIN
#define IN_READ_END
#define IN_READ_END_NOTHROW
#define IN_WRITE_BEGIN
#define IN_WRITE_END
#define IN_WRITE_END_NOTHROW
#define INOTIFY_BUFLEN   (1024 * (INOTIFY_EVENT_SIZE + 16))

Event buffer length.

#define INOTIFY_EVENT_SIZE   (sizeof(struct inotify_event))

Event struct size.

Typedef Documentation

typedef std::map<int32_t, InotifyWatch*> IN_WATCH_MAP

Mapping from watch descriptors to watch objects.

typedef std::map<std::string, InotifyWatch*> IN_WP_MAP

Mapping from paths to watch objects.

Enumeration Type Documentation

enum InotifyCapability_t

inotify capability/limit identifiers

Enumerator:
IN_MAX_EVENTS 

max. events in the kernel queue

IN_MAX_INSTANCES 

max. inotify file descriptors per process

IN_MAX_WATCHES 

max. watches per file descriptor

Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classInotifyEvent.html0000644000175000001440000005263011737665757017705 0ustar lukusers incron: InotifyEvent Class Reference
Public Member Functions | Static Public Member Functions
InotifyEvent Class Reference

inotify event class More...

#include <inotify-cxx.h>

List of all members.

Public Member Functions

 InotifyEvent ()
 Constructor.
 InotifyEvent (const struct inotify_event *pEvt, InotifyWatch *pWatch)
 Constructor.
 ~InotifyEvent ()
 Destructor.
int32_t GetDescriptor () const
 Returns the event watch descriptor.
uint32_t GetMask () const
 Returns the event mask.
bool IsType (uint32_t uType) const
 Checks for the event type.
uint32_t GetCookie () const
 Returns the event cookie.
uint32_t GetLength () const
 Returns the event name length.
const std::string & GetName () const
 Returns the event name.
void GetName (std::string &rName) const
 Extracts the event name.
InotifyWatch * GetWatch ()
 Returns the source watch.
void DumpTypes (std::string &rStr) const
 Fills the string with all types contained in the event mask.

Static Public Member Functions

static bool IsType (uint32_t uValue, uint32_t uType)
 Checks a value for the event type.
static uint32_t GetMaskByName (const std::string &rName)
 Finds the appropriate mask for a name.
static void DumpTypes (uint32_t uValue, std::string &rStr)
 Fills the string with all types contained in an event mask value.

Detailed Description

inotify event class

It holds all information about inotify event and provides access to its particular values.

This class is not (and is not intended to be) thread-safe and therefore it must not be used concurrently in multiple threads.

Constructor & Destructor Documentation

InotifyEvent::InotifyEvent ( ) [inline]

Constructor.

Creates a plain event.

InotifyEvent::InotifyEvent ( const struct inotify_event *  pEvt,
InotifyWatch *  pWatch 
) [inline]

Constructor.

Creates an event based on inotify event data. For NULL pointers it works the same way as InotifyEvent().

Parameters:
[in]pEvtevent data
[in]pWatchinotify watch
InotifyEvent::~InotifyEvent ( ) [inline]

Destructor.

Member Function Documentation

void InotifyEvent::DumpTypes ( uint32_t  uValue,
std::string &  rStr 
) [static]

Fills the string with all types contained in an event mask value.

Parameters:
[in]uValueevent mask value
[out]rStrdumped event types
void InotifyEvent::DumpTypes ( std::string &  rStr) const

Fills the string with all types contained in the event mask.

Parameters:
[out]rStrdumped event types
uint32_t InotifyEvent::GetCookie ( ) const [inline]

Returns the event cookie.

Returns:
event cookie
int32_t InotifyEvent::GetDescriptor ( ) const

Returns the event watch descriptor.

Returns:
watch descriptor
See also:
InotifyWatch::GetDescriptor()
uint32_t InotifyEvent::GetLength ( ) const [inline]

Returns the event name length.

Returns:
event name length
uint32_t InotifyEvent::GetMask ( ) const [inline]

Returns the event mask.

Returns:
event mask
See also:
InotifyWatch::GetMask()
uint32_t InotifyEvent::GetMaskByName ( const std::string &  rName) [static]

Finds the appropriate mask for a name.

Parameters:
[in]rNamemask name
Returns:
mask for name; 0 on failure
const std::string& InotifyEvent::GetName ( ) const [inline]

Returns the event name.

Returns:
event name
void InotifyEvent::GetName ( std::string &  rName) const [inline]

Extracts the event name.

Parameters:
[out]rNameevent name
InotifyWatch* InotifyEvent::GetWatch ( ) [inline]

Returns the source watch.

Returns:
source watch
static bool InotifyEvent::IsType ( uint32_t  uValue,
uint32_t  uType 
) [inline, static]

Checks a value for the event type.

Parameters:
[in]uValuechecked value
[in]uTypetype which is checked for
Returns:
true = the value contains the given type, false = otherwise
bool InotifyEvent::IsType ( uint32_t  uType) const [inline]

Checks for the event type.

Parameters:
[in]uTypetype which is checked for
Returns:
true = event mask contains the given type, false = otherwise
The documentation for this class was generated from the following files:
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classInotify-members.html0000644000175000001440000002036311737665757020331 0ustar lukusers incron: Member List
Inotify Member List
This is the complete list of members for Inotify, including all inherited members.
Add(InotifyWatch *pWatch)Inotify
Add(InotifyWatch &rWatch)Inotify [inline]
Close()Inotify
FindWatch(int iDescriptor)Inotify
FindWatch(const std::string &rPath)Inotify
GetCapability(InotifyCapability_t cap)Inotify [static]
GetDescriptor() const Inotify [inline]
GetEnabledCount() const Inotify [inline]
GetEvent(InotifyEvent *pEvt)Inotify
GetEvent(InotifyEvent &rEvt)Inotify [inline]
GetEventCount()Inotify [inline]
GetMaxEvents()Inotify [inline, static]
GetMaxInstances()Inotify [inline, static]
GetMaxWatches()Inotify [inline, static]
GetWatchCount() const Inotify [inline]
Inotify()Inotify
InotifyWatch classInotify [friend]
PeekEvent(InotifyEvent *pEvt)Inotify
PeekEvent(InotifyEvent &rEvt)Inotify [inline]
Remove(InotifyWatch *pWatch)Inotify
Remove(InotifyWatch &rWatch)Inotify [inline]
RemoveAll()Inotify
SetCapability(InotifyCapability_t cap, uint32_t val)Inotify [static]
SetCloseOnExec(bool fClOnEx)Inotify
SetMaxEvents(uint32_t val)Inotify [inline, static]
SetMaxInstances(uint32_t val)Inotify [inline, static]
SetMaxWatches(uint32_t val)Inotify [inline, static]
SetNonBlock(bool fNonBlock)Inotify
WaitForEvents(bool fNoIntr=false)Inotify
~Inotify()Inotify
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/structProcData__t-members.html0000644000175000001440000000425511737665757021310 0ustar lukusers incron: Member List
ProcData_t Member List
This is the complete list of members for ProcData_t, including all inherited members.
onDoneProcData_t
pWatchProcData_t
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/globals_eval.html0000644000175000001440000000576511737665757016675 0ustar lukusers incron: File Members
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/classIncronCfg-members.html0000644000175000001440000001006711737665757020560 0ustar lukusers incron: Member List
IncronCfg Member List
This is the complete list of members for IncronCfg, including all inherited members.
BuildPath(const std::string &rPath, const std::string &rName)IncronCfg [static]
GetValue(const std::string &rKey, std::string &rVal)IncronCfg [static]
GetValue(const std::string &rKey, int &rVal)IncronCfg [static]
GetValue(const std::string &rKey, unsigned &rVal)IncronCfg [static]
GetValue(const std::string &rKey, bool &rVal)IncronCfg [static]
Init()IncronCfg [static]
IsComment(const char *s)IncronCfg [protected, static]
Load(const std::string &rPath)IncronCfg [static]
ParseLine(const char *s, std::string &rKey, std::string &rVal)IncronCfg [protected, static]
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/tab_h.png0000644000175000001440000000030011737665757015114 0ustar lukusersPNG  IHDR$[IDATx `FhY 26@cHw!ϗK1^HtOyGD׎ k9?i7zvPaJ})غwV`ai֍ZPC"P=IENDB`incron-0.5.10/doc/html/functions_vars.html0000644000175000001440000000725011737665757017275 0ustar lukusers incron: Class Members - Variables
 
Generated by   doxygen 1.7.5.1
incron-0.5.10/doc/html/bc_s.png0000644000175000001440000000124511737665757014756 0ustar lukusersPNG  IHDR /9lIDATxKHTmwfg8Ә6-Bڴ]dVZMaD}ghB*bU93Fy< ayt %8VjLlCF@m[ 7jRC0TUYYsv~,i).w w\cT i `owgH05%>\.*O0-c}B+ms˅V5:} *lcVO^aXx)0xrKfxxo5IkWaj;V[ƫ@fnؿR.B_CK|.03TH=7㴙8k_ӑϒ2z:V&fBvN9iVY յ>.Qx{E'|dj6ڝ؇x?sJ@uӑhbIҽ2,F[bӑh e'@;^dxg2FaG^@,)l߅ T-RU*ȕEΩ644l #jD Őo{N IENDB`incron-0.5.10/doc/html/classes.html0000644000175000001440000001206611737665757015670 0ustar lukusers incron: Class Index
Class Index
A | E | I | P | S | U
  A  
  E  
IncronTab   
  P  
  U  
IncronTabEntry   
AppArgOption_t   EventDispatcher   Inotify   ProcData_t   UserTable   
AppArgs   
  I  
InotifyEvent   
  S  
AppInstance   InotifyException   
AppInstException   IncronCfg   InotifyWatch   StringTokenizer   
A | E | I | P | S | U
Generated by   doxygen 1.7.5.1