* Copyright (C) 1996 Andrew Tridgell
* Copyright (C) 1996 Paul Mackerras
* Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org>
- * Copyright (C) 2002, 2003, 2004, 2005, 2006 Wayne Davison
+ * Copyright (C) 2002, 2003, 2004, 2005, 2006, 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 as published by
extern int am_server;
extern int am_daemon;
extern int am_sender;
-extern int incremental;
+extern int inc_recurse;
extern int do_progress;
extern int always_checksum;
extern int module_id;
static int show_filelist_p(void)
{
- return verbose && xfer_dirs && !am_server && !incremental;
+ return verbose && xfer_dirs && !am_server && !inc_recurse;
}
static void start_filelist_progress(char *kind)
uid = F_UID(file);
if (preserve_uid && !numeric_ids) {
user_name = add_uid(uid);
- if (incremental && user_name)
+ if (inc_recurse && user_name)
flags |= XMIT_USER_NAME_FOLLOWS;
}
}
gid = F_GID(file);
if (preserve_gid && !numeric_ids) {
group_name = add_gid(gid);
- if (incremental && group_name)
+ if (inc_recurse && group_name)
flags |= XMIT_GROUP_NAME_FOLLOWS;
}
}
if (tmp_dev != 0) {
if (protocol_version >= 30) {
struct idev_node *np = idev_node(tmp_dev, tmp_ino);
- first_hlink_ndx = (int32)np->data - 1;
+ first_hlink_ndx = (int32)(long)np->data - 1;
if (first_hlink_ndx < 0) {
- np->data = (void*)(ndx + 1);
+ np->data = (void*)(long)(ndx + 1);
flags |= XMIT_HLINK_FIRST;
}
flags |= XMIT_HLINKED;
the_end:
strlcpy(lastname, fname, MAXPATHLEN);
+
+ if (S_ISREG(mode) || S_ISLNK(mode))
+ stats.total_size += F_LENGTH(file);
}
static struct file_struct *recv_file_entry(struct file_list *flist,
uid = (uid_t)read_int(f);
if (flags & XMIT_USER_NAME_FOLLOWS)
uid = recv_user_name(f, uid);
- else if (incremental && am_root && !numeric_ids)
+ else if (inc_recurse && am_root && !numeric_ids)
uid = match_uid(uid);
}
if (preserve_gid && !(flags & XMIT_SAME_GID)) {
gid = (gid_t)read_int(f);
if (flags & XMIT_GROUP_NAME_FOLLOWS)
gid = recv_group_name(f, gid);
- else if (incremental && (!am_root || !numeric_ids))
+ else if (inc_recurse && (!am_root || !numeric_ids))
gid = match_gid(gid);
}
extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
#endif
- if (incremental && S_ISDIR(mode)) {
+ if (inc_recurse && S_ISDIR(mode)) {
if (one_file_system) {
/* Room to save the dir's device for -x */
extra_len += 2 * EXTRA_LEN;
ino = read_longint(f);
}
np = idev_node(dev, ino);
- ndx = (int32)np->data - 1;
+ ndx = (int32)(long)np->data - 1;
if (ndx < 0) {
ndx = cnt++;
- np->data = (void*)cnt;
+ np->data = (void*)(long)cnt;
}
F_HL_GNUM(file) = ndx;
}
read_buf(f, bp, checksum_len);
}
+ if (S_ISREG(mode) || S_ISLNK(mode))
+ stats.total_size += file_length;
+
return file;
}
file->mode = save_mode;
}
- if (S_ISREG(st.st_mode) || S_ISLNK(st.st_mode))
- stats.total_size += st.st_size;
-
if (basename_len == 0+1)
return NULL;
- if (incremental && flist == dir_flist) {
+ if (inc_recurse && flist == dir_flist) {
flist_expand(flist);
flist->files[flist->count++] = file;
}
char fbuf[MAXPATHLEN];
struct file_list *flist;
int64 start_write;
- int past_and_present, save_io_error = io_error;
+ int future_cnt, save_io_error = io_error;
if (send_dir_ndx < 0)
return;
/* Keep sending data until we have the requested number of
* files in the upcoming file-lists. */
- past_and_present = cur_flist->ndx_start - first_flist->ndx_start
- + cur_flist->count;
- while (file_total - past_and_present < at_least) {
+ if (cur_flist->next) {
+ flist = first_flist->prev; /* the newest flist */
+ future_cnt = flist->count
+ + flist->ndx_start - cur_flist->next->ndx_start;
+ } else
+ future_cnt = 0;
+ while (future_cnt < at_least) {
struct file_struct *file = dir_flist->files[send_dir_ndx];
int32 *dp;
int dlen;
clean_flist(flist, 0, 0);
file_total += flist->count;
+ future_cnt += flist->count;
stats.flist_size += stats.total_written - start_write;
stats.num_files += flist->count;
if (verbose > 3)
rprintf(FLOG, "building file list\n");
if (show_filelist_p())
start_filelist_progress("building file list");
- else if (incremental && verbose && !am_server)
+ else if (inc_recurse && verbose && !am_server)
rprintf(FCLIENT, "sending incremental file list\n");
start_write = stats.total_written;
#endif
flist = cur_flist = flist_new(0, "send_file_list");
- if (incremental) {
+ if (inc_recurse) {
dir_flist = flist_new(FLIST_TEMP, "send_file_list");
flags = FLAG_DIVERT_DIRS;
} else {
if (fn != p || (*lp && *lp != '/')) {
int save_copy_links = copy_links;
int save_xfer_dirs = xfer_dirs;
- int dir_flags = incremental ? FLAG_DIVERT_DIRS : 0;
+ int dir_flags = inc_recurse ? FLAG_DIVERT_DIRS : 0;
copy_links |= copy_unsafe_links;
xfer_dirs = 1;
while ((slash = strchr(slash+1, '/')) != 0) {
struct file_struct *file;
int top_flags = FLAG_TOP_DIR | FLAG_XFER_DIR
| (is_dot_dir ? 0 : flags)
- | (incremental ? FLAG_DIVERT_DIRS : 0);
+ | (inc_recurse ? FLAG_DIVERT_DIRS : 0);
file = send_file_name(f, flist, fbuf, &st,
top_flags, ALL_FILTERS);
- if (file && !incremental)
+ if (file && !inc_recurse)
send_if_directory(f, flist, file, fbuf, len, flags);
} else
send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
write_byte(f, 0); /* Indicate end of file list */
#ifdef SUPPORT_HARD_LINKS
- if (preserve_hard_links && protocol_version >= 30 && !incremental)
+ if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
idev_destroy();
#endif
* kept. For incremental mode, the sender also removes duplicates
* in this initial file-list so that it avoids re-sending duplicated
* directories. */
- clean_flist(flist, 0, incremental);
+ clean_flist(flist, 0, inc_recurse);
file_total += flist->count;
- if (!numeric_ids && !incremental)
+ if (!numeric_ids && !inc_recurse)
send_uid_list(f);
/* send the io_error flag */
if (verbose > 2)
rprintf(FINFO, "send_file_list done\n");
- if (incremental) {
+ if (inc_recurse) {
add_dirs_to_tree(-1, 0, dir_flist->count - 1);
if (file_total == 1) {
/* If we're creating incremental file-lists and there
rprintf(FLOG, "receiving file list\n");
if (show_filelist_p())
start_filelist_progress("receiving file list");
- else if (incremental && verbose && !am_server && !first_flist)
+ else if (inc_recurse && verbose && !am_server && !first_flist)
rprintf(FCLIENT, "receiving incremental file list\n");
start_read = stats.total_read;
init_hard_links();
#endif
- if (incremental) {
+ if (inc_recurse) {
if (flist->ndx_start == 0)
dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
dstart = dir_flist->count;
flags |= read_byte(f) << 8;
file = recv_file_entry(flist, flags, f);
- if (S_ISREG(file->mode) || S_ISLNK(file->mode))
- stats.total_size += F_LENGTH(file);
-
- if (incremental && S_ISDIR(file->mode)) {
+ if (inc_recurse && S_ISDIR(file->mode)) {
flist_expand(dir_flist);
dir_flist->files[dir_flist->count++] = file;
}
clean_flist(flist, relative_paths, 1);
- if (incremental) {
+ if (inc_recurse) {
qsort(dir_flist->files + dstart, dir_flist->count - dstart,
sizeof dir_flist->files[0], (int (*)())file_compare);
} else if (f >= 0)
}
}
}
- /* Dump empty all remaining empty dirs. */
+ /* Dump all remaining empty dirs. */
while (1) {
struct file_struct *fp = flist->files[prev_i];
if (F_DEPTH(fp) >= 0)