e655606d45
+ merging of js/src and js/ref + elimination of most dependencies on NSPR + JS1.4 feature additions and accumulated bug fixes More details are in last week's mozilla status report. git-svn-id: svn://10.0.0.236/trunk@12797 18797224-902f-48f8-a5cc-f745e15eee43
93 lines
3.0 KiB
C
93 lines
3.0 KiB
C
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/*
|
|
* The contents of this file are subject to the Netscape Public License
|
|
* Version 1.0 (the "NPL"); you may not use this file except in
|
|
* compliance with the NPL. You may obtain a copy of the NPL at
|
|
* http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the NPL is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
|
|
* for the specific language governing rights and limitations under the
|
|
* NPL.
|
|
*
|
|
* The Initial Developer of this code under the NPL is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All Rights
|
|
* Reserved.
|
|
*/
|
|
|
|
#ifndef jsbit_h___
|
|
#define jsbit_h___
|
|
|
|
#include "jstypes.h"
|
|
JS_BEGIN_EXTERN_C
|
|
|
|
/*
|
|
** A jsbitmap_t is a long integer that can be used for bitmaps
|
|
*/
|
|
typedef unsigned long jsbitmap_t;
|
|
|
|
#define JS_TEST_BIT(_map,_bit) \
|
|
((_map)[(_bit)>>JS_BITS_PER_LONG_LOG2] & (1L << ((_bit) & (JS_BITS_PER_LONG-1))))
|
|
#define JS_SET_BIT(_map,_bit) \
|
|
((_map)[(_bit)>>JS_BITS_PER_LONG_LOG2] |= (1L << ((_bit) & (JS_BITS_PER_LONG-1))))
|
|
#define JS_CLEAR_BIT(_map,_bit) \
|
|
((_map)[(_bit)>>JS_BITS_PER_LONG_LOG2] &= ~(1L << ((_bit) & (JS_BITS_PER_LONG-1))))
|
|
|
|
/*
|
|
** Compute the log of the least power of 2 greater than or equal to n
|
|
*/
|
|
JS_EXTERN_API(JSIntn) JS_CeilingLog2(JSUint32 i);
|
|
|
|
/*
|
|
** Compute the log of the greatest power of 2 less than or equal to n
|
|
*/
|
|
JS_EXTERN_API(JSIntn) JS_FloorLog2(JSUint32 i);
|
|
|
|
/*
|
|
** Macro version of JS_CeilingLog2: Compute the log of the least power of
|
|
** 2 greater than or equal to _n. The result is returned in _log2.
|
|
*/
|
|
#define JS_CEILING_LOG2(_log2,_n) \
|
|
JS_BEGIN_MACRO \
|
|
JSUint32 j_ = (JSUint32)(_n); \
|
|
(_log2) = 0; \
|
|
if ((j_) & ((j_)-1)) \
|
|
(_log2) += 1; \
|
|
if ((j_) >> 16) \
|
|
(_log2) += 16, (j_) >>= 16; \
|
|
if ((j_) >> 8) \
|
|
(_log2) += 8, (j_) >>= 8; \
|
|
if ((j_) >> 4) \
|
|
(_log2) += 4, (j_) >>= 4; \
|
|
if ((j_) >> 2) \
|
|
(_log2) += 2, (j_) >>= 2; \
|
|
if ((j_) >> 1) \
|
|
(_log2) += 1; \
|
|
JS_END_MACRO
|
|
|
|
/*
|
|
** Macro version of JS_FloorLog2: Compute the log of the greatest power of
|
|
** 2 less than or equal to _n. The result is returned in _log2.
|
|
**
|
|
** This is equivalent to finding the highest set bit in the word.
|
|
*/
|
|
#define JS_FLOOR_LOG2(_log2,_n) \
|
|
JS_BEGIN_MACRO \
|
|
JSUint32 j_ = (JSUint32)(_n); \
|
|
(_log2) = 0; \
|
|
if ((j_) >> 16) \
|
|
(_log2) += 16, (j_) >>= 16; \
|
|
if ((j_) >> 8) \
|
|
(_log2) += 8, (j_) >>= 8; \
|
|
if ((j_) >> 4) \
|
|
(_log2) += 4, (j_) >>= 4; \
|
|
if ((j_) >> 2) \
|
|
(_log2) += 2, (j_) >>= 2; \
|
|
if ((j_) >> 1) \
|
|
(_log2) += 1; \
|
|
JS_END_MACRO
|
|
|
|
JS_END_EXTERN_C
|
|
#endif /* jsbit_h___ */
|