similar to: Multidimensional correlation matrix question

I have a doubt. This is an excerpt of the raw report I get after running Spec benchmarks through llvm-test.I am trying to calculate the program execution time.Does the output result in bold corresponds to "lli time" in Makefile.spec ? I am not interested in llc, jit or cbe.I simply need the normal bytecode and native code execution times after running my pass over them.I have modified

On Sun, 4 Sep 2005, Tanu Sharma wrote: > > I have a doubt. > > This is an excerpt of the raw report I get after running Spec benchmarks > through llvm-test.I am trying to calculate the program execution > time.Does the output result in bold corresponds to "lli time" in > Makefile.spec ? I am not interested in llc, jit or cbe.I simply need the > normal

From: Tanu Kaskinen <tanu.kaskinen at linux.intel.com> Not everyone who includes speexdsp_config_types.h will have a test which defines those, and if we've chosen to use the stdint types at configure time then we know exactly which header(s) are available, so just choose the best one then and generate the header to use it. This patch, including the above text, is copied from a commit

On Tue, 30 Nov 2004, Tanu Sharma wrote: > I have trouble using the llvm tools.Some of the errors are : > > $ llvm-dis prog.bc > $ llvm-dis: Invalid Top Level Block Length! Type:1, Size:456 (Vers=0, Pos=12) Can you explain how you generated this bytecode file? It looks corrupted or something. Also, can you send the actual bytecode file itself? Thanks! -Chris >

Thanks for the reply. I wish to compile without optimizations ( the option being turned off ) but still generate bytecode file. Options -S , -c removes optimizations but I also need .bc file to experiment and use further. How should I do it? Thanks -TS Chris Lattner <sabre at nondot.org> wrote: On Sat, 23 Apr 2005, Tanu Sharma wrote: > I got very useful replies from dev list

if i were to have a block size of 4 people and i want to assign a treatment combination to the entire block, there would be 16 different treatment combinations (TTTT, TTTP, TTPP, PTTP, etc.) i am trying to get all 16 permutations and i am able to use this code below. drugs=c('P','T'); comb=expand.grid(drugs,drugs,drugs,drugs) for a block size of 3 the code would be

I would try that ..Thanks Another thing that I want to do is to randomize functions within a program (or file ), whatever is easier to do in llvm .Also please tell me how can I randomize global variables ? Thanks TS Chris Lattner <sabre at nondot.org> wrote: On Mon, 30 May 2005, Tanu Sharma wrote: > I have been trying to compile the SPEC benchmark but have failed even > after

On Thu, 17 Feb 2005, Tanu Sharma wrote: > I created a new block and inserted it into the present basic block list > , but I get this error: > > opt: BasicBlock.cpp:83: virtual llvm::BasicBlock::~BasicBlock(): Assertion `getParent() == 0 && "BasicBlock still linked into the program!"' failed. > > The program completes its task and i get this in the end. I am

Tanu Sharma wrote: > Hello, > > In an attempt to randomise the basic blocks in a function, is it > possible that I can randomise the entry block as well? And maybe insert > some instructions in the pass to call entry block while running the > program ? > > Is it feasible? > > What does entry block consist of ? The entry block, by definition, is the first basic

??????????????? i dont understand. On 8/5/05, Siegel, Joerg <JSiegel@tunstall.de> wrote: > > > Ich bin am 9.8. wieder im Hause! > > Mit freundlichen Gr??en, > > J?rg Siegel.

This is exactly what i m trying : opt -load /home/tsharma/ankur/llvm/Debug/lib/LLVMHello.so -hello <helloprog.bc> /dev/null Tanu Chris Lattner <sabre at nondot.org> wrote: On Wed, 9 Mar 2005, Tanu Sharma wrote: > I wrote a pass which randomizes basic blocks and insert new block.But > when i run another pass over it which simply lists all basic blocks I > don't get

On Sat, 2005-02-26 at 22:34 -0600, Chris Lattner wrote: > On Sat, 26 Feb 2005, Tanu Sharma wrote: > > > Thanks for the reply :-) > > I am actually looking for ways to determine "size" of code segment when the program is in native code. > > Any suggestions to do that ? > > Compile it with llvm to a native .o or .exe file, then run 'size' on it? >

On Mon, 25 Apr 2005, Tanu Sharma wrote: > Thanks for the reply. > > I wish to compile without optimizations ( the option being turned off ) > but still generate bytecode file. > > Options -S , -c removes optimizations but I also need .bc file to > experiment and use further. Passing "-Wa,-disable-opt -Wl,-disable-opt" will disable *all* cleanup and optimizations

Thanks !! But if i generate a .bc file like this and then run my pass over it like this : opt -load /home/llvm-cvs/llvm/Debug/lib/LLVMHello.so -hello <helloprog.bc> class_prog.bc Will the new .bc file (class_prog.bc) be also without optimizations ?opt also does some optimizations.Can I control them ? Thanks Tanu Chris Lattner <sabre at nondot.org> wrote: On Mon, 25 Apr 2005,

Hello Tristan, Thank you. But I am using libspeex library. Does the speexdsp library be included in it? Or it needs to be installed separate. Appreciate the help. Thanks, Ankhit On Thu, Aug 20, 2015 at 11:43 AM, Tristan Matthews <tmatth at videolan.org> wrote: > Hi Ankhit, > > On Thu, Aug 20, 2015 at 12:06 PM, Ankhit Vivekananda < > ankhit.vivekananda at biscotti.com>

Thanks for replying, Yes, I think too that the bytecode file is corrupted. This is the file : -------------------------------------------------------------------------------------------------------------------------

On Mon, 7 Feb 2005, Tanu Sharma wrote: > I have been trying to randomize blocks in a program and modified > "BasicBlockPlacement.cpp" for the purpose but getting segmentation > fault.I am not able to determine the problem.Can anyone please decrypt > these error messages or suggest what might be the possible cause of > failure? I'd be happy to fix this, but I need

Thanks a lot for replying...but I am not doing any deleting or removing node ...I am trying to insert a "new" entry node in an existing list. In another reply I understood (also mentioned on the site) that no other block can branch to the entry block. How do I achieve this ? Is it feasible?Let me know if there is any example. Thanks again, Tanu Chris Lattner <sabre at

Thanks for the reply, Actually I m aiming towards determining two values: - number of basic blocks in a program For this I have used Statistic facility provided in llvm and increasing the counter for each basic block for each function.but for some reason , I m getting different number everytime !! Is Statistic is the right way to do it ? - Average basic block size in a program ( in bytes)

Thanks for the reply :-) I am actually looking for ways to determine "size" of code segment when the program is in native code. Any suggestions to do that ? Tanu Chris Lattner <sabre at nondot.org> wrote: On Fri, 25 Feb 2005, Tanu Sharma wrote: > > Hey, > > I have written a pass and wishes to measure its performance overhead > after running it over a