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
|
/* Copyright (C) 2001-2023 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco,
CA 94129, USA, for further information.
*/
/* Interface to tables for bit operations */
#ifndef gsbittab_INCLUDED
# define gsbittab_INCLUDED
#include "gstypes.h"
/*
* Generate tables for transforming 2, 4, 6, or 8 bits.
*/
#define btab2_(v0,v2,v1)\
v0,v1+v0,v2+v0,v2+v1+v0
#define bit_table_2(v0,v2,v1) btab2_(v0,v2,v1)
#define btab4_(v0,v8,v4,v2,v1)\
btab2_(v0,v2,v1), btab2_(v4+v0,v2,v1),\
btab2_(v8+v0,v2,v1), btab2_(v8+v4+v0,v2,v1)
#define bit_table_4(v0,v8,v4,v2,v1) btab4_(v0,v8,v4,v2,v1)
#define btab6_(v0,v20,v10,v8,v4,v2,v1)\
btab4_(v0,v8,v4,v2,v1), btab4_(v10+v0,v8,v4,v2,v1),\
btab4_(v20+v0,v8,v4,v2,v1), btab4_(v20+v10+v0,v8,v4,v2,v1)
#define bit_table_6(v0,v20,v10,v8,v4,v2,v1) btab6_(v0,v20,v10,v8,v4,v2,v1)
#define bit_table_8(v0,v80,v40,v20,v10,v8,v4,v2,v1)\
btab6_(v0,v20,v10,v8,v4,v2,v1), btab6_(v40+v0,v20,v10,v8,v4,v2,v1),\
btab6_(v80+v0,v20,v10,v8,v4,v2,v1), btab6_(v80+v40+v0,v20,v10,v8,v4,v2,v1)
/*
* byte_reverse_bits[B] = the byte B with the order of bits reversed.
*/
extern const byte byte_reverse_bits[256];
/*
* byte_right_mask[N] = a byte with N trailing 1s, 0 <= N <= 8.
*/
extern const byte byte_right_mask[9];
/*
* byte_count_bits[B] = the number of 1-bits in a byte with value B.
*/
extern const byte byte_count_bits[256];
/*
* byte_bit_run_length_N[B], for 0 <= N <= 7, gives the length of the
* run of 1-bits starting at bit N in a byte with value B,
* numbering the bits in the byte as 01234567. If the run includes
* the low-order bit (i.e., might be continued into a following byte),
* the run length is increased by 8.
*/
extern const byte
byte_bit_run_length_0[256], byte_bit_run_length_1[256],
byte_bit_run_length_2[256], byte_bit_run_length_3[256],
byte_bit_run_length_4[256], byte_bit_run_length_5[256],
byte_bit_run_length_6[256], byte_bit_run_length_7[256];
/*
* byte_bit_run_length[N] points to byte_bit_run_length_N.
* byte_bit_run_length_neg[N] = byte_bit_run_length[-N & 7].
*/
extern const byte *const byte_bit_run_length[8];
extern const byte *const byte_bit_run_length_neg[8];
/*
* byte_acegbdfh_to_abcdefgh[acegbdfh] = abcdefgh, where the letters
* denote the individual bits of the byte.
*/
extern const byte byte_acegbdfh_to_abcdefgh[256];
#endif /* gsbittab_INCLUDED */
|
