search for: last_i

Hi all I see the rsync source and rsync makes hashing table and search hashing table tag_table to find the index of array struct sum_buf , which is a element of struct sum_struct. According to the source code, variable last_i is used to encourage adjacent matches allowing the RLL coding of the output to work more efficiently. Why last_i makes more efficiency? I can't understanding what last_i makes and when last_i is used. In file match.c below code follows. In file match.c below code follows. /*...

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);

...)len, IO_BUFFER_SIZE-io_buffer_count); if (n > 0) { memcpy(io_buffer+io_buffer_count, buf, n); buf += n; diff -ru rsync-2.4.6/match.c rsync-2.4.6-fixed/match.c --- rsync-2.4.6/match.c Sat Jan 29 06:35:03 2000 +++ rsync-2.4.6-fixed/match.c Mon Jan 28 19:07:54 2002 @@ -141,9 +141,9 @@ last_i = -1; if (verbose > 2) - rprintf(FINFO,"hash search b=%d len=%.0f\n",s->n,(double)len); + rprintf(FINFO,"hash search b=%lu len=%.0f\n",s->n,(double)len); - k = MIN(len, s->n); + k = MIN(len, (ssize_t)s->n); map = (schar *)map_ptr(buf,0,k); @@ -158,...

Hi, I'm having a problem rsyncing one file (since I signed it). It seems that the content of a file is able to cause problems in the protocol. building file list ... 28820 files to consider apt/packages/avifile/ apt/packages/avifile/avifile-0.7.34-1.dag.rh90.i386.rpm rsync: error writing 4 unbuffered bytes - exiting: Broken pipe rsync error: error in rsync protocol data stream (code

Hello guys, I want to make echo tail parameter in my app changeable during run-time. So my question is:f Should I use speex_echo_state_reset function for this? Just call speex_echo_state_init function with new values after that? Or perform a full de-initialization and initialize echo cancellation with new tail value? I'm also using preprocessor - does the same apply to it?

...make sure the two blocks are the same length */ - l = MIN(s->n,len-offset); + l = MIN((ssize_t)s->n,len-offset); if (l != s->sums[i].len) continue; if (verbose > 3) @@ -216,7 +216,7 @@ /* we've found a match, but now check to see if last_i can hint at a better match */ - for (j++; j < (int) s->count && targets[j].t == t; j++) { + for (j++; j < (ssize_t) s->count && targets[j].t == t; j++) { int i2 = targets[j].i; if (i2 == last_i + 1) { if (sum != s->sums[i2].sum1) break; @@ -232,7 +...

...} - if (i >= 0) last_match = offset + s->sums[i].len; else last_match = offset; @@ -127,45 +128,41 @@ } static void hash_search(int f,struct sum_struct *s, - struct map_struct *buf,OFF_T len) + struct map_struct *buf) { - OFF_T offset, end; + OFF_T offset; int j,k, last_i; char sum2[SUM_LENGTH]; uint32 s1, s2, sum; - schar *map; /* last_i is used to encourage adjacent matches, allowing the RLL coding of the output to work more efficiently */ last_i = -1; if (verbose > 2) - rprintf(FINFO,"hash search b=%d len=%.0f\n",s->n,(double)...

...if (verbose > 3) @@ -209,7 +207,7 @@ done_csum2 = 1; } - if (memcmp(sum2,s->sums[i].sum2,csum_length) != 0) { + if (memcmp(sum2,s->sums[i].sum2,s->s2length) != 0) { false_alarms++; continue; } @@ -220,7 +218,7 @@ int i2 = targets[j].i; if (i2 == last_i + 1) { if (sum != s->sums[i2].sum1) break; - if (memcmp(sum2,s->sums[i2].sum2,csum_length) != 0) break; + if (memcmp(sum2,s->sums[i2].sum2,s->s2length) != 0) break; /* we've found an adjacent match - the RLL coder will be happy */ i = i2; @@ -232,...

...if (verbose > 3) @@ -209,7 +207,7 @@ done_csum2 = 1; } - if (memcmp(sum2,s->sums[i].sum2,csum_length) != 0) { + if (memcmp(sum2,s->sums[i].sum2,s->s2length) != 0) { false_alarms++; continue; } @@ -220,7 +218,7 @@ int i2 = targets[j].i; if (i2 == last_i + 1) { if (sum != s->sums[i2].sum1) break; - if (memcmp(sum2,s->sums[i2].sum2,csum_length) != 0) break; + if (memcmp(sum2,s->sums[i2].sum2,s->s2length) != 0) break; /* we've found an adjacent match - the RLL coder will be happy */ i = i2; @@ -232,...

...optimized out> __PRETTY_FUNCTION__ = "gaih_inet" #6 0xb7a80bf5 in *__GI_getaddrinfo (name=0xbfffd654 "messenger.hotmail.com", service=0x0, hints=0xbfffd624, pai=0xbfffd644) at ../sysdeps/posix/getaddrinfo.c:2162 i = <value optimized out> last_i = <value optimized out> nresults = <value optimized out> p = 0x0 gaih_service = {name = 0x10d13c <Address 0x10d13c out of bounds>, num = -1210556416} pservice = 0x0 local_hints = {ai_flags = -1073752584, ai_family = -1210155995,...

The following series of 10 patches is a merge of the xenfb and xenconsoled functionality into the qemu-dm code. The general approach taken is to have qemu-dm provide two machine types - one for xen paravirt, the other for fullyvirt. For compatability the later is the default. The goals overall are to kill LibVNCServer, remove alot of code duplication and/or parallel impls of the same concepts, and