Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include <api/fd/array.h>
3#include <poll.h>
4#include "util/debug.h"
5#include "tests/tests.h"
6
7static void fdarray__init_revents(struct fdarray *fda, short revents)
8{
9 int fd;
10
11 fda->nr = fda->nr_alloc;
12
13 for (fd = 0; fd < fda->nr; ++fd) {
14 fda->entries[fd].fd = fda->nr - fd;
15 fda->entries[fd].revents = revents;
16 }
17}
18
19static int fdarray__fprintf_prefix(struct fdarray *fda, const char *prefix, FILE *fp)
20{
21 int printed = 0;
22
23 if (verbose <= 0)
24 return 0;
25
26 printed += fprintf(fp, "\n%s: ", prefix);
27 return printed + fdarray__fprintf(fda, fp);
28}
29
30int test__fdarray__filter(struct test *test __maybe_unused, int subtest __maybe_unused)
31{
32 int nr_fds, expected_fd[2], fd, err = TEST_FAIL;
33 struct fdarray *fda = fdarray__new(5, 5);
34
35 if (fda == NULL) {
36 pr_debug("\nfdarray__new() failed!");
37 goto out;
38 }
39
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);
45 goto out_delete;
46 }
47
48 fdarray__init_revents(fda, POLLHUP);
49 nr_fds = fdarray__filter(fda, POLLHUP, NULL, NULL);
50 if (nr_fds != 0) {
51 pr_debug("\nfdarray__filter()=%d != %d, should have filtered all fds",
52 nr_fds, fda->nr_alloc);
53 goto out_delete;
54 }
55
56 fdarray__init_revents(fda, POLLHUP);
57 fda->entries[2].revents = POLLIN;
58 expected_fd[0] = fda->entries[2].fd;
59
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);
64 if (nr_fds != 1) {
65 pr_debug("\nfdarray__filter()=%d != 1, should have left just one event", nr_fds);
66 goto out_delete;
67 }
68
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]);
72 goto out_delete;
73 }
74
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;
80
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);
85 if (nr_fds != 2) {
86 pr_debug("\nfdarray__filter()=%d != 2, should have left just two events",
87 nr_fds);
88 goto out_delete;
89 }
90
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]);
95 goto out_delete;
96 }
97 }
98
99 pr_debug("\n");
100
101 err = 0;
102out_delete:
103 fdarray__delete(fda);
104out:
105 return err;
106}
107
108int test__fdarray__add(struct test *test __maybe_unused, int subtest __maybe_unused)
109{
110 int err = TEST_FAIL;
111 struct fdarray *fda = fdarray__new(2, 2);
112
113 if (fda == NULL) {
114 pr_debug("\nfdarray__new() failed!");
115 goto out;
116 }
117
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); \
122 goto out_delete; \
123 } \
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); \
127 goto out_delete; \
128 }
129
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); \
134 goto out_delete; \
135 } \
136 if (fda->nr != _nr) { \
137 pr_debug("\n%d: fdarray__add(fda, %d, %d)=%d != %d", \
138 __LINE__,_fd, _revents, fda->nr, _nr); \
139 goto out_delete; \
140 } \
141 FDA_CHECK(_idx, _fd, _revents)
142
143 FDA_ADD(0, 1, POLLIN, 1);
144 FDA_ADD(1, 2, POLLERR, 2);
145
146 fdarray__fprintf_prefix(fda, "before growing array", stderr);
147
148 FDA_ADD(2, 35, POLLHUP, 3);
149
150 if (fda->entries == NULL) {
151 pr_debug("\nfdarray__add(fda, 35, POLLHUP) should have allocated fda->pollfd!");
152 goto out_delete;
153 }
154
155 fdarray__fprintf_prefix(fda, "after 3rd add", stderr);
156
157 FDA_ADD(3, 88, POLLIN | POLLOUT, 4);
158
159 fdarray__fprintf_prefix(fda, "after 4th add", stderr);
160
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);
165
166#undef FDA_ADD
167#undef FDA_CHECK
168
169 pr_debug("\n");
170
171 err = 0;
172out_delete:
173 fdarray__delete(fda);
174out:
175 return err;
176}
1#include <api/fd/array.h>
2#include <poll.h>
3#include "util/debug.h"
4#include "tests/tests.h"
5
6static void fdarray__init_revents(struct fdarray *fda, short revents)
7{
8 int fd;
9
10 fda->nr = fda->nr_alloc;
11
12 for (fd = 0; fd < fda->nr; ++fd) {
13 fda->entries[fd].fd = fda->nr - fd;
14 fda->entries[fd].revents = revents;
15 }
16}
17
18static int fdarray__fprintf_prefix(struct fdarray *fda, const char *prefix, FILE *fp)
19{
20 int printed = 0;
21
22 if (!verbose)
23 return 0;
24
25 printed += fprintf(fp, "\n%s: ", prefix);
26 return printed + fdarray__fprintf(fda, fp);
27}
28
29int test__fdarray__filter(int subtest __maybe_unused)
30{
31 int nr_fds, expected_fd[2], fd, err = TEST_FAIL;
32 struct fdarray *fda = fdarray__new(5, 5);
33
34 if (fda == NULL) {
35 pr_debug("\nfdarray__new() failed!");
36 goto out;
37 }
38
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);
44 goto out_delete;
45 }
46
47 fdarray__init_revents(fda, POLLHUP);
48 nr_fds = fdarray__filter(fda, POLLHUP, NULL, NULL);
49 if (nr_fds != 0) {
50 pr_debug("\nfdarray__filter()=%d != %d, should have filtered all fds",
51 nr_fds, fda->nr_alloc);
52 goto out_delete;
53 }
54
55 fdarray__init_revents(fda, POLLHUP);
56 fda->entries[2].revents = POLLIN;
57 expected_fd[0] = fda->entries[2].fd;
58
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);
63 if (nr_fds != 1) {
64 pr_debug("\nfdarray__filter()=%d != 1, should have left just one event", nr_fds);
65 goto out_delete;
66 }
67
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]);
71 goto out_delete;
72 }
73
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;
79
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);
84 if (nr_fds != 2) {
85 pr_debug("\nfdarray__filter()=%d != 2, should have left just two events",
86 nr_fds);
87 goto out_delete;
88 }
89
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]);
94 goto out_delete;
95 }
96 }
97
98 pr_debug("\n");
99
100 err = 0;
101out_delete:
102 fdarray__delete(fda);
103out:
104 return err;
105}
106
107int test__fdarray__add(int subtest __maybe_unused)
108{
109 int err = TEST_FAIL;
110 struct fdarray *fda = fdarray__new(2, 2);
111
112 if (fda == NULL) {
113 pr_debug("\nfdarray__new() failed!");
114 goto out;
115 }
116
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); \
121 goto out_delete; \
122 } \
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); \
126 goto out_delete; \
127 }
128
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); \
133 goto out_delete; \
134 } \
135 if (fda->nr != _nr) { \
136 pr_debug("\n%d: fdarray__add(fda, %d, %d)=%d != %d", \
137 __LINE__,_fd, _revents, fda->nr, _nr); \
138 goto out_delete; \
139 } \
140 FDA_CHECK(_idx, _fd, _revents)
141
142 FDA_ADD(0, 1, POLLIN, 1);
143 FDA_ADD(1, 2, POLLERR, 2);
144
145 fdarray__fprintf_prefix(fda, "before growing array", stderr);
146
147 FDA_ADD(2, 35, POLLHUP, 3);
148
149 if (fda->entries == NULL) {
150 pr_debug("\nfdarray__add(fda, 35, POLLHUP) should have allocated fda->pollfd!");
151 goto out_delete;
152 }
153
154 fdarray__fprintf_prefix(fda, "after 3rd add", stderr);
155
156 FDA_ADD(3, 88, POLLIN | POLLOUT, 4);
157
158 fdarray__fprintf_prefix(fda, "after 4th add", stderr);
159
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);
164
165#undef FDA_ADD
166#undef FDA_CHECK
167
168 pr_debug("\n");
169
170 err = 0;
171out_delete:
172 fdarray__delete(fda);
173out:
174 return err;
175}