metastore-1+20080623+debian/0000755000175000017500000000000011064703166014057 5ustar userusermetastore-1+20080623+debian/LICENSE0000644000175000017500000004310311064703133015057 0ustar useruser GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, 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. 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 Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 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) year 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 Lesser General Public License instead of this License. metastore-1+20080623+debian/utils.c0000644000175000017500000001364511064703133015366 0ustar useruser/* * Main functions of the program. * * Copyright (C) 2007 David Härdeman * * 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 version 2 of the License. * * 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ #define _BSD_SOURCE #include #include #include #include #include #include #include #include #include #include #include #include "utils.h" /* Controls the verbosity level for msg() */ static int verbosity = 0; /* Adjusts the verbosity level for msg() */ void adjust_verbosity(int adj) { verbosity += adj; } /* * Prints messages to console according to the current verbosity * - see utils.h for level defines */ int msg(int level, const char *fmt, ...) { int ret; va_list ap; if (level > verbosity) return 0; va_start(ap, fmt); if (level < MSG_QUIET) ret = vfprintf(stderr, fmt, ap); else ret = vfprintf(stdout, fmt, ap); va_end(ap); return ret; } /* Malloc which either succeeds or exits */ void * xmalloc(size_t size) { void *result = malloc(size); if (!result) { msg(MSG_CRITICAL, "Failed to malloc %zi bytes\n", size); exit(EXIT_FAILURE); } return result; } /* Ditto for strdup */ char * xstrdup(const char *s) { char *result = strdup(s); if (!result) { msg(MSG_CRITICAL, "Failed to strdup %zi bytes\n", strlen(s)); exit(EXIT_FAILURE); } return result; } /* Human-readable printout of binary data */ void binary_print(const char *s, ssize_t len) { ssize_t i; for (i = 0; i < len; i++) { if (isprint(s[i])) msg(MSG_DEBUG, "%c", s[i]); else msg(MSG_DEBUG, "0x%02X", (int)s[i]); } } /* Writes data to a file or exits on failure */ void xfwrite(const void *ptr, size_t size, FILE *stream) { if (fwrite(ptr, size, 1, stream) != 1) { msg(MSG_CRITICAL, "Failed to write to file: %s\n", strerror(errno)); exit(EXIT_FAILURE); } } /* Writes an int to a file, using len bytes, in bigendian order */ void write_int(uint64_t value, size_t len, FILE *to) { char buf[len]; int i; for (i = 0; i < len; i++) buf[i] = ((value >> (8 * i)) & 0xff); xfwrite(buf, len, to); } /* Writes a binary string to a file */ void write_binary_string(const char *string, size_t len, FILE *to) { xfwrite(string, len, to); } /* Writes a normal C string to a file */ void write_string(const char *string, FILE *to) { xfwrite(string, strlen(string) + 1, to); } /* Reads an int from a file, using len bytes, in bigendian order */ uint64_t read_int(char **from, size_t len, const char *max) { uint64_t result = 0; int i; if (*from + len > max) { msg(MSG_CRITICAL, "Attempt to read beyond end of file, corrupt file?\n"); exit(EXIT_FAILURE); } for (i = 0; i < len; i++) result += (((*from)[i] & 0xff) << (8 * i)); *from += len; return result; } /* Reads a binary string from a file */ char * read_binary_string(char **from, size_t len, const char *max) { char *result; if (*from + len > max) { msg(MSG_CRITICAL, "Attempt to read beyond end of file, corrupt file?\n"); exit(EXIT_FAILURE); } result = xmalloc(len); strncpy(result, *from, len); *from += len; return result; } /* Reads a normal C string from a file */ char * read_string(char **from, const char *max) { return read_binary_string(from, strlen(*from) + 1, max); } /* For group caching */ static struct group *gtable = NULL; /* Initial setup of the gid table */ static void create_group_table() { struct group *tmp; int count, index; for (count = 0; getgrent(); count++) /* Do nothing */; gtable = xmalloc(sizeof(struct group) * (count + 1)); memset(gtable, 0, sizeof(struct group) * (count + 1)); setgrent(); for (index = 0; (tmp = getgrent()) && index < count; index++) { gtable[index].gr_gid = tmp->gr_gid; gtable[index].gr_name = xstrdup(tmp->gr_name); } endgrent(); } /* Caching version of getgrnam */ struct group * xgetgrnam(const char *name) { int i; if (!gtable) create_group_table(); for (i = 0; gtable[i].gr_name; i++) { if (!strcmp(name, gtable[i].gr_name)) return &(gtable[i]); } return NULL; } /* Caching version of getgrgid */ struct group * xgetgrgid(gid_t gid) { int i; if (!gtable) create_group_table(); for (i = 0; gtable[i].gr_name; i++) { if (gtable[i].gr_gid == gid) return &(gtable[i]); } return NULL; } /* For user caching */ static struct passwd *ptable = NULL; /* Initial setup of the passwd table */ static void create_passwd_table() { struct passwd *tmp; int count, index; for (count = 0; getpwent(); count++) /* Do nothing */; ptable = xmalloc(sizeof(struct passwd) * (count + 1)); memset(ptable, 0, sizeof(struct passwd) * (count + 1)); setpwent(); for (index = 0; (tmp = getpwent()) && index < count; index++) { ptable[index].pw_uid = tmp->pw_uid; ptable[index].pw_name = xstrdup(tmp->pw_name); } endpwent(); } /* Caching version of getpwnam */ struct passwd * xgetpwnam(const char *name) { int i; if (!ptable) create_passwd_table(); for (i = 0; ptable[i].pw_name; i++) { if (!strcmp(name, ptable[i].pw_name)) return &(ptable[i]); } return NULL; } /* Caching version of getpwuid */ struct passwd * xgetpwuid(uid_t uid) { int i; if (!ptable) create_passwd_table(); for (i = 0; ptable[i].pw_name; i++) { if (ptable[i].pw_uid == uid) return &(ptable[i]); } return NULL; } metastore-1+20080623+debian/utils.h0000644000175000017500000000517411064703133015371 0ustar useruser/* * Main functions of the program. * * Copyright (C) 2007 David Härdeman * * 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 version 2 of the License. * * 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ /* For uint64_t */ #include /* For ssize_t */ #include /* For FILE */ #include /* For struct passwd */ #include /* For struct group */ #include /* Adjusts the verbosity level for msg() */ void adjust_verbosity(int adj); /* Verbosity levels using stdout */ #define MSG_NORMAL 0 #define MSG_DEBUG 1 #define MSG_QUIET -1 /* Verbosity levels using stderr */ #define MSG_ERROR -2 #define MSG_CRITICAL -3 /* Prints messages to console according to the current verbosity */ int msg(int level, const char *fmt, ...); /* Malloc which either succeeds or exits */ void *xmalloc(size_t size); /* Ditto for strdup */ char *xstrdup(const char *s); /* Human-readable printout of binary data */ void binary_print(const char *s, ssize_t len); /* Writes data to a file or exits on failure */ void xfwrite(const void *ptr, size_t size, FILE *stream); /* Writes an int to a file, using len bytes, in bigendian order */ void write_int(uint64_t value, size_t len, FILE *to); /* Writes a binary string to a file */ void write_binary_string(const char *string, size_t len, FILE *to); /* Writes a normal C string to a file */ void write_string(const char *string, FILE *to); /* Reads an int from a file, using len bytes, in bigendian order */ uint64_t read_int(char **from, size_t len, const char *max); /* Reads a binary string from a file */ char *read_binary_string(char **from, size_t len, const char *max); /* Reads a normal C string from a file */ char *read_string(char **from, const char *max); /* Caching version of getgrnam */ struct group *xgetgrnam(const char *name); /* Caching version of getgrgid */ struct group *xgetgrgid(gid_t gid); /* Caching version of getpwnam */ struct passwd *xgetpwnam(const char *name); /* Caching version of getpwuid */ struct passwd *xgetpwuid(uid_t uid); metastore-1+20080623+debian/metastore.10000644000175000017500000000414011064703133016135 0ustar useruser.TH metastore "1" "May 2007" .\" .SH NAME metastore \- stores and restores filesystem metadata .\" .SH SYNOPSIS \fBmetastore\fR \fIACTION\fR [\fIOPTION...\fR] [\fIPATH...\fR] .\" .SH DESCRIPTION Stores or restores metadata (owner, group, permissions, xattrs and optionally mtime) for a filesystem tree. This can be used to preserve the metadata in situations where it is usually not stored (git and tar for example) or as a tripwire like mechanism to detect any changes to metadata. Note that e.g. SELinux stores its labels in xattrs so care should be taken when applying stored metadata to make sure that system security is not compromised. .\" .SH ACTIONS .TP .B -c, --compare Shows the difference between the stored and real metadata. .TP .B -s, --save Saves the current metadata to ./.metadata or to the specified file (see --file option below). .TP .B -a, --apply Attempts to apply the stored metadata to the file system. .TP .B -h, --help Prints a help message and exits. .\" .SH OPTIONS .TP .B -v, --verbose Causes metastore to print more verbose messages. Can be repeated more than once for even more verbosity. .TP .B -q, --quiet Causes metastore to print less verbose messages. Can be repeated more than once for even less verbosity. .TP .B -m, --mtime Causes metastore to also take mtime into account for the compare or apply actions. .TP .B -e, --empty-dirs Also attempts to recreate missing empty directories. May be useful where empty directories are not tracked (e.g. by git or cvs). Only works in combination with the \fBapply\fR option. This is currently an experimental feature. .TP .B -f , --file Causes the metadata to be saved, read from the specified file rather than ./.metadata. .\" .SH PATHS If no path is specified, metastore will use the current directory as the basis for the actions. This is the recommended way of executing metastore. Alternatively, one or more paths can be specified and they will each be examined. Later invocations should be made using the exact same paths to ensure that the stored metadata is interpreted correctly. .\" .SH AUTHOR Written by David Härdeman metastore-1+20080623+debian/examples/0000755000175000017500000000000011064703133015667 5ustar userusermetastore-1+20080623+debian/examples/pre-commit0000644000175000017500000000124011064703133017663 0ustar useruser#!/bin/bash # # An example hook script to store metadata information using # metastore on each commit. A verification message with a list # of changes will first be shown and only if it is accepted will # the commit proceed. echo "Going to commit the following metadata changes" >&2 metastore -c -m >&2 echo -n "Ok to commit? (y/n): " >&2 read -n1 REPLY echo "" if [ "$REPLY" != "y" ]; then echo "Aborted" >&2 exit 1 fi if ! metastore -s; then echo "Failed to execute metastore -s" >&2 exit 1 fi if [ ! -e ".metadata" ]; then echo ".metadata missing" >&2 exit 1 fi if ! git-add .metadata; then echo "Failed to execute git-add .metadata" >&2 exit 1 fi exit 0 metastore-1+20080623+debian/examples/git-metapull0000644000175000017500000000162211064703133020217 0ustar useruser#!/bin/bash # # This script can be used instead of git-pull when updating a remote # repo to make sure the metadata matches what is stored in the repo. # It will do a git-pull, show a list of changes to be made to the metadata, # and after getting confirmation, apply the changes. DO_MTIME=yes umask 0077 if ! git-pull; then echo "Failed to execute git-pull" >&2 exit 1 fi if [ ! -e ".metadata" ]; then echo ".metadata missing" >&2 exit 1 fi echo "Going to apply the following metadata changes" >&2 if [ "$DO_MTIME" = "yes" ]; then metastore -c -m >&2 else metastore -c >&2 fi echo -n "Ok to apply? (y/n): " >&2 read -n1 REPLY echo "" if [ "$REPLY" != "y" ]; then echo "Aborted" >&2 exit 1 fi if [ "$DO_MTIME" = "yes" ]; then flags="-a -m" else flags="-a" fi if ! metastore $flags; then echo "Failed to execute metastore $flags" >&2 exit 1 fi exit 0 metastore-1+20080623+debian/metaentry.c0000644000175000017500000003457311064703133016241 0ustar useruser/* * Various functions to work with meta entries. * * Copyright (C) 2007 David Härdeman * * 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 version 2 of the License. * * 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ #define _GNU_SOURCE #include #include #include #include #include #include #include #include #include #include #include #include #include #include "metastore.h" #include "metaentry.h" #include "utils.h" /* Free's a metaentry and all its parameters */ static void mentry_free(struct metaentry *m) { int i; if (!m) return; free(m->path); free(m->owner); free(m->group); for (i = 0; i < m->xattrs; i++) { free(m->xattr_names[i]); free(m->xattr_values[i]); } free(m->xattr_names); free(m->xattr_values); free(m->xattr_lvalues); free(m); } /* Allocates an empty metahash table */ static struct metahash * mhash_alloc() { struct metahash *mhash; mhash = xmalloc(sizeof(struct metahash)); memset(mhash, 0, sizeof(struct metahash)); return mhash; } /* Generates a hash key (using djb2) */ static unsigned int hash(const char *str) { unsigned int hash = 5381; int c; while ((c = *str++)) hash = ((hash << 5) + hash) + c; return hash % HASH_INDEXES; } /* Allocates an empty metaentry */ static struct metaentry * mentry_alloc() { struct metaentry *mentry; mentry = xmalloc(sizeof(struct metaentry)); memset(mentry, 0, sizeof(struct metaentry)); return mentry; } /* Does a bisect search for the closest match in a metaentry list */ struct metaentry * mentry_find(const char *path, struct metahash *mhash) { struct metaentry *base; unsigned int key; if (!mhash) { msg(MSG_ERROR, "%s called with empty hash table\n", __FUNCTION__); return NULL; } key = hash(path); for (base = mhash->bucket[key]; base; base = base->next) { if (!strcmp(base->path, path)) return base; } return NULL; } /* Inserts a metaentry into a metaentry list */ static void mentry_insert(struct metaentry *mentry, struct metahash *mhash) { unsigned int key; key = hash(mentry->path); mentry->next = mhash->bucket[key]; mhash->bucket[key] = mentry; } #ifdef DEBUG /* Prints a metaentry */ static void mentry_print(const struct metaentry *mentry) { int i; if (!mentry || !mentry->path) { msg(MSG_DEBUG, "Incorrect meta entry passed to printmetaentry\n"); return; } msg(MSG_DEBUG, "===========================\n"); msg(MSG_DEBUG, "Dump of metaentry %p\n", mentry); msg(MSG_DEBUG, "===========================\n"); msg(MSG_DEBUG, "path\t\t: %s\n", mentry->path); msg(MSG_DEBUG, "owner\t\t: %s\n", mentry->owner); msg(MSG_DEBUG, "group\t\t: %s\n", mentry->group); msg(MSG_DEBUG, "mtime\t\t: %ld\n", (unsigned long)mentry->mtime); msg(MSG_DEBUG, "mtimensec\t: %ld\n", (unsigned long)mentry->mtimensec); msg(MSG_DEBUG, "mode\t\t: %ld\n", (unsigned long)mentry->mode); for (i = 0; i < mentry->xattrs; i++) { msg(MSG_DEBUG, "xattr[%i]\t: %s=\"", i, mentry->xattr_names[i]); binary_print(mentry->xattr_values[i], mentry->xattr_lvalues[i]); msg(MSG_DEBUG, "\"\n"); } msg(MSG_DEBUG, "===========================\n\n"); } /* Prints all metaentries in a metaentry list */ static void mentries_print(const struct metahash *mhash) { const struct metaentry *mentry; int index; for (index = 0; index < HASH_INDEXES; index++) for (mentry = mhash->bucket[i]; mentry; mentry = mentry->next) mentry_print(mentry); msg(MSG_DEBUG, "%i entries in total\n", mhash->count); } #endif /* Creates a metaentry for the file/dir/etc at path */ struct metaentry * mentry_create(const char *path) { ssize_t lsize, vsize; char *list, *attr; struct stat sbuf; struct passwd *pbuf; struct group *gbuf; int i; struct metaentry *mentry; if (lstat(path, &sbuf)) { msg(MSG_ERROR, "lstat failed for %s: %s\n", path, strerror(errno)); return NULL; } pbuf = xgetpwuid(sbuf.st_uid); if (!pbuf) { msg(MSG_ERROR, "getpwuid failed for %s: uid %i not found\n", path, (int)sbuf.st_uid); return NULL; } gbuf = xgetgrgid(sbuf.st_gid); if (!gbuf) { msg(MSG_ERROR, "getgrgid failed for %s: gid %i not found\n", path, (int)sbuf.st_gid); return NULL; } mentry = mentry_alloc(); mentry->path = xstrdup(path); mentry->pathlen = strlen(mentry->path); mentry->owner = xstrdup(pbuf->pw_name); mentry->group = xstrdup(gbuf->gr_name); mentry->mode = sbuf.st_mode & 0177777; mentry->mtime = sbuf.st_mtim.tv_sec; mentry->mtimensec = sbuf.st_mtim.tv_nsec; /* symlinks have no xattrs */ if (S_ISLNK(mentry->mode)) return mentry; lsize = listxattr(path, NULL, 0); if (lsize < 0) { /* Perhaps the FS doesn't support xattrs? */ if (errno == ENOTSUP) return mentry; msg(MSG_ERROR, "listxattr failed for %s: %s\n", path, strerror(errno)); return NULL; } list = xmalloc(lsize); lsize = listxattr(path, list, lsize); if (lsize < 0) { msg(MSG_ERROR, "listxattr failed for %s: %s\n", path, strerror(errno)); free(list); return NULL; } i = 0; for (attr = list; attr < list + lsize; attr = strchr(attr, '\0') + 1) { if (*attr == '\0') continue; i++; } if (i == 0) return mentry; mentry->xattrs = i; mentry->xattr_names = xmalloc(i * sizeof(char *)); mentry->xattr_values = xmalloc(i * sizeof(char *)); mentry->xattr_lvalues = xmalloc(i * sizeof(ssize_t)); i = 0; for (attr = list; attr < list + lsize; attr = strchr(attr, '\0') + 1) { if (*attr == '\0') continue; mentry->xattr_names[i] = xstrdup(attr); vsize = getxattr(path, attr, NULL, 0); if (vsize < 0) { msg(MSG_ERROR, "getxattr failed for %s: %s\n", path, strerror(errno)); free(list); mentry_free(mentry); return NULL; } mentry->xattr_lvalues[i] = vsize; mentry->xattr_values[i] = xmalloc(vsize); vsize = getxattr(path, attr, mentry->xattr_values[i], vsize); if (vsize < 0) { msg(MSG_ERROR, "getxattr failed for %s: %s\n", path, strerror(errno)); free(list); mentry_free(mentry); return NULL; } i++; } free(list); return mentry; } /* Cleans up a path and makes it relative to current working dir unless it is absolute */ static char * normalize_path(const char *orig) { char *real = canonicalize_file_name(orig); char cwd[PATH_MAX]; char *result; getcwd(cwd, PATH_MAX); if (!real) return NULL; if (!strncmp(real, cwd, strlen(cwd))) { result = xmalloc(strlen(real) - strlen(cwd) + 1 + 1); result[0] = '\0'; strcat(result, "."); strcat(result, real + strlen(cwd)); } else { result = xstrdup(real); } free(real); return result; } /* Internal function for the recursive path walk */ static void mentries_recurse(const char *path, struct metahash *mhash) { struct stat sbuf; struct metaentry *mentry; char tpath[PATH_MAX]; DIR *dir; struct dirent *dent; if (!path) return; if (lstat(path, &sbuf)) { msg(MSG_ERROR, "lstat failed for %s: %s\n", path, strerror(errno)); return; } mentry = mentry_create(path); if (!mentry) return; mentry_insert(mentry, mhash); if (S_ISDIR(sbuf.st_mode)) { dir = opendir(path); if (!dir) { msg(MSG_ERROR, "opendir failed for %s: %s\n", path, strerror(errno)); return; } while ((dent = readdir(dir))) { if (!strcmp(dent->d_name, ".") || !strcmp(dent->d_name, "..") || !strcmp(dent->d_name, ".git")) continue; snprintf(tpath, PATH_MAX, "%s/%s", path, dent->d_name); tpath[PATH_MAX - 1] = '\0'; mentries_recurse(tpath, mhash); } closedir(dir); } } /* Recurses opath and adds metadata entries to the metaentry list */ void mentries_recurse_path(const char *opath, struct metahash **mhash) { char *path = normalize_path(opath); if (!(*mhash)) *mhash = mhash_alloc(); mentries_recurse(path, *mhash); free(path); } /* Stores metaentries to a file */ void mentries_tofile(const struct metahash *mhash, const char *path) { FILE *to; const struct metaentry *mentry; int key, i; to = fopen(path, "w"); if (!to) { msg(MSG_CRITICAL, "Failed to open %s: %s\n", path, strerror(errno)); exit(EXIT_FAILURE); } write_binary_string(SIGNATURE, SIGNATURELEN, to); write_binary_string(VERSION, VERSIONLEN, to); for (key = 0; key < HASH_INDEXES; key++) { for (mentry = mhash->bucket[key]; mentry; mentry = mentry->next) { write_string(mentry->path, to); write_string(mentry->owner, to); write_string(mentry->group, to); write_int((uint64_t)mentry->mtime, 8, to); write_int((uint64_t)mentry->mtimensec, 8, to); write_int((uint64_t)mentry->mode, 2, to); write_int(mentry->xattrs, 4, to); for (i = 0; i < mentry->xattrs; i++) { write_string(mentry->xattr_names[i], to); write_int(mentry->xattr_lvalues[i], 4, to); write_binary_string(mentry->xattr_values[i], mentry->xattr_lvalues[i], to); } } } fclose(to); } /* Creates a metaentry list from a file */ void mentries_fromfile(struct metahash **mhash, const char *path) { struct metaentry *mentry; char *mmapstart; char *ptr; char *max; int fd; struct stat sbuf; int i; if (!(*mhash)) *mhash = mhash_alloc(); fd = open(path, O_RDONLY); if (fd < 0) { msg(MSG_CRITICAL, "Failed to open %s: %s\n", path, strerror(errno)); exit(EXIT_FAILURE); } if (fstat(fd, &sbuf)) { msg(MSG_CRITICAL, "Failed to stat %s: %s\n", path, strerror(errno)); exit(EXIT_FAILURE); } if (sbuf.st_size < (SIGNATURELEN + VERSIONLEN)) { msg(MSG_CRITICAL, "File %s has an invalid size\n", path); exit(EXIT_FAILURE); } mmapstart = mmap(NULL, (size_t)sbuf.st_size, PROT_READ, MAP_SHARED, fd, 0); if (mmapstart == MAP_FAILED) { msg(MSG_CRITICAL, "Unable to mmap %s: %s\n", path, strerror(errno)); exit(EXIT_FAILURE); } ptr = mmapstart; max = mmapstart + sbuf.st_size; if (strncmp(ptr, SIGNATURE, SIGNATURELEN)) { msg(MSG_CRITICAL, "Invalid signature for file %s\n", path); goto out; } ptr += SIGNATURELEN; if (strncmp(ptr, VERSION, VERSIONLEN)) { msg(MSG_CRITICAL, "Invalid version of file %s\n", path); goto out; } ptr += VERSIONLEN; while (ptr < mmapstart + sbuf.st_size) { if (*ptr == '\0') { msg(MSG_CRITICAL, "Invalid characters in file %s\n", path); goto out; } mentry = mentry_alloc(); mentry->path = read_string(&ptr, max); mentry->pathlen = strlen(mentry->path); mentry->owner = read_string(&ptr, max); mentry->group = read_string(&ptr, max); mentry->mtime = (time_t)read_int(&ptr, 8, max); mentry->mtimensec = (time_t)read_int(&ptr, 8, max); mentry->mode = (mode_t)read_int(&ptr, 2, max); mentry->xattrs = (unsigned int)read_int(&ptr, 4, max); if (!mentry->xattrs) { mentry_insert(mentry, *mhash); continue; } mentry->xattr_names = xmalloc(mentry->xattrs * sizeof(char *)); mentry->xattr_lvalues = xmalloc(mentry->xattrs * sizeof(int)); mentry->xattr_values = xmalloc(mentry->xattrs * sizeof(char *)); for (i = 0; i < mentry->xattrs; i++) { mentry->xattr_names[i] = read_string(&ptr, max); mentry->xattr_lvalues[i] = (int)read_int(&ptr, 4, max); mentry->xattr_values[i] = read_binary_string(&ptr, mentry->xattr_lvalues[i], max); } mentry_insert(mentry, *mhash); } out: munmap(mmapstart, sbuf.st_size); close(fd); } /* Searches haystack for an xattr matching xattr number n in needle */ int mentry_find_xattr(struct metaentry *haystack, struct metaentry *needle, int n) { int i; for (i = 0; i < haystack->xattrs; i++) { if (strcmp(haystack->xattr_names[i], needle->xattr_names[n])) continue; if (haystack->xattr_lvalues[i] != needle->xattr_lvalues[n]) return -1; if (bcmp(haystack->xattr_values[i], needle->xattr_values[n], needle->xattr_lvalues[n])) return -1; return i; } return -1; } /* Returns zero if all xattrs in left and right match */ static int mentry_compare_xattr(struct metaentry *left, struct metaentry *right) { int i; if (left->xattrs != right->xattrs) return 1; /* Make sure all xattrs in left are found in right and vice versa */ for (i = 0; i < left->xattrs; i++) { if (mentry_find_xattr(right, left, i) < 0 || mentry_find_xattr(left, right, i) < 0) { return 1; } } return 0; } /* Compares two metaentries and returns an int with a bitmask of differences */ int mentry_compare(struct metaentry *left, struct metaentry *right, bool do_mtime) { int retval = DIFF_NONE; if (!left || !right) { msg(MSG_ERROR, "%s called with empty list\n", __FUNCTION__); return -1; } if (strcmp(left->path, right->path)) return -1; if (strcmp(left->owner, right->owner)) retval |= DIFF_OWNER; if (strcmp(left->group, right->group)) retval |= DIFF_GROUP; if ((left->mode & 07777) != (right->mode & 07777)) retval |= DIFF_MODE; if ((left->mode & S_IFMT) != (right->mode & S_IFMT)) retval |= DIFF_TYPE; if (do_mtime && strcmp(left->path, metafile) && (left->mtime != right->mtime || left->mtimensec != right->mtimensec)) retval |= DIFF_MTIME; if (mentry_compare_xattr(left, right)) { retval |= DIFF_XATTR; return retval; } return retval; } /* Compares lists of real and stored metadata and calls pfunc for each */ void mentries_compare(struct metahash *mhashreal, struct metahash *mhashstored, void (*pfunc) (struct metaentry *real, struct metaentry *stored, int cmp), bool do_mtime) { struct metaentry *real, *stored; int key; if (!mhashreal || !mhashstored) { msg(MSG_ERROR, "%s called with empty list\n", __FUNCTION__); return; } for (key = 0; key < HASH_INDEXES; key++) { for (real = mhashreal->bucket[key]; real; real = real->next) { stored = mentry_find(real->path, mhashstored); if (!stored) pfunc(real, NULL, DIFF_ADDED); else pfunc(real, stored, mentry_compare(real, stored, do_mtime)); } for (stored = mhashstored->bucket[key]; stored; stored = stored->next) { real = mentry_find(stored->path, mhashreal); if (!real) pfunc(NULL, stored, DIFF_DELE); } } } metastore-1+20080623+debian/metaentry.h0000644000175000017500000000554611064703133016244 0ustar useruser/* * Various functions to work with meta entries. * * Copyright (C) 2007 David Härdeman * * 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 version 2 of the License. * * 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ #include /* Data structure to hold all metadata for a file/dir */ struct metaentry { struct metaentry *next; /* For the metahash chains */ struct metaentry *list; /* For creating additional lists of entries */ char *path; unsigned int pathlen; char *owner; char *group; mode_t mode; time_t mtime; long mtimensec; unsigned int xattrs; char **xattr_names; ssize_t *xattr_lvalues; char **xattr_values; }; #define HASH_INDEXES 1024 /* Data structure to hold a number of metadata entries */ struct metahash { struct metaentry *bucket[HASH_INDEXES]; unsigned int count; }; /* Create a metaentry for the file/dir/etc at path */ struct metaentry *mentry_create(const char *path); /* Recurses opath and adds metadata entries to the metaentry list */ void mentries_recurse_path(const char *opath, struct metahash **mhash); /* Stores a metaentry list to a file */ void mentries_tofile(const struct metahash *mhash, const char *path); /* Creates a metaentry list from a file */ void mentries_fromfile(struct metahash **mhash, const char *path); /* Searches haystack for an xattr matching xattr number n in needle */ int mentry_find_xattr(struct metaentry *haystack, struct metaentry *needle, int n); #define DIFF_NONE 0x00 #define DIFF_OWNER 0x01 #define DIFF_GROUP 0x02 #define DIFF_MODE 0x04 #define DIFF_TYPE 0x08 #define DIFF_MTIME 0x10 #define DIFF_XATTR 0x20 #define DIFF_ADDED 0x40 #define DIFF_DELE 0x80 /* Compares two metaentries and returns an int with a bitmask of differences */ int mentry_compare(struct metaentry *left, struct metaentry *right, bool do_mtime); /* Compares lists of real and stored metadata and calls pfunc for each */ void mentries_compare(struct metahash *mhashreal, struct metahash *mhashstored, void (*pfunc)(struct metaentry *real, struct metaentry *stored, int cmp), bool do_mtime); metastore-1+20080623+debian/Makefile0000644000175000017500000000325311064703133015514 0ustar useruser# # Copyright (C) 2007 David Härdeman # # 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; version 2 of the License. # # 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 # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # # Generic settings # CC = gcc CFLAGS = -g -Wall -pedantic -std=c99 -D_FILE_OFFSET_BITS=64 -O2 LDFLAGS = INCLUDES = INSTALL = install -c INSTALL_PROGRAM = ${INSTALL} INSTALL_DATA = ${INSTALL} -m 644 COMPILE = $(CC) $(INCLUDES) $(CFLAGS) LINK = $(CC) $(CFLAGS) $(LDFLAGS) OBJECTS = utils.o metastore.o metaentry.o HEADERS = utils.h metastore.h metaentry.h DESTDIR ?= prefix = /usr usrbindir = ${prefix}/bin mandir = ${prefix}/share/man # # Targets # all: metastore .DEFAULT: all %.o: %.c $(HEADERS) $(COMPILE) -o $@ -c $< metastore: $(OBJECTS) $(LINK) -o $@ $^ install: all $(INSTALL_DATA) -D metastore.1 $(DESTDIR)$(mandir)/man1/metastore.1 $(INSTALL_PROGRAM) -D metastore $(DESTDIR)$(usrbindir)/metastore uninstall: - rm -f $(DESTDIR)$(mandir)/man1/metastore.1 - rm -f $(DESTDIR)$(usrbindir)/metastore clean: - rm -f *.o metastore .PHONY: install uninstall clean all metastore-1+20080623+debian/metastore.h0000644000175000017500000000242411064703133016227 0ustar useruser/* * Main functions of the program. * * Copyright (C) 2007 David Härdeman * * 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 version 2 of the License. * * 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ /* Each file starts with SIGNATURE and VERSION */ #define SIGNATURE "MeTaSt00r3" #define SIGNATURELEN 10 #define VERSION "\0\0\0\0\0\0\0\0" #define VERSIONLEN 8 /* Default filename */ #define METAFILE "./.metadata" /* Utility defines for the action to take */ #define ACTION_DIFF 0x01 #define ACTION_SAVE 0x02 #define ACTION_APPLY 0x04 #define ACTION_HELP 0x08 /* Used to store the name of the file containing the metadata */ extern char *metafile; metastore-1+20080623+debian/README0000644000175000017500000000200311064703133014724 0ustar userusermetastore stores or restores metadata (owner, group, permissions, xattrs and optionally mtime) for a filesystem tree. See the manpage (metastore.1) for more details. The file format of the .metastore files is as follows: Data types ---------- CSTRING = NULL-terminated binary string BSTRING(N) = binary string of length N INT(N) = N byte integer in big endian byte order File format ----------- HEADER N * ENTRY HEADER format ------------- BSTRING(10) - Magic header - "MeTaSt00r3" BSTRING(8) - Version - "\0\0\0\0\0\0\0\0" (currently) ENTRY format ------------ CSTRING - Path (absolute or relative) CSTRING - Owner (owner name, not uid) CSTRING - Group (group name, not gid) INT(8) - Mtime (seconds) INT(8) - Mtime (nanoseconds) INT(2) - Mode (st_mode from struct stat st_mode AND 0177777, i.e. unix permissions and type of file) INT(4) - num_xattrs FOR (i = 0; i < num_xattrs; i++) { CSTRING - xattr name INT(4) - xattrlen BSTRING(xattrlen) - xattr value } metastore-1+20080623+debian/metastore.c0000644000175000017500000003117011064703133016222 0ustar useruser/* * Main functions of the program. * * Copyright (C) 2007 David Härdeman * * 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 version 2 of the License. * * 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., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ #define _BSD_SOURCE #include #include #include #include #include #include #include #include #include "metastore.h" #include "utils.h" #include "metaentry.h" /* Used to store the path to the file containing the metadata */ char *metafile = METAFILE; /* Used to indicate whether mtimes should be corrected */ static bool do_mtime = false; /* Used to indicate whether empty dirs should be recreated */ static bool do_emptydirs = false; /* Used to create lists of dirs / other files which are missing in the fs */ static struct metaentry *missingdirs = NULL; static struct metaentry *missingothers = NULL; /* * Inserts an entry in a linked list ordered by pathlen */ static void insert_entry_plist(struct metaentry **list, struct metaentry *entry) { struct metaentry **parent; for (parent = list; *parent; parent = &((*parent)->list)) { if ((*parent)->pathlen > entry->pathlen) break; } entry->list = *parent; *parent = entry; } /* * Prints differences between real and stored actual metadata * - for use in mentries_compare */ static void compare_print(struct metaentry *real, struct metaentry *stored, int cmp) { if (!real && !stored) { msg(MSG_ERROR, "%s called with incorrect arguments\n", __FUNCTION__); return; } if (cmp == DIFF_NONE) { msg(MSG_DEBUG, "%s:\tno difference\n", real->path); return; } msg(MSG_QUIET, "%s:\t", real ? real->path : stored->path); if (cmp & DIFF_ADDED) msg(MSG_QUIET, "added ", real->path); if (cmp & DIFF_DELE) msg(MSG_QUIET, "removed ", stored->path); if (cmp & DIFF_OWNER) msg(MSG_QUIET, "owner "); if (cmp & DIFF_GROUP) msg(MSG_QUIET, "group "); if (cmp & DIFF_MODE) msg(MSG_QUIET, "mode "); if (cmp & DIFF_TYPE) msg(MSG_QUIET, "type "); if (cmp & DIFF_MTIME) msg(MSG_QUIET, "mtime "); if (cmp & DIFF_XATTR) msg(MSG_QUIET, "xattr "); msg(MSG_QUIET, "\n"); } /* * Tries to change the real metadata to match the stored one * - for use in mentries_compare */ static void compare_fix(struct metaentry *real, struct metaentry *stored, int cmp) { struct group *group; struct passwd *owner; gid_t gid = -1; uid_t uid = -1; struct utimbuf tbuf; int i; if (!real && !stored) { msg(MSG_ERROR, "%s called with incorrect arguments\n", __FUNCTION__); return; } if (!real) { if (S_ISDIR(stored->mode)) insert_entry_plist(&missingdirs, stored); else insert_entry_plist(&missingothers, stored); msg(MSG_NORMAL, "%s:\tremoved\n", stored->path); return; } if (!stored) { msg(MSG_NORMAL, "%s:\tadded\n", real->path); return; } if (cmp == DIFF_NONE) { msg(MSG_DEBUG, "%s:\tno difference\n", real->path); return; } if (cmp & DIFF_TYPE) { msg(MSG_NORMAL, "%s:\tnew type, will not change metadata\n", real->path); return; } msg(MSG_QUIET, "%s:\tchanging metadata\n", real->path); while (cmp & (DIFF_OWNER | DIFF_GROUP)) { if (cmp & DIFF_OWNER) { msg(MSG_NORMAL, "%s:\tchanging owner from %s to %s\n", real->path, real->group, stored->group); owner = xgetpwnam(stored->owner); if (!owner) { msg(MSG_DEBUG, "\tgetpwnam failed: %s\n", strerror(errno)); break; } uid = owner->pw_uid; } if (cmp & DIFF_GROUP) { msg(MSG_NORMAL, "%s:\tchanging group from %s to %s\n", real->path, real->group, stored->group); group = xgetgrnam(stored->group); if (!group) { msg(MSG_DEBUG, "\tgetgrnam failed: %s\n", strerror(errno)); break; } gid = group->gr_gid; } if (lchown(real->path, uid, gid)) { msg(MSG_DEBUG, "\tlchown failed: %s\n", strerror(errno)); break; } break; } if (cmp & DIFF_MODE) { msg(MSG_NORMAL, "%s:\tchanging mode from 0%o to 0%o\n", real->path, real->mode & 07777, stored->mode & 07777); if (chmod(real->path, stored->mode & 07777)) msg(MSG_DEBUG, "\tchmod failed: %s\n", strerror(errno)); } /* FIXME: Use utimensat here, or even better - lutimensat */ if ((cmp & DIFF_MTIME) && S_ISLNK(real->mode)) { msg(MSG_NORMAL, "%s:\tsymlink, not changing mtime\n", real->path); } else if (cmp & DIFF_MTIME) { msg(MSG_NORMAL, "%s:\tchanging mtime from %ld to %ld\n", real->path, real->mtime, stored->mtime); tbuf.actime = stored->mtime; tbuf.modtime = stored->mtime; if (utime(real->path, &tbuf)) { msg(MSG_DEBUG, "\tutime failed: %s\n", strerror(errno)); return; } } if (cmp & DIFF_XATTR) { for (i = 0; i < real->xattrs; i++) { /* Any attrs to remove? */ if (mentry_find_xattr(stored, real, i) >= 0) continue; msg(MSG_NORMAL, "%s:\tremoving xattr %s\n", real->path, real->xattr_names[i]); if (lremovexattr(real->path, real->xattr_names[i])) msg(MSG_DEBUG, "\tlremovexattr failed: %s\n", strerror(errno)); } for (i = 0; i < stored->xattrs; i++) { /* Any xattrs to add? (on change they are removed above) */ if (mentry_find_xattr(real, stored, i) >= 0) continue; msg(MSG_NORMAL, "%s:\tadding xattr %s\n", stored->path, stored->xattr_names[i]); if (lsetxattr(stored->path, stored->xattr_names[i], stored->xattr_values[i], stored->xattr_lvalues[i], XATTR_CREATE)) msg(MSG_DEBUG, "\tlsetxattr failed: %s\n", strerror(errno)); } } } /* * Tries to fix any empty dirs which are missing by recreating them. * An "empty" dir is one which either: * - is empty; or * - only contained empty dirs */ static void fixup_emptydirs(struct metahash *real, struct metahash *stored) { struct metaentry *entry; struct metaentry *cur; struct metaentry **parent; char *bpath; char *delim; size_t blen; struct metaentry *new; if (!missingdirs) return; msg(MSG_DEBUG, "\nAttempting to recreate missing dirs\n"); /* If directory x/y is missing, but file x/y/z is also missing, * we should prune directory x/y from the list of directories to * recreate since the deletition of x/y is likely to be genuine * (as opposed to empty dir pruning like git/cvs does). * * Also, if file x/y/z is missing, any child directories of * x/y should be pruned as they are probably also intentionally * removed. */ msg(MSG_DEBUG, "List of candidate dirs:\n"); for (cur = missingdirs; cur; cur = cur->list) msg(MSG_DEBUG, " %s\n", cur->path); for (entry = missingothers; entry; entry = entry->list) { msg(MSG_DEBUG, "Pruning using file %s\n", entry->path); bpath = xstrdup(entry->path); delim = strrchr(bpath, '/'); if (!delim) { msg(MSG_NORMAL, "No delimiter found in %s\n", bpath); free(bpath); continue; } *delim = '\0'; parent = &missingdirs; for (cur = *parent; cur; cur = cur->list) { if (strcmp(cur->path, bpath)) { parent = &cur->list; continue; } msg(MSG_DEBUG, "Prune phase 1 - %s\n", cur->path); *parent = cur->list; } /* Now also prune subdirs of the base dir */ *delim++ = '/'; *delim = '\0'; blen = strlen(bpath); parent = &missingdirs; for (cur = *parent; cur; cur = cur->list) { if (strncmp(cur->path, bpath, blen)) { parent = &cur->list; continue; } msg(MSG_DEBUG, "Prune phase 2 - %s\n", cur->path); *parent = cur->list; } free(bpath); } msg(MSG_DEBUG, "\n"); for (cur = missingdirs; cur; cur = cur->list) { msg(MSG_QUIET, "%s:\trecreating...", cur->path); if (mkdir(cur->path, cur->mode)) { msg(MSG_QUIET, "failed (%s)\n", strerror(errno)); continue; } msg(MSG_QUIET, "ok\n"); new = mentry_create(cur->path); if (!new) { msg(MSG_QUIET, "Failed to get metadata for %s\n"); continue; } compare_fix(new, cur, mentry_compare(new, cur, do_mtime)); } } /* Prints usage message and exits */ static void usage(const char *arg0, const char *message) { if (message) msg(MSG_CRITICAL, "%s: %s\n\n", arg0, message); msg(MSG_CRITICAL, "Usage: %s ACTION [OPTION...] [PATH...]\n\n", arg0); msg(MSG_CRITICAL, "Where ACTION is one of:\n" " -c, --compare\t\tShow differences between stored and real metadata\n" " -s, --save\t\tSave current metadata\n" " -a, --apply\t\tApply stored metadata\n" " -h, --help\t\tHelp message (this text)\n\n" "Valid OPTIONS are:\n" " -v, --verbose\t\tPrint more verbose messages\n" " -q, --quiet\t\tPrint less verbose messages\n" " -m, --mtime\t\tAlso take mtime into account for diff or apply\n" " -e, --empty-dirs\tRecreate missing empty directories (experimental)\n" " -f, --file \tSet metadata file\n" ); exit(message ? EXIT_FAILURE : EXIT_SUCCESS); } /* Options */ static struct option long_options[] = { {"compare", 0, 0, 0}, {"save", 0, 0, 0}, {"apply", 0, 0, 0}, {"help", 0, 0, 0}, {"verbose", 0, 0, 0}, {"quiet", 0, 0, 0}, {"mtime", 0, 0, 0}, {"empty-dirs", 0, 0, 0}, {"file", required_argument, 0, 0}, {0, 0, 0, 0} }; /* Main function */ int main(int argc, char **argv, char **envp) { int i, c; struct metahash *real = NULL; struct metahash *stored = NULL; int action = 0; /* Parse options */ i = 0; while (1) { int option_index = 0; c = getopt_long(argc, argv, "csahvqmef", long_options, &option_index); if (c == -1) break; switch (c) { case 0: if (!strcmp("verbose", long_options[option_index].name)) { adjust_verbosity(1); } else if (!strcmp("quiet", long_options[option_index].name)) { adjust_verbosity(-1); } else if (!strcmp("mtime", long_options[option_index].name)) { do_mtime = true; } else if (!strcmp("empty-dirs", long_options[option_index].name)) { do_emptydirs = true; } else if (!strcmp("file", long_options[option_index].name)) { metafile = optarg; } else { action |= (1 << option_index); i++; } break; case 'c': action |= ACTION_DIFF; i++; break; case 's': action |= ACTION_SAVE; i++; break; case 'a': action |= ACTION_APPLY; i++; break; case 'h': action |= ACTION_HELP; i++; break; case 'v': adjust_verbosity(1); break; case 'q': adjust_verbosity(-1); break; case 'm': do_mtime = true; break; case 'e': do_emptydirs = true; break; case 'f': metafile = optarg; break; default: usage(argv[0], "unknown option"); } } /* Make sure only one action is specified */ if (i != 1) usage(argv[0], "incorrect option(s)"); /* Make sure --empty-dirs is only used with apply */ if (do_emptydirs && action != ACTION_APPLY) usage(argv[0], "--empty-dirs is only valid with --apply"); /* Perform action */ switch (action) { case ACTION_DIFF: mentries_fromfile(&stored, metafile); if (!stored) { msg(MSG_CRITICAL, "Failed to load metadata from %s\n", metafile); exit(EXIT_FAILURE); } if (optind < argc) { while (optind < argc) mentries_recurse_path(argv[optind++], &real); } else { mentries_recurse_path(".", &real); } if (!real) { msg(MSG_CRITICAL, "Failed to load metadata from file system\n"); exit(EXIT_FAILURE); } mentries_compare(real, stored, compare_print, do_mtime); break; case ACTION_SAVE: if (optind < argc) { while (optind < argc) mentries_recurse_path(argv[optind++], &real); } else { mentries_recurse_path(".", &real); } if (!real) { msg(MSG_CRITICAL, "Failed to load metadata from file system\n"); exit(EXIT_FAILURE); } mentries_tofile(real, metafile); break; case ACTION_APPLY: mentries_fromfile(&stored, metafile); if (!stored) { msg(MSG_CRITICAL, "Failed to load metadata from %s\n", metafile); exit(EXIT_FAILURE); } if (optind < argc) { while (optind < argc) mentries_recurse_path(argv[optind++], &real); } else { mentries_recurse_path(".", &real); } if (!real) { msg(MSG_CRITICAL, "Failed to load metadata from file system\n"); exit(EXIT_FAILURE); } mentries_compare(real, stored, compare_fix, do_mtime); if (do_emptydirs) fixup_emptydirs(real, stored); break; case ACTION_HELP: usage(argv[0], NULL); } exit(EXIT_SUCCESS); }