1 #!/usr/sbin/dtrace -qs 2 3 /*- 4 * Copyright (c) 2008-2012 Alexander Leidinger <netchild@FreeBSD.org> 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer 12 * in this position and unchanged. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29 /** 30 * Some statistics (all per provider): 31 * - number of calls to a function per executable binary (not per PID!) 32 * - allows to see where an optimization would be beneficial for a given 33 * application 34 * - graph of CPU time spend in functions per executable binary 35 * - together with the number of calls to this function this allows 36 * to determine if a kernel optimization would be beneficial / is 37 * possible for a given application 38 * - graph of longest running (CPU-time!) function in total 39 * - may help finding problem cases in the kernel code 40 * - graph of longest held (CPU-time!) locks 41 */ 42 43 #pragma D option dynvarsize=32m 44 45 linuxulator*:::entry 46 { 47 self->time[probefunc] = vtimestamp; 48 @calls[probeprov, execname, probefunc] = count(); 49 } 50 51 linuxulator*:::return 52 /self->time[probefunc] != 0/ 53 { 54 this->timediff = self->time[probefunc] - vtimestamp; 55 56 @stats[probeprov, execname, probefunc] = quantize(this->timediff); 57 @longest[probeprov, probefunc] = max(this->timediff); 58 59 self->time[probefunc] = 0; 60 } 61 62 linuxulator*:::locked 63 { 64 self->lock[arg0] = vtimestamp; 65 } 66 67 linuxulator*:::unlock 68 /self->lock[arg0] != 0/ 69 { 70 this->timediff = self->lock[arg0] - vtimestamp; 71 72 @lockstats[probefunc] = quantize(this->timediff); 73 @longlock[probefunc] = max(this->timediff); 74 75 self->lock[arg0] = 0; 76 } 77 78 END 79 { 80 printf("Number of calls per provider/application/kernel function:"); 81 printa(@calls); 82 printf("CPU-timing statistics per provider/application/kernel function (in ns):"); 83 printa(@stats); 84 printf("Longest running (CPU-time!) functions per provider (in ns):"); 85 printa(@longest); 86 printf("Lock CPU-timing statistics:"); 87 printa(@lockstats); 88 printf("Longest running (CPU-time!) locks:"); 89 printa(@longlock); 90 } 91 92