1 #include <api/fd/array.h>
3 #include "util/debug.h"
4 #include "tests/tests.h"
6 static void fdarray__init_revents(struct fdarray
*fda
, short revents
)
10 fda
->nr
= fda
->nr_alloc
;
12 for (fd
= 0; fd
< fda
->nr
; ++fd
) {
13 fda
->entries
[fd
].fd
= fda
->nr
- fd
;
14 fda
->entries
[fd
].revents
= revents
;
18 static int fdarray__fprintf_prefix(struct fdarray
*fda
, const char *prefix
, FILE *fp
)
25 printed
+= fprintf(fp
, "\n%s: ", prefix
);
26 return printed
+ fdarray__fprintf(fda
, fp
);
29 int test__fdarray__filter(int subtest __maybe_unused
)
31 int nr_fds
, expected_fd
[2], fd
, err
= TEST_FAIL
;
32 struct fdarray
*fda
= fdarray__new(5, 5);
35 pr_debug("\nfdarray__new() failed!");
39 fdarray__init_revents(fda
, POLLIN
);
40 nr_fds
= fdarray__filter(fda
, POLLHUP
, NULL
, NULL
);
41 if (nr_fds
!= fda
->nr_alloc
) {
42 pr_debug("\nfdarray__filter()=%d != %d shouldn't have filtered anything",
43 nr_fds
, fda
->nr_alloc
);
47 fdarray__init_revents(fda
, POLLHUP
);
48 nr_fds
= fdarray__filter(fda
, POLLHUP
, NULL
, NULL
);
50 pr_debug("\nfdarray__filter()=%d != %d, should have filtered all fds",
51 nr_fds
, fda
->nr_alloc
);
55 fdarray__init_revents(fda
, POLLHUP
);
56 fda
->entries
[2].revents
= POLLIN
;
57 expected_fd
[0] = fda
->entries
[2].fd
;
59 pr_debug("\nfiltering all but fda->entries[2]:");
60 fdarray__fprintf_prefix(fda
, "before", stderr
);
61 nr_fds
= fdarray__filter(fda
, POLLHUP
, NULL
, NULL
);
62 fdarray__fprintf_prefix(fda
, " after", stderr
);
64 pr_debug("\nfdarray__filter()=%d != 1, should have left just one event", nr_fds
);
68 if (fda
->entries
[0].fd
!= expected_fd
[0]) {
69 pr_debug("\nfda->entries[0].fd=%d != %d\n",
70 fda
->entries
[0].fd
, expected_fd
[0]);
74 fdarray__init_revents(fda
, POLLHUP
);
75 fda
->entries
[0].revents
= POLLIN
;
76 expected_fd
[0] = fda
->entries
[0].fd
;
77 fda
->entries
[3].revents
= POLLIN
;
78 expected_fd
[1] = fda
->entries
[3].fd
;
80 pr_debug("\nfiltering all but (fda->entries[0], fda->entries[3]):");
81 fdarray__fprintf_prefix(fda
, "before", stderr
);
82 nr_fds
= fdarray__filter(fda
, POLLHUP
, NULL
, NULL
);
83 fdarray__fprintf_prefix(fda
, " after", stderr
);
85 pr_debug("\nfdarray__filter()=%d != 2, should have left just two events",
90 for (fd
= 0; fd
< 2; ++fd
) {
91 if (fda
->entries
[fd
].fd
!= expected_fd
[fd
]) {
92 pr_debug("\nfda->entries[%d].fd=%d != %d\n", fd
,
93 fda
->entries
[fd
].fd
, expected_fd
[fd
]);
102 fdarray__delete(fda
);
107 int test__fdarray__add(int subtest __maybe_unused
)
110 struct fdarray
*fda
= fdarray__new(2, 2);
113 pr_debug("\nfdarray__new() failed!");
117 #define FDA_CHECK(_idx, _fd, _revents) \
118 if (fda->entries[_idx].fd != _fd) { \
119 pr_debug("\n%d: fda->entries[%d](%d) != %d!", \
120 __LINE__, _idx, fda->entries[1].fd, _fd); \
123 if (fda->entries[_idx].events != (_revents)) { \
124 pr_debug("\n%d: fda->entries[%d].revents(%d) != %d!", \
125 __LINE__, _idx, fda->entries[_idx].fd, _revents); \
129 #define FDA_ADD(_idx, _fd, _revents, _nr) \
130 if (fdarray__add(fda, _fd, _revents) < 0) { \
131 pr_debug("\n%d: fdarray__add(fda, %d, %d) failed!", \
132 __LINE__,_fd, _revents); \
135 if (fda->nr != _nr) { \
136 pr_debug("\n%d: fdarray__add(fda, %d, %d)=%d != %d", \
137 __LINE__,_fd, _revents, fda->nr, _nr); \
140 FDA_CHECK(_idx, _fd, _revents)
142 FDA_ADD(0, 1, POLLIN
, 1);
143 FDA_ADD(1, 2, POLLERR
, 2);
145 fdarray__fprintf_prefix(fda
, "before growing array", stderr
);
147 FDA_ADD(2, 35, POLLHUP
, 3);
149 if (fda
->entries
== NULL
) {
150 pr_debug("\nfdarray__add(fda, 35, POLLHUP) should have allocated fda->pollfd!");
154 fdarray__fprintf_prefix(fda
, "after 3rd add", stderr
);
156 FDA_ADD(3, 88, POLLIN
| POLLOUT
, 4);
158 fdarray__fprintf_prefix(fda
, "after 4th add", stderr
);
160 FDA_CHECK(0, 1, POLLIN
);
161 FDA_CHECK(1, 2, POLLERR
);
162 FDA_CHECK(2, 35, POLLHUP
);
163 FDA_CHECK(3, 88, POLLIN
| POLLOUT
);
172 fdarray__delete(fda
);