Annotation of embedaddon/rsync/exclude.c, revision 1.1.1.1
1.1 misho 1: /*
2: * The filter include/exclude routines.
3: *
4: * Copyright (C) 1996-2001 Andrew Tridgell <tridge@samba.org>
5: * Copyright (C) 1996 Paul Mackerras
6: * Copyright (C) 2002 Martin Pool
7: * Copyright (C) 2003-2009 Wayne Davison
8: *
9: * This program is free software; you can redistribute it and/or modify
10: * it under the terms of the GNU General Public License as published by
11: * the Free Software Foundation; either version 3 of the License, or
12: * (at your option) any later version.
13: *
14: * This program is distributed in the hope that it will be useful,
15: * but WITHOUT ANY WARRANTY; without even the implied warranty of
16: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17: * GNU General Public License for more details.
18: *
19: * You should have received a copy of the GNU General Public License along
20: * with this program; if not, visit the http://fsf.org website.
21: */
22:
23: #include "rsync.h"
24:
25: extern int verbose;
26: extern int am_server;
27: extern int am_sender;
28: extern int eol_nulls;
29: extern int io_error;
30: extern int local_server;
31: extern int prune_empty_dirs;
32: extern int ignore_perishable;
33: extern int delete_mode;
34: extern int delete_excluded;
35: extern int cvs_exclude;
36: extern int sanitize_paths;
37: extern int protocol_version;
38: extern int module_id;
39:
40: extern char curr_dir[MAXPATHLEN];
41: extern unsigned int curr_dir_len;
42: extern unsigned int module_dirlen;
43:
44: struct filter_list_struct filter_list = { 0, 0, "" };
45: struct filter_list_struct cvs_filter_list = { 0, 0, " [global CVS]" };
46: struct filter_list_struct daemon_filter_list = { 0, 0, " [daemon]" };
47:
48: /* Need room enough for ":MODS " prefix plus some room to grow. */
49: #define MAX_RULE_PREFIX (16)
50:
51: #define MODIFIERS_MERGE_FILE "-+Cenw"
52: #define MODIFIERS_INCL_EXCL "/!Crsp"
53: #define MODIFIERS_HIDE_PROTECT "/!p"
54:
55: #define SLASH_WILD3_SUFFIX "/***"
56:
57: /* The dirbuf is set by push_local_filters() to the current subdirectory
58: * relative to curr_dir that is being processed. The path always has a
59: * trailing slash appended, and the variable dirbuf_len contains the length
60: * of this path prefix. The path is always absolute. */
61: static char dirbuf[MAXPATHLEN+1];
62: static unsigned int dirbuf_len = 0;
63: static int dirbuf_depth;
64:
65: /* This is True when we're scanning parent dirs for per-dir merge-files. */
66: static BOOL parent_dirscan = False;
67:
68: /* This array contains a list of all the currently active per-dir merge
69: * files. This makes it easier to save the appropriate values when we
70: * "push" down into each subdirectory. */
71: static struct filter_struct **mergelist_parents;
72: static int mergelist_cnt = 0;
73: static int mergelist_size = 0;
74:
75: /* Each filter_list_struct describes a singly-linked list by keeping track
76: * of both the head and tail pointers. The list is slightly unusual in that
77: * a parent-dir's content can be appended to the end of the local list in a
78: * special way: the last item in the local list has its "next" pointer set
79: * to point to the inherited list, but the local list's tail pointer points
80: * at the end of the local list. Thus, if the local list is empty, the head
81: * will be pointing at the inherited content but the tail will be NULL. To
82: * help you visualize this, here are the possible list arrangements:
83: *
84: * Completely Empty Local Content Only
85: * ================================== ====================================
86: * head -> NULL head -> Local1 -> Local2 -> NULL
87: * tail -> NULL tail -------------^
88: *
89: * Inherited Content Only Both Local and Inherited Content
90: * ================================== ====================================
91: * head -> Parent1 -> Parent2 -> NULL head -> L1 -> L2 -> P1 -> P2 -> NULL
92: * tail -> NULL tail ---------^
93: *
94: * This means that anyone wanting to traverse the whole list to use it just
95: * needs to start at the head and use the "next" pointers until it goes
96: * NULL. To add new local content, we insert the item after the tail item
97: * and update the tail (obviously, if "tail" was NULL, we insert it at the
98: * head). To clear the local list, WE MUST NOT FREE THE INHERITED CONTENT
99: * because it is shared between the current list and our parent list(s).
100: * The easiest way to handle this is to simply truncate the list after the
101: * tail item and then free the local list from the head. When inheriting
102: * the list for a new local dir, we just save off the filter_list_struct
103: * values (so we can pop back to them later) and set the tail to NULL.
104: */
105:
106: static void free_filter(struct filter_struct *ex)
107: {
108: if (ex->match_flags & MATCHFLG_PERDIR_MERGE) {
109: free(ex->u.mergelist->debug_type);
110: free(ex->u.mergelist);
111: mergelist_cnt--;
112: }
113: free(ex->pattern);
114: free(ex);
115: }
116:
117: /* Build a filter structure given a filter pattern. The value in "pat"
118: * is not null-terminated. */
119: static void add_rule(struct filter_list_struct *listp, const char *pat,
120: unsigned int pat_len, uint32 mflags, int xflags)
121: {
122: struct filter_struct *ret;
123: const char *cp;
124: unsigned int pre_len, suf_len, slash_cnt = 0;
125:
126: if (verbose > 2) {
127: rprintf(FINFO, "[%s] add_rule(%s%.*s%s)%s\n",
128: who_am_i(), get_rule_prefix(mflags, pat, 0, NULL),
129: (int)pat_len, pat,
130: (mflags & MATCHFLG_DIRECTORY) ? "/" : "",
131: listp->debug_type);
132: }
133:
134: /* These flags also indicate that we're reading a list that
135: * needs to be filtered now, not post-filtered later. */
136: if (xflags & (XFLG_ANCHORED2ABS|XFLG_ABS_IF_SLASH)) {
137: uint32 mf = mflags & (MATCHFLG_RECEIVER_SIDE|MATCHFLG_SENDER_SIDE);
138: if (am_sender) {
139: if (mf == MATCHFLG_RECEIVER_SIDE)
140: return;
141: } else {
142: if (mf == MATCHFLG_SENDER_SIDE)
143: return;
144: }
145: }
146:
147: if (!(ret = new0(struct filter_struct)))
148: out_of_memory("add_rule");
149:
150: if (pat_len > 1 && pat[pat_len-1] == '/') {
151: pat_len--;
152: mflags |= MATCHFLG_DIRECTORY;
153: }
154:
155: for (cp = pat; cp < pat + pat_len; cp++) {
156: if (*cp == '/')
157: slash_cnt++;
158: }
159:
160: if (!(mflags & (MATCHFLG_ABS_PATH | MATCHFLG_MERGE_FILE))
161: && ((xflags & (XFLG_ANCHORED2ABS|XFLG_ABS_IF_SLASH) && *pat == '/')
162: || (xflags & XFLG_ABS_IF_SLASH && slash_cnt))) {
163: mflags |= MATCHFLG_ABS_PATH;
164: if (*pat == '/')
165: pre_len = dirbuf_len - module_dirlen - 1;
166: else
167: pre_len = 0;
168: } else
169: pre_len = 0;
170:
171: /* The daemon wants dir-exclude rules to get an appended "/" + "***". */
172: if (xflags & XFLG_DIR2WILD3
173: && BITS_SETnUNSET(mflags, MATCHFLG_DIRECTORY, MATCHFLG_INCLUDE)) {
174: mflags &= ~MATCHFLG_DIRECTORY;
175: suf_len = sizeof SLASH_WILD3_SUFFIX - 1;
176: } else
177: suf_len = 0;
178:
179: if (!(ret->pattern = new_array(char, pre_len + pat_len + suf_len + 1)))
180: out_of_memory("add_rule");
181: if (pre_len) {
182: memcpy(ret->pattern, dirbuf + module_dirlen, pre_len);
183: for (cp = ret->pattern; cp < ret->pattern + pre_len; cp++) {
184: if (*cp == '/')
185: slash_cnt++;
186: }
187: }
188: strlcpy(ret->pattern + pre_len, pat, pat_len + 1);
189: pat_len += pre_len;
190: if (suf_len) {
191: memcpy(ret->pattern + pat_len, SLASH_WILD3_SUFFIX, suf_len+1);
192: pat_len += suf_len;
193: slash_cnt++;
194: }
195:
196: if (strpbrk(ret->pattern, "*[?")) {
197: mflags |= MATCHFLG_WILD;
198: if ((cp = strstr(ret->pattern, "**")) != NULL) {
199: mflags |= MATCHFLG_WILD2;
200: /* If the pattern starts with **, note that. */
201: if (cp == ret->pattern)
202: mflags |= MATCHFLG_WILD2_PREFIX;
203: /* If the pattern ends with ***, note that. */
204: if (pat_len >= 3
205: && ret->pattern[pat_len-3] == '*'
206: && ret->pattern[pat_len-2] == '*'
207: && ret->pattern[pat_len-1] == '*')
208: mflags |= MATCHFLG_WILD3_SUFFIX;
209: }
210: }
211:
212: if (mflags & MATCHFLG_PERDIR_MERGE) {
213: struct filter_list_struct *lp;
214: unsigned int len;
215: int i;
216:
217: if ((cp = strrchr(ret->pattern, '/')) != NULL)
218: cp++;
219: else
220: cp = ret->pattern;
221:
222: /* If the local merge file was already mentioned, don't
223: * add it again. */
224: for (i = 0; i < mergelist_cnt; i++) {
225: struct filter_struct *ex = mergelist_parents[i];
226: const char *s = strrchr(ex->pattern, '/');
227: if (s)
228: s++;
229: else
230: s = ex->pattern;
231: len = strlen(s);
232: if (len == pat_len - (cp - ret->pattern)
233: && memcmp(s, cp, len) == 0) {
234: free_filter(ret);
235: return;
236: }
237: }
238:
239: if (!(lp = new_array(struct filter_list_struct, 1)))
240: out_of_memory("add_rule");
241: lp->head = lp->tail = NULL;
242: if (asprintf(&lp->debug_type, " [per-dir %s]", cp) < 0)
243: out_of_memory("add_rule");
244: ret->u.mergelist = lp;
245:
246: if (mergelist_cnt == mergelist_size) {
247: mergelist_size += 5;
248: mergelist_parents = realloc_array(mergelist_parents,
249: struct filter_struct *,
250: mergelist_size);
251: if (!mergelist_parents)
252: out_of_memory("add_rule");
253: }
254: mergelist_parents[mergelist_cnt++] = ret;
255: } else
256: ret->u.slash_cnt = slash_cnt;
257:
258: ret->match_flags = mflags;
259:
260: if (!listp->tail) {
261: ret->next = listp->head;
262: listp->head = listp->tail = ret;
263: } else {
264: ret->next = listp->tail->next;
265: listp->tail->next = ret;
266: listp->tail = ret;
267: }
268: }
269:
270: static void clear_filter_list(struct filter_list_struct *listp)
271: {
272: if (listp->tail) {
273: struct filter_struct *ent, *next;
274: /* Truncate any inherited items from the local list. */
275: listp->tail->next = NULL;
276: /* Now free everything that is left. */
277: for (ent = listp->head; ent; ent = next) {
278: next = ent->next;
279: free_filter(ent);
280: }
281: }
282:
283: listp->head = listp->tail = NULL;
284: }
285:
286: /* This returns an expanded (absolute) filename for the merge-file name if
287: * the name has any slashes in it OR if the parent_dirscan var is True;
288: * otherwise it returns the original merge_file name. If the len_ptr value
289: * is non-NULL the merge_file name is limited by the referenced length
290: * value and will be updated with the length of the resulting name. We
291: * always return a name that is null terminated, even if the merge_file
292: * name was not. */
293: static char *parse_merge_name(const char *merge_file, unsigned int *len_ptr,
294: unsigned int prefix_skip)
295: {
296: static char buf[MAXPATHLEN];
297: char *fn, tmpbuf[MAXPATHLEN];
298: unsigned int fn_len;
299:
300: if (!parent_dirscan && *merge_file != '/') {
301: /* Return the name unchanged it doesn't have any slashes. */
302: if (len_ptr) {
303: const char *p = merge_file + *len_ptr;
304: while (--p > merge_file && *p != '/') {}
305: if (p == merge_file) {
306: strlcpy(buf, merge_file, *len_ptr + 1);
307: return buf;
308: }
309: } else if (strchr(merge_file, '/') == NULL)
310: return (char *)merge_file;
311: }
312:
313: fn = *merge_file == '/' ? buf : tmpbuf;
314: if (sanitize_paths) {
315: const char *r = prefix_skip ? "/" : NULL;
316: /* null-terminate the name if it isn't already */
317: if (len_ptr && merge_file[*len_ptr]) {
318: char *to = fn == buf ? tmpbuf : buf;
319: strlcpy(to, merge_file, *len_ptr + 1);
320: merge_file = to;
321: }
322: if (!sanitize_path(fn, merge_file, r, dirbuf_depth, SP_DEFAULT)) {
323: rprintf(FERROR, "merge-file name overflows: %s\n",
324: merge_file);
325: return NULL;
326: }
327: fn_len = strlen(fn);
328: } else {
329: strlcpy(fn, merge_file, len_ptr ? *len_ptr + 1 : MAXPATHLEN);
330: fn_len = clean_fname(fn, CFN_COLLAPSE_DOT_DOT_DIRS);
331: }
332:
333: /* If the name isn't in buf yet, it's wasn't absolute. */
334: if (fn != buf) {
335: int d_len = dirbuf_len - prefix_skip;
336: if (d_len + fn_len >= MAXPATHLEN) {
337: rprintf(FERROR, "merge-file name overflows: %s\n", fn);
338: return NULL;
339: }
340: memcpy(buf, dirbuf + prefix_skip, d_len);
341: memcpy(buf + d_len, fn, fn_len + 1);
342: fn_len = clean_fname(buf, CFN_COLLAPSE_DOT_DOT_DIRS);
343: }
344:
345: if (len_ptr)
346: *len_ptr = fn_len;
347: return buf;
348: }
349:
350: /* Sets the dirbuf and dirbuf_len values. */
351: void set_filter_dir(const char *dir, unsigned int dirlen)
352: {
353: unsigned int len;
354: if (*dir != '/') {
355: memcpy(dirbuf, curr_dir, curr_dir_len);
356: dirbuf[curr_dir_len] = '/';
357: len = curr_dir_len + 1;
358: if (len + dirlen >= MAXPATHLEN)
359: dirlen = 0;
360: } else
361: len = 0;
362: memcpy(dirbuf + len, dir, dirlen);
363: dirbuf[dirlen + len] = '\0';
364: dirbuf_len = clean_fname(dirbuf, CFN_COLLAPSE_DOT_DOT_DIRS);
365: if (dirbuf_len > 1 && dirbuf[dirbuf_len-1] == '.'
366: && dirbuf[dirbuf_len-2] == '/')
367: dirbuf_len -= 2;
368: if (dirbuf_len != 1)
369: dirbuf[dirbuf_len++] = '/';
370: dirbuf[dirbuf_len] = '\0';
371: if (sanitize_paths)
372: dirbuf_depth = count_dir_elements(dirbuf + module_dirlen);
373: }
374:
375: /* This routine takes a per-dir merge-file entry and finishes its setup.
376: * If the name has a path portion then we check to see if it refers to a
377: * parent directory of the first transfer dir. If it does, we scan all the
378: * dirs from that point through the parent dir of the transfer dir looking
379: * for the per-dir merge-file in each one. */
380: static BOOL setup_merge_file(struct filter_struct *ex,
381: struct filter_list_struct *lp)
382: {
383: char buf[MAXPATHLEN];
384: char *x, *y, *pat = ex->pattern;
385: unsigned int len;
386:
387: if (!(x = parse_merge_name(pat, NULL, 0)) || *x != '/')
388: return 0;
389:
390: y = strrchr(x, '/');
391: *y = '\0';
392: ex->pattern = strdup(y+1);
393: if (!*x)
394: x = "/";
395: if (*x == '/')
396: strlcpy(buf, x, MAXPATHLEN);
397: else
398: pathjoin(buf, MAXPATHLEN, dirbuf, x);
399:
400: len = clean_fname(buf, CFN_COLLAPSE_DOT_DOT_DIRS);
401: if (len != 1 && len < MAXPATHLEN-1) {
402: buf[len++] = '/';
403: buf[len] = '\0';
404: }
405: /* This ensures that the specified dir is a parent of the transfer. */
406: for (x = buf, y = dirbuf; *x && *x == *y; x++, y++) {}
407: if (*x)
408: y += strlen(y); /* nope -- skip the scan */
409:
410: parent_dirscan = True;
411: while (*y) {
412: char save[MAXPATHLEN];
413: strlcpy(save, y, MAXPATHLEN);
414: *y = '\0';
415: dirbuf_len = y - dirbuf;
416: strlcpy(x, ex->pattern, MAXPATHLEN - (x - buf));
417: parse_filter_file(lp, buf, ex->match_flags, XFLG_ANCHORED2ABS);
418: if (ex->match_flags & MATCHFLG_NO_INHERIT)
419: lp->head = NULL;
420: lp->tail = NULL;
421: strlcpy(y, save, MAXPATHLEN);
422: while ((*x++ = *y++) != '/') {}
423: }
424: parent_dirscan = False;
425: free(pat);
426: return 1;
427: }
428:
429: /* Each time rsync changes to a new directory it call this function to
430: * handle all the per-dir merge-files. The "dir" value is the current path
431: * relative to curr_dir (which might not be null-terminated). We copy it
432: * into dirbuf so that we can easily append a file name on the end. */
433: void *push_local_filters(const char *dir, unsigned int dirlen)
434: {
435: struct filter_list_struct *ap, *push;
436: int i;
437:
438: set_filter_dir(dir, dirlen);
439:
440: if (!mergelist_cnt)
441: return NULL;
442:
443: push = new_array(struct filter_list_struct, mergelist_cnt);
444: if (!push)
445: out_of_memory("push_local_filters");
446:
447: for (i = 0, ap = push; i < mergelist_cnt; i++) {
448: memcpy(ap++, mergelist_parents[i]->u.mergelist,
449: sizeof (struct filter_list_struct));
450: }
451:
452: /* Note: parse_filter_file() might increase mergelist_cnt, so keep
453: * this loop separate from the above loop. */
454: for (i = 0; i < mergelist_cnt; i++) {
455: struct filter_struct *ex = mergelist_parents[i];
456: struct filter_list_struct *lp = ex->u.mergelist;
457:
458: if (verbose > 2) {
459: rprintf(FINFO, "[%s] pushing filter list%s\n",
460: who_am_i(), lp->debug_type);
461: }
462:
463: lp->tail = NULL; /* Switch any local rules to inherited. */
464: if (ex->match_flags & MATCHFLG_NO_INHERIT)
465: lp->head = NULL;
466:
467: if (ex->match_flags & MATCHFLG_FINISH_SETUP) {
468: ex->match_flags &= ~MATCHFLG_FINISH_SETUP;
469: if (setup_merge_file(ex, lp))
470: set_filter_dir(dir, dirlen);
471: }
472:
473: if (strlcpy(dirbuf + dirbuf_len, ex->pattern,
474: MAXPATHLEN - dirbuf_len) < MAXPATHLEN - dirbuf_len) {
475: parse_filter_file(lp, dirbuf, ex->match_flags,
476: XFLG_ANCHORED2ABS);
477: } else {
478: io_error |= IOERR_GENERAL;
479: rprintf(FERROR,
480: "cannot add local filter rules in long-named directory: %s\n",
481: full_fname(dirbuf));
482: }
483: dirbuf[dirbuf_len] = '\0';
484: }
485:
486: return (void*)push;
487: }
488:
489: void pop_local_filters(void *mem)
490: {
491: struct filter_list_struct *ap, *pop = (struct filter_list_struct*)mem;
492: int i;
493:
494: for (i = mergelist_cnt; i-- > 0; ) {
495: struct filter_struct *ex = mergelist_parents[i];
496: struct filter_list_struct *lp = ex->u.mergelist;
497:
498: if (verbose > 2) {
499: rprintf(FINFO, "[%s] popping filter list%s\n",
500: who_am_i(), lp->debug_type);
501: }
502:
503: clear_filter_list(lp);
504: }
505:
506: if (!pop)
507: return;
508:
509: for (i = 0, ap = pop; i < mergelist_cnt; i++) {
510: memcpy(mergelist_parents[i]->u.mergelist, ap++,
511: sizeof (struct filter_list_struct));
512: }
513:
514: free(pop);
515: }
516:
517: void change_local_filter_dir(const char *dname, int dlen, int dir_depth)
518: {
519: static int cur_depth = -1;
520: static void *filt_array[MAXPATHLEN/2+1];
521:
522: if (!dname) {
523: for ( ; cur_depth >= 0; cur_depth--) {
524: if (filt_array[cur_depth]) {
525: pop_local_filters(filt_array[cur_depth]);
526: filt_array[cur_depth] = NULL;
527: }
528: }
529: return;
530: }
531:
532: assert(dir_depth < MAXPATHLEN/2+1);
533:
534: for ( ; cur_depth >= dir_depth; cur_depth--) {
535: if (filt_array[cur_depth]) {
536: pop_local_filters(filt_array[cur_depth]);
537: filt_array[cur_depth] = NULL;
538: }
539: }
540:
541: cur_depth = dir_depth;
542: filt_array[cur_depth] = push_local_filters(dname, dlen);
543: }
544:
545: static int rule_matches(const char *fname, struct filter_struct *ex, int name_is_dir)
546: {
547: int slash_handling, str_cnt = 0, anchored_match = 0;
548: int ret_match = ex->match_flags & MATCHFLG_NEGATE ? 0 : 1;
549: char *p, *pattern = ex->pattern;
550: const char *strings[16]; /* more than enough */
551: const char *name = fname + (*fname == '/');
552:
553: if (!*name)
554: return 0;
555:
556: if (!ex->u.slash_cnt && !(ex->match_flags & MATCHFLG_WILD2)) {
557: /* If the pattern does not have any slashes AND it does
558: * not have a "**" (which could match a slash), then we
559: * just match the name portion of the path. */
560: if ((p = strrchr(name,'/')) != NULL)
561: name = p+1;
562: } else if (ex->match_flags & MATCHFLG_ABS_PATH && *fname != '/'
563: && curr_dir_len > module_dirlen + 1) {
564: /* If we're matching against an absolute-path pattern,
565: * we need to prepend our full path info. */
566: strings[str_cnt++] = curr_dir + module_dirlen + 1;
567: strings[str_cnt++] = "/";
568: } else if (ex->match_flags & MATCHFLG_WILD2_PREFIX && *fname != '/') {
569: /* Allow "**"+"/" to match at the start of the string. */
570: strings[str_cnt++] = "/";
571: }
572: strings[str_cnt++] = name;
573: if (name_is_dir) {
574: /* Allow a trailing "/"+"***" to match the directory. */
575: if (ex->match_flags & MATCHFLG_WILD3_SUFFIX)
576: strings[str_cnt++] = "/";
577: } else if (ex->match_flags & MATCHFLG_DIRECTORY)
578: return !ret_match;
579: strings[str_cnt] = NULL;
580:
581: if (*pattern == '/') {
582: anchored_match = 1;
583: pattern++;
584: }
585:
586: if (!anchored_match && ex->u.slash_cnt
587: && !(ex->match_flags & MATCHFLG_WILD2)) {
588: /* A non-anchored match with an infix slash and no "**"
589: * needs to match the last slash_cnt+1 name elements. */
590: slash_handling = ex->u.slash_cnt + 1;
591: } else if (!anchored_match && !(ex->match_flags & MATCHFLG_WILD2_PREFIX)
592: && ex->match_flags & MATCHFLG_WILD2) {
593: /* A non-anchored match with an infix or trailing "**" (but not
594: * a prefixed "**") needs to try matching after every slash. */
595: slash_handling = -1;
596: } else {
597: /* The pattern matches only at the start of the path or name. */
598: slash_handling = 0;
599: }
600:
601: if (ex->match_flags & MATCHFLG_WILD) {
602: if (wildmatch_array(pattern, strings, slash_handling))
603: return ret_match;
604: } else if (str_cnt > 1) {
605: if (litmatch_array(pattern, strings, slash_handling))
606: return ret_match;
607: } else if (anchored_match) {
608: if (strcmp(name, pattern) == 0)
609: return ret_match;
610: } else {
611: int l1 = strlen(name);
612: int l2 = strlen(pattern);
613: if (l2 <= l1 &&
614: strcmp(name+(l1-l2),pattern) == 0 &&
615: (l1==l2 || name[l1-(l2+1)] == '/')) {
616: return ret_match;
617: }
618: }
619:
620: return !ret_match;
621: }
622:
623:
624: static void report_filter_result(enum logcode code, char const *name,
625: struct filter_struct const *ent,
626: int name_is_dir, const char *type)
627: {
628: /* If a trailing slash is present to match only directories,
629: * then it is stripped out by add_rule(). So as a special
630: * case we add it back in here. */
631:
632: if (verbose >= 2) {
633: static char *actions[2][2]
634: = { {"show", "hid"}, {"risk", "protect"} };
635: const char *w = who_am_i();
636: rprintf(code, "[%s] %sing %s %s because of pattern %s%s%s\n",
637: w, actions[*w!='s'][!(ent->match_flags&MATCHFLG_INCLUDE)],
638: name_is_dir ? "directory" : "file", name, ent->pattern,
639: ent->match_flags & MATCHFLG_DIRECTORY ? "/" : "", type);
640: }
641: }
642:
643:
644: /*
645: * Return -1 if file "name" is defined to be excluded by the specified
646: * exclude list, 1 if it is included, and 0 if it was not matched.
647: */
648: int check_filter(struct filter_list_struct *listp, enum logcode code,
649: const char *name, int name_is_dir)
650: {
651: struct filter_struct *ent;
652:
653: for (ent = listp->head; ent; ent = ent->next) {
654: if (ignore_perishable && ent->match_flags & MATCHFLG_PERISHABLE)
655: continue;
656: if (ent->match_flags & MATCHFLG_PERDIR_MERGE) {
657: int rc = check_filter(ent->u.mergelist, code, name,
658: name_is_dir);
659: if (rc)
660: return rc;
661: continue;
662: }
663: if (ent->match_flags & MATCHFLG_CVS_IGNORE) {
664: int rc = check_filter(&cvs_filter_list, code, name,
665: name_is_dir);
666: if (rc)
667: return rc;
668: continue;
669: }
670: if (rule_matches(name, ent, name_is_dir)) {
671: report_filter_result(code, name, ent, name_is_dir,
672: listp->debug_type);
673: return ent->match_flags & MATCHFLG_INCLUDE ? 1 : -1;
674: }
675: }
676:
677: return 0;
678: }
679:
680: #define RULE_STRCMP(s,r) rule_strcmp((s), (r), sizeof (r) - 1)
681:
682: static const uchar *rule_strcmp(const uchar *str, const char *rule, int rule_len)
683: {
684: if (strncmp((char*)str, rule, rule_len) != 0)
685: return NULL;
686: if (isspace(str[rule_len]) || str[rule_len] == '_' || !str[rule_len])
687: return str + rule_len - 1;
688: if (str[rule_len] == ',')
689: return str + rule_len;
690: return NULL;
691: }
692:
693: /* Get the next include/exclude arg from the string. The token will not
694: * be '\0' terminated, so use the returned length to limit the string.
695: * Also, be sure to add this length to the returned pointer before passing
696: * it back to ask for the next token. This routine parses the "!" (list-
697: * clearing) token and (depending on the mflags) the various prefixes.
698: * The *mflags_ptr value will be set on exit to the new MATCHFLG_* bits
699: * for the current token. */
700: static const char *parse_rule_tok(const char *p, uint32 mflags, int xflags,
701: unsigned int *len_ptr, uint32 *mflags_ptr)
702: {
703: const uchar *s = (const uchar *)p;
704: uint32 new_mflags;
705: unsigned int len;
706:
707: if (mflags & MATCHFLG_WORD_SPLIT) {
708: /* Skip over any initial whitespace. */
709: while (isspace(*s))
710: s++;
711: /* Update to point to real start of rule. */
712: p = (const char *)s;
713: }
714: if (!*s)
715: return NULL;
716:
717: new_mflags = mflags & MATCHFLGS_FROM_CONTAINER;
718:
719: /* Figure out what kind of a filter rule "s" is pointing at. Note
720: * that if MATCHFLG_NO_PREFIXES is set, the rule is either an include
721: * or an exclude based on the inheritance of the MATCHFLG_INCLUDE
722: * flag (above). XFLG_OLD_PREFIXES indicates a compatibility mode
723: * for old include/exclude patterns where just "+ " and "- " are
724: * allowed as optional prefixes. */
725: if (mflags & MATCHFLG_NO_PREFIXES) {
726: if (*s == '!' && mflags & MATCHFLG_CVS_IGNORE)
727: new_mflags |= MATCHFLG_CLEAR_LIST; /* Tentative! */
728: } else if (xflags & XFLG_OLD_PREFIXES) {
729: if (*s == '-' && s[1] == ' ') {
730: new_mflags &= ~MATCHFLG_INCLUDE;
731: s += 2;
732: } else if (*s == '+' && s[1] == ' ') {
733: new_mflags |= MATCHFLG_INCLUDE;
734: s += 2;
735: } else if (*s == '!')
736: new_mflags |= MATCHFLG_CLEAR_LIST; /* Tentative! */
737: } else {
738: char ch = 0, *mods = "";
739: switch (*s) {
740: case 'c':
741: if ((s = RULE_STRCMP(s, "clear")) != NULL)
742: ch = '!';
743: break;
744: case 'd':
745: if ((s = RULE_STRCMP(s, "dir-merge")) != NULL)
746: ch = ':';
747: break;
748: case 'e':
749: if ((s = RULE_STRCMP(s, "exclude")) != NULL)
750: ch = '-';
751: break;
752: case 'h':
753: if ((s = RULE_STRCMP(s, "hide")) != NULL)
754: ch = 'H';
755: break;
756: case 'i':
757: if ((s = RULE_STRCMP(s, "include")) != NULL)
758: ch = '+';
759: break;
760: case 'm':
761: if ((s = RULE_STRCMP(s, "merge")) != NULL)
762: ch = '.';
763: break;
764: case 'p':
765: if ((s = RULE_STRCMP(s, "protect")) != NULL)
766: ch = 'P';
767: break;
768: case 'r':
769: if ((s = RULE_STRCMP(s, "risk")) != NULL)
770: ch = 'R';
771: break;
772: case 's':
773: if ((s = RULE_STRCMP(s, "show")) != NULL)
774: ch = 'S';
775: break;
776: default:
777: ch = *s;
778: if (s[1] == ',')
779: s++;
780: break;
781: }
782: switch (ch) {
783: case ':':
784: new_mflags |= MATCHFLG_PERDIR_MERGE
785: | MATCHFLG_FINISH_SETUP;
786: /* FALL THROUGH */
787: case '.':
788: new_mflags |= MATCHFLG_MERGE_FILE;
789: mods = MODIFIERS_INCL_EXCL MODIFIERS_MERGE_FILE;
790: break;
791: case '+':
792: new_mflags |= MATCHFLG_INCLUDE;
793: /* FALL THROUGH */
794: case '-':
795: mods = MODIFIERS_INCL_EXCL;
796: break;
797: case 'S':
798: new_mflags |= MATCHFLG_INCLUDE;
799: /* FALL THROUGH */
800: case 'H':
801: new_mflags |= MATCHFLG_SENDER_SIDE;
802: mods = MODIFIERS_HIDE_PROTECT;
803: break;
804: case 'R':
805: new_mflags |= MATCHFLG_INCLUDE;
806: /* FALL THROUGH */
807: case 'P':
808: new_mflags |= MATCHFLG_RECEIVER_SIDE;
809: mods = MODIFIERS_HIDE_PROTECT;
810: break;
811: case '!':
812: new_mflags |= MATCHFLG_CLEAR_LIST;
813: mods = NULL;
814: break;
815: default:
816: rprintf(FERROR, "Unknown filter rule: `%s'\n", p);
817: exit_cleanup(RERR_SYNTAX);
818: }
819: while (mods && *++s && *s != ' ' && *s != '_') {
820: if (strchr(mods, *s) == NULL) {
821: if (mflags & MATCHFLG_WORD_SPLIT && isspace(*s)) {
822: s--;
823: break;
824: }
825: invalid:
826: rprintf(FERROR,
827: "invalid modifier sequence at '%c' in filter rule: %s\n",
828: *s, p);
829: exit_cleanup(RERR_SYNTAX);
830: }
831: switch (*s) {
832: case '-':
833: if (new_mflags & MATCHFLG_NO_PREFIXES)
834: goto invalid;
835: new_mflags |= MATCHFLG_NO_PREFIXES;
836: break;
837: case '+':
838: if (new_mflags & MATCHFLG_NO_PREFIXES)
839: goto invalid;
840: new_mflags |= MATCHFLG_NO_PREFIXES
841: | MATCHFLG_INCLUDE;
842: break;
843: case '/':
844: new_mflags |= MATCHFLG_ABS_PATH;
845: break;
846: case '!':
847: new_mflags |= MATCHFLG_NEGATE;
848: break;
849: case 'C':
850: if (new_mflags & MATCHFLG_NO_PREFIXES)
851: goto invalid;
852: new_mflags |= MATCHFLG_NO_PREFIXES
853: | MATCHFLG_WORD_SPLIT
854: | MATCHFLG_NO_INHERIT
855: | MATCHFLG_CVS_IGNORE;
856: break;
857: case 'e':
858: new_mflags |= MATCHFLG_EXCLUDE_SELF;
859: break;
860: case 'n':
861: new_mflags |= MATCHFLG_NO_INHERIT;
862: break;
863: case 'p':
864: new_mflags |= MATCHFLG_PERISHABLE;
865: break;
866: case 'r':
867: new_mflags |= MATCHFLG_RECEIVER_SIDE;
868: break;
869: case 's':
870: new_mflags |= MATCHFLG_SENDER_SIDE;
871: break;
872: case 'w':
873: new_mflags |= MATCHFLG_WORD_SPLIT;
874: break;
875: }
876: }
877: if (*s)
878: s++;
879: }
880:
881: if (mflags & MATCHFLG_WORD_SPLIT) {
882: const uchar *cp = s;
883: /* Token ends at whitespace or the end of the string. */
884: while (!isspace(*cp) && *cp != '\0')
885: cp++;
886: len = cp - s;
887: } else
888: len = strlen((char*)s);
889:
890: if (new_mflags & MATCHFLG_CLEAR_LIST) {
891: if (!(mflags & MATCHFLG_NO_PREFIXES)
892: && !(xflags & XFLG_OLD_PREFIXES) && len) {
893: rprintf(FERROR,
894: "'!' rule has trailing characters: %s\n", p);
895: exit_cleanup(RERR_SYNTAX);
896: }
897: if (len > 1)
898: new_mflags &= ~MATCHFLG_CLEAR_LIST;
899: } else if (!len && !(new_mflags & MATCHFLG_CVS_IGNORE)) {
900: rprintf(FERROR, "unexpected end of filter rule: %s\n", p);
901: exit_cleanup(RERR_SYNTAX);
902: }
903:
904: /* --delete-excluded turns an un-modified include/exclude into a sender-side rule. */
905: if (delete_excluded
906: && !(new_mflags & (MATCHFLG_RECEIVER_SIDE|MATCHFLG_SENDER_SIDE|MATCHFLG_MERGE_FILE|MATCHFLG_PERDIR_MERGE)))
907: new_mflags |= MATCHFLG_SENDER_SIDE;
908:
909: *len_ptr = len;
910: *mflags_ptr = new_mflags;
911: return (const char *)s;
912: }
913:
914:
915: static char default_cvsignore[] =
916: /* These default ignored items come from the CVS manual. */
917: "RCS SCCS CVS CVS.adm RCSLOG cvslog.* tags TAGS"
918: " .make.state .nse_depinfo *~ #* .#* ,* _$* *$"
919: " *.old *.bak *.BAK *.orig *.rej .del-*"
920: " *.a *.olb *.o *.obj *.so *.exe"
921: " *.Z *.elc *.ln core"
922: /* The rest we added to suit ourself. */
923: " .svn/ .git/ .hg/ .bzr/";
924:
925: static void get_cvs_excludes(uint32 mflags)
926: {
927: static int initialized = 0;
928: char *p, fname[MAXPATHLEN];
929:
930: if (initialized)
931: return;
932: initialized = 1;
933:
934: parse_rule(&cvs_filter_list, default_cvsignore,
935: mflags | (protocol_version >= 30 ? MATCHFLG_PERISHABLE : 0),
936: 0);
937:
938: p = module_id >= 0 && lp_use_chroot(module_id) ? "/" : getenv("HOME");
939: if (p && pathjoin(fname, MAXPATHLEN, p, ".cvsignore") < MAXPATHLEN)
940: parse_filter_file(&cvs_filter_list, fname, mflags, 0);
941:
942: parse_rule(&cvs_filter_list, getenv("CVSIGNORE"), mflags, 0);
943: }
944:
945:
946: void parse_rule(struct filter_list_struct *listp, const char *pattern,
947: uint32 mflags, int xflags)
948: {
949: unsigned int pat_len;
950: uint32 new_mflags;
951: const char *cp, *p;
952:
953: if (!pattern)
954: return;
955:
956: while (1) {
957: /* Remember that the returned string is NOT '\0' terminated! */
958: cp = parse_rule_tok(pattern, mflags, xflags,
959: &pat_len, &new_mflags);
960: if (!cp)
961: break;
962:
963: pattern = cp + pat_len;
964:
965: if (pat_len >= MAXPATHLEN) {
966: rprintf(FERROR, "discarding over-long filter: %.*s\n",
967: (int)pat_len, cp);
968: continue;
969: }
970:
971: if (new_mflags & MATCHFLG_CLEAR_LIST) {
972: if (verbose > 2) {
973: rprintf(FINFO,
974: "[%s] clearing filter list%s\n",
975: who_am_i(), listp->debug_type);
976: }
977: clear_filter_list(listp);
978: continue;
979: }
980:
981: if (new_mflags & MATCHFLG_MERGE_FILE) {
982: unsigned int len;
983: if (!pat_len) {
984: cp = ".cvsignore";
985: pat_len = 10;
986: }
987: len = pat_len;
988: if (new_mflags & MATCHFLG_EXCLUDE_SELF) {
989: const char *name = cp + len;
990: while (name > cp && name[-1] != '/') name--;
991: len -= name - cp;
992: add_rule(listp, name, len, 0, 0);
993: new_mflags &= ~MATCHFLG_EXCLUDE_SELF;
994: len = pat_len;
995: }
996: if (new_mflags & MATCHFLG_PERDIR_MERGE) {
997: if (parent_dirscan) {
998: if (!(p = parse_merge_name(cp, &len,
999: module_dirlen)))
1000: continue;
1001: add_rule(listp, p, len, new_mflags, 0);
1002: continue;
1003: }
1004: } else {
1005: if (!(p = parse_merge_name(cp, &len, 0)))
1006: continue;
1007: parse_filter_file(listp, p, new_mflags,
1008: XFLG_FATAL_ERRORS);
1009: continue;
1010: }
1011: }
1012:
1013: add_rule(listp, cp, pat_len, new_mflags, xflags);
1014:
1015: if (new_mflags & MATCHFLG_CVS_IGNORE
1016: && !(new_mflags & MATCHFLG_MERGE_FILE))
1017: get_cvs_excludes(new_mflags);
1018: }
1019: }
1020:
1021:
1022: void parse_filter_file(struct filter_list_struct *listp, const char *fname,
1023: uint32 mflags, int xflags)
1024: {
1025: FILE *fp;
1026: char line[BIGPATHBUFLEN];
1027: char *eob = line + sizeof line - 1;
1028: int word_split = mflags & MATCHFLG_WORD_SPLIT;
1029:
1030: if (!fname || !*fname)
1031: return;
1032:
1033: if (*fname != '-' || fname[1] || am_server) {
1034: if (daemon_filter_list.head) {
1035: strlcpy(line, fname, sizeof line);
1036: clean_fname(line, CFN_COLLAPSE_DOT_DOT_DIRS);
1037: if (check_filter(&daemon_filter_list, FLOG, line, 0) < 0)
1038: fp = NULL;
1039: else
1040: fp = fopen(line, "rb");
1041: } else
1042: fp = fopen(fname, "rb");
1043: } else
1044: fp = stdin;
1045:
1046: if (verbose > 2) {
1047: rprintf(FINFO, "[%s] parse_filter_file(%s,%x,%x)%s\n",
1048: who_am_i(), fname, mflags, xflags,
1049: fp ? "" : " [not found]");
1050: }
1051:
1052: if (!fp) {
1053: if (xflags & XFLG_FATAL_ERRORS) {
1054: rsyserr(FERROR, errno,
1055: "failed to open %sclude file %s",
1056: mflags & MATCHFLG_INCLUDE ? "in" : "ex",
1057: fname);
1058: exit_cleanup(RERR_FILEIO);
1059: }
1060: return;
1061: }
1062: dirbuf[dirbuf_len] = '\0';
1063:
1064: while (1) {
1065: char *s = line;
1066: int ch, overflow = 0;
1067: while (1) {
1068: if ((ch = getc(fp)) == EOF) {
1069: if (ferror(fp) && errno == EINTR) {
1070: clearerr(fp);
1071: continue;
1072: }
1073: break;
1074: }
1075: if (word_split && isspace(ch))
1076: break;
1077: if (eol_nulls? !ch : (ch == '\n' || ch == '\r'))
1078: break;
1079: if (s < eob)
1080: *s++ = ch;
1081: else
1082: overflow = 1;
1083: }
1084: if (overflow) {
1085: rprintf(FERROR, "discarding over-long filter: %s...\n", line);
1086: s = line;
1087: }
1088: *s = '\0';
1089: /* Skip an empty token and (when line parsing) comments. */
1090: if (*line && (word_split || (*line != ';' && *line != '#')))
1091: parse_rule(listp, line, mflags, xflags);
1092: if (ch == EOF)
1093: break;
1094: }
1095: fclose(fp);
1096: }
1097:
1098: /* If the "for_xfer" flag is set, the prefix is made compatible with the
1099: * current protocol_version (if possible) or a NULL is returned (if not
1100: * possible). */
1101: char *get_rule_prefix(int match_flags, const char *pat, int for_xfer,
1102: unsigned int *plen_ptr)
1103: {
1104: static char buf[MAX_RULE_PREFIX+1];
1105: char *op = buf;
1106: int legal_len = for_xfer && protocol_version < 29 ? 1 : MAX_RULE_PREFIX-1;
1107:
1108: if (match_flags & MATCHFLG_PERDIR_MERGE) {
1109: if (legal_len == 1)
1110: return NULL;
1111: *op++ = ':';
1112: } else if (match_flags & MATCHFLG_INCLUDE)
1113: *op++ = '+';
1114: else if (legal_len != 1
1115: || ((*pat == '-' || *pat == '+') && pat[1] == ' '))
1116: *op++ = '-';
1117: else
1118: legal_len = 0;
1119:
1120: if (match_flags & MATCHFLG_ABS_PATH)
1121: *op++ = '/';
1122: if (match_flags & MATCHFLG_NEGATE)
1123: *op++ = '!';
1124: if (match_flags & MATCHFLG_CVS_IGNORE)
1125: *op++ = 'C';
1126: else {
1127: if (match_flags & MATCHFLG_NO_INHERIT)
1128: *op++ = 'n';
1129: if (match_flags & MATCHFLG_WORD_SPLIT)
1130: *op++ = 'w';
1131: if (match_flags & MATCHFLG_NO_PREFIXES) {
1132: if (match_flags & MATCHFLG_INCLUDE)
1133: *op++ = '+';
1134: else
1135: *op++ = '-';
1136: }
1137: }
1138: if (match_flags & MATCHFLG_EXCLUDE_SELF)
1139: *op++ = 'e';
1140: if (match_flags & MATCHFLG_SENDER_SIDE
1141: && (!for_xfer || protocol_version >= 29))
1142: *op++ = 's';
1143: if (match_flags & MATCHFLG_RECEIVER_SIDE
1144: && (!for_xfer || protocol_version >= 29
1145: || (delete_excluded && am_sender)))
1146: *op++ = 'r';
1147: if (match_flags & MATCHFLG_PERISHABLE) {
1148: if (!for_xfer || protocol_version >= 30)
1149: *op++ = 'p';
1150: else if (am_sender)
1151: return NULL;
1152: }
1153: if (op - buf > legal_len)
1154: return NULL;
1155: if (legal_len)
1156: *op++ = ' ';
1157: *op = '\0';
1158: if (plen_ptr)
1159: *plen_ptr = op - buf;
1160: return buf;
1161: }
1162:
1163: static void send_rules(int f_out, struct filter_list_struct *flp)
1164: {
1165: struct filter_struct *ent, *prev = NULL;
1166:
1167: for (ent = flp->head; ent; ent = ent->next) {
1168: unsigned int len, plen, dlen;
1169: int elide = 0;
1170: char *p;
1171:
1172: /* Note we need to check delete_excluded here in addition to
1173: * the code in parse_rule_tok() because some rules may have
1174: * been added before we found the --delete-excluded option.
1175: * We must also elide any CVS merge-file rules to avoid a
1176: * backward compatibility problem, and we elide any no-prefix
1177: * merge files as an optimization (since they can only have
1178: * include/exclude rules). */
1179: if (ent->match_flags & MATCHFLG_SENDER_SIDE)
1180: elide = am_sender ? 1 : -1;
1181: if (ent->match_flags & MATCHFLG_RECEIVER_SIDE)
1182: elide = elide ? 0 : am_sender ? -1 : 1;
1183: else if (delete_excluded && !elide
1184: && (!(ent->match_flags & MATCHFLG_PERDIR_MERGE)
1185: || ent->match_flags & MATCHFLG_NO_PREFIXES))
1186: elide = am_sender ? 1 : -1;
1187: if (elide < 0) {
1188: if (prev)
1189: prev->next = ent->next;
1190: else
1191: flp->head = ent->next;
1192: } else
1193: prev = ent;
1194: if (elide > 0)
1195: continue;
1196: if (ent->match_flags & MATCHFLG_CVS_IGNORE
1197: && !(ent->match_flags & MATCHFLG_MERGE_FILE)) {
1198: int f = am_sender || protocol_version < 29 ? f_out : -2;
1199: send_rules(f, &cvs_filter_list);
1200: if (f == f_out)
1201: continue;
1202: }
1203: p = get_rule_prefix(ent->match_flags, ent->pattern, 1, &plen);
1204: if (!p) {
1205: rprintf(FERROR,
1206: "filter rules are too modern for remote rsync.\n");
1207: exit_cleanup(RERR_PROTOCOL);
1208: }
1209: if (f_out < 0)
1210: continue;
1211: len = strlen(ent->pattern);
1212: dlen = ent->match_flags & MATCHFLG_DIRECTORY ? 1 : 0;
1213: if (!(plen + len + dlen))
1214: continue;
1215: write_int(f_out, plen + len + dlen);
1216: if (plen)
1217: write_buf(f_out, p, plen);
1218: write_buf(f_out, ent->pattern, len);
1219: if (dlen)
1220: write_byte(f_out, '/');
1221: }
1222: flp->tail = prev;
1223: }
1224:
1225: /* This is only called by the client. */
1226: void send_filter_list(int f_out)
1227: {
1228: int receiver_wants_list = prune_empty_dirs
1229: || (delete_mode && (!delete_excluded || protocol_version >= 29));
1230:
1231: if (local_server || (am_sender && !receiver_wants_list))
1232: f_out = -1;
1233: if (cvs_exclude && am_sender) {
1234: if (protocol_version >= 29)
1235: parse_rule(&filter_list, ":C", 0, 0);
1236: parse_rule(&filter_list, "-C", 0, 0);
1237: }
1238:
1239: send_rules(f_out, &filter_list);
1240:
1241: if (f_out >= 0)
1242: write_int(f_out, 0);
1243:
1244: if (cvs_exclude) {
1245: if (!am_sender || protocol_version < 29)
1246: parse_rule(&filter_list, ":C", 0, 0);
1247: if (!am_sender)
1248: parse_rule(&filter_list, "-C", 0, 0);
1249: }
1250: }
1251:
1252: /* This is only called by the server. */
1253: void recv_filter_list(int f_in)
1254: {
1255: char line[BIGPATHBUFLEN];
1256: int xflags = protocol_version >= 29 ? 0 : XFLG_OLD_PREFIXES;
1257: int receiver_wants_list = prune_empty_dirs
1258: || (delete_mode
1259: && (!delete_excluded || protocol_version >= 29));
1260: unsigned int len;
1261:
1262: if (!local_server && (am_sender || receiver_wants_list)) {
1263: while ((len = read_int(f_in)) != 0) {
1264: if (len >= sizeof line)
1265: overflow_exit("recv_rules");
1266: read_sbuf(f_in, line, len);
1267: parse_rule(&filter_list, line, 0, xflags);
1268: }
1269: }
1270:
1271: if (cvs_exclude) {
1272: if (local_server || am_sender || protocol_version < 29)
1273: parse_rule(&filter_list, ":C", 0, 0);
1274: if (local_server || am_sender)
1275: parse_rule(&filter_list, "-C", 0, 0);
1276: }
1277:
1278: if (local_server) /* filter out any rules that aren't for us. */
1279: send_rules(-1, &filter_list);
1280: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>