7551d83c35
Mainly focus on files that use BSD 2-Clause license, however the tool I was using misidentified many licenses so this was mostly a manual - error prone - task. The Software Package Data Exchange (SPDX) group provides a specification to make it easier for automated tools to detect and summarize well known opensource licenses. We are gradually adopting the specification, noting that the tags are considered only advisory and do not, in any way, superceed or replace the license texts. No functional change intended.
142 lines
4.2 KiB
C
142 lines
4.2 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-2-Clause-FreeBSD
|
|
*
|
|
* Copyright 2001 Jamey Wood
|
|
*
|
|
* 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 AUTHOR 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 AUTHOR 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#include <sys/linker_set.h>
|
|
#include <sys/queue.h>
|
|
|
|
#define FOLLOWFORKS 0x00000001
|
|
#define RELATIVETIMESTAMPS 0x00000002
|
|
#define ABSOLUTETIMESTAMPS 0x00000004
|
|
#define NOSIGS 0x00000008
|
|
#define EXECVEARGS 0x00000010
|
|
#define EXECVEENVS 0x00000020
|
|
#define COUNTONLY 0x00000040
|
|
#define DISPLAYTIDS 0x00000080
|
|
|
|
struct procinfo;
|
|
struct syscall;
|
|
struct trussinfo;
|
|
|
|
/*
|
|
* The lookup of normal system calls are optimized by using a fixed
|
|
* array for the first 1024 system calls that can be indexed directly.
|
|
* Unknown system calls with other IDs are stored in a linked list.
|
|
*/
|
|
#define SYSCALL_NORMAL_COUNT 1024
|
|
|
|
struct extra_syscall {
|
|
STAILQ_ENTRY(extra_syscall) entries;
|
|
struct syscall *sc;
|
|
u_int number;
|
|
};
|
|
|
|
struct procabi {
|
|
const char *type;
|
|
enum sysdecode_abi abi;
|
|
int (*fetch_args)(struct trussinfo *, u_int);
|
|
int (*fetch_retval)(struct trussinfo *, long *, int *);
|
|
STAILQ_HEAD(, extra_syscall) extra_syscalls;
|
|
struct syscall *syscalls[SYSCALL_NORMAL_COUNT];
|
|
};
|
|
|
|
#define PROCABI(abi) DATA_SET(procabi, abi)
|
|
|
|
/*
|
|
* This is confusingly named. It holds per-thread state about the
|
|
* currently executing system call. syscall.h defines a struct
|
|
* syscall that holds metadata used to format system call arguments.
|
|
*
|
|
* NB: args[] stores the raw argument values (e.g. from registers)
|
|
* passed to the system call. s_args[] stores a string representation
|
|
* of a system call's arguments. These do not necessarily map one to
|
|
* one. A system call description may omit individual arguments
|
|
* (padding) or combine adjacent arguments (e.g. when passing an off_t
|
|
* argument on a 32-bit system). The nargs member contains the count
|
|
* of valid pointers in s_args[], not args[].
|
|
*/
|
|
struct current_syscall {
|
|
struct syscall *sc;
|
|
unsigned int number;
|
|
unsigned int nargs;
|
|
unsigned long args[10];
|
|
char *s_args[10]; /* the printable arguments */
|
|
};
|
|
|
|
struct threadinfo
|
|
{
|
|
LIST_ENTRY(threadinfo) entries;
|
|
struct procinfo *proc;
|
|
lwpid_t tid;
|
|
int in_syscall;
|
|
struct current_syscall cs;
|
|
struct timespec before;
|
|
struct timespec after;
|
|
};
|
|
|
|
struct procinfo {
|
|
LIST_ENTRY(procinfo) entries;
|
|
pid_t pid;
|
|
struct procabi *abi;
|
|
|
|
LIST_HEAD(, threadinfo) threadlist;
|
|
};
|
|
|
|
struct trussinfo
|
|
{
|
|
int flags;
|
|
int strsize;
|
|
FILE *outfile;
|
|
|
|
struct timespec start_time;
|
|
|
|
struct threadinfo *curthread;
|
|
|
|
LIST_HEAD(, procinfo) proclist;
|
|
};
|
|
|
|
#define timespecsubt(tvp, uvp, vvp) \
|
|
do { \
|
|
(vvp)->tv_sec = (tvp)->tv_sec - (uvp)->tv_sec; \
|
|
(vvp)->tv_nsec = (tvp)->tv_nsec - (uvp)->tv_nsec; \
|
|
if ((vvp)->tv_nsec < 0) { \
|
|
(vvp)->tv_sec--; \
|
|
(vvp)->tv_nsec += 1000000000; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define timespecadd(tvp, uvp, vvp) \
|
|
do { \
|
|
(vvp)->tv_sec = (tvp)->tv_sec + (uvp)->tv_sec; \
|
|
(vvp)->tv_nsec = (tvp)->tv_nsec + (uvp)->tv_nsec; \
|
|
if ((vvp)->tv_nsec > 1000000000) { \
|
|
(vvp)->tv_sec++; \
|
|
(vvp)->tv_nsec -= 1000000000; \
|
|
} \
|
|
} while (0)
|