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 447 448 449 450 451 452
|
// SPDX-License-Identifier: GPL-2.0
/*
* Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
* All Rights Reserved.
*/
#include "libxfs.h"
#include <ctype.h>
#include <time.h>
#include "bit.h"
#include "block.h"
#include "command.h"
#include "type.h"
#include "faddr.h"
#include "fprint.h"
#include "field.h"
#include "flist.h"
#include "io.h"
#include "init.h"
#include "output.h"
#include "print.h"
#include "write.h"
#include "malloc.h"
#include "fuzz.h"
static int fuzz_f(int argc, char **argv);
static void fuzz_help(void);
static const cmdinfo_t fuzz_cmd =
{ "fuzz", NULL, fuzz_f, 0, -1, 0, N_("[-c] [-d] field fuzzcmd..."),
N_("fuzz values on disk"), fuzz_help };
void
fuzz_init(void)
{
if (!expert_mode)
return;
add_command(&fuzz_cmd);
srand48(clock());
}
static void
fuzz_help(void)
{
dbprintf(_(
"\n"
" The 'fuzz' command fuzzes fields in any on-disk data structure. For\n"
" block fuzzing, see the 'blocktrash' or 'write' commands."
"\n"
" Examples:\n"
" Struct mode: 'fuzz core.uid zeroes' - set an inode uid field to 0.\n"
" 'fuzz crc ones' - set a crc filed to all ones.\n"
" 'fuzz bno[11] firstbit' - set the high bit of a block array.\n"
" 'fuzz keys[5].startblock add' - increase a btree key value.\n"
" 'fuzz uuid random' - randomize the superblock uuid.\n"
"\n"
" Type 'fuzz' by itself for a list of specific commands.\n\n"
" Specifying the -c option will allow writes of invalid (corrupt) data with\n"
" an invalid CRC. Specifying the -d option will allow writes of invalid data,\n"
" but still recalculate the CRC so we are forced to check and detect the\n"
" invalid data appropriately.\n\n"
));
}
static int
fuzz_f(
int argc,
char **argv)
{
pfunc_t pf;
extern char *progname;
int c;
bool corrupt = false; /* Allow write of bad data w/ invalid CRC */
bool invalid_data = false; /* Allow write of bad data w/ valid CRC */
struct xfs_buf_ops local_ops;
const struct xfs_buf_ops *stashed_ops = NULL;
if (x.flags & LIBXFS_ISREADONLY) {
dbprintf(_("%s started in read only mode, fuzzing disabled\n"),
progname);
return 0;
}
if (cur_typ == NULL) {
dbprintf(_("no current type\n"));
return 0;
}
pf = cur_typ->pfunc;
if (pf == NULL) {
dbprintf(_("no handler function for type %s, fuzz unsupported.\n"),
cur_typ->name);
return 0;
}
while ((c = getopt(argc, argv, "cd")) != EOF) {
switch (c) {
case 'c':
corrupt = true;
break;
case 'd':
invalid_data = true;
break;
default:
dbprintf(_("bad option for fuzz command\n"));
return 0;
}
}
if (corrupt && invalid_data) {
dbprintf(_("Cannot specify both -c and -d options\n"));
return 0;
}
if (invalid_data &&
iocur_top->typ->crc_off == TYP_F_NO_CRC_OFF &&
xfs_has_crc(mp)) {
dbprintf(_("Cannot recalculate CRCs on this type of object\n"));
return 0;
}
argc -= optind;
argv += optind;
/*
* If the buffer has no verifier or we are using standard verifier
* paths, then just fuzz it and return
*/
if (!iocur_top->bp->b_ops ||
!(corrupt || invalid_data)) {
(*pf)(DB_FUZZ, cur_typ->fields, argc, argv);
return 0;
}
/* Temporarily remove write verifier to write bad data */
stashed_ops = iocur_top->bp->b_ops;
local_ops.verify_read = stashed_ops->verify_read;
iocur_top->bp->b_ops = &local_ops;
if (!xfs_has_crc(mp)) {
local_ops.verify_write = xfs_dummy_verify;
} else if (corrupt) {
local_ops.verify_write = xfs_dummy_verify;
dbprintf(_("Allowing fuzz of corrupted data and bad CRC\n"));
} else if (iocur_top->typ->crc_off == TYP_F_CRC_FUNC) {
local_ops.verify_write = iocur_top->typ->set_crc;
dbprintf(_("Allowing fuzz of corrupted data with good CRC\n"));
} else { /* invalid data */
local_ops.verify_write = xfs_verify_recalc_crc;
dbprintf(_("Allowing fuzz of corrupted data with good CRC\n"));
}
(*pf)(DB_FUZZ, cur_typ->fields, argc, argv);
iocur_top->bp->b_ops = stashed_ops;
return 0;
}
/* Write zeroes to the field */
static bool
fuzz_zeroes(
void *buf,
int bitoff,
int nbits)
{
char *out = buf;
int bit;
if (bitoff % NBBY || nbits % NBBY) {
for (bit = 0; bit < nbits; bit++)
setbit_l(out, bit + bitoff, 0);
} else
memset(out + byteize(bitoff), 0, byteize(nbits));
return true;
}
/* Write ones to the field */
static bool
fuzz_ones(
void *buf,
int bitoff,
int nbits)
{
char *out = buf;
int bit;
if (bitoff % NBBY || nbits % NBBY) {
for (bit = 0; bit < nbits; bit++)
setbit_l(out, bit + bitoff, 1);
} else
memset(out + byteize(bitoff), 0xFF, byteize(nbits));
return true;
}
/* Flip the high bit in the (presumably big-endian) field */
static bool
fuzz_firstbit(
void *buf,
int bitoff,
int nbits)
{
setbit_l((char *)buf, bitoff, !getbit_l((char *)buf, bitoff));
return true;
}
/* Flip the low bit in the (presumably big-endian) field */
static bool
fuzz_lastbit(
void *buf,
int bitoff,
int nbits)
{
setbit_l((char *)buf, bitoff + nbits - 1,
!getbit_l((char *)buf, bitoff + nbits - 1));
return true;
}
/* Flip the middle bit in the (presumably big-endian) field */
static bool
fuzz_middlebit(
void *buf,
int bitoff,
int nbits)
{
setbit_l((char *)buf, bitoff + nbits / 2,
!getbit_l((char *)buf, bitoff + nbits / 2));
return true;
}
/* Format and shift a number into a buffer for setbitval. */
static char *
format_number(
uint64_t val,
__be64 *out,
int bit_length)
{
int offset;
char *rbuf = (char *)out;
/*
* If the length of the field is not a multiple of a byte, push
* the bits up in the field, so the most signicant field bit is
* the most significant bit in the byte:
*
* before:
* val |----|----|----|----|----|--MM|mmmm|llll|
* after
* val |----|----|----|----|----|MMmm|mmll|ll00|
*/
offset = bit_length % NBBY;
if (offset)
val <<= (NBBY - offset);
/*
* convert to big endian and copy into the array
* rbuf |----|----|----|----|----|MMmm|mmll|ll00|
*/
*out = cpu_to_be64(val);
/*
* Align the array to point to the field in the array.
* rbuf = |MMmm|mmll|ll00|
*/
offset = sizeof(__be64) - 1 - ((bit_length - 1) / sizeof(__be64));
return rbuf + offset;
}
/* Increase the value by some small prime number. */
static bool
fuzz_add(
void *buf,
int bitoff,
int nbits)
{
uint64_t val;
__be64 out;
char *b;
if (nbits > 64)
return false;
val = getbitval(buf, bitoff, nbits, BVUNSIGNED);
val += (nbits > 8 ? 2017 : 137);
b = format_number(val, &out, nbits);
setbitval(buf, bitoff, nbits, b);
return true;
}
/* Decrease the value by some small prime number. */
static bool
fuzz_sub(
void *buf,
int bitoff,
int nbits)
{
uint64_t val;
__be64 out;
char *b;
if (nbits > 64)
return false;
val = getbitval(buf, bitoff, nbits, BVUNSIGNED);
val -= (nbits > 8 ? 2017 : 137);
b = format_number(val, &out, nbits);
setbitval(buf, bitoff, nbits, b);
return true;
}
/* Randomize the field. */
static bool
fuzz_random(
void *buf,
int bitoff,
int nbits)
{
int i, bytes;
char *b, *rbuf;
bytes = byteize_up(nbits);
rbuf = b = malloc(bytes);
if (!b) {
perror("fuzz_random");
return false;
}
for (i = 0; i < bytes; i++)
*b++ = (char)lrand48();
setbitval(buf, bitoff, nbits, rbuf);
free(rbuf);
return true;
}
struct fuzzcmd {
const char *verb;
bool (*fn)(void *buf, int bitoff, int nbits);
};
/* Keep these verbs in sync with enum fuzzcmds. */
static struct fuzzcmd fuzzverbs[] = {
{"zeroes", fuzz_zeroes},
{"ones", fuzz_ones},
{"firstbit", fuzz_firstbit},
{"middlebit", fuzz_middlebit},
{"lastbit", fuzz_lastbit},
{"add", fuzz_add},
{"sub", fuzz_sub},
{"random", fuzz_random},
{NULL, NULL},
};
/* ARGSUSED */
void
fuzz_struct(
const field_t *fields,
int argc,
char **argv)
{
const ftattr_t *fa;
flist_t *fl;
flist_t *sfl;
int bit_length;
struct fuzzcmd *fc;
bool success;
int parentoffset;
if (argc != 2) {
dbprintf(_("Usage: fuzz fieldname fuzzcmd\n"));
dbprintf("Fuzz commands: %s", fuzzverbs->verb);
for (fc = fuzzverbs + 1; fc->verb != NULL; fc++)
dbprintf(", %s", fc->verb);
dbprintf(".\n");
return;
}
fl = flist_scan(argv[0]);
if (!fl) {
dbprintf(_("unable to parse '%s'.\n"), argv[0]);
return;
}
/* Find our fuzz verb */
for (fc = fuzzverbs; fc->verb != NULL; fc++)
if (!strcmp(fc->verb, argv[1]))
break;
if (fc->fn == NULL) {
dbprintf(_("Unknown fuzz command '%s'.\n"), argv[1]);
goto out_free;
}
/* if we're a root field type, go down 1 layer to get field list */
if (fields->name[0] == '\0') {
fa = &ftattrtab[fields->ftyp];
ASSERT(fa->ftyp == fields->ftyp);
fields = fa->subfld;
}
/* run down the field list and set offsets into the data */
if (!flist_parse(fields, fl, iocur_top->data, 0)) {
dbprintf(_("parsing error\n"));
goto out_free;
}
sfl = fl;
parentoffset = 0;
while (sfl->child) {
parentoffset = sfl->offset;
sfl = sfl->child;
}
/*
* For structures, fsize * fcount tells us the size of the region we are
* modifying, which is usually a single structure member and is pointed
* to by the last child in the list.
*
* However, if the base structure is an array and we have a direct index
* into the array (e.g. write bno[5]) then we are returned a single
* flist object with the offset pointing directly at the location we
* need to modify. The length of the object we are modifying is then
* determined by the size of the individual array entry (fsize) and the
* indexes defined in the object, not the overall size of the array
* (which is what fcount returns).
*/
bit_length = fsize(sfl->fld, iocur_top->data, parentoffset, 0);
if (sfl->fld->flags & FLD_ARRAY)
bit_length *= sfl->high - sfl->low + 1;
else
bit_length *= fcount(sfl->fld, iocur_top->data, parentoffset);
/* Fuzz the value */
success = fc->fn(iocur_top->data, sfl->offset, bit_length);
if (!success) {
dbprintf(_("unable to fuzz field '%s'\n"), argv[0]);
goto out_free;
}
/* Write the fuzzed value back */
write_cur();
flist_print(fl);
print_flist(fl);
out_free:
flist_free(fl);
}
|