search for: in5

...e simultaneously process 8 input in SIMD, from in0 to in7. Let PROC(inx(sy)) denote processing input[x] at stage y. If there is no dependency between inx(sy) and in(x+1)(sy), then we can do this FOR in=0 TO N WITH in+=8 FOR y=0 TO order-1 WITH y++ PROC(in0(sy) in1(sy) in2(sy) in3(sy) in4(sy) in5(sy) in6(sy) in7(sy)) END FOR END FOR Definitely there is no any prolog and epilog needed. However, the critical thing is that all the states in each stage when processing input[i] are reused by the next input[i+1]. That is input[i+1] must wait input[i] for 1 stage, and input[i+2] must wait inpu...

...in1(s0)) > PROC( in0(s2) in1(s1) in2(s0)) > PROC( in0(s3) in1(s2) in2(s1) in3(s0)) > PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0)) > PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) in5(s0)) > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) in5(s1) in6(s0)) > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) in6(s1) in7(s0)) > PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s3) in6(s2) in7(s1) in8(s0)) > PROC(in2(s7) in3(s6) in4(s5) in5(s4) in6(s3) in7(s2) in8(s1) in9...

...in0(s2) in1(s1) in2(s0)) > > PROC( in0(s3) in1(s2) in2(s1) in3(s0)) > > PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0)) > > PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) in5(s0)) > > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) in5(s1) in6(s0)) > > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) in6(s1) in7(s0)) > > PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s3) in6(s2) in7(s1) in8(s0)) > > PROC(in2(s7) in3(s6) in4(s5)...

...in0(s1) in1(s0)) PROC( in0(s2) in1(s1) in2(s0)) PROC( in0(s3) in1(s2) in2(s1) in3(s0)) PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0)) PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) in5(s0)) PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) in5(s1) in6(s0)) PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) in6(s1) in7(s0)) PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s3) in6(s2) in7(s1) in8(s0)) PROC(in2(s7) in3(s6) in4(s5) in5(s4) in6(s3) in7(s2) in8(s1) in9(s0)) PROC(in3(s7) i...

...t;> > PROC( in0(s3) in1(s2) in2(s1) >>> in3(s0)) >>> > PROC( in0(s4) in1(s3) in2(s2) in3(s1) >>> in4(s0)) >>> > PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) >>> in5(s0)) >>> > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) in5(s1) >>> in6(s0)) >>> > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) in6(s1) >>> in7(s0)) >>> > PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s3) in6(s2) in7(s1) &...

...PROC( in0(s2) in1(s1) in2(s0)) > PROC( in0(s3) in1(s2) in2(s1) in3(s0)) > PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0)) > PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) in5(s0)) > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) in5(s1) in6(s0)) > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) in6(s1) in7(s0)) > PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s3) in6(s2) in7(s1) in8(s0)) > PROC(in2(s7) in3(s6) in4(s5) in5(s4) in6(s3) in7...

...>> in2(s0)) >> > PROC( in0(s3) in1(s2) in2(s1) >> in3(s0)) >> > PROC( in0(s4) in1(s3) in2(s2) in3(s1) >> in4(s0)) >> > PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) >> in5(s0)) >> > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) in5(s1) >> in6(s0)) >> > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) in6(s1) >> in7(s0)) >> > PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s3) in6(s2) in7(s1) >> in8(s0)) &gt...

...in0(s3) in1(s2) > > in2(s1) in3(s0)) > > > PROC( in0(s4) in1(s3) in2(s2) > > in3(s1) in4(s0)) > > > PROC( in0(s5) in1(s4) in2(s3) in3(s2) > > in4(s1) in5(s0)) > > > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) > > in5(s1) in6(s0)) > > > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) > > in6(s1) in7(s0)) > > > PROC(in1(s7) in2(...

...( in0(s3) in1(s2) > in2(s1) in3(s0)) > > PROC( in0(s4) in1(s3) in2(s2) > in3(s1) in4(s0)) > > PROC( in0(s5) in1(s4) in2(s3) in3(s2) > in4(s1) in5(s0)) > > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) > in5(s1) in6(s0)) > > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) > in6(s1) in7(s0)) > > PROC(in1(s7) in2(s6) in3(s5) in4(s4) in5(s...

...s2) > > in2(s1) in3(s0)) > > > PROC( in0(s4) in1(s3) in2(s2) > > in3(s1) in4(s0)) > > > PROC( in0(s5) in1(s4) in2(s3) in3(s2) > > in4(s1) in5(s0)) > > > PROC( in0(s6) in1(s5) in2(s4) in3(s3) in4(s2) > > in5(s1) in6(s0)) > > > PROC(in0(s7) in1(s6) in2(s5) in3(s4) in4(s3) in5(s2) > > in6(s1) in7(s0)) > > >...

Hi, Attached is a patch with arm neon optimizations for silk_warped_autocorrelation_FIX(). Please review. Thanks, Felicia -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.xiph.org/pipermail/opus/attachments/20170131/9a912bb4/attachment-0001.html> -------------- next part -------------- A non-text attachment was scrubbed... Name:

I downloaded and installed acpitool when I run it I get Battery Status <not available> AC Adapter <not availble> Thermal Info <not available> I was trying to find out how hot the CPU is? Any ideas how to get this information? THanks, jerry -------------- next part -------------- An HTML attachment was scrubbed... URL:

...; > + /*Out area*/ > + struct ia64_pal_retval ret; > +} pal_call_t; > + > +/* Sal data structure */ > +typedef struct sal_call{ and again... > + /*In area*/ > + uint64_t in0; > + uint64_t in1; > + uint64_t in2; > + uint64_t in3; > + uint64_t in4; > + uint64_t in5; > + uint64_t in6; > + uint64_t in7; > + /*Our area*/ > + struct sal_ret_values ret; > +} sal_call_t;

...; > + /*Out area*/ > + struct ia64_pal_retval ret; > +} pal_call_t; > + > +/* Sal data structure */ > +typedef struct sal_call{ and again... > + /*In area*/ > + uint64_t in0; > + uint64_t in1; > + uint64_t in2; > + uint64_t in3; > + uint64_t in4; > + uint64_t in5; > + uint64_t in6; > + uint64_t in7; > + /*Our area*/ > + struct sal_ret_values ret; > +} sal_call_t;

Hi. The patch I send before was too large so that it was dropped from the maling list. I'm sending again with smaller size. This patch set is the xen paravirtualization of hand written assenbly code. And I expect that much clean up is necessary before merge. We really need the feed back before starting actual clean up as Eddie already said before. Eddie discussed how to clean up and suggested

Hi. The patch I send before was too large so that it was dropped from the maling list. I'm sending again with smaller size. This patch set is the xen paravirtualization of hand written assenbly code. And I expect that much clean up is necessary before merge. We really need the feed back before starting actual clean up as Eddie already said before. Eddie discussed how to clean up and suggested

...| grep 16 >> ; >> +; It's possible to schedule this in 14 instructions by avoiding >> +; callee-save registers, but the scheduler isn't currently that >> +; conervative with registers. >> @size20 = external global i32 ; <i32*> [#uses=1] >> @in5 = external global i8* ; <i8**> [#uses=1] >> >> @@ -21,4 +24,3 @@ define i32 @compare(i8* %a, i8* %b) noun >> } >> >> declare i32 @memcmp(i8*, i8*, i32) >> - >> >> Modified: llvm/trunk/test/CodeGen/X86/2007-01-08-InstrSched.ll >...

Hello list. I'm trying to rebuild the 2.6.9.67.0.20.EL kernel, but it fails even without modifications. How did I try it? Created a (non-root) build environment (not a mock ) Installed the kernel.scr.rpm and did a rpmbuild -ba --target=`uname -m` kernel-2.6.spec 2> prep-err.log | tee prep-out.log The build failed at the end: Processing files: kernel-xenU-devel-2.6.9-67.0.20.EL Checking