similar to: [LLVMdev] LLVM beginner question

Murali, Please send LLVM questions to llvmdev at cs.uiuc.edu . On Mon, Jul 25, 2005 at 02:41:10PM -0400, Murali Krishna Nethi wrote: > Thanks for your reply. I was able to download llvm-tv using the > directions that you had provided to me. > > I have read the whole documentation of llvm yet, have simple question > about llvm. > > I was trying to analyse a simple hello.c

Hi, Question I had was if someone has tried executing Mibench or Mediabench benchmarks using llvm. I am trying to do simple qsort benchmark in the Mibench benchmark suite. I substituted llvmc instead of gcc in the makefiles. But I am getting the following error. "llvmc qsort_small.c -O3 -o qsort_small -lm llvmc: Configuration file for 'c' is not available. make: *** [qsort_small]

Hi, I am trying to obtain basic block profiles for mediabench g721 benchmark. I have successfully built llvm in profile_enabling mode. Then so as to find out the block execution frequency, I ran the command, analyze encode.out-cbe. It generated gmon.out which I read using gprof. However, I did not get the basic block level execution frequency. Can anybody help me as to how I can extract the basic

Patrick Simmons wrote: > Hello, > > I'm trying to print the instruction count of a bytecode file using the > 2.4 release of LLVM. I found llvm-2.4/lib/Analysis/Instcount.cpp but > I'm not sure what to do with it. I also looked at llvm-bcanalyzer. The > documentation says this command is supposed to print the instruction > count in the summary, but it doesn't

Thanks a lot Chris. Regarding basic block size I wish to calculate both: - The number of bytecode bytes - The number of machine code bytes for some target? TS Chris Lattner <sabre at nondot.org> wrote: On Thu, 7 Apr 2005, Tanu Sharma wrote: > Thanks for the reply, > > Actually I m aiming towards determining two values: > > - number of basic blocks in a program For

There is actually only one hardware, but with a lot of so called "profiles". For example, there are totally 32 hardware registers available, but the three profiles, namely: * Low register usage profile - use 8 registers at most * Medium register usage profile - use 16 registers at most * High register useage profile - use 32 registers at most I could define a "TablGen target"

Hello, I'm trying to print the instruction count of a bytecode file using the 2.4 release of LLVM. I found llvm-2.4/lib/Analysis/Instcount.cpp but I'm not sure what to do with it. I also looked at llvm-bcanalyzer. The documentation says this command is supposed to print the instruction count in the summary, but it doesn't seem to be doing so. Does anyone know what I should be

I am beginner for this Rails from the past 2 days I am working hard to fix the following error C:\Murali Rubby\demo\library>rake db:migrate --trace (in C:/Murali Rubby/demo/library) ** Invoke db:migrate (first_time) ** Invoke environment (first_time) ** Execute environment ** Execute db:migrate == CreateBooks: migrating ==================================================== --

There’s a few passes in LLVM that make heavy use of a big DenseMap, one that potentially gets filled with up to 1 entry for each instruction in the function. EarlyCSE is the best example, but Reassociate and MachineCSE have this to some degree as well (there might be others?). To put it simply: at least in my profile, EarlyCSE spends ~1/5 of its time growing DenseMaps. This is kind of… bad.

> On Mar 15, 2016, at 4:09 PM, Philip Reames <listmail at philipreames.com> wrote: > > > > On 03/15/2016 03:07 PM, via llvm-dev wrote: >> There’s a few passes in LLVM that make heavy use of a big DenseMap, one that potentially gets filled with up to 1 entry for each instruction in the function. EarlyCSE is the best example, but Reassociate and MachineCSE have this to

What should we use instead of DenseMap? —escha > On Mar 15, 2016, at 3:30 PM, Xinliang David Li <xinliangli at gmail.com> wrote: > > yes it makes sense. Avoid using DenseMap when the size of the map is expected to be large but can not be pre-determined. > > David > > On Tue, Mar 15, 2016 at 3:07 PM, via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at

> Hi All, > Attached above my InstCount.cpp after modification. I did simple > modification which is the following (The statements between the > ************** ) : > bool InstCount::runOnFunction(Function &F) { > unsigned StartMemInsts = > NumGetElementPtrInst + NumLoadInst + NumStoreInst + NumCallInst + > NumInvokeInst + NumAllocaInst; >

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)

Great! For the hotness, try creating a small test case with a very hot loop that iterates many times. Let me know if you are still having trouble. While the llvm-dis serialization is being discussed, I suppose at the very least this can go in with the rest of the existing YAML summary dumping and get emitted from llvm-lto2 using the patch Peter attached. Peter - do you want to add that to

It works! Now, is there a way to use this handler multiple times so different submenus can have different position values. -Aaron On Fri, 2 Apr 2004, ganapathy murali krishnan wrote: > You write your own menupos_handler (like in complex.c) and register the > handler. > > So all you need to do is to copy the code for the menupos_handler from > complex.c and modify it to suit

Here's some stuff that may be useful for your papers n stuph: * Analyze has a pass "-instcount" written by Dinakar, which will tell you things like the number of functions, basic blocks, and instructions are in a program. It will even classify the instructions into different opcodes, if you want to report things like #loads+#stores or something. * Most of the olden

Sorry to plague the list, but I think I got the answer. The following would do: > signalList <- list(tradingRules$Signal[tradingRules$Enabled]) [[1]] > length(signalList) [1] 2 Now my problem is shifted: I have the Signal column in the original data frame referring to actual matrices previously created in R. That is, bar_signal and cif_signal are extant matrices. What I need is the

Hi Nadav, Thanks for the response. I forgot to mention that there is an upper limit of 16 for the Trip Count check, TinyTripCountVectorThreshold = 16; if (TC > 0u && TC < TinyTripCountVectorThreshold). So right now, any loop with Trip Count as 0, or with value >=16, LV with unroll. With the change to the lower bound, it will also include the loop with 0 trip count. SCEV returns 0

But the win wks on the other subnet is configured to use my SAMBASERVER as its WINS SERVER, and it is configured using the IP Adress of the SAMBASERVER and not the name. Shouldn't this do the trick? win wks is on a wireless subnet and hence runs at 11 MBPS, while the SAMBASERVER is on a wired subnet. I read somewhere that windows does some kind of "optimization" with slow networks.

Hello, I am a newcomer to R and therefore apologize for posting such a basic question. I am trying to multiply 2 matrices t(X1)%*%X1, where t(X1) is: 1 2 3 4 5 8 12 13 20 24 26 27 31 33 34 36 37 40 41 42 45 46 47 48 49 ones 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Shadow 0 1 1 1 1 1 1 1 0 1 1 1 1 0 1 0