diff options
Diffstat (limited to 'src')
61 files changed, 0 insertions, 17571 deletions
diff --git a/src/classes/com/sun/opengl/impl/error/Error.java b/src/classes/com/sun/opengl/impl/error/Error.java deleted file mode 100644 index fd6a4e50e..000000000 --- a/src/classes/com/sun/opengl/impl/error/Error.java +++ /dev/null @@ -1,99 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.error; - -import javax.media.opengl.GL; -import javax.media.opengl.glu.GLU; - -/** - * - * @author Administrator - */ -public class Error { - - private static String[] glErrorStrings = { - "invalid enumerant", - "invalid value", - "invalid operation", - "stack overflow", - "stack underflow", - "out of memory", - "invalid framebuffer operation" - }; - - private static String[] gluErrorStrings = { - "invalid enumerant", - "invalid value", - "out of memory", - "", - "invalid operation" - }; - - /** Creates a new instance of Error */ - public Error() { - } - - public static String gluErrorString( int errorCode ) { - if( errorCode == 0 ) { - return( "no error" ); - } - if( (errorCode >= GL.GL_INVALID_ENUM) && (errorCode <= GL.GL_INVALID_FRAMEBUFFER_OPERATION) ) { - return( glErrorStrings[ errorCode - GL.GL_INVALID_ENUM ] ); - } - if( errorCode == 0x8031 /* GL.GL_TABLE_TOO_LARGE */ ) { - return( "table too large" ); - } - if( (errorCode >= GLU.GLU_INVALID_ENUM) && (errorCode <= GLU.GLU_INVALID_OPERATION) ) { - return( gluErrorStrings[ errorCode - GLU.GLU_INVALID_ENUM ] ); - } -// if( (errorCode >= GLU.GLU_NURBS_ERROR1) && (errorCode <= GLU.GLU_NURBS_ERROR37) ) { -// return( gluErrorStrings[ errorCode - (GLU.GLU_NURBS_ERROR1 - 1) ] ); -// } - if( (errorCode >= GLU.GLU_TESS_ERROR1) && (errorCode <= GLU.GLU_TESS_ERROR8) ) { - return( gluErrorStrings[ errorCode - (GLU.GLU_TESS_ERROR1 - 1) ] ); - } - return( "error ("+errorCode+")" ); - } -} diff --git a/src/classes/com/sun/opengl/impl/glue/Glue.java b/src/classes/com/sun/opengl/impl/glue/Glue.java deleted file mode 100644 index 0037fd2f3..000000000 --- a/src/classes/com/sun/opengl/impl/glue/Glue.java +++ /dev/null @@ -1,114 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.gl2.glue; - -/** - * - * @author Administrator - */ -public class Glue { - private static String[] __gluNurbsErrors = { - " ", - "spline order un-supported", - "too few knots", - "valid knot range is empty", - "decreasing knot sequence knot", - "knot multiplicity greater than order of spline", - "gluEndCurve() must follow gluBeginCurve()", - "gluBeginCurve() must precede gluEndCurve()", - "missing or extra geometric data", - "can't draw piecewise linear trimming curves", - "missing or extra domain data", - "missing or extra domain data", - "gluEndTrim() must precede gluEndSurface()", - "gluBeginSurface() must precede gluEndSurface()", - "curve of improper type passed as trim curve", - "gluBeginSurface() must precede gluBeginTrim()", - "gluEndTrim() must follow gluBeginTrim()", - "gluBeginTrim() must follow gluEndTrim()", - "invalid or missing trim curve", - "gluBeginTrim() must precede gluPwlCurve()", - "piecewise linear trimming curve referenced twice", - "piecewise linear trimming curve and nurbs curve mixed", - "improper usage of trim data type", - "nurbs curve referenced twice", - "nurbs curve and piecewise linear trimming curve mixed", - "nurbs surface referenced twice", - "invalid property", - "gluEndSurface() must follow gluBeginSurface()", - "intersecting or misoriented trim curve", - "intersecting trim curves", - "UNUSED", - "inconnected trim curves", - "unknown knot error", - "negative vertex count encountered", - "negative byte-stride encountered", - "unknown type descriptor", - "null control point reference", - "duplicate point on piecewise linear trimming curve" - } ; - - /** Creates a new instance of Glue */ - public Glue() { - } - - public static String __gluNURBSErrorString( int errno ) { - return( __gluNurbsErrors[ errno ] ); - } - - private static String[] __gluTessErrors = { - " ", - "gluTessBeginPolygon() must precede a gluTessEndPolygon", - "gluTessBeginContour() must precede a gluTessEndContour()", - "gluTessEndPolygon() must follow a gluTessBeginPolygon()", - "gluTessEndContour() must follow a gluTessBeginContour()", - "a coordinate is too large", - "need combine callback" - }; - - public static String __gluTessErrorString( int errno ) { - return( __gluTessErrors[ errno ] ); - } -} diff --git a/src/classes/com/sun/opengl/impl/macosx/awt/MacOSXJAWTWindow.java b/src/classes/com/sun/opengl/impl/macosx/awt/MacOSXJAWTWindow.java deleted file mode 100644 index 44a34b98d..000000000 --- a/src/classes/com/sun/opengl/impl/macosx/awt/MacOSXJAWTWindow.java +++ /dev/null @@ -1,151 +0,0 @@ -/* - * Copyright (c) 2003 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.macosx.awt; - -import com.sun.opengl.impl.macosx.*; -import com.sun.opengl.impl.awt.*; -import com.sun.opengl.impl.*; - -import java.awt.GraphicsDevice; -import java.awt.GraphicsEnvironment; - -import javax.media.opengl.*; -import java.security.*; - -public class MacOSXJAWTWindow extends JAWTWindow { - - public MacOSXJAWTWindow(Object comp) { - super(comp); - } - - protected void initNative() throws NativeWindowException { - } - - public int lockSurface() throws NativeWindowException { - int ret = super.lockSurface(); - if(NativeWindow.LOCK_SUCCESS != ret) { - return ret; - } - ds = JAWT.getJAWT().GetDrawingSurface(component); - if (ds == null) { - // Widget not yet realized - return NativeWindow.LOCK_SURFACE_NOT_READY; - } - int res = ds.Lock(); - if ((res & JAWTFactory.JAWT_LOCK_ERROR) != 0) { - throw new GLException("Unable to lock surface"); - } - // See whether the surface changed and if so destroy the old - // OpenGL context so it will be recreated (NOTE: removeNotify - // should handle this case, but it may be possible that race - // conditions can cause this code to be triggered -- should test - // more) - if ((res & JAWTFactory.JAWT_LOCK_SURFACE_CHANGED) != 0) { - ret = NativeWindow.LOCK_SURFACE_CHANGED; - } - if (firstLock) { - AccessController.doPrivileged(new PrivilegedAction() { - public Object run() { - dsi = ds.GetDrawingSurfaceInfo(); - return null; - } - }); - } else { - dsi = ds.GetDrawingSurfaceInfo(); - } - if (dsi == null) { - // Widget not yet realized - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - return NativeWindow.LOCK_SURFACE_NOT_READY; - } - firstLock = false; - macosxdsi = (JAWT_MacOSXDrawingSurfaceInfo) dsi.platformInfo(); - if (macosxdsi == null) { - // Widget not yet realized - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - return NativeWindow.LOCK_SURFACE_NOT_READY; - } - drawable = macosxdsi.cocoaViewRef(); - // FIXME: Are the followup abstractions available ? would it be usefull ? - display = 0; - visualID = 0; - screen= 0; - screenIndex = 0; - - if (drawable == 0) { - // Widget not yet realized - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - macosxdsi = null; - return NativeWindow.LOCK_SURFACE_NOT_READY; - } - return ret; - } - - public void unlockSurface() throws GLException { - if(!isSurfaceLocked()) return; - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - macosxdsi = null; - super.unlockSurface(); - } - - // Variables for lockSurface/unlockSurface - private JAWT_DrawingSurface ds; - private JAWT_DrawingSurfaceInfo dsi; - private JAWT_MacOSXDrawingSurfaceInfo macosxdsi; - - // Workaround for instance of 4796548 - private boolean firstLock = true; - -} - diff --git a/src/classes/com/sun/opengl/impl/mipmap/BuildMipmap.java b/src/classes/com/sun/opengl/impl/mipmap/BuildMipmap.java deleted file mode 100644 index 878eeabe7..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/BuildMipmap.java +++ /dev/null @@ -1,1595 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import javax.media.opengl.GL; -import javax.media.opengl.GL2; -import javax.media.opengl.glu.GLU; -import com.sun.opengl.impl.Debug; -import java.nio.*; -import java.io.*; - -/** - * - * @author Administrator - */ -public class BuildMipmap { - - private static final boolean DEBUG = Debug.debug("BuildMipmap"); - private static final boolean VERBOSE = Debug.verbose(); - - /** Creates a new instance of BuildMipmap */ - public BuildMipmap() { - } - - public static int gluBuild1DMipmapLevelsCore( GL gl, int target, int internalFormat, - int width, int widthPowerOf2, int format, int type, int userLevel, - int baseLevel, int maxLevel, ByteBuffer data ) { - int newwidth; - int level, levels; - ShortBuffer newImage = null; - int newImage_width; - ShortBuffer otherImage = null; - ShortBuffer imageTemp = null; - int memreq; - int maxsize; - int cmpts; - PixelStorageModes psm = new PixelStorageModes(); - - assert( Mipmap.checkMipmapArgs( internalFormat, format, type ) == 0 ); - assert( width >= 1 ); - - newwidth = widthPowerOf2; - levels = Mipmap.computeLog( newwidth ); - - levels += userLevel; - - Mipmap.retrieveStoreModes( gl, psm ); - try { - newImage = ByteBuffer.allocateDirect( Mipmap.image_size( width, 1, format, - GL2.GL_UNSIGNED_SHORT ) ).order( ByteOrder.nativeOrder() ).asShortBuffer(); - } catch( OutOfMemoryError ome ) { - return( GLU.GLU_OUT_OF_MEMORY ); - } - newImage_width = width; - - Image.fill_image( psm, width, 1, format, type, Mipmap.is_index( format ), data, newImage ); - cmpts = Mipmap.elements_per_group( format, type ); - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, 2 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, 0 ); - - // if swap_bytes was set, swapping occurred in fill_image - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, GL2.GL_FALSE ); - - for( level = userLevel; level <= levels; level++ ) { - if( newImage_width == newwidth ) { - // user newimage for this level - if( baseLevel <= level && level <= maxLevel ) { - gl.getGL2().glTexImage1D( target, level, internalFormat, newImage_width, 0, format, - GL2.GL_UNSIGNED_SHORT, newImage ); - } - } else { - if( otherImage == null ) { - memreq = Mipmap.image_size( newwidth, 1, format, GL2.GL_UNSIGNED_SHORT ); - try { - otherImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ).asShortBuffer(); - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - } - ScaleInternal.scale_internal( cmpts, newImage_width, 1, newImage, newwidth, 1, otherImage ); - // swap newImage and otherImage - imageTemp = otherImage; - otherImage = newImage; - newImage = imageTemp; - - newImage_width = newwidth; - if( baseLevel <= level && level <= maxLevel ) { - gl.getGL2().glTexImage1D( target, level, internalFormat, newImage_width, 0, - format, GL2.GL_UNSIGNED_SHORT, newImage ); - } - } - if( newwidth > 1 ) { - newwidth /= 2; - } - } - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - - return( 0 ); - } - - public static int bitmapBuild2DMipmaps( GL gl, int target, int internalFormat, - int width, int height, int format, int type, ByteBuffer data ) { - int newwidth[] = new int[1]; - int newheight[] = new int[1]; - int level, levels; - ShortBuffer newImage = null; - int newImage_width; - int newImage_height; - ShortBuffer otherImage = null; - ShortBuffer tempImage = null; - int memreq; - int maxsize; - int cmpts; - PixelStorageModes psm = new PixelStorageModes(); - - Mipmap.retrieveStoreModes( gl, psm ); - - Mipmap.closestFit( gl, target, width, height, internalFormat, format, type, newwidth, newheight ); - - levels = Mipmap.computeLog( newwidth[0] ); - level = Mipmap.computeLog( newheight[0] ); - if( level > levels ) { - levels = level; - } - - try { - newImage = ByteBuffer.allocateDirect( Mipmap.image_size( width, height, - format, GL2.GL_UNSIGNED_SHORT ) ).order( ByteOrder.nativeOrder() ).asShortBuffer(); - } catch( OutOfMemoryError ome ) { - return( GLU.GLU_OUT_OF_MEMORY ); - } - newImage_width = width; - newImage_height = height; - - Image.fill_image( psm, width, height, format, type, Mipmap.is_index( format ), data, newImage ); - - cmpts = Mipmap.elements_per_group( format, type ); - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, 2 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, 0 ); - - // if swap_bytes is set, swapping occurred in fill_image - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, GL2.GL_FALSE ); - - for( level = 0; level < levels; level++ ) { - if( newImage_width == newwidth[0] && newImage_height == newheight[0] ) { - newImage.rewind(); - gl.glTexImage2D( target, level, internalFormat, newImage_width, - newImage_height, 0, format, GL2.GL_UNSIGNED_SHORT, newImage ); - } else { - if( otherImage == null ) { - memreq = Mipmap.image_size( newwidth[0], newheight[0], format, GL2.GL_UNSIGNED_SHORT ); - try { - otherImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ).asShortBuffer(); - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - } - ScaleInternal.scale_internal( cmpts, newImage_width, newImage_height, - newImage, newwidth[0], newheight[0], otherImage ); - // swap newImage and otherImage - tempImage = otherImage; - otherImage = newImage; - newImage = tempImage; - - newImage_width = newwidth[0]; - newImage_height = newheight[0]; - newImage.rewind(); - gl.glTexImage2D( target, level, internalFormat, newImage_width, newImage_height, - 0, format, GL2.GL_UNSIGNED_SHORT, newImage ); - } - if( newheight[0] > 1 ) { - newwidth[0] /= 2; - } - if( newheight[0] > 1 ) { - newheight[0] /= 2; - } - } - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - - return( 0 ); - } - - public static int gluBuild2DMipmapLevelsCore( GL gl, int target, int internalFormat, - int width, int height, int widthPowerOf2, int heightPowerOf2, - int format, int type, int userLevel, int baseLevel, int maxLevel, - ByteBuffer data ) { // PointerWrapper data - int newwidth; - int newheight; - int level, levels; - int usersImage; - ByteBuffer srcImage = null; - ByteBuffer dstImage = null; - ByteBuffer tempImage = null; - int newImage_width; - int newImage_height; - short[] SWAP_IMAGE = null; - int memreq; - int maxsize; - int cmpts; - - boolean myswap_bytes; - int groups_per_line, element_size, group_size; - int rowsize, padding; - PixelStorageModes psm = new PixelStorageModes(); - - assert( Mipmap.checkMipmapArgs( internalFormat, format, type ) == 0 ); - assert( width >= 1 && height >= 1 ); - - if( type == GL2.GL_BITMAP ) { - return( bitmapBuild2DMipmaps( gl, target, internalFormat, width, height, format, type, data ) ); - } - - newwidth = widthPowerOf2; - newheight = heightPowerOf2; - levels = Mipmap.computeLog( newwidth ); - level = Mipmap.computeLog( newheight ); - if( level > levels ) { - levels = level; - } - - levels += userLevel; - - Mipmap.retrieveStoreModes( gl, psm ); - myswap_bytes = psm.getUnpackSwapBytes(); - cmpts = Mipmap.elements_per_group( format, type ); - if( psm.getUnpackRowLength() > 0 ) { - groups_per_line = psm.getUnpackRowLength(); - } else { - groups_per_line = width; - } - - element_size = Mipmap.bytes_per_element( type ); - group_size = element_size * cmpts; - if( element_size == 1 ) { - myswap_bytes = false; - } - - rowsize = groups_per_line * group_size; - padding = ( rowsize % psm.getUnpackAlignment() ); - if( padding != 0 ) { - rowsize += psm.getUnpackAlignment() - padding; - } - - data.position( psm.getUnpackSkipRows() * rowsize + psm.getUnpackSkipPixels() * group_size ); - data.mark(); - - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, 0 ); - - level = userLevel; - - // already power of two square - if( width == newwidth && height == newheight ) { - // use usersImage for level userLevel - if( baseLevel <= level && level <= maxLevel ) { - data.rewind(); - gl.glTexImage2D( target, level, internalFormat, width, height, 0, format, type, data ); - } - if( levels == 0 ) { /* we're done. clean up and return */ - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( 0 ); - } - int nextWidth = newwidth / 2; - int nextHeight = newheight / 2; - - // clamp to 1 - if( nextWidth < 1 ) { - nextWidth = 1; - } - if( nextHeight < 1 ) { - nextHeight = 1; - } - memreq = Mipmap.image_size( nextWidth, nextHeight, format, type ); - - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - if( dstImage != null ) { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - HalveImage.halveImage_ubyte( cmpts, width, height, data, dstImage, element_size, rowsize, group_size ); - break; - case( GL2.GL_BYTE ): - HalveImage.halveImage_byte( cmpts, width, height, data, dstImage, element_size, rowsize, group_size ); - break; - case( GL2.GL_UNSIGNED_SHORT ): - HalveImage.halveImage_ushort( cmpts, width, height, data, dstImage.asShortBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_SHORT ): - HalveImage.halveImage_short( cmpts, width, height, data, dstImage.asShortBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT ): - HalveImage.halveImage_uint( cmpts, width, height, data, dstImage.asIntBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_INT ): - HalveImage.halveImage_int( cmpts, width, height, data, dstImage.asIntBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_FLOAT ): - HalveImage.halveImage_float( cmpts, width, height, data, dstImage.asFloatBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - assert( format == GL2.GL_RGB ); - HalveImage.halveImagePackedPixel( 3, new Extract332(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - assert( format == GL2.GL_RGB ); - HalveImage.halveImagePackedPixel( 3, new Extract233rev(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - HalveImage.halveImagePackedPixel( 3, new Extract565(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - HalveImage.halveImagePackedPixel( 3, new Extract565rev(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - HalveImage.halveImagePackedPixel( 4, new Extract4444(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract4444rev(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - HalveImage.halveImagePackedPixel( 4, new Extract5551(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract1555rev(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - HalveImage.halveImagePackedPixel( 4, new Extract8888(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract8888rev(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - HalveImage.halveImagePackedPixel( 4, new Extract1010102(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract2101010rev(), width, height, data, dstImage, element_size, rowsize, myswap_bytes ); - break; - default: - assert( false ); - break; - } - } - newwidth = width / 2; - newheight = height / 2; - // clamp to 1 - if( newwidth < 1 ) { - newwidth = 1; - } - if( newheight < 1 ) { - newheight = 1; - } - - myswap_bytes = false; - rowsize = newwidth * group_size; - memreq = Mipmap.image_size( newwidth, newheight, format, type ); - // swap srcImage and dstImage - tempImage = srcImage; - srcImage = dstImage; - dstImage = tempImage; - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - // level userLevel+1 is in srcImage; level userLevel already saved - level = userLevel + 1; - } else { // user's image is not nice powerof2 size square - memreq = Mipmap.image_size( newwidth, newheight, format, type ); - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - data.reset(); - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - ScaleInternal.scale_internal_ubyte( cmpts, width, height, data, - newwidth, newheight, dstImage, element_size, rowsize, group_size ); - break; - case( GL2.GL_BYTE ): - ScaleInternal.scale_internal_byte( cmpts, width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, group_size ); - break; - case( GL2.GL_UNSIGNED_SHORT ): - ScaleInternal.scale_internal_ushort( cmpts, width, height, data, newwidth, - newheight, dstImage.asShortBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_SHORT ): - ScaleInternal.scale_internal_ushort( cmpts, width, height, data, newwidth, - newheight, dstImage.asShortBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT ): - ScaleInternal.scale_internal_uint( cmpts, width, height, data, newwidth, - newheight, dstImage.asIntBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_INT ): - ScaleInternal.scale_internal_int( cmpts, width, height, data, newwidth, - newheight, dstImage.asIntBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_FLOAT ): - ScaleInternal.scale_internal_float( cmpts, width, height, data, newwidth, - newheight, dstImage.asFloatBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - ScaleInternal.scaleInternalPackedPixel( 3, new Extract332(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - ScaleInternal.scaleInternalPackedPixel( 3, new Extract233rev(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - ScaleInternal.scaleInternalPackedPixel( 3, new Extract565(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - ScaleInternal.scaleInternalPackedPixel( 3, new Extract565rev(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract4444(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract4444rev(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract5551(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract1555rev(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract8888(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract8888rev(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract1010102(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - ScaleInternal.scaleInternalPackedPixel( 4, new Extract2101010rev(), width, height, data, newwidth, - newheight, dstImage, element_size, rowsize, myswap_bytes ); - break; - default: - assert( false ); - break; - } - myswap_bytes = false; - rowsize = newwidth * group_size; - // swap dstImage and srcImage - tempImage = srcImage; - srcImage = dstImage; - dstImage = tempImage; - - if( levels != 0 ) { // use as little memory as possible - int nextWidth = newwidth / 2; - int nextHeight = newheight / 2; - if( nextWidth < 1 ) { - nextWidth = 1; - } - if( nextHeight < 1 ) { - nextHeight = 1; - } - - memreq = Mipmap.image_size( nextWidth, nextHeight, format, type ); - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - } - // level userLevel is in srcImage; nothing saved yet - level = userLevel; - } - - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, GL2.GL_FALSE ); - if( baseLevel <= level && level <= maxLevel ) { - srcImage.rewind(); - gl.glTexImage2D( target, level, internalFormat, newwidth, newheight, 0, format, type, srcImage ); - if (DEBUG) { - System.err.println("GL Error(" + level + "): " + gl.glGetError() ); - if (VERBOSE) { - srcImage.limit( Mipmap.image_size( newwidth, newheight, format, type ) ); - writeTargaFile("glu2DMipmapJ" + level + ".tga", - srcImage, newwidth, newheight); - srcImage.clear(); - } - } - } - - level++; // update current level for the loop - for( ; level <= levels; level++ ) { - srcImage.rewind(); - dstImage.rewind(); - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - HalveImage.halveImage_ubyte( cmpts, newwidth, newheight, srcImage, dstImage, element_size, rowsize, group_size ); - break; - case( GL2.GL_BYTE ): - HalveImage.halveImage_byte( cmpts, newwidth, newheight, srcImage, dstImage, element_size, rowsize, group_size ); - break; - case( GL2.GL_UNSIGNED_SHORT ): - HalveImage.halveImage_ushort( cmpts, newwidth, newheight, srcImage, dstImage.asShortBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_SHORT ): - HalveImage.halveImage_short( cmpts, newwidth, newheight, srcImage, dstImage.asShortBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT ): - HalveImage.halveImage_uint( cmpts, newwidth, newheight, srcImage, dstImage.asIntBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_INT ): - HalveImage.halveImage_int( cmpts, newwidth, newheight, srcImage, dstImage.asIntBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_FLOAT ): - HalveImage.halveImage_float( cmpts, newwidth, newheight, srcImage, dstImage.asFloatBuffer(), element_size, rowsize, group_size, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - assert( format == GL2.GL_RGB ); - HalveImage.halveImagePackedPixel( 3, new Extract332(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - assert( format == GL2.GL_RGB ); - HalveImage.halveImagePackedPixel( 3, new Extract233rev(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - HalveImage.halveImagePackedPixel( 3, new Extract565(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - HalveImage.halveImagePackedPixel( 3, new Extract565rev(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - HalveImage.halveImagePackedPixel( 4, new Extract4444(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract4444rev(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - HalveImage.halveImagePackedPixel( 4, new Extract5551(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract1555rev(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - HalveImage.halveImagePackedPixel( 4, new Extract8888(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract8888rev(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - HalveImage.halveImagePackedPixel( 4, new Extract1010102(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - HalveImage.halveImagePackedPixel( 4, new Extract2101010rev(), newwidth, newheight, srcImage, dstImage, element_size, rowsize, myswap_bytes ); - break; - default: - assert( false ); - break; - } - - // swap dstImage and srcImage - tempImage = srcImage; - srcImage = dstImage; - dstImage = tempImage; - - if( newwidth > 1 ) { - newwidth /= 2; - rowsize /= 2; - } - if( newheight > 1 ) { - newheight /= 2; - } - // compute amount to pad per row if any - int rowPad = rowsize % psm.getUnpackAlignment(); - - // should row be padded - if( rowPad == 0 ) { - // call teximage with srcImage untouched since its not padded - if( baseLevel <= level && level <= maxLevel ) { - srcImage.rewind(); - gl.glTexImage2D( target, level, internalFormat, newwidth, newheight, 0, format, type, srcImage ); - if (DEBUG) { - System.err.println("GL Error(" + level + "): " + gl.glGetError() ); - if (VERBOSE) { - srcImage.limit( Mipmap.image_size( newwidth, newheight, format, type ) ); - writeTargaFile("glu2DMipmapJ" + level + ".tga", - srcImage, newwidth, newheight); - srcImage.clear(); - } - } - } - } else { - // compute length of new row in bytes, including padding - int newRowLength = rowsize + psm.getUnpackAlignment() - rowPad; - int ii, jj; - int dstTrav; - int srcTrav; - - // allocate new image for mipmap of size newRowLength x newheight - ByteBuffer newMipmapImage = null; - try { - newMipmapImage = ByteBuffer.allocateDirect( newRowLength * newheight ); - } catch( OutOfMemoryError ome ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - srcImage.rewind(); - // copy image from srcImage into newMipmapImage by rows - for( ii = 0; ii < newheight; ii++ ) { - newMipmapImage.position(newRowLength * ii); - for( jj = 0; jj < rowsize; jj++ ) { - newMipmapImage.put( srcImage.get() ); - } - } - - // and use this new image for mipmapping instead - if( baseLevel <= level && level <= maxLevel ) { - newMipmapImage.rewind(); - gl.glTexImage2D( target, level, internalFormat, newwidth, newheight, 0, format, type, newMipmapImage ); - if (DEBUG) { - System.err.println("GL Error(" + level + " padded): " + gl.glGetError() ); - if (VERBOSE) { - writeTargaFile("glu2DMipmapJ" + level + ".tga", - newMipmapImage, newwidth, newheight); - } - } - } - } - } - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, (psm.getUnpackSwapBytes() ? 1 : 0) ); - - return( 0 ); - } - - public static int fastBuild2DMipmaps( GL gl, PixelStorageModes psm, int target, - int components, int width, int height, int format, int type, ByteBuffer data ) { - int[] newwidth = new int[1]; - int[] newheight = new int[1]; - int level, levels; - ByteBuffer newImage; - int newImage_width; - int newImage_height; - ByteBuffer otherImage; - ByteBuffer imageTemp; - int memreq; - int maxsize; - int cmpts; - - Mipmap.closestFit( gl, target, width, height, components, format, type, newwidth, - newheight ); - - levels = Mipmap.computeLog( newwidth[0] ); - level = Mipmap.computeLog( newheight[0] ); - if( level > levels ) { - levels = level; - } - - cmpts = Mipmap.elements_per_group( format, type ); - - otherImage = null; - // No need to copy the user data if its packed correctly. - // Make sure that later routines don't change that data. - - if( psm.getUnpackSkipRows() == 0 && psm.getUnpackSkipPixels() == 0 ) { - newImage = data; - newImage_width = width; - newImage_height = height; - } else { - int rowsize; - int group_per_line; - int elements_per_line; - int start; - int iter; - int iter2; - int i, j; - - try { - newImage = ByteBuffer.allocateDirect( Mipmap.image_size( - width, height, format, GL2.GL_UNSIGNED_BYTE ) ).order( ByteOrder.nativeOrder() ); - } catch( OutOfMemoryError err ) { - return( GLU.GLU_OUT_OF_MEMORY ); - } - newImage_width = width; - newImage_height = height; - - // Abbreviated version of fill_image for the restricted case. - if( psm.getUnpackRowLength() > 0 ) { - group_per_line = psm.getUnpackRowLength(); - } else { - group_per_line = width; - } - rowsize = group_per_line * cmpts; - elements_per_line = width * cmpts; - start = psm.getUnpackSkipRows() * rowsize + psm.getUnpackSkipPixels() * cmpts; - - for( i = 0; i < height; i++ ) { - iter = start; - data.position( iter ); - for( j = 0; j < elements_per_line; j++ ) { - newImage.put( data.get() ); - } - start += rowsize; - } - } - - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, 1 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, GL2.GL_FALSE ); - - for( level = 0; level <= levels; level++ ) { - if( newImage_width == newwidth[0] && newImage_height == newheight[0] ) { - // use newImage for this level - newImage.rewind(); - gl.glTexImage2D( target, level, components, newImage_width, newImage_height, - 0, format, GL2.GL_UNSIGNED_BYTE, newImage ); - } else { - if( otherImage == null ) { - memreq = Mipmap.image_size( newwidth[0], newheight[0], format, GL2.GL_UNSIGNED_BYTE ); - try { - otherImage = ByteBuffer.allocateDirect( memreq ).order( ByteOrder.nativeOrder() ); - } catch( OutOfMemoryError err ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, ( psm.getUnpackSwapBytes() ? 1 : 0 ) ) ; - return( GLU.GLU_OUT_OF_MEMORY ); - } - } - // swap newImage and otherImage - imageTemp = otherImage; - otherImage = newImage; - newImage = imageTemp; - - newImage_width = newwidth[0]; - newImage_height = newheight[0]; - newImage.rewind(); - gl.glTexImage2D( target, level, components, newImage_width, newImage_height, - 0, format, GL2.GL_UNSIGNED_BYTE, newImage ); - } - if( newwidth[0] > 1 ) { - newwidth[0] /= 2; - } - if( newheight[0] > 1 ) { - newheight[0] /= 2; - } - } - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, ( psm.getUnpackSwapBytes() ? 1 : 0 ) ) ; - - return( 0 ); - } - - public static int gluBuild3DMipmapLevelsCore( GL gl, int target, int internalFormat, - int width, int height, int depth, int widthPowerOf2, int heightPowerOf2, - int depthPowerOf2, int format, int type, int userLevel, int baseLevel, - int maxLevel, ByteBuffer data ) { - int newWidth; - int newHeight; - int newDepth; - int level, levels; - ByteBuffer usersImage; - ByteBuffer srcImage, dstImage, tempImage; - int newImageWidth; - int newImageHeight; - int newImageDepth; - int memReq; - int maxSize; - int cmpts; - - boolean myswapBytes; - int groupsPerLine, elementSize, groupSize; - int rowsPerImage, imageSize; - int rowSize, padding; - PixelStorageModes psm = new PixelStorageModes(); - - assert( Mipmap.checkMipmapArgs( internalFormat, format, type ) == 0 ); - assert( width >= 1 && height >= 1 && depth >= 1 ); - assert( type != GL2.GL_BITMAP ); - - srcImage = dstImage = null; - - newWidth = widthPowerOf2; - newHeight = heightPowerOf2; - newDepth = depthPowerOf2; - levels = Mipmap.computeLog( newWidth ); - level = Mipmap.computeLog( newHeight ); - if( level > levels ) { - levels = level; - } - level = Mipmap.computeLog( newDepth ); - if( level > levels ) { - levels = level; - } - - levels += userLevel; - - Mipmap.retrieveStoreModes3D( gl, psm ); - myswapBytes = psm.getUnpackSwapBytes(); - cmpts = Mipmap.elements_per_group( format, type ); - if( psm.getUnpackRowLength() > 0 ) { - groupsPerLine = psm.getUnpackRowLength(); - } else { - groupsPerLine = width; - } - - elementSize = Mipmap.bytes_per_element( type ); - groupSize = elementSize * cmpts; - if( elementSize == 1 ) { - myswapBytes = false; - } - - // 3dstuff - if( psm.getUnpackImageHeight() > 0 ) { - rowsPerImage = psm.getUnpackImageHeight(); - } else { - rowsPerImage = height; - } - - rowSize = groupsPerLine * groupSize; - padding = ( rowSize % psm.getUnpackAlignment() ); - if( padding != 0 ) { - rowSize += psm.getUnpackAlignment() - padding; - } - - imageSize = rowsPerImage * rowSize; - - usersImage = data.duplicate(); - usersImage.position( psm.getUnpackSkipRows() * rowSize + - psm.getUnpackSkipPixels() * groupSize + - psm.getUnpackSkipImages() * imageSize ); - usersImage.mark(); - - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, 0 ); - - level = userLevel; - - if( width == newWidth && height == newHeight && depth == newDepth ) { - // use usersImage for level userlevel - if( baseLevel <= level && level <= maxLevel ) { - gl.getGL2().glTexImage3D( target, level, internalFormat, width, height, depth, - 0, format, type, usersImage ); - } - if( levels == 0 ) { /* we're done. clean up and return */ - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, psm.getUnpackSwapBytes() ? 1 : 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, psm.getUnpackSkipImages() ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, psm.getUnpackImageHeight() ); - return( 0 ); - } - int nextWidth = newWidth / 2; - int nextHeight = newHeight / 2; - int nextDepth = newDepth / 2; - - // clamp to one - if( nextWidth < 1 ) { - nextWidth = 1; - } - if( nextHeight < 1 ) { - nextHeight = 1; - } - if( nextDepth < 1 ) { - nextDepth = 1; - } - memReq = Mipmap.imageSize3D( nextWidth, nextHeight, nextDepth, format, type ); - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memReq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError err ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, psm.getUnpackSwapBytes() ? 1 : 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, psm.getUnpackSkipImages() ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, psm.getUnpackImageHeight() ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - - if( dstImage != null ) { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractUByte(), width, height, depth, - usersImage, dstImage, elementSize, - groupSize, rowSize, imageSize, myswapBytes ); - } else { - HalveImage.halveImage_ubyte( cmpts, width, height, usersImage, - dstImage, elementSize, rowSize, groupSize ); - } - break; - case( GL2.GL_BYTE ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractSByte(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_byte( cmpts, width, height, usersImage, - dstImage, elementSize, rowSize, groupSize ); - } - break; - case( GL2.GL_UNSIGNED_SHORT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractUShort(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_ushort( cmpts, width, height, usersImage, - dstImage.asShortBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_SHORT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractSShort(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_short( cmpts, width, height, usersImage, - dstImage.asShortBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_UNSIGNED_INT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractUInt(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_uint( cmpts, width, height, usersImage, - dstImage.asIntBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_INT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractSInt(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_int( cmpts, width, height, usersImage, - dstImage.asIntBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_FLOAT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractFloat(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_float( cmpts, width, height, usersImage, - dstImage.asFloatBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - assert( format == GL2.GL_RGB ); - HalveImage.halveImagePackedPixel3D( 3, new Extract332(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - assert( format == GL2.GL_RGB ); - HalveImage.halveImagePackedPixel3D( 3, new Extract233rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - HalveImage.halveImagePackedPixel3D( 3, new Extract565(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - HalveImage.halveImagePackedPixel3D( 3, new Extract565rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract4444(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract4444rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract5551(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract1555rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract8888(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract8888rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract1010102(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract2101010rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - default: - assert( false ); - break; - } - } - newWidth = width / 2; - newHeight = height / 2; - newDepth = depth / 2; - // clamp to 1 - if( newWidth < 1 ) { - newWidth = 1; - } - if( newHeight < 1 ) { - newHeight = 1; - } - if( newDepth < 1 ) { - newDepth = 1; - } - - myswapBytes = false; - rowSize = newWidth * groupSize; - imageSize = rowSize * newHeight; - memReq = Mipmap.imageSize3D( newWidth, newHeight, newDepth, format, type ); - // swap srcImage and dstImage - tempImage = srcImage; - srcImage = dstImage; - dstImage = tempImage; - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memReq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError err ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, psm.getUnpackSwapBytes() ? 1 : 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, psm.getUnpackSkipImages() ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, psm.getUnpackImageHeight() ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - - // level userLevel + 1 is in srcImage; level userLevel already saved - level = userLevel + 1; - } else { - memReq = Mipmap.imageSize3D( newWidth, newHeight, newDepth, format, type ); - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memReq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError err ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, psm.getUnpackSwapBytes() ? 1 : 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, psm.getUnpackSkipImages() ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, psm.getUnpackImageHeight() ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - - ScaleInternal.gluScaleImage3D( gl, format, width, height, depth, type, - usersImage, newWidth, newHeight, newDepth, type, dstImage ); - - myswapBytes = false; - rowSize = newWidth * groupSize; - imageSize = rowSize * newHeight; - // swap dstImage and srcImage - tempImage = srcImage; - srcImage = dstImage; - dstImage = tempImage; - - if( levels != 0 ) { - int nextWidth = newWidth / 2; - int nextHeight = newHeight / 2; - int nextDepth = newDepth / 2; - if( nextWidth < 1 ) { - nextWidth = 1; - } - if( nextHeight < 1 ) { - nextHeight = 1; - } - if( nextDepth < 1 ) { - nextDepth = 1; - } - memReq = Mipmap.imageSize3D( nextWidth, nextHeight, nextDepth, format, type ); - try { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - dstImage = ByteBuffer.allocateDirect( memReq ).order( ByteOrder.nativeOrder() ); - break; - default: - return( GLU.GLU_INVALID_ENUM ); - } - } catch( OutOfMemoryError err ) { - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, psm.getUnpackSwapBytes() ? 1 : 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, psm.getUnpackSkipImages() ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, psm.getUnpackImageHeight() ); - return( GLU.GLU_OUT_OF_MEMORY ); - } - } - // level userLevel is in srcImage; nothing saved yet - level = userLevel; - } - - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, GL2.GL_FALSE ); - if( baseLevel <= level && level <= maxLevel ) { - usersImage.reset(); - gl.getGL2().glTexImage3D( target, level, internalFormat, width, height, depth, - 0, format, type, usersImage ); - } - level++; - for( ; level <= levels; level++ ) { - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractUByte(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_ubyte( cmpts, width, height, usersImage, - dstImage, elementSize, rowSize, groupSize ); - } - break; - case( GL2.GL_BYTE ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractSByte(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_byte( cmpts, width, height, usersImage, - dstImage, elementSize, rowSize, groupSize ); - } - break; - case( GL2.GL_UNSIGNED_SHORT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractUShort(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_ushort( cmpts, width, height, usersImage, - dstImage.asShortBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_SHORT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractSShort(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_short( cmpts, width, height, usersImage, - dstImage.asShortBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_UNSIGNED_INT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractUInt(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_uint( cmpts, width, height, usersImage, - dstImage.asIntBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_INT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractSInt(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_int( cmpts, width, height, usersImage, - dstImage.asIntBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_FLOAT ): - if( depth > 1 ) { - HalveImage.halveImage3D( cmpts, new ExtractFloat(), width, height, depth, - usersImage, dstImage, elementSize, groupSize, rowSize, - imageSize, myswapBytes ); - } else { - HalveImage.halveImage_float( cmpts, width, height, usersImage, - dstImage.asFloatBuffer(), elementSize, rowSize, groupSize, myswapBytes ); - } - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - HalveImage.halveImagePackedPixel3D( 3, new Extract332(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - HalveImage.halveImagePackedPixel3D( 3, new Extract233rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - HalveImage.halveImagePackedPixel3D( 3, new Extract565(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - HalveImage.halveImagePackedPixel3D( 3, new Extract565rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract4444(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract4444rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract5551(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract1555rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract8888(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract8888rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - HalveImage.halveImagePackedPixel3D( 4, new Extract1010102(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - HalveImage.halveImagePackedPixel3D( 4, new Extract2101010rev(), width, height, depth, usersImage, - dstImage, elementSize, rowSize, imageSize, myswapBytes ); - break; - default: - assert( false ); - break; - } - - tempImage = srcImage; - srcImage = dstImage; - dstImage = tempImage; - - if( newWidth > 1 ) { - newWidth /= 2; - rowSize /= 2; - } - if( newHeight > 1 ) { - newHeight /= 2; - imageSize = rowSize * newHeight; - } - if( newDepth > 1 ) { - newDepth /= 2; - } - if( baseLevel <= level && level <= maxLevel ) { - usersImage.reset(); - gl.getGL2().glTexImage3D( target, level, internalFormat, width, height, depth, - 0, format, type, usersImage ); - } - } - gl.glPixelStorei( GL2.GL_UNPACK_ALIGNMENT, psm.getUnpackAlignment() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_ROWS, psm.getUnpackSkipRows() ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_PIXELS, psm.getUnpackSkipPixels() ); - gl.glPixelStorei( GL2.GL_UNPACK_ROW_LENGTH, psm.getUnpackRowLength() ); - gl.glPixelStorei( GL2.GL_UNPACK_SWAP_BYTES, psm.getUnpackSwapBytes() ? 1 : 0 ); - gl.glPixelStorei( GL2.GL_UNPACK_SKIP_IMAGES, psm.getUnpackSkipImages() ); - gl.glPixelStorei( GL2.GL_UNPACK_IMAGE_HEIGHT, psm.getUnpackImageHeight() ); - return( 0 ); - } - - private static final int TARGA_HEADER_SIZE = 18; - private static void writeTargaFile(String filename, ByteBuffer data, - int width, int height) { - try { - FileOutputStream fos = new FileOutputStream(new File(filename)); - ByteBuffer header = ByteBuffer.allocate(TARGA_HEADER_SIZE); - header.put(0, (byte) 0).put(1, (byte) 0); - header.put(2, (byte) 2); // uncompressed type - header.put(12, (byte) (width & 0xFF)); // width - header.put(13, (byte) (width >> 8)); // width - header.put(14, (byte) (height & 0xFF)); // height - header.put(15, (byte) (height >> 8)); // height - header.put(16, (byte) 24); // pixel size - fos.getChannel().write(header); - fos.getChannel().write(data); - data.clear(); - fos.close(); - } catch (IOException e) { - e.printStackTrace(); - } - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract.java b/src/classes/com/sun/opengl/impl/mipmap/Extract.java deleted file mode 100644 index d5224af74..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract.java +++ /dev/null @@ -1,56 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public interface Extract { - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ); - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ); -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract1010102.java b/src/classes/com/sun/opengl/impl/mipmap/Extract1010102.java deleted file mode 100644 index fc29b299b..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract1010102.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class Extract1010102 implements Extract { - - /** Creates a new instance of Extract1010102 */ - public Extract1010102() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - long uint = 0; - - if( isSwap ) { - uint = 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( packedPixel.getInt() ); - } else { - uint = 0x00000000FFFFFFFF & packedPixel.getInt(); - } - - // 11111111,11000000,00000000,00000000 == 0xFFC00000 - // 00000000,00111111,11110000,00000000 == 0x003F0000 - // 00000000,00000000,00001111,11111100 == 0x00000FFC - // 00000000,00000000,00000000,00000011 == 0x00000003 - - extractComponents[0] = (float)( ( uint & 0xFFC00000 ) >> 22 ) / 1023.0f; - extractComponents[1] = (float)( ( uint & 0x003FF000 ) >> 12 ) / 1023.0f; - extractComponents[2] = (float)( ( uint & 0x00000FFC ) >> 2 ) / 1023.0f; - extractComponents[3] = (float)( ( uint & 0x00000003 ) ) / 3.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - long uint = (((int)((shoveComponents[0] * 1023) + 0.5f) << 22) & 0xFFC00000 ); - uint |= (((int)((shoveComponents[1] * 1023) + 0.5f) << 12) & 0x003FF000 ); - uint |= (((int)((shoveComponents[2] * 1023) + 0.5f) << 2) & 0x00000FFC ); - uint |= (((int)((shoveComponents[3] * 3) + 0.5f) ) & 0x00000003 ); - packedPixel.asIntBuffer().put( index, (int)uint ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract1555rev.java b/src/classes/com/sun/opengl/impl/mipmap/Extract1555rev.java deleted file mode 100644 index e1c59041a..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract1555rev.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class Extract1555rev implements Extract { - - /** Creates a new instance of Extract1555rev */ - public Extract1555rev() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - int ushort = 0; - - if( isSwap ) { - ushort = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( packedPixel.getShort() ); - } else { - ushort = 0x0000FFFF & packedPixel.getShort(); - } - - // 00000000,00011111 == 0x001F - // 00000011,11100000 == 0x03E0 - // 01111100,00000000 == 0x7C00 - // 10000000,00000000 == 0x8000 - - extractComponents[0] = (float)( ( ushort & 0x001F ) ) / 31.0f; - extractComponents[1] = (float)( ( ushort & 0x003E ) >> 5 ) / 31.0f; - extractComponents[2] = (float)( ( ushort & 0x7C00 ) >> 10) / 31.0f; - extractComponents[3] = (float)( ( ushort & 0x8000 ) >> 15); - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 00000000,00011111 == 0x001F - // 00000011,11100000 == 0x03E0 - // 01111100,00000000 == 0x7C00 - // 10000000,00000000 == 0x8000 - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - int ushort = (((int)((shoveComponents[0] * 31) + 0.5f) ) & 0x0000001F ); - ushort |= (((int)((shoveComponents[1] * 31) + 0.5f) << 5) & 0x000003E0 ); - ushort |= (((int)((shoveComponents[2] * 31) + 0.5f) << 10) & 0x00007C00 ); - ushort |= (((int)((shoveComponents[3]) + 0.5f) << 15) & 0x00008000 ); - packedPixel.asShortBuffer().put( index, (short)ushort ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract2101010rev.java b/src/classes/com/sun/opengl/impl/mipmap/Extract2101010rev.java deleted file mode 100644 index e04d948d8..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract2101010rev.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class Extract2101010rev implements Extract { - - /** Creates a new instance of Extract2101010 */ - public Extract2101010rev() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - long uint = 0; - - if( isSwap ) { - uint = 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( packedPixel.getInt() ); - } else { - uint = 0x00000000FFFFFFFF & packedPixel.getInt(); - } - - // 11111111,11000000,00000000,00000000 == 0xFFC00000 - // 00000000,00111111,11110000,00000000 == 0x003F0000 - // 00000000,00000000,00001111,11111100 == 0x00000FFC - // 00000000,00000000,00000000,00000011 == 0x00000003 - - extractComponents[0] = (float)( ( uint & 0x000003FF ) ) / 1023.0f; - extractComponents[1] = (float)( ( uint & 0x000FFC00 ) >> 10 ) / 1023.0f; - extractComponents[2] = (float)( ( uint & 0x3FF00000 ) >> 20 ) / 1023.0f; - extractComponents[3] = (float)( ( uint & 0xC0000000 ) >> 30 ) / 3.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - long uint = (((int)((shoveComponents[0] * 1023) + 0.5f) ) & 0x000003FF ); - uint |= (((int)((shoveComponents[1] * 1023) + 0.5f) << 10) & 0x000FFC00 ); - uint |= (((int)((shoveComponents[2] * 1023) + 0.5f) << 20) & 0x3FF00000 ); - uint |= (((int)((shoveComponents[3] * 3) + 0.5f) << 30) & 0xC0000000 ); - packedPixel.asIntBuffer().put( index, (int)uint ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract233rev.java b/src/classes/com/sun/opengl/impl/mipmap/Extract233rev.java deleted file mode 100644 index a3d8ce2a8..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract233rev.java +++ /dev/null @@ -1,85 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class Extract233rev implements Extract { - - /** Creates a new instance of Extract223rev */ - public Extract233rev() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - // 11100000 == 0xe0 - // 00011100 == 0x1c - // 00000011 == 0x03 - byte ubyte = packedPixel.get(); - extractComponents[0] = (float)((ubyte & 0x07) ) / 7.0f; - extractComponents[1] = (float)((ubyte & 0x38) >> 3) / 7.0f; - extractComponents[2] = (float)((ubyte & 0xC0) >> 6) / 3.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11100000 == 0xE0 - // 00011100 == 0x1C - // 00000011 == 0x03 - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - - // due to limited precision, need to round before shoving - byte b = (byte)( ( (int)( ( shoveComponents[0] * 7 ) + 0.5f ) ) & 0x07 ); - b |= (byte)( ( (int)( ( shoveComponents[1] * 7 ) + 0.5f ) << 3 ) & 0x38 ); - b |= (byte)( ( (int)( ( shoveComponents[2] * 3 ) + 0.5f ) << 6 ) & 0xC0 ); - packedPixel.position( index ); - packedPixel.put( b ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract332.java b/src/classes/com/sun/opengl/impl/mipmap/Extract332.java deleted file mode 100644 index 008911364..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract332.java +++ /dev/null @@ -1,84 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class Extract332 implements Extract { - - /** Creates a new instance of Extract332 */ - public Extract332() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - // 11100000 == 0xe0 - // 00011100 == 0x1c - // 00000011 == 0x03 - byte ubyte = packedPixel.get(); - extractComponents[0] = (float)((ubyte & 0xe0) >> 5) / 7.0f; - extractComponents[1] = (float)((ubyte & 0x1c) >> 2) / 7.0f; - extractComponents[2] = (float)((ubyte & 0x03)) / 3.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11100000 == 0xE0 - // 00011100 == 0x1C - // 00000011 == 0x03 - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - - // due to limited precision, need to round before shoving - byte b = (byte)( ( (int)( ( shoveComponents[0] * 7 ) + 0.5f ) << 5 ) & 0xE0 ); - b |= (byte)( ( (int)( ( shoveComponents[1] * 7 ) + 0.5f ) << 2 ) & 0x1C ); - b |= (byte)( ( (int)( ( shoveComponents[2] * 3 ) + 0.5f ) ) & 0x03 ); - packedPixel.put( index, b ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract4444.java b/src/classes/com/sun/opengl/impl/mipmap/Extract4444.java deleted file mode 100644 index b7414b184..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract4444.java +++ /dev/null @@ -1,96 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract4444 implements Extract { - - /** Creates a new instance of Extract4444 */ - public Extract4444() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - int ushort = 0; - - if( isSwap ) { - ushort = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( packedPixel.getShort() ); - } else { - ushort = 0x0000FFFF & packedPixel.getShort(); - } - - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - extractComponents[0] = (float)( ( ushort & 0xF000 ) >> 12 ) / 15.0f; - extractComponents[1] = (float)( ( ushort & 0x0F00 ) >> 8 ) / 15.0f; - extractComponents[2] = (float)( ( ushort & 0x00F0 ) >> 4 ) / 15.0f; - extractComponents[3] = (float)( ( ushort & 0x000F ) ) / 15.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - - // due to limited precision, need to round before shoving - int ushort = (((int)((shoveComponents[0] * 15) + 0.5f) << 12) & 0x0000F000 ); - ushort |= (((int)((shoveComponents[1] * 15) + 0.5f) << 8) & 0x00000F00 ); - ushort |= (((int)((shoveComponents[2] * 15) + 0.5f) << 4) & 0x000000F0 ); - ushort |= (((int)((shoveComponents[3] * 15) + 0.5f) ) & 0x0000000F ); - packedPixel.asShortBuffer().put( index, (short)ushort ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract4444rev.java b/src/classes/com/sun/opengl/impl/mipmap/Extract4444rev.java deleted file mode 100644 index 30a2fa1ac..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract4444rev.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract4444rev implements Extract { - - /** Creates a new instance of Extract4444rev */ - public Extract4444rev() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - int ushort = 0; - - if( isSwap ) { - ushort = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( packedPixel.getShort() ); - } else { - ushort = 0x0000FFFF & packedPixel.getShort(); - } - - // 00000000,00001111 == 0x000F - // 00000000,11110000 == 0x00F0 - // 00001111,00000000 == 0x0F00 - // 11110000,00000000 == 0xF000 - - extractComponents[0] = (float)( ( ushort & 0x000F ) ) / 15.0f; - extractComponents[1] = (float)( ( ushort & 0x00F0 ) >> 4 ) / 15.0f; - extractComponents[2] = (float)( ( ushort & 0x0F00 ) >> 8 ) / 15.0f; - extractComponents[3] = (float)( ( ushort & 0xF000 ) >> 12 ) / 15.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - int ushort = (((int)((shoveComponents[0] * 15) + 0.5f) ) & 0x0000000F ); - ushort |= (((int)((shoveComponents[1] * 15) + 0.5f) << 4) & 0x000000F0 ); - ushort |= (((int)((shoveComponents[2] * 15) + 0.5f) << 8) & 0x00000F00 ); - ushort |= (((int)((shoveComponents[3] * 15) + 0.5f) << 12) & 0x0000F000 ); - packedPixel.asShortBuffer().put( index, (short)ushort ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract5551.java b/src/classes/com/sun/opengl/impl/mipmap/Extract5551.java deleted file mode 100644 index f9e692e98..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract5551.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract5551 implements Extract { - - /** Creates a new instance of Extract5551 */ - public Extract5551() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - int ushort = 0; - - if( isSwap ) { - ushort = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( packedPixel.getShort() ); - } else { - ushort = 0x0000FFFF & packedPixel.getShort(); - } - - // 11111000,00000000 == 0xF800 - // 00000111,11000000 == 0x07C0 - // 00000000,00111110 == 0x003E - // 00000000,00000001 == 0x0001 - - extractComponents[0] = (float)( ( ushort & 0xF800 ) >> 11 ) / 31.0f; - extractComponents[1] = (float)( ( ushort & 0x00F0 ) >> 6 ) / 31.0f; - extractComponents[2] = (float)( ( ushort & 0x0F00 ) >> 1 ) / 31.0f; - extractComponents[3] = (float)( ( ushort & 0xF000 ) ); - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - int ushort = (((int)((shoveComponents[0] * 31) + 0.5f) << 11) & 0x0000F800 ); - ushort |= (((int)((shoveComponents[1] * 31) + 0.5f) << 6) & 0x000007C0 ); - ushort |= (((int)((shoveComponents[2] * 31) + 0.5f) << 1) & 0x0000003E ); - ushort |= (((int)((shoveComponents[3]) + 0.5f)) & 0x00000001 ); - packedPixel.asShortBuffer().put( index, (short)ushort ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract565.java b/src/classes/com/sun/opengl/impl/mipmap/Extract565.java deleted file mode 100644 index 5eff68d7e..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract565.java +++ /dev/null @@ -1,92 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract565 implements Extract { - - /** Creates a new instance of Extract565 */ - public Extract565() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - int ushort = 0; - - if( isSwap ) { - ushort = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( packedPixel.getShort() ); - } else { - ushort = 0x0000FFFF & packedPixel.getShort(); - } - - // 11111000,00000000 == 0xF800 - // 00000111,11100000 == 0x07E0 - // 00000000,00111111 == 0x001F - - extractComponents[0] = (float)( ( ushort & 0xF800 ) >> 11 ) / 31.0f; - extractComponents[1] = (float)( ( ushort & 0x07E0 ) >> 5 ) / 63.0f; - extractComponents[2] = (float)( ( ushort & 0x001F ) ) / 31.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11111000,00000000 == 0xF800 - // 00000111,11100000 == 0x07E0 - // 00000000,00111111 == 0x001F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - - // due to limited precision, need to round before shoving - int ushort = (((int)((shoveComponents[0] * 31) + 0.5f) << 11) & 0x0000F800 ); - ushort |= (((int)((shoveComponents[1] * 63) + 0.5f) << 5) & 0x000007E0 ); - ushort |= (((int)((shoveComponents[2] * 31) + 0.5f) ) & 0x0000001F ); - packedPixel.asShortBuffer().put( index, (short)ushort ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract565rev.java b/src/classes/com/sun/opengl/impl/mipmap/Extract565rev.java deleted file mode 100644 index 099f80be5..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract565rev.java +++ /dev/null @@ -1,92 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract565rev implements Extract { - - /** Creates a new instance of Extract565rev */ - public Extract565rev() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - int ushort = 0; - - if( isSwap ) { - ushort = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( packedPixel.getShort() ); - } else { - ushort = 0x0000FFFF & packedPixel.getShort(); - } - - // 00000000,00011111 == 0x001F - // 00000111,11100000 == 0x07E0 - // 11111000,00000000 == 0xF800 - - extractComponents[0] = (float)( ( ushort & 0x001F ) ) / 31.0f; - extractComponents[1] = (float)( ( ushort & 0x07E0 ) >> 5 ) / 63.0f; - extractComponents[2] = (float)( ( ushort & 0xF800 ) >> 11 ) / 31.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 00000000,00111111 == 0x001F - // 00000111,11100000 == 0x07E0 - // 11111000,00000000 == 0xF800 - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - - // due to limited precision, need to round before shoving - int ushort = (((int)((shoveComponents[0] * 31) + 0.5f) ) & 0x0000001F ); - ushort |= (((int)((shoveComponents[1] * 63) + 0.5f) << 5) & 0x000007E0 ); - ushort |= (((int)((shoveComponents[2] * 31) + 0.5f) << 11) & 0x0000F800 ); - packedPixel.asShortBuffer().put( index, (short)ushort ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract8888.java b/src/classes/com/sun/opengl/impl/mipmap/Extract8888.java deleted file mode 100644 index f3da73952..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract8888.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract8888 implements Extract { - - /** Creates a new instance of Extract8888 */ - public Extract8888() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - long uint = 0; - - if( isSwap ) { - uint = 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( packedPixel.getInt() ); - } else { - uint = 0x00000000FFFFFFFF & packedPixel.getInt(); - } - - // 11111000,00000000 == 0xF800 - // 00000111,11000000 == 0x07C0 - // 00000000,00111110 == 0x003E - // 00000000,00000001 == 0x0001 - - extractComponents[0] = (float)( ( uint & 0xFF000000 ) >> 24 ) / 255.0f; - extractComponents[1] = (float)( ( uint & 0x00FF0000 ) >> 16 ) / 255.0f; - extractComponents[2] = (float)( ( uint & 0x0000FF00 ) >> 8 ) / 255.0f; - extractComponents[3] = (float)( ( uint & 0x000000FF ) ) / 255.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - long uint = (((int)((shoveComponents[0] * 255) + 0.5f) << 24) & 0xFF000000 ); - uint |= (((int)((shoveComponents[1] * 255) + 0.5f) << 16) & 0x00FF0000 ); - uint |= (((int)((shoveComponents[2] * 255) + 0.5f) << 8) & 0x0000FF00 ); - uint |= (((int)((shoveComponents[3] * 255) + 0.5f) ) & 0x000000FF ); - packedPixel.asIntBuffer().put( index, (int)uint ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Extract8888rev.java b/src/classes/com/sun/opengl/impl/mipmap/Extract8888rev.java deleted file mode 100644 index 58dbe81f8..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Extract8888rev.java +++ /dev/null @@ -1,97 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Extract8888rev implements Extract { - - /** Creates a new instance of Extract8888rev */ - public Extract8888rev() { - } - - public void extract( boolean isSwap, ByteBuffer packedPixel, float[] extractComponents ) { - long uint = 0; - - if( isSwap ) { - uint = 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( packedPixel.getInt() ); - } else { - uint = 0x00000000FFFFFFFF & packedPixel.getInt(); - } - - // 11111000,00000000 == 0xF800 - // 00000111,11000000 == 0x07C0 - // 00000000,00111110 == 0x003E - // 00000000,00000001 == 0x0001 - - extractComponents[0] = (float)( ( uint & 0x000000FF ) ) / 255.0f; - extractComponents[1] = (float)( ( uint & 0x0000FF00 ) >> 8 ) / 255.0f; - extractComponents[2] = (float)( ( uint & 0x00FF0000 ) >> 16 ) / 255.0f; - extractComponents[3] = (float)( ( uint & 0xFF000000 ) >> 24 ) / 255.0f; - } - - public void shove( float[] shoveComponents, int index, ByteBuffer packedPixel ) { - // 11110000,00000000 == 0xF000 - // 00001111,00000000 == 0x0F00 - // 00000000,11110000 == 0x00F0 - // 00000000,00001111 == 0x000F - - assert( 0.0f <= shoveComponents[0] && shoveComponents[0] <= 1.0f ); - assert( 0.0f <= shoveComponents[1] && shoveComponents[1] <= 1.0f ); - assert( 0.0f <= shoveComponents[2] && shoveComponents[2] <= 1.0f ); - assert( 0.0f <= shoveComponents[3] && shoveComponents[3] <= 1.0f ); - - // due to limited precision, need to round before shoving - long uint = (((int)((shoveComponents[0] * 255) + 0.5f) ) & 0x000000FF ); - uint |= (((int)((shoveComponents[1] * 255) + 0.5f) << 8) & 0x0000FF00 ); - uint |= (((int)((shoveComponents[2] * 255) + 0.5f) << 16) & 0x00FF0000 ); - uint |= (((int)((shoveComponents[3] * 255) + 0.5f) << 24) & 0xFF000000 ); - packedPixel.asIntBuffer().put( index, (int)uint ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractFloat.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractFloat.java deleted file mode 100644 index 7d06dfa82..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractFloat.java +++ /dev/null @@ -1,74 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class ExtractFloat implements ExtractPrimitive { - - /** Creates a new instance of ExtractFloat */ - public ExtractFloat() { - } - - public double extract( boolean isSwap, ByteBuffer data ) { - float f = 0; - if( isSwap ) { - f = Mipmap.GLU_SWAP_4_BYTES( data.getInt() ); - } else { - f = data.getInt(); - } - assert( f <= 1.0f ); - return( f ); - } - - public void shove( double value, int index, ByteBuffer data ) { - assert(0.0 <= value && value < 1.0); - data.asFloatBuffer().put( index, (float)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractPrimitive.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractPrimitive.java deleted file mode 100644 index 4cea1aa39..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractPrimitive.java +++ /dev/null @@ -1,56 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public interface ExtractPrimitive { - public double extract( boolean isSwap, ByteBuffer pointer ); - public void shove( double value, int index, ByteBuffer pointer ); -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractSByte.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractSByte.java deleted file mode 100644 index a2cfeca94..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractSByte.java +++ /dev/null @@ -1,69 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class ExtractSByte implements ExtractPrimitive { - - /** Creates a new instance of ExtractUByte */ - public ExtractSByte() { - } - - public double extract( boolean isSwap, ByteBuffer sbyte ) { - byte b = sbyte.get(); - assert( b <= 127 ); - return( b ); - } - - public void shove( double value, int index, ByteBuffer data ) { - data.position( index ); - data.put( (byte)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractSInt.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractSInt.java deleted file mode 100644 index 48becdc18..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractSInt.java +++ /dev/null @@ -1,76 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class ExtractSInt implements ExtractPrimitive { - - /** Creates a new instance of ExtractSInt */ - public ExtractSInt() { - } - - public double extract( boolean isSwap, ByteBuffer uint ) { - int i = 0; - if( isSwap ) { - i = Mipmap.GLU_SWAP_4_BYTES( uint.getInt() ); - } else { - i = uint.getInt(); - } - assert( i <= 0x7FFFFFFF ); - return( i ); - } - - public void shove( double value, int index, ByteBuffer data ) { - assert(0.0 <= value && value < Integer.MAX_VALUE); - IntBuffer ib = data.asIntBuffer(); - ib.position( index ); - ib.put( (int)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractSShort.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractSShort.java deleted file mode 100644 index 00ff15119..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractSShort.java +++ /dev/null @@ -1,76 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class ExtractSShort implements ExtractPrimitive { - - /** Creates a new instance of ExtractSShort */ - public ExtractSShort() { - } - - public double extract( boolean isSwap, ByteBuffer ushort ) { - short s = 0; - if( isSwap ) { - s = Mipmap.GLU_SWAP_2_BYTES( ushort.getShort() ); - } else { - s = ushort.getShort(); - } - assert( s <= 32767 ); - return( s ); - } - - public void shove( double value, int index, ByteBuffer data ) { - assert(0.0 <= value && value < 32768.0); - ShortBuffer sb = data.asShortBuffer(); - sb.position( index ); - sb.put( (short)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractUByte.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractUByte.java deleted file mode 100644 index 4767d93c0..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractUByte.java +++ /dev/null @@ -1,70 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.ByteBuffer; - -/** - * - * @author Administrator - */ -public class ExtractUByte implements ExtractPrimitive { - - /** Creates a new instance of ExtractUByte */ - public ExtractUByte() { - } - - public double extract( boolean isSwap, ByteBuffer ubyte ) { - int i = 0x000000FF & ubyte.get(); - assert( i <= 255 ); - return( i ); - } - - public void shove( double value, int index, ByteBuffer data ) { - assert(0.0 <= value && value < 256.0); - data.position( index ); - data.put( (byte)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractUInt.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractUInt.java deleted file mode 100644 index e6cd6e183..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractUInt.java +++ /dev/null @@ -1,76 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class ExtractUInt implements ExtractPrimitive { - - /** Creates a new instance of ExtractUInt */ - public ExtractUInt() { - } - - public double extract( boolean isSwap, ByteBuffer uint ) { - long i = 0; - if( isSwap ) { - i = 0xFFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( uint.getInt() ); - } else { - i = 0xFFFFFFFF & uint.getInt(); - } - assert( i <= 0xFFFFFFFF ); - return( i ); - } - - public void shove( double value, int index, ByteBuffer data ) { - assert(0.0 <= value && value < 0xFFFFFFFF); - IntBuffer ib = data.asIntBuffer(); - ib.position( index ); - ib.put( (int)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ExtractUShort.java b/src/classes/com/sun/opengl/impl/mipmap/ExtractUShort.java deleted file mode 100644 index 89b42e41b..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ExtractUShort.java +++ /dev/null @@ -1,76 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class ExtractUShort implements ExtractPrimitive { - - /** Creates a new instance of ExtracUShort */ - public ExtractUShort() { - } - - public double extract( boolean isSwap, ByteBuffer ushort ) { - int i = 0; - if( isSwap ) { - i = 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( ushort.getShort() ); - } else { - i = 0x0000FFFF & ushort.getShort(); - } - assert( i <= 65535 ); - return( i ); - } - - public void shove( double value, int index, ByteBuffer data ) { - assert(0.0 <= value && value < 65536.0); - ShortBuffer sb = data.asShortBuffer(); - sb.position( index ); - sb.put( (short)value ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/HalveImage.java b/src/classes/com/sun/opengl/impl/mipmap/HalveImage.java deleted file mode 100644 index 7f2e87a63..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/HalveImage.java +++ /dev/null @@ -1,1533 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import javax.media.opengl.GL; -import java.nio.*; - -/** - * - * @author Administrator - */ -public class HalveImage { - - private static final int BOX2 = 2; - private static final int BOX4 = 4; - private static final int BOX8 = 8; - - public static void halveImage( int components, int width, int height, - ShortBuffer datain, ShortBuffer dataout ) { - int i, j, k; - int newwidth, newheight; - int delta; - int t = 0; - short temp = 0; - - newwidth = width / 2; - newheight = height /2; - delta = width * components; - - // Piece of cake - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = datain.get(); - datain.position( t + components ); - temp += datain.get(); - datain.position( t + delta ); - temp += datain.get(); - datain.position( t + delta + components ); - temp +=datain.get(); - temp += 2; - temp /= 4; - dataout.put( temp ); - t++; - } - t += components; - } - t += delta; - } - } - - public static void halveImage_ubyte( int components, int width, int height, - ByteBuffer datain, ByteBuffer dataout, - int element_size, int ysize, int group_size ) { - int i, j, k; - int newwidth, newheight; - int s; - int t; - - // Handle case where there is only 1 column/row - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); // can't be 1x1 - halve1Dimage_ubyte( components, width, height, datain, dataout, element_size, ysize, group_size ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - s = 0; - t = 0; - - int temp = 0; - // piece of cake - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = ( 0x000000FF & datain.get() ); - datain.position( t + group_size ); - temp += ( 0x000000FF & datain.get() ); - datain.position( t + ysize ); - temp += ( 0x000000FF & datain.get() ); - datain.position( t + ysize + group_size ); - temp += ( 0x000000FF & datain.get() ) + 2; - dataout.put( (byte)(temp / 4) ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - - public static void halve1Dimage_ubyte( int components, int width, int height, - ByteBuffer datain, ByteBuffer dataout, - int element_size, int ysize, int group_size ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int dest = 0; - int jj; - int temp = 0; - - assert( width == 1 || height == 1 ); // Must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // widthxheight can't be 1x1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - datain.position( src ); - temp = ( 0x000000FF & datain.get() ); - datain.position( src + group_size ); - temp += ( 0x000000FF & datain.get() ); - temp /= 2; - dataout.put( (byte)temp ); - /* - dataout.setByte( (byte)(((0x000000FF & datain.setIndexInBytes(src).getByte()) + - (0x000000FF & datain.setIndexInBytes( src + group_size ).getByte())) / 2 ) ); - */ - src += element_size; - //dataout.plusPlus(); - dest++; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assertion only - } else if( width == 1 ) { // 1 column - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - datain.position( src ); - temp = ( 0x000000FF & datain.get() ); - datain.position( src + ysize ); - temp += ( 0x000000FF & datain.get() ); - temp /= 2; - dataout.put( (byte)temp ); - /* - dataout.setByte( (byte)(((0x000000FF & datain.setIndexInBytes(src).getByte()) + - (0x000000FF & datain.setIndexInBytes(src + ysize).getByte()) ) / 2 ) ); - */ - src += element_size; - //dataout.plusPlus(); - dest++; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - } - assert( src == ysize * height ); - assert( dest == components * element_size * halfWidth * halfHeight ); - } - - public static void halveImage_byte( int components, int width, int height, - ByteBuffer datain, ByteBuffer dataout, int element_size, - int ysize, int group_size ) { - int i, j, k; - int newwidth, newheight; - int s = 0; - int t = 0; - byte temp = (byte)0; - - // handle case where there is only 1 column - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); - halve1Dimage_byte( components, width, height, datain, dataout, element_size, - ysize, group_size ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = datain.get(); - datain.position( t + group_size ); - temp += datain.get(); - datain.position( t + ysize ); - temp += datain.get(); - datain.position( t + ysize + group_size ); - temp += datain.get(); - temp += 2; - temp /= 4; - dataout.put( temp ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - - public static void halve1Dimage_byte( int components, int width, int height, - ByteBuffer datain, ByteBuffer dataout, - int element_size, int ysize, int group_size ) { - int halfWidth = width / 2; - int halfHeight = width / 2; - int src = 0; - int dest = 0; - int jj; - byte temp = (byte)0; - - assert( width == 1 || height == 1 ); // must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // widthxheight can't be 1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - datain.position( src ); - temp = datain.get(); - datain.position( src + group_size ); - temp += datain.get(); - temp /= 2; - dataout.put( temp ); - src += element_size; - dest++; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assert only - } else if( width == 1 ) { // 1 column - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); // widthxheight can't be 1 - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - datain.position( src ); - temp = datain.get(); - datain.position( src + ysize ); - temp += datain.get(); - temp /= 2; - src += element_size; - dest++; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - assert( src == ysize * height ); - } - assert( dest == components * element_size * halfWidth * halfHeight ); - } - - public static void halveImage_ushort( int components, int width, int height, - ByteBuffer datain, ShortBuffer dataout, int element_size, - int ysize, int group_size, boolean myswap_bytes ) { - int i, j, k, l; - int newwidth, newheight; - int s = 0; - int t = 0; - int temp = 0; - // handle case where there is only 1 column/row - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); // can't be 1x1 - halve1Dimage_ushort( components, width, height, datain, dataout, element_size, - ysize, group_size, myswap_bytes ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - - // Piece of cake - if( !myswap_bytes ) { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = ( 0x0000FFFF & datain.getShort() ); - datain.position( t + group_size ); - temp += ( 0x0000FFFF & datain.getShort() ); - datain.position( t + ysize ); - temp += ( 0x0000FFFF & datain.getShort() ); - datain.position( t + ysize + group_size ); - temp += ( 0x0000FFFF & datain.getShort() ); - dataout.put( (short)( ( temp + 2 ) / 4 ) ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } else { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - datain.position( t + group_size ); - temp += ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - datain.position( t + ysize ); - temp += ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - datain.position( t + ysize + group_size ); - temp += ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - dataout.put( (short)( ( temp + 2 ) / 4 ) ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - } - - public static void halve1Dimage_ushort( int components, int width, int height, - ByteBuffer datain, ShortBuffer dataout, int element_size, - int ysize, int group_size, boolean myswap_bytes ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int dest = 0; - int jj; - - assert( width == 1 || height == 1 ); // must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // widthxheight can't be 1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < halfHeight; kk++ ) { - int[] ushort = new int[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - ushort[0] = ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - datain.position( src + group_size ); - ushort[1] = (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - } else { - datain.position( src ); - ushort[0] = (0x0000FFFF & datain.getShort() ); - datain.position( src + group_size ); - ushort[1] = (0x0000FFFF & datain.getShort() ); - } - dataout.put( (short)( (ushort[0] + ushort[1]) / 2 ) ); - src += element_size; - dest += 2; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assertion only - } else if( width == 1 ) { // 1 column - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); // widthxheight can't be 1 - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - int[] ushort = new int[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - ushort[0] = ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - datain.position( src + ysize ); - ushort[0] = ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ) ); - } else { - datain.position( src ); - ushort[0] = ( 0x0000FFFF & datain.getShort() ); - datain.position( src + ysize ); - ushort[1] = ( 0x0000FFFF & datain.getShort() ); - } - dataout.put( (short)((ushort[0] + ushort[1]) / 2) ); - src += element_size; - dest += 2; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - assert( src == ysize * height ); - } - assert( dest == components * element_size * halfWidth * halfHeight ); - } - - public static void halveImage_short( int components, int width, int height, - ByteBuffer datain, ShortBuffer dataout, int element_size, - int ysize, int group_size, boolean myswap_bytes ) { - int i, j, k, l; - int newwidth, newheight; - int s = 0; - int t = 0; - short temp = (short)0; - // handle case where there is only 1 column/row - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); // can't be 1x1 - halve1Dimage_short( components, width, height, datain, dataout, element_size, - ysize, group_size, myswap_bytes ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - - // Piece of cake - if( !myswap_bytes ) { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = datain.getShort(); - datain.position( t + group_size ); - temp += datain.getShort(); - datain.position( t + ysize ); - temp += datain.getShort(); - datain.position( t + ysize + group_size ); - temp += datain.getShort(); - temp += 2; - temp /= 4; - dataout.put( (short)temp ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } else { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - short b; - int buf; - datain.position( t ); - temp = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - datain.position( t + group_size ); - temp += Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - datain.position( t + ysize ); - temp += Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - datain.position( t + ysize + group_size ); - temp += Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - temp += 2; - temp /= 4; - dataout.put( temp ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - } - - public static void halve1Dimage_short( int components, int width, int height, - ByteBuffer datain, ShortBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int dest = 0; - int jj; - - assert( width == 1 || height == 1 ); // must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // can't be 1x1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - short[] sshort = new short[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - sshort[0] = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - datain.position( src + group_size ); - sshort[1] = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - } else { - datain.position( src ); - sshort[0] = datain.getShort(); - datain.position( src + group_size ); - sshort[1] = datain.getShort(); - } - dataout.put( (short)(( sshort[0] + sshort[1] ) / 2) ); - src += element_size; - dest += 2; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assertion only - } else if( width == 1 ) { - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - short[] sshort = new short[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - sshort[0] = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - datain.position( src + ysize ); - sshort[1] = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - } else { - datain.position( src ); - sshort[0] = datain.getShort(); - datain.position( src + ysize ); - sshort[1] = datain.getShort(); - } - dataout.put( (short)(( sshort[0] + sshort[1] ) / 2) ); - src += element_size; - dest += 2; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - assert( src == ysize * height ); - } - assert( dest == ( components * element_size * halfWidth * halfHeight ) ); - } - - public static void halveImage_uint( int components, int width, int height, - ByteBuffer datain, IntBuffer dataout, int element_size, - int ysize, int group_size, boolean myswap_bytes ) { - int i, j, k, l; - int newwidth, newheight; - int s = 0; - int t = 0; - double temp = 0; - - // handle case where there is only 1 column/row - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); // can't be 1x1 - halve1Dimage_uint( components, width, height, datain, dataout, element_size, - ysize, group_size, myswap_bytes ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - - // Piece of cake - if( !myswap_bytes ) { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = (0x000000007FFFFFFFL & datain.getInt() ); - datain.position( t + group_size ); - temp += (0x000000007FFFFFFFL & datain.getInt() ); - datain.position( t + ysize ); - temp += (0x000000007FFFFFFFL & datain.getInt() ); - datain.position( t + ysize + group_size ); - temp += (0x000000007FFFFFFFL & datain.getInt() ); - dataout.put( (int)( ( temp / 4 ) + 0.5 ) ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } else { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - // need to cast to double to hold large unsigned ints - double buf; - datain.position( t ); - buf = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( t + group_size ); - buf += ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( t + ysize ); - buf += ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( t + ysize + group_size ); - buf += ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - temp /= 4; - temp += 0.5; - dataout.put( (int)temp ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - } - - public static void halve1Dimage_uint( int components, int width, int height, - ByteBuffer datain, IntBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int dest = 0; - int jj; - - assert( width == 1 || height == 1 ); // must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // widthxheight can't be 1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < halfHeight; kk++ ) { - long[] uint = new long[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( src + group_size ); - uint[1] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - } else { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & datain.getInt() ); - datain.position( src + group_size ); - uint[1] = (0x00000000FFFFFFFF & datain.getInt() ); - } - dataout.put( (int)( ( uint[0] + uint[1] ) / 2.0 ) ); - src += element_size; - dest += 4; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assertion only - } else if( width == 1 ) { // 1 column - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); // widthxheight can't be 1 - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - long[] uint = new long[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( src + group_size ); - uint[0] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - } else { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & datain.getInt() ); - datain.position( src + ysize ); - uint[1] = ( 0x00000000FFFFFFFF & datain.getInt() ); - } - dataout.put( (int)( ( uint[0] + uint[1] ) / 2.0 ) ); - src += element_size; - dest += 4; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - assert( src == ysize * height ); - } - assert( dest == components * element_size * halfWidth * halfHeight ); - } - - public static void halveImage_int( int components, int width, int height, - ByteBuffer datain, IntBuffer dataout, int element_size, - int ysize, int group_size, boolean myswap_bytes ) { - int i, j, k, l; - int newwidth, newheight; - int s = 0; - int t = 0; - int temp = 0; - - // handle case where there is only 1 column/row - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); // can't be 1x1 - halve1Dimage_int( components, width, height, datain, dataout, element_size, - ysize, group_size, myswap_bytes ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - - // Piece of cake - if( !myswap_bytes ) { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = datain.getInt(); - datain.position( t + group_size ); - temp += datain.getInt(); - datain.position( t + ysize ); - temp += datain.getInt(); - datain.position( t + ysize + group_size ); - temp += datain.getInt(); - temp = (int)( ( temp / 4.0f ) + 0.5f ); - dataout.put( temp ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } else { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - long b; - float buf; - datain.position( t ); - b = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - buf = b; - datain.position( t + group_size ); - b = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - buf += b; - datain.position( t + ysize ); - b = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - buf += b; - datain.position( t + ysize + group_size ); - b = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - buf += b; - dataout.put( (int)( ( buf / 4.0f ) + 0.5f ) ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - } - - public static void halve1Dimage_int( int components, int width, int height, - ByteBuffer datain, IntBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int dest = 0; - int jj; - - assert( width == 1 || height == 1 ); // must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // can't be 1x1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - long[] uint = new long[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( src + group_size ); - uint[1] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - } else { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & datain.getInt() ); - datain.position( src + group_size ); - uint[1] = ( 0x00000000FFFFFFFF & datain.getInt() ); - } - dataout.put( (int)( ( (float)uint[0] + (float)uint[1] ) / 2.0f) ); - src += element_size; - dest += 4; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assertion only - } else if( width == 1 ) { - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - long[] uint = new long[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - datain.position( src + ysize ); - uint[1] = ( 0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ) ); - } else { - datain.position( src ); - uint[0] = ( 0x00000000FFFFFFFF & datain.getInt() ); - datain.position( src + ysize ); - uint[1] = ( 0x00000000FFFFFFFF & datain.getInt() ); - } - dataout.put( (int)(( (float)uint[0] + (float)uint[1] ) / 2.0f) ); - src += element_size; - dest += 4; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - assert( src == ysize * height ); - } - assert( dest == ( components * element_size * halfWidth * halfHeight ) ); - } - - public static void halveImage_float( int components, int width, int height, - ByteBuffer datain, FloatBuffer dataout, int element_size, - int ysize, int group_size, boolean myswap_bytes ) { - int i, j, k, l; - int newwidth, newheight; - int s = 0; - int t = 0; - float temp = 0.0f; - // handle case where there is only 1 column/row - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); // can't be 1x1 - halve1Dimage_float( components, width, height, datain, dataout, element_size, - ysize, group_size, myswap_bytes ); - return; - } - - newwidth = width / 2; - newheight = height / 2; - - // Piece of cake - if( !myswap_bytes ) { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - datain.position( t ); - temp = datain.getFloat(); - datain.position( t + group_size ); - temp += datain.getFloat(); - datain.position( t + ysize ); - temp += datain.getFloat(); - datain.position( t + ysize + group_size ); - temp /= 4.0f; - dataout.put( temp ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } else { - for( i = 0; i < newheight; i++ ) { - for( j = 0; j < newwidth; j++ ) { - for( k = 0; k < components; k++ ) { - float buf; - datain.position( t ); - buf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - datain.position( t + group_size ); - buf += Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - datain.position( t + ysize ); - buf += Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - datain.position( t + ysize + group_size ); - buf += Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - dataout.put( buf / 4.0f ); - t += element_size; - } - t += group_size; - } - t += ysize; - } - } - } - - public static void halve1Dimage_float( int components, int width, int height, - ByteBuffer datain, FloatBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int dest = 0; - int jj; - - assert( width == 1 || height == 1 ); // must be 1D - assert( width != height ); // can't be square - - if( height == 1 ) { // 1 row - assert( width != 1 ); // can't be 1x1 - halfHeight = 1; - - for( jj = 0; jj < halfWidth; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - float[] sfloat = new float[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - sfloat[0] = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - datain.position( src + group_size ); - sfloat[1] = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - } else { - datain.position( src ); - sfloat[0] = datain.getFloat(); - datain.position( src + group_size ); - sfloat[1] = datain.getFloat(); - } - dataout.put( (sfloat[0] + sfloat[1]) / 2.0f ); - src += element_size; - dest += 4; - } - src += group_size; // skip to next 2 - } - int padBytes = ysize - ( width * group_size ); - src += padBytes; // for assertion only - } else if( width == 1 ) { - int padBytes = ysize - ( width * group_size ); - assert( height != 1 ); - halfWidth = 1; - // one vertical column with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - int kk; - for( kk = 0; kk < components; kk++ ) { - float[] sfloat = new float[BOX2]; - if( myswap_bytes ) { - datain.position( src ); - sfloat[0] = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - datain.position( src + ysize ); - sfloat[1] = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - } else { - datain.position( src ); - sfloat[0] = datain.getFloat(); - datain.position( src + ysize ); - sfloat[1] = datain.getFloat(); - } - dataout.put( ( sfloat[0] + sfloat[1] ) / 2.0f ); - src += element_size; - dest += 4; - } - src += padBytes; // add pad bytes, if any, to get to end of row - src += ysize; - } - assert( src == ysize * height ); - } - assert( dest == ( components * element_size * halfWidth * halfHeight ) ); - } - - public static void halveImagePackedPixel( int components, Extract extract, int width, - int height, ByteBuffer datain, ByteBuffer dataout, - int pixelSizeInBytes, int rowSizeInBytes, boolean isSwap ) { - if( width == 1 || height == 1 ) { - assert( !( width == 1 && height == 1 ) ); - halve1DimagePackedPixel( components, extract, width, height, datain, dataout, - pixelSizeInBytes, rowSizeInBytes, isSwap ); - return; - } - int ii, jj; - - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int padBytes = rowSizeInBytes - ( width * pixelSizeInBytes ); - int outIndex = 0; - - for( ii = 0; ii < halfHeight; ii++ ) { - for( jj = 0; jj < halfWidth; jj++ ) { - float totals[] = new float[4]; - float extractTotals[][] = new float[BOX4][4]; - int cc; - - datain.position( src ); - extract.extract( isSwap, datain, extractTotals[0] ); - datain.position( src + pixelSizeInBytes ); - extract.extract( isSwap, datain, extractTotals[1] ); - datain.position( src + rowSizeInBytes ); - extract.extract( isSwap, datain, extractTotals[2] ); - datain.position( src + rowSizeInBytes + pixelSizeInBytes ); - extract.extract( isSwap, datain, extractTotals[3] ); - for( cc = 0; cc < components; cc++ ) { - int kk = 0; - // grab 4 pixels to average - totals[cc] = 0.0f; - for( kk = 0; kk < BOX4; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= BOX4; - } - extract.shove( totals, outIndex, dataout ); - outIndex++; - src += pixelSizeInBytes + pixelSizeInBytes; - } - // skip past pad bytes, if any, to get to next row - src += padBytes; - src += rowSizeInBytes; - } - assert( src == rowSizeInBytes * height ); - assert( outIndex == halfWidth * halfHeight ); - } - - public static void halve1DimagePackedPixel( int components, Extract extract, int width, - int height, ByteBuffer datain, ByteBuffer dataout, - int pixelSizeInBytes, int rowSizeInBytes, boolean isSwap ) { - int halfWidth = width / 2; - int halfHeight = height / 2; - int src = 0; - int jj; - - assert( width == 1 || height == 1 ); - assert( width != height ); - - if( height == 1 ) { - int outIndex = 0; - - assert( width != 1 ); - halfHeight = 1; - - // one horizontal row with possible pad bytes - - for( jj = 0; jj < halfWidth; jj++ ) { - float[] totals = new float[4]; - float[][] extractTotals = new float[BOX2][4]; - int cc; - - datain.position( src ); - extract.extract( isSwap, datain, extractTotals[0] ); - datain.position( src + pixelSizeInBytes ); - extract.extract( isSwap, datain, extractTotals[1] ); - for( cc = 0; cc < components; cc++ ) { - int kk = 0; - // grab 4 pixels to average - totals[cc] = 0.0f; - for( kk = 0; kk < BOX2; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= BOX2; - } - extract.shove( totals, outIndex, dataout ); - outIndex++; - // skip over to next group of 2 - src += pixelSizeInBytes + pixelSizeInBytes; - } - int padBytes = rowSizeInBytes - ( width * pixelSizeInBytes ); - src += padBytes; - - assert( src == rowSizeInBytes ); - assert( outIndex == halfWidth * halfHeight ); - } else if( width == 1 ) { - int outIndex = 0; - - assert( height != 1 ); - halfWidth = 1; - // one vertical volumn with possible pad bytes per row - // average two at a time - - for( jj = 0; jj < halfHeight; jj++ ) { - float[] totals = new float[4]; - float[][] extractTotals = new float[BOX2][4]; - int cc; - // average two at a time, instead of four - datain.position( src ); - extract.extract( isSwap, datain, extractTotals[0] ); - datain.position( src + rowSizeInBytes ); - extract.extract( isSwap, datain, extractTotals[1] ); - for( cc = 0; cc < components; cc++ ) { - int kk = 0; - // grab 4 pixels to average - totals[cc] = 0.0f; - for( kk = 0; kk < BOX2; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= BOX2; - } - extract.shove( totals, outIndex, dataout ); - outIndex++; - // skip over to next group of 2 - src += rowSizeInBytes + rowSizeInBytes; - } - assert( src == rowSizeInBytes ); - assert( outIndex == halfWidth * halfHeight ); - } - } - - public static void halveImagePackedPixelSlice( int components, Extract extract, - int width, int height, int depth, ByteBuffer dataIn, - ByteBuffer dataOut, int pixelSizeInBytes, int rowSizeInBytes, - int imageSizeInBytes, boolean isSwap ) { - int ii, jj; - int halfWidth = width / 2; - int halfHeight = height / 2; - int halfDepth = depth / 2; - int src = 0; - int padBytes = rowSizeInBytes - ( width * pixelSizeInBytes ); - int outIndex = 0; - - assert( (width == 1 || height == 1) && depth >= 2 ); - - if( width == height ) { - assert( width == 1 && height == 1 ); - assert( depth >= 2 ); - - for( ii = 0; ii < halfDepth; ii++ ) { - float totals[] = new float[4]; - float extractTotals[][] = new float[BOX2][4]; - int cc; - - dataIn.position( src ); - extract.extract( isSwap, dataIn, extractTotals[0] ); - dataIn.position( src + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[1] ); - - for( cc = 0; cc < components; cc++ ) { - int kk; - - // average only 2 pixels since a column - totals[cc]= 0.0f; - for( kk = 0; kk < BOX2; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= BOX2; - } // for cc - - extract.shove( totals, outIndex, dataOut ); - outIndex++; - // skip over to next group of 2 - src += imageSizeInBytes + imageSizeInBytes; - } // for ii - } else if( height == 1 ) { - assert( width != 1 ); - - for( ii = 0; ii < halfDepth; ii++ ) { - for( jj = 0; jj < halfWidth; jj++ ) { - float totals[] = new float[4]; - float extractTotals[][] = new float[BOX4][4]; - int cc; - - dataIn.position( src ); - extract.extract( isSwap, dataIn, extractTotals[0] ); - dataIn.position( src + pixelSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[1] ); - dataIn.position( src + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[2] ); - dataIn.position( src + pixelSizeInBytes + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[3] ); - - for( cc = 0; cc < components; cc++ ) { - int kk; - - // grab 4 pixels to average - totals[cc] = 0.0f; - for( kk = 0; kk < BOX4; kk++ ) { - totals[cc]+= extractTotals[kk][cc]; - } - totals[cc]/= (float)BOX4; - } - extract.shove( totals, outIndex, dataOut ); - outIndex++; - // skip over to next horizontal square of 4 - src += imageSizeInBytes + imageSizeInBytes; - } - } - } else if( width == 1 ) { - assert( height != 1 ); - - for( ii = 0; ii < halfDepth; ii++ ) { - for( jj = 0; jj < halfWidth; jj++ ) { - float totals[] = new float[4]; - float extractTotals[][] = new float[BOX4][4]; - int cc; - - dataIn.position( src ); - extract.extract( isSwap, dataIn, extractTotals[0] ); - dataIn.position( src + rowSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[1] ); - dataIn.position( src + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[2] ); - dataIn.position( src + rowSizeInBytes + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[3] ); - - for( cc = 0; cc < components; cc++ ) { - int kk; - - // grab 4 pixels to average - totals[cc] = 0.0f; - for( kk = 0; kk < BOX4; kk++ ) { - totals[cc]+= extractTotals[kk][cc]; - } - totals[cc]/= (float)BOX4; - } - extract.shove( totals, outIndex, dataOut ); - outIndex++; - // skip over to next horizontal square of 4 - src += imageSizeInBytes + imageSizeInBytes; - } - } - } - } - - public static void halveImageSlice( int components, ExtractPrimitive extract, int width, - int height, int depth, ByteBuffer dataIn, ByteBuffer dataOut, - int elementSizeInBytes, int groupSizeInBytes, int rowSizeInBytes, - int imageSizeInBytes, boolean isSwap ) { - int ii, jj; - int halfWidth = width / 2; - int halfHeight = height / 2; - int halfDepth = depth / 2; - int src = 0; - int padBytes = rowSizeInBytes - ( width * groupSizeInBytes ); - int outIndex = 0; - - assert( (width == 1 || height == 1) && depth >= 2 ); - - if( width == height ) { - assert( width == 1 && height == 1 ); - assert( depth >= 2 ); - - for( ii = 0; ii < halfDepth; ii++ ) { - int cc; - for( cc = 0; cc < components; cc++ ) { - double[] totals = new double[4]; - double[][] extractTotals = new double[BOX2][4]; - int kk; - - dataIn.position( src ); - extractTotals[0][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + imageSizeInBytes ); - extractTotals[1][cc] = extract.extract( isSwap, dataIn ); - - // average 2 pixels since only a column - totals[cc] = 0.0f; - // totals[red] = extractTotals[0][red] + extractTotals[1][red]; - // totals[red] = red / 2; - for( kk = 0; kk < BOX2; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= (double)BOX2; - - extract.shove( totals[cc], outIndex, dataOut ); - outIndex++; - src += elementSizeInBytes; - } // for cc - // skip over next group of 2 - src += rowSizeInBytes; - } // for ii - - assert( src == rowSizeInBytes * height * depth ); - assert( outIndex == halfDepth * components ); - } else if( height == 1 ) { - assert( width != 1 ); - - for( ii = 0; ii < halfDepth; ii++ ) { - for( jj = 0; jj < halfWidth; jj++ ) { - int cc; - for( cc = 0; cc < components; cc++ ) { - int kk; - double totals[] = new double[4]; - double extractTotals[][] = new double[BOX4][4]; - - dataIn.position( src ); - extractTotals[0][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + groupSizeInBytes ); - extractTotals[1][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + imageSizeInBytes ); - extractTotals[2][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + imageSizeInBytes + groupSizeInBytes ); - extractTotals[3][cc] = extract.extract( isSwap, dataIn ); - - // grab 4 pixels to average - totals[cc] = 0.0f; - // totals[red] = extractTotals[0][red] + extractTotals[1][red] + - // extractTotals[2][red] + extractTotals[3][red]; - // totals[red] /= (double)BOX4; - for( kk = 0; kk < BOX4; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= (double)BOX4; - - extract.shove( totals[cc], outIndex, dataOut ); - outIndex++; - src += elementSizeInBytes; - } // for cc - // skip over to next horizontal square of 4 - src += elementSizeInBytes; - } // for jj - src += padBytes; - src += rowSizeInBytes; - } // for ii - assert( src == rowSizeInBytes * height * depth ); - assert( outIndex == halfWidth * halfDepth * components ); - } else if( width == 1 ) { - assert( height != 1 ); - - for( ii = 0; ii < halfDepth; ii++ ) { - for( jj = 0; jj < halfHeight; jj++ ) { - int cc; - for( cc = 0; cc < components; cc++ ) { - int kk; - double totals[] = new double[4]; - double extractTotals[][] = new double[BOX4][4]; - - dataIn.position( src ); - extractTotals[0][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + rowSizeInBytes ); - extractTotals[1][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + imageSizeInBytes ); - extractTotals[2][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + imageSizeInBytes + groupSizeInBytes ); - extractTotals[3][cc] = extract.extract( isSwap, dataIn ); - - - // grab 4 pixels to average - totals[cc] = 0.0f; - // totals[red] = extractTotals[0][red] + extractTotals[1][red] + - // extractTotals[2][red] + extractTotals[3][red]; - // totals[red] /= (double)BOX4; - for( kk = 0; kk < BOX4; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= (double)BOX4; - - extract.shove( totals[cc], outIndex, dataOut ); - outIndex++; - src += elementSizeInBytes; - } // for cc - // skip over to next horizontal square of 4 - src += padBytes; - src += rowSizeInBytes; - } // for jj - src += imageSizeInBytes; - } // for ii - assert( src == rowSizeInBytes * height * depth ); - assert( outIndex == halfWidth * halfDepth * components ); - } - } - - public static void halveImage3D( int components, ExtractPrimitive extract, - int width, int height, int depth, ByteBuffer dataIn, ByteBuffer dataOut, - int elementSizeInBytes, int groupSizeInBytes, int rowSizeInBytes, - int imageSizeInBytes, boolean isSwap ) { - assert( depth > 1 ); - - // horizontal/vertical/onecolumn slice viewed from top - if( width == 1 || height == 1 ) { - assert( 1 <= depth ); - - halveImageSlice( components, extract, width, height, depth, dataIn, dataOut, - elementSizeInBytes, groupSizeInBytes, rowSizeInBytes, imageSizeInBytes, - isSwap ); - return; - } - - int ii, jj, dd; - - int halfWidth = width / 2; - int halfHeight = height / 2; - int halfDepth = depth / 2; - int src = 0; - int padBytes = rowSizeInBytes - ( width * groupSizeInBytes ); - int outIndex = 0; - - for( dd = 0; dd < halfDepth; dd++ ) { - for( ii = 0; ii < halfHeight; ii++ ) { - for( jj = 0; jj < halfWidth; jj++ ) { - int cc; - for( cc = 0; cc < components; cc++ ) { - int kk; - double totals[] = new double[4]; - double extractTotals[][] = new double[BOX8][4]; - - dataIn.position( src ); - extractTotals[0][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + groupSizeInBytes ); - extractTotals[1][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + rowSizeInBytes ); - extractTotals[2][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + rowSizeInBytes + groupSizeInBytes ); - extractTotals[3][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + imageSizeInBytes ); - extractTotals[4][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + groupSizeInBytes + imageSizeInBytes ); - extractTotals[5][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + rowSizeInBytes + imageSizeInBytes ); - extractTotals[6][cc] = extract.extract( isSwap, dataIn ); - dataIn.position( src + rowSizeInBytes + imageSizeInBytes + groupSizeInBytes ); - extractTotals[7][cc] = extract.extract( isSwap, dataIn ); - - totals[cc] = 0.0f; - - for( kk = 0; kk < BOX8; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= (double)BOX8; - - extract.shove( totals[cc], outIndex, dataOut ); - outIndex++; - - src += elementSizeInBytes; - } // for cc - // skip over to next square of 4 - src += groupSizeInBytes; - } // for jj - // skip past pad bytes, if any, to get to next row - src += padBytes; - src += rowSizeInBytes; - } // for ii - src += imageSizeInBytes; - } // for dd - assert( src == rowSizeInBytes * height * depth ); - assert( outIndex == halfWidth * halfHeight * halfDepth * components ); - } - - public static void halveImagePackedPixel3D( int components, Extract extract, - int width, int height, int depth, ByteBuffer dataIn, - ByteBuffer dataOut, int pixelSizeInBytes, int rowSizeInBytes, - int imageSizeInBytes, boolean isSwap ) { - if( depth == 1 ) { - assert( 1 <= width && 1 <= height ); - - halveImagePackedPixel( components, extract, width, height, dataIn, dataOut, - pixelSizeInBytes, rowSizeInBytes, isSwap ); - return; - } else if( width == 1 || height == 1 ) { // a horizontal or vertical slice viewed from top - assert( 1 <= depth ); - - halveImagePackedPixelSlice( components, extract, width, height, depth, dataIn, - dataOut, pixelSizeInBytes, rowSizeInBytes, imageSizeInBytes, isSwap ); - return; - } - int ii, jj, dd; - - int halfWidth = width / 2; - int halfHeight = height / 2; - int halfDepth = depth / 2; - int src = 0; - int padBytes = rowSizeInBytes - ( width * pixelSizeInBytes ); - int outIndex = 0; - - for( dd = 0; dd < halfDepth; dd++ ) { - for( ii = 0; ii < halfHeight; ii++ ) { - for( jj = 0; jj < halfWidth; jj++ ) { - float totals[] = new float[4]; // 4 is max components - float extractTotals[][] = new float[BOX8][4]; - int cc; - - dataIn.position( src ); - extract.extract( isSwap, dataIn, extractTotals[0] ); - dataIn.position( src + pixelSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[1] ); - dataIn.position( src + rowSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[2] ); - dataIn.position( src + rowSizeInBytes + pixelSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[3] ); - dataIn.position( src + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[4] ); - dataIn.position( src + pixelSizeInBytes + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[5] ); - dataIn.position( src + rowSizeInBytes + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[6] ); - dataIn.position( src + rowSizeInBytes + pixelSizeInBytes + imageSizeInBytes ); - extract.extract( isSwap, dataIn, extractTotals[7] ); - - for( cc = 0; cc < components; cc++ ) { - int kk; - // grab 8 pixels to average - totals[cc] = 0.0f; - for( kk = 0; kk < BOX8; kk++ ) { - totals[cc] += extractTotals[kk][cc]; - } - totals[cc] /= (float)BOX8; - } - extract.shove( totals, outIndex, dataOut ); - outIndex++; - // skip over to next square of 4 - src += pixelSizeInBytes + pixelSizeInBytes; - } - // skip past pad bytes, if any, to get to next row - src += padBytes; - src += rowSizeInBytes; - } - src += imageSizeInBytes; - } - assert( src == rowSizeInBytes * height * depth ); - assert( outIndex == halfWidth * halfHeight * halfDepth ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Image.java b/src/classes/com/sun/opengl/impl/mipmap/Image.java deleted file mode 100644 index 605d5547b..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Image.java +++ /dev/null @@ -1,1413 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import javax.media.opengl.GL; -import javax.media.opengl.GL2; -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Image { - - /** Creates a new instance of Image */ - public Image() { - } - - public static short getShortFromByteArray( byte[] array, int index ) { - short s; - s = (short)(array[index] << 8 ); - s |= (short)(0x00FF & array[index+1]); - return( s ); - } - - public static int getIntFromByteArray( byte[] array, int index ) { - int i; - i = ( array[index] << 24 ) & 0xFF000000; - i |= ( array[index+1] << 16 ) & 0x00FF0000; - i |= ( array[index+2] << 8 ) & 0x0000FF00; - i |= ( array[index+3] ) & 0x000000FF; - return( i ); - } - - public static float getFloatFromByteArray( byte[] array, int index ) { - int i = getIntFromByteArray( array, index ); - return( Float.intBitsToFloat(i) ); - } - - /* - * Extract array from user's data applying all pixel store modes. - * The internal format used is an array of unsigned shorts. - */ - public static void fill_image( PixelStorageModes psm, int width, int height, - int format, int type, boolean index_format, ByteBuffer userdata, - ShortBuffer newimage ) { - int components; - int element_size; - int rowsize; - int padding; - int groups_per_line; - int group_size; - int elements_per_line; - int start; - int iter = 0; - int iter2; - int i, j, k; - boolean myswap_bytes; - - // Create a Extract interface object - Extract extract = null; - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - extract = new Extract332(); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - extract = new Extract233rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - extract = new Extract565(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - extract = new Extract565rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - extract = new Extract4444(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - extract = new Extract4444rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - extract = new Extract5551(); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - extract = new Extract1555rev(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - extract = new Extract8888(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - extract = new Extract8888rev(); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - extract = new Extract1010102(); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - extract = new Extract2101010rev(); - break; - } - - myswap_bytes = psm.getUnpackSwapBytes(); - components = Mipmap.elements_per_group( format, type ); - if( psm.getUnpackRowLength() > 0 ) { - groups_per_line = psm.getUnpackRowLength(); - } else { - groups_per_line = width; - } - - // All formats except GL_BITMAP fall out trivially - if( type == GL2.GL_BITMAP ) { - int bit_offset; - int current_bit; - - rowsize = ( groups_per_line * components + 7 ) / 8; - padding = ( rowsize % psm.getUnpackAlignment() ); - if( padding != 0 ) { - rowsize += psm.getUnpackAlignment() - padding; - } - start = psm.getUnpackSkipRows() * rowsize + ( psm.getUnpackSkipPixels() * components / 8 ); - elements_per_line = width * components; - iter2 = 0; - for( i = 0; i < height; i++ ) { - iter = start; - userdata.position( iter ); // **************************************** - bit_offset = (psm.getUnpackSkipPixels() * components) % 8; - for( j = 0; j < elements_per_line; j++ ) { - // retrieve bit - if( psm.getUnpackLsbFirst() ) { - userdata.position( iter ); - current_bit = ( userdata.get() & 0x000000FF ) & ( 1 << bit_offset );//userdata[iter] & ( 1 << bit_offset ); - } else { - current_bit = ( userdata.get() & 0x000000FF ) & ( 1 << ( 7 - bit_offset ) ); - } - if( current_bit != 0 ) { - if( index_format ) { - newimage.position( iter2 ); - newimage.put( (short)1 ); - } else { - newimage.position( iter2 ); - newimage.put( (short)65535 ); - } - } else { - newimage.position( iter2 ); - newimage.put( (short)0 ); - } - bit_offset++; - if( bit_offset == 8 ) { - bit_offset = 0; - iter++; - } - iter2++; - } - start += rowsize; - } - } else { - element_size = Mipmap.bytes_per_element( type ); - group_size = element_size * components; - if( element_size == 1 ) { - myswap_bytes = false; - } - - rowsize = groups_per_line * group_size; - padding = ( rowsize % psm.getUnpackAlignment() ); - if( padding != 0 ) { - rowsize += psm.getUnpackAlignment() - padding; - } - start = psm.getUnpackSkipRows() * rowsize + psm.getUnpackSkipPixels() * group_size; - elements_per_line = width * components; - - iter2 = 0; - for( i = 0; i < height; i++ ) { - iter = start; - userdata.position( iter ); //*************************************** - for( j = 0; j < elements_per_line; j++ ) { - Type_Widget widget = new Type_Widget(); - float[] extractComponents = new float[4]; - userdata.position( iter ); - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - extract.extract( false, userdata /*userdata[iter]*/, extractComponents ); - for( k = 0; k < 3; k++ ) { - newimage.put( iter2++, (short)(extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - extract.extract( false, userdata /*userdata[iter]*/, extractComponents ); - for( k = 0; k < 3; k++ ) { - newimage.put( iter2++, (short)(extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_BYTE ): - if( index_format ) { - newimage.put( iter2++, (short)( 0x000000FF & userdata.get() ) );//userdata[iter]; - } else { - newimage.put( iter2++, (short)( 0x000000FF & userdata.get()/*userdata[iter]*/ * 257 ) ); - } - break; - case( GL2.GL_BYTE ): - if( index_format ) { - newimage.put( iter2++, userdata.get() ); //userdata[iter]; - } else { - newimage.put( iter2++, (short)(userdata.get()/*userdata[iter]*/ * 516 ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - extract.extract( myswap_bytes, userdata/*userdata[iter]*/, extractComponents ); - for( k = 0; k < 3; k++ ) { - newimage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 3; k++ ) { - newimage.put( iter2++, (short)(extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)(extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)(extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - if( myswap_bytes ) { - widget.setUB1( userdata.get() ); - widget.setUB0( userdata.get() ); - } else { - widget.setUB0( userdata.get() ); - widget.setUB1( userdata.get() ); - } - if( type == GL2.GL_SHORT ) { - if( index_format ) { - newimage.put( iter2++, widget.getS0() ); - } else { - newimage.put( iter2++, (short)(widget.getS0() * 2) ); - } - } else { - newimage.put( iter2++, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - extract.extract( myswap_bytes, userdata, extractComponents ); - for( k = 0; k < 4; k++ ) { - newimage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_INT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_FLOAT ): - if( myswap_bytes ) { - widget.setUB3( userdata.get() ); - widget.setUB2( userdata.get() ); - widget.setUB1( userdata.get() ); - widget.setUB0( userdata.get() ); - } else { - widget.setUB0( userdata.get() ); - widget.setUB1( userdata.get() ); - widget.setUB2( userdata.get() ); - widget.setUB3( userdata.get() ); - } - if( type == GL2.GL_FLOAT ) { - if( index_format ) { - newimage.put( iter2++, (short)widget.getF() ); - } else { - newimage.put( iter2++, (short)(widget.getF() * 65535 ) ); - } - } else if( type == GL2.GL_UNSIGNED_INT ) { - if( index_format ) { - newimage.put( iter2++, (short)( widget.getUI() ) ); - } else { - newimage.put( iter2++, (short)( widget.getUI() >> 16 ) ); - } - } else { - if( index_format ) { - newimage.put( iter2++, (short)( widget.getI() ) ); - } else { - newimage.put( iter2++, (short)( widget.getI() >> 15 ) ); - } - } - break; - } - iter += element_size; - } // for j - start += rowsize; - // want iter pointing at start, not within, row for assertion purposes - iter = start; - } // for i - - // iterators should be one byte past end - if( !Mipmap.isTypePackedPixel( type ) ) { - assert( iter2 == ( width * height * components ) ); - } else { - assert( iter2 == ( width * height * Mipmap.elements_per_group( format, 0 ) ) ); - } - assert( iter == ( rowsize * height + psm.getUnpackSkipRows() * rowsize + psm.getUnpackSkipPixels() * group_size ) ); - } - } - - /* - * Insert array into user's data applying all pixel store modes. - * Theinternal format is an array of unsigned shorts. - * empty_image() because it is the opposet of fill_image(). - */ - public static void empty_image( PixelStorageModes psm, int width, int height, - int format, int type, boolean index_format, - ShortBuffer oldimage, ByteBuffer userdata ) { - - int components; - int element_size; - int rowsize; - int padding; - int groups_per_line; - int group_size; - int elements_per_line; - int start; - int iter = 0; - int iter2; - int i, j, k; - boolean myswap_bytes; - - // Create a Extract interface object - Extract extract = null; - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - extract = new Extract332(); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - extract = new Extract233rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - extract = new Extract565(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - extract = new Extract565rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - extract = new Extract4444(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - extract = new Extract4444rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - extract = new Extract5551(); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - extract = new Extract1555rev(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - extract = new Extract8888(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - extract = new Extract8888rev(); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - extract = new Extract1010102(); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - extract = new Extract2101010rev(); - break; - } - - myswap_bytes = psm.getPackSwapBytes(); - components = Mipmap.elements_per_group( format, type ); - if( psm.getPackRowLength() > 0 ) { - groups_per_line = psm.getPackRowLength(); - } else { - groups_per_line = width; - } - - // all formats except GL_BITMAP fall out trivially - if( type == GL2.GL_BITMAP ) { - int bit_offset; - int current_bit; - - rowsize = ( groups_per_line * components + 7 ) / 8; - padding = ( rowsize % psm.getPackAlignment() ); - if( padding != 0 ) { - rowsize += psm.getPackAlignment() - padding; - } - start = psm.getPackSkipRows() * rowsize + psm.getPackSkipPixels() * components / 8; - elements_per_line = width * components; - iter2 = 0; - for( i = 0; i < height; i++ ) { - iter = start; - bit_offset = ( psm.getPackSkipPixels() * components ) % 8; - for( j = 0; j < elements_per_line; j++ ) { - if( index_format ) { - current_bit = oldimage.get( iter2 ) & 1; - } else { - if( oldimage.get( iter2 ) < 0 ) { // must check for negative rather than 32767 - current_bit = 1; - } else { - current_bit = 0; - } - } - - if( current_bit != 0 ) { - if( psm.getPackLsbFirst() ) { - userdata.put( iter, (byte)( ( userdata.get( iter ) | ( 1 << bit_offset ) ) ) ); - } else { - userdata.put( iter, (byte)( ( userdata.get( iter ) | ( 7 - bit_offset ) ) ) ); - } - } else { - if( psm.getPackLsbFirst() ) { - //userdata[iter] &= ~( 1 << bit_offset ); - userdata.put( iter, (byte)( ( userdata.get( iter ) & ~( 1 << bit_offset ) ) ) ); - } else { - //userdata[iter] &= ~( 1 << ( 7 - bit_offset ) ); - userdata.put( iter, (byte)( ( userdata.get( iter ) & ~( 7 - bit_offset ) ) ) ); - } - } - - bit_offset++; - if( bit_offset == 8 ) { - bit_offset = 0; - iter++; - } - iter2++; - } - start += rowsize; - } - } else { - float shoveComponents[] = new float[4]; - - element_size = Mipmap.bytes_per_element( type ); - group_size = element_size * components; - if( element_size == 1 ) { - myswap_bytes = false; - } - - rowsize = groups_per_line * group_size; - padding = ( rowsize % psm.getPackAlignment() ); - if( padding != 0 ) { - rowsize += psm.getPackAlignment() - padding; - } - start = psm.getPackSkipRows() * rowsize + psm.getPackSkipPixels() * group_size; - elements_per_line = width * components; - - iter2 = 0; - for( i = 0; i < height; i++ ) { - iter = start; - for( j = 0; j < elements_per_line; j++ ) { - Type_Widget widget = new Type_Widget(); - - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - for( k = 0; k < 3; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, userdata ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - for( k = 0; k < 3; k++ ) { - shoveComponents[k] = oldimage.get(iter2++) / 65535.0f; - } - extract.shove( shoveComponents, 0, userdata ); - break; - case( GL2.GL_UNSIGNED_BYTE ): - if( index_format ) { - //userdata[iter] = (byte)oldimage[iter2++]; - userdata.put( iter, (byte)oldimage.get(iter2++) ); - } else { - //userdata[iter] = (byte)( oldimage[iter2++] >> 8 ); - userdata.put( iter, (byte)( oldimage.get(iter2++) ) ); - } - break; - case( GL2.GL_BYTE ): - if( index_format ) { - //userdata[iter] = (byte)oldimage[iter2++]; - userdata.put( iter, (byte)oldimage.get(iter2++) ); - } else { - //userdata[iter] = (byte)( oldimage[iter2++] >> 9 ); - userdata.put( iter, (byte)( oldimage.get(iter2++) ) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - for( k = 0; k < 3; k++ ) { - shoveComponents[k] = oldimage.get(iter2++) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1,widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter+1] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - for( k = 0; k < 3; k++ ) { - shoveComponents[k] = oldimage.get(iter2++) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter+1] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get(iter2++) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter+1] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter+1] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter+1] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter+1] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - if( type == GL2.GL_SHORT ) { - if( index_format ) { - widget.setS0( oldimage.get( iter2++ ) ); - } else { - widget.setS0( (short)(oldimage.get( iter2++ ) >> 1) ); - } - } else { - widget.setUS0( oldimage.get( iter2++ ) ); - } - if( myswap_bytes ) { - //userdata[iter] = widget.getUB1(); - //userdata[iter+1] = widget.getUB0(); - userdata.put( iter, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB0() ); - } else { - //userdata[iter] = widget.getUB0(); - //userdata[iter] = widget.getUB1(); - userdata.put( iter, widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter+3] = widget.getUB0(); - //userdata[iter+2] = widget.getUB1(); - //userdata[iter+1] = widget.getUB2(); - //userdata[iter ] = widget.getUB3(); - userdata.put( iter + 3, widget.getUB0() ); - userdata.put( iter + 2, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB2() ); - userdata.put( iter , widget.getUB3() ); - } else { - userdata.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter+3] = widget.getUB0(); - //userdata[iter+2] = widget.getUB1(); - //userdata[iter+1] = widget.getUB2(); - //userdata[iter ] = widget.getUB3(); - userdata.put( iter + 3, widget.getUB0() ); - userdata.put( iter + 2, widget.getUB1() ); - userdata.put( iter + 2, widget.getUB2() ); - userdata.put( iter , widget.getUB3() ); - } else { - userdata.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter+3] = widget.getUB0(); - //userdata[iter+2] = widget.getUB1(); - //userdata[iter+1] = widget.getUB2(); - //userdata[iter ] = widget.getUB3(); - userdata.put( iter + 3, widget.getUB0() ); - userdata.put( iter + 2, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB2() ); - userdata.put( iter , widget.getUB3() ); - } else { - userdata.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldimage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswap_bytes ) { - //userdata[iter+3] = widget.getUB0(); - //userdata[iter+2] = widget.getUB1(); - //userdata[iter+1] = widget.getUB2(); - //userdata[iter ] = widget.getUB3(); - userdata.put( iter + 3, widget.getUB0() ); - userdata.put( iter + 2, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB2() ); - userdata.put( iter , widget.getUB3() ); - } else { - userdata.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_INT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_FLOAT ): - if( type == GL2.GL_FLOAT ) { - if( index_format ) { - widget.setF( oldimage.get( iter2++ ) ); - } else { - widget.setF( oldimage.get( iter2++ ) / 65535.0f ); - } - } else if( type == GL2.GL_UNSIGNED_INT ) { - if( index_format ) { - widget.setUI( oldimage.get( iter2++ ) ); - } else { - widget.setUI( oldimage.get( iter2++ ) * 65537 ); - } - } else { - if( index_format ) { - widget.setI( oldimage.get( iter2++ ) ); - } else { - widget.setI( (oldimage.get( iter2++ ) * 65537) / 2 ); - } - } - if( myswap_bytes ) { - userdata.put( iter + 3, widget.getUB0() ); - userdata.put( iter + 2, widget.getUB1() ); - userdata.put( iter + 1, widget.getUB2() ); - userdata.put( iter , widget.getUB3() ); - } else { - userdata.put( iter , widget.getUB0() ); - userdata.put( iter + 1, widget.getUB1() ); - userdata.put( iter + 2, widget.getUB2() ); - userdata.put( iter + 3, widget.getUB3() ); - } - break; - } - iter += element_size; - } // for j - start += rowsize; - // want iter pointing at start, not within, row for assertion purposes - iter = start; - } // for i - // iterators should be one byte past end - if( !Mipmap.isTypePackedPixel( type ) ) { - assert( iter2 == width * height * components ); - } else { - assert( iter2 == width * height * Mipmap.elements_per_group( format, 0 ) ); - } - assert( iter == rowsize * height + psm.getPackSkipRows() * rowsize + psm.getPackSkipPixels() * group_size ); - } - } - - public static void fillImage3D( PixelStorageModes psm, int width, int height, - int depth, int format, int type, boolean indexFormat, ByteBuffer userImage, - ShortBuffer newImage ) { - boolean myswapBytes; - int components; - int groupsPerLine; - int elementSize; - int groupSize; - int rowSize; - int padding; - int elementsPerLine; - int rowsPerImage; - int imageSize; - int start, rowStart; - int iter = 0; - int iter2 = 0; - int ww, hh, dd, k; - Type_Widget widget = new Type_Widget(); - float extractComponents[] = new float[4]; - - // Create a Extract interface object - Extract extract = null; - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - extract = new Extract332(); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - extract = new Extract233rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - extract = new Extract565(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - extract = new Extract565rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - extract = new Extract4444(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - extract = new Extract4444rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - extract = new Extract5551(); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - extract = new Extract1555rev(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - extract = new Extract8888(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - extract = new Extract8888rev(); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - extract = new Extract1010102(); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - extract = new Extract2101010rev(); - break; - } - - myswapBytes = psm.getUnpackSwapBytes(); - components = Mipmap.elements_per_group( format, type ); - if( psm.getUnpackRowLength() > 0 ) { - groupsPerLine = psm.getUnpackRowLength(); - } else { - groupsPerLine = width; - } - elementSize = Mipmap.bytes_per_element( type ); - groupSize = elementSize * components; - if( elementSize == 1 ) { - myswapBytes = false; - } - - // 3dstuff begin - if( psm.getUnpackImageHeight() > 0 ) { - rowsPerImage = psm.getUnpackImageHeight(); - } else { - rowsPerImage = height; - } - // 3dstuff end - - rowSize = groupsPerLine * groupSize; - padding = rowSize % psm.getUnpackAlignment(); - if( padding != 0 ) { - rowSize += psm.getUnpackAlignment() - padding; - } - - imageSize = rowsPerImage * rowSize; // 3dstuff - - start = psm.getUnpackSkipRows() * rowSize + - psm.getUnpackSkipPixels() * groupSize + - psm.getUnpackSkipImages() * imageSize; - elementsPerLine = width * components; - - iter2 = 0; - for( dd = 0; dd < depth; dd++ ) { - rowStart = start; - for( hh = 0; hh < height; hh++ ) { - iter = rowStart; - for( ww = 0; ww < elementsPerLine; ww++ ) { - - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - if( indexFormat ) { - newImage.put( iter2++, (short)(0x000000FF & userImage.get( iter ) ) ); - } else { - newImage.put( iter2++, (short)((0x000000FF & userImage.get( iter ) ) * 257 ) ); - } - break; - case( GL2.GL_BYTE ): - if( indexFormat ) { - newImage.put( iter2++, userImage.get( iter ) ); - } else { - newImage.put( iter2++, (short)(userImage.get( iter ) * 516 ) ); - } - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - userImage.position( iter ); - extract.extract( false, userImage, extractComponents ); - for( k = 0; k < 3; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - userImage.position( iter ); - extract.extract( false, userImage, extractComponents ); - for( k = 0; k < 3; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)(extractComponents[k] * 65535) ); - } - break; - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - if( myswapBytes ) { - widget.setUB0( userImage.get( iter + 1 ) ); - widget.setUB1( userImage.get( iter ) ); - } else { - widget.setUB0( userImage.get( iter ) ); - widget.setUB1( userImage.get( iter + 1 ) ); - } - if( type == GL2.GL_SHORT ) { - if( indexFormat ) { - newImage.put( iter2++, widget.getUS0() ); - } else { - newImage.put( iter2++, (short)(widget.getUS0() * 2) ); - } - } else { - newImage.put( iter2++, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - userImage.position( iter ); - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - extract.extract( myswapBytes, userImage, extractComponents ); - for( k = 0; k < 4; k++ ) { - newImage.put( iter2++, (short)( extractComponents[k] * 65535 ) ); - } - break; - case( GL2.GL_INT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_FLOAT ): - if( myswapBytes ) { - widget.setUB0( userImage.get( iter + 3 ) ); - widget.setUB1( userImage.get( iter + 2 ) ); - widget.setUB2( userImage.get( iter + 1 ) ); - widget.setUB3( userImage.get( iter ) ); - } else { - widget.setUB0( userImage.get( iter ) ); - widget.setUB1( userImage.get( iter + 1 ) ); - widget.setUB2( userImage.get( iter + 2 ) ); - widget.setUB3( userImage.get( iter + 3 ) ); - } - if( type == GL2.GL_FLOAT ) { - if( indexFormat ) { - newImage.put( iter2++, (short)widget.getF() ); - } else { - newImage.put( iter2++, (short)( widget.getF() * 65535.0f ) ); - } - } else if( type == GL2.GL_UNSIGNED_INT ) { - if( indexFormat ) { - newImage.put( iter2++, (short)widget.getUI() ); - } else { - newImage.put( iter2++, (short)(widget.getUI() >> 16) ); - } - } else { - if( indexFormat ) { - newImage.put( iter2++, (short)widget.getI() ); - } else { - newImage.put( iter2++, (short)(widget.getI() >> 15) ); - } - } - break; - default: - assert( false ); - } - iter += elementSize; - } // for ww - rowStart += rowSize; - iter = rowStart; // for assert - } // for hh - start += imageSize; - }// for dd - - // iterators should be one byte past end - if( !Mipmap.isTypePackedPixel( type ) ) { - assert( iter2 == width * height * depth * components ); - } else { - assert( iter2 == width * height * depth * Mipmap.elements_per_group( format, 0 ) ); - } - assert( iter == rowSize * height * depth + psm.getUnpackSkipRows() * rowSize + - psm.getUnpackSkipPixels() * groupSize + - psm.getUnpackSkipImages() * imageSize ); - } - - public static void emptyImage3D( PixelStorageModes psm, int width, int height, int depth, - int format, int type, boolean indexFormat, ShortBuffer oldImage, ByteBuffer userImage ) { - boolean myswapBytes; - int components; - int groupsPerLine; - int elementSize; - int groupSize; - int rowSize; - int padding; - int start, rowStart, iter; - int elementsPerLine; - int iter2; - int ii, jj, dd, k; - int rowsPerImage; - int imageSize; - Type_Widget widget = new Type_Widget(); - float[] shoveComponents = new float[4]; - - // Create a Extract interface object - Extract extract = null; - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - extract = new Extract332(); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - extract = new Extract233rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - extract = new Extract565(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - extract = new Extract565rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - extract = new Extract4444(); - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - extract = new Extract4444rev(); - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - extract = new Extract5551(); - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - extract = new Extract1555rev(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - extract = new Extract8888(); - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - extract = new Extract8888rev(); - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - extract = new Extract1010102(); - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - extract = new Extract2101010rev(); - break; - } - - iter = 0; - - myswapBytes = psm.getPackSwapBytes(); - components = Mipmap.elements_per_group( format, type ); - if( psm.getPackRowLength() > 0 ) { - groupsPerLine = psm.getPackRowLength(); - } else { - groupsPerLine = width; - } - - elementSize = Mipmap.bytes_per_element( type ); - groupSize = elementSize * components; - if( elementSize == 1 ) { - myswapBytes = false; - } - - // 3dstuff begin - if( psm.getPackImageHeight() > 0 ) { - rowsPerImage = psm.getPackImageHeight(); - } else { - rowsPerImage = height; - } - - // 3dstuff end - - rowSize = groupsPerLine * groupSize; - padding = rowSize % psm.getPackAlignment(); - if( padding != 0 ) { - rowSize += psm.getPackAlignment() - padding; - } - - imageSize = rowsPerImage * rowSize; - - start = psm.getPackSkipRows() * rowSize + - psm.getPackSkipPixels() * groupSize + - psm.getPackSkipImages() * imageSize; - elementsPerLine = width * components; - - iter2 = 0; - for( dd = 0; dd < depth; dd++ ) { - rowStart = start; - - for( ii = 0; ii < height; ii++ ) { - iter = rowStart; - - for( jj = 0; jj < elementsPerLine; jj++ ) { - - switch( type ) { - case( GL2.GL_UNSIGNED_BYTE ): - if( indexFormat ) { - userImage.put( iter, (byte)(oldImage.get( iter2++ ) ) ); - } else { - userImage.put( iter, (byte)(oldImage.get( iter2++ ) >> 8 ) ); - } - break; - case( GL2.GL_BYTE ): - if( indexFormat ) { - userImage.put( iter, (byte)(oldImage.get(iter2++) ) ); - } else { - userImage.put( iter, (byte)(oldImage.get(iter2++) >> 9) ); - } - break; - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - for( k = 0; k < 3; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, userImage ); - break; - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - for( k = 0; k < 3; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, userImage ); - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.putShort( iter, widget.getUB1() ); - userImage.putShort( iter + 1, widget.getUB0() ); - } else { - userImage.putShort( iter, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB0() ); - } else { - userImage.putShort( iter, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB0() ); - } else { - userImage.putShort( iter, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB0() ); - } else { - userImage.putShort( iter, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB0() ); - } else { - userImage.putShort( iter, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB0() ); - } else { - userImage.putShort( iter, widget.getUS0() ); - } - break; - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_SHORT ): - if( type == GL2.GL_SHORT ) { - if( indexFormat ) { - widget.setS0( (short)oldImage.get( iter2++ ) ); - } else { - widget.setS0( (short)(oldImage.get( iter2++ ) >> 1) ); - } - } else { - widget.setUS0( (short)oldImage.get( iter2++ ) ); - } - if( myswapBytes ) { - userImage.put( iter, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB0() ); - } else { - userImage.put( iter, widget.getUB0() ); - userImage.put( iter + 1, widget.getUB1() ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter + 3, widget.getUB0() ); - userImage.put( iter + 2, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB2() ); - userImage.put( iter , widget.getUB3() ); - } else { - userImage.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter + 3, widget.getUB0() ); - userImage.put( iter + 2, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB2() ); - userImage.put( iter , widget.getUB3() ); - } else { - userImage.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter + 3, widget.getUB0() ); - userImage.put( iter + 2, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB2() ); - userImage.put( iter ,widget.getUB3() ); - } else { - userImage.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - for( k = 0; k < 4; k++ ) { - shoveComponents[k] = oldImage.get( iter2++ ) / 65535.0f; - } - extract.shove( shoveComponents, 0, widget.getBuffer() ); - if( myswapBytes ) { - userImage.put( iter + 3, widget.getUB0() ); - userImage.put( iter + 2, widget.getUB2() ); - userImage.put( iter + 1, widget.getUB1() ); - userImage.put( iter , widget.getUB0() ); - } else { - userImage.putInt( iter, widget.getUI() ); - } - break; - case( GL2.GL_INT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_FLOAT ): - if( type == GL2.GL_FLOAT ) { - if( indexFormat ) { - widget.setF( oldImage.get( iter2++ ) ); - } else { - widget.setF( oldImage.get( iter2++ ) / 65535.0f ); - } - } else if( type == GL2.GL_UNSIGNED_INT ) { - if( indexFormat ) { - widget.setUI( oldImage.get( iter2++ ) ); - } else { - widget.setUI( oldImage.get( iter2++ ) * 65537 ); - } - } else { - if( indexFormat ) { - widget.setI( oldImage.get( iter2++ ) ); - } else { - widget.setI( ( oldImage.get( iter2++ ) * 65535 ) / 2 ); - } - } - if( myswapBytes ) { - userImage.put( iter + 3, widget.getUB0() ); - userImage.put( iter + 2, widget.getUB1() ); - userImage.put( iter + 1, widget.getUB2() ); - userImage.put( iter , widget.getUB3() ); - } else { - userImage.put( iter , widget.getUB0() ); - userImage.put( iter + 1, widget.getUB1() ); - userImage.put( iter + 2, widget.getUB2() ); - userImage.put( iter + 3, widget.getUB3() ); - } - break; - default: - assert( false ); - } - - iter += elementSize; - } // for jj - rowStart += rowSize; - } // for ii - start += imageSize; - } // for dd - - if( !Mipmap.isTypePackedPixel( type ) ) { - assert( iter2 == width * height * depth * components ); - } else { - assert( iter2 == width * height * depth * Mipmap.elements_per_group( format, 0 ) ); - } - assert( iter == rowSize * height * depth + - psm.getUnpackSkipRows() * rowSize + - psm.getUnpackSkipPixels() * groupSize + - psm.getUnpackSkipImages() * imageSize ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Mipmap.java b/src/classes/com/sun/opengl/impl/mipmap/Mipmap.java deleted file mode 100644 index 6f247940d..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Mipmap.java +++ /dev/null @@ -1,866 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import javax.media.opengl.GL; -import javax.media.opengl.GL2; -import javax.media.opengl.glu.GLU; -import javax.media.opengl.GLException; -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Mipmap { - - /** Creates a new instance of Mipmap */ - public Mipmap() { - } - - public static int computeLog( int value ) { - int i = 0; - // Error - if( value == 0 ) { - return( -1 ); - } - for( ;; ) { - if( (value & 1) >= 1 ) { - if( value != 1 ) { - return( -1 ); - } - return( i ); - } - value = value >> 1; - i++; - } - } - - /* Compute the nearest power of 2 number. This algorithm is a little strange - * but it works quite well. - */ - public static int nearestPower( int value ) { - int i = 1; - // Error! - if( value == 0 ) { - return( -1 ); - } - for( ;; ) { - if( value == 1 ) { - return( i ); - } else if( value == 3 ) { - return( i * 4 ); - } - value = value >> 1; - i *= 2; - } - } - - public static short GLU_SWAP_2_BYTES( short s ) { - byte b = 0; - b = (byte)( s >>> 8 ); - s = (short)( s << 8 ); - s = (short)( s | (0x00FF & b) ); - return( s ); - } - - public static int GLU_SWAP_4_BYTES( int i ) { - int t = i << 24; - t |= 0x00FF0000 & ( i << 8 ); - t |= 0x0000FF00 & ( i >>> 8 ); - t |= 0x000000FF & ( i >>> 24 ); - return( t ); - } - - public static float GLU_SWAP_4_BYTES( float f ) { - int i = Float.floatToRawIntBits( f ); - float temp = Float.intBitsToFloat( i ); - return( temp ); - } - - public static int checkMipmapArgs( int internalFormat, int format, int type ) { - if( !legalFormat( format ) || !legalType( type ) ) { - return( GLU.GLU_INVALID_ENUM ); - } - if( format == GL2.GL_STENCIL_INDEX ) { - return( GLU.GLU_INVALID_ENUM ); - } - if( !isLegalFormatForPackedPixelType( format, type ) ) { - return( GLU.GLU_INVALID_OPERATION ); - } - return( 0 ); - } - - public static boolean legalFormat( int format ) { - switch( format ) { - case( GL2.GL_COLOR_INDEX ): - case( GL2.GL_STENCIL_INDEX ): - case( GL2.GL_DEPTH_COMPONENT ): - case( GL2.GL_RED ): - case( GL2.GL_GREEN ): - case( GL2.GL_BLUE ): - case( GL2.GL_ALPHA ): - case( GL2.GL_RGB ): - case( GL2.GL_RGBA ): - case( GL2.GL_LUMINANCE ): - case( GL2.GL_LUMINANCE_ALPHA ): - case( GL2.GL_BGR ): - case( GL2.GL_BGRA ): - return( true ); - default: - return( false ); - } - } - - public static boolean legalType( int type ) { - switch( type ) { - case( GL2.GL_BITMAP ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_INT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_FLOAT ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - return( true ); - default: - return( false ); - } - } - - public static boolean isTypePackedPixel( int type ) { - assert( legalType( type ) ); - - if( type == GL2.GL_UNSIGNED_BYTE_3_3_2 || - type == GL2.GL_UNSIGNED_BYTE_2_3_3_REV || - type == GL2.GL_UNSIGNED_SHORT_5_6_5 || - type == GL2.GL_UNSIGNED_SHORT_5_6_5_REV || - type == GL2.GL_UNSIGNED_SHORT_4_4_4_4 || - type == GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV || - type == GL2.GL_UNSIGNED_SHORT_5_5_5_1 || - type == GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV || - type == GL2.GL_UNSIGNED_INT_8_8_8_8 || - type == GL2.GL_UNSIGNED_INT_8_8_8_8_REV || - type == GL2.GL_UNSIGNED_INT_10_10_10_2 || - type == GL2.GL_UNSIGNED_INT_2_10_10_10_REV ) { - return( true ); - } - return( false ); - } - - public static boolean isLegalFormatForPackedPixelType( int format, int type ) { - // if not a packed pixel type then return true - if( isTypePackedPixel( type ) ) { - return( true ); - } - - // 3_3_2/2_3_3_REV & 5_6_5/5_6_5_REV are only compatible with RGB - if( (type == GL2.GL_UNSIGNED_BYTE_3_3_2 || type == GL2.GL_UNSIGNED_BYTE_2_3_3_REV || - type == GL2.GL_UNSIGNED_SHORT_5_6_5 || type == GL2.GL_UNSIGNED_SHORT_5_6_5_REV ) - & format != GL2.GL_RGB ) { - return( false ); - } - - // 4_4_4_4/4_4_4_4_REV & 5_5_5_1/1_5_5_5_REV & 8_8_8_8/8_8_8_8_REV & - // 10_10_10_2/2_10_10_10_REV are only campatible with RGBA, BGRA & ARGB_EXT - if( ( type == GL2.GL_UNSIGNED_SHORT_4_4_4_4 || - type == GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV || - type == GL2.GL_UNSIGNED_SHORT_5_5_5_1 || - type == GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV || - type == GL2.GL_UNSIGNED_INT_8_8_8_8 || - type == GL2.GL_UNSIGNED_INT_8_8_8_8_REV || - type == GL2.GL_UNSIGNED_INT_10_10_10_2 || - type == GL2.GL_UNSIGNED_INT_2_10_10_10_REV ) && - (format != GL2.GL_RGBA && format != GL2.GL_BGRA) ) { - return( false ); - } - return( true ); - } - - public static boolean isLegalLevels( int userLevel, int baseLevel, int maxLevel, - int totalLevels ) { - if( (baseLevel < 0) || (baseLevel < userLevel) || (maxLevel < baseLevel) || - (totalLevels < maxLevel) ) { - return( false ); - } - return( true ); - } - - /* Given user requested textures size, determine if it fits. If it doesn't then - * halve both sides and make the determination again until it does fit ( for - * IR only ). - * Note that proxy textures are not implemented in RE* even though they - * advertise the texture extension. - * Note that proxy textures are implemented but not according to spec in IMPACT* - */ - public static void closestFit( GL gl, int target, int width, int height, int internalFormat, - int format, int type, int[] newWidth, int[] newHeight ) { - // Use proxy textures if OpenGL version >= 1.1 - if( Double.parseDouble( gl.glGetString( GL.GL_VERSION ).trim().substring( 0, 3 ) ) >= 1.1 ) { - int widthPowerOf2 = nearestPower( width ); - int heightPowerOf2 = nearestPower( height ); - int[] proxyWidth = new int[1]; - boolean noProxyTextures = false; - - // Some drivers (in particular, ATI's) seem to set a GL error - // when proxy textures are used even though this is in violation - // of the spec. Guard against this and interactions with the - // DebugGL by watching for GLException. - try { - do { - // compute level 1 width & height, clamping each at 1 - int widthAtLevelOne = ( ( width > 1 ) ? (widthPowerOf2 >> 1) : widthPowerOf2 ); - int heightAtLevelOne = ( ( height > 1 ) ? (heightPowerOf2 >> 1) : heightPowerOf2 ); - int proxyTarget; - - assert( widthAtLevelOne > 0 ); - assert( heightAtLevelOne > 0 ); - - // does width x height at level 1 & all their mipmaps fit? - if( target == GL2.GL_TEXTURE_2D || target == GL2.GL_PROXY_TEXTURE_2D ) { - proxyTarget = GL2.GL_PROXY_TEXTURE_2D; - gl.glTexImage2D( proxyTarget, 1, internalFormat, widthAtLevelOne, - heightAtLevelOne, 0, format, type, null ); - } else if( (target == GL2.GL_TEXTURE_CUBE_MAP_POSITIVE_X) || - (target == GL2.GL_TEXTURE_CUBE_MAP_NEGATIVE_X) || - (target == GL2.GL_TEXTURE_CUBE_MAP_POSITIVE_Y) || - (target == GL2.GL_TEXTURE_CUBE_MAP_NEGATIVE_Y) || - (target == GL2.GL_TEXTURE_CUBE_MAP_POSITIVE_Z) || - (target == GL2.GL_TEXTURE_CUBE_MAP_NEGATIVE_Z) ) { - proxyTarget = GL2.GL_PROXY_TEXTURE_CUBE_MAP; - gl.glTexImage2D( proxyTarget, 1, internalFormat, widthAtLevelOne, - heightAtLevelOne, 0, format, type, null ); - } else { - assert( target == GL2.GL_TEXTURE_1D || target == GL2.GL_PROXY_TEXTURE_1D ); - proxyTarget = GL2.GL_PROXY_TEXTURE_1D; - gl.getGL2().glTexImage1D( proxyTarget, 1, internalFormat, widthAtLevelOne, - 0, format, type, null ); - } - if(gl.isGL2()) { - gl.getGL2().glGetTexLevelParameteriv( proxyTarget, 1, GL2.GL_TEXTURE_WIDTH, proxyWidth, 0 ); - } else { - proxyWidth[0] = 0; - } - // does it fit? - if( proxyWidth[0] == 0 ) { // nope, so try again with theses sizes - if( widthPowerOf2 == 1 && heightPowerOf2 == 1 ) { - /* A 1x1 texture couldn't fit for some reason so break out. This - * should never happen. But things happen. The disadvantage with - * this if-statement is that we will never be aware of when this - * happens since it will silently branch out. - */ - noProxyTextures = true; - break; - } - widthPowerOf2 = widthAtLevelOne; - heightPowerOf2 = heightAtLevelOne; - } - // else it does fit - } while( proxyWidth[0] == 0 ); - } catch (GLException e) { - noProxyTextures = true; - } - // loop must terminate - // return the width & height at level 0 that fits - if( !noProxyTextures ) { - newWidth[0] = widthPowerOf2; - newHeight[0] = heightPowerOf2; - return; - } - } - int[] maxsize = new int[1]; - gl.glGetIntegerv( GL2.GL_MAX_TEXTURE_SIZE, maxsize , 0); - // clamp user's texture sizes to maximum sizes, if necessary - newWidth[0] = nearestPower( width ); - if( newWidth[0] > maxsize[0] ) { - newWidth[0] = maxsize[0]; - } - newHeight[0] = nearestPower( height ); - if( newHeight[0] > maxsize[0] ) { - newHeight[0] = maxsize[0]; - } - } - - public static void closestFit3D( GL gl, int target, int width, int height, int depth, - int internalFormat, int format, int type, int[] newWidth, int[] newHeight, - int[] newDepth ) { - int widthPowerOf2 = nearestPower( width ); - int heightPowerOf2 = nearestPower( height ); - int depthPowerOf2 = nearestPower( depth ); - int[] proxyWidth = new int[1]; - - do { - // compute level 1 width & height & depth, clamping each at 1 - int widthAtLevelOne = (widthPowerOf2 > 1) ? widthPowerOf2 >> 1 : widthPowerOf2; - int heightAtLevelOne = (heightPowerOf2 > 1) ? heightPowerOf2 >> 1 : heightPowerOf2; - int depthAtLevelOne = (depthPowerOf2 > 1) ? depthPowerOf2 >> 1 : depthPowerOf2; - int proxyTarget = 0; - assert( widthAtLevelOne > 0 ); - assert( heightAtLevelOne > 0 ); - assert( depthAtLevelOne > 0 ); - - // does width x height x depth at level 1 & all their mipmaps fit? - if( target == GL2.GL_TEXTURE_3D || target == GL2.GL_PROXY_TEXTURE_3D ) { - proxyTarget = GL2.GL_PROXY_TEXTURE_3D; - gl.getGL2().glTexImage3D( proxyTarget, 1, internalFormat, widthAtLevelOne, - heightAtLevelOne, depthAtLevelOne, 0, format, type, null ); - } - if(gl.isGL2()) { - gl.getGL2().glGetTexLevelParameteriv( proxyTarget, 1, GL2.GL_TEXTURE_WIDTH, proxyWidth, 0 ); - } else { - proxyWidth[0] = 0; - } - // does it fit - if( proxyWidth[0] == 0 ) { - if( widthPowerOf2 == 1 && heightPowerOf2 == 1 && depthPowerOf2 == 1 ) { - newWidth[0] = newHeight[0] = newDepth[0] = 1; - return; - } - widthPowerOf2 = widthAtLevelOne; - heightPowerOf2 = heightAtLevelOne; - depthPowerOf2 = depthAtLevelOne; - } - } while( proxyWidth[0] == 0 ); - // loop must terminate - - // return the width & height at level 0 that fits - newWidth[0] = widthPowerOf2; - newHeight[0] = heightPowerOf2; - newDepth[0] = depthPowerOf2; - } - - public static int elements_per_group( int format, int type ) { - // Return the number of elements per grtoup of a specified gromat - - // If the type is packedpixels then answer is 1 - if( type == GL2.GL_UNSIGNED_BYTE_3_3_2 || - type == GL2.GL_UNSIGNED_BYTE_2_3_3_REV || - type == GL2.GL_UNSIGNED_SHORT_5_6_5 || - type == GL2.GL_UNSIGNED_SHORT_5_6_5_REV || - type == GL2.GL_UNSIGNED_SHORT_4_4_4_4 || - type == GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV || - type == GL2.GL_UNSIGNED_SHORT_5_5_5_1 || - type == GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV || - type == GL2.GL_UNSIGNED_INT_8_8_8_8 || - type == GL2.GL_UNSIGNED_INT_8_8_8_8_REV || - type == GL2.GL_UNSIGNED_INT_10_10_10_2 || - type == GL2.GL_UNSIGNED_INT_2_10_10_10_REV ) { - return( 1 ); - } - - // Types are not packed pixels so get elements per group - switch( format ) { - case( GL2.GL_RGB ): - case( GL2.GL_BGR ): - return( 3 ); - case( GL2.GL_LUMINANCE_ALPHA ): - return( 2 ); - case( GL2.GL_RGBA ): - case( GL2.GL_BGRA ): - return( 4 ); - default: - return( 1 ); - } - } - - public static int bytes_per_element( int type ) { - // return the number of bytes per element, based on the element type - - switch( type ) { - case( GL2.GL_BITMAP ): - case( GL2.GL_BYTE ): - case( GL2.GL_UNSIGNED_BYTE ): - case( GL2.GL_UNSIGNED_BYTE_3_3_2 ): - case( GL2.GL_UNSIGNED_BYTE_2_3_3_REV ): - return( 1 ); - case( GL2.GL_SHORT ): - case( GL2.GL_UNSIGNED_SHORT ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5 ): - case( GL2.GL_UNSIGNED_SHORT_5_6_5_REV ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4 ): - case( GL2.GL_UNSIGNED_SHORT_4_4_4_4_REV ): - case( GL2.GL_UNSIGNED_SHORT_5_5_5_1 ): - case( GL2.GL_UNSIGNED_SHORT_1_5_5_5_REV ): - return( 2 ); - case( GL2.GL_INT ): - case( GL2.GL_UNSIGNED_INT ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8 ): - case( GL2.GL_UNSIGNED_INT_8_8_8_8_REV ): - case( GL2.GL_UNSIGNED_INT_10_10_10_2 ): - case( GL2.GL_UNSIGNED_INT_2_10_10_10_REV ): - case( GL2.GL_FLOAT ): - return( 4 ); - default: - return( 4 ); - } - } - - public static boolean is_index( int format ) { - return( format == GL2.GL_COLOR_INDEX || format == GL2.GL_STENCIL_INDEX ); - } - - /* Compute memory required for internal packed array of data of given type and format. */ - - public static int image_size( int width, int height, int format, int type ) { - int bytes_per_row; - int components; - - assert( width > 0 ); - assert( height > 0 ); - components = elements_per_group( format, type ); - if( type == GL2.GL_BITMAP ) { - bytes_per_row = (width + 7) / 8; - } else { - bytes_per_row = bytes_per_element( type ) * width; - } - return( bytes_per_row * height * components ); - } - - public static int imageSize3D( int width, int height, int depth, int format, int type ) { - int components = elements_per_group( format, type ); - int bytes_per_row = bytes_per_element( type ) * width; - - assert( width > 0 && height > 0 && depth > 0 ); - assert( type != GL2.GL_BITMAP ); - - return( bytes_per_row * height * depth * components ); - } - - public static void retrieveStoreModes( GL gl, PixelStorageModes psm ) { - int[] a = new int[1]; - gl.glGetIntegerv( GL2.GL_UNPACK_ALIGNMENT, a, 0); - psm.setUnpackAlignment( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_ROW_LENGTH, a, 0); - psm.setUnpackRowLength( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_SKIP_ROWS, a, 0); - psm.setUnpackSkipRows( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_SKIP_PIXELS, a, 0); - psm.setUnpackSkipPixels( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_LSB_FIRST, a, 0); - psm.setUnpackLsbFirst( ( a[0] == 1 ) ); - gl.glGetIntegerv( GL2.GL_UNPACK_SWAP_BYTES, a, 0); - psm.setUnpackSwapBytes( ( a[0] == 1 ) ); - - gl.glGetIntegerv( GL2.GL_PACK_ALIGNMENT, a, 0); - psm.setPackAlignment( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_ROW_LENGTH, a, 0); - psm.setPackRowLength( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_SKIP_ROWS, a, 0); - psm.setPackSkipRows( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_SKIP_PIXELS, a, 0); - psm.setPackSkipPixels( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_LSB_FIRST, a, 0); - psm.setPackLsbFirst( ( a[0] == 1 ) ); - gl.glGetIntegerv( GL2.GL_PACK_SWAP_BYTES, a, 0); - psm.setPackSwapBytes( ( a[0] == 1 ) ); - } - - public static void retrieveStoreModes3D( GL gl, PixelStorageModes psm ) { - int[] a = new int[1]; - gl.glGetIntegerv( GL2.GL_UNPACK_ALIGNMENT, a, 0); - psm.setUnpackAlignment( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_ROW_LENGTH, a, 0); - psm.setUnpackRowLength( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_SKIP_ROWS, a, 0); - psm.setUnpackSkipRows( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_SKIP_PIXELS, a, 0); - psm.setUnpackSkipPixels( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_LSB_FIRST, a, 0); - psm.setUnpackLsbFirst( ( a[0] == 1 ) ); - gl.glGetIntegerv( GL2.GL_UNPACK_SWAP_BYTES, a, 0); - psm.setUnpackSwapBytes( ( a[0] == 1 ) ); - gl.glGetIntegerv( GL2.GL_UNPACK_SKIP_IMAGES, a, 0); - psm.setUnpackSkipImages( a[0] ); - gl.glGetIntegerv( GL2.GL_UNPACK_IMAGE_HEIGHT, a, 0); - psm.setUnpackImageHeight( a[0] ); - - gl.glGetIntegerv( GL2.GL_PACK_ALIGNMENT, a, 0); - psm.setPackAlignment( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_ROW_LENGTH, a, 0); - psm.setPackRowLength( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_SKIP_ROWS, a, 0); - psm.setPackSkipRows( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_SKIP_PIXELS, a, 0 ); - psm.setPackSkipPixels( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_LSB_FIRST, a, 0 ); - psm.setPackLsbFirst( ( a[0] == 1 ) ); - gl.glGetIntegerv( GL2.GL_PACK_SWAP_BYTES, a, 0 ); - psm.setPackSwapBytes( ( a[0] == 1 ) ); - gl.glGetIntegerv( GL2.GL_PACK_SKIP_IMAGES, a, 0 ); - psm.setPackSkipImages( a[0] ); - gl.glGetIntegerv( GL2.GL_PACK_IMAGE_HEIGHT, a, 0 ); - psm.setPackImageHeight( a[0] ); - } - - public static int gluScaleImage( GL gl, int format, int widthin, int heightin, - int typein, ByteBuffer datain, int widthout, int heightout, - int typeout, ByteBuffer dataout ) { - int datainPos = datain.position(); - int dataoutPos = dataout.position(); - try { - - int components; - ByteBuffer beforeimage; - ByteBuffer afterimage; - PixelStorageModes psm = new PixelStorageModes(); - - if( (widthin == 0) || (heightin == 0) || (widthout == 0) || (heightout == 0) ) { - return( 0 ); - } - if( (widthin < 0) || (heightin < 0) || (widthout < 0) || (heightout < 0) ) { - return( GLU.GLU_INVALID_VALUE ); - } - if( !legalFormat( format ) || !legalType( typein ) || !legalType( typeout ) ) { - return( GLU.GLU_INVALID_ENUM ); - } - if( !isLegalFormatForPackedPixelType( format, typein ) ) { - return( GLU.GLU_INVALID_OPERATION ); - } - if( !isLegalFormatForPackedPixelType( format, typeout ) ) { - return( GLU.GLU_INVALID_OPERATION ); - } - beforeimage = ByteBuffer.allocateDirect( image_size( widthin, heightin, format, GL2.GL_UNSIGNED_SHORT ) ).order( ByteOrder.nativeOrder() ); - afterimage = ByteBuffer.allocateDirect( image_size( widthout, heightout, format, GL2.GL_UNSIGNED_SHORT ) ).order( ByteOrder.nativeOrder() ); - if( beforeimage == null || afterimage == null ) { - return( GLU.GLU_OUT_OF_MEMORY ); - } - - retrieveStoreModes( gl, psm ); - Image.fill_image( psm, widthin, heightin, format, typein, is_index( format ), datain, beforeimage.asShortBuffer() ); - components = elements_per_group( format, 0 ); - ScaleInternal.scale_internal( components, widthin, heightin, beforeimage.asShortBuffer(), widthout, heightout, afterimage.asShortBuffer() ); - Image.empty_image( psm, widthout, heightout, format, typeout, is_index( format ), afterimage.asShortBuffer(), dataout ); - - return( 0 ); - } finally { - datain.position(datainPos); - dataout.position(dataoutPos); - } - } - - public static int gluBuild1DMipmapLevels( GL gl, int target, int internalFormat, - int width, int format, int type, int userLevel, int baseLevel, - int maxLevel, ByteBuffer data ) { - int dataPos = data.position(); - try { - - int levels; - - int rc = checkMipmapArgs( internalFormat, format, type ); - if( rc != 0 ) { - return( rc ); - } - - if( width < 1 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - levels = computeLog( width ); - - levels += userLevel; - if( !isLegalLevels( userLevel, baseLevel, maxLevel, levels ) ) { - return( GLU.GLU_INVALID_VALUE ); - } - - return( BuildMipmap.gluBuild1DMipmapLevelsCore( gl, target, internalFormat, width, - width, format, type, userLevel, baseLevel, maxLevel, data ) ); - } finally { - data.position(dataPos); - } - } - - public static int gluBuild1DMipmaps( GL gl, int target, int internalFormat, int width, - int format, int type, ByteBuffer data ) { - int dataPos = data.position(); - - try { - int[] widthPowerOf2 = new int[1]; - int levels; - int[] dummy = new int[1]; - - int rc = checkMipmapArgs( internalFormat, format, type ); - if( rc != 0 ) { - return( rc ); - } - - if( width < 1 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - closestFit( gl, target, width, 1, internalFormat, format, type, widthPowerOf2, dummy ); - levels = computeLog( widthPowerOf2[0] ); - - return( BuildMipmap.gluBuild1DMipmapLevelsCore( gl, target, internalFormat, - width, widthPowerOf2[0], format, type, 0, 0, levels, data ) ); - } finally { - data.position(dataPos); - } - } - - - public static int gluBuild2DMipmapLevels( GL gl, int target, int internalFormat, - int width, int height, int format, int type, int userLevel, - int baseLevel, int maxLevel, Object data ) { - int dataPos = 0; - - int level, levels; - - int rc = checkMipmapArgs( internalFormat, format, type ); - if( rc != 0 ) { - return( rc ); - } - - if( width < 1 || height < 1 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - levels = computeLog( width ); - level = computeLog( height ); - if( level > levels ) { - levels = level; - } - - levels += userLevel; - if( !isLegalLevels( userLevel, baseLevel, maxLevel, levels ) ) { - return( GLU.GLU_INVALID_VALUE ); - } - - //PointerWrapper pointer = PointerWrapperFactory.getPointerWrapper( data ); - ByteBuffer buffer = null; - if( data instanceof ByteBuffer ) { - buffer = (ByteBuffer)data; - dataPos = buffer.position(); - } else if( data instanceof byte[] ) { - byte[] array = (byte[])data; - buffer = ByteBuffer.allocateDirect(array.length); - buffer.put(array); - } else if( data instanceof short[] ) { - short[] array = (short[])data; - buffer = ByteBuffer.allocateDirect( array.length * 2 ); - ShortBuffer sb = buffer.asShortBuffer(); - sb.put( array ); - } else if( data instanceof int[] ) { - int[] array = (int[])data; - buffer = ByteBuffer.allocateDirect( array.length * 4 ); - IntBuffer ib = buffer.asIntBuffer(); - ib.put( array ); - } else if( data instanceof float[] ) { - float[] array = (float[])data; - buffer = ByteBuffer.allocateDirect( array.length * 4 ); - FloatBuffer fb = buffer.asFloatBuffer(); - fb.put( array ); - } - - try { - return( BuildMipmap.gluBuild2DMipmapLevelsCore( gl, target, internalFormat, - width, height, width, height, format, type, userLevel, baseLevel, - maxLevel, buffer ) ); - } finally { - buffer.position(dataPos); - } - } - - - public static int gluBuild2DMipmaps( GL gl, int target, int internalFormat, - int width, int height, int format, int type, Object data ) { - int dataPos = 0; - - int[] widthPowerOf2 = new int[1]; - int[] heightPowerOf2 = new int[1]; - int level, levels; - - int rc = checkMipmapArgs( internalFormat, format, type ); - if( rc != 0 ) { - return( rc ); - } - - if( width < 1 || height < 1 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - closestFit( gl, target, width, height, internalFormat, format, type, - widthPowerOf2, heightPowerOf2 ); - - levels = computeLog( widthPowerOf2[0] ); - level = computeLog( heightPowerOf2[0] ); - if( level > levels ) { - levels = level; - } - - //PointerWrapper pointer = PointerWrapperFactory.getPointerWrapper( data ); - ByteBuffer buffer = null; - if( data instanceof ByteBuffer ) { - buffer = (ByteBuffer)data; - dataPos = buffer.position(); - } else if( data instanceof byte[] ) { - byte[] array = (byte[])data; - buffer = ByteBuffer.allocateDirect(array.length); - buffer.put(array); - } else if( data instanceof short[] ) { - short[] array = (short[])data; - buffer = ByteBuffer.allocateDirect( array.length * 2 ); - ShortBuffer sb = buffer.asShortBuffer(); - sb.put( array ); - } else if( data instanceof int[] ) { - int[] array = (int[])data; - buffer = ByteBuffer.allocateDirect( array.length * 4 ); - IntBuffer ib = buffer.asIntBuffer(); - ib.put( array ); - } else if( data instanceof float[] ) { - float[] array = (float[])data; - buffer = ByteBuffer.allocateDirect( array.length * 4 ); - FloatBuffer fb = buffer.asFloatBuffer(); - fb.put( array ); - } - - try { - return( BuildMipmap.gluBuild2DMipmapLevelsCore( gl, target, internalFormat, - width, height, widthPowerOf2[0], heightPowerOf2[0], format, type, 0, - 0, levels, buffer ) ); - } finally { - buffer.position(dataPos); - } - } - - - public static int gluBuild3DMipmaps( GL gl, int target, int internalFormat, - int width, int height, int depth, int format, int type, ByteBuffer data ) { - int dataPos = data.position(); - try { - - int[] widthPowerOf2 = new int[1]; - int[] heightPowerOf2 = new int[1]; - int[] depthPowerOf2 = new int[1]; - int level, levels; - - int rc = checkMipmapArgs( internalFormat, format, type ); - if( rc != 0 ) { - return( rc ); - } - - if( width < 1 || height < 1 || depth < 1 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - if( type == GL2.GL_BITMAP ) { - return( GLU.GLU_INVALID_ENUM ); - } - - closestFit3D( gl, target, width, height, depth, internalFormat, format, - type, widthPowerOf2, heightPowerOf2, depthPowerOf2 ); - - levels = computeLog( widthPowerOf2[0] ); - level = computeLog( heightPowerOf2[0] ); - if( level > levels ) { - levels = level; - } - level = computeLog( depthPowerOf2[0] ); - if( level > levels ) { - levels = level; - } - - return( BuildMipmap.gluBuild3DMipmapLevelsCore( gl, target, internalFormat, width, - height, depth, widthPowerOf2[0], heightPowerOf2[0], depthPowerOf2[0], - format, type, 0, 0, levels, data ) ); - } finally { - data.position(dataPos); - } - } - - public static int gluBuild3DMipmapLevels( GL gl, int target, int internalFormat, - int width, int height, int depth, int format, int type, int userLevel, - int baseLevel, int maxLevel, ByteBuffer data ) { - int dataPos = data.position(); - try { - int level, levels; - - int rc = checkMipmapArgs( internalFormat, format, type ); - if( rc != 0 ) { - return( rc ); - } - - if( width < 1 || height < 1 || depth < 1 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - if( type == GL2.GL_BITMAP ) { - return( GLU.GLU_INVALID_ENUM ); - } - - levels = computeLog( width ); - level = computeLog( height ); - if( level > levels ) { - levels = level; - } - level = computeLog( depth ); - if( level > levels ) { - levels = level; - } - - levels += userLevel; - if( !isLegalLevels( userLevel, baseLevel, maxLevel, levels ) ) { - return( GLU.GLU_INVALID_VALUE ); - } - - return( BuildMipmap.gluBuild3DMipmapLevelsCore( gl, target, internalFormat, width, - height, depth, width, height, depth, format, type, userLevel, - baseLevel, maxLevel, data ) ); - } finally { - data.position(dataPos); - } - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/PixelStorageModes.java b/src/classes/com/sun/opengl/impl/mipmap/PixelStorageModes.java deleted file mode 100644 index 82324f1b0..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/PixelStorageModes.java +++ /dev/null @@ -1,426 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -/** - * - * @author Administrator - */ -public class PixelStorageModes { - - /** - * Holds value of property packAlignment. - */ - private int packAlignment; - - /** - * Holds value of property packRowLength. - */ - private int packRowLength; - - /** - * Holds value of property packSkipRows. - */ - private int packSkipRows; - - /** - * Holds value of property packSkipPixels. - */ - private int packSkipPixels; - - /** - * Holds value of property packLsbFirst. - */ - private boolean packLsbFirst; - - /** - * Holds value of property packSwapBytes. - */ - private boolean packSwapBytes; - - /** - * Holds value of property packSkipImages. - */ - private int packSkipImages; - - /** - * Holds value of property packImageHeight. - */ - private int packImageHeight; - - /** - * Holds value of property unpackAlignment. - */ - private int unpackAlignment; - - /** - * Holds value of property unpackRowLength. - */ - private int unpackRowLength; - - /** - * Holds value of property unpackSkipRows. - */ - private int unpackSkipRows; - - /** - * Holds value of property unpackSkipPixels. - */ - private int unpackSkipPixels; - - /** - * Holds value of property unpackLsbFirst. - */ - private boolean unpackLsbFirst; - - /** - * Holds value of property unpackSwapBytes. - */ - private boolean unpackSwapBytes; - - /** - * Holds value of property unpackSkipImages. - */ - private int unpackSkipImages; - - /** - * Holds value of property unpackImageHeight. - */ - private int unpackImageHeight; - - /** Creates a new instance of PixelStorageModes */ - public PixelStorageModes() { - } - - /** - * Getter for property packAlignment. - * @return Value of property packAlignment. - */ - public int getPackAlignment() { - - return this.packAlignment; - } - - /** - * Setter for property packAlignment. - * @param packAlignment New value of property packAlignment. - */ - public void setPackAlignment(int packAlignment) { - - this.packAlignment = packAlignment; - } - - /** - * Getter for property packRowLength. - * @return Value of property packRowLength. - */ - public int getPackRowLength() { - - return this.packRowLength; - } - - /** - * Setter for property packRowLength. - * @param packRowLength New value of property packRowLength. - */ - public void setPackRowLength(int packRowLength) { - - this.packRowLength = packRowLength; - } - - /** - * Getter for property packSkipRows. - * @return Value of property packSkipRows. - */ - public int getPackSkipRows() { - - return this.packSkipRows; - } - - /** - * Setter for property packSkipRows. - * @param packSkipRows New value of property packSkipRows. - */ - public void setPackSkipRows(int packSkipRows) { - - this.packSkipRows = packSkipRows; - } - - /** - * Getter for property packSkipPixels. - * @return Value of property packSkipPixels. - */ - public int getPackSkipPixels() { - - return this.packSkipPixels; - } - - /** - * Setter for property packSkipPixels. - * @param packSkipPixels New value of property packSkipPixels. - */ - public void setPackSkipPixels(int packSkipPixels) { - - this.packSkipPixels = packSkipPixels; - } - - /** - * Getter for property packLsbFirst. - * @return Value of property packLsbFirst. - */ - public boolean getPackLsbFirst() { - - return this.packLsbFirst; - } - - /** - * Setter for property packLsbFirst. - * @param packLsbFirst New value of property packLsbFirst. - */ - public void setPackLsbFirst(boolean packLsbFirst) { - - this.packLsbFirst = packLsbFirst; - } - - /** - * Getter for property packSwapBytes. - * @return Value of property packSwapBytes. - */ - public boolean getPackSwapBytes() { - - return this.packSwapBytes; - } - - /** - * Setter for property packSwapBytes. - * @param packSwapBytes New value of property packSwapBytes. - */ - public void setPackSwapBytes(boolean packSwapBytes) { - - this.packSwapBytes = packSwapBytes; - } - - /** - * Getter for property packSkipImages. - * @return Value of property packSkipImages. - */ - public int getPackSkipImages() { - - return this.packSkipImages; - } - - /** - * Setter for property packSkipImages. - * @param packSkipImages New value of property packSkipImages. - */ - public void setPackSkipImages(int packSkipImages) { - - this.packSkipImages = packSkipImages; - } - - /** - * Getter for property packImageHeight. - * @return Value of property packImageHeight. - */ - public int getPackImageHeight() { - - return this.packImageHeight; - } - - /** - * Setter for property packImageHeight. - * @param packImageHeight New value of property packImageHeight. - */ - public void setPackImageHeight(int packImageHeight) { - - this.packImageHeight = packImageHeight; - } - - /** - * Getter for property unpackAlignment. - * @return Value of property unpackAlignment. - */ - public int getUnpackAlignment() { - - return this.unpackAlignment; - } - - /** - * Setter for property unpackAlignment. - * @param unpackAlignment New value of property unpackAlignment. - */ - public void setUnpackAlignment(int unpackAlignment) { - - this.unpackAlignment = unpackAlignment; - } - - /** - * Getter for property unpackRowLength. - * @return Value of property unpackRowLength. - */ - public int getUnpackRowLength() { - - return this.unpackRowLength; - } - - /** - * Setter for property unpackRowLength. - * @param unpackRowLength New value of property unpackRowLength. - */ - public void setUnpackRowLength(int unpackRowLength) { - - this.unpackRowLength = unpackRowLength; - } - - /** - * Getter for property unpackSkipRows. - * @return Value of property unpackSkipRows. - */ - public int getUnpackSkipRows() { - - return this.unpackSkipRows; - } - - /** - * Setter for property unpackSkipRows. - * @param unpackSkipRows New value of property unpackSkipRows. - */ - public void setUnpackSkipRows(int unpackSkipRows) { - - this.unpackSkipRows = unpackSkipRows; - } - - /** - * Getter for property unpackSkipPixels. - * @return Value of property unpackSkipPixels. - */ - public int getUnpackSkipPixels() { - - return this.unpackSkipPixels; - } - - /** - * Setter for property unpackSkipPixels. - * @param unpackSkipPixels New value of property unpackSkipPixels. - */ - public void setUnpackSkipPixels(int unpackSkipPixels) { - - this.unpackSkipPixels = unpackSkipPixels; - } - - /** - * Getter for property unpackLsbFirst. - * @return Value of property unpackLsbFirst. - */ - public boolean getUnpackLsbFirst() { - - return this.unpackLsbFirst; - } - - /** - * Setter for property unpackLsbFirst. - * @param unpackLsbFirst New value of property unpackLsbFirst. - */ - public void setUnpackLsbFirst(boolean unpackLsbFirst) { - - this.unpackLsbFirst = unpackLsbFirst; - } - - /** - * Getter for property unpackSwapBytes. - * @return Value of property unpackSwapBytes. - */ - public boolean getUnpackSwapBytes() { - - return this.unpackSwapBytes; - } - - /** - * Setter for property unpackSwapBytes. - * @param unpackSwapBytes New value of property unpackSwapBytes. - */ - public void setUnpackSwapBytes(boolean unpackSwapBytes) { - - this.unpackSwapBytes = unpackSwapBytes; - } - - /** - * Getter for property unpackSkipImages. - * @return Value of property unpackSkipImages. - */ - public int getUnpackSkipImages() { - - return this.unpackSkipImages; - } - - /** - * Setter for property unpackSkipImages. - * @param unpackSkipImages New value of property unpackSkipImages. - */ - public void setUnpackSkipImages(int unpackSkipImages) { - - this.unpackSkipImages = unpackSkipImages; - } - - /** - * Getter for property unpackImageHeight. - * @return Value of property unpackImageHeight. - */ - public int getUnpackImageHeight() { - - return this.unpackImageHeight; - } - - /** - * Setter for property unpackImageHeight. - * @param unpackImageHeight New value of property unpackImageHeight. - */ - public void setUnpackImageHeight(int unpackImageHeight) { - - this.unpackImageHeight = unpackImageHeight; - } - - -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/ScaleInternal.java b/src/classes/com/sun/opengl/impl/mipmap/ScaleInternal.java deleted file mode 100644 index f4d94412d..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/ScaleInternal.java +++ /dev/null @@ -1,2448 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import javax.media.opengl.GL; -import javax.media.opengl.GL2; -import javax.media.opengl.glu.GLU; -import java.nio.*; - -/** - * - * @author Administrator - */ -public class ScaleInternal { - - public static final float UINT_MAX = (float)(0x00000000FFFFFFFF); - - public static void scale_internal( int components, int widthin, int heightin, - ShortBuffer datain, int widthout, int heightout, ShortBuffer dataout ) { - float x, lowx, highx, convx, halfconvx; - float y, lowy, highy, convy, halfconvy; - float xpercent, ypercent; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, yint, xint, xindex, yindex; - int temp; - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage( components, widthin, heightin, datain, dataout ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - halfconvx = convx / 2; - halfconvy = convy / 2; - for( i = 0; i < heightout; i++ ) { - y = convy * ( i + 0.5f ); - if( heightin > heightout ) { - highy = y + halfconvy; - lowy = y - halfconvy; - } else { - highy = y + 0.5f; - lowy = y - 0.5f; - } - for( j = 0; j < widthout; j++ ) { - x = convx * ( j + 0.5f ); - if( widthin > widthout ) { - highx = x + halfconvx; - lowx = x - halfconvx; - } else { - highx = x + 0.5f; - lowx = x - 0.5f; - } - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - area = 0.0f; - - y = lowy; - yint = (int)Math.floor( y ); - while( y < highy ) { - yindex = ( yint + heightin ) % heightin; - if( highy < yint + 1 ) { - ypercent = highy - y; - } else { - ypercent = yint + 1 - y; - } - - x = lowx; - xint = (int)Math.floor( x ); - - while( x < highx ) { - xindex = ( xint + widthin ) % widthin; - if( highx < xint + 1 ) { - xpercent = highx -x; - } else { - xpercent = xint + 1 - x; - } - - percent = xpercent * ypercent; - area += percent; - temp = ( xindex + ( yindex * widthin) ) * components; - for( k = 0; k < components; k++ ) { - totals[k] += datain.get( temp + k ) * percent; - } - - xint++; - x = xint; - } - yint++; - y = yint; - } - - temp = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - // totals[] should be rounded in the case of enlarging an RGB - // ramp when the type is 332 or 4444 - dataout.put( temp + k, (short)((totals[k] + 0.5f) / area) ); - } - } - } - } - - public static void scale_internal_ubyte( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - ByteBuffer dataout, int element_size, int ysize, int group_size ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_ubyte( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * y_percent; - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * y_percent; - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - float f = 0.0f; - datain.position( left ); - f = ( 0x000000FF & datain.get() ) * ( 1.0f - lowx_float ); - datain.position( right ); - f += ( 0x000000FF & datain.get() ) * highx_float; - totals[k] += f; - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * x_percent; - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * y_percent; - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ) * percent; - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += ( 0x000000FF & datain.get() ); - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - dataout.position( outindex + k ); - dataout.put( (byte)(totals[k] / area) ); - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scale_internal_byte( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - ByteBuffer dataout, int element_size, int ysize, - int group_size ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_byte( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * y_percent; - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * y_percent; - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - float f = 0.0f; - datain.position( left ); - f = datain.get() * ( 1 - lowx_float ); - datain.position( right ); - f += datain.get() * highx_float; - totals[k] += f; - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * x_percent; - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * y_percent; - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get() * percent; - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - totals[k] += datain.get(); - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - dataout.position( outindex + k ); - dataout.put( (byte)(totals[k] / area) ); - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scale_internal_ushort( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - ShortBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_ushort( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size, myswap_bytes ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += ( 0x0000FFFF & ((int)Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ))) * percent; - } else { - totals[k] += ( 0x0000FFFF & datain.getShort() ) * percent; - } - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += ( 0x0000FFFF & ((int)Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ))) * y_percent; - } else { - totals[k] += ( 0x0000FFFF & datain.getShort()) * y_percent; - } - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += ( 0x0000FFFF & (Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ))) * percent; - } else { - totals[k] += ( 0x0000FFFF & datain.getShort()) * percent; - } - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * percent; - } else { - totals[k] += ( 0x0000FFFF & datain.getShort() ) * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * y_percent; - } else { - totals[k] += ( 0x0000FFFF & datain.getShort()) * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += ( 0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * percent; - } else { - totals[k] += ( 0x0000FFFF & datain.getShort()) * percent; - } - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - if( myswap_bytes ) { - datain.position( left ); - float f = (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES(datain.getShort())) * ( 1 - lowx_float ); - datain.position( right ); - f += ((0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES(datain.getShort())) * highx_float); - totals[k] += f; - } else { - datain.position( left ); - float f = ((0x0000FFFF & datain.getShort()) * ( 1 - lowx_float )); - datain.position( right ); - f += ((0x0000FFFF & datain.getShort()) * highx_float); - totals[k] += f; - } - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() )) * percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * percent; - } - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * x_percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * x_percent; - } - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort() )) * percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * percent; - } - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * y_percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * percent; - } - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort()) ) * percent; - } else { - totals[k] += (0x0000FFFF & datain.getShort()) * percent; - } - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x0000FFFF & Mipmap.GLU_SWAP_2_BYTES( datain.getShort())); - } else { - totals[k] += (0x0000FFFF & datain.getShort()); - } - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - dataout.position( outindex + k ); - dataout.put( (short)(totals[k] / area) ); - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scale_internal_short( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - ShortBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - int swapbuf; // unsigned buffer - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_short( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size, myswap_bytes ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getShort() * y_percent; - } - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getShort() * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - if( myswap_bytes ) { - datain.position( left ); - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * ( 1 - lowx_float ); - datain.position( right ); - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * highx_float; - } else { - datain.position( left ); - totals[k] += datain.getShort() * ( 1 - lowx_float ); - datain.position( right ); - totals[k] += datain.getShort() * highx_float; - } - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort()); - totals[k] += swapbuf * x_percent; - } else { - totals[k] += datain.getShort() * x_percent; - } - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getShort() * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getShort() * percent; - } - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_2_BYTES( datain.getShort() ); - totals[k] += swapbuf; - } else { - totals[k] += datain.getShort(); - } - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - dataout.position( outindex + k ); - dataout.put( (short)(totals[k] / area) ); - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scale_internal_uint( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - IntBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_uint( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size, myswap_bytes ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt()) ) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt()) ) * y_percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * y_percent; - } - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt()) ) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt()) ) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt()) ) * y_percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt()) ) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - if( myswap_bytes ) { - datain.position( left ); - totals[k] += ((0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES(datain.getInt())) * ( 1 - lowx_float )); - datain.position( right ); - totals[k] += ((0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES(datain.getInt())) * highx_float); - } else { - datain.position( left ); - totals[k] += ((0x00000000FFFFFFFF & datain.getInt()) * ( 1 - lowx_float )); - datain.position( right ); - totals[k] += ((0x00000000FFFFFFFF & datain.getInt()) * highx_float); - } - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * x_percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * x_percent; - } - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * y_percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - long tempInt0 = ( 0xFFFFFFFFL & datain.getInt( temp_index ) ); - datain.position( temp_index ); - long tempInt1 = ( 0xFFFFFFFFL & datain.getInt() ); - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())) * percent; - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()) * percent; - } - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - totals[k] += (0x00000000FFFFFFFF & Mipmap.GLU_SWAP_4_BYTES( datain.getInt())); - } else { - totals[k] += (0x00000000FFFFFFFF & datain.getInt()); - } - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - float value = 0.0f; - for( k = 0; k < components; k++ ) { - value = totals[k] / area; - dataout.position( outindex + k ); - if( value >= UINT_MAX ) { - dataout.put( (int)value ); - } else { - dataout.put( (int)(totals[k] / area) ); - } - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scale_internal_int( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - IntBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - long swapbuf; // unsigned buffer - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_int( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size, myswap_bytes ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getInt() * y_percent; - } - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getInt() * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - if( myswap_bytes ) { - datain.position( left ); - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * ( 1 - lowx_float ); - datain.position( right ); - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * highx_float; - } else { - datain.position( left ); - totals[k] += (datain.getInt() * ( 1 - lowx_float )); - datain.position( right ); - totals[k] += (datain.getInt() * highx_float); - } - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * x_percent; - } else { - totals[k] += datain.getInt() * x_percent; - } - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getInt() * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getInt() * percent; - } - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getInt() ); - totals[k] += swapbuf; - } else { - totals[k] += datain.getInt(); - } - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - dataout.position( outindex + k ); - dataout.put( (int)(totals[k] / area) ); - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scale_internal_float( int components, int widthin, int heightin, - ByteBuffer datain, int widthout, int heightout, - FloatBuffer dataout, int element_size, int ysize, - int group_size, boolean myswap_bytes ) { - float x, convx; - float y, convy; - float percent; - // Max components in a format is 4, so... - float[] totals = new float[4]; - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outindex; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - float swapbuf; // unsigned buffer - - if( (widthin == (widthout * 2)) && (heightin == (heightout * 2)) ) { - HalveImage.halveImage_float( components, widthin, heightin, datain, dataout, - element_size, ysize, group_size, myswap_bytes ); - return; - } - convy = (float)heightin / heightout; - convx = (float)widthin / widthout; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convy_float; - - for( i = 0; i < heightout; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightin) - highy_int = heightin - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthout; j++ ) { - - // Ok, now apply box filter to box that goes from (lowx, lowy) - // to (highx, highy) on input data into this pixel on output - // data. - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // caulate the value for pixels in the 1st row - xindex = lowx_int * group_size; - if( ( highy_int > lowy_int ) && ( highx_int > lowx_int ) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * ysize; - percent = y_percent * ( 1 - lowx_float ); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getFloat() * y_percent; - } - } - } - temp += group_size; - right = temp; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - - // calculate the value for pixels in the last row - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getFloat() * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - - // calculate the value for the pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += ysize; - right += ysize; - for( k = 0; k < components; k++, left += element_size, right += element_size ) { - if( myswap_bytes ) { - datain.position( left ); - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * ( 1 - lowx_float ); - datain.position( right ); - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * highx_float; - } else { - datain.position( left ); - totals[k] += (datain.getFloat() * ( 1 - lowx_float )); - datain.position( right ); - totals[k] += (datain.getFloat() * highx_float); - } - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float) * x_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * x_percent; - } else { - totals[k] += datain.getFloat() * x_percent; - } - } - } - percent = x_percent * highy_float; - temp += ysize; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += group_size; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * y_percent; - } else { - totals[k] += datain.getFloat() * y_percent; - } - } - } - temp += group_size; - percent = y_percent * highx_float; - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + (lowy_int * ysize); - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf * percent; - } else { - totals[k] += datain.getFloat() * percent; - } - } - } - - // this is for the pixels in the body - temp0 = xindex + group_size + ( lowy_int + 1 ) * ysize; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - for( k = 0, temp_index = temp; k < components; k++, temp_index += element_size ) { - datain.position( temp_index ); - if( myswap_bytes ) { - swapbuf = Mipmap.GLU_SWAP_4_BYTES( datain.getFloat() ); - totals[k] += swapbuf; - } else { - totals[k] += datain.getFloat(); - } - } - temp += group_size; - } - temp0 += ysize; - } - - outindex = ( j + ( i * widthout ) ) * components; - for( k = 0; k < components; k++ ) { - dataout.position( outindex + k ); - dataout.put( (totals[k] / area) ); - } - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthin - 1) { - int delta = (highx_int - widthin + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - } - - public static void scaleInternalPackedPixel( int components, Extract extract, - int widthIn, int heightIn, ByteBuffer dataIn, int widthOut, - int heightOut, ByteBuffer dataOut, int pixelSizeInBytes, - int rowSizeInBytes, boolean isSwap ) { - float x, convx; - float y, convy; - float percent; - - // max components in a format is 4, so - float[] totals = new float[4]; - float[] extractTotals = new float[4]; - float[] extractMoreTotals = new float[4]; - float[] shoveTotals = new float[4]; - - float area; - int i, j, k, xindex; - - int temp, temp0; - int temp_index; - int outIndex = 0; - - int lowx_int, highx_int, lowy_int, highy_int; - float x_percent, y_percent; - float lowx_float, highx_float, lowy_float, highy_float; - float convy_float, convx_float; - int convy_int, convx_int; - int l, m; - int left, right; - - if( widthIn == widthOut * 2 && heightIn == heightOut * 2 ) { - HalveImage.halveImagePackedPixel( components, extract, widthIn, heightIn, dataIn, dataOut, - pixelSizeInBytes, rowSizeInBytes, isSwap ); - return; - } - convy = (float)heightIn / (float)heightOut; - convx = (float)widthIn / (float)widthOut; - convy_int = (int)Math.floor( convy ); - convy_float = convy - convy_int; - convx_int = (int)Math.floor( convx ); - convx_float = convx - convx_int; - - area = convx * convy; - - lowy_int = 0; - lowy_float = 0.0f; - highy_int = convy_int; - highy_float = convx_float; - - for( i = 0; i < heightOut; i++ ) { - // Clamp here to be sure we don't read beyond input buffer. - if (highy_int >= heightIn) - highy_int = heightIn - 1; - lowx_int = 0; - lowx_float = 0.0f; - highx_int = convx_int; - highx_float = convx_float; - - for( j = 0; j < widthOut; j++ ) { - // ok now apply box filter to box that goes from( lowx, lowy ) - // to ( highx, highy ) on input data into this pixel on output data - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - - // calculate that value for pixels in the 1st row - xindex = lowx_int * pixelSizeInBytes; - if( (highy_int > lowy_int) && (highx_int > lowx_int) ) { - - y_percent = 1 - lowy_float; - temp = xindex + lowy_int * rowSizeInBytes; - percent = y_percent * ( 1 - lowx_float ); - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - left = temp; - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += pixelSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * y_percent; - } - } - temp += pixelSizeInBytes; - right = temp; - percent = y_percent * highx_float; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - // calculate the value for pixels in the last row - - y_percent = highy_float; - percent = y_percent * ( 1 - lowx_float ); - temp = xindex + highy_int * rowSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += pixelSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * y_percent; - } - } - temp += pixelSizeInBytes; - percent = y_percent * highx_float; - dataIn.position( temp ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - - // calculate the value for pixels in the 1st and last column - for( m = lowy_int + 1; m < highy_int; m++ ) { - left += rowSizeInBytes; - right += rowSizeInBytes; - dataIn.position( left ); - extract.extract( isSwap, dataIn, extractTotals ); - dataIn.position( right ); - extract.extract( isSwap, dataIn, extractMoreTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += ( extractTotals[k] * ( 1 - lowx_float ) + extractMoreTotals[k] * highx_float ); - } - } - } else if( highy_int > lowy_int ) { - x_percent = highx_float - lowx_float; - percent = ( 1 - lowy_float ) * x_percent; - temp = xindex + lowy_int * rowSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp += rowSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * x_percent; - } - } - percent = x_percent * highy_float; - temp += rowSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - } else if( highx_int > lowx_int ) { - y_percent = highy_float - lowy_float; - percent = ( 1 - lowx_float ) * y_percent; - temp = xindex + lowy_int * rowSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - for( l = lowx_int + 1; l < highx_int; l++ ) { - temp += pixelSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * y_percent; - } - } - temp += pixelSizeInBytes; - percent = y_percent * highx_float; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - } else { - percent = ( highy_float - lowy_float ) * ( highx_float - lowx_float ); - temp = xindex + lowy_int * rowSizeInBytes; - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - } - - // this is for the pixels in the body - temp0 = xindex + pixelSizeInBytes + ( lowy_int + 1 ) * rowSizeInBytes; - for( m = lowy_int + 1; m < highy_int; m++ ) { - temp = temp0; - for( l = lowx_int + 1; l < highx_int; l++ ) { - dataIn.position( temp ); - extract.extract( isSwap, dataIn, extractTotals ); - for( k = 0; k < components; k++ ) { - totals[k] += extractTotals[k] * percent; - } - temp += pixelSizeInBytes; - } - temp0 += rowSizeInBytes; - } - - outIndex = ( j + ( i * widthOut ) ); - for( k = 0; k < components; k++ ) { - shoveTotals[k] = totals[k] / area; - } - extract.shove( shoveTotals, outIndex, dataOut ); - lowx_int = highx_int; - lowx_float = highx_float; - highx_int += convx_int; - highx_float += convx_float; - if( highx_float > 1.0f ) { - highx_float -= 1.0f; - highx_int++; - } - - // Clamp to make sure we don't run off the right edge - if (highx_int > widthIn - 1) { - int delta = (highx_int - widthIn + 1); - lowx_int -= delta; - highx_int -= delta; - } - } - lowy_int = highy_int; - lowy_float = highy_float; - highy_int += convy_int; - highy_float += convy_float; - if( highy_float > 1.0f ) { - highy_float -= 1.0f; - highy_int++; - } - } - assert( outIndex == ( widthOut * heightOut - 1) ); - } - - public static void scaleInternal3D( int components, int widthIn, int heightIn, - int depthIn, ShortBuffer dataIn, int widthOut, int heightOut, - int depthOut, ShortBuffer dataOut ) { - float x, lowx, highx, convx, halfconvx; - float y, lowy, highy, convy, halfconvy; - float z, lowz, highz, convz, halfconvz; - float xpercent, ypercent, zpercent; - float percent; - // max compnents in a format is 4 - float[] totals = new float[4]; - float volume; - int i, j, d, k, zint, yint, xint, xindex, yindex, zindex; - int temp; - - lowy = highy = lowx = highx = 0.0f; - - convz = (float)depthIn / depthOut; - convy = (float)heightIn / heightOut; - convx = (float)widthIn / widthOut; - halfconvz = convz / 2.0f; - halfconvy = convy / 2.0f; - halfconvx = convx / 2.0f; - for( d = 0; d < depthOut; d++ ) { - z = convz * ( d + 0.5f ); - if( depthIn > depthOut ) { - highz = z + halfconvz; - lowz = z - halfconvz; - } else { - highz = z + 0.5f; - lowz = z - 0.5f; - } - for( i = 0; i < heightOut; i++ ) { - y = convy * ( i + 0.5f ); - if( heightIn > heightOut ) { - highz = y + halfconvy; - lowz = y - halfconvy; - } else { - highz = y + 0.5f; - lowz = y - 0.5f; - } - for( j = 0; j < widthOut; j++ ) { - x = convx * ( j + 0.5f ); - if( depthIn > depthOut ) { - highz = x + halfconvx; - lowz = x - halfconvx; - } else { - highz = x + 0.5f; - lowz = x - 0.5f; - } - - // Ok, now apply box filter to box that goes from ( lowx, lowy, lowz ) - // to ( highx, highy, highz ) on input data into this pixel on output data - - totals[0] = totals[1] = totals[2] = totals[3] = 0.0f; - volume = 0.0f; - - z = lowz; - zint = (int)(Math.floor( z ) ); - while( z < highz ) { - zindex = ( zint + depthIn ) % depthIn; - if( highz < zint + 1 ) { - zpercent = highz - z; - } else { - zpercent = zint + 1 - z; - } - - y = lowy; - yint = (int)(Math.floor( y ) ); - while( y < highy ) { - yindex = ( yint + heightIn ) % heightIn; - if( highy < yint + 1 ) { - ypercent = highy - y; - } else { - ypercent = yint + 1 - y; - } - - x = lowx; - xint = (int)(Math.floor( x ) ); - - while( x < highx ) { - xindex = (xint + widthIn ) % widthIn; - if( highx < xint + 1 ) { - xpercent = highx - x; - } else { - xpercent = xint + 1 - x; - } - - percent = xpercent * ypercent * zpercent; - volume += percent; - - temp = (xindex + ( yindex *widthIn) + (zindex * widthIn *heightIn)) * components; - for( k = 0; k < components; k++ ) { - assert( 0 <= (temp+k) && (temp+k) < (widthIn * heightIn * depthIn * components) ); - totals[k] += dataIn.get( temp + k ) * percent; - } - xint++; - x = xint; - } // while x - yint++; - y = yint; - } // while y - zint++; - z = zint; - } // while z - - temp = ( j + ( i * widthOut ) + (d * widthOut * heightOut ) ) * components; - for( k = 0; k < components; k++ ) { - // totals should be rounded in the case of enlarging an rgb ramp when the type is 332 or 4444 - assert( 0 <= ( temp + k ) && ( temp + k ) < (widthOut * heightOut* depthOut * components) ); - dataOut.put( temp + k, (short)((totals[k] + 0.5f) / volume ) ); - } - } - } - } - } - - public static int gluScaleImage3D( GL gl, int format, int widthIn, int heightIn, - int depthIn, int typeIn, ByteBuffer dataIn, int widthOut, int heightOut, - int depthOut, int typeOut, ByteBuffer dataOut ) { - int components; - ShortBuffer beforeImage, afterImage; - PixelStorageModes psm = new PixelStorageModes(); - - if( widthIn == 0 || heightIn == 0 || depthIn == 0 || - widthOut == 0 || heightOut == 0 || depthOut == 0 ) { - return( 0 ); - } - - if( widthIn < 0 || heightIn < 0 || depthIn < 0 || - widthOut < 0 || heightOut < 0 || depthOut < 0 ) { - return( GLU.GLU_INVALID_VALUE ); - } - - if( !Mipmap.legalFormat(format) || !Mipmap.legalType(typeIn) || - !Mipmap.legalType(typeOut) || typeIn == GL2.GL_BITMAP || - typeOut == GL2.GL_BITMAP ) { - return( GLU.GLU_INVALID_ENUM ); - } - - if( !Mipmap.isLegalFormatForPackedPixelType( format, typeIn ) ) { - return( GLU.GLU_INVALID_OPERATION ); - } - - if( !Mipmap.isLegalFormatForPackedPixelType( format, typeOut ) ) { - return( GLU.GLU_INVALID_OPERATION ); - } - - try { - beforeImage = ByteBuffer.allocateDirect( Mipmap.imageSize3D( widthIn, - heightIn, depthIn, format, GL2.GL_UNSIGNED_SHORT ) ).order( - ByteOrder.nativeOrder() ).asShortBuffer(); - afterImage = ByteBuffer.allocateDirect( Mipmap.imageSize3D( widthIn, - heightIn, depthIn, format, GL2.GL_UNSIGNED_SHORT ) ).order( - ByteOrder.nativeOrder() ).asShortBuffer(); - } catch( OutOfMemoryError err ) { - return( GLU.GLU_OUT_OF_MEMORY ); - } - Mipmap.retrieveStoreModes3D( gl, psm ); - - Image.fillImage3D( psm, widthIn, heightIn, depthIn, format, typeIn, - Mipmap.is_index( format ), dataIn, beforeImage ); - components = Mipmap.elements_per_group( format, 0 ); - ScaleInternal.scaleInternal3D( components, widthIn, heightIn, depthIn, - beforeImage, widthOut, heightOut, depthOut, afterImage ); - Image.emptyImage3D( psm, widthOut, heightOut, depthOut, format, typeOut, - Mipmap.is_index( format ), afterImage, dataOut ); - - return( 0 ); - } -} diff --git a/src/classes/com/sun/opengl/impl/mipmap/Type_Widget.java b/src/classes/com/sun/opengl/impl/mipmap/Type_Widget.java deleted file mode 100644 index 7f6ab08c0..000000000 --- a/src/classes/com/sun/opengl/impl/mipmap/Type_Widget.java +++ /dev/null @@ -1,224 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.mipmap; - -import java.nio.*; - -/** - * - * @author Administrator - */ -public class Type_Widget { - - ByteBuffer buffer; - - /** Creates a new instance of Type_Widget */ - public Type_Widget() { - buffer = ByteBuffer.allocate( 4 ); - } - - public void setUB0( byte b ) { - buffer.position( 0 ); - buffer.put( b ); - } - - public byte getUB0() { - buffer.position( 0 ); - return( buffer.get() ); - } - - public void setUB1( byte b ) { - buffer.position( 1 ); - buffer.put( b ); - } - - public byte getUB1() { - buffer.position( 1 ); - return( buffer.get() ); - } - - public void setUB2( byte b ) { - buffer.position( 2 ); - buffer.put( b ); - } - - public byte getUB2() { - buffer.position( 2 ); - return( buffer.get() ); - } - - public void setUB3( byte b ) { - buffer.position( 3 ); - buffer.put( b ); - } - - public byte getUB3() { - buffer.position( 3 ); - return( buffer.get() ); - } - - public void setUS0( short s ) { - buffer.position( 0 ); - buffer.putShort( s ); - } - - public short getUS0() { - buffer.position( 0 ); - return( buffer.getShort() ); - } - - public void setUS1( short s ) { - buffer.position( 2 ); - buffer.putShort( s ); - } - - public short getUS1() { - buffer.position( 2 ); - return( buffer.getShort() ); - } - - public void setUI( int i ) { - buffer.position( 0 ); - buffer.putInt( i ); - } - - public int getUI() { - buffer.position( 0 ); - return( buffer.getInt() ); - } - - public void setB0( byte b ) { - buffer.position( 0 ); - buffer.put( b ); - } - - public byte getB0() { - buffer.position( 0 ); - return( buffer.get() ); - } - - public void setB1( byte b ) { - buffer.position( 1 ); - buffer.put( b ); - } - - public byte getB1() { - buffer.position( 1 ); - return( buffer.get() ); - } - - public void setB2( byte b ) { - buffer.position( 2 ); - buffer.put( b ); - } - - public byte getB2() { - buffer.position( 2 ); - return( buffer.get() ); - } - - public void setB3( byte b ) { - buffer.position( 3 ); - buffer.put( b ); - } - - public byte getB3() { - buffer.position( 3 ); - return( buffer.get() ); - } - - public void setS0( short s ) { - buffer.position( 0 ); - buffer.putShort( s ); - } - - public short getS0() { - buffer.position( 0 ); - return( buffer.getShort() ); - } - - public void setS1( short s ) { - buffer.position( 2 ); - buffer.putShort( s ); - } - - public short getS1() { - buffer.position( 2 ); - return( buffer.getShort() ); - } - - public void setI( int i ) { - buffer.position( 0 ); - buffer.putInt( i ); - } - - public int getI() { - buffer.position( 0 ); - return( buffer.getInt() ); - } - - public void setF( float f ) { - buffer.position( 0 ); - buffer.putFloat( f ); - } - - public float getF() { - buffer.position( 0 ); - return( buffer.getFloat() ); - } - - public ByteBuffer getBuffer() { - buffer.rewind(); - return( buffer ); - } - - public static void main( String args[] ) { - Type_Widget t = new Type_Widget(); - t.setI( 1000000 ); - - System.out.println("int: " + Integer.toHexString( t.getI() ) ); - - } -} diff --git a/src/classes/com/sun/opengl/impl/packrect/BackingStoreManager.java b/src/classes/com/sun/opengl/impl/packrect/BackingStoreManager.java deleted file mode 100755 index acff0aa79..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/BackingStoreManager.java +++ /dev/null @@ -1,85 +0,0 @@ -/* - * Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.awt.packrect; - -/** This interface must be implemented by the end user and is called - in response to events like addition of rectangles into the - RectanglePacker. It is used both when a full re-layout must be - done as well as when the data in the backing store must be copied - to a new one. */ - -public interface BackingStoreManager { - public Object allocateBackingStore(int w, int h); - public void deleteBackingStore(Object backingStore); - - /** Notification that expansion of the backing store is about to be - done due to addition of the given rectangle. Gives the manager a - chance to do some compaction and potentially remove old entries - from the backing store, if it acts like a least-recently-used - cache. This method receives as argument the number of attempts - so far to add the given rectangle. Manager should return true if - the RectanglePacker should retry the addition (which may result - in this method being called again, with an increased attempt - number) or false if the RectanglePacker should just expand the - backing store. The caller should not call RectanglePacker.add() - in its preExpand() method. */ - public boolean preExpand(Rect cause, int attemptNumber); - - /** Notification that addition of the given Rect failed because a - maximum size was set in the RectanglePacker and the backing - store could not be expanded. */ - public void additionFailed(Rect cause, int attemptNumber); - - /** Notification that movement is starting. */ - public void beginMovement(Object oldBackingStore, Object newBackingStore); - - /** Tells the manager to move the contents of the given rect from - the old location on the old backing store to the new location on - the new backing store. The backing stores can be identical in - the case of compacting the existing backing store instead of - reallocating it. */ - public void move(Object oldBackingStore, - Rect oldLocation, - Object newBackingStore, - Rect newLocation); - - /** Notification that movement is ending. */ - public void endMovement(Object oldBackingStore, Object newBackingStore); -} diff --git a/src/classes/com/sun/opengl/impl/packrect/Level.java b/src/classes/com/sun/opengl/impl/packrect/Level.java deleted file mode 100755 index 2ef6cb989..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/Level.java +++ /dev/null @@ -1,275 +0,0 @@ -/* - * Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.awt.packrect; - -import java.util.*; - -public class Level { - private int width; - private int height; - private int yPos; - private LevelSet holder; - - private List/*<Rect>*/ rects = new ArrayList/*<Rect>*/(); - private List/*<Rect>*/ freeList; - private int nextAddX; - - static class RectXComparator implements Comparator { - public int compare(Object o1, Object o2) { - Rect r1 = (Rect) o1; - Rect r2 = (Rect) o2; - return r1.x() - r2.x(); - } - - public boolean equals(Object obj) { - return this == obj; - } - } - private static final Comparator rectXComparator = new RectXComparator(); - - public Level(int width, int height, int yPos, LevelSet holder) { - this.width = width; - this.height = height; - this.yPos = yPos; - this.holder = holder; - } - - public int w() { return width; } - public int h() { return height; } - public int yPos() { return yPos; } - - /** Tries to add the given rectangle to this level only allowing - non-disruptive changes like trivial expansion of the last level - in the RectanglePacker and allocation from the free list. More - disruptive changes like compaction of the level must be - requested explicitly. */ - public boolean add(Rect rect) { - if (rect.h() > height) { - // See whether it's worth trying to expand vertically - if (nextAddX + rect.w() > width) { - return false; - } - - // See whether we're the last level and can expand - if (!holder.canExpand(this, rect.h())) { - return false; - } - - // Trivially expand and try the allocation - holder.expand(this, height, rect.h()); - height = rect.h(); - } - - // See whether we can add at the end - if (nextAddX + rect.w() <= width) { - rect.setPosition(nextAddX, yPos); - rects.add(rect); - nextAddX += rect.w(); - return true; - } - - // See whether we can add from the free list - if (freeList != null) { - Rect candidate = null; - for (Iterator iter = freeList.iterator(); iter.hasNext(); ) { - Rect cur = (Rect) iter.next(); - if (cur.canContain(rect)) { - candidate = cur; - break; - } - } - - if (candidate != null) { - // Remove the candidate from the free list - freeList.remove(candidate); - // Set up and add the real rect - rect.setPosition(candidate.x(), candidate.y()); - rects.add(rect); - // Re-add any remaining free space - if (candidate.w() > rect.w()) { - candidate.setPosition(candidate.x() + rect.w(), candidate.y()); - candidate.setSize(candidate.w() - rect.w(), height); - freeList.add(candidate); - } - - coalesceFreeList(); - - return true; - } - } - - return false; - } - - /** Removes the given Rect from this Level. */ - public boolean remove(Rect rect) { - if (!rects.remove(rect)) - return false; - - // If this is the rightmost rectangle, instead of adding its space - // to the free list, we can just decrease the nextAddX - if (rect.maxX() + 1 == nextAddX) { - nextAddX -= rect.w(); - } else { - if (freeList == null) { - freeList = new ArrayList/*<Rect>*/(); - } - freeList.add(new Rect(rect.x(), rect.y(), rect.w(), height, null)); - coalesceFreeList(); - } - - return true; - } - - /** Indicates whether this Level contains no rectangles. */ - public boolean isEmpty() { - return rects.isEmpty(); - } - - /** Indicates whether this Level could satisfy an allocation request - if it were compacted. */ - public boolean couldAllocateIfCompacted(Rect rect) { - if (rect.h() > height) - return false; - if (freeList == null) - return false; - int freeListWidth = 0; - for (Iterator iter = freeList.iterator(); iter.hasNext(); ) { - Rect cur = (Rect) iter.next(); - freeListWidth += cur.w(); - } - // Add on the remaining space at the end - freeListWidth += (width - nextAddX); - return (freeListWidth >= rect.w()); - } - - public void compact(Object backingStore, BackingStoreManager manager) { - Collections.sort(rects, rectXComparator); - int nextCompactionDest = 0; - manager.beginMovement(backingStore, backingStore); - for (Iterator iter = rects.iterator(); iter.hasNext(); ) { - Rect cur = (Rect) iter.next(); - if (cur.x() != nextCompactionDest) { - manager.move(backingStore, cur, - backingStore, new Rect(nextCompactionDest, cur.y(), cur.w(), cur.h(), null)); - cur.setPosition(nextCompactionDest, cur.y()); - } - nextCompactionDest += cur.w(); - } - nextAddX = nextCompactionDest; - freeList.clear(); - manager.endMovement(backingStore, backingStore); - } - - public Iterator iterator() { - return rects.iterator(); - } - - /** Visits all Rects contained in this Level. */ - public void visit(RectVisitor visitor) { - for (Iterator iter = rects.iterator(); iter.hasNext(); ) { - Rect rect = (Rect) iter.next(); - visitor.visit(rect); - } - } - - /** Updates the references to the Rect objects in this Level with - the "next locations" of those Rects. This is actually used to - update the new Rects in a newly laid-out LevelSet with the - original Rects. */ - public void updateRectangleReferences() { - for (int i = 0; i < rects.size(); i++) { - Rect cur = (Rect) rects.get(i); - Rect next = cur.getNextLocation(); - next.setPosition(cur.x(), cur.y()); - if (cur.w() != next.w() || cur.h() != next.h()) - throw new RuntimeException("Unexpected disparity in rectangle sizes during updateRectangleReferences"); - rects.set(i, next); - } - } - - private void coalesceFreeList() { - if (freeList == null) - return; - if (freeList.isEmpty()) - return; - - // Try to coalesce adjacent free blocks in the free list - Collections.sort(freeList, rectXComparator); - int i = 0; - while (i < freeList.size() - 1) { - Rect r1 = (Rect) freeList.get(i); - Rect r2 = (Rect) freeList.get(i+1); - if (r1.maxX() + 1 == r2.x()) { - // Coalesce r1 and r2 into one block - freeList.remove(i+1); - r1.setSize(r1.w() + r2.w(), r1.h()); - } else { - ++i; - } - } - // See whether the last block bumps up against the addition point - Rect last = (Rect) freeList.get(freeList.size() - 1); - if (last.maxX() + 1 == nextAddX) { - nextAddX -= last.w(); - freeList.remove(freeList.size() - 1); - } - if (freeList.isEmpty()) { - freeList = null; - } - } - - //---------------------------------------------------------------------- - // Debugging functionality - // - - public void dumpFreeSpace() { - int freeListWidth = 0; - for (Iterator iter = freeList.iterator(); iter.hasNext(); ) { - Rect cur = (Rect) iter.next(); - System.err.println(" Free rectangle at " + cur); - freeListWidth += cur.w(); - } - // Add on the remaining space at the end - System.err.println(" Remaining free space " + (width - nextAddX)); - freeListWidth += (width - nextAddX); - System.err.println(" Total free space " + freeListWidth); - } -} diff --git a/src/classes/com/sun/opengl/impl/packrect/LevelSet.java b/src/classes/com/sun/opengl/impl/packrect/LevelSet.java deleted file mode 100755 index 724af27e0..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/LevelSet.java +++ /dev/null @@ -1,213 +0,0 @@ -/* - * Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.awt.packrect; - -import java.util.*; - -/** Manages a list of Levels; this is the core data structure - contained within the RectanglePacker and encompasses the storage - algorithm for the contained Rects. */ - -public class LevelSet { - // Maintained in sorted order by increasing Y coordinate - private List/*<Level>*/ levels = new ArrayList/*<Level>*/(); - private int nextAddY; - private int w; - private int h; - - /** A LevelSet manages all of the backing store for a region of a - specified width and height. */ - public LevelSet(int w, int h) { - this.w = w; - this.h = h; - } - - public int w() { return w; } - public int h() { return h; } - - /** Returns true if the given rectangle was successfully added to - the LevelSet given its current dimensions, false if not. Caller - is responsible for performing compaction, expansion, etc. as a - consequence. */ - public boolean add(Rect rect) { - if (rect.w() > w) - return false; - - // Go in reverse order through the levels seeing whether we can - // trivially satisfy the allocation request - for (int i = levels.size() - 1; i >= 0; --i) { - Level level = (Level) levels.get(i); - if (level.add(rect)) - return true; - } - - // See whether compaction could satisfy this allocation. This - // increases the computational complexity of the addition process, - // but prevents us from expanding unnecessarily. - for (int i = levels.size() - 1; i >= 0; --i) { - Level level = (Level) levels.get(i); - if (level.couldAllocateIfCompacted(rect)) - return false; - } - - // OK, we need to either add a new Level or expand the backing - // store. Try to add a new Level. - if (nextAddY + rect.h() > h) - return false; - - Level newLevel = new Level(w, rect.h(), nextAddY, this); - levels.add(newLevel); - nextAddY += rect.h(); - boolean res = newLevel.add(rect); - if (!res) - throw new RuntimeException("Unexpected failure in addition to new Level"); - return true; - } - - /** Removes the given Rect from this LevelSet. */ - public boolean remove(Rect rect) { - for (int i = levels.size() - 1; i >= 0; --i) { - Level level = (Level) levels.get(i); - if (level.remove(rect)) - return true; - } - - return false; - } - - /** Allocates the given Rectangle, performing compaction of a Level - if necessary. This is the correct fallback path to {@link - #add(Rect)} above. Returns true if allocated successfully, false - otherwise (indicating the need to expand the backing store). */ - public boolean compactAndAdd(Rect rect, - Object backingStore, - BackingStoreManager manager) { - for (int i = levels.size() - 1; i >= 0; --i) { - Level level = (Level) levels.get(i); - if (level.couldAllocateIfCompacted(rect)) { - level.compact(backingStore, manager); - boolean res = level.add(rect); - if (!res) - throw new RuntimeException("Unexpected failure to add after compaction"); - return true; - } - } - - return false; - } - - /** Indicates whether it's legal to trivially increase the height of - the given Level. This is only possible if it's the last Level - added and there's enough room in the backing store. */ - public boolean canExpand(Level level, int height) { - if (levels.isEmpty()) - return false; // Should not happen - if (levels.get(levels.size() - 1) == level && - (h - nextAddY >= height - level.h())) - return true; - return false; - } - - public void expand(Level level, int oldHeight, int newHeight) { - nextAddY += (newHeight - oldHeight); - } - - /** Gets the used height of the levels in this LevelSet. */ - public int getUsedHeight() { - return nextAddY; - } - - /** Sets the height of this LevelSet. It is only legal to reduce the - height to greater than or equal to the currently used height. */ - public void setHeight(int height) throws IllegalArgumentException { - if (height < getUsedHeight()) { - throw new IllegalArgumentException("May not reduce height below currently used height"); - } - h = height; - } - - /** Returns the vertical fragmentation ratio of this LevelSet. This - is defined as the ratio of the sum of the heights of all - completely empty Levels divided by the overall used height of - the LevelSet. A high vertical fragmentation ratio indicates that - it may be profitable to perform a compaction. */ - public float verticalFragmentationRatio() { - int freeHeight = 0; - int usedHeight = getUsedHeight(); - if (usedHeight == 0) - return 0.0f; - for (Iterator iter = iterator(); iter.hasNext(); ) { - Level level = (Level) iter.next(); - if (level.isEmpty()) { - freeHeight += level.h(); - } - } - return (float) freeHeight / (float) usedHeight; - } - - public Iterator iterator() { - return levels.iterator(); - } - - /** Visits all Rects contained in this LevelSet. */ - public void visit(RectVisitor visitor) { - for (Iterator iter = levels.iterator(); iter.hasNext(); ) { - Level level = (Level) iter.next(); - level.visit(visitor); - } - } - - /** Updates the references to the Rect objects in this LevelSet with - the "next locations" of those Rects. This is actually used to - update the new Rects in a newly laid-out LevelSet with the - original Rects. */ - public void updateRectangleReferences() { - for (Iterator iter = levels.iterator(); iter.hasNext(); ) { - Level level = (Level) iter.next(); - level.updateRectangleReferences(); - } - } - - /** Clears out all Levels stored in this LevelSet. */ - public void clear() { - levels.clear(); - nextAddY = 0; - } -} diff --git a/src/classes/com/sun/opengl/impl/packrect/Rect.java b/src/classes/com/sun/opengl/impl/packrect/Rect.java deleted file mode 100755 index c3b6be6da..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/Rect.java +++ /dev/null @@ -1,170 +0,0 @@ -/* - * Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.awt.packrect; - -/** Represents a rectangular region on the backing store. The edges of - the rectangle are the infinitely thin region between adjacent - pixels on the screen. The origin of the rectangle is its - upper-left corner. It is inclusive of the pixels on the top and - left edges and exclusive of the pixels on the bottom and right - edges. For example, a rect at position (0, 0) and of size (1, 1) - would include only the pixel at (0, 0). <P> - - Negative coordinates and sizes are not supported, since they make - no sense in the context of the packer, which deals only with - positively sized regions. <P> - - This class contains a user data field for efficient hookup to - external data structures as well as enough other hooks to - efficiently plug into the rectangle packer. */ - -public class Rect { - private int x; - private int y; - private int w; - private int h; - - // The level we're currently installed in in the parent - // RectanglePacker, or null if not hooked in to the table yet - private Level level; - - // The user's object this rectangle represents. - private Object userData; - - // Used transiently during re-layout of the backing store (when - // there is no room left due either to fragmentation or just being - // out of space) - private Rect nextLocation; - - public Rect() { - this(null); - } - - public Rect(Object userData) { - this(0, 0, 0, 0, userData); - } - - public Rect(int x, int y, int w, int h, Object userData) { - setPosition(x, y); - setSize(w, h); - setUserData(userData); - } - - public int x() { return x; } - public int y() { return y; } - public int w() { return w; } - public int h() { return h; } - public Object getUserData() { return userData; } - public Rect getNextLocation() { return nextLocation; } - - public void setPosition(int x, int y) { - if (x < 0) - throw new IllegalArgumentException("Negative x"); - if (y < 0) - throw new IllegalArgumentException("Negative y"); - this.x = x; - this.y = y; - } - - public void setSize(int w, int h) throws IllegalArgumentException { - if (w < 0) - throw new IllegalArgumentException("Negative width"); - if (h < 0) - throw new IllegalArgumentException("Negative height"); - this.w = w; - this.h = h; - } - - public void setUserData(Object obj) { userData = obj; } - public void setNextLocation(Rect nextLocation) { this.nextLocation = nextLocation; } - - // Helpers for computations. - - /** Returns the maximum x-coordinate contained within this - rectangle. Note that this returns a different result than Java - 2D's rectangles; for a rectangle of position (0, 0) and size (1, - 1) this will return 0, not 1. Returns -1 if the width of this - rectangle is 0. */ - public int maxX() { - if (w() < 1) - return -1; - return x() + w() - 1; - } - - /** Returns the maximum y-coordinate contained within this - rectangle. Note that this returns a different result than Java - 2D's rectangles; for a rectangle of position (0, 0) and size (1, - 1) this will return 0, not 1. Returns -1 if the height of this - rectangle is 0. */ - public int maxY() { - if (h() < 1) - return -1; - return y() + h() - 1; - } - - public boolean canContain(Rect other) { - return (w() >= other.w() && - h() >= other.h()); - } - - public String toString() { - return "[Rect x: " + x() + " y: " + y() + " w: " + w() + " h: " + h() + "]"; - } - - // Unclear whether it's a good idea to override hashCode and equals - // for these objects - /* - public boolean equals(Object other) { - if (other == null || (!(other instanceof Rect))) { - return false; - } - - Rect r = (Rect) other; - return (this.x() == r.x() && - this.y() == r.y() && - this.w() == r.w() && - this.h() == r.h()); - } - - public int hashCode() { - return (x + y * 13 + w * 17 + h * 23); - } - */ -} diff --git a/src/classes/com/sun/opengl/impl/packrect/RectVisitor.java b/src/classes/com/sun/opengl/impl/packrect/RectVisitor.java deleted file mode 100755 index 9fd253d43..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/RectVisitor.java +++ /dev/null @@ -1,47 +0,0 @@ -/* - * Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.awt.packrect; - -/** Iteration construct without exposing the internals of the - RectanglePacker and without implementing a complex Iterator. */ - -public interface RectVisitor { - public void visit(Rect rect); -} diff --git a/src/classes/com/sun/opengl/impl/packrect/RectanglePacker.java b/src/classes/com/sun/opengl/impl/packrect/RectanglePacker.java deleted file mode 100755 index f795fe00a..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/RectanglePacker.java +++ /dev/null @@ -1,295 +0,0 @@ -/* - * Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.awt.packrect; - -import java.util.*; - -/** Packs rectangles supplied by the user (typically representing - image regions) into a larger backing store rectangle (typically - representing a large texture). Supports automatic compaction of - the space on the backing store, and automatic expansion of the - backing store, when necessary. */ - -public class RectanglePacker { - private BackingStoreManager manager; - private Object backingStore; - private LevelSet levels; - private float EXPANSION_FACTOR = 0.5f; - private float SHRINK_FACTOR = 0.3f; - - private int initialWidth; - private int initialHeight; - - private int maxWidth = -1; - private int maxHeight = -1; - - static class RectHComparator implements Comparator { - public int compare(Object o1, Object o2) { - Rect r1 = (Rect) o1; - Rect r2 = (Rect) o2; - return r2.h() - r1.h(); - } - - public boolean equals(Object obj) { - return this == obj; - } - } - private static final Comparator rectHComparator = new RectHComparator(); - - public RectanglePacker(BackingStoreManager manager, - int initialWidth, - int initialHeight) { - this.manager = manager; - levels = new LevelSet(initialWidth, initialHeight); - this.initialWidth = initialWidth; - this.initialHeight = initialHeight; - } - - public Object getBackingStore() { - if (backingStore == null) { - backingStore = manager.allocateBackingStore(levels.w(), levels.h()); - } - - return backingStore; - } - - /** Sets up a maximum width and height for the backing store. These - are optional and if not specified the backing store will grow as - necessary. Setting up a maximum width and height introduces the - possibility that additions will fail; these are handled with the - BackingStoreManager's allocationFailed notification. */ - public void setMaxSize(int maxWidth, int maxHeight) { - this.maxWidth = maxWidth; - this.maxHeight = maxHeight; - } - - /** Decides upon an (x, y) position for the given rectangle (leaving - its width and height unchanged) and places it on the backing - store. May provoke re-layout of other Rects already added. */ - public void add(Rect rect) { - // Allocate backing store if we don't have any yet - if (backingStore == null) - backingStore = manager.allocateBackingStore(levels.w(), levels.h()); - - int attemptNumber = 0; - boolean tryAgain = false; - - do { - // Try to allocate - if (levels.add(rect)) - return; - - // Try to allocate with horizontal compaction - if (levels.compactAndAdd(rect, backingStore, manager)) - return; - - // Let the manager have a chance at potentially evicting some entries - tryAgain = manager.preExpand(rect, attemptNumber++); - } while (tryAgain); - - compactImpl(rect); - - // Retry the addition of the incoming rectangle - add(rect); - // Done - } - - /** Removes the given rectangle from this RectanglePacker. */ - public void remove(Rect rect) { - levels.remove(rect); - } - - /** Visits all Rects contained in this RectanglePacker. */ - public void visit(RectVisitor visitor) { - levels.visit(visitor); - } - - /** Returns the vertical fragmentation ratio of this - RectanglePacker. This is defined as the ratio of the sum of the - heights of all completely empty Levels divided by the overall - used height of the LevelSet. A high vertical fragmentation ratio - indicates that it may be profitable to perform a compaction. */ - public float verticalFragmentationRatio() { - return levels.verticalFragmentationRatio(); - } - - /** Forces a compaction cycle, which typically results in allocating - a new backing store and copying all entries to it. */ - public void compact() { - compactImpl(null); - } - - // The "cause" rect may be null - private void compactImpl(Rect cause) { - // Have to either expand, compact or both. Need to figure out what - // direction to go. Prefer to expand vertically. Expand - // horizontally only if rectangle being added is too wide. FIXME: - // may want to consider rebalancing the width and height to be - // more equal if it turns out we keep expanding in the vertical - // direction. - boolean done = false; - int newWidth = levels.w(); - int newHeight = levels.h(); - LevelSet nextLevelSet = null; - int attemptNumber = 0; - boolean needAdditionFailureNotification = false; - - while (!done) { - if (cause != null) { - if (cause.w() > newWidth) { - newWidth = cause.w(); - } else { - newHeight = (int) (newHeight * (1.0f + EXPANSION_FACTOR)); - } - } - - // Clamp to maximum values - needAdditionFailureNotification = false; - if (maxWidth > 0 && newWidth > maxWidth) { - newWidth = maxWidth; - needAdditionFailureNotification = true; - } - if (maxHeight > 0 && newHeight > maxHeight) { - newHeight = maxHeight; - needAdditionFailureNotification = true; - } - - nextLevelSet = new LevelSet(newWidth, newHeight); - - // Make copies of all existing rectangles - List/*<Rect>*/ newRects = new ArrayList/*<Rect>*/(); - for (Iterator i1 = levels.iterator(); i1.hasNext(); ) { - Level level = (Level) i1.next(); - for (Iterator i2 = level.iterator(); i2.hasNext(); ) { - Rect cur = (Rect) i2.next(); - Rect newRect = new Rect(0, 0, cur.w(), cur.h(), null); - cur.setNextLocation(newRect); - // Hook up the reverse mapping too for easier replacement - newRect.setNextLocation(cur); - newRects.add(newRect); - } - } - // Sort them by decreasing height (note: this isn't really - // guaranteed to improve the chances of a successful layout) - Collections.sort(newRects, rectHComparator); - // Try putting all of these rectangles into the new level set - done = true; - for (Iterator iter = newRects.iterator(); iter.hasNext(); ) { - if (!nextLevelSet.add((Rect) iter.next())) { - done = false; - break; - } - } - - if (done && cause != null) { - // Try to add the new rectangle as well - if (nextLevelSet.add(cause)) { - // We're OK - } else { - done = false; - } - } - - // Don't send addition failure notifications if we're only doing - // a compaction - if (!done && needAdditionFailureNotification && cause != null) { - manager.additionFailed(cause, attemptNumber); - } - ++attemptNumber; - } - - // See whether the implicit compaction that just occurred has - // yielded excess empty space. - if (nextLevelSet.getUsedHeight() > 0 && - nextLevelSet.getUsedHeight() < nextLevelSet.h() * SHRINK_FACTOR) { - int shrunkHeight = Math.max(initialHeight, - (int) (nextLevelSet.getUsedHeight() * (1.0f + EXPANSION_FACTOR))); - if (maxHeight > 0 && shrunkHeight > maxHeight) { - shrunkHeight = maxHeight; - } - nextLevelSet.setHeight(shrunkHeight); - } - - // If we temporarily added the new rectangle to the new LevelSet, - // take it out since we don't "really" add it here but in add(), above - if (cause != null) { - nextLevelSet.remove(cause); - } - - // OK, now we have a new layout and a mapping from the old to the - // new locations of rectangles on the backing store. Allocate a - // new backing store, move the contents over and deallocate the - // old one. - Object newBackingStore = manager.allocateBackingStore(nextLevelSet.w(), - nextLevelSet.h()); - manager.beginMovement(backingStore, newBackingStore); - for (Iterator i1 = levels.iterator(); i1.hasNext(); ) { - Level level = (Level) i1.next(); - for (Iterator i2 = level.iterator(); i2.hasNext(); ) { - Rect cur = (Rect) i2.next(); - manager.move(backingStore, cur, - newBackingStore, cur.getNextLocation()); - } - } - // Replace references to temporary rectangles with original ones - nextLevelSet.updateRectangleReferences(); - manager.endMovement(backingStore, newBackingStore); - // Now delete the old backing store - manager.deleteBackingStore(backingStore); - // Update to new versions of backing store and LevelSet - backingStore = newBackingStore; - levels = nextLevelSet; - } - - /** Clears all Rects contained in this RectanglePacker. */ - public void clear() { - levels.clear(); - } - - /** Disposes the backing store allocated by the - BackingStoreManager. This RectanglePacker may no longer be used - after calling this method. */ - public void dispose() { - if (backingStore != null) - manager.deleteBackingStore(backingStore); - backingStore = null; - levels = null; - } -} diff --git a/src/classes/com/sun/opengl/impl/packrect/package.html b/src/classes/com/sun/opengl/impl/packrect/package.html deleted file mode 100755 index 7f2522244..000000000 --- a/src/classes/com/sun/opengl/impl/packrect/package.html +++ /dev/null @@ -1,7 +0,0 @@ -This package implements a rectangle packing algorithm suitable for -tracking the placement of multiple rectangles inside a larger one. It -is useful for cases such as placing the contents of multiple windows -on a larger backing store texture for a compositing window manager; -placing multiple rasterized strings in a texture map for quick -rendering to the screen; and many other situations where it is useful -to carve up a larger texture into smaller pieces dynamically. <P> diff --git a/src/classes/com/sun/opengl/impl/registry/Registry.java b/src/classes/com/sun/opengl/impl/registry/Registry.java deleted file mode 100644 index f64de3a8c..000000000 --- a/src/classes/com/sun/opengl/impl/registry/Registry.java +++ /dev/null @@ -1,75 +0,0 @@ -/* - * License Applicability. Except to the extent portions of this file are - * made subject to an alternative license as permitted in the SGI Free - * Software License B, Version 1.1 (the "License"), the contents of this - * file are subject only to the provisions of the License. You may not use - * this file except in compliance with the License. You may obtain a copy - * of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 - * Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: - * - * http://oss.sgi.com/projects/FreeB - * - * Note that, as provided in the License, the Software is distributed on an - * "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS - * DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND - * CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A - * PARTICULAR PURPOSE, AND NON-INFRINGEMENT. - * - * NOTE: The Original Code (as defined below) has been licensed to Sun - * Microsystems, Inc. ("Sun") under the SGI Free Software License B - * (Version 1.1), shown above ("SGI License"). Pursuant to Section - * 3.2(3) of the SGI License, Sun is distributing the Covered Code to - * you under an alternative license ("Alternative License"). This - * Alternative License includes all of the provisions of the SGI License - * except that Section 2.2 and 11 are omitted. Any differences between - * the Alternative License and the SGI License are offered solely by Sun - * and not by SGI. - * - * Original Code. The Original Code is: OpenGL Sample Implementation, - * Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, - * Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. - * Copyright in any portions created by third parties is as indicated - * elsewhere herein. All Rights Reserved. - * - * Additional Notice Provisions: The application programming interfaces - * established by SGI in conjunction with the Original Code are The - * OpenGL(R) Graphics System: A Specification (Version 1.2.1), released - * April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version - * 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X - * Window System(R) (Version 1.3), released October 19, 1998. This software - * was created using the OpenGL(R) version 1.2.1 Sample Implementation - * published by SGI, but has not been independently verified as being - * compliant with the OpenGL(R) version 1.2.1 Specification. - */ - -package com.sun.opengl.impl.glu.registry; - -import java.util.regex.*; -import javax.media.opengl.glu.GLU; - -/** - * - * @author Administrator - */ -public class Registry { - - /** Creates a new instance of Registry */ - public Registry() { - } - - public static String gluGetString(int name) { - if( name == GLU.GLU_VERSION ) { - return( "1.3" ); - } else if( name == GLU.GLU_EXTENSIONS ) { - return( "GLU_EXT_nurbs_tessellator GLU_EXT_object_space_tess " ); - } - return( null ); - } - - public static boolean gluCheckExtension( String extName, String extString ) { - if( extName == null || extString == null ) { - return( false ); - } - return( Pattern.compile( extName + "\\b" ).matcher( extString ).find() ); - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/ActiveRegion.java b/src/classes/com/sun/opengl/impl/tessellator/ActiveRegion.java deleted file mode 100644 index a04c5c74b..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/ActiveRegion.java +++ /dev/null @@ -1,69 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - - -class ActiveRegion { - GLUhalfEdge eUp; /* upper edge, directed right to left */ - DictNode nodeUp; /* dictionary node corresponding to eUp */ - int windingNumber; /* used to determine which regions are - * inside the polygon */ - boolean inside; /* is this region inside the polygon? */ - boolean sentinel; /* marks fake edges at t = +/-infinity */ - boolean dirty; /* marks regions where the upper or lower - * edge has changed, but we haven't checked - * whether they intersect yet */ - boolean fixUpperEdge; /* marks temporary edges introduced when - * we process a "right vertex" (one without - * any edges leaving to the right) */ -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/CachedVertex.java b/src/classes/com/sun/opengl/impl/tessellator/CachedVertex.java deleted file mode 100644 index 993671c0d..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/CachedVertex.java +++ /dev/null @@ -1,58 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class CachedVertex { - public double[] coords = new double[3]; - public Object data; -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/Dict.java b/src/classes/com/sun/opengl/impl/tessellator/Dict.java deleted file mode 100644 index d2f6e3790..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/Dict.java +++ /dev/null @@ -1,140 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class Dict { - DictNode head; - Object frame; - DictLeq leq; - - private Dict() { - } - - static Dict dictNewDict(Object frame, DictLeq leq) { - Dict dict = new Dict(); - dict.head = new DictNode(); - - dict.head.key = null; - dict.head.next = dict.head; - dict.head.prev = dict.head; - - dict.frame = frame; - dict.leq = leq; - - return dict; - } - - static void dictDeleteDict(Dict dict) { - dict.head = null; - dict.frame = null; - dict.leq = null; - } - - static DictNode dictInsert(Dict dict, Object key) { - return dictInsertBefore(dict, dict.head, key); - } - - static DictNode dictInsertBefore(Dict dict, DictNode node, Object key) { - do { - node = node.prev; - } while (node.key != null && !dict.leq.leq(dict.frame, node.key, key)); - - DictNode newNode = new DictNode(); - newNode.key = key; - newNode.next = node.next; - node.next.prev = newNode; - newNode.prev = node; - node.next = newNode; - - return newNode; - } - - static Object dictKey(DictNode aNode) { - return aNode.key; - } - - static DictNode dictSucc(DictNode aNode) { - return aNode.next; - } - - static DictNode dictPred(DictNode aNode) { - return aNode.prev; - } - - static DictNode dictMin(Dict aDict) { - return aDict.head.next; - } - - static DictNode dictMax(Dict aDict) { - return aDict.head.prev; - } - - static void dictDelete(Dict dict, DictNode node) { - node.next.prev = node.prev; - node.prev.next = node.next; - } - - static DictNode dictSearch(Dict dict, Object key) { - DictNode node = dict.head; - - do { - node = node.next; - } while (node.key != null && !(dict.leq.leq(dict.frame, key, node.key))); - - return node; - } - - public interface DictLeq { - boolean leq(Object frame, Object key1, Object key2); - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/DictNode.java b/src/classes/com/sun/opengl/impl/tessellator/DictNode.java deleted file mode 100644 index 1222bd948..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/DictNode.java +++ /dev/null @@ -1,59 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class DictNode { - Object key; - DictNode next; - DictNode prev; -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/GLUface.java b/src/classes/com/sun/opengl/impl/tessellator/GLUface.java deleted file mode 100644 index f0589dbea..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/GLUface.java +++ /dev/null @@ -1,65 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class GLUface { - public GLUface next; /* next face (never NULL) */ - public GLUface prev; /* previous face (never NULL) */ - public GLUhalfEdge anEdge; /* a half edge with this left face */ - public Object data; /* room for client's data */ - - /* Internal data (keep hidden) */ - public GLUface trail; /* "stack" for conversion to strips */ - public boolean marked; /* flag for conversion to strips */ - public boolean inside; /* this face is in the polygon interior */ -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/GLUhalfEdge.java b/src/classes/com/sun/opengl/impl/tessellator/GLUhalfEdge.java deleted file mode 100644 index 1b6e81cc5..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/GLUhalfEdge.java +++ /dev/null @@ -1,71 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class GLUhalfEdge { - public GLUhalfEdge next; /* doubly-linked list (prev==Sym->next) */ - public GLUhalfEdge Sym; /* same edge, opposite direction */ - public GLUhalfEdge Onext; /* next edge CCW around origin */ - public GLUhalfEdge Lnext; /* next edge CCW around left face */ - public GLUvertex Org; /* origin vertex (Overtex too long) */ - public com.sun.opengl.impl.glu.tessellator.GLUface Lface; /* left face */ - - /* Internal data (keep hidden) */ - public com.sun.opengl.impl.glu.tessellator.ActiveRegion activeRegion; /* a region with this upper edge (sweep.c) */ - public int winding; /* change in winding number when crossing */ - public boolean first; - - public GLUhalfEdge(boolean first) { - this.first = first; - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/GLUmesh.java b/src/classes/com/sun/opengl/impl/tessellator/GLUmesh.java deleted file mode 100644 index 73fbe815e..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/GLUmesh.java +++ /dev/null @@ -1,60 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class GLUmesh { - GLUvertex vHead = new GLUvertex(); /* dummy header for vertex list */ - com.sun.opengl.impl.glu.tessellator.GLUface fHead = new GLUface(); /* dummy header for face list */ - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eHead = new GLUhalfEdge(true); /* dummy header for edge list */ - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eHeadSym = new GLUhalfEdge(false); /* and its symmetric counterpart */ -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/GLUtessellatorImpl.java b/src/classes/com/sun/opengl/impl/tessellator/GLUtessellatorImpl.java deleted file mode 100644 index 3a26953c8..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/GLUtessellatorImpl.java +++ /dev/null @@ -1,636 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -import com.sun.opengl.impl.glu.tessellator.*; -import javax.media.opengl.*; -import javax.media.opengl.glu.*; -import javax.media.opengl.glu.gl2.*; - -public class GLUtessellatorImpl implements GLUtessellator { - public static final int TESS_MAX_CACHE = 100; - - private int state; /* what begin/end calls have we seen? */ - - private GLUhalfEdge lastEdge; /* lastEdge->Org is the most recent vertex */ - GLUmesh mesh; /* stores the input contours, and eventually - the tessellation itself */ - - /*** state needed for projecting onto the sweep plane ***/ - - double[] normal = new double[3]; /* user-specified normal (if provided) */ - double[] sUnit = new double[3]; /* unit vector in s-direction (debugging) */ - double[] tUnit = new double[3]; /* unit vector in t-direction (debugging) */ - - /*** state needed for the line sweep ***/ - - private double relTolerance; /* tolerance for merging features */ - int windingRule; /* rule for determining polygon interior */ - boolean fatalError; /* fatal error: needed combine callback */ - - Dict dict; /* edge dictionary for sweep line */ - PriorityQ pq; /* priority queue of vertex events */ - GLUvertex event; /* current sweep event being processed */ - - /*** state needed for rendering callbacks (see render.c) ***/ - - boolean flagBoundary; /* mark boundary edges (use EdgeFlag) */ - boolean boundaryOnly; /* Extract contours, not triangles */ - GLUface lonelyTriList; - /* list of triangles which could not be rendered as strips or fans */ - - - - /*** state needed to cache single-contour polygons for renderCache() */ - - private boolean flushCacheOnNextVertex; /* empty cache on next vertex() call */ - int cacheCount; /* number of cached vertices */ - CachedVertex[] cache = new CachedVertex[TESS_MAX_CACHE]; /* the vertex data */ - - /*** rendering callbacks that also pass polygon data ***/ - private Object polygonData; /* client data for current polygon */ - - private GLUtessellatorCallback callBegin; - private GLUtessellatorCallback callEdgeFlag; - private GLUtessellatorCallback callVertex; - private GLUtessellatorCallback callEnd; -// private GLUtessellatorCallback callMesh; - private GLUtessellatorCallback callError; - private GLUtessellatorCallback callCombine; - - private GLUtessellatorCallback callBeginData; - private GLUtessellatorCallback callEdgeFlagData; - private GLUtessellatorCallback callVertexData; - private GLUtessellatorCallback callEndData; -// private GLUtessellatorCallback callMeshData; - private GLUtessellatorCallback callErrorData; - private GLUtessellatorCallback callCombineData; - - private static final double GLU_TESS_DEFAULT_TOLERANCE = 0.0; -// private static final int GLU_TESS_MESH = 100112; /* void (*)(GLUmesh *mesh) */ - private static GLUtessellatorCallback NULL_CB = new GLUtessellatorCallbackAdapter(); - -// #define MAX_FAST_ALLOC (MAX(sizeof(EdgePair), \ -// MAX(sizeof(GLUvertex),sizeof(GLUface)))) - - private GLUtessellatorImpl() { - state = TessState.T_DORMANT; - - normal[0] = 0; - normal[1] = 0; - normal[2] = 0; - - relTolerance = GLU_TESS_DEFAULT_TOLERANCE; - windingRule = GLU.GLU_TESS_WINDING_ODD; - flagBoundary = false; - boundaryOnly = false; - - callBegin = NULL_CB; - callEdgeFlag = NULL_CB; - callVertex = NULL_CB; - callEnd = NULL_CB; - callError = NULL_CB; - callCombine = NULL_CB; -// callMesh = NULL_CB; - - callBeginData = NULL_CB; - callEdgeFlagData = NULL_CB; - callVertexData = NULL_CB; - callEndData = NULL_CB; - callErrorData = NULL_CB; - callCombineData = NULL_CB; - - polygonData = null; - - for (int i = 0; i < cache.length; i++) { - cache[i] = new CachedVertex(); - } - } - - static public GLUtessellator gluNewTess() - { - return new GLUtessellatorImpl(); - } - - - private void makeDormant() { - /* Return the tessellator to its original dormant state. */ - - if (mesh != null) { - Mesh.__gl_meshDeleteMesh(mesh); - } - state = TessState.T_DORMANT; - lastEdge = null; - mesh = null; - } - - private void requireState(int newState) { - if (state != newState) gotoState(newState); - } - - private void gotoState(int newState) { - while (state != newState) { - /* We change the current state one level at a time, to get to - * the desired state. - */ - if (state < newState) { - if (state == TessState.T_DORMANT) { - callErrorOrErrorData(GLU.GLU_TESS_MISSING_BEGIN_POLYGON); - gluTessBeginPolygon(null); - } else if (state == TessState.T_IN_POLYGON) { - callErrorOrErrorData(GLU.GLU_TESS_MISSING_BEGIN_CONTOUR); - gluTessBeginContour(); - } - } else { - if (state == TessState.T_IN_CONTOUR) { - callErrorOrErrorData(GLU.GLU_TESS_MISSING_END_CONTOUR); - gluTessEndContour(); - } else if (state == TessState.T_IN_POLYGON) { - callErrorOrErrorData(GLU.GLU_TESS_MISSING_END_POLYGON); - /* gluTessEndPolygon( tess ) is too much work! */ - makeDormant(); - } - } - } - } - - public void gluDeleteTess() { - requireState(TessState.T_DORMANT); - } - - public void gluTessProperty(int which, double value) { - switch (which) { - case GLU.GLU_TESS_TOLERANCE: - if (value < 0.0 || value > 1.0) break; - relTolerance = value; - return; - - case GLU.GLU_TESS_WINDING_RULE: - int windingRule = (int) value; - if (windingRule != value) break; /* not an integer */ - - switch (windingRule) { - case GLU.GLU_TESS_WINDING_ODD: - case GLU.GLU_TESS_WINDING_NONZERO: - case GLU.GLU_TESS_WINDING_POSITIVE: - case GLU.GLU_TESS_WINDING_NEGATIVE: - case GLU.GLU_TESS_WINDING_ABS_GEQ_TWO: - this.windingRule = windingRule; - return; - default: - break; - } - - case GLU.GLU_TESS_BOUNDARY_ONLY: - boundaryOnly = (value != 0); - return; - - default: - callErrorOrErrorData(GLU.GLU_INVALID_ENUM); - return; - } - callErrorOrErrorData(GLU.GLU_INVALID_VALUE); - } - -/* Returns tessellator property */ - public void gluGetTessProperty(int which, double[] value, int value_offset) { - switch (which) { - case GLU.GLU_TESS_TOLERANCE: -/* tolerance should be in range [0..1] */ - assert (0.0 <= relTolerance && relTolerance <= 1.0); - value[value_offset] = relTolerance; - break; - case GLU.GLU_TESS_WINDING_RULE: - assert (windingRule == GLU.GLU_TESS_WINDING_ODD || - windingRule == GLU.GLU_TESS_WINDING_NONZERO || - windingRule == GLU.GLU_TESS_WINDING_POSITIVE || - windingRule == GLU.GLU_TESS_WINDING_NEGATIVE || - windingRule == GLU.GLU_TESS_WINDING_ABS_GEQ_TWO); - value[value_offset] = windingRule; - break; - case GLU.GLU_TESS_BOUNDARY_ONLY: - assert (boundaryOnly == true || boundaryOnly == false); - value[value_offset] = boundaryOnly ? 1 : 0; - break; - default: - value[value_offset] = 0.0; - callErrorOrErrorData(GLU.GLU_INVALID_ENUM); - break; - } - } /* gluGetTessProperty() */ - - public void gluTessNormal(double x, double y, double z) { - normal[0] = x; - normal[1] = y; - normal[2] = z; - } - - public void gluTessCallback(int which, GLUtessellatorCallback aCallback) { - switch (which) { - case GLU.GLU_TESS_BEGIN: - callBegin = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_BEGIN_DATA: - callBeginData = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_EDGE_FLAG: - callEdgeFlag = aCallback == null ? NULL_CB : aCallback; -/* If the client wants boundary edges to be flagged, - * we render everything as separate triangles (no strips or fans). - */ - flagBoundary = aCallback != null; - return; - case GLU.GLU_TESS_EDGE_FLAG_DATA: - callEdgeFlagData = callBegin = aCallback == null ? NULL_CB : aCallback; -/* If the client wants boundary edges to be flagged, - * we render everything as separate triangles (no strips or fans). - */ - flagBoundary = (aCallback != null); - return; - case GLU.GLU_TESS_VERTEX: - callVertex = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_VERTEX_DATA: - callVertexData = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_END: - callEnd = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_END_DATA: - callEndData = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_ERROR: - callError = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_ERROR_DATA: - callErrorData = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_COMBINE: - callCombine = aCallback == null ? NULL_CB : aCallback; - return; - case GLU.GLU_TESS_COMBINE_DATA: - callCombineData = aCallback == null ? NULL_CB : aCallback; - return; -// case GLU_TESS_MESH: -// callMesh = aCallback == null ? NULL_CB : aCallback; -// return; - default: - callErrorOrErrorData(GLU.GLU_INVALID_ENUM); - return; - } - } - - private boolean addVertex(double[] coords, Object vertexData) { - GLUhalfEdge e; - - e = lastEdge; - if (e == null) { -/* Make a self-loop (one vertex, one edge). */ - - e = Mesh.__gl_meshMakeEdge(mesh); - if (e == null) return false; - if (!Mesh.__gl_meshSplice(e, e.Sym)) return false; - } else { -/* Create a new vertex and edge which immediately follow e - * in the ordering around the left face. - */ - if (Mesh.__gl_meshSplitEdge(e) == null) return false; - e = e.Lnext; - } - -/* The new vertex is now e.Org. */ - e.Org.data = vertexData; - e.Org.coords[0] = coords[0]; - e.Org.coords[1] = coords[1]; - e.Org.coords[2] = coords[2]; - -/* The winding of an edge says how the winding number changes as we - * cross from the edge''s right face to its left face. We add the - * vertices in such an order that a CCW contour will add +1 to - * the winding number of the region inside the contour. - */ - e.winding = 1; - e.Sym.winding = -1; - - lastEdge = e; - - return true; - } - - private void cacheVertex(double[] coords, Object vertexData) { - if (cache[cacheCount] == null) { - cache[cacheCount] = new CachedVertex(); - } - - CachedVertex v = cache[cacheCount]; - - v.data = vertexData; - v.coords[0] = coords[0]; - v.coords[1] = coords[1]; - v.coords[2] = coords[2]; - ++cacheCount; - } - - - private boolean flushCache() { - CachedVertex[] v = cache; - - mesh = Mesh.__gl_meshNewMesh(); - if (mesh == null) return false; - - for (int i = 0; i < cacheCount; i++) { - CachedVertex vertex = v[i]; - if (!addVertex(vertex.coords, vertex.data)) return false; - } - cacheCount = 0; - flushCacheOnNextVertex = false; - - return true; - } - - public void gluTessVertex(double[] coords, int coords_offset, Object vertexData) { - int i; - boolean tooLarge = false; - double x; - double[] clamped = new double[3]; - - requireState(TessState.T_IN_CONTOUR); - - if (flushCacheOnNextVertex) { - if (!flushCache()) { - callErrorOrErrorData(GLU.GLU_OUT_OF_MEMORY); - return; - } - lastEdge = null; - } - for (i = 0; i < 3; ++i) { - x = coords[i+coords_offset]; - if (x < -GLU.GLU_TESS_MAX_COORD) { - x = -GLU.GLU_TESS_MAX_COORD; - tooLarge = true; - } - if (x > GLU.GLU_TESS_MAX_COORD) { - x = GLU.GLU_TESS_MAX_COORD; - tooLarge = true; - } - clamped[i] = x; - } - if (tooLarge) { - callErrorOrErrorData(GLU.GLU_TESS_COORD_TOO_LARGE); - } - - if (mesh == null) { - if (cacheCount < TESS_MAX_CACHE) { - cacheVertex(clamped, vertexData); - return; - } - if (!flushCache()) { - callErrorOrErrorData(GLU.GLU_OUT_OF_MEMORY); - return; - } - } - - if (!addVertex(clamped, vertexData)) { - callErrorOrErrorData(GLU.GLU_OUT_OF_MEMORY); - } - } - - - public void gluTessBeginPolygon(Object data) { - requireState(TessState.T_DORMANT); - - state = TessState.T_IN_POLYGON; - cacheCount = 0; - flushCacheOnNextVertex = false; - mesh = null; - - polygonData = data; - } - - - public void gluTessBeginContour() { - requireState(TessState.T_IN_POLYGON); - - state = TessState.T_IN_CONTOUR; - lastEdge = null; - if (cacheCount > 0) { -/* Just set a flag so we don't get confused by empty contours - * -- these can be generated accidentally with the obsolete - * NextContour() interface. - */ - flushCacheOnNextVertex = true; - } - } - - - public void gluTessEndContour() { - requireState(TessState.T_IN_CONTOUR); - state = TessState.T_IN_POLYGON; - } - - public void gluTessEndPolygon() { - GLUmesh mesh; - - try { - requireState(TessState.T_IN_POLYGON); - state = TessState.T_DORMANT; - - if (this.mesh == null) { - if (!flagBoundary /*&& callMesh == NULL_CB*/) { - -/* Try some special code to make the easy cases go quickly - * (eg. convex polygons). This code does NOT handle multiple contours, - * intersections, edge flags, and of course it does not generate - * an explicit mesh either. - */ - if (Render.__gl_renderCache(this)) { - polygonData = null; - return; - } - } - if (!flushCache()) throw new RuntimeException(); /* could've used a label*/ - } - -/* Determine the polygon normal and project vertices onto the plane - * of the polygon. - */ - Normal.__gl_projectPolygon(this); - -/* __gl_computeInterior( tess ) computes the planar arrangement specified - * by the given contours, and further subdivides this arrangement - * into regions. Each region is marked "inside" if it belongs - * to the polygon, according to the rule given by windingRule. - * Each interior region is guaranteed be monotone. - */ - if (!Sweep.__gl_computeInterior(this)) { - throw new RuntimeException(); /* could've used a label */ - } - - mesh = this.mesh; - if (!fatalError) { - boolean rc = true; - -/* If the user wants only the boundary contours, we throw away all edges - * except those which separate the interior from the exterior. - * Otherwise we tessellate all the regions marked "inside". - */ - if (boundaryOnly) { - rc = TessMono.__gl_meshSetWindingNumber(mesh, 1, true); - } else { - rc = TessMono.__gl_meshTessellateInterior(mesh); - } - if (!rc) throw new RuntimeException(); /* could've used a label */ - - Mesh.__gl_meshCheckMesh(mesh); - - if (callBegin != NULL_CB || callEnd != NULL_CB - || callVertex != NULL_CB || callEdgeFlag != NULL_CB - || callBeginData != NULL_CB - || callEndData != NULL_CB - || callVertexData != NULL_CB - || callEdgeFlagData != NULL_CB) { - if (boundaryOnly) { - Render.__gl_renderBoundary(this, mesh); /* output boundary contours */ - } else { - Render.__gl_renderMesh(this, mesh); /* output strips and fans */ - } - } -// if (callMesh != NULL_CB) { -// -///* Throw away the exterior faces, so that all faces are interior. -// * This way the user doesn't have to check the "inside" flag, -// * and we don't need to even reveal its existence. It also leaves -// * the freedom for an implementation to not generate the exterior -// * faces in the first place. -// */ -// TessMono.__gl_meshDiscardExterior(mesh); -// callMesh.mesh(mesh); /* user wants the mesh itself */ -// mesh = null; -// polygonData = null; -// return; -// } - } - Mesh.__gl_meshDeleteMesh(mesh); - polygonData = null; - mesh = null; - } catch (Exception e) { - e.printStackTrace(); - callErrorOrErrorData(GLU.GLU_OUT_OF_MEMORY); - } - } - - /*******************************************************/ - -/* Obsolete calls -- for backward compatibility */ - - public void gluBeginPolygon() { - gluTessBeginPolygon(null); - gluTessBeginContour(); - } - - -/*ARGSUSED*/ - public void gluNextContour(int type) { - gluTessEndContour(); - gluTessBeginContour(); - } - - - public void gluEndPolygon() { - gluTessEndContour(); - gluTessEndPolygon(); - } - - void callBeginOrBeginData(int a) { - if (callBeginData != NULL_CB) - callBeginData.beginData(a, polygonData); - else - callBegin.begin(a); - } - - void callVertexOrVertexData(Object a) { - if (callVertexData != NULL_CB) - callVertexData.vertexData(a, polygonData); - else - callVertex.vertex(a); - } - - void callEdgeFlagOrEdgeFlagData(boolean a) { - if (callEdgeFlagData != NULL_CB) - callEdgeFlagData.edgeFlagData(a, polygonData); - else - callEdgeFlag.edgeFlag(a); - } - - void callEndOrEndData() { - if (callEndData != NULL_CB) - callEndData.endData(polygonData); - else - callEnd.end(); - } - - void callCombineOrCombineData(double[] coords, Object[] vertexData, float[] weights, Object[] outData) { - if (callCombineData != NULL_CB) - callCombineData.combineData(coords, vertexData, weights, outData, polygonData); - else - callCombine.combine(coords, vertexData, weights, outData); - } - - void callErrorOrErrorData(int a) { - if (callErrorData != NULL_CB) - callErrorData.errorData(a, polygonData); - else - callError.error(a); - } - -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/GLUvertex.java b/src/classes/com/sun/opengl/impl/tessellator/GLUvertex.java deleted file mode 100644 index e97767a12..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/GLUvertex.java +++ /dev/null @@ -1,65 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class GLUvertex { - public GLUvertex next; /* next vertex (never NULL) */ - public GLUvertex prev; /* previous vertex (never NULL) */ - public com.sun.opengl.impl.glu.tessellator.GLUhalfEdge anEdge; /* a half-edge with this origin */ - public Object data; /* client's data */ - - /* Internal data (keep hidden) */ - public double[] coords = new double[3]; /* vertex location in 3D */ - public double s, t; /* projection onto the sweep plane */ - public int pqHandle; /* to allow deletion from priority queue */ -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/Geom.java b/src/classes/com/sun/opengl/impl/tessellator/Geom.java deleted file mode 100644 index 6b31cc30e..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/Geom.java +++ /dev/null @@ -1,318 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class Geom { - private Geom() { - } - - /* Given three vertices u,v,w such that VertLeq(u,v) && VertLeq(v,w), - * evaluates the t-coord of the edge uw at the s-coord of the vertex v. - * Returns v->t - (uw)(v->s), ie. the signed distance from uw to v. - * If uw is vertical (and thus passes thru v), the result is zero. - * - * The calculation is extremely accurate and stable, even when v - * is very close to u or w. In particular if we set v->t = 0 and - * let r be the negated result (this evaluates (uw)(v->s)), then - * r is guaranteed to satisfy MIN(u->t,w->t) <= r <= MAX(u->t,w->t). - */ - static double EdgeEval(GLUvertex u, GLUvertex v, GLUvertex w) { - double gapL, gapR; - - assert (VertLeq(u, v) && VertLeq(v, w)); - - gapL = v.s - u.s; - gapR = w.s - v.s; - - if (gapL + gapR > 0) { - if (gapL < gapR) { - return (v.t - u.t) + (u.t - w.t) * (gapL / (gapL + gapR)); - } else { - return (v.t - w.t) + (w.t - u.t) * (gapR / (gapL + gapR)); - } - } - /* vertical line */ - return 0; - } - - static double EdgeSign(GLUvertex u, GLUvertex v, GLUvertex w) { - double gapL, gapR; - - assert (VertLeq(u, v) && VertLeq(v, w)); - - gapL = v.s - u.s; - gapR = w.s - v.s; - - if (gapL + gapR > 0) { - return (v.t - w.t) * gapL + (v.t - u.t) * gapR; - } - /* vertical line */ - return 0; - } - - - /*********************************************************************** - * Define versions of EdgeSign, EdgeEval with s and t transposed. - */ - - static double TransEval(GLUvertex u, GLUvertex v, GLUvertex w) { - /* Given three vertices u,v,w such that TransLeq(u,v) && TransLeq(v,w), - * evaluates the t-coord of the edge uw at the s-coord of the vertex v. - * Returns v->s - (uw)(v->t), ie. the signed distance from uw to v. - * If uw is vertical (and thus passes thru v), the result is zero. - * - * The calculation is extremely accurate and stable, even when v - * is very close to u or w. In particular if we set v->s = 0 and - * let r be the negated result (this evaluates (uw)(v->t)), then - * r is guaranteed to satisfy MIN(u->s,w->s) <= r <= MAX(u->s,w->s). - */ - double gapL, gapR; - - assert (TransLeq(u, v) && TransLeq(v, w)); - - gapL = v.t - u.t; - gapR = w.t - v.t; - - if (gapL + gapR > 0) { - if (gapL < gapR) { - return (v.s - u.s) + (u.s - w.s) * (gapL / (gapL + gapR)); - } else { - return (v.s - w.s) + (w.s - u.s) * (gapR / (gapL + gapR)); - } - } - /* vertical line */ - return 0; - } - - static double TransSign(GLUvertex u, GLUvertex v, GLUvertex w) { - /* Returns a number whose sign matches TransEval(u,v,w) but which - * is cheaper to evaluate. Returns > 0, == 0 , or < 0 - * as v is above, on, or below the edge uw. - */ - double gapL, gapR; - - assert (TransLeq(u, v) && TransLeq(v, w)); - - gapL = v.t - u.t; - gapR = w.t - v.t; - - if (gapL + gapR > 0) { - return (v.s - w.s) * gapL + (v.s - u.s) * gapR; - } - /* vertical line */ - return 0; - } - - - static boolean VertCCW(GLUvertex u, GLUvertex v, GLUvertex w) { - /* For almost-degenerate situations, the results are not reliable. - * Unless the floating-point arithmetic can be performed without - * rounding errors, *any* implementation will give incorrect results - * on some degenerate inputs, so the client must have some way to - * handle this situation. - */ - return (u.s * (v.t - w.t) + v.s * (w.t - u.t) + w.s * (u.t - v.t)) >= 0; - } - -/* Given parameters a,x,b,y returns the value (b*x+a*y)/(a+b), - * or (x+y)/2 if a==b==0. It requires that a,b >= 0, and enforces - * this in the rare case that one argument is slightly negative. - * The implementation is extremely stable numerically. - * In particular it guarantees that the result r satisfies - * MIN(x,y) <= r <= MAX(x,y), and the results are very accurate - * even when a and b differ greatly in magnitude. - */ - static double Interpolate(double a, double x, double b, double y) { - a = (a < 0) ? 0 : a; - b = (b < 0) ? 0 : b; - if (a <= b) { - if (b == 0) { - return (x + y) / 2.0; - } else { - return (x + (y - x) * (a / (a + b))); - } - } else { - return (y + (x - y) * (b / (a + b))); - } - } - - static void EdgeIntersect(GLUvertex o1, GLUvertex d1, - GLUvertex o2, GLUvertex d2, - GLUvertex v) -/* Given edges (o1,d1) and (o2,d2), compute their point of intersection. - * The computed point is guaranteed to lie in the intersection of the - * bounding rectangles defined by each edge. - */ { - double z1, z2; - - /* This is certainly not the most efficient way to find the intersection - * of two line segments, but it is very numerically stable. - * - * Strategy: find the two middle vertices in the VertLeq ordering, - * and interpolate the intersection s-value from these. Then repeat - * using the TransLeq ordering to find the intersection t-value. - */ - - if (!VertLeq(o1, d1)) { - GLUvertex temp = o1; - o1 = d1; - d1 = temp; - } - if (!VertLeq(o2, d2)) { - GLUvertex temp = o2; - o2 = d2; - d2 = temp; - } - if (!VertLeq(o1, o2)) { - GLUvertex temp = o1; - o1 = o2; - o2 = temp; - temp = d1; - d1 = d2; - d2 = temp; - } - - if (!VertLeq(o2, d1)) { - /* Technically, no intersection -- do our best */ - v.s = (o2.s + d1.s) / 2.0; - } else if (VertLeq(d1, d2)) { - /* Interpolate between o2 and d1 */ - z1 = EdgeEval(o1, o2, d1); - z2 = EdgeEval(o2, d1, d2); - if (z1 + z2 < 0) { - z1 = -z1; - z2 = -z2; - } - v.s = Interpolate(z1, o2.s, z2, d1.s); - } else { - /* Interpolate between o2 and d2 */ - z1 = EdgeSign(o1, o2, d1); - z2 = -EdgeSign(o1, d2, d1); - if (z1 + z2 < 0) { - z1 = -z1; - z2 = -z2; - } - v.s = Interpolate(z1, o2.s, z2, d2.s); - } - - /* Now repeat the process for t */ - - if (!TransLeq(o1, d1)) { - GLUvertex temp = o1; - o1 = d1; - d1 = temp; - } - if (!TransLeq(o2, d2)) { - GLUvertex temp = o2; - o2 = d2; - d2 = temp; - } - if (!TransLeq(o1, o2)) { - GLUvertex temp = o2; - o2 = o1; - o1 = temp; - temp = d2; - d2 = d1; - d1 = temp; - } - - if (!TransLeq(o2, d1)) { - /* Technically, no intersection -- do our best */ - v.t = (o2.t + d1.t) / 2.0; - } else if (TransLeq(d1, d2)) { - /* Interpolate between o2 and d1 */ - z1 = TransEval(o1, o2, d1); - z2 = TransEval(o2, d1, d2); - if (z1 + z2 < 0) { - z1 = -z1; - z2 = -z2; - } - v.t = Interpolate(z1, o2.t, z2, d1.t); - } else { - /* Interpolate between o2 and d2 */ - z1 = TransSign(o1, o2, d1); - z2 = -TransSign(o1, d2, d1); - if (z1 + z2 < 0) { - z1 = -z1; - z2 = -z2; - } - v.t = Interpolate(z1, o2.t, z2, d2.t); - } - } - - static boolean VertEq(GLUvertex u, GLUvertex v) { - return u.s == v.s && u.t == v.t; - } - - static boolean VertLeq(GLUvertex u, GLUvertex v) { - return u.s < v.s || (u.s == v.s && u.t <= v.t); - } - -/* Versions of VertLeq, EdgeSign, EdgeEval with s and t transposed. */ - - static boolean TransLeq(GLUvertex u, GLUvertex v) { - return u.t < v.t || (u.t == v.t && u.s <= v.s); - } - - static boolean EdgeGoesLeft(GLUhalfEdge e) { - return VertLeq(e.Sym.Org, e.Org); - } - - static boolean EdgeGoesRight(GLUhalfEdge e) { - return VertLeq(e.Org, e.Sym.Org); - } - - static double VertL1dist(GLUvertex u, GLUvertex v) { - return Math.abs(u.s - v.s) + Math.abs(u.t - v.t); - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/Mesh.java b/src/classes/com/sun/opengl/impl/tessellator/Mesh.java deleted file mode 100644 index 290fb1037..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/Mesh.java +++ /dev/null @@ -1,734 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class Mesh { - private Mesh() { - } - - /************************ Utility Routines ************************/ -/* MakeEdge creates a new pair of half-edges which form their own loop. - * No vertex or face structures are allocated, but these must be assigned - * before the current edge operation is completed. - */ - static com.sun.opengl.impl.glu.tessellator.GLUhalfEdge MakeEdge(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eNext) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eSym; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge ePrev; - -// EdgePair * pair = (EdgePair *) -// memAlloc(sizeof(EdgePair)); -// if (pair == NULL) return NULL; -// -// e = &pair - > e; - e = new com.sun.opengl.impl.glu.tessellator.GLUhalfEdge(true); -// eSym = &pair - > eSym; - eSym = new com.sun.opengl.impl.glu.tessellator.GLUhalfEdge(false); - - - /* Make sure eNext points to the first edge of the edge pair */ - if (!eNext.first) { - eNext = eNext.Sym; - } - - /* Insert in circular doubly-linked list before eNext. - * Note that the prev pointer is stored in Sym->next. - */ - ePrev = eNext.Sym.next; - eSym.next = ePrev; - ePrev.Sym.next = e; - e.next = eNext; - eNext.Sym.next = eSym; - - e.Sym = eSym; - e.Onext = e; - e.Lnext = eSym; - e.Org = null; - e.Lface = null; - e.winding = 0; - e.activeRegion = null; - - eSym.Sym = e; - eSym.Onext = eSym; - eSym.Lnext = e; - eSym.Org = null; - eSym.Lface = null; - eSym.winding = 0; - eSym.activeRegion = null; - - return e; - } - -/* Splice( a, b ) is best described by the Guibas/Stolfi paper or the - * CS348a notes (see mesh.h). Basically it modifies the mesh so that - * a->Onext and b->Onext are exchanged. This can have various effects - * depending on whether a and b belong to different face or vertex rings. - * For more explanation see __gl_meshSplice() below. - */ - static void Splice(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge a, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge b) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge aOnext = a.Onext; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge bOnext = b.Onext; - - aOnext.Sym.Lnext = b; - bOnext.Sym.Lnext = a; - a.Onext = bOnext; - b.Onext = aOnext; - } - -/* MakeVertex( newVertex, eOrig, vNext ) attaches a new vertex and makes it the - * origin of all edges in the vertex loop to which eOrig belongs. "vNext" gives - * a place to insert the new vertex in the global vertex list. We insert - * the new vertex *before* vNext so that algorithms which walk the vertex - * list will not see the newly created vertices. - */ - static void MakeVertex(com.sun.opengl.impl.glu.tessellator.GLUvertex newVertex, - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrig, com.sun.opengl.impl.glu.tessellator.GLUvertex vNext) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - com.sun.opengl.impl.glu.tessellator.GLUvertex vPrev; - com.sun.opengl.impl.glu.tessellator.GLUvertex vNew = newVertex; - - assert (vNew != null); - - /* insert in circular doubly-linked list before vNext */ - vPrev = vNext.prev; - vNew.prev = vPrev; - vPrev.next = vNew; - vNew.next = vNext; - vNext.prev = vNew; - - vNew.anEdge = eOrig; - vNew.data = null; - /* leave coords, s, t undefined */ - - /* fix other edges on this vertex loop */ - e = eOrig; - do { - e.Org = vNew; - e = e.Onext; - } while (e != eOrig); - } - -/* MakeFace( newFace, eOrig, fNext ) attaches a new face and makes it the left - * face of all edges in the face loop to which eOrig belongs. "fNext" gives - * a place to insert the new face in the global face list. We insert - * the new face *before* fNext so that algorithms which walk the face - * list will not see the newly created faces. - */ - static void MakeFace(com.sun.opengl.impl.glu.tessellator.GLUface newFace, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrig, com.sun.opengl.impl.glu.tessellator.GLUface fNext) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - com.sun.opengl.impl.glu.tessellator.GLUface fPrev; - com.sun.opengl.impl.glu.tessellator.GLUface fNew = newFace; - - assert (fNew != null); - - /* insert in circular doubly-linked list before fNext */ - fPrev = fNext.prev; - fNew.prev = fPrev; - fPrev.next = fNew; - fNew.next = fNext; - fNext.prev = fNew; - - fNew.anEdge = eOrig; - fNew.data = null; - fNew.trail = null; - fNew.marked = false; - - /* The new face is marked "inside" if the old one was. This is a - * convenience for the common case where a face has been split in two. - */ - fNew.inside = fNext.inside; - - /* fix other edges on this face loop */ - e = eOrig; - do { - e.Lface = fNew; - e = e.Lnext; - } while (e != eOrig); - } - -/* KillEdge( eDel ) destroys an edge (the half-edges eDel and eDel->Sym), - * and removes from the global edge list. - */ - static void KillEdge(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eDel) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge ePrev, eNext; - - /* Half-edges are allocated in pairs, see EdgePair above */ - if (!eDel.first) { - eDel = eDel.Sym; - } - - /* delete from circular doubly-linked list */ - eNext = eDel.next; - ePrev = eDel.Sym.next; - eNext.Sym.next = ePrev; - ePrev.Sym.next = eNext; - } - - -/* KillVertex( vDel ) destroys a vertex and removes it from the global - * vertex list. It updates the vertex loop to point to a given new vertex. - */ - static void KillVertex(com.sun.opengl.impl.glu.tessellator.GLUvertex vDel, com.sun.opengl.impl.glu.tessellator.GLUvertex newOrg) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, eStart = vDel.anEdge; - com.sun.opengl.impl.glu.tessellator.GLUvertex vPrev, vNext; - - /* change the origin of all affected edges */ - e = eStart; - do { - e.Org = newOrg; - e = e.Onext; - } while (e != eStart); - - /* delete from circular doubly-linked list */ - vPrev = vDel.prev; - vNext = vDel.next; - vNext.prev = vPrev; - vPrev.next = vNext; - } - -/* KillFace( fDel ) destroys a face and removes it from the global face - * list. It updates the face loop to point to a given new face. - */ - static void KillFace(com.sun.opengl.impl.glu.tessellator.GLUface fDel, com.sun.opengl.impl.glu.tessellator.GLUface newLface) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, eStart = fDel.anEdge; - com.sun.opengl.impl.glu.tessellator.GLUface fPrev, fNext; - - /* change the left face of all affected edges */ - e = eStart; - do { - e.Lface = newLface; - e = e.Lnext; - } while (e != eStart); - - /* delete from circular doubly-linked list */ - fPrev = fDel.prev; - fNext = fDel.next; - fNext.prev = fPrev; - fPrev.next = fNext; - } - - - /****************** Basic Edge Operations **********************/ - -/* __gl_meshMakeEdge creates one edge, two vertices, and a loop (face). - * The loop consists of the two new half-edges. - */ - public static com.sun.opengl.impl.glu.tessellator.GLUhalfEdge __gl_meshMakeEdge(com.sun.opengl.impl.glu.tessellator.GLUmesh mesh) { - com.sun.opengl.impl.glu.tessellator.GLUvertex newVertex1 = new com.sun.opengl.impl.glu.tessellator.GLUvertex(); - com.sun.opengl.impl.glu.tessellator.GLUvertex newVertex2 = new com.sun.opengl.impl.glu.tessellator.GLUvertex(); - com.sun.opengl.impl.glu.tessellator.GLUface newFace = new com.sun.opengl.impl.glu.tessellator.GLUface(); - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - - e = MakeEdge(mesh.eHead); - if (e == null) return null; - - MakeVertex(newVertex1, e, mesh.vHead); - MakeVertex(newVertex2, e.Sym, mesh.vHead); - MakeFace(newFace, e, mesh.fHead); - return e; - } - - -/* __gl_meshSplice( eOrg, eDst ) is the basic operation for changing the - * mesh connectivity and topology. It changes the mesh so that - * eOrg->Onext <- OLD( eDst->Onext ) - * eDst->Onext <- OLD( eOrg->Onext ) - * where OLD(...) means the value before the meshSplice operation. - * - * This can have two effects on the vertex structure: - * - if eOrg->Org != eDst->Org, the two vertices are merged together - * - if eOrg->Org == eDst->Org, the origin is split into two vertices - * In both cases, eDst->Org is changed and eOrg->Org is untouched. - * - * Similarly (and independently) for the face structure, - * - if eOrg->Lface == eDst->Lface, one loop is split into two - * - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one - * In both cases, eDst->Lface is changed and eOrg->Lface is unaffected. - * - * Some special cases: - * If eDst == eOrg, the operation has no effect. - * If eDst == eOrg->Lnext, the new face will have a single edge. - * If eDst == eOrg->Lprev, the old face will have a single edge. - * If eDst == eOrg->Onext, the new vertex will have a single edge. - * If eDst == eOrg->Oprev, the old vertex will have a single edge. - */ - public static boolean __gl_meshSplice(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrg, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eDst) { - boolean joiningLoops = false; - boolean joiningVertices = false; - - if (eOrg == eDst) return true; - - if (eDst.Org != eOrg.Org) { - /* We are merging two disjoint vertices -- destroy eDst->Org */ - joiningVertices = true; - KillVertex(eDst.Org, eOrg.Org); - } - if (eDst.Lface != eOrg.Lface) { - /* We are connecting two disjoint loops -- destroy eDst.Lface */ - joiningLoops = true; - KillFace(eDst.Lface, eOrg.Lface); - } - - /* Change the edge structure */ - Splice(eDst, eOrg); - - if (!joiningVertices) { - com.sun.opengl.impl.glu.tessellator.GLUvertex newVertex = new com.sun.opengl.impl.glu.tessellator.GLUvertex(); - - /* We split one vertex into two -- the new vertex is eDst.Org. - * Make sure the old vertex points to a valid half-edge. - */ - MakeVertex(newVertex, eDst, eOrg.Org); - eOrg.Org.anEdge = eOrg; - } - if (!joiningLoops) { - com.sun.opengl.impl.glu.tessellator.GLUface newFace = new com.sun.opengl.impl.glu.tessellator.GLUface(); - - /* We split one loop into two -- the new loop is eDst.Lface. - * Make sure the old face points to a valid half-edge. - */ - MakeFace(newFace, eDst, eOrg.Lface); - eOrg.Lface.anEdge = eOrg; - } - - return true; - } - - -/* __gl_meshDelete( eDel ) removes the edge eDel. There are several cases: - * if (eDel.Lface != eDel.Rface), we join two loops into one; the loop - * eDel.Lface is deleted. Otherwise, we are splitting one loop into two; - * the newly created loop will contain eDel.Dst. If the deletion of eDel - * would create isolated vertices, those are deleted as well. - * - * This function could be implemented as two calls to __gl_meshSplice - * plus a few calls to memFree, but this would allocate and delete - * unnecessary vertices and faces. - */ - static boolean __gl_meshDelete(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eDel) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eDelSym = eDel.Sym; - boolean joiningLoops = false; - - /* First step: disconnect the origin vertex eDel.Org. We make all - * changes to get a consistent mesh in this "intermediate" state. - */ - if (eDel.Lface != eDel.Sym.Lface) { - /* We are joining two loops into one -- remove the left face */ - joiningLoops = true; - KillFace(eDel.Lface, eDel.Sym.Lface); - } - - if (eDel.Onext == eDel) { - KillVertex(eDel.Org, null); - } else { - /* Make sure that eDel.Org and eDel.Sym.Lface point to valid half-edges */ - eDel.Sym.Lface.anEdge = eDel.Sym.Lnext; - eDel.Org.anEdge = eDel.Onext; - - Splice(eDel, eDel.Sym.Lnext); - if (!joiningLoops) { - com.sun.opengl.impl.glu.tessellator.GLUface newFace = new com.sun.opengl.impl.glu.tessellator.GLUface(); - - /* We are splitting one loop into two -- create a new loop for eDel. */ - MakeFace(newFace, eDel, eDel.Lface); - } - } - - /* Claim: the mesh is now in a consistent state, except that eDel.Org - * may have been deleted. Now we disconnect eDel.Dst. - */ - if (eDelSym.Onext == eDelSym) { - KillVertex(eDelSym.Org, null); - KillFace(eDelSym.Lface, null); - } else { - /* Make sure that eDel.Dst and eDel.Lface point to valid half-edges */ - eDel.Lface.anEdge = eDelSym.Sym.Lnext; - eDelSym.Org.anEdge = eDelSym.Onext; - Splice(eDelSym, eDelSym.Sym.Lnext); - } - - /* Any isolated vertices or faces have already been freed. */ - KillEdge(eDel); - - return true; - } - - - /******************** Other Edge Operations **********************/ - -/* All these routines can be implemented with the basic edge - * operations above. They are provided for convenience and efficiency. - */ - - -/* __gl_meshAddEdgeVertex( eOrg ) creates a new edge eNew such that - * eNew == eOrg.Lnext, and eNew.Dst is a newly created vertex. - * eOrg and eNew will have the same left face. - */ - static com.sun.opengl.impl.glu.tessellator.GLUhalfEdge __gl_meshAddEdgeVertex(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrg) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eNewSym; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eNew = MakeEdge(eOrg); - - eNewSym = eNew.Sym; - - /* Connect the new edge appropriately */ - Splice(eNew, eOrg.Lnext); - - /* Set the vertex and face information */ - eNew.Org = eOrg.Sym.Org; - { - com.sun.opengl.impl.glu.tessellator.GLUvertex newVertex = new com.sun.opengl.impl.glu.tessellator.GLUvertex(); - - MakeVertex(newVertex, eNewSym, eNew.Org); - } - eNew.Lface = eNewSym.Lface = eOrg.Lface; - - return eNew; - } - - -/* __gl_meshSplitEdge( eOrg ) splits eOrg into two edges eOrg and eNew, - * such that eNew == eOrg.Lnext. The new vertex is eOrg.Sym.Org == eNew.Org. - * eOrg and eNew will have the same left face. - */ - public static com.sun.opengl.impl.glu.tessellator.GLUhalfEdge __gl_meshSplitEdge(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrg) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eNew; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge tempHalfEdge = __gl_meshAddEdgeVertex(eOrg); - - eNew = tempHalfEdge.Sym; - - /* Disconnect eOrg from eOrg.Sym.Org and connect it to eNew.Org */ - Splice(eOrg.Sym, eOrg.Sym.Sym.Lnext); - Splice(eOrg.Sym, eNew); - - /* Set the vertex and face information */ - eOrg.Sym.Org = eNew.Org; - eNew.Sym.Org.anEdge = eNew.Sym; /* may have pointed to eOrg.Sym */ - eNew.Sym.Lface = eOrg.Sym.Lface; - eNew.winding = eOrg.winding; /* copy old winding information */ - eNew.Sym.winding = eOrg.Sym.winding; - - return eNew; - } - - -/* __gl_meshConnect( eOrg, eDst ) creates a new edge from eOrg.Sym.Org - * to eDst.Org, and returns the corresponding half-edge eNew. - * If eOrg.Lface == eDst.Lface, this splits one loop into two, - * and the newly created loop is eNew.Lface. Otherwise, two disjoint - * loops are merged into one, and the loop eDst.Lface is destroyed. - * - * If (eOrg == eDst), the new face will have only two edges. - * If (eOrg.Lnext == eDst), the old face is reduced to a single edge. - * If (eOrg.Lnext.Lnext == eDst), the old face is reduced to two edges. - */ - static com.sun.opengl.impl.glu.tessellator.GLUhalfEdge __gl_meshConnect(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrg, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eDst) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eNewSym; - boolean joiningLoops = false; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eNew = MakeEdge(eOrg); - - eNewSym = eNew.Sym; - - if (eDst.Lface != eOrg.Lface) { - /* We are connecting two disjoint loops -- destroy eDst.Lface */ - joiningLoops = true; - KillFace(eDst.Lface, eOrg.Lface); - } - - /* Connect the new edge appropriately */ - Splice(eNew, eOrg.Lnext); - Splice(eNewSym, eDst); - - /* Set the vertex and face information */ - eNew.Org = eOrg.Sym.Org; - eNewSym.Org = eDst.Org; - eNew.Lface = eNewSym.Lface = eOrg.Lface; - - /* Make sure the old face points to a valid half-edge */ - eOrg.Lface.anEdge = eNewSym; - - if (!joiningLoops) { - com.sun.opengl.impl.glu.tessellator.GLUface newFace = new com.sun.opengl.impl.glu.tessellator.GLUface(); - - /* We split one loop into two -- the new loop is eNew.Lface */ - MakeFace(newFace, eNew, eOrg.Lface); - } - return eNew; - } - - - /******************** Other Operations **********************/ - -/* __gl_meshZapFace( fZap ) destroys a face and removes it from the - * global face list. All edges of fZap will have a null pointer as their - * left face. Any edges which also have a null pointer as their right face - * are deleted entirely (along with any isolated vertices this produces). - * An entire mesh can be deleted by zapping its faces, one at a time, - * in any order. Zapped faces cannot be used in further mesh operations! - */ - static void __gl_meshZapFace(com.sun.opengl.impl.glu.tessellator.GLUface fZap) { - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eStart = fZap.anEdge; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, eNext, eSym; - com.sun.opengl.impl.glu.tessellator.GLUface fPrev, fNext; - - /* walk around face, deleting edges whose right face is also null */ - eNext = eStart.Lnext; - do { - e = eNext; - eNext = e.Lnext; - - e.Lface = null; - if (e.Sym.Lface == null) { - /* delete the edge -- see __gl_MeshDelete above */ - - if (e.Onext == e) { - KillVertex(e.Org, null); - } else { - /* Make sure that e.Org points to a valid half-edge */ - e.Org.anEdge = e.Onext; - Splice(e, e.Sym.Lnext); - } - eSym = e.Sym; - if (eSym.Onext == eSym) { - KillVertex(eSym.Org, null); - } else { - /* Make sure that eSym.Org points to a valid half-edge */ - eSym.Org.anEdge = eSym.Onext; - Splice(eSym, eSym.Sym.Lnext); - } - KillEdge(e); - } - } while (e != eStart); - - /* delete from circular doubly-linked list */ - fPrev = fZap.prev; - fNext = fZap.next; - fNext.prev = fPrev; - fPrev.next = fNext; - } - - -/* __gl_meshNewMesh() creates a new mesh with no edges, no vertices, - * and no loops (what we usually call a "face"). - */ - public static com.sun.opengl.impl.glu.tessellator.GLUmesh __gl_meshNewMesh() { - com.sun.opengl.impl.glu.tessellator.GLUvertex v; - com.sun.opengl.impl.glu.tessellator.GLUface f; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eSym; - com.sun.opengl.impl.glu.tessellator.GLUmesh mesh = new com.sun.opengl.impl.glu.tessellator.GLUmesh(); - - v = mesh.vHead; - f = mesh.fHead; - e = mesh.eHead; - eSym = mesh.eHeadSym; - - v.next = v.prev = v; - v.anEdge = null; - v.data = null; - - f.next = f.prev = f; - f.anEdge = null; - f.data = null; - f.trail = null; - f.marked = false; - f.inside = false; - - e.next = e; - e.Sym = eSym; - e.Onext = null; - e.Lnext = null; - e.Org = null; - e.Lface = null; - e.winding = 0; - e.activeRegion = null; - - eSym.next = eSym; - eSym.Sym = e; - eSym.Onext = null; - eSym.Lnext = null; - eSym.Org = null; - eSym.Lface = null; - eSym.winding = 0; - eSym.activeRegion = null; - - return mesh; - } - - -/* __gl_meshUnion( mesh1, mesh2 ) forms the union of all structures in - * both meshes, and returns the new mesh (the old meshes are destroyed). - */ - static com.sun.opengl.impl.glu.tessellator.GLUmesh __gl_meshUnion(com.sun.opengl.impl.glu.tessellator.GLUmesh mesh1, com.sun.opengl.impl.glu.tessellator.GLUmesh mesh2) { - com.sun.opengl.impl.glu.tessellator.GLUface f1 = mesh1.fHead; - com.sun.opengl.impl.glu.tessellator.GLUvertex v1 = mesh1.vHead; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e1 = mesh1.eHead; - com.sun.opengl.impl.glu.tessellator.GLUface f2 = mesh2.fHead; - com.sun.opengl.impl.glu.tessellator.GLUvertex v2 = mesh2.vHead; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e2 = mesh2.eHead; - - /* Add the faces, vertices, and edges of mesh2 to those of mesh1 */ - if (f2.next != f2) { - f1.prev.next = f2.next; - f2.next.prev = f1.prev; - f2.prev.next = f1; - f1.prev = f2.prev; - } - - if (v2.next != v2) { - v1.prev.next = v2.next; - v2.next.prev = v1.prev; - v2.prev.next = v1; - v1.prev = v2.prev; - } - - if (e2.next != e2) { - e1.Sym.next.Sym.next = e2.next; - e2.next.Sym.next = e1.Sym.next; - e2.Sym.next.Sym.next = e1; - e1.Sym.next = e2.Sym.next; - } - - return mesh1; - } - - -/* __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh. - */ - static void __gl_meshDeleteMeshZap(com.sun.opengl.impl.glu.tessellator.GLUmesh mesh) { - com.sun.opengl.impl.glu.tessellator.GLUface fHead = mesh.fHead; - - while (fHead.next != fHead) { - __gl_meshZapFace(fHead.next); - } - assert (mesh.vHead.next == mesh.vHead); - } - -/* __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh. - */ - public static void __gl_meshDeleteMesh(com.sun.opengl.impl.glu.tessellator.GLUmesh mesh) { - com.sun.opengl.impl.glu.tessellator.GLUface f, fNext; - com.sun.opengl.impl.glu.tessellator.GLUvertex v, vNext; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, eNext; - - for (f = mesh.fHead.next; f != mesh.fHead; f = fNext) { - fNext = f.next; - } - - for (v = mesh.vHead.next; v != mesh.vHead; v = vNext) { - vNext = v.next; - } - - for (e = mesh.eHead.next; e != mesh.eHead; e = eNext) { - /* One call frees both e and e.Sym (see EdgePair above) */ - eNext = e.next; - } - } - -/* __gl_meshCheckMesh( mesh ) checks a mesh for self-consistency. - */ - public static void __gl_meshCheckMesh(com.sun.opengl.impl.glu.tessellator.GLUmesh mesh) { - com.sun.opengl.impl.glu.tessellator.GLUface fHead = mesh.fHead; - com.sun.opengl.impl.glu.tessellator.GLUvertex vHead = mesh.vHead; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eHead = mesh.eHead; - com.sun.opengl.impl.glu.tessellator.GLUface f, fPrev; - com.sun.opengl.impl.glu.tessellator.GLUvertex v, vPrev; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, ePrev; - - fPrev = fHead; - for (fPrev = fHead; (f = fPrev.next) != fHead; fPrev = f) { - assert (f.prev == fPrev); - e = f.anEdge; - do { - assert (e.Sym != e); - assert (e.Sym.Sym == e); - assert (e.Lnext.Onext.Sym == e); - assert (e.Onext.Sym.Lnext == e); - assert (e.Lface == f); - e = e.Lnext; - } while (e != f.anEdge); - } - assert (f.prev == fPrev && f.anEdge == null && f.data == null); - - vPrev = vHead; - for (vPrev = vHead; (v = vPrev.next) != vHead; vPrev = v) { - assert (v.prev == vPrev); - e = v.anEdge; - do { - assert (e.Sym != e); - assert (e.Sym.Sym == e); - assert (e.Lnext.Onext.Sym == e); - assert (e.Onext.Sym.Lnext == e); - assert (e.Org == v); - e = e.Onext; - } while (e != v.anEdge); - } - assert (v.prev == vPrev && v.anEdge == null && v.data == null); - - ePrev = eHead; - for (ePrev = eHead; (e = ePrev.next) != eHead; ePrev = e) { - assert (e.Sym.next == ePrev.Sym); - assert (e.Sym != e); - assert (e.Sym.Sym == e); - assert (e.Org != null); - assert (e.Sym.Org != null); - assert (e.Lnext.Onext.Sym == e); - assert (e.Onext.Sym.Lnext == e); - } - assert (e.Sym.next == ePrev.Sym - && e.Sym == mesh.eHeadSym - && e.Sym.Sym == e - && e.Org == null && e.Sym.Org == null - && e.Lface == null && e.Sym.Lface == null); - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/Normal.java b/src/classes/com/sun/opengl/impl/tessellator/Normal.java deleted file mode 100644 index feb13dfd4..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/Normal.java +++ /dev/null @@ -1,288 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -import javax.media.opengl.*; -import javax.media.opengl.glu.*; - -class Normal { - private Normal() { - } - - static boolean SLANTED_SWEEP = false; - static double S_UNIT_X; /* Pre-normalized */ - static double S_UNIT_Y; - private static final boolean TRUE_PROJECT = false; - - static { - if (SLANTED_SWEEP) { -/* The "feature merging" is not intended to be complete. There are - * special cases where edges are nearly parallel to the sweep line - * which are not implemented. The algorithm should still behave - * robustly (ie. produce a reasonable tesselation) in the presence - * of such edges, however it may miss features which could have been - * merged. We could minimize this effect by choosing the sweep line - * direction to be something unusual (ie. not parallel to one of the - * coordinate axes). - */ - S_UNIT_X = 0.50941539564955385; /* Pre-normalized */ - S_UNIT_Y = 0.86052074622010633; - } else { - S_UNIT_X = 1.0; - S_UNIT_Y = 0.0; - } - } - - private static double Dot(double[] u, double[] v) { - return (u[0] * v[0] + u[1] * v[1] + u[2] * v[2]); - } - - static void Normalize(double[] v) { - double len = v[0] * v[0] + v[1] * v[1] + v[2] * v[2]; - - assert (len > 0); - len = Math.sqrt(len); - v[0] /= len; - v[1] /= len; - v[2] /= len; - } - - static int LongAxis(double[] v) { - int i = 0; - - if (Math.abs(v[1]) > Math.abs(v[0])) { - i = 1; - } - if (Math.abs(v[2]) > Math.abs(v[i])) { - i = 2; - } - return i; - } - - static void ComputeNormal(GLUtessellatorImpl tess, double[] norm) { - com.sun.opengl.impl.glu.tessellator.GLUvertex v, v1, v2; - double c, tLen2, maxLen2; - double[] maxVal, minVal, d1, d2, tNorm; - com.sun.opengl.impl.glu.tessellator.GLUvertex[] maxVert, minVert; - com.sun.opengl.impl.glu.tessellator.GLUvertex vHead = tess.mesh.vHead; - int i; - - maxVal = new double[3]; - minVal = new double[3]; - minVert = new com.sun.opengl.impl.glu.tessellator.GLUvertex[3]; - maxVert = new com.sun.opengl.impl.glu.tessellator.GLUvertex[3]; - d1 = new double[3]; - d2 = new double[3]; - tNorm = new double[3]; - - maxVal[0] = maxVal[1] = maxVal[2] = -2 * GLU.GLU_TESS_MAX_COORD; - minVal[0] = minVal[1] = minVal[2] = 2 * GLU.GLU_TESS_MAX_COORD; - - for (v = vHead.next; v != vHead; v = v.next) { - for (i = 0; i < 3; ++i) { - c = v.coords[i]; - if (c < minVal[i]) { - minVal[i] = c; - minVert[i] = v; - } - if (c > maxVal[i]) { - maxVal[i] = c; - maxVert[i] = v; - } - } - } - -/* Find two vertices separated by at least 1/sqrt(3) of the maximum - * distance between any two vertices - */ - i = 0; - if (maxVal[1] - minVal[1] > maxVal[0] - minVal[0]) { - i = 1; - } - if (maxVal[2] - minVal[2] > maxVal[i] - minVal[i]) { - i = 2; - } - if (minVal[i] >= maxVal[i]) { -/* All vertices are the same -- normal doesn't matter */ - norm[0] = 0; - norm[1] = 0; - norm[2] = 1; - return; - } - -/* Look for a third vertex which forms the triangle with maximum area - * (Length of normal == twice the triangle area) - */ - maxLen2 = 0; - v1 = minVert[i]; - v2 = maxVert[i]; - d1[0] = v1.coords[0] - v2.coords[0]; - d1[1] = v1.coords[1] - v2.coords[1]; - d1[2] = v1.coords[2] - v2.coords[2]; - for (v = vHead.next; v != vHead; v = v.next) { - d2[0] = v.coords[0] - v2.coords[0]; - d2[1] = v.coords[1] - v2.coords[1]; - d2[2] = v.coords[2] - v2.coords[2]; - tNorm[0] = d1[1] * d2[2] - d1[2] * d2[1]; - tNorm[1] = d1[2] * d2[0] - d1[0] * d2[2]; - tNorm[2] = d1[0] * d2[1] - d1[1] * d2[0]; - tLen2 = tNorm[0] * tNorm[0] + tNorm[1] * tNorm[1] + tNorm[2] * tNorm[2]; - if (tLen2 > maxLen2) { - maxLen2 = tLen2; - norm[0] = tNorm[0]; - norm[1] = tNorm[1]; - norm[2] = tNorm[2]; - } - } - - if (maxLen2 <= 0) { -/* All points lie on a single line -- any decent normal will do */ - norm[0] = norm[1] = norm[2] = 0; - norm[LongAxis(d1)] = 1; - } - } - - static void CheckOrientation(GLUtessellatorImpl tess) { - double area; - com.sun.opengl.impl.glu.tessellator.GLUface f, fHead = tess.mesh.fHead; - com.sun.opengl.impl.glu.tessellator.GLUvertex v, vHead = tess.mesh.vHead; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - -/* When we compute the normal automatically, we choose the orientation - * so that the the sum of the signed areas of all contours is non-negative. - */ - area = 0; - for (f = fHead.next; f != fHead; f = f.next) { - e = f.anEdge; - if (e.winding <= 0) continue; - do { - area += (e.Org.s - e.Sym.Org.s) * (e.Org.t + e.Sym.Org.t); - e = e.Lnext; - } while (e != f.anEdge); - } - if (area < 0) { -/* Reverse the orientation by flipping all the t-coordinates */ - for (v = vHead.next; v != vHead; v = v.next) { - v.t = -v.t; - } - tess.tUnit[0] = -tess.tUnit[0]; - tess.tUnit[1] = -tess.tUnit[1]; - tess.tUnit[2] = -tess.tUnit[2]; - } - } - -/* Determine the polygon normal and project vertices onto the plane - * of the polygon. - */ - public static void __gl_projectPolygon(GLUtessellatorImpl tess) { - com.sun.opengl.impl.glu.tessellator.GLUvertex v, vHead = tess.mesh.vHead; - double w; - double[] norm = new double[3]; - double[] sUnit, tUnit; - int i; - boolean computedNormal = false; - - norm[0] = tess.normal[0]; - norm[1] = tess.normal[1]; - norm[2] = tess.normal[2]; - if (norm[0] == 0 && norm[1] == 0 && norm[2] == 0) { - ComputeNormal(tess, norm); - computedNormal = true; - } - sUnit = tess.sUnit; - tUnit = tess.tUnit; - i = LongAxis(norm); - - if (TRUE_PROJECT) { -/* Choose the initial sUnit vector to be approximately perpendicular - * to the normal. - */ - Normalize(norm); - - sUnit[i] = 0; - sUnit[(i + 1) % 3] = S_UNIT_X; - sUnit[(i + 2) % 3] = S_UNIT_Y; - -/* Now make it exactly perpendicular */ - w = Dot(sUnit, norm); - sUnit[0] -= w * norm[0]; - sUnit[1] -= w * norm[1]; - sUnit[2] -= w * norm[2]; - Normalize(sUnit); - -/* Choose tUnit so that (sUnit,tUnit,norm) form a right-handed frame */ - tUnit[0] = norm[1] * sUnit[2] - norm[2] * sUnit[1]; - tUnit[1] = norm[2] * sUnit[0] - norm[0] * sUnit[2]; - tUnit[2] = norm[0] * sUnit[1] - norm[1] * sUnit[0]; - Normalize(tUnit); - } else { -/* Project perpendicular to a coordinate axis -- better numerically */ - sUnit[i] = 0; - sUnit[(i + 1) % 3] = S_UNIT_X; - sUnit[(i + 2) % 3] = S_UNIT_Y; - - tUnit[i] = 0; - tUnit[(i + 1) % 3] = (norm[i] > 0) ? -S_UNIT_Y : S_UNIT_Y; - tUnit[(i + 2) % 3] = (norm[i] > 0) ? S_UNIT_X : -S_UNIT_X; - } - -/* Project the vertices onto the sweep plane */ - for (v = vHead.next; v != vHead; v = v.next) { - v.s = Dot(v.coords, sUnit); - v.t = Dot(v.coords, tUnit); - } - if (computedNormal) { - CheckOrientation(tess); - } - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/PriorityQ.java b/src/classes/com/sun/opengl/impl/tessellator/PriorityQ.java deleted file mode 100644 index 18f2cf32c..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/PriorityQ.java +++ /dev/null @@ -1,100 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -abstract class PriorityQ { - public static final int INIT_SIZE = 32; - - public static class PQnode { - int handle; - } - - public static class PQhandleElem { - Object key; - int node; - } - - public static interface Leq { - boolean leq(Object key1, Object key2); - } - - // #ifdef FOR_TRITE_TEST_PROGRAM -// private static boolean LEQ(PriorityQCommon.Leq leq, Object x,Object y) { -// return pq.leq.leq(x,y); -// } -// #else -/* Violates modularity, but a little faster */ -// #include "geom.h" - public static boolean LEQ(Leq leq, Object x, Object y) { - return com.sun.opengl.impl.glu.tessellator.Geom.VertLeq((com.sun.opengl.impl.glu.tessellator.GLUvertex) x, (com.sun.opengl.impl.glu.tessellator.GLUvertex) y); - } - - static PriorityQ pqNewPriorityQ(Leq leq) { - return new PriorityQSort(leq); - } - - abstract void pqDeletePriorityQ(); - - abstract boolean pqInit(); - - abstract int pqInsert(Object keyNew); - - abstract Object pqExtractMin(); - - abstract void pqDelete(int hCurr); - - abstract Object pqMinimum(); - - abstract boolean pqIsEmpty(); -// #endif -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/PriorityQHeap.java b/src/classes/com/sun/opengl/impl/tessellator/PriorityQHeap.java deleted file mode 100644 index 2f856517a..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/PriorityQHeap.java +++ /dev/null @@ -1,262 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class PriorityQHeap extends com.sun.opengl.impl.glu.tessellator.PriorityQ { - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[] nodes; - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[] handles; - int size, max; - int freeList; - boolean initialized; - com.sun.opengl.impl.glu.tessellator.PriorityQ.Leq leq; - -/* really __gl_pqHeapNewPriorityQ */ - public PriorityQHeap(com.sun.opengl.impl.glu.tessellator.PriorityQ.Leq leq) { - size = 0; - max = com.sun.opengl.impl.glu.tessellator.PriorityQ.INIT_SIZE; - nodes = new com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[com.sun.opengl.impl.glu.tessellator.PriorityQ.INIT_SIZE + 1]; - for (int i = 0; i < nodes.length; i++) { - nodes[i] = new PQnode(); - } - handles = new com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[com.sun.opengl.impl.glu.tessellator.PriorityQ.INIT_SIZE + 1]; - for (int i = 0; i < handles.length; i++) { - handles[i] = new PQhandleElem(); - } - initialized = false; - freeList = 0; - this.leq = leq; - - nodes[1].handle = 1; /* so that Minimum() returns NULL */ - handles[1].key = null; - } - -/* really __gl_pqHeapDeletePriorityQ */ - void pqDeletePriorityQ() { - handles = null; - nodes = null; - } - - void FloatDown(int curr) { - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[] n = nodes; - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[] h = handles; - int hCurr, hChild; - int child; - - hCurr = n[curr].handle; - for (; ;) { - child = curr << 1; - if (child < size && LEQ(leq, h[n[child + 1].handle].key, - h[n[child].handle].key)) { - ++child; - } - - assert (child <= max); - - hChild = n[child].handle; - if (child > size || LEQ(leq, h[hCurr].key, h[hChild].key)) { - n[curr].handle = hCurr; - h[hCurr].node = curr; - break; - } - n[curr].handle = hChild; - h[hChild].node = curr; - curr = child; - } - } - - - void FloatUp(int curr) { - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[] n = nodes; - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[] h = handles; - int hCurr, hParent; - int parent; - - hCurr = n[curr].handle; - for (; ;) { - parent = curr >> 1; - hParent = n[parent].handle; - if (parent == 0 || LEQ(leq, h[hParent].key, h[hCurr].key)) { - n[curr].handle = hCurr; - h[hCurr].node = curr; - break; - } - n[curr].handle = hParent; - h[hParent].node = curr; - curr = parent; - } - } - -/* really __gl_pqHeapInit */ - boolean pqInit() { - int i; - - /* This method of building a heap is O(n), rather than O(n lg n). */ - - for (i = size; i >= 1; --i) { - FloatDown(i); - } - initialized = true; - - return true; - } - -/* really __gl_pqHeapInsert */ -/* returns LONG_MAX iff out of memory */ - int pqInsert(Object keyNew) { - int curr; - int free; - - curr = ++size; - if ((curr * 2) > max) { - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[] saveNodes = nodes; - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[] saveHandles = handles; - - /* If the heap overflows, double its size. */ - max <<= 1; -// pq->nodes = (PQnode *)memRealloc( pq->nodes, (size_t) ((pq->max + 1) * sizeof( pq->nodes[0] ))); - PriorityQ.PQnode[] pqNodes = new PriorityQ.PQnode[max + 1]; - System.arraycopy( nodes, 0, pqNodes, 0, nodes.length ); - for (int i = nodes.length; i < pqNodes.length; i++) { - pqNodes[i] = new PQnode(); - } - nodes = pqNodes; - if (nodes == null) { - nodes = saveNodes; /* restore ptr to free upon return */ - return Integer.MAX_VALUE; - } - -// pq->handles = (PQhandleElem *)memRealloc( pq->handles,(size_t)((pq->max + 1) * sizeof( pq->handles[0] ))); - PriorityQ.PQhandleElem[] pqHandles = new PriorityQ.PQhandleElem[max + 1]; - System.arraycopy( handles, 0, pqHandles, 0, handles.length ); - for (int i = handles.length; i < pqHandles.length; i++) { - pqHandles[i] = new PQhandleElem(); - } - handles = pqHandles; - if (handles == null) { - handles = saveHandles; /* restore ptr to free upon return */ - return Integer.MAX_VALUE; - } - } - - if (freeList == 0) { - free = curr; - } else { - free = freeList; - freeList = handles[free].node; - } - - nodes[curr].handle = free; - handles[free].node = curr; - handles[free].key = keyNew; - - if (initialized) { - FloatUp(curr); - } - assert (free != Integer.MAX_VALUE); - return free; - } - -/* really __gl_pqHeapExtractMin */ - Object pqExtractMin() { - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[] n = nodes; - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[] h = handles; - int hMin = n[1].handle; - Object min = h[hMin].key; - - if (size > 0) { - n[1].handle = n[size].handle; - h[n[1].handle].node = 1; - - h[hMin].key = null; - h[hMin].node = freeList; - freeList = hMin; - - if (--size > 0) { - FloatDown(1); - } - } - return min; - } - -/* really __gl_pqHeapDelete */ - void pqDelete(int hCurr) { - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQnode[] n = nodes; - com.sun.opengl.impl.glu.tessellator.PriorityQ.PQhandleElem[] h = handles; - int curr; - - assert (hCurr >= 1 && hCurr <= max && h[hCurr].key != null); - - curr = h[hCurr].node; - n[curr].handle = n[size].handle; - h[n[curr].handle].node = curr; - - if (curr <= --size) { - if (curr <= 1 || LEQ(leq, h[n[curr >> 1].handle].key, h[n[curr].handle].key)) { - FloatDown(curr); - } else { - FloatUp(curr); - } - } - h[hCurr].key = null; - h[hCurr].node = freeList; - freeList = hCurr; - } - - Object pqMinimum() { - return handles[nodes[1].handle].key; - } - - boolean pqIsEmpty() { - return size == 0; - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/PriorityQSort.java b/src/classes/com/sun/opengl/impl/tessellator/PriorityQSort.java deleted file mode 100644 index 67924524d..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/PriorityQSort.java +++ /dev/null @@ -1,278 +0,0 @@ -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class PriorityQSort extends com.sun.opengl.impl.glu.tessellator.PriorityQ { - com.sun.opengl.impl.glu.tessellator.PriorityQHeap heap; - Object[] keys; - - // JAVA: 'order' contains indices into the keys array. - // This simulates the indirect pointers used in the original C code - // (from Frank Suykens, Luciad.com). - int[] order; - int size, max; - boolean initialized; - com.sun.opengl.impl.glu.tessellator.PriorityQ.Leq leq; - - public PriorityQSort(com.sun.opengl.impl.glu.tessellator.PriorityQ.Leq leq) { - heap = new com.sun.opengl.impl.glu.tessellator.PriorityQHeap(leq); - - keys = new Object[com.sun.opengl.impl.glu.tessellator.PriorityQ.INIT_SIZE]; - - size = 0; - max = com.sun.opengl.impl.glu.tessellator.PriorityQ.INIT_SIZE; - initialized = false; - this.leq = leq; - } - -/* really __gl_pqSortDeletePriorityQ */ - void pqDeletePriorityQ() { - if (heap != null) heap.pqDeletePriorityQ(); - order = null; - keys = null; - } - - private static boolean LT(com.sun.opengl.impl.glu.tessellator.PriorityQ.Leq leq, Object x, Object y) { - return (!com.sun.opengl.impl.glu.tessellator.PriorityQHeap.LEQ(leq, y, x)); - } - - private static boolean GT(com.sun.opengl.impl.glu.tessellator.PriorityQ.Leq leq, Object x, Object y) { - return (!com.sun.opengl.impl.glu.tessellator.PriorityQHeap.LEQ(leq, x, y)); - } - - private static void Swap(int[] array, int a, int b) { - if (true) { - int tmp = array[a]; - array[a] = array[b]; - array[b] = tmp; - } else { - - } - } - - private static class Stack { - int p, r; - } - -/* really __gl_pqSortInit */ - boolean pqInit() { - int p, r, i, j; - int piv; - Stack[] stack = new Stack[50]; - for (int k = 0; k < stack.length; k++) { - stack[k] = new Stack(); - } - int top = 0; - - int seed = 2016473283; - - /* Create an array of indirect pointers to the keys, so that we - * the handles we have returned are still valid. - */ - order = new int[size + 1]; -/* the previous line is a patch to compensate for the fact that IBM */ -/* machines return a null on a malloc of zero bytes (unlike SGI), */ -/* so we have to put in this defense to guard against a memory */ -/* fault four lines down. from [email protected]. */ - p = 0; - r = size - 1; - for (piv = 0, i = p; i <= r; ++piv, ++i) { - // indirect pointers: keep an index into the keys array, not a direct pointer to its contents - order[i] = piv; - } - - /* Sort the indirect pointers in descending order, - * using randomized Quicksort - */ - stack[top].p = p; - stack[top].r = r; - ++top; - while (--top >= 0) { - p = stack[top].p; - r = stack[top].r; - while (r > p + 10) { - seed = Math.abs( seed * 1539415821 + 1 ); - i = p + seed % (r - p + 1); - piv = order[i]; - order[i] = order[p]; - order[p] = piv; - i = p - 1; - j = r + 1; - do { - do { - ++i; - } while (GT(leq, keys[order[i]], keys[piv])); - do { - --j; - } while (LT(leq, keys[order[j]], keys[piv])); - Swap(order, i, j); - } while (i < j); - Swap(order, i, j); /* Undo last swap */ - if (i - p < r - j) { - stack[top].p = j + 1; - stack[top].r = r; - ++top; - r = i - 1; - } else { - stack[top].p = p; - stack[top].r = i - 1; - ++top; - p = j + 1; - } - } - /* Insertion sort small lists */ - for (i = p + 1; i <= r; ++i) { - piv = order[i]; - for (j = i; j > p && LT(leq, keys[order[j - 1]], keys[piv]); --j) { - order[j] = order[j - 1]; - } - order[j] = piv; - } - } - max = size; - initialized = true; - heap.pqInit(); /* always succeeds */ - -/* #ifndef NDEBUG - p = order; - r = p + size - 1; - for (i = p; i < r; ++i) { - Assertion.doAssert(LEQ( * * (i + 1), **i )); - } - #endif*/ - - return true; - } - -/* really __gl_pqSortInsert */ -/* returns LONG_MAX iff out of memory */ - int pqInsert(Object keyNew) { - int curr; - - if (initialized) { - return heap.pqInsert(keyNew); - } - curr = size; - if (++size >= max) { - Object[] saveKey = keys; - - /* If the heap overflows, double its size. */ - max <<= 1; -// pq->keys = (PQHeapKey *)memRealloc( pq->keys,(size_t)(pq->max * sizeof( pq->keys[0] ))); - Object[] pqKeys = new Object[max]; - System.arraycopy( keys, 0, pqKeys, 0, keys.length ); - keys = pqKeys; - if (keys == null) { - keys = saveKey; /* restore ptr to free upon return */ - return Integer.MAX_VALUE; - } - } - assert curr != Integer.MAX_VALUE; - keys[curr] = keyNew; - - /* Negative handles index the sorted array. */ - return -(curr + 1); - } - -/* really __gl_pqSortExtractMin */ - Object pqExtractMin() { - Object sortMin, heapMin; - - if (size == 0) { - return heap.pqExtractMin(); - } - sortMin = keys[order[size - 1]]; - if (!heap.pqIsEmpty()) { - heapMin = heap.pqMinimum(); - if (LEQ(leq, heapMin, sortMin)) { - return heap.pqExtractMin(); - } - } - do { - --size; - } while (size > 0 && keys[order[size - 1]] == null); - return sortMin; - } - -/* really __gl_pqSortMinimum */ - Object pqMinimum() { - Object sortMin, heapMin; - - if (size == 0) { - return heap.pqMinimum(); - } - sortMin = keys[order[size - 1]]; - if (!heap.pqIsEmpty()) { - heapMin = heap.pqMinimum(); - if (com.sun.opengl.impl.glu.tessellator.PriorityQHeap.LEQ(leq, heapMin, sortMin)) { - return heapMin; - } - } - return sortMin; - } - -/* really __gl_pqSortIsEmpty */ - boolean pqIsEmpty() { - return (size == 0) && heap.pqIsEmpty(); - } - -/* really __gl_pqSortDelete */ - void pqDelete(int curr) { - if (curr >= 0) { - heap.pqDelete(curr); - return; - } - curr = -(curr + 1); - assert curr < max && keys[curr] != null; - - keys[curr] = null; - while (size > 0 && keys[order[size - 1]] == null) { - --size; - } - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/Render.java b/src/classes/com/sun/opengl/impl/tessellator/Render.java deleted file mode 100644 index 999656b82..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/Render.java +++ /dev/null @@ -1,557 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -import javax.media.opengl.*; -import javax.media.opengl.glu.*; - -class Render { - private static final boolean USE_OPTIMIZED_CODE_PATH = false; - - private Render() { - } - - private static final RenderFan renderFan = new RenderFan(); - private static final RenderStrip renderStrip = new RenderStrip(); - private static final RenderTriangle renderTriangle = new RenderTriangle(); - -/* This structure remembers the information we need about a primitive - * to be able to render it later, once we have determined which - * primitive is able to use the most triangles. - */ - private static class FaceCount { - public FaceCount() { - } - - public FaceCount(long size, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eStart, renderCallBack render) { - this.size = size; - this.eStart = eStart; - this.render = render; - } - - long size; /* number of triangles used */ - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eStart; /* edge where this primitive starts */ - renderCallBack render; - }; - - private static interface renderCallBack { - void render(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, long size); - } - - /************************ Strips and Fans decomposition ******************/ - -/* __gl_renderMesh( tess, mesh ) takes a mesh and breaks it into triangle - * fans, strips, and separate triangles. A substantial effort is made - * to use as few rendering primitives as possible (ie. to make the fans - * and strips as large as possible). - * - * The rendering output is provided as callbacks (see the api). - */ - public static void __gl_renderMesh(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUmesh mesh) { - com.sun.opengl.impl.glu.tessellator.GLUface f; - - /* Make a list of separate triangles so we can render them all at once */ - tess.lonelyTriList = null; - - for (f = mesh.fHead.next; f != mesh.fHead; f = f.next) { - f.marked = false; - } - for (f = mesh.fHead.next; f != mesh.fHead; f = f.next) { - - /* We examine all faces in an arbitrary order. Whenever we find - * an unprocessed face F, we output a group of faces including F - * whose size is maximum. - */ - if (f.inside && !f.marked) { - RenderMaximumFaceGroup(tess, f); - assert (f.marked); - } - } - if (tess.lonelyTriList != null) { - RenderLonelyTriangles(tess, tess.lonelyTriList); - tess.lonelyTriList = null; - } - } - - - static void RenderMaximumFaceGroup(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUface fOrig) { - /* We want to find the largest triangle fan or strip of unmarked faces - * which includes the given face fOrig. There are 3 possible fans - * passing through fOrig (one centered at each vertex), and 3 possible - * strips (one for each CCW permutation of the vertices). Our strategy - * is to try all of these, and take the primitive which uses the most - * triangles (a greedy approach). - */ - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e = fOrig.anEdge; - FaceCount max = new FaceCount(); - FaceCount newFace = new FaceCount(); - - max.size = 1; - max.eStart = e; - max.render = renderTriangle; - - if (!tess.flagBoundary) { - newFace = MaximumFan(e); - if (newFace.size > max.size) { - max = newFace; - } - newFace = MaximumFan(e.Lnext); - if (newFace.size > max.size) { - max = newFace; - } - newFace = MaximumFan(e.Onext.Sym); - if (newFace.size > max.size) { - max = newFace; - } - - newFace = MaximumStrip(e); - if (newFace.size > max.size) { - max = newFace; - } - newFace = MaximumStrip(e.Lnext); - if (newFace.size > max.size) { - max = newFace; - } - newFace = MaximumStrip(e.Onext.Sym); - if (newFace.size > max.size) { - max = newFace; - } - } - max.render.render(tess, max.eStart, max.size); - } - - -/* Macros which keep track of faces we have marked temporarily, and allow - * us to backtrack when necessary. With triangle fans, this is not - * really necessary, since the only awkward case is a loop of triangles - * around a single origin vertex. However with strips the situation is - * more complicated, and we need a general tracking method like the - * one here. - */ - private static boolean Marked(com.sun.opengl.impl.glu.tessellator.GLUface f) { - return !f.inside || f.marked; - } - - private static GLUface AddToTrail(com.sun.opengl.impl.glu.tessellator.GLUface f, com.sun.opengl.impl.glu.tessellator.GLUface t) { - f.trail = t; - f.marked = true; - return f; - } - - private static void FreeTrail(com.sun.opengl.impl.glu.tessellator.GLUface t) { - if (true) { - while (t != null) { - t.marked = false; - t = t.trail; - } - } else { - /* absorb trailing semicolon */ - } - } - - static FaceCount MaximumFan(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrig) { - /* eOrig.Lface is the face we want to render. We want to find the size - * of a maximal fan around eOrig.Org. To do this we just walk around - * the origin vertex as far as possible in both directions. - */ - FaceCount newFace = new FaceCount(0, null, renderFan); - com.sun.opengl.impl.glu.tessellator.GLUface trail = null; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - - for (e = eOrig; !Marked(e.Lface); e = e.Onext) { - trail = AddToTrail(e.Lface, trail); - ++newFace.size; - } - for (e = eOrig; !Marked(e.Sym.Lface); e = e.Sym.Lnext) { - trail = AddToTrail(e.Sym.Lface, trail); - ++newFace.size; - } - newFace.eStart = e; - /*LINTED*/ - FreeTrail(trail); - return newFace; - } - - - private static boolean IsEven(long n) { - return (n & 0x1L) == 0; - } - - static FaceCount MaximumStrip(com.sun.opengl.impl.glu.tessellator.GLUhalfEdge eOrig) { - /* Here we are looking for a maximal strip that contains the vertices - * eOrig.Org, eOrig.Dst, eOrig.Lnext.Dst (in that order or the - * reverse, such that all triangles are oriented CCW). - * - * Again we walk forward and backward as far as possible. However for - * strips there is a twist: to get CCW orientations, there must be - * an *even* number of triangles in the strip on one side of eOrig. - * We walk the strip starting on a side with an even number of triangles; - * if both side have an odd number, we are forced to shorten one side. - */ - FaceCount newFace = new FaceCount(0, null, renderStrip); - long headSize = 0, tailSize = 0; - com.sun.opengl.impl.glu.tessellator.GLUface trail = null; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, eTail, eHead; - - for (e = eOrig; !Marked(e.Lface); ++tailSize, e = e.Onext) { - trail = AddToTrail(e.Lface, trail); - ++tailSize; - e = e.Lnext.Sym; - if (Marked(e.Lface)) break; - trail = AddToTrail(e.Lface, trail); - } - eTail = e; - - for (e = eOrig; !Marked(e.Sym.Lface); ++headSize, e = e.Sym.Onext.Sym) { - trail = AddToTrail(e.Sym.Lface, trail); - ++headSize; - e = e.Sym.Lnext; - if (Marked(e.Sym.Lface)) break; - trail = AddToTrail(e.Sym.Lface, trail); - } - eHead = e; - - newFace.size = tailSize + headSize; - if (IsEven(tailSize)) { - newFace.eStart = eTail.Sym; - } else if (IsEven(headSize)) { - newFace.eStart = eHead; - } else { - /* Both sides have odd length, we must shorten one of them. In fact, - * we must start from eHead to guarantee inclusion of eOrig.Lface. - */ - --newFace.size; - newFace.eStart = eHead.Onext; - } - /*LINTED*/ - FreeTrail(trail); - return newFace; - } - - private static class RenderTriangle implements renderCallBack { - public void render(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, long size) { - /* Just add the triangle to a triangle list, so we can render all - * the separate triangles at once. - */ - assert (size == 1); - tess.lonelyTriList = AddToTrail(e.Lface, tess.lonelyTriList); - } - } - - - static void RenderLonelyTriangles(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUface f) { - /* Now we render all the separate triangles which could not be - * grouped into a triangle fan or strip. - */ - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - int newState; - int edgeState = -1; /* force edge state output for first vertex */ - - tess.callBeginOrBeginData(GL2ES1.GL_TRIANGLES); - - for (; f != null; f = f.trail) { - /* Loop once for each edge (there will always be 3 edges) */ - - e = f.anEdge; - do { - if (tess.flagBoundary) { - /* Set the "edge state" to true just before we output the - * first vertex of each edge on the polygon boundary. - */ - newState = (!e.Sym.Lface.inside) ? 1 : 0; - if (edgeState != newState) { - edgeState = newState; - tess.callEdgeFlagOrEdgeFlagData( edgeState != 0); - } - } - tess.callVertexOrVertexData( e.Org.data); - - e = e.Lnext; - } while (e != f.anEdge); - } - tess.callEndOrEndData(); - } - - private static class RenderFan implements renderCallBack { - public void render(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, long size) { - /* Render as many CCW triangles as possible in a fan starting from - * edge "e". The fan *should* contain exactly "size" triangles - * (otherwise we've goofed up somewhere). - */ - tess.callBeginOrBeginData( GL2ES1.GL_TRIANGLE_FAN); - tess.callVertexOrVertexData( e.Org.data); - tess.callVertexOrVertexData( e.Sym.Org.data); - - while (!Marked(e.Lface)) { - e.Lface.marked = true; - --size; - e = e.Onext; - tess.callVertexOrVertexData( e.Sym.Org.data); - } - - assert (size == 0); - tess.callEndOrEndData(); - } - } - - private static class RenderStrip implements renderCallBack { - public void render(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e, long size) { - /* Render as many CCW triangles as possible in a strip starting from - * edge "e". The strip *should* contain exactly "size" triangles - * (otherwise we've goofed up somewhere). - */ - tess.callBeginOrBeginData( GL2ES1.GL_TRIANGLE_STRIP); - tess.callVertexOrVertexData( e.Org.data); - tess.callVertexOrVertexData( e.Sym.Org.data); - - while (!Marked(e.Lface)) { - e.Lface.marked = true; - --size; - e = e.Lnext.Sym; - tess.callVertexOrVertexData( e.Org.data); - if (Marked(e.Lface)) break; - - e.Lface.marked = true; - --size; - e = e.Onext; - tess.callVertexOrVertexData( e.Sym.Org.data); - } - - assert (size == 0); - tess.callEndOrEndData(); - } - } - - /************************ Boundary contour decomposition ******************/ - -/* __gl_renderBoundary( tess, mesh ) takes a mesh, and outputs one - * contour for each face marked "inside". The rendering output is - * provided as callbacks (see the api). - */ - public static void __gl_renderBoundary(GLUtessellatorImpl tess, com.sun.opengl.impl.glu.tessellator.GLUmesh mesh) { - com.sun.opengl.impl.glu.tessellator.GLUface f; - com.sun.opengl.impl.glu.tessellator.GLUhalfEdge e; - - for (f = mesh.fHead.next; f != mesh.fHead; f = f.next) { - if (f.inside) { - tess.callBeginOrBeginData( GL2ES1.GL_LINE_LOOP); - e = f.anEdge; - do { - tess.callVertexOrVertexData( e.Org.data); - e = e.Lnext; - } while (e != f.anEdge); - tess.callEndOrEndData(); - } - } - } - - - /************************ Quick-and-dirty decomposition ******************/ - - private static final int SIGN_INCONSISTENT = 2; - - static int ComputeNormal(GLUtessellatorImpl tess, double[] norm, boolean check) -/* - * If check==false, we compute the polygon normal and place it in norm[]. - * If check==true, we check that each triangle in the fan from v0 has a - * consistent orientation with respect to norm[]. If triangles are - * consistently oriented CCW, return 1; if CW, return -1; if all triangles - * are degenerate return 0; otherwise (no consistent orientation) return - * SIGN_INCONSISTENT. - */ { - com.sun.opengl.impl.glu.tessellator.CachedVertex[] v = tess.cache; -// CachedVertex vn = v0 + tess.cacheCount; - int vn = tess.cacheCount; -// CachedVertex vc; - int vc; - double dot, xc, yc, zc, xp, yp, zp; - double[] n = new double[3]; - int sign = 0; - - /* Find the polygon normal. It is important to get a reasonable - * normal even when the polygon is self-intersecting (eg. a bowtie). - * Otherwise, the computed normal could be very tiny, but perpendicular - * to the true plane of the polygon due to numerical noise. Then all - * the triangles would appear to be degenerate and we would incorrectly - * decompose the polygon as a fan (or simply not render it at all). - * - * We use a sum-of-triangles normal algorithm rather than the more - * efficient sum-of-trapezoids method (used in CheckOrientation() - * in normal.c). This lets us explicitly reverse the signed area - * of some triangles to get a reasonable normal in the self-intersecting - * case. - */ - if (!check) { - norm[0] = norm[1] = norm[2] = 0.0; - } - - vc = 1; - xc = v[vc].coords[0] - v[0].coords[0]; - yc = v[vc].coords[1] - v[0].coords[1]; - zc = v[vc].coords[2] - v[0].coords[2]; - while (++vc < vn) { - xp = xc; - yp = yc; - zp = zc; - xc = v[vc].coords[0] - v[0].coords[0]; - yc = v[vc].coords[1] - v[0].coords[1]; - zc = v[vc].coords[2] - v[0].coords[2]; - - /* Compute (vp - v0) cross (vc - v0) */ - n[0] = yp * zc - zp * yc; - n[1] = zp * xc - xp * zc; - n[2] = xp * yc - yp * xc; - - dot = n[0] * norm[0] + n[1] * norm[1] + n[2] * norm[2]; - if (!check) { - /* Reverse the contribution of back-facing triangles to get - * a reasonable normal for self-intersecting polygons (see above) - */ - if (dot >= 0) { - norm[0] += n[0]; - norm[1] += n[1]; - norm[2] += n[2]; - } else { - norm[0] -= n[0]; - norm[1] -= n[1]; - norm[2] -= n[2]; - } - } else if (dot != 0) { - /* Check the new orientation for consistency with previous triangles */ - if (dot > 0) { - if (sign < 0) return SIGN_INCONSISTENT; - sign = 1; - } else { - if (sign > 0) return SIGN_INCONSISTENT; - sign = -1; - } - } - } - return sign; - } - -/* __gl_renderCache( tess ) takes a single contour and tries to render it - * as a triangle fan. This handles convex polygons, as well as some - * non-convex polygons if we get lucky. - * - * Returns true if the polygon was successfully rendered. The rendering - * output is provided as callbacks (see the api). - */ - public static boolean __gl_renderCache(GLUtessellatorImpl tess) { - com.sun.opengl.impl.glu.tessellator.CachedVertex[] v = tess.cache; -// CachedVertex vn = v0 + tess.cacheCount; - int vn = tess.cacheCount; -// CachedVertex vc; - int vc; - double[] norm = new double[3]; - int sign; - - if (tess.cacheCount < 3) { - /* Degenerate contour -- no output */ - return true; - } - - norm[0] = tess.normal[0]; - norm[1] = tess.normal[1]; - norm[2] = tess.normal[2]; - if (norm[0] == 0 && norm[1] == 0 && norm[2] == 0) { - ComputeNormal( tess, norm, false); - } - - sign = ComputeNormal( tess, norm, true); - if (sign == SIGN_INCONSISTENT) { - /* Fan triangles did not have a consistent orientation */ - return false; - } - if (sign == 0) { - /* All triangles were degenerate */ - return true; - } - - if ( !USE_OPTIMIZED_CODE_PATH ) { - return false; - } else { - /* Make sure we do the right thing for each winding rule */ - switch (tess.windingRule) { - case GLU.GLU_TESS_WINDING_ODD: - case GLU.GLU_TESS_WINDING_NONZERO: - break; - case GLU.GLU_TESS_WINDING_POSITIVE: - if (sign < 0) return true; - break; - case GLU.GLU_TESS_WINDING_NEGATIVE: - if (sign > 0) return true; - break; - case GLU.GLU_TESS_WINDING_ABS_GEQ_TWO: - return true; - } - - tess.callBeginOrBeginData( tess.boundaryOnly ? GL2ES1.GL_LINE_LOOP - : (tess.cacheCount > 3) ? GL2ES1.GL_TRIANGLE_FAN - : GL2ES1.GL_TRIANGLES); - - tess.callVertexOrVertexData( v[0].data); - if (sign > 0) { - for (vc = 1; vc < vn; ++vc) { - tess.callVertexOrVertexData( v[vc].data); - } - } else { - for (vc = vn - 1; vc > 0; --vc) { - tess.callVertexOrVertexData( v[vc].data); - } - } - tess.callEndOrEndData(); - return true; - } - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/Sweep.java b/src/classes/com/sun/opengl/impl/tessellator/Sweep.java deleted file mode 100644 index 105328d87..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/Sweep.java +++ /dev/null @@ -1,1353 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -import javax.media.opengl.*; -import javax.media.opengl.glu.*; - -class Sweep { - private Sweep() { - } - -// #ifdef FOR_TRITE_TEST_PROGRAM -// extern void DebugEvent( GLUtessellator *tess ); -// #else - private static void DebugEvent(GLUtessellatorImpl tess) { - - } -// #endif - -/* - * Invariants for the Edge Dictionary. - * - each pair of adjacent edges e2=Succ(e1) satisfies EdgeLeq(e1,e2) - * at any valid location of the sweep event - * - if EdgeLeq(e2,e1) as well (at any valid sweep event), then e1 and e2 - * share a common endpoint - * - for each e, e.Dst has been processed, but not e.Org - * - each edge e satisfies VertLeq(e.Dst,event) && VertLeq(event,e.Org) - * where "event" is the current sweep line event. - * - no edge e has zero length - * - * Invariants for the Mesh (the processed portion). - * - the portion of the mesh left of the sweep line is a planar graph, - * ie. there is *some* way to embed it in the plane - * - no processed edge has zero length - * - no two processed vertices have identical coordinates - * - each "inside" region is monotone, ie. can be broken into two chains - * of monotonically increasing vertices according to VertLeq(v1,v2) - * - a non-invariant: these chains may intersect (very slightly) - * - * Invariants for the Sweep. - * - if none of the edges incident to the event vertex have an activeRegion - * (ie. none of these edges are in the edge dictionary), then the vertex - * has only right-going edges. - * - if an edge is marked "fixUpperEdge" (it is a temporary edge introduced - * by ConnectRightVertex), then it is the only right-going edge from - * its associated vertex. (This says that these edges exist only - * when it is necessary.) - */ - -/* When we merge two edges into one, we need to compute the combined - * winding of the new edge. - */ - private static void AddWinding(GLUhalfEdge eDst, GLUhalfEdge eSrc) { - eDst.winding += eSrc.winding; - eDst.Sym.winding += eSrc.Sym.winding; - } - - - private static ActiveRegion RegionBelow(ActiveRegion r) { - return ((ActiveRegion) Dict.dictKey(Dict.dictPred(r.nodeUp))); - } - - private static ActiveRegion RegionAbove(ActiveRegion r) { - return ((ActiveRegion) Dict.dictKey(Dict.dictSucc(r.nodeUp))); - } - - static boolean EdgeLeq(GLUtessellatorImpl tess, ActiveRegion reg1, ActiveRegion reg2) -/* - * Both edges must be directed from right to left (this is the canonical - * direction for the upper edge of each region). - * - * The strategy is to evaluate a "t" value for each edge at the - * current sweep line position, given by tess.event. The calculations - * are designed to be very stable, but of course they are not perfect. - * - * Special case: if both edge destinations are at the sweep event, - * we sort the edges by slope (they would otherwise compare equally). - */ { - GLUvertex event = tess.event; - GLUhalfEdge e1, e2; - double t1, t2; - - e1 = reg1.eUp; - e2 = reg2.eUp; - - if (e1.Sym.Org == event) { - if (e2.Sym.Org == event) { - /* Two edges right of the sweep line which meet at the sweep event. - * Sort them by slope. - */ - if (Geom.VertLeq(e1.Org, e2.Org)) { - return Geom.EdgeSign(e2.Sym.Org, e1.Org, e2.Org) <= 0; - } - return Geom.EdgeSign(e1.Sym.Org, e2.Org, e1.Org) >= 0; - } - return Geom.EdgeSign(e2.Sym.Org, event, e2.Org) <= 0; - } - if (e2.Sym.Org == event) { - return Geom.EdgeSign(e1.Sym.Org, event, e1.Org) >= 0; - } - - /* General case - compute signed distance *from* e1, e2 to event */ - t1 = Geom.EdgeEval(e1.Sym.Org, event, e1.Org); - t2 = Geom.EdgeEval(e2.Sym.Org, event, e2.Org); - return (t1 >= t2); - } - - - static void DeleteRegion(GLUtessellatorImpl tess, ActiveRegion reg) { - if (reg.fixUpperEdge) { - /* It was created with zero winding number, so it better be - * deleted with zero winding number (ie. it better not get merged - * with a real edge). - */ - assert (reg.eUp.winding == 0); - } - reg.eUp.activeRegion = null; - Dict.dictDelete(tess.dict, reg.nodeUp); /* __gl_dictListDelete */ - } - - - static boolean FixUpperEdge(ActiveRegion reg, GLUhalfEdge newEdge) -/* - * Replace an upper edge which needs fixing (see ConnectRightVertex). - */ { - assert (reg.fixUpperEdge); - if (!Mesh.__gl_meshDelete(reg.eUp)) return false; - reg.fixUpperEdge = false; - reg.eUp = newEdge; - newEdge.activeRegion = reg; - - return true; - } - - static ActiveRegion TopLeftRegion(ActiveRegion reg) { - GLUvertex org = reg.eUp.Org; - GLUhalfEdge e; - - /* Find the region above the uppermost edge with the same origin */ - do { - reg = RegionAbove(reg); - } while (reg.eUp.Org == org); - - /* If the edge above was a temporary edge introduced by ConnectRightVertex, - * now is the time to fix it. - */ - if (reg.fixUpperEdge) { - e = Mesh.__gl_meshConnect(RegionBelow(reg).eUp.Sym, reg.eUp.Lnext); - if (e == null) return null; - if (!FixUpperEdge(reg, e)) return null; - reg = RegionAbove(reg); - } - return reg; - } - - static ActiveRegion TopRightRegion(ActiveRegion reg) { - GLUvertex dst = reg.eUp.Sym.Org; - - /* Find the region above the uppermost edge with the same destination */ - do { - reg = RegionAbove(reg); - } while (reg.eUp.Sym.Org == dst); - return reg; - } - - static ActiveRegion AddRegionBelow(GLUtessellatorImpl tess, - ActiveRegion regAbove, - GLUhalfEdge eNewUp) -/* - * Add a new active region to the sweep line, *somewhere* below "regAbove" - * (according to where the new edge belongs in the sweep-line dictionary). - * The upper edge of the new region will be "eNewUp". - * Winding number and "inside" flag are not updated. - */ { - ActiveRegion regNew = new ActiveRegion(); - if (regNew == null) throw new RuntimeException(); - - regNew.eUp = eNewUp; - /* __gl_dictListInsertBefore */ - regNew.nodeUp = Dict.dictInsertBefore(tess.dict, regAbove.nodeUp, regNew); - if (regNew.nodeUp == null) throw new RuntimeException(); - regNew.fixUpperEdge = false; - regNew.sentinel = false; - regNew.dirty = false; - - eNewUp.activeRegion = regNew; - return regNew; - } - - static boolean IsWindingInside(GLUtessellatorImpl tess, int n) { - switch (tess.windingRule) { - case GLU.GLU_TESS_WINDING_ODD: - return (n & 1) != 0; - case GLU.GLU_TESS_WINDING_NONZERO: - return (n != 0); - case GLU.GLU_TESS_WINDING_POSITIVE: - return (n > 0); - case GLU.GLU_TESS_WINDING_NEGATIVE: - return (n < 0); - case GLU.GLU_TESS_WINDING_ABS_GEQ_TWO: - return (n >= 2) || (n <= -2); - } - /*LINTED*/ -// assert (false); - throw new InternalError(); - /*NOTREACHED*/ - } - - - static void ComputeWinding(GLUtessellatorImpl tess, ActiveRegion reg) { - reg.windingNumber = RegionAbove(reg).windingNumber + reg.eUp.winding; - reg.inside = IsWindingInside(tess, reg.windingNumber); - } - - - static void FinishRegion(GLUtessellatorImpl tess, ActiveRegion reg) -/* - * Delete a region from the sweep line. This happens when the upper - * and lower chains of a region meet (at a vertex on the sweep line). - * The "inside" flag is copied to the appropriate mesh face (we could - * not do this before -- since the structure of the mesh is always - * changing, this face may not have even existed until now). - */ { - GLUhalfEdge e = reg.eUp; - GLUface f = e.Lface; - - f.inside = reg.inside; - f.anEdge = e; /* optimization for __gl_meshTessellateMonoRegion() */ - DeleteRegion(tess, reg); - } - - - static GLUhalfEdge FinishLeftRegions(GLUtessellatorImpl tess, - ActiveRegion regFirst, ActiveRegion regLast) -/* - * We are given a vertex with one or more left-going edges. All affected - * edges should be in the edge dictionary. Starting at regFirst.eUp, - * we walk down deleting all regions where both edges have the same - * origin vOrg. At the same time we copy the "inside" flag from the - * active region to the face, since at this point each face will belong - * to at most one region (this was not necessarily true until this point - * in the sweep). The walk stops at the region above regLast; if regLast - * is null we walk as far as possible. At the same time we relink the - * mesh if necessary, so that the ordering of edges around vOrg is the - * same as in the dictionary. - */ { - ActiveRegion reg, regPrev; - GLUhalfEdge e, ePrev; - - regPrev = regFirst; - ePrev = regFirst.eUp; - while (regPrev != regLast) { - regPrev.fixUpperEdge = false; /* placement was OK */ - reg = RegionBelow(regPrev); - e = reg.eUp; - if (e.Org != ePrev.Org) { - if (!reg.fixUpperEdge) { - /* Remove the last left-going edge. Even though there are no further - * edges in the dictionary with this origin, there may be further - * such edges in the mesh (if we are adding left edges to a vertex - * that has already been processed). Thus it is important to call - * FinishRegion rather than just DeleteRegion. - */ - FinishRegion(tess, regPrev); - break; - } - /* If the edge below was a temporary edge introduced by - * ConnectRightVertex, now is the time to fix it. - */ - e = Mesh.__gl_meshConnect(ePrev.Onext.Sym, e.Sym); - if (e == null) throw new RuntimeException(); - if (!FixUpperEdge(reg, e)) throw new RuntimeException(); - } - - /* Relink edges so that ePrev.Onext == e */ - if (ePrev.Onext != e) { - if (!Mesh.__gl_meshSplice(e.Sym.Lnext, e)) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(ePrev, e)) throw new RuntimeException(); - } - FinishRegion(tess, regPrev); /* may change reg.eUp */ - ePrev = reg.eUp; - regPrev = reg; - } - return ePrev; - } - - - static void AddRightEdges(GLUtessellatorImpl tess, ActiveRegion regUp, - GLUhalfEdge eFirst, GLUhalfEdge eLast, GLUhalfEdge eTopLeft, - boolean cleanUp) -/* - * Purpose: insert right-going edges into the edge dictionary, and update - * winding numbers and mesh connectivity appropriately. All right-going - * edges share a common origin vOrg. Edges are inserted CCW starting at - * eFirst; the last edge inserted is eLast.Sym.Lnext. If vOrg has any - * left-going edges already processed, then eTopLeft must be the edge - * such that an imaginary upward vertical segment from vOrg would be - * contained between eTopLeft.Sym.Lnext and eTopLeft; otherwise eTopLeft - * should be null. - */ { - ActiveRegion reg, regPrev; - GLUhalfEdge e, ePrev; - boolean firstTime = true; - - /* Insert the new right-going edges in the dictionary */ - e = eFirst; - do { - assert (Geom.VertLeq(e.Org, e.Sym.Org)); - AddRegionBelow(tess, regUp, e.Sym); - e = e.Onext; - } while (e != eLast); - - /* Walk *all* right-going edges from e.Org, in the dictionary order, - * updating the winding numbers of each region, and re-linking the mesh - * edges to match the dictionary ordering (if necessary). - */ - if (eTopLeft == null) { - eTopLeft = RegionBelow(regUp).eUp.Sym.Onext; - } - regPrev = regUp; - ePrev = eTopLeft; - for (; ;) { - reg = RegionBelow(regPrev); - e = reg.eUp.Sym; - if (e.Org != ePrev.Org) break; - - if (e.Onext != ePrev) { - /* Unlink e from its current position, and relink below ePrev */ - if (!Mesh.__gl_meshSplice(e.Sym.Lnext, e)) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(ePrev.Sym.Lnext, e)) throw new RuntimeException(); - } - /* Compute the winding number and "inside" flag for the new regions */ - reg.windingNumber = regPrev.windingNumber - e.winding; - reg.inside = IsWindingInside(tess, reg.windingNumber); - - /* Check for two outgoing edges with same slope -- process these - * before any intersection tests (see example in __gl_computeInterior). - */ - regPrev.dirty = true; - if (!firstTime && CheckForRightSplice(tess, regPrev)) { - AddWinding(e, ePrev); - DeleteRegion(tess, regPrev); - if (!Mesh.__gl_meshDelete(ePrev)) throw new RuntimeException(); - } - firstTime = false; - regPrev = reg; - ePrev = e; - } - regPrev.dirty = true; - assert (regPrev.windingNumber - e.winding == reg.windingNumber); - - if (cleanUp) { - /* Check for intersections between newly adjacent edges. */ - WalkDirtyRegions(tess, regPrev); - } - } - - - static void CallCombine(GLUtessellatorImpl tess, GLUvertex isect, - Object[] data, float[] weights, boolean needed) { - double[] coords = new double[3]; - - /* Copy coord data in case the callback changes it. */ - coords[0] = isect.coords[0]; - coords[1] = isect.coords[1]; - coords[2] = isect.coords[2]; - - Object[] outData = new Object[1]; - tess.callCombineOrCombineData(coords, data, weights, outData); - isect.data = outData[0]; - if (isect.data == null) { - if (!needed) { - isect.data = data[0]; - } else if (!tess.fatalError) { - /* The only way fatal error is when two edges are found to intersect, - * but the user has not provided the callback necessary to handle - * generated intersection points. - */ - tess.callErrorOrErrorData(GLU.GLU_TESS_NEED_COMBINE_CALLBACK); - tess.fatalError = true; - } - } - } - - static void SpliceMergeVertices(GLUtessellatorImpl tess, GLUhalfEdge e1, - GLUhalfEdge e2) -/* - * Two vertices with idential coordinates are combined into one. - * e1.Org is kept, while e2.Org is discarded. - */ { - Object[] data = new Object[4]; - float[] weights = new float[]{0.5f, 0.5f, 0.0f, 0.0f}; - - data[0] = e1.Org.data; - data[1] = e2.Org.data; - CallCombine(tess, e1.Org, data, weights, false); - if (!Mesh.__gl_meshSplice(e1, e2)) throw new RuntimeException(); - } - - static void VertexWeights(GLUvertex isect, GLUvertex org, GLUvertex dst, - float[] weights) -/* - * Find some weights which describe how the intersection vertex is - * a linear combination of "org" and "dest". Each of the two edges - * which generated "isect" is allocated 50% of the weight; each edge - * splits the weight between its org and dst according to the - * relative distance to "isect". - */ { - double t1 = Geom.VertL1dist(org, isect); - double t2 = Geom.VertL1dist(dst, isect); - - weights[0] = (float) (0.5 * t2 / (t1 + t2)); - weights[1] = (float) (0.5 * t1 / (t1 + t2)); - isect.coords[0] += weights[0] * org.coords[0] + weights[1] * dst.coords[0]; - isect.coords[1] += weights[0] * org.coords[1] + weights[1] * dst.coords[1]; - isect.coords[2] += weights[0] * org.coords[2] + weights[1] * dst.coords[2]; - } - - - static void GetIntersectData(GLUtessellatorImpl tess, GLUvertex isect, - GLUvertex orgUp, GLUvertex dstUp, - GLUvertex orgLo, GLUvertex dstLo) -/* - * We've computed a new intersection point, now we need a "data" pointer - * from the user so that we can refer to this new vertex in the - * rendering callbacks. - */ { - Object[] data = new Object[4]; - float[] weights = new float[4]; - float[] weights1 = new float[2]; - float[] weights2 = new float[2]; - - data[0] = orgUp.data; - data[1] = dstUp.data; - data[2] = orgLo.data; - data[3] = dstLo.data; - - isect.coords[0] = isect.coords[1] = isect.coords[2] = 0; - VertexWeights(isect, orgUp, dstUp, weights1); - VertexWeights(isect, orgLo, dstLo, weights2); - System.arraycopy(weights1, 0, weights, 0, 2); - System.arraycopy(weights2, 0, weights, 2, 2); - - CallCombine(tess, isect, data, weights, true); - } - - static boolean CheckForRightSplice(GLUtessellatorImpl tess, ActiveRegion regUp) -/* - * Check the upper and lower edge of "regUp", to make sure that the - * eUp.Org is above eLo, or eLo.Org is below eUp (depending on which - * origin is leftmost). - * - * The main purpose is to splice right-going edges with the same - * dest vertex and nearly identical slopes (ie. we can't distinguish - * the slopes numerically). However the splicing can also help us - * to recover from numerical errors. For example, suppose at one - * point we checked eUp and eLo, and decided that eUp.Org is barely - * above eLo. Then later, we split eLo into two edges (eg. from - * a splice operation like this one). This can change the result of - * our test so that now eUp.Org is incident to eLo, or barely below it. - * We must correct this condition to maintain the dictionary invariants. - * - * One possibility is to check these edges for intersection again - * (ie. CheckForIntersect). This is what we do if possible. However - * CheckForIntersect requires that tess.event lies between eUp and eLo, - * so that it has something to fall back on when the intersection - * calculation gives us an unusable answer. So, for those cases where - * we can't check for intersection, this routine fixes the problem - * by just splicing the offending vertex into the other edge. - * This is a guaranteed solution, no matter how degenerate things get. - * Basically this is a combinatorial solution to a numerical problem. - */ { - ActiveRegion regLo = RegionBelow(regUp); - GLUhalfEdge eUp = regUp.eUp; - GLUhalfEdge eLo = regLo.eUp; - - if (Geom.VertLeq(eUp.Org, eLo.Org)) { - if (Geom.EdgeSign(eLo.Sym.Org, eUp.Org, eLo.Org) > 0) return false; - - /* eUp.Org appears to be below eLo */ - if (!Geom.VertEq(eUp.Org, eLo.Org)) { - /* Splice eUp.Org into eLo */ - if (Mesh.__gl_meshSplitEdge(eLo.Sym) == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eUp, eLo.Sym.Lnext)) throw new RuntimeException(); - regUp.dirty = regLo.dirty = true; - - } else if (eUp.Org != eLo.Org) { - /* merge the two vertices, discarding eUp.Org */ - tess.pq.pqDelete(eUp.Org.pqHandle); /* __gl_pqSortDelete */ - SpliceMergeVertices(tess, eLo.Sym.Lnext, eUp); - } - } else { - if (Geom.EdgeSign(eUp.Sym.Org, eLo.Org, eUp.Org) < 0) return false; - - /* eLo.Org appears to be above eUp, so splice eLo.Org into eUp */ - RegionAbove(regUp).dirty = regUp.dirty = true; - if (Mesh.__gl_meshSplitEdge(eUp.Sym) == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eLo.Sym.Lnext, eUp)) throw new RuntimeException(); - } - return true; - } - - static boolean CheckForLeftSplice(GLUtessellatorImpl tess, ActiveRegion regUp) -/* - * Check the upper and lower edge of "regUp", to make sure that the - * eUp.Sym.Org is above eLo, or eLo.Sym.Org is below eUp (depending on which - * destination is rightmost). - * - * Theoretically, this should always be true. However, splitting an edge - * into two pieces can change the results of previous tests. For example, - * suppose at one point we checked eUp and eLo, and decided that eUp.Sym.Org - * is barely above eLo. Then later, we split eLo into two edges (eg. from - * a splice operation like this one). This can change the result of - * the test so that now eUp.Sym.Org is incident to eLo, or barely below it. - * We must correct this condition to maintain the dictionary invariants - * (otherwise new edges might get inserted in the wrong place in the - * dictionary, and bad stuff will happen). - * - * We fix the problem by just splicing the offending vertex into the - * other edge. - */ { - ActiveRegion regLo = RegionBelow(regUp); - GLUhalfEdge eUp = regUp.eUp; - GLUhalfEdge eLo = regLo.eUp; - GLUhalfEdge e; - - assert (!Geom.VertEq(eUp.Sym.Org, eLo.Sym.Org)); - - if (Geom.VertLeq(eUp.Sym.Org, eLo.Sym.Org)) { - if (Geom.EdgeSign(eUp.Sym.Org, eLo.Sym.Org, eUp.Org) < 0) return false; - - /* eLo.Sym.Org is above eUp, so splice eLo.Sym.Org into eUp */ - RegionAbove(regUp).dirty = regUp.dirty = true; - e = Mesh.__gl_meshSplitEdge(eUp); - if (e == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eLo.Sym, e)) throw new RuntimeException(); - e.Lface.inside = regUp.inside; - } else { - if (Geom.EdgeSign(eLo.Sym.Org, eUp.Sym.Org, eLo.Org) > 0) return false; - - /* eUp.Sym.Org is below eLo, so splice eUp.Sym.Org into eLo */ - regUp.dirty = regLo.dirty = true; - e = Mesh.__gl_meshSplitEdge(eLo); - if (e == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eUp.Lnext, eLo.Sym)) throw new RuntimeException(); - e.Sym.Lface.inside = regUp.inside; - } - return true; - } - - - static boolean CheckForIntersect(GLUtessellatorImpl tess, ActiveRegion regUp) -/* - * Check the upper and lower edges of the given region to see if - * they intersect. If so, create the intersection and add it - * to the data structures. - * - * Returns true if adding the new intersection resulted in a recursive - * call to AddRightEdges(); in this case all "dirty" regions have been - * checked for intersections, and possibly regUp has been deleted. - */ { - ActiveRegion regLo = RegionBelow(regUp); - GLUhalfEdge eUp = regUp.eUp; - GLUhalfEdge eLo = regLo.eUp; - GLUvertex orgUp = eUp.Org; - GLUvertex orgLo = eLo.Org; - GLUvertex dstUp = eUp.Sym.Org; - GLUvertex dstLo = eLo.Sym.Org; - double tMinUp, tMaxLo; - GLUvertex isect = new GLUvertex(); - GLUvertex orgMin; - GLUhalfEdge e; - - assert (!Geom.VertEq(dstLo, dstUp)); - assert (Geom.EdgeSign(dstUp, tess.event, orgUp) <= 0); - assert (Geom.EdgeSign(dstLo, tess.event, orgLo) >= 0); - assert (orgUp != tess.event && orgLo != tess.event); - assert (!regUp.fixUpperEdge && !regLo.fixUpperEdge); - - if (orgUp == orgLo) return false; /* right endpoints are the same */ - - tMinUp = Math.min(orgUp.t, dstUp.t); - tMaxLo = Math.max(orgLo.t, dstLo.t); - if (tMinUp > tMaxLo) return false; /* t ranges do not overlap */ - - if (Geom.VertLeq(orgUp, orgLo)) { - if (Geom.EdgeSign(dstLo, orgUp, orgLo) > 0) return false; - } else { - if (Geom.EdgeSign(dstUp, orgLo, orgUp) < 0) return false; - } - - /* At this point the edges intersect, at least marginally */ - DebugEvent(tess); - - Geom.EdgeIntersect(dstUp, orgUp, dstLo, orgLo, isect); - /* The following properties are guaranteed: */ - assert (Math.min(orgUp.t, dstUp.t) <= isect.t); - assert (isect.t <= Math.max(orgLo.t, dstLo.t)); - assert (Math.min(dstLo.s, dstUp.s) <= isect.s); - assert (isect.s <= Math.max(orgLo.s, orgUp.s)); - - if (Geom.VertLeq(isect, tess.event)) { - /* The intersection point lies slightly to the left of the sweep line, - * so move it until it''s slightly to the right of the sweep line. - * (If we had perfect numerical precision, this would never happen - * in the first place). The easiest and safest thing to do is - * replace the intersection by tess.event. - */ - isect.s = tess.event.s; - isect.t = tess.event.t; - } - /* Similarly, if the computed intersection lies to the right of the - * rightmost origin (which should rarely happen), it can cause - * unbelievable inefficiency on sufficiently degenerate inputs. - * (If you have the test program, try running test54.d with the - * "X zoom" option turned on). - */ - orgMin = Geom.VertLeq(orgUp, orgLo) ? orgUp : orgLo; - if (Geom.VertLeq(orgMin, isect)) { - isect.s = orgMin.s; - isect.t = orgMin.t; - } - - if (Geom.VertEq(isect, orgUp) || Geom.VertEq(isect, orgLo)) { - /* Easy case -- intersection at one of the right endpoints */ - CheckForRightSplice(tess, regUp); - return false; - } - - if ((!Geom.VertEq(dstUp, tess.event) - && Geom.EdgeSign(dstUp, tess.event, isect) >= 0) - || (!Geom.VertEq(dstLo, tess.event) - && Geom.EdgeSign(dstLo, tess.event, isect) <= 0)) { - /* Very unusual -- the new upper or lower edge would pass on the - * wrong side of the sweep event, or through it. This can happen - * due to very small numerical errors in the intersection calculation. - */ - if (dstLo == tess.event) { - /* Splice dstLo into eUp, and process the new region(s) */ - if (Mesh.__gl_meshSplitEdge(eUp.Sym) == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eLo.Sym, eUp)) throw new RuntimeException(); - regUp = TopLeftRegion(regUp); - if (regUp == null) throw new RuntimeException(); - eUp = RegionBelow(regUp).eUp; - FinishLeftRegions(tess, RegionBelow(regUp), regLo); - AddRightEdges(tess, regUp, eUp.Sym.Lnext, eUp, eUp, true); - return true; - } - if (dstUp == tess.event) { - /* Splice dstUp into eLo, and process the new region(s) */ - if (Mesh.__gl_meshSplitEdge(eLo.Sym) == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eUp.Lnext, eLo.Sym.Lnext)) throw new RuntimeException(); - regLo = regUp; - regUp = TopRightRegion(regUp); - e = RegionBelow(regUp).eUp.Sym.Onext; - regLo.eUp = eLo.Sym.Lnext; - eLo = FinishLeftRegions(tess, regLo, null); - AddRightEdges(tess, regUp, eLo.Onext, eUp.Sym.Onext, e, true); - return true; - } - /* Special case: called from ConnectRightVertex. If either - * edge passes on the wrong side of tess.event, split it - * (and wait for ConnectRightVertex to splice it appropriately). - */ - if (Geom.EdgeSign(dstUp, tess.event, isect) >= 0) { - RegionAbove(regUp).dirty = regUp.dirty = true; - if (Mesh.__gl_meshSplitEdge(eUp.Sym) == null) throw new RuntimeException(); - eUp.Org.s = tess.event.s; - eUp.Org.t = tess.event.t; - } - if (Geom.EdgeSign(dstLo, tess.event, isect) <= 0) { - regUp.dirty = regLo.dirty = true; - if (Mesh.__gl_meshSplitEdge(eLo.Sym) == null) throw new RuntimeException(); - eLo.Org.s = tess.event.s; - eLo.Org.t = tess.event.t; - } - /* leave the rest for ConnectRightVertex */ - return false; - } - - /* General case -- split both edges, splice into new vertex. - * When we do the splice operation, the order of the arguments is - * arbitrary as far as correctness goes. However, when the operation - * creates a new face, the work done is proportional to the size of - * the new face. We expect the faces in the processed part of - * the mesh (ie. eUp.Lface) to be smaller than the faces in the - * unprocessed original contours (which will be eLo.Sym.Lnext.Lface). - */ - if (Mesh.__gl_meshSplitEdge(eUp.Sym) == null) throw new RuntimeException(); - if (Mesh.__gl_meshSplitEdge(eLo.Sym) == null) throw new RuntimeException(); - if (!Mesh.__gl_meshSplice(eLo.Sym.Lnext, eUp)) throw new RuntimeException(); - eUp.Org.s = isect.s; - eUp.Org.t = isect.t; - eUp.Org.pqHandle = tess.pq.pqInsert(eUp.Org); /* __gl_pqSortInsert */ - if (eUp.Org.pqHandle == Long.MAX_VALUE) { - tess.pq.pqDeletePriorityQ(); /* __gl_pqSortDeletePriorityQ */ - tess.pq = null; - throw new RuntimeException(); - } - GetIntersectData(tess, eUp.Org, orgUp, dstUp, orgLo, dstLo); - RegionAbove(regUp).dirty = regUp.dirty = regLo.dirty = true; - return false; - } - - static void WalkDirtyRegions(GLUtessellatorImpl tess, ActiveRegion regUp) -/* - * When the upper or lower edge of any region changes, the region is - * marked "dirty". This routine walks through all the dirty regions - * and makes sure that the dictionary invariants are satisfied - * (see the comments at the beginning of this file). Of course - * new dirty regions can be created as we make changes to restore - * the invariants. - */ { - ActiveRegion regLo = RegionBelow(regUp); - GLUhalfEdge eUp, eLo; - - for (; ;) { - /* Find the lowest dirty region (we walk from the bottom up). */ - while (regLo.dirty) { - regUp = regLo; - regLo = RegionBelow(regLo); - } - if (!regUp.dirty) { - regLo = regUp; - regUp = RegionAbove(regUp); - if (regUp == null || !regUp.dirty) { - /* We've walked all the dirty regions */ - return; - } - } - regUp.dirty = false; - eUp = regUp.eUp; - eLo = regLo.eUp; - - if (eUp.Sym.Org != eLo.Sym.Org) { - /* Check that the edge ordering is obeyed at the Dst vertices. */ - if (CheckForLeftSplice(tess, regUp)) { - - /* If the upper or lower edge was marked fixUpperEdge, then - * we no longer need it (since these edges are needed only for - * vertices which otherwise have no right-going edges). - */ - if (regLo.fixUpperEdge) { - DeleteRegion(tess, regLo); - if (!Mesh.__gl_meshDelete(eLo)) throw new RuntimeException(); - regLo = RegionBelow(regUp); - eLo = regLo.eUp; - } else if (regUp.fixUpperEdge) { - DeleteRegion(tess, regUp); - if (!Mesh.__gl_meshDelete(eUp)) throw new RuntimeException(); - regUp = RegionAbove(regLo); - eUp = regUp.eUp; - } - } - } - if (eUp.Org != eLo.Org) { - if (eUp.Sym.Org != eLo.Sym.Org - && !regUp.fixUpperEdge && !regLo.fixUpperEdge - && (eUp.Sym.Org == tess.event || eLo.Sym.Org == tess.event)) { - /* When all else fails in CheckForIntersect(), it uses tess.event - * as the intersection location. To make this possible, it requires - * that tess.event lie between the upper and lower edges, and also - * that neither of these is marked fixUpperEdge (since in the worst - * case it might splice one of these edges into tess.event, and - * violate the invariant that fixable edges are the only right-going - * edge from their associated vertex). - */ - if (CheckForIntersect(tess, regUp)) { - /* WalkDirtyRegions() was called recursively; we're done */ - return; - } - } else { - /* Even though we can't use CheckForIntersect(), the Org vertices - * may violate the dictionary edge ordering. Check and correct this. - */ - CheckForRightSplice(tess, regUp); - } - } - if (eUp.Org == eLo.Org && eUp.Sym.Org == eLo.Sym.Org) { - /* A degenerate loop consisting of only two edges -- delete it. */ - AddWinding(eLo, eUp); - DeleteRegion(tess, regUp); - if (!Mesh.__gl_meshDelete(eUp)) throw new RuntimeException(); - regUp = RegionAbove(regLo); - } - } - } - - - static void ConnectRightVertex(GLUtessellatorImpl tess, ActiveRegion regUp, - GLUhalfEdge eBottomLeft) -/* - * Purpose: connect a "right" vertex vEvent (one where all edges go left) - * to the unprocessed portion of the mesh. Since there are no right-going - * edges, two regions (one above vEvent and one below) are being merged - * into one. "regUp" is the upper of these two regions. - * - * There are two reasons for doing this (adding a right-going edge): - * - if the two regions being merged are "inside", we must add an edge - * to keep them separated (the combined region would not be monotone). - * - in any case, we must leave some record of vEvent in the dictionary, - * so that we can merge vEvent with features that we have not seen yet. - * For example, maybe there is a vertical edge which passes just to - * the right of vEvent; we would like to splice vEvent into this edge. - * - * However, we don't want to connect vEvent to just any vertex. We don''t - * want the new edge to cross any other edges; otherwise we will create - * intersection vertices even when the input data had no self-intersections. - * (This is a bad thing; if the user's input data has no intersections, - * we don't want to generate any false intersections ourselves.) - * - * Our eventual goal is to connect vEvent to the leftmost unprocessed - * vertex of the combined region (the union of regUp and regLo). - * But because of unseen vertices with all right-going edges, and also - * new vertices which may be created by edge intersections, we don''t - * know where that leftmost unprocessed vertex is. In the meantime, we - * connect vEvent to the closest vertex of either chain, and mark the region - * as "fixUpperEdge". This flag says to delete and reconnect this edge - * to the next processed vertex on the boundary of the combined region. - * Quite possibly the vertex we connected to will turn out to be the - * closest one, in which case we won''t need to make any changes. - */ { - GLUhalfEdge eNew; - GLUhalfEdge eTopLeft = eBottomLeft.Onext; - ActiveRegion regLo = RegionBelow(regUp); - GLUhalfEdge eUp = regUp.eUp; - GLUhalfEdge eLo = regLo.eUp; - boolean degenerate = false; - - if (eUp.Sym.Org != eLo.Sym.Org) { - CheckForIntersect(tess, regUp); - } - - /* Possible new degeneracies: upper or lower edge of regUp may pass - * through vEvent, or may coincide with new intersection vertex - */ - if (Geom.VertEq(eUp.Org, tess.event)) { - if (!Mesh.__gl_meshSplice(eTopLeft.Sym.Lnext, eUp)) throw new RuntimeException(); - regUp = TopLeftRegion(regUp); - if (regUp == null) throw new RuntimeException(); - eTopLeft = RegionBelow(regUp).eUp; - FinishLeftRegions(tess, RegionBelow(regUp), regLo); - degenerate = true; - } - if (Geom.VertEq(eLo.Org, tess.event)) { - if (!Mesh.__gl_meshSplice(eBottomLeft, eLo.Sym.Lnext)) throw new RuntimeException(); - eBottomLeft = FinishLeftRegions(tess, regLo, null); - degenerate = true; - } - if (degenerate) { - AddRightEdges(tess, regUp, eBottomLeft.Onext, eTopLeft, eTopLeft, true); - return; - } - - /* Non-degenerate situation -- need to add a temporary, fixable edge. - * Connect to the closer of eLo.Org, eUp.Org. - */ - if (Geom.VertLeq(eLo.Org, eUp.Org)) { - eNew = eLo.Sym.Lnext; - } else { - eNew = eUp; - } - eNew = Mesh.__gl_meshConnect(eBottomLeft.Onext.Sym, eNew); - if (eNew == null) throw new RuntimeException(); - - /* Prevent cleanup, otherwise eNew might disappear before we've even - * had a chance to mark it as a temporary edge. - */ - AddRightEdges(tess, regUp, eNew, eNew.Onext, eNew.Onext, false); - eNew.Sym.activeRegion.fixUpperEdge = true; - WalkDirtyRegions(tess, regUp); - } - -/* Because vertices at exactly the same location are merged together - * before we process the sweep event, some degenerate cases can't occur. - * However if someone eventually makes the modifications required to - * merge features which are close together, the cases below marked - * TOLERANCE_NONZERO will be useful. They were debugged before the - * code to merge identical vertices in the main loop was added. - */ - private static final boolean TOLERANCE_NONZERO = false; - - static void ConnectLeftDegenerate(GLUtessellatorImpl tess, - ActiveRegion regUp, GLUvertex vEvent) -/* - * The event vertex lies exacty on an already-processed edge or vertex. - * Adding the new vertex involves splicing it into the already-processed - * part of the mesh. - */ { - GLUhalfEdge e, eTopLeft, eTopRight, eLast; - ActiveRegion reg; - - e = regUp.eUp; - if (Geom.VertEq(e.Org, vEvent)) { - /* e.Org is an unprocessed vertex - just combine them, and wait - * for e.Org to be pulled from the queue - */ - assert (TOLERANCE_NONZERO); - SpliceMergeVertices(tess, e, vEvent.anEdge); - return; - } - - if (!Geom.VertEq(e.Sym.Org, vEvent)) { - /* General case -- splice vEvent into edge e which passes through it */ - if (Mesh.__gl_meshSplitEdge(e.Sym) == null) throw new RuntimeException(); - if (regUp.fixUpperEdge) { - /* This edge was fixable -- delete unused portion of original edge */ - if (!Mesh.__gl_meshDelete(e.Onext)) throw new RuntimeException(); - regUp.fixUpperEdge = false; - } - if (!Mesh.__gl_meshSplice(vEvent.anEdge, e)) throw new RuntimeException(); - SweepEvent(tess, vEvent); /* recurse */ - return; - } - - /* vEvent coincides with e.Sym.Org, which has already been processed. - * Splice in the additional right-going edges. - */ - assert (TOLERANCE_NONZERO); - regUp = TopRightRegion(regUp); - reg = RegionBelow(regUp); - eTopRight = reg.eUp.Sym; - eTopLeft = eLast = eTopRight.Onext; - if (reg.fixUpperEdge) { - /* Here e.Sym.Org has only a single fixable edge going right. - * We can delete it since now we have some real right-going edges. - */ - assert (eTopLeft != eTopRight); /* there are some left edges too */ - DeleteRegion(tess, reg); - if (!Mesh.__gl_meshDelete(eTopRight)) throw new RuntimeException(); - eTopRight = eTopLeft.Sym.Lnext; - } - if (!Mesh.__gl_meshSplice(vEvent.anEdge, eTopRight)) throw new RuntimeException(); - if (!Geom.EdgeGoesLeft(eTopLeft)) { - /* e.Sym.Org had no left-going edges -- indicate this to AddRightEdges() */ - eTopLeft = null; - } - AddRightEdges(tess, regUp, eTopRight.Onext, eLast, eTopLeft, true); - } - - - static void ConnectLeftVertex(GLUtessellatorImpl tess, GLUvertex vEvent) -/* - * Purpose: connect a "left" vertex (one where both edges go right) - * to the processed portion of the mesh. Let R be the active region - * containing vEvent, and let U and L be the upper and lower edge - * chains of R. There are two possibilities: - * - * - the normal case: split R into two regions, by connecting vEvent to - * the rightmost vertex of U or L lying to the left of the sweep line - * - * - the degenerate case: if vEvent is close enough to U or L, we - * merge vEvent into that edge chain. The subcases are: - * - merging with the rightmost vertex of U or L - * - merging with the active edge of U or L - * - merging with an already-processed portion of U or L - */ { - ActiveRegion regUp, regLo, reg; - GLUhalfEdge eUp, eLo, eNew; - ActiveRegion tmp = new ActiveRegion(); - - /* assert ( vEvent.anEdge.Onext.Onext == vEvent.anEdge ); */ - - /* Get a pointer to the active region containing vEvent */ - tmp.eUp = vEvent.anEdge.Sym; - /* __GL_DICTLISTKEY */ /* __gl_dictListSearch */ - regUp = (ActiveRegion) Dict.dictKey(Dict.dictSearch(tess.dict, tmp)); - regLo = RegionBelow(regUp); - eUp = regUp.eUp; - eLo = regLo.eUp; - - /* Try merging with U or L first */ - if (Geom.EdgeSign(eUp.Sym.Org, vEvent, eUp.Org) == 0) { - ConnectLeftDegenerate(tess, regUp, vEvent); - return; - } - - /* Connect vEvent to rightmost processed vertex of either chain. - * e.Sym.Org is the vertex that we will connect to vEvent. - */ - reg = Geom.VertLeq(eLo.Sym.Org, eUp.Sym.Org) ? regUp : regLo; - - if (regUp.inside || reg.fixUpperEdge) { - if (reg == regUp) { - eNew = Mesh.__gl_meshConnect(vEvent.anEdge.Sym, eUp.Lnext); - if (eNew == null) throw new RuntimeException(); - } else { - GLUhalfEdge tempHalfEdge = Mesh.__gl_meshConnect(eLo.Sym.Onext.Sym, vEvent.anEdge); - if (tempHalfEdge == null) throw new RuntimeException(); - - eNew = tempHalfEdge.Sym; - } - if (reg.fixUpperEdge) { - if (!FixUpperEdge(reg, eNew)) throw new RuntimeException(); - } else { - ComputeWinding(tess, AddRegionBelow(tess, regUp, eNew)); - } - SweepEvent(tess, vEvent); - } else { - /* The new vertex is in a region which does not belong to the polygon. - * We don''t need to connect this vertex to the rest of the mesh. - */ - AddRightEdges(tess, regUp, vEvent.anEdge, vEvent.anEdge, null, true); - } - } - - - static void SweepEvent(GLUtessellatorImpl tess, GLUvertex vEvent) -/* - * Does everything necessary when the sweep line crosses a vertex. - * Updates the mesh and the edge dictionary. - */ { - ActiveRegion regUp, reg; - GLUhalfEdge e, eTopLeft, eBottomLeft; - - tess.event = vEvent; /* for access in EdgeLeq() */ - DebugEvent(tess); - - /* Check if this vertex is the right endpoint of an edge that is - * already in the dictionary. In this case we don't need to waste - * time searching for the location to insert new edges. - */ - e = vEvent.anEdge; - while (e.activeRegion == null) { - e = e.Onext; - if (e == vEvent.anEdge) { - /* All edges go right -- not incident to any processed edges */ - ConnectLeftVertex(tess, vEvent); - return; - } - } - - /* Processing consists of two phases: first we "finish" all the - * active regions where both the upper and lower edges terminate - * at vEvent (ie. vEvent is closing off these regions). - * We mark these faces "inside" or "outside" the polygon according - * to their winding number, and delete the edges from the dictionary. - * This takes care of all the left-going edges from vEvent. - */ - regUp = TopLeftRegion(e.activeRegion); - if (regUp == null) throw new RuntimeException(); - reg = RegionBelow(regUp); - eTopLeft = reg.eUp; - eBottomLeft = FinishLeftRegions(tess, reg, null); - - /* Next we process all the right-going edges from vEvent. This - * involves adding the edges to the dictionary, and creating the - * associated "active regions" which record information about the - * regions between adjacent dictionary edges. - */ - if (eBottomLeft.Onext == eTopLeft) { - /* No right-going edges -- add a temporary "fixable" edge */ - ConnectRightVertex(tess, regUp, eBottomLeft); - } else { - AddRightEdges(tess, regUp, eBottomLeft.Onext, eTopLeft, eTopLeft, true); - } - } - - -/* Make the sentinel coordinates big enough that they will never be - * merged with real input features. (Even with the largest possible - * input contour and the maximum tolerance of 1.0, no merging will be - * done with coordinates larger than 3 * GLU_TESS_MAX_COORD). - */ - private static final double SENTINEL_COORD = (4.0 * GLU.GLU_TESS_MAX_COORD); - - static void AddSentinel(GLUtessellatorImpl tess, double t) -/* - * We add two sentinel edges above and below all other edges, - * to avoid special cases at the top and bottom. - */ { - GLUhalfEdge e; - ActiveRegion reg = new ActiveRegion(); - if (reg == null) throw new RuntimeException(); - - e = Mesh.__gl_meshMakeEdge(tess.mesh); - if (e == null) throw new RuntimeException(); - - e.Org.s = SENTINEL_COORD; - e.Org.t = t; - e.Sym.Org.s = -SENTINEL_COORD; - e.Sym.Org.t = t; - tess.event = e.Sym.Org; /* initialize it */ - - reg.eUp = e; - reg.windingNumber = 0; - reg.inside = false; - reg.fixUpperEdge = false; - reg.sentinel = true; - reg.dirty = false; - reg.nodeUp = Dict.dictInsert(tess.dict, reg); /* __gl_dictListInsertBefore */ - if (reg.nodeUp == null) throw new RuntimeException(); - } - - - static void InitEdgeDict(final GLUtessellatorImpl tess) -/* - * We maintain an ordering of edge intersections with the sweep line. - * This order is maintained in a dynamic dictionary. - */ { - /* __gl_dictListNewDict */ - tess.dict = Dict.dictNewDict(tess, new Dict.DictLeq() { - public boolean leq(Object frame, Object key1, Object key2) { - return EdgeLeq(tess, (ActiveRegion) key1, (ActiveRegion) key2); - } - }); - if (tess.dict == null) throw new RuntimeException(); - - AddSentinel(tess, -SENTINEL_COORD); - AddSentinel(tess, SENTINEL_COORD); - } - - - static void DoneEdgeDict(GLUtessellatorImpl tess) { - ActiveRegion reg; - int fixedEdges = 0; - - /* __GL_DICTLISTKEY */ /* __GL_DICTLISTMIN */ - while ((reg = (ActiveRegion) Dict.dictKey(Dict.dictMin(tess.dict))) != null) { - /* - * At the end of all processing, the dictionary should contain - * only the two sentinel edges, plus at most one "fixable" edge - * created by ConnectRightVertex(). - */ - if (!reg.sentinel) { - assert (reg.fixUpperEdge); - assert (++fixedEdges == 1); - } - assert (reg.windingNumber == 0); - DeleteRegion(tess, reg); -/* __gl_meshDelete( reg.eUp );*/ - } - Dict.dictDeleteDict(tess.dict); /* __gl_dictListDeleteDict */ - } - - - static void RemoveDegenerateEdges(GLUtessellatorImpl tess) -/* - * Remove zero-length edges, and contours with fewer than 3 vertices. - */ { - GLUhalfEdge e, eNext, eLnext; - GLUhalfEdge eHead = tess.mesh.eHead; - - /*LINTED*/ - for (e = eHead.next; e != eHead; e = eNext) { - eNext = e.next; - eLnext = e.Lnext; - - if (Geom.VertEq(e.Org, e.Sym.Org) && e.Lnext.Lnext != e) { - /* Zero-length edge, contour has at least 3 edges */ - - SpliceMergeVertices(tess, eLnext, e); /* deletes e.Org */ - if (!Mesh.__gl_meshDelete(e)) throw new RuntimeException(); /* e is a self-loop */ - e = eLnext; - eLnext = e.Lnext; - } - if (eLnext.Lnext == e) { - /* Degenerate contour (one or two edges) */ - - if (eLnext != e) { - if (eLnext == eNext || eLnext == eNext.Sym) { - eNext = eNext.next; - } - if (!Mesh.__gl_meshDelete(eLnext)) throw new RuntimeException(); - } - if (e == eNext || e == eNext.Sym) { - eNext = eNext.next; - } - if (!Mesh.__gl_meshDelete(e)) throw new RuntimeException(); - } - } - } - - static boolean InitPriorityQ(GLUtessellatorImpl tess) -/* - * Insert all vertices into the priority queue which determines the - * order in which vertices cross the sweep line. - */ { - PriorityQ pq; - GLUvertex v, vHead; - - /* __gl_pqSortNewPriorityQ */ - pq = tess.pq = PriorityQ.pqNewPriorityQ(new PriorityQ.Leq() { - public boolean leq(Object key1, Object key2) { - return Geom.VertLeq(((GLUvertex) key1), (GLUvertex) key2); - } - }); - if (pq == null) return false; - - vHead = tess.mesh.vHead; - for (v = vHead.next; v != vHead; v = v.next) { - v.pqHandle = pq.pqInsert(v); /* __gl_pqSortInsert */ - if (v.pqHandle == Long.MAX_VALUE) break; - } - if (v != vHead || !pq.pqInit()) { /* __gl_pqSortInit */ - tess.pq.pqDeletePriorityQ(); /* __gl_pqSortDeletePriorityQ */ - tess.pq = null; - return false; - } - - return true; - } - - - static void DonePriorityQ(GLUtessellatorImpl tess) { - tess.pq.pqDeletePriorityQ(); /* __gl_pqSortDeletePriorityQ */ - } - - - static boolean RemoveDegenerateFaces(GLUmesh mesh) -/* - * Delete any degenerate faces with only two edges. WalkDirtyRegions() - * will catch almost all of these, but it won't catch degenerate faces - * produced by splice operations on already-processed edges. - * The two places this can happen are in FinishLeftRegions(), when - * we splice in a "temporary" edge produced by ConnectRightVertex(), - * and in CheckForLeftSplice(), where we splice already-processed - * edges to ensure that our dictionary invariants are not violated - * by numerical errors. - * - * In both these cases it is *very* dangerous to delete the offending - * edge at the time, since one of the routines further up the stack - * will sometimes be keeping a pointer to that edge. - */ { - GLUface f, fNext; - GLUhalfEdge e; - - /*LINTED*/ - for (f = mesh.fHead.next; f != mesh.fHead; f = fNext) { - fNext = f.next; - e = f.anEdge; - assert (e.Lnext != e); - - if (e.Lnext.Lnext == e) { - /* A face with only two edges */ - AddWinding(e.Onext, e); - if (!Mesh.__gl_meshDelete(e)) return false; - } - } - return true; - } - - public static boolean __gl_computeInterior(GLUtessellatorImpl tess) -/* - * __gl_computeInterior( tess ) computes the planar arrangement specified - * by the given contours, and further subdivides this arrangement - * into regions. Each region is marked "inside" if it belongs - * to the polygon, according to the rule given by tess.windingRule. - * Each interior region is guaranteed be monotone. - */ { - GLUvertex v, vNext; - - tess.fatalError = false; - - /* Each vertex defines an event for our sweep line. Start by inserting - * all the vertices in a priority queue. Events are processed in - * lexicographic order, ie. - * - * e1 < e2 iff e1.x < e2.x || (e1.x == e2.x && e1.y < e2.y) - */ - RemoveDegenerateEdges(tess); - if (!InitPriorityQ(tess)) return false; /* if error */ - InitEdgeDict(tess); - - /* __gl_pqSortExtractMin */ - while ((v = (GLUvertex) tess.pq.pqExtractMin()) != null) { - for (; ;) { - vNext = (GLUvertex) tess.pq.pqMinimum(); /* __gl_pqSortMinimum */ - if (vNext == null || !Geom.VertEq(vNext, v)) break; - - /* Merge together all vertices at exactly the same location. - * This is more efficient than processing them one at a time, - * simplifies the code (see ConnectLeftDegenerate), and is also - * important for correct handling of certain degenerate cases. - * For example, suppose there are two identical edges A and B - * that belong to different contours (so without this code they would - * be processed by separate sweep events). Suppose another edge C - * crosses A and B from above. When A is processed, we split it - * at its intersection point with C. However this also splits C, - * so when we insert B we may compute a slightly different - * intersection point. This might leave two edges with a small - * gap between them. This kind of error is especially obvious - * when using boundary extraction (GLU_TESS_BOUNDARY_ONLY). - */ - vNext = (GLUvertex) tess.pq.pqExtractMin(); /* __gl_pqSortExtractMin*/ - SpliceMergeVertices(tess, v.anEdge, vNext.anEdge); - } - SweepEvent(tess, v); - } - - /* Set tess.event for debugging purposes */ - /* __GL_DICTLISTKEY */ /* __GL_DICTLISTMIN */ - tess.event = ((ActiveRegion) Dict.dictKey(Dict.dictMin(tess.dict))).eUp.Org; - DebugEvent(tess); - DoneEdgeDict(tess); - DonePriorityQ(tess); - - if (!RemoveDegenerateFaces(tess.mesh)) return false; - Mesh.__gl_meshCheckMesh(tess.mesh); - - return true; - } -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/TessMono.java b/src/classes/com/sun/opengl/impl/tessellator/TessMono.java deleted file mode 100644 index 62c653bfe..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/TessMono.java +++ /dev/null @@ -1,209 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class TessMono { -/* __gl_meshTessellateMonoRegion( face ) tessellates a monotone region - * (what else would it do??) The region must consist of a single - * loop of half-edges (see mesh.h) oriented CCW. "Monotone" in this - * case means that any vertical line intersects the interior of the - * region in a single interval. - * - * Tessellation consists of adding interior edges (actually pairs of - * half-edges), to split the region into non-overlapping triangles. - * - * The basic idea is explained in Preparata and Shamos (which I don''t - * have handy right now), although their implementation is more - * complicated than this one. The are two edge chains, an upper chain - * and a lower chain. We process all vertices from both chains in order, - * from right to left. - * - * The algorithm ensures that the following invariant holds after each - * vertex is processed: the untessellated region consists of two - * chains, where one chain (say the upper) is a single edge, and - * the other chain is concave. The left vertex of the single edge - * is always to the left of all vertices in the concave chain. - * - * Each step consists of adding the rightmost unprocessed vertex to one - * of the two chains, and forming a fan of triangles from the rightmost - * of two chain endpoints. Determining whether we can add each triangle - * to the fan is a simple orientation test. By making the fan as large - * as possible, we restore the invariant (check it yourself). - */ - static boolean __gl_meshTessellateMonoRegion(GLUface face) { - GLUhalfEdge up, lo; - - /* All edges are oriented CCW around the boundary of the region. - * First, find the half-edge whose origin vertex is rightmost. - * Since the sweep goes from left to right, face->anEdge should - * be close to the edge we want. - */ - up = face.anEdge; - assert (up.Lnext != up && up.Lnext.Lnext != up); - - for (; Geom.VertLeq(up.Sym.Org, up.Org); up = up.Onext.Sym) - ; - for (; Geom.VertLeq(up.Org, up.Sym.Org); up = up.Lnext) - ; - lo = up.Onext.Sym; - - while (up.Lnext != lo) { - if (Geom.VertLeq(up.Sym.Org, lo.Org)) { - /* up.Sym.Org is on the left. It is safe to form triangles from lo.Org. - * The EdgeGoesLeft test guarantees progress even when some triangles - * are CW, given that the upper and lower chains are truly monotone. - */ - while (lo.Lnext != up && (Geom.EdgeGoesLeft(lo.Lnext) - || Geom.EdgeSign(lo.Org, lo.Sym.Org, lo.Lnext.Sym.Org) <= 0)) { - GLUhalfEdge tempHalfEdge = Mesh.__gl_meshConnect(lo.Lnext, lo); - if (tempHalfEdge == null) return false; - lo = tempHalfEdge.Sym; - } - lo = lo.Onext.Sym; - } else { - /* lo.Org is on the left. We can make CCW triangles from up.Sym.Org. */ - while (lo.Lnext != up && (Geom.EdgeGoesRight(up.Onext.Sym) - || Geom.EdgeSign(up.Sym.Org, up.Org, up.Onext.Sym.Org) >= 0)) { - GLUhalfEdge tempHalfEdge = Mesh.__gl_meshConnect(up, up.Onext.Sym); - if (tempHalfEdge == null) return false; - up = tempHalfEdge.Sym; - } - up = up.Lnext; - } - } - - /* Now lo.Org == up.Sym.Org == the leftmost vertex. The remaining region - * can be tessellated in a fan from this leftmost vertex. - */ - assert (lo.Lnext != up); - while (lo.Lnext.Lnext != up) { - GLUhalfEdge tempHalfEdge = Mesh.__gl_meshConnect(lo.Lnext, lo); - if (tempHalfEdge == null) return false; - lo = tempHalfEdge.Sym; - } - - return true; - } - - -/* __gl_meshTessellateInterior( mesh ) tessellates each region of - * the mesh which is marked "inside" the polygon. Each such region - * must be monotone. - */ - public static boolean __gl_meshTessellateInterior(GLUmesh mesh) { - GLUface f, next; - - /*LINTED*/ - for (f = mesh.fHead.next; f != mesh.fHead; f = next) { - /* Make sure we don''t try to tessellate the new triangles. */ - next = f.next; - if (f.inside) { - if (!__gl_meshTessellateMonoRegion(f)) return false; - } - } - - return true; - } - - -/* __gl_meshDiscardExterior( mesh ) zaps (ie. sets to NULL) all faces - * which are not marked "inside" the polygon. Since further mesh operations - * on NULL faces are not allowed, the main purpose is to clean up the - * mesh so that exterior loops are not represented in the data structure. - */ - public static void __gl_meshDiscardExterior(GLUmesh mesh) { - GLUface f, next; - - /*LINTED*/ - for (f = mesh.fHead.next; f != mesh.fHead; f = next) { - /* Since f will be destroyed, save its next pointer. */ - next = f.next; - if (!f.inside) { - Mesh.__gl_meshZapFace(f); - } - } - } - - private static final int MARKED_FOR_DELETION = 0x7fffffff; - -/* __gl_meshSetWindingNumber( mesh, value, keepOnlyBoundary ) resets the - * winding numbers on all edges so that regions marked "inside" the - * polygon have a winding number of "value", and regions outside - * have a winding number of 0. - * - * If keepOnlyBoundary is TRUE, it also deletes all edges which do not - * separate an interior region from an exterior one. - */ - public static boolean __gl_meshSetWindingNumber(GLUmesh mesh, int value, boolean keepOnlyBoundary) { - GLUhalfEdge e, eNext; - - for (e = mesh.eHead.next; e != mesh.eHead; e = eNext) { - eNext = e.next; - if (e.Sym.Lface.inside != e.Lface.inside) { - - /* This is a boundary edge (one side is interior, one is exterior). */ - e.winding = (e.Lface.inside) ? value : -value; - } else { - - /* Both regions are interior, or both are exterior. */ - if (!keepOnlyBoundary) { - e.winding = 0; - } else { - if (!Mesh.__gl_meshDelete(e)) return false; - } - } - } - return true; - } - -} diff --git a/src/classes/com/sun/opengl/impl/tessellator/TessState.java b/src/classes/com/sun/opengl/impl/tessellator/TessState.java deleted file mode 100644 index 9cf192529..000000000 --- a/src/classes/com/sun/opengl/impl/tessellator/TessState.java +++ /dev/null @@ -1,59 +0,0 @@ -/* -* Portions Copyright (C) 2003-2006 Sun Microsystems, Inc. -* All rights reserved. -*/ - -/* -** License Applicability. Except to the extent portions of this file are -** made subject to an alternative license as permitted in the SGI Free -** Software License B, Version 1.1 (the "License"), the contents of this -** file are subject only to the provisions of the License. You may not use -** this file except in compliance with the License. You may obtain a copy -** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 -** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: -** -** http://oss.sgi.com/projects/FreeB -** -** Note that, as provided in the License, the Software is distributed on an -** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS -** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND -** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A -** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. -** -** NOTE: The Original Code (as defined below) has been licensed to Sun -** Microsystems, Inc. ("Sun") under the SGI Free Software License B -** (Version 1.1), shown above ("SGI License"). Pursuant to Section -** 3.2(3) of the SGI License, Sun is distributing the Covered Code to -** you under an alternative license ("Alternative License"). This -** Alternative License includes all of the provisions of the SGI License -** except that Section 2.2 and 11 are omitted. Any differences between -** the Alternative License and the SGI License are offered solely by Sun -** and not by SGI. -** -** Original Code. The Original Code is: OpenGL Sample Implementation, -** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, -** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. -** Copyright in any portions created by third parties is as indicated -** elsewhere herein. All Rights Reserved. -** -** Additional Notice Provisions: The application programming interfaces -** established by SGI in conjunction with the Original Code are The -** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released -** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version -** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X -** Window System(R) (Version 1.3), released October 19, 1998. This software -** was created using the OpenGL(R) version 1.2.1 Sample Implementation -** published by SGI, but has not been independently verified as being -** compliant with the OpenGL(R) version 1.2.1 Specification. -** -** Author: Eric Veach, July 1994 -** Java Port: Pepijn Van Eeckhoudt, July 2003 -** Java Port: Nathan Parker Burg, August 2003 -*/ -package com.sun.opengl.impl.glu.tessellator; - -class TessState { - public static final int T_DORMANT = 0; - public static final int T_IN_POLYGON = 1; - public static final int T_IN_CONTOUR = 2; -} diff --git a/src/classes/com/sun/opengl/impl/windows/awt/WindowsJAWTWindow.java b/src/classes/com/sun/opengl/impl/windows/awt/WindowsJAWTWindow.java deleted file mode 100644 index bebd1e4dc..000000000 --- a/src/classes/com/sun/opengl/impl/windows/awt/WindowsJAWTWindow.java +++ /dev/null @@ -1,162 +0,0 @@ -/* - * Copyright (c) 2003 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.windows.awt; - -import com.sun.opengl.impl.windows.*; -import com.sun.opengl.impl.awt.*; - -import javax.media.opengl.*; -import com.sun.opengl.impl.*; - -public class WindowsJAWTWindow extends JAWTWindow { - - public static final boolean PROFILING = false; // FIXME - public static final int PROFILING_TICKS = 600; // FIXME - - public WindowsJAWTWindow(Object comp) { - super(comp); - } - - protected void initNative() throws NativeWindowException { - } - - public int lockSurface() throws NativeWindowException { - int ret = super.lockSurface(); - if(LOCK_SUCCESS != ret) { - return ret; - } - - long startTime; - if (PROFILING) { - startTime = System.currentTimeMillis(); - } - ds = JAWT.getJAWT().GetDrawingSurface(component); - if (ds == null) { - // Widget not yet realized - return LOCK_SURFACE_NOT_READY; - } - int res = ds.Lock(); - if ((res & JAWTFactory.JAWT_LOCK_ERROR) != 0) { - throw new GLException("Unable to lock surface"); - } - // See whether the surface changed and if so destroy the old - // OpenGL context so it will be recreated (NOTE: removeNotify - // should handle this case, but it may be possible that race - // conditions can cause this code to be triggered -- should test - // more) - if ((res & JAWTFactory.JAWT_LOCK_SURFACE_CHANGED) != 0) { - ret = LOCK_SURFACE_CHANGED; - } - dsi = ds.GetDrawingSurfaceInfo(); - if (dsi == null) { - // Widget not yet realized - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - return LOCK_SURFACE_NOT_READY; - } - win32dsi = (JAWT_Win32DrawingSurfaceInfo) dsi.platformInfo(); - drawable = win32dsi.hdc(); - // FIXME: Are the followup abstractions available ? would it be usefull ? - display = 0; - visualID = 0; - screen= 0; - screenIndex = 0; - - if (drawable == 0) { - // Widget not yet realized - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - win32dsi = null; - return LOCK_SURFACE_NOT_READY; - } - if (PROFILING) { - long endTime = System.currentTimeMillis(); - profilingLockSurfaceTime += (endTime - startTime); - if (++profilingLockSurfaceTicks == PROFILING_TICKS) { - System.err.println("LockSurface calls: " + profilingLockSurfaceTime + " ms / " + PROFILING_TICKS + " calls (" + - ((float) profilingLockSurfaceTime / (float) PROFILING_TICKS) + " ms/call)"); - profilingLockSurfaceTime = 0; - profilingLockSurfaceTicks = 0; - } - } - return ret; - } - - public void unlockSurface() { - if(!isSurfaceLocked()) return; - long startTime = 0; - if (PROFILING) { - startTime = System.currentTimeMillis(); - } - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - win32dsi = null; - drawable = 0; - super.unlockSurface(); - if (PROFILING) { - long endTime = System.currentTimeMillis(); - profilingUnlockSurfaceTime += (endTime - startTime); - if (++profilingUnlockSurfaceTicks == PROFILING_TICKS) { - System.err.println("UnlockSurface calls: " + profilingUnlockSurfaceTime + " ms / " + PROFILING_TICKS + " calls (" + - ((float) profilingUnlockSurfaceTime / (float) PROFILING_TICKS) + " ms/call)"); - profilingUnlockSurfaceTime = 0; - profilingUnlockSurfaceTicks = 0; - } - } - } - - // Variables for lockSurface/unlockSurface - private JAWT_DrawingSurface ds; - private JAWT_DrawingSurfaceInfo dsi; - private JAWT_Win32DrawingSurfaceInfo win32dsi; - private long profilingLockSurfaceTime = 0; - private int profilingLockSurfaceTicks = 0; - private long profilingUnlockSurfaceTime = 0; - private int profilingUnlockSurfaceTicks = 0; - -} - diff --git a/src/classes/com/sun/opengl/impl/x11/awt/X11JAWTWindow.java b/src/classes/com/sun/opengl/impl/x11/awt/X11JAWTWindow.java deleted file mode 100644 index 4c166e68d..000000000 --- a/src/classes/com/sun/opengl/impl/x11/awt/X11JAWTWindow.java +++ /dev/null @@ -1,132 +0,0 @@ -/* - * Copyright (c) 2003 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - */ - -package com.sun.opengl.impl.x11.awt; - -import com.sun.opengl.impl.x11.*; -import com.sun.opengl.impl.awt.*; -import com.sun.opengl.impl.*; - -import javax.media.opengl.*; - -import java.awt.GraphicsDevice; -import java.awt.GraphicsEnvironment; - -public class X11JAWTWindow extends JAWTWindow { - - public X11JAWTWindow(Object comp) { - super(comp); - } - - protected void initNative() throws NativeWindowException { - } - - public int lockSurface() throws NativeWindowException { - int ret = super.lockSurface(); - if(LOCK_SUCCESS != ret) { - return ret; - } - ds = JAWT.getJAWT().GetDrawingSurface(component); - if (ds == null) { - // Widget not yet realized - return LOCK_SURFACE_NOT_READY; - } - int res = ds.Lock(); - if ((res & JAWTFactory.JAWT_LOCK_ERROR) != 0) { - throw new NativeWindowException("Unable to lock surface"); - } - // See whether the surface changed and if so destroy the old - // OpenGL context so it will be recreated (NOTE: removeNotify - // should handle this case, but it may be possible that race - // conditions can cause this code to be triggered -- should test - // more) - if ((res & JAWTFactory.JAWT_LOCK_SURFACE_CHANGED) != 0) { - ret = LOCK_SURFACE_CHANGED; - } - dsi = ds.GetDrawingSurfaceInfo(); - if (dsi == null) { - // Widget not yet realized - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - return LOCK_SURFACE_NOT_READY; - } - x11dsi = (JAWT_X11DrawingSurfaceInfo) dsi.platformInfo(); - display = x11dsi.display(); - drawable = x11dsi.drawable(); - visualID = x11dsi.visualID(); - screen= 0; - if (X11Lib.XineramaEnabled(display)) { - screenIndex = 0; - } else { - GraphicsDevice device = GraphicsEnvironment.getLocalGraphicsEnvironment().getDefaultScreenDevice(); - screenIndex = X11SunJDKReflection.graphicsDeviceGetScreen(device); - } - if (display == 0 || drawable == 0) { - // Widget not yet realized - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - x11dsi = null; - display = 0; - drawable = 0; - visualID = 0; - screen= 0; - screenIndex = -1; - return LOCK_SURFACE_NOT_READY; - } - return ret; - } - - public void unlockSurface() { - if(!isSurfaceLocked()) return; - ds.FreeDrawingSurfaceInfo(dsi); - ds.Unlock(); - JAWT.getJAWT().FreeDrawingSurface(ds); - ds = null; - dsi = null; - x11dsi = null; - super.unlockSurface(); - } - - // Variables for lockSurface/unlockSurface - private JAWT_DrawingSurface ds; - private JAWT_DrawingSurfaceInfo dsi; - private JAWT_X11DrawingSurfaceInfo x11dsi; - -} diff --git a/src/classes/com/sun/opengl/impl/x11/awt/X11SunJDKReflection.java b/src/classes/com/sun/opengl/impl/x11/awt/X11SunJDKReflection.java deleted file mode 100644 index 5e19bfbb5..000000000 --- a/src/classes/com/sun/opengl/impl/x11/awt/X11SunJDKReflection.java +++ /dev/null @@ -1,103 +0,0 @@ -/* - * Copyright (c) 2003 Sun Microsystems, Inc. All Rights Reserved. - * - * Redistribution and use in source and binary forms, with or without - * modification, are permitted provided that the following conditions are - * met: - * - * - Redistribution of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * - Redistribution 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. - * - * Neither the name of Sun Microsystems, Inc. or the names of - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * This software is provided "AS IS," without a warranty of any kind. ALL - * EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, - * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A - * PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN - * MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL NOT BE LIABLE FOR - * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR - * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES. IN NO EVENT WILL SUN OR - * ITS LICENSORS BE LIABLE FOR ANY LOST REVENUE, PROFIT OR DATA, OR FOR - * DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL, INCIDENTAL OR PUNITIVE - * DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY OF LIABILITY, - * ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE, EVEN IF - * SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - * - * You acknowledge that this software is not designed or intended for use - * in the design, construction, operation or maintenance of any nuclear - * facility. - * - * Sun gratefully acknowledges that this software was originally authored - * and developed by Kenneth Bradley Russell and Christopher John Kline. - */ - -package com.sun.opengl.impl.x11.awt; - -import com.sun.opengl.impl.x11.*; - -import java.awt.GraphicsConfiguration; -import java.awt.GraphicsDevice; -import java.lang.reflect.*; -import java.security.*; - -/** This class encapsulates the reflection routines necessary to peek - inside a few data structures in the AWT implementation on X11 for - the purposes of correctly enumerating the available visuals. */ - -public class X11SunJDKReflection { - private static Class x11GraphicsDeviceClass; - private static Method x11GraphicsDeviceGetScreenMethod; - private static Class x11GraphicsConfigClass; - private static Method x11GraphicsConfigGetVisualMethod; - private static boolean initted; - - static { - AccessController.doPrivileged(new PrivilegedAction() { - public Object run() { - try { - x11GraphicsDeviceClass = Class.forName("sun.awt.X11GraphicsDevice"); - x11GraphicsDeviceGetScreenMethod = x11GraphicsDeviceClass.getDeclaredMethod("getScreen", new Class[] {}); - x11GraphicsDeviceGetScreenMethod.setAccessible(true); - - x11GraphicsConfigClass = Class.forName("sun.awt.X11GraphicsConfig"); - x11GraphicsConfigGetVisualMethod = x11GraphicsConfigClass.getDeclaredMethod("getVisual", new Class[] {}); - x11GraphicsConfigGetVisualMethod.setAccessible(true); - initted = true; - } catch (Exception e) { - // Either not a Sun JDK or the interfaces have changed since 1.4.2 / 1.5 - } - return null; - } - }); - } - - public static int graphicsDeviceGetScreen(GraphicsDevice device) { - if (!initted) { - return 0; - } - - try { - return ((Integer) x11GraphicsDeviceGetScreenMethod.invoke(device, new Object[] {})).intValue(); - } catch (Exception e) { - return 0; - } - } - - public static int graphicsConfigurationGetVisualID(GraphicsConfiguration config) { - if (!initted) { - return 0; - } - - try { - return ((Integer) x11GraphicsConfigGetVisualMethod.invoke(config, new Object[] {})).intValue(); - } catch (Exception e) { - return 0; - } - } -} |