File: pack_stack_trace_differential_fuzzer.cc

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (57 lines) | stat: -rw-r--r-- 2,094 bytes parent folder | download | duplicates (6)
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
// Copyright 2019 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifdef UNSAFE_BUFFERS_BUILD
// TODO(crbug.com/40285824): Remove this and convert code to safer constructs.
#pragma allow_unsafe_buffers
#endif

#include <string.h>

#include <algorithm>
#include <memory>

#include "base/containers/heap_array.h"
#include "components/gwp_asan/common/pack_stack_trace.h"

// Tests that whatever we give to Pack() is the same as what comes out of
// Unpack().

extern "C" int LLVMFuzzerTestOneInput(const uint8_t* Data, size_t Size) {
  if (Size < sizeof(size_t) * 2)
    return 0;

  size_t unpacked_max_size = reinterpret_cast<const size_t*>(Data)[0];
  size_t packed_max_size = reinterpret_cast<const size_t*>(Data)[1];
  Data += sizeof(size_t) * 2;
  Size -= sizeof(size_t) * 2;

  size_t entries = Size / sizeof(uintptr_t);

  // We don't need a buffer large than Size*10 as the longest variable length
  // encoding of a 64-bit integer is 10 bytes long.)
  size_t packed_array_size = std::min(Size * 10, packed_max_size);
  base::HeapArray<uint8_t> packed =
      base::HeapArray<uint8_t>::Uninit(packed_array_size);
  size_t packed_out =
      gwp_asan::internal::Pack(reinterpret_cast<const uintptr_t*>(Data),
                               entries, packed.data(), packed_max_size);
  if (packed_out > packed_array_size)
    __builtin_trap();

  size_t unpacked_array_size = std::min(unpacked_max_size, entries);
  base::HeapArray<uintptr_t> unpacked =
      base::HeapArray<uintptr_t>::Uninit(unpacked_array_size);
  size_t unpacked_out = gwp_asan::internal::Unpack(
      packed.data(), packed_out, unpacked.data(), unpacked_max_size);
  // We can only be sure there was enough room to pack the entire input when
  // packed_max_size was larger than the space allocated for packed data.
  if (packed_max_size > packed_array_size &&
      unpacked_out != unpacked_array_size)
    __builtin_trap();
  if (memcmp(Data, unpacked.data(), unpacked_out * sizeof(uintptr_t))) {
    __builtin_trap();
  }
  return 0;
}