similar to: [LLVMdev] Array Access Region Analysis in LLVM?

Hi, All, Are there any supports about array region analysis both for serial program and multi-thread programs in LLVM ? I couldn't find them. Thanks, Pengcheng

TL;DR This RFC is a joint effort by Intel and Saarland University to bring the divergence analysis of the Region Vectorizer [1,2,3,4,5] (dubbed the vectorization analysis of RV) to LLVM. The implementation is available on github for feedback [0]. The existing divergence analysis infrastructure in LLVM has conceptual limitations (structured control, SCEV based). The new analysis resolves bugs

Hi all, Please check out our recent ISCA publication that introduces a new performance profiling technique for analyzing parallel programs along with an open source tool to collect the profiles. The tool is written into LLVM's LTO. Could someone please add the paper to http://llvm.org/pubs/ ? Here is the citation: Harmony: Collection and Analysis of Parallel Block

Hi, developers, Recently, I am trying to use the LLVM Region analysis, the LLVM version is 10. I use opt to print out the region analysis result using "opt -view-regions-only region.ll". However, I am confused about the result produced by LLVM, I found that LLVM seems to skip loop preheader when grouping blocks into regions. Here is a simple example code: ```region.c void split(int

Hi , It will be good ,If you get us the sample that assert. Thanks ~Umesh On Tue, Jul 31, 2012 at 11:40 AM, 田中 太郎 <dontforgettobringatowel at live.jp>wrote: > > Hi all, > > I ran across an assertion failure while using region analysis in my passes. > I get the same thing when doing: opt -regions -analyze > > [...] > [1] entry => if.end > End region tree

Hi all, I ran across an assertion failure while using region analysis in my passes. I get the same thing when doing: opt -regions -analyze [...]   [1] entry => if.end End region tree Printing analysis 'Detect single entry single exit regions' for function 'njDecodeSOF': Region tree: [0] entry => <Function Return>   [1] entry => return     [2] if.end => return

At 2013-08-16 22:32:30,"Tobias Grosser" <tobias at grosser.es> wrote: >> >> Yes, I have changed the original code to the form you suggested: >> for (i >> for (j >> ... >> x=1 > >Sorry, I meant > x[0] += > It is interesting that Polly would run much faster if we change the

Frederick, This is great news! Thanks for your effort. Your proof-of-concept raises a few questions for me: 1) I know that the ratio of uncompressed to compressed data is unpredictable, but I never really considered whether the input block size or the output block size is constant. I'm assuming that if you're breaking the uncompressed input file into multiple pieces, then the

Hello LLVM developers, I have a few questions regarding analysis and transformation of Machine IRs. I am writing a scheduling pass that transforms single basic block loops. Details of the pass can be found in an email I sent two weeks ago. http://lists.cs.uiuc.edu/pipermail/llvmdev/2010-August/033808.html I have changed my pass to run before Live Variable Analysis since then. 1, Induction

On Sat, Feb 29, 2020 at 2:25 PM David Blaikie via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > > On Sat, Feb 29, 2020 at 2:19 PM Chris Lattner <clattner at nondot.org> wrote: > >> On Feb 29, 2020, at 2:08 PM, David Blaikie <dblaikie at gmail.com> wrote: >> >> I've >>> curious as >>> to how MLIR deals with IPO as that's

Hi, I'm working now on extending SCEV Analysis and adding FP support. At the beginning, I want to vectorize this loop: float fp_inc; float x = init; for (int i=0;i<N;i++){ A[i] = x; x += fp_inc; // Loop invariant variable or constant } In this loop "x" is a FP induction variable. But it is not the "primary" induction and loop trip count is still depends

Hi, > Cool! I think the most critical part of this is to get a good > interface for dependence analysis. There are lots of interesting > implementations that have various time/space tradeoffs. > > For example, it would be great if Omega was available as an option, > even if the compiler didn't use it by default. This argues for making > dependence analysis

Hey FLAC devs, I managed to hack out a proof-of-concept multithreaded FLAC encoder based on the example libFLAC one. It turned out to be fairly straightforward to get near-linear speedup; I can encode a 636 MB wave file in 6.8s with 8 threads on an 8-core 3.0 GHz Xeon vs. 31.4s with a single thread. Basically I mmap() the input file, divide up the mmap()ed region into nearly equal pieces,

On 08/16/2013 02:42 AM, Star Tan wrote: > At 2013-08-16 12:44:02,"Tobias Grosser" <tobias at grosser.es> wrote: >> Hi, >> >> I tried to reproduce your findings, but could not do so. > > > Sorry, I did not put all code in my previous email because the code seems a little too long and complicated. > You can refer to the detailed C code and LLVM IR

On Thu, Jan 19, 2017 at 11:46 AM, Mehdi Amini via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > > On Jan 19, 2017, at 11:36 AM, Adve, Vikram Sadanand via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > > > Hi Johannes, > > > >> I am especially curious where you get your data from. Tapir [0] (and to > >> some degree PIR [1]) have

>> As part of the advanced compilers course semester project (at >> UIUC), we >> are starting to implement array dependence analysis for LLVM. Great! This is something we've needed for a long time. > I'm currently working on a similar project and hoping to finish it in > about two weeks. Cool! I think the most critical part of this is to get a good

Wojtek, If you like, I can help guide this SoC project. I would also like to see if we can coordinate with Alex and Albert, who are doing the class project here. As a first comment, your 3 layers are a good organization but two comments: 1. Layer 1 shd also look at loop bounds and array bounds: those can be used to disprove some deps. 2. The interface will also need to compute direction and

In a variety of graphic applications, I plot some data, together with arrows representing variables or linear transformations of variables as vectors in the same space, as in a biplot. In my applications, the scale of the arrows is arbitrary -- all that matters is relative length. I'd like to blow them up or shrink them to fit the available space in the plot. The origin is typically at

M. Pabis wrote: > 1. Each thread deals with frames from intra frame up to next intra frame > - 1; This works if you know where the intra frames are. Currently the frame type decision is made by trying to encode as an inter frame, and keeping statistics on expect rate and distortion from using all intra modes during mode decision. Then if it looks like an all-intra frame is likely to be

On Feb 29, 2020, at 2:08 PM, David Blaikie <dblaikie at gmail.com> wrote: > I've > curious as > to how MLIR deals with IPO as that's the problem I was running into. > > FWIW I believe LLVM's new pass manager (NPM) was designed with parallelism and the ability to support this situation (that MLIR doesn't? Or doesn't to the degree/way in which the NPM