search for: build_hash_t

...I am curious as to whether or not anyone has seen this problem or knows of a fix for it or if it's something I'm doing wrong. I would be grateful for any information. I'm receiving a couple of error messages (both refer to the same problem as far as I know): ERROR: out of memory in build_hash_table rsync error: error allocating core memory buffers (code 22) at util.c(232) The following are the commands being used from a bash script (not the whole script of course): rsync -zaHlv --progress -e /usr/bin/ssh --exclude log --exclude exim /var/* Server_IP:/home/host/var 2>>$error_log rs...

Well, for reference, here's what I'm running: The mirror is running Solaris 8, the source is running Solaris 7. Both are running the same version of rsync: rsync version 2.5.4 protocol version 26 Copyright (C) 1996-2002 by Andrew Tridgell and others <http://rsync.samba.org/> Capabilities: 64-bit files, socketpairs, hard links, symlinks, batchfiles, no IPv6, 64-bit

Granzow, Doug (NCI) [granzowd@mail.nih.gov] writes: > From what I've observed by running top while rsync is running, its memory > usage appears to grow gradually, not exponentially. The exponential portion of the growth is up front when rsync gathers the file listing (it starts with room for 1000 files, then doubles that to 2000, 4000, etc...). So if your rsync has started

Granzow, Doug (NCI) [granzowd@mail.nih.gov] writes: > Hmm... I have a filesystem that contains 3,098,119 files. That's > 3,098,119 * 56 bytes or 173,494,664 bytes (about 165 MB). Allowing > for the exponential resizing we end up with space for 4,096,000 > files * 56 bytes = 218 MB. But 'top' tells me the rsync running on > this filesystem is taking up 646 MB, about 3

...ile. I don't know what the size of the file was before it started having trouble or if they made a bunch of changes in this .dbf fille before it started having trouble. There are other large files that are smaller than this (i.e., 30 GB, etc.). The error message was: ERROR: out of memory in build_hash_table rsync error: error allocating core memory buffers (code 22) at util.c(115) rsync: connection unexpectedly closed (585911608 bytes read so far) rsync error: error in rsync protocol data stream (code 12) at io.c(165) rsync: connection unexpectedly closed (1224 bytes read so far) rsync error: erro...

Maybe security related mails should be sent elsewhere? I didn't notice any so here it goes: sender.c:receive_sums() s->count = read_int(f); .. s->sums = (struct sum_buf *)malloc(sizeof(s->sums[0])*s->count); if (!s->sums) out_of_memory("receive_sums"); for (i=0; i < (int) s->count;i++) { s->sums[i].sum1 = read_int(f);

I am trying to understand how match.c works. I am reading the code and something doesnt look quite right. This is usually a sign that I am missing something obvious. Here is what I see. build_hash_table uses qsort to order targets in ascending order of //tag,index// into the array of checksums. It then accesses the targets in ascending order and writes the index at the tag's location in the tag_table. For any set of targets with identical tags, the highest valued index is the resulting val...

...gure check to make sure that we're not running on some weird system where this is not true? Or should I just let this be as it was? ..wayne.. -------------- next part -------------- --- match.c 3 Jan 2004 19:28:03 -0000 1.60 +++ match.c 27 Jan 2004 17:04:22 -0000 @@ -75,8 +75,12 @@ static void build_hash_table(struct sum_ qsort(targets,s->count,sizeof(targets[0]),(int (*)())compare_targets); +#ifdef WEIRD_MINUS_ONE for (i = 0; i < TABLESIZE; i++) tag_table[i] = NULL_TAG; +#else + memset((char *)tag_table, 0xFF, TABLESIZE * sizeof *tag_table); +#endif for (i = s->count; i-- &gt...

...=%d\n", (double)s->count, csum_length); - if (len > 0 && s->count>0) { + if (buf==NULL) { + rprintf(FINFO, "#ET#>match_sums() sends an empty file (buf=NULL)\n"); + matched(f,s,NULL,0,-1); + } else if (buf->file_size>0 && s->count>0) { build_hash_table(s); if (verbose > 2) rprintf(FINFO,"built hash table\n"); - hash_search(f,s,buf,len); + hash_search(f,s,buf); if (verbose > 2) rprintf(FINFO,"done hash search\n"); } else { OFF_T j; + rprintf(FINFO, "#ET#>match_sums() will se...