1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446
|
/*
$Id: ptrace.c,v 1.20 2007-06-05 01:45:35+01 taviso Exp taviso $
Copyright (C) 2006,2007 Tavis Ormandy <taviso@sdf.lonestar.org>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/* prepare LARGEFILE support */
#ifdef _FILE_OFFSET_BITS
# undef _FILE_OFFSET_BITS
#endif
#define _FILE_OFFSET_BITS 64
#ifdef _LARGEFILE64_SOURCE
# undef _LARGEFILE64_SOURCE
#endif
#define _LARGEFILE64_SOURCE
#ifdef _XOPEN_SOURCE
# undef _XOPEN_SOURCE
#endif
#define _XOPEN_SOURCE 500
#include <time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/ptrace.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <errno.h>
#include <stdbool.h>
#include <limits.h>
#include <fcntl.h>
#ifdef __GNUC__
# define EXPECT(x,y) __builtin_expect(x, y)
#else
# define EXPECT(x,y) x
#endif
#include "value.h"
#include "scanmem.h"
/* ptrace peek buffer, used by peekdata() */
static struct {
union {
signed long peeks[2]; /* read from ptrace() */
unsigned char bytes[sizeof(long) * 2]; /* used to retrieve unaligned hits */
} cache;
unsigned size; /* number of entries (in longs) */
char *base; /* base address of cached region */
pid_t pid; /* what pid this applies to */
} peekbuf;
bool attach(pid_t target)
{
int status;
/* attach, to the target application, which should cause a SIGSTOP */
if (ptrace(PTRACE_ATTACH, target, NULL, NULL) == -1L) {
fprintf(stderr, "error: failed to attach to %d, %s\n", target,
strerror(errno));
return false;
}
/* wait for the SIGSTOP to take place. */
if (waitpid(target, &status, 0) == -1 || !WIFSTOPPED(status)) {
fprintf(stderr,
"error: there was an error waiting for the target to stop.\n");
fprintf(stdout, "info: %s\n", strerror(errno));
return false;
}
/* flush the peek buffer */
memset(&peekbuf, 0x00, sizeof(peekbuf));
/* everything looks okay */
return true;
}
bool detach(pid_t target)
{
return ptrace(PTRACE_DETACH, target, NULL, 0) == 0;
}
/*
* peekdata - caches overlapping ptrace reads to improve performance.
*
* This routine could just call ptrace(PEEKDATA), but using a cache reduces
* the number of peeks required by 70% when reading large chunks of
* consecutive addresses.
*/
bool peekdata(pid_t pid, void *addr, value_t * result)
{
char *reqaddr = addr;
assert(peekbuf.size < 3);
assert(result != NULL);
memset(result, 0x00, sizeof(value_t));
valnowidth(result);
/* check if we have a cache hit */
if (pid == peekbuf.pid && reqaddr >= peekbuf.base
&& (unsigned) (reqaddr + sizeof(long) - peekbuf.base) <=
sizeof(long) * peekbuf.size) {
result->value.tslong = *(long *) &peekbuf.cache.bytes[reqaddr - peekbuf.base]; /*lint !e826 */
return true;
} else if (pid == peekbuf.pid && reqaddr >= peekbuf.base
&& (unsigned) (reqaddr - peekbuf.base) <
sizeof(long) * peekbuf.size) {
assert(peekbuf.size != 0);
/* partial hit, we have some of the data but not all, so remove old entry */
if (EXPECT(peekbuf.size == 2, true)) {
peekbuf.cache.peeks[0] = peekbuf.cache.peeks[1];
peekbuf.size = 1;
peekbuf.base += sizeof(long);
}
} else {
/* cache miss, invalidate cache */
peekbuf.pid = pid;
peekbuf.size = 0;
peekbuf.base = addr;
}
/* we need a ptrace() to complete request */
errno = 0;
peekbuf.cache.peeks[peekbuf.size] =
ptrace(PTRACE_PEEKDATA, pid,
peekbuf.base + sizeof(long) * peekbuf.size, NULL);
/* check if ptrace() succeeded */
if (EXPECT(peekbuf.cache.peeks[peekbuf.size] == -1L && errno != 0, false)) {
/* its possible i'm trying to read partially oob */
if (errno == EIO || errno == EFAULT) {
unsigned i;
long l;
/* read backwards until we get a good read, then shift out the right value */
for (i = 1, errno = 0; i < sizeof(long); i++, errno = 0) {
if ((l = ptrace(PTRACE_PEEKDATA, pid, reqaddr - i, NULL)) == -1L &&
(errno == EIO || errno == EFAULT))
continue;
/* wow, that worked */
result->value.tslong = l;
result->value.tulong >>= i * CHAR_BIT;
/* note: some of these are impossible */
if (sizeof(float) > sizeof(long) - i)
result->flags.tfloat = 0;
if (sizeof(long) > sizeof(long) - i)
result->flags.wlong = 0;
if (sizeof(int) > sizeof(long) - i)
result->flags.wint = 0;
if (sizeof(short) > sizeof(long) - i)
result->flags.wshort = 0;
if (sizeof(char) > sizeof(long) - i)
result->flags.wchar = 0;
return true;
}
}
/* i wont print a message here, would be very noisy if a region is unmapped */
return false;
}
/* record new entry in cache */
peekbuf.size++;
/* return result to caller */
result->value.tslong = *(long *) &peekbuf.cache.bytes[reqaddr - peekbuf.base]; /*lint !e826 */
/* success */
return true;
}
bool checkmatches(list_t * matches, pid_t target, value_t value,
matchtype_t type)
{
element_t *n, *p;
assert(matches != NULL);
assert(matches->size);
p = NULL;
n = matches->head;
/* stop and attach to the target */
if (attach(target) == false)
return false;
/* shouldnt happen */
if (matches->size == 0) {
fprintf(stderr, "warn: cant check non-existant matches.\n");
return false;
}
while (n) {
match_t *match = n->data;
value_t check;
/* read value from this address */
if (EXPECT(peekdata(target, match->address, &check) == false, false)) {
/* assume this was in unmapped region, so remove */
l_remove(matches, p, NULL);
/* confirm this isnt the head element */
n = p ? p->next : matches->head;
continue;
}
truncval(&check, &match->lvalue);
/* XXX: this sucks. */
if (type != MATCHEXACT) {
valcpy(&value, &match->lvalue);
}
if (EXPECT(valuecmp(&check, type, &value, &check), false)) {
/* still a candidate */
match->lvalue = check;
p = n;
n = n->next;
} else {
/* no match */
l_remove(matches, p, NULL);
/* confirm this isnt the head element */
n = p ? p->next : matches->head;
}
}
eprintf("info: we currently have %d matches.\n", matches->size);
/* okay, detach */
return detach(target);
}
ssize_t readregion(void *buf, pid_t target, const region_t *region, size_t offset, size_t max)
{
char mem[32];
int fd;
ssize_t len;
/* print the path to mem file */
snprintf(mem, sizeof(mem), "/proc/%d/mem", target);
/* attempt to open the file */
if ((fd = open(mem, O_RDONLY)) == -1) {
fprintf(stderr, "warn: unable to open %s.\n", mem);
return -1;
}
/* check offset is sane */
if (offset > region->size) {
fprintf(stderr, "warn: unexpected offset while reading region.\n");
return -1;
}
/* try to honour the request */
len = pread(fd, buf, MIN(region->size - offset, max), region->start + offset);
/* clean up */
close(fd);
return len;
}
/* searchregion() performs an initial search of the process for values matching value */
bool searchregions(list_t * matches, const list_t * regions, pid_t target,
value_t value, bool snapshot)
{
unsigned regnum = 0;
unsigned char *data = NULL;
element_t *n = regions->head;
region_t *r;
/* stop and attach to the target */
if (attach(target) == false)
return false;
/* make sure we have some regions to search */
if (regions->size == 0) {
fprintf(stderr,
"warn: no regions defined, perhaps you deleted them all?\n");
fprintf(stderr,
"info: use the \"reset\" command to refresh regions.\n");
return detach(target);
}
/* check every memory region */
while (n) {
unsigned offset, nread = 0;
ssize_t len = 0;
/* load the next region */
r = n->data;
#ifdef HAVE_PROCMEM
/* over allocate by 3 bytes, which are set to zero so the last bytes can be read as longs */
if ((data = calloc(r->size + sizeof(long) - 1, 1)) == NULL) {
fprintf(stderr, "error: sorry, there was a memory allocation error.\n");
return false;
}
/* keep reading until completed */
while (nread < r->size) {
if ((len = readregion(data + nread, target, r, nread, r->size)) == -1) {
/* no, continue with whatever data was read */
break;
} else {
/* some data was read */
nread += len;
}
}
#else
nread = r->size;
#endif
/* print a progress meter so user knows we havnt crashed */
fprintf(stderr, "info: %02u/%02u searching %#10x - %#10x.", ++regnum,
regions->size, r->start, r->start + r->size);
fflush(stderr);
/* for every offset, check if we have a match */
for (offset = 0; offset < nread; offset++) {
value_t check;
/* initialise check */
memset(&check, 0x00, sizeof(check));
valnowidth(&check);
#ifdef HAVE_PROCMEM
check.value.tulong = *(unsigned long *)(&data[offset]);
#else
if (EXPECT(peekdata(target, r->start + offset, &check) == false, false)) {
break;
}
#endif
/* check if we have a match */
if (snapshot || EXPECT(valuecmp(&value, MATCHEQUAL, &check, &check), false)) {
match_t *match;
/* save this new location */
if ((match = calloc(1, sizeof(match_t))) == NULL) {
fprintf(stderr, "error: memory allocation failed.\n");
(void) detach(target);
return false;
}
match->address = r->start + offset;
match->region = r;
match->lvalue = check;
if (EXPECT(l_append(matches, NULL, match) == -1, false)) {
fprintf(stderr, "error: unable to add match to list.\n");
(void) detach(target);
free(match);
return false;
}
}
/* print a simple progress meter. */
if (EXPECT(offset % ((r->size - (r->size % 10)) / 10) == 10, false)) {
fprintf(stderr, ".");
fflush(stderr);
}
}
n = n->next;
fprintf(stderr, "ok\n");
#ifdef HAVE_PROCMEM
free(data);
#endif
}
eprintf("info: we currently have %d matches.\n", matches->size);
/* okay, detach */
return detach(target);
}
bool setaddr(pid_t target, void *addr, const value_t * to)
{
value_t saved;
if (attach(target) == false) {
return false;
}
if (peekdata(target, addr, &saved) == false) {
fprintf(stderr, "error: couldnt access the target address %10p\n",
addr);
return false;
}
/* XXX: oh god */
if (to->flags.wlong)
saved.value.tulong = to->value.tulong;
else if (to->flags.wint)
saved.value.tuint = to->value.tuint;
else if (to->flags.wshort)
saved.value.tushort = to->value.tushort;
else if (to->flags.wchar)
saved.value.tuchar = to->value.tuchar;
else if (to->flags.tfloat)
saved.value.tfloat = to->value.tslong;
else {
fprintf(stderr, "error: could not determine type to poke.\n");
return false;
}
if (ptrace(PTRACE_POKEDATA, target, addr, saved.value.tulong) == -1L) {
return false;
}
return detach(target);
}
|