81338031c4
The reasons: 1. Get rid of the stubs/quirks with process dethreading, process reparent when the process group leader exits and close to this problems on wait(), waitpid(), etc. 2. Reuse our kernel code instead of writing excessive thread managment routines in Linuxulator. Implementation details: 1. The thread is created via kern_thr_new() in the clone() call with the CLONE_THREAD parameter. Thus, everything else is a process. 2. The test that the process has a threads is done via P_HADTHREADS bit p_flag of struct proc. 3. Per thread emulator state data structure is now located in the struct thread and freed in the thread_dtor() hook. Mandatory holdig of the p_mtx required when referencing emuldata from the other threads. 4. PID mangling has changed. Now Linux pid is the native tid and Linux tgid is the native pid, with the exception of the first thread in the process where tid and pid are one and the same. Ugliness: In case when the Linux thread is the initial thread in the thread group thread id is equal to the process id. Glibc depends on this magic (assert in pthread_getattr_np.c). So for system calls that take thread id as a parameter we should use the special method to reference struct thread. Differential Revision: https://reviews.freebsd.org/D1039
94 lines
3.1 KiB
D
94 lines
3.1 KiB
D
#!/usr/sbin/dtrace -qs
|
|
|
|
/*-
|
|
* Copyright (c) 2008-2012 Alexander Leidinger <netchild@FreeBSD.org>
|
|
* 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
|
|
* in this position and unchanged.
|
|
* 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 AUTHOR ``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 AUTHOR 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/**
|
|
* Some statistics (all per provider):
|
|
* - number of calls to a function per executable binary (not per PID!)
|
|
* - allows to see where an optimization would be beneficial for a given
|
|
* application
|
|
* - graph of CPU time spend in functions per executable binary
|
|
* - together with the number of calls to this function this allows
|
|
* to determine if a kernel optimization would be beneficial / is
|
|
* possible for a given application
|
|
* - graph of longest running (CPU-time!) function in total
|
|
* - may help finding problem cases in the kernel code
|
|
* - graph of longest held (CPU-time!) locks
|
|
*/
|
|
|
|
#pragma D option dynvarsize=32m
|
|
|
|
linuxulator*:::entry
|
|
{
|
|
self->time[probefunc] = vtimestamp;
|
|
@calls[probeprov, execname, probefunc] = count();
|
|
}
|
|
|
|
linuxulator*:::return
|
|
/self->time[probefunc] != 0/
|
|
{
|
|
this->timediff = self->time[probefunc] - vtimestamp;
|
|
|
|
@stats[probeprov, execname, probefunc] = quantize(this->timediff);
|
|
@longest[probeprov, probefunc] = max(this->timediff);
|
|
|
|
self->time[probefunc] = 0;
|
|
}
|
|
|
|
linuxulator*:::locked
|
|
{
|
|
self->lock[arg0] = vtimestamp;
|
|
}
|
|
|
|
linuxulator*:::unlock
|
|
/self->lock[arg0] != 0/
|
|
{
|
|
this->timediff = self->lock[arg0] - vtimestamp;
|
|
|
|
@lockstats[probefunc] = quantize(this->timediff);
|
|
@longlock[probefunc] = max(this->timediff);
|
|
|
|
self->lock[arg0] = 0;
|
|
}
|
|
|
|
END
|
|
{
|
|
printf("Number of calls per provider/application/kernel function:");
|
|
printa(@calls);
|
|
printf("CPU-timing statistics per provider/application/kernel function (in ns):");
|
|
printa(@stats);
|
|
printf("Longest running (CPU-time!) functions per provider (in ns):");
|
|
printa(@longest);
|
|
printf("Lock CPU-timing statistics:");
|
|
printa(@lockstats);
|
|
printf("Longest running (CPU-time!) locks:");
|
|
printa(@longlock);
|
|
}
|
|
|