search for: schar

...up the setup program for ms word 97, and it runs into this error: setup is unable to open the data file X:\~MSSETUP.t\~msstfof.t\Word97.stf';run setup again from were you ariginally ran it im stumped, what should i be doing here differently...thanks ............................... Daniel W. Schar Dept of Biology (OBEE), UCLA 621 Charles Young Dr. South Los Angeles, CA 90095-1606

Attached is a patch that makes window strides constant when files are walked with a constant block size. In these cases, it completely avoids all memmoves. In my simple local test of rsyncing 57MB of 10 local files, memmoved bytes went from 18MB to zero. I haven't tested this for a big variety of file cases. I think that this will always reduce the memmoves involved with walking a large

...(such as sse_maddubs_epi16) to call every loop + iteration instead of properly inlining them, negating any performance gain. + */ +__attribute__ ((target ("sse2", "ssse3"))) static inline uint32 get_checksum1_accel(char *buf1, int32 len) { + int32 i; + uint32 s1, s2; + schar *buf = (schar *)buf1; + + i = s1 = s2 = 0; + if (len > 32) { + const char mul_t1_buf[16] = {28, 0, 24, 0, 20, 0, 16, 0, 12, 0, 8, 0, 4, 0, 0, 0}; + __m128i mul_t1 = sse_load_si128((__m128i_u*)mul_t1_buf); + __m128i ss1 = _mm_setzero_si128(); + __m128i ss2 = _mm_...

Hi, This is such a trivial programming issue, but I can''t find a way to transform, say ''abc'' to ''a-b-c'' without using pattern matching. Any ideas? Thanks in Advance, Richard --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To post

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

Hi all, I am writing a xdelta-like application as a personal experiment and am busy implementing the rsync protocol, so far so good. I am using C++ templates and creating the algorithms so that operate on any stream, array, etc. through iterators. All seems well except that I am getting a lot of false hits with the weak checksum. When generating checksums of blocksize 1024 on the RedHat 7.1

...every loop > + iteration instead of properly inlining them, negating any performance gain. > + */ > +__attribute__ ((target ("sse2", "ssse3"))) static inline uint32 > get_checksum1_accel(char *buf1, int32 len) { > + int32 i; > + uint32 s1, s2; > + schar *buf = (schar *)buf1; > + > + i = s1 = s2 = 0; > + if (len > 32) { > + const char mul_t1_buf[16] = {28, 0, 24, 0, 20, 0, 16, 0, 12, > 0, 8, 0, 4, 0, 0, 0}; > + __m128i mul_t1 = sse_load_si128((__m128i_u*)mul_t1_buf); > + __m128i ss1 = _mm_setzero_s...

...: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,7 +158,7 @@ end = len + 1 - s->sums[s->count-1].len; if (verbose > 3) - rprintf(FINFO,"hash search s->n=%d len=%.0f count=%d\n", + rprintf(FINFO,"hash search s->n=%lu len=%.0f count=%lu\n", s->n,(double)len,s->coun...

What do you base this on? Per https://gcc.gnu.org/onlinedocs/gcc/x86-Options.html : "For the x86-32 compiler, you must use -march=cpu-type, -msse or -msse2 switches to enable SSE extensions and make this option effective. For the x86-64 compiler, these extensions are enabled by default." That reads to me like we're fine for SSE2. As stated in my comments, SSSE3 support must be

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

...t2[1] + t2[2] + t2[3] + t2[4] + t2[5] + t2[6] + t2[7] + + ((16+32+48+64+80+96) + 8)*CHAR_OFFSET; + s1 += t1[0] + t1[1] + t1[2] + t1[3] + t1[4] + t1[5] + t1[6] + t1[7] + + 32*CHAR_OFFSET; + */ +uint32 get_checksum1(char *buf1, int32 len) +{ + int32 i; + uint32 s1, s2; + schar *buf = (schar *)buf1; + + i = s1 = s2 = 0; + if (len > 32) { + const char mul_t1_buf[16] = {28, 0, 24, 0, 20, 0, 16, 0, 12, 0, 8, 0, 4, 0, 0, 0}; + __m128i mul_t1 = sse_load_si128((void const*)mul_t1_buf); + __m128i ss1 = _mm_setzero_si128(); + __m128i ss2 = _mm...

...+ t2[7] + > + ((16+32+48+64+80+96) + 8)*CHAR_OFFSET; > + s1 += t1[0] + t1[1] + t1[2] + t1[3] + t1[4] + t1[5] + t1[6] + t1[7] + > + 32*CHAR_OFFSET; > + */ > +uint32 get_checksum1(char *buf1, int32 len) > +{ > + int32 i; > + uint32 s1, s2; > + schar *buf = (schar *)buf1; > + > + i = s1 = s2 = 0; > + if (len > 32) { > + const char mul_t1_buf[16] = {28, 0, 24, 0, 20, 0, 16, 0, 12, > 0, 8, 0, 4, 0, 0, 0}; > + __m128i mul_t1 = sse_load_si128((void const*)mul_t1_buf); > + __m128i ss1 = _mm_setzero_...

...ums[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)len); + rprintf(FINFO,"hash search b=%d\n",s-&...

...follows: If you need a temp char buffer, you can allocate one with a new helper macro like this: /* CallocCharBuf takes care of the +1 for the \0, so the size argument is the length of your string. */ char *tmp = CallocCharBuf(n); /* manipulate tmp */ SEXP schar = mkChar(tmp); Free(tmp); You can also use R_alloc which has the advantage of not having to free it in a .Call function. The mkChar function now consults the global CHARSXP cache and will return an already existing CHARSXP if one with a matching string exists. Otherwise, it will creat...

...;n, (double)len); + (long) s->blength, (double)len); - /* cast is to make s->n signed; it should always be reasonably + /* cast is to make s->blength signed; it should always be reasonably * small */ - k = MIN(len, (OFF_T) s->n); + k = MIN(len, (OFF_T) s->blength); map = (schar *)map_ptr(buf,0,k); @@ -173,8 +171,8 @@ end = len + 1 - s->sums[s->count-1].len; if (verbose > 3) - rprintf(FINFO, "hash search s->n=%ld len=%.0f count=%ld\n", - (long) s->n, (double) len, (long) s->count); + rprintf(FINFO, "hash search s->blength=%...

...32+48+64+80+96) + 8)*CHAR_OFFSET; >> + s1 += t1[0] + t1[1] + t1[2] + t1[3] + t1[4] + t1[5] + t1[6] + t1[7] + >> + 32*CHAR_OFFSET; >> + */ >> +uint32 get_checksum1(char *buf1, int32 len) >> +{ >> + int32 i; >> + uint32 s1, s2; >> + schar *buf = (schar *)buf1; >> + >> + i = s1 = s2 = 0; >> + if (len > 32) { >> + const char mul_t1_buf[16] = {28, 0, 24, 0, 20, 0, 16, 0, 12, >> 0, 8, 0, 4, 0, 0, 0}; >> + __m128i mul_t1 = sse_load_si128((void const*)mul_t1_buf); >> +...

...== t; j++) { int i2 = targets[j].i; if (i2 == last_i + 1) { if (sum != s->sums[i2].sum1) break; @@ -232,7 +232,7 @@ matched(f,s,buf,offset,i); offset += s->sums[i].len - 1; - k = MIN((len-offset), s->n); + k = MIN((len-offset), (ssize_t)s->n); map = (schar *)map_ptr(buf,offset,k); sum = get_checksum1((char *)map, k); s1 = sum & 0xFFFF; @@ -262,7 +262,7 @@ running match, the checksum update and the literal send. */ if (offset > last_match && - offset-last_match >= CHUNK_SIZE+s->n && + offs...

...;n, (double)len); + (long) s->blength, (double)len); - /* cast is to make s->n signed; it should always be reasonably + /* cast is to make s->blength signed; it should always be reasonably * small */ - k = MIN(len, (OFF_T) s->n); + k = MIN(len, (OFF_T) s->blength); map = (schar *)map_ptr(buf,0,k); @@ -173,8 +171,8 @@ end = len + 1 - s->sums[s->count-1].len; if (verbose > 3) - rprintf(FINFO, "hash search s->n=%ld len=%.0f count=%ld\n", - (long) s->n, (double) len, (long) s->count); + rprintf(FINFO, "hash search s->blength=%...

I have released rsync 3.2.4. Another typical release with both bug fixes and some enhancements. It also contains a security fix for the bundled zlib 1.2.8, which may or may not be used in your particular build configuration. To see a summary of all the recent changes, visit this link: https://rsync.samba.org/ftp/rsync/NEWS#3.2.4 You can download the source tar file and its signature from

I have released rsync 3.2.4. Another typical release with both bug fixes and some enhancements. It also contains a security fix for the bundled zlib 1.2.8, which may or may not be used in your particular build configuration. To see a summary of all the recent changes, visit this link: https://rsync.samba.org/ftp/rsync/NEWS#3.2.4 You can download the source tar file and its signature from