similar to: connection unexpectedly closed

Dear list, I'd like to have your expertise opinion on following issue. Out of a concrete need we developed an application that will rsync any changes on a local directory structure to a remove system the moment they happen using the linux kernel watch feature. This is in our opinion much more elegant compared to invoking rsync every x seconds/minutes from cron, or having to use a special

Hello all, First off, i''m talking about a SXDE build 89. Sorry if that was discussed here before, but i did not find anything related on the archives, and i think is a "weird" issue... If i try to remove a specific file, i got: # rm file1 rm: file1: No such file or directory # rm -rf dir2 rm: Unable to remove directory dir2: Directory not empty Take a look: ------- cut

Hello all, I have a doubt that i think you hackers of rsync has the answer. ;-) I have make this post on my blog: http://www.posix.brte.com.br/blog/?p=312 to start a serie about the copy-on-write semantics of ZFS. In my test "VI" did rewrite the whole file just for change 3 bytes, so the whole file was reallocated. What i want to know from you is about the techniques used by rsync

Hello all... I''m seeing this behaviour in an old build (89), and i just want to hear from you if there is some known bug about it. I''m aware of the "picket fencing" problem, and that ZFS is not choosing right if write to slog is better or not (thinking if we have a better throughput from disks). But i did not find anything about 100% slog activity (~115MB/s) blocks

Hi evereyone. We are using Samba 3, and decided to begin the migration to Samba 4. The first step we are doing in this process is learning about Samba 4. We are looking for a good "all-in-one" book, and all we found was the Marcelo Leal book "Implementing Samba 4". We would like to know if there is another book avaliable, or will be published soon. Thank you all. --

I'm looking for a book in English based on Samba 4.1 or 4.2 based if you can 'on debian jessie. Specifically I would like to see covered the creation of domain users, directives as valid users = + SAMDOM \ "Domain Users" invalid users = + SAMDOM \ "Demo Group" SAMDOM \ foobar, gpo, share, dns. in short, a complete book full of examples and easy to understand. I saw

Hello, I''m trying to implement a NAS server with solaris/NFS and, of course, ZFS. But for that, we have a little problem... what about the /home filesystem? I mean, i have a lot of linux clients, and the "/home" directory is on a NFS server (today, linux). I want to use ZFS, and change the "directory" home like /home/leal, to "filesystems" like /home/leal

Hello all.. Using dtrace on solaris 10, i could investigate a performance issue with the sincronization of some files on a ZFS filesystem. I have started the follow rsync command (inside a gnome-terminal): /opt/sfw/bin/rsync -av -e ssh user@IP:/DirA/DirB . The current directory(.), was a ZFS pool with two SATA discs (mirror)... The performance was terrible. After some tests with raid0,

Hi Duncan, David, Sean. Thanks for your reply. > It'd be interesting if you could find a design that also treated these > the same: > > (B ^ A) | ((A ^ B) ^ C) -> (A ^ B) | C > (B ^ A) | ((B ^ C) ^ A) -> (A ^ B) | C > (B ^ A) | ((C ^ A) ^ B) -> (A ^ B) | C > > I.e., `^` is also associative. Agree with Duncan on including associative operation too.

Hello, I have an issue with the llvm optimizations. I need to create object codes. the -ON PURPOSE poor && useless- code : --------------------------------------------------- #include <stdio.h> #include <stdlib.h> int ci(int a){ return 23; } int flop(int a, char ** c){ a += 71; int b = 0; if (a == 56){ b = 69; b += ci(a); } puts("ok"); return a +

Thanks for rsync - it's great! I use it for all my backups. I use rsync via SSH. Recently - I was having trouble with my backups: rsync: connection unexpectedly closed (4968349 bytes received so far) [receiver] rsync error: error in rsync protocol data stream (code 12) at io.c(453) [receiver=2.6.9] After following all the steps in the FAQ and issues.html on the rsync website, searching the

Hi everyone, I''m new to rails and also to rspec, but I tried to do my homework. To answer my questions, I searched this list''s archives, the Rails API, and Google, to no avail. Therefor, I''d be grateful if someone could point me in the right directions: 1) There doesn''t seem to be a counterpart to assert_recognizes in rspec. route_for() won''t work

Thanks Sean for the reference. I will go through it and see if i can implement it for generic boolean expression minimization. Regards, Suyog On Wed, Aug 13, 2014 at 2:30 AM, Sean Silva <chisophugis at gmail.com> wrote: > Re-adding the mailing list (remember to hit "reply all") > > > On Tue, Aug 12, 2014 at 9:36 AM, suyog sarda <sardask01 at gmail.com> wrote:

I don't understand your point. Which version is better does NOT depend on what inputs are passed to the function. The compiled code for (as per llvm) f1 will always take less time to execute than f2. for x > 0 => T(f1) < T(f2) for x <= 0 => T(f1) = T(f2) where T() is the time to execute the given function. So always T(f1) <= T(f2). I would call this a missed

Hello, I will try to concentrate in this post the informations about the configurations that i''m deploying, thinking that it should be usefull for somebody else.. The objective of my tests is: High Availability services with ZFS/NFS on solaris 10 using a two-node Sun Cluster. The scenarios are two: 1) Using "shared discs" (global devices). 2) Using "non-shared

Hi, All, Duncan, Rafael, David, Nick. This is regarding pattern matching in InstructionCombine pass. We use 'match' functions many times, but it doesn't do the pattern matching effectively. e.x. Lets take pattern : (A ^ B) | ((B ^ C) ^ A) -> (A ^ B) | C (B ^ A) | ((B ^ C) ^ A) -> (A ^ B) | C Both the patterns above are same, since ^ is commutative in Op0. But,

On Tue, Dec 13, 2011 at 5:59 AM, Brent Walker <brenthwalker at gmail.com> wrote: > The following seemingly identical functions, get compiled to quite > different machine code.  The first is correctly optimized (the > computation of var y is nicely moved into the else branch of the "if" > statement), which the second one is not (the full computation of var y > is

> You're misreading the asm... nothing is touching memory. (BTW, "leal > -1(%eax), %eax" isn't a memory operation; it's just subtracting one > from %eax.) You might want to try reading the LLVM IR (which you can > generate with llvm-gcc -S -emit-llvm); it tends to be easier to read. I tried that, but I'm still learning LLVM. Seeing indvar, phi nodes, tail

<br />Hello, <br />Ecx is a problem because you have to xor it. Which is avoided in the gcc compilation. Fomit-pointer-frame helps.<br /><br />Now llvm is one instruction from gcc. If ecx was not used, it would be as fast.<br />-- <br />Sent from Yandex.Mail for mobile<br /><br />20:03, 13 July 2015, Matthias Braun <mbraun@apple.com>:<br

When I increased COLS to the point where the loop could no longer be unrolled, the selection dag code generator generated effectively the same code as the default X86 code generator. Lots of redundant imul/movl/addl sequences. It can't clean it up either. Only unrolling all nested loops permits it to be optimized away, regardless of code generator. Jeff Cohen wrote: > I noticed