File: large_malloc_meta.cpp

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-19
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 1,999,616 kB
  • sloc: cpp: 6,951,724; ansic: 1,486,157; asm: 913,598; python: 232,059; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,079; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,430; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (31 lines) | stat: -rw-r--r-- 1,069 bytes parent folder | download | duplicates (32) 
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
 
// RUN: %clangxx_tsan -O1 %s -o %t && %run %t 2>&1 | FileCheck %s

// UNSUPPORTED: ios

#include "test.h"
#include <sys/mman.h>

// Test for previously unbounded memory consumption for large mallocs.
// Code allocates a large memory block (that is handled by LargeMmapAllocator),
// and forces allocation of meta shadow for the block. Then freed the block.
// But meta shadow was not unmapped. Then code occupies the virtual memory
// range of the block with something else (that does not need meta shadow).
// And repeats. As the result meta shadow growed infinitely.
// This program used to consume >2GB. Now it consumes <50MB.

int main() {
  for (int i = 0; i < 1000; i++) {
    const int kSize = 1 << 20;
    const int kPageSize = 4 << 10;
    volatile int *p = new int[kSize];
    for (int j = 0; j < kSize; j += kPageSize / sizeof(*p))
      __atomic_store_n(&p[i], 1, __ATOMIC_RELEASE);
    delete[] p;
    mmap(0, kSize * sizeof(*p) + kPageSize, PROT_NONE, MAP_PRIVATE | MAP_ANON,
        -1, 0);
  }
  fprintf(stderr, "DONE\n");
  return 0;
}

// CHECK: DONE