search for: prol

...edge .lr.ph: ; preds = %0 %2 = add i32 %n, -1 %xtraiter = and i32 %n, 3 %lcmp.mod = icmp ne i32 %xtraiter, 0 br i1 %lcmp.mod, label %3, label %.lr.ph.split ; <label>:3 ; preds = %3, %.lr.ph %indvars.iv.prol = phi i64 [ 0, %.lr.ph ], [ %indvars.iv.next.prol, %3 ] %prol.iter = phi i32 [ %xtraiter, %.lr.ph ], [ %prol.iter.sub, %3 ] %4 = getelementptr inbounds i32, i32* %array_x, i64 %indvars.iv.prol %5 = trunc i64 %indvars.iv.prol to i32 store i32 %5, i32* %4, align 4 %indvars.iv.next.prol = ad...

...ias -aa-eval -evaluate-aa-metadata -print-all-alias-modref-info -disable-output 2>&1 < /tmp/your/input.ll there seems to be a limitation with the way that pointer provenance is determined. Looking at the mod/ref info, things quickly become suboptimal: NoAlias: %4 = load i8, i8* %.04.prol, align 1, !tbaa !1 <-> store i8 %11, i8* %.013.prol, align 1, !tbaa !1 NoAlias: %4 = load i8, i8* %.04.prol, align 1, !tbaa !1 <-> store i8 %14, i8* %18, align 1, !tbaa !1 NoAlias: %4 = load i8, i8* %.04.prol, align 1, !tbaa !1 <-> store i8 %17, i8* %19, align 1, !tb...

...3, %.lr.ph > <https://urldefense.proofpoint.com/v2/url?u=http-3A__lr.ph&d=BQMFaQ&c=eEvniauFctOgLOKGJOplqw&r=v-ruWq0KCv2O3thJZiK6naxuXK8mQHZUmGq5FBtAmZ4&m=9pD2qNHBiPJscAs-ZzWT7q61NeZNcwsY8Io52JnaI3E&s=OaVJWcn8TI03qp9lgqeWMIVMySoyBIPowkHDEyR7lvQ&e=> > %indvars.iv.prol = phi i64 [ 0, %.lr.ph > <https://urldefense.proofpoint.com/v2/url?u=http-3A__lr.ph&d=BQMFaQ&c=eEvniauFctOgLOKGJOplqw&r=v-ruWq0KCv2O3thJZiK6naxuXK8mQHZUmGq5FBtAmZ4&m=9pD2qNHBiPJscAs-ZzWT7q61NeZNcwsY8Io52JnaI3E&s=OaVJWcn8TI03qp9lgqeWMIVMySoyBIPowkHDEyR7lvQ&e=> > ]...

Hello. Mikhail, with the more recent version of the LoopVectorize.cpp code (retrieved at the beginning of July 2016) I ran the following piece of C code: void foo(long *A, long *B, long *C, long N) { for (long i = 0; i < N; ++i) { C[i] = A[i] + B[i]; } } The vectorized LLVM program I obtain contains 2 vector.body blocks - one named

Hi, I just tried llvm-3.8 (LLVM SVN Repository). With this version, -fno-rtti can help me to compile my code and -irce can help me to do a better job for loop unrolling. However, I still have one question. If I use Clang to compile a piece of c++ code to .bc and then use 'opt -loop-rotate -loop-unroll -irce', I can get what I want. I mean, there is no conditional branch at the end of each

I wanted to confirm that my understanding of the situation is correct. For background, I've been working have an optimizer pass for a research architecture which works best when there are large basic blocks and good alias analysis results. I first noticed the issue in rgbcmy01 from eembc-1.1, but have created a simpler test case which demonstrates the same issue which is unencumbered by the

...igurations2/statusbar/ inflating: settings.xml inflating: META-INF/manifest.xml Removing Test1Src.odt Creating a Pictures directory Pre-processing the contents Sweaving content.Rnw Writing to file content_1.xml Processing code chunks ... 1 : term hide(label=Prol?gom?nesStandard) 2 : term xml(label=EssaiGraphe1) 3 : echo term verbatim(label=TestChunk) 4 : term xml(label=SecondChunk) 'content_1.xml' has been Sweaved Removing content.xml Post-processing the contents error parsing attribute name attributes construct error xmlParseS...

In 0.9.7 the private key encryption was switched from 3DES to AES, (https://bugzilla.mindrot.org/show_bug.cgi?id=1550) the motivation for this being that 128-bits of security is better than the 112 or so you get from 3DES these days. Interestingly that bug is about upgrading to AES-256, but we ended up with AES-128. Presumably due to the Solaris crippling? However ssh-keygen still uses a