mirror of https://github.com/grpc/grpc.git
commit
71c77bebea
27 changed files with 787 additions and 112 deletions
@ -0,0 +1,6 @@ |
||||
provider _stap { |
||||
probe add_mark(int tag); |
||||
probe timing_ns_begin(int tag); |
||||
probe timing_ns_end(int tag); |
||||
}; |
||||
|
@ -0,0 +1,57 @@ |
||||
/*
|
||||
* |
||||
* Copyright 2015, Google Inc. |
||||
* All rights reserved. |
||||
* |
||||
* Redistribution and use in source and binary forms, with or without |
||||
* modification, are permitted provided that the following conditions are |
||||
* met: |
||||
* |
||||
* * Redistributions of source code must retain the above copyright |
||||
* notice, this list of conditions and the following disclaimer. |
||||
* * 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. |
||||
* * Neither the name of Google Inc. nor the names of its |
||||
* contributors may be used to endorse or promote products derived from |
||||
* this software without specific prior written permission. |
||||
* |
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT |
||||
* OWNER 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. |
||||
* |
||||
*/ |
||||
|
||||
#include <grpc/support/port_platform.h> |
||||
|
||||
#ifdef GRPC_STAP_PROFILER |
||||
|
||||
#include "src/core/profiling/timers.h" |
||||
|
||||
#include <sys/sdt.h> |
||||
/* Generated from src/core/profiling/stap_probes.d */ |
||||
#include "src/core/profiling/stap_probes.h" |
||||
|
||||
/* Latency profiler API implementation. */ |
||||
void grpc_timer_add_mark(int tag, void* id, const char *file, int line) { |
||||
_STAP_ADD_MARK(tag); |
||||
} |
||||
|
||||
void grpc_timer_begin(int tag, void* id, const char *file, int line) { |
||||
_STAP_TIMING_NS_BEGIN(tag); |
||||
} |
||||
|
||||
void grpc_timer_end(int tag, void* id, const char *file, int line) { |
||||
_STAP_TIMING_NS_END(tag); |
||||
} |
||||
|
||||
#endif /* GRPC_STAP_PROFILER */ |
@ -0,0 +1,42 @@ |
||||
/*
|
||||
* |
||||
* Copyright 2015, Google Inc. |
||||
* All rights reserved. |
||||
* |
||||
* Redistribution and use in source and binary forms, with or without |
||||
* modification, are permitted provided that the following conditions are |
||||
* met: |
||||
* |
||||
* * Redistributions of source code must retain the above copyright |
||||
* notice, this list of conditions and the following disclaimer. |
||||
* * 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. |
||||
* * Neither the name of Google Inc. nor the names of its |
||||
* contributors may be used to endorse or promote products derived from |
||||
* this software without specific prior written permission. |
||||
* |
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT |
||||
* OWNER 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. |
||||
* |
||||
*/ |
||||
|
||||
#include <sys/sdt.h> |
||||
|
||||
#ifndef _SYS_SDT_H |
||||
#error "_SYS_SDT_H not defined, despite <sys/sdt.h> being present." |
||||
#endif |
||||
|
||||
int main() { |
||||
return 0; |
||||
} |
@ -0,0 +1,40 @@ |
||||
/* This script requires a command line argument, to be used in the "process" |
||||
* probe definition. |
||||
* |
||||
* For a statically build binary, that'd be the name of the binary itself. |
||||
* For dinamically built ones, point to the location of the libgprc.so being |
||||
* used. */ |
||||
|
||||
global starts, times, times_per_tag |
||||
|
||||
probe process(@1).mark("timing_ns_begin") { |
||||
starts[$arg1, tid()] = gettimeofday_ns(); |
||||
} |
||||
|
||||
probe process(@1).mark("timing_ns_end") { |
||||
tag = $arg1 |
||||
t = gettimeofday_ns(); |
||||
if (s = starts[tag, tid()]) { |
||||
times[tag, tid()] <<< t-s; |
||||
delete starts[tag, tid()]; |
||||
} |
||||
} |
||||
|
||||
probe end { |
||||
printf("%15s %9s %10s %10s %10s %10s\n", "tag", "tid", "count", |
||||
"min(ns)", "avg(ns)", "max(ns)"); |
||||
foreach ([tag+, tid] in times) { |
||||
printf("%15X %9d %10d %10d %10d %10d\n", tag, tid, @count(times[tag, tid]), |
||||
@min(times[tag, tid]), @avg(times[tag, tid]), @max(times[tag, tid])); |
||||
} |
||||
|
||||
printf("Per tag average of averages\n"); |
||||
foreach ([tag+, tid] in times) { |
||||
times_per_tag[tag] <<< @avg(times[tag, tid]); |
||||
} |
||||
printf("%15s %10s %10s\n", "tag", "count", "avg(ns)"); |
||||
foreach ([tag+] in times_per_tag) { |
||||
printf("%15X %10d %10d\n", tag, @count(times_per_tag[tag]), |
||||
@avg(times_per_tag[tag])); |
||||
} |
||||
} |
Loading…
Reference in new issue