File: sampling_malloc_shims.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 (409 lines) | stat: -rw-r--r-- 12,529 bytes parent folder | download | duplicates (5)
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
// Copyright 2018 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 "components/gwp_asan/client/sampling_malloc_shims.h"

#include <algorithm>
#include <utility>

#include "base/check_op.h"
#include "base/compiler_specific.h"
#include "base/numerics/safe_math.h"
#include "base/process/process_metrics.h"
#include "base/rand_util.h"
#include "build/build_config.h"
#include "components/crash/core/common/crash_key.h"
#include "components/gwp_asan/client/export.h"
#include "components/gwp_asan/client/guarded_page_allocator.h"
#include "components/gwp_asan/client/sampling_state.h"
#include "components/gwp_asan/common/crash_key_name.h"
#include "partition_alloc/shim/allocator_shim.h"

#if BUILDFLAG(IS_APPLE)
#include <pthread.h>
#endif

namespace gwp_asan {
namespace internal {

namespace {

using allocator_shim::AllocatorDispatch;

// By being implemented as a global with inline method definitions, method calls
// and member accesses are inlined and as efficient as possible in the
// performance-sensitive allocation hot-path.
//
// Note that this optimization has not been benchmarked. However since it is
// easy to do there is no reason to pay the extra cost.
SamplingState<MALLOC> sampling_state;

// The global allocator singleton used by the shims. Implemented as a global
// pointer instead of a function-local static to avoid initialization checks
// for every access.
GuardedPageAllocator* gpa = nullptr;

extern AllocatorDispatch g_allocator_dispatch;

void* AllocFn(size_t size, void* context) {
  if (sampling_state.Sample(size)) [[unlikely]] {
    if (void* allocation = gpa->Allocate(size))
      return allocation;
  }

  return g_allocator_dispatch.next->alloc_function(size, context);
}

void* AllocUncheckedFn(size_t size, void* context) {
  if (sampling_state.Sample(size)) [[unlikely]] {
    if (void* allocation = gpa->Allocate(size))
      return allocation;
  }

  return g_allocator_dispatch.next->alloc_unchecked_function(size, context);
}

void* AllocZeroInitializedFn(size_t n, size_t size, void* context) {
  if (sampling_state.Sample(size)) [[unlikely]] {
    base::CheckedNumeric<size_t> checked_total = size;
    checked_total *= n;
    if (!checked_total.IsValid()) [[unlikely]] {
      return nullptr;
    }

    size_t total_size = checked_total.ValueOrDie();
    if (void* allocation = gpa->Allocate(total_size)) {
      memset(allocation, 0, total_size);
      return allocation;
    }
  }

  return g_allocator_dispatch.next->alloc_zero_initialized_function(n, size,
                                                                    context);
}

void* AllocAlignedFn(size_t alignment, size_t size, void* context) {
  if (sampling_state.Sample(size)) [[unlikely]] {
    if (void* allocation = gpa->Allocate(size, alignment))
      return allocation;
  }

  return g_allocator_dispatch.next->alloc_aligned_function(alignment, size,
                                                           context);
}

void* ReallocFn(void* address, size_t size, void* context) {
  if (!address) [[unlikely]] {
    return AllocFn(size, context);
  }

  if (!gpa->PointerIsMine(address)) [[likely]] {
    return g_allocator_dispatch.next->realloc_function(address, size, context);
  }

  if (!size) {
    gpa->Deallocate(address);
    return nullptr;
  }

  void* new_alloc = gpa->Allocate(size);
  if (!new_alloc)
    new_alloc = g_allocator_dispatch.next->alloc_function(size, context);
  if (!new_alloc)
    return nullptr;

  memcpy(new_alloc, address, std::min(size, gpa->GetRequestedSize(address)));
  gpa->Deallocate(address);
  return new_alloc;
}

void* ReallocUncheckedFn(void* address, size_t size, void* context) {
  if (!address) [[unlikely]] {
    return AllocFn(size, context);
  }

  if (!gpa->PointerIsMine(address)) [[likely]] {
    return g_allocator_dispatch.next->realloc_unchecked_function(address, size,
                                                                 context);
  }

  if (!size) {
    gpa->Deallocate(address);
    return nullptr;
  }

  void* new_alloc = gpa->Allocate(size);
  if (!new_alloc) {
    new_alloc =
        g_allocator_dispatch.next->alloc_unchecked_function(size, context);
  }
  if (!new_alloc) {
    return nullptr;
  }

  memcpy(new_alloc, address, std::min(size, gpa->GetRequestedSize(address)));
  gpa->Deallocate(address);
  return new_alloc;
}

void FreeFn(void* address, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    return gpa->Deallocate(address);
  }

  g_allocator_dispatch.next->free_function(address, context);
}

void FreeWithSizeFn(void* address, size_t size, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    // TODO(vtsyrklevich): Perform this check in GuardedPageAllocator and report
    // failed checks using the same pipeline.
    CHECK_EQ(size, gpa->GetRequestedSize(address));
    gpa->Deallocate(address);
    return;
  }

  g_allocator_dispatch.next->free_with_size_function(address, size, context);
}

void FreeWithAlignmentFn(void* address, size_t alignment, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    gpa->Deallocate(address);
    return;
  }

  g_allocator_dispatch.next->free_with_alignment_function(address, alignment,
                                                          context);
}

void FreeWithSizeAndAlignmentFn(void* address,
                                size_t size,
                                size_t alignment,
                                void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    // TODO(vtsyrklevich): Perform this check in GuardedPageAllocator and report
    // failed checks using the same pipeline.
    CHECK_EQ(size, gpa->GetRequestedSize(address));
    gpa->Deallocate(address);
    return;
  }

  g_allocator_dispatch.next->free_with_size_and_alignment_function(
      address, size, alignment, context);
}

size_t GetSizeEstimateFn(void* address, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    return gpa->GetRequestedSize(address);
  }

  return g_allocator_dispatch.next->get_size_estimate_function(address,
                                                               context);
}

size_t GoodSizeFn(size_t size, void* context) {
  // We don't know whether the allocation would be handled by the guarded page
  // allocator, cannot return what it would prefer here.
  return g_allocator_dispatch.next->good_size_function(size, context);
}

bool ClaimedAddressFn(void* address, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    return true;
  }

  return g_allocator_dispatch.next->claimed_address_function(address, context);
}

unsigned BatchMallocFn(size_t size,
                       void** results,
                       unsigned num_requested,
                       void* context) {
  // The batch_malloc() routine is esoteric and only accessible for the system
  // allocator's zone, GWP-ASan interception is not provided.

  return g_allocator_dispatch.next->batch_malloc_function(
      size, results, num_requested, context);
}

void BatchFreeFn(void** to_be_freed, unsigned num_to_be_freed, void* context) {
  // A batch_free() hook is implemented because it is imperative that we never
  // call free() with a GWP-ASan allocation.
  for (size_t i = 0; i < num_to_be_freed; i++) {
    if (gpa->PointerIsMine(to_be_freed[i])) [[unlikely]] {
      // If this batch includes guarded allocations, call free() on all of the
      // individual allocations to ensure the guarded allocations are handled
      // correctly.
      for (size_t j = 0; j < num_to_be_freed; j++)
        FreeFn(to_be_freed[j], context);
      return;
    }
  }

  g_allocator_dispatch.next->batch_free_function(to_be_freed, num_to_be_freed,
                                                 context);
}

void TryFreeDefaultFn(void* address, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    gpa->Deallocate(address);
    return;
  }

  g_allocator_dispatch.next->try_free_default_function(address, context);
}

static void* AlignedMallocFn(size_t size, size_t alignment, void* context) {
  if (sampling_state.Sample(size)) [[unlikely]] {
    if (void* allocation = gpa->Allocate(size, alignment))
      return allocation;
  }

  return g_allocator_dispatch.next->aligned_malloc_function(size, alignment,
                                                            context);
}

static void* AlignedMallocUncheckedFn(size_t size,
                                      size_t alignment,
                                      void* context) {
  if (sampling_state.Sample(size)) [[unlikely]] {
    if (void* allocation = gpa->Allocate(size, alignment)) {
      return allocation;
    }
  }

  return g_allocator_dispatch.next->aligned_malloc_unchecked_function(
      size, alignment, context);
}

static void* AlignedReallocFn(void* address,
                              size_t size,
                              size_t alignment,
                              void* context) {
  if (!address) [[unlikely]] {
    return AlignedMallocFn(size, alignment, context);
  }

  if (!gpa->PointerIsMine(address)) [[likely]] {
    return g_allocator_dispatch.next->aligned_realloc_function(
        address, size, alignment, context);
  }

  if (!size) {
    gpa->Deallocate(address);
    return nullptr;
  }

  void* new_alloc = gpa->Allocate(size, alignment);
  if (!new_alloc)
    new_alloc = g_allocator_dispatch.next->aligned_malloc_function(
        size, alignment, context);
  if (!new_alloc)
    return nullptr;

  memcpy(new_alloc, address, std::min(size, gpa->GetRequestedSize(address)));
  gpa->Deallocate(address);
  return new_alloc;
}

static void* AlignedReallocUncheckedFn(void* address,
                                       size_t size,
                                       size_t alignment,
                                       void* context) {
  if (!address) [[unlikely]] {
    return AlignedMallocFn(size, alignment, context);
  }

  if (!gpa->PointerIsMine(address)) [[likely]] {
    return g_allocator_dispatch.next->aligned_realloc_unchecked_function(
        address, size, alignment, context);
  }

  if (!size) {
    gpa->Deallocate(address);
    return nullptr;
  }

  void* new_alloc = gpa->Allocate(size, alignment);
  if (!new_alloc) {
    new_alloc = g_allocator_dispatch.next->aligned_malloc_unchecked_function(
        size, alignment, context);
  }
  if (!new_alloc) {
    return nullptr;
  }

  memcpy(new_alloc, address, std::min(size, gpa->GetRequestedSize(address)));
  gpa->Deallocate(address);
  return new_alloc;
}

static void AlignedFreeFn(void* address, void* context) {
  if (gpa->PointerIsMine(address)) [[unlikely]] {
    return gpa->Deallocate(address);
  }

  g_allocator_dispatch.next->aligned_free_function(address, context);
}

AllocatorDispatch g_allocator_dispatch = {
    &AllocFn,
    &AllocUncheckedFn,
    &AllocZeroInitializedFn,
    &AllocAlignedFn,
    &ReallocFn,
    &ReallocUncheckedFn,
    &FreeFn,
    &FreeWithSizeFn,
    &FreeWithAlignmentFn,
    &FreeWithSizeAndAlignmentFn,
    &GetSizeEstimateFn,
    &GoodSizeFn,
    &ClaimedAddressFn,
    &BatchMallocFn,
    &BatchFreeFn,
    &TryFreeDefaultFn,
    &AlignedMallocFn,
    &AlignedMallocUncheckedFn,
    &AlignedReallocFn,
    &AlignedReallocUncheckedFn,
    &AlignedFreeFn,
    nullptr /* next */
};

}  // namespace

// We expose the allocator singleton for unit tests.
GWP_ASAN_EXPORT GuardedPageAllocator& GetMallocGpaForTesting() {
  return *gpa;
}

bool InstallMallocHooks(const AllocatorSettings& settings,
                        GuardedPageAllocator::OutOfMemoryCallback callback) {
  static crash_reporter::CrashKeyString<24> malloc_crash_key(kMallocCrashKey);
  gpa = new GuardedPageAllocator();
  if (!gpa->Init(settings, std::move(callback), false)) {
    return false;
  }
  malloc_crash_key.Set(gpa->GetCrashKey());
  sampling_state.Init(settings.sampling_frequency);
  sampling_state.SetSampleSizeRestriction(settings.sampling_min_size,
                                          settings.sampling_max_size);

  allocator_shim::InsertAllocatorDispatch(&g_allocator_dispatch);
  return true;
}

}  // namespace internal

bool IsGwpAsanMallocAllocation(const void* ptr) {
  return internal::gpa && internal::gpa->PointerIsMine(ptr);
}

}  // namespace gwp_asan