1
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2
/* ***** BEGIN LICENSE BLOCK *****
3
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
5
* The contents of this file are subject to the Mozilla Public License Version
6
* 1.1 (the "License"); you may not use this file except in compliance with
7
* the License. You may obtain a copy of the License at
8
* http://www.mozilla.org/MPL/
10
* Software distributed under the License is distributed on an "AS IS" basis,
11
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12
* for the specific language governing rights and limitations under the
15
* The Original Code is the Netscape Portable Runtime (NSPR).
17
* The Initial Developer of the Original Code is
18
* Netscape Communications Corporation.
19
* Portions created by the Initial Developer are Copyright (C) 1998-2000
20
* the Initial Developer. All Rights Reserved.
24
* Alternatively, the contents of this file may be used under the terms of
25
* either the GNU General Public License Version 2 or later (the "GPL"), or
26
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
27
* in which case the provisions of the GPL or the LGPL are applicable instead
28
* of those above. If you wish to allow use of your version of this file only
29
* under the terms of either the GPL or the LGPL, and not to allow others to
30
* use your version of this file under the terms of the MPL, indicate your
31
* decision by deleting the provisions above and replace them with the notice
32
* and other provisions required by the GPL or the LGPL. If you do not delete
33
* the provisions above, a recipient may use your version of this file under
34
* the terms of any one of the MPL, the GPL or the LGPL.
36
* ***** END LICENSE BLOCK ***** */
45
** A prbitmap_t is a long integer that can be used for bitmaps
47
typedef unsigned long prbitmap_t;
49
#define PR_TEST_BIT(_map,_bit) \
50
((_map)[(_bit)>>PR_BITS_PER_LONG_LOG2] & (1L << ((_bit) & (PR_BITS_PER_LONG-1))))
51
#define PR_SET_BIT(_map,_bit) \
52
((_map)[(_bit)>>PR_BITS_PER_LONG_LOG2] |= (1L << ((_bit) & (PR_BITS_PER_LONG-1))))
53
#define PR_CLEAR_BIT(_map,_bit) \
54
((_map)[(_bit)>>PR_BITS_PER_LONG_LOG2] &= ~(1L << ((_bit) & (PR_BITS_PER_LONG-1))))
57
** Compute the log of the least power of 2 greater than or equal to n
59
NSPR_API(PRIntn) PR_CeilingLog2(PRUint32 i);
62
** Compute the log of the greatest power of 2 less than or equal to n
64
NSPR_API(PRIntn) PR_FloorLog2(PRUint32 i);
67
** Macro version of PR_CeilingLog2: Compute the log of the least power of
68
** 2 greater than or equal to _n. The result is returned in _log2.
70
#define PR_CEILING_LOG2(_log2,_n) \
72
PRUint32 j_ = (PRUint32)(_n); \
74
if ((j_) & ((j_)-1)) \
77
(_log2) += 16, (j_) >>= 16; \
79
(_log2) += 8, (j_) >>= 8; \
81
(_log2) += 4, (j_) >>= 4; \
83
(_log2) += 2, (j_) >>= 2; \
89
** Macro version of PR_FloorLog2: Compute the log of the greatest power of
90
** 2 less than or equal to _n. The result is returned in _log2.
92
** This is equivalent to finding the highest set bit in the word.
94
#define PR_FLOOR_LOG2(_log2,_n) \
96
PRUint32 j_ = (PRUint32)(_n); \
99
(_log2) += 16, (j_) >>= 16; \
101
(_log2) += 8, (j_) >>= 8; \
103
(_log2) += 4, (j_) >>= 4; \
105
(_log2) += 2, (j_) >>= 2; \
111
#endif /* prbit_h___ */