similar to: [LLVMdev] region pass - new pass for llvm

How is the patch compressed? I don't know how to open the file with .7z suffix. Evan On Feb 27, 2010, at 10:12 PM, ether zhhb wrote: > hi all, > > The patch in the attachment add a new pass - region pass to the llvm system. A region pass is similar to a loop pass, all of them execute on a group of BasicBlocks at one time, but it operate on a single entry single exit region, not the

That looks like something from 7-zip (http://www.7-zip.org/). Ether, can you re-send either as a plain-text attachment, or if you need to use an archive, .zip or .tar.gz so it's a bit more standard for those of us not working on a Windows platform? Thanks! -Jim On Mar 4, 2010, at 11:15 AM, Evan Cheng wrote: > How is the patch compressed? I don't know how to open the file with .7z

On 01/13/10 00:56, Jan Sjodin wrote: > Why not use the "standard" algorithm for detecting SESE-regions and building a program structure tree? > It should handle everything you want. It also becomes much simpler to specify a connected SESE-region > by entry/exit edges, while a disconnected region is specified by entry/exit blocks. Only defining regions on > blocks is not

On 01/13/10 05:09, Jan Sjodin wrote: > Hi Tobias > >> In general this approach saves a preliminary pass that has to insert new > >> bbs, to generate these edges. As we do not have to modify the CFG other >> passes like dominance information are still valid, and we do not have to >> create a lot of auxiliary bbs, to be able to detect all regions. This >>

Hi all, I'm working with regions, and I was surprised by the region set of this function: > define void @foo() { > br i1 false, label %loop, label %end > > loop: > br i1 false, label %loop, label %end > > end: > ret void > } .dot file as generated by opt —view-regions attached. Essentially, there are 3 regions: one that has the whole function, one that has

On 01/20/10 18:05, Jan Sjodin wrote: >>>> bbs, to generate these edges. As we do not have to modify the CFG other >>>> passes like dominance information are still valid, and we do not have to >>>> create a lot of auxiliary bbs, to be able to detect all regions. This >>>> saves memory and runtime. In general it is probably not too easy to

On 03/08/2010 11:23 AM, Renato Golin wrote: > On 6 March 2010 02:05, Tobias Grosser<grosser at fim.uni-passau.de> wrote: >> This is useful if you want to restrict an analysis&transformation >> e.g. to side effect free code, code without loops, code without >> irregular control flow, ... > > I'm confused... > > I thought that loop optimization was one

On 02/28/2010 07:12 AM, ether zhhb wrote: > hi all, Hi ether, sorry that it took so long to reply and thanks for your work on the regions stuff. Concerning this patch there are still some small things I would have liked to improve, before before people spend time reviewing this patchset in detail. However as the topic is now on the mailing list maybe we get some feedback on the general

Why not use the "standard" algorithm for detecting SESE-regions and building a program structure tree? It should handle everything you want. It also becomes much simpler to specify a connected SESE-region by entry/exit edges, while a disconnected region is specified by entry/exit blocks. Only defining regions on blocks is not enough to be able to quickly determine how to replace/move a

Tobias, Thanks for taking the time to summarize all this. It's a great writeup. I'm moving the thread to llvm-dev. My responses below. On May 21, 2012, at 5:06 AM, Tobias Grosser <tobias at grosser.es> wrote: > First of all some information about the RegionInfo pass: > > ======================================================================= > The very first paper I

On 01/26/2011 07:50 PM, Vu Le wrote: > I guess I didn't have a clear question. > > Suppose we have BB1 and BB2 both point to BB3. > BB1 has variable x. BB2 also as variable x. > BB3 will have PHINode for x with 2 value from BB1 and BB2. > BB1 BB2 > \ / > BB3 > > Now if BB1 and BB2 is extracted into a function > (using ExtractCodeRegion), they

On 03/08/2010 12:36 PM, Renato Golin wrote: > Hi Tobias, > > >> What do you mean with a closed CFG? > > Closed region, one entry/one exit. > > >>> Still, non-affine loops can be converted to affine loops in many ways >> How would you do this? As we use the scalar evolution analysis to analyze >> the loops, we do not depend on any syntactic form.

On 01/08/10 14:20, ether wrote: > sorry that i forgot to change the subjuect > > > hi all, Hi ether, now a kind of more complete answer. > On 2010-1-7 0:11, John Mosby wrote: >> In LLVM we could add support for generalized CFG regions and >> RegionPasses. A region is a part of the CFG. The only information we >> have is, that it has one entry and one exit, this

Hi Tobias, If the PHI node at exit block of region R has multiple inputs from the R, I split the exit block into 2. The first block contains all PHI nodes whose input are all from the region. The second is the new exit node. All branches (outside R) to the old exit now point the new exit. All regions whose exit is the old exit are also updated with the new exit node. It works like a charm.

Hi Tobi, I have one additional question about the RegionInfo::isRegion function. In the second case (i.e. Entry dominates Exit), why is checking the following two conditions are equivalent to checking it's a refined region: For any BB in DF(exit), 1) BB should be in DF(entry) 2) BB reachable only from entry through a path passing exit.

On 01/27/2011 12:48 AM, Vu Le wrote: > Hi Tobias, > If the PHI node at exit block of region R has multiple inputs from the R, > I split the exit block into 2. > The first block contains all PHI nodes whose input are all from the region. > The second is the new exit node. > > All branches (outside R) to the old exit now point the new exit. > All regions whose exit is the old

> On Jan 13, 2017, at 9:41 AM, Hal Finkel <hfinkel at anl.gov> wrote: > > > On 01/13/2017 12:29 AM, Mehdi Amini wrote: >> >>> On Jan 12, 2017, at 5:02 PM, Hal Finkel <hfinkel at anl.gov <mailto:hfinkel at anl.gov>> wrote: >>> On 01/12/2017 06:20 PM, Reid Kleckner via llvm-dev wrote: >>> >>>> On Wed, Jan 11, 2017 at 8:13

On 03/04/2010 09:38 PM, Jim Grosbach wrote: > That looks like something from 7-zip (http://www.7-zip.org/). Ether, can you re-send either as a plain-text attachment, or if you need to use an archive, .zip or .tar.gz so it's a bit more standard for those of us not working on a Windows platform? Thanks! > There is p7zip which can extract this on Linux (and its probably been ported to the

Hi yes, I'm asking for any advice, I want to implement multithreaded code generator in LLVM. tnx --- On Tue, 10/5/10, Duncan Sands <baldrick at free.fr> wrote: From: Duncan Sands <baldrick at free.fr> Subject: Re: [LLVMdev] Multithreaded code generation To: llvmdev at cs.uiuc.edu Date: Tuesday, October 5, 2010, 10:50 AM Hi Hamed, > I want to use LLVM to automatically

> On Jan 20, 2017, at 6:59 AM, Hal Finkel <hfinkel at anl.gov> wrote: > > On 01/13/2017 12:11 PM, Mehdi Amini wrote: >> >>> On Jan 13, 2017, at 9:41 AM, Hal Finkel <hfinkel at anl.gov <mailto:hfinkel at anl.gov>> wrote: >>> >>> >>> On 01/13/2017 12:29 AM, Mehdi Amini wrote: >>>> >>>>> On Jan 12,