search for: bardia

...turning SCEV_Unknown from getAddExpr would seem plausible except that it would not allow for expression simplifications where recurrences over non-dominating loops can get canceled out. Having said that it may still be a reasonable middle-ground solution. Philip, do you have any thoughts on that? Bardia Mahjour From: Jimmy Zhongduo Lin <jimmy.zhongduo.lin at huawei.com> To: Bardia Mahjour <bmahjour at ca.ibm.com> Cc: Philip Reames <listmail at philipreames.com>, "llvm-dev at lists.llvm.org" <llvm-dev at lists.llvm.org> Date: 2020/04/16 08:39 PM Sub...

...since Philip seems to be interested in some specific examples. If the assertion in getAddrExpr is deemed necessary, then I think a condition check would be the next best solution as it helps client code guard against such cases and make alternative arrangements to avoid an assertion or miscompile. Bardia Mahjour Compiler Optimizations IBM Toronto Software Lab From: Jimmy Zhongduo Lin <jimmy.zhongduo.lin at huawei.com> To: Bardia Mahjour <bmahjour at ca.ibm.com>, Philip Reames <listmail at philipreames.com>, "llvm-dev at lists.llvm.org" <ll...

...) { A[i2 + i3*n2] = 11; } } for (int i4 = 2; i4 < n3; i4++) { for (int i5 = 1; i5 < i4 - 1; i5++) { A[i5] = 22; } } } } To check the bounds of the dependence function we need to create a symbolic expression that involves AddRecs for i2 and i4. Bardia Mahjour From: Philip Reames <listmail at philipreames.com> To: Bardia Mahjour <bmahjour at ca.ibm.com>, LLVM Development List <llvm-dev at lists.llvm.org> Date: 2020/03/30 02:50 PM Subject: [EXTERNAL] Re: [llvm-dev] Scalar Evolution Expressions Involvi...

Forwarding to the dev list, in case others ran into similar issues and/or have input on this topic. Bardia Mahjour ----- Forwarded by Bardia Mahjour/Toronto/IBM on 2020/03/30 02:25 PM ----- From: Bardia Mahjour/Toronto/IBM To: listmail at philipreames.com Cc: "Michael Kruse" <llvm at meinersbur.de> Date: 2020/03/26 11:47 AM Subject: Scalar Evolution Expressions Involving Sibling Loops...

...n be undone by rematerialization, but not all, and it can involve a lot of effort which increases compile time. Do you have examples of cases where rematerialization is not possible? We are interested in learning about any previous attempts at trying to address the issue in RA. Have you tried it? Bardia Mahjour Compiler Optimizations IBM Toronto Software Lab bmahjour at ca.ibm.com (905) 413-2336 From: Florian Hahn <florian_hahn at apple.com> To: Bardia Mahjour <bmahjour at ca.ibm.com> Cc: via llvm-dev <llvm-dev at lists.llvm.org>, tcorring at amd.com Date: 2019/09/13 11:16 A...

...due to data dependent exit, which is currently handled via predication. There is a lot of room for improvement, specially for read-only loops. Please let him know if you are interested. - Status Updates - Data Dependence Graph (https://reviews.llvm.org/D65350) (Bardia) - All review comments are addressed. Waiting for approval. - Bugzilla bugs update (Vivek) - Florian has a patch fixing loop bugs related to max trip count. ---------------------------- Tentative Agenda for Sept 25 ---------------------------- Presentation from Marc Moreno Maza about hi...

...-------------------- - Status Updates - Impact of Loop Rotation on existing passes (Min-Yih) - Bugzilla bugs update (Vivek) - Loop Cache Cost Analysis (https://reviews.llvm.org/D63459) (Ettore) - Loop Guard API (https://reviews.llvm.org/D63885) (Whitney) - Data Dependence Graph (Bardia) - Delinearization (Gary Elsesser) - Loop vs Function pass (Jamie Schmeiser) - Loop Guard API (Whitney) Bardia Mahjour Compiler Optimizations IBM Toronto Software Lab bmahjour at ca.ibm.com (905) 413-2336 -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://...

...he accesses are in-bound with respect to the memory of the whole array but not with respect to individual dimensions, then I'm not sure we can reason about *any* delinearization statically (except for the limited cases where the bounds are compile-time known). Am I misunderstanding the issue? Bardia Mahjour Compiler Optimizations Hydra Squad Lead IBM Toronto Software Lab bmahjour at ca.ibm.com (905) 413-2336 From: David Green <David.Green at arm.com> To: "llvm-dev at lists.llvm.org" <llvm-dev at lists.llvm.org>, Bardia Mahjour <bmahjour at ca.ibm.com&g...

...ct. Having a debug option probably wouldn't hurt, but I'm not sure about turning it on for tests if it reduces the test coverage. Other people may have different opinions though. Any improvements to DA in general would be excellent, and it has a lot of room for improvement. Dave From: Bardia Mahjour Sent: 22 May 2019 18:09 To: David Green Cc: Doerfert, Johannes; llvm-dev at lists.llvm.org; nd Subject: Re: Re: [llvm-dev] Delinearization validity checks in DependenceAnalysis   Hi David, Sorry for my delayed response. > There are already some function like isKnownPredicate that atte...

Hello Under the proviso that it's been a while since I looked into any of these things... On 05/15, Bardia Mahjour via llvm-dev wrote: > I also get correct results for my example (for a 64-bit target) if the upper > bounds are changed to unsigned. The reason is simply because clang zero-extends > `m` for address calculations but sign-extends it for the loop upper bound. This > prevents SCEV...

...the new pass manager interface is going to replace the old one soon. However, it is not clear to me if anyone is actively working on it and if so what is the timeline. Does anyone have more information about that? I was also wondering if any of the buildbots test with the NPM pipeline? Regards, Bardia Mahjour Compiler Optimizations IBM Toronto Software Lab bmahjour at ca.ibm.com (905) 413-2336 -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20190627/263fb111/attachment.html>

...ourse welcome. If you are interested in loop optimizations and would like to participate, we invite you to check your preferred date and time at https://doodle.com/poll/7xnkrkmap4dkxwyx . Once we agreed on a time, we will send out an invite to a WebEx conference. Looking forward to your feedback, Bardia Mahjour (IBM), Hal Finkel (Argonne National Lab), Johannes Doerfert (Argonne), Michael Kruse (Argonne)

Agenda for the meeting of July 15 @ 11:00 am (EST): - Loop-Hierachical IR Representation Design (Michael Kruse) - Status Updates -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200713/44b826a0/attachment.html>

...and experiment? This could also help us improve LIT tests, since some of them have been pessimised to compensate for DA's inability to delinearize, and could fail to catch regressions as a result of bad changes to the data dependence analysis. Looking forward to your help on this. Thank you, Bardia Mahjour Compiler Optimizations Hydra Squad Lead IBM Toronto Software Lab bmahjour at ca.ibm.com (905) 413-2336 -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20190513/3607186d/attachment.html>

[CC bollu, mferguson, shil] Am Do., 23. Mai 2019 um 17:13 Uhr schrieb Bardia Mahjour < bmahjour at ca.ibm.com>: > Thanks David and Michael for the clarification. > > I think I understand the rational behind those checks in delinearization > now. > > > Some other languages have stronger guarantees about their array > dimensions accesses being i...

Hi all, I am trying to use the dependence analyzer in a pass that I am writing and I was surprised to see an incorrect behavior when I try to query DependenceInfo for dependences between instructions. Specifically, if the two instructions are loads/stores accessing an array in a loop, the depend() method would return a dependence regardless of the order of instructions specified. (i.e. if the two

...or Directive (or Pragmas) Representation. Specification Draft v0.9, Intel Corporation, 2016. Acknowledgements ================ We would like to thank Chandler Carruth (Google), Johannes Doerfert (Saarland Univ.), Yaoqing Gao (HuaWei), Michael Wong (Codeplay), Ettore Tiotto, Carlo Bertolli, Bardia Mahjour (IBM), and all other LLVM-HPC IR Extensions WG members for their constructive feedback on the LLVM framework and IR extension proposal. Proposed Implementation ======================= Two sets of patches of supporting these experimental intrinsics and demonstrate the usage are ready fo...

...e for Directive (or Pragmas) Representation. Specification Draft v0.9, Intel Corporation, 2016. Acknowledgements ================ We would like to thank Chandler Carruth (Google), Johannes Doerfert (Saarland Univ.), Yaoqing Gao (HuaWei), Michael Wong (Codeplay), Ettore Tiotto, Carlo Bertolli, Bardia Mahjour (IBM), and all other LLVM-HPC IR Extensions WG members for their constructive feedback on the LLVM framework and IR extension proposal. Proposed Implementation ======================= Two sets of patches of supporting these experimental intrinsics and demonstrate the usage are ready for c...

...l Corporation, >> 2016. >> >> >> Acknowledgements >> ================ >> We would like to thank Chandler Carruth (Google), Johannes Doerfert >> (Saarland >> Univ.), Yaoqing Gao (HuaWei), Michael Wong (Codeplay), Ettore Tiotto, >> Carlo Bertolli, Bardia Mahjour (IBM), and all other LLVM-HPC IR >> Extensions WG >> members for their constructive feedback on the LLVM framework and IR >> extension >> proposal. >> >> Proposed Implementation >> ======================= >> >> Two sets of patches of sup...

...e for Directive (or Pragmas) Representation. Specification Draft v0.9, Intel Corporation, 2016. Acknowledgements ================ We would like to thank Chandler Carruth (Google), Johannes Doerfert (Saarland Univ.), Yaoqing Gao (HuaWei), Michael Wong (Codeplay), Ettore Tiotto, Carlo Bertolli, Bardia Mahjour (IBM), and all other LLVM-HPC IR Extensions WG members for their constructive feedback on the LLVM framework and IR extension proposal. Proposed Implementation ======================= Two sets of patches of supporting these experimental intrinsics and demonstrate the usage are ready for c...