1997-12-20 18:40:43 +00:00
|
|
|
/*
|
|
|
|
* Copryight 1997 Sean Eric Fagan
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by Sean Eric Fagan
|
|
|
|
* 4. Neither the name of the author may be used to endorse or promote
|
|
|
|
* products derived from this software without specific prior written
|
|
|
|
* permission.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
1998-01-05 07:30:26 +00:00
|
|
|
#ifndef lint
|
|
|
|
static const char rcsid[] =
|
1999-08-28 01:08:13 +00:00
|
|
|
"$FreeBSD$";
|
1998-01-05 07:30:26 +00:00
|
|
|
#endif /* not lint */
|
|
|
|
|
1997-12-06 05:23:12 +00:00
|
|
|
/*
|
|
|
|
* This file has routines used to print out system calls and their
|
|
|
|
* arguments.
|
|
|
|
*/
|
|
|
|
|
2001-10-21 21:57:10 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/socket.h>
|
2002-10-06 21:46:04 +00:00
|
|
|
#include <sys/time.h>
|
2001-10-21 21:57:10 +00:00
|
|
|
#include <sys/un.h>
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <arpa/inet.h>
|
|
|
|
|
2001-11-06 19:26:51 +00:00
|
|
|
#include <ctype.h>
|
1998-01-05 07:30:26 +00:00
|
|
|
#include <err.h>
|
2001-10-21 21:57:10 +00:00
|
|
|
#include <signal.h>
|
1997-12-06 05:23:12 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2002-08-06 12:46:14 +00:00
|
|
|
#include <time.h>
|
1997-12-06 05:23:12 +00:00
|
|
|
#include <unistd.h>
|
2001-10-21 21:57:10 +00:00
|
|
|
|
2002-08-04 00:46:48 +00:00
|
|
|
#include "truss.h"
|
2001-12-11 23:34:02 +00:00
|
|
|
#include "extern.h"
|
1997-12-06 05:23:12 +00:00
|
|
|
#include "syscall.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This should probably be in its own file.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct syscall syscalls[] = {
|
|
|
|
{ "readlink", 1, 3,
|
|
|
|
{ { String, 0 } , { String | OUT, 1 }, { Int, 2 }}},
|
|
|
|
{ "lseek", 2, 3,
|
|
|
|
{ { Int, 0 }, {Quad, 2 }, { Int, 4 }}},
|
|
|
|
{ "mmap", 2, 6,
|
|
|
|
{ { Hex, 0 }, {Int, 1}, {Hex, 2}, {Hex, 3}, {Int, 4}, {Quad, 6}}},
|
|
|
|
{ "open", 1, 3,
|
2001-12-30 23:11:52 +00:00
|
|
|
{ { String | IN, 0} , { Hex, 1}, {Octal, 2}}},
|
1997-12-06 05:23:12 +00:00
|
|
|
{ "linux_open", 1, 3,
|
2001-12-30 23:11:52 +00:00
|
|
|
{ { String, 0 }, { Hex, 1}, { Octal, 2 }}},
|
1997-12-06 05:23:12 +00:00
|
|
|
{ "close", 1, 1, { { Int, 0 } } },
|
|
|
|
{ "fstat", 1, 2,
|
|
|
|
{ { Int, 0}, {Ptr | OUT , 1 }}},
|
|
|
|
{ "stat", 1, 2,
|
|
|
|
{ { String | IN, 0 }, { Ptr | OUT, 1 }}},
|
1998-10-15 04:31:44 +00:00
|
|
|
{ "lstat", 1, 2,
|
|
|
|
{ { String | IN, 0 }, { Ptr | OUT, 1 }}},
|
1997-12-06 05:23:12 +00:00
|
|
|
{ "linux_newstat", 1, 2,
|
|
|
|
{ { String | IN, 0 }, { Ptr | OUT, 1 }}},
|
|
|
|
{ "linux_newfstat", 1, 2,
|
|
|
|
{ { Int, 0 }, { Ptr | OUT, 1 }}},
|
|
|
|
{ "write", 1, 3,
|
|
|
|
{ { Int, 0}, { Ptr | IN, 1 }, { Int, 2 }}},
|
1997-12-06 06:51:14 +00:00
|
|
|
{ "ioctl", 1, 3,
|
|
|
|
{ { Int, 0}, { Ioctl, 1 }, { Hex, 2 }}},
|
1997-12-06 05:23:12 +00:00
|
|
|
{ "break", 1, 1, { { Hex, 0 }}},
|
|
|
|
{ "exit", 0, 1, { { Hex, 0 }}},
|
1999-08-05 12:03:50 +00:00
|
|
|
{ "access", 1, 2, { { String | IN, 0 }, { Int, 1 }}},
|
1999-08-10 16:57:37 +00:00
|
|
|
{ "sigaction", 1, 3,
|
|
|
|
{ { Signal, 0 }, { Ptr | IN, 1 }, { Ptr | OUT, 2 }}},
|
2001-10-21 21:57:10 +00:00
|
|
|
{ "accept", 1, 3,
|
|
|
|
{ { Hex, 0 }, { Sockaddr | OUT, 1 }, { Ptr | OUT, 2 } } },
|
|
|
|
{ "bind", 1, 3,
|
|
|
|
{ { Hex, 0 }, { Sockaddr | IN, 1 }, { Int, 2 } } },
|
|
|
|
{ "connect", 1, 3,
|
|
|
|
{ { Hex, 0 }, { Sockaddr | IN, 1 }, { Int, 2 } } },
|
|
|
|
{ "getpeername", 1, 3,
|
|
|
|
{ { Hex, 0 }, { Sockaddr | OUT, 1 }, { Ptr | OUT, 2 } } },
|
|
|
|
{ "getsockname", 1, 3,
|
|
|
|
{ { Hex, 0 }, { Sockaddr | OUT, 1 }, { Ptr | OUT, 2 } } },
|
2002-08-04 02:24:21 +00:00
|
|
|
{ "execve", 1, 3,
|
|
|
|
{ { String | IN, 0 }, { StringArray | IN, 1 }, { StringArray | IN, 2 } } },
|
|
|
|
{ "linux_execve", 1, 3,
|
|
|
|
{ { String | IN, 0 }, { StringArray | IN, 1 }, { StringArray | IN, 2 } } },
|
1998-01-05 07:30:26 +00:00
|
|
|
{ 0, 0, 0, { { 0, 0 }}},
|
1997-12-06 05:23:12 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If/when the list gets big, it might be desirable to do it
|
|
|
|
* as a hash table or binary search.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct syscall *
|
|
|
|
get_syscall(const char *name) {
|
|
|
|
struct syscall *sc = syscalls;
|
|
|
|
|
|
|
|
while (sc->name) {
|
|
|
|
if (!strcmp(name, sc->name))
|
|
|
|
return sc;
|
|
|
|
sc++;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2001-10-21 21:57:10 +00:00
|
|
|
/*
|
|
|
|
* get_struct
|
|
|
|
*
|
|
|
|
* Copy a fixed amount of bytes from the process.
|
|
|
|
*/
|
|
|
|
|
2001-12-11 23:34:02 +00:00
|
|
|
static int
|
2001-10-21 21:57:10 +00:00
|
|
|
get_struct(int procfd, void *offset, void *buf, int len) {
|
|
|
|
char *pos;
|
|
|
|
FILE *p;
|
|
|
|
int c, fd;
|
|
|
|
|
|
|
|
if ((fd = dup(procfd)) == -1)
|
|
|
|
err(1, "dup");
|
|
|
|
if ((p = fdopen(fd, "r")) == NULL)
|
|
|
|
err(1, "fdopen");
|
2002-04-21 19:04:26 +00:00
|
|
|
fseeko(p, (uintptr_t)offset, SEEK_SET);
|
2001-10-21 21:57:10 +00:00
|
|
|
for (pos = (char *)buf; len--; pos++) {
|
|
|
|
if ((c = fgetc(p)) == EOF)
|
|
|
|
return -1;
|
|
|
|
*pos = c;
|
|
|
|
}
|
|
|
|
fclose(p);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1997-12-06 05:23:12 +00:00
|
|
|
/*
|
|
|
|
* get_string
|
|
|
|
* Copy a string from the process. Note that it is
|
|
|
|
* expected to be a C string, but if max is set, it will
|
|
|
|
* only get that much.
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *
|
|
|
|
get_string(int procfd, void *offset, int max) {
|
1998-01-05 07:30:26 +00:00
|
|
|
char *buf;
|
2000-02-15 20:25:47 +00:00
|
|
|
int size, len, c, fd;
|
1997-12-06 05:23:12 +00:00
|
|
|
FILE *p;
|
|
|
|
|
2000-02-15 20:25:47 +00:00
|
|
|
if ((fd = dup(procfd)) == -1)
|
|
|
|
err(1, "dup");
|
|
|
|
if ((p = fdopen(fd, "r")) == NULL)
|
1998-01-05 07:30:26 +00:00
|
|
|
err(1, "fdopen");
|
1997-12-06 05:23:12 +00:00
|
|
|
buf = malloc( size = (max ? max : 64 ) );
|
|
|
|
len = 0;
|
2001-08-28 21:27:36 +00:00
|
|
|
buf[0] = 0;
|
2002-04-21 19:04:26 +00:00
|
|
|
fseeko(p, (uintptr_t)offset, SEEK_SET);
|
1997-12-06 05:23:12 +00:00
|
|
|
while ((c = fgetc(p)) != EOF) {
|
|
|
|
buf[len++] = c;
|
|
|
|
if (c == 0 || len == max) {
|
|
|
|
buf[len] = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (len == size) {
|
2000-02-15 20:25:47 +00:00
|
|
|
char *tmp;
|
1997-12-06 05:23:12 +00:00
|
|
|
tmp = realloc(buf, size+64);
|
|
|
|
if (tmp == NULL) {
|
|
|
|
buf[len] = 0;
|
2000-02-15 20:25:47 +00:00
|
|
|
fclose(p);
|
1997-12-06 05:23:12 +00:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
size += 64;
|
2000-02-15 20:25:47 +00:00
|
|
|
buf = tmp;
|
1997-12-06 05:23:12 +00:00
|
|
|
}
|
|
|
|
}
|
2000-02-15 20:25:47 +00:00
|
|
|
fclose(p);
|
1997-12-06 05:23:12 +00:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Gag. This is really unportable. Multiplication is more portable.
|
|
|
|
* But slower, from the code I saw.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static long long
|
|
|
|
make_quad(unsigned long p1, unsigned long p2) {
|
|
|
|
union {
|
|
|
|
long long ll;
|
|
|
|
unsigned long l[2];
|
|
|
|
} t;
|
|
|
|
t.l[0] = p1;
|
|
|
|
t.l[1] = p2;
|
|
|
|
return t.ll;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* print_arg
|
|
|
|
* Converts a syscall argument into a string. Said string is
|
|
|
|
* allocated via malloc(), so needs to be free()'d. The file
|
|
|
|
* descriptor is for the process' memory (via /proc), and is used
|
|
|
|
* to get any data (where the argument is a pointer). sc is
|
|
|
|
* a pointer to the syscall description (see above); args is
|
|
|
|
* an array of all of the system call arguments.
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *
|
|
|
|
print_arg(int fd, struct syscall_args *sc, unsigned long *args) {
|
1998-01-05 07:30:26 +00:00
|
|
|
char *tmp = NULL;
|
1997-12-06 05:23:12 +00:00
|
|
|
switch (sc->type & ARG_MASK) {
|
|
|
|
case Hex:
|
|
|
|
tmp = malloc(12);
|
1998-07-06 21:01:54 +00:00
|
|
|
sprintf(tmp, "0x%lx", args[sc->offset]);
|
1997-12-06 05:23:12 +00:00
|
|
|
break;
|
|
|
|
case Octal:
|
|
|
|
tmp = malloc(13);
|
1998-07-06 21:01:54 +00:00
|
|
|
sprintf(tmp, "0%lo", args[sc->offset]);
|
1997-12-06 05:23:12 +00:00
|
|
|
break;
|
|
|
|
case Int:
|
|
|
|
tmp = malloc(12);
|
1998-07-06 21:01:54 +00:00
|
|
|
sprintf(tmp, "%ld", args[sc->offset]);
|
1997-12-06 05:23:12 +00:00
|
|
|
break;
|
|
|
|
case String:
|
|
|
|
{
|
|
|
|
char *tmp2;
|
|
|
|
tmp2 = get_string(fd, (void*)args[sc->offset], 0);
|
|
|
|
tmp = malloc(strlen(tmp2) + 3);
|
|
|
|
sprintf(tmp, "\"%s\"", tmp2);
|
|
|
|
free(tmp2);
|
|
|
|
}
|
|
|
|
break;
|
2002-08-04 02:24:21 +00:00
|
|
|
case StringArray:
|
|
|
|
{
|
|
|
|
int num, size, i;
|
|
|
|
char *tmp2;
|
|
|
|
char *string;
|
|
|
|
char *strarray[100]; /* XXX This is ugly. */
|
|
|
|
|
|
|
|
if (get_struct(fd, (void *)args[sc->offset], (void *)&strarray,
|
|
|
|
sizeof(strarray)) == -1) {
|
|
|
|
err(1, "get_struct %p", (void *)args[sc->offset]);
|
|
|
|
}
|
|
|
|
num = 0;
|
|
|
|
size = 0;
|
|
|
|
|
|
|
|
/* Find out how large of a buffer we'll need. */
|
|
|
|
while (strarray[num] != NULL) {
|
|
|
|
string = get_string(fd, (void*)strarray[num], 0);
|
|
|
|
size += strlen(string);
|
|
|
|
free(string);
|
|
|
|
num++;
|
|
|
|
}
|
|
|
|
size += 4 + (num * 4);
|
|
|
|
tmp = (char *)malloc(size);
|
|
|
|
tmp2 = tmp;
|
|
|
|
|
|
|
|
tmp2 += sprintf(tmp2, " [");
|
|
|
|
for (i = 0; i < num; i++) {
|
|
|
|
string = get_string(fd, (void*)strarray[i], 0);
|
|
|
|
tmp2 += sprintf(tmp2, " \"%s\"%c", string, (i+1 == num) ? ' ' : ',');
|
|
|
|
free(string);
|
|
|
|
}
|
|
|
|
tmp2 += sprintf(tmp2, "]");
|
|
|
|
}
|
|
|
|
break;
|
1997-12-06 05:23:12 +00:00
|
|
|
case Quad:
|
|
|
|
{
|
|
|
|
unsigned long long t;
|
|
|
|
unsigned long l1, l2;
|
|
|
|
l1 = args[sc->offset];
|
|
|
|
l2 = args[sc->offset+1];
|
|
|
|
t = make_quad(l1, l2);
|
|
|
|
tmp = malloc(24);
|
|
|
|
sprintf(tmp, "0x%qx", t);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Ptr:
|
|
|
|
tmp = malloc(12);
|
1998-07-06 21:01:54 +00:00
|
|
|
sprintf(tmp, "0x%lx", args[sc->offset]);
|
1997-12-06 05:23:12 +00:00
|
|
|
break;
|
1997-12-06 06:51:14 +00:00
|
|
|
case Ioctl:
|
|
|
|
{
|
2001-12-11 23:34:02 +00:00
|
|
|
const char *temp = ioctlname(args[sc->offset]);
|
1997-12-06 06:51:14 +00:00
|
|
|
if (temp)
|
|
|
|
tmp = strdup(temp);
|
|
|
|
else {
|
|
|
|
tmp = malloc(12);
|
1998-07-06 21:01:54 +00:00
|
|
|
sprintf(tmp, "0x%lx", args[sc->offset]);
|
1997-12-06 06:51:14 +00:00
|
|
|
}
|
|
|
|
}
|
1999-08-10 16:57:37 +00:00
|
|
|
break;
|
|
|
|
case Signal:
|
|
|
|
{
|
|
|
|
long sig;
|
|
|
|
|
|
|
|
sig = args[sc->offset];
|
|
|
|
tmp = malloc(12);
|
|
|
|
if (sig > 0 && sig < NSIG) {
|
|
|
|
int i;
|
|
|
|
sprintf(tmp, "sig%s", sys_signame[sig]);
|
|
|
|
for (i = 0; tmp[i] != '\0'; ++i)
|
|
|
|
tmp[i] = toupper(tmp[i]);
|
|
|
|
} else {
|
|
|
|
sprintf(tmp, "%ld", sig);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2001-10-21 21:57:10 +00:00
|
|
|
case Sockaddr:
|
|
|
|
{
|
2001-11-06 19:26:51 +00:00
|
|
|
struct sockaddr_storage ss;
|
2001-10-21 21:57:10 +00:00
|
|
|
char addr[64];
|
2001-12-11 23:34:02 +00:00
|
|
|
struct sockaddr_in *lsin;
|
|
|
|
struct sockaddr_in6 *lsin6;
|
2001-11-06 19:26:51 +00:00
|
|
|
struct sockaddr_un *sun;
|
|
|
|
struct sockaddr *sa;
|
|
|
|
char *p;
|
|
|
|
u_char *q;
|
|
|
|
int i;
|
2001-10-21 21:57:10 +00:00
|
|
|
|
2001-11-06 19:26:51 +00:00
|
|
|
/* yuck: get ss_len */
|
|
|
|
if (get_struct(fd, (void *)args[sc->offset], (void *)&ss,
|
|
|
|
sizeof(ss.ss_len) + sizeof(ss.ss_family)) == -1)
|
|
|
|
err(1, "get_struct %p", (void *)args[sc->offset]);
|
|
|
|
/* sockaddr_un never have the length filled in! */
|
|
|
|
if (ss.ss_family == AF_UNIX) {
|
|
|
|
if (get_struct(fd, (void *)args[sc->offset], (void *)&ss,
|
|
|
|
sizeof(*sun))
|
|
|
|
== -1)
|
|
|
|
err(2, "get_struct %p", (void *)args[sc->offset]);
|
|
|
|
} else {
|
|
|
|
if (get_struct(fd, (void *)args[sc->offset], (void *)&ss, ss.ss_len)
|
|
|
|
== -1)
|
|
|
|
err(2, "get_struct %p", (void *)args[sc->offset]);
|
|
|
|
}
|
2001-10-21 21:57:10 +00:00
|
|
|
|
2001-11-06 19:26:51 +00:00
|
|
|
switch (ss.ss_family) {
|
|
|
|
case AF_INET:
|
2001-12-11 23:34:02 +00:00
|
|
|
lsin = (struct sockaddr_in *)&ss;
|
|
|
|
inet_ntop(AF_INET, &lsin->sin_addr, addr, sizeof addr);
|
|
|
|
asprintf(&tmp, "{ AF_INET %s:%d }", addr, htons(lsin->sin_port));
|
2001-11-06 19:26:51 +00:00
|
|
|
break;
|
|
|
|
case AF_INET6:
|
2001-12-11 23:34:02 +00:00
|
|
|
lsin6 = (struct sockaddr_in6 *)&ss;
|
|
|
|
inet_ntop(AF_INET6, &lsin6->sin6_addr, addr, sizeof addr);
|
|
|
|
asprintf(&tmp, "{ AF_INET6 [%s]:%d }", addr, htons(lsin6->sin6_port));
|
2001-11-06 19:26:51 +00:00
|
|
|
break;
|
|
|
|
case AF_UNIX:
|
|
|
|
sun = (struct sockaddr_un *)&ss;
|
|
|
|
asprintf(&tmp, "{ AF_UNIX \"%s\" }", sun->sun_path);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
sa = (struct sockaddr *)&ss;
|
|
|
|
asprintf(&tmp, "{ sa_len = %d, sa_family = %d, sa_data = {%n%*s } }",
|
|
|
|
(int)sa->sa_len, (int)sa->sa_family, &i,
|
|
|
|
6 * (int)(sa->sa_len - ((char *)&sa->sa_data - (char *)sa)), "");
|
|
|
|
if (tmp != NULL) {
|
|
|
|
p = tmp + i;
|
|
|
|
for (q = (u_char *)&sa->sa_data; q < (u_char *)sa + sa->sa_len; q++)
|
|
|
|
p += sprintf(p, " %#02x,", *q);
|
|
|
|
}
|
2001-10-21 21:57:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
1997-12-06 05:23:12 +00:00
|
|
|
}
|
|
|
|
return tmp;
|
|
|
|
}
|
|
|
|
|
2002-08-05 12:22:55 +00:00
|
|
|
#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)
|
|
|
|
|
1997-12-06 05:23:12 +00:00
|
|
|
/*
|
|
|
|
* print_syscall
|
|
|
|
* Print (to outfile) the system call and its arguments. Note that
|
|
|
|
* nargs is the number of arguments (not the number of words; this is
|
|
|
|
* potentially confusing, I know).
|
|
|
|
*/
|
|
|
|
|
|
|
|
void
|
2002-08-04 00:46:48 +00:00
|
|
|
print_syscall(struct trussinfo *trussinfo, const char *name, int nargs, char **s_args) {
|
1997-12-06 05:23:12 +00:00
|
|
|
int i;
|
2000-03-18 08:49:41 +00:00
|
|
|
int len = 0;
|
2002-08-05 12:22:55 +00:00
|
|
|
struct timespec timediff;
|
2002-08-04 01:27:31 +00:00
|
|
|
|
2002-08-04 01:02:52 +00:00
|
|
|
if (trussinfo->flags & FOLLOWFORKS)
|
2002-08-05 14:56:20 +00:00
|
|
|
len += fprintf(trussinfo->outfile, "%5d: ", trussinfo->pid);
|
2002-08-04 01:02:52 +00:00
|
|
|
|
2002-11-09 22:28:38 +00:00
|
|
|
if (name != NULL && (!strcmp(name, "execve") || !strcmp(name, "exit"))) {
|
2002-08-05 12:22:55 +00:00
|
|
|
clock_gettime(CLOCK_REALTIME, &trussinfo->after);
|
2002-08-04 01:27:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (trussinfo->flags & ABSOLUTETIMESTAMPS) {
|
2002-08-05 12:22:55 +00:00
|
|
|
timespecsubt(&trussinfo->after, &trussinfo->start_time, &timediff);
|
2002-08-06 12:46:14 +00:00
|
|
|
len += fprintf(trussinfo->outfile, "%ld.%09ld ",
|
2002-08-07 11:35:18 +00:00
|
|
|
(long)timediff.tv_sec, timediff.tv_nsec);
|
2002-08-04 01:27:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (trussinfo->flags & RELATIVETIMESTAMPS) {
|
2002-08-05 12:22:55 +00:00
|
|
|
timespecsubt(&trussinfo->after, &trussinfo->before, &timediff);
|
2002-08-06 12:46:14 +00:00
|
|
|
len += fprintf(trussinfo->outfile, "%ld.%09ld ",
|
2002-08-07 11:35:18 +00:00
|
|
|
(long)timediff.tv_sec, timediff.tv_nsec);
|
2002-08-04 01:27:31 +00:00
|
|
|
}
|
|
|
|
|
2002-08-04 00:46:48 +00:00
|
|
|
len += fprintf(trussinfo->outfile, "%s(", name);
|
2002-08-04 01:02:52 +00:00
|
|
|
|
1997-12-06 05:23:12 +00:00
|
|
|
for (i = 0; i < nargs; i++) {
|
|
|
|
if (s_args[i])
|
2002-08-04 00:46:48 +00:00
|
|
|
len += fprintf(trussinfo->outfile, "%s", s_args[i]);
|
1997-12-06 05:23:12 +00:00
|
|
|
else
|
2002-08-04 00:46:48 +00:00
|
|
|
len += fprintf(trussinfo->outfile, "<missing argument>");
|
|
|
|
len += fprintf(trussinfo->outfile, "%s", i < (nargs - 1) ? "," : "");
|
2000-03-18 08:49:41 +00:00
|
|
|
}
|
2002-08-04 00:46:48 +00:00
|
|
|
len += fprintf(trussinfo->outfile, ")");
|
2000-03-18 08:49:41 +00:00
|
|
|
for (i = 0; i < 6 - (len / 8); i++)
|
2002-08-04 00:46:48 +00:00
|
|
|
fprintf(trussinfo->outfile, "\t");
|
2000-03-18 08:49:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2002-08-04 00:46:48 +00:00
|
|
|
print_syscall_ret(struct trussinfo *trussinfo, const char *name, int nargs, char **s_args, int errorp, int retval) {
|
|
|
|
print_syscall(trussinfo, name, nargs, s_args);
|
2000-03-18 08:49:41 +00:00
|
|
|
if (errorp) {
|
2002-08-04 00:46:48 +00:00
|
|
|
fprintf(trussinfo->outfile, " ERR#%d '%s'\n", retval, strerror(retval));
|
2000-03-18 08:49:41 +00:00
|
|
|
} else {
|
2002-08-04 00:46:48 +00:00
|
|
|
fprintf(trussinfo->outfile, " = %d (0x%x)\n", retval, retval);
|
1997-12-06 05:23:12 +00:00
|
|
|
}
|
|
|
|
}
|