search for: minuson

...rray type. > const ArrayType *ATy = ArrayType::get(Type::Int32Ty, NumEdges); Then create some constant values for the initializer. > std::vector<Constant*> Initializer; Initializer.reserve(NumEdges); > APInt zero(32,0); Constant* zeroc = ConstantInt::get(zero); > APInt minusone(32,-1); Constant* minusonec = ConstantInt::get(minusone); Create the global array, there is no initializer yet. > GlobalVariable *Counters = > new GlobalVariable(ATy, false, GlobalValue::InternalLinkage, > Constant::getNullValue(ATy), "OptimalEdgeProfCount...

...on is the difference. static void andiTest1(Module &M) { int NumEdges = 4; const ArrayType *ATy = ArrayType::get(Type::Int32Ty, NumEdges); std::vector<Constant*> Initializer; Initializer.reserve(NumEdges); APInt zero(32,0); Constant* zeroc = ConstantInt::get(zero); APInt minusone(32,-1); Constant* minusonec = ConstantInt::get(minusone); GlobalVariable *Counters = new GlobalVariable(ATy, false, GlobalValue::InternalLinkage, Constant::getNullValue(ATy), "OptimalEdgeProfCounters1", &M); Initializer[0] = zeroc; Initializer[1] = minusonec; In...

...0xbf8000003f800000 //{-1.0, 1.0} +#define MINUS_ONE 0xbf800000bf800000 // {-1.0, -1.0} + +static void kf_bfly4_neon_m1(kiss_fft_cpx *Fout, int N) { + float32x4_t Fout_4[2]; + float32x2_t Fout_2[4]; + float32x2_t scratch_2[2]; + float32x2_t ones_2 = vcreate_f32(ONES_MINUS_ONE); + float32x2_t minusones_2 = vcreate_f32(MINUS_ONE); + float *ai = (float *)Fout; + float *bi = (float *)Fout; + int i; + + /* Consume/update 4 complex Fout values per cycle + * just like normal C code, except each neon + * instruction consumes 1 complex number (2 floats) + * In theory, one could use Q regs instead of...

...&M); > + > + std::vector<Constant*> Initializer = std::vector<Constant*>(NumEdges); This unnecessarily copies the vector, please use: std::vector<Constant*> Initializer(NumEdges); > + APInt zero(32,0); Constant* zeroc = ConstantInt::get(zero); > + APInt minusone(32,-1); Constant* minusonec = ConstantInt::get(minusone); Please use: > + Constant* zeroc = ConstantInt::get(llvm::Type::Int32Ty, 0); > + Constant* onec = ConstantInt::getSigned(llvm::Type::Int32Ty, -1); On Mon, Jun 29, 2009 at 6:34 AM, Andreas Neustifter<e0325716 at student.tuwien.ac...

Hello, This patch introduces ARM NEON Intrinsics to optimize kf_bfly4 routine in celt part of libopus. Using NEON optimized kf_bfly4(_neon) routine helped improve performance of opus_fft_impl function by about 21.4%. The end use case was decoding a music opus ogg file. The end use case saw performance improvement of about 4.47%. This patch has 2 components i. Actual neon code to improve

Hi all, as proposed in http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-February/020396.html I implemented the algorithm presented in [Ball94]. It only instruments the minimal number of edges necessary for edge profiling. The main changes introduced by this patch are: *) a interface compatible rewrite of ProfileInfo *) a cleanup of ProfileInfoLoader (some functionality in ProfileInfoLoader

...if (last_iter) { + print_stats( xc_handle, dom, sent_this_iter, &stats, 1); + + DPRINTF("Total pages sent= %ld (%.2fx)\n", + total_sent, ((float)total_sent)/max_pfn ); + } + + if (last_iter && debug){ + int minusone = -1; + memset(to_send, 0xff, BITMAP_SIZE); + debug = 0; + DPRINTF("Entering debug resend-all mode\n"); + + /* send "-1" to put receiver into debug mode */ + if(!write_exact(io_fd, &minusone, sizeof(int))) { +...

...:vector<Constant*> Initializer = std::vector<Constant*>(NumEdges); > > This unnecessarily copies the vector, please use: > std::vector<Constant*> Initializer(NumEdges); Okay. >> + APInt zero(32,0); Constant* zeroc = ConstantInt::get(zero); >> + APInt minusone(32,-1); Constant* minusonec = ConstantInt::get(minusone); > > Please use: >> + Constant* zeroc = ConstantInt::get(llvm::Type::Int32Ty, 0); >> + Constant* onec = ConstantInt::getSigned(llvm::Type::Int32Ty, -1); Okay. Thank you so much for taking the time and reviewing this giv...

...s ./check.t:alias-9 pass ./check.t:alias-10 pass ./check.t:arith-lazy-1 pass ./check.t:arith-lazy-2 pass ./check.t:arith-lazy-3 pass ./check.t:arith-ternary-prec-1 pass ./check.t:arith-ternary-prec-2 pass ./check.t:arith-div-assoc-1 pass ./check.t:arith-div-byzero pass ./check.t:arith-div-intmin-by-minusone pass ./check.t:arith-assop-assoc-1 pass ./check.t:arith-mandatory pass ./check.t:arith-unsigned-1 pass ./check.t:arith-limit32-1 pass ./check.t:bksl-nl-ign-1 pass ./check.t:bksl-nl-ign-2 pass ./check.t:bksl-nl-ign-3 pass ./check.t:bksl-nl-ign-4 pass ./check.t:bksl-nl-ign-5 pass ./check.t:bksl-nl-1...

On Wed, 9 Oct 2013 10:44:27 +0000 (UTC) Thorsten Glaser <tg at mirbsd.de> wrote: > Anil Singhar dixit: > > >Manual testing as provided within the package has been done with all > >tests passing. This includes the units tests available under > >usr/klibc/tests, usr/utils, usr/dash and usr/gzip. For dash and > >gzip, only sanity testing has been done. > >