search for: loopnestpass

Hi, I would like to give a quick update on what my current design and implementation go like. Basically, the `FunctionToLoopPassAdaptor` is now modified to a generic version `FunctionToLoopUnitPassAdaptor`, which allows re-using the existing codes to implement `FunctionToLoopNestPassAdaptor`, with the help of additional metadata associated with `Loop` and `LoopNest`. Both `FunctionToLoopPassAdaptor` and `FunctionToLoopNestPassAdaptor` are aliases to `FunctionToLoopUnitPassAdaptor` and they operates on `Loop`, and the `FunctionToLoopNestPassAdaptor` will construct the `LoopNest`...

Hi, I'm a college student who is quite new to the community and is interested in contributing to the LLVM project. Although I haven't applied to GSoC, I notice that the project "Create LoopNestPass" seems to be unassigned. So I'm curious whether anyone is currently working on it, and if not, is it possible for me to work on it as a side-project? I've been programming in C++ for quite a while, and I've walked through the `LoopPass`, `LoopNest`, and some other LLVM classes tha...

Hi, Thanks for your help! I've checked the sources that you mentioned. Currently, I think that I would need to implement a FunctionToLoopNestPassAdaptor which is essentially the same as the FunctionToLoopPassAdaptor but operates only on LI.getTopLevelLoops(). We might also need a LNPMUpdater (LoopNestPassManagerUpdater) which disallows adding inner-loops back into the pipeline, and LoopNestPassManager will simply be PassManager<Loop, Loo...

...l also disappoint you both probably because I'm not that familiar with the creation of passes and the problem at hand. I'll try to help as I can. > Is there a specific section of the dragon book that I should read so that I can at least understand theoretically what it means to create a LoopNestPass? As I can understand, no because it's more of a structural, LLVM-specific problem than a generic, compiler optimization problem. > Stefanos can speak to this more but in order to create a LoopNestPass after reading what they are talking about requires information from the call graph > for...

Hi Nick, What you said makes sense, but it's not called a call graph. :) You're essentially referring to what LoopInfo does which makes sense, but as I mentioned earlier, this is already done in the LoopInfo. Now, how much one will be able to use it in a LoopNestPass is another issue, which is certainly something that mentors could help you with. Best, Stefanos Στις Τρί, 17 Μαρ 2020 στις 3:35 μ.μ., ο/η Nicholas Krause < xerofoify at gmail.com> έγραψε: > > > On 3/17/20 9:23 AM, Stefanos Baziotis wrote: > > > Yes that's correct. &gt...

...a call graph. :) > > Sure I assumed so that was just a term I used by mistake :). > > You're essentially referring to what LoopInfo does which makes sense, but > as I mentioned earlier, this is already done > in the LoopInfo. Now, how much one will be able to use it in a > LoopNestPass is another issue, which is certainly > something that mentors could help you with. > > I'm not applying for GSoC but that's a hint if other students are applying > to help them get started. > > Nick > > > Best, > Stefanos > > Στις Τρί, 17 Μαρ 2020 στις 3:...

...obably because I'm not > that familiar with the creation of passes and the problem at hand. I'll try > to help as I can. > > > Is there a specific section of the dragon book that I should read so > that I can at least understand theoretically what it means to create a > LoopNestPass? As I can understand, no because it's more of a structural, > LLVM-specific problem than a generic, compiler optimization problem. > Stefanos > can speak to this more but in order to create a LoopNestPass after reading > what they are talking about requires information from the call...

...ed so that was just a term I used by mistake :). >>> >>> You're essentially referring to what LoopInfo does which makes sense, >>> but as I mentioned earlier, this is already done >>> in the LoopInfo. Now, how much one will be able to use it in a >>> LoopNestPass is another issue, which is certainly >>> something that mentors could help you with. >>> >>> I'm not applying for GSoC but that's a hint if other students are >>> applying to help them get started. >>> >>> Nick >>> >>>...

...a term I used by mistake :). >>>> >>>> You're essentially referring to what LoopInfo does which makes sense, >>>> but as I mentioned earlier, this is already done >>>> in the LoopInfo. Now, how much one will be able to use it in a >>>> LoopNestPass is another issue, which is certainly >>>> something that mentors could help you with. >>>> >>>> I'm not applying for GSoC but that's a hint if other students are >>>> applying to help them get started. >>>> >>>> Nick &g...

...this macro in and my local, it appears I don’t have the file. Do I need to build it then? 2) How do I tell CMake to look for this macro? 2. Is there a specific section of the dragon book that I should read so that I can at least understand theoretically what it means to create a LoopNestPass? LLDB Tab Completion 1. Is there any resource I can read that explains how lldb is able to “pause” the executable and map it to a certain line in the source file/in general how lldb represents the state of the executable? 2. Where in the source code can I go to see how existi...

Dear LLVM Team, I would like to contribute to/participate in LLVM’s GSOC, because I would very much like to combine my knowledge of graph theory/algorithms and my interest in C++ together. Contributing to the LLVM code seems like a fantastic challenge and learning experience for these two interests of mine, as well as computer science in general (For example, the use of a new syntactic category