similar to: [LLVMdev] Comparison of optimizations

Is anybody using the google heap profiler to analyze clang/llvm ?? http://google-perftools.googlecode.com/svn/trunk/doc/heapprofile.html If so, do you know how to modify the build scripts to enable that. Tia. Reed

On 11/11/2011 11:39 AM, Chandler Carruth wrote: > On Fri, Nov 11, 2011 at 11:36 AM, reed kotler <rkotler at mips.com > <mailto:rkotler at mips.com>> wrote: > > Is anybody using the google heap profiler to analyze clang/llvm ?? > > http://google-perftools.googlecode.com/svn/trunk/doc/heapprofile.html > > If so, do you know how to modify the build

This new option will allow to output function information in the same format as addr2line from binutils emits: ... 0xABCDEF01 T function_name_is_here ... This feature is useful to profile the code when it is run in JIT by external tools like valgrind and google-perftools. For example, google-perftools runs addr2line on executable and uses the resulting file to resolve memory addresses to

This new option (--jit-emit-debug-function-range) will allow to output function information for memory ranges that functions occupy in memory while they run in JIT. File format generated is like this: ... 0x5000000 0x5001000 function_name_is_here ... This feature is useful for external tools like valgrind and google-perftools to profile the code when it is run in JIT. Particularly

On Fri, Nov 11, 2011 at 11:36 AM, reed kotler <rkotler at mips.com> wrote: > Is anybody using the google heap profiler to analyze clang/llvm ?? > > http://google-perftools.googlecode.com/svn/trunk/doc/heapprofile.html > > If so, do you know how to modify the build scripts to enable that. > > Tia. I have tried to use this in the past without terribly much success.

Have you found http://llvm.org/docs/DebuggingJITedCode.html? The JIT already has support for something like this for gdb's benefit. Perftools and valgrind just don't know how to find it yet. On Sat, Jun 19, 2010 at 2:03 PM, Yuri <yuri at rawbw.com> wrote: > This new option (--jit-emit-debug-function-range) will allow to output > function information for memory ranges that

In order to avoid a cross post, the following background quote is from SCIENTIFIC-LINUX-USERS at fnal.gov: <quote> On Wed, Feb 9, 2011 at 11:27 AM, Ewan Mac Mahon <ewan at macmahon.me.uk> wrote: > > I'm a little bit hazy on the details, but there are some slides from the > meeting here[1]: >

On Fri, Nov 11, 2011 at 11:45 AM, reed kotler <rkotler at mips.com> wrote: > ** > On 11/11/2011 11:39 AM, Chandler Carruth wrote: > > On Fri, Nov 11, 2011 at 11:36 AM, reed kotler <rkotler at mips.com> wrote: > >> Is anybody using the google heap profiler to analyze clang/llvm ?? >> >>

On 06/19/2010 14:14, Jeffrey Yasskin wrote: > Have you found http://llvm.org/docs/DebuggingJITedCode.html? The JIT > already has support for something like this for gdb's benefit Yes, I saw it and tried it. -jit-emit-debug generates ELF image in memory with debug info. Another option -jit-emit-debug-to-disk creates .o ELF files with debug info, one per function. If there are thousands

I'm asking here, rather than R-devel, because it seems to be a Linux specific question and because I'm using Ubuntu-9.04. I'm trying to profile an package, and got errors, so I decided to follow BDR's (http://tolstoy.newcastle.edu.au/R/devel/06/02/4254.html) example exactly, and got same problem. Can anyone replicate? $ sudo mkdir -p /var/tmp//usr/lib/R/library/stats/libs $

The file src/share/replaygain_synthesis/include/private/fast_float_math_hack.h redefines 'tanh' as 'tanhf'. This file is intended for Intel Compiler only, but it includes outdated mathf.h and doesn't work with current versions of ICC. The fixes are trivial though, and I compiled 2 versions of flac.exe: with this 'hack' turned off an on. The difference in decoding speed

On 06/19/2010 14:03, Yuri wrote: > This new option (--jit-emit-debug-function-range) will allow to output > function information for memory ranges that functions occupy in memory > while they run in JIT. File format generated is like this: > ... > 0x5000000 0x5001000 function_name_is_here > ... > > This feature is useful for external tools like valgrind and >

Hi, I recently spent quite a bit of time trouble shooting a function that I had written only to discover that the problem I was having was with the comparison operator. I assumed that the following would return TRUE: > testMean <- 82.8 + 0.1 > testMean [1] 82.9 > testMean == 82.9 [1] FALSE Apparently this has to do with deciml places. Look: > newTest <- 82.0 > newTest [1]

On Jun 18, 2010, at 3:29 AM, Yuri wrote: > Now I see that JITted code doesn't have standard prolog, on x86 each > procedure instead begins with 'sub $0x4,%esp'. > > Is there an option to make JIT generate regular prologs? Try turning off frame pointer elimination. On the llc command line, this is -disable-fp-elim -Chris > > Yuri >

On Sat, Jun 19, 2010 at 4:35 AM, Chris Lattner <clattner at apple.com> wrote: > > On Jun 18, 2010, at 3:29 AM, Yuri wrote: > >> Now I see that JITted code doesn't have standard prolog, on x86 each >> procedure instead begins with 'sub    $0x4,%esp'. >> >> Is there an option to make JIT generate regular prologs? > > Try turning off frame

On Wed, Oct 2, 2019 at 8:41 PM Maksim Panchenko via llvm-dev < llvm-dev at lists.llvm.org> wrote: > *Pessimization/overhead for stack unwinding used by system-wide profilers > and > for exception handling* > > Larger CFI programs put an extra burden on unwinding at runtime as more CFI > (and thus native) instructions have to be executed. This will cause more > overhead

On 07/26/2016 06:23 PM, Liang Li wrote: > + for_each_migratetype_order(order, t) { > + list_for_each(curr, &zone->free_area[order].free_list[t]) { > + pfn = page_to_pfn(list_entry(curr, struct page, lru)); > + if (pfn >= start_pfn && pfn <= end_pfn) { > + page_num = 1UL << order; > + if (pfn + page_num > end_pfn) > + page_num =

On 07/26/2016 06:23 PM, Liang Li wrote: > + for_each_migratetype_order(order, t) { > + list_for_each(curr, &zone->free_area[order].free_list[t]) { > + pfn = page_to_pfn(list_entry(curr, struct page, lru)); > + if (pfn >= start_pfn && pfn <= end_pfn) { > + page_num = 1UL << order; > + if (pfn + page_num > end_pfn) > + page_num =

Olly Betts <olly at survex.com> wrote: > The report you show seems to be just the time take by each function > directly rather than including functions it calls. It looks like a lot > of the time is spent in cursor movement, as totalling up things that > seem like they'd be due to that I quickly get to 40+% but it's hard > to tell if that's about the actual total

Hi all, in my search for a nice binary2decimal method, I received this nice code (thanx to Uwe Ligges): bindec <- function(b) sum(as.integer(unlist(strsplit(b, ""))) * 2^(floor(log10(b)):0)) It fails, however, with: > bindec(1000) [1] 4 Warning message: longer object length is not a multiple of shorter object length in: as.integer(unlist(strsplit(b, "")))