1 /*
 2  * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
 3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 4  *
 5  * This code is free software; you can redistribute it and/or modify it
 6  * under the terms of the GNU General Public License version 2 only, as
 7  * published by the Free Software Foundation.
 8  *
 9  * This code is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12  * version 2 for more details (a copy is included in the LICENSE file that
13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 package org.openjdk.bench.valhalla.mandelbrot;
24 
25 import org.openjdk.jmh.annotations.Benchmark;
26 
27 public class Identity extends MandelbrotBase {
28 
29     @Benchmark
30     public int[][] mandelbrot() {
31         for (int x = 0; x < size; x++) {
32             for (int y = 0; y < size; y++) {
33                 points[x][y] = count(coordToComplex(x, y, size, size));
34             }
35         }
36         return points;
37     }
38 
39     private IdentityComplex coordToComplex(int x, int y, int width, int height) {
40         double cx = ((double) x) / (((double) width) / 2.0) - 1.0;
41         double cy = ((double) y) / (((double) height) / 2.0) - 1.0;
42         return new IdentityComplex(cy * SCALE, cx * SCALE);
43     }
44 
45     private static int count(IdentityComplex c) {
46         IdentityComplex z = c;
47         for (int i = 1; i < MAX_ITER; i++) {
48             if (z.length() >= 2.0) return i;
49             z = z.mul(z).add(c);
50         }
51         return MAX_ITER;
52     }
53 
54     public static class IdentityComplex {
55 
56         public final double re;
57         public final double im;
58 
59         public IdentityComplex(double re, double im) {
60             this.re =  re;
61             this.im =  im;
62         }
63 
64         public double re() { return re; }
65 
66         public double im() { return im; }
67 
68         public IdentityComplex add(IdentityComplex that) {
69             return new IdentityComplex(this.re + that.re, this.im + that.im);
70         }
71 
72         public IdentityComplex mul(IdentityComplex that) {
73             return new IdentityComplex(this.re * that.re - this.im * that.im,
74                     this.re * that.im + this.im * that.re);
75         }
76 
77         public double length() {
78             return Math.sqrt(re * re + im * im);
79         }
80 
81     }
82 }