search for: multiplicands

Fold MAD dst, src0, immed, src2 (or src0/immed swapped) when - immed = 0 -> MOV dst, src2 - immed = +/- 1 -> ADD dst, src0, src2 These types of MAD pattersn were observed in some st/nine shaders. Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu> --- Haven't tested this enough to push yet, but thought I'd get it out there. Passes some simple test cases.

Hi Elena, Thank you very much for looking in to that. I'll go ahead and remove the isCommutable flag from those instructions, since it sounds like that's the right thing to do. I would still like to change the default from the 231 variant to 213 too, as this will reduce code-size for accumulator-style loops. I have at least one benchmark that shows significant speedups when this change

Hi Kay, My patch will partially address your bug. For now I'm just looking to switch the default FMA from vfmadd213xx to vfmadd231xx. That will cause the code in PR17229 to compile as desired, but would regress code like: double foo(double a, double b, double c) { return a * b + c; } Which will now require a vmovaps + vfmadd231. If this impacts real benchmarks we could add an

This patch supplies software IEEE floating point support. The comment from the patch reproduced below says all there is to say. This patch contains the prior "cleanup" patch; please don't apply that one. Please let me know of any bugs. It is tested reasonably well, but until I put together random tests it's hard to have 100% confidence. Neil. /* A self-contained host- and

This is my 2007 New Year wishlist for R features: 1. Matrix Multiplication Enhance matrix multiplication to work with multidimensional arrays such that the last dimension of the first multiplicand must equal the first dimension of the second. See: https://www.stat.math.ethz.ch/pipermail/r-devel/2006-July/038497.html 2. Grid - logical-valued function as first arg of grid.edit -

...antWidth++; // now process acording to type // AQUI AQUI - fazer ou achar a tabela abaixo if( cb->mapType ) { cb->quantNum = cb->codeEntries^(1/cb->dimensions); } else { cb->quantNum = cb->dimensions*cb->codeEntries; } // create multiplicands array and read them cb->quantValues = new byte[cb->quantNum]; if( cb->quantValues==NULL ) return 0; // read all quad values for(i=0; i<cb->quantNum; i++) this->fReadBits1((int*) &cb->quantValues[i], 5); break; default : return 0; } return...

Dear list, n00b question, but still can't find any easy answer. Here is a df: > df<-data.frame(cbind(x=c("AA","BB","CC","AA"),y=1:4)) > df x y 1 AA 1 2 BB 2 3 CC 3 4 AA 4 I want to modify this df this way : if df$x=="AA" then df$y=df$y*10 if df$x=="BB" then df$y=df$y*25 and so on with other conditions. TY for any

The parts of klibc specific to the sparc architecture. Signed-off-by: H. Peter Anvin <hpa at zytor.com> --- commit 1b5c93603ed3460ed1fba9e5d453a6fa54d0ccce tree 7fb0a134b3add408c02b470616d440ad398d86d3 parent 94473ed85b00ec45ff8ee6cac62f60a368ff4534 author H. Peter Anvin <hpa at zytor.com> Sun, 25 Jun 2006 16:58:47 -0700 committer H. Peter Anvin <hpa at zytor.com> Sun, 25 Jun

I have updated the klibc patchset based on feedback received. In particular, the patchset has been reorganized so as not to break git-bisect. Additionally, this updates the patch base to 2.6.17-git12 (d38b69689c349f35502b92e20dafb30c62d49d63) and klibc 1.4.8; the main difference on the klibc side is removal of obsolete code. This is also available as a git tree at: