Lines Matching refs:kCapCount

36   const int kCapCount = 64;  variable
37   int cap_fd[kCapCount];
40   for (int ii = 0; ii < kCapCount; ii++) {
59   int maxfd = InitFDSet(&rset, cap_fd, kCapCount);
61   InitFDSet(&wset, cap_fd, kCapCount);
67   InitFDSet(&rset, cap_fd, kCapCount);
70   InitFDSet(&wset, cap_fd, kCapCount);
81   maxfd = InitFDSet(&rset, cap_fd, kCapCount);
83   InitFDSet(&wset, cap_fd, kCapCount);
88   InitFDSet(&rset, cap_fd, kCapCount);
91   InitFDSet(&wset, cap_fd, kCapCount);
105   const int kCapCount = 64;  variable
106   struct pollfd cap_fd[kCapCount + 2];
109   for (int ii = 0; ii < kCapCount; ii++) {
115   cap_fd[kCapCount].fd = fd;
116   cap_fd[kCapCount].events = POLLIN|POLLOUT;
122   cap_fd[kCapCount + 1].fd = cap_rw;
123   cap_fd[kCapCount + 1].events = POLLIN|POLLOUT;
127   EXPECT_OK(poll(cap_fd, kCapCount + 1, 10));
129   EXPECT_OK(poll(cap_fd, kCapCount + 2, 10));
130   EXPECT_NE(0, (cap_fd[kCapCount + 1].revents & POLLNVAL));
137   EXPECT_OK(ppoll(cap_fd, kCapCount + 1, &ts, NULL));
139   EXPECT_OK(ppoll(cap_fd, kCapCount + 2, &ts, NULL));
140   EXPECT_NE(0, (cap_fd[kCapCount + 1].revents & POLLNVAL));