similar to: [LLVMdev] Function name changes in .bc on running llvm-g++

On 6/3/11 9:55 PM, Malveeka Tewari wrote: > Hi > > I am running llvm-g++ on a .cpp file to generate the llvm bitcode. > > The function definition in the .cpp file is: > > float pFL(Points *points, int *feasible, int numfeasible, float z, long *k, > double cost, long iter, float e, int pid, pthread_barrier_t* > barrier) { > > However, in the bit code I see

Hi I have the followed code for which I am writing a loop pass. int main() { int i = 0; for (i=0; i<20; i++) { printf ("hello world %d\n", i); } return 0; } In the function runOnLoop, I have the following instruction PHINode *indv = NULL; indv = L->getCanonicalInductionVariable(); However, when I check indv is always set to NULL. Since the code has a canonical

Hi I am trying to write up a transformation for the following code where instead of incrementing the loop variable by 1, I increment it by 2 ie. for (i=0; i < THRES; *i++*) { //do something } gets transformed to for (i=0; i < THRES; *i+=2*) { //do something } I am thinking of transforming the llvm bit-code in the following way. Iterate over the function for the original code till I

Malveeka, You can use the LoopInfo analysis to find the induction variable. http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c Cheers, Nadav From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Malveeka Tewari Sent: Thursday, May 05, 2011 14:51 To: llvmdev at cs.uiuc.edu Subject: [LLVMdev] Loop transformations

Hi, What does your LLVM IR look like. Are you sure the loop hasnt been optimized away? Arushi On Sat, May 21, 2011 at 5:52 PM, Malveeka Tewari <mtewari at eng.ucsd.edu>wrote: > Hi > > I have the followed code for which I am writing a loop pass. > > int main() { > int i = 0; > for (i=0; i<20; i++) { > printf ("hello world %d\n", i); > }

On May 5, 2011, at 5:11 AM, Rotem, Nadav wrote: > Malveeka, > > You can use the LoopInfo analysis to find the induction variable. > > http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c > > Cheers, > Nadav getCanonicalInductionVariable is a good example of finding IVs without iterating over instructions. But you may need to

Hello, I have a samba server which has a directory with 11764 files. (The program stores information about jobs and each job has 3 files, nothing I can do about it). When I do a listing of that directory using smbclient, it takes 15+ seconds to complete, same thing on Windows XP. Does anyone have any ideas on how I can speed this up? I did a log on log level 10, it is accessible at

Forwarding to list :) ~Will ---------- Forwarded message ---------- From: Malveeka Tewari <mtewari at eng.ucsd.edu> Date: Sun, May 22, 2011 at 12:38 AM Subject: Re: [LLVMdev] getCanonicalInductionVariable To: willdtz at gmail.com Adding -mem2reg fixed the problem ! Thanks a lot! Malveeka On Sat, May 21, 2011 at 9:47 PM, Will Dietz <willdtz at gmail.com> wrote: > > Also, make

Hallo! Is there a package in R that does Q-type factor analysis? I know how to do principal component analysis, but haven't found any application of Q-type factor analysis. Thx, Julia -- Psssst! Schon vom neuen GMX MultiMessenger geh?rt? Der kanns mit allen: http://www.gmx.net/de/go/multimessenger

On Wed, Feb 3, 2016 at 6:27 AM, Dmitrii Kuvaiskii < Dmitrii.Kuvaiskii at tu-dresden.de> wrote: > I continue playing with Intel MPX and its support in modern compilers. > All experiments were done on the Alienware (Dell) 15 R2, Ubuntu 15.10 > (linux 4.2.0), gcc version is 5.2.1, icc version 2016.1.150. The > benchmark suite is PARSEC 3.0, all versions with 1 thread and default

Hi I want to write a LLVM pass that transforms loops only if they belong to certain special functions. Right now I have a pass that can transform loops as I intend, but I do not know how to check if the loop is actually contained in one of the special functions. Is there a way to identify the function to which a particular loop belongs ? I am not sure if my pass should implement both runOnLoop

From here: http://parsec.cs.princeton.edu It is open-source and redistributable, and I have added LICENSE.TXT files to all the pieces I want to merge. These are blackscholes, canneal, dedup, fluidanimate, freqmine, streamcluster, and swaptions. I will disable the tests by default on the initial merge and test thoroughly on Linux and MacOS before enabling them. May I please commit my

Hi I am pinging to find out if there is any interest to mentor this proposal for GSoC this year? I've submitted a draft via the GSoC website. David, Vedant it would be great if I could get some advice on refining the goals and particulars of the implementation. The version we use internally is not performance oriented and will require refactoring. Here is a link to the draft document [1].

Hi David, > Are the data below all collected when only one function is picked for > instrumentation? Yes, here is a list of the benchmarks and selected functions. +-----------------+----------------------------------------------------------------------------------------------+ | blks | _Z19BlkSchlsEqEuroNoDivfffffif |

Patrick, On Jul 20, 2010, at 1:18 AM, Patrick Simmons wrote: > It is open-source and redistributable, and I have added LICENSE.TXT > files to all the pieces I want to merge. These are blackscholes, > canneal, dedup, fluidanimate, freqmine, streamcluster, and swaptions. I > will disable the tests by default on the initial merge and test > thoroughly on Linux and MacOS before

Hi David, > Hi Snehasish, thanks for writing up the proposal. > > As it stands today, path profiling still has serious scalability issue that > prevents it from being usable by any optimization passes that may benefit > from it. I agree; it would be an interesting to see how we can reduce the overheads to bring it within acceptable limits. > It will be interesting to see how

Hi Snehasish, thanks for writing up the proposal. As it stands today, path profiling still has serious scalability issue that prevents it from being usable by any optimization passes that may benefit from it. On the other hand, sampling based approach can still be promising. For instance, LBR can potentially together with static CFG constructed from the binary can be used to form path(let)

Hi, on https://wiki2.dovecot.org/Plugins/LastLogin the link to the new documentation page is wrong and leads to a 404. The correct link is https://doc.dovecot.org/plugin-settings/last-login-plugin/ . I tried correcting it myself in the wiki, but the Captcha was too hard for me. Cheers, Mika

On Thu, Feb 4, 2016 at 4:59 AM, Dmitrii Kuvaiskii < Dmitrii.Kuvaiskii at tu-dresden.de> wrote: > >> Recently I played with MPX support on Intel C/C++ Compiler (icc). This > >> implementation looks *much* better, with the following example > >> overheads: 1.2X on "raytrace", 1.25X on "bodytrack", 1.08X on > >> "streamcluster".

Hi Tim, Thanks for the patch. I had a few questions though - just to make sure that I get the problem correctly. Currently, here is your flow, as I understand it : x86 llvm-gcc binary llc -march=sparc gcc cross/sparc source ---------------------> .bc ------------------> .s -----------------> sparc executable. Is this correct? Or did you manage to build the