search for: atrocious

...trices saturated., I have looked through histories on random fill algorithms but all packages I can find nothing as simple as the random fill I am looking for., sorry for bothering, Thank you for any help in advance. Something that starts along the lines of the following? Sorry this example is atrocious. matrixfill <- function(emptymatrix, K=fullmatrix, time=100, from=0, to=time) { N <- numeric(time+1) N[1] <- emptymatrix for (i in 1:time) N[i+1] <- N[i]+"place random 1 in a random xy position" until K. Calculate Density of matrix .... [[alternative HTML ve...

A newly built CentOS 7.1 system, with an ATI/AMD video card. I installed the proprietary driver (this is a Dell, and they had their own rpm), and after I ran aticonfig --initial, init 3, then init 5, and we have a working video. Excerpt the fonts are atrocious. All the letters seem to be missing pixels, so it's as though there's no across, almost. He's running gnome. There has to be a quick fix - a link would be great. Thanks in advance. mark

...R Graphics What I'm looking for is something like the output of: I <- Indometh; for (i in I$Subject) { (if (i==1) plot else points)( I[ I$Subject==i, c("time","conc")], col=i, type="l"); par(new=TRUE); } par(new=FALSE); I recognize this is atrocious programming style, but I'm afraid I don't know any better; I would appreciate guidance on how to do this right in traditional graphics, too.... -s

...takes minutes). Flint actually seems tro do some caching whereas quartz just seemed to hit the disc constantly. Generally I've been running it on a machine with 5G of memory -but it has to contend with other processes for resources, I have also run it on its own on a 1G system -but quartz was atrocious on this (I haven't tried flint yet). If the management agrees then I'll probably try splinting the index (now 12-13G) over 2 machines and running flint -obviously the fact that it's beta will give them a bit of a problem, but it looks like it's that or nothing (or Lucene). Cheers,...

...] %conv = bitcast <4 x i32> %and to <2 x i64> ; <<2 x i64>> [#uses=1] ret <2 x i64> %conv } When legalize types sees the sext from <4 x i1> -> <4 x i32>, its only solution right now is to scalarize the whole mess feeding into it, giving us really atrocious code. IMO, the solution to this is to have a legalize-types action for vectors that corresponds to "promote" on scalars. In this case, since X86 supports VSETCC, the 4 x i1 SETCC should "vector promote" to a VSETCC node with a 4xi32 result, the and should vector promote...

...te need of some optimization. The problem is that the microsoft C# compiler does almost no optimization but relies on the MS JIT compiler to do it. But the MS JIT compiler does not do any agressive optimization, especially inlining and subsequent optimizations. So the generated machine code is just atrocious and performance is much lower than expected. I know that optimizing on a MSIL level will somewhat alleviate the problem since the microsoft C++/CLR compiler does MSIL level optimizations and produces much faster code in some tests I have written. But rewriting the application in question in C++/CL...

...>> SciMark2-C: >> Fast isel: 463.908 >> Global isel: 496.22 >> >> The current timeout is 500s (so in this particular case we didn't hit it for scimark2, and it ran successfully to completion). I don't think the difference between FastISel and GlobalISel is too atrocious, so I would propose increasing the timeout for these 2 benchmarks. I'm not sure if we can do this on a per-bot basis, but I see some precedent for setting custom timeout thresholds for various benchmarks on different architectures (sometimes with comments that it's done so we can run O0 on...

...hat tools like 'scsi_id' and udev admin/test commands have changed. The udev rules themselves seem to be the same. Regarding networking, all of my 'ifcfg-*' files from CentOS-5.5 worked well, including bridging for KVM. Of course, one of the first things I did was remove that atrocious NetworkManager package ... it needs to be rewritten to make it a *lot* more intuitive. RedHat uses it during installation to manually configure the NICs, which I think is a mistake. I much prefer the way CentOS anaconda has done it so far, as a separate install menu form. The performance of...

...2-C: >>> Fast isel: 463.908 >>> Global isel: 496.22 >>> >>> The current timeout is 500s (so in this particular case we didn't hit it for scimark2, and it ran successfully to completion). I don't think the difference between FastISel and GlobalISel is too atrocious, so I would propose increasing the timeout for these 2 benchmarks. I'm not sure if we can do this on a per-bot basis, but I see some precedent for setting custom timeout thresholds for various benchmarks on different architectures (sometimes with comments that it's done so we can run O0 on...

...8p: Fast isel: 666.344 Global isel: 731.384 SciMark2-C: Fast isel: 463.908 Global isel: 496.22 The current timeout is 500s (so in this particular case we didn't hit it for scimark2, and it ran successfully to completion). I don't think the difference between FastISel and GlobalISel is too atrocious, so I would propose increasing the timeout for these 2 benchmarks. I'm not sure if we can do this on a per-bot basis, but I see some precedent for setting custom timeout thresholds for various benchmarks on different architectures (sometimes with comments that it's done so we can run O0 on...

Hello, Some of the backends seem to be combining positional and named operands when defining some instructions such that some of the positional operands overlap with some of the named operands. I suspect this is not intentional; here's an example: AArch64 has the following instruction definition: SMULHxxx { field bits<32> Inst = { 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, Rm{4}, Rm{3},

I''m about to leave town for three weeks and my home server keeps rebooting. It''s my mail server, unfortunately, so there''s a good chance you won''t get this. :/ Anyway, I''ve been meaning to do this for ages and ages, and it''s time to finally do so. I need to move all of the Puppet lists to a public, non-me provider, someone who has

On Sat, November 4, 2017 4:32 am, hw wrote: > Valeri Galtsev wrote: >> >> On Fri, November 3, 2017 3:36 am, hw wrote: >>> Valeri Galtsev wrote: >>>> If you have not Dell server hardware my choice of [hardware] RAID >>>> cards >>>> would be: >>>> >>>> Areca >>> >>> Areca is forbiddingly expensive.

...tion. The problem is that the microsoft C# compiler does > almost no optimization but relies on the MS JIT compiler to do it. But > the MS JIT compiler does not do any agressive optimization, especially > inlining and subsequent optimizations. So the generated machine code > is just atrocious and performance is much lower than expected. > > I know that optimizing on a MSIL level will somewhat alleviate the > problem since the microsoft C++/CLR compiler does MSIL level > optimizations and produces much faster code in some tests I have > written. But rewriting the applic...

...that "struct x { float a,b,c,d; }" is passed or returned in the low 2 elements of two separate XMM registers. For example, returning that would return "a,b" in the low elements of XMM0 and "c,d" in the low elements of XMM1. Both llvm-gcc and clang currently generate atrocious IR for these structs, which you can see if you compile this: struct x { float a,b,c,d; }; struct x foo(struct x *P) { return *P; }; The machine code generated by llvm-gcc[*] for this is: _foo: movl (%rdi), %eax movl 4(%rdi), %ecx shlq $32, %rcx addq %rax, %rcx movd %rcx, %xmm0 movl 8(%rdi)...

Hello guys, I am making a submodule-based metaproject "llvm-project.git" for bisecting clang. I will introduce it to help you developers. Unfortunately, submodule is not useful to manage your branches. :/ Have fun! ...Takumi Instructions; 1. fetch two scripts from git://github.com/chapuni/llvm-project-scripts.git - hooks/post-merge - hooks/post-checkout 2. git clone

On 2017-11-04, Valeri Galtsev <galtsev at kicp.uchicago.edu> wrote: > > On Sat, November 4, 2017 4:32 am, hw wrote: > >> If the cli is poor, the gui may seem much better Indeed. Before the storcli tool came out, the only CLI tool for the LSI cards was MegaCli, and it was atrocious. In that case I can imagine the GUI being preferable (even though the GUI isn't very good either). Even the storcli tool isn't very good (as I've mentioned). I can completely understand someone preferring MSM (the daemon which provides the backend for the GUI tool) over storcli. &gt...

Hello, i'm just curious, why the -boot-load-size 4 for mkisofs with isolinux.bin is needed. I searched the list archive and found nothing and found nothing anywhere else. Since the isolinux.bin is much bigger than 4 * 512 byte, I'd suspect, it wont get completely loaded. With -boot-load-size 4, mkisofs reports: Size of boot image is 4 sectors -> No emulation Without it, mkisofs

...D to authenticate to gain authorization for action.org/freedesktop. packagekit system upgrade for system-bus-name::1.5(gpk-update-icon (owned by unix-user:<my user name>) ( please don't nit pick the format or spelling. I couldn't figure out how to cut and paste, and my handwriting is atrocious). Everything seems to work OK but it is a pain, and maybe a security problem. I would appreciate any help. I don't have a clue.,

...ly dislike ListProcessor, the mailing list software samba.org uses. There's a lot of reasons, most having to do with header rewriting, but that's not the point of this message. One thing I don't like is its list archive feature. The archives are hard to navigate, and the threading is atrocious. I'm accustomed to MHonArc-generated archives, like they use at debian.org and kernelnotes.org. Call me a bigot but I can't figure out why the rest of the world hasn't switched to MHonArc yet. (: So, for those times when I must browse archives rather than using my MUA, I finally got...