-
Notifications
You must be signed in to change notification settings - Fork 0
/
rss_tc.cpp
243 lines (218 loc) · 6.69 KB
/
rss_tc.cpp
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
// Copyright 2020 The Division Authors.
//
// 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
//
// https://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.
// Author [email protected] && [email protected]
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <sys/resource.h>
#include <sys/time.h>
#include <thread>
#include <unistd.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "flat_hash_map/flat_hash_map.hpp"
#include "gperftools/malloc_extension.h"
#include "parallel_hashmap/phmap.h"
#include "utils/rss.h"
const int SIZE = 1024 * 1024;
int main(int argc, char *argv[])
{
std::string out;
MallocExtension::instance()->GetHeapSample(&out);
std::cout<<out<<'\n';
{
rusage usage{};
FillRSS(usage);
std::vector<uint8_t> vecu8;
vecu8.resize(SIZE);
std::cout << "vector of u8 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::vector<uint64_t> vec;
vec.resize(SIZE);
std::cout << "vector of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::deque<uint8_t> dequ8;
dequ8.resize(SIZE);
std::cout << "deque of u8 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::deque<uint64_t> dequ64;
dequ64.resize(SIZE);
std::cout << "deque of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::list<uint8_t> li;
li.resize(SIZE);
std::cout << "list of u8 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::list<uint16_t> li16;
li16.resize(SIZE);
std::cout << "list of u16 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::list<uint64_t> li64;
li64.resize(SIZE);
std::cout << "list of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::set<uint32_t> s32;
for (auto i = 0; i < SIZE; i++)
{
s32.insert(i);
}
std::cout << "set of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::set<uint64_t> s64;
for (auto i = 0; i < SIZE; i++)
{
s64.insert(i);
}
std::cout << "set of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::map<uint32_t, uint32_t> m32;
for (auto i = 0; i < SIZE; i++)
{
m32[i] = i;
}
std::cout << "map of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::map<uint64_t, uint64_t> m64;
for (auto i = 0; i < SIZE; i++)
{
m64[i] = i;
}
std::cout << "map of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::unordered_set<uint32_t> us32;
us32.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
us32.insert(i);
}
std::cout << "uset of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::unordered_set<uint64_t> us64;
us64.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
us64.insert(i);
}
std::cout << "uset of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::unordered_map<uint32_t, uint32_t> um32;
um32.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
um32[i] = i;
}
std::cout << "umap of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
std::unordered_map<uint64_t, uint64_t> um64;
um64.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
um64[i] = i;
}
std::cout << "umap of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
ska::flat_hash_set<uint32_t> flat_set_32;
flat_set_32.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
flat_set_32.insert(i);
}
std::cout << "ska flat set of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
ska::flat_hash_set<uint64_t> flat_set_64;
flat_set_64.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
flat_set_64.insert(i);
}
std::cout << "ska flat set of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
phmap::flat_hash_set<uint32_t> ph_flat_set_32;
ph_flat_set_32.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
ph_flat_set_32.insert(i);
}
std::cout << "ph flat set of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
phmap::flat_hash_set<uint64_t> ph_flat_set_64;
ph_flat_set_64.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
ph_flat_set_64.insert(i);
}
std::cout << "ph flat set of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
ska::flat_hash_map<uint32_t, uint32_t> flat_map_32;
flat_map_32.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
flat_map_32[i] = i;
}
std::cout << "ska flat map of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
ska::flat_hash_map<uint64_t, uint64_t> flat_map_64;
flat_map_64.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
flat_map_64[i] = i;
}
std::cout << "ska flat map of u64 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
phmap::flat_hash_map<uint32_t, uint32_t> ph_flat_map_32;
ph_flat_map_32.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
ph_flat_map_32[i] = i;
}
std::cout << "ph flat map of u32 " << SIZE << '\n';
PrintUsage(usage);
FillRSS(usage);
phmap::flat_hash_map<uint64_t, uint64_t> ph_flat_map_64;
ph_flat_map_64.reserve(SIZE);
for (auto i = 0; i < SIZE; i++)
{
ph_flat_map_64[i] = i;
}
std::cout << "ph flat map of u64 " << SIZE << '\n';
PrintUsage(usage);
}
return 0;
}