98 lines
		
	
	
		
			2.8 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			98 lines
		
	
	
		
			2.8 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
///////////////////////////////////////////////////////////////////////////
 | 
						|
//
 | 
						|
// Copyright (c) 2002, Industrial Light & Magic, a division of Lucas
 | 
						|
// Digital Ltd. LLC
 | 
						|
//
 | 
						|
// All rights reserved.
 | 
						|
//
 | 
						|
// Redistribution and use in source and binary forms, with or without
 | 
						|
// modification, are permitted provided that the following conditions are
 | 
						|
// met:
 | 
						|
// *       Redistributions of source code must retain the above copyright
 | 
						|
// notice, this list of conditions and the following disclaimer.
 | 
						|
// *       Redistributions in binary form must reproduce the above
 | 
						|
// copyright notice, this list of conditions and the following disclaimer
 | 
						|
// in the documentation and/or other materials provided with the
 | 
						|
// distribution.
 | 
						|
// *       Neither the name of Industrial Light & Magic nor the names of
 | 
						|
// its contributors may be used to endorse or promote products derived
 | 
						|
// from this software without specific prior written permission.
 | 
						|
//
 | 
						|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 | 
						|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 | 
						|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 | 
						|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 | 
						|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 | 
						|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 | 
						|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 | 
						|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 | 
						|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 | 
						|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 | 
						|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 | 
						|
//
 | 
						|
///////////////////////////////////////////////////////////////////////////
 | 
						|
 | 
						|
 | 
						|
 | 
						|
#ifndef INCLUDED_IMF_AUTO_ARRAY_H
 | 
						|
#define INCLUDED_IMF_AUTO_ARRAY_H
 | 
						|
 | 
						|
//-----------------------------------------------------------------------------
 | 
						|
//
 | 
						|
//	class AutoArray -- a workaround for systems with
 | 
						|
//	insufficient stack space for large auto arrays.
 | 
						|
//
 | 
						|
//-----------------------------------------------------------------------------
 | 
						|
 | 
						|
#include "OpenEXRConfig.h"
 | 
						|
 | 
						|
#if !defined (HAVE_LARGE_STACK)
 | 
						|
#include <string.h>
 | 
						|
#endif
 | 
						|
 | 
						|
namespace Imf {
 | 
						|
 | 
						|
 | 
						|
#if !defined (HAVE_LARGE_STACK)
 | 
						|
 | 
						|
 | 
						|
    template <class T, int size>
 | 
						|
    class AutoArray
 | 
						|
    {
 | 
						|
      public:
 | 
						|
 | 
						|
     AutoArray (): _data (new T [size]) { memset(_data, 0, size*sizeof(T)); }
 | 
						|
    ~AutoArray () {delete [] _data;}
 | 
						|
 | 
						|
    operator T * ()			{return _data;}
 | 
						|
    operator const T * () const	{return _data;}
 | 
						|
 | 
						|
      private:
 | 
						|
 | 
						|
    T *_data;
 | 
						|
    };
 | 
						|
 | 
						|
 | 
						|
#else
 | 
						|
 | 
						|
 | 
						|
    template <class T, int size>
 | 
						|
    class AutoArray
 | 
						|
    {
 | 
						|
      public:
 | 
						|
 | 
						|
    operator T * ()			{return _data;}
 | 
						|
    operator const T * () const	{return _data;}
 | 
						|
 | 
						|
      private:
 | 
						|
 | 
						|
    T _data[size];
 | 
						|
    };
 | 
						|
 | 
						|
 | 
						|
#endif
 | 
						|
 | 
						|
} // namespace Imf
 | 
						|
 | 
						|
#endif
 |