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
|
/* t40a.c
*
* Test FD_* macros
*
* Select works on regular files, (pseudo) terminal devices, streams-based
* files, FIFOs, pipes, and sockets. This test verifies the FD_* macros.
*
* This test is part of a bigger select test. It expects as argument which sub-
* test it is.
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/select.h>
#include <errno.h>
#include <limits.h>
#ifndef OPEN_MAX
# define OPEN_MAX 1024
#endif
#define MAX_ERROR 5
#include "common.h"
int main(int argc, char **argv) {
fd_set fds;
int i;
/* Get subtest number */
if(argc != 2) {
printf("Usage: %s subtest_no\n", argv[0]);
exit(-1);
} else if(sscanf(argv[1], "%d", &subtest) != 1) {
printf("Usage: %s subtest_no\n", argv[0]);
exit(-1);
}
/* FD_ZERO */
FD_ZERO(&fds);
for(i = 0; i < OPEN_MAX; i++) {
if(FD_ISSET(i, &fds)) {
em(1, "fd set should be completely empty");
break;
}
}
/* FD_SET */
for(i = 0; i < OPEN_MAX; i++) FD_SET(i, &fds);
for(i = 0; i < OPEN_MAX; i++) {
if(!FD_ISSET(i, &fds)) {
em(2, "fd set should be completely filled");
break;
}
}
/* Reset to empty set and verify it's really empty */
FD_ZERO(&fds);
for(i = 0; i < OPEN_MAX; i++) {
if(FD_ISSET(i, &fds)) {
em(3, "fd set should be completely empty");
break;
}
}
/* Let's try a variation on filling the set */
for(i = 0; i < OPEN_MAX; i += 2) FD_SET(i, &fds);
for(i = 0; i < OPEN_MAX - 1; i+= 2 ) {
if(!(FD_ISSET(i, &fds) && !FD_ISSET(i+1, &fds))) {
em(4, "bit pattern does not match");
break;
}
}
/* Reset to empty set and verify it's really empty */
FD_ZERO(&fds);
for(i = 0; i < OPEN_MAX; i++) {
if(FD_ISSET(i, &fds)) {
em(5,"fd set should be completely empty");
break;
}
}
/* Let's try another variation on filling the set */
for(i = 0; i < OPEN_MAX - 1; i += 2) FD_SET(i+1, &fds);
for(i = 0; i < OPEN_MAX - 1; i+= 2 ) {
if(!(FD_ISSET(i+1, &fds) && !FD_ISSET(i, &fds))) {
em(6, "bit pattern does not match");
break;
}
}
/* Reset to empty set and verify it's really empty */
FD_ZERO(&fds);
for(i = 0; i < OPEN_MAX; i++) {
if(FD_ISSET(i, &fds)) {
em(7, "fd set should be completely empty");
break;
}
}
/* FD_CLR */
for(i = 0; i < OPEN_MAX; i++) FD_SET(i, &fds); /* Set all bits */
for(i = 0; i < OPEN_MAX; i++) FD_CLR(i, &fds); /* Clear all bits */
for(i = 0; i < OPEN_MAX; i++) {
if(FD_ISSET(i, &fds)) {
em(8, "all bits in fd set should be cleared");
break;
}
}
/* Reset to empty set and verify it's really empty */
FD_ZERO(&fds);
for(i = 0; i < OPEN_MAX; i++) {
if(FD_ISSET(i, &fds)) {
em(9, "fd set should be completely empty");
break;
}
}
for(i = 0; i < OPEN_MAX; i++) FD_SET(i, &fds); /* Set all bits */
for(i = 0; i < OPEN_MAX; i += 2) FD_CLR(i, &fds); /* Clear all bits */
for(i = 0; i < OPEN_MAX; i += 2) {
if(FD_ISSET(i, &fds)) {
em(10, "all even bits in fd set should be cleared");
break;
}
}
exit(errct);
}
|
