~kris/9p

9hist

ref: fa2de1d5313d334f267c153900302e189906e2fb 9hist/mpc/ms.c -rw-r--r-- 1.1 KiB
fa2de1d5 — David du Colombier Plan 9 from Bell Labs 2000-09-20 26 years ago 
                                                                                
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

#include <u.h>
#include <libc.h>

char	d0[1000008], d1[1000008];

void	test(int size, int align);

memtest(char *pp, int n)
{
	static int seed = 0;
	ulong *p, *ep;
	ulong x;

if(seed % 100 == 0)
print("memtest seed = %d\n", seed);

	p = (ulong*)pp;
	ep = (ulong*)(pp+n);

	x = seed;
	while(p < ep) {
		*p++ = x;
		x *= 1103515245;
	}

	x = seed;
	p = (ulong*)pp;
	ep = (ulong*)(pp+n);
	while(p < ep) {
		if(*p++ != x) {
			print("error %ux!!\n", ((char*)p) - pp);
			return;
		}
		x *= 1103515245;
	}
	seed++;
}

void
main()
{
	int j;

	memmove(d0, d1, sizeof(d0));
	
	for(j=0; j<10; j++) {
		memtest(d0, sizeof(d0));
	}

	for(j = 0; j<8; j++)
		test(12, j);
	for(j = 0; j<8; j++)
		test(100, j);
	for(j = 0; j<8; j++)
		test(400, j);
	for(j = 0; j<8; j++)
		test(1000, j);
	for(j = 0; j<8; j++)
		test(10000, j);
	for(j = 0; j<8; j++)
		test(100000, j);
	for(j = 0; j<8; j++)
		test(1000000, j);

	exits(0);
}

void
test(int size, int align)
{
	int n;
	int t;

	t = -times(0);
	n = 10000000/size;
	while(n) {
		memmove(d0+align, d1, size);
		n--;
	}
	t += times(0);
	print("size = %d align = %d KB/s %d %d\n", size, align, 10000000/t, t);
}