search for: baziotis

On Sun, Apr 5, 2020 at 6:34 PM Stefanos Baziotis < stefanos.baziotis at gmail.com> wrote: > Hi Craig, > > > Adding a nuw to the add -8 is incorrect. > Yeah, I didn't mean to say it was correct. It was just an observation that > with nuw the optimization was happened and I asked if someone thought it > was somehow c...

...ael Kruse < llvmdev at meinersbur.de> έγραψε: > Have you looked into PredicatedScalarEvolution? It can generate > runtime-checks for no-overflow assumptions > (PredicatedScalarEvolution::setNoOverflow). > > Michael > > Am Fr., 18. Sept. 2020 um 18:13 Uhr schrieb Stefanos Baziotis via llvm-dev > <llvm-dev at lists.llvm.org>: > >> Hi everyone, >> >> I've been using SCEV Delinearization but it fails when >> other-than-pointer-size values are used in the subscripts. To make that >> clear, say that we have a target in which pointers...

...tive of the unsigned math, -8 is treated a very large positive number. The input to the add is [8,13) and adding a large positive number to it wraps around past 0. So that is guaranteed unsigned wrap. On the other hand, a sub nuw 8 would be correct. ~Craig On Sun, Apr 5, 2020 at 3:27 PM Stefanos Baziotis via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Thanks, I didn't know that! Indeed, it's instruction combine that does the > job. > > - Stefanos > > Στις Δευ, 6 Απρ 2020 στις 12:38 π.μ., ο/η Florian Hahn < > florian_hahn at apple.com> έγραψε: > >&...

> On Apr 5, 2020, at 22:20, Stefanos Baziotis <stefanos.baziotis at gmail.com> wrote: > > > Any idea about how the compiler could remove the lshr and use a add -16? > Actually, I just figured that doing this test is like solving this: > > 8 <= x/2 <= 13 > 16 <= x <= 26 > 0 <= x - 16 <= 10 =>...

...gt; Thanks, > Hal > > Hal Finkel > Lead, Compiler Technology and Programming Languages > Leadership Computing Facility > Argonne National Laboratory > > ------------------------------ > *From:* llvm-dev <llvm-dev-bounces at lists.llvm.org> on behalf of Stefanos > Baziotis via llvm-dev <llvm-dev at lists.llvm.org> > *Sent:* Sunday, March 1, 2020 9:58 AM > *To:* Florian Hahn <florian_hahn at apple.com> > *Cc:* llvm-dev at lists.llvm.org <llvm-dev at lists.llvm.org> > *Subject:* Re: [llvm-dev] Commits as new contributor > > Thanks to...

...e time). Note: finding transformations that use code motion is part of the project, so no need to include every opportunity in the proposal. Hope this help. Regards, Whitney Tsang From: RITHIK SHARMA <rithiksh02 at gmail.com> To: whitneyt at ca.ibm.com Cc: etiotto at gmail.com, Stefanos Baziotis <stefanos.baziotis at gmail.com>, llvm-dev <llvm-dev at lists.llvm.org>, bmahjour at ca.ibm.com Date: 2020/03/27 03:08 PM Subject: [EXTERNAL] Re: [llvm-dev] [GSoC] Prospective student for Unify ways to move code or check if code is safe to be moved...

..., I checked the patch, best of luck! I see how it does the transformation, it's interesting. I think that https://reviews.llvm.org/rGe9963034314edf49a12ea5e29f694d8f9f52734a could maybe help in such things. Any idea about how the compiler could remove the lshr and use a add -16? Best, Stefanos Baziotis Στις Κυρ, 5 Απρ 2020 στις 10:06 μ.μ., ο/η Florian Hahn < florian_hahn at apple.com> έγραψε: > Hi, > > > On Apr 5, 2020, at 14:08, Stefanos Baziotis via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > To be more specific for everyone: > > - First of all,...

...thanks! I need a nuw (which I have to invent, with a run-time check, since it doesn't exist in the original but anyway). Best, Stefanos Στις Παρ, 31 Ιουλ 2020 στις 12:36 μ.μ., ο/η Florian Hahn < florian_hahn at apple.com> έγραψε: > > > > On Jul 30, 2020, at 21:03, Stefanos Baziotis via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > > > Hi, > > > > I have a SCEV like this: {16,+,8}. Say that this came from a loop like: > > int64_t *p; > > for (int64_t i = 0; i < ...; ++i) > > p[i+2]... > > > > And assumin...

...interested in the sort of pass where you write `-passes=print<pass-name>` and it calls the `print()` function of the pass. I have seen some other passes that can invoke `-passes=print<>` but the implementation seems to be in the wrapper pass for the old pass manager. Thanks, Stefanos Baziotis -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200731/8387a5bd/attachment.html>

Np, good luck! :) - Stefanos Στις Τρί, 24 Μαρ 2020 στις 8:55 μ.μ., ο/η RITHIK SHARMA < rithiksh02 at gmail.com> έγραψε: > Many thanks, Stefanos! I really appreciate your help :) I heard from > Whitney. > > Best, > Rithik > > On Tue, 24 Mar 2020 at 23:08, Stefanos Baziotis < > stefanos.baziotis at gmail.com> wrote: > >> Hi Rithik, >> >> I CC'd the 2 other mentors and hopefully you'll get answer. Sorry, but I >> don't know of any other way to help. :/ >> You may also try to contact them privately. >> >>...

...that is not optimized: https://godbolt.org/z/BL-4jL I included the original source code and this is after -O2. We both thought that the -8 branch could be optimized out. I added a nuw in the subtraction and it actually does it. Any thoughts on why that doesn't happen already? Best, Stefanos Baziotis -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200405/f5b27e28/attachment.html>

...s that sound reasonable ? Do I miss something ? Second, what is the best way to clean them ? One possible way is to rebuild them (i.e. traverse them and build new almost identical expressions, except that we ignore the problematic instructions). Though I haven't tried it yet. Thanks, Stefanos Baziotis -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200919/838ab00b/attachment-0001.html>

Hi Raphael, Thanks for the clarification. I note that in this case, I also think that Benson should preferably find a different project as that would probably be better for everybody. Best, Stefanos Baziotis On Wed, Mar 18, 2020, 12:24 Raphael “Teemperor” Isemann <teemperor at gmail.com> wrote: > Just to clarify my point about the “asking if there is already another > student applying”: > > In my situation there is already a student that applied 3 or 4 weeks ago > and that alread...

Hello, Following up on last week's LLVM-Dev meeting where we discussed MemorySSA related topics, I created the following google doc <https://docs.google.com/document/d/1-uEEZfmRdPThZlctOq9eXlmUaSSAAi8oKxhrPY_lpjk/edit#> with some of the meeting notes and planning for future meetings. For those who participated, please feel free to add items I may have missed into the document and cc

Thanks to both! I'll update the docs. Best, Stefanos Στις Κυρ, 1 Μαρ 2020 στις 5:24 μ.μ., ο/η Florian Hahn < florian_hahn at apple.com> έγραψε: > Hi, > > > On 1 Mar 2020, at 14:44, Stefanos Baziotis via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > > I recently was granted commit access, but I'm not really sure what is the > process. > The developer policy states: > "You are granted *commit-after-approval* to all parts of LLVM. To get > approval, su...

...ently LICM does some of it but not all. If there are more than 2 conditionals, LICM would fail to move loop invariant from the second conditional because loop rotation didn't peel all the conditionals. My observation is from a while ago so happy to be corrected. -Aditya From: Stefanos Baziotis <stefanos.baziotis at gmail.com> Sent: Saturday, March 21, 2020 1:42 PM To: Aditya K <hiraditya at msn.com>; 林政宗 <jackie_linzz at 126.com>; Johannes Doerfert <johannesdoerfert at gmail.com> Cc: llvm-dev <llvm-dev at lists.llvm.org> Subject: Re: [llvm-dev] questiona...

...to be way too many steps just to create hello world pass, I don't think that passes like DependenceAnalysis follow it. So, what should I do? What is the "correct" to create the copy; like an external library as the HelloWorld tutorial shows ? Thanks, Stefanos [1] https://github.com/baziotis/llvm-project/tree/dep_analysis [2] https://www.youtube.com/watch?v=ar7cJl2aBuU -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200522/f26574fb/attachment.html>

Hello again! Previously, I introduced myself as a prospective GSoC student interested in LLVM. Per Mr. Doerfert suggestion I took a look at two other projects that he said could interest me due to my ongoing research in autotuning. The projects are: Advanced Heuristics for Ordering Compiler Optimization Passes Machine learning and compiler optimizations: using inter-procedural analysis to select

hi, I had an implementation of loop-rotation that peels the loop such that each conditional is executed at least once. https://reviews.llvm.org/D22630 This helps with LICM when instructions inside a conditional is loop invariant. The patch has decent number of test cases. All the requested comments were addressed at that time. I'm happy to rebase and put the patch again. -Aditya

...ded before. The agenda includes progress on the topics discussed last time (meeting notes in the doc), and open discussions and questions from those who join. Again, this is an open meeting, all are welcome. Looking forward to talking to you! Best, Alina On Mon, Oct 12, 2020, 11:36 PM Stefanos Baziotis < stefanos.baziotis at gmail.com> wrote: > Cool, great, I'm looking forward to the meeting! I'm glad that you watched > our talk, I hope it helps. > > Best, > Stefanos > > Στις Τρί, 13 Οκτ 2020 στις 2:58 π.μ., ο/η Alina Sbirlea < > alina.sbirlea at gmail.co...