Displaying 6 results from an estimated 6 matches for "f4c".
Did you mean:
4c
2008 Sep 30
0
[LLVMdev] Generalizing shuffle vector
On Mon, Sep 29, 2008 at 8:11 PM, Mon Ping Wang <wangmp at apple.com> wrote:
> The problem with generating insert and extracts is that we can generate poor
> code
> %tmp16 = extractelement <4 x float> %f4b, i32 0
> %f8a = insertelement <8 x float> %f8a, float %tmp16, i32 0
> %tmp18 = extractelement <4 x float> %f4b, i32 1
> %f8c
2008 Sep 30
4
[LLVMdev] Generalizing shuffle vector
...each element in the vector and inserting each element into
a new vector. With this new form, it is more straightforward to write
and reason about
typedef __attribute__(( ext_vector_type(4) )) float float4;
typedef __attribute__(( ext_vector_type(8) )) float float8;
float8 f8;
float4 f4a, f4b, f4c;
f4a = f8.hi;
f8.hi = f4b; f8.lo = f4c;
where hi and lo represent the high half and low half of the vector.
The outgoing IR is
%f4a = shufflevector <8xf32>%f8, undef, <4xi32> <0, 1, 2, 3>
%f8 = shufflevector <4xf32>%f4b, <4xf32>%f4c, <8xi32> <0, 1, 2...
2013 Feb 02
3
vectorisation
Hi
I'm trying to set up a simulation problem without resorting to (m)any loops. I want to set entries in a data frame of zeros ('starts' in the code below) to 1 at certain points and the points have been randomly generated and stored in a separate data.frame ('sl'), which has the same number of columns.
An example of the procedure is as follows:
ml <-
2005 Apr 27
1
RE: [R] when can we expect Prof Tierney's compiled R?
...<- function(x, iA) for (i in iA) x[i] = 1.0
> f5 <- function(x, iA) for (i in iA) i-1
> f6 <- function(x, iA) for (i in iA) i
>
> Make byte compiled versions:
>
> f1c <- cmpfun(f1)
> f2c <- cmpfun(f2)
> f3c <- cmpfun(f3)
> f4c <- cmpfun(f4)
> f5c <- cmpfun(f5)
> f6c <- cmpfun(f6)
>
> and run them:
>
> > system.time(f1(x, iA))
> [1] 5.43 0.04 5.56 0.00 0.00
> > system.time(f1c(x, iA))
> [1] 1.77 0.03 1.81 0.00 0.00
>
> > system.time(f...
2005 Apr 22
1
RE: [R] when can we expect Prof Tierney's compiled R?
If we are on the subject of byte compilation, let me bring a couple of
examples which have been puzzling me for some time. I'd like to know a)
if the compilation will likely to improve the performance for this type
of computations, and b) at least roughly understand the reasons for the
observed numbers, specifically why x[i]<- assignment is so much slower
than x[i] extraction.
The loops
2009 Jul 23
1
[PATCH server] changes required for fedora rawhide inclusion.
...iBMX!*bM7
zsiWBuW>p$a5q&A6duT3{ML+c8TK-x_?613a{aQM|{{m#J_4OIfbSiIb1$hvU%|YD1
zl63uEDyE&&>F_%xTKyNnE%9(Eha%T#;^Ub^JXzV;<hx<=5pRMCdkSTP&O5m}jHMC^
znl_v1q{-D7&Wk+Xdg%+LL at yV__B+hB#=O&y1S}M=qYEgLWoR-F&In4L1((r$=j1Q=
zB;|R+Y_`3xSKi(yY=LF$jG-^WZ{sOnCziZ_>i>TF4CjqAoMSDg$6CA%3;k{{FEO)5
zBf>!ze-5187J-|GYz5vduEt61^wnE)DVLjQ#qbMdXdEC at TfP*dz!YBy%N5ksCeru2
z`DA2pjKZjlE~yN%o^c{e89iBn-y at Q#D!U<fxx4E4$!$&9(Yt>W?aH>ZESq!wP*`M*
z`HB8g8ND^=2F+1F`K|w4Gt*o16WM?*q)J#}%LH;)U6S9gDOdg%XzBmmu(x^@c@)>}
zF7?qJtx&3GGWV;36GJj~jIKztB#wOltx<x4QpA{KoP...