benchmark.3

视频监控网络部分的协议ddns,的模块的实现代码,请大家大胆指正.

Returns a Benchmark object.
.IP "timethese ( \s-1COUNT\s0, \s-1CODEHASHREF\s0, [ \s-1STYLE\s0 ] )" 10
.IX Item "timethese ( COUNT, CODEHASHREF, [ STYLE ] )"
The \s-1CODEHASHREF\s0 is a reference to a hash containing names as keys
and either a string to eval or a code reference for each value.
For each (\s-1KEY\s0, \s-1VALUE\s0) pair in the \s-1CODEHASHREF\s0, this routine will
call
.Sp
.Vb 1
\&        timethis(COUNT, VALUE, KEY, STYLE)
.Ve
.Sp
The routines are called in string comparison order of \s-1KEY\s0.
.Sp
The \s-1COUNT\s0 can be zero or negative, see \fItimethis()\fR.
.Sp
Returns a hash reference of Benchmark objects, keyed by name.
.IP "timediff ( T1, T2 )" 10
.IX Item "timediff ( T1, T2 )"
Returns the difference between two Benchmark times as a Benchmark
object suitable for passing to \fItimestr()\fR.
.IP "timestr ( \s-1TIMEDIFF\s0, [ \s-1STYLE\s0, [ \s-1FORMAT\s0 ] ] )" 10
.IX Item "timestr ( TIMEDIFF, [ STYLE, [ FORMAT ] ] )"
Returns a string that formats the times in the \s-1TIMEDIFF\s0 object in
the requested \s-1STYLE\s0. \s-1TIMEDIFF\s0 is expected to be a Benchmark object
similar to that returned by \fItimediff()\fR.
.Sp
\&\s-1STYLE\s0 can be any of 'all', 'none', 'noc', 'nop' or 'auto'. 'all' shows
each of the 5 times available ('wallclock' time, user time, system time,
user time of children, and system time of children). 'noc' shows all
except the two children times. 'nop' shows only wallclock and the
two children times. 'auto' (the default) will act as 'all' unless
the children times are both zero, in which case it acts as 'noc'.
\&'none' prevents output.
.Sp
\&\s-1FORMAT\s0 is the \fIprintf\fR\|(3)\-style format specifier (without the
leading '%') to use to print the times. It defaults to '5.2f'.
.Sh "Optional Exports"
.IX Subsection "Optional Exports"
The following routines will be exported into your namespace
if you specifically ask that they be imported:
.IP "clearcache ( \s-1COUNT\s0 )" 10
.IX Item "clearcache ( COUNT )"
Clear the cached time for \s-1COUNT\s0 rounds of the null loop.
.IP "clearallcache ( )" 10
.IX Item "clearallcache ( )"
Clear all cached times.
.IP "cmpthese ( \s-1COUNT\s0, \s-1CODEHASHREF\s0, [ \s-1STYLE\s0 ] )" 10
.IX Item "cmpthese ( COUNT, CODEHASHREF, [ STYLE ] )"
.PD 0
.IP "cmpthese ( \s-1RESULTSHASHREF\s0, [ \s-1STYLE\s0 ] )" 10
.IX Item "cmpthese ( RESULTSHASHREF, [ STYLE ] )"
.PD
Optionally calls \fItimethese()\fR, then outputs comparison chart.  This:
.Sp
.Vb 1
\&    cmpthese( \-1, { a => "++\e$i", b => "\e$i *= 2" } ) ;
.Ve
.Sp
outputs a chart like:
.Sp
.Vb 3
\&           Rate    b    a
\&    b 2831802/s   \-\- \-61%
\&    a 7208959/s 155%   \-\-
.Ve
.Sp
This chart is sorted from slowest to fastest, and shows the percent speed
difference between each pair of tests.
.Sp
c<cmpthese> can also be passed the data structure that \fItimethese()\fR returns:
.Sp
.Vb 2
\&    $results = timethese( \-1, { a => "++\e$i", b => "\e$i *= 2" } ) ;
\&    cmpthese( $results );
.Ve
.Sp
in case you want to see both sets of results.
If the first argument is an unblessed hash reference,
that is \s-1RESULTSHASHREF\s0; otherwise that is \s-1COUNT\s0.
.Sp
Returns a reference to an \s-1ARRAY\s0 of rows, each row is an \s-1ARRAY\s0 of cells from the
above chart, including labels. This:
.Sp
.Vb 1
\&    my $rows = cmpthese( \-1, { a => \*(Aq++$i\*(Aq, b => \*(Aq$i *= 2\*(Aq }, "none" );
.Ve
.Sp
returns a data structure like:
.Sp
.Vb 5
\&    [
\&        [ \*(Aq\*(Aq,       \*(AqRate\*(Aq,   \*(Aqb\*(Aq,    \*(Aqa\*(Aq ],
\&        [ \*(Aqb\*(Aq, \*(Aq2885232/s\*(Aq,  \*(Aq\-\-\*(Aq, \*(Aq\-59%\*(Aq ],
\&        [ \*(Aqa\*(Aq, \*(Aq7099126/s\*(Aq, \*(Aq146%\*(Aq,  \*(Aq\-\-\*(Aq ],
\&    ]
.Ve
.Sp
\&\fB\s-1NOTE\s0\fR: This result value differs from previous versions, which returned
the \f(CW\*(C`timethese()\*(C'\fR result structure.  If you want that, just use the two
statement \f(CW\*(C`timethese\*(C'\fR...\f(CW\*(C`cmpthese\*(C'\fR idiom shown above.
.Sp
Incidently, note the variance in the result values between the two examples;
this is typical of benchmarking.  If this were a real benchmark, you would
probably want to run a lot more iterations.
.IP "countit(\s-1TIME\s0, \s-1CODE\s0)" 10
.IX Item "countit(TIME, CODE)"
Arguments: \s-1TIME\s0 is the minimum length of time to run \s-1CODE\s0 for, and \s-1CODE\s0 is
the code to run.  \s-1CODE\s0 may be either a code reference or a string to
be eval'd; either way it will be run in the caller's package.
.Sp
\&\s-1TIME\s0 is \fInot\fR negative.  \fIcountit()\fR will run the loop many times to
calculate the speed of \s-1CODE\s0 before running it for \s-1TIME\s0.  The actual
time run for will usually be greater than \s-1TIME\s0 due to system clock
resolution, so it's best to look at the number of iterations divided
by the times that you are concerned with, not just the iterations.
.Sp
Returns: a Benchmark object.
.IP "disablecache ( )" 10
.IX Item "disablecache ( )"
Disable caching of timings for the null loop. This will force Benchmark
to recalculate these timings for each new piece of code timed.
.IP "enablecache ( )" 10
.IX Item "enablecache ( )"
Enable caching of timings for the null loop. The time taken for \s-1COUNT\s0
rounds of the null loop will be calculated only once for each
different \s-1COUNT\s0 used.
.IP "timesum ( T1, T2 )" 10
.IX Item "timesum ( T1, T2 )"
Returns the sum of two Benchmark times as a Benchmark object suitable
for passing to \fItimestr()\fR.
.Sh ":hireswallclock"
.IX Subsection ":hireswallclock"
If the Time::HiRes module has been installed, you can specify the
special tag \f(CW\*(C`:hireswallclock\*(C'\fR for Benchmark (if Time::HiRes is not
available, the tag will be silently ignored).  This tag will cause the
wallclock time to be measured in microseconds, instead of integer
seconds.  Note though that the speed computations are still conducted
in \s-1CPU\s0 time, not wallclock time.
.SH "NOTES"
.IX Header "NOTES"
The data is stored as a list of values from the time and times
functions:
.PP
.Vb 1
\&      ($real, $user, $system, $children_user, $children_system, $iters)
.Ve
.PP
in seconds for the whole loop (not divided by the number of rounds).
.PP
The timing is done using \fItime\fR\|(3) and \fItimes\fR\|(3).
.PP
Code is executed in the caller's package.
.PP
The time of the null loop (a loop with the same
number of rounds but empty loop body) is subtracted
from the time of the real loop.
.PP
The null loop times can be cached, the key being the
number of rounds. The caching can be controlled using
calls like these:
.PP
.Vb 2
\&    clearcache($key);
\&    clearallcache();
\&
\&    disablecache();
\&    enablecache();
.Ve
.PP
Caching is off by default, as it can (usually slightly) decrease
accuracy and does not usually noticably affect runtimes.
.SH "EXAMPLES"
.IX Header "EXAMPLES"
For example,
.PP
.Vb 6
\&    use Benchmark qw( cmpthese ) ;
\&    $x = 3;
\&    cmpthese( \-5, {
\&        a => sub{$x*$x},
\&        b => sub{$x**2},
\&    } );
.Ve
.PP
outputs something like this:
.PP
.Vb 4
\&   Benchmark: running a, b, each for at least 5 CPU seconds...
\&          Rate    b    a
\&   b 1559428/s   \-\- \-62%
\&   a 4152037/s 166%   \-\-
.Ve
.PP
while
.PP
.Vb 7
\&    use Benchmark qw( timethese cmpthese ) ;
\&    $x = 3;
\&    $r = timethese( \-5, {
\&        a => sub{$x*$x},
\&        b => sub{$x**2},
\&    } );
\&    cmpthese $r;
.Ve
.PP
outputs something like this:
.PP
.Vb 6
\&    Benchmark: running a, b, each for at least 5 CPU seconds...
\&             a: 10 wallclock secs ( 5.14 usr +  0.13 sys =  5.27 CPU) @ 3835055.60/s (n=20210743)
\&             b:  5 wallclock secs ( 5.41 usr +  0.00 sys =  5.41 CPU) @ 1574944.92/s (n=8520452)
\&           Rate    b    a
\&    b 1574945/s   \-\- \-59%
\&    a 3835056/s 144%   \-\-
.Ve
.SH "INHERITANCE"
.IX Header "INHERITANCE"
Benchmark inherits from no other class, except of course
for Exporter.
.SH "CAVEATS"
.IX Header "CAVEATS"
Comparing eval'd strings with code references will give you
inaccurate results: a code reference will show a slightly slower
execution time than the equivalent eval'd string.
.PP
The real time timing is done using \fItime\fR\|(2) and
the granularity is therefore only one second.
.PP
Short tests may produce negative figures because perl
can appear to take longer to execute the empty loop
than a short test; try:
.PP
.Vb 1
\&    timethis(100,\*(Aq1\*(Aq);
.Ve
.PP
The system time of the null loop might be slightly
more than the system time of the loop with the actual
code and therefore the difference might end up being < 0.
.SH "SEE ALSO"
.IX Header "SEE ALSO"
Devel::DProf \- a Perl code profiler
.SH "AUTHORS"
.IX Header "AUTHORS"
Jarkko Hietaniemi <\[e-mail]\fR>, Tim Bunce <\[e-mail]\fR>
.SH "MODIFICATION HISTORY"
.IX Header "MODIFICATION HISTORY"
September 8th, 1994; by Tim Bunce.
.PP
March 28th, 1997; by Hugo van der Sanden: added support for code
references and the already documented 'debug' method; revamped
documentation.
.PP
April 04\-07th, 1997: by Jarkko Hietaniemi, added the run-for-some-time
functionality.
.PP
September, 1999; by Barrie Slaymaker: math fixes and accuracy and 
efficiency tweaks.  Added \fIcmpthese()\fR.  A result is now returned from 
\&\fItimethese()\fR.  Exposed \fIcountit()\fR (was \fIrunfor()\fR).
.PP
December, 2001; by Nicholas Clark: make \fItimestr()\fR recognise the style 'none'
and return an empty string. If cmpthese is calling timethese, make it pass the
style in. (so that 'none' will suppress output). Make sub new dump its
debugging output to \s-1STDERR\s0, to be consistent with everything else.
All bugs found while writing a regression test.
.PP
September, 2002; by Jarkko Hietaniemi: add ':hireswallclock' special tag.
.PP
February, 2004; by Chia-liang Kao: make cmpthese and timestr use time
statistics for children instead of parent when the style is 'nop'.
.PP
November, 2007; by Christophe Grosjean: make cmpthese and timestr compute
time consistently with style argument, default is 'all' not 'noc' any more.