| Gaurav Shah | bf6c4a7 | 2010-03-05 10:58:48 -0800 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 1989, 1993 |
| 3 | * The Regents of the University of California. All rights reserved. |
| 4 | * |
| 5 | * This code is derived from software contributed to Berkeley by |
| 6 | * Paul Vixie. |
| 7 | * |
| 8 | * Redistribution and use in source and binary forms, with or without |
| 9 | * modification, are permitted provided that the following conditions |
| 10 | * are met: |
| 11 | * 1. Redistributions of source code must retain the above copyright |
| 12 | * notice, this list of conditions and the following disclaimer. |
| 13 | * 2. Redistributions in binary form must reproduce the above copyright |
| 14 | * notice, this list of conditions and the following disclaimer in the |
| 15 | * documentation and/or other materials provided with the distribution. |
| 16 | * 3. All advertising materials mentioning features or use of this software |
| 17 | * must display the following acknowledgement: |
| 18 | * This product includes software developed by the University of |
| 19 | * California, Berkeley and its contributors. |
| 20 | * 4. Neither the name of the University nor the names of its contributors |
| 21 | * may be used to endorse or promote products derived from this software |
| 22 | * without specific prior written permission. |
| 23 | * |
| 24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 34 | * SUCH DAMAGE. |
| 35 | * |
| 36 | * @(#)bitstring.h 8.1 (Berkeley) 7/19/93 |
| 37 | */ |
| 38 | |
| 39 | /* |
| 40 | * Adapted from BSD bitstring.h |
| 41 | */ |
| 42 | |
| 43 | #ifndef _TPM_KEYCHAIN_BITSTRING_H_ |
| 44 | #define _TPM_KEYCHAIN_BITSTRING_H_ |
| 45 | |
| 46 | typedef unsigned char bitstr_t; |
| 47 | |
| 48 | #define _bit_byte(bit) ((bit) >> 3) |
| 49 | #define _bit_mask(bit) (1 << ((bit) & 0x7)) |
| 50 | #define _bitstr_size(nbits) ((((nbits) - 1) >> 3) + 1) |
| 51 | |
| 52 | #define bit_decl(name, nbits) (name)[_bitstr_size(nbits)] |
| 53 | #define bit_test(name, bit) ((name)[_bit_byte(bit)] & _bit_mask(bit)) |
| 54 | #define bit_set(name, bit) (name)[_bit_byte(bit)] |= _bit_mask(bit) |
| 55 | #define bit_clear(name, bit) (name)[_bit_byte(bit)] &= ~_bit_mask(bit) |
| 56 | #define bit_nclear(name, start, stop) { \ |
| 57 | register bitstr_t *_name = name; \ |
| 58 | register int _start = start, _stop = stop; \ |
| 59 | register int _startbyte = _bit_byte(_start); \ |
| 60 | register int _stopbyte = _bit_byte(_stop); \ |
| 61 | if (_startbyte == _stopbyte) { \ |
| 62 | _name[_startbyte] &= ((0xff >> (8 - (_start&0x7))) | \ |
| 63 | (0xff << ((_stop&0x7) + 1))); \ |
| 64 | } else { \ |
| 65 | _name[_startbyte] &= 0xff >> (8 - (_start&0x7)); \ |
| 66 | while (++_startbyte < _stopbyte) \ |
| 67 | _name[_startbyte] = 0; \ |
| 68 | _name[_stopbyte] &= 0xff << ((_stop&0x7) + 1); \ |
| 69 | } \ |
| 70 | } |
| 71 | |
| 72 | #endif // _TPM_KEYCHAIN_BITSTRING_H_ |