include/log2.h - third_party/imgtec-pvr-rgx-km - Git at Google

 /*************************************************************************/ /*!
 @Title          Integer log2 and related functions
 @Copyright      Copyright (c) Imagination Technologies Ltd. All Rights Reserved
 @License        MIT

 The contents of this file are subject to the MIT license as set out below.

 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
 in the Software without restriction, including without limitation the rights
 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 copies of the Software, and to permit persons to whom the Software is
 furnished to do so, subject to the following conditions:

 The above copyright notice and this permission notice shall be included in
 all copies or substantial portions of the Software.

 This License is also included in this distribution in the file called
 "MIT-COPYING".

 EXCEPT AS OTHERWISE STATED IN A NEGOTIATED AGREEMENT: (A) THE SOFTWARE IS
 PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
 BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
 PURPOSE AND NONINFRINGEMENT; AND (B) IN NO EVENT SHALL THE AUTHORS OR
 COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
 IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 */ /**************************************************************************/

 #ifndef LOG2_H
 #define LOG2_H

 #include "img_defs.h"

 /**************************************************************************/ /*!
 @Description    Determine if a number is a power of two.
 @Input          n
 @Return         True if n is a power of 2, false otherwise. True if n == 0.
 */ /***************************************************************************/
 static INLINE IMG_BOOL IsPower2(uint32_t n)
 {
 	/* C++ needs this cast. */
 	return (IMG_BOOL)((n & (n - 1)) == 0);
 }

 /**************************************************************************/ /*!
 @Description    Determine if a number is a power of two.
 @Input          n
 @Return         True if n is a power of 2, false otherwise. True if n == 0.
 */ /***************************************************************************/
 static INLINE IMG_BOOL IsPower2_64(uint64_t n)
 {
 	/* C++ needs this cast. */
 	return (IMG_BOOL)((n & (n - 1)) == 0);
 }

 /* Code using GNU GCC intrinsics */
 #if (defined(__GNUC__) || defined(__GNUG__)) && !(defined(__clang__) || defined(__INTEL_COMPILER))

 /* CHAR_BIT is typically found in <limits.h>. For all the platforms where
  * CHAR_BIT is not available, defined it here with the assumption that there
  * are 8 bits in a byte */
 #ifndef CHAR_BIT
 #define CHAR_BIT 8U
 #endif

 #ifndef unlikely
 #define unlikely(x) __builtin_expect(!!(x), 0)
 #endif

 /**************************************************************************/ /*!
 @Description    Compute floor(log2(n))
 @Input          n
 @Return         log2(n) rounded down to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t FloorLog2(uint32_t n)
 {
 	if(unlikely(n == 0))
 	{
 		return 0;
 	}
 	else
 	{
 		uint32_t uNumBits = CHAR_BIT * sizeof(n);
 		return uNumBits - (uint32_t)__builtin_clz(n) - 1U;
 	}
 }

 /**************************************************************************/ /*!
 @Description    Compute floor(log2(n))
 @Input          n
 @Return         log2(n) rounded down to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t FloorLog2_64(uint64_t n)
 {
 	if(unlikely(n == 0))
 	{
 		return 0;
 	}
 	else
 	{
 		uint32_t uNumBits = CHAR_BIT * sizeof(n);
 		return uNumBits - (uint32_t)__builtin_clzll(n) - 1U;
 	}
 }

 /**************************************************************************/ /*!
 @Description    Compute ceil(log2(n))
 @Input          n
 @Return         log2(n) rounded up to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t CeilLog2(uint32_t n)
 {
 	if(unlikely(n == 0 || n == 1))
 	{
 		return 0;
 	}
 	else
 	{
 		uint32_t uNumBits = CHAR_BIT * sizeof(n);

 		n--; /* Handle powers of 2 */
 		return uNumBits - (uint32_t)__builtin_clz(n);
 	}
 }

 /**************************************************************************/ /*!
 @Description    Compute ceil(log2(n))
 @Input          n
 @Return         log2(n) rounded up to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t CeilLog2_64(uint64_t n)
 {
 	if(unlikely(n == 0 || n == 1))
 	{
 		return 0;
 	}
 	else
 	{
 		uint32_t uNumBits = CHAR_BIT * sizeof(n);

 		n--; /* Handle powers of 2 */
 		return uNumBits - (uint32_t)__builtin_clzll(n);
 	}
 }

 /**************************************************************************/ /*!
 @Description    Compute log2(n) for exact powers of two only
 @Input          n                   Must be a power of two
 @Return         log2(n)
 */ /***************************************************************************/
 static INLINE uint32_t ExactLog2(uint32_t n)
 {
 	return (uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clz(n) - 1U;
 }

 /**************************************************************************/ /*!
 @Description    Compute log2(n) for exact powers of two only
 @Input          n                   Must be a power of two
 @Return         log2(n)
 */ /***************************************************************************/
 static INLINE uint32_t ExactLog2_64(uint64_t n)
 {
 	return (uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clzll(n) - 1U;
 }

 /**************************************************************************/ /*!
 @Description    Round a non-power-of-two number up to the next power of two.
 @Input          n
 @Return         n rounded up to the next power of two. If n is zero or
                 already a power of two, return n unmodified.
 */ /***************************************************************************/
 static INLINE uint32_t RoundUpToNextPowerOfTwo(uint32_t n)
 {
 	/* Cases with n greater than 2^31 needs separate handling
 	 * as result of (1<<32) is undefined. */
 	if( unlikely( n == 0 || n > (uint32_t)1 << (CHAR_BIT * sizeof(n) - 1) ))
 	{
 		return 0;
 	}

 	/* Return n if it is already a power of 2 */
 	if((IMG_BOOL)((n & (n - 1)) == 0))
 	{
 		return n;
 	}

 	return (uint32_t)1 << ((uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clz(n));
 }

 /**************************************************************************/ /*!
 @Description    Round a non-power-of-two number up to the next power of two.
 @Input          n
 @Return         n rounded up to the next power of two. If n is zero or
                 already a power of two, return n unmodified.
 */ /***************************************************************************/
 static INLINE uint64_t RoundUpToNextPowerOfTwo_64(uint64_t n)
 {
 	/* Cases with n greater than 2^63 needs separate handling
 	 * as result of (1<<64) is undefined. */
 	if( unlikely( n == 0 || n > (uint64_t)1 << (CHAR_BIT * sizeof(n) - 1) ))
 	{
 		return 0;
 	}

 	/* Return n if it is already a power of 2 */
 	if((IMG_BOOL)((n & (n - 1)) == 0))
 	{
 		return n;
 	}

 	return (uint64_t)1 << ((uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clzll(n));
 }

 #else /* #if (defined(__GNUC__) || defined(__GNUG__)) && !(defined(__clang__) || defined(__INTEL_COMPILER)) */

 /**************************************************************************/ /*!
 @Description    Round a non-power-of-two number up to the next power of two.
 @Input          n
 @Return         n rounded up to the next power of two. If n is zero or
                 already a power of two, return n unmodified.
 */ /***************************************************************************/
 static INLINE uint32_t RoundUpToNextPowerOfTwo(uint32_t n)
 {
 	n--;
 	n |= n >> 1;  /* handle  2 bit numbers */
 	n |= n >> 2;  /* handle  4 bit numbers */
 	n |= n >> 4;  /* handle  8 bit numbers */
 	n |= n >> 8;  /* handle 16 bit numbers */
 	n |= n >> 16; /* handle 32 bit numbers */
 	n++;

 	return n;
 }

 /**************************************************************************/ /*!
 @Description    Round a non-power-of-two number up to the next power of two.
 @Input          n
 @Return         n rounded up to the next power of two. If n is zero or
                 already a power of two, return n unmodified.
 */ /***************************************************************************/
 static INLINE uint64_t RoundUpToNextPowerOfTwo_64(uint64_t n)
 {
 	n--;
 	n |= n >> 1;  /* handle  2 bit numbers */
 	n |= n >> 2;  /* handle  4 bit numbers */
 	n |= n >> 4;  /* handle  8 bit numbers */
 	n |= n >> 8;  /* handle 16 bit numbers */
 	n |= n >> 16; /* handle 32 bit numbers */
 	n |= n >> 32; /* handle 64 bit numbers */
 	n++;

 	return n;
 }

 /**************************************************************************/ /*!
 @Description    Compute floor(log2(n))
 @Input          n
 @Return         log2(n) rounded down to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t FloorLog2(uint32_t n)
 {
 	uint32_t log2 = 0;

 	while (n >>= 1)
 		log2++;

 	return log2;
 }

 /**************************************************************************/ /*!
 @Description    Compute floor(log2(n))
 @Input          n
 @Return         log2(n) rounded down to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t FloorLog2_64(uint64_t n)
 {
 	uint32_t log2 = 0;

 	while (n >>= 1)
 		log2++;

 	return log2;
 }

 /**************************************************************************/ /*!
 @Description    Compute ceil(log2(n))
 @Input          n
 @Return         log2(n) rounded up to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t CeilLog2(uint32_t n)
 {
 	uint32_t log2 = 0;

 	if(n == 0)
 		return 0;

 	n--; /* Handle powers of 2 */

 	while(n)
 	{
 		log2++;
 		n >>= 1;
 	}

 	return log2;
 }

 /**************************************************************************/ /*!
 @Description    Compute ceil(log2(n))
 @Input          n
 @Return         log2(n) rounded up to the nearest integer. Returns 0 if n == 0
 */ /***************************************************************************/
 static INLINE uint32_t CeilLog2_64(uint64_t n)
 {
 	uint32_t log2 = 0;

 	if(n == 0)
 		return 0;

 	n--; /* Handle powers of 2 */

 	while(n)
 	{
 		log2++;
 		n >>= 1;
 	}

 	return log2;
 }

 /**************************************************************************/ /*!
 @Description    Compute log2(n) for exact powers of two only
 @Input          n                   Must be a power of two
 @Return         log2(n)
 */ /***************************************************************************/
 static INLINE uint32_t ExactLog2(uint32_t n)
 {
 	static const uint32_t b[] =
 		{ 0xAAAAAAAA, 0xCCCCCCCC, 0xF0F0F0F0, 0xFF00FF00, 0xFFFF0000};
 	uint32_t r = (n & b[0]) != 0;

 	r |= (uint32_t) ((n & b[4]) != 0) << 4;
 	r |= (uint32_t) ((n & b[3]) != 0) << 3;
 	r |= (uint32_t) ((n & b[2]) != 0) << 2;
 	r |= (uint32_t) ((n & b[1]) != 0) << 1;

 	return r;
 }

 /**************************************************************************/ /*!
 @Description    Compute log2(n) for exact powers of two only
 @Input          n                   Must be a power of two
 @Return         log2(n)
 */ /***************************************************************************/
 static INLINE uint32_t ExactLog2_64(uint64_t n)
 {
 	static const uint64_t b[] =
 		{ 0xAAAAAAAAAAAAAAAAULL, 0xCCCCCCCCCCCCCCCCULL,
 		  0xF0F0F0F0F0F0F0F0ULL, 0xFF00FF00FF00FF00ULL,
 		  0xFFFF0000FFFF0000ULL, 0xFFFFFFFF00000000ULL };
 	uint32_t r = (n & b[0]) != 0;

 	r |= (uint32_t) ((n & b[5]) != 0) << 5;
 	r |= (uint32_t) ((n & b[4]) != 0) << 4;
 	r |= (uint32_t) ((n & b[3]) != 0) << 3;
 	r |= (uint32_t) ((n & b[2]) != 0) << 2;
 	r |= (uint32_t) ((n & b[1]) != 0) << 1;

 	return r;
 }

 #endif /* #if (defined(__GNUC__) || defined(__GNUG__)) && !(defined(__clang__) || defined(__INTEL_COMPILER)) */

 /**************************************************************************/ /*!
 @Description    Compute floor(log2(size)) , where size is the max of 3 sizes
 				This is almost always the ONLY EVER valid use of FloorLog2.
 				Usually CeilLog2() should be used instead.
 				For a 5x5x1 texture, the 3 miplevels are:
 					0:  5x5x1
 					1:	2x2x1
 					2:	1x1x1

 				For an 8x8x1 texture, the 4 miplevels are:
 					0:  8x8x1
 					1:	4x4x1
 					2:  2x2x1
 					3:  1x1x1


 @Input          sizeX, sizeY, sizeZ
 @Return         Count of mipmap levels for given dimensions
 */ /***************************************************************************/
 static INLINE uint32_t NumMipLevels(uint32_t sizeX, uint32_t sizeY, uint32_t sizeZ)
 {

 	uint32_t maxSize = MAX(MAX(sizeX, sizeY), sizeZ);
 	return FloorLog2(maxSize) + 1;
 }


 #endif /* LOG2_H */
	/************************************************************************/ /!
	@Title Integer log2 and related functions
	@Copyright Copyright (c) Imagination Technologies Ltd. All Rights Reserved
	@License MIT

	The contents of this file are subject to the MIT license as set out below.

	Permission is hereby granted, free of charge, to any person obtaining a copy
	of this software and associated documentation files (the "Software"), to deal
	in the Software without restriction, including without limitation the rights
	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
	copies of the Software, and to permit persons to whom the Software is
	furnished to do so, subject to the following conditions:

	The above copyright notice and this permission notice shall be included in
	all copies or substantial portions of the Software.

	This License is also included in this distribution in the file called
	"MIT-COPYING".

	EXCEPT AS OTHERWISE STATED IN A NEGOTIATED AGREEMENT: (A) THE SOFTWARE IS
	PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
	BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
	PURPOSE AND NONINFRINGEMENT; AND (B) IN NO EVENT SHALL THE AUTHORS OR
	COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
	IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
	CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
	/ /*************************************************************************/

	#ifndef LOG2_H
	#define LOG2_H

	#include "img_defs.h"

	/*************************************************************************/ /!
	@Description Determine if a number is a power of two.
	@Input n
	@Return True if n is a power of 2, false otherwise. True if n == 0.
	/ /**************************************************************************/
	static INLINE IMG_BOOL IsPower2(uint32_t n)
	{
	/* C++ needs this cast. */
	return (IMG_BOOL)((n & (n - 1)) == 0);
	}

	/*************************************************************************/ /!
	@Description Determine if a number is a power of two.
	@Input n
	@Return True if n is a power of 2, false otherwise. True if n == 0.
	/ /**************************************************************************/
	static INLINE IMG_BOOL IsPower2_64(uint64_t n)
	{
	/* C++ needs this cast. */
	return (IMG_BOOL)((n & (n - 1)) == 0);
	}

	/* Code using GNU GCC intrinsics */
	#if (defined(__GNUC__) \|\| defined(__GNUG__)) && !(defined(__clang__) \|\| defined(__INTEL_COMPILER))

	/* CHAR_BIT is typically found in <limits.h>. For all the platforms where
	* CHAR_BIT is not available, defined it here with the assumption that there
	* are 8 bits in a byte */
	#ifndef CHAR_BIT
	#define CHAR_BIT 8U
	#endif

	#ifndef unlikely
	#define unlikely(x) __builtin_expect(!!(x), 0)
	#endif

	/*************************************************************************/ /!
	@Description Compute floor(log2(n))
	@Input n
	@Return log2(n) rounded down to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t FloorLog2(uint32_t n)
	{
	if(unlikely(n == 0))
	{
	return 0;
	}
	else
	{
	uint32_t uNumBits = CHAR_BIT * sizeof(n);
	return uNumBits - (uint32_t)__builtin_clz(n) - 1U;
	}
	}

	/*************************************************************************/ /!
	@Description Compute floor(log2(n))
	@Input n
	@Return log2(n) rounded down to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t FloorLog2_64(uint64_t n)
	{
	if(unlikely(n == 0))
	{
	return 0;
	}
	else
	{
	uint32_t uNumBits = CHAR_BIT * sizeof(n);
	return uNumBits - (uint32_t)__builtin_clzll(n) - 1U;
	}
	}

	/*************************************************************************/ /!
	@Description Compute ceil(log2(n))
	@Input n
	@Return log2(n) rounded up to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t CeilLog2(uint32_t n)
	{
	if(unlikely(n == 0 \|\| n == 1))
	{
	return 0;
	}
	else
	{
	uint32_t uNumBits = CHAR_BIT * sizeof(n);

	n--; /* Handle powers of 2 */
	return uNumBits - (uint32_t)__builtin_clz(n);
	}
	}

	/*************************************************************************/ /!
	@Description Compute ceil(log2(n))
	@Input n
	@Return log2(n) rounded up to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t CeilLog2_64(uint64_t n)
	{
	if(unlikely(n == 0 \|\| n == 1))
	{
	return 0;
	}
	else
	{
	uint32_t uNumBits = CHAR_BIT * sizeof(n);

	n--; /* Handle powers of 2 */
	return uNumBits - (uint32_t)__builtin_clzll(n);
	}
	}

	/*************************************************************************/ /!
	@Description Compute log2(n) for exact powers of two only
	@Input n Must be a power of two
	@Return log2(n)
	/ /**************************************************************************/
	static INLINE uint32_t ExactLog2(uint32_t n)
	{
	return (uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clz(n) - 1U;
	}

	/*************************************************************************/ /!
	@Description Compute log2(n) for exact powers of two only
	@Input n Must be a power of two
	@Return log2(n)
	/ /**************************************************************************/
	static INLINE uint32_t ExactLog2_64(uint64_t n)
	{
	return (uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clzll(n) - 1U;
	}

	/*************************************************************************/ /!
	@Description Round a non-power-of-two number up to the next power of two.
	@Input n
	@Return n rounded up to the next power of two. If n is zero or
	already a power of two, return n unmodified.
	/ /**************************************************************************/
	static INLINE uint32_t RoundUpToNextPowerOfTwo(uint32_t n)
	{
	/* Cases with n greater than 2^31 needs separate handling
	* as result of (1<<32) is undefined. */
	if( unlikely( n == 0 \|\| n > (uint32_t)1 << (CHAR_BIT * sizeof(n) - 1) ))
	{
	return 0;
	}

	/* Return n if it is already a power of 2 */
	if((IMG_BOOL)((n & (n - 1)) == 0))
	{
	return n;
	}

	return (uint32_t)1 << ((uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clz(n));
	}

	/*************************************************************************/ /!
	@Description Round a non-power-of-two number up to the next power of two.
	@Input n
	@Return n rounded up to the next power of two. If n is zero or
	already a power of two, return n unmodified.
	/ /**************************************************************************/
	static INLINE uint64_t RoundUpToNextPowerOfTwo_64(uint64_t n)
	{
	/* Cases with n greater than 2^63 needs separate handling
	* as result of (1<<64) is undefined. */
	if( unlikely( n == 0 \|\| n > (uint64_t)1 << (CHAR_BIT * sizeof(n) - 1) ))
	{
	return 0;
	}

	/* Return n if it is already a power of 2 */
	if((IMG_BOOL)((n & (n - 1)) == 0))
	{
	return n;
	}

	return (uint64_t)1 << ((uint32_t)(CHAR_BIT * sizeof(n)) - (uint32_t)__builtin_clzll(n));
	}

	#else /* #if (defined(__GNUC__) \|\| defined(__GNUG__)) && !(defined(__clang__) \|\| defined(__INTEL_COMPILER)) */

	/*************************************************************************/ /!
	@Description Round a non-power-of-two number up to the next power of two.
	@Input n
	@Return n rounded up to the next power of two. If n is zero or
	already a power of two, return n unmodified.
	/ /**************************************************************************/
	static INLINE uint32_t RoundUpToNextPowerOfTwo(uint32_t n)
	{
	n--;
	n \|= n >> 1; /* handle 2 bit numbers */
	n \|= n >> 2; /* handle 4 bit numbers */
	n \|= n >> 4; /* handle 8 bit numbers */
	n \|= n >> 8; /* handle 16 bit numbers */
	n \|= n >> 16; /* handle 32 bit numbers */
	n++;

	return n;
	}

	/*************************************************************************/ /!
	@Description Round a non-power-of-two number up to the next power of two.
	@Input n
	@Return n rounded up to the next power of two. If n is zero or
	already a power of two, return n unmodified.
	/ /**************************************************************************/
	static INLINE uint64_t RoundUpToNextPowerOfTwo_64(uint64_t n)
	{
	n--;
	n \|= n >> 1; /* handle 2 bit numbers */
	n \|= n >> 2; /* handle 4 bit numbers */
	n \|= n >> 4; /* handle 8 bit numbers */
	n \|= n >> 8; /* handle 16 bit numbers */
	n \|= n >> 16; /* handle 32 bit numbers */
	n \|= n >> 32; /* handle 64 bit numbers */
	n++;

	return n;
	}

	/*************************************************************************/ /!
	@Description Compute floor(log2(n))
	@Input n
	@Return log2(n) rounded down to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t FloorLog2(uint32_t n)
	{
	uint32_t log2 = 0;

	while (n >>= 1)
	log2++;

	return log2;
	}

	/*************************************************************************/ /!
	@Description Compute floor(log2(n))
	@Input n
	@Return log2(n) rounded down to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t FloorLog2_64(uint64_t n)
	{
	uint32_t log2 = 0;

	while (n >>= 1)
	log2++;

	return log2;
	}

	/*************************************************************************/ /!
	@Description Compute ceil(log2(n))
	@Input n
	@Return log2(n) rounded up to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t CeilLog2(uint32_t n)
	{
	uint32_t log2 = 0;

	if(n == 0)
	return 0;

	n--; /* Handle powers of 2 */

	while(n)
	{
	log2++;
	n >>= 1;
	}

	return log2;
	}

	/*************************************************************************/ /!
	@Description Compute ceil(log2(n))
	@Input n
	@Return log2(n) rounded up to the nearest integer. Returns 0 if n == 0
	/ /**************************************************************************/
	static INLINE uint32_t CeilLog2_64(uint64_t n)
	{
	uint32_t log2 = 0;

	if(n == 0)
	return 0;

	n--; /* Handle powers of 2 */

	while(n)
	{
	log2++;
	n >>= 1;
	}

	return log2;
	}

	/*************************************************************************/ /!
	@Description Compute log2(n) for exact powers of two only
	@Input n Must be a power of two
	@Return log2(n)
	/ /**************************************************************************/
	static INLINE uint32_t ExactLog2(uint32_t n)
	{
	static const uint32_t b[] =
	{ 0xAAAAAAAA, 0xCCCCCCCC, 0xF0F0F0F0, 0xFF00FF00, 0xFFFF0000};
	uint32_t r = (n & b[0]) != 0;

	r \|= (uint32_t) ((n & b[4]) != 0) << 4;
	r \|= (uint32_t) ((n & b[3]) != 0) << 3;
	r \|= (uint32_t) ((n & b[2]) != 0) << 2;
	r \|= (uint32_t) ((n & b[1]) != 0) << 1;

	return r;
	}

	/*************************************************************************/ /!
	@Description Compute log2(n) for exact powers of two only
	@Input n Must be a power of two
	@Return log2(n)
	/ /**************************************************************************/
	static INLINE uint32_t ExactLog2_64(uint64_t n)
	{
	static const uint64_t b[] =
	{ 0xAAAAAAAAAAAAAAAAULL, 0xCCCCCCCCCCCCCCCCULL,
	0xF0F0F0F0F0F0F0F0ULL, 0xFF00FF00FF00FF00ULL,
	0xFFFF0000FFFF0000ULL, 0xFFFFFFFF00000000ULL };
	uint32_t r = (n & b[0]) != 0;

	r \|= (uint32_t) ((n & b[5]) != 0) << 5;
	r \|= (uint32_t) ((n & b[4]) != 0) << 4;
	r \|= (uint32_t) ((n & b[3]) != 0) << 3;
	r \|= (uint32_t) ((n & b[2]) != 0) << 2;
	r \|= (uint32_t) ((n & b[1]) != 0) << 1;

	return r;
	}

	#endif /* #if (defined(__GNUC__) \|\| defined(__GNUG__)) && !(defined(__clang__) \|\| defined(__INTEL_COMPILER)) */

	/*************************************************************************/ /!
	@Description Compute floor(log2(size)) , where size is the max of 3 sizes
	This is almost always the ONLY EVER valid use of FloorLog2.
	Usually CeilLog2() should be used instead.
	For a 5x5x1 texture, the 3 miplevels are:
	0: 5x5x1
	1: 2x2x1
	2: 1x1x1

	For an 8x8x1 texture, the 4 miplevels are:
	0: 8x8x1
	1: 4x4x1
	2: 2x2x1
	3: 1x1x1


	@Input sizeX, sizeY, sizeZ
	@Return Count of mipmap levels for given dimensions
	/ /**************************************************************************/
	static INLINE uint32_t NumMipLevels(uint32_t sizeX, uint32_t sizeY, uint32_t sizeZ)
	{

	uint32_t maxSize = MAX(MAX(sizeX, sizeY), sizeZ);
	return FloorLog2(maxSize) + 1;
	}


	#endif /* LOG2_H */