search for: mahlk

...The algorithm implemented in LLVM can handle the if(???){do something} and if(???){do something}else{do something else} case very well. But it can handle complicated case like when there are a lot of gotos in the program. The more systematic way to do if-conversion is based on Hyperblock [Scott A. Mahlke et al 1992] <http://www.eecs.umich.edu/eecs/about/articles/2015/p45-mahlke.pdf>, which is set of basic blocks with one entrance and one or more exits. The algorithms now implemented in LLVM is very easy to understand, and very easy to implement. But it is not general, and it might not genera...

> So I am wondering if llvm can produce hyperblock easily,can anyone ^^^^^^^^^^ Do you mean the one mentioned in the paper below? http://www.eecs.umich.edu/~mahlke/papers/1992/mahlke_micro92.pdf Regards, chenwj -- Wei-Ren Chen (陳韋任) Computer Systems Lab, Institute of Information Science, Academia Sinica, Taiwan (R.O.C.) Tel:886-2-2788-3799 #1667

Hi guys, I am new for llvm,and I want to write a backend for TRIPS arch. So I am wondering if llvm can produce hyperblock easily,can anyone help? Any tips are welcomed. Thank you ! wangwentao , HIT -------------- next part -------------- An HTML attachment was scrubbed... URL:

...we also absolutely need predication. I extended the IfConversion pass to allow it to be executed multiple times and to predicate already predicated code. This is necessary to predicate code with nested conditional statements. At this point, we support or, and, and conditional predicates (see Scott Mahlke's papers on this issue) as supported by the OpenIMPACT compiler (=Trimaran). If anyone is interested, I can show some of the code. It is rather ad-hoc, however, so it is not at all ready for integration in the trunk (I think). The problem we are still facing is that this predication works po...

...referenced by a phi node will have an assignment to that variable before branching. There are techniques to make the resultant code more efficient, see Cytron et al.[1]. [1] "Efficiently computing static single assignment form and the control dependence graph" http://www.eecs.umich.edu/~mahlke/583w03/reading/cytron_toplas_91.pdf On Wed, Aug 31, 2011 at 2:06 AM, Teemu Rinta-aho <teemu.rinta-aho at nomadiclab.com> wrote: > On 30.8.2011, at 19.19, Eli Friedman wrote: > >> reg2mem won't do quite this transformation... not sure exactly what you need. > > I need t...

Hi, Are you guys interested in implementing if-conversion as a GSoC 2015 project? Last year, I did a literature review about approaches of if-conversion and the if-conversion in LLVM. This was the undergraduate thesis of my bachelor degree. It seems that, the if-conversion used in LLVM is a very simple approach instead of following the literature. So I want to implement the approaches in the

On 30.8.2011, at 19.19, Eli Friedman wrote: > reg2mem won't do quite this transformation... not sure exactly what you need. I need to get rid of phis. This code is compiled from C++ and for some functions there are no phis, but multiple call instructions. I am targeting hardware in the end, and the next tool reading the IR does not like phis when it's generating VHDL. My questions may

...we also absolutely need predication. I extended the IfConversion pass to allow it to be executed multiple times and to predicate already predicated code. This is necessary to predicate code with nested conditional statements. At this point, we support or, and, and conditional predicates (see Scott Mahlke's papers on this issue) as supported by the OpenIMPACT compiler (=Trimaran). If anyone is interested, I can show some of the code. It is rather ad-hoc, however, so it is not at all ready for integration in the trunk (I think). > I would be interested in looking at the code, since Southern...

...r VLIWs. We think superblock can has multiple outputs, so we want to somehow put basic block together and not only these one, which has single predecessor. The basic goal is create superblock by using branch target expansion, loop peeling, loop unrolling (from article http://www.eecs.umich.edu/~mahlke/papers/1993/hwu_jsuper93.pdf) to get as big superblock as it will be possible. After, in llc will be special scheduler and it will work with these superblocks. Finally, we decided to extend basic block class with information (can be simply integer value) to which superblock basic block belongs....

Hi, On Fri, Jun 4, 2010 at 5:18 AM, Pekka Nikander <pekka.nikander at nomadiclab.com> wrote: >  Would the best way be to add an option to -loop-unroll, and hack away at lib/Transforms/Utils/LoopUnroll.cpp? Instead, the better alternative is to write another pass similar to LoopUnrollPass.cpp (say LoopPeelPass.cpp) and add new option -loop-peel. The new pass could use llvm::UnrollLoop()

...06 PM, 陳韋任 <chenwj at iis.sinica.edu.tw> wrote: > > So I am wondering if llvm can produce hyperblock easily,can > anyone > ^^^^^^^^^^ > Do you mean the one mentioned in the paper below? > http://www.eecs.umich.edu/~mahlke/papers/1992/mahlke_micro92.pdf > > Regards, > chenwj > > -- > Wei-Ren Chen (陳韋任) > Computer Systems Lab, Institute of Information Science, > Academia Sinica, Taiwan (R.O.C.) > Tel:886-2-2788-3799 #1667 > -------------- next part -------------- An HTML attachment was s...

...VLIWs. > We think superblock can has multiple outputs, so we want to somehow put basic block together and not only these one, which has single predecessor. The basic goal is create superblock by using branch target expansion, loop peeling, loop unrolling (from article http://www.eecs.umich.edu/~mahlke/papers/1993/hwu_jsuper93.pdf) to get as big superblock as it will be possible. After, in llc will be special scheduler and it will work with these superblocks. > Finally, we decided to extend basic block class with information (can be simply integer value) to which superblock basic block belong...

On Sep 4, 2012, at 9:05 AM, Tomas Minac <minac.tomas at gmail.com> wrote: > > Hello, > > I am member of research team on our Faculty of Information Technology (university VUT in Brno Czech Republic). We use LLVM for many projects and actually we want to create system, which will be able compile and profile aplication for VLIW processors in few iterations. > We want to load

...ttending now. *** 8. References* [1] Andreas Neustifte, *Efficient Profiling in the LLVM Compiler Infrastructure*, 2010 [2] Matthew Arnold, Stephen Fink, Vivek Sarkar, Peter F. Sweeney, *A Comparative Study of Static and Profile-Based Heuristics for Inlining*, 2000 [3] Pohua P. Chang, Scott A. Mahlke, William Y. Chen, Wen-Mei W. Hwu,*Profile-guided Automatic Inline Expansion for C Programs*, 1992 [4] Karl Pettis, Robert C. Hansen, *Profile Guided Code Positioning*, 1990 -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev...

Hello, I am member of research team on our Faculty of Information Technology (university VUT in Brno Czech Republic). We use LLVM for many projects and actually we want to create system, which will be able compile and profile aplication for VLIW processors in few iterations. We want to load profile information in 'opt' part of LLVM and use it for create superblocks. Note, when

I am working on heavily optimising unusually static C++ code, and have encountered a situation where I basically want an optimiser that would speculatively unroll a loop to see if the first round of the loop could be optimised further. (I happen to know that it is possible.) The previous optimisations that produce the loop in the first place already do a magical job (relying heavily on constant