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
|
/*
* Copyright (C) 2019 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <gtest/gtest.h>
#include <inttypes.h>
#include <malloc.h>
#include <limits.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <thread>
#include <vector>
#include <android-base/strings.h>
#if defined(__BIONIC__)
#include <meminfo/procmeminfo.h>
#include <procinfo/process_map.h>
#endif
TEST(malloc_stress, multiple_threads_forever) {
constexpr size_t kMaxThreads = 256;
constexpr size_t kAllocSize = 4096;
#if defined(__BIONIC__)
uint64_t rss_min = UINT64_MAX;
uint64_t rss_max = 0;
uint64_t vss_min = UINT64_MAX;
uint64_t vss_max = 0;
ASSERT_EQ(1, mallopt(M_DECAY_TIME, 1));
#endif
uint64_t mallinfo_min = UINT64_MAX;
uint64_t mallinfo_max = 0;
for (size_t i = 0; ; i++) {
printf("Pass %zu\n", i);
std::vector<std::thread*> threads;
for (size_t i = 0; i < kMaxThreads; i++) {
threads.push_back(new std::thread([]() {
void* buf = malloc(4096);
if (buf == nullptr) {
printf("Failed to allocate memory\n");
_exit(1);
}
memset(buf, 0, kAllocSize);
sleep(1);
free(buf);
}));
}
for (auto thread : threads) {
thread->join();
delete thread;
}
threads.clear();
#if defined(__BIONIC__)
android::meminfo::ProcMemInfo proc_mem(getpid());
const std::vector<android::meminfo::Vma>& maps = proc_mem.MapsWithoutUsageStats();
uint64_t rss_bytes = 0;
uint64_t vss_bytes = 0;
for (auto& vma : maps) {
if (vma.name == "[anon:libc_malloc]" || android::base::StartsWith(vma.name, "[anon:scudo:") ||
android::base::StartsWith(vma.name, "[anon:GWP-ASan")) {
android::meminfo::Vma update_vma(vma);
ASSERT_TRUE(proc_mem.FillInVmaStats(update_vma));
rss_bytes += update_vma.usage.rss;
vss_bytes += update_vma.usage.vss;
}
}
if (rss_bytes < rss_min) {
rss_min = rss_bytes;
}
if (rss_bytes > rss_max) {
rss_max = rss_bytes;
}
if (vss_bytes < vss_min) {
vss_min = vss_bytes;
}
if (vss_bytes > vss_max) {
vss_max = vss_bytes;
}
printf("RSS %" PRIu64 " %0.2fMB\n", rss_bytes, rss_bytes / (1024.0 * 1024.0));
printf(" Min %" PRIu64 " %0.2fMB\n", rss_min, rss_min / (1024.0 * 1024.0));
printf(" Max %" PRIu64 " %0.2fMB\n", rss_max, rss_max / (1024.0 * 1024.0));
printf("VSS %" PRIu64 " %0.2f MB\n", vss_bytes, vss_bytes / (1024.0 * 1024.0));
printf(" Min %" PRIu64 " %0.2fMB\n", vss_min, vss_min / (1024.0 * 1024.0));
printf(" Max %" PRIu64 " %0.2fMB\n", vss_max, vss_max / (1024.0 * 1024.0));
#endif
size_t mallinfo_bytes = mallinfo().uordblks;
if (mallinfo_bytes < mallinfo_min) {
mallinfo_min = mallinfo_bytes;
}
if (mallinfo_bytes > mallinfo_max) {
mallinfo_max = mallinfo_bytes;
}
printf("Allocated memory %zu %0.2fMB\n", mallinfo_bytes, mallinfo_bytes / (1024.0 * 1024.0));
printf(" Min %" PRIu64 " %0.2fMB\n", mallinfo_min, mallinfo_min / (1024.0 * 1024.0));
printf(" Max %" PRIu64 " %0.2fMB\n", mallinfo_max, mallinfo_max / (1024.0 * 1024.0));
}
}
|
