ruby-prof-0.16.2/0000755000175600017570000000000012766254554012606 5ustar pravipraviruby-prof-0.16.2/doc/0000755000175600017570000000000012766254554013353 5ustar pravipraviruby-prof-0.16.2/doc/README_rdoc.html0000644000175600017570000007366712766254554016230 0ustar pravipravi README - ruby-prof

ruby-prof ↑

Build Status

Overview ↑

ruby-prof is a fast code profiler for MRI Ruby. Its features include:

Requirements ↑

ruby-prof requires Ruby 1.9.3 or higher. Please note some ruby releases have known bugs which cause ruby-prof problems, like incorrect measurements. We suggest to use the latest minor patch level release if possible. In particular, on the 2.1 branch of ruby you should use at least 2.1.7.

If you are running Linux or Unix you'll need a C compiler so the extension can be compiled when it is installed.

If you are running Windows, then you may need to install the Windows specific RubyGem which includes an already built extension (see Install section).

Install ↑

The easiest way to install ruby-prof is by using Ruby Gems. To install:

gem install ruby-prof

If you're on windows then please install the devkit first so that it can compile.

Usage ↑

There are three major options for running ruby-prof: via the command line, via its convenience API or via its core API.

ruby-prof Executable ↑

The first is to use ruby-prof to run the Ruby program you want to profile. For more information refer to the documentation of the ruby-prof command.

ruby-prof Convenience API ↑

The second way is to use the ruby-prof convenience API to profile particular segments of code.

require 'ruby-prof'

# profile the code
RubyProf.start
# ... code to profile ...
result = RubyProf.stop

# print a flat profile to text
printer = RubyProf::FlatPrinter.new(result)
printer.print(STDOUT)

Alternatively, you can use a block to tell ruby-prof what to profile:

require 'ruby-prof'

# profile the code
result = RubyProf.profile do
  # ... code to profile ...
end

# print a graph profile to text
printer = RubyProf::GraphPrinter.new(result)
printer.print(STDOUT, {})

ruby-prof also supports pausing and resuming profiling runs.

require 'ruby-prof'

# profile the code
RubyProf.start
# ... code to profile ...

RubyProf.pause
# ... other code ...

RubyProf.resume
# ... code to profile ...
result = RubyProf.stop

Note that resume will only work if start has been called previously. In addition, resume can also take a block:

require 'ruby-prof'

RubyProf.resume do
  # ... code to profile...
end

result = RubyProf.stop

With this usage, resume will automatically call pause at the end of the block.

Profiling Selected Threads (Core API) ↑

The convenience API does not support running multiple profiles in separate threads concurrently, but the RubyProf::Profile API does. In fact, the convenience layer uses the Profile API internally. It all revolves around Profile objects:

RubyProf::Profile.new

Create a profile object given an options hash (see below)

The following options are available when creating Profile instances:

measure_mode

One of the defined measure modes

exclude_threads

Array of threads which should not be profiled.

include_threads

Array of threads which should be profiled. All other threads will be ignored.

merge_fibers

Whether profiling data for a given thread's fibers should all be subsumed under a single entry. Basically only useful to produce callgrind profiles.

RubyProf::Profile#start

Start profiling

RubyProf::Profile#pause

Pause profiling

RubyProf::Profile#resume

Resume profiling

RubyProf::Profile#stop

Stop profiling and return self

RubyProf::Profile#profile

Perform a profile run and return result. Accepts the same arguments as RubyProf::Profile.new.

Method Elimination ↑

ruby-prof supports eliminating specific methods and threads from profiling results. This is useful for reducing connectivity in the call graph, making it easier to identify the source of performance problems when using a graph printer.

For example, consider Integer#times: it's hardly ever useful to know how much time is spent in the method itself. We're much more interested in how much the passed in block contributes to the time spent in the method which contains the Integer#times call.

Methods are eliminated from the collected data by calling eliminate_methods! on the profiling result, before submitting it to a printer.

result = RubyProf.stop
result.eliminate_methods!([/Integer#times/])

The argument given to eliminate_methods! is either an array of regular expressions, or the name of a file containing a list of regular expressions (line separated text).

After eliminating methods the resulting profile will appear exactly as if those methods had been inlined at their call sites.

Profiling Rails ↑

To profile a Rails application it is vital to run it using production like settings (cache classes, cache view lookups, etc.). Otherwise, Rail's dependency loading code will overwhelm any time spent in the application itself (our tests show that Rails dependency loading causes a roughly 6x slowdown). The best way to do this is create a new Rails environment, profile.rb.

So to profile Rails:

  1. Create a new profile.rb environment. Make sure to turn on cache_classes and cache_template_loading. Otherwise your profiling results will be overwhelmed by the time Rails spends loading required files. You should likely turn off caching.

  2. Add the ruby-prof to your gemfile:

    group :profile do
  gem 'ruby-prof'
end

  3. Add the ruby prof rack adapter to your middleware stack. One way to do this is by adding the following code to config.ru:

    if Rails.env.profile?
  use Rack::RubyProf, :path => '/temp/profile'
end

    The path is where you want profiling results to be stored. By default the rack adapter will generate a html call graph report and flat text report.

  4. Now make a request to your running server. New profiling information will be generated for each request. Note that each request will overwrite the profiling reports created by the previous request!

Reports ↑

ruby-prof can generate a number of different reports:

Flat profiles show the overall time spent in each method. They are a good way of quickly identifying which methods take the most time. An example of a flat profile and an explanation can be found in examples/flat.txt.

There are several varieties of these - run ruby-prof --help

Graph profiles also show the overall time spent in each method. In addition, they also show which methods call the current method and which methods its calls. Thus they are good for understanding how methods gets called and provide insight into the flow of your program. An example text graph profile is located at examples/graph.txt.

HTML Graph profiles are the same as graph profiles, except output is generated in hyper-linked HTML. Since graph profiles can be quite large, the embedded links make it much easier to navigate the results. An example html graph profile is located at examples/graph.html.

Call graphs output results in the calltree profile format which is used by KCachegrind. Call graph support was generously donated by Carl Shimer. More information about the format can be found at the KCachegrind site.

Call stack reports produce a HTML visualization of the time spent in each execution path of the profiled code. An example can be found at examples/stack.html.

Another good example: twitpic.com/28z94a

Finally, there's a so called MultiPrinter which can generate several reports in one profiling run. See examples/multi.stack.html.

There is also a graphviz .dot visualiser.

Printers ↑

Reports are created by printers. Supported printers include:

RubyProf::FlatPrinter

Creates a flat report in text format

RubyProf::FlatPrinterWithLineNumbers

Same as above but more verbose

RubyProf::GraphPrinter

Creates a call graph report in text format

RubyProf::GraphHtmlPrinter

Creates a call graph report in HTML (separate files per thread)

RubyProf::DotPrinter

Creates a call graph report in GraphViz's DOT format which can be converted to an image

RubyProf::CallTreePrinter

Creates a call tree report compatible with KCachegrind

RubyProf::CallStackPrinter

Creates a HTML visualization of the Ruby stack

RubyProf::MultiPrinter

Uses the other printers to create several reports in one profiling run

To use a printer:

result = RubyProf.stop
printer = RubyProf::GraphPrinter.new(result)
printer.print(STDOUT, :min_percent => 2)

The first parameter is any writable IO object such as STDOUT or a file. The second parameter, specifies the minimum percentage a method must take to be printed. Percentages should be specified as integers in the range 0 to 100. For more information please see the documentation for the different printers.

The other option is :print_file => true (default false), which adds the filename to the output (GraphPrinter only).

MultiPrinter differs from the other printers in that it requires a directory path and a basename for the files it produces.

printer = RubyProf::MultiPrinter.new(result)
printer.print(:path => ".", :profile => "profile")

Measurements ↑

Depending on the mode and platform, ruby-prof can measure various aspects of a Ruby program. Supported measurements include:

RubyProf::WALL_TIME

Wall time measures the real-world time elapsed between any two moments. If there are other processes concurrently running on the system that use significant CPU or disk time during a profiling run then the reported results will be larger than expected.

RubyProf::PROCESS_TIME

Process time measures the time used by a process between any two moments. It is unaffected by other processes concurrently running on the system. Note that Windows does not support measuring process times.

RubyProf::CPU_TIME

CPU time uses the CPU clock counter to measure time. The returned values are dependent on the correctly setting the CPU's frequency. This mode is only supported on Pentium or PowerPC platforms (linux only).

RubyProf::ALLOCATIONS

Object allocation reports show how many objects each method in a program allocates. This support was added by Sylvain Joyeux and requires a patched Ruby interpreter. See below.

RubyProf::MEMORY

Memory usage reports show how much memory each method in a program uses. This support was added by Alexander Dymo and requires a patched Ruby interpreter. See below.

RubyProf::GC_TIME

Garbage collection time reports how much time is spent in Ruby's garbage collector during a profiling session. This support was added by Jeremy Kemper and requires a patched Ruby interpreter. See below.

RubyProf::GC_RUNS

Garbage collection runs report how many times Ruby's garbage collector is invoked during a profiling session. This support was added by Jeremy Kemper and requires a patched Ruby interpreter. See below.

Patching ruby ↑

All of the patches to Ruby are included in the railsexpress patchsets for rvm, see github.com/skaes/rvm-patchsets. You can also use these patches manually with other ruby managers (ruby-install, ruby-build, etc.).

Note if you rebuild your ruby with patches you must uninstall and reinstall the ruby-prof gem to take advantage of the new capabilities.

Measure modes ↑

To set the measurement:

RubyProf.measure_mode = RubyProf::WALL_TIME
RubyProf.measure_mode = RubyProf::PROCESS_TIME
RubyProf.measure_mode = RubyProf::CPU_TIME
RubyProf.measure_mode = RubyProf::ALLOCATIONS
RubyProf.measure_mode = RubyProf::MEMORY
RubyProf.measure_mode = RubyProf::GC_TIME
RubyProf.measure_mode = RubyProf::GC_RUNS

The default value is RubyProf::WALL_TIME.

You may also specify the measure mode by using the RUBY_PROF_MEASURE_MODE environment variable:

export RUBY_PROF_MEASURE_MODE=wall
export RUBY_PROF_MEASURE_MODE=process
export RUBY_PROF_MEASURE_MODE=cpu
export RUBY_PROF_MEASURE_MODE=allocations
export RUBY_PROF_MEASURE_MODE=memory
export RUBY_PROF_MEASURE_MODE=gc_time
export RUBY_PROF_MEASURE_MODE=gc_runs

On Linux, process time is measured using the clock method provided by the C runtime library. Note that the clock method does not report time spent in the kernel or child processes and therefore does not measure time spent in methods such as Kernel.sleep method. If you need to measure these values, then use wall time. Wall time is measured using the gettimeofday kernel method.

If you set the clock mode to PROCESS_TIME, then timings are read using the clock method provided by the C runtime library. Note though, these values are wall times on Windows and not process times like on Linux. Wall time is measured using the GetLocalTime API.

If you use wall time, the results will be affected by other processes running on your computer, network delays, disk access, etc. As result, for the best results, try to make sure your computer is only performing your profiling run and is otherwise quiescent.

Multi-threaded Applications ↑

Unfortunately, Ruby does not provide an internal API for detecting thread context switches. As a result, the timings ruby-prof reports for each thread may be slightly inaccurate. In particular, this will happen for newly spawned threads that go to sleep immediately (their first call). For instance, if you use Ruby's timeout library to wait for 2 seconds, the 2 seconds will be assigned to the foreground thread and not the newly created background thread. These errors can largely be avoided if the background thread performs any operation before going to sleep.

Performance ↑

Significant effort has been put into reducing ruby-prof's overhead as much as possible. Our tests show that the overhead associated with profiling code varies considerably with the code being profiled. Most programs will run approximately twice as slow while highly recursive programs (like the fibonacci series test) will run three times slower.

License ↑

See LICENSE for license information.

API Documentation ↑

The ruby-prof API documentation for the latest released gem version can be found here: www.rubydoc.info/gems/ruby-prof/

The ruby-prof API documentation for the master branch is available here: www.rubydoc.info/github/ruby-prof/ruby-prof/

Development ↑

Code is located at github.com/ruby-prof/ruby-prof

Google group/mailing list: groups.google.com/group/ruby-optimization or open a github issue.

ruby-prof-0.16.2/doc/created.rid0000644000175600017570000000352612766254554015470 0ustar pravipraviThu, 25 Aug 2016 10:46:44 +0200 bin/ruby-prof Sat, 02 Jan 2016 16:48:57 +0100 bin/ruby-prof-check-trace Sun, 10 Mar 2013 10:57:14 +0100 examples/flat.txt Sun, 06 Dec 2015 14:08:42 +0100 examples/graph.txt Fri, 17 Jun 2016 19:44:14 +0200 examples/graph.html Wed, 09 Dec 2015 16:14:34 +0100 lib/ruby-prof.rb Wed, 24 Aug 2016 21:59:47 +0200 lib/ruby-prof/aggregate_call_info.rb Tue, 08 Dec 2015 18:03:49 +0100 lib/ruby-prof/call_info.rb Sun, 13 Mar 2016 12:37:42 +0100 lib/ruby-prof/call_info_visitor.rb Sun, 22 Feb 2015 16:10:12 +0100 lib/ruby-prof/compatibility.rb Sun, 13 Mar 2016 20:28:59 +0100 lib/ruby-prof/method_info.rb Sun, 13 Mar 2016 17:39:57 +0100 lib/ruby-prof/printers/abstract_printer.rb Tue, 29 Jan 2013 16:43:39 +0100 lib/ruby-prof/printers/call_info_printer.rb Sun, 22 Feb 2015 16:10:12 +0100 lib/ruby-prof/printers/call_stack_printer.rb Thu, 23 Apr 2015 12:17:56 +0200 lib/ruby-prof/printers/call_tree_printer.rb Sun, 13 Mar 2016 17:39:57 +0100 lib/ruby-prof/printers/dot_printer.rb Sun, 13 Mar 2016 17:39:57 +0100 lib/ruby-prof/printers/flat_printer.rb Fri, 24 Apr 2015 08:23:15 +0200 lib/ruby-prof/printers/flat_printer_with_line_numbers.rb Sun, 15 Feb 2015 12:21:36 +0100 lib/ruby-prof/printers/graph_html_printer.rb Tue, 08 Dec 2015 17:40:05 +0100 lib/ruby-prof/printers/graph_printer.rb Wed, 09 Dec 2015 15:31:08 +0100 lib/ruby-prof/printers/multi_printer.rb Sun, 13 Mar 2016 17:39:57 +0100 lib/ruby-prof/profile.rb Sun, 13 Mar 2016 17:37:58 +0100 lib/ruby-prof/rack.rb Fri, 17 Jun 2016 20:01:16 +0200 lib/ruby-prof/task.rb Tue, 29 Jan 2013 16:43:39 +0100 lib/ruby-prof/thread.rb Sun, 13 Mar 2016 17:39:57 +0100 lib/ruby-prof/version.rb Thu, 25 Aug 2016 10:46:05 +0200 lib/unprof.rb Tue, 29 Jan 2013 16:43:39 +0100 ext/ruby_prof/ruby_prof.c Sun, 13 Mar 2016 20:27:23 +0100 README.rdoc Fri, 17 Jun 2016 20:01:16 +0200 LICENSE Tue, 20 May 2014 07:16:27 +0200 ruby-prof-0.16.2/doc/images/0000755000175600017570000000000012766254554014620 5ustar pravipraviruby-prof-0.16.2/doc/images/wrench.png0000644000175600017570000000114212766254554016612 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˕oQ_[c+W.]хi5  g mJ[Fq#_)qո;,@{;upLTʙH$(Z XMɤni"\nt:}yD 0 \ ږIU4(r HMk̈_4_ziy'"[ n1rM_A`b=$Ik_p-qS~=li~3Bv"qZAԧ̸r[G]<&e!'ڸ67 yq$OX!=_~1Gs~EZQx&qWK3!ޤunkzGrjQnIENDB`ruby-prof-0.16.2/doc/images/page_white_width.png0000644000175600017570000000046512766254554020646 0ustar pravipraviPNG  IHDR7gAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT(υA0E֕n\xqob♼ Rw(gIu2U5S6VXʲJ6YhlOe<Ƥj56S&5n2 ,be %,r[;zֳ X`<ƐdzB7|!A/n2=VY ro vZdIENDB`ruby-prof-0.16.2/doc/images/macFFBgHack.png0000644000175600017570000000031712766254554017343 0ustar pravipraviPNG  IHDRcsBIT|d pHYs  ~tEXtSoftwareAdobe Fireworks CS3FtEXtCreation Time7/16/07Z (IDATHA0!U[ GϱJJJJJJJJJYIENDB`ruby-prof-0.16.2/doc/images/plugin.png0000644000175600017570000000111712766254554016624 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˥=Hqf~\?,yoX{KC7PcM54EkS$8V*wJB%{s^1㪋g99IDp8ラ%w%I =@]mvbS?|b~?GժilT70p,@ۙܘ^Y3$ՙO9{Li'v%IID=z/;"\k޸)ku9x]2$W0= $QH>}F|`n6ϜϤkN7 >9LL(,.}>ּ^ OMM|%꿏:/T]F$ 6VW))t5FKòQq"rf y_Oa| pHJ*MTX8[^Dr-||[v(33!.44NJebʡrטu͚d+@ S[Ko~TKrjkoraPDPy5@Y?i܅Sg@'˼Zj_M5̻w. ;'5ڿ_IENDB`ruby-prof-0.16.2/doc/images/page_green.png0000644000175600017570000000115512766254554017424 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT?s~~TI!!bF ,H8b1a5l NQB b`^8MA~y*޿\)(0kJiΆIH q~{СMкOgԪ(2X2s,}O>};x3o}~Wtܠ$SjbjLEMa8y޿ww>JҪ*m*u=g6=W|vjz :@B(%UZ4\1mfj"jAƚ6hT*J VZJZ $@10PHZ(} )Be  @)zcԊe 02FHd#W?9Wi!Gc{sގl6IENDB`ruby-prof-0.16.2/doc/images/date.png0000644000175600017570000000116212766254554016243 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˕RmkA~ԋK$5X% ǂ!#?P@PZ(*EA#ܹۙw:0;3ϼ@J f?WoL` OZ+M9cktyx D7гm\PSt]Io@#/د)[f^ѻ#dHkbG"uݿq\.Xc8YhH|r}/!FsRB(]jT5V?ZxYl6sd2QgwpdC2p8A厊*X,¢<}" W  8s"jR--tiM1eK lT*=L/F#C7~ -:MW1IENDB`ruby-prof-0.16.2/doc/images/transparent.png0000644000175600017570000000014112766254554017663 0ustar pravipraviPNG  IHDR%=m"PLTEtRNS@f IDATc` 0zIENDB`ruby-prof-0.16.2/doc/images/add.png0000644000175600017570000000133512766254554016060 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<oIDAT8˥Ka[/Y()%X(olNۖskn.-h;8fEP"jïMGˈ}yພ羹$I.tulu AX:𼂒ZHh1DnZJOJB{Z?`2`S=N$ő=;a &jw qJG#<"N2h8޵`6xցn_+ ~Zto}`x%XЛ͈ hXѿƻ/}BJ_G&|Qr-6Aރ EL⬡\U3:WUh[C6+ 6.f *K͸ܝFq ou4܄?d|XҥMvD` *_[ #A20liR|xq`4w=\uQ m+G|%$5Թ5RO*YGMUO Gqj4ְ(X& s1c˭(LVf RdjQ '-1ATA>U j4,pV"4L$e@.ArBY a~myY])Q8tNLܞt2"I o=CSd)__AF(IENDB`ruby-prof-0.16.2/doc/images/arrow_up.png0000644000175600017570000000056412766254554017171 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˥?/Qϲhg5j%'F,[ LH 3(vw=fcoN{O~9VM4Q7ܿ)v/WQ=&bpSO ^'&^:\˨6eND!& 9꒣_|?\ srx,g*,(F#d[OaAA*P p1O+C$`)*w`A#0$ *?b&NRIENDB`ruby-prof-0.16.2/doc/images/delete.png0000644000175600017570000000131312766254554016566 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<]IDAT8˥KSa[nQP2wܦγL[,biaA\Cv_2MlZFjסNMjmkʷ`&.#z<ϓ bVPT3%I{GqRivȅ tz#E6EddJ`DR2<]N ;4Ѿ;m>78ɀQe6LIt殷cq!z |v j/Xi@ %1|hl !|! Y#uUNw]˼ H3u t]E>k%IfoRD:0`~ | (r on3oG0!$V *[W0_-+ dW&2ZfMFVJpiF&B > Rg- ~ CmڴER ឫ p5ްy+21Kawh` #aZ񽞆TZoLѓ`"(?'ˎJvKކ|:G9[aw82 Jw f'ymzsӘTsw__ιIrIENDB`ruby-prof-0.16.2/doc/images/find.png0000644000175600017570000000122312766254554016244 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<%IDAT8c?%4ydÞ'/XfƦ"ʀGviQTo@5 )%k;o47Y%u ZbVTyE,Xݣo6ةm=x)k?"eKZ帹yLe? '?e}KjmѹÓ .dfay 6\Vo]Z9մ6\K/bĬ` *YBc~Z: ola_[S1qIbR/*.?##;L@ : ]_@$e;@1/x%|W4 |F=c 9WA12 5zaN?(8SSQEQBZ(`‚?֎nx% P`_IU P,aj(X@K*п9}ce&R12hZDÔ?R;c}s}Wb{{Jlff`[%nJs.Û/ZA8>>FP@>5}q$ {_Kx<B!y+qIEauuNS1stpppLMM;99G T/=/ LNNaOd2H$8;;9pzzZtxggp^W" bbbBU$A:-"WU9D6nnnJJUUqssd2X,&U]HtF'$fS4 x\>CvXZZdjr*^GQR)גct]l6GMr8d0e\SS$immMWp544zzzIpuu^u90_9>^WTT| P]]: $AWÃw{5nZZZ&c]5}EP^^`0,˃cccW/"֘kX YjIENDB`ruby-prof-0.16.2/doc/images/package.png0000644000175600017570000000152512766254554016724 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8}Kh\u{g̝4L)B1>n\F)PAD QTWf!"؍` HC0ijC1ͳLfw(v!g}69)wyc/T4"Գ X8ѫ̛vכ*WGU}[E>7&tJiG+*rQE>{ `=9o/rorgaw=MЪUQVcƏ;}ź;qD>r 7jT1aU&m86l7KVio{Ǥ9sVԨ,O"aWūmptk.h-V}֯K*R\M- Юޡ'O'CU0)79Ms&3P#V 'w'ů N,op#LRi4Qj h]GS\;QƤBH`1@<Ѐd^{9] !"dlǁD @|0mp  Q a+kK7 "$ h$?$BrN#&Cif N7SV[6laL/HbF6tX=ֽɕد}GO|뻗zUC5rh8D>)4Vwͦ|"L\>2FΫ[^yjW?'q{gBio.ȧTctܲ^&IENDB`ruby-prof-0.16.2/doc/images/bug.png0000644000175600017570000000140612766254554016104 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˝OSQ\^[تtz% l$***2: iRp c0ąKw&&`44(eKɽwwrOX\HiscUQz@;քIdTaˀ)jC'يKT8=ʯ9ނ^zΘ1OFZ[W-Gz?&%*MGnN!aO>Nc[ɨX·0Nqg*1Sub|{g|fz)̾&\ 5\ 0 3i D;`|0>A?Tx4^`oqs`>ʦ`fCv@mX[r\At.)G[ Ì`N1)BWs+:NdsVa*DX.pB&B]H@T3@Pڏڠ wVP63yp-4 Ǽ $H'9{m@U$ZjCX:TgL::?[#{1P=.2F\iA-D 77qXIפb4kaAj% ͼj&Q˫H&s. `jKLE3*ΫX w6_l=@hߊv ,qqIENDB`ruby-prof-0.16.2/doc/images/tag_green.png0000644000175600017570000000114512766254554017262 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˅IaOUÿ {bFcN4FMtn-=6c li4BH!(dX՗.U>BZERA\FTBXDP}!r^C2^@I`&tl $ɝ,S3MD.' 90NCӴY6)F?2m$ b @WH<Nt͐xj D"5v1of^gVfI.lfhě9<VOC|8i4>C8%JlGk8z#SmȉrXZ\@{x<.`^or ŌBx<^'j}U1}QWhT ]"kL|snێ# ~ߢK\}bx'BQ'{i^oPȲz].c)weSL|iW(SIENDB`ruby-prof-0.16.2/doc/images/wrench_orange.png0000644000175600017570000000111012766254554020140 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT8˕kSQ8H)N]uA,wjazcbb6& Qcn^b4b2e l xW }$9Xt:$n"0T8J)N!h4ʉF|p8|2X,f[͵`0S~OZ% } iz=nHXt:4 "BrLRtv_T'-lu&f_uRl6 u]e 5~lޢnz{ejjUiw|}?$&x r|TN%*4Ç l;'T^ٗG <"pFୌw!yhݔeE6  ܙצ PJ:C\DW^,<<4 A ѹ]s6ޑIENDB`ruby-prof-0.16.2/doc/images/bullet_black.png0000644000175600017570000000032312766254554017747 0ustar pravipraviPNG  IHDR7gAMA7tEXtSoftwareAdobe ImageReadyqe<eIDAT(cπ2 .R We7JaWА\ X]?XH^? 73`[*60H ڐsVIENDB`ruby-prof-0.16.2/doc/images/zoom.png0000644000175600017570000000126412766254554016315 0ustar pravipraviPNG  IHDRagAMA7tEXtSoftwareAdobe ImageReadyqe<FIDAT8ˍKHA̪-KC= CmfuP)DB"K$A etJZyum0}f~3#sL|!!|g-V9Q鎺c`TC8*5bF'R!DЋ kb^sP!Locgע≣.=^u֘[ 65޶FG ! P %wN5\q=(t@ȀѶ(t2)է"L?B2uXcYV$&a]ct< *Q1}E )hYҁ갎6` DXr<:=UR̞O98*}V&b==hցqف+;˜JT<A!C:̼}nAH~0bM36 +/痗sIĢ̾Ek J {v!=_MyKb]öa{6W03}5TDU^=UQH~Xe֫:|AoG4Q]V;ޙ  jUzҧ]$jQM ʆķ7721@ܒDH;܋%ЅqۛXMgNάgMWz!`dѥ]uja}a ݸ6;5լDzTh,5~z~@y[:3M7gG]q=@c5 4u흃5__9_AMtB\K ⵘ}" @lDiQu+baq&{#'LHjz"$& $B! ,  EI@*PR*;ò[Ll7DҎ%GI0)mIԲ`I}>ă}-RwFu}y|O(p*"rt{RA>( ^( "4 333..Чɞ v.*o 3u zz( D.z Ha рP*6=%8A%ϤH]JQ&2Lz녆Aɔ>50j( ]T.s *I@m:nTx^7}v(Hy!8/ 4^ֹGi`zA"?l8]'STҧX*3@XMS<@蜮-./Ay5|Uv۬ϰVr4<A:\4bmdvi{˿ӛW'7naq{"8V_u_^2_[koTpbp :M skx_"Vؓ! ,  %R4 yԬԢ\K٩l'#QZ0ՠVTyïe]U4f!Pc0zkW+_ ^ў`v"Ŋa@x:@O,ȬtK5zsRtH5y3ʥ>yz=3[/Z|&x @7nGdn B^|{ZCN3Z&$p{f;^C}Co %! ,  %$5,%:k.]#> B"ZRp]2Shk9E-e<ͩkGj6-twsz|mOQtix41 ) U"  BQ B)# B+u  )ێ #" pg߿=QǍPa Q*֑Xb<88l$Q,? y2=0յT#rΗ5 9`jLmgTJ2MWy6jukիKy0iP0JCg&(`oq]혗']u}C*  ^\sxaGtKpeÈa@jvlgVDz$ͣQ>mb16}4 @l`ѪzvsGt 2y֐/V+SNJ=^"+Y  09ڛ>0}Lj`abqO '8^Xd|5 [ahWY7֑W6!i!qHX&(@3&B! ,  Q$@RS" k; S]3X'+ζS tUik `m0c]wldt$v}k~zq,lryux?)B ; 00;+ ­G 0-g+ .z%$z +l(jx9hNt<; 8O7yxH#|bH$ѼLipȅѐ 2"-A(P$tj@{s(W$( =!u5(jmn wmĸoA@w/d1+:'l1f#|,z20Hg@1}թٯ[3S+|7Uǃ.{ P卵0ʶc=+PL03:~p'v{On<~)@uP6 k (àK'vK V`I9(ZLG!! ,  PeRN*',Ԣv*o<bKs M3k>oR sAE1fm):kvvM{wl rtqPm|uF~?W a3& A66 - 3- .,6o 3/h-o 'dzz&(CGo߉Oa9ќD= kOOEuj(ǑLʏTIR&K.H= ttI£B0E:qjԪPhY‰ ʾBFdÎT0@ܝK!Aݽ_aw9hP(!Ѣ,fʓmZ,rƝ[|.1鑣wZh%.:^mRi綽7V޿}c\u;o>oüu+],Ebd]/\.*h3;߯~ |HoXg6] !! ,  E9$#%5(,Ԓr(i0.݊`lXtD%ydJ6H^.pl[k=.˿(>Sx~gypv}lNtjx{e> ( ~~ -- ,-(Ĺ ' e -/p(u '" u GN šL1:I<9uG '9cɕ-Q$L'lD7UTTׄ tѦBU@%JJŪ)W?LSY bZvmމБ]xF0I{VXg|-BfE#|.@4OP4u8S g ֥_n;Ө՞(բQ)wǮ<.(ʳ2?eG|LՅ"x/-/y+,p=E1 dQٷ~2Kꔛ$r `m*YsC zFn ak}nnI#Q! ,  %R4Ԝ"CA,(~ں8׼دDA֐2hs݌+p]ˤObKw8^>uz`H~htkv"xm|1Z, -#51"1''[#, ,}, ' p#h1 w a"w #p"b1V-akcB)P@;]XqČ#N-A"߲SyrL4eMʚph\@eq/o D2(𯘳q s:gu@Fu+QAUӯZ#xbR4vG1 Mɻ;8FP`B۩3he11O~ ˟>z(C3A=\Z-ڇAa-qiSRYmG(1;Ž=dtqB[! ,  %dihlp,40T:Ԕn琘9␄\< P)JZ+^f(-N Ǥ4ant#o~$z|u#Svx@"'% #m# S%  $%§ #ְͽ$& A"%  $#H݃'/9BH EdOC)Lq#Fo gBbDIʤC'CRg̙G 4^M=F\dd3 X堙Kl٣̊@@T?}IVUT+ol|gr TeluӭޒvG]l<ݑsg_D )4EQ_i)Pi#!h Da %.@qMOQ `pnyHWC"$s* ]hp$V 84MKB݆eSJtO9iԄ ʆn#2u` *_ R4+*BuϘMYU׷oAaLG۽kE|"2w9m[yGwSB3{er~㫹<{ @% @IENDB`ruby-prof-0.16.2/doc/images/tag_blue.png0000644000175600017570000000353012766254554017111 0ustar pravipraviPNG  IHDRagAMA7iCCPICC ProfilexTkPe:g >hndStCkWZ6!Hm\$~ًo:w> كo{ a"L"4M'S9'^qZ/USO^C+hMJ&G@Ӳylto߫c՚  5"Yi\t։15LsX g8ocግ#f45@ B:K@8i ΁'&.)@ry[:Vͦ#wQ?HBd(B acĪL"JitTy8;(Gx_^[%׎ŷQ麲uan7m QH^eOQu6Su 2%vX ^*l O—ޭˀq,>S%LdB1CZ$M9P 'w\/].r#E|!3>_oa۾d1Zӑz'=~V+cjJtO%mN |-bWO+ o ^ IH.;S]i_s9*p.7U^s.3u |^,<;c=ma>Vt.[՟Ϫ x# ¡_2 pHYs  diTXtXML:com.adobe.xmp Adobe ImageReady z`IDAT8}RMka~vW#j-įV&ZjR B"Q!zR!JA"T ~zi*U̶G_ݝ}gyEQp:::+z2t~&΍o*Lo$d2ee ' V @43H6DX0O@(RmFٍodFɾ͇xUp:<"NTd}\3,@AZrr7! tZWwF_Z>lhRlޢlk1<\ؼ * q:ZUB:{ےܡP@Melۀ^z>:D"1iXZ {e<)iJl En)ev`POydb=;;CX.c k1k&8jר_ d{~?jcfiRԡsbOA9&ydV;8$p.r=XLv}@!OaX,*C;zJnYTaB!^L{n7kIENDB`ruby-prof-0.16.2/doc/images/page_white_text.png0000644000175600017570000000052612766254554020511 0ustar pravipraviPNG  IHDR7gAMA7tEXtSoftwareAdobe ImageReadyqe<IDAT1nSAǞ4A(ISp.KPp"QA7%1Ӣ;+Z######DWk=C?|Xj9昇SekMs9NNVG@kD)4hn.Q@nJ)1]:;1@ T:ti:I$fM-+g]^LvIENDB`ruby-prof-0.16.2/doc/LICENSE.html0000644000175600017570000000735212766254554015332 0ustar pravipravi LICENSE - ruby-prof

Copyright (C) 2005 - 2014 Shugo Maeda <shugo@ruby-lang.org> and Charlie Savage <cfis@savagexi.com> Copyright (C) 2010 - 2014 Stefan Kaes <skaes@railsepxress.de> All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

  2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS “AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

ruby-prof-0.16.2/doc/Rack/0000755000175600017570000000000012766254554014233 5ustar pravipraviruby-prof-0.16.2/doc/Rack/RubyProf.html0000644000175600017570000002166312766254554016701 0ustar pravipravi class Rack::RubyProf - ruby-prof

class Rack::RubyProf

Public Class Methods

new(app, options = {}) click to toggle source 
# File lib/ruby-prof/rack.rb, line 5
def initialize(app, options = {})
  @app = app
  @options = options
  @options[:min_percent] ||= 1

  @tmpdir = options[:path] || Dir.tmpdir
  FileUtils.mkdir_p(@tmpdir)

  @printer_klasses = @options[:printers]  || {::RubyProf::FlatPrinter => 'flat.txt',
                                              ::RubyProf::GraphPrinter => 'graph.txt',
                                              ::RubyProf::GraphHtmlPrinter => 'graph.html',
                                              ::RubyProf::CallStackPrinter => 'call_stack.html'}

  @skip_paths = options[:skip_paths] || [%r{^/assets}, %r{\.(css|js|png|jpeg|jpg|gif)$}]
  @only_paths = options[:only_paths]
end

Public Instance Methods

call(env) click to toggle source 
# File lib/ruby-prof/rack.rb, line 22
def call(env)
  request = Rack::Request.new(env)

  if should_profile?(request.path)
    begin
      result = nil
      data = ::RubyProf::Profile.profile(profiling_options) do
        result = @app.call(env)
      end

      path = request.path.gsub('/', '-')
      path.slice!(0)

      print(data, path)
      result
    end
  else
    @app.call(env)
  end
end
ruby-prof-0.16.2/doc/Rack.html0000644000175600017570000000423012766254554015120 0ustar pravipravi module Rack - ruby-prof

module Rack

ruby-prof-0.16.2/doc/fonts/0000755000175600017570000000000012766254554014504 5ustar pravipraviruby-prof-0.16.2/doc/fonts/SourceCodePro-Regular.ttf0000644000175600017570000021401412766254554021340 0ustar pravipravipFFTMfhOS/2r x`cmap_ceXcvt q "fpgmY7 `sgaspglyf'bheadu6hhea;4$hmtxzpF~loca <vmaxpSX nameqBP;dpost6z 3prep&# AZ½jV_<vv:Vj XXKX^2    ADBE@ "` MXWU*zTUUcGbE9'8MFDCxUkm1 gBUs5O_QbQS0f1dC*O+ 6&Acco<Q]P<EgH]Z7jQ<]<]<HEM3@1GxcLqM:5[SUUpUMHa'{ Bssss____S00000f-OOOO&eXQQQQQQPEEEEZZZZ<]<<<<<U<MMMM1]1 Q Q QBPBPBPBPU3<sEsEsEsEsE5H5H5H5HO _Z_Z_Z_Z_ZQ7bjjQQQ+5QS]S]S]0<0<0<! ddtdCHCHCHCH*E*EOMOMOMOMOMOM &1&AGAGAG>10<OM Q_Z0<OMOMOMOMOM5H0<CH*E7^<]=?E<M.?631Rl#U<U<5HO]O]QCQQQ<S]S]S]dddMCHCH*E*E   &1AGEO&1&1&1&1P_gg`N/+m:+T`l8U4 ~1Ie~7CRTYaeoy $(.1CIMPRX[!%+;Ico    " : D q y "" 4Lh7CPTXaeoy#&.1CGMORV[  $*6BZl    " 9 D p t } ""wnl@% zsrmkZWTSROM zjbRJHE?}zuigfc_]Z   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abctfgkzrmxluiyn~ep?od6{vs}~|w,K PXYD _^-, EiD`-,*!-, F%FRX#Y Id F had%F hadRX#eY/ SXi TX!@Yi TX!@eYY:-, F%FRX#Y F jad%F jadRX#Y/-,K &PXQXD@DY!! EPXD!YY-, EiD` E}iD`-,*-,K &SX@Y &SX#!#Y &SX#!#Y &SX#!#Y &SX#!@#Y &SX%EPX#!#!%E#!#!Y!YD- ,KSXED!!Y-+++@6*!+M@2$++ E}iDK`RXYDV 3  > ~   8D$4>td`HD P  B  R  : 4 ~ D  XR$&vLjVbLV`Vj  8 dpx*2,6@H   0 @ P !B!N!Z!f!r!~!!!!!" """".":"F"t"### #,#8#|#$$$$($4$@$%%%%(%4%@%L%X%d%%&&& &,&8&x'' ''$'0'<''''''(b))))&)2)>)J)V)b)n)z)**"*.*:*F*R*^*+H+T+`+l+x++++++++,@,,,,,,,-X---....*.|........//l/x/////0&020>0J0V0b0n01h1t111111111112222(242@2L2X2d2p2|222223 333333333444 45 5h56H6777*767B7N7Z7f7r7~7777777778`888999T9:H:;8;;<<<===>4>p>?8??@ @F@@AA A0AVA^AfAAAAAAAAAAABBhBBBCC8CLCzCCCD(DJDhDDDEEERE~EEFFFjFG"GfHHDHHI2I|IIJ.JpJJJJJJJJJK KK"K.KYEX/>Y ܸ01'3#4632#"&P 8-++++@^^#))#$**`&  sWEX/ >YEX / >YEX/>YEX/>Y++ иииииии017#537#53733733#3##7##7#OVU[55QWV]669::9U1G/,/+ܹܺ+9и!+9+.01.#"#5.'732654.546753"(3;/GRG//A'<8d#'&[9<=/FSF/YI<7J -&$*<. 7),9)1&) )9,?P*='{M&*A GEX3/3 >YEX!/!>YEX/>Y!!393!9+и и3и;Eи>иG0173267.'>54&#"&'#".54>7.54>32>73z".:0U" *F%!#&jAH$W8,H3#,%5!=B(2 S-)L4$<5- *d6=-:!%+67#(0C( 6-')O#!8*H: 4/)3^'(_9Av4.`c +01'3#n8AnnP +01.5467hyyh-e__e-Q䑑Q*UU*zP  +01>54&'7ze__e-hyyhUU*Q䑑QTo,//9и и 01?'7737'l 0 l*xxF.77.FUh, +и 01#53533## BB+>>+ +01>7#"&54632>>  .0 --]SO<%&%'E;XyU+i} EX / >Y0174632#"&/""//""/H&//&&..c`EX/>Y01#3JHJfG 'KEX/ >YEX/>Y  9/"01"&54632"32654."&54632,kzzkkzzk!8)UCCU)8!%%%% TAcEEcA# ## #b~ =EX / >YEX/>Yи й01%!53#5>73R3L=DDD5E CEX/ >YEX/>Yк9017>54&#"'>32>;!IQ}U,DG-M/+cD0M6+NlA=?1HtaT(7F- /,51F*-[ai;G93SEX/ >YEX0/0>Y 09 /& 901732>54.#52>54&#"'>32#"&'c Y>!8)8X?9O2G;-P ,(f>-M9 L< 9,$?T0Sp#.+/"? ,/6$4#-)<':J)6!*D/7#'!~ YEX/ >YEX / >Y+ и и и01%5>7###5!533p"cN?Xc=/B7t8 ~(UEX/ >YEX#/#>Y +##9и01732>54&#"'!!>32#".'a$+5 ";,UH(8",i5%.P;"'BU.+E7- &6!BJ3G 1K44P7M 0WEX-/- >YEX#/#>Y+##-9 -01%2>54&#".#">32#".54>32A2$FB&T) UB$&F5!&_0,I5#:M+4YB%,Ja4;W 5%3 BE'/]`@iM&-1J1.K6&MsM`U''F~3EX/ >YEX/>Y 013>7!5!#2M7?R2V[~CG3H^D @WEX)/) >YEXY) 9 /1и1/ܸ  01732654.'7654&#"4>75.54>32#".WJHL6I*/>PB?6B.=&1(95H+/I39(.":U76W2!- A:F0A8/) !4* I3%<+-?%-O &3"$>./@C  0WEX#/# >YEX-/->Y+-#9#-01267.#"32>7#".54>32#"&'%T* SG1$EYB%&E5 ']1,I4";M*4ZB%-J`4;W 6'.^`%4BEAhM&,1J1.K6&MsM`U'&}'f+'fx0h;+и/9и/01%%xu-kOOU&kk0h;+и/9и/015%5%5-u-OOm)*EX'/'>Y +'!ܸ017&>54&#"'>324632#"&#,'77&A1"\:*D1'-%f++++$8.('**7-#.)9$!3+(,3 #))#$**1p"{4=?%+/+8+;+/9:01%#'##".546754.#"3267#".54>323275"2G'/#$9'-R?%$>T1-C'R2;jP/-Pk>4L2+%88hXd:*"1MN$@0*S}SP}V--3c```1$@W3#(@~7 8 AEX/ >YEX / >Y  + 01'.'###3#  ?U^X d7m99m7dCpg!%WEX/ >YEX/>Y$9$/ $9%0132+2654&+2654&+g2S;!9:HP$A[7æTIMLVcU\ZWc&=+1O ND0H0x:76/?C=9B*!9EX/ >YEX/>Y 014>32.#"3267#".B+Nl@iM,HO~X/0 5!%Eb=>cF&-2.WU% 9EX/ >YEX / >Y 0132+72654&+U'LpIpoopHN{U-D}}s MEX/ >YEX / >Y 9/ 01!!!!!!sKaFGG CEX/ >YEX / >Y 9/01!!!!# SFF5'MEX/ >YEX#/#>Y##9/014>32.#"32675#53#".5+Mk@!6-#/>0.K63L0#< d@>hL*HOW/5"%Eb=>cF&E ,.WO  IEX/ >YEX / >Y 9 /и 013!3#!#OTTTTp5_ AEX/ >YEX / >Yи 0173#5!#3!_fGFFGQ5EX / >YEX/>Y 0173265!5!#"&'H&GAf3S=8i",*KQrFA.Q<#49bC kEX/ >YEX/ >YEX / >YEX/>Y9 9 и 01333##bT^]rTIjU+EX/ >YEX/>Y013!!REiGQMEX/ >YEX/>Y+и и013373#4>7##/##Q\]! \\G+Z-Z,Fjjpq675576SYEX/ >YEX / >Y 9к 9  0133.53#'##SUB OUB Ob1k4Tp3g30('5EX / >YEX/>Y 01".54>32'2>54.#",8\C%%C\87]C%%C]7%>++>%&=++= 0YOO}W./W}NOY0I&Gc>=bD%%Db=>cG&f!GEX/ >YEX/>Y 9 / 0132+#2654&+f6Z?##@Y6vSWSUUk-J64L2HAFG71])4KEX$/$ >YEX/>Y1+$.0132>54.#"#"&'.54>323267+=&%=++=%&=+$Wm/M7$B\87\B$4K-J3 K=dG''Gd==cE%%EcXC7WvGO}W//W~NFtW8 *+d)SEX/ >YEX / >Y 9 /  и 0132654&+##32mMQQMmuS2T="PCY?@A4,F3M\C3IEX/ >YEX0/0>Y09 0901732654./.54>32.#"#"&'u%b6FL +^2) 9O/>h$, M1YEX/>Y01#5!##TJFFO 3EX/ >YEX/>Y 01332>53#".5OT%22&Q!:Q00R;!f3G++G3hGb??bG+-3EX/ >YEX/>Y 0133>73#+Xj iUa;d:546bp N!MEX/ >YEX / >Y + ии 0133>?33>73#.'## S5   E;E  2Oa\K  HZd*O))P)(Q))P)o<<6"]EX/ >YEX/>Y99 к 9к90133>?3#'.'##\\  ZX\c bXS=++33&2@EX/ >YEX / >YEX/>Y901%33>?3#Xc$&_VT&K((L&ZA =EX/ >YEX/>Yи017!5!!!Aou&2F2Gh++01!#3!00c`EX/>Y013#cJHJchw++01#5!!55h00o &EX/ >Yܺ9 013#/##HHB11BH~YEX/>YEX/>Y9/ ' '99*+0174>7.#"'>32#'##".732675Q'U^1#0X" 17> daC)c4"<-P'*Q*Ni?~)=,,!%8  m[B .#3' %#']'EX/>YEX/>YEX/>YEX/>Y99$'013>32#"&'##732>54.#"]R#W+1L3$=P+#Q#BR#G 6(!4$ I&^"(#A[8>bD##6r1H-(B/#&P!9EX/>YEX/>Y 0174>32.#"3267#".P+Jc7YEX / >YEX/>YEX / >Y99 0174>32'53#'##".73275.#"<%=P+-D"RDS-0M8UKDHA!? 7);_B$"Z8@-"A^>XbI1DE'CEX/>YEX/>Y' +"0174>32!3267#".%4&#"E*EY/4R91C(+G"$\;6_G)LD7,<_B#!,6"#A^dIN'8$gBVEX/>YEX/>YEX / >Yи  01.#"3###5754632/3 B9Q_eHDz C<,C]>)YlH 6EUEX%/%>YEX(/(>YEX'/'>YEXC/C>YEX / >YC ии :2ܹF5F295и()'*%N0132>54&+"&'4675.54675.54>323##"&';2#"&2654.#"QN*D078_%#G)'#4E'( ɂ3E'+&50m^[&Fd>ku/A))BQ&0$#)8 &1?,(@- ?4 '>+  4>">.Fk>5**5>] eEX/>YEX/>YEX/>YEX / >Y 9013>32#4&#"#]R'X9WQR4<%$&Rs)6ca#EC !Z;EX/>YEX/>Yܸ 01!##%"&54632Z4R%%&&"##"7'!AEX/>YEX/>Yܸ01!#"&'732>5#%"&54632Z4/N;&H9$0 %%&&-K7= "1"##"j> mEX/>YEX/>YEX / >YEX/>Y 9 9 и 01333#'#jR^\sRoQ5EX/>YEX / >Y013327#"&5#Q3,(4!:(NQ6/> XW<, EX/>YEX / >YEX/>YEX / >YEX/>YEX/>Y 9и 0133>32>32#4#"#4#"#<@1*J4)37O5&B7$O@"*T&.MIUV%&UV%&] eEX/>YEX/>YEX/>YEX / >Y90133>32#4&#"#]D&X9WQR4<%$&RS)6ca#EC !<'5EX/>YEX/>Y#0174>32#".732>54.#"<'BW00WB''BW00WB'U)9##9))9##9)=_B""B_=<_A""A_<*D11D**E22E]3%EX / >YEX/>YEX/>YEX/>Y 9 9 "%01#33>32#"&'732654.#"RD"Y-1K3$=P,"O!#FBT!4$ I&)> *#A[9>aD#!?f[(B/#&<3$EX/>YEX / >YEX/>YEX / >Y99 0174>32373#57#".73275.#"<%=P+-F#BR Q-0M8UKDHA!? 7);_B$" 6MX+"A^>XbI1DTEX/>YEX/>YEX/>Y9 0133>32.#"#D&oD.#7e,Rs;D G ?LH-IEX/>YEX*/*>Y*9*901732654&'.54>32.#"#"&'p)^BB@EY&C23M27h$( N-". RBc_7Q4Hy-v$, , #*3%%5 '@84(-E"nM/EX/>YEX/>Yии01#5?33#3267#".5Ή D 0##8!P(5H+>C!1" < 5J-MeEX / >YEX/>YEX/>YEX/>Y901!#'##"&5332673C%W9XQS3=*D)RU+6ca.EC+/Q3% <EX/>YEX / >YEX / >Y0133>73#3Sp  pO\%G##G%P!tEX/>YEX / >YEX/>YEX!/!>YEX/>Y!9к90133>?33>73#'.'##T; ;F< ;Njc:  8b#B""C"#B""B##E% D*@eEX/>YEX / >YEX/>YEX/>Y9и и017'33>?3#'.'##[M  IWZU!PXk*,ip.+p1/'[EX/>YEX/>YEX/>YEX/>Y901326?33>73#"'7T  3@Sw  jN$2A)$;-$ J##I! $>- AG =EX/>YEX/>Yи017!5!!!GMX3,wC,Cxh9+34++  +' 9014>54.#52>54&54>;#";#". 9,,9 .F/=4&1 '44' 1&4=/F.1..40]4'3 0 #+[/13  313T.# 0 3Q +013#JJch9+7++'(+ ('9012>54&54675.54654.+5323"+5&1 &44& 1&3=/E. 9,,9 .E/=h #.T313  31/[+# 0 3'4]04..1'3 0L '++ и01>3232>7#".#"LH&/)'  5H&/)')F7 "F6 "4HuEX/>Y ܸ01#737#"&54632RP 8-++++Z^^X$))$#**q%\EX/ >Y" +!+!и/"и/  и / ܸи/01#5.54>753.'>7:8@?9H'3-J56J*3,@(- 4 XBCX "gh$=T54S<$jg"4M)WEX/ >YEX/>Y +и  и#01%!5>54'#57.54>32.#"3#;?=uc 7M0>U0;*BE %&GG2_94 = *D0+ /A4 ; 85F:SA 4&+ 0+01?.5467'76327'#"'732>54.#":TS,W0?>1W,TT,X9>1WP ++  ++ U:##;V-Z%%Z-V;##:U-Y&Y1$$11$$15#~lEX/ >YEX / >YEX/>Y 9 йиܸйи 013>?33#3##5#535#53\!"\RR~!C##C!/A00A/@Q++013##JJJJ5M0[GO/(+D+2(9D/9 29 к<29<01%>54.'.#"#"&'732654.5467.54>32s #)>I %)?IT8#*&*?I?*1)*;$7\ 2=*)-*>J>*3(&8&2Q&"",!)!+!k%$+=.0<'2$&!-(&*=.-@'/$"L:'EMEX/ >YEX/>Y#-й4Aй:014>32#".732>54.#"4>32.#"3267#".)Ic99cI))Ic99cI). ;S22S; ;S22S; F.;!#1".85-&4&";,CL{U..U{LM{W//W{MBkM**MkBBjL))LjB+F2'K;BM*3INS4&sUhi +01!#5!UBiU+ip?'5>=+ +62+)и2/и4и101".54>32'2>54.#"32#'##72654&+,'E33E''D33D'7''7 6((6)L /..#))C?4H,,H44H,,H4%*;$#;++;#$;*$SFFfCY ++01".54>32'2654&#",-##-.""."**"!**!//""//!..#%..%#.U, DEX/>Y+ܸии  01#53533##!! BBR0>>A>=ME.(s(/EX/>YEX / >YEX/>YEX/>Y 9 01332>733:7#"&'##"&'#MS49&&'S  &$ Q/#;SCE +#5:85 &;43H%EX/ >YEX/ >Y013##".54>;QQ6 5ZB%$?V2+ 25R9;Q3}+vaNa4&s?~'{M&<~'{M&'U'{M&{<'*EX%/%>Y +%ܸ01%3267#"&54>'7#"&54632g#,'87&A0!]:Te'-$g,++,$8.('+*6-#.TH!3+(,2!$))$#** 82&&# 82&&$ 82&&% 83&&& 8-&&* 8k&&,OfEX/ >YEX/>YEX / >Y ++01#!5##!#3#=+.IWCL6i6wGFGB+*&(//s2&*#s2&*$s2&*%s-&**_2&.#_2&.$_2&.%_-&.*+ SEX/ >YEX / >Y+  и01#5732+72654&+3#[KKpoopHA* D}}/S3&3&0(2&4#0(2&4$0(2&4%0(3&4&0(-&4*f~ ) + 9 и и01?'77'f,,,----, /}EX+/+ >YEX/>Y+9и +9  и+ и и#и -01732>54/.#"#"''7.54>3277 %>+8!&=+L%C]7Z@50?%C\8\?6/t&Gc>Y@8%Db=_@+sHOY0=O ]-vIO}W.=O O 2&:#O 2&:$O 2&:%O -&:*&22&>$e!9EX/ >YEX/>Y ++01332+#72654&+eTv6Z?##@Y6vTWSUUkn.I64M2@GG6X49ZEX/>YEX9/9>YEX/>Y""94%49014>32#"&'732654.54>54&#"#X4J/(=*",5,+<%*F !4*--4-",*7?R.L6)5&5,) $5' 6(:/&!-#"1-/ %1KKQ&FQ&FQ&FQ&FQ&FQ&FU.7DEX / >YEX/>YEX&/&>YEX,/,>Y/+ ,9/ & 9&)& 94,;B017467.#"'>32>32!3267#"&'#"&%4.#"3267./||'/AP-0;E0%7%<;/A&5H)O&\OIW6E8 8*/3$=P- L] 60+-.K8+RI'($#5:P+&H*E&JE&JE&JE&JZ&0Z&0Z&0Z&0<9kEX4/4>YEX/>Y' +*49*49-и7и001%2>5<'.#"#".54>32.''7.'77,(;'#R'(=),<{BP!>X7/VB'"=S2/T=.<"&(J"85H,  /&,;"&=+*=y< 0}EX,/,>YEX/>Y,9и ,9  и, и!и$и .01732>54&/.#"#"''7.54>327):#9) 2#9) 5 'BW0S?3%5 'BW0S?3%\&1E*!:&2F*!8 Y7<_A"0;> X6=_B"0;M&ZM&ZM&ZM&Z1/'&^]3%EX/>YEX/>YEX/>YEX/>Y99"%01#3>32#"&'532>54&#"RR#V+1L3%=P+$L!#E 7(AI H&W"(#A[9>aD#"\1H-Pc#&1/'&^ 8&&'Q&F 82&&(Q&F ,W %eEX/ >YEX/>YEX/>YEX/>Y# ++01'.'##"&54>7#'##3327  .(7 >?U^#- d7m99m7d= ,+&  p= Q24BEX/>YEX0/0>YEX/>YEX#/#>Y09/ #+и0:>0174>7.#"'>32327#"&54>7'##".732675Q'U^1#0X" 17> da*,.&4)c4"<-P'*Q*Ni?~)=,,!%8  m[; ) +*%  > .#3' %#'B*2&($/P&H+B*2&(%/P&H+B*5&()/P&H+B*2&(./P&H+U%2&).3T&I8+<C ,EX / >YEX)/)>YEX/>YEX/>Y++# 9#   9 и&и+'01.#"327#'##".54>32'5#53533!? 8)KDHAHDS-0M8%=P+-D"RH`.A'S]I@- ?Z;9[@""ZB0]]s&*'E&Js2&*(E&Js5&*)E&Js,!!^EX/ >YEX / >YEX / >Y++ 01!!!!!#3267#"&5467!sK!  .'8/FGG%- ,+*AE25>^EX$/$>YEX/>YEX/>Y>,+2$901%3267#"&54>7#".54>32!3267'4&#""-   -&4  "6_G)*EY/4R91C(+G"LD7,-)$!) +*$  #A^<<_B#!,IN'8$s2&*.E&J52&,%H 6&L52&,(H 6&L55&,)H 6&L5(&,#H 6&L9O 2&-%  \&M%f* NEX/ >YEX/ >YEX/>YEX / >Yܹܸи ии01!!7##!##5753!533ETTEETTEoo5*uuuu EX/>YEX/>YEX/>YEX/>Y+9 ии01>32#4&#"##57533#'X9WQR4<%$&RIIR)6caEC !;+]]0I_3&.&Z&0_&.'Z&0_2&.(Z&0_,`EX/ >YEX / >YEX/>Y+и0173#5!#3#327#"&5467#_ ".(7*GFFG4- ,++<Z2&gEX/>YEX/>YEX/>YEX/>Y ܸ!01#5!3267#"&54>7#"&54632<4#  -&5   %%&&C6) +*# J"##"_5&.)Z/EX/>YEX/>Y01!##Z4RQ2&/%7'&\0b(C&0&j(>&P#j> mEX/>YEX/>YEX/>YEX / >Y 9 9 и 01373#'#jR^\sRn2&1$Qf&Q$4(&1.Q(&QG&18|Q&Q8&1+&Q5 IEX/ >YEX/>Y9и и 01%!55737iQQRGG+C,ixDxQWEX / >YEX/>Y 9 и  ии01%#"&=575#537327!:(NQ||3,(4 XWGFGC[G[6/S2&3$] &SS(&3]( &S S2&3.] &SV&mEX/>YEX$/$>YEX#/#>YEX/>Y +&#9&!01>7#"&54632%>32#4&#"#305  '* (2LC #P5OLS.4'='RDO5' #+@9Kv#<%3`^)B@)(L0(&4'<&T0(2&4(<&T0(2&4-<&T!OOEX/ >YEX / >Y +  и01463!#3#3!".7;#"!}”>aD$VTVVTKFGG-U{N~ T;DEX/>YEX/>YEX2/2>YEX7/7>Y<'+7292+529A01732>54.#"4>32>32#3267#"&'#".%4.#"X &%%& M0@%/EA0"5#:6';#0H+]&@/-0*E11E**D22D*=_A"=87>$YEX / >YEX'/'>Y+''01332>533267#"&54>7.5OT$23%QE750  -(8  nkf3G++G3hft=- ,+! }M2%EX/>YEX$/$>YEX/>YEX / >YEX/>Y к9 #01!327#"&5467'##"&5332673-).&40 %W9XQS3=*D)R6 ) +*)=Q+6ca.EC+/Q N2&<%P&\&22&>%1/'&^&2-&>*A2&?$G&_A5&?)G&_A2&?.G&_ +EX/>YEX%/%>YEX / >YEX/>Y!$+9  9  $#и$(и!)01732654&#"'>32#"&'###57533##G@T@I I&#W+1L3$=P+#Q#BIIRraVL]#&D"("=X6<^A"#6;+]]0I>&#CEX / >YEX/>Y+  013267>32#".5467!.#"RBDWV:9Z?"$A\77Y>"TP)Ajvxi7 )/W}OO~Y00Y|L v!1(BEX%/% >Y+  +% и !01.#"3##"&'7326?#5737>32#(>,*4- hF) PT0J$/??.K6 >OM;8dh 024GEX,/, >YEX"/">Y, ",9.01%2>54.#"#".54>32>54&',%>++>%&=++= 9-,0%C]78\C%%C\8?5'(=&Gc>=bD%%Db=>cG& -2 +[OY00YOO}W.  <,e4GEX,/,>YEX"/">Y, ",9.01%2>54.#"#".54>32>54&',#9))9##9))9 8,&.'BW00WB''BW061,)81D**E22E**D1- ,2 !eC<_A""A_<=_B"  Ov(JEX/ >YEX!/! >YEX/>Y!01#".5332>53>54&'_ '!:Q00R;!T%22&#(0 $Gb??bGf3G++G3#  MVo#aEX/>YEX/>YEX / >YEX/>Y 9 01#'##"&5332673>54&'? "C%W9XQS3=*D)#0o #:U+6ca.EC+/Q"  82&&.Q&F_2&..Z&00(2&4.<&TO 2&:.M&ZO &:1M&Z0O &:3M7&Z2O &:5M7&Z4O &:7M7&Z652&,.H 6&L0,(%9KEX/ >YEX / >Y#+ и &001#"&5467.54>32327'2>54.#"-(8$A]=%C\87]C%`O W%>++>%&=++= ,+!;:_zAO}W./W}N"  &Gc>=bD%%Db=>cG&<2(<\EX/>YEX/>YEX&/&>Yи&.8014>7.54>323267#"&32>54.#" /T>$'BW00WB'-@(#$  .&4Y)9##9))9##9)y!$A\:=_B""B_=3M;+8) +*D11D**E22EC(&8 H(&X *(.&9E("n&YO7'5EX/>YEX/>Y01!#"&'732>5#Z4/N;&H9$0 -K7= "1) -cEX%/% >YEX/>Y иии и% 9 !и#и"01%2654&+3#32654&++5#5732&U^\WkZTJNL^HP$A[7MM2S;!8;?CFAYEX/>YEX/>Y9/ 9'*+013267#"&533>324.#">(U^0#0Y" 17> dbD(d3"=-P'*Q*Nh?h)=,-!%8  m[*B .$3' %#'< $EX/>YEX/>YEX/>YEX / >Y 9 9 0173275.#"4>32373#'##".KDHA!? 7)U$>P,+H"BDT./M8XbI1D+;_B$" 6@-"A^]%EX/>YEX!/!>YEX/>YEX/>Y!!9!9 01%4&#"32>7#"&'##33>32AI$J #E 6(U$=P+$P#BDZ11K3Sc%$ 2F0>bD##6@-#A[=!5EX/>YEX/>Y 01%#"&'732>54.#"'>32)Fa79d'%M-)E1.B',F*_B5]F)<_A"($5#1D**E25*"B_?'CEX/>YEX/>Y+ "01%#"&'732>7!.54>32.#")G_6;\$"G+(B0">U31V@%T PB7*<^A#"6+?'  3TYEX/>Y#+ 017467!.#"'>32#".73267E{UT*J!$^99\A$$AY53S; LQBHR JY8"B^<<_B# =W+ONRK<'!/EX/>YEX/>YEX/>YEX / >Y99 "$%(01326?#".54>32373#"&'7275.#"}&P%FKT-/M8$=Q,+J Bvm0a(FC!@ 7*MjF;b*"?[99\@##6\jI0A'R`M3aEX / >YEX/>YEX/>YEX/>Y 901#57#"&5332>73R'X9WQR4<%$&Rͮr(7ca.EC !S. EX/>YEX/>YEX/>YEX/>YEX / >YEX/>Y9 9 01!#'##"'#"&533267332673@1*J4)38O5&C6%N@"*T&.MI\V%&`V%&`?TEX/>YEX/>YEX/>Y9 01!#'##"&'732673D&oD.#7e,Rs;D G ?L6xAEX/>YEX/>Yии 01%3##5#5354&#"'>32 D5F#8!P(5H+CCCAD = 5J-3% @EX / >YEX/>YEX / >Y 901!#.'##3%Sp  pO\%H##H%P!i /EX/>YEX / >YEX/>YEX/>Y 99901!#.'##'.'##33>?3PT; ;F< ;Njc:  8b#B""C"#B""B##E% D*1'REX/>YEX/>YEX/>Y901.#"#.'##>32  0=Sw  jN $0>'!<.? J##I!*$>.A3 cEX/>YEX / >YEX/>YEX/>Y9 9 01###73753R^\sR%n:/ /EX/>Y+9013>32#54&#"#@8$94@$'@}E!A>*'w4EX/ >Y +ܸ013#"&'73265#7"&54632 6(-" / F2& .+(rN6/EX/ >Y +90133>32.#"#6B'# =@FK', 6(2RF!Z/EX/ >YEX / >YEX/ >Yи  0133>?33>?3#'.'##R@% $3%$YEX / >Y+9017326?33>?3#"&'7% @E <><5  #@//3@1^|^  ++0126548'3,,3EHHE*#"*$>45>h + +01"3&546h3++3EHHE*"#*$>54>==_EX/>Y013#f8Y==m_B +01#3_f8@?Jn2C;(EX/>Y +0133267#"&5#đ  "62Q 2<86N-+*++*990132654.'.54632.#"#"&'7%(& +"G@$?-&!,#IF+LS  (5(   )9FK//EX/ >YEX / >Y 9и и01'33>?3#'.'##fD+&DhoE/  +CBBFF=m +013#ZZ?є= +01#73*?ZZ==+ܸ013#'## Fa?CC?єccC'+ܹ и01>323273#".#"#+(  /+(  /C0=6/>7Y +013#9? + ܸ01".'332>73,!/ 3&% 3 /?'/ 3/'Jn +01"&54632,&&&&J"##"L + и01"&546323"&54632L     )+ܹ01>54'7 S BH(O'0)&   + ܸ01"&54632'2654&#",)44))44)3**22**3%;+и013#73#IX7HX7ʏ=+ܸ013373#?CC?aFccl;+и01#'3#'37XIM7XH;!Z +01632#"5467Z3&+#E#? _ +0167#"&5463262&+@.E#>#e+01>54&'7#**; '4   (n +01"&54632,&&&&"##"7 + и01"&546323"&54632(p+ ܹ01'>54&'73.(5(10#"  (&+p+и ܹ 01%3'>54&'5#(5(1!5   )2EX/>Y +014673327#"&.: $.&4y)@7 ) +2 +01".'332673, /3$##$3/%-//-%U +01#53:N#9/+ +!+ 9 01467.#"'>32#'##"&732675fm'4H(?=49 +Y++99 013>32#"&'##732654&#"@5BD(522@((4'.),}8YK)A- K ?93=( T /EX / >Y++99014>32'53#'##"&73275.#"(5+@55?LB.*+(&'5'?,6y,%XQ7=(>N !++ +014>32#3267#".74&#"+9DH=/*;##<-+(#7'?,SE 17 )+?B-00-rNAMdEX%/% >Y?+"H+7 +B0+ 79 и02ии%(01732654&+"&'475.54675.54>323##"';2#"&72654&#"326?%#; 65 #/ R ".?G@>0D*FO((((% (  )+0 ) "$))-& (( & S/ /EX/>YEX/ >Y 9  9 013373#'#@G|GkF@ИCUNT///EX/ >Y ++9и0133>32>32#54#"#54#"#2 !1 $"%=5  =F*7403.3N++014>32#".732654&#"+9 9,,9 9+B1++11++1(?++?((?++?(5@@54AANT/EX/ >Y ++ 9 9017#33>32#"'732654&#"@46AD(5/.((4'.'.k$YK)A-%. ?93=(IEX/ >YEX/ >Y +и 01#5?33#3267#"&5MP5"- 0H80ZZ3**. J=FAEX / >YEX/ >Y+901#'##"&=332675349%74@#)@3!A>*&F 3 /EX / >YEX/ >Y 0133>?3#B= >=vJF00N+ +014>32.#"3267#"./="#2 !0<:0(; #=,(?+) A45@ )+?8 /EX/ >Y+  и01.#"3###5754632"*$?OOAE-*#30:GF 4 /EX/ >Y и017#5!3!ս&3"3U%&)<&IUU%&))1/'&^A&? G&_E"@&YO3*hEX/ >YEX)/)>YEX/>Y! + ! 9%%9014>32#"&'732654./7.#"#O9X;NbuXR-?(4S03,0&?1v9,DLU2W?$TFbH'C1(!5?2*$ 6"0Y^`&22&>#1/'&^&2&>1"'&^&2h&>+1/'&^ &23&>&1/'&^P  +01!!PH HD  +01!!0 H^|  +01632#"&5467|/5 '* '3LDO4( #*?9Kw#^  +01>7#"&5463205  '* (2LCO5' #+@9Kv#|_^&sg^&sg|'ss +01%".54>32,6))66))6s'6!!6''6!!6'4 +01757ř''P#"4 +01%'7'R''#P" <p +01?'7!!M#*/EX/ >Yܸ 013##7"&54632@Fr lC!llC"N:/ /EX/ >Y+90133>32#54&#"#57%85@$'@F0!A>*'KWWaWWWKWWWKWKWWWKWK W !W l"WN!+++014673.#"'>32#"&732673/*;#GV)7 CM9-)'/ /5 )XQ'?+T>001/`" 7EX&/& >YEX/>Yй& и  иииܸии&#и&%ܸ)%*и),и3и4и4/01%.#*#7.'#7.546?33273.'>7!>  '>A$#&#T6 &  &DNvg &  &-1  <#7G  dLs!(0ccm|#qgbgr / #N4EX/ >YEX/>Y+и   ии 'и(и -и.01%!5>=#573.'#57.54>32.#"3#3#;?=|W aP7M0>U0;*BEξ %&GG2_9,-%*D0+ /A4#115F/'~ /EX'/' >YEX+/+ >YEX/>YEX/>Y'ܹ и иии'ииии"и #и&и)и-015#3#3/5#'3'#3##'##5#575#57533533ZD7>H;C5HHTapAJJJJTfkAH=.+;&f<+&<%*+*~ !cEX/ >YEX/>Y++  иии 01267#3.##+##575323ENNE*@%Y$+$ܸ)и/+и/.017!!.#"3267#'##"&54>32'5#5353yz-)944N:>'L[1?!'5G11y +>Ex,S+a\)B/S"1CC:61mEX/ >YEX/>Y("+(+и( и"и"и.01%#"&'#57&45<7#57>32.#"!!!#32676&\>b@;;@j3X1;&JZ&XE+AQ,1v+  ,v-!/!bW1  0U`$#+*~ 4EX/// >YEX%/%>Y #+/йܹ ии и 'и*и+и.и301>54&'#27#3.##3#+##575#575323;p!G6*A@H )8F'EOKKKKNsJ  ;tKK?"h  )"1!y$;%x7AT*uEX/ >YEX/ >YEX/>YEX/>Y*'+ܸܸ#01%#5.54>753.#"32675#53CX<2T dd2TtHFsU3ec,.!%Db<>bD%E`"%{EX/ >YEX/ >YEX / >YEX / >Y   ܸܸ!и"017#5.54>753.'>7JHMMH!O354V>"!=W55/O12 "6Elp &0dc1TvIGtT4a`+/#l ~pEX/ >YEX/ >YEX / >Yиииий  и /01#3##'#53267!573.+5! !+IG]I^YOS`L ]LOM5#1LXC:<,.&D8~$]EX/ >YEX/>Y 9 #ии ииии017>54&'7'575575377%NA)E:fOhhhhTB)=' ?^>050H041ǞV5VHV4WU+i +01!!URi> <p= (EX/>Y+ 01"&54632'2654&#",=NN==NN= .. .. XONTTNOX29<<55<<9a1EX/>Y+01%#5>73#"R!)2?* =,EX/>Y +017>54&#"'>323#NS&';$6>!,$;N! !#52'')5=$<EX!/!>Y+ +! 901732654#52654&#"'>32#"&'1#`*'(=#/;8 'F3#CQ3&&,(7&-018EX / >Y+ +и 01%57###5#5733N-629G2t8RAI+IIɽ1DEX/>Y+ + 9 01732654&#"'73#632#"&'-%$  2>F6*<Q 6F 300:= &FEX/>Y#++#9 01%2654&#"7.#">32#"&546328#,o+4-34+;NUE,&&" ;95*&QGV[1&EX/>Y+ 013>7#53# $ ( A'A;:5$#??D(= 8<EX4/4>Y%+449%901732654.'7>54&#"4675.54>32#".')/W,r'*2A!%"-.!P < n %  /%!  %!  = $FEX!/!>Y ++!9!0173267.#"3267#"&54632#"&'#,*2-33@3;NUE-&$ 995*,54&'7l72.-((-.27Ko1 -c;;c-!2o_2 +013#^XE2p2 +01#73>EX^p2+ܸ0173#'#`P`CCCppDD3++ܸи 01".#"#>3232673h .,$ .,/=.> +013#92 + ܸ 01".'332673,,2""""2,(''(e5 +01"&54632,!!!!- + и01"&546323"&54632h+ܹ01>54'7 S BH('0)& k  + ܸ01"&54632'2654&#",)44)(55(/)(00()/$2+и017373#BMSMT;pppp2+ܸ01#'337`P`CCC2ppDD+k+и ܹ 01%3'>54&'6#(5(1!5   )L ++ ииܹ01"&546323"&54632'3#L/+ + ܹи 013#"&546323"&54632&.L7%+ +и 013#"&546323"&54632IOg:!7g) + ܸܸи 013#"&546323"&54632R[pD#o|L7++ܹи013373#"&546323"&54632=??=[F37@@g ++ ииܹ01"&546323"&546327#'337`P`CCCooDDL7) + ܸܸи 01#'3"&54632#"&54632a:gOsg) + ܸܸи 01#'3"&54632#"&54632_Dp[|Go$A +01'3 ;$9+ ܹ01.54>7H3.(4'1$!  )&>.e&"A$`    '$: , E u L  2 * : 4]  2 ## H9Typographic alternatesTypographic alternatesSource Code ProSource Code ProRegularRegular1.017;ADBE;SourceCodePro-Regular;ADOBE1.017;ADBE;SourceCodePro-Regular;ADOBESource Code ProSource Code ProVersion 1.017;PS Version 1.000;hotconv 1.0.70;makeotf.lib2.5.5900Version 1.017;PS Version 1.000;hotconv 1.0.70;makeotf.lib2.5.5900SourceCodePro-RegularSourceCodePro-RegularSource is a trademark of Adobe Systems Incorporated in the United States and/or other countries.Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries.Adobe Systems IncorporatedAdobe Systems IncorporatedPaul D. HuntPaul D. Hunthttp://www.adobe.com/typehttp://www.adobe.com/typeCopyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries. This Font Software is licensed under the SIL Open Font License, Version 1.1. This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL ----------------------------------------------------------- SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ----------------------------------------------------------- PREAMBLE The goals of the Open Font License (OFL) are to stimulate worldwide development of collaborative font projects, to support the font creation efforts of academic and linguistic communities, and to provide a free and open framework in which fonts may be shared and improved in partnership with others. The OFL allows the licensed fonts to be used, studied, modified and redistributed freely as long as they are not sold by themselves. The fonts, including any derivative works, can be bundled, embedded, redistributed and/or sold with any software provided that any reserved names are not used by derivative works. The fonts and derivatives, however, cannot be released under any other type of license. The requirement for fonts to remain under this license does not apply to any document created using the fonts or their derivatives. DEFINITIONS "Font Software" refers to the set of files released by the Copyright Holder(s) under this license and clearly marked as such. This may include source files, build scripts and documentation. "Reserved Font Name" refers to any names specified as such after the copyright statement(s). "Original Version" refers to the collection of Font Software components as distributed by the Copyright Holder(s). "Modified Version" refers to any derivative made by adding to, deleting, or substituting -- in part or in whole -- any of the components of the Original Version, by changing formats or by porting the Font Software to a new environment. "Author" refers to any designer, engineer, programmer, technical writer or other person who contributed to the Font Software. PERMISSION & CONDITIONS Permission is hereby granted, free of charge, to any person obtaining a copy of the Font Software, to use, study, copy, merge, embed, modify, redistribute, and sell modified and unmodified copies of the Font Software, subject to the following conditions: 1) Neither the Font Software nor any of its individual components, in Original or Modified Versions, may be sold by itself. 2) Original or Modified Versions of the Font Software may be bundled, redistributed and/or sold with any software, provided that each copy contains the above copyright notice and this license. These can be included either as stand-alone text files, human-readable headers or in the appropriate machine-readable metadata fields within text or binary files as long as those fields can be easily viewed by the user. 3) No Modified Version of the Font Software may use the Reserved Font Name(s) unless explicit written permission is granted by the corresponding Copyright Holder. This restriction only applies to the primary font name as presented to the users. 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font Software shall not be used to promote, endorse or advertise any Modified Version, except to acknowledge the contribution(s) of the Copyright Holder(s) and the Author(s) or with their explicit written permission. 5) The Font Software, modified or unmodified, in part or in whole, must be distributed entirely under this license, and must not be distributed under any other license. The requirement for fonts to remain under this license does not apply to any document created using the Font Software. TERMINATION This license becomes null and void if any of the above conditions are not met. DISCLAIMER THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT SOFTWARE. Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries. This Font Software is licensed under the SIL Open Font License, Version 1.1. This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL ----------------------------------------------------------- SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ----------------------------------------------------------- PREAMBLE The goals of the Open Font License (OFL) are to stimulate worldwide development of collaborative font projects, to support the font creation efforts of academic and linguistic communities, and to provide a free and open framework in which fonts may be shared and improved in partnership with others. The OFL allows the licensed fonts to be used, studied, modified and redistributed freely as long as they are not sold by themselves. The fonts, including any derivative works, can be bundled, embedded, redistributed and/or sold with any software provided that any reserved names are not used by derivative works. The fonts and derivatives, however, cannot be released under any other type of license. The requirement for fonts to remain under this license does not apply to any document created using the fonts or their derivatives. DEFINITIONS "Font Software" refers to the set of files released by the Copyright Holder(s) under this license and clearly marked as such. This may include source files, build scripts and documentation. "Reserved Font Name" refers to any names specified as such after the copyright statement(s). "Original Version" refers to the collection of Font Software components as distributed by the Copyright Holder(s). "Modified Version" refers to any derivative made by adding to, deleting, or substituting -- in part or in whole -- any of the components of the Original Version, by changing formats or by porting the Font Software to a new environment. "Author" refers to any designer, engineer, programmer, technical writer or other person who contributed to the Font Software. PERMISSION & CONDITIONS Permission is hereby granted, free of charge, to any person obtaining a copy of the Font Software, to use, study, copy, merge, embed, modify, redistribute, and sell modified and unmodified copies of the Font Software, subject to the following conditions: 1) Neither the Font Software nor any of its individual components, in Original or Modified Versions, may be sold by itself. 2) Original or Modified Versions of the Font Software may be bundled, redistributed and/or sold with any software, provided that each copy contains the above copyright notice and this license. These can be included either as stand-alone text files, human-readable headers or in the appropriate machine-readable metadata fields within text or binary files as long as those fields can be easily viewed by the user. 3) No Modified Version of the Font Software may use the Reserved Font Name(s) unless explicit written permission is granted by the corresponding Copyright Holder. This restriction only applies to the primary font name as presented to the users. 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font Software shall not be used to promote, endorse or advertise any Modified Version, except to acknowledge the contribution(s) of the Copyright Holder(s) and the Author(s) or with their explicit written permission. 5) The Font Software, modified or unmodified, in part or in whole, must be distributed entirely under this license, and must not be distributed under any other license. The requirement for fonts to remain under this license does not apply to any document created using the Font Software. TERMINATION This license becomes null and void if any of the above conditions are not met. DISCLAIMER THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT SOFTWARE. http://www.adobe.com/type/legal.htmlhttp://www.adobe.com/type/legal.html2:  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a bcdefghjikmlnoqprsutvwxzy{}|~     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXNULLCRuni00A0uni00ADtwo.sups three.supsuni00B5one.supsAmacronamacronAbreveabreveAogonekaogonek Ccircumflex ccircumflex Cdotaccent cdotaccentDcarondcaronDcroatEmacronemacronEbreveebreve Edotaccent edotaccentEogonekeogonekEcaronecaron Gcircumflex gcircumflex Gdotaccent gdotaccentuni0122uni0123 Hcircumflex hcircumflexHbarhbarItildeitildeImacronimacronuni012Cuni012DIogonekiogonek Jcircumflex jcircumflexuni0136uni0137 kgreenlandicLacutelacuteuni013Buni013CLcaronlcaronLdotldotNacutenacuteuni0145uni0146Ncaronncaron napostropheOmacronomacronuni014Euni014F Ohungarumlaut ohungarumlautRacuteracuteuni0156uni0157RcaronrcaronSacutesacute Scircumflex scircumflexuni015Euni015Funi0162uni0163TcarontcaronUtildeutildeUmacronumacronUbreveubreveUringuring Uhungarumlaut uhungarumlautUogonekuogonek Wcircumflex wcircumflex Ycircumflex ycircumflexZacutezacute Zdotaccent zdotaccentuni0180uni018Funi0192OhornohornUhornuhornuni01CDuni01CEuni01CFuni01D0uni01D1uni01D2uni01D3uni01D4uni01D5uni01D6uni01D7uni01D8uni01D9uni01DAuni01DBuni01DCGcarongcaronuni01EAuni01EBuni0218uni0219uni021Auni021Buni0237uni0243uni0250uni0251uni0252uni0254uni0258uni0259uni0261uni0265uni026Funi0279uni0287uni028Cuni028Duni028Euni029Eh.supsj.supsr.supsw.supsy.supsuni02BBuni02BCuni02BEuni02BFuni02C8uni02C9uni02CAuni02CBuni02CCl.supss.supsx.supsuni0300uni0301uni0302uni0303uni0304uni0306uni0307uni0308uni0309uni030Auni030Buni030Cuni030Funi0312uni0313uni031Buni0323uni0324uni0326uni0327uni0328uni032Euni0331a.supsb.supsd.supse.supsg.supsk.supsm.supso.supsp.supst.supsu.supsv.supsc.supsf.supsz.supsuni1E0Cuni1E0Duni1E0Euni1E0Funi1E20uni1E21uni1E24uni1E25uni1E2Auni1E2Buni1E36uni1E37uni1E38uni1E39uni1E3Auni1E3Buni1E42uni1E43uni1E44uni1E45uni1E46uni1E47uni1E48uni1E49uni1E5Auni1E5Buni1E5Cuni1E5Duni1E5Euni1E5Funi1E60uni1E61uni1E62uni1E63uni1E6Cuni1E6Duni1E6Euni1E6FWgravewgraveWacutewacute Wdieresis wdieresisuni1E8Euni1E8Funi1E92uni1E93uni1E97uni1E9EYgraveygraveuni1EF4uni1EF5uni1EF6uni1EF7uni1EF8uni1EF9 zero.supsi.sups four.sups five.supssix.sups seven.sups eight.sups nine.supsparenleft.supsparenright.supsn.sups zero.subsone.substwo.subs three.subs four.subs five.subssix.subs seven.subs eight.subs nine.subsparenleft.subsparenright.subs uni0259.sups colonmonetarylirauni20A6pesetadongEurouni20B1uni20B2uni20B5uni20B9uni20BAuni2215 zero.dnomone.dnomtwo.dnom three.dnom four.dnom five.dnomsix.dnom seven.dnom eight.dnom nine.dnomparenleft.dnomparenright.dnom uni0300.cap uni0301.cap uni0302.cap uni0303.cap uni0304.cap uni0306.cap uni0307.cap uni0308.cap uni0309.cap uni030A.cap uni030B.cap uni030C.cap uni0327.cap uni03080304uni03080304.cap uni03080301uni03080301.cap uni0308030Cuni0308030C.cap uni03080300uni03080300.cap uni030C.a uni0326.amUruby-prof-0.16.2/doc/fonts/SourceCodePro-Bold.ttf0000644000175600017570000021304012766254554020615 0ustar pravipravipFFTMfhOS/2sx`cmap_ceXcvt "fpgmY7 `sgaspglyfpeheadu6hheaA4$hmtxf]~locabk3 <vmaxpSX nameDp;Xpost6z 3prep~ AZR_<:Qc XXKX^2    ADBE "` MXSF@~@FFJ8R3*#.<>=5tFbb T7A^l,@J;DkAB&J$F2@8JiV<=HC/7R4HO*L>$H/H/t51>%Fji4`C$Gp+FFeF>0<g 7^^^^JJJJB&&&&&T@@@@I=======C7777OOOO/H/////F/>>>>H = = =7C7C7C7CA/^7^7^7^7^7,4,4,4,4@JOJOJOJOJO;*DLLk>k>k>k !>BHBHBH&/&/&/ FtFeFt2525252511@>@>@>@>@>@>8F8F8F:.&/@> =JO&/@>@>@>@>@>,4&/251* H/H467/< 42S|pE"svA/A/,4@H@Hk>7>k>A$BHBHBHFjFjFB2525118F1@P4FFOC[-COX$F4 ~1Ie~7CRTYaeoy $(.1CIMPRX[!%+;Ico    " : D q y "" 4Lh7CPTXaeoy#&.1CGMORV[  $*6BZl    " 9 D p t } ""wnl@% zsrmkZWTSROM zjbRJHE?}zuigfc_]Z   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abctfgkzrmxluiyn~ep?od6{vs}~|w,K PXYD _^-, EiD`-,*!-, F%FRX#Y Id F had%F hadRX#eY/ SXi TX!@Yi TX!@eYY:-, F%FRX#Y F jad%F jadRX#Y/-,K &PXQXD@DY!! EPXD!YY-, EiD` E}iD`-,*-,K &SX@Y &SX#!#Y &SX#!#Y &SX#!#Y &SX#!@#Y &SX%EPX#!#!%E#!#!Y!YD- ,KSXED!!Y-+++% +.& ++ E}iDK`RXYs H  B {   6D.4jlbFDT  L  V  > * r ( ,&\zt2VtTl(T0^f6Pn,4p>pz $ 0 < H T ` l !!!!&!2!!!!!!!"""""""##|######$~$$$$$$$$$%n%z%%%%%%&v&&&&&'*'6'B'N'Z'f'(v((((((((((()))))))*4*******+++ +,+8+D+,,&,2,>,J,V,b,-4-@-h-t-----.. ..$.0.<.H....////&///////0:00001 11"1.1:1F1R1^1j1v111111111112222*2333(343@3L3X3d3p3|334"4z45B566l6x66666666666777 7,787D78*868B8N8Z8999:l:;;h;>`>>?2?n?@$@,@4@X@|@@@@@@@@@@@@@A.AAAABBPBdBBBCC@CbCCCCDD6DjDDDEE0EEF:FGG^GGHJHHI IDIIIIIIIIJJJ J,J8JDJRJbJnJzJJJJJJJJJJKKKK&K2K>KJKVKbKnKzKKKKKKKKKKKL L~LLLLLLLLLMM,MPMZMhMvMMMMMNN4N>NHNRN\NfNpNzNNNNNNNNOOOO&O0O:OP.PQdQR:RSJST$TTUUULUpUVV@VVW WWX X,X>XRXrXXXYYYEX/>Y ܸ01'3#4632#"&`49++99++9-77--99S/' | FEX/ >YEX / >YEX/>YEX/>Y++ иииииии017#537#53733733#3##7##7#JUO[ThTO[ T_UgUh ^n^^n^nn@ ,G/'/&ܹܺ&9и&9&)01.#"#5.'732654.546753#?)E+AKA+VTb1h&@0U0$&+ALA+XLb4M.+>-?])!d!*>.AV + H'D&J AEX3/3 >YEX!/!>YEX/>Y!3!9 !39 +ии3ܸии ;>017327.'>54&#"&'#".54>7.54>32>71( #?-%{, 3(#DF%Y73N5&*<%JS#,=  %.C$$#").'/PD3,&; J,/ +01'3##ZM +01.5467bqqbRYQ)@-RW䎎WAWv;i`Y+A~M +01>54&'7~-@)QYRbqqbr+Y`i;vWAW䎎W@[6//9и и 01?'7737'xa N a@ttDG++GD,F^6 +и 01#53533##llhh' +0165#".54632'A/>>jh-a &/8[Q` F~EX / >Y0174>32#"&++@44@i+  +2CCJ`EX/>Y01#3{I{f8 '3KEX / >YEX/>Y (9(/.01".54>32"32>54."&54632,7Z@##@Z77Z@##@Z7)))) ++ ++ +T|QQzS))SzQQ|T+!1R>>S33S>>R1)##))##)R{ =EX / >YEX/>Yи й01%!53#5>7398O#lwwwo[ 3!CEX/ >YEX / >Yк 9017>54&#"'>32>;!:DpP,62&?O17=%2R;!&AT.?#T9cVL"/1'O& 5J.(SSS(|*-SEX/ >YEX*/*>Y *9 / " 901732654.#52654&#"'>32#"&'n O,4C,J8^M2,&@!J/k>4V>"@9,E/1)#.{ YEX/ >YEX / >Y+ и и и015467###5!533U$`}P PkO6pe~.{$UEX/ >YEX!/!>Y +!!9и01732654&#"'!!>32#"&'p I-6EA3A &,O<#)EZ1Ss'%2102 *A|w0J35R93&<!2WEX/// >YEX%/%>Y+%%/9 /01%2>54&#".#">32#".54>32:#4*<$< 5)"S$*G5%?R.1\H,.Mb5Df b '1+"&3 /L8!$0J22N8$LwTYT)->{3EX/ >YEX/>Y 013>7!5!#+D2WEX'/' >YEX:/:>Y' 9 //и//ܸ 01732654.'7654&#"4>75.54>32#".B1-7)8"#0.,#1F!+(5 9P/0M65&,  =Z:7X>!*/'( 2+2%-$%',/& G3(A.-A'-F (3 &@/.@52WEX%/% >YEX///>Y+/%9%/01267.#"32>7#".54>32#"&'<$#4c< 5)#S#*H5%?R.1]H+.Lc4Df!V#%3 '1+/M8!%0J21O8$LwTYT)."'C'"'Cty;+и/9и/01%%t ~F&tby;+и/9и/015%5%5~ b)*EX'/'>Y +'!ܸ01&>54&#"'>324632#"&'"* 0R$b<+K7 $("9++99++9!5*"  K(2)=)!0("%+-77--99m&6@? '+1+:+>+19=01%#'##".54>754.#"3267#".54>3232675&N <)/"#A\9 2!#F8#$;L)-;**T6YEX / >Y  + 01'.'###3#n    (˰˜<1n34m1YEX/>Y%9%/ %9&0132+2654&+254&+T3W@% *FH&D[560143@v9=@&>/,& JB2H/+%% Y+'799EX/ >YEX/>Y 014>32.#"3267#".70TrA?a!Q6##:+\J#9QR|?pT1BQX.3 [6N1eo Y`+T}A, 9EX/ >YEX / >Y 0132+72>54.+AGtR--QpD&?--?&&OzTT|Q(w1P;:O/b^ MEX/ >YEX / >Y 9/ 01!!3#!!^%H|{|l CEX/ >YEX / >Y 9/01!!3##l||,##MEX/ >YEX/>Y 9/014>32.#"32675#53#".,/Qn?B] Q2' 6(MN" _!l??mQ.BRW.3 [6N1eo px0+T}@ IEX/ >YEX / >Y 9 /и 013353###@tJ AEX/ >YEX / >Yи 0173#5!#3!JĘ<|||l|;5EX/ >YEX/>Y0173265#5!#".':B32:]C:84H3D'{R0U@% )DR kEX/ >YEX/ >YEX / >YEX/>Y9 9 и 01333##D֣L xdk +EX/ >YEX/>Y013!!k"K|AMEX/ >YEX/>Y+и и0133?3#54>7##/##AB?w32A21uZZtOTOOTOBYEX/ >YEX / >Y 9к 9  0133.=3#'##B8849tE6|:&25EX / >YEX/>Y 01".54>32'2654&#",:aE&&Ea::aE&&Ea:3<<33<< /X~PP}U--V}OP~X/scbnnbcsJ7GEX/ >YEX/>Y 9 / 0132+#254&+J5]E()F\4[w<;R1Q;9T6Rh3*$ND *KEX/ >YEX/>Y'+$01"32654&#".'.54>323267)4::43;;00PA0Xh&D`;:`D&^QC# nbcsscbnJ .A&P}U--V}O#FHSEX / >YEX / >Y 9 /  и 013254&+'##32Hw<;H}M4[E(@4`a0&/N:H]2'/IEX/ >YEX,/,>Y,9 ,901732654./.54>32.#"#"&'%W+3/%T3&#?X5YEX/>Y01#5!##Ô||@3EX/ >YEX/>Y 01332653#"&5@,//-swxv`;>>;oI 3EX/ >YEX / >Y 0133>73#NMı6e66e60tT!MEX/ >YEX / >Y + ии 0133>?33>73#'.'##-Y+Q)  '*R**R*(T**S)[tAAF]EX/ >YEX/>Y99 к 9к90133>?3#'.'##г?   :G  DO={33{33H@EX/ >YEX / >YEX/>Y901733>?3#ҞBBҔ&H''H&P8# =EX/ >YEX/>Yи017!5!!!825Y{YI|h++01!#3!'N@NJ`EX/>Y013#J{I{ih++01#5!!5'JNNV &EX/ >Yܺ9 013#/##vy.--.yt<\ +01!5 6nn>~=)EX/>YEX/>YEX/>Y9/! !99$%0174>7.#"'>32#'##".732675=$O|X33$I*43u@hxx &Z0&<*% !:7H**?,"&`&nr8')6+RH)!EX/>YEX/>YEX/>YEX/>Y99!013>32#"&'##732654#"HI$.K3$YEX/>Y 0174>32&#"3267#".C/Oh9;_ D77@PM>'B<-m3;dK*>aB#&['LAAL]&##Ba/#EX/>YEX / >YEX/>YEX / >Y99!0174>32'53#'##".732675.#"/$;L)+:x H&/M72.*));=`C$MC3$$C`?JDD7"#CEX/>YEX/>Y# + 0174>32!3267#".%4&#"7+H]29X:Q7"=!0*h2:dJ+f.3(> =`C$$@W3$ 81X#C`t*4.0RIVEX/>YEX/>YEX / >Yи  01&#"3###5754>32-170-6T:+K B*-s}m +J7  4-<DPEX"/">YEX%/%>YEX$/$>YEX@/@>YEX / >Y@  ии 7/ܹE1E/91и%&$'"K0132654&+"&'475.54675.54>323##"';2#".2654&#"C;#xM!&#:M*.$e  7K+ $ (,\bg*LnC0S<"--++># $=& ( 2A,-C- k #+>)  :C'B/0k))())())HeEX/>YEX/>YEX/>YEX / >Y 9013>32#4&#"#H#)1TM )-_ l^2.O;EX/>YEX/>Yܸ 01!##%"&54632OZ +77++77}0))33))0*<AEX/>YEX/>Yܸ01!#"&'73265#%"&54632OZ5YC.K +15' +77++77.-R>%i 36e0))33))0LI mEX/>YEX/>YEX / >YEX/>Y 9 9 и 013373#'#L˟IkM}> 5EX/>YEX/>Y01!3267#"&5#># &!""&^_ l o_$= EX/>YEX / >YEX/>YEX / >YEX/>YEX/>Y 9 и  0133>32>32#4#"#4#"#$n 1+!- 5*4:q >+)("/UKQ.0Q.HeEX/>YEX/>YEX/>YEX / >Y90133>32#4&#"#Hx  S8TN )-B .l^2./)5EX/>YEX/>Y0174>32#".732654&#"/*G[11[G**G[11[G*33333333>aB##Ba>>aB##Ba>ALLAALLHH) EX / >YEX/>YEX/>YEX/>Y 9 9  01#33>32#"'732654#"ۓx N(.J4$YEX / >YEX/>YEX / >Y99!0174>32373#57#".732675.#"/$;L)*A sF#/M72.*));=`C$!3XL $C`?JDDt$TEX/>YEX/>YEX/>Y9 0133>32.#"#tx %hYEX,/,>Y,9,901732654&'.54>32.#"#"&'w+W23,IYEX/>Yии 01#5?33#3267#".5}y260!Q0;R3}ms9/ j  9P1> eEX / >YEX/>YEX/>YEX/>Y901!#'##"&5332673 x !P6UL*+G&-l^22.!F9 <EX/>YEX / >YEX / >Y0133>?3#N    N&L''L&T!tEX/>YEX / >YEX/>YEX!/!>YEX/>Y!9к90133>?33>?3#'.'## g! M %H&&J#%H&&H%#G(D3%2eEX/>YEX / >YEX/>YEX/>Y9и и01'33>?3#'.'##ѡ3    ,9  1P+,PR,+R>;[EX/>YEX/>YEX/>YEX/>Y 901326?33>?3#"&'7]+1 גS   I*6G/&H$#K'%K% /G/pF =EX/>YEX/>Yи017#5!!!F )O.sNsjh7+34++  +' 9014>54.'5>54.546;#";#"& 5((5 Z`M)( .66. ()M`Z *''  V  ('+Q=N(N-93  39.L)N=m +013#낂ih7+5++'(+ ('9012>54&54675.54654.+532+5' .66. ')M`Z 5))5 Z`MJ)L.93  39-N(N=Q+'(  V  ''*Q=N4$'++ и01>323267#".#"4 T/.'#&X T/.'#'NC(*)NC(*REX/>Y ܸ01#737#"&54632p`49++99++9)-77--99` $\EX/ >Y! + + и/!и/  и / ܸи/01#5.54>753&'>77$$%#D"Q1O8 :N/Q'?C$@--AE__(AX65V?)a]Z C&*WEX/ >YEX/>Y +и  и#01%!5>54'#57.54>32.#"3#&4BpT "Y#O,07||[O6 V(/L5*'P.0$[$4$?4S*"+ (+01?&5467'76327'#"'32654&#"$Q"PIY0642YIQ"RIZ47.Zi2$$22$$2R.A 7RJZZJR-@!7RJ[ [ -55--559{lEX/ >YEX / >YEX/>Y 9 йиܸйи 013>?33#3##5#535#53=={!B !B F7FF7F%m++013##낂Jl:G AO+%+>+.%9>+9.9к8.9801654.'7.#"#"&'732654.5467.54632 3>$ 2=%86(=G=(+) 0H/7j"T3<';E;',&]U:\ Q!&!' -@-,A&":*)+K3-@/&C(DU)p;E'EMEX/ >YEX/>Y#-й4Aй:014>32#".732>54.#"4>32.#"3267#".-Mf99fM--Mf99fM-@9P11P99P11P980?"'57 %'&!/7!&?.ENzU--UzNN{W..W{N>dH''Hd>=dG&&Gd>,G2= =-3< D3IU+'|F^~ +01!#5!Fl~F~e7'5>=+ +62+)и2/и4и101".54>32'2>54.#"'32#'##72654&++)H66H))H66H)5''5 4''41Y#.*<:N76J,,J66J,,J61(8##8((8##8( "M<32'2654&#"-5''55''5%%%%'4 5''5 4'F)! )) !)F6 DEX/>Y+ܸии  01#53533##!!ll4&hh6h>><K's'/EX/>YEX / >YEX / >YEX/>Y  9013326733:7#"&'##"&'#>#"0 %19 >%%6*"+2,`]Tm0.,- YEX/ >Y013##".54>;|4(1WB&&AV1*$;W9?U5#U<.'|Q|'D&G|'D&R'D&gF)*EX'/'>Y +'!ܸ01%3267#".54>'7#"&54632'"* 0Q$b<+K7 $("8,+88+,8"4*" ! J)2(>)!0("%+-77--99 O6&&# O6&&$ O6&&% OG&&& OH&&* O}&&,SfEX/ >YEX/>YEX / >Y ++01#!5##!#3#7  pv-|vv1]+]|||7#9&(/0^6&*#^6&*$^6&*%^H&**J6&.#J6&.$J6&.%JH&.*2!SEX/ >YEX/>Y+и01#5732+72>54.+3#GEEFtR--PqC&?--?&kk-B&OzTT|Q(w1P;:O/GBG&3&&26&4#&26&4$&26&4%&2G&4&&2H&4*Tp# ) + 9 и и01?'77'TIIIJJJC*}EX&/& >YEX/>Y&9и&9 и& иии (01732654&/&#"#"''7.54>327%3<&)3<<&Ea:R;3N@&Ea:U?5Nsc!l$nb,$'*kBP~X/,I2]+rFP}U-0M2@6&:#@6&:$@6&:%@H&:*H6&>$I69EX/ >YEX/>Y ++01332+#7254&+I[5]E()F\4[w<;Rc1P;:S6{h3)=;9ZEX/>YEX9/9>YEX/>Y""94%49014>32#"&'732654.54>54&#"#=8V90H.")",A+*?"1*")")&.P;!/= $1'!%3$"<,d ".!,(+#<3=&F=&F=&F=&F=&F=&FQ09EEX / >YEX/>YEX&/&>YEX,/,>Y1+ ,9/ & 9&)& 96,<C017467.#"'>32>32#3267#"&'#".%4.#"3267./or94*P+,7:,&:'0#%2H 6G'C""3# %.!1+MS#$`(!%$&AW1" 33 ^*#)$(7$140' )C#$&H)7"&J 7"&J 7"&J 7"&J O&-O&-O&-O&-/&4kEX///>YEX/>Y# +&/9&/9)и2и,01%265<'.#"#".54>32.''7&'77,4=8 6? ,@O#A_<3ZC($>O,$B1#&x+3@&I"&kLK :<-Y76T:-I KA<Y)EAH&S/)&T/)&T/)&T/)&T/)&TFIK %+ܸܸܸ01"&546324632#"&!!,#..##..t.##..##.4+""++""+"++""++ h/) *}EX&/&>YEX/>Y&9и&9 и& иии (01732654&/&#"%#"''7.54>327"33$"33!*G[1L?,7.!*G[1L>-7{QAAQA#!X7>aB#(5*8 X7>aB#'6+> &Z> &Z> &Z> &Z>;&^HH)$EX/>YEX/>YEX/>YEX/>Y99"$01#3>32#"&'532>54&#"ۓG&.J3%;&^ O-&&'=&F O6&&(=&F !e (eEX/ >YEX/>YEX/>YEX/>Y% ++01'.'##"&54>7#'##33267n   ;0B ('(˰!  <1n34m1<61-)!t =.+1=EX/>YEX-/->YEX/>YEX / >Y-9/ (и-590174>7.#"'>323267#"&54>7'##".732675=$O|X33$I*43u@hx1' :-= &Z0&<*% !:7H**?,"&`&nr0B.-%:')6+R796&($6C$&H)796&(%6C$&H)79W&()6C$&H)796&(.6C$&H)A,6&).x&I82/R *EX/>YEX'/'>YEX/>YEX/>Y )+!9!9   и $и)%01&#"3267#'##".54>32'5#53533}'**<2.*Bx H&/M7$;L)+:BO!>BE?3$"A\;:]A"M,GJJ^-&*'7"&J ^6&*(7"&J ^W&*)7"&J ^!*#^EX/ >YEX / >YEX"/">Y++"01!!3#!#3267#"&54>7!^% !;0C |{|  J1-(!7."18^EX"/">YEX/>YEX/>Y8*+."501%3267#"&5467#".54>32!3267'4&#"!+  :-;% :dJ++H]29X:Q7"=!A.3(> .$B.-%:#C`>=`C$$@W3$ 81*4.0^6&*.7"&J ,#6&,%4-<&L,#6&,(4-<&L,#W&,)4-<&L,#&,"4-<&L9@6&-%f&M%j0UEX/ >YEX/ >YEX/>YEX / >Yܹܸи ии01#37#####57533533====UUA`___EX/>YEX/>YEX/>YEX / >Y+9ии01>32#4&#"##57533##)1TM )-BB l^ 2.,AKJG/JG&.&O&-J-&.'O&-J6&.(O&-J!#`EX/ >YEX / >YEX"/">Y+"и0173#5!#3#3267#".54>7#JĘ)" ";) |||l|/ J #(!O.&gEX/>YEX/>YEX/>YEX/>Y ܸ!01#5!3267#"&54>7#"&54632Z( :-=  *C+77++77}s/B.-%90))33))0JW&.)O/EX/>YEX/>Y01!##OZ};6&/%*<&\-DR&0LI&PLI mEX/>YEX/>YEX/>YEX / >Y 9 9 и 013?3#'#L˟JH{k 6&1$> m&Q$7k &1 > &Q>k &18> &Q8k'&1 9&Q!  IEX/ >YEX/>Y9и и 01%!55737 KJJ||)r)Tqrq> WEX/>YEX/>Y 9  и  ии01%#"&=575#5!73267 ""&^_qq# & o_R?u@tPuQ B6&3$H&SB&3H&SB6&3.H&S&mEX/>YEX$/$>YEX#/#>YEX/>Y +&#9&!0167#"&54632%>32#4&#"#3.i )25*9=WXfG2JE!x p/[2*.7UKR}(-k]!1-@&2-&4'/)&T&26&4(/)&T&26&4-/)&TS!OEX/ >YEX/>Y  + и014>3!#3#3!".7;#"*Je;"yy:bH(((ITzO&{{|(Q|T;Q1/N P 4=EX/>YEX/>YEX*/*>YEX0/0>Y5+0 *9*#-*9:01732654&#"4>32>32#3267#"&'#".%4.#"  3D&+<>%%:'/#"2F'C:-&C2 "AMMAAMMA>aB#/'*,&AW133 ^(%&'#Bam$14FH6&7$t$&W'FH&7e$&WFH6&7.t$&W'2'6&8$5&X 2'6&8%5&X 2#'&8/5#&X 2'6&8.5&X #9&9/1#&t&YI96&9.1&&Y8@G&:&> &Z@-&:'> &Z@6&:(> &Z@}&:,> &Z@6&:->&Z@!(REX/ >YEX / >YEX%/%>Y+%%013326533267#"&54>7.5@,./.>>$ ";0Cjh`;>>;o^w  J1-&v>.!(EX/>YEX'/'>YEX/>YEX / >YEX/>Y к9#&01!3267#"&54>7'##"&5332673 2& :-= !P6UL*+/B.-%I&-l^22.!FT6&<%T&\H6&>%>;&^HH&>*8#6&?$F&_8#W&?)F&_8#6&?.F&_) )EX/>YEX#/#>YEX/>YEX/>Y"+9 9  "!и"&и'01732654#"'>32#"&'###57533#-)8[/-I$.K3$`B#" 6,AKJG/:0"CEX / >YEX/>Y+ 013267>32#".547!.#"5*'7 "[?7[B$%B]88\B$`;6#2KKLKG )-W}PP~W.-V}OSU.&+BEX&/& >Y+ +& и 01.#"3##"&'7>?#5737>32 &'s-G6!2 WK2I4 +#7k-N:! l 6+e+7N2&S ,GEX$/$ >YEX/>Y$$9&01%2654&#"#".54>32>54&',3<<33<<= >0$)&Ea::aE&&Ea:B8 sscbnnbcs)3< +RP~X//X~PP}U- /I~ -GEX$/$>YEX/>Y$$9'01%2654&#"#".54>32>54&',33333332 <."(*G[11[G**G[15$ kLAALLAAL)3: !_=>aB##Ba>>aB# @$"JEX/ >YEX/ >YEX / >Y 01#"&5332653>54&'w !.swxv,//-F $)+`;>>;  >n#aEX/>YEX/>YEX/>YEX / >Y 9 01#'##"&5332673>54&'Q 8)x !P6UL*+1 )19 >G&-l^22.!F  O6&&.=&FJ6&..O&-&26&4./)&T@6&:.> &Z@&:1> 9&Z0@&:3> P&Z2@&:5> P&Z4@&:7> P&Z6,#6&,.4-<&L&!2&2KEX/ >YEX / >Y#+ и '-01#"&5467.54>323267'2654&#";0C(YEX/>YEX$/$>Yи$* 001467.54>323267#"&32654&#"%-Q<$*F[21\F*.@'$ :-=33333333w&8(BZ9>aB##Ba>2L<-.B.ALLAALL2'&8 5&X9&91&t&YD*<5EX/>YEX/>Y01!#"&'73265#OZ5YC.K +15'.-R>%i 36e 0 ,cEX$/$ >YEX/>Y иии и$ 9  и"и!01%2654&+3#3254&++5#5732)<>==Bjj5g336FH'C\5KK3W?$49i644/@GF$Q$ OE4K1A%<,)JH")vEX/>YEX/>YEX/>Y9/9!$%013267#"&533>324&#">"$O|X33$I*43u@hxx &Z0%=*% !:7H*g*?-"&a&nr8')6+R/ #EX/>YEX/>YEX/>YEX/>Y99 01732675.#"4>32373#'##".2.*));$;N*&C sx K$/M7JDDH=`C$!33$$C`H) "EX/>YEX/>YEX/>YEX/>Y99 01%4#"3267#"&'##33>32^+,):$YEX/>Y 01%#"&'732654&#"'>32,Kg:5i+<=%AQI< :D h?9cK+>aB##&]LAAL[&#Ba6!#CEX/>YEX/>Y+  01%#"&'73267!.54>32.#"!+Jd:2h*0!="7N  >[;0ZD) 7*25>`C#X18 $3W@$$C`0.4*7"#CEX/>YEX/>Y#+ 017467!.#"'>32#".732677O A6"B1+g2;aE&)F]3:X<12+;$ 61\$C`=YEX/>YEX/>YEX / >Y99 !$%(01326?#".54>32373#"&'2675.#"#M79I#/M7#;N+N9 s*j,+*$6,/#@$AY69]A$?3 eo!0>BYEX/>YEX/>YEX/>Y 901#57#"&5332673S8TM )-_-l^22.K 9 EX/>YEX/>YEX/>YEX/>YEX / >YEX/>Y9  9  01!#'##"&'#"&533273326739n 1, - 5*4:q >+)(!0UK\.0O.O4TEX/>YEX/>YEX/>Y9 01!#'##"&'732673x %hYEX/>Yии 01%3##5#5354&#"'>32}y260!Q0;R3sss9/ j 9Q19 @EX / >YEX/>YEX / >Y 901!#'.'##39N    N&L''L&T!i /EX/>YEX / >YEX/>YEX/>Y 99901!#'.'##'.'##33>?3T g! M %H&&J#%H&&H%#G(D39REX/>YEX/>YEX/>Y 9 01&#"#'.'##>32). גS   I)5E.$O(-#K'%K% .H1pH  cEX/>YEX / >YEX/>YEX/>Y9 9 01###73753 ˟J}$H{:/ /EX/>Y+9013>32#54&#"#h5$92hhp<H>˾4EX/ >Y+ܸ013#"&'7326=#7"&54632$<.0 "~&&''M7) I #~!##!U6/EX/ >Y +90133>32.#"#V@#5hMH)'V",SM!Z/EX/ >YEX / >YEX/ >Yи  0133>?33>?3#'.'##SfG^1xwM02dd00f/,#fMAEX/ >YEX / >Y+9017326?33>?3#"&'7 h/  (ct ". ?./ 0N""  ++0126548'2$$2QNNQ2&&6E88Ep + +01"3&546p2%%2QNNQ&&6E88E>>yx +013#ZP>>~xb +01#3xZk>9$.?=(EX/>Y +0133267#"&=# %D|MK//EX/ >YEX / >Y 9и и01'33>?3#'&'##holioo"l3333>~ +013#Yk> +01#73EkY>>+ܸ013#'##|dk55k__?'+ܹ и01>3232673#".#"# >. K >. K?IFHGP +01!!]> +  ܸ01".'332673,%7$RR$7>+9 ++ 9+9 +01"&54632,+77++7790))33))0p; + и01"&546323"&54632#,,##++#++##,,;-"!--!"--"!--!"--+ܹ01>54&'7$+\L&3g J1(% $  + ܸ01"&54632'2654&#",3>>33>>3$7//77//77=+и013#73#u_Zu_[ԗ>+ܸ013373#k55kd|``E=+и01#'3#'3Z_uf[_u= a +01632#"5467a8 B03'S*Cm +0167#"&546328B03J'S*C"~+01>54&'7"% e .># ,)!0 +01"&54632,+77++770))33))0( + и01"&546323"&54632''''''''())(())(+ ܹ01'>54&'7D50@$ $/*'&% ;6#+и ܹ 01%3'>54&'V 0@$ $/"/#% ; .EX/>Y +014>733267#"& S6 :-=w&*-B.. +01".'332673,#3"RR"3&3""3&C +01!5!^U"9/+ + + 901467&#"'>32#'##"&732675\g5.%!L(AJU309d 6)_5: +CIN!:2 5T/EX/>Y++99013>32#"'##732654#"h/?G(30) Qh  #8p1\K*C-+#_ *2U!T /EX / >Y++99014>32'53#'##"&732675.#"(3%gT0@Lk $(A,1o2 [R/*  *U"!++ +014>32#327#".74&#"/; &9%2"&'#D&@0 '(@-+:!#=,@L! zUBNdEX#/# >Y>+!I+8 +C.+ 89 и.1ии#&01732654&+"&'475.54675.54>323##"&';2#".72654&#",%&1( U4'4A&2  YEX/ >Y 9  9 013373#'#hrq|pQ-h}},QsUT///EX/ >Y ++9и0133>32>32#54#"#54#"#sN . $#'c P bM)6 :1U++014>32#".732654&#"/Y ++ 9 901%#33>32#"&'732654#"hU3?F(3'  #8_ \K*C-E *2UIEX/ >YEX/ >Y +и 01#5?33#327#".5EJ W #3(8"MVVQn$ J &5!MAEX / >YEX/ >Y+901#'##"&=3326753U5#92hh-H=̿ vM 3 /EX / >YEX/ >Y 0133>?3#vh0  0cuxM22U+ +014>32&#"3267#".3C%"50'//$ )@&@0)@-@0*)1 A,@8 /EX/ >Y+ и01.#"3##5#5754>32#Y и017#5!3!#;Q7QA,&)/&I AC,&)/C&I ,#-&,'4-<&L@&-H&M@.&-H.&Mk &1 > &Q>7 -&1&' > &Q'>kC &1 >C &Q>A&2$=&RBW&3)H&SB&3H&SBC&3HC&SFH&7j$&WFH-&7&'j$&W&'FCH&7BC$&W2'W&8)5&X 2'&8 5&X9&91&t&YDC9&91C&t&YDT6&<#T&\T6&<$T&\TH&<*T&\HW&>)>;&^8#&? F&_1&d&Y@5*hEX/ >YEX)/)>YEX/>Y! + ! 9%%9014>32#"&'732654&/7.#"#@:[@WqH*!+@+8LL 33 K%-(.Q<#eRz +9%(F3&Y( 3V}$=>ZH6&>#>;&^H&> H&^Hv&>+>;&^HG&>&>;&^P6 +01!!PH6oD6 +01!!06o"  +01632#"&546757 (36*8=WXkD01*.7TLR}("  +0167#"&54632i )36*932,#<,,<##<,,>77 +01%'7'?>>77Gp +01?'733e/ 0*/EX/ >Yܸ 013#5#7"&54632h}&&''M~!##! _\!_\"U:/ /EX/ >Y+90133>32#54&#"#U5%83hhM*H>˾KWWWWWKWWWKWKWWWKWK W!W"WU!!+++014673.#"'>32#".73267)!&#@ L]-; &9&X %# ?\Q(?-+: ! O3 4EX$/$ >YEX/>Yй$ии ииܸии$!и$#ܸ(#)и(+и1и2и2/01%&+#7&'#7.54>?33273&'672  2 4&($-&Z6 2  2KY"?X7 2  2 2Q02%veKf7R).cciy vFqT4 gbdq O h +C&1}EX/ >YEX/>Y +$'+ и/' и$и/ *и,01%!5>7#573.'#57&54>32.#"3#3#&-?pO[C"Y#O,07||[A,E  E/L5*'P.0 K  J)<{ +EX#/# >YEX'/' >YEX/>YEX/>Y+&+к #9 и& и#ииииии/и&!и!/&)01#3#3'3'#'3'#3##'##5#575#57533533;/!*;/!*GEEYKjFFFFYKjEV0:0:~0:404:;{ !cEX/ >YEX/>Y++  иии 01267#53.##+##575323,6 6,5=+?P,,DD,P?*>3&#IH&"+>)|U'?-[2-VEX/>Y"+ "ܸ'и-)и-,017!!.#"3267#'##"&54>32'5#5353h] "2*##Hd ;#N]2? %/yJJh +&0,aDn$b\*B/CJ11-G1mEX/ >YEX/>Y($+(+и( и$и$!и.01%#".'#57&45<7#57>32.#"3!3#3267G)d=3XG2 @77@l3_%Q4 3BB1#6P-/9U8E  Dpz(&O>9JK7:;{ 5EX./. >YEX$/$>Y "+.йܹ ии и &и)и*и-и4016454&'#27#53&##3#+##575#575323w">~}@5;;F .YEX/>Y&+ии"013#5.54>753.#"3275#KI)b2S<"!YEX/ >YEX / >YEX / >Y   ܸܸ!и"01#5.54>753.'67C012/!O/Q5ZA$#@Z7Q*NQ"+#jTUj$-ed0RrJGrT4][' O Z (X {pEX/ >YEX/ >YEX / >Yиииий  и /01#3##'#5327#573.+5! %LJI6VJtQ E8J12J@QuGDu$'{#]EX/ >YEX/>Y9"ииииии01%>54&'7'5575575377 9,y;odUUUU}",  DiE")Q)7)Q)~MQM7MQMF~ +01!!F4~hGpD(EX/>Y +01".54>32'2654&#", 6((6 6((6  ,?''=++=''?,O(33$$33(8 EX / >Y+01%#5>73#Q Sk@ D,EX/>Y+017>54&#"'>323!5'>@)Y+ +' 901732654춮&#"'>32#"&'-#& "*D)+ #$1F#` 7  > !! &%88EX / >Y+ +и 01%57###5#5733A"!3^x3c>;B==3ȹ8 DEX/>Y+ + 9 01732654&#"'73#>32#"&'++Յ 2;$1"D#` X#3.(D &FEX/>Y# ++#901%2654#"7.#">32#"&54>323&d &"'.6!.HN)=) 6C ."0.)]J"=.8&EX/>Y+ 013>7#5!#  # p"854W8 ;Y#+449#901%32654&'7654&#"4675.54>32#"& 5 &"-6H  #1Y++$9$ 01%3267.#"3267#"&54>32#"&'%  #3 &!!.-6!.#8'*=(!6  -!//),>%!=/  +017467.93O)**)O39Ow800g78g008w +01%'>54&'793O)**)O39Pw800g87g008ww6 +013#Qu6x6 +01#73VuQx6+ܸ0173#'#``q55xx==G++ܸи 01".#"#>3232673k" K<'" K<ECEC- +01!!-]6 +ܸ 01"&'332673,BAQQAB66BW +01"&54632,%00%%00+""++""+H + и01"&546323"&54632''''''''((((((((v+ܹ01>54&'7$+\L&3 I1(%}  + ܸ01"&54632'2654&#",3>>33>>35--55--576+и017373#?}Y}Zcxxxx6+ܸ01#'337``q556xx==#+и ܹ 01%3'>54&'V!1@# #/"/#% ; ;9 ++ ииܹ01"&546323"&54632%!!########;#$$##$$#E+ + ܹи 01!!"&546323"&54632*########E$##$$##$;P%+ +и 013#"&546323"&54632;~s^########Po#$$##$$#) + ܸܸи 013#"&546323"&546322vu########x$##$$##$;P++ܹи013373#"&546323"&54632d..dV|%########P::o#$$##$$# ++ ииܹ01"&546323"&54632#'337########*``q55$##$$##$xx<<;P) + ܸܸи 01#'3"&54632#"&54632p^s~r########o#$$##$$#) + ܸܸи 01#'3"&54632#"&54632wuvi########Vx$##$$##$$[ +01'3^$E!+ ܹ01.54>7OC61@$ $/+!'&&; 6>.e#A`   '$9 , E u F ( / $ . 4Q  2 # H9Typographic alternatesTypographic alternatesSource Code ProSource Code ProBoldBold1.017;ADBE;SourceCodePro-Bold;ADOBE1.017;ADBE;SourceCodePro-Bold;ADOBESource Code Pro BoldSource Code Pro BoldVersion 1.017;PS Version 1.000;hotconv 1.0.70;makeotf.lib2.5.5900Version 1.017;PS Version 1.000;hotconv 1.0.70;makeotf.lib2.5.5900SourceCodePro-BoldSourceCodePro-BoldSource is a trademark of Adobe Systems Incorporated in the United States and/or other countries.Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries.Adobe Systems IncorporatedAdobe Systems IncorporatedPaul D. HuntPaul D. Hunthttp://www.adobe.com/typehttp://www.adobe.com/typeCopyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries. This Font Software is licensed under the SIL Open Font License, Version 1.1. This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL ----------------------------------------------------------- SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ----------------------------------------------------------- PREAMBLE The goals of the Open Font License (OFL) are to stimulate worldwide development of collaborative font projects, to support the font creation efforts of academic and linguistic communities, and to provide a free and open framework in which fonts may be shared and improved in partnership with others. The OFL allows the licensed fonts to be used, studied, modified and redistributed freely as long as they are not sold by themselves. The fonts, including any derivative works, can be bundled, embedded, redistributed and/or sold with any software provided that any reserved names are not used by derivative works. The fonts and derivatives, however, cannot be released under any other type of license. The requirement for fonts to remain under this license does not apply to any document created using the fonts or their derivatives. DEFINITIONS "Font Software" refers to the set of files released by the Copyright Holder(s) under this license and clearly marked as such. This may include source files, build scripts and documentation. "Reserved Font Name" refers to any names specified as such after the copyright statement(s). "Original Version" refers to the collection of Font Software components as distributed by the Copyright Holder(s). "Modified Version" refers to any derivative made by adding to, deleting, or substituting -- in part or in whole -- any of the components of the Original Version, by changing formats or by porting the Font Software to a new environment. "Author" refers to any designer, engineer, programmer, technical writer or other person who contributed to the Font Software. PERMISSION & CONDITIONS Permission is hereby granted, free of charge, to any person obtaining a copy of the Font Software, to use, study, copy, merge, embed, modify, redistribute, and sell modified and unmodified copies of the Font Software, subject to the following conditions: 1) Neither the Font Software nor any of its individual components, in Original or Modified Versions, may be sold by itself. 2) Original or Modified Versions of the Font Software may be bundled, redistributed and/or sold with any software, provided that each copy contains the above copyright notice and this license. These can be included either as stand-alone text files, human-readable headers or in the appropriate machine-readable metadata fields within text or binary files as long as those fields can be easily viewed by the user. 3) No Modified Version of the Font Software may use the Reserved Font Name(s) unless explicit written permission is granted by the corresponding Copyright Holder. This restriction only applies to the primary font name as presented to the users. 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font Software shall not be used to promote, endorse or advertise any Modified Version, except to acknowledge the contribution(s) of the Copyright Holder(s) and the Author(s) or with their explicit written permission. 5) The Font Software, modified or unmodified, in part or in whole, must be distributed entirely under this license, and must not be distributed under any other license. The requirement for fonts to remain under this license does not apply to any document created using the Font Software. TERMINATION This license becomes null and void if any of the above conditions are not met. DISCLAIMER THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT SOFTWARE. Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries. This Font Software is licensed under the SIL Open Font License, Version 1.1. This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL ----------------------------------------------------------- SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ----------------------------------------------------------- PREAMBLE The goals of the Open Font License (OFL) are to stimulate worldwide development of collaborative font projects, to support the font creation efforts of academic and linguistic communities, and to provide a free and open framework in which fonts may be shared and improved in partnership with others. The OFL allows the licensed fonts to be used, studied, modified and redistributed freely as long as they are not sold by themselves. The fonts, including any derivative works, can be bundled, embedded, redistributed and/or sold with any software provided that any reserved names are not used by derivative works. The fonts and derivatives, however, cannot be released under any other type of license. The requirement for fonts to remain under this license does not apply to any document created using the fonts or their derivatives. DEFINITIONS "Font Software" refers to the set of files released by the Copyright Holder(s) under this license and clearly marked as such. This may include source files, build scripts and documentation. "Reserved Font Name" refers to any names specified as such after the copyright statement(s). "Original Version" refers to the collection of Font Software components as distributed by the Copyright Holder(s). "Modified Version" refers to any derivative made by adding to, deleting, or substituting -- in part or in whole -- any of the components of the Original Version, by changing formats or by porting the Font Software to a new environment. "Author" refers to any designer, engineer, programmer, technical writer or other person who contributed to the Font Software. PERMISSION & CONDITIONS Permission is hereby granted, free of charge, to any person obtaining a copy of the Font Software, to use, study, copy, merge, embed, modify, redistribute, and sell modified and unmodified copies of the Font Software, subject to the following conditions: 1) Neither the Font Software nor any of its individual components, in Original or Modified Versions, may be sold by itself. 2) Original or Modified Versions of the Font Software may be bundled, redistributed and/or sold with any software, provided that each copy contains the above copyright notice and this license. These can be included either as stand-alone text files, human-readable headers or in the appropriate machine-readable metadata fields within text or binary files as long as those fields can be easily viewed by the user. 3) No Modified Version of the Font Software may use the Reserved Font Name(s) unless explicit written permission is granted by the corresponding Copyright Holder. This restriction only applies to the primary font name as presented to the users. 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font Software shall not be used to promote, endorse or advertise any Modified Version, except to acknowledge the contribution(s) of the Copyright Holder(s) and the Author(s) or with their explicit written permission. 5) The Font Software, modified or unmodified, in part or in whole, must be distributed entirely under this license, and must not be distributed under any other license. The requirement for fonts to remain under this license does not apply to any document created using the Font Software. TERMINATION This license becomes null and void if any of the above conditions are not met. DISCLAIMER THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT SOFTWARE. http://www.adobe.com/type/legal.htmlhttp://www.adobe.com/type/legal.html2:  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a bcdefghjikmlnoqprsutvwxzy{}|~     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXNULLCRuni00A0uni00ADtwo.sups three.supsuni00B5one.supsAmacronamacronAbreveabreveAogonekaogonek Ccircumflex ccircumflex Cdotaccent cdotaccentDcarondcaronDcroatEmacronemacronEbreveebreve Edotaccent edotaccentEogonekeogonekEcaronecaron Gcircumflex gcircumflex Gdotaccent gdotaccentuni0122uni0123 Hcircumflex hcircumflexHbarhbarItildeitildeImacronimacronuni012Cuni012DIogonekiogonek Jcircumflex jcircumflexuni0136uni0137 kgreenlandicLacutelacuteuni013Buni013CLcaronlcaronLdotldotNacutenacuteuni0145uni0146Ncaronncaron napostropheOmacronomacronuni014Euni014F Ohungarumlaut ohungarumlautRacuteracuteuni0156uni0157RcaronrcaronSacutesacute Scircumflex scircumflexuni015Euni015Funi0162uni0163TcarontcaronUtildeutildeUmacronumacronUbreveubreveUringuring Uhungarumlaut uhungarumlautUogonekuogonek Wcircumflex wcircumflex Ycircumflex ycircumflexZacutezacute Zdotaccent zdotaccentuni0180uni018Funi0192OhornohornUhornuhornuni01CDuni01CEuni01CFuni01D0uni01D1uni01D2uni01D3uni01D4uni01D5uni01D6uni01D7uni01D8uni01D9uni01DAuni01DBuni01DCGcarongcaronuni01EAuni01EBuni0218uni0219uni021Auni021Buni0237uni0243uni0250uni0251uni0252uni0254uni0258uni0259uni0261uni0265uni026Funi0279uni0287uni028Cuni028Duni028Euni029Eh.supsj.supsr.supsw.supsy.supsuni02BBuni02BCuni02BEuni02BFuni02C8uni02C9uni02CAuni02CBuni02CCl.supss.supsx.supsuni0300uni0301uni0302uni0303uni0304uni0306uni0307uni0308uni0309uni030Auni030Buni030Cuni030Funi0312uni0313uni031Buni0323uni0324uni0326uni0327uni0328uni032Euni0331a.supsb.supsd.supse.supsg.supsk.supsm.supso.supsp.supst.supsu.supsv.supsc.supsf.supsz.supsuni1E0Cuni1E0Duni1E0Euni1E0Funi1E20uni1E21uni1E24uni1E25uni1E2Auni1E2Buni1E36uni1E37uni1E38uni1E39uni1E3Auni1E3Buni1E42uni1E43uni1E44uni1E45uni1E46uni1E47uni1E48uni1E49uni1E5Auni1E5Buni1E5Cuni1E5Duni1E5Euni1E5Funi1E60uni1E61uni1E62uni1E63uni1E6Cuni1E6Duni1E6Euni1E6FWgravewgraveWacutewacute Wdieresis wdieresisuni1E8Euni1E8Funi1E92uni1E93uni1E97uni1E9EYgraveygraveuni1EF4uni1EF5uni1EF6uni1EF7uni1EF8uni1EF9 zero.supsi.sups four.sups five.supssix.sups seven.sups eight.sups nine.supsparenleft.supsparenright.supsn.sups zero.subsone.substwo.subs three.subs four.subs five.subssix.subs seven.subs eight.subs nine.subsparenleft.subsparenright.subs uni0259.sups colonmonetarylirauni20A6pesetadongEurouni20B1uni20B2uni20B5uni20B9uni20BAuni2215 zero.dnomone.dnomtwo.dnom three.dnom four.dnom five.dnomsix.dnom seven.dnom eight.dnom nine.dnomparenleft.dnomparenright.dnom uni0300.cap uni0301.cap uni0302.cap uni0303.cap uni0304.cap uni0306.cap uni0307.cap uni0308.cap uni0309.cap uni030A.cap uni030B.cap uni030C.cap uni0327.cap uni03080304uni03080304.cap uni03080301uni03080301.cap uni0308030Cuni0308030C.cap uni03080300uni03080300.cap uni030C.a uni0326.amUwruby-prof-0.16.2/doc/RubyProf/0000755000175600017570000000000012766254554015123 5ustar pravipraviruby-prof-0.16.2/doc/RubyProf/FlatPrinterWithLineNumbers.html0000644000175600017570000002631212766254554023247 0ustar pravipravi class RubyProf::FlatPrinterWithLineNumbers - ruby-prof

class RubyProf::FlatPrinterWithLineNumbers

Generates flat profile reports as text. To use the flat printer with line numbers:

result = RubyProf.profile do
  [code to profile]
end

printer = RubyProf::FlatPrinterWithLineNumbers.new(result)
printer.print(STDOUT, {})

Public Instance Methods

print_methods(thread) click to toggle source
ruby-prof-0.16.2/doc/RubyProf/AbstractPrinter.html0000644000175600017570000003772412766254554021135 0ustar pravipravi class RubyProf::AbstractPrinter - ruby-prof

class RubyProf::AbstractPrinter

Public Class Methods

new(result) click to toggle source

Create a new printer.

result should be the output generated from a profiling run

# File lib/ruby-prof/printers/abstract_printer.rb, line 7
def initialize(result)
  @result = result
  @output = nil
end

Public Instance Methods

method_name(method) click to toggle source 
# File lib/ruby-prof/printers/abstract_printer.rb, line 44
def method_name(method)
  name = method.full_name
  if print_file
    name += " (#{method.source_file}:#{method.line}}"
  end
  name
end
min_percent() click to toggle source 
# File lib/ruby-prof/printers/abstract_printer.rb, line 32
def min_percent
  @options[:min_percent] || 0
end
print(output = STDOUT, options = {}) click to toggle source

Print a profiling report to the provided output.

output - Any IO object, including STDOUT or a file. The default value is STDOUT.

options - Hash of print options. See setup_options for more information. Note that each printer can define its own set of options.

print_file() click to toggle source
print_footer(thread) click to toggle source
print_header(thread) click to toggle source
print_thread(thread) click to toggle source
print_threads() click to toggle source
setup_options(options = {}) click to toggle source

Specify print options.

options - Hash table

:min_percent - Number 0 to 100 that specifes the minimum
               %self (the methods self time divided by the
               overall total time) that a method must take
               for it to be printed out in the report.
               Default value is 0.

:print_file  - True or false. Specifies if a method's source
               file should be printed.  Default value if false.

:sort_method - Specifies method used for sorting method infos.
               Available values are :total_time, :self_time,
               :wait_time, :children_time
               Default value is :total_time
# File lib/ruby-prof/printers/abstract_printer.rb, line 28
def setup_options(options = {})
  @options = options
end
sort_method() click to toggle source 
# File lib/ruby-prof/printers/abstract_printer.rb, line 40
def sort_method
  @options[:sort_method] || :total_time
end
ruby-prof-0.16.2/doc/RubyProf/CallInfoVisitor.html0000644000175600017570000001242512766254554021064 0ustar pravipravi class RubyProf::CallInfoVisitor - ruby-prof

class RubyProf::CallInfoVisitor

Public Class Methods

new(call_infos) click to toggle source 
# File lib/ruby-prof/call_info_visitor.rb, line 20
def initialize(call_infos)
  @call_infos = CallInfo.roots_of(call_infos)
end

Public Instance Methods

visit(&block) click to toggle source 
# File lib/ruby-prof/call_info_visitor.rb, line 24
def visit(&block)
  @call_infos.each do |call_info|
    visit_call_info(call_info, &block)
  end
end
ruby-prof-0.16.2/doc/RubyProf/GraphHtmlPrinter.html0000644000175600017570000005207312766254554021252 0ustar pravipravi class RubyProf::GraphHtmlPrinter - ruby-prof

class RubyProf::GraphHtmlPrinter

Generates graph profile reports as html. To use the graph html printer:

result = RubyProf.profile do
  [code to profile]
end

printer = RubyProf::GraphHtmlPrinter.new(result)
printer.print(STDOUT, :min_percent=>0)

The Graph printer takes the following options in its print methods:

:filename    - specify a file to use that contains the ERB
               template to use, instead of the built-in self.template

:template    - specify an ERB template to use, instead of the
               built-in self.template

Public Instance Methods

create_link(thread, overall_time, method) click to toggle source

Creates a link to a method. Note that we do not create links to methods which are under the min_perecent specified by the user, since they will not be printed out.

file_link(path, linenum) click to toggle source
method_href(thread, method) click to toggle source 
# File lib/ruby-prof/printers/graph_html_printer.rb, line 56
def method_href(thread, method)
  h(method.full_name.gsub(/[><#\.\?=:]/,"_") + "_" + thread.fiber_id.to_s)
end
print(output = STDOUT, options = {}) click to toggle source
setup_options(options) click to toggle source
Calls superclass method RubyProf::AbstractPrinter#setup_options 
# File lib/ruby-prof/printers/graph_html_printer.rb, line 26
def setup_options(options)
  super(options)

  filename = options[:filename]
  template = filename ? File.read(filename).untaint : (options[:template] || self.template)
  @erb = ERB.new(template)
  @erb.filename = filename
end
template() click to toggle source 
# File lib/ruby-prof/printers/graph_html_printer.rb, line 73
    def template
'
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
  <style media="all" type="text/css">
    table {
      border-collapse: collapse;
      border: 1px solid #CCC;
      font-family: Verdana, Arial, Helvetica, sans-serif;
      font-size: 9pt;
      line-height: normal;
      width: 100%;
    }

    th {
      text-align: center;
      border-top: 1px solid #FB7A31;
      border-bottom: 1px solid #FB7A31;
      background: #FFC;
      padding: 0.3em;
      border-left: 1px solid silver;
    }

    tr.break td {
      border: 0;
      border-top: 1px solid #FB7A31;
      padding: 0;
      margin: 0;
    }

    tr.method td {
      font-weight: bold;
    }

    td {
      padding: 0.3em;
    }

    td:first-child {
      width: 190px;
      }

    td {
      border-left: 1px solid #CCC;
      text-align: center;
    }

    .method_name {
      text-align: left;
    }

    tfoot td {
      text-align: left;
    }
  </style>
  </head>
  <body>
    <h1>Profile Report: <%= RubyProf.measure_mode_string %></h1>
    <!-- Threads Table -->
    <table>
      <tr>
        <th>Thread ID</th>
        <th>Fiber ID</th>
        <th>Total Time</th>
      </tr>
      <% for thread in @result.threads %>
      <tr>
        <td><%= thread.id %></td>
        <td><a href="#<%= thread.fiber_id %>"><%= thread.fiber_id %></a></td>
        <td><%= thread.total_time %></td>
      </tr>
      <% end %>
    </table>
    <!-- Methods Tables -->
    <%
       for thread in @result.threads
         methods = thread.methods
         total_time = thread.total_time
    %>
      <h2><a name="<%= thread.fiber_id %>">Thread <%= thread.id %>, Fiber: <%= thread.fiber_id %></a></h2>
      <table>
        <thead>
          <tr>
            <th>%Total</th>
            <th>%Self</th>
            <th>Total</th>
            <th>Self</th>
            <th>Wait</th>
            <th>Child</th>
            <th>Calls</th>
            <th class="method_name">Name</th>
            <th>Line</th>
          </tr>
        </thead>
        <tbody>
          <%
             min_time = @options[:min_time] || (@options[:nonzero] ? 0.005 : nil)
             methods.sort_by(&sort_method).reverse_each do |method|
               total_percentage = (method.total_time/total_time) * 100
               next if total_percentage < min_percent
               next if min_time && method.total_time < min_time
               self_percentage = (method.self_time/total_time) * 100
          %>
               <!-- Parents -->
               <%
                  for caller in method.aggregate_parents.sort_by(&:total_time)
                    next unless caller.parent
                    next if min_time && caller.total_time < min_time
               %>
                 <tr>
                   <td>&nbsp;</td>
                   <td>&nbsp;</td>
                   <td><%= sprintf("%.2f", caller.total_time) %></td>
                   <td><%= sprintf("%.2f", caller.self_time) %></td>
                   <td><%= sprintf("%.2f", caller.wait_time) %></td>
                   <td><%= sprintf("%.2f", caller.children_time) %></td>
                   <td><%= "#{caller.called}/#{method.called}" %></td>
                   <td class="method_name"><%= create_link(thread, total_time, caller.parent.target) %></td>
                   <td><%= file_link(caller.parent.target.source_file, caller.line) %></td>
                 </tr>
               <% end %>
               <tr class="method">
                 <td><%= sprintf("%.2f\%", total_percentage) %></td>
                 <td><%= sprintf("%.2f\%", self_percentage) %></td>
                 <td><%= sprintf("%.2f", method.total_time) %></td>
                 <td><%= sprintf("%.2f", method.self_time) %></td>
                 <td><%= sprintf("%.2f", method.wait_time) %></td>
                 <td><%= sprintf("%.2f", method.children_time) %></td>
                 <td><%= sprintf("%i", method.called) %></td>
                 <td class="method_name">
                   <a name="<%= method_href(thread, method) %>">
                     <%= method.recursive? ? "*" : " "%><%= h method.full_name %>
                   </a>
                 </td>
                 <td><%= file_link(method.source_file, method.line) %></td>
               </tr>
               <!-- Children -->
               <%
                  for callee in method.aggregate_children.sort_by(&:total_time).reverse
                    next if min_time && callee.total_time < min_time
               %>
                 <tr>
                   <td>&nbsp;</td>
                   <td>&nbsp;</td>
                   <td><%= sprintf("%.2f", callee.total_time) %></td>
                   <td><%= sprintf("%.2f", callee.self_time) %></td>
                   <td><%= sprintf("%.2f", callee.wait_time) %></td>
                   <td><%= sprintf("%.2f", callee.children_time) %></td>
                   <td><%= "#{callee.called}/#{callee.target.called}" %></td>
                   <td class="method_name"><%= create_link(thread, total_time, callee.target) %></td>
                   <td><%= file_link(method.source_file, callee.line) %></td>
                 </tr>
               <% end %>
               <!-- Create divider row -->
               <tr class="break"><td colspan="9"></td></tr>
          <% end %>
        </tbody>
        <tfoot>
          <tr>
            <td colspan="9">* indicates recursively called methods</td>
          </tr>
        </tfoot>
      </table>
    <% end %>
  </body>
</html>'
    end
ruby-prof-0.16.2/doc/RubyProf/CallTreePrinter.html0000644000175600017570000006433712766254554021065 0ustar pravipravi class RubyProf::CallTreePrinter - ruby-prof

class RubyProf::CallTreePrinter

Generate profiling information in callgrind format for use by kcachegrind and similar tools.

Note: when profiling for a callgrind printer, one should use the merge_fibers: true option when creating the profile. Otherwise each fiber would appear as a separate profile.

Public Instance Methods

base_name() click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 81
def base_name
  @options[:profile] || "profile"
end
convert(value) click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 60
def convert(value)
  (value * @value_scale).round
end
determine_event_specification_and_value_scale() click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 16
def determine_event_specification_and_value_scale
  @event_specification = "events: "
  case RubyProf.measure_mode
    when RubyProf::PROCESS_TIME
      @value_scale = RubyProf::CLOCKS_PER_SEC
      @event_specification << 'process_time'
    when RubyProf::WALL_TIME
      @value_scale = 1_000_000
      @event_specification << 'wall_time'
    when RubyProf.const_defined?(:CPU_TIME) && RubyProf::CPU_TIME
      @value_scale = RubyProf.cpu_frequency
      @event_specification << 'cpu_time'
    when RubyProf.const_defined?(:ALLOCATIONS) && RubyProf::ALLOCATIONS
      @value_scale = 1
      @event_specification << 'allocations'
    when RubyProf.const_defined?(:MEMORY) && RubyProf::MEMORY
      @value_scale = 1
      @event_specification << 'memory'
    when RubyProf.const_defined?(:GC_RUNS) && RubyProf::GC_RUNS
      @value_scale = 1
      @event_specification << 'gc_runs'
    when RubyProf.const_defined?(:GC_TIME) && RubyProf::GC_TIME
      @value_scale = 1000000
      @event_specification << 'gc_time'
    else
      raise "Unknown measure mode: #{RubyProf.measure_mode}"
  end
end
file(method) click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 64
def file(method)
  File.expand_path(method.source_file)
end
file_name_for_thread(thread) click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 91
def file_name_for_thread(thread)
  if thread.fiber_id == Fiber.current.object_id
    [base_name, "callgrind.out", $$].join(".")
  else
    [base_name, "callgrind.out", $$, thread.fiber_id].join(".")
  end
end
file_path_for_thread(thread) click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 99
def file_path_for_thread(thread)
  File.join(path, file_name_for_thread(thread))
end
path() click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 77
def path
  @options[:path] || "."
end
print(options = {}) click to toggle source
print_headers(output, thread) click to toggle source
print_method(output, method) click to toggle source
print_thread(thread) click to toggle source
print_threads() click to toggle source
remove_subsidiary_files_from_previous_profile_runs() click to toggle source 
# File lib/ruby-prof/printers/call_tree_printer.rb, line 85
def remove_subsidiary_files_from_previous_profile_runs
  pattern = [base_name, "callgrind.out", $$, "*"].join(".")
  files = Dir.glob(File.join(path, pattern))
  FileUtils.rm_f(files)
end
ruby-prof-0.16.2/doc/RubyProf/CallInfo.html0000644000175600017570000006212512766254554017506 0ustar pravipravi class RubyProf::CallInfo - ruby-prof

class RubyProf::CallInfo

Attributes

recursive[R]

part of this class is defined in C code. it provides the following attributes pertaining to tree structure: depth: tree level (0 == root) parent: parent call info (can be nil) children: array of call info children (can be empty) target: method info (containing an array of call infos)

Public Class Methods

roots_of(call_infos) click to toggle source 
# File lib/ruby-prof/call_info.rb, line 59
def self.roots_of(call_infos)
  roots = []
  sorted = call_infos.sort_by(&:depth).reverse
  while call_info = sorted.shift
    roots << call_info unless sorted.any?{|p| call_info.descendent_of(p)}
  end
  roots
end

Public Instance Methods

call_sequence() click to toggle source 
# File lib/ruby-prof/call_info.rb, line 41
def call_sequence
  @call_sequence ||= begin
    stack.map {|method| method.full_name}.join('->')
  end
end
children_time() click to toggle source 
# File lib/ruby-prof/call_info.rb, line 22
def children_time
  children.inject(0) do |sum, call_info|
    sum += call_info.total_time
  end
end
descendent_of(other) click to toggle source 
# File lib/ruby-prof/call_info.rb, line 51
def descendent_of(other)
  p = self.parent
  while p && p != other && p.depth > other.depth
    p = p.parent
  end
  p == other
end
detect_recursion(visited_methods = Hash.new(0)) click to toggle source 
# File lib/ruby-prof/call_info.rb, line 13
def detect_recursion(visited_methods = Hash.new(0))
  @recursive = (visited_methods[target] += 1) > 1
  children.each do |child|
    child.detect_recursion(visited_methods)
  end
  visited_methods.delete(target) if (visited_methods[target] -= 1) == 0
  return @recursive
end
eliminate!() click to toggle source

eliminate call info from the call tree. adds self and wait time to parent and attaches called methods to parent. merges call trees for methods called from both praent end self.

# File lib/ruby-prof/call_info.rb, line 79
def eliminate!
  # puts "eliminating #{self}"
  return unless parent
  parent.add_self_time(self)
  parent.add_wait_time(self)
  children.each do |kid|
    if call = parent.find_call(kid)
      call.merge_call_tree(kid)
    else
      parent.children << kid
      # $stderr.puts "setting parent of #{kid}\nto #{parent}"
      kid.parent = parent
    end
  end
  parent.children.delete(self)
end
find_call(other) click to toggle source

find a specific call in list of children. returns nil if not found. note: there can't be more than one child with a given target method. in other words: x.children.grep{|y|y.target==m}.size <= 1 for all method infos m and call infos x

# File lib/ruby-prof/call_info.rb, line 99
def find_call(other)
  matching = children.select { |kid| kid.target == other.target }
  raise "inconsistent call tree" unless matching.size <= 1
  matching.first
end
inspect() click to toggle source
Calls superclass method 
# File lib/ruby-prof/call_info.rb, line 72
def inspect
  super + "(#{target.full_name}, d: #{depth}, c: #{called}, tt: #{total_time}, st: #{self_time}, ct: #{children_time})"
end
merge_call_tree(other) click to toggle source

merge two call trees. adds self, wait, and total time of other to self and merges children of other into children of self.

# File lib/ruby-prof/call_info.rb, line 106
def merge_call_tree(other)
  # $stderr.puts "merging #{self}\nand #{other}"
  self.called += other.called
  add_self_time(other)
  add_wait_time(other)
  add_total_time(other)
  other.children.each do |other_kid|
    if kid = find_call(other_kid)
      # $stderr.puts "merging kids"
      kid.merge_call_tree(other_kid)
    else
      other_kid.parent = self
      children << other_kid
    end
  end
  other.children.clear
  other.target.call_infos.delete(other)
end
root?() click to toggle source 
# File lib/ruby-prof/call_info.rb, line 47
def root?
  self.parent.nil?
end
stack() click to toggle source 
# File lib/ruby-prof/call_info.rb, line 28
def stack
  @stack ||= begin
    methods = Array.new
    call_info = self

    while call_info
      methods << call_info.target
      call_info = call_info.parent
    end
    methods.reverse
  end
end
to_s() click to toggle source 
# File lib/ruby-prof/call_info.rb, line 68
def to_s
  "#{target.full_name} (c: #{called}, tt: #{total_time}, st: #{self_time}, ct: #{children_time})"
end
ruby-prof-0.16.2/doc/RubyProf/FlatPrinter.html0000644000175600017570000001005712766254554020246 0ustar pravipravi class RubyProf::FlatPrinter - ruby-prof

class RubyProf::FlatPrinter

Generates flat profile reports as text. To use the flat printer:

result = RubyProf.profile do
  [code to profile]
end

printer = RubyProf::FlatPrinter.new(result)
printer.print(STDOUT, {})

Public Instance Methods

sort_method() click to toggle source

Override for this printer to sort by self time by default

# File lib/ruby-prof/printers/flat_printer.rb, line 15
def sort_method
  @options[:sort_method] || :self_time
end
ruby-prof-0.16.2/doc/RubyProf/CallStackPrinter.html0000644000175600017570000013525512766254554021231 0ustar pravipravi class RubyProf::CallStackPrinter - ruby-prof

class RubyProf::CallStackPrinter

prints a HTML visualization of the call tree

Public Instance Methods

application() click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 162
def application
  @options[:application] || $PROGRAM_NAME
end
arguments() click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 166
def arguments
  ARGV.join(' ')
end
base64_image() click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 208
def base64_image
  file = open_asset('call_stack_printer.png')
  Base64.encode64(file).gsub(/\n/, '')
end
color(p) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 149
def color(p)
  case i = p.to_i
  when 0..5
    "01"
  when 5..10
    "05"
  when 100
    "9"
  else
    "#{i/10}"
  end
end
dump(ci) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 145
def dump(ci)
  $stderr.printf "%s/%d t:%f s:%f w:%f  \n", ci, ci.object_id, ci.total_time, ci.self_time, ci.wait_time
end
expansion() click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 178
def expansion
  @options[:expansion] || 10.0
end
graph_link(call_info) click to toggle source
link(call_info) click to toggle source
method_href(method) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 133
def method_href(method)
  h(method.full_name.gsub(/[><#\.\?=:]/,"_") + "_" + @current_thread_id.to_s)
end
name(call_info) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 107
def name(call_info)
  method = call_info.target
  method.full_name
end
open_asset(file) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 198
def open_asset(file)
  path = File.join(File.expand_path('../../assets', __FILE__), file)
  File.open(path, 'rb').read
end
print(output = STDOUT, options = {}) click to toggle source

Specify print options.

options - Hash table

:min_percent - Number 0 to 100 that specifes the minimum
               %self (the methods self time divided by the
               overall total time) that a method must take
               for it to be printed out in the report.
               Default value is 0.

:print_file  - True or false. Specifies if a method's source
               file should be printed.  Default value if false.

:threshold   - a float from 0 to 100 that sets the threshold of
               results displayed.
               Default value is 1.0

:title       - a String to overide the default "ruby-prof call tree"
               title of the report.

:expansion   - a float from 0 to 100 that sets the threshold of
               results that are expanded, if the percent_total
               exceeds it.
               Default value is 10.0

:application - a String to overide the name of the application,
               as it appears on the report.
print_commands() click to toggle source
print_css() click to toggle source
print_footer() click to toggle source
print_header() click to toggle source
print_help() click to toggle source
print_java_script() click to toggle source
print_stack(call_info, parent_time) click to toggle source
print_title_bar() click to toggle source
sum(a) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 141
def sum(a)
  a.inject(0.0){|s,t| s+=t}
end
threshold() click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 174
def threshold
  @options[:threshold] || 1.0
end
title() click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 170
def title
  @title ||= @options.delete(:title) || "ruby-prof call tree"
end
total_time(call_infos) click to toggle source 
# File lib/ruby-prof/printers/call_stack_printer.rb, line 137
def total_time(call_infos)
  sum(call_infos.map{|ci| ci.total_time})
end
ruby-prof-0.16.2/doc/RubyProf/CallInfoPrinter.html0000644000175600017570000000545312766254554021053 0ustar pravipravi class RubyProf::CallInfoPrinter - ruby-prof

class RubyProf::CallInfoPrinter

Prints out the call graph based on CallInfo instances. This is mainly for debugging purposes as it provides access into into RubyProf's internals.

Constants

TIME_WIDTH
ruby-prof-0.16.2/doc/RubyProf/AggregateCallInfo.html0000644000175600017570000003620112766254554021311 0ustar pravipravi class RubyProf::AggregateCallInfo - ruby-prof

class RubyProf::AggregateCallInfo

Attributes

call_infos[R]
method_info[R]

Public Class Methods

new(call_infos, method_info) click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 6
def initialize(call_infos, method_info)
  if call_infos.length == 0
    raise(ArgumentError, "Must specify at least one call info.")
  end
  @call_infos = call_infos
  @method_info = method_info
end

Public Instance Methods

called() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 48
def called
  aggregate_all(:called)
end
children() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 26
def children
  call_infos.inject(Array.new) do |result, call_info|
    result.concat(call_info.children)
  end
end
children_time() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 44
def children_time
  aggregate_roots(:children_time)
end
line() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 22
def line
  call_infos.first.line
end
parent() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 18
def parent
  call_infos.first.parent
end
self_time() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 36
def self_time
  aggregate_roots(:self_time)
end
target() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 14
def target
  call_infos.first.target
end
to_s() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 52
def to_s
  "#{call_infos.first.target.full_name}"
end
total_time() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 32
def total_time
  aggregate_roots(:total_time)
end
wait_time() click to toggle source 
# File lib/ruby-prof/aggregate_call_info.rb, line 40
def wait_time
  aggregate_roots(:wait_time)
end
ruby-prof-0.16.2/doc/RubyProf/Profile.html0000644000175600017570000004734612766254554017427 0ustar pravipravi class RubyProf::Profile - ruby-prof

class RubyProf::Profile

Public Class Methods

new() click to toggle source
new(options)

Returns a new profiler. Possible options for the options hash are:

measure_mode

Measure mode. Specifies the profile measure mode. If not specified, defaults to RubyProf::WALL_TIME.

exclude_threads

Threads to exclude from the profiling results.

include_threads

Focus profiling on only the given threads. This will ignore all other threads.

merge_fibers

Whether to merge all fibers under a given thread. This should be used when profiling for a callgrind printer.

static VALUE
prof_initialize(int argc,  VALUE *argv, VALUE self)
{
    prof_profile_t* profile = prof_get_profile(self);
    VALUE mode_or_options;
    VALUE mode = Qnil;
    VALUE exclude_threads = Qnil;
    VALUE include_threads = Qnil;
    VALUE merge_fibers = Qnil;
    int i;

    switch (rb_scan_args(argc, argv, "02", &mode_or_options, &exclude_threads)) {
    case 0:
        break;
    case 1:
        if (FIXNUM_P(mode_or_options)) {
            mode = mode_or_options;
        }
        else {
            Check_Type(mode_or_options, T_HASH);
            mode = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("measure_mode")));
            merge_fibers = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("merge_fibers")));
            exclude_threads = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("exclude_threads")));
            include_threads = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("include_threads")));
        }
        break;
    case 2:
        Check_Type(exclude_threads, T_ARRAY);
        break;
    }

    if (mode == Qnil) {
        mode = INT2NUM(MEASURE_WALL_TIME);
    } else {
        Check_Type(mode, T_FIXNUM);
    }
    profile->measurer = prof_get_measurer(NUM2INT(mode));
    profile->merge_fibers = merge_fibers != Qnil && merge_fibers != Qfalse;

    if (exclude_threads != Qnil) {
        Check_Type(exclude_threads, T_ARRAY);
        assert(profile->exclude_threads_tbl == NULL);
        profile->exclude_threads_tbl = threads_table_create();
        for (i = 0; i < RARRAY_LEN(exclude_threads); i++) {
            VALUE thread = rb_ary_entry(exclude_threads, i);
            VALUE thread_id = rb_obj_id(thread);
            st_insert(profile->exclude_threads_tbl, thread_id, Qtrue);
        }
    }

    if (include_threads != Qnil) {
        Check_Type(include_threads, T_ARRAY);
        assert(profile->include_threads_tbl == NULL);
        profile->include_threads_tbl = threads_table_create();
        for (i = 0; i < RARRAY_LEN(include_threads); i++) {
            VALUE thread = rb_ary_entry(include_threads, i);
            VALUE thread_id = rb_obj_id(thread);
            st_insert(profile->include_threads_tbl, thread_id, Qtrue);
        }
    }

    return self;
}
profile(&block) → self click to toggle source
profile(options, &block) → self

Profiles the specified block and returns a RubyProf::Profile object. Arguments are passed to Profile initialize method.

static VALUE
prof_profile(int argc,  VALUE *argv, VALUE klass)
{
    int result;
    VALUE profile = rb_class_new_instance(argc, argv, cProfile);

    if (!rb_block_given_p())
    {
        rb_raise(rb_eArgError, "A block must be provided to the profile method.");
    }

    prof_start(profile);
    rb_protect(rb_yield, profile, &result);
    return prof_stop(profile);
}

Public Instance Methods

eliminate_methods!(matchers) click to toggle source

eliminate some calls from the graph by merging the information into callers. matchers can be a list of strings or regular expressions or the name of a file containing regexps.

# File lib/ruby-prof/profile.rb, line 15
def eliminate_methods!(matchers)
  matchers = read_regexps_from_file(matchers) if matchers.is_a?(String)
  eliminated = []
  threads.each do |thread|
    matchers.each{ |matcher| eliminated.concat(eliminate_methods(thread.methods, matcher)) }
  end
  eliminated
end
pause → self click to toggle source

Pauses collecting profile data.

static VALUE
prof_pause(VALUE self)
{
    prof_profile_t* profile = prof_get_profile(self);
    if (profile->running == Qfalse)
    {
        rb_raise(rb_eRuntimeError, "RubyProf is not running.");
    }

    if (profile->paused == Qfalse)
    {
        profile->paused = Qtrue;
        profile->measurement_at_pause_resume = profile->measurer->measure();
        st_foreach(profile->threads_tbl, pause_thread, (st_data_t) profile);
    }

    return self;
}
paused? → boolean click to toggle source

Returns whether a profile is currently paused.

static VALUE
prof_paused(VALUE self)
{
    prof_profile_t* profile = prof_get_profile(self);
    return profile->paused;
}
post_process() click to toggle source

This method gets called once profiling has been completed but before results are returned to the user. Thus it provides a hook to do any necessary post-processing on the call graph.

# File lib/ruby-prof/profile.rb, line 7
def post_process
  self.threads.each do |thread|
    thread.detect_recursion
  end
end
resume → self click to toggle source
resume(&block) → self

Resumes recording profile data.

static VALUE
prof_resume(VALUE self)
{
    prof_profile_t* profile = prof_get_profile(self);
    if (profile->running == Qfalse)
    {
        rb_raise(rb_eRuntimeError, "RubyProf is not running.");
    }

    if (profile->paused == Qtrue)
    {
        profile->paused = Qfalse;
        profile->measurement_at_pause_resume = profile->measurer->measure();
        st_foreach(profile->threads_tbl, unpause_thread, (st_data_t) profile);
    }

    return rb_block_given_p() ? rb_ensure(rb_yield, self, prof_pause, self) : self;
}
running? → boolean click to toggle source

Returns whether a profile is currently running.

static VALUE
prof_running(VALUE self)
{
    prof_profile_t* profile = prof_get_profile(self);
    return profile->running;
}
start → self click to toggle source

Starts recording profile data.

static VALUE
prof_start(VALUE self)
{
    char* trace_file_name;

    prof_profile_t* profile = prof_get_profile(self);

    if (profile->running == Qtrue)
    {
        rb_raise(rb_eRuntimeError, "RubyProf.start was already called");
    }

    profile->running = Qtrue;
    profile->paused = Qfalse;
    profile->last_thread_data = NULL;


    /* open trace file if environment wants it */
    trace_file_name = getenv("RUBY_PROF_TRACE");
    if (trace_file_name != NULL) 
    {
      if (strcmp(trace_file_name, "stdout") == 0) 
      {
        trace_file = stdout;
      } 
      else if (strcmp(trace_file_name, "stderr") == 0)
      {
        trace_file = stderr;
      }
      else 
      {
        trace_file = fopen(trace_file_name, "w");
      }
    }

    prof_install_hook(self);
    return self;
}
stop → self click to toggle source

Stops collecting profile data.

static VALUE
prof_stop(VALUE self)
{
    prof_profile_t* profile = prof_get_profile(self);

    if (profile->running == Qfalse)
    {
        rb_raise(rb_eRuntimeError, "RubyProf.start was not yet called");
    }
  
    prof_remove_hook();

    /* close trace file if open */
    if (trace_file != NULL) 
    {
      if (trace_file !=stderr && trace_file != stdout)
      {
#ifdef _MSC_VER
          _fcloseall();
#else
        fclose(trace_file);
#endif
      }
      trace_file = NULL;
    }
    
    prof_pop_threads(profile);

    /* Unset the last_thread_data (very important!)
       and the threads table */
    profile->running = profile->paused = Qfalse;
    profile->last_thread_data = NULL;

    /* Post process result */
    rb_funcall(self, rb_intern("post_process") , 0);

    return self;
}
threads → array of RubyProf::Thread click to toggle source

Returns an array of RubyProf::Thread instances that were executed while the the program was being run.

static VALUE
prof_threads(VALUE self)
{
    VALUE result = rb_ary_new();
    prof_profile_t* profile = prof_get_profile(self);
    st_foreach(profile->threads_tbl, collect_threads, result);
    return result;
}
ruby-prof-0.16.2/doc/RubyProf/Thread.html0000644000175600017570000002453712766254554017233 0ustar pravipravi class RubyProf::Thread - ruby-prof

class RubyProf::Thread

Public Instance Methods

detect_recursion() click to toggle source

This method detect recursive calls in the call tree of a given thread It should be called only once for each thread

# File lib/ruby-prof/thread.rb, line 15
def detect_recursion
  top_call_infos.each(&:detect_recursion)
end
top_call_infos() click to toggle source 
# File lib/ruby-prof/thread.rb, line 9
def top_call_infos
  top_methods.map(&:call_infos).flatten.select(&:root?)
end
top_methods() click to toggle source 
# File lib/ruby-prof/thread.rb, line 3
def top_methods
  self.methods.select do |method_info|
    method_info.call_infos.detect(&:root?)
  end
end
total_time() click to toggle source 
# File lib/ruby-prof/thread.rb, line 19
def total_time
  self.top_methods.inject(0) do |sum, method_info|
    method_info.call_infos.each do |call_info|
      if call_info.parent.nil?
        sum += call_info.total_time
      end
    end
    sum
  end
end
wait_time() click to toggle source 
# File lib/ruby-prof/thread.rb, line 30
def wait_time
  # wait_time, like self:time, is always method local
  # thus we need to sum over all methods and call infos
  self.methods.inject(0) do |sum, method_info|
    method_info.call_infos.each do |call_info|
      sum += call_info.wait_time
    end
    sum
  end
end
ruby-prof-0.16.2/doc/RubyProf/MultiPrinter.html0000644000175600017570000003071512766254554020455 0ustar pravipravi class RubyProf::MultiPrinter - ruby-prof

class RubyProf::MultiPrinter

Helper class to simplify printing profiles of several types from one profiling run. Currently prints a flat profile, a callgrind profile, a call stack profile and a graph profile.

Public Class Methods

new(result) click to toggle source 
# File lib/ruby-prof/printers/multi_printer.rb, line 7
def initialize(result)
  @stack_printer = CallStackPrinter.new(result)
  @graph_printer = GraphHtmlPrinter.new(result)
  @tree_printer = CallTreePrinter.new(result)
  @flat_printer = FlatPrinter.new(result)
end

Public Instance Methods

flat_profile() click to toggle source

the name of the flat profile file

# File lib/ruby-prof/printers/multi_printer.rb, line 52
def flat_profile
  "#{@directory}/#{@profile}.flat.txt"
end
graph_profile() click to toggle source

the name of the graph profile file

# File lib/ruby-prof/printers/multi_printer.rb, line 42
def graph_profile
  "#{@directory}/#{@profile}.graph.html"
end
print(options) click to toggle source

create profile files under options or the current directory. options is used as the base name for the pofile file, defaults to “profile”.

stack_profile() click to toggle source

the name of the call stack profile file

# File lib/ruby-prof/printers/multi_printer.rb, line 37
def stack_profile
  "#{@directory}/#{@profile}.stack.html"
end
tree_profile() click to toggle source

the name of the callgrind profile file

# File lib/ruby-prof/printers/multi_printer.rb, line 47
def tree_profile
  "#{@directory}/#{@profile}.callgrind.out.#{$$}"
end
ruby-prof-0.16.2/doc/RubyProf/ProfileTask.html0000644000175600017570000004734012766254554020244 0ustar pravipravi class RubyProf::ProfileTask - ruby-prof

class RubyProf::ProfileTask

Define a task library for profiling unit tests with ruby-prof.

All of the options provided by the Rake:TestTask are supported except the loader which is set to ruby-prof. For detailed information please refer to the Rake:TestTask documentation.

ruby-prof specific options include:

output_dir - For each file specified an output
             file with profile information will be
             written to the output directory.
             By default, the output directory is
             called "profile" and is created underneath
             the current working directory.

printer - Specifies the output printer.  Valid values include
          :flat, :graph, :graph_html and :call_tree.

min_percent - Methods that take less than the specified percent
              will not be written out.

Example:

require 'ruby-prof/task'

RubyProf::ProfileTask.new do |t|
  t.test_files = FileList['test/test*.rb']
  t.output_dir = "c:/temp"
  t.printer = :graph
  t.min_percent = 10
end

If rake is invoked with a “TEST=filename” command line option, then the list of test files will be overridden to include only the filename specified on the command line. This provides an easy way to run just one test.

If rake is invoked with a “TESTOPTS=options” command line option, then the given options are passed to the test process after a '–'. This allows Test::Unit options to be passed to the test suite.

Examples:

rake profile                           # run tests normally
rake profile TEST=just_one_file.rb     # run just one test file.
rake profile TESTOPTS="-v"             # run in verbose mode
rake profile TESTOPTS="--runner=fox"   # use the fox test runner

Attributes

min_percent[RW]
output_dir[RW]
printer[RW]

Public Class Methods

new(name = :profile) click to toggle source
Calls superclass method 
# File lib/ruby-prof/task.rb, line 64
def initialize(name = :profile)
  super(name)
end

Public Instance Methods

clean_output_directory() click to toggle source 
# File lib/ruby-prof/task.rb, line 135
def clean_output_directory
  if File.exist?(output_directory)
    files = Dir.glob(output_directory + '/*')
    FileUtils.rm(files)
  end
end
create_output_directory() click to toggle source 
# File lib/ruby-prof/task.rb, line 129
def create_output_directory
  if not File.exist?(output_directory)
    Dir.mkdir(output_directory)
  end
end
define() click to toggle source

Create the tasks defined by this task lib.

# File lib/ruby-prof/task.rb, line 69
def define
  lib_path = @libs.join(File::PATH_SEPARATOR)
  desc "Profile" + (@name==:profile ? "" : " for #{@name}")

  task @name do
    create_output_directory

    @ruby_opts.unshift( "-I#{lib_path}" )
    @ruby_opts.unshift( "-w" ) if @warning
    @ruby_opts.push("-S ruby-prof")
    @ruby_opts.push("--printer #{@printer}")
    @ruby_opts.push("--min_percent #{@min_percent}")

    file_list.each do |file_path|
      run_script(file_path)
    end
  end
  self
end
output_directory() click to toggle source 
# File lib/ruby-prof/task.rb, line 125
def output_directory
  File.expand_path(@output_dir)
end
run_script(script_path) click to toggle source

Run script

# File lib/ruby-prof/task.rb, line 90
def run_script(script_path)
  run_code = ''
  RakeFileUtils.verbose(@verbose) do
    file_name = File.basename(script_path, File.extname(script_path))
    case @printer
      when :flat, :graph, :call_tree
        file_name += ".txt"
      when :graph_html
        file_name += ".html"
      else
        file_name += ".txt"
    end

    output_file_path = File.join(output_directory, file_name)

    command_line = @ruby_opts.join(" ") +
                  " --file=" + output_file_path +
                  " " + script_path

    puts "ruby " + command_line
    # We have to catch the exeption to continue on.  However,
    # the error message will have been output to STDERR
    # already by the time we get here so we don't have to
    # do that again
    begin
      ruby command_line
    rescue => e
      STDOUT << e << "\n"
      STDOUT.flush
    end
    puts ""
    puts ""
  end
end
ruby-prof-0.16.2/doc/RubyProf/MethodInfo.html0000644000175600017570000006733312766254554020061 0ustar pravipravi class RubyProf::MethodInfo - ruby-prof

class RubyProf::MethodInfo

Public Instance Methods

<=>(other) click to toggle source 
# File lib/ruby-prof/method_info.rb, line 6
def <=>(other)
  if self.total_time < other.total_time
    -1
  elsif self.total_time > other.total_time
    1
  elsif self.min_depth < other.min_depth
    1
  elsif self.min_depth > other.min_depth
    -1
  else
    self.full_name <=> other.full_name
  end
end
aggregate_children() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 104
def aggregate_children
  # group call infos based on their targets
  groups = self.children.each_with_object({}) do |call_info, hash|
    key = call_info.target
    (hash[key] ||= []) << call_info
  end

  groups.map do |key, value|
    AggregateCallInfo.new(value, self)
  end
end
aggregate_parents() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 92
def aggregate_parents
  # group call infos based on their parents
  groups = self.call_infos.each_with_object({}) do |call_info, hash|
    key = call_info.parent ? call_info.parent.target : self
    (hash[key] ||= []) << call_info
  end

  groups.map do |key, value|
    AggregateCallInfo.new(value, self)
  end
end
called() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 24
def called
  @called ||= begin
    call_infos.inject(0) do |sum, call_info|
      sum + call_info.called
    end
  end
end
children() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 84
def children
  @children ||= call_infos.map(&:children).flatten
end
children_time() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 59
def children_time
  @children_time ||= begin
    call_infos.inject(0) do |sum, call_info|
      sum += call_info.children_time unless call_info.recursive
      sum
    end
  end
end
detect_recursion() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 20
def detect_recursion
  call_infos.each(&:detect_recursion)
end
eliminate!() click to toggle source

remove method from the call graph. should not be called directly.

# File lib/ruby-prof/method_info.rb, line 121
def eliminate!
  # $stderr.puts "eliminating #{self}"
  call_infos.each{ |call_info| call_info.eliminate! }
  call_infos.clear
end
min_depth() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 68
def min_depth
  @min_depth ||= call_infos.map(&:depth).min
end
parents() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 88
def parents
  @parents ||= call_infos.map(&:parent)
end
recursive?() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 80
def recursive?
  (@recursive ||= call_infos.detect(&:recursive) ? :true : :false) == :true
end
root?() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 72
def root?
  @root ||= begin
    call_infos.find do |call_info|
      not call_info.root?
    end.nil?
  end
end
self_time() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 41
def self_time
  @self_time ||= begin
    call_infos.inject(0) do |sum, call_info|
      sum += call_info.self_time unless call_info.recursive
      sum
    end
  end
end
to_s() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 116
def to_s
  "#{self.full_name} (c: #{self.called}, tt: #{self.total_time}, st: #{self.self_time}, wt: #{wait_time}, ct: #{self.children_time})"
end
total_time() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 32
def total_time
  @total_time ||= begin
    call_infos.inject(0) do |sum, call_info|
      sum += call_info.total_time unless call_info.recursive
      sum
    end
  end
end
wait_time() click to toggle source 
# File lib/ruby-prof/method_info.rb, line 50
def wait_time
  @wait_time ||= begin
    call_infos.inject(0) do |sum, call_info|
      sum += call_info.wait_time unless call_info.recursive
      sum
    end
  end
end
ruby-prof-0.16.2/doc/RubyProf/Cmd.html0000644000175600017570000011210412766254554016513 0ustar pravipravi class RubyProf::Cmd - ruby-prof

class RubyProf::Cmd

Attributes

options[RW]

Public Class Methods

new() click to toggle source 
# File bin/ruby-prof, line 28
def initialize
  setup_options
  parse_args

  load_pre_libs
  load_pre_execs
end

Public Instance Methods

load_pre_execs() click to toggle source 
# File bin/ruby-prof, line 269
def load_pre_execs
  options.pre_execs.each do |exec|
    eval(exec)
  end
end
load_pre_libs() click to toggle source 
# File bin/ruby-prof, line 263
def load_pre_libs
  options.pre_libs.each do |lib|
    require lib
  end
end
option_parser() click to toggle source 
# File bin/ruby-prof, line 48
def option_parser
  OptionParser.new do |opts|
    opts.banner = "ruby_prof #{RubyProf::VERSION}\n" +
        "Usage: ruby-prof [options] <script.rb> [--] [profiled-script-command-line-options]"

    opts.separator ""
    opts.separator "Options:"

    opts.on('-p printer', '--printer=printer', [:flat, :flat_with_line_numbers, :graph, :graph_html, :call_tree, :call_stack, :dot, :multi],
            'Select a printer:',
            '  flat - Prints a flat profile as text (default).',
            '  flat_with_line_numbers - same as flat, with line numbers.',
            '  graph - Prints a graph profile as text.',
            '  graph_html - Prints a graph profile as html.',
            '  call_tree - format for KCacheGrind',
            '  call_stack - prints a HTML visualization of the call tree',
            '  dot - Prints a graph profile as a dot file',
            '  multi - Creates several reports in output directory'
    ) do |printer|


      case printer
      when :flat
        options.printer = RubyProf::FlatPrinter
      when :flat_with_line_numbers
        options.printer = RubyProf::FlatPrinterWithLineNumbers
      when :graph
        options.printer = RubyProf::GraphPrinter
      when :graph_html
        options.printer = RubyProf::GraphHtmlPrinter
      when :call_tree
        options.printer = RubyProf::CallTreePrinter
      when :call_stack
        options.printer = RubyProf::CallStackPrinter
      when :dot
        options.printer = RubyProf::DotPrinter
      when :multi
        options.printer = RubyProf::MultiPrinter
      end
    end

    opts.on('-m min_percent', '--min_percent=min_percent', Float,
            'The minimum percent a method must take before ',
            '  being included in output reports.',
            '  this option is not supported for call tree.') do |min_percent|
      options.min_percent = min_percent
    end

    opts.on('-f path', '--file=path',
            'Output results to a file instead of standard out.') do |file|
      options.file = file
      options.old_wd = Dir.pwd
    end

    opts.on('--mode=measure_mode',
            [:process, :wall, :cpu, :allocations, :memory, :gc_runs, :gc_time],
            'Select what ruby-prof should measure:',
            '  wall - Wall time (default).',
            '  process - Process time.',
            '  cpu - CPU time (Pentium and PowerPCs only).',
            '  allocations - Object allocations (requires patched Ruby interpreter).',
            '  memory - Allocated memory in KB (requires patched Ruby interpreter).',
            '  gc_runs - Number of garbage collections (requires patched Ruby interpreter).',
            '  gc_time - Time spent in garbage collection (requires patched Ruby interpreter).') do |measure_mode|

      case measure_mode
      when :wall
        options.measure_mode = RubyProf::WALL_TIME
      when :process
        options.measure_mode = RubyProf::PROCESS_TIME
      when :cpu
        options.measure_mode = RubyProf::CPU_TIME
      when :allocations
        options.measure_mode = RubyProf::ALLOCATIONS
      when :memory
        options.measure_mode = RubyProf::MEMORY
      when :gc_runs
        options.measure_mode = RubyProf::GC_RUNS
      when :gc_time
        options.measure_mode = RubyProf::GC_TIME
      end
    end

    opts.on('-s sort_mode', '--sort=sort_mode', [:total, :self, :wait, :child],
            'Select how ruby-prof results should be sorted:',
            '  total - Total time',
            '  self - Self time',
            '  wait - Wait time',
            '  child - Child time') do |sort_mode|

      options.sort_method = case sort_mode
                            when :total
                              :total_time
                            when :self
                              :self_time
                            when :wait
                              :wait_time
                            when :child
                              :children_time
                            end
    end

    opts.on("--replace-progname", "Replace $0 when loading the .rb files.") do
      options.replace_prog_name = true
    end

    if defined?(RubyVM)
      opts.on("--specialized-instruction", "Turn on specified instruction.") do
        options.specialized_instruction = true
      end
    end

    opts.on_tail("-h", "--help", "Show help message") do
      puts opts
      exit
    end

    opts.on_tail("--version", "Show version #{RubyProf::VERSION}") do
      puts "ruby_prof " + RubyProf::VERSION
      exit
    end

    opts.on("-v","Show version, set $VERBOSE to true, profile script if option given") do
      puts "ruby version: " + [RUBY_PATCHLEVEL, RUBY_PLATFORM, RUBY_VERSION].join(' ')
      $VERBOSE = true
    end

    opts.on("-d", "Set $DEBUG to true") do
      $DEBUG = true
    end

    opts.on('-R lib', '--require-noprof lib', 'require a specific library (not profiled)') do |lib|
      options.pre_libs << lib
    end

    opts.on('-E code', '--eval-noprof code', 'execute the ruby statements (not profiled)') do |code|
      options.pre_execs << code
    end

    opts.on('-x regexp', '--exclude regexp', 'exclude methods by regexp (see method elimination)') do|meth|
      options.eliminate_methods ||= []
      options.eliminate_methods << Regexp.new(meth)
    end

    opts.on('-X file', '--exclude-file file', 'exclude methods by regexp listed in file (see method elimination)') do|file|
      options.eliminate_methods_files ||= []
      options.eliminate_methods_files << file
    end

    opts.on('--exclude-common-cycles', 'make common iterators like Integer#times appear inlined') do |meth|
      options.eliminate_methods ||= []
      options.eliminate_methods += %w{
        Integer#times
        Integer#upto
        Integer#downto
        Enumerator#each
        Enumerator#each_with_index
        Enumerator#each_with_object

        Array#each
        Array#each_index
        Array#reverse_each
        Array#map

        Hash#each
        Hash#each_pair
        Hash#each_key
        Hash#each_value

        Range#each
        Enumerable#each_cons
        Enumerable#each_entry
        Enumerable#each_slice
        Enumerable#each_with_index
        Enumerable#each_with_object
        Enumerable#reverse_each
        Enumerable#inject
        Enumerable#collect
        Enumerable#reduce
      }
      #TODO: may be the whole Enumerable module should be excluded via 'Enumerable#.*', we need feedback on use cases.
    end

    opts.on('--exclude-common-callbacks', 'make common callbacks invocations like Integer#times appear inlined so you can see call origins in graph') do|meth|
      options.eliminate_methods ||= []
      options.eliminate_methods += %w{
        Method#call
        Proc#call
        ActiveSupport::Callbacks::ClassMethods#__run_callback
      }
    end
  end
end
parse_args() click to toggle source 
# File bin/ruby-prof, line 242
def parse_args
  # Make sure the user specified at least one file
  if ARGV.length < 1 and not options.exec
    puts self.option_parser
    puts ""
    puts "Must specify a script to run"
    exit(-1)
  end

  self.option_parser.parse! ARGV

  if options.printer == RubyProf::MultiPrinter
    options.file ||= "."
    options.old_wd ||= Dir.pwd
  end
rescue OptionParser::InvalidOption, OptionParser::InvalidArgument, OptionParser::MissingArgument => e
  puts self.option_parser
  puts e.message
  exit(-1)
end
run() click to toggle source 
# File bin/ruby-prof, line 275
def run
  # Get the script we will execute
  script = ARGV.shift
  if options.replace_prog_name
    $0 = File.expand_path(script)
  end

  # Set VM compile option
  if defined?(RubyVM)
    RubyVM::InstructionSequence.compile_option = {
        :trace_instruction => true,
        :specialized_instruction => options.specialized_instruction
    }
  end

  # Set the measure mode
  RubyProf.measure_mode = options.measure_mode if options.measure_mode
  RubyProf.start_script(script)
end
setup_options() click to toggle source 
# File bin/ruby-prof, line 36
def setup_options
  @options = OpenStruct.new
  options.printer = RubyProf::FlatPrinter
  options.min_percent = 0
  options.file = nil
  options.replace_prog_name = false
  options.specialized_instruction = false

  options.pre_libs = Array.new
  options.pre_execs = Array.new
end
ruby-prof-0.16.2/doc/RubyProf/GraphPrinter.html0000644000175600017570000000615312766254554020423 0ustar pravipravi class RubyProf::GraphPrinter - ruby-prof

class RubyProf::GraphPrinter

Generates graph profile reports as text. To use the graph printer:

result = RubyProf.profile do
  [code to profile]
end

printer = RubyProf::GraphPrinter.new(result)
printer.print(STDOUT, {})

The constructor takes two arguments. See the README

Constants

CALL_WIDTH
PERCENTAGE_WIDTH
TIME_WIDTH
ruby-prof-0.16.2/doc/RubyProf/DotPrinter.html0000644000175600017570000001671112766254554020111 0ustar pravipravi class RubyProf::DotPrinter - ruby-prof

class RubyProf::DotPrinter

Generates a graphviz graph in dot format. To use the dot printer:

result = RubyProf.profile do
  [code to profile]
end

printer = RubyProf::DotPrinter.new(result)
printer.print(STDOUT)

You can use either dot viewer such as GraphViz, or the dot command line tool to reformat the output into a wide variety of outputs:

dot -Tpng graph.dot > graph.png

Constants

CLASS_COLOR
EDGE_COLOR

Public Class Methods

new(result) click to toggle source

Creates the DotPrinter using a RubyProf::Proile.

Calls superclass method RubyProf::AbstractPrinter.new 
# File lib/ruby-prof/printers/dot_printer.rb, line 25
def initialize(result)
  super(result)
  @seen_methods = Set.new
end

Public Instance Methods

print(output = STDOUT, options = {}) click to toggle source

Print a graph report to the provided output.

output - Any IO object, including STDOUT or a file. The default value is STDOUT.

options - Hash of print options. See setup_options for more information.

When profiling results that cover a large number of method calls it helps to use the :min_percent option, for example:

DotPrinter.new(result).print(STDOUT, :min_percent=>5)
ruby-prof-0.16.2/doc/js/0000755000175600017570000000000012766254554013767 5ustar pravipraviruby-prof-0.16.2/doc/js/searcher.js.gz0000644000175600017570000000322412766254554016541 0ustar pravipraviVsearcher.jskoV{ũ8NRІ:V EvIn˜kϾTs.mbH==>3U5` ˆ9-Xx=u*~"X<&lEN.&{۽fU ~]1r*!h %E! YCh4+u^lMjRV6ټ*xO?^Ξ~D_HȁW XRMQgI- ,w06α$>iGC{)Ċs䲅b%ĸuɛtV" UpQq`#?s{ө'jM,VIteo` xMwH*Nw VifanƋ Qf['SVÎHWIX"eBanje քKavFFL_4'mp!{^1z>#=d+M^JmncFZt)Dn'Y͍zE2l:oQ|gθ%SKߝ:Eruby-prof-0.16.2/doc/js/search_index.js0000644000175600017570000007424712766254554016777 0ustar pravipravivar search_data = {"index":{"searchIndex":["rack","rubyprof","rubyprof","abstractprinter","aggregatecallinfo","callinfo","callinfoprinter","callinfovisitor","callstackprinter","calltreeprinter","cmd","dotprinter","flatprinter","flatprinterwithlinenumbers","graphhtmlprinter","graphprinter","methodinfo","multiprinter","profile","profiletask","thread","<=>()","aggregate_children()","aggregate_parents()","application()","arguments()","base64_image()","base_name()","call()","call_sequence()","called()","called()","children()","children()","children_time()","children_time()","children_time()","clean_output_directory()","color()","convert()","cpu_frequency()","create_link()","create_output_directory()","define()","descendent_of()","detect_recursion()","detect_recursion()","detect_recursion()","determine_event_specification_and_value_scale()","dump()","eliminate!()","eliminate!()","eliminate_methods!()","exclude_threads()","exclude_threads=()","expansion()","figure_measure_mode()","file()","file_link()","file_name_for_thread()","file_path_for_thread()","find_call()","flat_profile()","graph_link()","graph_profile()","inspect()","line()","link()","load_pre_execs()","load_pre_libs()","measure_allocations()","measure_cpu_time()","measure_gc_runs()","measure_gc_time()","measure_memory()","measure_mode()","measure_mode=()","measure_mode_string()","measure_process_time()","measure_wall_time()","merge_call_tree()","method_href()","method_href()","method_name()","min_depth()","min_percent()","name()","new()","new()","new()","new()","new()","new()","new()","new()","new()","open_asset()","option_parser()","output_directory()","parent()","parents()","parse_args()","path()","pause()","pause()","paused?()","post_process()","print()","print()","print()","print()","print()","print()","print_commands()","print_css()","print_file()","print_footer()","print_footer()","print_header()","print_header()","print_headers()","print_help()","print_java_script()","print_method()","print_methods()","print_stack()","print_thread()","print_thread()","print_threads()","print_threads()","print_title_bar()","profile()","profile()","recursive?()","remove_subsidiary_files_from_previous_profile_runs()","resume()","resume()","root?()","root?()","roots_of()","run()","run_script()","running?()","running?()","self_time()","self_time()","setup_options()","setup_options()","setup_options()","sort_method()","sort_method()","stack()","stack_profile()","start()","start()","start_script()","stop()","stop()","sum()","target()","template()","threads()","threshold()","title()","to_s()","to_s()","to_s()","top_call_infos()","top_methods()","total_time()","total_time()","total_time()","total_time()","tree_profile()","visit()","wait_time()","wait_time()","wait_time()","license","readme","flat","graph.html","graph"],"longSearchIndex":["rack","rack::rubyprof","rubyprof","rubyprof::abstractprinter","rubyprof::aggregatecallinfo","rubyprof::callinfo","rubyprof::callinfoprinter","rubyprof::callinfovisitor","rubyprof::callstackprinter","rubyprof::calltreeprinter","rubyprof::cmd","rubyprof::dotprinter","rubyprof::flatprinter","rubyprof::flatprinterwithlinenumbers","rubyprof::graphhtmlprinter","rubyprof::graphprinter","rubyprof::methodinfo","rubyprof::multiprinter","rubyprof::profile","rubyprof::profiletask","rubyprof::thread","rubyprof::methodinfo#<=>()","rubyprof::methodinfo#aggregate_children()","rubyprof::methodinfo#aggregate_parents()","rubyprof::callstackprinter#application()","rubyprof::callstackprinter#arguments()","rubyprof::callstackprinter#base64_image()","rubyprof::calltreeprinter#base_name()","rack::rubyprof#call()","rubyprof::callinfo#call_sequence()","rubyprof::aggregatecallinfo#called()","rubyprof::methodinfo#called()","rubyprof::aggregatecallinfo#children()","rubyprof::methodinfo#children()","rubyprof::aggregatecallinfo#children_time()","rubyprof::callinfo#children_time()","rubyprof::methodinfo#children_time()","rubyprof::profiletask#clean_output_directory()","rubyprof::callstackprinter#color()","rubyprof::calltreeprinter#convert()","rubyprof::cpu_frequency()","rubyprof::graphhtmlprinter#create_link()","rubyprof::profiletask#create_output_directory()","rubyprof::profiletask#define()","rubyprof::callinfo#descendent_of()","rubyprof::callinfo#detect_recursion()","rubyprof::methodinfo#detect_recursion()","rubyprof::thread#detect_recursion()","rubyprof::calltreeprinter#determine_event_specification_and_value_scale()","rubyprof::callstackprinter#dump()","rubyprof::callinfo#eliminate!()","rubyprof::methodinfo#eliminate!()","rubyprof::profile#eliminate_methods!()","rubyprof::exclude_threads()","rubyprof::exclude_threads=()","rubyprof::callstackprinter#expansion()","rubyprof::figure_measure_mode()","rubyprof::calltreeprinter#file()","rubyprof::graphhtmlprinter#file_link()","rubyprof::calltreeprinter#file_name_for_thread()","rubyprof::calltreeprinter#file_path_for_thread()","rubyprof::callinfo#find_call()","rubyprof::multiprinter#flat_profile()","rubyprof::callstackprinter#graph_link()","rubyprof::multiprinter#graph_profile()","rubyprof::callinfo#inspect()","rubyprof::aggregatecallinfo#line()","rubyprof::callstackprinter#link()","rubyprof::cmd#load_pre_execs()","rubyprof::cmd#load_pre_libs()","rubyprof::measure_allocations()","rubyprof::measure_cpu_time()","rubyprof::measure_gc_runs()","rubyprof::measure_gc_time()","rubyprof::measure_memory()","rubyprof::measure_mode()","rubyprof::measure_mode=()","rubyprof::measure_mode_string()","rubyprof::measure_process_time()","rubyprof::measure_wall_time()","rubyprof::callinfo#merge_call_tree()","rubyprof::callstackprinter#method_href()","rubyprof::graphhtmlprinter#method_href()","rubyprof::abstractprinter#method_name()","rubyprof::methodinfo#min_depth()","rubyprof::abstractprinter#min_percent()","rubyprof::callstackprinter#name()","rack::rubyprof::new()","rubyprof::abstractprinter::new()","rubyprof::aggregatecallinfo::new()","rubyprof::callinfovisitor::new()","rubyprof::cmd::new()","rubyprof::dotprinter::new()","rubyprof::multiprinter::new()","rubyprof::profile::new()","rubyprof::profiletask::new()","rubyprof::callstackprinter#open_asset()","rubyprof::cmd#option_parser()","rubyprof::profiletask#output_directory()","rubyprof::aggregatecallinfo#parent()","rubyprof::methodinfo#parents()","rubyprof::cmd#parse_args()","rubyprof::calltreeprinter#path()","rubyprof::pause()","rubyprof::profile#pause()","rubyprof::profile#paused?()","rubyprof::profile#post_process()","rubyprof::abstractprinter#print()","rubyprof::callstackprinter#print()","rubyprof::calltreeprinter#print()","rubyprof::dotprinter#print()","rubyprof::graphhtmlprinter#print()","rubyprof::multiprinter#print()","rubyprof::callstackprinter#print_commands()","rubyprof::callstackprinter#print_css()","rubyprof::abstractprinter#print_file()","rubyprof::abstractprinter#print_footer()","rubyprof::callstackprinter#print_footer()","rubyprof::abstractprinter#print_header()","rubyprof::callstackprinter#print_header()","rubyprof::calltreeprinter#print_headers()","rubyprof::callstackprinter#print_help()","rubyprof::callstackprinter#print_java_script()","rubyprof::calltreeprinter#print_method()","rubyprof::flatprinterwithlinenumbers#print_methods()","rubyprof::callstackprinter#print_stack()","rubyprof::abstractprinter#print_thread()","rubyprof::calltreeprinter#print_thread()","rubyprof::abstractprinter#print_threads()","rubyprof::calltreeprinter#print_threads()","rubyprof::callstackprinter#print_title_bar()","rubyprof::profile()","rubyprof::profile::profile()","rubyprof::methodinfo#recursive?()","rubyprof::calltreeprinter#remove_subsidiary_files_from_previous_profile_runs()","rubyprof::resume()","rubyprof::profile#resume()","rubyprof::callinfo#root?()","rubyprof::methodinfo#root?()","rubyprof::callinfo::roots_of()","rubyprof::cmd#run()","rubyprof::profiletask#run_script()","rubyprof::running?()","rubyprof::profile#running?()","rubyprof::aggregatecallinfo#self_time()","rubyprof::methodinfo#self_time()","rubyprof::abstractprinter#setup_options()","rubyprof::cmd#setup_options()","rubyprof::graphhtmlprinter#setup_options()","rubyprof::abstractprinter#sort_method()","rubyprof::flatprinter#sort_method()","rubyprof::callinfo#stack()","rubyprof::multiprinter#stack_profile()","rubyprof::start()","rubyprof::profile#start()","rubyprof::start_script()","rubyprof::stop()","rubyprof::profile#stop()","rubyprof::callstackprinter#sum()","rubyprof::aggregatecallinfo#target()","rubyprof::graphhtmlprinter#template()","rubyprof::profile#threads()","rubyprof::callstackprinter#threshold()","rubyprof::callstackprinter#title()","rubyprof::aggregatecallinfo#to_s()","rubyprof::callinfo#to_s()","rubyprof::methodinfo#to_s()","rubyprof::thread#top_call_infos()","rubyprof::thread#top_methods()","rubyprof::aggregatecallinfo#total_time()","rubyprof::callstackprinter#total_time()","rubyprof::methodinfo#total_time()","rubyprof::thread#total_time()","rubyprof::multiprinter#tree_profile()","rubyprof::callinfovisitor#visit()","rubyprof::aggregatecallinfo#wait_time()","rubyprof::methodinfo#wait_time()","rubyprof::thread#wait_time()","","","","",""],"info":[["Rack","","Rack.html","",""],["Rack::RubyProf","","Rack/RubyProf.html","",""],["RubyProf","","RubyProf.html","","

The call info visitor class does a depth-first traversal across a list of\nmethod infos. At each call_info …\n"],["RubyProf::AbstractPrinter","","RubyProf/AbstractPrinter.html","",""],["RubyProf::AggregateCallInfo","","RubyProf/AggregateCallInfo.html","",""],["RubyProf::CallInfo","","RubyProf/CallInfo.html","",""],["RubyProf::CallInfoPrinter","","RubyProf/CallInfoPrinter.html","","

Prints out the call graph based on CallInfo instances. This is mainly for\ndebugging purposes as it provides …\n"],["RubyProf::CallInfoVisitor","","RubyProf/CallInfoVisitor.html","",""],["RubyProf::CallStackPrinter","","RubyProf/CallStackPrinter.html","","

prints a HTML visualization of the call tree\n"],["RubyProf::CallTreePrinter","","RubyProf/CallTreePrinter.html","","

Generate profiling information in callgrind format for use by kcachegrind\nand similar tools.\n

Note: when …\n"],["RubyProf::Cmd","","RubyProf/Cmd.html","",""],["RubyProf::DotPrinter","","RubyProf/DotPrinter.html","","

Generates a graphviz graph in dot format. To use the dot printer:\n\n

result = RubyProf.profile do\n  [code ...
\n"],["RubyProf::FlatPrinter","","RubyProf/FlatPrinter.html","","

Generates flat profile reports as text. To use the flat printer:\n\n

result = RubyProf.profile do\n  [code ...
\n"],["RubyProf::FlatPrinterWithLineNumbers","","RubyProf/FlatPrinterWithLineNumbers.html","","

Generates flat profile reports as text. To use the flat printer with line\nnumbers:\n\n

result = RubyProf.profile ...
\n"],["RubyProf::GraphHtmlPrinter","","RubyProf/GraphHtmlPrinter.html","","

Generates graph profile reports as html. To use the graph html printer:\n\n

result = RubyProf.profile do\n ...
\n"],["RubyProf::GraphPrinter","","RubyProf/GraphPrinter.html","","

Generates graph profile reports as text. To use the graph printer:\n\n

result = RubyProf.profile do\n  [code ...
\n"],["RubyProf::MethodInfo","","RubyProf/MethodInfo.html","",""],["RubyProf::MultiPrinter","","RubyProf/MultiPrinter.html","","

Helper class to simplify printing profiles of several types from one\nprofiling run. Currently prints …\n"],["RubyProf::Profile","","RubyProf/Profile.html","",""],["RubyProf::ProfileTask","","RubyProf/ProfileTask.html","","

Define a task library for profiling unit tests with ruby-prof.\n

All of the options provided by the Rake:TestTask …\n"],["RubyProf::Thread","","RubyProf/Thread.html","",""],["<=>","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-3C-3D-3E","(other)",""],["aggregate_children","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-aggregate_children","()",""],["aggregate_parents","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-aggregate_parents","()",""],["application","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-application","()",""],["arguments","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-arguments","()",""],["base64_image","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-base64_image","()",""],["base_name","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-base_name","()",""],["call","Rack::RubyProf","Rack/RubyProf.html#method-i-call","(env)",""],["call_sequence","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-call_sequence","()",""],["called","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-called","()",""],["called","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-called","()",""],["children","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-children","()",""],["children","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-children","()",""],["children_time","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-children_time","()",""],["children_time","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-children_time","()",""],["children_time","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-children_time","()",""],["clean_output_directory","RubyProf::ProfileTask","RubyProf/ProfileTask.html#method-i-clean_output_directory","()",""],["color","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-color","(p)",""],["convert","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-convert","(value)",""],["cpu_frequency","RubyProf","RubyProf.html#method-c-cpu_frequency","()","

Measurements\n"],["create_link","RubyProf::GraphHtmlPrinter","RubyProf/GraphHtmlPrinter.html#method-i-create_link","(thread, overall_time, method)","

Creates a link to a method. Note that we do not create links to methods\nwhich are under the min_perecent …\n"],["create_output_directory","RubyProf::ProfileTask","RubyProf/ProfileTask.html#method-i-create_output_directory","()",""],["define","RubyProf::ProfileTask","RubyProf/ProfileTask.html#method-i-define","()","

Create the tasks defined by this task lib.\n"],["descendent_of","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-descendent_of","(other)",""],["detect_recursion","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-detect_recursion","(visited_methods = Hash.new(0))",""],["detect_recursion","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-detect_recursion","()",""],["detect_recursion","RubyProf::Thread","RubyProf/Thread.html#method-i-detect_recursion","()","

This method detect recursive calls in the call tree of a given thread It\nshould be called only once for …\n"],["determine_event_specification_and_value_scale","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-determine_event_specification_and_value_scale","()",""],["dump","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-dump","(ci)",""],["eliminate!","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-eliminate-21","()","

eliminate call info from the call tree. adds self and wait time to parent\nand attaches called methods …\n"],["eliminate!","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-eliminate-21","()","

remove method from the call graph. should not be called directly.\n"],["eliminate_methods!","RubyProf::Profile","RubyProf/Profile.html#method-i-eliminate_methods-21","(matchers)","

eliminate some calls from the graph by merging the information into\ncallers. matchers can be a list of …\n"],["exclude_threads","RubyProf","RubyProf.html#method-c-exclude_threads","()","

Returns threads ruby-prof should exclude from profiling\n"],["exclude_threads=","RubyProf","RubyProf.html#method-c-exclude_threads-3D","(value)","

Specifies what threads ruby-prof should exclude from profiling\n"],["expansion","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-expansion","()",""],["figure_measure_mode","RubyProf","RubyProf.html#method-c-figure_measure_mode","()","

Checks if the user specified the clock mode via the RUBY_PROF_MEASURE_MODE\nenvironment variable\n"],["file","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-file","(method)",""],["file_link","RubyProf::GraphHtmlPrinter","RubyProf/GraphHtmlPrinter.html#method-i-file_link","(path, linenum)",""],["file_name_for_thread","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-file_name_for_thread","(thread)",""],["file_path_for_thread","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-file_path_for_thread","(thread)",""],["find_call","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-find_call","(other)","

find a specific call in list of children. returns nil if not found. note:\nthere can't be more than …\n"],["flat_profile","RubyProf::MultiPrinter","RubyProf/MultiPrinter.html#method-i-flat_profile","()","

the name of the flat profile file\n"],["graph_link","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-graph_link","(call_info)",""],["graph_profile","RubyProf::MultiPrinter","RubyProf/MultiPrinter.html#method-i-graph_profile","()","

the name of the graph profile file\n"],["inspect","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-inspect","()",""],["line","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-line","()",""],["link","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-link","(call_info)",""],["load_pre_execs","RubyProf::Cmd","RubyProf/Cmd.html#method-i-load_pre_execs","()",""],["load_pre_libs","RubyProf::Cmd","RubyProf/Cmd.html#method-i-load_pre_libs","()",""],["measure_allocations","RubyProf","RubyProf.html#method-c-measure_allocations","()",""],["measure_cpu_time","RubyProf","RubyProf.html#method-c-measure_cpu_time","()",""],["measure_gc_runs","RubyProf","RubyProf.html#method-c-measure_gc_runs","()",""],["measure_gc_time","RubyProf","RubyProf.html#method-c-measure_gc_time","()",""],["measure_memory","RubyProf","RubyProf.html#method-c-measure_memory","()",""],["measure_mode","RubyProf","RubyProf.html#method-c-measure_mode","()","

Returns what ruby-prof is measuring. Valid values include:\n

*RubyProf::WALL_TIME - Measure wall time using …\n"],["measure_mode=","RubyProf","RubyProf.html#method-c-measure_mode-3D","(value)","

Specifies what ruby-prof should measure. Valid values include:\n

*RubyProf::WALL_TIME - Measure wall time …\n"],["measure_mode_string","RubyProf","RubyProf.html#method-c-measure_mode_string","()",""],["measure_process_time","RubyProf","RubyProf.html#method-c-measure_process_time","()",""],["measure_wall_time","RubyProf","RubyProf.html#method-c-measure_wall_time","()",""],["merge_call_tree","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-merge_call_tree","(other)","

merge two call trees. adds self, wait, and total time of other to self and\nmerges children of other into …\n"],["method_href","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-method_href","(method)",""],["method_href","RubyProf::GraphHtmlPrinter","RubyProf/GraphHtmlPrinter.html#method-i-method_href","(thread, method)",""],["method_name","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-method_name","(method)",""],["min_depth","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-min_depth","()",""],["min_percent","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-min_percent","()",""],["name","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-name","(call_info)",""],["new","Rack::RubyProf","Rack/RubyProf.html#method-c-new","(app, options = {})",""],["new","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-c-new","(result)","

Create a new printer.\n

result should be the output generated from a profiling run\n"],["new","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-c-new","(call_infos, method_info)",""],["new","RubyProf::CallInfoVisitor","RubyProf/CallInfoVisitor.html#method-c-new","(call_infos)",""],["new","RubyProf::Cmd","RubyProf/Cmd.html#method-c-new","()",""],["new","RubyProf::DotPrinter","RubyProf/DotPrinter.html#method-c-new","(result)","

Creates the DotPrinter using a RubyProf::Proile.\n"],["new","RubyProf::MultiPrinter","RubyProf/MultiPrinter.html#method-c-new","(result)",""],["new","RubyProf::Profile","RubyProf/Profile.html#method-c-new","(p1 = v1, p2 = v2)","

Returns a new profiler. Possible options for the options hash are:\n

measure_mode — Measure mode. Specifies …\n"],["new","RubyProf::ProfileTask","RubyProf/ProfileTask.html#method-c-new","(name = :profile)",""],["open_asset","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-open_asset","(file)",""],["option_parser","RubyProf::Cmd","RubyProf/Cmd.html#method-i-option_parser","()",""],["output_directory","RubyProf::ProfileTask","RubyProf/ProfileTask.html#method-i-output_directory","()",""],["parent","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-parent","()",""],["parents","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-parents","()",""],["parse_args","RubyProf::Cmd","RubyProf/Cmd.html#method-i-parse_args","()",""],["path","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-path","()",""],["pause","RubyProf","RubyProf.html#method-c-pause","()",""],["pause","RubyProf::Profile","RubyProf/Profile.html#method-i-pause","()","

Pauses collecting profile data.\n"],["paused?","RubyProf::Profile","RubyProf/Profile.html#method-i-paused-3F","()","

Returns whether a profile is currently paused.\n"],["post_process","RubyProf::Profile","RubyProf/Profile.html#method-i-post_process","()","

This method gets called once profiling has been completed but before\nresults are returned to the user. …\n"],["print","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-print","(output = STDOUT, options = {})","

Print a profiling report to the provided output.\n

output - Any IO object, including STDOUT or a file. …\n"],["print","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print","(output = STDOUT, options = {})","

Specify print options.\n

options - Hash table\n\n

:min_percent - Number 0 to 100 that specifes the minimum\n  ...
\n"],["print","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-print","(options = {})",""],["print","RubyProf::DotPrinter","RubyProf/DotPrinter.html#method-i-print","(output = STDOUT, options = {})","

Print a graph report to the provided output.\n

output - Any IO object, including STDOUT or a file. The default …\n"],["print","RubyProf::GraphHtmlPrinter","RubyProf/GraphHtmlPrinter.html#method-i-print","(output = STDOUT, options = {})",""],["print","RubyProf::MultiPrinter","RubyProf/MultiPrinter.html#method-i-print","(options)","

create profile files under options or the current directory. options is\nused as the base name for the …\n"],["print_commands","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_commands","()",""],["print_css","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_css","()",""],["print_file","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-print_file","()",""],["print_footer","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-print_footer","(thread)",""],["print_footer","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_footer","()",""],["print_header","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-print_header","(thread)",""],["print_header","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_header","()",""],["print_headers","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-print_headers","(output, thread)",""],["print_help","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_help","()",""],["print_java_script","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_java_script","()",""],["print_method","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-print_method","(output, method)",""],["print_methods","RubyProf::FlatPrinterWithLineNumbers","RubyProf/FlatPrinterWithLineNumbers.html#method-i-print_methods","(thread)",""],["print_stack","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_stack","(call_info, parent_time)",""],["print_thread","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-print_thread","(thread)",""],["print_thread","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-print_thread","(thread)",""],["print_threads","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-print_threads","()",""],["print_threads","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-print_threads","()",""],["print_title_bar","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-print_title_bar","()",""],["profile","RubyProf","RubyProf.html#method-c-profile","(options = {}, &block)","

Profile a block\n"],["profile","RubyProf::Profile","RubyProf/Profile.html#method-c-profile","(*args)","

Profiles the specified block and returns a RubyProf::Profile object.\nArguments are passed to Profile …\n"],["recursive?","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-recursive-3F","()",""],["remove_subsidiary_files_from_previous_profile_runs","RubyProf::CallTreePrinter","RubyProf/CallTreePrinter.html#method-i-remove_subsidiary_files_from_previous_profile_runs","()",""],["resume","RubyProf","RubyProf.html#method-c-resume","()",""],["resume","RubyProf::Profile","RubyProf/Profile.html#method-i-resume","()","

Resumes recording profile data.\n"],["root?","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-root-3F","()",""],["root?","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-root-3F","()",""],["roots_of","RubyProf::CallInfo","RubyProf/CallInfo.html#method-c-roots_of","(call_infos)",""],["run","RubyProf::Cmd","RubyProf/Cmd.html#method-i-run","()",""],["run_script","RubyProf::ProfileTask","RubyProf/ProfileTask.html#method-i-run_script","(script_path)","

Run script\n"],["running?","RubyProf","RubyProf.html#method-c-running-3F","()",""],["running?","RubyProf::Profile","RubyProf/Profile.html#method-i-running-3F","()","

Returns whether a profile is currently running.\n"],["self_time","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-self_time","()",""],["self_time","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-self_time","()",""],["setup_options","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-setup_options","(options = {})","

Specify print options.\n

options - Hash table\n\n

:min_percent - Number 0 to 100 that specifes the minimum\n  ...
\n"],["setup_options","RubyProf::Cmd","RubyProf/Cmd.html#method-i-setup_options","()",""],["setup_options","RubyProf::GraphHtmlPrinter","RubyProf/GraphHtmlPrinter.html#method-i-setup_options","(options)",""],["sort_method","RubyProf::AbstractPrinter","RubyProf/AbstractPrinter.html#method-i-sort_method","()",""],["sort_method","RubyProf::FlatPrinter","RubyProf/FlatPrinter.html#method-i-sort_method","()","

Override for this printer to sort by self time by default\n"],["stack","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-stack","()",""],["stack_profile","RubyProf::MultiPrinter","RubyProf/MultiPrinter.html#method-i-stack_profile","()","

the name of the call stack profile file\n"],["start","RubyProf","RubyProf.html#method-c-start","()",""],["start","RubyProf::Profile","RubyProf/Profile.html#method-i-start","()","

Starts recording profile data.\n"],["start_script","RubyProf","RubyProf.html#method-c-start_script","(script)","

Profiling\n"],["stop","RubyProf","RubyProf.html#method-c-stop","()",""],["stop","RubyProf::Profile","RubyProf/Profile.html#method-i-stop","()","

Stops collecting profile data.\n"],["sum","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-sum","(a)",""],["target","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-target","()",""],["template","RubyProf::GraphHtmlPrinter","RubyProf/GraphHtmlPrinter.html#method-i-template","()",""],["threads","RubyProf::Profile","RubyProf/Profile.html#method-i-threads","()","

Returns an array of RubyProf::Thread instances that were executed while the\nthe program was being run. …\n"],["threshold","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-threshold","()",""],["title","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-title","()",""],["to_s","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-to_s","()",""],["to_s","RubyProf::CallInfo","RubyProf/CallInfo.html#method-i-to_s","()",""],["to_s","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-to_s","()",""],["top_call_infos","RubyProf::Thread","RubyProf/Thread.html#method-i-top_call_infos","()",""],["top_methods","RubyProf::Thread","RubyProf/Thread.html#method-i-top_methods","()",""],["total_time","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-total_time","()",""],["total_time","RubyProf::CallStackPrinter","RubyProf/CallStackPrinter.html#method-i-total_time","(call_infos)",""],["total_time","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-total_time","()",""],["total_time","RubyProf::Thread","RubyProf/Thread.html#method-i-total_time","()",""],["tree_profile","RubyProf::MultiPrinter","RubyProf/MultiPrinter.html#method-i-tree_profile","()","

the name of the callgrind profile file\n"],["visit","RubyProf::CallInfoVisitor","RubyProf/CallInfoVisitor.html#method-i-visit","(&block)",""],["wait_time","RubyProf::AggregateCallInfo","RubyProf/AggregateCallInfo.html#method-i-wait_time","()",""],["wait_time","RubyProf::MethodInfo","RubyProf/MethodInfo.html#method-i-wait_time","()",""],["wait_time","RubyProf::Thread","RubyProf/Thread.html#method-i-wait_time","()",""],["LICENSE","","LICENSE.html","","

Copyright (C) 2005 - 2014 Shugo Maeda <shugo@ruby-lang.org> and\nCharlie Savage <cfis@savagexi.com> …\n"],["README","","README_rdoc.html","","

ruby-prof\n

…\n"],["flat","","examples/flat_txt.html","","

Flat Profiles\n

Flat profiles show the total amount of time spent in each method. As an\nexample, here is …\n"],["graph.html","","examples/graph_html.html","","

<!DOCTYPE HTML PUBLIC “-//W3C//DTD HTML 4.01//EN”\n“www.w3.org/TR/html4/strict.dtd”> …\n"],["graph","","examples/graph_txt.html","","

Graph Profiles\n

Graph profiles show how long each method runs, which methods call it and\nwhich methods …\n"]]}}ruby-prof-0.16.2/doc/js/search.js0000644000175600017570000000566012766254554015601 0ustar pravipraviSearch = function(data, input, result) { this.data = data; this.$input = $(input); this.$result = $(result); this.$current = null; this.$view = this.$result.parent(); this.searcher = new Searcher(data.index); this.init(); } Search.prototype = $.extend({}, Navigation, new function() { var suid = 1; this.init = function() { var _this = this; var observer = function(e) { switch(e.originalEvent.keyCode) { case 38: // Event.KEY_UP case 40: // Event.KEY_DOWN return; } _this.search(_this.$input[0].value); }; this.$input.keyup(observer); this.$input.click(observer); // mac's clear field this.searcher.ready(function(results, isLast) { _this.addResults(results, isLast); }) this.initNavigation(); this.setNavigationActive(false); } this.search = function(value, selectFirstMatch) { value = jQuery.trim(value).toLowerCase(); if (value) { this.setNavigationActive(true); } else { this.setNavigationActive(false); } if (value == '') { this.lastQuery = value; this.$result.empty(); this.$result.attr('aria-expanded', 'false'); this.setNavigationActive(false); } else if (value != this.lastQuery) { this.lastQuery = value; this.$result.attr('aria-busy', 'true'); this.$result.attr('aria-expanded', 'true'); this.firstRun = true; this.searcher.find(value); } } this.addResults = function(results, isLast) { var target = this.$result.get(0); if (this.firstRun && (results.length > 0 || isLast)) { this.$current = null; this.$result.empty(); } for (var i=0, l = results.length; i < l; i++) { var item = this.renderItem.call(this, results[i]); item.setAttribute('id', 'search-result-' + target.childElementCount); target.appendChild(item); }; if (this.firstRun && results.length > 0) { this.firstRun = false; this.$current = $(target.firstChild); this.$current.addClass('search-selected'); } if (jQuery.browser.msie) this.$element[0].className += ''; if (isLast) this.$result.attr('aria-busy', 'false'); } this.move = function(isDown) { if (!this.$current) return; var $next = this.$current[isDown ? 'next' : 'prev'](); if ($next.length) { this.$current.removeClass('search-selected'); $next.addClass('search-selected'); this.$input.attr('aria-activedescendant', $next.attr('id')); this.scrollIntoView($next[0], this.$view[0]); this.$current = $next; this.$input.val($next[0].firstChild.firstChild.text); this.$input.select(); } return true; } this.hlt = function(html) { return this.escapeHTML(html). replace(/\u0001/g, ''). replace(/\u0002/g, ''); } this.escapeHTML = function(html) { return html.replace(/[&<>]/g, function(c) { return '&#' + c.charCodeAt(0) + ';'; }); } }); ruby-prof-0.16.2/doc/js/navigation.js.gz0000644000175600017570000000177512766254554017115 0ustar pravipraviYhVnavigation.jsW]o9}ϯH͔,H@Պ--$V;L,\{$.{mχ=$З4{|,XF4rY\k*49\WzSW%ln JT2E"F:x1epvY’qhDI_ -?24HlXH++F4UJehp:`b2Yj%RhU eYg#WK&p]HFPfN0<.”hLͣ1Vl#oֆ ` .e6h`w3F``b:\h,Eёae-mHΊFF*p1VqMBuutB 7]S\ady"\;]*QX,NCjLz)g7 zFߌ?_!`>~N4$xz"N]ՀF+EjV1po~0g[h+jNhJXSV{}#  ߾aD+޴ZWLmRDizM7-~G9gs83=~ұhW-;ν6~gP{^hu>b0j*7oGLS\7~Jjv-"mݼî̟zm1.}q<&~"B򀣒((7/VS{V|i*OtLHEg]P=Y *5B5}}Wc-S7 .COruby-prof-0.16.2/doc/js/searcher.js0000644000175600017570000001471512766254554016131 0ustar pravipraviSearcher = function(data) { this.data = data; this.handlers = []; } Searcher.prototype = new function() { // search is performed in chunks of 1000 for non-blocking user input var CHUNK_SIZE = 1000; // do not try to find more than 100 results var MAX_RESULTS = 100; var huid = 1; var suid = 1; var runs = 0; this.find = function(query) { var queries = splitQuery(query); var regexps = buildRegexps(queries); var highlighters = buildHilighters(queries); var state = { from: 0, pass: 0, limit: MAX_RESULTS, n: suid++}; var _this = this; this.currentSuid = state.n; if (!query) return; var run = function() { // stop current search thread if new search started if (state.n != _this.currentSuid) return; var results = performSearch(_this.data, regexps, queries, highlighters, state); var hasMore = (state.limit > 0 && state.pass < 4); triggerResults.call(_this, results, !hasMore); if (hasMore) { setTimeout(run, 2); } runs++; }; runs = 0; // start search thread run(); } /* ----- Events ------ */ this.ready = function(fn) { fn.huid = huid; this.handlers.push(fn); } /* ----- Utilities ------ */ function splitQuery(query) { return jQuery.grep(query.split(/(\s+|::?|\(\)?)/), function(string) { return string.match(/\S/); }); } function buildRegexps(queries) { return jQuery.map(queries, function(query) { return new RegExp(query.replace(/(.)/g, '([$1])([^$1]*?)'), 'i'); }); } function buildHilighters(queries) { return jQuery.map(queries, function(query) { return jQuery.map(query.split(''), function(l, i) { return '\u0001$' + (i*2+1) + '\u0002$' + (i*2+2); }).join(''); }); } // function longMatchRegexp(index, longIndex, regexps) { // for (var i = regexps.length - 1; i >= 0; i--){ // if (!index.match(regexps[i]) && !longIndex.match(regexps[i])) return false; // }; // return true; // } /* ----- Mathchers ------ */ /* * This record matches if the index starts with queries[0] and the record * matches all of the regexps */ function matchPassBeginning(index, longIndex, queries, regexps) { if (index.indexOf(queries[0]) != 0) return false; for (var i=1, l = regexps.length; i < l; i++) { if (!index.match(regexps[i]) && !longIndex.match(regexps[i])) return false; }; return true; } /* * This record matches if the longIndex starts with queries[0] and the * longIndex matches all of the regexps */ function matchPassLongIndex(index, longIndex, queries, regexps) { if (longIndex.indexOf(queries[0]) != 0) return false; for (var i=1, l = regexps.length; i < l; i++) { if (!longIndex.match(regexps[i])) return false; }; return true; } /* * This record matches if the index contains queries[0] and the record * matches all of the regexps */ function matchPassContains(index, longIndex, queries, regexps) { if (index.indexOf(queries[0]) == -1) return false; for (var i=1, l = regexps.length; i < l; i++) { if (!index.match(regexps[i]) && !longIndex.match(regexps[i])) return false; }; return true; } /* * This record matches if regexps[0] matches the index and the record * matches all of the regexps */ function matchPassRegexp(index, longIndex, queries, regexps) { if (!index.match(regexps[0])) return false; for (var i=1, l = regexps.length; i < l; i++) { if (!index.match(regexps[i]) && !longIndex.match(regexps[i])) return false; }; return true; } /* ----- Highlighters ------ */ function highlightRegexp(info, queries, regexps, highlighters) { var result = createResult(info); for (var i=0, l = regexps.length; i < l; i++) { result.title = result.title.replace(regexps[i], highlighters[i]); result.namespace = result.namespace.replace(regexps[i], highlighters[i]); }; return result; } function hltSubstring(string, pos, length) { return string.substring(0, pos) + '\u0001' + string.substring(pos, pos + length) + '\u0002' + string.substring(pos + length); } function highlightQuery(info, queries, regexps, highlighters) { var result = createResult(info); var pos = 0; var lcTitle = result.title.toLowerCase(); pos = lcTitle.indexOf(queries[0]); if (pos != -1) { result.title = hltSubstring(result.title, pos, queries[0].length); } result.namespace = result.namespace.replace(regexps[0], highlighters[0]); for (var i=1, l = regexps.length; i < l; i++) { result.title = result.title.replace(regexps[i], highlighters[i]); result.namespace = result.namespace.replace(regexps[i], highlighters[i]); }; return result; } function createResult(info) { var result = {}; result.title = info[0]; result.namespace = info[1]; result.path = info[2]; result.params = info[3]; result.snippet = info[4]; return result; } /* ----- Searching ------ */ function performSearch(data, regexps, queries, highlighters, state) { var searchIndex = data.searchIndex; var longSearchIndex = data.longSearchIndex; var info = data.info; var result = []; var i = state.from; var l = searchIndex.length; var togo = CHUNK_SIZE; var matchFunc, hltFunc; while (state.pass < 4 && state.limit > 0 && togo > 0) { if (state.pass == 0) { matchFunc = matchPassBeginning; hltFunc = highlightQuery; } else if (state.pass == 1) { matchFunc = matchPassLongIndex; hltFunc = highlightQuery; } else if (state.pass == 2) { matchFunc = matchPassContains; hltFunc = highlightQuery; } else if (state.pass == 3) { matchFunc = matchPassRegexp; hltFunc = highlightRegexp; } for (; togo > 0 && i < l && state.limit > 0; i++, togo--) { if (info[i].n == state.n) continue; if (matchFunc(searchIndex[i], longSearchIndex[i], queries, regexps)) { info[i].n = state.n; result.push(hltFunc(info[i], queries, regexps, highlighters)); state.limit--; } }; if (searchIndex.length <= i) { state.pass++; i = state.from = 0; } else { state.from = i; } } return result; } function triggerResults(results, isLast) { jQuery.each(this.handlers, function(i, fn) { fn.call(this, results, isLast) }) } } ruby-prof-0.16.2/doc/js/darkfish.js0000644000175600017570000001107212766254554016121 0ustar pravipravi/** * * Darkfish Page Functions * $Id: darkfish.js 53 2009-01-07 02:52:03Z deveiant $ * * Author: Michael Granger * */ /* Provide console simulation for firebug-less environments */ if (!("console" in window) || !("firebug" in console)) { var names = ["log", "debug", "info", "warn", "error", "assert", "dir", "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace", "profile", "profileEnd"]; window.console = {}; for (var i = 0; i < names.length; ++i) window.console[names[i]] = function() {}; }; /** * Unwrap the first element that matches the given @expr@ from the targets and return them. */ $.fn.unwrap = function( expr ) { return this.each( function() { $(this).parents( expr ).eq( 0 ).after( this ).remove(); }); }; function showSource( e ) { var target = e.target; var codeSections = $(target). parents('.method-detail'). find('.method-source-code'); $(target). parents('.method-detail'). find('.method-source-code'). slideToggle(); }; function hookSourceViews() { $('.method-heading').click( showSource ); }; function hookSearch() { var input = $('#search-field').eq(0); var result = $('#search-results').eq(0); $(result).show(); var search_section = $('#search-section').get(0); $(search_section).show(); var search = new Search(search_data, input, result); search.renderItem = function(result) { var li = document.createElement('li'); var html = ''; // TODO add relative path to

Table of Contents - ruby-prof

Pages

Classes and Modules

Methods

ruby-prof-0.16.2/doc/index.html0000644000175600017570000007442212766254554015361 0ustar pravipravi ruby-prof

ruby-prof ↑

Build Status

Overview ↑

ruby-prof is a fast code profiler for MRI Ruby. Its features include:

  • Speed - it is a C extension and therefore many times faster than the standard Ruby profiler.

  • Modes - Ruby prof can measure a number of different parameters, including call times, memory usage and object allocations.

  • Reports - can generate text and cross-referenced html reports

    • Flat Profiles - similar to the reports generated by the standard Ruby profiler

    • Graph profiles - similar to GProf, these show how long a method runs, which methods call it and which methods it calls.

    • Call tree profiles - outputs results in the calltree format suitable for the KCacheGrind profiling tool.

    • Many more – see reports section of this README.

  • Threads - supports profiling multiple threads simultaneously

Requirements ↑

ruby-prof requires Ruby 1.9.3 or higher. Please note some ruby releases have known bugs which cause ruby-prof problems, like incorrect measurements. We suggest to use the latest minor patch level release if possible. In particular, on the 2.1 branch of ruby you should use at least 2.1.7.

If you are running Linux or Unix you'll need a C compiler so the extension can be compiled when it is installed.

If you are running Windows, then you may need to install the Windows specific RubyGem which includes an already built extension (see Install section).

Install ↑

The easiest way to install ruby-prof is by using Ruby Gems. To install:

gem install ruby-prof

If you're on windows then please install the devkit first so that it can compile.

Usage ↑

There are three major options for running ruby-prof: via the command line, via its convenience API or via its core API.

ruby-prof Executable ↑

The first is to use ruby-prof to run the Ruby program you want to profile. For more information refer to the documentation of the ruby-prof command.

ruby-prof Convenience API ↑

The second way is to use the ruby-prof convenience API to profile particular segments of code.

require 'ruby-prof'

# profile the code
RubyProf.start
# ... code to profile ...
result = RubyProf.stop

# print a flat profile to text
printer = RubyProf::FlatPrinter.new(result)
printer.print(STDOUT)

Alternatively, you can use a block to tell ruby-prof what to profile:

require 'ruby-prof'

# profile the code
result = RubyProf.profile do
  # ... code to profile ...
end

# print a graph profile to text
printer = RubyProf::GraphPrinter.new(result)
printer.print(STDOUT, {})

ruby-prof also supports pausing and resuming profiling runs.

require 'ruby-prof'

# profile the code
RubyProf.start
# ... code to profile ...

RubyProf.pause
# ... other code ...

RubyProf.resume
# ... code to profile ...
result = RubyProf.stop

Note that resume will only work if start has been called previously. In addition, resume can also take a block:

require 'ruby-prof'

RubyProf.resume do
  # ... code to profile...
end

result = RubyProf.stop

With this usage, resume will automatically call pause at the end of the block.

Profiling Selected Threads (Core API) ↑

The convenience API does not support running multiple profiles in separate threads concurrently, but the RubyProf::Profile API does. In fact, the convenience layer uses the Profile API internally. It all revolves around Profile objects:

RubyProf::Profile.new

Create a profile object given an options hash (see below)

The following options are available when creating Profile instances:

measure_mode

One of the defined measure modes

exclude_threads

Array of threads which should not be profiled.

include_threads

Array of threads which should be profiled. All other threads will be ignored.

merge_fibers

Whether profiling data for a given thread's fibers should all be subsumed under a single entry. Basically only useful to produce callgrind profiles.

RubyProf::Profile#start

Start profiling

RubyProf::Profile#pause

Pause profiling

RubyProf::Profile#resume

Resume profiling

RubyProf::Profile#stop

Stop profiling and return self

RubyProf::Profile#profile

Perform a profile run and return result. Accepts the same arguments as RubyProf::Profile.new.

Method Elimination ↑

ruby-prof supports eliminating specific methods and threads from profiling results. This is useful for reducing connectivity in the call graph, making it easier to identify the source of performance problems when using a graph printer.

For example, consider Integer#times: it's hardly ever useful to know how much time is spent in the method itself. We're much more interested in how much the passed in block contributes to the time spent in the method which contains the Integer#times call.

Methods are eliminated from the collected data by calling eliminate_methods! on the profiling result, before submitting it to a printer.

result = RubyProf.stop
result.eliminate_methods!([/Integer#times/])

The argument given to eliminate_methods! is either an array of regular expressions, or the name of a file containing a list of regular expressions (line separated text).

After eliminating methods the resulting profile will appear exactly as if those methods had been inlined at their call sites.

Profiling Rails ↑

To profile a Rails application it is vital to run it using production like settings (cache classes, cache view lookups, etc.). Otherwise, Rail's dependency loading code will overwhelm any time spent in the application itself (our tests show that Rails dependency loading causes a roughly 6x slowdown). The best way to do this is create a new Rails environment, profile.rb.

So to profile Rails:

  1. Create a new profile.rb environment. Make sure to turn on cache_classes and cache_template_loading. Otherwise your profiling results will be overwhelmed by the time Rails spends loading required files. You should likely turn off caching.

  2. Add the ruby-prof to your gemfile:

    group :profile do
  gem 'ruby-prof'
end

  3. Add the ruby prof rack adapter to your middleware stack. One way to do this is by adding the following code to config.ru:

    if Rails.env.profile?
  use Rack::RubyProf, :path => '/temp/profile'
end

    The path is where you want profiling results to be stored. By default the rack adapter will generate a html call graph report and flat text report.

  4. Now make a request to your running server. New profiling information will be generated for each request. Note that each request will overwrite the profiling reports created by the previous request!

Reports ↑

ruby-prof can generate a number of different reports:

  • Flat Reports

  • Graph Reports

  • HTML Graph Reports

  • Call graphs

  • Call stack reports

  • More!

Flat profiles show the overall time spent in each method. They are a good way of quickly identifying which methods take the most time. An example of a flat profile and an explanation can be found in examples/flat.txt.

There are several varieties of these - run ruby-prof --help

Graph profiles also show the overall time spent in each method. In addition, they also show which methods call the current method and which methods its calls. Thus they are good for understanding how methods gets called and provide insight into the flow of your program. An example text graph profile is located at examples/graph.txt.

HTML Graph profiles are the same as graph profiles, except output is generated in hyper-linked HTML. Since graph profiles can be quite large, the embedded links make it much easier to navigate the results. An example html graph profile is located at examples/graph.html.

Call graphs output results in the calltree profile format which is used by KCachegrind. Call graph support was generously donated by Carl Shimer. More information about the format can be found at the KCachegrind site.

Call stack reports produce a HTML visualization of the time spent in each execution path of the profiled code. An example can be found at examples/stack.html.

Another good example: twitpic.com/28z94a

Finally, there's a so called MultiPrinter which can generate several reports in one profiling run. See examples/multi.stack.html.

There is also a graphviz .dot visualiser.

Printers ↑

Reports are created by printers. Supported printers include:

RubyProf::FlatPrinter

Creates a flat report in text format

RubyProf::FlatPrinterWithLineNumbers

Same as above but more verbose

RubyProf::GraphPrinter

Creates a call graph report in text format

RubyProf::GraphHtmlPrinter

Creates a call graph report in HTML (separate files per thread)

RubyProf::DotPrinter

Creates a call graph report in GraphViz's DOT format which can be converted to an image

RubyProf::CallTreePrinter

Creates a call tree report compatible with KCachegrind

RubyProf::CallStackPrinter

Creates a HTML visualization of the Ruby stack

RubyProf::MultiPrinter

Uses the other printers to create several reports in one profiling run

To use a printer:

result = RubyProf.stop
printer = RubyProf::GraphPrinter.new(result)
printer.print(STDOUT, :min_percent => 2)

The first parameter is any writable IO object such as STDOUT or a file. The second parameter, specifies the minimum percentage a method must take to be printed. Percentages should be specified as integers in the range 0 to 100. For more information please see the documentation for the different printers.

The other option is :print_file => true (default false), which adds the filename to the output (GraphPrinter only).

MultiPrinter differs from the other printers in that it requires a directory path and a basename for the files it produces.

printer = RubyProf::MultiPrinter.new(result)
printer.print(:path => ".", :profile => "profile")

Measurements ↑

Depending on the mode and platform, ruby-prof can measure various aspects of a Ruby program. Supported measurements include:

RubyProf::WALL_TIME

Wall time measures the real-world time elapsed between any two moments. If there are other processes concurrently running on the system that use significant CPU or disk time during a profiling run then the reported results will be larger than expected.

RubyProf::PROCESS_TIME

Process time measures the time used by a process between any two moments. It is unaffected by other processes concurrently running on the system. Note that Windows does not support measuring process times.

RubyProf::CPU_TIME

CPU time uses the CPU clock counter to measure time. The returned values are dependent on the correctly setting the CPU's frequency. This mode is only supported on Pentium or PowerPC platforms (linux only).

RubyProf::ALLOCATIONS

Object allocation reports show how many objects each method in a program allocates. This support was added by Sylvain Joyeux and requires a patched Ruby interpreter. See below.

RubyProf::MEMORY

Memory usage reports show how much memory each method in a program uses. This support was added by Alexander Dymo and requires a patched Ruby interpreter. See below.

RubyProf::GC_TIME

Garbage collection time reports how much time is spent in Ruby's garbage collector during a profiling session. This support was added by Jeremy Kemper and requires a patched Ruby interpreter. See below.

RubyProf::GC_RUNS

Garbage collection runs report how many times Ruby's garbage collector is invoked during a profiling session. This support was added by Jeremy Kemper and requires a patched Ruby interpreter. See below.

Patching ruby ↑

All of the patches to Ruby are included in the railsexpress patchsets for rvm, see github.com/skaes/rvm-patchsets. You can also use these patches manually with other ruby managers (ruby-install, ruby-build, etc.).

Note if you rebuild your ruby with patches you must uninstall and reinstall the ruby-prof gem to take advantage of the new capabilities.

Measure modes ↑

To set the measurement:

RubyProf.measure_mode = RubyProf::WALL_TIME
RubyProf.measure_mode = RubyProf::PROCESS_TIME
RubyProf.measure_mode = RubyProf::CPU_TIME
RubyProf.measure_mode = RubyProf::ALLOCATIONS
RubyProf.measure_mode = RubyProf::MEMORY
RubyProf.measure_mode = RubyProf::GC_TIME
RubyProf.measure_mode = RubyProf::GC_RUNS

The default value is RubyProf::WALL_TIME.

You may also specify the measure mode by using the RUBY_PROF_MEASURE_MODE environment variable:

export RUBY_PROF_MEASURE_MODE=wall
export RUBY_PROF_MEASURE_MODE=process
export RUBY_PROF_MEASURE_MODE=cpu
export RUBY_PROF_MEASURE_MODE=allocations
export RUBY_PROF_MEASURE_MODE=memory
export RUBY_PROF_MEASURE_MODE=gc_time
export RUBY_PROF_MEASURE_MODE=gc_runs

On Linux, process time is measured using the clock method provided by the C runtime library. Note that the clock method does not report time spent in the kernel or child processes and therefore does not measure time spent in methods such as Kernel.sleep method. If you need to measure these values, then use wall time. Wall time is measured using the gettimeofday kernel method.

If you set the clock mode to PROCESS_TIME, then timings are read using the clock method provided by the C runtime library. Note though, these values are wall times on Windows and not process times like on Linux. Wall time is measured using the GetLocalTime API.

If you use wall time, the results will be affected by other processes running on your computer, network delays, disk access, etc. As result, for the best results, try to make sure your computer is only performing your profiling run and is otherwise quiescent.

Multi-threaded Applications ↑

Unfortunately, Ruby does not provide an internal API for detecting thread context switches. As a result, the timings ruby-prof reports for each thread may be slightly inaccurate. In particular, this will happen for newly spawned threads that go to sleep immediately (their first call). For instance, if you use Ruby's timeout library to wait for 2 seconds, the 2 seconds will be assigned to the foreground thread and not the newly created background thread. These errors can largely be avoided if the background thread performs any operation before going to sleep.

Performance ↑

Significant effort has been put into reducing ruby-prof's overhead as much as possible. Our tests show that the overhead associated with profiling code varies considerably with the code being profiled. Most programs will run approximately twice as slow while highly recursive programs (like the fibonacci series test) will run three times slower.

License ↑

See LICENSE for license information.

API Documentation ↑

The ruby-prof API documentation for the latest released gem version can be found here: www.rubydoc.info/gems/ruby-prof/

The ruby-prof API documentation for the master branch is available here: www.rubydoc.info/github/ruby-prof/ruby-prof/

Development ↑

Code is located at github.com/ruby-prof/ruby-prof

Google group/mailing list: groups.google.com/group/ruby-optimization or open a github issue.

ruby-prof-0.16.2/doc/examples/0000755000175600017570000000000012766254554015171 5ustar pravipraviruby-prof-0.16.2/doc/examples/graph_txt.html0000644000175600017570000002560412766254554020066 0ustar pravipravi graph - ruby-prof

Graph Profiles ↑

Graph profiles show how long each method runs, which methods call it and which methods it calls.

As an example, here is the output from running printers_test.rb:

Measure Mode: wall_time Thread ID: 70310439543100 Fiber ID: 70310456289620 Total Time: 0.05264616012573242 Sort by: total_time

%total   %self      total       self       wait      child            calls    name
100.00%   0.01%      0.053      0.000      0.000      0.053                1      PrintersTest#setup
                     0.053      0.000      0.000      0.053              1/1      Object#run_primes
                    0.053      0.000      0.000      0.053              1/1      PrintersTest#setup
99.99%   0.01%      0.053      0.000      0.000      0.053                1      Object#run_primes
                    0.052      0.000      0.000      0.052              1/1      Object#find_primes
                    0.001      0.000      0.000      0.001              1/1      Object#make_random_array
                    0.000      0.000      0.000      0.000              1/1      Object#find_largest
                    0.052      0.000      0.000      0.052              1/1      Object#run_primes
98.35%   0.00%      0.052      0.000      0.000      0.052                1      Object#find_primes
                    0.052      0.000      0.000      0.051              1/1      Array#select
                    0.052      0.000      0.000      0.051              1/1      Object#find_primes
98.34%   0.61%      0.052      0.000      0.000      0.051                1      Array#select
                    0.051      0.000      0.000      0.051        1000/1000      Object#is_prime
                    0.051      0.000      0.000      0.051        1000/1000      Array#select
97.74%   0.93%      0.051      0.000      0.000      0.051             1000      Object#is_prime
                    0.051      0.051      0.000      0.000        1000/1001      Integer#upto
                    0.000      0.000      0.000      0.000           1/1001      Object#find_largest
                    0.051      0.051      0.000      0.000        1000/1001      Object#is_prime
96.91%  96.91%      0.051      0.051      0.000      0.000             1001      Integer#upto
                   0.001      0.000      0.000      0.001              1/1      Object#run_primes
1.51%   0.00%      0.001      0.000      0.000      0.001                1      Object#make_random_array
                   0.001      0.000      0.000      0.000              1/1      Array#each_index
                   0.000      0.000      0.000      0.000              1/1      Class#new
                   0.001      0.000      0.000      0.000              1/1      Object#make_random_array
1.50%   0.56%      0.001      0.000      0.000      0.000                1      Array#each_index
                   0.000      0.000      0.000      0.000        1000/1000      Kernel#rand
                   0.000      0.000      0.000      0.000        1000/1000      Array#each_index
0.94%   0.72%      0.000      0.000      0.000      0.000             1000      Kernel#rand
                   0.000      0.000      0.000      0.000        1000/1000      Kernel#respond_to_missing?
                   0.000      0.000      0.000      0.000        1000/1000      Kernel#rand
0.22%   0.22%      0.000      0.000      0.000      0.000             1000      Kernel#respond_to_missing?
                   0.000      0.000      0.000      0.000              1/1      Object#run_primes
0.12%   0.02%      0.000      0.000      0.000      0.000                1      Object#find_largest
                   0.000      0.000      0.000      0.000           1/1001      Integer#upto
                   0.000      0.000      0.000      0.000              1/1      Array#first
                   0.000      0.000      0.000      0.000              1/1      Object#make_random_array
0.01%   0.00%      0.000      0.000      0.000      0.000                1      Class#new
                   0.000      0.000      0.000      0.000              1/1      Array#initialize
                   0.000      0.000      0.000      0.000              1/1      Class#new
0.01%   0.01%      0.000      0.000      0.000      0.000                1      Array#initialize
                   0.000      0.000      0.000      0.000              1/1      Object#find_largest
0.00%   0.00%      0.000      0.000      0.000      0.000                1      Array#first

Overview ↑

Dashed lines divide the report into entries, with one entry per method. Entries are sorted by total time which is the time spent in the method plus its children.

Each entry has a primary line demarked by values in the %total and %self columns. The primary line represents the method being profiled. Lines above it are the methods that called this method (parents) while the lines below it are the methods it called (children).

All values are in seconds. For the primary line, the columns represent:

%total  - The percentage of time spent in this method and its children
%self   - The percentage of time spent in this method
total   - The time spent in this method and its children.
self    - The time spent in this method.
wait    - The time spent waiting for other threads in this method.
child   - The time spent in this method's children.
calls   - The number of times this method was called.
name    - The name of the method.

The interpretation of method names is:

MyObject#test           - An instance method "test" of the class "MyObject"
<Object:MyObject>#test  - The <> characters indicate a singleton method on a singleton class.

For example, we see that 97.74% of the time was spent in Object#is_prime and its children. Of that time, almost everything was contributed by Integer#upto. Overall, Integer#upto was called 1001 times and 1000 of those calls were made by Object#is_prime.

Parents ↑

In each entry, the lines above the primary line are the methods that called the current method. If the current method is a root method then no parents are shown.

For parent lines, the columns represent:

total  - The time spent in the current method and its children on behalf of the parent method.
self   - The time spent in this method on behalf of the parent method.
child  - The time spent in this method's children on behalf of the parent.
wait   - The time spent waiting for other threads in this method's children on behalf of the parent.
calls  - The number of times the parent method called the current method vs. the total number of calls of the current method.

Looking at the main entry for Integer#upto, we see that it was called 1000 times from Object#is_prime and 1 time from find_largest.

Children ↑

In each entry, the lines below the primary line are the methods that the current method called. If the current method is a leaf method then no children are shown.

For children lines, the columns represent:

total  - The time spent in the child, and its descendants, on behalf of the current method
self   - The time spent in the child on behalf of the current method.
wait   - The time spent waiting for other threads in the child's and its descendants on behalf of the current method.
child  - The time spent in the child's descendants on behalf of the current method.
calls  - The number of times the child method was called by the current method vs. the total number of calls of the child method.

If we look at the main entry for Objext#run_primes, we see that it called three other methods - Object#find_primes, Object#make_random_array and Object#find_largest.

ruby-prof-0.16.2/doc/examples/graph_html.html0000644000175600017570000006767212766254554020226 0ustar pravipravi graph.html - ruby-prof

<!DOCTYPE HTML PUBLIC “-//W3C//DTD HTML 4.01//EN” “www.w3.org/TR/html4/strict.dtd”> <html> <head> <style media=“all” type=“text/css”>

  table {
          border-collapse: collapse;
          border: 1px solid #CCC;
          font-family: Verdana, Arial, Helvetica, sans-serif;
          font-size: 9pt;
          line-height: normal;
  }

  th {
          text-align: center;
          border-top: 1px solid #FB7A31;
          border-bottom: 1px solid #FB7A31;
          background: #FFC;
          padding: 0.3em;
          border-left: 1px solid silver;
  }

              tr.break td {
                border: 0;
          border-top: 1px solid #FB7A31;
                      padding: 0;
                      margin: 0;
              }

  tr.method td {
                      font-weight: bold;
  }

  td {
          padding: 0.3em;
  }

  td:first-child {
          width: 190px;
          }

  td {
          border-left: 1px solid #CCC;
          text-align: center;
  }
</style>

</head> <body> <h1> Graph Profile</h1> <p>Graph profiles show how long each method runs, which methods call it

and which methods it calls. To understand how to read a graph profile, refer to
 the <a href="graph.txt">documentation</a> for the text graph report. </p>

<p>The main advantage of an HTML graph format versus the text format is the use of

hyperlinks to jump between methods. This makes it easier to understand the flow

of control through a program and which methods take the most time.</p> <p>Below is the output from running printers_test.rb reproduced in HTML. </p> <p>Profile Report</p>

<table>

<tr>
  <th>Thread ID</th>
  <th>Total Time</th>
</tr>
<tr>
  <td><a href="#21277412">21277412</a></td>
  <td>8.766</td>
</tr>

</table>

<h2><a name=“21277412”>Thread 21277412</a></h2> <table>

<tr>
  <th> %Total</th>
  <th> %Self</th>
  <th> Total</th>
  <th> Self</th>
  <th> Children</th>
  <th> Calls</th>
  <th>Name</th>
</tr>

<tr class="method">
  <td> 100.00%</td>
  <td> 0.00%</td>
  <td> 8.77</td>
  <td> 0.00</td>
  <td> 8.77</td>
  <td> 1</td>
  <td><a name="_toplevel_21277412">#toplevel</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 8.77</td>
  <td> 0.00</td>
  <td> 8.77</td>
  <td> 1/1</td>
  <td><a href="#Object_run_primes_21277412">Object#run_primes</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 8.77</td>
  <td> 0.00</td>
  <td> 8.77</td>
  <td> 1/1</td>
  <td><a href="#_toplevel_21277412">#toplevel</a></td>
</tr>
<tr class="method">
  <td> 100.00%</td>
  <td> 0.00%</td>
  <td> 8.77</td>
  <td> 0.00</td>
  <td> 8.77</td>
  <td> 1</td>
  <td><a name="Object_run_primes_21277412">Object#run_primes</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.02</td>
  <td> 0.00</td>
  <td> 0.02</td>
  <td> 1/1</td>
  <td><a href="#Object_make_random_array_21277412">Object#make_random_array</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 2.09</td>
  <td> 1/1</td>
  <td><a href="#Object_find_largest_21277412">Object#find_largest</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.66</td>
  <td> 0.00</td>
  <td> 6.66</td>
  <td> 1/1</td>
  <td><a href="#Object_find_primes_21277412">Object#find_primes</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.63</td>
  <td> 4.06</td>
  <td> 2.56</td>
  <td> 500/501</td>
  <td><a href="#Object_is_prime_21277412">Object#is_prime</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 2.09</td>
  <td> 1/501</td>
  <td><a href="#Object_find_largest_21277412">Object#find_largest</a></td>
</tr>
<tr class="method">
  <td> 99.48%</td>
  <td> 46.34%</td>
  <td> 8.72</td>
  <td> 4.06</td>
  <td> 4.66</td>
  <td> 501</td>
  <td><a name="Integer_upto_21277412">Integer#upto</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 61/61</td>
  <td><a href="#Array_[]_21277412">Array#[]</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 61/61</td>
  <td><a href="#Fixnum_>_21277412">Fixnum#_</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 2.09</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 61/61</td>
  <td><a href="#Kernel_sleep_21277412">Kernel.sleep</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 1.24</td>
  <td> 1.24</td>
  <td> 0.00</td>
  <td> 250862/250862</td>
  <td><a href="#Fixnum____21277412">Fixnum#==</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 1.33</td>
  <td> 1.33</td>
  <td> 0.00</td>
  <td> 250862/250862</td>
  <td><a href="#Fixnum_%_21277412">Fixnum#%</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.66</td>
  <td> 0.01</td>
  <td> 6.64</td>
  <td> 1/1</td>
  <td><a href="#Object_find_primes_21277412">Object#find_primes</a></td>
</tr>
<tr class="method">
  <td> 75.93%</td>
  <td> 0.17%</td>
  <td> 6.66</td>
  <td> 0.01</td>
  <td> 6.64</td>
  <td> 1</td>
  <td><a name="Array_select_21277412">Array#select</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.64</td>
  <td> 0.01</td>
  <td> 6.63</td>
  <td> 500/500</td>
  <td><a href="#Object_is_prime_21277412">Object#is_prime</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.66</td>
  <td> 0.00</td>
  <td> 6.66</td>
  <td> 1/1</td>
  <td><a href="#Object_run_primes_21277412">Object#run_primes</a></td>
</tr>
<tr class="method">
  <td> 75.93%</td>
  <td> 0.00%</td>
  <td> 6.66</td>
  <td> 0.00</td>
  <td> 6.66</td>
  <td> 1</td>
  <td><a name="Object_find_primes_21277412">Object#find_primes</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.66</td>
  <td> 0.01</td>
  <td> 6.64</td>
  <td> 1/1</td>
  <td><a href="#Array_select_21277412">Array#select</a></td>
</tr>
<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.64</td>
  <td> 0.01</td>
  <td> 6.63</td>
  <td> 500/500</td>
  <td><a href="#Array_select_21277412">Array#select</a></td>
</tr>
<tr class="method">
  <td> 75.76%</td>
  <td> 0.17%</td>
  <td> 6.64</td>
  <td> 0.01</td>
  <td> 6.63</td>
  <td> 500</td>
  <td><a name="Object_is_prime_21277412">Object#is_prime</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500/501</td>
  <td><a href="#Fixnum_-_21277412">Fixnum#-</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 6.63</td>
  <td> 4.06</td>
  <td> 2.56</td>
  <td> 500/501</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 2.09</td>
  <td> 1/1</td>
  <td><a href="#Object_run_primes_21277412">Object#run_primes</a></td>
</tr>
<tr class="method">
  <td> 23.89%</td>
  <td> 0.00%</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 2.09</td>
  <td> 1</td>
  <td><a name="Object_find_largest_21277412">Object#find_largest</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/501</td>
  <td><a href="#Fixnum_-_21277412">Fixnum#-</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 2.09</td>
  <td> 1/501</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Array_first_21277412">Array#first</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Array_length_21277412">Array#length</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 2.09</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 61/61</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>
<tr class="method">
  <td> 23.89%</td>
  <td> 23.89%</td>
  <td> 2.09</td>
  <td> 2.09</td>
  <td> 0.00</td>
  <td> 61</td>
  <td><a name="Kernel_sleep_21277412">Kernel.sleep</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 1.33</td>
  <td> 1.33</td>
  <td> 0.00</td>
  <td> 250862/250862</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>
<tr class="method">
  <td> 15.12%</td>
  <td> 15.12%</td>
  <td> 1.33</td>
  <td> 1.33</td>
  <td> 0.00</td>
  <td> 250862</td>
  <td><a name="Fixnum_%_21277412">Fixnum#%</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 1.24</td>
  <td> 1.24</td>
  <td> 0.00</td>
  <td> 250862/250862</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>
<tr class="method">
  <td> 14.13%</td>
  <td> 14.13%</td>
  <td> 1.24</td>
  <td> 1.24</td>
  <td> 0.00</td>
  <td> 250862</td>
  <td><a name="Fixnum____21277412">Fixnum#==</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.02</td>
  <td> 0.00</td>
  <td> 0.02</td>
  <td> 1/1</td>
  <td><a href="#Object_run_primes_21277412">Object#run_primes</a></td>
</tr>
<tr class="method">
  <td> 0.18%</td>
  <td> 0.00%</td>
  <td> 0.02</td>
  <td> 0.00</td>
  <td> 0.02</td>
  <td> 1</td>
  <td><a name="Object_make_random_array_21277412">Object#make_random_array</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.02</td>
  <td> 0.02</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Array_each_index_21277412">Array#each_index</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Class_new_21277412">Class#new</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.02</td>
  <td> 0.02</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Object_make_random_array_21277412">Object#make_random_array</a></td>
</tr>
<tr class="method">
  <td> 0.18%</td>
  <td> 0.18%</td>
  <td> 0.02</td>
  <td> 0.02</td>
  <td> 0.00</td>
  <td> 1</td>
  <td><a name="Array_each_index_21277412">Array#each_index</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500/500</td>
  <td><a href="#Kernel_rand_21277412">Kernel.rand</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500/500</td>
  <td><a href="#Array_[]__21277412">Array#[]=</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500/501</td>
  <td><a href="#Object_is_prime_21277412">Object#is_prime</a></td>
</tr>
<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/501</td>
  <td><a href="#Object_find_largest_21277412">Object#find_largest</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 501</td>
  <td><a name="Fixnum_-_21277412">Fixnum#-</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Kernel_rand_21277412">Kernel.rand</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1</td>
  <td><a name="Integer_to_int_21277412">Integer#to_int</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Object_find_largest_21277412">Object#find_largest</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1</td>
  <td><a name="Array_first_21277412">Array#first</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Class_new_21277412">Class#new</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1</td>
  <td><a name="Array_initialize_21277412">Array#initialize</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Object_find_largest_21277412">Object#find_largest</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1</td>
  <td><a name="Array_length_21277412">Array#length</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Object_make_random_array_21277412">Object#make_random_array</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1</td>
  <td><a name="Class_new_21277412">Class#new</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Array_initialize_21277412">Array#initialize</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 61/61</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 61</td>
  <td><a name="Fixnum_>_21277412">Fixnum#_</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 61/61</td>
  <td><a href="#Integer_upto_21277412">Integer#upto</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 61</td>
  <td><a name="Array_[]_21277412">Array#[]</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500/500</td>
  <td><a href="#Array_each_index_21277412">Array#each_index</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500</td>
  <td><a name="Array_[]__21277412">Array#[]=</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500/500</td>
  <td><a href="#Array_each_index_21277412">Array#each_index</a></td>
</tr>
<tr class="method">
  <td> 0.00%</td>
  <td> 0.00%</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 500</td>
  <td><a name="Kernel_rand_21277412">Kernel.rand</a></td>
</tr>

<tr>
  <td>&nbsp;</td>
  <td>&nbsp;</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 0.00</td>
  <td> 1/1</td>
  <td><a href="#Integer_to_int_21277412">Integer#to_int</a></td>
</tr>

<tr class="break">
  <td colspan="7"></td>
</tr>

</table> </body> </html>

ruby-prof-0.16.2/doc/examples/flat_txt.html0000644000175600017570000001142312766254554017705 0ustar pravipravi flat - ruby-prof

Flat Profiles ↑

Flat profiles show the total amount of time spent in each method. As an example, here is the output from running printers_test.rb.

Measure Mode: wall_time Thread ID: 70355159212340 Fiber ID: 70355171633140 Total: 0.060485 Sort by: self_time

%self      total      self      wait     child     calls  name
97.07      0.059     0.059     0.000     0.000     1001   Integer#upto
 0.92      0.059     0.001     0.000     0.059     1000   Object#is_prime
 0.66      0.060     0.000     0.000     0.059        1   Array#select
 0.59      0.000     0.000     0.000     0.000     1000   Kernel#rand
 0.50      0.001     0.000     0.000     0.000        1   Array#each_index
 0.20      0.000     0.000     0.000     0.000     1000   Kernel#respond_to_missing?
 0.01      0.000     0.000     0.000     0.000        1   Object#find_largest
 0.01      0.060     0.000     0.000     0.060        1   PrintersTest#setup
 0.01      0.060     0.000     0.000     0.060        1   Object#find_primes
 0.01      0.000     0.000     0.000     0.000        1   Class#new
 0.01      0.060     0.000     0.000     0.060        1   Object#run_primes
 0.00      0.000     0.000     0.000     0.000        1   Array#first
 0.00      0.001     0.000     0.000     0.001        1   Object#make_random_array
 0.00      0.000     0.000     0.000     0.000        1   Array#initialize

All values are in seconds.

The columns are:

%self - The percentage of time spent in this method, derived from self_time/total_time
total - The time spent in this method and its children.
self  - The time spent in this method.
wait  - amount of time this method waited for other threads
child - The time spent in this method's children.
calls - The number of times this method was called.
name  - The name of the method.

Methods are sorted based on %self, therefore the methods that execute the longest are listed first.

For example, wee can see that Integer#upto took the most time, 0.059 seconds. Method Object#is_prime calls this method, so the 0.59 seconds appear as child time for Object#is_prime.

The interpretation of method names is:

  • MyObject#test - An instance method “test” of the class “MyObject”

  • <Object:MyObject>#test - The <> characters indicate a singleton method on a singleton class.

ruby-prof-0.16.2/doc/RubyProf.html0000644000175600017570000010471412766254554016020 0ustar pravipravi module RubyProf - ruby-prof

module RubyProf

The call info visitor class does a depth-first traversal across a list of method infos. At each call_info node, the visitor executes the block provided in the visit method. The block is passed two parameters, the event and the call_info instance. Event will be either :enter or :exit.

visitor = RubyProf::CallInfoVisitor.new(result.threads.first.top_call_infos)

method_names = Array.new

visitor.visit do |call_info, event|
  method_names << call_info.target.full_name if event == :enter
end

puts method_names

These methods are here for backwards compatability with previous RubyProf releases

Constants

VERSION

Public Class Methods

cpu_frequency() click to toggle source

Measurements

# File lib/ruby-prof/compatibility.rb, line 5
def self.cpu_frequency
  Measure::CpuTime.frequency
end
exclude_threads → exclude_threads click to toggle source

Returns threads ruby-prof should exclude from profiling

# File lib/ruby-prof/compatibility.rb, line 87
def self.exclude_threads
  @exclude_threads ||= Array.new
end
exclude_threads= → void click to toggle source

Specifies what threads ruby-prof should exclude from profiling

# File lib/ruby-prof/compatibility.rb, line 96
def self.exclude_threads=(value)
  @exclude_threads = value
end
figure_measure_mode() click to toggle source

Checks if the user specified the clock mode via the RUBY_PROF_MEASURE_MODE environment variable

# File lib/ruby-prof.rb, line 35
def self.figure_measure_mode
  case ENV["RUBY_PROF_MEASURE_MODE"]
  when "wall", "wall_time"
    RubyProf.measure_mode = RubyProf::WALL_TIME
  when "cpu", "cpu_time"
    RubyProf.measure_mode = RubyProf::CPU_TIME
  when "allocations"
    RubyProf.measure_mode = RubyProf::ALLOCATIONS
  when "memory"
    RubyProf.measure_mode = RubyProf::MEMORY
  when "process", "process_time"
    RubyProf.measure_mode = RubyProf::PROCESS_TIME
  when "gc_time"
    RubyProf.measure_mode = RubyProf::GC_TIME
  when "gc_runs"
    RubyProf.measure_mode = RubyProf::GC_RUNS
  else
    # the default is defined in the measure_mode reader
  end
end
measure_allocations() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 9
def self.measure_allocations
  Measure::Allocations.measure
end
measure_cpu_time() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 13
def self.measure_cpu_time
  Measure::CpuTime.measure
end
measure_gc_runs() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 17
def self.measure_gc_runs
  Measure::GcRuns.measure
end
measure_gc_time() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 21
def self.measure_gc_time
  Measure::GcTime.measure
end
measure_memory() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 25
def self.measure_memory
  Measure::Memory.measure
end
measure_mode → measure_mode click to toggle source

Returns what ruby-prof is measuring. Valid values include:

*RubyProf::WALL_TIME - Measure wall time using gettimeofday on Linx and GetLocalTime on Windows. This is default. *RubyProf::PROCESS_TIME - Measure process time. It is implemented using the clock functions in the C Runtime library. *RubyProf::CPU_TIME - Measure time using the CPU clock counter. This mode is only supported on Pentium or PowerPC platforms. *RubyProf::ALLOCATIONS - Measure object allocations. This requires a patched Ruby interpreter. *RubyProf::MEMORY - Measure memory size. This requires a patched Ruby interpreter. *RubyProf::GC_RUNS - Measure number of garbage collections. This requires a patched Ruby interpreter. *RubyProf::GC_TIME - Measure time spent doing garbage collection. This requires a patched Ruby interpreter.*/

# File lib/ruby-prof/compatibility.rb, line 50
def self.measure_mode
  @measure_mode ||= RubyProf::WALL_TIME
end
measure_mode=value → void click to toggle source

Specifies what ruby-prof should measure. Valid values include:

*RubyProf::WALL_TIME - Measure wall time using gettimeofday on Linx and GetLocalTime on Windows. This is default. *RubyProf::PROCESS_TIME - Measure process time. It is implemented using the clock functions in the C Runtime library. *RubyProf::CPU_TIME - Measure time using the CPU clock counter. This mode is only supported on Pentium or PowerPC platforms. *RubyProf::ALLOCATIONS - Measure object allocations. This requires a patched Ruby interpreter. *RubyProf::MEMORY - Measure memory size. This requires a patched Ruby interpreter. *RubyProf::GC_RUNS - Measure number of garbage collections. This requires a patched Ruby interpreter. *RubyProf::GC_TIME - Measure time spent doing garbage collection. This requires a patched Ruby interpreter.*/

# File lib/ruby-prof/compatibility.rb, line 66
def self.measure_mode=(value)
  @measure_mode = value
end
measure_mode_string() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 70
def self.measure_mode_string
  case measure_mode
  when WALL_TIME    then "wall_time"
  when CPU_TIME     then "cpu_time"
  when PROCESS_TIME then "process_time_time"
  when ALLOCATIONS  then "allocations"
  when MEMORY       then "memory"
  when GC_TIME      then "gc_time"
  when GC_RUNS      then "gc_runs"
  end
end
measure_process_time() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 29
def self.measure_process_time
  Measure::ProcessTime.measure
end
measure_wall_time() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 33
def self.measure_wall_time
  Measure::WallTime.measure
end
pause() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 113
def self.pause
  ensure_running!
  disable_gc_stats_if_needed
  @profile.pause
end
profile(options = {}, &block) click to toggle source

Profile a block

# File lib/ruby-prof/compatibility.rb, line 142
def self.profile(options = {}, &block)
  ensure_not_running!
  gc_stat_was_enabled = enable_gc_stats_if_needed
  options = { measure_mode: measure_mode, exclude_threads: exclude_threads }.merge!(options)
  result = Profile.profile(options, &block)
  disable_gc_stats_if_needed(gc_stat_was_enabled)
  result
end
resume() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 127
def self.resume
  ensure_running!
  enable_gc_stats_if_needed
  @profile.resume
end
running?() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 119
def self.running?
  if defined?(@profile) and @profile
    @profile.running?
  else
    false
  end
end
start() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 106
def self.start
  ensure_not_running!
  @profile = Profile.new(measure_mode: measure_mode, exclude_threads: exclude_threads)
  enable_gc_stats_if_needed
  @profile.start
end
start_script(script) click to toggle source

Profiling

# File lib/ruby-prof/compatibility.rb, line 101
def self.start_script(script)
  start
  load script
end
stop() click to toggle source 
# File lib/ruby-prof/compatibility.rb, line 133
def self.stop
  ensure_running!
  result = @profile.stop
  disable_gc_stats_if_needed
  @profile = nil
  result
end
ruby-prof-0.16.2/doc/css/0000755000175600017570000000000012766254554014143 5ustar pravipraviruby-prof-0.16.2/doc/css/fonts.css0000644000175600017570000001434212766254554016012 0ustar pravipravi/* * Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), * with Reserved Font Name "Source". All Rights Reserved. Source is a * trademark of Adobe Systems Incorporated in the United States and/or other * countries. * * This Font Software is licensed under the SIL Open Font License, Version * 1.1. * * This license is copied below, and is also available with a FAQ at: * http://scripts.sil.org/OFL */ @font-face { font-family: "Source Code Pro"; font-style: normal; font-weight: 400; src: local("Source Code Pro"), local("SourceCodePro-Regular"), url("fonts/SourceCodePro-Regular.ttf") format("truetype"); } @font-face { font-family: "Source Code Pro"; font-style: normal; font-weight: 700; src: local("Source Code Pro Bold"), local("SourceCodePro-Bold"), url("fonts/SourceCodePro-Bold.ttf") format("truetype"); } /* * Copyright (c) 2010, Łukasz Dziedzic (dziedzic@typoland.com), * with Reserved Font Name Lato. * * This Font Software is licensed under the SIL Open Font License, Version * 1.1. * * This license is copied below, and is also available with a FAQ at: * http://scripts.sil.org/OFL */ @font-face { font-family: "Lato"; font-style: normal; font-weight: 300; src: local("Lato Light"), local("Lato-Light"), url("fonts/Lato-Light.ttf") format("truetype"); } @font-face { font-family: "Lato"; font-style: italic; font-weight: 300; src: local("Lato Light Italic"), local("Lato-LightItalic"), url("fonts/Lato-LightItalic.ttf") format("truetype"); } @font-face { font-family: "Lato"; font-style: normal; font-weight: 700; src: local("Lato Regular"), local("Lato-Regular"), url("fonts/Lato-Regular.ttf") format("truetype"); } @font-face { font-family: "Lato"; font-style: italic; font-weight: 700; src: local("Lato Italic"), local("Lato-Italic"), url("fonts/Lato-RegularItalic.ttf") format("truetype"); } /* * ----------------------------------------------------------- * SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 * ----------------------------------------------------------- * * PREAMBLE * The goals of the Open Font License (OFL) are to stimulate worldwide * development of collaborative font projects, to support the font creation * efforts of academic and linguistic communities, and to provide a free and * open framework in which fonts may be shared and improved in partnership * with others. * * The OFL allows the licensed fonts to be used, studied, modified and * redistributed freely as long as they are not sold by themselves. The * fonts, including any derivative works, can be bundled, embedded, * redistributed and/or sold with any software provided that any reserved * names are not used by derivative works. The fonts and derivatives, * however, cannot be released under any other type of license. The * requirement for fonts to remain under this license does not apply * to any document created using the fonts or their derivatives. * * DEFINITIONS * "Font Software" refers to the set of files released by the Copyright * Holder(s) under this license and clearly marked as such. This may * include source files, build scripts and documentation. * * "Reserved Font Name" refers to any names specified as such after the * copyright statement(s). * * "Original Version" refers to the collection of Font Software components as * distributed by the Copyright Holder(s). * * "Modified Version" refers to any derivative made by adding to, deleting, * or substituting -- in part or in whole -- any of the components of the * Original Version, by changing formats or by porting the Font Software to a * new environment. * * "Author" refers to any designer, engineer, programmer, technical * writer or other person who contributed to the Font Software. * * PERMISSION & CONDITIONS * Permission is hereby granted, free of charge, to any person obtaining * a copy of the Font Software, to use, study, copy, merge, embed, modify, * redistribute, and sell modified and unmodified copies of the Font * Software, subject to the following conditions: * * 1) Neither the Font Software nor any of its individual components, * in Original or Modified Versions, may be sold by itself. * * 2) Original or Modified Versions of the Font Software may be bundled, * redistributed and/or sold with any software, provided that each copy * contains the above copyright notice and this license. These can be * included either as stand-alone text files, human-readable headers or * in the appropriate machine-readable metadata fields within text or * binary files as long as those fields can be easily viewed by the user. * * 3) No Modified Version of the Font Software may use the Reserved Font * Name(s) unless explicit written permission is granted by the corresponding * Copyright Holder. This restriction only applies to the primary font name as * presented to the users. * * 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font * Software shall not be used to promote, endorse or advertise any * Modified Version, except to acknowledge the contribution(s) of the * Copyright Holder(s) and the Author(s) or with their explicit written * permission. * * 5) The Font Software, modified or unmodified, in part or in whole, * must be distributed entirely under this license, and must not be * distributed under any other license. The requirement for fonts to * remain under this license does not apply to any document created * using the Font Software. * * TERMINATION * This license becomes null and void if any of the above conditions are * not met. * * DISCLAIMER * THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT * OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE * COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, * INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL * DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM * OTHER DEALINGS IN THE FONT SOFTWARE. */ ruby-prof-0.16.2/doc/css/rdoc.css0000644000175600017570000002216412766254554015611 0ustar pravipravi/* * "Darkfish" Rdoc CSS * $Id: rdoc.css 54 2009-01-27 01:09:48Z deveiant $ * * Author: Michael Granger * */ /* vim: ft=css et sw=2 ts=2 sts=2 */ /* Base Green is: #6C8C22 */ * { padding: 0; margin: 0; } body { background: #fafafa; font-family: Lato, sans-serif; font-weight: 300; } h1 span, h2 span, h3 span, h4 span, h5 span, h6 span { position: relative; display: none; padding-left: 1em; line-height: 0; vertical-align: baseline; font-size: 10px; } h1 span { top: -1.3em; } h2 span { top: -1.2em; } h3 span { top: -1.0em; } h4 span { top: -0.8em; } h5 span { top: -0.5em; } h6 span { top: -0.5em; } h1:hover span, h2:hover span, h3:hover span, h4:hover span, h5:hover span, h6:hover span { display: inline; } :link, :visited { color: #6C8C22; text-decoration: none; } :link:hover, :visited:hover { border-bottom: 1px dotted #6C8C22; } code, pre { font-family: "Source Code Pro", Monaco, monospace; } /* @group Generic Classes */ .initially-hidden { display: none; } #search-field { width: 98%; background: white; border: none; height: 1.5em; -webkit-border-radius: 4px; -moz-border-radius: 4px; border-radius: 4px; text-align: left; } #search-field:focus { background: #f1edba; } #search-field:-moz-placeholder, #search-field::-webkit-input-placeholder { font-weight: bold; color: #666; } .missing-docs { font-size: 120%; background: white url(images/wrench_orange.png) no-repeat 4px center; color: #ccc; line-height: 2em; border: 1px solid #d00; opacity: 1; padding-left: 20px; text-indent: 24px; letter-spacing: 3px; font-weight: bold; -webkit-border-radius: 5px; -moz-border-radius: 5px; } .target-section { border: 2px solid #dcce90; border-left-width: 8px; padding: 0 1em; background: #fff3c2; } /* @end */ /* @group Index Page, Standalone file pages */ .table-of-contents ul { margin: 1em; list-style: none; } .table-of-contents ul ul { margin-top: 0.25em; } .table-of-contents ul :link, .table-of-contents ul :visited { font-size: 16px; } .table-of-contents li { margin-bottom: 0.25em; } .table-of-contents li .toc-toggle { width: 16px; height: 16px; background: url(images/add.png) no-repeat; } .table-of-contents li .toc-toggle.open { background: url(images/delete.png) no-repeat; } /* @end */ /* @group Top-Level Structure */ nav { float: left; width: 260px; font-family: Helvetica, sans-serif; font-size: 14px; } main { display: block; margin: 0 2em 5em 260px; padding-left: 20px; min-width: 340px; font-size: 16px; } main h1, main h2, main h3, main h4, main h5, main h6 { font-family: Helvetica, sans-serif; } .table-of-contents main { margin-left: 2em; } #validator-badges { clear: both; margin: 1em 1em 2em; font-size: smaller; } /* @end */ /* @group navigation */ nav { margin-bottom: 1em; } nav .nav-section { margin-top: 2em; border-top: 2px solid #aaa; font-size: 90%; overflow: hidden; } nav h2 { margin: 0; padding: 2px 8px 2px 8px; background-color: #e8e8e8; color: #555; font-size: 125%; text-align: center; } nav h3, #table-of-contents-navigation { margin: 0; padding: 2px 8px 2px 8px; text-align: right; background-color: #e8e8e8; color: #555; } nav ul, nav dl, nav p { padding: 4px 8px 0; list-style: none; } #project-navigation .nav-section { margin: 0; border-top: 0; } #home-section h2 { text-align: center; } #table-of-contents-navigation { font-size: 1.2em; font-weight: bold; text-align: center; } #search-section { margin-top: 0; border-top: 0; } #search-field-wrapper { border-top: 1px solid #aaa; border-bottom: 1px solid #aaa; padding: 3px 8px; background-color: #e8e8e8; color: #555; } ul.link-list li { white-space: nowrap; line-height: 1.4em; } ul.link-list .type { font-size: 8px; text-transform: uppercase; color: white; background: #969696; padding: 2px 4px; -webkit-border-radius: 5px; } .calls-super { background: url(images/arrow_up.png) no-repeat right center; } /* @end */ /* @group Documentation Section */ main { color: #333; } main > h1:first-child, main > h2:first-child, main > h3:first-child, main > h4:first-child, main > h5:first-child, main > h6:first-child { margin-top: 0px; } main sup { vertical-align: super; font-size: 0.8em; } /* The heading with the class name */ main h1[class] { margin-top: 0; margin-bottom: 1em; font-size: 2em; color: #6C8C22; } main h1 { margin: 2em 0 0.5em; font-size: 1.7em; } main h2 { margin: 2em 0 0.5em; font-size: 1.5em; } main h3 { margin: 2em 0 0.5em; font-size: 1.2em; } main h4 { margin: 2em 0 0.5em; font-size: 1.1em; } main h5 { margin: 2em 0 0.5em; font-size: 1em; } main h6 { margin: 2em 0 0.5em; font-size: 1em; } main p { margin: 0 0 0.5em; line-height: 1.4em; } main pre { margin: 1.2em 0.5em; padding: 1em; font-size: 0.8em; } main hr { margin: 1.5em 1em; border: 2px solid #ddd; } main blockquote { margin: 0 2em 1.2em 1.2em; padding-left: 0.5em; border-left: 2px solid #ddd; } main ol, main ul { margin: 1em 2em; } main li > p { margin-bottom: 0.5em; } main dl { margin: 1em 0.5em; } main dt { margin-bottom: 0.5em; font-weight: bold; } main dd { margin: 0 1em 1em 0.5em; } main header h2 { margin-top: 2em; border-width: 0; border-top: 4px solid #bbb; font-size: 130%; } main header h3 { margin: 2em 0 1.5em; border-width: 0; border-top: 3px solid #bbb; font-size: 120%; } .documentation-section-title { position: relative; } .documentation-section-title .section-click-top { position: absolute; top: 6px; left: 12px; font-size: 10px; color: #9b9877; visibility: hidden; padding-left: 0.5px; } .documentation-section-title:hover .section-click-top { visibility: visible; } .constants-list > dl { margin: 1em 0 2em; border: 0; } .constants-list > dl dt { margin-bottom: 0.75em; padding-left: 0; font-family: "Source Code Pro", Monaco, monospace; font-size: 110%; } .constants-list > dl dt a { color: inherit; } .constants-list > dl dd { margin: 0 0 2em 0; padding: 0; color: #666; } .documentation-section h2 { position: relative; } .documentation-section h2 a { position: absolute; top: 8px; right: 10px; font-size: 12px; color: #9b9877; visibility: hidden; } .documentation-section h2:hover a { visibility: visible; } /* @group Method Details */ main .method-source-code { display: none; } main .method-description .method-calls-super { color: #333; font-weight: bold; } main .method-detail { margin-bottom: 2.5em; cursor: pointer; } main .method-detail:target { margin-left: -10px; border-left: 10px solid #f1edba; } main .method-heading { position: relative; font-family: "Source Code Pro", Monaco, monospace; font-size: 110%; font-weight: bold; color: #333; } main .method-heading :link, main .method-heading :visited { color: inherit; } main .method-click-advice { position: absolute; top: 2px; right: 5px; font-size: 12px; color: #9b9877; visibility: hidden; padding-right: 20px; line-height: 20px; background: url(images/zoom.png) no-repeat right top; } main .method-heading:hover .method-click-advice { visibility: visible; } main .method-alias .method-heading { color: #666; } main .method-description, main .aliases { margin-top: 0.75em; color: #333; } main .aliases { padding-top: 4px; font-style: italic; cursor: default; } main .method-description ul { margin-left: 1.5em; } main #attribute-method-details .method-detail:hover { background-color: transparent; cursor: default; } main .attribute-access-type { text-transform: uppercase; padding: 0 1em; } /* @end */ /* @end */ /* @group Source Code */ pre { margin: 0.5em 0; border: 1px dashed #999; padding: 0.5em; background: #262626; color: white; overflow: auto; } .ruby-constant { color: #7fffd4; background: transparent; } .ruby-keyword { color: #00ffff; background: transparent; } .ruby-ivar { color: #eedd82; background: transparent; } .ruby-operator { color: #00ffee; background: transparent; } .ruby-identifier { color: #ffdead; background: transparent; } .ruby-node { color: #ffa07a; background: transparent; } .ruby-comment { color: #dc0000; background: transparent; } .ruby-regexp { color: #ffa07a; background: transparent; } .ruby-value { color: #7fffd4; background: transparent; } /* @end */ /* @group search results */ #search-results { font-family: Lato, sans-serif; font-weight: 300; } #search-results .search-match { font-family: Helvetica, sans-serif; font-weight: normal; } #search-results .search-selected { background: #e8e8e8; border-bottom: 1px solid transparent; } #search-results li { list-style: none; border-bottom: 1px solid #aaa; margin-bottom: 0.5em; } #search-results li:last-child { border-bottom: none; margin-bottom: 0; } #search-results li p { padding: 0; margin: 0.5em; } #search-results .search-namespace { font-weight: bold; } #search-results li em { background: yellow; font-style: normal; } #search-results pre { margin: 0.5em; font-family: "Source Code Pro", Monaco, monospace; } /* @end */ ruby-prof-0.16.2/README.rdoc0000644000175600017570000003720012766254554014416 0ustar pravipravi= ruby-prof {Build Status}[https://travis-ci.org/ruby-prof/ruby-prof] == Overview ruby-prof is a fast code profiler for MRI Ruby. Its features include: * Speed - it is a C extension and therefore many times faster than the standard Ruby profiler. * Modes - Ruby prof can measure a number of different parameters, including call times, memory usage and object allocations. * Reports - can generate text and cross-referenced html reports - Flat Profiles - similar to the reports generated by the standard Ruby profiler - Graph profiles - similar to GProf, these show how long a method runs, which methods call it and which methods it calls. - Call tree profiles - outputs results in the calltree format suitable for the KCacheGrind profiling tool. - Many more -- see reports section of this \README. * Threads - supports profiling multiple threads simultaneously == Requirements ruby-prof requires Ruby 1.9.3 or higher. Please note some ruby releases have known bugs which cause ruby-prof problems, like incorrect measurements. We suggest to use the latest minor patch level release if possible. In particular, on the 2.1 branch of ruby you should use at least 2.1.7. If you are running Linux or Unix you'll need a C compiler so the extension can be compiled when it is installed. If you are running Windows, then you may need to install the Windows specific RubyGem which includes an already built extension (see Install section). == Install The easiest way to install ruby-prof is by using Ruby Gems. To install: gem install ruby-prof If you're on windows then please install the devkit first so that it can compile. == Usage There are three major options for running ruby-prof: via the command line, via its convenience API or via its core API. === ruby-prof Executable The first is to use ruby-prof to run the Ruby program you want to profile. For more information refer to the documentation of the ruby-prof command. === ruby-prof Convenience API The second way is to use the ruby-prof convenience API to profile particular segments of code. require 'ruby-prof' # profile the code RubyProf.start # ... code to profile ... result = RubyProf.stop # print a flat profile to text printer = RubyProf::FlatPrinter.new(result) printer.print(STDOUT) Alternatively, you can use a block to tell ruby-prof what to profile: require 'ruby-prof' # profile the code result = RubyProf.profile do # ... code to profile ... end # print a graph profile to text printer = RubyProf::GraphPrinter.new(result) printer.print(STDOUT, {}) ruby-prof also supports pausing and resuming profiling runs. require 'ruby-prof' # profile the code RubyProf.start # ... code to profile ... RubyProf.pause # ... other code ... RubyProf.resume # ... code to profile ... result = RubyProf.stop Note that resume will only work if start has been called previously. In addition, resume can also take a block: require 'ruby-prof' RubyProf.resume do # ... code to profile... end result = RubyProf.stop With this usage, resume will automatically call pause at the end of the block. === Profiling Selected Threads (Core API) The convenience API does not support running multiple profiles in separate threads concurrently, but the RubyProf::Profile API does. In fact, the convenience layer uses the Profile API internally. It all revolves around Profile objects: RubyProf::Profile.new:: Create a profile object given an options hash (see below) The following options are available when creating Profile instances: measure_mode:: One of the defined measure modes exclude_threads:: Array of threads which should not be profiled. include_threads:: Array of threads which should be profiled. All other threads will be ignored. merge_fibers:: Whether profiling data for a given thread's fibers should all be subsumed under a single entry. Basically only useful to produce callgrind profiles. RubyProf::Profile#start:: Start profiling RubyProf::Profile#pause:: Pause profiling RubyProf::Profile#resume:: Resume profiling RubyProf::Profile#stop:: Stop profiling and return self RubyProf::Profile#profile:: Perform a profile run and return result. Accepts the same arguments as RubyProf::Profile.new. == Method Elimination ruby-prof supports eliminating specific methods and threads from profiling results. This is useful for reducing connectivity in the call graph, making it easier to identify the source of performance problems when using a graph printer. For example, consider Integer#times: it's hardly ever useful to know how much time is spent in the method itself. We're much more interested in how much the passed in block contributes to the time spent in the method which contains the Integer#times call. Methods are eliminated from the collected data by calling eliminate_methods! on the profiling result, before submitting it to a printer. result = RubyProf.stop result.eliminate_methods!([/Integer#times/]) The argument given to eliminate_methods! is either an array of regular expressions, or the name of a file containing a list of regular expressions (line separated text). After eliminating methods the resulting profile will appear exactly as if those methods had been inlined at their call sites. == Profiling Rails To profile a Rails application it is vital to run it using production like settings (cache classes, cache view lookups, etc.). Otherwise, Rail's dependency loading code will overwhelm any time spent in the application itself (our tests show that Rails dependency loading causes a roughly 6x slowdown). The best way to do this is create a new Rails environment, profile.rb. So to profile Rails: 1. Create a new profile.rb environment. Make sure to turn on cache_classes and cache_template_loading. Otherwise your profiling results will be overwhelmed by the time Rails spends loading required files. You should likely turn off caching. 2. Add the ruby-prof to your gemfile: group :profile do gem 'ruby-prof' end 3. Add the ruby prof rack adapter to your middleware stack. One way to do this is by adding the following code to config.ru: if Rails.env.profile? use Rack::RubyProf, :path => '/temp/profile' end The path is where you want profiling results to be stored. By default the rack adapter will generate a html call graph report and flat text report. 4. Now make a request to your running server. New profiling information will be generated for each request. Note that each request will overwrite the profiling reports created by the previous request! == Reports ruby-prof can generate a number of different reports: * Flat Reports * Graph Reports * HTML Graph Reports * Call graphs * Call stack reports * More! Flat profiles show the overall time spent in each method. They are a good way of quickly identifying which methods take the most time. An example of a flat profile and an explanation can be found in {examples/flat.txt}[http://github.com/ruby-prof/ruby-prof/tree/master/examples/flat.txt]. There are several varieties of these - run ruby-prof --help Graph profiles also show the overall time spent in each method. In addition, they also show which methods call the current method and which methods its calls. Thus they are good for understanding how methods gets called and provide insight into the flow of your program. An example text graph profile is located at {examples/graph.txt}[http://github.com/ruby-prof/ruby-prof/tree/master/examples/graph.txt]. HTML Graph profiles are the same as graph profiles, except output is generated in hyper-linked HTML. Since graph profiles can be quite large, the embedded links make it much easier to navigate the results. An example html graph profile is located at {examples/graph.html}[http://github.com/ruby-prof/ruby-prof/tree/master/examples/graph.html]. Call graphs output results in the calltree profile format which is used by KCachegrind. Call graph support was generously donated by Carl Shimer. More information about the format can be found at the {KCachegrind}[http://kcachegrind.sourceforge.net/cgi-bin/show.cgi/KcacheGrindCalltreeFormat] site. Call stack reports produce a HTML visualization of the time spent in each execution path of the profiled code. An example can be found at {examples/stack.html}[http://github.com/ruby-prof/ruby-prof/tree/master/examples/stack.html]. Another good example: http://twitpic.com/28z94a Finally, there's a so called MultiPrinter which can generate several reports in one profiling run. See {examples/multi.stack.html}[http://github.com/ruby-prof/ruby-prof/tree/master/examples/multi.stack.html]. There is also a graphviz .dot visualiser. == Printers Reports are created by printers. Supported printers include: RubyProf::FlatPrinter:: Creates a flat report in text format RubyProf::FlatPrinterWithLineNumbers:: Same as above but more verbose RubyProf::GraphPrinter:: Creates a call graph report in text format RubyProf::GraphHtmlPrinter:: Creates a call graph report in HTML (separate files per thread) RubyProf::DotPrinter:: Creates a call graph report in GraphViz's DOT format which can be converted to an image RubyProf::CallTreePrinter:: Creates a call tree report compatible with KCachegrind RubyProf::CallStackPrinter:: Creates a HTML visualization of the Ruby stack RubyProf::MultiPrinter:: Uses the other printers to create several reports in one profiling run To use a printer: result = RubyProf.stop printer = RubyProf::GraphPrinter.new(result) printer.print(STDOUT, :min_percent => 2) The first parameter is any writable IO object such as STDOUT or a file. The second parameter, specifies the minimum percentage a method must take to be printed. Percentages should be specified as integers in the range 0 to 100. For more information please see the documentation for the different printers. The other option is :print_file => true (default false), which adds the filename to the output (GraphPrinter only). MultiPrinter differs from the other printers in that it requires a directory path and a basename for the files it produces. printer = RubyProf::MultiPrinter.new(result) printer.print(:path => ".", :profile => "profile") == Measurements Depending on the mode and platform, ruby-prof can measure various aspects of a Ruby program. Supported measurements include: RubyProf::WALL_TIME:: Wall time measures the real-world time elapsed between any two moments. If there are other processes concurrently running on the system that use significant CPU or disk time during a profiling run then the reported results will be larger than expected. RubyProf::PROCESS_TIME:: Process time measures the time used by a process between any two moments. It is unaffected by other processes concurrently running on the system. Note that Windows does not support measuring process times. RubyProf::CPU_TIME:: CPU time uses the CPU clock counter to measure time. The returned values are dependent on the correctly setting the CPU's frequency. This mode is only supported on Pentium or PowerPC platforms (linux only). RubyProf::ALLOCATIONS:: Object allocation reports show how many objects each method in a program allocates. This support was added by Sylvain Joyeux and requires a patched Ruby interpreter. See below. RubyProf::MEMORY:: Memory usage reports show how much memory each method in a program uses. This support was added by Alexander Dymo and requires a patched Ruby interpreter. See below. RubyProf::GC_TIME:: Garbage collection time reports how much time is spent in Ruby's garbage collector during a profiling session. This support was added by Jeremy Kemper and requires a patched Ruby interpreter. See below. RubyProf::GC_RUNS:: Garbage collection runs report how many times Ruby's garbage collector is invoked during a profiling session. This support was added by Jeremy Kemper and requires a patched Ruby interpreter. See below. == Patching ruby All of the patches to Ruby are included in the railsexpress patchsets for rvm, see https://github.com/skaes/rvm-patchsets. You can also use these patches manually with other ruby managers (ruby-install, ruby-build, etc.). Note if you rebuild your ruby with patches you must uninstall and reinstall the ruby-prof gem to take advantage of the new capabilities. == Measure modes To set the measurement: RubyProf.measure_mode = RubyProf::WALL_TIME RubyProf.measure_mode = RubyProf::PROCESS_TIME RubyProf.measure_mode = RubyProf::CPU_TIME RubyProf.measure_mode = RubyProf::ALLOCATIONS RubyProf.measure_mode = RubyProf::MEMORY RubyProf.measure_mode = RubyProf::GC_TIME RubyProf.measure_mode = RubyProf::GC_RUNS The default value is RubyProf::WALL_TIME. You may also specify the measure mode by using the RUBY_PROF_MEASURE_MODE environment variable: export RUBY_PROF_MEASURE_MODE=wall export RUBY_PROF_MEASURE_MODE=process export RUBY_PROF_MEASURE_MODE=cpu export RUBY_PROF_MEASURE_MODE=allocations export RUBY_PROF_MEASURE_MODE=memory export RUBY_PROF_MEASURE_MODE=gc_time export RUBY_PROF_MEASURE_MODE=gc_runs On Linux, process time is measured using the clock method provided by the C runtime library. Note that the clock method does not report time spent in the kernel or child processes and therefore does not measure time spent in methods such as Kernel.sleep method. If you need to measure these values, then use wall time. Wall time is measured using the gettimeofday kernel method. If you set the clock mode to PROCESS_TIME, then timings are read using the clock method provided by the C runtime library. Note though, these values are wall times on Windows and not process times like on Linux. Wall time is measured using the GetLocalTime API. If you use wall time, the results will be affected by other processes running on your computer, network delays, disk access, etc. As result, for the best results, try to make sure your computer is only performing your profiling run and is otherwise quiescent. == Multi-threaded Applications Unfortunately, Ruby does not provide an internal API for detecting thread context switches. As a result, the timings ruby-prof reports for each thread may be slightly inaccurate. In particular, this will happen for newly spawned threads that go to sleep immediately (their first call). For instance, if you use Ruby's timeout library to wait for 2 seconds, the 2 seconds will be assigned to the foreground thread and not the newly created background thread. These errors can largely be avoided if the background thread performs any operation before going to sleep. == Performance Significant effort has been put into reducing ruby-prof's overhead as much as possible. Our tests show that the overhead associated with profiling code varies considerably with the code being profiled. Most programs will run approximately twice as slow while highly recursive programs (like the fibonacci series test) will run three times slower. == License See LICENSE for license information. == API Documentation The ruby-prof API documentation for the latest released gem version can be found here: http://www.rubydoc.info/gems/ruby-prof/ The ruby-prof API documentation for the master branch is available here: http://www.rubydoc.info/github/ruby-prof/ruby-prof/ == Development Code is located at https://github.com/ruby-prof/ruby-prof Google group/mailing list: http://groups.google.com/group/ruby-optimization or open a github issue. ruby-prof-0.16.2/CHANGES0000644000175600017570000004005112766254554013601 0ustar pravipravi0.16.2 (2016-08-25) ===================== * fixed incorrect setting of RUBY_VERSION macro 0.16.1 (2016-08-24) ===================== * fixed compile problem with ruby 2.1.10 0.16.0 (2016-08-24) ===================== * ruby-prof can now be installed if ruby has been compiled with --disable-gems or RUBYOPT includes --disable-gems (thx to Arthur Nogueira Neves) * Profile.new now accepts and prefers an options hash: - measure_mode: one of the RubyProf measure mode constants - exclude_threads: an array of threads to ignore when collecting profile data - include_threads: an array of threads to include when collecting profile data - merge_fibers: whether or not to merge the profile data for all fibers under their creating thread * overhauled printer for cachegrind profiles: - profile data for each thread dumped to a separate file, as kcachegrind does not fully implement the cachegrind specification - this required a change in interface: it's now necessary to specify a directory where to dump the cachegrind files - naming convention for cachegrind files changed so that kcachegrind shows them all in the open dialog * improved Rack middleware: - it's now possible to use the MultiPrinter - new option ignore_existing_threads: will ignore all prexisiting threads when profiling a request, except the thread perfoming the request. - new option request_thread_only: will ignore all preexisting threads, but also all threads spwaned during the execution of the rack request. - new option merge_fibers: whether or not to merge the profile data for all fibers under their creating thread * fixed setting threshold bug when displaying stack profiles (thx to Michal Konarski) * code related to printing profiles is now autoloaded for efficiency (thx to Dave Gynn) 0.15.9 (2015-12-08) ====================== * rack profiler now supports lambdas for generating profile paths (thx to Jean Rougé) * fixed a bug when printing graph profiles 0.15.8 (2015-04-24) ====================== * added missing assets to gem build * fixed randomly failing test 0.15.7 (2015-04-23) ====================== * html profiles are now single page (thx to Thomas Leishman) 0.15.6 (2015-02-22) ====================== * improved upon computing children time in graph printers 0.15.5 (2015-02-22) ====================== * changed output format of flat_printer_with_line_number * support using multi printer from command line (Dov Murik) 0.15.4 (2015-02-14) ====================== * using env variable to specify mesaurement mode work again * measuring memory/object allocations works for 2.1 adn 2.2 again 0.15.3 (2015-01-16) ====================== * support ruby 2.2.0 0.15.2 (2014-05-20) ====================== * rack middleware creates print dir for profile result (Neng) 0.15.1 (2014-05-20) ====================== * added license to gemspec 0.15.0 (2014-05-02) ====================== * improved cpu time measurement (Charlie Somerville) 0.14.2 (2014-01-05) ====================== * hopefully fixed compile problem under Windows 0.14.0 (2014-01-02) ====================== * support ruby 2.1.0 * dropped support for 1.8.x, 1.9.1 and 1.9.2 0.13.1 (2013-12-14) ====================== * speed up for displaying large call stacks (Benjamin Quoming) 0.13 (2013-03-10) ====================== * support fibers on 1.9.x+ * improved display for very wide call stacks (Sammy Larbi) 0.12.2 (2013-02-13) ====================== * Fixed segfault when using falcon or railsexpress patches for 1.9.3 0.12.1 (2013-01-07) ====================== * Add back in pause/resume support since Rails uses it 0.12.0 (2013-01-06) ====================== * Ruby 2.0.0 support (Charlie Savage) * Fix issue where profiling results could exceed 100% if profile code had multiple top level methods (Charlie Savage) * Replaced RubyProf::Thread#top_method with RubyProf::Thread#top_methods (Charlie Savage) * Added RubyProf::Thread#total_time (Charlie Savage) * Remove the -r and -e command line options. If you need specific libraries or code profiled then add them to your code (Charlie Savage). * Rewrite ruby-prof script to be more self-contained (Gary Weaver) * Fix list formatting in readme (Thilo Rusche) * Remove pause/resume support since its buggy and complicates the code 0.11.3 (2012-12-27) ====================== * Prefix c functions with prof_ to avoid name conflicts (Kenta Murata) * Update ruby-prof script to avoid seg faults (Gary Weaver) * Rakefile updates (Roger Pack) * Fix regexp file reading (Gilbert Roulot) * Update documentation (Timo Schilling) * Fix up ruby warnings (Mike Gehard) * Remove duplicate code (Chas Lemley) 0.11.2 (2012-05-06) ====================== * Fix compile issue with BOOL. Should be _Bool for C99. 0.11.1 (2012-05-06) ====================== * Added option --exclude-common-callbacks, plus exclude #map and #inject in common cycles (Vasily Fedoseyev) * Add option --exclude-common-cycles to exclude common iterators (Vasily Fedoseyev) * Allow method elimination from command line via '-x' and '-X' keys (Vasily Fedoseyev) 0.11.0 (2012-05-05) ====================== * Fix pause/resume so it actually works and add tests (David Barri) * Resume now returns the result of the block when given (David Barri) * Make recursive method explanation more clear (Charlie Savage) * Fix ruby warnings (Charlie Savage) * Toggle GC.enable_stats when profiling for memory to get the data (Vasily Fedoseyev) * Fix patched ruby support and remove some warnings (Vasily Fedoseyev) * Fix tests on 1.8.7 (rogerdpack) 0.11.0.rc3 (2012-03-26) ====================== * Include missing files in gemspec (Charlie Savage). 0.11.0.rc2 (2012-03-25) ====================== * Lots of improvements to Rack handler - this can be used to profile requests in Rails and other rack-based ruby web frameworks (Charlie Savage). * Reimplemented handling of recursive calls using CallInfoVisitor (Charlie Savage). * Fix bug where child times were not correctly reported in complicated call graphs with recursion like in frameworks like Rails (Charlie Savage). * Add in recursive call information to Flat, Graph and Graph HTML reports (Charlie Savage). * Add in new thread class add added RubyProf::Thread#top_method to make report generation easier (Charlie Savage). * Add in CallInfoVisitor class to make it easy to iterate over a call graph (Charlie Savage). * Add in CallInfoPrinter to make it visualize RubyProf's internal call graphs (Charlie Savage). * Significant updates to documentation (Charlie Savage). * More c code cleanup (Charlie Savage). 0.11.0.rc1 (2012-03-24) ====================== * Big internal refactoring of C code to make RubyProf easier to understand and extend (Charlie Savage). * Profile results are now returned as instances of a new class RubyProf::Profile. The old api is supported via a compatability layer that at some point will be deprecated. (Charlie Savage). * On Windows, use QueryPerformanceCounter and QueryPerformanceFrequency to measure CPU time instead of rdtsc. This change is based on Microsoft's recommendation (Charlie Savage). * On Windows use GetProcessTimes to return real PROCESS_TIME times instead of wall times (Charlie Savage). * Split out tests for each time of measurement (cpu_time, process_time, etc.) (Charlie Savage). * Dropped support for Ruby 1.8.4 and 1.8.6 and 1.9.0 (Charlie Savage). * Added support for sorting results by total, self, wait and child times (Jan Suchal) * Added tests for sorting behaviour & removed options from constructor to print method (Jan Suchal) * Fix line number tests due to changes at top of file (Charlie Savage). * Add encoding statement to top of all files for Ruby 1.9.x compatability (Charlie Savage). * Add def file for VC to avoid the whole declspec annoyance (Charlie Savage). * Update test suite to ensure current working directory is correct (Charlie Savage). * Modernize gem file and remove various custom/home grown solutions that aren't needed anymore (Charlie Savage). * Remove custom mingw build scripts, use rake compiler instead (Charlie Savage). * Fixes for compiling with VC 2010 (Charlie Savage). 0.10.8 (2011-07-06) ====================== * 1.9.3 super class (Roger Pack) 0.10.7 (2011-05-09) ====================== * Fix a bug with REE's GC stats. Issue #53 [thanks graaff] 0.10.6 (2011-04-29) ====================== * Slightly more normalized url for linux/windows links to files. 0.10.5 (2011-04-20) ======================= * 1.8.6 compat for -v command (bug fix) 0.10.4 (2011-04-20) ======================= * Faster load time for ruby-prof itself. 0.10.3 ======================= * Can cleanly load before rubygems now. 0.10.2 ======================= * Fix for 1.9.2, os x for latest commits (thanks skaes!) 0.10.1 ======================= * Fix bug in linux wall time, also load with only relative paths so that you can use it to benchmark rubygems startup overhead, itself. 0.10.0 ======================= * Some rdoc changes, for linux wall time attempt to use higher granularity (thanks to all the contributors for this round!) 0.9.2 ======================= * Make graphviz work on 1.8.6 * Roll back some 1.9.2 optimizations until I can figure out what caused them. 0.9.1 ======================= * Add a graphviz output 0.9.0 ======================= * measurements for recursive methods are now correct * gave up on splitting up recursive methods according to call depth * made it possible to eliminate methods from profiling results * new printer for call stack visualization * new printer to print several profiles in one run * HTML profiles contain Textmate links so you can jump to the source code easily * producing an event log is now a runtime option 0.7.10 (2009-01-22) ======================= * fix SEGFAULT in 1.9 * add new printer flat_printer_with_line_numbers 0.7.7 (2009-01-13) ====================== * "fix" multi threading support for 1.9 http://redmine.ruby-lang.org/issues/show/2012 * speedups 0.7.6 (2009-12-31) ====================== * fix some tests for 1.9 (no real code changes) 0.7.5 (2009-12) ======================== * fix a GC collection bug (nobu's patch). * correctly report recursive call depths (Kevin Scaldeferri). * sort methods on output (Kevin Scaldeferri). 0.7.3 (2008-12-09) ======================== * Fixed compile error with new x86_64 code using GCC. 0.7.2 (2008-12-08) ======================== * Fixed major bug in printing child methods in graph reports. * Fixes for supporting x86_64 machines (Diego Pettenò) 0.7.1 (2008-11-28) ======================== * Added new AggregateCallInfo class for printers to make results easier to read. Take this call sequence for example: A B C | | | Z A A | | Z Z By default, ruby-prof will show that Z was called by 3 separate instances of A. In an IDE that is helpful but in a text report it is not since it makes the report much harder to read. As a result, printers now aggregate together callers (and children), matching ruby-prof's output from versions prior to 0.7.0. * Fixes for supporting x86_64 machines (Matt Sanford) 0.7.0 (2008-11-04) ======================== Features -------- * Added two new methods - RubyProf.resume and RubyProf.pause. RubyProf.resume takes an optional block, which ensures that RubyProf.pause is called. For example: 10.times do |i| RubyProf.resume do # Some long process end end result = RubyProf.stop * Added support for profiling tests that use Ruby's built-in unit test framework (ie, test derived from Test::Unit::TestCase). To enable profiling simply add the following line of code to your test class: include RubyProf::Test By default, profiling results are written to the current processes working directory. To change this, or other profiling options, simply modify the PROFILE_OPTIONS hash table as needed. * Used the new support for profiling test cases to revamp the way that Rails profiling works. For more information please refer to RubyProf's documentation. * Keep track of call stack for each method to enable more powerful profile visualizations in Integrated Development Environments (Hin Boean, work supported by CodeGear). * Expose measurements to Ruby (Jeremy Kemper). * Add support for additional memory measurements modes in Ruby 1.9 (Jeremy Kemper). * Add support for Lloyd Hilaiel's Ruby patch for measuring total heap size. See http://lloydforge.org/projects/ruby. (Jeremy Kemper). Fixes ------- * RubyProf.profile no longer crashes if an exception is thrown during a profiling run. * Measure memory in fractional kilobytes rather than rounding down (Jeremy Kemper) 0.6.0 (2008-02-03) ======================== ruby-prof 0.6.0 adds support for Ruby 1.9 and memory profiling. Features -------- * Added support for ruby 1.9 (Shugo Maeda) * Added support for outputting printer results to a String, Array or IO object (Michael Granger) * Add new memory profiling mode. Note this mode depends on a patched Ruby interpreter (Alexander Dymo) Fixes ------- * Improvements to GraphHtmlPrinter including updated documentation, fixes for min_time support, ability to specify templates using strings or filenames, and table layout fixes (Makoto Kuwata) * Fixes to scaling factor for calltrees so that precision is not lost due to the conversion to doubles (Sylvain Joyeux) * Changed constant ALLOCATED_OBJECTS to ALLOCATIONS in the C code to match the Ruby code (Sylvain Joyeux) * Added support for calltree printer to ruby-prof binary script (Sylvain Joyeux) * Fix support for the allocator measure mode to extconf.rb (Sylvain Joyeux) * Honor measure mode when specified on the command line (Sylvain Joyeux) * Sorting of methods by total time was incorrect (Dan Fitch, Charlie Savage) * Fix ruby-prof to work with the latest version of GEMS (Alexander Dymo) * Always define MEASURE_CPU_TIME and MEASURE_ALLOCATIONS in Ruby code, but set their values to nil if the functionality is not available. 0.5.2 (2007-07-19) ======================== ruby-prof 0.5.2 is a bug fix release. Fixes ------- * Include missing rails plugin 0.5.1 (2007-07-18) ======================== ruby-prof 0.5.1 is a bug fix and performance release. Performance -------- * Significantly reduced the number of thread lookups by caching the last executed thread. Fixes ------- * Properly escape method names in HTML reports * Fix use of -m and --min-percent command line switches * Default source file information to ruby_runtime#0 for c calls * Moved rails_plugin to top level so it is more obvious * Updated rails_plugin to write reports to the current Rails log directory * Added additional tests 0.5.0 (2007-07-09) ======================== Features -------- * Added support for timing multi-threaded applications * Added support for 64 bit systems (patch from Diego 'Flameeyes' Petten) * Added suport for outputting data in the format used by KCacheGrind (patch from Carl Shimer) * Add filename and line numbers to call tree information (patch from Carl Shimer) * Added Visual Studio 2005 project file. * Added replace-progname switch, als rcov. * Added better support for recursive methods * Added better support for profiling Rails applications Fixes ------- * Fixes bug when the type of an attached object (singleton) is inherited from T_OBJECT as opposed to being a T_OBJECT (identified by Francis Cianfrocca) * ruby-prof now works in IRB. * Fix sort order in reports. * Fixed rdoc compile error. * Fix tabs in erb template for graph html report on windows. 0.4.1 (2006-06-26) ======================== Features -------- * Added a RubyProf.running? method to indicate whether a profile is in progress. * Added tgz and zip archives to release Fixes ------- * Duplicate method names are now allowed * The documentation has been updated to show the correct API usage is RubyProf.stop not RubyProf.end 0.4.0 (2006-06-16) ======================== Features -------- * added support for call graphs * added support for printers. Currently there is a FlatPrinter, GraphPrinter and GraphHtmlPrinter. * added support for recursive methods * added Windows support * now packaged as a RubyGem Fixes ------- * Fixes bug where RubyProf would crash depending on the way it was invoked - for example, it did not run when used with Arachno Ruby's customized version of Ruby. ruby-prof-0.16.2/LICENSE0000644000175600017570000000260212766254554013613 0ustar pravipraviCopyright (C) 2005 - 2014 Shugo Maeda and Charlie Savage Copyright (C) 2010 - 2014 Stefan Kaes All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.ruby-prof-0.16.2/bin/0000755000175600017570000000000012766254554013356 5ustar pravipraviruby-prof-0.16.2/bin/ruby-prof-check-trace0000755000175600017570000000220412766254554017376 0ustar pravipravi#!/usr/bin/env ruby stacks = Hash.new{|h,k| h[k] = Hash.new{|h,k| h[k] = []}} i = 0 File.open(ARGV[0]).each_line do |l| i += 1 unless l =~ /^(\d+):(\d+): *\d+ms *([^ ]+) *(.*): *(\d+) *(.+)$/ next if l =~/^ *$/ puts "line doesn't match: #{l}" next end details = $1.to_i, $2.to_i, $3, $4, $5.to_i, $6 thread, fiber, event, file, line, method = *details # puts method stack = stacks[thread][fiber] case event when 'call', 'c-call' stack << method when 'return', 'c-return' last_method = stack.pop if last_method != method puts "LINE #{i}: return event without call: #{method}" puts "STACK: #{stack.inspect}" if stack.find(method) puts "fixing stack" while (popped = stack.pop) && (popped != method) puts "popped #{popped}" end else raise "stack unfixable" end # stack << last_method end when 'line' last_method = stack[-1] if last_method != method unless stack.find(method) raise "LINE #{i}: line event without call: #{method}" end end else puts "unkown event" end end puts stacks.inspect ruby-prof-0.16.2/bin/ruby-prof0000755000175600017570000002542612766254554015242 0ustar pravipravi#! /usr/bin/env ruby # == Synopsis # # Profiles a Ruby program. # # == Usage # # ruby_prof [options] [--] [script-options]" # # Various options: # run "$ ruby-prof --help" to see them # # See also the readme "reports" section for the various outputs # First require ruby-prof require 'rubygems' require 'ruby-prof' # Now setup option parser require 'ostruct' require 'optparse' module RubyProf class Cmd attr_accessor :options def initialize setup_options parse_args load_pre_libs load_pre_execs end def setup_options @options = OpenStruct.new options.printer = RubyProf::FlatPrinter options.min_percent = 0 options.file = nil options.replace_prog_name = false options.specialized_instruction = false options.pre_libs = Array.new options.pre_execs = Array.new end def option_parser OptionParser.new do |opts| opts.banner = "ruby_prof #{RubyProf::VERSION}\n" + "Usage: ruby-prof [options] [--] [profiled-script-command-line-options]" opts.separator "" opts.separator "Options:" opts.on('-p printer', '--printer=printer', [:flat, :flat_with_line_numbers, :graph, :graph_html, :call_tree, :call_stack, :dot, :multi], 'Select a printer:', ' flat - Prints a flat profile as text (default).', ' flat_with_line_numbers - same as flat, with line numbers.', ' graph - Prints a graph profile as text.', ' graph_html - Prints a graph profile as html.', ' call_tree - format for KCacheGrind', ' call_stack - prints a HTML visualization of the call tree', ' dot - Prints a graph profile as a dot file', ' multi - Creates several reports in output directory' ) do |printer| case printer when :flat options.printer = RubyProf::FlatPrinter when :flat_with_line_numbers options.printer = RubyProf::FlatPrinterWithLineNumbers when :graph options.printer = RubyProf::GraphPrinter when :graph_html options.printer = RubyProf::GraphHtmlPrinter when :call_tree options.printer = RubyProf::CallTreePrinter when :call_stack options.printer = RubyProf::CallStackPrinter when :dot options.printer = RubyProf::DotPrinter when :multi options.printer = RubyProf::MultiPrinter end end opts.on('-m min_percent', '--min_percent=min_percent', Float, 'The minimum percent a method must take before ', ' being included in output reports.', ' this option is not supported for call tree.') do |min_percent| options.min_percent = min_percent end opts.on('-f path', '--file=path', 'Output results to a file instead of standard out.') do |file| options.file = file options.old_wd = Dir.pwd end opts.on('--mode=measure_mode', [:process, :wall, :cpu, :allocations, :memory, :gc_runs, :gc_time], 'Select what ruby-prof should measure:', ' wall - Wall time (default).', ' process - Process time.', ' cpu - CPU time (Pentium and PowerPCs only).', ' allocations - Object allocations (requires patched Ruby interpreter).', ' memory - Allocated memory in KB (requires patched Ruby interpreter).', ' gc_runs - Number of garbage collections (requires patched Ruby interpreter).', ' gc_time - Time spent in garbage collection (requires patched Ruby interpreter).') do |measure_mode| case measure_mode when :wall options.measure_mode = RubyProf::WALL_TIME when :process options.measure_mode = RubyProf::PROCESS_TIME when :cpu options.measure_mode = RubyProf::CPU_TIME when :allocations options.measure_mode = RubyProf::ALLOCATIONS when :memory options.measure_mode = RubyProf::MEMORY when :gc_runs options.measure_mode = RubyProf::GC_RUNS when :gc_time options.measure_mode = RubyProf::GC_TIME end end opts.on('-s sort_mode', '--sort=sort_mode', [:total, :self, :wait, :child], 'Select how ruby-prof results should be sorted:', ' total - Total time', ' self - Self time', ' wait - Wait time', ' child - Child time') do |sort_mode| options.sort_method = case sort_mode when :total :total_time when :self :self_time when :wait :wait_time when :child :children_time end end opts.on("--replace-progname", "Replace $0 when loading the .rb files.") do options.replace_prog_name = true end if defined?(RubyVM) opts.on("--specialized-instruction", "Turn on specified instruction.") do options.specialized_instruction = true end end opts.on_tail("-h", "--help", "Show help message") do puts opts exit end opts.on_tail("--version", "Show version #{RubyProf::VERSION}") do puts "ruby_prof " + RubyProf::VERSION exit end opts.on("-v","Show version, set $VERBOSE to true, profile script if option given") do puts "ruby version: " + [RUBY_PATCHLEVEL, RUBY_PLATFORM, RUBY_VERSION].join(' ') $VERBOSE = true end opts.on("-d", "Set $DEBUG to true") do $DEBUG = true end opts.on('-R lib', '--require-noprof lib', 'require a specific library (not profiled)') do |lib| options.pre_libs << lib end opts.on('-E code', '--eval-noprof code', 'execute the ruby statements (not profiled)') do |code| options.pre_execs << code end opts.on('-x regexp', '--exclude regexp', 'exclude methods by regexp (see method elimination)') do|meth| options.eliminate_methods ||= [] options.eliminate_methods << Regexp.new(meth) end opts.on('-X file', '--exclude-file file', 'exclude methods by regexp listed in file (see method elimination)') do|file| options.eliminate_methods_files ||= [] options.eliminate_methods_files << file end opts.on('--exclude-common-cycles', 'make common iterators like Integer#times appear inlined') do |meth| options.eliminate_methods ||= [] options.eliminate_methods += %w{ Integer#times Integer#upto Integer#downto Enumerator#each Enumerator#each_with_index Enumerator#each_with_object Array#each Array#each_index Array#reverse_each Array#map Hash#each Hash#each_pair Hash#each_key Hash#each_value Range#each Enumerable#each_cons Enumerable#each_entry Enumerable#each_slice Enumerable#each_with_index Enumerable#each_with_object Enumerable#reverse_each Enumerable#inject Enumerable#collect Enumerable#reduce } #TODO: may be the whole Enumerable module should be excluded via 'Enumerable#.*', we need feedback on use cases. end opts.on('--exclude-common-callbacks', 'make common callbacks invocations like Integer#times appear inlined so you can see call origins in graph') do|meth| options.eliminate_methods ||= [] options.eliminate_methods += %w{ Method#call Proc#call ActiveSupport::Callbacks::ClassMethods#__run_callback } end end end def parse_args # Make sure the user specified at least one file if ARGV.length < 1 and not options.exec puts self.option_parser puts "" puts "Must specify a script to run" exit(-1) end self.option_parser.parse! ARGV if options.printer == RubyProf::MultiPrinter options.file ||= "." options.old_wd ||= Dir.pwd end rescue OptionParser::InvalidOption, OptionParser::InvalidArgument, OptionParser::MissingArgument => e puts self.option_parser puts e.message exit(-1) end def load_pre_libs options.pre_libs.each do |lib| require lib end end def load_pre_execs options.pre_execs.each do |exec| eval(exec) end end def run # Get the script we will execute script = ARGV.shift if options.replace_prog_name $0 = File.expand_path(script) end # Set VM compile option if defined?(RubyVM) RubyVM::InstructionSequence.compile_option = { :trace_instruction => true, :specialized_instruction => options.specialized_instruction } end # Set the measure mode RubyProf.measure_mode = options.measure_mode if options.measure_mode RubyProf.start_script(script) end end end # Parse command line options cmd = RubyProf::Cmd.new # Install at_exit handler. It is important that we do this # before loading the scripts so our at_exit handler run # *after* any other one that will be installed. at_exit { # Stop profiling result = RubyProf.stop # Eliminate unwanted methods from call graph if cmd.options.eliminate_methods result.eliminate_methods!(cmd.options.eliminate_methods) end if cmd.options.eliminate_methods_files cmd.options.eliminate_methods_files.each {|f| result.eliminate_methods!(f)} end # Create a printer printer = cmd.options.printer.new(result) printer_options = {:min_percent => cmd.options.min_percent, :sort_method => cmd.options.sort_method} # Get output if cmd.options.file # write it relative to the dir they *started* in, as it's a bit surprising to write it in the dir they end up in. Dir.chdir(cmd.options.old_wd) do if printer.is_a?(RubyProf::MultiPrinter) printer.print(printer_options.merge(:path => cmd.options.file)) else File.open(cmd.options.file, 'w') do |file| printer.print(file, printer_options) end end end else # Print out results printer.print(STDOUT, printer_options) end } # Now profile some code cmd.run ruby-prof-0.16.2/lib/0000755000175600017570000000000012766254554013354 5ustar pravipraviruby-prof-0.16.2/lib/ruby-prof.rb0000644000175600017570000000371012766254554015627 0ustar pravipravi# encoding: utf-8 # Load the C-based binding. begin RUBY_VERSION =~ /(\d+\.\d+\.\d+)/ require "#{$1}/ruby_prof.so" rescue LoadError require "ruby_prof.so" end require 'ruby-prof/version' require 'ruby-prof/call_info' require 'ruby-prof/compatibility' require 'ruby-prof/method_info' require 'ruby-prof/profile' require 'ruby-prof/rack' require 'ruby-prof/thread' module RubyProf autoload :AggregateCallInfo, 'ruby-prof/aggregate_call_info' autoload :CallInfoVisitor, 'ruby-prof/call_info_visitor' autoload :AbstractPrinter, 'ruby-prof/printers/abstract_printer' autoload :CallInfoPrinter, 'ruby-prof/printers/call_info_printer' autoload :CallStackPrinter, 'ruby-prof/printers/call_stack_printer' autoload :CallTreePrinter, 'ruby-prof/printers/call_tree_printer' autoload :DotPrinter, 'ruby-prof/printers/dot_printer' autoload :FlatPrinter, 'ruby-prof/printers/flat_printer' autoload :FlatPrinterWithLineNumbers, 'ruby-prof/printers/flat_printer_with_line_numbers' autoload :GraphHtmlPrinter, 'ruby-prof/printers/graph_html_printer' autoload :GraphPrinter, 'ruby-prof/printers/graph_printer' autoload :MultiPrinter, 'ruby-prof/printers/multi_printer' # Checks if the user specified the clock mode via # the RUBY_PROF_MEASURE_MODE environment variable def self.figure_measure_mode case ENV["RUBY_PROF_MEASURE_MODE"] when "wall", "wall_time" RubyProf.measure_mode = RubyProf::WALL_TIME when "cpu", "cpu_time" RubyProf.measure_mode = RubyProf::CPU_TIME when "allocations" RubyProf.measure_mode = RubyProf::ALLOCATIONS when "memory" RubyProf.measure_mode = RubyProf::MEMORY when "process", "process_time" RubyProf.measure_mode = RubyProf::PROCESS_TIME when "gc_time" RubyProf.measure_mode = RubyProf::GC_TIME when "gc_runs" RubyProf.measure_mode = RubyProf::GC_RUNS else # the default is defined in the measure_mode reader end end end RubyProf::figure_measure_mode ruby-prof-0.16.2/lib/unprof.rb0000644000175600017570000000024212766254554015210 0ustar pravipravi# encoding: utf-8 require "ruby-prof" at_exit { result = RubyProf.stop printer = RubyProf::FlatPrinter.new(result) printer.print(STDOUT) } RubyProf.start ruby-prof-0.16.2/lib/ruby-prof/0000755000175600017570000000000012766254554015301 5ustar pravipraviruby-prof-0.16.2/lib/ruby-prof/version.rb0000644000175600017570000000005112766254554017307 0ustar pravipravimodule RubyProf VERSION = "0.16.2" end ruby-prof-0.16.2/lib/ruby-prof/rack.rb0000644000175600017570000000517312766254554016554 0ustar pravipravi# encoding: utf-8 require 'tmpdir' module Rack class RubyProf def initialize(app, options = {}) @app = app @options = options @options[:min_percent] ||= 1 @tmpdir = options[:path] || Dir.tmpdir FileUtils.mkdir_p(@tmpdir) @printer_klasses = @options[:printers] || {::RubyProf::FlatPrinter => 'flat.txt', ::RubyProf::GraphPrinter => 'graph.txt', ::RubyProf::GraphHtmlPrinter => 'graph.html', ::RubyProf::CallStackPrinter => 'call_stack.html'} @skip_paths = options[:skip_paths] || [%r{^/assets}, %r{\.(css|js|png|jpeg|jpg|gif)$}] @only_paths = options[:only_paths] end def call(env) request = Rack::Request.new(env) if should_profile?(request.path) begin result = nil data = ::RubyProf::Profile.profile(profiling_options) do result = @app.call(env) end path = request.path.gsub('/', '-') path.slice!(0) print(data, path) result end else @app.call(env) end end private def should_profile?(path) return false if paths_match?(path, @skip_paths) @only_paths ? paths_match?(path, @only_paths) : true end def paths_match?(path, paths) paths.any? { |skip_path| skip_path =~ path } end def profiling_options options = {} options[:measure_mode] = ::RubyProf.measure_mode options[:exclude_threads] = if @options[:ignore_existing_threads] Thread.list.select{|t| t != Thread.current} else ::RubyProf.exclude_threads end if @options[:request_thread_only] options[:include_threads] = [Thread.current] end if @options[:merge_fibers] options[:merge_fibers] = true end options end def print(data, path) @printer_klasses.each do |printer_klass, base_name| printer = printer_klass.new(data) if base_name.respond_to?(:call) base_name = base_name.call end if printer_klass == ::RubyProf::MultiPrinter printer.print(@options.merge(:profile => "#{path}-#{base_name}")) elsif printer_klass == ::RubyProf::CallTreePrinter printer.print(@options.merge(:profile => "#{path}-#{base_name}")) else file_name = ::File.join(@tmpdir, "#{path}-#{base_name}") ::File.open(file_name, 'wb') do |file| printer.print(file, @options) end end end end end end ruby-prof-0.16.2/lib/ruby-prof/call_info.rb0000644000175600017570000000721612766254554017562 0ustar pravipravi# encoding: utf-8 module RubyProf class CallInfo # part of this class is defined in C code. # it provides the following attributes pertaining to tree structure: # depth: tree level (0 == root) # parent: parent call info (can be nil) # children: array of call info children (can be empty) # target: method info (containing an array of call infos) attr_reader :recursive def detect_recursion(visited_methods = Hash.new(0)) @recursive = (visited_methods[target] += 1) > 1 children.each do |child| child.detect_recursion(visited_methods) end visited_methods.delete(target) if (visited_methods[target] -= 1) == 0 return @recursive end def children_time children.inject(0) do |sum, call_info| sum += call_info.total_time end end def stack @stack ||= begin methods = Array.new call_info = self while call_info methods << call_info.target call_info = call_info.parent end methods.reverse end end def call_sequence @call_sequence ||= begin stack.map {|method| method.full_name}.join('->') end end def root? self.parent.nil? end def descendent_of(other) p = self.parent while p && p != other && p.depth > other.depth p = p.parent end p == other end def self.roots_of(call_infos) roots = [] sorted = call_infos.sort_by(&:depth).reverse while call_info = sorted.shift roots << call_info unless sorted.any?{|p| call_info.descendent_of(p)} end roots end def to_s "#{target.full_name} (c: #{called}, tt: #{total_time}, st: #{self_time}, ct: #{children_time})" end def inspect super + "(#{target.full_name}, d: #{depth}, c: #{called}, tt: #{total_time}, st: #{self_time}, ct: #{children_time})" end # eliminate call info from the call tree. # adds self and wait time to parent and attaches called methods to parent. # merges call trees for methods called from both praent end self. def eliminate! # puts "eliminating #{self}" return unless parent parent.add_self_time(self) parent.add_wait_time(self) children.each do |kid| if call = parent.find_call(kid) call.merge_call_tree(kid) else parent.children << kid # $stderr.puts "setting parent of #{kid}\nto #{parent}" kid.parent = parent end end parent.children.delete(self) end # find a specific call in list of children. returns nil if not found. # note: there can't be more than one child with a given target method. in other words: # x.children.grep{|y|y.target==m}.size <= 1 for all method infos m and call infos x def find_call(other) matching = children.select { |kid| kid.target == other.target } raise "inconsistent call tree" unless matching.size <= 1 matching.first end # merge two call trees. adds self, wait, and total time of other to self and merges children of other into children of self. def merge_call_tree(other) # $stderr.puts "merging #{self}\nand #{other}" self.called += other.called add_self_time(other) add_wait_time(other) add_total_time(other) other.children.each do |other_kid| if kid = find_call(other_kid) # $stderr.puts "merging kids" kid.merge_call_tree(other_kid) else other_kid.parent = self children << other_kid end end other.children.clear other.target.call_infos.delete(other) end end end ruby-prof-0.16.2/lib/ruby-prof/call_info_visitor.rb0000644000175600017570000000200512766254554021330 0ustar pravipravi# The call info visitor class does a depth-first traversal across a # list of method infos. At each call_info node, the visitor executes # the block provided in the #visit method. The block is passed two # parameters, the event and the call_info instance. Event will be # either :enter or :exit. # # visitor = RubyProf::CallInfoVisitor.new(result.threads.first.top_call_infos) # # method_names = Array.new # # visitor.visit do |call_info, event| # method_names << call_info.target.full_name if event == :enter # end # # puts method_names module RubyProf class CallInfoVisitor def initialize(call_infos) @call_infos = CallInfo.roots_of(call_infos) end def visit(&block) @call_infos.each do |call_info| visit_call_info(call_info, &block) end end private def visit_call_info(call_info, &block) yield call_info, :enter call_info.children.each do |child| visit_call_info(child, &block) end yield call_info, :exit end end end ruby-prof-0.16.2/lib/ruby-prof/aggregate_call_info.rb0000644000175600017570000000276212766254554021571 0ustar pravipravi# encoding: utf-8 module RubyProf class AggregateCallInfo attr_reader :call_infos, :method_info def initialize(call_infos, method_info) if call_infos.length == 0 raise(ArgumentError, "Must specify at least one call info.") end @call_infos = call_infos @method_info = method_info end def target call_infos.first.target end def parent call_infos.first.parent end def line call_infos.first.line end def children call_infos.inject(Array.new) do |result, call_info| result.concat(call_info.children) end end def total_time aggregate_roots(:total_time) end def self_time aggregate_roots(:self_time) end def wait_time aggregate_roots(:wait_time) end def children_time aggregate_roots(:children_time) end def called aggregate_all(:called) end def to_s "#{call_infos.first.target.full_name}" end private # return all call_infos which are not (grand) children of any other node in the list of given call_infos def roots @roots ||= method_info.recursive? ? CallInfo.roots_of(call_infos) : call_infos end def aggregate_all(method_name) call_infos.inject(0) do |sum, call_info| sum + call_info.send(method_name) end end def aggregate_roots(method_name) roots.inject(0) do |sum, call_info| sum + call_info.send(method_name) end end end end ruby-prof-0.16.2/lib/ruby-prof/method_info.rb0000644000175600017570000000566512766254554020135 0ustar pravipravi# encoding: utf-8 module RubyProf class MethodInfo include Comparable def <=>(other) if self.total_time < other.total_time -1 elsif self.total_time > other.total_time 1 elsif self.min_depth < other.min_depth 1 elsif self.min_depth > other.min_depth -1 else self.full_name <=> other.full_name end end def detect_recursion call_infos.each(&:detect_recursion) end def called @called ||= begin call_infos.inject(0) do |sum, call_info| sum + call_info.called end end end def total_time @total_time ||= begin call_infos.inject(0) do |sum, call_info| sum += call_info.total_time unless call_info.recursive sum end end end def self_time @self_time ||= begin call_infos.inject(0) do |sum, call_info| sum += call_info.self_time unless call_info.recursive sum end end end def wait_time @wait_time ||= begin call_infos.inject(0) do |sum, call_info| sum += call_info.wait_time unless call_info.recursive sum end end end def children_time @children_time ||= begin call_infos.inject(0) do |sum, call_info| sum += call_info.children_time unless call_info.recursive sum end end end def min_depth @min_depth ||= call_infos.map(&:depth).min end def root? @root ||= begin call_infos.find do |call_info| not call_info.root? end.nil? end end def recursive? (@recursive ||= call_infos.detect(&:recursive) ? :true : :false) == :true end def children @children ||= call_infos.map(&:children).flatten end def parents @parents ||= call_infos.map(&:parent) end def aggregate_parents # group call infos based on their parents groups = self.call_infos.each_with_object({}) do |call_info, hash| key = call_info.parent ? call_info.parent.target : self (hash[key] ||= []) << call_info end groups.map do |key, value| AggregateCallInfo.new(value, self) end end def aggregate_children # group call infos based on their targets groups = self.children.each_with_object({}) do |call_info, hash| key = call_info.target (hash[key] ||= []) << call_info end groups.map do |key, value| AggregateCallInfo.new(value, self) end end def to_s "#{self.full_name} (c: #{self.called}, tt: #{self.total_time}, st: #{self.self_time}, wt: #{wait_time}, ct: #{self.children_time})" end # remove method from the call graph. should not be called directly. def eliminate! # $stderr.puts "eliminating #{self}" call_infos.each{ |call_info| call_info.eliminate! } call_infos.clear end end end ruby-prof-0.16.2/lib/ruby-prof/printers/0000755000175600017570000000000012766254554017147 5ustar pravipraviruby-prof-0.16.2/lib/ruby-prof/printers/graph_html_printer.rb0000644000175600017570000001726512766254554023377 0ustar pravipravi# encoding: utf-8 require 'erb' module RubyProf # Generates graph[link:files/examples/graph_html.html] profile reports as html. # To use the graph html printer: # # result = RubyProf.profile do # [code to profile] # end # # printer = RubyProf::GraphHtmlPrinter.new(result) # printer.print(STDOUT, :min_percent=>0) # # The Graph printer takes the following options in its print methods: # :filename - specify a file to use that contains the ERB # template to use, instead of the built-in self.template # # :template - specify an ERB template to use, instead of the # built-in self.template # class GraphHtmlPrinter < AbstractPrinter include ERB::Util def setup_options(options) super(options) filename = options[:filename] template = filename ? File.read(filename).untaint : (options[:template] || self.template) @erb = ERB.new(template) @erb.filename = filename end def print(output = STDOUT, options = {}) @output = output setup_options(options) @output << @erb.result(binding).split("\n").map(&:rstrip).join("\n") << "\n" end # Creates a link to a method. Note that we do not create # links to methods which are under the min_perecent # specified by the user, since they will not be # printed out. def create_link(thread, overall_time, method) total_percent = (method.total_time/overall_time) * 100 if total_percent < min_percent # Just return name h method.full_name else href = '#' + method_href(thread, method) "#{h method.full_name}" end end def method_href(thread, method) h(method.full_name.gsub(/[><#\.\?=:]/,"_") + "_" + thread.fiber_id.to_s) end def file_link(path, linenum) srcfile = File.expand_path(path) if srcfile =~ /\/ruby_runtime$/ "" else if RUBY_PLATFORM =~ /darwin/ "#{linenum}" else "#{linenum}" end end end def template '

Profile Report: <%= RubyProf.measure_mode_string %>

<% for thread in @result.threads %> <% end %>
Thread ID Fiber ID Total Time
<%= thread.id %> <%= thread.fiber_id %> <%= thread.total_time %>
<% for thread in @result.threads methods = thread.methods total_time = thread.total_time %>

Thread <%= thread.id %>, Fiber: <%= thread.fiber_id %>

<% min_time = @options[:min_time] || (@options[:nonzero] ? 0.005 : nil) methods.sort_by(&sort_method).reverse_each do |method| total_percentage = (method.total_time/total_time) * 100 next if total_percentage < min_percent next if min_time && method.total_time < min_time self_percentage = (method.self_time/total_time) * 100 %> <% for caller in method.aggregate_parents.sort_by(&:total_time) next unless caller.parent next if min_time && caller.total_time < min_time %> <% end %> <% for callee in method.aggregate_children.sort_by(&:total_time).reverse next if min_time && callee.total_time < min_time %> <% end %> <% end %>
%Total %Self Total Self Wait Child Calls Name Line
    <%= sprintf("%.2f", caller.total_time) %> <%= sprintf("%.2f", caller.self_time) %> <%= sprintf("%.2f", caller.wait_time) %> <%= sprintf("%.2f", caller.children_time) %> <%= "#{caller.called}/#{method.called}" %> <%= create_link(thread, total_time, caller.parent.target) %> <%= file_link(caller.parent.target.source_file, caller.line) %>
<%= sprintf("%.2f\%", total_percentage) %> <%= sprintf("%.2f\%", self_percentage) %> <%= sprintf("%.2f", method.total_time) %> <%= sprintf("%.2f", method.self_time) %> <%= sprintf("%.2f", method.wait_time) %> <%= sprintf("%.2f", method.children_time) %> <%= sprintf("%i", method.called) %> <%= method.recursive? ? "*" : " "%><%= h method.full_name %> <%= file_link(method.source_file, method.line) %>
    <%= sprintf("%.2f", callee.total_time) %> <%= sprintf("%.2f", callee.self_time) %> <%= sprintf("%.2f", callee.wait_time) %> <%= sprintf("%.2f", callee.children_time) %> <%= "#{callee.called}/#{callee.target.called}" %> <%= create_link(thread, total_time, callee.target) %> <%= file_link(method.source_file, callee.line) %>
* indicates recursively called methods
<% end %> ' end end end ruby-prof-0.16.2/lib/ruby-prof/printers/call_stack_printer.rb0000644000175600017570000002003612766254554023340 0ustar pravipravi# encoding: utf-8 require 'erb' require 'fileutils' require 'base64' module RubyProf # prints a HTML visualization of the call tree class CallStackPrinter < AbstractPrinter include ERB::Util # Specify print options. # # options - Hash table # :min_percent - Number 0 to 100 that specifes the minimum # %self (the methods self time divided by the # overall total time) that a method must take # for it to be printed out in the report. # Default value is 0. # # :print_file - True or false. Specifies if a method's source # file should be printed. Default value if false. # # :threshold - a float from 0 to 100 that sets the threshold of # results displayed. # Default value is 1.0 # # :title - a String to overide the default "ruby-prof call tree" # title of the report. # # :expansion - a float from 0 to 100 that sets the threshold of # results that are expanded, if the percent_total # exceeds it. # Default value is 10.0 # # :application - a String to overide the name of the application, # as it appears on the report. # def print(output = STDOUT, options = {}) @output = output setup_options(options) if @graph_html = options.delete(:graph) @graph_html = "file://" + @graph_html if @graph_html[0]=="/" end print_header @overall_threads_time = @result.threads.inject(0) do |val, thread| val += thread.total_time end @result.threads.each do |thread| @current_thread_id = thread.fiber_id @overall_time = thread.total_time thread_info = "Thread: #{thread.id}" thread_info << ", Fiber: #{thread.fiber_id}" unless thread.id == thread.fiber_id thread_info << " (#{"%4.2f%%" % ((@overall_time/@overall_threads_time)*100)} ~ #{@overall_time})" @output.print "
#{thread_info}
" @output.print "
    " thread.methods.each do |m| # $stderr.print m.dump next unless m.root? m.call_infos.each do |ci| next unless ci.root? print_stack ci, thread.total_time end end @output.print "
" end print_footer end def print_stack(call_info, parent_time) total_time = call_info.total_time percent_parent = (total_time/parent_time)*100 percent_total = (total_time/@overall_time)*100 return unless percent_total > min_percent color = self.color(percent_total) kids = call_info.children visible = percent_total >= threshold expanded = percent_total >= expansion display = visible ? "block" : "none" @output.print "
  • " if kids.empty? @output.print "" else visible_children = kids.any?{|ci| (ci.total_time/@overall_time)*100 >= threshold} image = visible_children ? (expanded ? "minus" : "plus") : "empty" @output.print "" end @output.printf " %4.2f%% (%4.2f%%) %s %s\n", percent_total, percent_parent, link(call_info), graph_link(call_info) unless kids.empty? if expanded @output.print "
      " else @output.print '
        ' end kids.sort_by{|c| -c.total_time}.each do |callinfo| print_stack callinfo, total_time end @output.print "
      " end @output.print "" end def name(call_info) method = call_info.target method.full_name end def link(call_info) method = call_info.target file = File.expand_path(method.source_file) if file =~ /\/ruby_runtime$/ h(name(call_info)) else if RUBY_PLATFORM =~ /darwin/ "#{h(name(call_info))}" else "#{h(name(call_info))}" end end end def graph_link(call_info) total_calls = call_info.target.call_infos.inject(0){|t, ci| t += ci.called} href = "#{@graph_html}##{method_href(call_info.target)}" totals = @graph_html ? "#{total_calls}" : total_calls.to_s "[#{call_info.called} calls, #{totals} total]" end def method_href(method) h(method.full_name.gsub(/[><#\.\?=:]/,"_") + "_" + @current_thread_id.to_s) end def total_time(call_infos) sum(call_infos.map{|ci| ci.total_time}) end def sum(a) a.inject(0.0){|s,t| s+=t} end def dump(ci) $stderr.printf "%s/%d t:%f s:%f w:%f \n", ci, ci.object_id, ci.total_time, ci.self_time, ci.wait_time end def color(p) case i = p.to_i when 0..5 "01" when 5..10 "05" when 100 "9" else "#{i/10}" end end def application @options[:application] || $PROGRAM_NAME end def arguments ARGV.join(' ') end def title @title ||= @options.delete(:title) || "ruby-prof call tree" end def threshold @options[:threshold] || 1.0 end def expansion @options[:expansion] || 10.0 end def print_header @output.puts "" @output.puts '' @output.puts "#{h title}" print_css print_java_script @output.puts '
      ' print_title_bar print_commands print_help end def print_footer @output.puts '
      ' end def open_asset(file) path = File.join(File.expand_path('../../assets', __FILE__), file) File.open(path, 'rb').read end def print_css html = open_asset('call_stack_printer.css.html') @output.puts html.gsub('%s', base64_image) end def base64_image file = open_asset('call_stack_printer.png') Base64.encode64(file).gsub(/\n/, '') end def print_java_script html = open_asset('call_stack_printer.js.html') @output.puts html end def print_title_bar @output.puts <<-"end_title_bar"
      Call tree for application #{h application} #{h arguments}
      Generated on #{Time.now} with options #{h @options.inspect}
      end_title_bar end def print_commands @output.puts <<-"end_commands"
      Threshold:
      end_commands end def print_help @output.puts <<-'end_help' end_help end end end ruby-prof-0.16.2/lib/ruby-prof/printers/abstract_printer.rb0000644000175600017570000000421312766254554023042 0ustar pravipravi# encoding: utf-8 module RubyProf class AbstractPrinter # Create a new printer. # # result should be the output generated from a profiling run def initialize(result) @result = result @output = nil end # Specify print options. # # options - Hash table # :min_percent - Number 0 to 100 that specifes the minimum # %self (the methods self time divided by the # overall total time) that a method must take # for it to be printed out in the report. # Default value is 0. # # :print_file - True or false. Specifies if a method's source # file should be printed. Default value if false. # # :sort_method - Specifies method used for sorting method infos. # Available values are :total_time, :self_time, # :wait_time, :children_time # Default value is :total_time def setup_options(options = {}) @options = options end def min_percent @options[:min_percent] || 0 end def print_file @options[:print_file] || false end def sort_method @options[:sort_method] || :total_time end def method_name(method) name = method.full_name if print_file name += " (#{method.source_file}:#{method.line}}" end name end # Print a profiling report to the provided output. # # output - Any IO object, including STDOUT or a file. # The default value is STDOUT. # # options - Hash of print options. See #setup_options # for more information. Note that each printer can # define its own set of options. def print(output = STDOUT, options = {}) @output = output setup_options(options) print_threads end def print_threads @result.threads.each do |thread| print_thread(thread) end end def print_thread(thread) print_header(thread) print_methods(thread) print_footer(thread) end def print_header(thread) end def print_footer(thread) end end endruby-prof-0.16.2/lib/ruby-prof/printers/graph_printer.rb0000644000175600017570000001003612766254554022340 0ustar pravipravi# encoding: utf-8 module RubyProf # Generates graph[link:files/examples/graph_txt.html] profile reports as text. # To use the graph printer: # # result = RubyProf.profile do # [code to profile] # end # # printer = RubyProf::GraphPrinter.new(result) # printer.print(STDOUT, {}) # # The constructor takes two arguments. See the README class GraphPrinter < AbstractPrinter PERCENTAGE_WIDTH = 8 TIME_WIDTH = 11 CALL_WIDTH = 17 private def print_header(thread) @output << "Measure Mode: %s\n" % RubyProf.measure_mode_string @output << "Thread ID: #{thread.id}\n" @output << "Fiber ID: #{thread.fiber_id}\n" unless thread.id == thread.fiber_id @output << "Total Time: #{thread.total_time}\n" @output << "Sort by: #{sort_method}\n" @output << "\n" # 1 is for % sign @output << sprintf("%#{PERCENTAGE_WIDTH}s", "%total") @output << sprintf("%#{PERCENTAGE_WIDTH}s", "%self") @output << sprintf("%#{TIME_WIDTH}s", "total") @output << sprintf("%#{TIME_WIDTH}s", "self") @output << sprintf("%#{TIME_WIDTH}s", "wait") @output << sprintf("%#{TIME_WIDTH}s", "child") @output << sprintf("%#{CALL_WIDTH}s", "calls") @output << " name" @output << "\n" end def print_methods(thread) total_time = thread.total_time # Sort methods from longest to shortest total time methods = thread.methods.sort_by(&sort_method) # Print each method in total time order methods.reverse_each do |method| total_percentage = (method.total_time/total_time) * 100 next if total_percentage < min_percent self_percentage = (method.self_time/total_time) * 100 @output << "-" * 80 << "\n" print_parents(thread, method) # 1 is for % sign @output << sprintf("%#{PERCENTAGE_WIDTH-1}.2f\%", total_percentage) @output << sprintf("%#{PERCENTAGE_WIDTH-1}.2f\%", self_percentage) @output << sprintf("%#{TIME_WIDTH}.3f", method.total_time) @output << sprintf("%#{TIME_WIDTH}.3f", method.self_time) @output << sprintf("%#{TIME_WIDTH}.3f", method.wait_time) @output << sprintf("%#{TIME_WIDTH}.3f", method.children_time) @output << sprintf("%#{CALL_WIDTH}i", method.called) @output << sprintf(" %s", method.recursive? ? "*" : " ") @output << sprintf("%s", method_name(method)) if print_file @output << sprintf(" %s:%s", method.source_file, method.line) end @output << "\n" print_children(method) end end def print_parents(thread, method) method.aggregate_parents.sort_by(&:total_time).each do |caller| next unless caller.parent @output << " " * 2 * PERCENTAGE_WIDTH @output << sprintf("%#{TIME_WIDTH}.3f", caller.total_time) @output << sprintf("%#{TIME_WIDTH}.3f", caller.self_time) @output << sprintf("%#{TIME_WIDTH}.3f", caller.wait_time) @output << sprintf("%#{TIME_WIDTH}.3f", caller.children_time) call_called = "#{caller.called}/#{method.called}" @output << sprintf("%#{CALL_WIDTH}s", call_called) @output << sprintf(" %s", caller.parent.target.full_name) @output << "\n" end end def print_children(method) method.aggregate_children.sort_by(&:total_time).reverse.each do |child| # Get children method @output << " " * 2 * PERCENTAGE_WIDTH @output << sprintf("%#{TIME_WIDTH}.3f", child.total_time) @output << sprintf("%#{TIME_WIDTH}.3f", child.self_time) @output << sprintf("%#{TIME_WIDTH}.3f", child.wait_time) @output << sprintf("%#{TIME_WIDTH}.3f", child.children_time) call_called = "#{child.called}/#{child.target.called}" @output << sprintf("%#{CALL_WIDTH}s", call_called) @output << sprintf(" %s", child.target.full_name) @output << "\n" end end def print_footer(thread) @output << "\n" @output << "* indicates recursively called methods\n" end end end ruby-prof-0.16.2/lib/ruby-prof/printers/dot_printer.rb0000644000175600017570000000734212766254554022033 0ustar pravipravi# encoding: utf-8 require 'set' module RubyProf # Generates a graphviz graph in dot format. # To use the dot printer: # # result = RubyProf.profile do # [code to profile] # end # # printer = RubyProf::DotPrinter.new(result) # printer.print(STDOUT) # # You can use either dot viewer such as GraphViz, or the dot command line tool # to reformat the output into a wide variety of outputs: # # dot -Tpng graph.dot > graph.png # class DotPrinter < RubyProf::AbstractPrinter CLASS_COLOR = '"#666666"' EDGE_COLOR = '"#666666"' # Creates the DotPrinter using a RubyProf::Proile. def initialize(result) super(result) @seen_methods = Set.new end # Print a graph report to the provided output. # # output - Any IO object, including STDOUT or a file. The default value is # STDOUT. # # options - Hash of print options. See #setup_options # for more information. # # When profiling results that cover a large number of method calls it # helps to use the :min_percent option, for example: # # DotPrinter.new(result).print(STDOUT, :min_percent=>5) # def print(output = STDOUT, options = {}) @output = output setup_options(options) puts 'digraph "Profile" {' #puts "label=\"#{mode_name} >=#{min_percent}%\\nTotal: #{total_time}\";" puts "labelloc=t;" puts "labeljust=l;" print_threads puts '}' end private # Something of a hack, figure out which constant went with the # RubyProf.measure_mode so that we can display it. Otherwise it's easy to # forget what measurement was made. def mode_name RubyProf.constants.find{|c| RubyProf.const_get(c) == RubyProf.measure_mode} end def print_threads @result.threads.each do |thread| puts "subgraph \"Thread #{thread.id}\" {" print_thread(thread) puts "}" print_classes(thread) end end # Determines an ID to use to represent the subject in the Dot file. def dot_id(subject) subject.object_id end def print_thread(thread) total_time = thread.total_time thread.methods.sort_by(&sort_method).reverse_each do |method| total_percentage = (method.total_time/total_time) * 100 next if total_percentage < min_percent name = method_name(method).split("#").last puts "#{dot_id(method)} [label=\"#{name}\\n(#{total_percentage.round}%)\"];" @seen_methods << method print_edges(total_time, method) end end def print_classes(thread) grouped = {} thread.methods.each{|m| grouped[m.klass_name] ||= []; grouped[m.klass_name] << m} grouped.each do |cls, methods2| # Filter down to just seen methods big_methods = methods2.select{|m| @seen_methods.include? m} if !big_methods.empty? puts "subgraph cluster_#{cls.object_id} {" puts "label = \"#{cls}\";" puts "fontcolor = #{CLASS_COLOR};" puts "fontsize = 16;" puts "color = #{CLASS_COLOR};" big_methods.each do |m| puts "#{m.object_id};" end puts "}" end end end def print_edges(total_time, method) method.aggregate_children.sort_by(&:total_time).reverse.each do |child| target_percentage = (child.target.total_time / total_time) * 100.0 next if target_percentage < min_percent # Get children method puts "#{dot_id(method)} -> #{dot_id(child.target)} [label=\"#{child.called}/#{child.target.called}\" fontsize=10 fontcolor=#{EDGE_COLOR}];" end end # Silly little helper for printing to the @output def puts(str) @output.puts(str) end end end ruby-prof-0.16.2/lib/ruby-prof/printers/flat_printer_with_line_numbers.rb0000644000175600017570000000431112766254554025761 0ustar pravipravi# encoding: utf-8 module RubyProf # Generates flat[link:files/examples/flat_txt.html] profile reports as text. # To use the flat printer with line numbers: # # result = RubyProf.profile do # [code to profile] # end # # printer = RubyProf::FlatPrinterWithLineNumbers.new(result) # printer.print(STDOUT, {}) # class FlatPrinterWithLineNumbers < FlatPrinter def print_methods(thread) total_time = thread.total_time methods = thread.methods.sort_by(&sort_method).reverse sum = 0 methods.each do |method| self_percent = (method.self_time / total_time) * 100 next if self_percent < min_percent sum += method.self_time #self_time_called = method.called > 0 ? method.self_time/method.called : 0 #total_time_called = method.called > 0? method.total_time/method.called : 0 @output << "%6.2f %9.3f %9.3f %9.3f %9.3f %8d %s%s" % [ method.self_time / total_time * 100, # %self method.total_time, # total method.self_time, # self method.wait_time, # wait method.children_time, # children method.called, # calls method.recursive? ? "*" : " ", # cycle method_name(method) # name ] if method.source_file == 'ruby_runtime' @output << "\n" else @output << "\n defined at:\n" @output << " %s:%s\n" % [File.expand_path(method.source_file), method.line] end callers = [] method.call_infos.each do |ci| if ci.parent && ci.parent.target.source_file != 'ruby_runtime' callers << [method_name(ci.parent.target), File.expand_path(ci.parent.target.source_file), ci.parent.target.line] end end # make sure callers are unique callers.uniq! unless callers.empty? @output << " called from:\n" callers.each do |args| @output << " %s (%s:%s)\n" % args end end @output << "\n" end end end end ruby-prof-0.16.2/lib/ruby-prof/printers/call_info_printer.rb0000644000175600017570000000245112766254554023167 0ustar pravipravi# encoding: utf-8 module RubyProf # Prints out the call graph based on CallInfo instances. This # is mainly for debugging purposes as it provides access into # into RubyProf's internals. class CallInfoPrinter < AbstractPrinter TIME_WIDTH = 0 private def print_header(thread) @output << "Thread ID: #{thread.id}\n" @output << "Fiber ID: #{thread.fiber_id}\n" @output << "Total Time: #{thread.total_time}\n" @output << "Sort by: #{sort_method}\n" @output << "\n" end def print_methods(thread) visitor = CallInfoVisitor.new(thread.top_call_infos) visitor.visit do |call_info, event| if event == :enter @output << " " * call_info.depth @output << call_info.target.full_name @output << " (" @output << "tt:#{sprintf("%#{TIME_WIDTH}.2f", call_info.total_time)}, " @output << "st:#{sprintf("%#{TIME_WIDTH}.2f", call_info.self_time)}, " @output << "wt:#{sprintf("%#{TIME_WIDTH}.2f", call_info.wait_time)}, " @output << "ct:#{sprintf("%#{TIME_WIDTH}.2f", call_info.children_time)}, " @output << "call:#{call_info.called}, " @output << "rec:#{call_info.recursive}" @output << ")" @output << "\n" end end end end end ruby-prof-0.16.2/lib/ruby-prof/printers/flat_printer.rb0000644000175600017570000000444112766254554022170 0ustar pravipravi# encoding: utf-8 module RubyProf # Generates flat[link:files/examples/flat_txt.html] profile reports as text. # To use the flat printer: # # result = RubyProf.profile do # [code to profile] # end # # printer = RubyProf::FlatPrinter.new(result) # printer.print(STDOUT, {}) # class FlatPrinter < AbstractPrinter # Override for this printer to sort by self time by default def sort_method @options[:sort_method] || :self_time end private #def print_threads # @result.threads.each do |thread| # print_thread(thread) # @output << "\n" * 2 # end #end def print_header(thread) @output << "Measure Mode: %s\n" % RubyProf.measure_mode_string @output << "Thread ID: %d\n" % thread.id @output << "Fiber ID: %d\n" % thread.fiber_id unless thread.id == thread.fiber_id @output << "Total: %0.6f\n" % thread.total_time @output << "Sort by: #{sort_method}\n" @output << "\n" @output << " %self total self wait child calls name\n" end def print_methods(thread) total_time = thread.total_time methods = thread.methods.sort_by(&sort_method).reverse sum = 0 methods.each do |method| self_percent = (method.self_time / total_time) * 100 next if self_percent < min_percent sum += method.self_time #self_time_called = method.called > 0 ? method.self_time/method.called : 0 #total_time_called = method.called > 0? method.total_time/method.called : 0 @output << "%6.2f %9.3f %9.3f %9.3f %9.3f %8d %s%s\n" % [ method.self_time / total_time * 100, # %self method.total_time, # total method.self_time, # self method.wait_time, # wait method.children_time, # children method.called, # calls method.recursive? ? "*" : " ", # cycle method_name(method) # name ] end end def print_footer(thread) @output << "\n" @output << "* indicates recursively called methods\n" end end end ruby-prof-0.16.2/lib/ruby-prof/printers/call_tree_printer.rb0000644000175600017570000000763112766254554023200 0ustar pravipravi# encoding: utf-8 require 'fiber' require 'thread' require 'fileutils' module RubyProf # Generate profiling information in callgrind format for use by # kcachegrind and similar tools. # # Note: when profiling for a callgrind printer, one should use the # merge_fibers: true option when creating the profile. Otherwise # each fiber would appear as a separate profile. class CallTreePrinter < AbstractPrinter def determine_event_specification_and_value_scale @event_specification = "events: " case RubyProf.measure_mode when RubyProf::PROCESS_TIME @value_scale = RubyProf::CLOCKS_PER_SEC @event_specification << 'process_time' when RubyProf::WALL_TIME @value_scale = 1_000_000 @event_specification << 'wall_time' when RubyProf.const_defined?(:CPU_TIME) && RubyProf::CPU_TIME @value_scale = RubyProf.cpu_frequency @event_specification << 'cpu_time' when RubyProf.const_defined?(:ALLOCATIONS) && RubyProf::ALLOCATIONS @value_scale = 1 @event_specification << 'allocations' when RubyProf.const_defined?(:MEMORY) && RubyProf::MEMORY @value_scale = 1 @event_specification << 'memory' when RubyProf.const_defined?(:GC_RUNS) && RubyProf::GC_RUNS @value_scale = 1 @event_specification << 'gc_runs' when RubyProf.const_defined?(:GC_TIME) && RubyProf::GC_TIME @value_scale = 1000000 @event_specification << 'gc_time' else raise "Unknown measure mode: #{RubyProf.measure_mode}" end end def print(options = {}) setup_options(options) determine_event_specification_and_value_scale print_threads end def print_threads remove_subsidiary_files_from_previous_profile_runs # TODO: merge fibers of a given thread here, instead of relying # on the profiler to merge fibers. @result.threads.each do |thread| print_thread(thread) end end def convert(value) (value * @value_scale).round end def file(method) File.expand_path(method.source_file) end def print_thread(thread) File.open(file_path_for_thread(thread), "w") do |f| print_headers(f, thread) thread.methods.reverse_each do |method| print_method(f, method) end end end def path @options[:path] || "." end def base_name @options[:profile] || "profile" end def remove_subsidiary_files_from_previous_profile_runs pattern = [base_name, "callgrind.out", $$, "*"].join(".") files = Dir.glob(File.join(path, pattern)) FileUtils.rm_f(files) end def file_name_for_thread(thread) if thread.fiber_id == Fiber.current.object_id [base_name, "callgrind.out", $$].join(".") else [base_name, "callgrind.out", $$, thread.fiber_id].join(".") end end def file_path_for_thread(thread) File.join(path, file_name_for_thread(thread)) end def print_headers(output, thread) output << "#{@event_specification}\n\n" # this doesn't work. kcachegrind does not fully support the spec. # output << "thread: #{thread.id}\n\n" end def print_method(output, method) # Print out the file and method name output << "fl=#{file(method)}\n" output << "fn=#{method_name(method)}\n" # Now print out the function line number and its self time output << "#{method.line} #{convert(method.self_time)}\n" # Now print out all the children methods method.children.each do |callee| output << "cfl=#{file(callee.target)}\n" output << "cfn=#{method_name(callee.target)}\n" output << "calls=#{callee.called} #{callee.line}\n" # Print out total times here! output << "#{callee.line} #{convert(callee.total_time)}\n" end output << "\n" end end end ruby-prof-0.16.2/lib/ruby-prof/printers/multi_printer.rb0000644000175600017570000000325712766254554022400 0ustar pravipravi# encoding: utf-8 module RubyProf # Helper class to simplify printing profiles of several types from # one profiling run. Currently prints a flat profile, a callgrind # profile, a call stack profile and a graph profile. class MultiPrinter def initialize(result) @stack_printer = CallStackPrinter.new(result) @graph_printer = GraphHtmlPrinter.new(result) @tree_printer = CallTreePrinter.new(result) @flat_printer = FlatPrinter.new(result) end # create profile files under options[:path] or the current # directory. options[:profile] is used as the base name for the # pofile file, defaults to "profile". def print(options) @profile = options.delete(:profile) || "profile" @directory = options.delete(:path) || File.expand_path(".") File.open(stack_profile, "w") do |f| @stack_printer.print(f, options.merge(:graph => "#{@profile}.graph.html")) end File.open(graph_profile, "w") do |f| @graph_printer.print(f, options) end @tree_printer.print(options.merge(:path => @directory, :profile => @profile)) File.open(flat_profile, "w") do |f| @flat_printer.print(f, options) end end # the name of the call stack profile file def stack_profile "#{@directory}/#{@profile}.stack.html" end # the name of the graph profile file def graph_profile "#{@directory}/#{@profile}.graph.html" end # the name of the callgrind profile file def tree_profile "#{@directory}/#{@profile}.callgrind.out.#{$$}" end # the name of the flat profile file def flat_profile "#{@directory}/#{@profile}.flat.txt" end end end ruby-prof-0.16.2/lib/ruby-prof/profile.rb0000644000175600017570000000313012766254554017263 0ustar pravipravi# encoding: utf-8 module RubyProf class Profile # This method gets called once profiling has been completed # but before results are returned to the user. Thus it provides # a hook to do any necessary post-processing on the call graph. def post_process self.threads.each do |thread| thread.detect_recursion end end # eliminate some calls from the graph by merging the information into callers. # matchers can be a list of strings or regular expressions or the name of a file containing regexps. def eliminate_methods!(matchers) matchers = read_regexps_from_file(matchers) if matchers.is_a?(String) eliminated = [] threads.each do |thread| matchers.each{ |matcher| eliminated.concat(eliminate_methods(thread.methods, matcher)) } end eliminated end private # read regexps from file def read_regexps_from_file(file_name) matchers = [] File.open(file_name).each_line do |l| next if (l =~ /^(#.*|\s*)$/) # emtpy lines and lines starting with # matchers << Regexp.new(l.strip) end end # eliminate methods matching matcher def eliminate_methods(methods, matcher) eliminated = [] i = 0 while i < methods.size method_info = methods[i] method_name = method_info.full_name if matcher === method_name raise "can't eliminate root method" if method_info.root? eliminated << methods.delete_at(i) method_info.eliminate! else i += 1 end end eliminated end end end ruby-prof-0.16.2/lib/ruby-prof/task.rb0000644000175600017570000001026712766254554016576 0ustar pravipravi#!/usr/bin/env ruby # encoding: utf-8 require 'rake' require 'rake/testtask' require 'fileutils' module RubyProf # Define a task library for profiling unit tests with ruby-prof. # # All of the options provided by # the Rake:TestTask are supported except the loader # which is set to ruby-prof. For detailed information # please refer to the Rake:TestTask documentation. # # ruby-prof specific options include: # # output_dir - For each file specified an output # file with profile information will be # written to the output directory. # By default, the output directory is # called "profile" and is created underneath # the current working directory. # # printer - Specifies the output printer. Valid values include # :flat, :graph, :graph_html and :call_tree. # # min_percent - Methods that take less than the specified percent # will not be written out. # # Example: # # require 'ruby-prof/task' # # RubyProf::ProfileTask.new do |t| # t.test_files = FileList['test/test*.rb'] # t.output_dir = "c:/temp" # t.printer = :graph # t.min_percent = 10 # end # # If rake is invoked with a "TEST=filename" command line option, # then the list of test files will be overridden to include only the # filename specified on the command line. This provides an easy way # to run just one test. # # If rake is invoked with a "TESTOPTS=options" command line option, # then the given options are passed to the test process after a # '--'. This allows Test::Unit options to be passed to the test # suite. # # Examples: # # rake profile # run tests normally # rake profile TEST=just_one_file.rb # run just one test file. # rake profile TESTOPTS="-v" # run in verbose mode # rake profile TESTOPTS="--runner=fox" # use the fox test runner class ProfileTask < Rake::TestTask attr_accessor :output_dir attr_accessor :min_percent attr_accessor :printer def initialize(name = :profile) super(name) end # Create the tasks defined by this task lib. def define lib_path = @libs.join(File::PATH_SEPARATOR) desc "Profile" + (@name==:profile ? "" : " for #{@name}") task @name do create_output_directory @ruby_opts.unshift( "-I#{lib_path}" ) @ruby_opts.unshift( "-w" ) if @warning @ruby_opts.push("-S ruby-prof") @ruby_opts.push("--printer #{@printer}") @ruby_opts.push("--min_percent #{@min_percent}") file_list.each do |file_path| run_script(file_path) end end self end # Run script def run_script(script_path) run_code = '' RakeFileUtils.verbose(@verbose) do file_name = File.basename(script_path, File.extname(script_path)) case @printer when :flat, :graph, :call_tree file_name += ".txt" when :graph_html file_name += ".html" else file_name += ".txt" end output_file_path = File.join(output_directory, file_name) command_line = @ruby_opts.join(" ") + " --file=" + output_file_path + " " + script_path puts "ruby " + command_line # We have to catch the exeption to continue on. However, # the error message will have been output to STDERR # already by the time we get here so we don't have to # do that again begin ruby command_line rescue => e STDOUT << e << "\n" STDOUT.flush end puts "" puts "" end end def output_directory File.expand_path(@output_dir) end def create_output_directory if not File.exist?(output_directory) Dir.mkdir(output_directory) end end def clean_output_directory if File.exist?(output_directory) files = Dir.glob(output_directory + '/*') FileUtils.rm(files) end end def option_list # :nodoc: ENV['OPTIONS'] || @options.join(" ") || "" end end end ruby-prof-0.16.2/lib/ruby-prof/thread.rb0000644000175600017570000000202412766254554017073 0ustar pravipravimodule RubyProf class Thread def top_methods self.methods.select do |method_info| method_info.call_infos.detect(&:root?) end end def top_call_infos top_methods.map(&:call_infos).flatten.select(&:root?) end # This method detect recursive calls in the call tree of a given thread # It should be called only once for each thread def detect_recursion top_call_infos.each(&:detect_recursion) end def total_time self.top_methods.inject(0) do |sum, method_info| method_info.call_infos.each do |call_info| if call_info.parent.nil? sum += call_info.total_time end end sum end end def wait_time # wait_time, like self:time, is always method local # thus we need to sum over all methods and call infos self.methods.inject(0) do |sum, method_info| method_info.call_infos.each do |call_info| sum += call_info.wait_time end sum end end end end ruby-prof-0.16.2/lib/ruby-prof/compatibility.rb0000644000175600017570000001212512766254554020500 0ustar pravipravi# encoding: utf-8 # These methods are here for backwards compatability with previous RubyProf releases module RubyProf # Measurements def self.cpu_frequency Measure::CpuTime.frequency end def self.measure_allocations Measure::Allocations.measure end def self.measure_cpu_time Measure::CpuTime.measure end def self.measure_gc_runs Measure::GcRuns.measure end def self.measure_gc_time Measure::GcTime.measure end def self.measure_memory Measure::Memory.measure end def self.measure_process_time Measure::ProcessTime.measure end def self.measure_wall_time Measure::WallTime.measure end # call-seq: # measure_mode -> measure_mode # # Returns what ruby-prof is measuring. Valid values include: # # *RubyProf::WALL_TIME - Measure wall time using gettimeofday on Linx and GetLocalTime on Windows. This is default. # *RubyProf::PROCESS_TIME - Measure process time. It is implemented using the clock functions in the C Runtime library. # *RubyProf::CPU_TIME - Measure time using the CPU clock counter. This mode is only supported on Pentium or PowerPC platforms. # *RubyProf::ALLOCATIONS - Measure object allocations. This requires a patched Ruby interpreter. # *RubyProf::MEMORY - Measure memory size. This requires a patched Ruby interpreter. # *RubyProf::GC_RUNS - Measure number of garbage collections. This requires a patched Ruby interpreter. # *RubyProf::GC_TIME - Measure time spent doing garbage collection. This requires a patched Ruby interpreter.*/ def self.measure_mode @measure_mode ||= RubyProf::WALL_TIME end # call-seq: # measure_mode=value -> void # # Specifies what ruby-prof should measure. Valid values include: # # *RubyProf::WALL_TIME - Measure wall time using gettimeofday on Linx and GetLocalTime on Windows. This is default. # *RubyProf::PROCESS_TIME - Measure process time. It is implemented using the clock functions in the C Runtime library. # *RubyProf::CPU_TIME - Measure time using the CPU clock counter. This mode is only supported on Pentium or PowerPC platforms. # *RubyProf::ALLOCATIONS - Measure object allocations. This requires a patched Ruby interpreter. # *RubyProf::MEMORY - Measure memory size. This requires a patched Ruby interpreter. # *RubyProf::GC_RUNS - Measure number of garbage collections. This requires a patched Ruby interpreter. # *RubyProf::GC_TIME - Measure time spent doing garbage collection. This requires a patched Ruby interpreter.*/ def self.measure_mode=(value) @measure_mode = value end def self.measure_mode_string case measure_mode when WALL_TIME then "wall_time" when CPU_TIME then "cpu_time" when PROCESS_TIME then "process_time_time" when ALLOCATIONS then "allocations" when MEMORY then "memory" when GC_TIME then "gc_time" when GC_RUNS then "gc_runs" end end # call-seq: # exclude_threads -> exclude_threads # # Returns threads ruby-prof should exclude from profiling def self.exclude_threads @exclude_threads ||= Array.new end # call-seq: # exclude_threads= -> void # # Specifies what threads ruby-prof should exclude from profiling def self.exclude_threads=(value) @exclude_threads = value end # Profiling def self.start_script(script) start load script end def self.start ensure_not_running! @profile = Profile.new(measure_mode: measure_mode, exclude_threads: exclude_threads) enable_gc_stats_if_needed @profile.start end def self.pause ensure_running! disable_gc_stats_if_needed @profile.pause end def self.running? if defined?(@profile) and @profile @profile.running? else false end end def self.resume ensure_running! enable_gc_stats_if_needed @profile.resume end def self.stop ensure_running! result = @profile.stop disable_gc_stats_if_needed @profile = nil result end # Profile a block def self.profile(options = {}, &block) ensure_not_running! gc_stat_was_enabled = enable_gc_stats_if_needed options = { measure_mode: measure_mode, exclude_threads: exclude_threads }.merge!(options) result = Profile.profile(options, &block) disable_gc_stats_if_needed(gc_stat_was_enabled) result end private def self.ensure_running! raise(RuntimeError, "RubyProf.start was not yet called") unless running? end def self.ensure_not_running! raise(RuntimeError, "RubyProf is already running") if running? end # for GC.allocated_size to work GC statistics should be enabled def self.enable_gc_stats_if_needed if measure_mode_requires_gc_stats_enabled? @gc_stat_was_enabled = GC.enable_stats end end def self.disable_gc_stats_if_needed(was_enabled=nil) was_enabled ||= defined?(@gc_stat_was_enabled) && @gc_stat_was_enabled GC.disable_stats if measure_mode_requires_gc_stats_enabled? && !was_enabled end def self.measure_mode_requires_gc_stats_enabled? GC.respond_to?(:enable_stats) && [RubyProf::MEMORY, RubyProf::GC_TIME, RubyProf::GC_RUNS].include?(measure_mode) end end ruby-prof-0.16.2/lib/ruby-prof/assets/0000755000175600017570000000000012766254554016603 5ustar pravipraviruby-prof-0.16.2/lib/ruby-prof/assets/call_stack_printer.png0000644000175600017570000000070612766254554023157 0ustar pravipraviPNG  IHDR sBITOoPLTE||x{{|쬶䪶||{ֳ%tRNSUUUV9 pHYs  ~tEXtSoftwareAdobe Fireworks CS6輲IDAT=0 ࡰ!tu/\tTY?ȳ^4v/grCmD)灨5vj0y"BDS@Q ruby-prof-0.16.2/lib/ruby-prof/assets/call_stack_printer.js.html0000644000175600017570000002220112766254554023744 0ustar pravipraviruby-prof-0.16.2/test/0000755000175600017570000000000012766254554013565 5ustar pravipraviruby-prof-0.16.2/test/issue137_test.rb0000755000175600017570000000272312766254554016543 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # issue 137 is about correctly attributing time of recursive children class RecursiveChildrenTest < TestCase class SlowClass def time_sink 1234567890 ** 100 == 0 end end class SlowSearcher def do_find(slow_objects) slow_objects.find(&:time_sink) end end class MainClass def self.main_method slow_objects = [SlowClass.new] * 100_000 slow_searcher = SlowSearcher.new slow_searcher.do_find(slow_objects) end end include PrinterTestHelper def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_simple result = RubyProf.profile do # make array each recursive [1].each do MainClass.main_method end end # methods = result.threads.first.methods.sort.reverse printer = RubyProf::GraphPrinter.new(result) buffer = '' printer.print(StringIO.new(buffer)) puts buffer if ENV['SHOW_RUBY_PROF_PRINTER_OUTPUT'] == "1" parsed_output = MetricsArray.parse(buffer) assert( enum_find = parsed_output.metrics_for("Enumerable#find") ) assert( array_each = enum_find.child("Array#each") ) assert_operator enum_find.metrics.total, :>=, array_each.total assert_operator enum_find.metrics.total, :>, 0 assert_in_delta enum_find.metrics.total, array_each.total, 0.02 end end ruby-prof-0.16.2/test/call_info_test.rb0000755000175600017570000000475612766254554017116 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class CallInfoTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end # def test_clone # result = RubyProf.profile do # RubyProf::C1.hello # end # # method = result.threads.first.top_methods.first # call_info = method.call_infos.first # call_info_clone = call_info.clone # ## assert_equal(call_info.target, call_info_clone.target) # assert_equal(call_info.total_time, call_info_clone.total_time) # end def test_merge result1 = RubyProf.profile do RubyProf::C1.hello end methods = result1.threads.first.methods.sort.reverse assert_equal(3, methods.length) assert_equal('CallInfoTest#test_merge', methods[0].full_name) assert_in_delta(0.1, methods[0].total_time, 0.01) assert_in_delta(0, methods[0].wait_time, 0.01) assert_in_delta(0, methods[0].self_time, 0.01) assert_equal(1, methods[0].called) assert_equal('#hello', methods[1].full_name) assert_in_delta(0.1, methods[1].total_time, 0.01) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.01) assert_equal(1, methods[1].called) assert_equal('Kernel#sleep', methods[2].full_name) assert_in_delta(0.1, methods[2].total_time, 0.01) assert_in_delta(0, methods[2].wait_time, 0.01) assert_in_delta(0.1, methods[2].self_time, 0.01) assert_equal(1, methods[2].called) RubyProf.profile do RubyProf::C1.hello end # Merge the trees methods = result1.threads.first.methods.sort.reverse assert_equal(3, methods.length) assert_equal('CallInfoTest#test_merge', methods[0].full_name) assert_in_delta(0.1, methods[0].total_time, 0.01) assert_in_delta(0, methods[0].wait_time, 0.01) assert_in_delta(0, methods[0].self_time, 0.01) assert_equal(1, methods[0].called) assert_equal('#hello', methods[1].full_name) assert_in_delta(0.1, methods[1].total_time, 0.01) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.01) assert_equal(1, methods[1].called) assert_equal('Kernel#sleep', methods[2].full_name) assert_in_delta(0.1, methods[2].total_time, 0.01) assert_in_delta(0, methods[2].wait_time, 0.01) assert_in_delta(0.1, methods[2].self_time, 0.01) assert_equal(1, methods[2].called) end end ruby-prof-0.16.2/test/measure_gc_time_test.rb0000755000175600017570000000141012766254554020300 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureGCTimeTest < TestCase include MemoryTestHelper def test_gc_time_mode RubyProf::measure_mode = RubyProf::GC_TIME assert_equal(RubyProf::GC_TIME, RubyProf::measure_mode) end def test_gc_time_enabled_defined assert(defined?(RubyProf::GC_TIME_ENABLED)) end if RubyProf::GC_TIME_ENABLED def test_gc_time RubyProf::measure_mode = RubyProf::GC_TIME RubyProf.enable_gc_stats_if_needed t = RubyProf.measure_gc_time assert_kind_of Float, t GC.start u = RubyProf.measure_gc_time assert u > t, [t, u].inspect memory_test_helper ensure RubyProf.disable_gc_stats_if_needed end end end ruby-prof-0.16.2/test/dynamic_method_test.rb0000755000175600017570000000237412766254554020146 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path("../test_helper", __FILE__) class DynamicMethodTest < TestCase class FruitMedley define_method(:apple) do sleep(0.1) "I'm a peach" end define_method(:orange) do sleep(0.2) "I'm an orange" end [:banana, :peach].each_with_index do |fruit,i| define_method(fruit) do sleep(i == 0 ? 0.3 : 0.4) "I'm a #{fruit}" end end end def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_dynamic_method medley = FruitMedley.new result = RubyProf.profile do medley.apple medley.orange medley.banana medley.peach end # RubyProf::FlatPrinter.new(result).print(STDOUT) methods = result.threads.first.methods.sort.reverse expected_method_names = %w( DynamicMethodTest#test_dynamic_method Kernel#sleep DynamicMethodTest::FruitMedley#peach DynamicMethodTest::FruitMedley#banana DynamicMethodTest::FruitMedley#orange DynamicMethodTest::FruitMedley#apple Symbol#to_s ) assert_equal expected_method_names.join("\n"), methods.map(&:full_name).join("\n") end end ruby-prof-0.16.2/test/test_helper.rb0000644000175600017570000001262112766254554016432 0ustar pravipravi# encoding: UTF-8 # Make RubyMine happy require "rubygems" gem "minitest" if ENV["RM_INFO"] || ENV["TEAMCITY_VERSION"] if RUBY_PLATFORM =~ /(win32|mingw)/ gem "win32console" end gem "minitest-reporters" require 'minitest/reporters' MiniTest::Reporters.use! end require "minitest/pride" if RUBY_VERSION == "1.9.3" # To make testing/debugging easier, test within this source tree versus an installed gem dir = File.dirname(__FILE__) root = File.expand_path(File.join(dir, '..')) lib = File.expand_path(File.join(root, 'lib')) ext = File.expand_path(File.join(root, 'ext', 'ruby_prof')) $LOAD_PATH << lib $LOAD_PATH << ext require 'ruby-prof' require 'minitest/autorun' class TestCase < Minitest::Test # I know this sucks, but ... def assert_nothing_raised(*) yield end def before_setup # make sure to exclude all threads except the one running the test # minitest allocates a thread pool and they would otherwise show # up in the profile data, breaking tests randomly RubyProf.exclude_threads = Thread.list.select{|t| t != Thread.current} end def after_teardown # reset exclude threads after testing RubyProf.exclude_threads = nil end end require File.expand_path('../prime', __FILE__) # Some classes used in measurement tests module RubyProf class C1 def C1.hello sleep(0.1) end def hello sleep(0.2) end end module M1 def hello sleep(0.3) end end class C2 include M1 extend M1 end class C3 def hello sleep(0.4) end end module M4 def hello sleep(0.5) end end module M5 include M4 def goodbye hello end end class C6 include M5 def test goodbye end end class C7 def self.busy_wait t = Time.now.to_f while Time.now.to_f - t < 0.1; end end def self.sleep_wait sleep 0.1 end def busy_wait t = Time.now.to_f while Time.now.to_f - t < 0.2; end end def sleep_wait sleep 0.2 end end module M7 def busy_wait t = Time.now.to_f while Time.now.to_f - t < 0.3; end end def sleep_wait sleep 0.3 end end class C8 include M7 extend M7 end def self.ruby_major_version match = RUBY_VERSION.match(/(\d)\.(\d)/) return Integer(match[1]) end def self.ruby_minor_version match = RUBY_VERSION.match(/(\d)\.(\d)/) return Integer(match[2]) end def self.parent_object if ruby_major_version == 1 && ruby_minor_version == 8 Object else BasicObject end end def self.ruby_2? ruby_major_version == 2 end # store printer output in this directory def self.tmpdir File.expand_path('../../tmp', __FILE__) end end module MemoryTestHelper def memory_test_helper result = RubyProf.profile {Array.new} total = result.threads.first.methods.inject(0) { |sum, m| sum + m.total_time } assert(total < 1_000_000, 'Total should not have subtract overflow error') total end end module PrinterTestHelper Metrics = Struct.new(:name, :total, :self_t, :wait, :child, :calls) class Metrics def pp "%s[total: %.2f, self: %.2f, wait: %.2f, child: %.2f, calls: %s]" % [name, total, self_t, wait, child, calls] end end Entry = Struct.new(:total_p, :self_p, :metrics, :parents, :children) class Entry def child(name) children.detect{|m| m.name == name} end def parent(name) parents.detect{|m| m.name == name} end def pp res = "" res << "NODE (total%%: %.2f, self%%: %.2f) %s\n" % [total_p, self_p, metrics.pp] res << " PARENTS:\n" parents.each {|m| res << " " + m.pp << "\n"} res << " CHILDREN:\n" children.each {|m| res << " " + m.pp << "\n"} res end end class MetricsArray < Array def metrics_for(name) detect {|e| e.metrics.name == name} end def pp(io = STDOUT) entries = map do |e| begin e.pp rescue puts $!.message + e.inspect "" end end io.puts entries.join("--------------------------------------------------\n") end def self.parse(str) res = new entry = nil relatives = [] state = :preamble str.each_line do |l| line = l.chomp.strip if line =~ /-----/ if state == :preamble state = :parsing_parents entry = Entry.new elsif state == :parsing_parents entry = Entry.new elsif state == :parsing_children entry.children = relatives res << entry entry = Entry.new relatives = [] state = :parsing_parents end elsif line =~ /^\s*$/ || line =~ /indicates recursively called methods/ next elsif state != :preamble elements = line.split(/\s+/) method = elements.pop numbers = elements[0..-2].map(&:to_f) metrics = Metrics.new(method, *numbers[-4..-1], elements[-1]) if numbers.size == 6 entry.metrics = metrics entry.total_p = numbers[0] entry.self_p = numbers[1] entry.parents = relatives entry.children = relatives = [] state = :parsing_children res << entry else relatives << metrics end end end res end end end ruby-prof-0.16.2/test/call_info_visitor_test.rb0000755000175600017570000000145312766254554020664 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class CallInfoVisitorTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_visit result = RubyProf.profile do RubyProf::C1.hello end visitor = RubyProf::CallInfoVisitor.new(result.threads.first.top_call_infos) method_names = Array.new visitor.visit do |call_info, event| method_names << call_info.target.full_name if event == :enter end assert_equal(3, method_names.length) assert_equal("CallInfoVisitorTest#test_visit", method_names[0]) assert_equal("#hello", method_names[1]) assert_equal("Kernel#sleep", method_names[2]) end end ruby-prof-0.16.2/test/printers_test.rb0000755000175600017570000001765112766254554017034 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) require 'stringio' require 'fileutils' # -- Tests ---- class PrintersTest < TestCase def setup # WALL_TIME so we can use sleep in our test and get same measurements on linux and windows RubyProf::measure_mode = RubyProf::WALL_TIME @result = RubyProf.profile do run_primes(1000, 5000) end end def test_printers assert_nothing_raised do output = ENV['SHOW_RUBY_PROF_PRINTER_OUTPUT'] == "1" ? STDOUT : StringIO.new('') printer = RubyProf::CallInfoPrinter.new(@result) printer.print(output) printer = RubyProf::CallTreePrinter.new(@result) printer.print() printer = RubyProf::FlatPrinter.new(@result) printer.print(output) printer = RubyProf::FlatPrinterWithLineNumbers.new(@result) printer.print(output) printer = RubyProf::GraphHtmlPrinter.new(@result) printer.print(output) printer = RubyProf::GraphPrinter.new(@result) printer.print(output) end end def test_print_to_files assert_nothing_raised do output_dir = 'examples2' if ENV['SAVE_NEW_PRINTER_EXAMPLES'] output_dir = 'examples' end FileUtils.mkdir_p output_dir printer = RubyProf::DotPrinter.new(@result) File.open("#{output_dir}/graph.dot", "w") {|f| printer.print(f)} printer = RubyProf::CallStackPrinter.new(@result) File.open("#{output_dir}/stack.html", "w") {|f| printer.print(f, :application => "primes")} printer = RubyProf::MultiPrinter.new(@result) printer.print(:path => "#{output_dir}", :profile => "multi", :application => "primes") for file in ['graph.dot', 'multi.flat.txt', 'multi.graph.html', "multi.callgrind.out.#{$$}", 'multi.stack.html', 'stack.html'] existant_file = output_dir + '/' + file assert File.size(existant_file) > 0 end end end def test_flat_string output = helper_test_flat_string(RubyProf::FlatPrinter) refute_match(/prime.rb/, output) end def helper_test_flat_string(klass) output = '' printer = klass.new(@result) printer.print(output) assert_match(/Thread ID: -?\d+/i, output) assert_match(/Fiber ID: -?\d+/i, output) assert_match(/Total: \d+\.\d+/i, output) assert_match(/Object#run_primes/i, output) output end def test_flat_string_with_numbers output = helper_test_flat_string RubyProf::FlatPrinterWithLineNumbers assert_match(/prime.rb/, output) refute_match(/ruby_runtime:0/, output) assert_match(/called from/, output) # should combine common parents # 1.9 inlines it's Fixnum#- so we don't see as many assert_equal(2, output.scan(/Object#is_prime/).length) refute_match(/\.\/test\/prime.rb/, output) # don't use relative paths end def test_graph_html_string output = '' printer = RubyProf::GraphHtmlPrinter.new(@result) printer.print(output) assert_match(/DTD HTML 4\.01/i, output) assert_match( %r{Total Time}i, output) assert_match(/Object#run_primes/i, output) end def test_graph_string output = '' printer = RubyProf::GraphPrinter.new(@result) printer.print(output) assert_match(/Thread ID: -?\d+/i, output) assert_match(/Fiber ID: -?\d+/i, output) assert_match(/Total Time: \d+\.\d+/i, output) assert_match(/Object#run_primes/i, output) end def test_call_tree_string printer = RubyProf::CallTreePrinter.new(@result) printer.print(:profile => "lolcat", :path => RubyProf.tmpdir) main_output_file_name = File.join(RubyProf.tmpdir, "lolcat.callgrind.out.#{$$}") assert(File.exist?(main_output_file_name)) output = File.read(main_output_file_name) assert_match(/fn=Object#find_primes/i, output) assert_match(/events: wall_time/i, output) refute_match(/d\d\d\d\d\d/, output) # old bug looked [in error] like Object::run_primes(d5833116) end def do_nothing start = Time.now while(Time.now == start) end end def test_all_with_small_percentiles result = RubyProf.profile do sleep 2 do_nothing end # RubyProf::CallTreePrinter doesn't "do" a min_percent # RubyProf::FlatPrinter only outputs if self time > percent... # RubyProf::FlatPrinterWithLineNumbers same for klass in [ RubyProf::GraphPrinter, RubyProf::GraphHtmlPrinter] printer = klass.new(result) out = '' printer.print(out, :min_percent => 0.00000001) assert_match(/do_nothing/, out) end end def test_flat_result_sorting_by_self_time_is_default printer = RubyProf::FlatPrinter.new(@result) printer.print(output = '') self_times = flat_output_nth_column_values(output, 3) assert_sorted self_times end def test_flat_result_sorting printer = RubyProf::FlatPrinter.new(@result) sort_method_with_column_number = {:total_time => 2, :self_time => 3, :wait_time => 4, :children_time => 5} sort_method_with_column_number.each_pair do |sort_method, n| printer.print(output = '', :sort_method => sort_method) times = flat_output_nth_column_values(output, n) assert_sorted times end end def test_flat_result_with_line_numbers_sorting_by_self_time_is_default printer = RubyProf::FlatPrinterWithLineNumbers.new(@result) printer.print(output = '') self_times = flat_output_nth_column_values(output, 3) assert_sorted self_times end def test_flat_with_line_numbers_result_sorting printer = RubyProf::FlatPrinterWithLineNumbers.new(@result) sort_method_with_column_number = {:total_time => 2, :self_time => 3, :wait_time => 4, :children_time => 5} sort_method_with_column_number.each_pair do |sort_method, n| printer.print(output = '', :sort_method => sort_method) times = flat_output_nth_column_values(output, n) assert_sorted times end end def test_graph_result_sorting_by_total_time_is_default printer = RubyProf::GraphPrinter.new(@result) printer.print(output = '') total_times = graph_output_nth_column_values(output, 3) assert_sorted total_times end def test_graph_results_sorting printer = RubyProf::GraphPrinter.new(@result) sort_method_with_column_number = {:total_time => 3, :self_time => 4, :wait_time => 5, :children_time => 6} sort_method_with_column_number.each_pair do |sort_method, n| printer.print(output = '', :sort_method => sort_method) times = graph_output_nth_column_values(output, n) assert_sorted times end end def test_graph_html_result_sorting_by_total_time_is_default printer = RubyProf::GraphHtmlPrinter.new(@result) printer.print(output = '') total_times = graph_html_output_nth_column_values(output, 3) assert_sorted total_times end def test_graph_html_result_sorting printer = RubyProf::GraphHtmlPrinter.new(@result) sort_method_with_column_number = {:total_time => 3, :self_time => 4, :wait_time => 5, :children_time => 6} sort_method_with_column_number.each_pair do |sort_method, n| printer.print(output = '', :sort_method => sort_method) times = graph_html_output_nth_column_values(output, n) assert_sorted times end end private def flat_output_nth_column_values(output, n) only_method_calls = output.split("\n").select { |line| line =~ /^ +\d+/ } only_method_calls.collect { |line| line.split(/ +/)[n] } end def graph_output_nth_column_values(output, n) only_root_calls = output.split("\n").select { |line| line =~ /^ +[\d\.]+%/ } only_root_calls.collect { |line| line.split(/ +/)[n] } end def graph_html_output_nth_column_values(output, n) only_root_calls = output.split('') only_root_calls.delete_at(0) only_root_calls.collect {|line| line.scan(/[\d\.]+/)[n - 1] } end def assert_sorted array array = array.map{|n| n.to_f} # allow for > 10s times to sort right, since lexographically 4.0 > 10.0 assert_equal array, array.sort.reverse, "Array #{array.inspect} is not sorted" end end ruby-prof-0.16.2/test/duplicate_names_test.rb0000755000175600017570000000130712766254554020312 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class DuplicateNames < TestCase def test_names result = RubyProf::profile do str = %{module Foo; class Bar; def foo; end end end} eval str Foo::Bar.new.foo DuplicateNames.class_eval {remove_const :Foo} eval str Foo::Bar.new.foo DuplicateNames.class_eval {remove_const :Foo} eval str Foo::Bar.new.foo end # There should be 3 foo methods methods = result.threads.first.methods.sort.reverse methods = methods.select do |method| method.full_name == 'DuplicateNames::Foo::Bar#foo' end assert_equal(3, methods.length) end end ruby-prof-0.16.2/test/method_elimination_test.rb0000755000175600017570000000451112766254554021025 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Test data # A # / \ # B C # \ # B module MethodElimination def self.a 1.times {|i| c} end def self.b sleep 0.1 end def self.c 1.times {|i| b} end end class MethodEliminationTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_setting_parent result = RubyProf.profile do 1000.times { 1+1 } end method_infos = result.threads.first.methods.sort.reverse assert(m1 = method_infos[0]) assert(c1 = m1.call_infos.first) assert_nil(c1.parent) end def test_methods_can_be_eliminated RubyProf.start 5.times {MethodElimination.a} result = RubyProf.stop methods = result.threads.first.methods.sort.reverse assert_equal(6, methods.count) assert_equal('MethodEliminationTest#test_methods_can_be_eliminated', methods[0].full_name) assert_equal('Integer#times', methods[1].full_name) assert_equal('#a', methods[2].full_name) assert_equal('#c', methods[3].full_name) assert_equal('#b', methods[4].full_name) assert_equal('Kernel#sleep', methods[5].full_name) result.eliminate_methods!([/Integer#times/]) methods = result.threads.first.methods.sort.reverse assert_equal(5, methods.count) assert_equal('MethodEliminationTest#test_methods_can_be_eliminated', methods[0].full_name) assert_equal('#a', methods[1].full_name) assert_equal('#c', methods[2].full_name) assert_equal('#b', methods[3].full_name) assert_equal('Kernel#sleep', methods[4].full_name) end private def assert_method_has_been_eliminated(result, eliminated_method) result.threads.each do |thread| thread.methods.each do |method| method.call_infos.each do |ci| assert(ci.target != eliminated_method, "broken self") assert(ci.parent.target != eliminated_method, "broken parent") if ci.parent ci.children.each do |callee| assert(callee.target != eliminated_method, "broken kid") end end end end end end ruby-prof-0.16.2/test/singleton_test.rb0000755000175600017570000000132212766254554017154 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) require 'timeout' # -- Test for bug [#5657] # http://rubyforge.org/tracker/index.php?func=detail&aid=5657&group_id=1814&atid=7060 class A attr_accessor :as def initialize @as = [] class << @as def <<(an_a) super end end end def <<(an_a) @as << an_a end end class SingletonTest < TestCase def test_singleton result = RubyProf.profile do a = A.new a << :first_thing assert_equal(1, a.as.size) end printer = RubyProf::FlatPrinter.new(result) output = ENV['SHOW_RUBY_PROF_PRINTER_OUTPUT'] == "1" ? STDOUT : '' printer.print(output) end end ruby-prof-0.16.2/test/pause_resume_test.rb0000755000175600017570000001052712766254554017656 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class PauseResumeTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_pause_resume # Measured RubyProf.start RubyProf::C1.hello # Not measured RubyProf.pause sleep 1 RubyProf::C1.hello # Measured RubyProf.resume RubyProf::C1.hello result = RubyProf.stop # Length should be 3: # PauseResumeTest#test_pause_resume # #hello # Kernel#sleep methods = result.threads.first.methods.sort_by {|method_info| method_info.full_name} # remove methods called by pause/resume called_methods = ['Array#include?', 'Fixnum#==', 'Kernel#respond_to?', 'Kernel#respond_to_missing?'] methods.reject!{|m| called_methods.include?(m.full_name) } # TODO: fix pause/resume to not include those methods in the first place assert_equal(3, methods.length) # Check the names assert_equal('#hello', methods[0].full_name) assert_equal('Kernel#sleep', methods[1].full_name) assert_equal('PauseResumeTest#test_pause_resume', methods[2].full_name) # Check times assert_in_delta(0.2, methods[0].total_time, 0.02) assert_in_delta(0, methods[0].wait_time, 0.02) assert_in_delta(0, methods[0].self_time, 0.02) assert_in_delta(0.2, methods[1].total_time, 0.02) assert_in_delta(0, methods[1].wait_time, 0.02) assert_in_delta(0.2, methods[1].self_time, 0.02) assert_in_delta(0.2, methods[2].total_time, 0.02) assert_in_delta(0, methods[2].wait_time, 0.02) assert_in_delta(0, methods[2].self_time, 0.02) end # pause/resume in the same frame def test_pause_resume_1 profile = RubyProf::Profile.new profile.start method_1a profile.pause method_1b profile.resume method_1c result = profile.stop assert_in_delta(0.6, result.threads[0].methods.select{|m| m.full_name =~ /test_pause_resume_1$/}[0].total_time, 0.05) end def method_1a; sleep 0.2 end def method_1b; sleep 1 end def method_1c; sleep 0.4 end # pause in parent frame, resume in child def test_pause_resume_2 profile = RubyProf::Profile.new profile.start method_2a profile.pause sleep 0.5 method_2b(profile) result = profile.stop assert_in_delta(0.6, result.threads[0].methods.select{|m| m.full_name =~ /test_pause_resume_2$/}[0].total_time, 0.05) end def method_2a; sleep 0.2 end def method_2b(profile); sleep 0.5; profile.resume; sleep 0.4 end # pause in child frame, resume in parent def test_pause_resume_3 profile = RubyProf::Profile.new profile.start method_3a(profile) sleep 0.5 profile.resume method_3b result = profile.stop assert_in_delta(0.6, result.threads[0].methods.select{|m| m.full_name =~ /test_pause_resume_3$/}[0].total_time, 0.05) end def method_3a(profile); sleep 0.2; profile.pause; sleep 0.5 end def method_3b; sleep 0.4 end def test_pause_seq profile = RubyProf::Profile.new profile.start ; assert !profile.paused? profile.pause ; assert profile.paused? profile.resume; assert !profile.paused? profile.pause ; assert profile.paused? profile.pause ; assert profile.paused? profile.resume; assert !profile.paused? profile.resume; assert !profile.paused? profile.stop ; assert !profile.paused? end def test_pause_block profile = RubyProf::Profile.new profile.start profile.pause assert profile.paused? times_block_invoked = 0 retval= profile.resume{ times_block_invoked += 1 120 + times_block_invoked } assert_equal 1, times_block_invoked assert profile.paused? assert_equal 121, retval, "resume() should return the result of the given block." profile.stop end def test_pause_block_with_error profile = RubyProf::Profile.new profile.start profile.pause assert profile.paused? begin profile.resume{ raise } flunk 'Exception expected.' rescue assert profile.paused? end profile.stop end def test_resume_when_not_paused profile = RubyProf::Profile.new profile.start ; assert !profile.paused? profile.resume; assert !profile.paused? profile.stop ; assert !profile.paused? end end ruby-prof-0.16.2/test/stack_test.rb0000755000175600017570000001046412766254554016266 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Test data # A # / \ # B C # \ # B class StackClass def a sleep 1 b c end def b sleep 2 end def c sleep 3 b end end class StackTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_call_sequence c = StackClass.new result = RubyProf.profile do c.a end # Length should be 5: # StackTest#test_call_sequence # StackClass#a # Kernel#sleep # StackClass#c # StackClass#b methods = result.threads.first.methods.sort.reverse assert_equal(5, methods.length) # Check StackTest#test_call_sequence method = methods[0] assert_equal('StackTest#test_call_sequence', method.full_name) assert_equal(1, method.called) assert_in_delta(8, method.total_time, 0.25) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(8, method.children_time, 0.25) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StackTest#test_call_sequence', call_info.call_sequence) assert_equal(1, call_info.children.length) # Check StackClass#a method = methods[1] assert_equal('StackClass#a', method.full_name) assert_equal(1, method.called) assert_in_delta(8, method.total_time, 0.15) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(8, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StackTest#test_call_sequence->StackClass#a', call_info.call_sequence) assert_equal(3, call_info.children.length) # Check Kernel#sleep method = methods[2] assert_equal('Kernel#sleep', method.full_name) assert_equal(4, method.called) assert_in_delta(8, method.total_time, 0.05) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(8, method.self_time, 0.05) assert_in_delta(0, method.children_time, 0.05) assert_equal(4, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StackTest#test_call_sequence->StackClass#a->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) call_info = method.call_infos[1] assert_equal('StackTest#test_call_sequence->StackClass#a->StackClass#b->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) call_info = method.call_infos[2] assert_equal('StackTest#test_call_sequence->StackClass#a->StackClass#c->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) call_info = method.call_infos[3] assert_equal('StackTest#test_call_sequence->StackClass#a->StackClass#c->StackClass#b->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) # Check StackClass#c method = methods[3] assert_equal('StackClass#c', method.full_name) assert_equal(1, method.called) assert_in_delta(5, method.total_time, 0.05) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(5, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StackTest#test_call_sequence->StackClass#a->StackClass#c', call_info.call_sequence) assert_equal(2, call_info.children.length) # Check StackClass#b method = methods[4] assert_equal('StackClass#b', method.full_name) assert_equal(2, method.called) assert_in_delta(4, method.total_time, 0.05) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(4, method.children_time, 0.05) assert_equal(2, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StackTest#test_call_sequence->StackClass#a->StackClass#b', call_info.call_sequence) assert_equal(1, call_info.children.length) call_info = method.call_infos[1] assert_equal('StackTest#test_call_sequence->StackClass#a->StackClass#c->StackClass#b', call_info.call_sequence) assert_equal(1, call_info.children.length) end end ruby-prof-0.16.2/test/measure_allocations_test.rb0000755000175600017570000000122612766254554021206 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureAllocationsTest < TestCase def test_allocations_mode RubyProf::measure_mode = RubyProf::ALLOCATIONS assert_equal(RubyProf::ALLOCATIONS, RubyProf::measure_mode) end def test_allocations_enabled_defined assert(defined?(RubyProf::ALLOCATIONS_ENABLED)) end if RubyProf::ALLOCATIONS_ENABLED def test_allocations t = RubyProf.measure_allocations refute_empty("a" + "b") u = RubyProf.measure_allocations assert_kind_of Integer, t assert_kind_of Integer, u assert_operator t, :<, u end end end ruby-prof-0.16.2/test/printing_recursive_graph_test.rb0000755000175600017570000001177412766254554022270 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) require 'stringio' require 'fileutils' # --- code to be tested --- module PRGT extend self def f(n) n.times { sleep 0.1 } end def g(n) n.times { sleep 0.2 } end def run 2.times { f(2); g(4) } end end # --- expected test output --- =begin Measure Mode: wall_time Thread ID: 70238775664960 Fiber ID: 70238784046840 Total Time: 2.040249824523926 Sort by: total_time %total %self total self wait child calls Name -------------------------------------------------------------------------------- 100.00% 0.00% 2.040 0.000 0.000 2.040 1 PrintingRecursiveGraphTest#setup 2.040 0.000 0.000 2.040 1/1 PRGT#run -------------------------------------------------------------------------------- 2.040 0.000 0.000 2.040 1/1 PrintingRecursiveGraphTest#setup 100.00% 0.00% 2.040 0.000 0.000 2.040 1 PRGT#run 2.040 0.000 0.000 2.040 1/5 Integer#times -------------------------------------------------------------------------------- 0.409 0.000 0.000 0.409 2/5 Prgt#f 1.631 0.000 0.000 1.631 2/5 PRGT#g 2.040 0.000 0.000 2.040 1/5 PRGT#run 100.00% 0.00% 2.040 0.000 0.000 2.040 5 *Integer#times 2.040 2.040 0.000 0.000 12/12 Kernel#sleep 1.631 0.000 0.000 1.631 2/2 PRGT#g 0.409 0.000 0.000 0.409 2/2 PRGT#f -------------------------------------------------------------------------------- 2.040 2.040 0.000 0.000 12/12 Integer#times 99.99% 99.99% 2.040 2.040 0.000 0.000 12 Kernel#sleep -------------------------------------------------------------------------------- 1.631 0.000 0.000 1.631 2/2 Integer#times 79.94% 0.00% 1.631 0.000 0.000 1.631 2 PRGT#g 1.631 0.000 0.000 1.631 2/5 Integer#times -------------------------------------------------------------------------------- 0.409 0.000 0.000 0.409 2/2 Integer#times 20.05% 0.00% 0.409 0.000 0.000 0.409 2 PRGT#f 0.409 0.000 0.000 0.409 2/5 Integer#times * indicates recursively called methods =end class PrintingRecursiveGraphTest < TestCase include PrinterTestHelper def setup # WALL_TIME so we can use sleep in our test and get same measurements on linux and windows RubyProf::measure_mode = RubyProf::WALL_TIME @result = RubyProf.profile do PRGT.run end end def test_printing_rescursive_graph printer = RubyProf::GraphPrinter.new(@result) buffer = '' printer.print(StringIO.new(buffer)) puts buffer if ENV['SHOW_RUBY_PROF_PRINTER_OUTPUT'] == "1" parsed_output = MetricsArray.parse(buffer) assert( integer_times = parsed_output.metrics_for("*Integer#times") ) actual_parents = integer_times.parents.map(&:name) expected_parents = %w(PRGT#f PRGT#g PRGT#run) assert_equal expected_parents, actual_parents actual_children = integer_times.children.map(&:name) expected_children = %w(Kernel#sleep PRGT#g PRGT#f) assert_equal expected_children, actual_children assert( fp = integer_times.parent("PRGT#f") ) assert_in_delta(fp.total, fp.child, 0.01) assert_equal("2/5", fp.calls) assert( gp = integer_times.parent("PRGT#g") ) assert_in_delta(gp.total, gp.child, 0.01) assert_equal("2/5", gp.calls) assert( rp = integer_times.parent("PRGT#run") ) assert_in_delta(rp.total, rp.child, 0.01) assert_equal("1/5", rp.calls) assert_in_delta(4*fp.total, gp.total, 0.05) assert_in_delta(fp.total + gp.total, rp.total, 0.05) assert_in_delta(integer_times.metrics.total, rp.total, 0.05) assert( fc = integer_times.child("PRGT#f") ) assert_in_delta(fc.total, fc.child, 0.01) assert_equal("2/2", fc.calls) assert( gc = integer_times.child("PRGT#g") ) assert_in_delta(gc.total, gc.child, 0.01) assert_equal("2/2", gc.calls) assert( ks = integer_times.child("Kernel#sleep") ) assert_in_delta(ks.total, ks.self_t, 0.01) assert_equal("12/12", ks.calls) assert_in_delta(4*fc.total, gc.total, 0.05) assert_in_delta(fp.total + gc.total, ks.total, 0.05) assert_in_delta(integer_times.metrics.total, ks.total, 0.05) end end ruby-prof-0.16.2/test/recursive_test.rb0000755000175600017570000001727712766254554017201 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) module SimpleRecursion # Simple recursive test def simple(n) sleep(1) n -= 1 return if n == 0 simple(n) end # More complicated recursive test def render_partial(i) sleep(1) case i when 0 render_partial(10) when 1 2.times do |j| render_partial(j + 10) end end end def render 2.times do |i| render_partial(i) end end end # -- Tests ---- class RecursiveTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end include SimpleRecursion def test_simple result = RubyProf.profile do simple(2) end # Remove Fixnum+, Fixnum== for less than Ruby 1.9 result.eliminate_methods!(%w(Fixnum#== Fixnum#-)) methods = result.threads.first.methods.sort.reverse assert_equal(3, methods.length) # Method 0: RecursiveTest#test_simple method = methods[0] assert_equal('RecursiveTest#test_simple', method.full_name) assert_equal(1, method.called) assert_in_delta(2, method.total_time, 0.1) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(2, method.children_time, 0.1) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert(!call_info.recursive) assert_equal('RecursiveTest#test_simple', call_info.call_sequence) assert_equal(1, call_info.children.length) # Method 1: SimpleRecursion#simple method = methods[1] assert_equal('SimpleRecursion#simple', method.full_name) assert_equal(2, method.called) assert_in_delta(2, method.total_time, 0.1) assert_in_delta(0, method.self_time, 0.1) assert_in_delta(0, method.wait_time, 0.1) assert_in_delta(2, method.children_time, 0.1) assert_equal(2, method.call_infos.length) call_info = method.call_infos.first assert_equal(2, call_info.children.length) assert_equal('RecursiveTest#test_simple->SimpleRecursion#simple', call_info.call_sequence) assert(!call_info.recursive) call_info = method.call_infos.last assert_equal(1, call_info.children.length) assert_equal('RecursiveTest#test_simple->SimpleRecursion#simple->SimpleRecursion#simple', call_info.call_sequence) assert(call_info.recursive) method = methods[2] assert_equal('Kernel#sleep', method.full_name) assert_equal(2, method.called) assert_in_delta(2, method.total_time, 0.1) assert_in_delta(2, method.self_time, 0.1) assert_in_delta(0, method.wait_time, 0.1) assert_in_delta(0, method.children_time, 0.1) assert_equal(2, method.call_infos.length) call_info = method.call_infos[0] assert_equal('RecursiveTest#test_simple->SimpleRecursion#simple->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) assert(!call_info.recursive) call_info = method.call_infos[1] assert_equal('RecursiveTest#test_simple->SimpleRecursion#simple->SimpleRecursion#simple->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) assert(!call_info.recursive) end def test_cycle result = RubyProf.profile do render end methods = result.threads.first.methods.sort.reverse assert_equal(5, methods.length) method = methods[0] assert_equal('RecursiveTest#test_cycle', method.full_name) assert_equal(1, method.called) assert_in_delta(5, method.total_time, 0.1) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(5, method.children_time, 0.1) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('RecursiveTest#test_cycle', call_info.call_sequence) assert_equal(1, call_info.children.length) assert(!call_info.recursive) method = methods[1] assert_equal('SimpleRecursion#render', method.full_name) assert_equal(1, method.called) assert_in_delta(5, method.total_time, 0.1) assert_in_delta(0, method.self_time, 0.01) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(5, method.children_time, 0.1) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render', call_info.call_sequence) assert_equal(1, call_info.children.length) assert(!call_info.recursive) method = methods[2] assert_equal('Integer#times', method.full_name) assert_equal(2, method.called) assert_in_delta(5, method.total_time, 0.1) assert_in_delta(0, method.self_time, 0.1) assert_in_delta(0, method.wait_time, 0.1) assert_in_delta(5, method.children_time, 0.1) assert_equal(2, method.call_infos.length) call_info = method.call_infos[0] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times', call_info.call_sequence) assert_equal(1, call_info.children.length) assert(!call_info.recursive) call_info = method.call_infos[1] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial->Integer#times', call_info.call_sequence) assert_equal(1, call_info.children.length) assert(call_info.recursive) method = methods[3] assert_equal('SimpleRecursion#render_partial', method.full_name) assert_equal(5, method.called) assert_in_delta(5, method.total_time, 0.1) assert_in_delta(0, method.self_time, 0.1) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(5, method.children_time, 0.05) assert_equal(3, method.call_infos.length) call_info = method.call_infos[0] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial', call_info.call_sequence) assert_equal(3, call_info.children.length) assert(!call_info.recursive) call_info = method.call_infos[1] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial->SimpleRecursion#render_partial', call_info.call_sequence) assert_equal(1, call_info.children.length) assert(call_info.recursive) call_info = method.call_infos[2] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial->Integer#times->SimpleRecursion#render_partial', call_info.call_sequence) assert_equal(1, call_info.children.length) assert(call_info.recursive) method = methods[4] assert_equal('Kernel#sleep', method.full_name) assert_equal(5, method.called) assert_in_delta(5, method.total_time, 0.1) assert_in_delta(5, method.self_time, 0.1) assert_in_delta(0, method.wait_time, 0.01) assert_in_delta(0, method.children_time, 0.01) assert_equal(3, method.call_infos.length) call_info = method.call_infos[0] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) assert(!call_info.recursive) call_info = method.call_infos[1] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial->SimpleRecursion#render_partial->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) assert(!call_info.recursive) call_info = method.call_infos[2] assert_equal('RecursiveTest#test_cycle->SimpleRecursion#render->Integer#times->SimpleRecursion#render_partial->Integer#times->SimpleRecursion#render_partial->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) assert(!call_info.recursive) end end ruby-prof-0.16.2/test/start_stop_test.rb0000755000175600017570000000630712766254554017364 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class StartStopTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def method1 RubyProf.start method2 end def method2 method3 end def method3 sleep(2) @result = RubyProf.stop end def test_extra_stop_should_raise RubyProf.start assert_raises(RuntimeError) do RubyProf.start end assert_raises(RuntimeError) do RubyProf.profile {} end RubyProf.stop # ok assert_raises(RuntimeError) do RubyProf.stop end end def test_different_methods method1 # Ruby prof should be stopped assert_equal(false, RubyProf.running?) # Length should be 4: # StartStopTest#method1 # StartStopTest#method2 # StartStopTest#method3 # Kernel#sleep methods = @result.threads.first.methods.sort.reverse assert_equal(4, methods.length) # Check StackTest#test_call_sequence method = methods[0] assert_equal('StartStopTest#method1', method.full_name) assert_equal(1, method.called) assert_in_delta(2, method.total_time, 0.05) assert_in_delta(0, method.wait_time, 0.02) assert_in_delta(0, method.self_time, 0.02) assert_in_delta(2, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StartStopTest#method1', call_info.call_sequence) assert_equal(1, call_info.children.length) method = methods[1] assert_equal('StartStopTest#method2', method.full_name) assert_equal(1, method.called) assert_in_delta(2, method.total_time, 0.05) assert_in_delta(0, method.wait_time, 0.02) assert_in_delta(0, method.self_time, 0.02) assert_in_delta(2, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StartStopTest#method1->StartStopTest#method2', call_info.call_sequence) assert_equal(1, call_info.children.length) method = methods[2] assert_equal('StartStopTest#method3', method.full_name) assert_equal(1, method.called) assert_in_delta(2, method.total_time, 0.02) assert_in_delta(0, method.wait_time, 0.02) assert_in_delta(0, method.self_time, 0.02) assert_in_delta(2, method.children_time, 0.02) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StartStopTest#method1->StartStopTest#method2->StartStopTest#method3', call_info.call_sequence) assert_equal(1, call_info.children.length) method = methods[3] assert_equal('Kernel#sleep', method.full_name) assert_equal(1, method.called) assert_in_delta(2, method.total_time, 0.02) assert_in_delta(0, method.wait_time, 0.02) assert_in_delta(2, method.self_time, 0.02) assert_in_delta(0, method.children_time, 0.02) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('StartStopTest#method1->StartStopTest#method2->StartStopTest#method3->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) end end ruby-prof-0.16.2/test/yarv_test.rb0000755000175600017570000000273012766254554016137 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # tests for bugs reported by users class BugsTest < TestCase def setup RubyProf::measure_mode = RubyProf::WALL_TIME define_methods end def test_array_push_unoptimized a = nil result = RubyProf.profile do a = self.array_push_unoptimized end assert_equal 2, a.length assert_equal ["BugsTest#test_array_push_unoptimized", "BugsTest#array_push_unoptimized", 'Array#<<', "Array#push"], result.threads.first.methods.map(&:full_name) end def test_array_push_optimized a = nil result = RubyProf.profile do a = self.array_push_optimized end assert_equal 2, a.length assert_equal ["BugsTest#test_array_push_optimized", "BugsTest#array_push_optimized", "Array#push"], result.threads.first.methods.map(&:full_name) end private def define_methods return if respond_to?(:array_push_optimized) old_compile_option = RubyVM::InstructionSequence.compile_option RubyVM::InstructionSequence.compile_option = { :trace_instruction => true, :specialized_instruction => false } self.class.class_eval <<-"EOM" def array_push_unoptimized a = [] a << 1 a.push 2 end EOM RubyVM::InstructionSequence.compile_option = old_compile_option self.class.class_eval <<-"EOM" def array_push_optimized a = [] a << 1 a.push 2 end EOM end end ruby-prof-0.16.2/test/block_test.rb0000755000175600017570000000510112766254554016243 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path("../test_helper", __FILE__) class BlockMethodTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_block result = RubyProf.profile do 1.times { RubyProf::C1.new.hello } end # Methods called # Kernel#sleep # #allocate # #{RubyProf.parent_object}#inizialize # RubyProf::C1#hello # Class#new # Integer#times # BlockMethodTest#test_block methods = result.threads.first.methods.sort.reverse assert_equal(RubyProf.ruby_2? ? 6 : 7, methods.length) # Check times assert_equal("BlockMethodTest#test_block", methods[0].full_name) assert_in_delta(0.2, methods[0].total_time, 0.02) assert_in_delta(0.0, methods[0].wait_time, 0.02) assert_in_delta(0.0, methods[0].self_time, 0.02) assert_equal("Integer#times", methods[1].full_name) assert_in_delta(0.2, methods[1].total_time, 0.02) assert_in_delta(0.0, methods[1].wait_time, 0.02) assert_in_delta(0.0, methods[1].self_time, 0.02) assert_equal("RubyProf::C1#hello", methods[2].full_name) assert_in_delta(0.2, methods[2].total_time, 0.02) assert_in_delta(0.0, methods[2].wait_time, 0.02) assert_in_delta(0.0, methods[2].self_time, 0.02) assert_equal("Kernel#sleep", methods[3].full_name) assert_in_delta(0.2, methods[3].total_time, 0.01) assert_in_delta(0.0, methods[3].wait_time, 0.01) assert_in_delta(0.2, methods[3].self_time, 0.01) assert_equal("Class#new", methods[4].full_name) assert_in_delta(0.0, methods[4].total_time, 0.01) assert_in_delta(0.0, methods[4].wait_time, 0.01) assert_in_delta(0.0, methods[4].self_time, 0.01) # the timing difference between #initialize and #allocate is so small # that we cannot rely on #initialize appearing first. # so switch them, if necessary if methods[5].full_name =~ /#allocate/ methods[5], methods[6] = methods[6], methods[5] end assert_equal("#{RubyProf.parent_object}#initialize", methods[5].full_name) assert_in_delta(0.0, methods[5].total_time, 0.01) assert_in_delta(0.0, methods[5].wait_time, 0.01) assert_in_delta(0.0, methods[5].self_time, 0.01) unless RubyProf.ruby_2? assert_equal("#allocate", methods[6].full_name) assert_in_delta(0.0, methods[6].total_time, 0.01) assert_in_delta(0.0, methods[6].wait_time, 0.01) assert_in_delta(0.0, methods[6].self_time, 0.01) end end end ruby-prof-0.16.2/test/no_method_class_test.rb0000755000175600017570000000070712766254554020321 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Make sure this works with no class or method result = RubyProf.profile do sleep 1 end methods = result.threads.first.methods global_method = methods.sort_by {|method| method.full_name}.first if global_method.full_name != 'Global#[No method]' raise(RuntimeError, "Wrong method name. Expected: Global#[No method]. Actual: #{global_method.full_name}") end ruby-prof-0.16.2/test/multi_printer_test.rb0000755000175600017570000000340312766254554020051 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Test data # A # / \ # B C # \ # B class MSTPT def a 100.times{b} 300.times{c} c;c;c end def b sleep 0 end def c 5.times{b} end end class MultiPrinterTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_all_profiles_can_be_created start_time = Time.now RubyProf.start 5.times{MSTPT.new.a} result = RubyProf.stop end_time = Time.now expected_time = end_time - start_time stack = graph = nil assert_nothing_raised { stack, graph = print(result) } re = Regexp.new(' \s* \s* \s* \s*()? \s* \s* \s* \s* \s*()? \s* \s* \s* \s* \s*
      Thread IDFiber IDTotal Time
      ([\.0-9]+)-?\d+([\.0-9e]+)
      ') assert_match(re, graph) graph =~ re display_time = $4.to_f assert_in_delta expected_time, display_time, 0.001 end private def print(result) test = caller.first =~ /in `(.*)'/ ? $1 : "test" path = RubyProf.tmpdir profile = "ruby_prof_#{test}" printer = RubyProf::MultiPrinter.new(result) printer.print(:path => path, :profile => profile, :threshold => 0, :min_percent => 0, :title => "ruby_prof #{test}") if RUBY_PLATFORM =~ /darwin/ && ENV['SHOW_RUBY_PROF_PRINTER_OUTPUT']=="1" system("open '#{printer.stack_profile}'") end # if GC.respond_to?(:dump_file_and_line_info) # GC.start # GC.dump_file_and_line_info("heap.dump") # end [File.read(printer.stack_profile), File.read(printer.graph_profile)] end end ruby-prof-0.16.2/test/line_number_test.rb0000755000175600017570000000301112766254554017446 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class LineNumbers def method1 end def method2 method1 end def method3 sleep(1) end end # -- Tests ---- class LineNumbersTest < TestCase def test_function_line_no numbers = LineNumbers.new result = RubyProf.profile do numbers.method2 end methods = result.threads.first.methods.sort.reverse assert_equal(3, methods.length) method = methods[0] assert_equal('LineNumbersTest#test_function_line_no', method.full_name) assert_equal(25, method.line) method = methods[1] assert_equal('LineNumbers#method2', method.full_name) assert_equal(10, method.line) method = methods[2] assert_equal('LineNumbers#method1', method.full_name) assert_equal(7, method.line) end def test_c_function numbers = LineNumbers.new result = RubyProf.profile do numbers.method3 end methods = result.threads.first.methods.sort_by {|method| method.full_name} assert_equal(3, methods.length) # Methods: # LineNumbers#method3 # LineNumbersTest#test_c_function # Kernel#sleep method = methods[0] assert_equal('Kernel#sleep', method.full_name) assert_equal(0, method.line) method = methods[1] assert_equal('LineNumbers#method3', method.full_name) assert_equal(14, method.line) method = methods[2] assert_equal('LineNumbersTest#test_c_function', method.full_name) assert_equal(48, method.line) end end ruby-prof-0.16.2/test/module_test.rb0000755000175600017570000000154112766254554016442 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME module Foo def Foo::hello sleep(0.5) end end module Bar def Bar::hello sleep(0.5) Foo::hello end def hello sleep(0.5) Bar::hello end end include Bar class ModuleTest < TestCase def test_nested_modules result = RubyProf.profile do hello end methods = result.threads.first.methods # Length should be 5 assert_equal(5, methods.length) # these methods should be in there... (hard to tell order though). for name in ['ModuleTest#test_nested_modules','Bar#hello','Kernel#sleep','#hello','#hello'] assert methods.map(&:full_name).include?( name ) end end end ruby-prof-0.16.2/test/basic_test.rb0000755000175600017570000000730212766254554016237 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class BasicTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def start RubyProf.start RubyProf::C1.hello end def test_running assert(!RubyProf.running?) RubyProf.start assert(RubyProf.running?) RubyProf.stop assert(!RubyProf.running?) end def test_double_profile RubyProf.start assert_raises(RuntimeError) do RubyProf.start end RubyProf.stop end def test_no_block assert_raises(ArgumentError) do RubyProf.profile end end def test_traceback RubyProf.start assert_raises(NoMethodError) do RubyProf.xxx end RubyProf.stop end def test_leave_method start sleep 0.15 profile = RubyProf.stop assert_equal(1, profile.threads.count) thread = profile.threads.first assert_in_delta(0.25, thread.total_time, 0.015) top_methods = thread.top_methods.sort assert_equal(2, top_methods.count) assert_equal("BasicTest#start", top_methods[0].full_name) assert_equal("BasicTest#test_leave_method", top_methods[1].full_name) assert_equal(4, thread.methods.length) methods = profile.threads.first.methods.sort # Check times assert_equal("#hello", methods[0].full_name) assert_in_delta(0.1, methods[0].total_time, 0.015) assert_in_delta(0.0, methods[0].wait_time, 0.015) assert_in_delta(0.0, methods[0].self_time, 0.015) assert_equal("BasicTest#start", methods[1].full_name) assert_in_delta(0.1, methods[1].total_time, 0.015) assert_in_delta(0.0, methods[1].wait_time, 0.015) assert_in_delta(0.0, methods[1].self_time, 0.015) assert_equal("BasicTest#test_leave_method", methods[2].full_name) assert_in_delta(0.15, methods[2].total_time, 0.015) assert_in_delta(0.0, methods[2].wait_time, 0.015) assert_in_delta(0.0, methods[2].self_time, 0.015) assert_equal("Kernel#sleep", methods[3].full_name) assert_in_delta(0.25, methods[3].total_time, 0.015) assert_in_delta(0.0, methods[3].wait_time, 0.015) assert_in_delta(0.25, methods[3].self_time, 0.015) end def test_leave_method_2 start RubyProf::C1.hello RubyProf::C1.hello profile = RubyProf.stop assert_equal(1, profile.threads.count) thread = profile.threads.first assert_in_delta(0.3, thread.total_time, 0.015) top_methods = thread.top_methods.sort assert_equal(2, top_methods.count) assert_equal("BasicTest#start", top_methods[0].full_name) assert_equal("BasicTest#test_leave_method_2", top_methods[1].full_name) assert_equal(4, thread.methods.length) methods = profile.threads.first.methods.sort # Check times assert_equal("BasicTest#start", methods[0].full_name) assert_in_delta(0.1, methods[0].total_time, 0.015) assert_in_delta(0.0, methods[0].wait_time, 0.015) assert_in_delta(0.0, methods[0].self_time, 0.015) assert_equal("BasicTest#test_leave_method_2", methods[1].full_name) assert_in_delta(0.2, methods[1].total_time, 0.015) assert_in_delta(0.0, methods[1].wait_time, 0.015) assert_in_delta(0.0, methods[1].self_time, 0.015) assert_equal("Kernel#sleep", methods[2].full_name) assert_in_delta(0.3, methods[2].total_time, 0.015) assert_in_delta(0.0, methods[2].wait_time, 0.015) assert_in_delta(0.3, methods[2].self_time, 0.015) assert_equal("#hello", methods[3].full_name) assert_in_delta(0.3, methods[3].total_time, 0.015) assert_in_delta(0.0, methods[3].wait_time, 0.015) assert_in_delta(0.0, methods[3].self_time, 0.015) end end ruby-prof-0.16.2/test/aggregate_test.rb0000755000175600017570000000655112766254554017111 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Test data # A B C # | | | # Z A A # | | # Z Z class AggClass def z sleep 1 end def a z end def b a end def c a end end class AggregateTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_all_call_infos_are_not_recursive c1 = AggClass.new result = RubyProf.profile do c1.a c1.b c1.c end methods = result.threads.first.methods.sort.reverse methods.each do |m| m.call_infos.each do |ci| assert(!ci.recursive) end end end def test_call_infos c1 = AggClass.new result = RubyProf.profile do c1.a c1.b c1.c end methods = result.threads.first.methods.sort.reverse method = methods.find {|meth| meth.full_name == 'AggClass#z'} # Check AggClass#z assert_equal('AggClass#z', method.full_name) assert_equal(3, method.called) assert_in_delta(3, method.total_time, 0.05) assert_in_delta(0, method.wait_time, 0.05) assert_in_delta(0, method.self_time, 0.05) assert_in_delta(3, method.children_time, 0.05) assert_equal(3, method.call_infos.length) call_info = method.call_infos[0] assert_equal('AggregateTest#test_call_infos->AggClass#a->AggClass#z', call_info.call_sequence) assert_equal(1, call_info.children.length) call_info = method.call_infos[1] assert_equal('AggregateTest#test_call_infos->AggClass#b->AggClass#a->AggClass#z', call_info.call_sequence) assert_equal(1, call_info.children.length) call_info = method.call_infos[2] assert_equal('AggregateTest#test_call_infos->AggClass#c->AggClass#a->AggClass#z', call_info.call_sequence) assert_equal(1, call_info.children.length) end def test_aggregates_parents c1 = AggClass.new result = RubyProf.profile do c1.a c1.b c1.c end methods = result.threads.first.methods.sort.reverse method = methods.find {|meth| meth.full_name == 'AggClass#z'} # Check AggClass#z assert_equal('AggClass#z', method.full_name) call_infos = method.aggregate_parents assert_equal(1, call_infos.length) call_info = call_infos.first assert_equal('AggClass#a', call_info.parent.target.full_name) assert_in_delta(3, call_info.total_time, 0.05) assert_in_delta(0, call_info.wait_time, 0.05) assert_in_delta(0, call_info.self_time, 0.05) assert_in_delta(3, call_info.children_time, 0.05) assert_equal(3, call_info.called) end def test_aggregates_children c1 = AggClass.new result = RubyProf.profile do c1.a c1.b c1.c end methods = result.threads.first.methods.sort.reverse method = methods.find {|meth| meth.full_name == 'AggClass#a'} # Check AggClass#a assert_equal('AggClass#a', method.full_name) call_infos = method.aggregate_children assert_equal(1, call_infos.length) call_info = call_infos.first assert_equal('AggClass#z', call_info.target.full_name) assert_in_delta(3, call_info.total_time, 0.05) assert_in_delta(0, call_info.wait_time, 0.05) assert_in_delta(0, call_info.self_time, 0.05) assert_in_delta(3, call_info.children_time, 0.05) assert_equal(3, call_info.called) end end ruby-prof-0.16.2/test/measure_gc_runs_test.rb0000755000175600017570000000134112766254554020334 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureGCRunsTest < TestCase include MemoryTestHelper def test_gc_runs_mode RubyProf::measure_mode = RubyProf::GC_RUNS assert_equal(RubyProf::GC_RUNS, RubyProf::measure_mode) end def test_gc_runs_enabled_defined assert(defined?(RubyProf::GC_RUNS_ENABLED)) end if RubyProf::GC_RUNS_ENABLED def test_gc_runs t = RubyProf.measure_gc_runs assert_kind_of Integer, t GC.enable_stats if GC.respond_to?(:enable_stats) GC.start u = RubyProf.measure_gc_runs assert u > t, [t, u].inspect RubyProf::measure_mode = RubyProf::GC_RUNS memory_test_helper end end end ruby-prof-0.16.2/test/measure_process_time_test.rb0000755000175600017570000000400212766254554021365 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureProcessTimeTest < TestCase def setup # Need to fix this for linux (windows works since PROCESS_TIME is WALL_TIME anyway) RubyProf::measure_mode = RubyProf::PROCESS_TIME end def test_mode assert_equal(RubyProf::PROCESS_TIME, RubyProf::measure_mode) end def test_process_time_enabled_defined assert(defined?(RubyProf::PROCESS_TIME_ENABLED)) end def test_primes start = Process.times result = RubyProf.profile do run_primes(10000) end finish = Process.times total_time = (finish.utime - start.utime) + (finish.stime - start.stime) thread = result.threads.first assert_in_delta(total_time, thread.total_time, 0.03) methods = result.threads.first.methods.sort.reverse expected_number_of_methods = case RUBY_VERSION when /^1\.9\.3/ then 16 when /^2\.0/ then 15 when /^2\.(1|2)/ then 14 else 13 end # puts methods.map(&:full_name).inspect assert_equal expected_number_of_methods, methods.length # Check times assert_equal("MeasureProcessTimeTest#test_primes", methods[0].full_name) assert_in_delta(total_time, methods[0].total_time, 0.02) assert_in_delta(0.0, methods[0].wait_time, 0.01) assert_in_delta(0.0, methods[0].self_time, 0.01) assert_equal("Object#run_primes", methods[1].full_name) assert_in_delta(total_time, methods[1].total_time, 0.02) assert_in_delta(0.0, methods[1].wait_time, 0.01) assert_in_delta(0.0, methods[1].self_time, 0.01) assert_equal("Object#find_primes", methods[2].full_name) assert_equal("Array#select", methods[3].full_name) assert_equal("Object#is_prime", methods[4].full_name) assert_equal("Integer#upto", methods[5].full_name) assert_equal("Object#make_random_array", methods[6].full_name) assert_equal("Array#each_index", methods[7].full_name) assert_equal("Kernel#rand", methods[8].full_name) end end ruby-prof-0.16.2/test/exclude_threads_test.rb0000755000175600017570000000172212766254554020321 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # -- Tests ---- class ExcludeThreadsTest < TestCase def test_exclude_threads def thread1_proc sleep(0.5) sleep(2) end def thread2_proc sleep(0.5) sleep(2) end thread1 = Thread.new do thread1_proc end thread2 = Thread.new do thread2_proc end # exclude_threads already includes the minitest thread pool RubyProf.exclude_threads += [ thread2 ] RubyProf.start thread1.join thread2.join result = RubyProf.stop assert_equal(2, result.threads.length) output = Array.new result.threads.each do |thread| thread.methods.each do | m | if m.full_name.index("ExcludeThreadsTest#thread") == 0 output.push(m.full_name) end end end assert_equal(1, output.length) assert_equal("ExcludeThreadsTest#thread1_proc", output[0]) end end ruby-prof-0.16.2/test/thread_test.rb0000755000175600017570000001430112766254554016422 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) require 'timeout' require 'benchmark' # -- Tests ---- class ThreadTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_thread_count RubyProf.start thread = Thread.new do sleep(1) end thread.join result = RubyProf.stop assert_equal(2, result.threads.length) end def test_thread_identity RubyProf.start sleep_thread = Thread.new do sleep(1) end sleep_thread.join result = RubyProf.stop thread_ids = result.threads.map {|thread| thread.id}.sort threads = [Thread.current, sleep_thread] assert_equal(2, result.threads.length) assert(thread_ids.include?(threads[0].object_id)) assert(thread_ids.include?(threads[1].object_id)) assert_instance_of(Thread, ObjectSpace._id2ref(thread_ids[0])) assert(threads.include?(ObjectSpace._id2ref(thread_ids[0]))) assert_instance_of(Thread, ObjectSpace._id2ref(thread_ids[1])) assert(threads.include?(ObjectSpace._id2ref(thread_ids[1]))) end def test_thread_timings RubyProf.start thread = Thread.new do sleep 0 # force it to hit thread.join, below, first # thus forcing sleep(1), below, to be counted as (wall) self_time # since we currently count time "in some other thread" as self.wait_time # for whatever reason sleep(1) end thread.join result = RubyProf.stop # Check background thread assert_equal(2, result.threads.length) rp_thread = result.threads.detect {|t| t.id == thread.object_id} methods = rp_thread.methods.sort.reverse # fails on travis. why? # expected_methods = ["ThreadTest#test_thread_timings", "Kernel#sleep"] # assert_equal(expected_methods, methods.map(&:full_name)) method = methods[0] assert_equal('ThreadTest#test_thread_timings', method.full_name) assert_equal(1, method.called) assert_in_delta(1, method.total_time, 0.05) assert_in_delta(0, method.self_time, 0.05) assert_in_delta(0, method.wait_time, 0.05) assert_in_delta(1, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('ThreadTest#test_thread_timings', call_info.call_sequence) assert_equal(1, call_info.children.length) method = methods[1] assert_equal('Kernel#sleep', method.full_name) assert_equal(2, method.called) assert_in_delta(1, method.total_time, 0.05) assert_in_delta(1.0, method.self_time, 0.05) assert_in_delta(0, method.wait_time, 0.05) assert_in_delta(0, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('ThreadTest#test_thread_timings->Kernel#sleep', call_info.call_sequence) assert_equal(0, call_info.children.length) # Check foreground thread rp_thread = result.threads.detect {|athread| athread.id == Thread.current.object_id} methods = rp_thread.methods.sort.reverse assert_equal(4, methods.length) methods = methods.sort.reverse method = methods[0] assert_equal('ThreadTest#test_thread_timings', method.full_name) # the sub calls to Object#new, when popped, # cause the parent frame to be created for method #test_thread_timings, which means a +1 when it's popped in the end # xxxx a test that shows it the other way, too (never creates parent frame--if that's even possible) assert_equal(1, method.called) assert_in_delta(1, method.total_time, 0.05) assert_in_delta(0, method.self_time, 0.05) assert_in_delta(0, method.wait_time, 0.05) assert_in_delta(1, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('ThreadTest#test_thread_timings', call_info.call_sequence) assert_equal(2, call_info.children.length) method = methods[1] assert_equal('Thread#join', method.full_name) assert_equal(1, method.called) assert_in_delta(1, method.total_time, 0.05) assert_in_delta(0, method.self_time, 0.05) assert_in_delta(1.0, method.wait_time, 0.05) assert_in_delta(0, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('ThreadTest#test_thread_timings->Thread#join', call_info.call_sequence) assert_equal(0, call_info.children.length) method = methods[2] assert_equal('#new', method.full_name) assert_equal(1, method.called) assert_in_delta(0, method.total_time, 0.05) assert_in_delta(0, method.self_time, 0.05) assert_in_delta(0, method.wait_time, 0.05) assert_in_delta(0, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('ThreadTest#test_thread_timings->#new', call_info.call_sequence) assert_equal(1, call_info.children.length) method = methods[3] assert_equal('Thread#initialize', method.full_name) assert_equal(1, method.called) assert_in_delta(0, method.total_time, 0.05) assert_in_delta(0, method.self_time, 0.05) assert_in_delta(0, method.wait_time, 0.05) assert_in_delta(0, method.children_time, 0.05) assert_equal(1, method.call_infos.length) call_info = method.call_infos[0] assert_equal('ThreadTest#test_thread_timings->#new->Thread#initialize', call_info.call_sequence) assert_equal(0, call_info.children.length) end # useless test: what does it test? def test_thread_back_and_forth result = nil seconds = Benchmark.realtime do result = RubyProf.profile do a = Thread.new { 100_000.times { sleep 0 }} b = Thread.new { 100_000.times { sleep 0 }} a.join b.join end end methods = result.threads.map {|thread| thread.methods} timings = methods.flatten.sort assert(timings[-1].total_time < seconds) end # useless test: what does it test? def test_thread RubyProf.profile do begin Timeout::timeout(2) do while true next end end rescue Timeout::Error end end end end ruby-prof-0.16.2/test/measure_wall_time_test.rb0000755000175600017570000001777412766254554020672 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureWallTimeTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_mode RubyProf::measure_mode = RubyProf::WALL_TIME assert_equal(RubyProf::WALL_TIME, RubyProf::measure_mode) end def test_wall_time_enabled_defined assert(defined?(RubyProf::WALL_TIME_ENABLED)) end def test_class_methods result = RubyProf.profile do RubyProf::C1.hello end thread = result.threads.first assert_in_delta(0.1, thread.total_time, 0.01) top_methods = thread.top_methods assert_equal(1, top_methods.count) assert_equal("MeasureWallTimeTest#test_class_methods", top_methods[0].full_name) # Length should be 3: # MeasureWallTimeTest#test_class_methods # #hello # Kernel#sleep methods = result.threads.first.methods.sort.reverse assert_equal(3, methods.length) # Check the names assert_equal('MeasureWallTimeTest#test_class_methods', methods[0].full_name) assert_equal('#hello', methods[1].full_name) assert_equal('Kernel#sleep', methods[2].full_name) # Check times assert_in_delta(0.1, methods[0].total_time, 0.01) assert_in_delta(0, methods[0].wait_time, 0.01) assert_in_delta(0, methods[0].self_time, 0.01) assert_in_delta(0.1, methods[1].total_time, 0.01) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.01) assert_in_delta(0.1, methods[2].total_time, 0.01) assert_in_delta(0, methods[2].wait_time, 0.01) assert_in_delta(0.1, methods[2].self_time, 0.01) end def test_instance_methods result = RubyProf.profile do RubyProf::C1.new.hello end thread = result.threads.first assert_in_delta(0.2, thread.total_time, 0.01) top_methods = thread.top_methods assert_equal(1, top_methods.count) assert_equal("MeasureWallTimeTest#test_instance_methods", top_methods[0].full_name) # Methods called # MeasureWallTimeTest#test_instance_methods # Class.new # Class:Object#allocate # for Object#initialize # C1#hello # Kernel#sleep methods = result.threads.first.methods.sort.reverse assert_equal(RubyProf.ruby_2? ? 5 : 6, methods.length) names = methods.map(&:full_name) assert_equal('MeasureWallTimeTest#test_instance_methods', names[0]) assert_equal('RubyProf::C1#hello', names[1]) assert_equal('Kernel#sleep', names[2]) assert_equal('Class#new', names[3]) # order can differ assert(names.include?("#{RubyProf.parent_object}#initialize")) unless RubyProf.ruby_2? assert(names.include?("#allocate")) end # Check times assert_in_delta(0.2, methods[0].total_time, 0.02) assert_in_delta(0, methods[0].wait_time, 0.02) assert_in_delta(0, methods[0].self_time, 0.02) assert_in_delta(0.2, methods[1].total_time, 0.02) assert_in_delta(0, methods[1].wait_time, 0.02) assert_in_delta(0, methods[1].self_time, 0.02) assert_in_delta(0.2, methods[2].total_time, 0.02) assert_in_delta(0, methods[2].wait_time, 0.02) assert_in_delta(0.2, methods[2].self_time, 0.02) assert_in_delta(0, methods[3].total_time, 0.01) assert_in_delta(0, methods[3].wait_time, 0.01) assert_in_delta(0, methods[3].self_time, 0.01) assert_in_delta(0, methods[4].total_time, 0.01) assert_in_delta(0, methods[4].wait_time, 0.01) assert_in_delta(0, methods[4].self_time, 0.01) unless RubyProf.ruby_2? assert_in_delta(0, methods[5].total_time, 0.01) assert_in_delta(0, methods[5].wait_time, 0.01) assert_in_delta(0, methods[5].self_time, 0.01) end end def test_module_methods result = RubyProf.profile do RubyProf::C2.hello end thread = result.threads.first assert_in_delta(0.3, thread.total_time, 0.01) top_methods = thread.top_methods assert_equal(1, top_methods.count) assert_equal("MeasureWallTimeTest#test_module_methods", top_methods[0].full_name) # Methods: # MeasureWallTimeTest#test_module_methods # M1#hello # Kernel#sleep methods = result.threads.first.methods.sort.reverse assert_equal(3, methods.length) assert_equal('MeasureWallTimeTest#test_module_methods', methods[0].full_name) assert_equal('RubyProf::M1#hello', methods[1].full_name) assert_equal('Kernel#sleep', methods[2].full_name) # Check times assert_in_delta(0.3, methods[0].total_time, 0.1) assert_in_delta(0, methods[0].wait_time, 0.02) assert_in_delta(0, methods[0].self_time, 0.02) assert_in_delta(0.3, methods[1].total_time, 0.1) assert_in_delta(0, methods[1].wait_time, 0.02) assert_in_delta(0, methods[1].self_time, 0.02) assert_in_delta(0.3, methods[2].total_time, 0.1) assert_in_delta(0, methods[2].wait_time, 0.02) assert_in_delta(0.3, methods[2].self_time, 0.1) end def test_module_instance_methods result = RubyProf.profile do RubyProf::C2.new.hello end thread = result.threads.first assert_in_delta(0.3, thread.total_time, 0.01) top_methods = thread.top_methods assert_equal(1, top_methods.count) assert_equal("MeasureWallTimeTest#test_module_instance_methods", top_methods[0].full_name) # Methods: # MeasureWallTimeTest#test_module_instance_methods # Class#new # #allocate # Object#initialize # M1#hello # Kernel#sleep methods = result.threads.first.methods.sort.reverse assert_equal(RubyProf.ruby_2? ? 5 : 6, methods.length) names = methods.map(&:full_name) assert_equal('MeasureWallTimeTest#test_module_instance_methods', names[0]) assert_equal('RubyProf::M1#hello', names[1]) assert_equal('Kernel#sleep', names[2]) assert_equal('Class#new', names[3]) # order can differ assert(names.include?("#{RubyProf.parent_object}#initialize")) unless RubyProf.ruby_2? assert(names.include?("#allocate")) end # Check times assert_in_delta(0.3, methods[0].total_time, 0.1) assert_in_delta(0, methods[0].wait_time, 0.1) assert_in_delta(0, methods[0].self_time, 0.1) assert_in_delta(0.3, methods[1].total_time, 0.02) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.01) assert_in_delta(0.3, methods[2].total_time, 0.02) assert_in_delta(0, methods[2].wait_time, 0.01) assert_in_delta(0.3, methods[2].self_time, 0.02) assert_in_delta(0, methods[3].total_time, 0.01) assert_in_delta(0, methods[3].wait_time, 0.01) assert_in_delta(0, methods[3].self_time, 0.01) assert_in_delta(0, methods[4].total_time, 0.01) assert_in_delta(0, methods[4].wait_time, 0.01) assert_in_delta(0, methods[4].self_time, 0.01) unless RubyProf.ruby_2? assert_in_delta(0, methods[5].total_time, 0.01) assert_in_delta(0, methods[5].wait_time, 0.01) assert_in_delta(0, methods[5].self_time, 0.01) end end def test_singleton c3 = RubyProf::C3.new class << c3 def hello end end result = RubyProf.profile do c3.hello end thread = result.threads.first assert_in_delta(0.0, thread.total_time, 0.01) top_methods = thread.top_methods assert_equal(1, top_methods.count) assert_equal("MeasureWallTimeTest#test_singleton", top_methods[0].full_name) methods = result.threads.first.methods.sort.reverse assert_equal(2, methods.length) assert_equal('MeasureWallTimeTest#test_singleton', methods[0].full_name) assert_equal('#hello', methods[1].full_name) assert_in_delta(0, methods[0].total_time, 0.01) assert_in_delta(0, methods[0].wait_time, 0.01) assert_in_delta(0, methods[0].self_time, 0.01) assert_in_delta(0, methods[1].total_time, 0.01) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.01) end end ruby-prof-0.16.2/test/unique_call_path_test.rb0000755000175600017570000001053612766254554020476 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class UniqueCallPath def method_a(i) if i==1 method_b else method_c end end def method_b method_c end def method_c end def method_k(i) method_a(i) end end # -- Tests ---- class UniqueCallPathTest < TestCase def test_root_method unique_call_path = UniqueCallPath.new result = RubyProf.profile do unique_call_path.method_a(1) end root_methods = Array.new result.threads.each do |thread| thread.methods.each do | m | if m.root? root_methods.push(m) end end end assert_equal(1, root_methods.length) assert_equal("UniqueCallPathTest#test_root_method", root_methods[0].full_name) end def test_root_children unique_call_path = UniqueCallPath.new result = RubyProf.profile do unique_call_path.method_a(1) unique_call_path.method_k(2) end root_methods = Array.new result.threads.each do |thread| thread.methods.each do | m | if m.root? root_methods.push(m) end end end assert_equal(1, root_methods.length) root_children = Array.new root_methods[0].children.each do | c | if c.parent.target.eql?(root_methods[0]) root_children.push(c) end end children = root_children.sort do |c1, c2| c1.target.full_name <=> c2.target.full_name end assert_equal(2, children.length) assert_equal("UniqueCallPath#method_a", children[0].target.full_name) assert_equal("UniqueCallPath#method_k", children[1].target.full_name) end def test_children_of unique_call_path = UniqueCallPath.new result = RubyProf.profile do unique_call_path.method_a(1) unique_call_path.method_k(2) end root_methods = Array.new result.threads.each do |thread| thread.methods.each do | m | if m.root? root_methods.push(m) end end end assert_equal(1, root_methods.length) method = root_methods[0] assert_equal('UniqueCallPathTest#test_children_of', method.full_name) call_info_a = nil root_methods[0].children.each do | c | if c.target.full_name == "UniqueCallPath#method_a" call_info_a = c break end end assert !call_info_a.nil? children_of_a = Array.new call_info_a.children.each do | c | if c.parent.eql?(call_info_a) children_of_a.push(c) end end assert_equal(2, call_info_a.target.children.length) children_of_a = children_of_a.sort do |c1, c2| c1.target.full_name <=> c2.target.full_name end assert_equal(1, children_of_a.length) assert_equal("UniqueCallPath#method_b", children_of_a[0].target.full_name) end def test_id2ref unique_call_path = UniqueCallPath.new result = RubyProf.profile do unique_call_path.method_a(1) end root_methods = Array.new result.threads.each do |thread| thread.methods.each do | m | if m.root? root_methods.push(m) end end end child = root_methods[0].children[0] refute_equal(0, child.object_id) #assert_equal(RubyProf::CallInfo.id2ref(child.id).target.full_name, child.target.full_name) end def test_unique_path unique_call_path = UniqueCallPath.new result = RubyProf.profile do unique_call_path.method_a(1) unique_call_path.method_k(1) end root_methods = Array.new result.threads.each do |thread| thread.methods.each do | m | if m.root? root_methods.push(m) end end end assert_equal(1, root_methods.length) call_info_a = nil root_methods[0].children.each do | c | if c.target.full_name == "UniqueCallPath#method_a" call_info_a = c break end end assert !call_info_a.nil? children_of_a = Array.new call_info_a.children.each do |c| if c.parent.eql?(call_info_a) children_of_a.push(c) end end assert_equal(2, call_info_a.target.children.length) children_of_a = children_of_a.sort do |c1, c2| c1.target.full_name <=> c2.target.full_name end assert_equal(1, children_of_a.length) assert_equal(1, children_of_a[0].called) assert_equal("UniqueCallPath#method_b", children_of_a[0].target.full_name) end end ruby-prof-0.16.2/test/stack_printer_test.rb0000755000175600017570000000372412766254554020032 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # Test data # A # / \ # B C # \ # B class STPT def a 100.times{b} 300.times{c} c;c;c end def b sleep 0 end def c 5.times{b} end end class StackPrinterTest < TestCase def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME end def test_stack_can_be_printed start_time = Time.now RubyProf.start 5.times{STPT.new.a} result = RubyProf.stop end_time = Time.now expected_time = end_time - start_time file_contents = nil assert_nothing_raised { file_contents = print(result) } # TODO: why are thread ids negative on travis-ci.org (32 bit build maybe?) re = /Thread: (-?\d+)(, Fiber: (-?\d+))? \(100\.00% ~ ([\.0-9]+)\)/ assert_match(re, file_contents) file_contents =~ re actual_time = $4.to_f assert_in_delta(expected_time, actual_time, 0.1) end def test_method_elimination RubyProf.start 5.times{STPT.new.a} result = RubyProf.stop assert_nothing_raised { # result.dump result.eliminate_methods!([/Integer#times/]) # $stderr.puts "================================" # result.dump print(result) } end private def print(result) test = caller.first =~ /in `(.*)'/ ? $1 : "test" testfile_name = "#{RubyProf.tmpdir}/ruby_prof_#{test}.html" # puts "printing to #{testfile_name}" printer = RubyProf::CallStackPrinter.new(result) File.open(testfile_name, "w") {|f| printer.print(f, :threshold => 0, :min_percent => 0, :title => "ruby_prof #{test}")} system("open '#{testfile_name}'") if RUBY_PLATFORM =~ /darwin/ && ENV['SHOW_RUBY_PROF_PRINTER_OUTPUT']=="1" assert File.exist?(testfile_name), "#{testfile_name} does not exist" assert File.readable?(testfile_name), "#{testfile_name} is no readable" File.read(testfile_name) end end ruby-prof-0.16.2/test/fiber_test.rb0000755000175600017570000000443012766254554016244 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) require 'timeout' require 'set' begin require 'fiber' rescue LoadError end # -- Tests ---- class FiberTest < TestCase def fiber_test @fiber_ids << Fiber.current.object_id enum = Enumerator.new do |yielder| [1,2].each do |x| @fiber_ids << Fiber.current.object_id sleep 0.1 yielder.yield x end end while true begin enum.next rescue StopIteration break end end sleep 0.1 end def setup # Need to use wall time for this test due to the sleep calls RubyProf::measure_mode = RubyProf::WALL_TIME @fiber_ids = Set.new @root_fiber = Fiber.current.object_id @thread_id = Thread.current.object_id end def test_fibers result = RubyProf.profile { fiber_test } profiled_fiber_ids = result.threads.map(&:fiber_id) assert_equal(2, result.threads.length) assert_equal([@thread_id], result.threads.map(&:id).uniq) assert_equal(@fiber_ids, Set.new(profiled_fiber_ids)) assert profiled_fiber_ids.include?(@root_fiber) assert(root_fiber_profile = result.threads.detect{|t| t.fiber_id == @root_fiber}) assert(enum_fiber_profile = result.threads.detect{|t| t.fiber_id != @root_fiber}) assert_in_delta(0.3, root_fiber_profile.total_time, 0.05) assert_in_delta(0.2, enum_fiber_profile.total_time, 0.05) assert(method_next = root_fiber_profile.methods.detect{|m| m.full_name == "Enumerator#next"}) assert(method_each = enum_fiber_profile.methods.detect{|m| m.full_name == "Enumerator#each"}) assert_in_delta(0.2, method_next.total_time, 0.05) assert_in_delta(0.2, method_each.total_time, 0.05) end def test_merged_fibers result = RubyProf.profile(merge_fibers: true) { fiber_test } assert_equal(1, result.threads.length) profile = result.threads.first assert_equal 0, profile.fiber_id assert_in_delta(0.3, profile.total_time, 0.05) assert(method_next = profile.methods.detect{|m| m.full_name == "Enumerator#next"}) assert(method_each = profile.methods.detect{|m| m.full_name == "Enumerator#each"}) assert_in_delta(0.2, method_next.total_time, 0.05) assert_in_delta(0.2, method_each.total_time, 0.05) end end ruby-prof-0.16.2/test/measure_cpu_time_test.rb0000755000175600017570000001460412766254554020507 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureCpuTimeTest < TestCase def setup RubyProf::measure_mode = RubyProf::CPU_TIME end def teardown RubyProf::measure_mode = RubyProf::WALL_TIME end def test_mode assert_equal(RubyProf::CPU_TIME, RubyProf::measure_mode) end def test_cpu_time_enabled_defined assert(defined?(RubyProf::CPU_TIME_ENABLED)) end def test_class_methods result = RubyProf.profile do RubyProf::C7.busy_wait end # Length should be greater 2: # MeasureCpuTimeTest#test_class_methods # #busy_wait # .... methods = result.threads.first.methods.sort.reverse[0..1] assert_equal(2, methods.length) # Check the names assert_equal('MeasureCpuTimeTest#test_class_methods', methods[0].full_name) assert_equal('#busy_wait', methods[1].full_name) # Check times assert_in_delta(0.1, methods[0].total_time, 0.05) assert_in_delta(0, methods[0].wait_time, 0.05) assert_in_delta(0, methods[0].self_time, 0.05) assert_in_delta(0.1, methods[1].total_time, 0.05) assert_in_delta(0, methods[1].wait_time, 0.05) assert_in_delta(0, methods[1].self_time, 0.05) end def test_instance_methods result = RubyProf.profile do RubyProf::C7.new.busy_wait end methods = result.threads.first.methods.sort.reverse[0..1] assert_equal(2, methods.length) # Methods at this point: # MeasureCpuTimeTest#test_instance_methods # C7#busy_wait # ... names = methods.map(&:full_name) assert_equal('MeasureCpuTimeTest#test_instance_methods', names[0]) assert_equal('RubyProf::C7#busy_wait', names[1]) # Check times assert_in_delta(0.2, methods[0].total_time, 0.03) assert_in_delta(0, methods[0].wait_time, 0.03) assert_in_delta(0, methods[0].self_time, 0.03) assert_in_delta(0.2, methods[1].total_time, 0.03) assert_in_delta(0, methods[1].wait_time, 0.03) assert_in_delta(0, methods[1].self_time, 0.2) end def test_module_methods result = RubyProf.profile do RubyProf::C8.busy_wait end # Methods: # MeasureCpuTimeTest#test_module_methods # M1#busy_wait # ... methods = result.threads.first.methods.sort.reverse[0..1] assert_equal(2, methods.length) assert_equal('MeasureCpuTimeTest#test_module_methods', methods[0].full_name) assert_equal('RubyProf::M7#busy_wait', methods[1].full_name) # Check times assert_in_delta(0.3, methods[0].total_time, 0.1) assert_in_delta(0, methods[0].wait_time, 0.02) assert_in_delta(0, methods[0].self_time, 0.02) assert_in_delta(0.3, methods[1].total_time, 0.1) assert_in_delta(0, methods[1].wait_time, 0.02) assert_in_delta(0, methods[1].self_time, 0.1) end def test_module_instance_methods result = RubyProf.profile do RubyProf::C8.new.busy_wait end # Methods: # MeasureCpuTimeTest#test_module_instance_methods # M7#busy_wait # ... methods = result.threads.first.methods.sort.reverse[0..1] assert_equal(2, methods.length) names = methods.map(&:full_name) assert_equal('MeasureCpuTimeTest#test_module_instance_methods', names[0]) assert_equal('RubyProf::M7#busy_wait', names[1]) # Check times assert_in_delta(0.3, methods[0].total_time, 0.1) assert_in_delta(0, methods[0].wait_time, 0.1) assert_in_delta(0, methods[0].self_time, 0.1) assert_in_delta(0.3, methods[1].total_time, 0.1) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.1) end def test_singleton c3 = RubyProf::C3.new class << c3 def busy_wait end end result = RubyProf.profile do c3.busy_wait end methods = result.threads.first.methods.sort.reverse assert_equal(2, methods.length) assert_equal('MeasureCpuTimeTest#test_singleton', methods[0].full_name) assert_equal('#busy_wait', methods[1].full_name) assert_in_delta(0, methods[0].total_time, 0.01) assert_in_delta(0, methods[0].wait_time, 0.01) assert_in_delta(0, methods[0].self_time, 0.01) assert_in_delta(0, methods[1].total_time, 0.01) assert_in_delta(0, methods[1].wait_time, 0.01) assert_in_delta(0, methods[1].self_time, 0.01) end def test_sleeping_does_accumulate_wall_time RubyProf::measure_mode = RubyProf::WALL_TIME result = RubyProf.profile do sleep 0.1 end methods = result.threads.first.methods.sort.reverse assert_equal(["MeasureCpuTimeTest#test_sleeping_does_accumulate_wall_time", "Kernel#sleep"], methods.map(&:full_name)) assert_in_delta(0.1, methods[1].total_time, 0.01) assert_equal(0, methods[1].wait_time) assert_in_delta(0.1, methods[1].self_time, 0.01) end def test_sleeping_does_not_accumulate_significant_cpu_time result = RubyProf.profile do sleep 0.1 end methods = result.threads.first.methods.sort.reverse assert_equal(["MeasureCpuTimeTest#test_sleeping_does_not_accumulate_significant_cpu_time", "Kernel#sleep"], methods.map(&:full_name)) assert_in_delta(0, methods[1].total_time, 0.01) assert_equal(0, methods[1].wait_time) assert_in_delta(0, methods[1].self_time, 0.01) end def test_waiting_for_threads_does_not_accumulate_cpu_time background_thread = nil result = RubyProf.profile do background_thread = Thread.new{ sleep 0.1 } background_thread.join end # check number of threads assert_equal(2, result.threads.length) fg, bg = result.threads assert(fg.methods.map(&:full_name).include?("Thread#join")) assert(bg.methods.map(&:full_name).include?("Kernel#sleep")) assert_in_delta(0, fg.total_time, 0.01) assert_in_delta(0, bg.total_time, 0.01) end def test_waiting_for_threads_does_accumulate_wall_time RubyProf::measure_mode = RubyProf::WALL_TIME background_thread = nil result = RubyProf.profile do background_thread = Thread.new{ sleep 0.1 } background_thread.join end # check number of threads assert_equal(2, result.threads.length) fg, bg = result.threads assert(fg.methods.map(&:full_name).include?("Thread#join")) assert(bg.methods.map(&:full_name).include?("Kernel#sleep")) assert_in_delta(0.1, fg.total_time, 0.01) assert_in_delta(0.1, fg.wait_time, 0.01) assert_in_delta(0.1, bg.total_time, 0.01) end end ruby-prof-0.16.2/test/exceptions_test.rb0000755000175600017570000000044512766254554017340 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class ExceptionsTest < TestCase def test_profile result = begin RubyProf.profile do raise(RuntimeError, 'Test error') end rescue end refute_nil(result) end end ruby-prof-0.16.2/test/rack_test.rb0000755000175600017570000000436012766254554016077 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class FakeRackApp def call(env) end end module Rack class Request def initialize(env) if env == :fake_env @env = {} else @env = env end end def path @env[:path] || '/path/to/resource.json' end end end class RackTest < TestCase def test_create_print_path path = Dir.mktmpdir Dir.delete(path) Rack::RubyProf.new(FakeRackApp.new, :path => path) assert(Dir.exist?(path)) end def test_create_profile_reports path = Dir.mktmpdir adapter = Rack::RubyProf.new(FakeRackApp.new, :path => path) adapter.call(:fake_env) %w(flat.txt graph.txt graph.html call_stack.html).each do |base_name| file_path = ::File.join(path, "path-to-resource.json-#{base_name}") assert(File.exist?(file_path)) end end def test_skip_paths path = Dir.mktmpdir adapter = Rack::RubyProf.new(FakeRackApp.new, :path => path, :skip_paths => [%r{\.json$}]) adapter.call(:fake_env) %w(flat.txt graph.txt graph.html call_stack.html).each do |base_name| file_path = ::File.join(path, "path-to-resource.json-#{base_name}") assert(!File.exist?(file_path)) end end def test_only_paths path = Dir.mktmpdir adapter = Rack::RubyProf.new(FakeRackApp.new, :path => path, :only_paths => [%r{\.json$}]) adapter.call({path: '/path/to/resource.json'}) %w(flat.txt graph.txt graph.html call_stack.html).each do |base_name| file_path = ::File.join(path, "path-to-resource.json-#{base_name}") assert(File.exist?(file_path)) end adapter.call({path: '/path/to/resource.html'}) %w(flat.txt graph.txt graph.html call_stack.html).each do |base_name| file_path = ::File.join(path, "path-to-resource.html-#{base_name}") assert(!File.exist?(file_path)) end end def test_allows_lazy_filename_setting path = Dir.mktmpdir printer = {::RubyProf::FlatPrinter => lambda { 'dynamic.txt' }} adapter = Rack::RubyProf.new(FakeRackApp.new, :path => path, :printers => printer) adapter.call(:fake_env) file_path = ::File.join(path, 'path-to-resource.json-dynamic.txt') assert(File.exist?(file_path)) end end ruby-prof-0.16.2/test/enumerable_test.rb0000755000175600017570000000111312766254554017267 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) # -- Test for bug # http://github.com/rdp/ruby-prof/issues#issue/12 class EnumerableTest < TestCase def test_enumerable result = RubyProf.profile do 3.times { [1,2,3].any? {|n| n} } end methods = if RUBY_VERSION >= "2.2.0" %w(EnumerableTest#test_enumerable Integer#times Array#any?) else %w(EnumerableTest#test_enumerable Integer#times Enumerable#any? Array#each) end assert_equal(methods, result.threads.first.methods.map(&:full_name)) end end ruby-prof-0.16.2/test/prime.rb0000644000175600017570000000202512766254554015225 0ustar pravipravi# A silly little test program that finds prime numbers. It # is intentionally badly designed to show off the use # of ruby-prof. # # Source from http://people.cs.uchicago.edu/~bomb154/154/maclabs/profilers-lab/ def make_random_array(length, maxnum) result = Array.new(length) result.each_index do |i| result[i] = rand(maxnum) end result end def is_prime(x) y = 2 y.upto(x-1) do |i| return false if (x % i) == 0 end true end def find_primes(arr) result = arr.select do |value| is_prime(value) end result end def find_largest(primes) largest = primes.first # Intentionally use upto for example purposes # (upto is also called from is_prime) 0.upto(primes.length-1) do |i| prime = primes[i] if prime > largest largest = prime end end largest end def run_primes(length=10, maxnum=1000) # Create random numbers random_array = make_random_array(length, maxnum) # Find the primes primes = find_primes(random_array) # Find the largest primes find_largest(primes) end ruby-prof-0.16.2/test/measure_memory_test.rb0000755000175600017570000000163312766254554020210 0ustar pravipravi#!/usr/bin/env ruby # encoding: UTF-8 require File.expand_path('../test_helper', __FILE__) class MeasureMemoryTest < TestCase include MemoryTestHelper def test_memory_mode RubyProf::measure_mode = RubyProf::MEMORY assert_equal(RubyProf::MEMORY, RubyProf::measure_mode) end def test_memory_enabled_defined assert(defined?(RubyProf::MEMORY_ENABLED)) end if RubyProf::MEMORY_ENABLED def test_memory RubyProf::measure_mode = RubyProf::MEMORY RubyProf.enable_gc_stats_if_needed t = RubyProf.measure_memory assert_kind_of Float, t u = RubyProf.measure_memory assert_operator u, :>, t total = memory_test_helper assert(total > 0, 'Should measure more than zero kilobytes of memory usage') refute_equal(0, total % 1, 'Should not truncate fractional kilobyte measurements') ensure RubyProf.disable_gc_stats_if_needed end end end ruby-prof-0.16.2/ext/0000755000175600017570000000000012766254554013406 5ustar pravipraviruby-prof-0.16.2/ext/ruby_prof/0000755000175600017570000000000012766254554015415 5ustar pravipraviruby-prof-0.16.2/ext/ruby_prof/rp_measure_wall_time.c0000644000175600017570000000221012766254554021753 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ /* :nodoc: */ #include "ruby_prof.h" #if HAVE_GETTIMEOFDAY && !defined(_WIN32) #include #endif static VALUE cMeasureWallTime; static double measure_wall_time() { struct timeval tv; gettimeofday(&tv, NULL); return tv.tv_sec + (tv.tv_usec/1000000.0); } prof_measurer_t* prof_measurer_wall_time() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_wall_time; return measure; } /* Document-method: prof_measure_wall_time call-seq: measure_wall_time -> float Returns the wall time.*/ static VALUE prof_measure_wall_time(VALUE self) { return rb_float_new(measure_wall_time()); } void rp_init_measure_wall_time() { rb_define_const(mProf, "WALL_TIME", INT2NUM(MEASURE_WALL_TIME)); rb_define_const(mProf, "WALL_TIME_ENABLED", Qtrue); cMeasureWallTime = rb_define_class_under(mMeasure, "WallTime", rb_cObject); rb_define_singleton_method(cMeasureWallTime, "measure", prof_measure_wall_time, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_stack.h0000644000175600017570000000311512766254554017374 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #ifndef __RP_STACK__ #define __RP_STACK__ #include #include "rp_measure.h" #include "rp_call_info.h" /* Temporary object that maintains profiling information for active methods. They are created and destroyed as the program moves up and down its stack. */ typedef struct { /* Caching prof_method_t values significantly increases performance. */ prof_call_info_t *call_info; double start_time; double switch_time; /* Time at switch to different thread */ double wait_time; double child_time; double pause_time; // Time pause() was initiated double dead_time; // Time to ignore (i.e. total amount of time between pause/resume blocks) int depth; unsigned int line; } prof_frame_t; #define prof_frame_is_paused(f) (f->pause_time >= 0) #define prof_frame_is_unpaused(f) (f->pause_time < 0) void prof_frame_pause(prof_frame_t*, double current_measurement); void prof_frame_unpause(prof_frame_t*, double current_measurement); /* Current stack of active methods.*/ typedef struct { prof_frame_t *start; prof_frame_t *end; prof_frame_t *ptr; } prof_stack_t; prof_stack_t * prof_stack_create(); void prof_stack_free(prof_stack_t *stack); prof_frame_t * prof_stack_push(prof_stack_t *stack, double measurement); prof_frame_t * prof_stack_pop(prof_stack_t *stack, double measurement); prof_frame_t * prof_stack_peek(prof_stack_t *stack); #endif //__RP_STACK__ ruby-prof-0.16.2/ext/ruby_prof/rp_measure_cpu_time.c0000644000175600017570000000603212766254554021611 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "ruby_prof.h" static VALUE cMeasureCpuTime; /* The _WIN32 check is needed for msys (and maybe cygwin?) */ #if defined(_WIN32) static unsigned long long get_cpu_time() { LARGE_INTEGER time; QueryPerformanceCounter(&time); return time.QuadPart; } static unsigned long long get_cpu_frequency() { static unsigned long long cpu_frequency; if(!cpu_frequency) { LARGE_INTEGER cpu_frequency_struct; QueryPerformanceFrequency(&cpu_frequency_struct); cpu_frequency = cpu_frequency_struct.QuadPart; } return cpu_frequency; } static double measure_cpu_time() { return ((double)get_cpu_time()) / get_cpu_frequency(); } #else #include #include #include static unsigned long long get_cpu_time() { #if defined(__i386__) || defined(__x86_64__) uint32_t a, d; __asm__ volatile("rdtsc" : "=a" (a), "=d" (d)); return ((uint64_t)d << 32) + a; #elif defined(__powerpc__) || defined(__ppc__) unsigned long long x, y; __asm__ __volatile__ ("\n\ 1: mftbu %1\n\ mftb %L0\n\ mftbu %0\n\ cmpw %0,%1\n\ bne- 1b" : "=r" (x), "=r" (y)); return x; #endif } static unsigned long long get_cpu_frequency() { static unsigned long long cpu_frequency; if(!cpu_frequency) { unsigned long long x, y; struct timespec ts; ts.tv_sec = 0; ts.tv_nsec = 500000000; x = get_cpu_time(); nanosleep(&ts, NULL); y = get_cpu_time(); cpu_frequency = (y - x) * 2; } return cpu_frequency; } static double measure_cpu_time() { struct rusage rusage; getrusage(RUSAGE_SELF, &rusage); double seconds = 0; seconds += rusage.ru_utime.tv_sec; seconds += rusage.ru_stime.tv_sec; seconds += rusage.ru_utime.tv_usec / 1000000.0; seconds += rusage.ru_stime.tv_usec / 1000000.0; return seconds; } #endif prof_measurer_t* prof_measurer_cpu_time() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_cpu_time; return measure; } /* call-seq: measure -> float Returns the cpu time.*/ static VALUE prof_measure_cpu_time(VALUE self) { return rb_float_new(measure_cpu_time()); } /* call-seq: cpu_frequency -> int Returns the cpu's frequency. This value is needed when RubyProf::measure_mode is set to CPU_TIME. */ static VALUE prof_get_cpu_frequency(VALUE self) { return ULL2NUM(get_cpu_frequency()); } void rp_init_measure_cpu_time() { rb_define_const(mProf, "CPU_TIME", INT2NUM(MEASURE_CPU_TIME)); rb_define_const(mProf, "CPU_TIME_ENABLED", Qtrue); cMeasureCpuTime = rb_define_class_under(mMeasure, "CpuTime", rb_cObject); rb_define_singleton_method(cMeasureCpuTime, "measure", prof_measure_cpu_time, 0); rb_define_singleton_method(cMeasureCpuTime, "frequency", prof_get_cpu_frequency, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_call_info.c0000644000175600017570000002461112766254554020214 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "ruby_prof.h" #define INITIAL_CALL_INFOS_SIZE 2 VALUE cCallInfo; // Forward declarations st_table * call_info_table_create(); /* ======= prof_call_info_t ========*/ prof_call_info_t * prof_call_info_create(prof_method_t* method, prof_call_info_t* parent) { prof_call_info_t *result = ALLOC(prof_call_info_t); result->object = Qnil; result->target = method; result->parent = parent; result->call_infos = call_info_table_create(); result->children = Qnil; result->called = 0; result->total_time = 0; result->self_time = 0; result->wait_time = 0; result->line = 0; return result; } static void prof_call_info_ruby_gc_free(prof_call_info_t *call_info) { /* Has this thread object been accessed by Ruby? If yes clean it up so to avoid a segmentation fault. */ if (call_info->object != Qnil) { RDATA(call_info->object)->data = NULL; RDATA(call_info->object)->dfree = NULL; RDATA(call_info->object)->dmark = NULL; } call_info->object = Qnil; } static void prof_call_info_free(prof_call_info_t *call_info) { prof_call_info_ruby_gc_free(call_info); st_free_table(call_info->call_infos); xfree(call_info); } static void prof_call_info_mark(prof_call_info_t *call_info) { if (call_info->object) rb_gc_mark(call_info->object); if (call_info->children) rb_gc_mark(call_info->children); /* We don't mark the call info child table since that will be done via the appropriate method */ } VALUE prof_call_info_wrap(prof_call_info_t *call_info) { if (call_info->object == Qnil) { call_info->object = Data_Wrap_Struct(cCallInfo, prof_call_info_mark, prof_call_info_ruby_gc_free, call_info); } return call_info->object; } static prof_call_info_t * prof_get_call_info(VALUE self) { /* Can't use Data_Get_Struct because that triggers the event hook ending up in endless recursion. */ prof_call_info_t* result = DATA_PTR(self); if (!result) rb_raise(rb_eRuntimeError, "This RubyProf::CallInfo instance has already been freed, likely because its profile has been freed."); return result; } /* ======= Call Info Table ========*/ st_table * call_info_table_create() { return st_init_table(&type_method_hash); } size_t call_info_table_insert(st_table *table, const prof_method_key_t *key, prof_call_info_t *val) { return st_insert(table, (st_data_t) key, (st_data_t) val); } prof_call_info_t * call_info_table_lookup(st_table *table, const prof_method_key_t *key) { st_data_t val; if (st_lookup(table, (st_data_t) key, &val)) { return (prof_call_info_t *) val; } else { return NULL; } } /* ======= RubyProf::CallInfo ========*/ /* Document-class: RubyProf::CallInfo RubyProf::CallInfo is a helper class used by RubyProf::MethodInfo to keep track of which child methods were called and how long they took to execute. */ /* call-seq: called -> MethodInfo Returns the target method. */ static VALUE prof_call_info_target(VALUE self) { /* Target is a pointer to a method_info - so we have to be careful about the GC. We will wrap the method_info but provide no free method so the underlying object is not freed twice! */ prof_call_info_t *result = prof_get_call_info(self); return prof_method_wrap(result->target); } /* call-seq: called -> int Returns the total amount of times this method was called. */ static VALUE prof_call_info_called(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); return INT2NUM(result->called); } /* call-seq: called=n -> n Sets the call count to n. */ static VALUE prof_call_info_set_called(VALUE self, VALUE called) { prof_call_info_t *result = prof_get_call_info(self); result->called = NUM2INT(called); return called; } /* call-seq: depth -> int returns the depth of this call info in the call graph */ static VALUE prof_call_info_depth(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); return rb_int_new(result->depth); } /* call-seq: line_no -> int returns the line number of the method */ static VALUE prof_call_info_line(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); return rb_int_new(result->line); } /* call-seq: total_time -> float Returns the total amount of time spent in this method and its children. */ static VALUE prof_call_info_total_time(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); return rb_float_new(result->total_time); } /* call-seq: add_total_time(call_info) -> nil adds total time time from call_info to self. */ static VALUE prof_call_info_add_total_time(VALUE self, VALUE other) { prof_call_info_t *result = prof_get_call_info(self); prof_call_info_t *other_info = prof_get_call_info(other); result->total_time += other_info->total_time; return Qnil; } /* call-seq: self_time -> float Returns the total amount of time spent in this method. */ static VALUE prof_call_info_self_time(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); return rb_float_new(result->self_time); } /* call-seq: add_self_time(call_info) -> nil adds self time from call_info to self. */ static VALUE prof_call_info_add_self_time(VALUE self, VALUE other) { prof_call_info_t *result = prof_get_call_info(self); prof_call_info_t *other_info = prof_get_call_info(other); result->self_time += other_info->self_time; return Qnil; } /* call-seq: wait_time -> float Returns the total amount of time this method waited for other threads. */ static VALUE prof_call_info_wait_time(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); return rb_float_new(result->wait_time); } /* call-seq: add_wait_time(call_info) -> nil adds wait time from call_info to self. */ static VALUE prof_call_info_add_wait_time(VALUE self, VALUE other) { prof_call_info_t *result = prof_get_call_info(self); prof_call_info_t *other_info = prof_get_call_info(other); result->wait_time += other_info->wait_time; return Qnil; } /* call-seq: parent -> call_info Returns the call_infos parent call_info object (the method that called this method).*/ static VALUE prof_call_info_parent(VALUE self) { prof_call_info_t *result = prof_get_call_info(self); if (result->parent) return prof_call_info_wrap(result->parent); else return Qnil; } /* call-seq: parent=new_parent -> new_parent Changes the parent of self to new_parent and returns it.*/ static VALUE prof_call_info_set_parent(VALUE self, VALUE new_parent) { prof_call_info_t *result = prof_get_call_info(self); if (new_parent == Qnil) result->parent = NULL; else result->parent = prof_get_call_info(new_parent); return prof_call_info_parent(self); } static int prof_call_info_collect_children(st_data_t key, st_data_t value, st_data_t result) { prof_call_info_t *call_info = (prof_call_info_t *) value; VALUE arr = (VALUE) result; rb_ary_push(arr, prof_call_info_wrap(call_info)); return ST_CONTINUE; } /* call-seq: children -> hash Returns an array of call info objects of methods that this method called (ie, children).*/ static VALUE prof_call_info_children(VALUE self) { prof_call_info_t *call_info = prof_get_call_info(self); if (call_info->children == Qnil) { call_info->children = rb_ary_new(); st_foreach(call_info->call_infos, prof_call_info_collect_children, call_info->children); } return call_info->children; } /* ======= Call Infos ========*/ prof_call_infos_t* prof_call_infos_create() { prof_call_infos_t *result = ALLOC(prof_call_infos_t); result->start = ALLOC_N(prof_call_info_t*, INITIAL_CALL_INFOS_SIZE); result->end = result->start + INITIAL_CALL_INFOS_SIZE; result->ptr = result->start; result->object = Qnil; return result; } void prof_call_infos_mark(prof_call_infos_t *call_infos) { prof_call_info_t **call_info; if (call_infos->object) rb_gc_mark(call_infos->object); for(call_info=call_infos->start; call_infoptr; call_info++) { prof_call_info_mark(*call_info); } } void prof_call_infos_free(prof_call_infos_t *call_infos) { prof_call_info_t **call_info; for(call_info=call_infos->start; call_infoptr; call_info++) { prof_call_info_free(*call_info); } } void prof_add_call_info(prof_call_infos_t *call_infos, prof_call_info_t *call_info) { if (call_infos->ptr == call_infos->end) { size_t len = call_infos->ptr - call_infos->start; size_t new_capacity = (call_infos->end - call_infos->start) * 2; REALLOC_N(call_infos->start, prof_call_info_t*, new_capacity); call_infos->ptr = call_infos->start + len; call_infos->end = call_infos->start + new_capacity; } *call_infos->ptr = call_info; call_infos->ptr++; } VALUE prof_call_infos_wrap(prof_call_infos_t *call_infos) { if (call_infos->object == Qnil) { prof_call_info_t **i; call_infos->object = rb_ary_new(); for(i=call_infos->start; iptr; i++) { VALUE call_info = prof_call_info_wrap(*i); rb_ary_push(call_infos->object, call_info); } } return call_infos->object; } void rp_init_call_info() { /* CallInfo */ cCallInfo = rb_define_class_under(mProf, "CallInfo", rb_cObject); rb_undef_method(CLASS_OF(cCallInfo), "new"); rb_define_method(cCallInfo, "parent", prof_call_info_parent, 0); rb_define_method(cCallInfo, "parent=", prof_call_info_set_parent, 1); rb_define_method(cCallInfo, "children", prof_call_info_children, 0); rb_define_method(cCallInfo, "target", prof_call_info_target, 0); rb_define_method(cCallInfo, "called", prof_call_info_called, 0); rb_define_method(cCallInfo, "called=", prof_call_info_set_called, 1); rb_define_method(cCallInfo, "total_time", prof_call_info_total_time, 0); rb_define_method(cCallInfo, "add_total_time", prof_call_info_add_total_time, 1); rb_define_method(cCallInfo, "self_time", prof_call_info_self_time, 0); rb_define_method(cCallInfo, "add_self_time", prof_call_info_add_self_time, 1); rb_define_method(cCallInfo, "wait_time", prof_call_info_wait_time, 0); rb_define_method(cCallInfo, "add_wait_time", prof_call_info_add_wait_time, 1); rb_define_method(cCallInfo, "depth", prof_call_info_depth, 0); rb_define_method(cCallInfo, "line", prof_call_info_line, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure_gc_time.c0000644000175600017570000000260512766254554021415 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ /* :nodoc: */ #include "ruby_prof.h" static VALUE cMeasureGcTimes; #if defined(HAVE_RB_GC_TIME) VALUE rb_gc_time(); #endif static double measure_gc_time() { #if defined(HAVE_RB_GC_TOTAL_TIME) #define MEASURE_GC_TIME_ENABLED Qtrue return rb_gc_total_time(); #elif defined(HAVE_RB_GC_TIME) #define MEASURE_GC_TIME_ENABLED Qtrue const double conversion = 1000000.0; #if HAVE_LONG_LONG return NUM2LL(rb_gc_time()) / conversion; #else return NUM2LONG(rb_gc_time()) / conversion; #endif #else #define MEASURE_GC_TIME_ENABLED Qfalse return 0.0; #endif } prof_measurer_t* prof_measurer_gc_time() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_gc_time; return measure; } /* call-seq: measure -> float Returns the time spent performing GC.*/ static VALUE prof_measure_gc_time(VALUE self) { return rb_float_new(measure_gc_time()); } void rp_init_measure_gc_time() { rb_define_const(mProf, "GC_TIME", INT2NUM(MEASURE_GC_TIME)); rb_define_const(mProf, "GC_TIME_ENABLED", MEASURE_GC_TIME_ENABLED); cMeasureGcTimes = rb_define_class_under(mMeasure, "GcTime", rb_cObject); rb_define_singleton_method(cMeasureGcTimes, "measure", prof_measure_gc_time, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure.c0000644000175600017570000000225412766254554017726 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "ruby_prof.h" VALUE mMeasure; prof_measurer_t* prof_get_measurer(prof_measure_mode_t measure) { switch (measure) { case MEASURE_WALL_TIME: return prof_measurer_wall_time(); case MEASURE_PROCESS_TIME: return prof_measurer_process_time(); case MEASURE_CPU_TIME: return prof_measurer_cpu_time(); case MEASURE_ALLOCATIONS: return prof_measurer_allocations(); case MEASURE_MEMORY: return prof_measurer_memory(); case MEASURE_GC_TIME: return prof_measurer_gc_time(); case MEASURE_GC_RUNS: return prof_measurer_gc_runs(); default: rb_raise(rb_eArgError, "Unknown measure mode: %d", measure); } }; void rp_init_measure() { mMeasure = rb_define_module_under(mProf, "Measure"); rp_init_measure_wall_time(); rp_init_measure_cpu_time(); rp_init_measure_process_time(); rp_init_measure_allocations(); rp_init_measure_memory(); rp_init_measure_gc_time(); rp_init_measure_gc_runs(); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure_memory.c0000644000175600017570000000362512766254554021321 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ /* :nodoc: */ #include "ruby_prof.h" static VALUE cMeasureMemory; #if defined(HAVE_RB_GC_ALLOCATED_SIZE) VALUE rb_gc_allocated_size(); #endif #if defined(HAVE_RB_GC_MALLOC_ALLOCATED_SIZE) size_t rb_gc_malloc_allocated_size(); #endif #if defined(HAVE_RB_HEAP_TOTAL_MEM) //FIXME: did not find the patch to check prototype, assuming it to return size_t size_t rb_heap_total_mem(); #endif static double measure_memory() { #if defined(HAVE_RB_GC_ALLOCATED_SIZE) #define MEASURE_MEMORY_ENABLED Qtrue #if defined(HAVE_LONG_LONG) return NUM2LL(rb_gc_allocated_size()) / 1024.0; #else return NUM2ULONG(rb_gc_allocated_size()) / 1024.0; #endif #elif defined(HAVE_RB_GC_MALLOC_ALLOCATED_SIZE) #define MEASURE_MEMORY_ENABLED Qtrue return rb_gc_malloc_allocated_size() / 1024.0; #elif defined(HAVE_RB_GC_TOTAL_MALLOCED_BYTES) #define MEASURE_MEMORY_ENABLED Qtrue return rb_gc_total_malloced_bytes() / 1024.0; #elif defined(HAVE_RB_HEAP_TOTAL_MEM) #define MEASURE_MEMORY_ENABLED Qtrue return rb_heap_total_mem() / 1024.0; #else #define MEASURE_MEMORY_ENABLED Qfalse return 0; #endif } prof_measurer_t* prof_measurer_memory() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_memory; return measure; } /* call-seq: measure_process_time -> float Returns the process time.*/ static VALUE prof_measure_memory(VALUE self) { return rb_float_new(measure_memory()); } void rp_init_measure_memory() { rb_define_const(mProf, "MEMORY", INT2NUM(MEASURE_MEMORY)); rb_define_const(mProf, "MEMORY_ENABLED", MEASURE_MEMORY_ENABLED); cMeasureMemory = rb_define_class_under(mMeasure, "Memory", rb_cObject); rb_define_singleton_method(cMeasureMemory, "measure", prof_measure_memory, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure_process_time.c0000644000175600017570000000401412766254554022476 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "ruby_prof.h" #include static VALUE cMeasureProcessTime; static double measure_process_time() { #if defined(__linux__) struct timespec clock; clock_gettime(CLOCK_PROCESS_CPUTIME_ID , &clock); return clock.tv_sec + (clock.tv_nsec/1000000000.0); #elif defined(_win32) FILETIME createTime; FILETIME exitTime; FILETIME sysTime; FILETIME cpuTime; ULARGE_INTEGER sysTimeInt; ULARGE_INTEGER cpuTimeInt; ULONGLONG totalTime; GetProcessTimes(GetCurrentProcess(), &createTime, &exitTime, &sysTime, &cpuTime); /* Doing this based on MSFT's recommendation in the FILETIME structure documentation at http://msdn.microsoft.com/en-us/library/ms724284%28VS.85%29.aspx*/ sysTimeInt.LowPart = sysTime.dwLowDateTime; sysTimeInt.HighPart = sysTime.dwHighDateTime; cpuTimeInt.LowPart = cpuTime.dwLowDateTime; cpuTimeInt.HighPart = cpuTime.dwHighDateTime; totalTime = sysTimeInt.QuadPart + cpuTimeInt.QuadPart; // Times are in 100-nanosecond time units. So instead of 10-9 use 10-7 return totalTime / 10000000.0; #else return ((double)clock()) / CLOCKS_PER_SEC; #endif } /* call-seq: measure_process_time -> float Returns the process time.*/ static VALUE prof_measure_process_time(VALUE self) { return rb_float_new(measure_process_time()); } prof_measurer_t* prof_measurer_process_time() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_process_time; return measure; } void rp_init_measure_process_time() { rb_define_const(mProf, "CLOCKS_PER_SEC", INT2NUM(CLOCKS_PER_SEC)); rb_define_const(mProf, "PROCESS_TIME", INT2NUM(MEASURE_PROCESS_TIME)); rb_define_const(mProf, "PROCESS_TIME_ENABLED", Qtrue); cMeasureProcessTime = rb_define_class_under(mMeasure, "ProcessTime", rb_cObject); rb_define_singleton_method(cMeasureProcessTime, "measure", prof_measure_process_time, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_thread.c0000644000175600017570000001714212766254554017536 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "ruby_prof.h" VALUE cRpThread; /* ====== thread_data_t ====== */ thread_data_t* thread_data_create() { thread_data_t* result = ALLOC(thread_data_t); result->stack = prof_stack_create(); result->method_table = method_table_create(); result->object = Qnil; result->methods = Qnil; return result; } /* The underlying c structures are freed when the parent profile is freed. However, on shutdown the Ruby GC frees objects in any will-nilly order. That means the ruby thread object wrapping the c thread struct may be freed before the parent profile. Thus we add in a free function for the garbage collector so that if it does get called will nil out our Ruby object reference.*/ static void thread_data_ruby_gc_free(thread_data_t* thread_data) { /* Has this thread object been accessed by Ruby? If yes clean it up so to avoid a segmentation fault. */ if (thread_data->object != Qnil) { RDATA(thread_data->object)->data = NULL; RDATA(thread_data->object)->dfree = NULL; RDATA(thread_data->object)->dmark = NULL; } thread_data->object = Qnil; } static void thread_data_free(thread_data_t* thread_data) { thread_data_ruby_gc_free(thread_data); method_table_free(thread_data->method_table); prof_stack_free(thread_data->stack); thread_data->thread_id = Qnil; xfree(thread_data); } static int mark_methods(st_data_t key, st_data_t value, st_data_t result) { prof_method_t *method = (prof_method_t *) value; prof_method_mark(method); return ST_CONTINUE; } void prof_thread_mark(thread_data_t *thread) { if (thread->object != Qnil) rb_gc_mark(thread->object); if (thread->methods != Qnil) rb_gc_mark(thread->methods); if (thread->thread_id != Qnil) rb_gc_mark(thread->thread_id); if (thread->fiber_id != Qnil) rb_gc_mark(thread->fiber_id); st_foreach(thread->method_table, mark_methods, 0); } VALUE prof_thread_wrap(thread_data_t *thread) { if (thread->object == Qnil) { thread->object = Data_Wrap_Struct(cRpThread, prof_thread_mark, thread_data_ruby_gc_free, thread); } return thread->object; } static thread_data_t* prof_get_thread(VALUE self) { /* Can't use Data_Get_Struct because that triggers the event hook ending up in endless recursion. */ thread_data_t* result = DATA_PTR(self); if (!result) rb_raise(rb_eRuntimeError, "This RubyProf::Thread instance has already been freed, likely because its profile has been freed."); return result; } /* ====== Thread Table ====== */ /* The thread table is hash keyed on ruby thread_id that stores instances of thread_data_t. */ st_table * threads_table_create() { return st_init_numtable(); } static int thread_table_free_iterator(st_data_t key, st_data_t value, st_data_t dummy) { thread_data_free((thread_data_t*)value); return ST_CONTINUE; } void threads_table_free(st_table *table) { st_foreach(table, thread_table_free_iterator, 0); st_free_table(table); } size_t threads_table_insert(prof_profile_t* profile, VALUE fiber, thread_data_t *thread_data) { /* Its too slow to key on the real thread id so just typecast thread instead. */ return st_insert(profile->threads_tbl, (st_data_t) fiber, (st_data_t) thread_data); } thread_data_t * threads_table_lookup(prof_profile_t* profile, VALUE thread_id, VALUE fiber_id) { thread_data_t* result; st_data_t val; /* If we should merge fibers, we use the thread_id as key, otherwise the fiber id. None of this is perfect, as garbage collected fiber/thread might be reused again later. A real solution would require integration with the garbage collector. */ VALUE key = profile->merge_fibers ? thread_id : fiber_id; if (st_lookup(profile->threads_tbl, (st_data_t) key, &val)) { result = (thread_data_t *) val; } else { result = thread_data_create(); result->thread_id = thread_id; /* We set fiber id to 0 in the merge fiber case. Real fibers never have id 0, so we can identify them later during printing. */ result->fiber_id = profile->merge_fibers ? INT2FIX(0) : fiber_id; /* Insert the table */ threads_table_insert(profile, key, result); } return result; } thread_data_t * switch_thread(void* prof, VALUE thread_id, VALUE fiber_id) { prof_profile_t* profile = (prof_profile_t*)prof; double measurement = profile->measurer->measure(); /* Get new thread information. */ thread_data_t *thread_data = threads_table_lookup(profile, thread_id, fiber_id); /* Get current frame for this thread */ prof_frame_t *frame = prof_stack_peek(thread_data->stack); /* Update the time this thread waited for another thread */ if (frame) { frame->wait_time += measurement - frame->switch_time; frame->switch_time = measurement; } /* Save on the last thread the time of the context switch and reset this thread's last context switch to 0.*/ if (profile->last_thread_data) { prof_frame_t *last_frame = prof_stack_peek(profile->last_thread_data->stack); if (last_frame) last_frame->switch_time = measurement; } profile->last_thread_data = thread_data; return thread_data; } int pause_thread(st_data_t key, st_data_t value, st_data_t data) { thread_data_t* thread_data = (thread_data_t *) value; prof_profile_t* profile = (prof_profile_t*)data; prof_frame_t* frame = prof_stack_peek(thread_data->stack); prof_frame_pause(frame, profile->measurement_at_pause_resume); return ST_CONTINUE; } int unpause_thread(st_data_t key, st_data_t value, st_data_t data) { thread_data_t* thread_data = (thread_data_t *) value; prof_profile_t* profile = (prof_profile_t*)data; prof_frame_t* frame = prof_stack_peek(thread_data->stack); prof_frame_unpause(frame, profile->measurement_at_pause_resume); return ST_CONTINUE; } static int collect_methods(st_data_t key, st_data_t value, st_data_t result) { /* Called for each method stored in a thread's method table. We want to store the method info information into an array.*/ VALUE methods = (VALUE) result; prof_method_t *method = (prof_method_t *) value; rb_ary_push(methods, prof_method_wrap(method)); return ST_CONTINUE; } /* call-seq: id -> number Returns the id of this thread. */ static VALUE prof_thread_id(VALUE self) { thread_data_t* thread = prof_get_thread(self); return thread->thread_id; } /* call-seq: fiber_id -> number Returns the fiber id of this thread. */ static VALUE prof_fiber_id(VALUE self) { thread_data_t* thread = prof_get_thread(self); return thread->fiber_id; } /* call-seq: methods -> Array of MethodInfo Returns an array of methods that were called from this thread during program execution. */ static VALUE prof_thread_methods(VALUE self) { thread_data_t* thread = prof_get_thread(self); if (thread->methods == Qnil) { thread->methods = rb_ary_new(); st_foreach(thread->method_table, collect_methods, thread->methods); } return thread->methods; } void rp_init_thread() { cRpThread = rb_define_class_under(mProf, "Thread", rb_cObject); rb_undef_method(CLASS_OF(cRpThread), "new"); rb_define_method(cRpThread, "id", prof_thread_id, 0); rb_define_method(cRpThread, "fiber_id", prof_fiber_id, 0); rb_define_method(cRpThread, "methods", prof_thread_methods, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure.h0000644000175600017570000000230712766254554017732 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #ifndef __RP_MEASUREMENT_H__ #define __RP_MEASUREMENT_H__ extern VALUE mMeasure; typedef double (*get_measurement)(); typedef struct { get_measurement measure; } prof_measurer_t; typedef enum { MEASURE_WALL_TIME, MEASURE_PROCESS_TIME, MEASURE_CPU_TIME, MEASURE_ALLOCATIONS, MEASURE_MEMORY, MEASURE_GC_TIME, MEASURE_GC_RUNS, } prof_measure_mode_t; prof_measurer_t* prof_get_measurer(prof_measure_mode_t measure); prof_measurer_t* prof_measurer_allocations(); prof_measurer_t* prof_measurer_cpu_time(); prof_measurer_t* prof_measurer_gc_runs(); prof_measurer_t* prof_measurer_gc_time(); prof_measurer_t* prof_measurer_memory(); prof_measurer_t* prof_measurer_process_time(); prof_measurer_t* prof_measurer_wall_time(); void rp_init_measure(); void rp_init_measure_allocations(); void rp_init_measure_cpu_time(); void rp_init_measure_gc_runs(); void rp_init_measure_gc_time(); void rp_init_measure_memory(); void rp_init_measure_process_time(); void rp_init_measure_wall_time(); #endif //__RP_MEASUREMENT_H__ ruby-prof-0.16.2/ext/ruby_prof/ruby_prof.c0000644000175600017570000004611212766254554017574 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ /* ruby-prof tracks the time spent executing every method in ruby programming. The main players are: profile_t - This represents 1 profile. thread_data_t - Stores data about a single thread. prof_stack_t - The method call stack in a particular thread prof_method_t - Profiling information about each method prof_call_info_t - Keeps track a method's callers and callees. The final result is an instance of a profile object which has a hash table of thread_data_t, keyed on the thread id. Each thread in turn has a hash table of prof_method_t, keyed on the method id. A hash table is used for quick look up when doing a profile. However, it is exposed to Ruby as an array. Each prof_method_t has two hash tables, parent and children, of prof_call_info_t. These objects keep track of a method's callers (who called the method) and its callees (who the method called). These are keyed the method id, but once again, are exposed to Ruby as arrays. Each prof_call_into_t maintains a pointer to the caller or callee method, thereby making it easy to navigate through the call hierarchy in ruby - which is very helpful for creating call graphs. */ #include "ruby_prof.h" #include VALUE mProf; VALUE cProfile; static prof_profile_t* prof_get_profile(VALUE self) { /* Can't use Data_Get_Struct because that triggers the event hook ending up in endless recursion. */ return (prof_profile_t*)RDATA(self)->data; } /* support tracing ruby events from ruby-prof. useful for getting at what actually happens inside the ruby interpreter (and ruby-prof). set environment variable RUBY_PROF_TRACE to filename you want to find the trace in. */ static FILE* trace_file = NULL; /* Copied from thread.c (1.9.3) */ static const char * get_event_name(rb_event_flag_t event) { switch (event) { case RUBY_EVENT_LINE: return "line"; case RUBY_EVENT_CLASS: return "class"; case RUBY_EVENT_END: return "end"; case RUBY_EVENT_CALL: return "call"; case RUBY_EVENT_RETURN: return "return"; case RUBY_EVENT_C_CALL: return "c-call"; case RUBY_EVENT_C_RETURN: return "c-return"; case RUBY_EVENT_RAISE: return "raise"; default: return "unknown"; } } static prof_method_t* create_method(rb_event_flag_t event, VALUE klass, ID mid, const char* source_file, int line) { /* Line numbers are not accurate for c method calls */ if (event == RUBY_EVENT_C_CALL) { line = 0; source_file = NULL; } return prof_method_create(klass, mid, source_file, line); } static prof_method_t* get_method(rb_event_flag_t event, VALUE klass, ID mid, thread_data_t* thread_data) { prof_method_key_t key; prof_method_t *method = NULL; method_key(&key, klass, mid); method = method_table_lookup(thread_data->method_table, &key); if (!method) { const char* source_file = rb_sourcefile(); int line = rb_sourceline(); method = create_method(event, klass, mid, source_file, line); method_table_insert(thread_data->method_table, method->key, method); } return method; } static int pop_frames(st_data_t key, st_data_t value, st_data_t data) { thread_data_t* thread_data = (thread_data_t *) value; prof_profile_t* profile = (prof_profile_t*) data; VALUE thread_id = thread_data->thread_id; VALUE fiber_id = thread_data->fiber_id; double measurement = profile->measurer->measure(); if (!profile->last_thread_data || (!profile->merge_fibers && profile->last_thread_data->fiber_id != fiber_id) || profile->last_thread_data->thread_id != thread_id ) thread_data = switch_thread(profile, thread_id, fiber_id); else thread_data = profile->last_thread_data; while (prof_stack_pop(thread_data->stack, measurement)); return ST_CONTINUE; } static void prof_pop_threads(prof_profile_t* profile) { st_foreach(profile->threads_tbl, pop_frames, (st_data_t) profile); } /* =========== Profiling ================= */ static void prof_trace(prof_profile_t* profile, rb_event_flag_t event, ID mid, VALUE klass, double measurement) { static VALUE last_fiber_id = Qnil; VALUE thread = rb_thread_current(); VALUE thread_id = rb_obj_id(thread); VALUE fiber = rb_fiber_current(); VALUE fiber_id = rb_obj_id(fiber); const char* class_name = NULL; const char* method_name = rb_id2name(mid); const char* source_file = rb_sourcefile(); unsigned int source_line = rb_sourceline(); const char* event_name = get_event_name(event); if (klass != 0) klass = (BUILTIN_TYPE(klass) == T_ICLASS ? RBASIC(klass)->klass : klass); class_name = rb_class2name(klass); if (last_fiber_id != fiber_id) { fprintf(trace_file, "\n"); } fprintf(trace_file, "%2lu:%2lu:%2ums %-8s %s:%2d %s#%s\n", (unsigned long) thread_id, (unsigned long) fiber_id, (unsigned int) measurement*1000, event_name, source_file, source_line, class_name, method_name); fflush(trace_file); last_fiber_id = fiber_id; } static void prof_event_hook(rb_event_flag_t event, VALUE data, VALUE self, ID mid, VALUE klass) { prof_profile_t* profile = prof_get_profile(data); VALUE thread = Qnil; VALUE thread_id = Qnil; VALUE fiber = Qnil; VALUE fiber_id = Qnil; thread_data_t* thread_data = NULL; prof_frame_t *frame = NULL; double measurement; /* if we don't have a valid method id, try to retrieve one */ if (mid == 0) { rb_frame_method_id_and_class(&mid, &klass); } /* Get current measurement */ measurement = profile->measurer->measure(); /* Special case - skip any methods from the mProf module or cProfile class since they clutter the results but aren't important to them results. */ if (self == mProf || klass == cProfile) return; if (trace_file != NULL) { prof_trace(profile, event, mid, klass, measurement); } /* Get the current thread and fiber information. */ thread = rb_thread_current(); thread_id = rb_obj_id(thread); fiber = rb_fiber_current(); fiber_id = rb_obj_id(fiber); /* Don't measure anything if the include_threads option has been specified and the current thread is not in the list */ if (profile->include_threads_tbl && !st_lookup(profile->include_threads_tbl, (st_data_t) thread_id, 0)) { return; } /* Don't measure anything if the current thread is in the excluded thread table */ if (profile->exclude_threads_tbl && st_lookup(profile->exclude_threads_tbl, (st_data_t) thread_id, 0)) { return; } /* We need to switch the profiling context if we either had none before, we don't merge fibers and the fiber ids differ, or the thread ids differ. */ if (!profile->last_thread_data || (!profile->merge_fibers && profile->last_thread_data->fiber_id != fiber_id) || profile->last_thread_data->thread_id != thread_id ) thread_data = switch_thread(profile, thread_id, fiber_id); else thread_data = profile->last_thread_data; /* Get the current frame for the current thread. */ frame = prof_stack_peek(thread_data->stack); switch (event) { case RUBY_EVENT_LINE: { /* Keep track of the current line number in this method. When a new method is called, we know what line number it was called from. */ if (frame) { frame->line = rb_sourceline(); break; } /* If we get here there was no frame, which means this is the first method seen for this thread, so fall through to below to create it. */ } case RUBY_EVENT_CALL: case RUBY_EVENT_C_CALL: { prof_call_info_t *call_info = NULL; prof_method_t *method = NULL; method = get_method(event, klass, mid, thread_data); if (!frame) { call_info = prof_call_info_create(method, NULL); prof_add_call_info(method->call_infos, call_info); } else { call_info = call_info_table_lookup(frame->call_info->call_infos, method->key); if (!call_info) { /* This call info does not yet exist. So create it, then add it to previous callinfo's children and to the current method .*/ call_info = prof_call_info_create(method, frame->call_info); call_info_table_insert(frame->call_info->call_infos, method->key, call_info); prof_add_call_info(method->call_infos, call_info); } // Unpause the parent frame. If currently paused then: // 1) The child frame will begin paused. // 2) The parent will inherit the child's dead time. prof_frame_unpause(frame, measurement); } /* Push a new frame onto the stack for a new c-call or ruby call (into a method) */ frame = prof_stack_push(thread_data->stack, measurement); frame->call_info = call_info; frame->call_info->depth = frame->depth; frame->pause_time = profile->paused == Qtrue ? measurement : -1; frame->line = rb_sourceline(); break; } case RUBY_EVENT_RETURN: case RUBY_EVENT_C_RETURN: { prof_stack_pop(thread_data->stack, measurement); break; } } } void prof_install_hook(VALUE self) { rb_add_event_hook(prof_event_hook, RUBY_EVENT_CALL | RUBY_EVENT_RETURN | RUBY_EVENT_C_CALL | RUBY_EVENT_C_RETURN | RUBY_EVENT_LINE, self); } void prof_remove_hook() { rb_remove_event_hook(prof_event_hook); } static int collect_threads(st_data_t key, st_data_t value, st_data_t result) { thread_data_t* thread_data = (thread_data_t*) value; VALUE threads_array = (VALUE) result; rb_ary_push(threads_array, prof_thread_wrap(thread_data)); return ST_CONTINUE; } /* ======== Profile Class ====== */ static int mark_threads(st_data_t key, st_data_t value, st_data_t result) { thread_data_t *thread = (thread_data_t *) value; prof_thread_mark(thread); return ST_CONTINUE; } static void prof_mark(prof_profile_t *profile) { st_foreach(profile->threads_tbl, mark_threads, 0); } /* Freeing the profile creates a cascade of freeing. It fress the thread table, which frees its methods, which frees its call infos. */ static void prof_free(prof_profile_t *profile) { profile->last_thread_data = NULL; threads_table_free(profile->threads_tbl); profile->threads_tbl = NULL; if (profile->exclude_threads_tbl) { st_free_table(profile->exclude_threads_tbl); profile->exclude_threads_tbl = NULL; } if (profile->include_threads_tbl) { st_free_table(profile->include_threads_tbl); profile->include_threads_tbl = NULL; } xfree(profile->measurer); profile->measurer = NULL; xfree(profile); } static VALUE prof_allocate(VALUE klass) { VALUE result; prof_profile_t* profile; result = Data_Make_Struct(klass, prof_profile_t, prof_mark, prof_free, profile); profile->threads_tbl = threads_table_create(); profile->exclude_threads_tbl = NULL; profile->include_threads_tbl = NULL; profile->running = Qfalse; profile->merge_fibers = 0; return result; } /* call-seq: new() new(options) Returns a new profiler. Possible options for the options hash are: measure_mode:: Measure mode. Specifies the profile measure mode. If not specified, defaults to RubyProf::WALL_TIME. exclude_threads:: Threads to exclude from the profiling results. include_threads:: Focus profiling on only the given threads. This will ignore all other threads. merge_fibers:: Whether to merge all fibers under a given thread. This should be used when profiling for a callgrind printer. */ static VALUE prof_initialize(int argc, VALUE *argv, VALUE self) { prof_profile_t* profile = prof_get_profile(self); VALUE mode_or_options; VALUE mode = Qnil; VALUE exclude_threads = Qnil; VALUE include_threads = Qnil; VALUE merge_fibers = Qnil; int i; switch (rb_scan_args(argc, argv, "02", &mode_or_options, &exclude_threads)) { case 0: break; case 1: if (FIXNUM_P(mode_or_options)) { mode = mode_or_options; } else { Check_Type(mode_or_options, T_HASH); mode = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("measure_mode"))); merge_fibers = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("merge_fibers"))); exclude_threads = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("exclude_threads"))); include_threads = rb_hash_aref(mode_or_options, ID2SYM(rb_intern("include_threads"))); } break; case 2: Check_Type(exclude_threads, T_ARRAY); break; } if (mode == Qnil) { mode = INT2NUM(MEASURE_WALL_TIME); } else { Check_Type(mode, T_FIXNUM); } profile->measurer = prof_get_measurer(NUM2INT(mode)); profile->merge_fibers = merge_fibers != Qnil && merge_fibers != Qfalse; if (exclude_threads != Qnil) { Check_Type(exclude_threads, T_ARRAY); assert(profile->exclude_threads_tbl == NULL); profile->exclude_threads_tbl = threads_table_create(); for (i = 0; i < RARRAY_LEN(exclude_threads); i++) { VALUE thread = rb_ary_entry(exclude_threads, i); VALUE thread_id = rb_obj_id(thread); st_insert(profile->exclude_threads_tbl, thread_id, Qtrue); } } if (include_threads != Qnil) { Check_Type(include_threads, T_ARRAY); assert(profile->include_threads_tbl == NULL); profile->include_threads_tbl = threads_table_create(); for (i = 0; i < RARRAY_LEN(include_threads); i++) { VALUE thread = rb_ary_entry(include_threads, i); VALUE thread_id = rb_obj_id(thread); st_insert(profile->include_threads_tbl, thread_id, Qtrue); } } return self; } /* call-seq: paused? -> boolean Returns whether a profile is currently paused.*/ static VALUE prof_paused(VALUE self) { prof_profile_t* profile = prof_get_profile(self); return profile->paused; } /* call-seq: running? -> boolean Returns whether a profile is currently running.*/ static VALUE prof_running(VALUE self) { prof_profile_t* profile = prof_get_profile(self); return profile->running; } /* call-seq: start -> self Starts recording profile data.*/ static VALUE prof_start(VALUE self) { char* trace_file_name; prof_profile_t* profile = prof_get_profile(self); if (profile->running == Qtrue) { rb_raise(rb_eRuntimeError, "RubyProf.start was already called"); } profile->running = Qtrue; profile->paused = Qfalse; profile->last_thread_data = NULL; /* open trace file if environment wants it */ trace_file_name = getenv("RUBY_PROF_TRACE"); if (trace_file_name != NULL) { if (strcmp(trace_file_name, "stdout") == 0) { trace_file = stdout; } else if (strcmp(trace_file_name, "stderr") == 0) { trace_file = stderr; } else { trace_file = fopen(trace_file_name, "w"); } } prof_install_hook(self); return self; } /* call-seq: pause -> self Pauses collecting profile data. */ static VALUE prof_pause(VALUE self) { prof_profile_t* profile = prof_get_profile(self); if (profile->running == Qfalse) { rb_raise(rb_eRuntimeError, "RubyProf is not running."); } if (profile->paused == Qfalse) { profile->paused = Qtrue; profile->measurement_at_pause_resume = profile->measurer->measure(); st_foreach(profile->threads_tbl, pause_thread, (st_data_t) profile); } return self; } /* call-seq: resume -> self resume(&block) -> self Resumes recording profile data.*/ static VALUE prof_resume(VALUE self) { prof_profile_t* profile = prof_get_profile(self); if (profile->running == Qfalse) { rb_raise(rb_eRuntimeError, "RubyProf is not running."); } if (profile->paused == Qtrue) { profile->paused = Qfalse; profile->measurement_at_pause_resume = profile->measurer->measure(); st_foreach(profile->threads_tbl, unpause_thread, (st_data_t) profile); } return rb_block_given_p() ? rb_ensure(rb_yield, self, prof_pause, self) : self; } /* call-seq: stop -> self Stops collecting profile data.*/ static VALUE prof_stop(VALUE self) { prof_profile_t* profile = prof_get_profile(self); if (profile->running == Qfalse) { rb_raise(rb_eRuntimeError, "RubyProf.start was not yet called"); } prof_remove_hook(); /* close trace file if open */ if (trace_file != NULL) { if (trace_file !=stderr && trace_file != stdout) { #ifdef _MSC_VER _fcloseall(); #else fclose(trace_file); #endif } trace_file = NULL; } prof_pop_threads(profile); /* Unset the last_thread_data (very important!) and the threads table */ profile->running = profile->paused = Qfalse; profile->last_thread_data = NULL; /* Post process result */ rb_funcall(self, rb_intern("post_process") , 0); return self; } /* call-seq: profile(&block) -> self profile(options, &block) -> self Profiles the specified block and returns a RubyProf::Profile object. Arguments are passed to Profile initialize method. */ static VALUE prof_profile(int argc, VALUE *argv, VALUE klass) { int result; VALUE profile = rb_class_new_instance(argc, argv, cProfile); if (!rb_block_given_p()) { rb_raise(rb_eArgError, "A block must be provided to the profile method."); } prof_start(profile); rb_protect(rb_yield, profile, &result); return prof_stop(profile); } /* call-seq: threads -> array of RubyProf::Thread Returns an array of RubyProf::Thread instances that were executed while the the program was being run. */ static VALUE prof_threads(VALUE self) { VALUE result = rb_ary_new(); prof_profile_t* profile = prof_get_profile(self); st_foreach(profile->threads_tbl, collect_threads, result); return result; } void Init_ruby_prof() { mProf = rb_define_module("RubyProf"); rp_init_measure(); rp_init_method_info(); rp_init_call_info(); rp_init_thread(); cProfile = rb_define_class_under(mProf, "Profile", rb_cObject); rb_define_singleton_method(cProfile, "profile", prof_profile, -1); rb_define_alloc_func (cProfile, prof_allocate); rb_define_method(cProfile, "initialize", prof_initialize, -1); rb_define_method(cProfile, "start", prof_start, 0); rb_define_method(cProfile, "stop", prof_stop, 0); rb_define_method(cProfile, "resume", prof_resume, 0); rb_define_method(cProfile, "pause", prof_pause, 0); rb_define_method(cProfile, "running?", prof_running, 0); rb_define_method(cProfile, "paused?", prof_paused, 0); rb_define_method(cProfile, "threads", prof_threads, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure_allocations.c0000644000175600017570000000363612766254554022323 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ /* :nodoc: */ #include "ruby_prof.h" static VALUE cMeasureAllocations; #if defined(HAVE_RB_OS_ALLOCATED_OBJECTS) unsigned LONG_LONG rb_os_allocated_objects(); #endif #if defined(HAVE_RB_GC_STAT) size_t rb_gc_stat(VALUE key); #if RUBY_PROF_RUBY_VERSION >= 20200 #define TOTAL_ALLOCATED_OBJECTS_STRING "total_allocated_objects" #else #define TOTAL_ALLOCATED_OBJECTS_STRING "total_allocated_object" #endif #endif static double measure_allocations() { #if defined(HAVE_RB_OS_ALLOCATED_OBJECTS) #define MEASURE_ALLOCATIONS_ENABLED Qtrue return rb_os_allocated_objects(); #elif defined(HAVE_RB_GC_STAT) && RUBY_PROF_RUBY_VERSION >= 20100 #define MEASURE_ALLOCATIONS_ENABLED Qtrue static VALUE total_alloc_symbol = 0; if (!total_alloc_symbol) { total_alloc_symbol = ID2SYM(rb_intern_const(TOTAL_ALLOCATED_OBJECTS_STRING)); } return rb_gc_stat(total_alloc_symbol); #else #define MEASURE_ALLOCATIONS_ENABLED Qfalse return 0; #endif } prof_measurer_t* prof_measurer_allocations() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_allocations; return measure; } /* call-seq: measure -> int Returns the number of Ruby object allocations. */ static VALUE prof_measure_allocations(VALUE self) { #if defined(HAVE_LONG_LONG) return ULL2NUM(measure_allocations()); #else return ULONG2NUM(measure_allocations()); #endif } void rp_init_measure_allocations() { rb_define_const(mProf, "ALLOCATIONS", INT2NUM(MEASURE_ALLOCATIONS)); rb_define_const(mProf, "ALLOCATIONS_ENABLED", MEASURE_ALLOCATIONS_ENABLED); cMeasureAllocations = rb_define_class_under(mMeasure, "Allocations", rb_cObject); rb_define_singleton_method(cMeasureAllocations, "measure", prof_measure_allocations, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_method.c0000644000175600017570000002363412766254554017552 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "ruby_prof.h" VALUE cMethodInfo; /* ================ Helper Functions =================*/ static VALUE figure_singleton_name(VALUE klass) { VALUE result = Qnil; /* We have come across a singleton object. First figure out what it is attached to.*/ VALUE attached = rb_iv_get(klass, "__attached__"); /* Is this a singleton class acting as a metaclass? */ if (BUILTIN_TYPE(attached) == T_CLASS) { result = rb_str_new2(""); } /* Is this for singleton methods on a module? */ else if (BUILTIN_TYPE(attached) == T_MODULE) { result = rb_str_new2(""); } /* Is this for singleton methods on an object? */ else if (BUILTIN_TYPE(attached) == T_OBJECT) { /* Make sure to get the super class so that we don't mistakenly grab a T_ICLASS which would lead to unknown method errors. */ VALUE super = rb_class_superclass(klass); result = rb_str_new2(""); } /* Ok, this could be other things like an array made put onto a singleton object (yeah, it happens, see the singleton objects test case). */ else { result = rb_inspect(klass); } return result; } static VALUE klass_name(VALUE klass) { VALUE result = Qnil; if (klass == 0 || klass == Qnil) { result = rb_str_new2("Global"); } else if (BUILTIN_TYPE(klass) == T_MODULE) { result = rb_inspect(klass); } else if (BUILTIN_TYPE(klass) == T_CLASS && FL_TEST(klass, FL_SINGLETON)) { result = figure_singleton_name(klass); } else if (BUILTIN_TYPE(klass) == T_CLASS) { result = rb_inspect(klass); } else { /* Should never happen. */ result = rb_str_new2("Unknown"); } return result; } static VALUE method_name(ID mid) { VALUE result; if (mid == 0) result = rb_str_new2("[No method]"); #ifdef ID_ALLOCATOR else if (mid == ID_ALLOCATOR) result = rb_str_new2("allocate"); #endif else result = rb_String(ID2SYM(mid)); return result; } static VALUE full_name(VALUE klass, ID mid) { VALUE result = rb_str_dup(klass_name(klass)); rb_str_cat2(result, "#"); rb_str_append(result, method_name(mid)); return result; } void method_key(prof_method_key_t* key, VALUE klass, ID mid) { /* Is this an include for a module? If so get the actual module class since we want to combine all profiling results for that module. */ if (klass != 0) klass = (BUILTIN_TYPE(klass) == T_ICLASS ? RBASIC(klass)->klass : klass); key->klass = klass; key->mid = mid; key->key = (klass << 4) + (mid << 2); } /* ================ prof_method_t =================*/ prof_method_t* prof_method_create(VALUE klass, ID mid, const char* source_file, int line) { prof_method_t *result = ALLOC(prof_method_t); result->object = Qnil; result->call_infos = prof_call_infos_create(); result->key = ALLOC(prof_method_key_t); method_key(result->key, klass, mid); //result->call_info_table = call_info_table_create(); if (source_file != NULL) { size_t len = strlen(source_file) + 1; char *buffer = ALLOC_N(char, len); MEMCPY(buffer, source_file, char, len); result->source_file = buffer; } else { result->source_file = source_file; } result->line = line; return result; } /* The underlying c structures are freed when the parent profile is freed. However, on shutdown the Ruby GC frees objects in any will-nilly order. That means the ruby thread object wrapping the c thread struct may be freed before the parent profile. Thus we add in a free function for the garbage collector so that if it does get called will nil out our Ruby object reference.*/ static void prof_method_ruby_gc_free(prof_method_t* method) { /* Has this thread object been accessed by Ruby? If yes clean it up so to avoid a segmentation fault. */ if (method->object != Qnil) { RDATA(method->object)->data = NULL; RDATA(method->object)->dfree = NULL; RDATA(method->object)->dmark = NULL; } method->object = Qnil; } static void prof_method_free(prof_method_t* method) { prof_method_ruby_gc_free(method); prof_call_infos_free(method->call_infos); xfree(method->call_infos); xfree(method->key); method->key = NULL; xfree(method); } void prof_method_mark(prof_method_t *method) { if (method->object) rb_gc_mark(method->object); prof_call_infos_mark(method->call_infos); } VALUE prof_method_wrap(prof_method_t *result) { if (result->object == Qnil) { result->object = Data_Wrap_Struct(cMethodInfo, prof_method_mark, prof_method_ruby_gc_free, result); } return result->object; } static prof_method_t * get_prof_method(VALUE self) { /* Can't use Data_Get_Struct because that triggers the event hook ending up in endless recursion. */ prof_method_t* result = DATA_PTR(self); if (!result) rb_raise(rb_eRuntimeError, "This RubyProf::MethodInfo instance has already been freed, likely because its profile has been freed."); return result; } /* ================ Method Table =================*/ int method_table_cmp(prof_method_key_t *key1, prof_method_key_t *key2) { return (key1->klass != key2->klass) || (key1->mid != key2->mid); } st_index_t method_table_hash(prof_method_key_t *key) { return key->key; } struct st_hash_type type_method_hash = { method_table_cmp, method_table_hash }; st_table * method_table_create() { return st_init_table(&type_method_hash); } static int method_table_free_iterator(st_data_t key, st_data_t value, st_data_t dummy) { prof_method_free((prof_method_t*)value); return ST_CONTINUE; } void method_table_free(st_table *table) { st_foreach(table, method_table_free_iterator, 0); st_free_table(table); } size_t method_table_insert(st_table *table, const prof_method_key_t *key, prof_method_t *val) { return st_insert(table, (st_data_t) key, (st_data_t) val); } prof_method_t * method_table_lookup(st_table *table, const prof_method_key_t* key) { st_data_t val; if (st_lookup(table, (st_data_t)key, &val)) { return (prof_method_t *) val; } else { return NULL; } } /* ================ Method Info =================*/ /* Document-class: RubyProf::MethodInfo The RubyProf::MethodInfo class stores profiling data for a method. One instance of the RubyProf::MethodInfo class is created per method called per thread. Thus, if a method is called in two different thread then there will be two RubyProf::MethodInfo objects created. RubyProf::MethodInfo objects can be accessed via the RubyProf::Profile object. */ /* call-seq: line_no -> int returns the line number of the method */ static VALUE prof_method_line(VALUE self) { return rb_int_new(get_prof_method(self)->line); } /* call-seq: source_file => string return the source file of the method */ static VALUE prof_method_source_file(VALUE self) { const char* sf = get_prof_method(self)->source_file; if(!sf) { return rb_str_new2("ruby_runtime"); } else { return rb_str_new2(sf); } } /* call-seq: method_class -> klass Returns the Ruby klass that owns this method. */ static VALUE prof_method_klass(VALUE self) { prof_method_t *result = get_prof_method(self); return result->key->klass; } /* call-seq: method_id -> ID Returns the id of this method. */ static VALUE prof_method_id(VALUE self) { prof_method_t *result = get_prof_method(self); return ID2SYM(result->key->mid); } /* call-seq: klass_name -> string Returns the name of this method's class. Singleton classes will have the form . */ static VALUE prof_klass_name(VALUE self) { prof_method_t *method = get_prof_method(self); return klass_name(method->key->klass); } /* call-seq: method_name -> string Returns the name of this method in the format Object#method. Singletons methods will be returned in the format #method.*/ static VALUE prof_method_name(VALUE self) { prof_method_t *method = get_prof_method(self); return method_name(method->key->mid); } /* call-seq: full_name -> string Returns the full name of this method in the format Object#method.*/ static VALUE prof_full_name(VALUE self) { prof_method_t *method = get_prof_method(self); return full_name(method->key->klass, method->key->mid); } /* call-seq: call_infos -> Array of call_info Returns an array of call info objects that contain profiling information about the current method.*/ static VALUE prof_method_call_infos(VALUE self) { prof_method_t *method = get_prof_method(self); if (method->call_infos->object == Qnil) { method->call_infos->object = prof_call_infos_wrap(method->call_infos); } return method->call_infos->object; } void rp_init_method_info() { /* MethodInfo */ cMethodInfo = rb_define_class_under(mProf, "MethodInfo", rb_cObject); rb_undef_method(CLASS_OF(cMethodInfo), "new"); rb_define_method(cMethodInfo, "klass", prof_method_klass, 0); rb_define_method(cMethodInfo, "klass_name", prof_klass_name, 0); rb_define_method(cMethodInfo, "method_name", prof_method_name, 0); rb_define_method(cMethodInfo, "full_name", prof_full_name, 0); rb_define_method(cMethodInfo, "method_id", prof_method_id, 0); rb_define_method(cMethodInfo, "source_file", prof_method_source_file,0); rb_define_method(cMethodInfo, "line", prof_method_line, 0); rb_define_method(cMethodInfo, "call_infos", prof_method_call_infos, 0); } ruby-prof-0.16.2/ext/ruby_prof/rp_measure_gc_runs.c0000644000175600017570000000321312766254554021442 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ /* :nodoc: */ #include "ruby_prof.h" static VALUE cMeasureGcRuns; #if defined(HAVE_RB_GC_COLLECTIONS) VALUE rb_gc_collections(void); #endif #if defined(HAVE_RB_GC_COUNT) size_t rb_gc_count(void); #endif #if defined(HAVE_RB_GC_HEAP_INFO) VALUE rb_gc_heap_info(void); #endif static double measure_gc_runs() { #if defined(HAVE_RB_GC_COLLECTIONS) #define MEASURE_GC_RUNS_ENABLED Qtrue return NUM2INT(rb_gc_collections()); #elif defined(HAVE_RB_GC_COUNT) #define MEASURE_GC_RUNS_ENABLED Qtrue return rb_gc_count(); #elif defined(HAVE_RB_GC_HEAP_INFO) #define MEASURE_GC_RUNS_ENABLED Qtrue VALUE h = rb_gc_heap_info(); return NUM2UINT(rb_hash_aref(h, rb_str_new2("num_gc_passes"))); #else #define MEASURE_GC_RUNS_ENABLED Qfalse return 0; #endif } prof_measurer_t* prof_measurer_gc_runs() { prof_measurer_t* measure = ALLOC(prof_measurer_t); measure->measure = measure_gc_runs; return measure; } /* call-seq: measure -> int Returns the number of GC runs.*/ static VALUE prof_measure_gc_runs(VALUE self) { #if defined(HAVE_LONG_LONG) return ULL2NUM(measure_gc_runs()); #else return ULONG2NUM(measure_gc_runs()); #endif } void rp_init_measure_gc_runs() { rb_define_const(mProf, "GC_RUNS", INT2NUM(MEASURE_GC_RUNS)); rb_define_const(mProf, "GC_RUNS_ENABLED", MEASURE_GC_RUNS_ENABLED); cMeasureGcRuns = rb_define_class_under(mMeasure, "GcRuns", rb_cObject); rb_define_singleton_method(cMeasureGcRuns, "measure", prof_measure_gc_runs, 0); } ruby-prof-0.16.2/ext/ruby_prof/ruby_prof.h0000644000175600017570000000255712766254554017606 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #ifndef __RUBY_PROF_H__ #define __RUBY_PROF_H__ #include #include #if RUBY_PROF_RUBY_VERSION == 10806 # error 1.8.6 is not supported. Please upgrade to 1.9.3 or higher. #endif #if RUBY_PROF_RUBY_VERSION == 10807 # error 1.8.7 is not supported. Please upgrade to 1.9.3 or higher. #endif #if RUBY_PROF_RUBY_VERSION == 10900 # error 1.9.0 is not supported. Please upgrade to 1.9.3 or higher. #endif #if RUBY_PROF_RUBY_VERSION == 10901 # error 1.9.1 is not supported. Please upgrade to 1.9.3 or higher. #endif #if RUBY_PROF_RUBY_VERSION == 10902 # error 1.9.2 is not supported. Please upgrade to 1.9.3 or higher. #endif #include "rp_measure.h" #include "rp_method.h" #include "rp_call_info.h" #include "rp_stack.h" #include "rp_thread.h" extern VALUE mProf; extern VALUE cProfile; void method_key(prof_method_key_t* key, VALUE klass, ID mid); typedef struct { VALUE running; VALUE paused; prof_measurer_t* measurer; VALUE threads; st_table* threads_tbl; st_table* exclude_threads_tbl; st_table* include_threads_tbl; thread_data_t* last_thread_data; double measurement_at_pause_resume; int merge_fibers; } prof_profile_t; #endif //__RUBY_PROF_H__ ruby-prof-0.16.2/ext/ruby_prof/vc/0000755000175600017570000000000012766254554016025 5ustar pravipraviruby-prof-0.16.2/ext/ruby_prof/vc/ruby_prof_19.vcxproj0000644000175600017570000001306312766254554021765 0ustar pravipravi Debug Win32 Release Win32 {5AF7F29A-B100-4D61-95DA-DB21D7C8C1B8} Win32Proj ruby_prof DynamicLibrary true Unicode DynamicLibrary false true Unicode true ..\..\..\lib\1.9 .so ruby_prof false Level3 Disabled WIN32;_DEBUG;_WINDOWS;_USRDLL;RUBY_PROF_EXPORTS;%(PreprocessorDefinitions) C:\MinGW\local\ruby193vc\include\ruby-1.9.1;C:\MinGW\local\ruby193vc\include\ruby-1.9.1\i386-mswin32_100;%(AdditionalIncludeDirectories) Windows true C:\MinGW\local\ruby193vc\lib;%(AdditionalLibraryDirectories) msvcr100-ruby191.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies) ruby_prof.def Level3 MaxSpeed true true WIN32;NDEBUG;_WINDOWS;_USRDLL;RUBY_PROF_EXPORTS;%(PreprocessorDefinitions) Windows true true true ruby-prof-0.16.2/ext/ruby_prof/vc/ruby_prof_18.vcxproj0000644000175600017570000001251312766254554021763 0ustar pravipravi Debug Win32 Release Win32 {7789FC23-D053-4733-9ED1-D6CE099E1237} Win32Proj ruby_prof_18 DynamicLibrary true Unicode DynamicLibrary false true Unicode true C:\MinGW\local\src\ruby-prof\lib\1.8 .so ruby_prof false NotUsing Level3 Disabled WIN32;_DEBUG;_WINDOWS;_USRDLL;RUBY_PROF_18_EXPORTS;%(PreprocessorDefinitions) C:\MinGW\local\ruby187vc\lib\ruby\1.8\i386-mswin32_100 Windows true C:\MinGW\local\ruby187vc\lib msvcr100-ruby18.lib;%(AdditionalDependencies) ruby_prof.def Level3 Use MaxSpeed true true WIN32;NDEBUG;_WINDOWS;_USRDLL;RUBY_PROF_18_EXPORTS;%(PreprocessorDefinitions) Windows true true true ruby-prof-0.16.2/ext/ruby_prof/vc/ruby_prof_20.vcxproj0000644000175600017570000001306312766254554021755 0ustar pravipravi Debug Win32 Release Win32 {6B4978F4-3B5F-4D38-81A8-069EC28CC069} Win32Proj ruby_prof DynamicLibrary true Unicode DynamicLibrary false true Unicode true ..\..\..\lib\2.0 .so ruby_prof false Level3 Disabled WIN32;_DEBUG;_WINDOWS;_USRDLL;RUBY_PROF_EXPORTS;%(PreprocessorDefinitions) C:\MinGW\local\ruby200vc\include\ruby-2.0.0;C:\MinGW\local\ruby200vc\include\ruby-2.0.0\i386-mswin32_100;%(AdditionalIncludeDirectories) Windows true C:\MinGW\local\ruby200vc\lib;%(AdditionalLibraryDirectories) msvcr100-ruby200.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies) ruby_prof.def Level3 MaxSpeed true true WIN32;NDEBUG;_WINDOWS;_USRDLL;RUBY_PROF_EXPORTS;%(PreprocessorDefinitions) Windows true true true ruby-prof-0.16.2/ext/ruby_prof/vc/ruby_prof.sln0000644000175600017570000000342612766254554020557 0ustar pravipravi Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ruby_prof_18", "ruby_prof_18.vcxproj", "{7789FC23-D053-4733-9ED1-D6CE099E1237}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ruby_prof_19", "ruby_prof_19.vcxproj", "{5AF7F29A-B100-4D61-95DA-DB21D7C8C1B8}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ruby_prof_20", "ruby_prof_20.vcxproj", "{6B4978F4-3B5F-4D38-81A8-069EC28CC069}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {7789FC23-D053-4733-9ED1-D6CE099E1237}.Debug|Win32.ActiveCfg = Debug|Win32 {7789FC23-D053-4733-9ED1-D6CE099E1237}.Debug|Win32.Build.0 = Debug|Win32 {7789FC23-D053-4733-9ED1-D6CE099E1237}.Release|Win32.ActiveCfg = Release|Win32 {7789FC23-D053-4733-9ED1-D6CE099E1237}.Release|Win32.Build.0 = Release|Win32 {5AF7F29A-B100-4D61-95DA-DB21D7C8C1B8}.Debug|Win32.ActiveCfg = Debug|Win32 {5AF7F29A-B100-4D61-95DA-DB21D7C8C1B8}.Debug|Win32.Build.0 = Debug|Win32 {5AF7F29A-B100-4D61-95DA-DB21D7C8C1B8}.Release|Win32.ActiveCfg = Release|Win32 {5AF7F29A-B100-4D61-95DA-DB21D7C8C1B8}.Release|Win32.Build.0 = Release|Win32 {6B4978F4-3B5F-4D38-81A8-069EC28CC069}.Debug|Win32.ActiveCfg = Debug|Win32 {6B4978F4-3B5F-4D38-81A8-069EC28CC069}.Debug|Win32.Build.0 = Debug|Win32 {6B4978F4-3B5F-4D38-81A8-069EC28CC069}.Release|Win32.ActiveCfg = Release|Win32 {6B4978F4-3B5F-4D38-81A8-069EC28CC069}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal ruby-prof-0.16.2/ext/ruby_prof/rp_call_info.h0000644000175600017570000000303012766254554020211 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #ifndef __RP_CALL_INFO_H__ #define __RP_CALL_INFO_H__ #include "rp_measure.h" #include "rp_method.h" extern VALUE cCallInfo; /* Callers and callee information for a method. */ typedef struct prof_call_info_t { prof_method_t *target; /* Use target instead of method to avoid conflict with Ruby method */ struct prof_call_info_t *parent; st_table *call_infos; int called; int depth; double total_time; double self_time; double wait_time; int line; VALUE object; VALUE children; } prof_call_info_t; /* Array of call_info objects */ typedef struct prof_call_infos_t { prof_call_info_t **start; prof_call_info_t **end; prof_call_info_t **ptr; VALUE object; } prof_call_infos_t; void rp_init_call_info(void); prof_call_infos_t* prof_call_infos_create(); void prof_call_infos_mark(prof_call_infos_t *call_infos); void prof_call_infos_free(prof_call_infos_t *call_infos); void prof_add_call_info(prof_call_infos_t *call_infos, prof_call_info_t *call_info); VALUE prof_call_infos_wrap(prof_call_infos_t *call_infos); prof_call_info_t * prof_call_info_create(prof_method_t* method, prof_call_info_t* parent); prof_call_info_t * call_info_table_lookup(st_table *table, const prof_method_key_t *key); size_t call_info_table_insert(st_table *table, const prof_method_key_t *key, prof_call_info_t *val); #endif //__RP_CALL_INFO_H__ ruby-prof-0.16.2/ext/ruby_prof/rp_method.h0000644000175600017570000000351312766254554017551 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #ifndef __RP_METHOD_INFO__ #define __RP_METHOD_INFO__ #include extern VALUE cMethodInfo; /* A key used to identify each method */ typedef struct { VALUE klass; /* The method's class. */ ID mid; /* The method id. */ st_index_t key; /* Cache calculated key */ } prof_method_key_t; /* Forward declaration, see rp_call_info.h */ struct prof_call_infos_t; /* Profiling information for each method. */ typedef struct { prof_method_key_t *key; /* Method key */ const char *source_file; /* The method's source file */ int line; /* The method's line number. */ struct prof_call_infos_t *call_infos; /* Call info objects for this method */ VALUE object; /* Cached ruby object */ } prof_method_t; void rp_init_method_info(void); void method_key(prof_method_key_t* key, VALUE klass, ID mid); st_table * method_table_create(); prof_method_t * method_table_lookup(st_table *table, const prof_method_key_t* key); size_t method_table_insert(st_table *table, const prof_method_key_t *key, prof_method_t *val); void method_table_free(st_table *table); prof_method_t* prof_method_create(VALUE klass, ID mid, const char* source_file, int line); VALUE prof_method_wrap(prof_method_t *result); void prof_method_mark(prof_method_t *method); /* Setup infrastructure to use method keys as hash comparisons */ int method_table_cmp(prof_method_key_t *key1, prof_method_key_t *key2); st_index_t method_table_hash(prof_method_key_t *key); extern struct st_hash_type type_method_hash; #endif ruby-prof-0.16.2/ext/ruby_prof/rp_thread.h0000644000175600017570000000212412766254554017535 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #ifndef __RP_THREAD__ #define __RP_THREAD__ /* Profiling information for a thread. */ typedef struct { VALUE object; /* Cache to wrapped object */ VALUE methods; /* Array of RubyProf::MethodInfo */ VALUE thread_id; /* Thread id */ VALUE fiber_id; /* Fiber id */ st_table* method_table; /* Methods called in the thread */ prof_stack_t* stack; /* Stack of frames */ } thread_data_t; void rp_init_thread(); st_table * threads_table_create(); thread_data_t* switch_thread(void* prof, VALUE thread_id, VALUE fiber_id); void threads_table_free(st_table *table); VALUE prof_thread_wrap(thread_data_t *thread); void prof_thread_mark(thread_data_t *thread); int pause_thread(st_data_t key, st_data_t value, st_data_t data); int unpause_thread(st_data_t key, st_data_t value, st_data_t data); #endif //__RP_THREAD__ ruby-prof-0.16.2/ext/ruby_prof/rp_stack.c0000644000175600017570000000644512766254554017400 0ustar pravipravi/* Copyright (C) 2005-2013 Shugo Maeda and Charlie Savage Please see the LICENSE file for copyright and distribution information */ #include "rp_stack.h" #define INITIAL_STACK_SIZE 8 void prof_frame_pause(prof_frame_t *frame, double current_measurement) { if (frame && prof_frame_is_unpaused(frame)) frame->pause_time = current_measurement; } void prof_frame_unpause(prof_frame_t *frame, double current_measurement) { if (frame && prof_frame_is_paused(frame)) { frame->dead_time += (current_measurement - frame->pause_time); frame->pause_time = -1; } } /* Creates a stack of prof_frame_t to keep track of timings for active methods. */ prof_stack_t * prof_stack_create() { prof_stack_t *stack = ALLOC(prof_stack_t); stack->start = ALLOC_N(prof_frame_t, INITIAL_STACK_SIZE); stack->ptr = stack->start; stack->end = stack->start + INITIAL_STACK_SIZE; return stack; } void prof_stack_free(prof_stack_t *stack) { xfree(stack->start); xfree(stack); } prof_frame_t * prof_stack_push(prof_stack_t *stack, double measurement) { prof_frame_t* result = NULL; /* Is there space on the stack? If not, double its size. */ if (stack->ptr == stack->end ) { size_t len = stack->ptr - stack->start; size_t new_capacity = (stack->end - stack->start) * 2; REALLOC_N(stack->start, prof_frame_t, new_capacity); /* Memory just got moved, reset pointers */ stack->ptr = stack->start + len; stack->end = stack->start + new_capacity; } // Setup returned stack pointer to be valid result = stack->ptr; result->child_time = 0; result->switch_time = 0; result->wait_time = 0; result->dead_time = 0; result->depth = (int)(stack->ptr - stack->start); // shortening of 64 bit into 32 result->start_time = measurement; // Increment the stack ptr for next time stack->ptr++; // Return the result return result; } prof_frame_t * prof_stack_pop(prof_stack_t *stack, double measurement) { prof_frame_t *frame = NULL; prof_frame_t* parent_frame = NULL; prof_call_info_t *call_info; double total_time; double self_time; /* Frame can be null. This can happen if RubProf.start is called from a method that exits. And it can happen if an exception is raised in code that is being profiled and the stack unwinds (RubyProf is not notified of that by the ruby runtime. */ if (stack->ptr == stack->start) return NULL; frame = --stack->ptr; /* Calculate the total time this method took */ prof_frame_unpause(frame, measurement); total_time = measurement - frame->start_time - frame->dead_time; self_time = total_time - frame->child_time - frame->wait_time; /* Update information about the current method */ call_info = frame->call_info; call_info->called++; call_info->total_time += total_time; call_info->self_time += self_time; call_info->wait_time += frame->wait_time; parent_frame = prof_stack_peek(stack); if (parent_frame) { parent_frame->child_time += total_time; parent_frame->dead_time += frame->dead_time; call_info->line = parent_frame->line; } return frame; } prof_frame_t * prof_stack_peek(prof_stack_t *stack) { if (stack->ptr == stack->start) return NULL; else return stack->ptr - 1; } ruby-prof-0.16.2/ext/ruby_prof/extconf.rb0000644000175600017570000000330112766254554017405 0ustar pravipravirequire "mkmf" if RUBY_ENGINE != "ruby" STDERR.puts("\n\n***** This gem is MRI-specific. It does not support #{RUBY_ENGINE}. *****\n\n") exit(1) end if RUBY_VERSION < "1.9.3" STDERR.puts("\n\n***** Ruby version #{RUBY_VERSION} is no longer supported. Please upgrade to 1.9.3 or higher. *****\n\n") exit(1) end # standard ruby methods have_func("rb_gc_stat") have_func("rb_gc_count") # Alexander Dymo GC patch have_func("rb_os_allocated_objects") have_func("rb_gc_allocated_size") # Stefan Kaes GC patches have_func("rb_gc_collections") have_func("rb_gc_time") # for ruby 2.1 have_func("rb_gc_total_time") have_func("rb_gc_total_mallocs") have_func("rb_gc_total_malloced_bytes") # Lloyd Hilaiel's heap info patch have_func("rb_heap_total_mem") have_func("rb_gc_heap_info") def add_define(name, value = nil) if value $defs.push("-D#{name}=#{value}") else $defs.push("-D#{name}") end end def windows? RbConfig::CONFIG['host_os'] =~ /mswin|mingw/ end if !windows? && RUBY_PLATFORM !~ /(darwin|openbsd)/ $LDFLAGS += " -lrt" # for clock_gettime end add_define("RUBY_PROF_RUBY_VERSION", RUBY_VERSION.split('.')[0..2].inject(0){|v,d| v*100+d.to_i}) # for ruby 1.9, determine whether threads inherit trace flags (latest 1.9.2 and later should work correctly) if RUBY_VERSION > "1.9" require 'set' threads = Set.new set_trace_func lambda { |*args| threads << Thread.current.object_id } Thread.new{1}.join set_trace_func nil if threads.size < 2 # if we end up here, ruby does not automatically activate tracing in spawned threads STDERR.puts("Ruby #{RUBY_VERSION} does not activate tracing in spawned threads. Consider upgrading.") exit(1) end end create_makefile("ruby_prof") ruby-prof-0.16.2/examples/0000755000175600017570000000000012766254554014424 5ustar pravipraviruby-prof-0.16.2/examples/stack.html0000644000175600017570000004122312766254554016421 0ustar pravipravi ruby-prof call tree
      Call tree for application primes
      Generated on 2015-04-24 11:52:24 +0200 with options {:application=>"primes"}
      Threshold:
      Thread: 70140045951280, Fiber: 70140054192180 (100.00% ~ 0.0029680728912353516)
      • 100.00% (100.00%) PrintersTest#setup [1 calls, 1 total]
        • 99.82% (99.82%) Object#run_primes [1 calls, 1 total]
          • 92.62% (92.78%) Object#find_primes [1 calls, 1 total]
            • 92.55% (99.93%) Array#select [1 calls, 1 total]
              • 89.73% (96.95%) Object#is_prime [200 calls, 200 total]
                • 86.63% (96.54%) Integer#upto [200 calls, 201 total]
          • 6.64% (6.65%) Object#make_random_array [1 calls, 1 total]
            • 6.33% (95.40%) Array#each_index [1 calls, 1 total]
              • 3.96% (62.56%) Kernel#rand [200 calls, 200 total]
                • 1.02% (25.76%) Kernel#respond_to_missing? [200 calls, 200 total]
      ruby-prof-0.16.2/examples/cachegrind.out.10000644000175600017570000000442512766254554017410 0ustar pravipravievents: wall_time fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#first 0 1 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#find_largest 31 3 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#first calls=1 32 32 1 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Integer#upto calls=1 36 36 11 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Integer#upto 0 2582 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#is_prime 16 92 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Integer#upto calls=200 18 18 2571 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#select 0 84 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#is_prime calls=200 26 26 2663 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#find_primes 24 2 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#select calls=1 25 25 2747 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Kernel#respond_to_missing? 0 30 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Kernel#rand 0 87 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Kernel#respond_to_missing? calls=200 10 10 30 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#each_index 0 70 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Kernel#rand calls=200 10 10 118 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#initialize 0 2 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Class#new 0 4 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#initialize calls=1 8 8 2 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#make_random_array 7 3 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Class#new calls=1 8 8 6 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#each_index calls=1 9 9 188 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#run_primes 45 2 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#make_random_array calls=1 47 47 197 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#find_primes calls=1 50 50 2749 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#find_largest calls=1 53 53 15 fl=/Users/stefan.kaes/src/ruby-prof/test/printers_test.rb fn=PrintersTest#setup 14 5 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#run_primes calls=1 14 14 2963 ruby-prof-0.16.2/examples/multi.flat.txt0000644000175600017570000000237712766254554017255 0ustar pravipraviMeasure Mode: wall_time Thread ID: 70140045951280 Fiber ID: 70140054192180 Total: 0.002968 Sort by: self_time %self total self wait child calls name 86.99 0.003 0.003 0.000 0.000 201 Integer#upto 3.11 0.003 0.000 0.000 0.003 200 Object#is_prime 2.94 0.000 0.000 0.000 0.000 200 Kernel#rand 2.82 0.003 0.000 0.000 0.003 1 Array#select 2.37 0.000 0.000 0.000 0.000 1 Array#each_index 1.02 0.000 0.000 0.000 0.000 200 Kernel#respond_to_missing? 0.18 0.003 0.000 0.000 0.003 1 PrintersTest#setup 0.14 0.000 0.000 0.000 0.000 1 Class#new 0.10 0.000 0.000 0.000 0.000 1 Object#find_largest 0.10 0.000 0.000 0.000 0.000 1 Object#make_random_array 0.06 0.003 0.000 0.000 0.003 1 Object#find_primes 0.06 0.000 0.000 0.000 0.000 1 Array#initialize 0.06 0.003 0.000 0.000 0.003 1 Object#run_primes 0.03 0.000 0.000 0.000 0.000 1 Array#first * indicates recursively called methods ruby-prof-0.16.2/examples/multi.grind.dat0000644000175600017570000000442512766254554017357 0ustar pravipravievents: wall_time fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#first 0 1 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#find_largest 31 3 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#first calls=1 32 32 1 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Integer#upto calls=1 36 36 11 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Integer#upto 0 2582 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#is_prime 16 92 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Integer#upto calls=200 18 18 2571 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#select 0 84 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#is_prime calls=200 26 26 2663 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#find_primes 24 2 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#select calls=1 25 25 2747 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Kernel#respond_to_missing? 0 30 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Kernel#rand 0 87 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Kernel#respond_to_missing? calls=200 10 10 30 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#each_index 0 70 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Kernel#rand calls=200 10 10 118 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#initialize 0 2 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Class#new 0 4 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#initialize calls=1 8 8 2 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#make_random_array 7 3 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Class#new calls=1 8 8 6 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#each_index calls=1 9 9 188 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#run_primes 45 2 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#make_random_array calls=1 47 47 197 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#find_primes calls=1 50 50 2749 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#find_largest calls=1 53 53 15 fl=/Users/stefan.kaes/src/ruby-prof/test/printers_test.rb fn=PrintersTest#setup 14 5 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#run_primes calls=1 14 14 2963 ruby-prof-0.16.2/examples/multi.stack.html0000644000175600017570000004310012766254554017546 0ustar pravipravi ruby-prof call tree
      Call tree for application primes
      Generated on 2015-04-24 11:52:24 +0200 with options {:application=>"primes"}
      Threshold:
      Thread: 70140045951280, Fiber: 70140054192180 (100.00% ~ 0.0029680728912353516)
      • 100.00% (100.00%) PrintersTest#setup [1 calls, 1 total]
        • 99.82% (99.82%) Object#run_primes [1 calls, 1 total]
          • 92.62% (92.78%) Object#find_primes [1 calls, 1 total]
            • 92.55% (99.93%) Array#select [1 calls, 1 total]
              • 89.73% (96.95%) Object#is_prime [200 calls, 200 total]
                • 86.63% (96.54%) Integer#upto [200 calls, 201 total]
          • 6.64% (6.65%) Object#make_random_array [1 calls, 1 total]
            • 6.33% (95.40%) Array#each_index [1 calls, 1 total]
              • 3.96% (62.56%) Kernel#rand [200 calls, 200 total]
                • 1.02% (25.76%) Kernel#respond_to_missing? [200 calls, 200 total]
      ruby-prof-0.16.2/examples/flat.txt0000644000175600017570000000442112766254554016114 0ustar pravipravi= Flat Profiles Flat profiles show the total amount of time spent in each method. As an example, here is the output from running printers_test.rb. Measure Mode: wall_time Thread ID: 70355159212340 Fiber ID: 70355171633140 Total: 0.060485 Sort by: self_time %self total self wait child calls name 97.07 0.059 0.059 0.000 0.000 1001 Integer#upto 0.92 0.059 0.001 0.000 0.059 1000 Object#is_prime 0.66 0.060 0.000 0.000 0.059 1 Array#select 0.59 0.000 0.000 0.000 0.000 1000 Kernel#rand 0.50 0.001 0.000 0.000 0.000 1 Array#each_index 0.20 0.000 0.000 0.000 0.000 1000 Kernel#respond_to_missing? 0.01 0.000 0.000 0.000 0.000 1 Object#find_largest 0.01 0.060 0.000 0.000 0.060 1 PrintersTest#setup 0.01 0.060 0.000 0.000 0.060 1 Object#find_primes 0.01 0.000 0.000 0.000 0.000 1 Class#new 0.01 0.060 0.000 0.000 0.060 1 Object#run_primes 0.00 0.000 0.000 0.000 0.000 1 Array#first 0.00 0.001 0.000 0.000 0.001 1 Object#make_random_array 0.00 0.000 0.000 0.000 0.000 1 Array#initialize All values are in seconds. The columns are: %self - The percentage of time spent in this method, derived from self_time/total_time total - The time spent in this method and its children. self - The time spent in this method. wait - amount of time this method waited for other threads child - The time spent in this method's children. calls - The number of times this method was called. name - The name of the method. Methods are sorted based on %self, therefore the methods that execute the longest are listed first. For example, wee can see that Integer#upto took the most time, 0.059 seconds. Method Object#is_prime calls this method, so the 0.59 seconds appear as child time for Object#is_prime. The interpretation of method names is: * MyObject#test - An instance method "test" of the class "MyObject" * #test - The <> characters indicate a singleton method on a singleton class. ruby-prof-0.16.2/examples/graph.html0000644000175600017570000004126712766254554016425 0ustar pravipravi

      Graph Profile

      Graph profiles show how long each method runs, which methods call it and which methods it calls. To understand how to read a graph profile, refer to the documentation for the text graph report.

      The main advantage of an HTML graph format versus the text format is the use of hyperlinks to jump between methods. This makes it easier to understand the flow of control through a program and which methods take the most time.

      Below is the output from running printers_test.rb reproduced in HTML.

      Profile Report

      Thread ID Total Time
      21277412 8.766

      Thread 21277412

      %Total %Self Total Self Children Calls Name
      100.00% 0.00% 8.77 0.00 8.77 1 #toplevel
          8.77 0.00 8.77 1/1 Object#run_primes
          8.77 0.00 8.77 1/1 #toplevel
      100.00% 0.00% 8.77 0.00 8.77 1 Object#run_primes
          0.02 0.00 0.02 1/1 Object#make_random_array
          2.09 0.00 2.09 1/1 Object#find_largest
          6.66 0.00 6.66 1/1 Object#find_primes
          6.63 4.06 2.56 500/501 Object#is_prime
          2.09 0.00 2.09 1/501 Object#find_largest
      99.48% 46.34% 8.72 4.06 4.66 501 Integer#upto
          0.00 0.00 0.00 61/61 Array#[]
          0.00 0.00 0.00 61/61 Fixnum#_
          2.09 2.09 0.00 61/61 Kernel.sleep
          1.24 1.24 0.00 250862/250862 Fixnum#==
          1.33 1.33 0.00 250862/250862 Fixnum#%
          6.66 0.01 6.64 1/1 Object#find_primes
      75.93% 0.17% 6.66 0.01 6.64 1 Array#select
          6.64 0.01 6.63 500/500 Object#is_prime
          6.66 0.00 6.66 1/1 Object#run_primes
      75.93% 0.00% 6.66 0.00 6.66 1 Object#find_primes
          6.66 0.01 6.64 1/1 Array#select
          6.64 0.01 6.63 500/500 Array#select
      75.76% 0.17% 6.64 0.01 6.63 500 Object#is_prime
          0.00 0.00 0.00 500/501 Fixnum#-
          6.63 4.06 2.56 500/501 Integer#upto
          2.09 0.00 2.09 1/1 Object#run_primes
      23.89% 0.00% 2.09 0.00 2.09 1 Object#find_largest
          0.00 0.00 0.00 1/501 Fixnum#-
          2.09 0.00 2.09 1/501 Integer#upto
          0.00 0.00 0.00 1/1 Array#first
          0.00 0.00 0.00 1/1 Array#length
          2.09 2.09 0.00 61/61 Integer#upto
      23.89% 23.89% 2.09 2.09 0.00 61 Kernel.sleep
          1.33 1.33 0.00 250862/250862 Integer#upto
      15.12% 15.12% 1.33 1.33 0.00 250862 Fixnum#%
          1.24 1.24 0.00 250862/250862 Integer#upto
      14.13% 14.13% 1.24 1.24 0.00 250862 Fixnum#==
          0.02 0.00 0.02 1/1 Object#run_primes
      0.18% 0.00% 0.02 0.00 0.02 1 Object#make_random_array
          0.02 0.02 0.00 1/1 Array#each_index
          0.00 0.00 0.00 1/1 Class#new
          0.02 0.02 0.00 1/1 Object#make_random_array
      0.18% 0.18% 0.02 0.02 0.00 1 Array#each_index
          0.00 0.00 0.00 500/500 Kernel.rand
          0.00 0.00 0.00 500/500 Array#[]=
          0.00 0.00 0.00 500/501 Object#is_prime
          0.00 0.00 0.00 1/501 Object#find_largest
      0.00% 0.00% 0.00 0.00 0.00 501 Fixnum#-
          0.00 0.00 0.00 1/1 Kernel.rand
      0.00% 0.00% 0.00 0.00 0.00 1 Integer#to_int
          0.00 0.00 0.00 1/1 Object#find_largest
      0.00% 0.00% 0.00 0.00 0.00 1 Array#first
          0.00 0.00 0.00 1/1 Class#new
      0.00% 0.00% 0.00 0.00 0.00 1 Array#initialize
          0.00 0.00 0.00 1/1 Object#find_largest
      0.00% 0.00% 0.00 0.00 0.00 1 Array#length
          0.00 0.00 0.00 1/1 Object#make_random_array
      0.00% 0.00% 0.00 0.00 0.00 1 Class#new
          0.00 0.00 0.00 1/1 Array#initialize
          0.00 0.00 0.00 61/61 Integer#upto
      0.00% 0.00% 0.00 0.00 0.00 61 Fixnum#_
          0.00 0.00 0.00 61/61 Integer#upto
      0.00% 0.00% 0.00 0.00 0.00 61 Array#[]
          0.00 0.00 0.00 500/500 Array#each_index
      0.00% 0.00% 0.00 0.00 0.00 500 Array#[]=
          0.00 0.00 0.00 500/500 Array#each_index
      0.00% 0.00% 0.00 0.00 0.00 500 Kernel.rand
          0.00 0.00 0.00 1/1 Integer#to_int
      ruby-prof-0.16.2/examples/graph.dot0000644000175600017570000000522712766254554016243 0ustar pravipravidigraph "Profile" { labelloc=t; labeljust=l; subgraph "Thread 70140045951280" { 70140046535720 [label="setup\n(100%)"]; 70140046535720 -> 70140046535660 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535660 [label="run_primes\n(100%)"]; 70140046535660 -> 70140046534940 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535660 -> 70140046535640 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535660 -> 70140046534640 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046534940 [label="find_primes\n(93%)"]; 70140046534940 -> 70140046534920 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046534920 [label="select\n(93%)"]; 70140046534920 -> 70140046534840 [label="200/200" fontsize=10 fontcolor="#666666"]; 70140046534840 [label="is_prime\n(90%)"]; 70140046534840 -> 70140046534820 [label="200/201" fontsize=10 fontcolor="#666666"]; 70140046534820 [label="upto\n(87%)"]; 70140046535640 [label="make_random_array\n(7%)"]; 70140046535640 -> 70140046535500 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535640 -> 70140046535600 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535500 [label="each_index\n(6%)"]; 70140046535500 -> 70140046535140 [label="200/200" fontsize=10 fontcolor="#666666"]; 70140046535140 [label="rand\n(4%)"]; 70140046535140 -> 70140046535100 [label="200/200" fontsize=10 fontcolor="#666666"]; 70140046535100 [label="respond_to_missing?\n(1%)"]; 70140046534640 [label="find_largest\n(1%)"]; 70140046534640 -> 70140046534820 [label="1/201" fontsize=10 fontcolor="#666666"]; 70140046534640 -> 70140046534620 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535600 [label="new\n(0%)"]; 70140046535600 -> 70140046535580 [label="1/1" fontsize=10 fontcolor="#666666"]; 70140046535580 [label="initialize\n(0%)"]; 70140046534620 [label="first\n(0%)"]; } subgraph cluster_70140046962360 { label = "PrintersTest"; fontcolor = "#666666"; fontsize = 16; color = "#666666"; 70140046535720; } subgraph cluster_70140046962240 { label = "Object"; fontcolor = "#666666"; fontsize = 16; color = "#666666"; 70140046535660; 70140046535640; 70140046534940; 70140046534840; 70140046534640; } subgraph cluster_70140046962040 { label = "Class"; fontcolor = "#666666"; fontsize = 16; color = "#666666"; 70140046535600; } subgraph cluster_70140046961920 { label = "Array"; fontcolor = "#666666"; fontsize = 16; color = "#666666"; 70140046535580; 70140046535500; 70140046534920; 70140046534620; } subgraph cluster_70140046961720 { label = "Kernel"; fontcolor = "#666666"; fontsize = 16; color = "#666666"; 70140046535140; 70140046535100; } subgraph cluster_70140046961280 { label = "Integer"; fontcolor = "#666666"; fontsize = 16; color = "#666666"; 70140046534820; } } ruby-prof-0.16.2/examples/graph.txt0000644000175600017570000002132712766254554016273 0ustar pravipravi= Graph Profiles Graph profiles show how long each method runs, which methods call it and which methods it calls. As an example, here is the output from running printers_test.rb: Measure Mode: wall_time Thread ID: 70310439543100 Fiber ID: 70310456289620 Total Time: 0.05264616012573242 Sort by: total_time %total %self total self wait child calls name -------------------------------------------------------------------------------- 100.00% 0.01% 0.053 0.000 0.000 0.053 1 PrintersTest#setup 0.053 0.000 0.000 0.053 1/1 Object#run_primes -------------------------------------------------------------------------------- 0.053 0.000 0.000 0.053 1/1 PrintersTest#setup 99.99% 0.01% 0.053 0.000 0.000 0.053 1 Object#run_primes 0.052 0.000 0.000 0.052 1/1 Object#find_primes 0.001 0.000 0.000 0.001 1/1 Object#make_random_array 0.000 0.000 0.000 0.000 1/1 Object#find_largest -------------------------------------------------------------------------------- 0.052 0.000 0.000 0.052 1/1 Object#run_primes 98.35% 0.00% 0.052 0.000 0.000 0.052 1 Object#find_primes 0.052 0.000 0.000 0.051 1/1 Array#select -------------------------------------------------------------------------------- 0.052 0.000 0.000 0.051 1/1 Object#find_primes 98.34% 0.61% 0.052 0.000 0.000 0.051 1 Array#select 0.051 0.000 0.000 0.051 1000/1000 Object#is_prime -------------------------------------------------------------------------------- 0.051 0.000 0.000 0.051 1000/1000 Array#select 97.74% 0.93% 0.051 0.000 0.000 0.051 1000 Object#is_prime 0.051 0.051 0.000 0.000 1000/1001 Integer#upto -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1/1001 Object#find_largest 0.051 0.051 0.000 0.000 1000/1001 Object#is_prime 96.91% 96.91% 0.051 0.051 0.000 0.000 1001 Integer#upto -------------------------------------------------------------------------------- 0.001 0.000 0.000 0.001 1/1 Object#run_primes 1.51% 0.00% 0.001 0.000 0.000 0.001 1 Object#make_random_array 0.001 0.000 0.000 0.000 1/1 Array#each_index 0.000 0.000 0.000 0.000 1/1 Class#new -------------------------------------------------------------------------------- 0.001 0.000 0.000 0.000 1/1 Object#make_random_array 1.50% 0.56% 0.001 0.000 0.000 0.000 1 Array#each_index 0.000 0.000 0.000 0.000 1000/1000 Kernel#rand -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1000/1000 Array#each_index 0.94% 0.72% 0.000 0.000 0.000 0.000 1000 Kernel#rand 0.000 0.000 0.000 0.000 1000/1000 Kernel#respond_to_missing? -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1000/1000 Kernel#rand 0.22% 0.22% 0.000 0.000 0.000 0.000 1000 Kernel#respond_to_missing? -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1/1 Object#run_primes 0.12% 0.02% 0.000 0.000 0.000 0.000 1 Object#find_largest 0.000 0.000 0.000 0.000 1/1001 Integer#upto 0.000 0.000 0.000 0.000 1/1 Array#first -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1/1 Object#make_random_array 0.01% 0.00% 0.000 0.000 0.000 0.000 1 Class#new 0.000 0.000 0.000 0.000 1/1 Array#initialize -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1/1 Class#new 0.01% 0.01% 0.000 0.000 0.000 0.000 1 Array#initialize -------------------------------------------------------------------------------- 0.000 0.000 0.000 0.000 1/1 Object#find_largest 0.00% 0.00% 0.000 0.000 0.000 0.000 1 Array#first == Overview Dashed lines divide the report into entries, with one entry per method. Entries are sorted by total time which is the time spent in the method plus its children. Each entry has a primary line demarked by values in the %total and %self columns. The primary line represents the method being profiled. Lines above it are the methods that called this method (parents) while the lines below it are the methods it called (children). All values are in seconds. For the primary line, the columns represent: %total - The percentage of time spent in this method and its children %self - The percentage of time spent in this method total - The time spent in this method and its children. self - The time spent in this method. wait - The time spent waiting for other threads in this method. child - The time spent in this method's children. calls - The number of times this method was called. name - The name of the method. The interpretation of method names is: MyObject#test - An instance method "test" of the class "MyObject" #test - The <> characters indicate a singleton method on a singleton class. For example, we see that 97.74% of the time was spent in Object#is_prime and its children. Of that time, almost everything was contributed by Integer#upto. Overall, Integer#upto was called 1001 times and 1000 of those calls were made by Object#is_prime. == Parents In each entry, the lines above the primary line are the methods that called the current method. If the current method is a root method then no parents are shown. For parent lines, the columns represent: total - The time spent in the current method and its children on behalf of the parent method. self - The time spent in this method on behalf of the parent method. child - The time spent in this method's children on behalf of the parent. wait - The time spent waiting for other threads in this method's children on behalf of the parent. calls - The number of times the parent method called the current method vs. the total number of calls of the current method. Looking at the main entry for Integer#upto, we see that it was called 1000 times from Object#is_prime and 1 time from find_largest. == Children In each entry, the lines below the primary line are the methods that the current method called. If the current method is a leaf method then no children are shown. For children lines, the columns represent: total - The time spent in the child, and its descendants, on behalf of the current method self - The time spent in the child on behalf of the current method. wait - The time spent waiting for other threads in the child's and its descendants on behalf of the current method. child - The time spent in the child's descendants on behalf of the current method. calls - The number of times the child method was called by the current method vs. the total number of calls of the child method. If we look at the main entry for Objext#run_primes, we see that it called three other methods - Object#find_primes, Object#make_random_array and Object#find_largest. ruby-prof-0.16.2/examples/multi.graph.html0000644000175600017570000006475112766254554017561 0ustar pravipravi

      Profile Report: wall_time

      Thread ID Fiber ID Total Time
      70140045951280 70140054192180 0.0029680728912353516

      Thread 70140045951280, Fiber: 70140054192180

      %Total %Self Total Self Wait Child Calls Name Line
      100.00% 0.18% 0.00 0.00 0.00 0.00 1 PrintersTest#setup 14
          0.00 0.00 0.00 0.00 1/1 Object#run_primes 14
          0.00 0.00 0.00 0.00 1/1 PrintersTest#setup 14
      99.82% 0.06% 0.00 0.00 0.00 0.00 1 Object#run_primes 45
          0.00 0.00 0.00 0.00 1/1 Object#find_primes 50
          0.00 0.00 0.00 0.00 1/1 Object#make_random_array 47
          0.00 0.00 0.00 0.00 1/1 Object#find_largest 53
          0.00 0.00 0.00 0.00 1/1 Object#run_primes 50
      92.62% 0.06% 0.00 0.00 0.00 0.00 1 Object#find_primes 24
          0.00 0.00 0.00 0.00 1/1 Array#select 25
          0.00 0.00 0.00 0.00 1/1 Object#find_primes 25
      92.55% 2.82% 0.00 0.00 0.00 0.00 1 Array#select
          0.00 0.00 0.00 0.00 200/200 Object#is_prime
          0.00 0.00 0.00 0.00 200/200 Array#select
      89.73% 3.11% 0.00 0.00 0.00 0.00 200 Object#is_prime 16
          0.00 0.00 0.00 0.00 200/201 Integer#upto 18
          0.00 0.00 0.00 0.00 1/201 Object#find_largest 36
          0.00 0.00 0.00 0.00 200/201 Object#is_prime 18
      86.99% 86.99% 0.00 0.00 0.00 0.00 201 Integer#upto
          0.00 0.00 0.00 0.00 1/1 Object#run_primes 47
      6.64% 0.10% 0.00 0.00 0.00 0.00 1 Object#make_random_array 7
          0.00 0.00 0.00 0.00 1/1 Array#each_index 9
          0.00 0.00 0.00 0.00 1/1 Class#new 8
          0.00 0.00 0.00 0.00 1/1 Object#make_random_array 9
      6.33% 2.37% 0.00 0.00 0.00 0.00 1 Array#each_index
          0.00 0.00 0.00 0.00 200/200 Kernel#rand
          0.00 0.00 0.00 0.00 200/200 Array#each_index
      3.96% 2.94% 0.00 0.00 0.00 0.00 200 Kernel#rand
          0.00 0.00 0.00 0.00 200/200 Kernel#respond_to_missing?
          0.00 0.00 0.00 0.00 200/200 Kernel#rand
      1.02% 1.02% 0.00 0.00 0.00 0.00 200 Kernel#respond_to_missing?
          0.00 0.00 0.00 0.00 1/1 Object#run_primes 53
      0.51% 0.10% 0.00 0.00 0.00 0.00 1 Object#find_largest 31
          0.00 0.00 0.00 0.00 1/201 Integer#upto 36
          0.00 0.00 0.00 0.00 1/1 Array#first 32
          0.00 0.00 0.00 0.00 1/1 Object#make_random_array 8
      0.20% 0.14% 0.00 0.00 0.00 0.00 1 Class#new
          0.00 0.00 0.00 0.00 1/1 Array#initialize
          0.00 0.00 0.00 0.00 1/1 Class#new
      0.06% 0.06% 0.00 0.00 0.00 0.00 1 Array#initialize
          0.00 0.00 0.00 0.00 1/1 Object#find_largest 32
      0.03% 0.03% 0.00 0.00 0.00 0.00 1 Array#first
      * indicates recursively called methods
      ruby-prof-0.16.2/examples/cachegrind.out.1.323132130000644000175600017570000000442512766254554020310 0ustar pravipravievents: wall_time fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#first 0 1 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#find_largest 31 3 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#first calls=1 32 32 1 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Integer#upto calls=1 36 36 11 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Integer#upto 0 2582 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#is_prime 16 92 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Integer#upto calls=200 18 18 2571 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#select 0 84 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#is_prime calls=200 26 26 2663 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#find_primes 24 2 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#select calls=1 25 25 2747 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Kernel#respond_to_missing? 0 30 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Kernel#rand 0 87 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Kernel#respond_to_missing? calls=200 10 10 30 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#each_index 0 70 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Kernel#rand calls=200 10 10 118 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Array#initialize 0 2 fl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime fn=Class#new 0 4 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#initialize calls=1 8 8 2 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#make_random_array 7 3 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Class#new calls=1 8 8 6 cfl=/Users/stefan.kaes/src/ruby-prof/ruby_runtime cfn=Array#each_index calls=1 9 9 188 fl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb fn=Object#run_primes 45 2 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#make_random_array calls=1 47 47 197 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#find_primes calls=1 50 50 2749 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#find_largest calls=1 53 53 15 fl=/Users/stefan.kaes/src/ruby-prof/test/printers_test.rb fn=PrintersTest#setup 14 5 cfl=/Users/stefan.kaes/src/ruby-prof/test/prime.rb cfn=Object#run_primes calls=1 14 14 2963 ruby-prof-0.16.2/Rakefile0000644000175600017570000000646612766254554014267 0ustar pravipravi# encoding: utf-8 require "rubygems/package_task" require "rake/extensiontask" require "rake/testtask" require "rdoc/task" require "date" require "rake/clean" begin require "bundler/setup" Bundler::GemHelper.install_tasks [:build, :install, :release].each {|t| Rake::Task[t].enhance [:rdoc] } rescue LoadError $stderr.puts "Install bundler to get support for simplified gem publishing" end # To release a version of ruby-prof: # * Update lib/ruby-prof/version.rb # * Update CHANGES # * git commit to commit files # * rake clobber to remove extra files # * rake compile to build windows gems # * rake package to create the gems # * Tag the release (git tag 0.10.1) # * Push to ruybgems.org (gem push pkg/) # For a ruby only release, just run # * rake release # it will push changes to github, tag the release, build the package and upload it to rubygems.org # and in case you forgot to increment the version number or have uncommitted changes, it will refuse to work GEM_NAME = 'ruby-prof' SO_NAME = 'ruby_prof' default_spec = Gem::Specification.load("#{GEM_NAME}.gemspec") # specify which versions/builds to cross compile Rake::ExtensionTask.new do |ext| ext.gem_spec = default_spec ext.name = SO_NAME ext.ext_dir = "ext/#{SO_NAME}" ext.lib_dir = "lib/#{RUBY_VERSION}" ext.cross_compile = true ext.cross_platform = ['x86-mswin32-60', 'x86-mingw32-60'] end # Rake task to build the default package Gem::PackageTask.new(default_spec) do |pkg| pkg.need_tar = true end # make sure rdoc has been built when packaging # why do we ship rdoc as part of the gem? Rake::Task[:package].enhance [:rdoc] # Setup Windows Gem if RUBY_PLATFORM.match(/win32|mingw32/) # Windows specification win_spec = default_spec.clone win_spec.platform = Gem::Platform::CURRENT win_spec.files += Dir.glob('lib/**/*.so') win_spec.instance_variable_set(:@cache_file, nil) # Hack to work around gem issue # Unset extensions win_spec.extensions = nil # Rake task to build the windows package Gem::PackageTask.new(win_spec) do |pkg| pkg.need_tar = false end end # --------- RDoc Documentation ------ desc "Generate rdoc documentation" RDoc::Task.new("rdoc") do |rdoc| rdoc.rdoc_dir = 'doc' rdoc.title = "ruby-prof" # Show source inline with line numbers rdoc.options << "--line-numbers" # Make the readme file the start page for the generated html rdoc.options << '--main' << 'README.rdoc' rdoc.rdoc_files.include('bin/*', 'doc/*.rdoc', 'examples/flat.txt', 'examples/graph.txt', 'examples/graph.html', 'lib/**/*.rb', 'ext/ruby_prof/ruby_prof.c', 'ext/ruby_prof/measure_*.h', 'README.rdoc', 'LICENSE') end task :default => :test for file in Dir['lib/**/*.{o,so,bundle}'] CLEAN.include file end for file in Dir['doc/**/*.{txt,dat,png,html}'] CLEAN.include file end CLEAN.reject!{|f| !File.exist?(f)} task :clean do # remove tmp dir contents completely after cleaning FileUtils.rm_rf('tmp/*') end desc 'Run the ruby-prof test suite' Rake::TestTask.new do |t| t.libs += %w(lib ext test) t.test_files = Dir['test/**_test.rb'] t.verbose = true t.warning = true end ruby-prof-0.16.2/ruby-prof.gemspec0000644000175600017570000000427212766254554016105 0ustar pravipravi# -*- encoding: utf-8 -*- $:.push File.expand_path("../lib", __FILE__) require "ruby-prof/version" Gem::Specification.new do |spec| spec.name = "ruby-prof" spec.homepage = "https://github.com/ruby-prof/ruby-prof/" spec.summary = "Fast Ruby profiler" spec.description = <<-EOF ruby-prof is a fast code profiler for Ruby. It is a C extension and therefore is many times faster than the standard Ruby profiler. It supports both flat and graph profiles. For each method, graph profiles show how long the method ran, which methods called it and which methods it called. RubyProf generate both text and html and can output it to standard out or to a file. EOF spec.license = 'BSD-2-Clause' spec.version = RubyProf::VERSION spec.author = "Shugo Maeda, Charlie Savage, Roger Pack, Stefan Kaes" spec.email = "shugo@ruby-lang.org, cfis@savagexi.com, rogerdpack@gmail.com, skaes@railsexpress.de" spec.platform = Gem::Platform::RUBY spec.require_path = "lib" spec.bindir = "bin" spec.executables = ["ruby-prof", "ruby-prof-check-trace"] spec.extensions = ["ext/ruby_prof/extconf.rb"] spec.files = Dir['CHANGES', 'LICENSE', 'Rakefile', 'README.rdoc', 'ruby-prof.gemspec', 'bin/ruby-prof', 'bin/ruby-prof-check-trace', 'doc/**/*', 'examples/*', 'ext/ruby_prof/extconf.rb', 'ext/ruby_prof/*.c', 'ext/ruby_prof/*.h', 'ext/ruby_prof/vc/*.sln', 'ext/ruby_prof/vc/*.vcxproj', 'lib/ruby-prof.rb', 'lib/unprof.rb', 'lib/ruby-prof/*.rb', 'lib/ruby-prof/assets/*.{html,png}', 'lib/ruby-prof/printers/*.rb', 'test/*.rb'] spec.test_files = Dir["test/test_*.rb"] spec.required_ruby_version = '>= 1.9.3' spec.date = Time.now.strftime('%Y-%m-%d') spec.homepage = 'https://github.com/ruby-prof/ruby-prof' spec.add_development_dependency('minitest', '~> 5.8.3') spec.add_development_dependency('rake-compiler') spec.add_development_dependency('rdoc') end