File: malloc.cpp

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (36 lines) | stat: -rw-r--r-- 860 bytes parent folder | download | duplicates (24) 
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
 
// RUN: %clangxx_scudo %s -lstdc++ -o %t
// RUN: %run %t 2>&1

// Tests that a regular workflow of allocation, memory fill and free works as
// intended. Tests various sizes serviced by the primary and secondary
// allocators.

#include <assert.h>
#include <stdlib.h>
#include <string.h>

#include <vector>

int main(int argc, char **argv) {
  void *p;
  std::vector<ssize_t> sizes{1, 8, 16, 32, 1024, 32768,
                             1 << 16, 1 << 17, 1 << 20, 1 << 24};
  std::vector<int> offsets{1, 0, -1, -7, -8, -15, -16, -31, -32};

  p = malloc(0);
  assert(p);
  free(p);
  for (ssize_t size : sizes) {
    for (int offset : offsets) {
      ssize_t actual_size = size + offset;
      if (actual_size <= 0)
        continue;
      p = malloc(actual_size);
      assert(p);
      memset(p, 0xff, actual_size);
      free(p);
    }
  }

  return 0;
}