/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/* Threading stuff */
final static boolean ENABLE_THREADING = false;
boolean threaded = false;
int rasterTileCnt;
/* Tiling */
} else {
}
threaded = ENABLE_THREADING &&
if (threaded) {
tileCache = new IdleTileCache();
}
}
private static native long
tilesX = 0;
tilesY = 0;
tileCnt = 0;
} else {
// If there is no area touched by the traps, don't
// render them.
}
}
}
private void bucketSortTraps() {
for (int n = startTileY; n <= endTileY; n++) {
for (int m = startTileX; m <= endTileX; m++) {
int trapArrayPos = n * tilesX + m;
if (trapTileList == null) {
}
}
}
}
}
if (threaded) {
}
} else {
}
nextTile();
}
public void calculateTypicalAlpha() {
rasterTileCnt = 0;
int tileAlpha = 127;
tileAlpha = 0;
tileAlpha = 0xff;
}
}
}
}
}
/*
* Optimization for large fills. Foutunatly cairo does generate an y-sorted
* list of trapezoids. This makes it quite simple to check wether a tile is
* fully covered by traps by: - Checking wether the tile is fully covered by
* traps vertically (trap 2 starts where trap 1 ended) - Checking wether all
* traps cover the tile horizontally This also works, when a single tile
* coveres the whole tile.
*/
// Don't bother optimizing tiles with lots of traps, usually it won't
// succeed anyway.
return false;
}
// Check wether first tile covers the beginning of the tile vertically
return false;
}
// Initialize lastBottom with top, in order to pass the checks for the
// first iteration
int lastBottom = firstTop;
{
return false;
}
}
// When the last trap covered the tileEnd vertically, the tile is fully
// covered
return lastBottom >= tileEndY;
}
public int getTypicalAlpha() {
return 0;
} else {
}
}
public void dispose() {
if (threaded) {
}
}
long pixmanImgPtr =
tile.getImgBuffer(),
}
return tile;
}
}
}
public void nextTile() {
currTilePos++;
}
public int getTileHeight() {
return TILE_SIZE;
}
public int getTileWidth() {
return TILE_SIZE;
}
public int getTileCount() {
return tileCnt;
}
return tiledTrapArray[index];
}
}
class TileTrapContainer {
int tileAlpha;
}
}
public int getTileAlpha() {
return tileAlpha;
}
return traps;
}
}