author | lbourges |
Tue, 27 Mar 2018 22:09:43 +0200 | |
changeset 49496 | 1ea202af7a97 |
parent 48284 | fd7fbc929001 |
child 51933 | 4ec74929fbfe |
permissions | -rw-r--r-- |
47126 | 1 |
/* |
49496 | 2 |
* Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved. |
47126 | 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. Oracle designates this |
|
8 |
* particular file as subject to the "Classpath" exception as provided |
|
9 |
* by Oracle in the LICENSE file that accompanied this code. |
|
10 |
* |
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
15 |
* accompanied this code). |
|
16 |
* |
|
17 |
* You should have received a copy of the GNU General Public License version |
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
20 |
* |
|
21 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
22 |
* or visit www.oracle.com if you need additional information or have any |
|
23 |
* questions. |
|
24 |
*/ |
|
25 |
||
26 |
package sun.java2d.marlin; |
|
27 |
||
28 |
import java.awt.geom.Path2D; |
|
29 |
import java.lang.ref.WeakReference; |
|
30 |
import java.util.concurrent.atomic.AtomicInteger; |
|
31 |
import sun.java2d.ReentrantContext; |
|
32 |
import sun.java2d.marlin.ArrayCacheConst.CacheStats; |
|
33 |
import sun.java2d.marlin.DMarlinRenderingEngine.NormalizingPathIterator; |
|
49496 | 34 |
import sun.java2d.marlin.DTransformingPathConsumer2D.CurveBasicMonotonizer; |
35 |
import sun.java2d.marlin.DTransformingPathConsumer2D.CurveClipSplitter; |
|
47126 | 36 |
|
37 |
/** |
|
38 |
* This class is a renderer context dedicated to a single thread |
|
39 |
*/ |
|
40 |
final class DRendererContext extends ReentrantContext implements IRendererContext { |
|
41 |
||
42 |
// RendererContext creation counter |
|
43 |
private static final AtomicInteger CTX_COUNT = new AtomicInteger(1); |
|
44 |
||
45 |
/** |
|
46 |
* Create a new renderer context |
|
47 |
* |
|
48 |
* @return new RendererContext instance |
|
49 |
*/ |
|
50 |
static DRendererContext createContext() { |
|
51 |
return new DRendererContext("ctx" |
|
52 |
+ Integer.toString(CTX_COUNT.getAndIncrement())); |
|
53 |
} |
|
54 |
||
55 |
// Smallest object used as Cleaner's parent reference |
|
56 |
private final Object cleanerObj; |
|
57 |
// dirty flag indicating an exception occured during pipeline in pathTo() |
|
58 |
boolean dirty = false; |
|
59 |
// shared data |
|
60 |
final double[] double6 = new double[6]; |
|
61 |
// shared curve (dirty) (Renderer / Stroker) |
|
62 |
final DCurve curve = new DCurve(); |
|
63 |
// MarlinRenderingEngine NormalizingPathIterator NearestPixelCenter: |
|
64 |
final NormalizingPathIterator nPCPathIterator; |
|
65 |
// MarlinRenderingEngine NearestPixelQuarter NormalizingPathIterator: |
|
66 |
final NormalizingPathIterator nPQPathIterator; |
|
67 |
// MarlinRenderingEngine.TransformingPathConsumer2D |
|
68 |
final DTransformingPathConsumer2D transformerPC2D; |
|
69 |
// recycled Path2D instance (weak) |
|
70 |
private WeakReference<Path2D.Double> refPath2D = null; |
|
71 |
final DRenderer renderer; |
|
72 |
final DStroker stroker; |
|
73 |
// Simplifies out collinear lines |
|
74 |
final DCollinearSimplifier simplifier = new DCollinearSimplifier(); |
|
49496 | 75 |
// Simplifies path |
76 |
final DPathSimplifier pathSimplifier = new DPathSimplifier(); |
|
47126 | 77 |
final DDasher dasher; |
78 |
final MarlinTileGenerator ptg; |
|
79 |
final MarlinCache cache; |
|
80 |
// flag indicating the shape is stroked (1) or filled (0) |
|
81 |
int stroking = 0; |
|
48284
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
82 |
// flag indicating to clip the shape |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
83 |
boolean doClip = false; |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
84 |
// flag indicating if the path is closed or not (in advance) to handle properly caps |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
85 |
boolean closedPath = false; |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
86 |
// clip rectangle (ymin, ymax, xmin, xmax): |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
87 |
final double[] clipRect = new double[4]; |
49496 | 88 |
// CurveBasicMonotonizer instance |
89 |
final CurveBasicMonotonizer monotonizer; |
|
90 |
// CurveClipSplitter instance |
|
91 |
final CurveClipSplitter curveClipSplitter; |
|
47126 | 92 |
|
93 |
// Array caches: |
|
94 |
/* clean int[] cache (zero-filled) = 5 refs */ |
|
95 |
private final IntArrayCache cleanIntCache = new IntArrayCache(true, 5); |
|
48284
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
96 |
/* dirty int[] cache = 5 refs */ |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
97 |
private final IntArrayCache dirtyIntCache = new IntArrayCache(false, 5); |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
98 |
/* dirty double[] cache = 4 refs (2 polystack) */ |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
99 |
private final DoubleArrayCache dirtyDoubleCache = new DoubleArrayCache(false, 4); |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
100 |
/* dirty byte[] cache = 2 ref (2 polystack) */ |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
101 |
private final ByteArrayCache dirtyByteCache = new ByteArrayCache(false, 2); |
47126 | 102 |
|
103 |
// RendererContext statistics |
|
104 |
final RendererStats stats; |
|
105 |
||
106 |
final PathConsumer2DAdapter p2dAdapter = new PathConsumer2DAdapter(); |
|
107 |
||
108 |
||
109 |
/** |
|
110 |
* Constructor |
|
111 |
* |
|
112 |
* @param name context name (debugging) |
|
113 |
*/ |
|
114 |
DRendererContext(final String name) { |
|
115 |
if (LOG_CREATE_CONTEXT) { |
|
116 |
MarlinUtils.logInfo("new RendererContext = " + name); |
|
117 |
} |
|
118 |
this.cleanerObj = new Object(); |
|
119 |
||
120 |
// create first stats (needed by newOffHeapArray): |
|
121 |
if (DO_STATS || DO_MONITORS) { |
|
122 |
stats = RendererStats.createInstance(cleanerObj, name); |
|
123 |
// push cache stats: |
|
124 |
stats.cacheStats = new CacheStats[] { cleanIntCache.stats, |
|
125 |
dirtyIntCache.stats, dirtyDoubleCache.stats, dirtyByteCache.stats |
|
126 |
}; |
|
127 |
} else { |
|
128 |
stats = null; |
|
129 |
} |
|
130 |
||
131 |
// NormalizingPathIterator instances: |
|
132 |
nPCPathIterator = new NormalizingPathIterator.NearestPixelCenter(double6); |
|
133 |
nPQPathIterator = new NormalizingPathIterator.NearestPixelQuarter(double6); |
|
134 |
||
49496 | 135 |
// curve monotonizer & clip subdivider (before transformerPC2D init) |
136 |
monotonizer = new CurveBasicMonotonizer(this); |
|
137 |
curveClipSplitter = new CurveClipSplitter(this); |
|
138 |
||
47126 | 139 |
// MarlinRenderingEngine.TransformingPathConsumer2D |
48284
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
140 |
transformerPC2D = new DTransformingPathConsumer2D(this); |
47126 | 141 |
|
142 |
// Renderer: |
|
143 |
cache = new MarlinCache(this); |
|
144 |
renderer = new DRenderer(this); // needs MarlinCache from rdrCtx.cache |
|
145 |
ptg = new MarlinTileGenerator(stats, renderer, cache); |
|
146 |
||
147 |
stroker = new DStroker(this); |
|
148 |
dasher = new DDasher(this); |
|
149 |
} |
|
150 |
||
151 |
/** |
|
152 |
* Disposes this renderer context: |
|
153 |
* clean up before reusing this context |
|
154 |
*/ |
|
155 |
void dispose() { |
|
156 |
if (DO_STATS) { |
|
157 |
if (stats.totalOffHeap > stats.totalOffHeapMax) { |
|
158 |
stats.totalOffHeapMax = stats.totalOffHeap; |
|
159 |
} |
|
160 |
stats.totalOffHeap = 0L; |
|
161 |
} |
|
48284
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
162 |
stroking = 0; |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
163 |
doClip = false; |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
164 |
closedPath = false; |
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
165 |
|
47126 | 166 |
// if context is maked as DIRTY: |
167 |
if (dirty) { |
|
168 |
// may happen if an exception if thrown in the pipeline processing: |
|
169 |
// force cleanup of all possible pipelined blocks (except Renderer): |
|
170 |
||
171 |
// NormalizingPathIterator instances: |
|
172 |
this.nPCPathIterator.dispose(); |
|
173 |
this.nPQPathIterator.dispose(); |
|
174 |
// Dasher: |
|
175 |
this.dasher.dispose(); |
|
176 |
// Stroker: |
|
177 |
this.stroker.dispose(); |
|
178 |
||
179 |
// mark context as CLEAN: |
|
180 |
dirty = false; |
|
181 |
} |
|
182 |
} |
|
183 |
||
184 |
Path2D.Double getPath2D() { |
|
185 |
// resolve reference: |
|
48284
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
186 |
Path2D.Double p2d = (refPath2D != null) ? refPath2D.get() : null; |
47126 | 187 |
|
188 |
// create a new Path2D ? |
|
189 |
if (p2d == null) { |
|
48284
fd7fbc929001
8191814: Marlin rasterizer spends time computing geometry for stroked segments that do not intersect the clip
lbourges
parents:
47216
diff
changeset
|
190 |
p2d = new Path2D.Double(WIND_NON_ZERO, INITIAL_EDGES_COUNT); // 32K |
47126 | 191 |
|
192 |
// update weak reference: |
|
193 |
refPath2D = new WeakReference<Path2D.Double>(p2d); |
|
194 |
} |
|
195 |
// reset the path anyway: |
|
196 |
p2d.reset(); |
|
197 |
return p2d; |
|
198 |
} |
|
199 |
||
200 |
@Override |
|
201 |
public RendererStats stats() { |
|
202 |
return stats; |
|
203 |
} |
|
204 |
||
205 |
@Override |
|
206 |
public OffHeapArray newOffHeapArray(final long initialSize) { |
|
207 |
if (DO_STATS) { |
|
208 |
stats.totalOffHeapInitial += initialSize; |
|
209 |
} |
|
210 |
return new OffHeapArray(cleanerObj, initialSize); |
|
211 |
} |
|
212 |
||
213 |
@Override |
|
214 |
public IntArrayCache.Reference newCleanIntArrayRef(final int initialSize) { |
|
215 |
return cleanIntCache.createRef(initialSize); |
|
216 |
} |
|
217 |
||
218 |
IntArrayCache.Reference newDirtyIntArrayRef(final int initialSize) { |
|
219 |
return dirtyIntCache.createRef(initialSize); |
|
220 |
} |
|
221 |
||
222 |
DoubleArrayCache.Reference newDirtyDoubleArrayRef(final int initialSize) { |
|
223 |
return dirtyDoubleCache.createRef(initialSize); |
|
224 |
} |
|
225 |
||
226 |
ByteArrayCache.Reference newDirtyByteArrayRef(final int initialSize) { |
|
227 |
return dirtyByteCache.createRef(initialSize); |
|
228 |
} |
|
229 |
||
230 |
static final class PathConsumer2DAdapter implements DPathConsumer2D { |
|
231 |
private sun.awt.geom.PathConsumer2D out; |
|
232 |
||
233 |
PathConsumer2DAdapter() {} |
|
234 |
||
235 |
PathConsumer2DAdapter init(sun.awt.geom.PathConsumer2D out) { |
|
236 |
this.out = out; |
|
237 |
return this; |
|
238 |
} |
|
239 |
||
240 |
@Override |
|
241 |
public void moveTo(double x0, double y0) { |
|
242 |
out.moveTo((float)x0, (float)y0); |
|
243 |
} |
|
244 |
||
245 |
@Override |
|
246 |
public void lineTo(double x1, double y1) { |
|
247 |
out.lineTo((float)x1, (float)y1); |
|
248 |
} |
|
249 |
||
250 |
@Override |
|
251 |
public void closePath() { |
|
252 |
out.closePath(); |
|
253 |
} |
|
254 |
||
255 |
@Override |
|
256 |
public void pathDone() { |
|
257 |
out.pathDone(); |
|
258 |
} |
|
259 |
||
260 |
@Override |
|
261 |
public void curveTo(double x1, double y1, |
|
262 |
double x2, double y2, |
|
263 |
double x3, double y3) |
|
264 |
{ |
|
265 |
out.curveTo((float)x1, (float)y1, |
|
266 |
(float)x2, (float)y2, |
|
267 |
(float)x3, (float)y3); |
|
268 |
} |
|
269 |
||
270 |
@Override |
|
271 |
public void quadTo(double x1, double y1, double x2, double y2) { |
|
272 |
out.quadTo((float)x1, (float)y1, (float)x2, (float)y2); |
|
273 |
} |
|
274 |
||
275 |
@Override |
|
276 |
public long getNativeConsumer() { |
|
277 |
throw new InternalError("Not using a native peer"); |
|
278 |
} |
|
279 |
} |
|
280 |
} |