forked from scifio/scifio
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDefaultImgFactoryHeuristic.java
151 lines (129 loc) · 5.2 KB
/
DefaultImgFactoryHeuristic.java
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/*
* #%L
* SCIFIO library for reading and converting scientific file formats.
* %%
* Copyright (C) 2011 - 2016 Board of Regents of the University of
* Wisconsin-Madison
* %%
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
* #L%
*/
package io.scif.img;
import io.scif.Metadata;
import io.scif.config.SCIFIOConfig.ImgMode;
import io.scif.img.cell.SCIFIOCellImgFactory;
import io.scif.util.FormatTools;
import io.scif.util.MemoryTools;
import net.imagej.axis.Axes;
import net.imglib2.exception.IncompatibleTypeException;
import net.imglib2.img.ImgFactory;
import net.imglib2.img.array.ArrayImgFactory;
import net.imglib2.img.planar.PlanarImgFactory;
import net.imglib2.type.NativeType;
import org.scijava.util.ArrayUtils;
/**
* Default {@link ImgFactoryHeuristic} implementation. Uses the following
* heuristic to select a factory:
* <ul>
* <li>Check each ImgMode in order</li>
* <li>If ImgMode.ARRAY, select if dataset size < 2GB</li>
* <li>If ImgMode.PLANAR, select if plane size < 2GB and dataset fits memory.
* <li>
* <li>If ImgMode.CELL, return a SCIFIOCellImgFactory.</li>
* <li>If ImgMode.AUTO or none of the requested types could be selected, check
* as though the order were ARRAY -> PLANAR -> CELL.</li>
* </ul>
* <p>
* NB: ImgMode.CELL is always satisfied. Thus to avoid a particular ImgMode,
* provide a list excluding the undesired types that includes ImgMode.CELL last.
* </p>
*
* @author Mark Hiner
*/
public class DefaultImgFactoryHeuristic implements ImgFactoryHeuristic {
// -- Constants --
// % of available memory to trigger opening as a CellImg, if surpassed
private static final double MEMORY_THRESHOLD = 0.75;
// -- ImgFactoryHeuristic API Methods --
@Override
public <T extends NativeType<T>> ImgFactory<T> createFactory(
final Metadata m, final ImgMode[] imgModes, final T type)
throws IncompatibleTypeException
{
ImgFactory<T> tmpFactory = null;
// Max size of a plane of a PlanarImg, or total dataset for ArrayImg.
// 2GB.
final long maxSize = ArrayUtils.safeMultiply64(2, 1024, 1024, 1024);
final long availableMem =
(long) (MemoryTools.totalAvailableMemory() * MEMORY_THRESHOLD);
long datasetSize = m.getDatasetSize();
// check for overflow
if (datasetSize <= 0) datasetSize = Long.MAX_VALUE;
// divide by 1024 to compare to max_size and avoid overflow
final long planeSize =
m.get(0).getAxisLength(Axes.X) * m.get(0).getAxisLength(Axes.Y) *
FormatTools.getBytesPerPixel(m.get(0).getPixelType());
final boolean fitsInMemory = availableMem > datasetSize;
boolean decided = false;
int modeIndex = 0;
// loop over ImgOptions in preferred order
while (!decided) {
// get the current mode, or AUTO if we've exhausted the list of
// modes
final ImgMode mode =
modeIndex >= imgModes.length ? ImgMode.AUTO : imgModes[modeIndex++];
if (mode.equals(ImgMode.AUTO)) {
if (!fitsInMemory) tmpFactory = new SCIFIOCellImgFactory<>();
else if (datasetSize < maxSize) tmpFactory = new ArrayImgFactory<>();
else tmpFactory = new PlanarImgFactory<>();
// FIXME: no CellImgFactory right now.. isn't guaranteed to
// handle all
// images well (e.g. RGB)
// else if (planeSize < maxSize) tmpFactory = new PlanarImgFactory<T>();
// else tmpFactory = new CellImgFactory<T>();
decided = true;
}
else if (mode.equals(ImgMode.ARRAY) && datasetSize < maxSize &&
fitsInMemory)
{
tmpFactory = new ArrayImgFactory<>();
decided = true;
}
else if (mode.equals(ImgMode.PLANAR) && planeSize < maxSize &&
fitsInMemory)
{
tmpFactory = new PlanarImgFactory<>();
decided = true;
}
else if (mode.equals(ImgMode.CELL)) {
// FIXME: no CellImgFactory right now.. isn't guaranteed to
// handle all
// images well (e.g. RGB)
// if (fitsInMemory) tmpFactory = new CellImgFactory<T>();
// else tmpFactory = new SCIFIOCellImgFactory<T>();
tmpFactory = new SCIFIOCellImgFactory<>();
decided = true;
}
}
return tmpFactory.imgFactory(type);
}
}