similar to: [LLVMdev] Are 7th LLVM Developer meeting's PPTs available?

Hi, I have the llvm loop vectorizer to complie the following sample: //================= int test(int *a, int n) { for(int i = 0; i < n; i++) { a[i] += i; } return 0; } //================ The corresponded .ll file has a loop preheader: //================ for.body.lr.ph: ; preds = %entry

Hi, Can you add the following two publications from our group to the LLVM publications page. - *Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM [pdf] <http://www.cs.rutgers.edu/~santosh.nagarakatte/papers/alive-fp-sas16.pdf> *David Menendez, Santosh Nagarakatte, and Aarti Gupta *To Appear in the Proceedings of the 23rd Static Analysis

Hi, The TinyTripCountVectorThreshold only applies to loops with a known (constant) trip count. If a loop has a trip count below this value we don’t attempt to vectorize the loop. The loop below has an unknown trip count. Once we decide to vectorize a loop, we emit code to check whether we can execute one iteration of the vectorized body. This is the code quoted below. On May 22, 2013, at 10:23

Hello, I am in need of moderators to help moderate each session. If you are interested, please respond to this mail and indicate which slot you can moderate. Its a long shot as you would miss talks, but if anyone wants a break to do work or check email while also staffing the registration desk, please let me know if you can do it during any of the sessions below. Thanks! Options: Moderator #1

Hi, Just from personal interest, is there a canonical way in IR+metadata to express "This small constant trip-count loop is desired to be converted into a sequence of vector operations directly"? Ie, mapping a 4 element i32 loop into a linear sequence of <4 x i32> operations. Obviously this may not always be a win, but I'm just wondering if there's a way to communicate

Hi, When I test "matmul" in the polly directory, I get the following performance data: //=============================== --> 12. Compare the runtime of the executables time ./matmul.normalopt.exe 0:23.53 real, 23.48 user, 0.00 sys time ./matmul.polly.interchanged.exe 0:22.86 real, 22.82 user, 0.01 sys time ./matmul.polly.interchanged+tiled.exe 0:22.87 real, 22.83 user, 0.00 sys

I'm still in need for moderators for the following sessions: > Moderator #3 (11:15-12:45, Regency 1) > Verified LLVM: Formalizing the semantics of the LLVM Intermediate Representation for Verified Program Transformations- Santosh Nagarakatte, University of Pennsylvania/Rutgers University > Integrated Security, using LLVM for Dynamic and Static Security Tasks- Jared Carlson,

Hi all, I have been trying to understand the use of undef in both sequential and concurrent programs. >From the LLVM Language Reference Manual, I see the following definition of undef. "Undef can be used anywhere a constant is expected, and indicates that the user of the value may receive an unspecified bit-pattern". LLVM Language Reference manual also demonstrates how optimizers

On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte > <santosh.nagarakatte at gmail.com> wrote: >> Hi all, >> >> I have been trying to understand the use of undef in both sequential >> and concurrent programs. >> >> >From the LLVM Language Reference Manual, I

On Mon, Aug 22, 2011 at 8:46 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: > On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >> On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte >> <santosh.nagarakatte at gmail.com> wrote: >>> Hi all, >>> >>> I have been trying to understand the use of undef in

On Mon, Aug 22, 2011 at 3:40 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: > On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >> On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte >> <santosh.nagarakatte at gmail.com> wrote: >>> Hi all, >>> >>> I have been trying to understand the use of undef in

On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte <santosh.nagarakatte at gmail.com> wrote: > Hi all, > > I have been trying to understand the use of undef in both sequential > and concurrent programs. > > >From the LLVM Language Reference Manual, I see the following > definition of undef. > "Undef can be used anywhere a constant is expected, and indicates

Hi all, I am testing link time optimizations with clang on linux x86_64 machine running Ubuntu Maverick. I am using clang with llvm release-3.0 I followed the instructions on http://llvm.org/docs/LinkTimeOptimization.html However, when I try to compile with one file being bitcode and other being native code exactly as shown in the documentation, I get the following errors clang a.o main.o -o

LLVM developers, Can you add the following paper to the publication list? "Formal Verification of SSA Optimizations for LLVM" Jianzhou Zhao, Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) 2013 link to ACM DL:

On Mon, Aug 22, 2011 at 3:49 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Mon, Aug 22, 2011 at 3:40 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: >> On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >>> On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte >>> <santosh.nagarakatte at gmail.com>

On Mon, Aug 22, 2011 at 6:49 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Mon, Aug 22, 2011 at 3:40 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: >> On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >>> On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte >>> <santosh.nagarakatte at gmail.com>

LLVM developers, I was wondering if the program would still be safe if I strip the byval attributes from the parameters in the entire bitcode. LLVM language reference manual states that "The attribute implies that a hidden copy of the pointee is made between the caller and the callee, so the callee is unable to modify the value in the callee. This attribute is only valid on LLVM pointer

On Tue, Aug 23, 2011 at 12:08 AM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Mon, Aug 22, 2011 at 8:46 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: >> On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >>> On Mon, Aug 22, 2011 at 2:49 PM, Santosh Nagarakatte >>> <santosh.nagarakatte at gmail.com>

On Mon, Aug 22, 2011 at 7:27 PM, Jeffrey Yasskin <jyasskin at google.com> wrote: > On Mon, Aug 22, 2011 at 3:49 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >> On Mon, Aug 22, 2011 at 3:40 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: >>> On Mon, Aug 22, 2011 at 6:08 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >>>> On

On Mon, Aug 22, 2011 at 5:29 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: > On Mon, Aug 22, 2011 at 7:27 PM, Jeffrey Yasskin <jyasskin at google.com> wrote: >> On Mon, Aug 22, 2011 at 3:49 PM, Eli Friedman <eli.friedman at gmail.com> wrote: >>> On Mon, Aug 22, 2011 at 3:40 PM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote: >>>> On