-
Notifications
You must be signed in to change notification settings - Fork 17
Expand file tree
/
Copy pathlinear-chase.cpp
More file actions
59 lines (52 loc) · 2.1 KB
/
linear-chase.cpp
File metadata and controls
59 lines (52 loc) · 2.1 KB
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
/*
Copyright (c) 2016, 2018 Andreas F. Borchert
All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
/* utility that measures the effect of automatic hardware-driven
prefetches for various stride values */
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <unistd.h>
#include <sys/times.h>
#include <printf.hpp> /* see https://github.com/afborchert/fmt */
#include "chase-pointers.hpp"
#include "linear-chain.hpp"
#ifndef MIN_STRIDE
#define MIN_STRIDE (sizeof(void*))
#endif
#ifndef MAX_STRIDE
#define MAX_STRIDE 1200
#endif
int main() {
fmt::printf(" stride time in ns\n");
for (std::size_t stride = MIN_STRIDE; stride <= MAX_STRIDE;
stride += sizeof(void*)) {
size_t memsize = std::min(std::size_t{1}<<26,
stride * 1024 * sizeof(void*));
void** memory = create_linear_chain(memsize, stride);
std::size_t count = std::size_t{1}<<30;
double t = chase_pointers(memory, count);
delete[] memory;
double ns = t * 1000000000 / count;
fmt::printf(" %8u %10.5lf\n", stride, ns); std::cout.flush();
}
}