search for: 17x

...OCK_STREAM, IPPROTO_IP) = 8 [pid 24068] close(3) = 0 [pid 24068] fcntl(8, F_GETFD) = 0 [pid 24068] dup2(8, 3) = 3 [pid 24068] fcntl(3, F_SETFD, 0) = 0 [pid 24068] close(8) = 0 [pid 24068] write(3, "\25\3\1\0\22\346h\357n\r\17x\374B\312\217\374x\276\311\217\342%", 23) = -1 EPIPE (Broken pipe) [pid 24068] --- SIGPIPE (Broken pipe) @ 0 (0) --- Process 24068 detached <... read resumed> "", 4) = 0 --- SIGCHLD (Child exited) @ 0 (0) --- close(5) = 0 wait4(24068,...

Hi all ! I'm running opensuse10.3 and have reproduced the following problem with 16x.xx drivers and 17x.xx If I do NOT put antialiasing in Override apllication settings -> OFF, wine games fails with : X Error of failed request: GLXBadDrawable Major opcode of failed request: 144 (GLX) Minor opcode of failed request: 5 (X_GLXMakeCurrent) Serial number of failed request: 599 Current serial number i...

...ussed. > > TLDR; clang is pathological and the actual CFI bloat will go down from 7x to > 2x. > > Let us present the CFI Bloats for each benchmark with the default option, which > is creating basic block sections only for functions with samples. For clang, > it is 7x and *not 17x* (the 17 x number is for all sections), and for the > large benchmarks it is less than 30% or 1.3x. For large benchmarks, Storage is > the highest, going from 18M to 23M, ~30%. Clang is almost pathological here. > This is because 10% of all functions in clang have samples (touched by the &...

...he actual CFI bloat will go down from 7x to > > > 2x. > > > > > > Let us present the CFI Bloats for each benchmark with the default option, which > > > is creating basic block sections only for functions with samples. For clang, > > > it is 7x and *not 17x* (the 17 x number is for all sections), and for the > > > large benchmarks it is less than 30% or 1.3x. For large benchmarks, Storage is > > > the highest, going from 18M to 23M, ~30%. Clang is almost pathological here. > > > This is because 10% of all functions in clang...

...perspective, supporting structs makes it possible to get away with a much less efficient garbage collector because programmers can simply avoid the GC when necessary. Reified generics combined with structs make it possible to write very efficient generic collections (e.g. .NET Dictionary can be 17x faster than Java's HashTable because it is stored as a single continuous block of memory with no pointers http://fsharpnews.blogspot.co.uk/2010/05/java-vs-f.html). Tail call elimination allows an unbounded number of recursive function calls in tail position to consume finite stack space. Th...

I'm a bit confused by this subthread -- doesn't BOLT have the exact same CFI bloat issue? From my cursory reading of the propellor doc, the CFI duplication is _necessary_ to represent discontiguous functions, not anything particular to the way Propellor happens to generate those discontiguous functions. And emitting discontiguous functions is a fundamental goal of this, right? On Wed,

Here are patches to do offline deduplication for Btrfs. It works well for the cases it''s expected to, I''m looking for feedback on the ioctl interface and such, I''m well aware there are missing features for the userspace app (like being able to set a different blocksize). If this interface is acceptable I will flesh out the userspace app a little more, but I believe the

Is there large value from deferring the block ordering to link time? That is, does the block layout algorithm need to consider global layout issues when deciding which blocks to put together and which to relegate to the far-away part of the code? Or, could the propellor-optimized compile step instead split each function into only 2 pieces -- one containing an "optimally-ordered" set of

...0% to upto 38 GB). + Overheads of CFI TLDR; clang is pathological and the actual CFI bloat will go down from 7x to 2x. Let us present the CFI Bloats for each benchmark with the default option, which is creating basic block sections only for functions with samples. For clang, it is 7x and *not 17x* (the 17 x number is for all sections), and for the large benchmarks it is less than 30% or 1.3x. For large benchmarks, Storage is the highest, going from 18M to 23M, ~30%. Clang is almost pathological here. This is because 10% of all functions in clang have samples (touched by the profile informat...

Greetings, We, at Google, recently evaluated Facebook’s BOLT, a Post Link Optimizer framework, on large google benchmarks and noticed that it improves key performance metrics of these benchmarks by 2% to 6%, which is pretty impressive as this is over and above a baseline binaryalready heavily optimized with ThinLTO + PGO. Furthermore, BOLT is also able to improve the performance of binaries