This file is indexed.

/usr/include/isc/bitstring.h is in libbind-dev 1:9.9.5.dfsg-9+deb8u15.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
/*
 * Copyright (C) 2004-2007  Internet Systems Consortium, Inc. ("ISC")
 * Copyright (C) 1999-2001  Internet Software Consortium.
 *
 * Permission to use, copy, modify, and/or distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
 * AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
 * PERFORMANCE OF THIS SOFTWARE.
 */

/* $Id: bitstring.h,v 1.14 2007/06/19 23:47:18 tbox Exp $ */

#ifndef ISC_BITSTRING_H
#define ISC_BITSTRING_H 1

/*****
 ***** Module Info
 *****/

/*! \file isc/bitstring.h
 *
 * \brief Bitstring manipulation functions.
 *
 * A bitstring is a packed array of bits, stored in a contiguous
 * sequence of octets.  The "most significant bit" (msb) of a bitstring
 * is the high bit of the first octet.  The "least significant bit" of a
 * bitstring is the low bit of the last octet.
 *
 * Two bit numbering schemes are supported, "msb0" and "lsb0".
 *
 * In the "msb0" scheme, bit number 0 designates the most significant bit,
 * and any padding bits required to make the bitstring a multiple of 8 bits
 * long are added to the least significant end of the last octet.
 *
 * In the "lsb0" scheme, bit number 0 designates the least significant bit,
 * and any padding bits required to make the bitstring a multiple of 8 bits
 * long are added to the most significant end of the first octet.
 *
 * E.g., consider the bitstring "11010001111".  This bitstring is 11 bits
 * long and will take two octets.  Let "p" denote a pad bit.  In the msb0
 * encoding, it would be
 *
 * \verbatim
 *             Octet 0           Octet 1
 *                         |
 *         1 1 0 1 0 0 0 1 | 1 1 1 p p p p p
 *         ^               |               ^
 *         |                               |
 *         bit 0                           bit 15
 * \endverbatim
 *
 * In the lsb0 encoding, it would be
 *
 * \verbatim
 *             Octet 0           Octet 1
 *                         |
 *         p p p p p 1 1 0 | 1 0 0 0 1 1 1 1 
 *         ^               |               ^
 *         |                               |
 *         bit 15                          bit 0
 * \endverbatim
 */

/***
 *** Imports
 ***/

#include <isc/lang.h>
#include <isc/types.h>

ISC_LANG_BEGINDECLS

/***
 *** Types
 ***/

struct isc_bitstring {
	unsigned int		magic;
	unsigned char *		data;
	unsigned int		length;
	unsigned int		size;
	isc_boolean_t		lsb0;
};

/***
 *** Functions
 ***/

void
isc_bitstring_init(isc_bitstring_t *bitstring, unsigned char *data,
		   unsigned int length, unsigned int size, isc_boolean_t lsb0);
/*!<
 * \brief Make 'bitstring' refer to the bitstring of 'size' bits starting
 * at 'data'.  'length' bits of the bitstring are valid.  If 'lsb0'
 * is set then, bit 0 refers to the least significant bit of the
 * bitstring.  Otherwise bit 0 is the most significant bit.
 *
 * Requires:
 *
 *\li	'bitstring' points to a isc_bitstring_t.
 *
 *\li	'data' points to an array of unsigned char large enough to hold
 *	'size' bits.
 *
 *\li	'length' <= 'size'.
 *
 * Ensures:
 *
 *\li	'bitstring' is a valid bitstring.
 */

void
isc_bitstring_invalidate(isc_bitstring_t *bitstring);
/*!<
 * \brief Invalidate 'bitstring'.
 *
 * Requires:
 *
 *\li	'bitstring' is a valid bitstring.
 *
 * Ensures:
 *
 *\li	'bitstring' is not a valid bitstring.
 */

void
isc_bitstring_copy(isc_bitstring_t *source, unsigned int sbitpos,
		   isc_bitstring_t *target, unsigned int tbitpos,
		   unsigned int n);
/*!<
 * \brief Starting at bit 'sbitpos', copy 'n' bits from 'source' to
 * the 'n' bits of 'target' starting at 'tbitpos'.
 *
 * Requires:
 *
 *\li	'source' and target are valid bitstrings with the same lsb0 setting.
 *
 *\li	'sbitpos' + 'n' is less than or equal to the length of 'source'.
 *
 *\li	'tbitpos' + 'n' is less than or equal to the size of 'target'.
 *
 * Ensures:
 *
 *\li	The specified bits have been copied, and the length of 'target'
 *	adjusted (if required).
 */

ISC_LANG_ENDDECLS

#endif /* ISC_BITSTRING_H */