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
|
/* $Id: set.h,v 1.3 2009-01-27 15:40:22 potyra Exp $
*
* Copyright (C) 2008-2009 FAUcc Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#define set_declare(name, count) \
typedef unsigned char name ## _set[(count + 7) / 8]; \
\
extern int \
name ## _set_is_element(unsigned char *set, unsigned int n); \
extern int \
name ## _set_find_forward(unsigned char *set); \
extern void \
name ## _set_add(unsigned char *set, unsigned int n); \
extern void \
name ## _set_remove(unsigned char *set, unsigned int n); \
extern void \
name ## _set_or(unsigned char *dst, unsigned char *src); \
extern void \
name ## _set_and(unsigned char *dst, unsigned char *src); \
extern void \
name ## _set_and_comp(unsigned char *dst, unsigned char *src); \
extern void \
name ## _set_cp(unsigned char *dst, unsigned char *src); \
extern void \
name ## _set_empty(unsigned char *set); \
extern void \
name ## _set_fill(unsigned char *set);
#define set_implement(name, count) \
int \
name ## _set_is_element(unsigned char *set, unsigned int n) \
{ \
return (set[n / 8] >> (n % 8)) & 1; \
} \
\
int \
name ## _set_find_forward(unsigned char *set) \
{ \
unsigned int n; \
unsigned int m; \
\
for (n = 0; ; n++) { \
if (n == (count + 7) / 8) { \
return -1; \
} \
if (set[n]) { \
for (m = 0; ; m++) { \
if (set[n] & (1 << m)) { \
return n * 8 + m; \
} \
} \
} \
} \
} \
\
void \
name ## _set_add(unsigned char *set, unsigned int n) \
{ \
set[n / 8] |= 1 << (n % 8); \
} \
\
void \
name ## _set_remove(unsigned char *set, unsigned int n) \
{ \
set[n / 8] &= ~(1 << (n % 8)); \
} \
\
void \
name ## _set_or(unsigned char *dst, unsigned char *src) \
{ \
unsigned int n; \
\
for (n = 0; n < (count + 7) / 8; n++) { \
dst[n] |= src[n]; \
} \
} \
\
void \
name ## _set_and(unsigned char *dst, unsigned char *src) \
{ \
unsigned int n; \
\
for (n = 0; n < (count + 7) / 8; n++) { \
dst[n] &= src[n]; \
} \
} \
\
void \
name ## _set_and_comp(unsigned char *dst, unsigned char *src) \
{ \
unsigned int n; \
\
for (n = 0; n < (count + 7) / 8; n++) { \
dst[n] &= ~src[n]; \
} \
} \
\
void \
name ## _set_cp(unsigned char *dst, unsigned char *src) \
{ \
unsigned int n; \
\
for (n = 0; n < (count + 7) / 8; n++) { \
dst[n] = src[n]; \
} \
} \
\
void \
name ## _set_empty(unsigned char *set) \
{ \
unsigned int i; \
\
for (i = 0; i < (count + 7) / 8; i++) { \
set[i] = 0; \
} \
} \
\
void \
name ## _set_fill(unsigned char *set) \
{ \
unsigned int i; \
\
for (i = 0; i < (count + 7) / 8; i++) { \
set[i] = -1; \
} \
}
|
