blob: 3eee90d8c0a1ac8f1ceaa1ac0fa36e2faae4a51a (
plain)
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
|
/*
* This benchmark has been ported from "The Computer Language Benchmarks Game" suite and slightly
* modified to fit the benchmarking framework.
*
* The original file is `mandelbrot/mandelbrot.java` from the archive
* available at
* http://benchmarksgame.alioth.debian.org/download/benchmarksgame-sourcecode.zip.
* See LICENSE file in the same folder (BSD 3-clause)
*
* The Computer Language Benchmarks Game
* http://benchmarksgame.alioth.debian.org/
*
* contributed by Stefan Krause
* slightly modified by Chad Whipkey
*/
/*
* Description: Generate Mandelbrot set portable bitmap file.
* Main Focus: TODO
*
*/
package benchmarks.benchmarksgame;
import java.io.IOException;
import java.io.PrintStream;
import java.lang.System;
// CHECKSTYLE.OFF: .*
public class mandelbrot {
private static final int PREDEFINED_SIZE = 200;
private static final int BUFFER_SIZE = 8192;
public mandelbrot() {
this.size = PREDEFINED_SIZE;
fac = 2.0 / size;
shift = size % 8 == 0 ? 0 : (8- size % 8);
}
final int size;
final byte [] buf = new byte[BUFFER_SIZE];
int bufLen = 0;
final double fac;
final int shift;
public void compute()
{
for (int y = 0; y<size; y++)
computeRow(y);
}
private void computeRow(int y)
{
int bits = 0;
final double Ci = (y*fac - 1.0);
final byte[] bufLocal = buf;
for (int x = 0; x<size;x++) {
double Zr = 0.0;
double Zi = 0.0;
double Cr = (x*fac - 1.5);
int i = 50;
double ZrN = 0;
double ZiN = 0;
do {
Zi = 2.0 * Zr * Zi + Ci;
Zr = ZrN - ZiN + Cr;
ZiN = Zi * Zi;
ZrN = Zr * Zr;
} while (!(ZiN + ZrN > 4.0) && --i > 0);
bits = bits << 1;
if (i == 0) bits++;
if (x%8 == 7) {
bufLocal[bufLen++] = (byte) bits;
if ( bufLen == BUFFER_SIZE) {
bufLen = 0;
}
bits = 0;
}
}
if (shift!=0) {
bits = bits << shift;
bufLocal[bufLen++] = (byte) bits;
if ( bufLen == BUFFER_SIZE) {
bufLen = 0;
}
}
}
// CHECKSTYLE.OFF: .*
public void timeMandelbrot(int iters) {
for (int i = 0; i < iters; i++) {
bufLen = 0;
compute();
}
}
public boolean verifyMandelbrot() {
bufLen = 0;
compute();
int expected = 5000;
int found = bufLen;
if (expected != found) {
System.out.println("ERROR: Expected " + expected + " but found " + found);
return false;
}
return true;
}
public static void main(String[] args) {
int rc = 0;
mandelbrot obj = new mandelbrot();
final long before = System.currentTimeMillis();
obj.timeMandelbrot(65);
final long after = System.currentTimeMillis();
if (!obj.verifyMandelbrot()) {
rc++;
}
System.out.println("benchmarks/benchmarksgame/mandelbrot: " + (after - before));
System.exit(rc);
}
}
|
