/*
- Copyright (C) Andrew Tridgell 1996
- Copyright (C) Paul Mackerras 1996
-
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
-*/
+ * Routines used by the file-transfer code.
+ *
+ * Copyright (C) 1996 Andrew Tridgell
+ * Copyright (C) 1996 Paul Mackerras
+ * Copyright (C) 2003-2007 Wayne Davison
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2 as
+ * published by the Free Software Foundation.
+ *
+ * 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 "rsync.h"
#include "zlib/zlib.h"
extern int module_id;
extern int def_compress_level;
-static int compression_level;
+static int compression_level, per_file_default_level;
/* determine the compression level based on a wildcard filename list */
void set_compression(char *fname)
{
- char *dont;
- char *tok;
+ static char *match_list;
+ char *s;
if (!do_compression)
return;
- compression_level = def_compress_level;
- dont = lp_dont_compress(module_id);
-
- if (!dont || !*dont)
- return;
-
- if (dont[0] == '*' && !dont[1]) {
- /* an optimization to skip the rest of this routine */
- compression_level = 0;
- return;
+ if (!match_list) {
+ char *t, *f = lp_dont_compress(module_id);
+ int len = strlen(f);
+ if (!(match_list = t = new_array(char, len + 2)))
+ out_of_memory("set_compression");
+ while (*f) {
+ if (*f == ' ') {
+ f++;
+ continue;
+ }
+ do {
+ if (isUpper(f))
+ *t++ = toLower(f);
+ else
+ *t++ = *f;
+ } while (*++f != ' ' && *f);
+ *t++ = '\0';
+ }
+ /* Optimize a match-string of "*". */
+ if (t - match_list == 2 && match_list[0] == '*') {
+ t = match_list;
+ per_file_default_level = 0;
+ } else
+ per_file_default_level = def_compress_level;
+ *t++ = '\0';
}
- dont = strdup(dont);
- fname = strdup(fname);
- if (!dont || !fname)
+ compression_level = per_file_default_level;
+
+ if (!*match_list)
return;
- strlower(dont);
- strlower(fname);
+ if ((s = strrchr(fname, '/')) != NULL)
+ fname = s + 1;
- for (tok = strtok(dont, " "); tok; tok = strtok(NULL, " ")) {
- if (wildmatch(tok, fname)) {
+ for (s = match_list; *s; s += strlen(s) + 1) {
+ if (iwildmatch(s, fname)) {
compression_level = 0;
break;
}
}
- free(dont);
- free(fname);
}
/* non-compressing recv token */
return n;
}
-
/* non-compressing send token */
static void simple_send_token(int f, int32 token, struct map_struct *buf,
OFF_T offset, int32 n)
write_int(f, -(token+1));
}
-
/* Flag bytes in compressed stream are encoded as follows: */
#define END_FLAG 0 /* that's all folks */
#define TOKEN_LONG 0x20 /* followed by 32-bit token number */
last_run_end = 0;
run_start = token;
flush_pending = 0;
-
} else if (last_token == -2) {
run_start = token;
-
} else if (nb != 0 || token != last_token + 1
|| token >= run_start + 65536) {
/* output previous run */
}
}
-
/* tells us what the receiver is in the middle of doing */
static enum { r_init, r_idle, r_running, r_inflating, r_inflated } recv_state;
send_deflated_token(f, token, buf, offset, n, toklen);
}
-
/*
* receive a token or buffer from the other end. If the reurn value is >0 then
* it is a data buffer of that length, and *data will point at the data.