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);
80   maxfd = InitFDSet(&rset, cap_fd, kCapCount);
82   InitFDSet(&wset, cap_fd, kCapCount);
87   InitFDSet(&rset, cap_fd, kCapCount);
90   InitFDSet(&wset, cap_fd, kCapCount);
103   const int kCapCount = 64;  variable
104   struct pollfd cap_fd[kCapCount + 2];
107   for (int ii = 0; ii < kCapCount; ii++) {
113   cap_fd[kCapCount].fd = fd;
114   cap_fd[kCapCount].events = POLLIN|POLLOUT;
120   cap_fd[kCapCount + 1].fd = cap_rw;
121   cap_fd[kCapCount + 1].events = POLLIN|POLLOUT;
125   EXPECT_OK(poll(cap_fd, kCapCount + 1, 10));
127   EXPECT_OK(poll(cap_fd, kCapCount + 2, 10));
128   EXPECT_NE(0, (cap_fd[kCapCount + 1].revents & POLLNVAL));
134   EXPECT_OK(ppoll(cap_fd, kCapCount + 1, &ts, NULL));
136   EXPECT_OK(ppoll(cap_fd, kCapCount + 2, &ts, NULL));
137   EXPECT_NE(0, (cap_fd[kCapCount + 1].revents & POLLNVAL));