1 // SPDX-License-Identifier: GPL-2.0
2 #include <api/fd/array.h>
4 #include "util/debug.h"
5 #include "tests/tests.h"
7 static void fdarray__init_revents(struct fdarray *fda, short revents)
11 fda->nr = fda->nr_alloc;
13 for (fd = 0; fd < fda->nr; ++fd) {
14 fda->entries[fd].fd = fda->nr - fd;
15 fda->entries[fd].revents = revents;
19 static int fdarray__fprintf_prefix(struct fdarray *fda, const char *prefix, FILE *fp)
26 printed += fprintf(fp, "\n%s: ", prefix);
27 return printed + fdarray__fprintf(fda, fp);
30 int test__fdarray__filter(struct test *test __maybe_unused, int subtest __maybe_unused)
32 int nr_fds, expected_fd[2], fd, err = TEST_FAIL;
33 struct fdarray *fda = fdarray__new(5, 5);
36 pr_debug("\nfdarray__new() failed!");
40 fdarray__init_revents(fda, POLLIN);
41 nr_fds = fdarray__filter(fda, POLLHUP, NULL, NULL);
42 if (nr_fds != fda->nr_alloc) {
43 pr_debug("\nfdarray__filter()=%d != %d shouldn't have filtered anything",
44 nr_fds, fda->nr_alloc);
48 fdarray__init_revents(fda, POLLHUP);
49 nr_fds = fdarray__filter(fda, POLLHUP, NULL, NULL);
51 pr_debug("\nfdarray__filter()=%d != %d, should have filtered all fds",
52 nr_fds, fda->nr_alloc);
56 fdarray__init_revents(fda, POLLHUP);
57 fda->entries[2].revents = POLLIN;
58 expected_fd[0] = fda->entries[2].fd;
60 pr_debug("\nfiltering all but fda->entries[2]:");
61 fdarray__fprintf_prefix(fda, "before", stderr);
62 nr_fds = fdarray__filter(fda, POLLHUP, NULL, NULL);
63 fdarray__fprintf_prefix(fda, " after", stderr);
65 pr_debug("\nfdarray__filter()=%d != 1, should have left just one event", nr_fds);
69 if (fda->entries[0].fd != expected_fd[0]) {
70 pr_debug("\nfda->entries[0].fd=%d != %d\n",
71 fda->entries[0].fd, expected_fd[0]);
75 fdarray__init_revents(fda, POLLHUP);
76 fda->entries[0].revents = POLLIN;
77 expected_fd[0] = fda->entries[0].fd;
78 fda->entries[3].revents = POLLIN;
79 expected_fd[1] = fda->entries[3].fd;
81 pr_debug("\nfiltering all but (fda->entries[0], fda->entries[3]):");
82 fdarray__fprintf_prefix(fda, "before", stderr);
83 nr_fds = fdarray__filter(fda, POLLHUP, NULL, NULL);
84 fdarray__fprintf_prefix(fda, " after", stderr);
86 pr_debug("\nfdarray__filter()=%d != 2, should have left just two events",
91 for (fd = 0; fd < 2; ++fd) {
92 if (fda->entries[fd].fd != expected_fd[fd]) {
93 pr_debug("\nfda->entries[%d].fd=%d != %d\n", fd,
94 fda->entries[fd].fd, expected_fd[fd]);
103 fdarray__delete(fda);
108 int test__fdarray__add(struct test *test __maybe_unused, int subtest __maybe_unused)
111 struct fdarray *fda = fdarray__new(2, 2);
114 pr_debug("\nfdarray__new() failed!");
118 #define FDA_CHECK(_idx, _fd, _revents) \
119 if (fda->entries[_idx].fd != _fd) { \
120 pr_debug("\n%d: fda->entries[%d](%d) != %d!", \
121 __LINE__, _idx, fda->entries[1].fd, _fd); \
124 if (fda->entries[_idx].events != (_revents)) { \
125 pr_debug("\n%d: fda->entries[%d].revents(%d) != %d!", \
126 __LINE__, _idx, fda->entries[_idx].fd, _revents); \
130 #define FDA_ADD(_idx, _fd, _revents, _nr) \
131 if (fdarray__add(fda, _fd, _revents) < 0) { \
132 pr_debug("\n%d: fdarray__add(fda, %d, %d) failed!", \
133 __LINE__,_fd, _revents); \
136 if (fda->nr != _nr) { \
137 pr_debug("\n%d: fdarray__add(fda, %d, %d)=%d != %d", \
138 __LINE__,_fd, _revents, fda->nr, _nr); \
141 FDA_CHECK(_idx, _fd, _revents)
143 FDA_ADD(0, 1, POLLIN, 1);
144 FDA_ADD(1, 2, POLLERR, 2);
146 fdarray__fprintf_prefix(fda, "before growing array", stderr);
148 FDA_ADD(2, 35, POLLHUP, 3);
150 if (fda->entries == NULL) {
151 pr_debug("\nfdarray__add(fda, 35, POLLHUP) should have allocated fda->pollfd!");
155 fdarray__fprintf_prefix(fda, "after 3rd add", stderr);
157 FDA_ADD(3, 88, POLLIN | POLLOUT, 4);
159 fdarray__fprintf_prefix(fda, "after 4th add", stderr);
161 FDA_CHECK(0, 1, POLLIN);
162 FDA_CHECK(1, 2, POLLERR);
163 FDA_CHECK(2, 35, POLLHUP);
164 FDA_CHECK(3, 88, POLLIN | POLLOUT);
173 fdarray__delete(fda);