Lines Matching defs:fds
205 struct pollfd *fds)
222 /* negative fds are never ready, which is the desired behavior */
223 fds[nfds].fd = fence->fd;
224 fds[nfds].events = POLLIN;
225 fds[nfds].revents = 0;
252 tu_fence_poll_fds(struct pollfd *fds, nfds_t nfds, uint64_t *timeout_ns)
257 int ret = poll(fds, nfds, tu_fence_get_poll_timeout(*timeout_ns));
285 struct pollfd *fds)
292 /* no signaled fence in fds */
296 /* fds[fds_idx] corresponds to fences[i] */
297 assert(fence->fd == fds[fds_idx].fd);
302 if (fds[fds_idx].revents) {
305 /* add to fds again for another poll */
306 fds[nfds].fd = fence->fd;
307 fds[nfds].events = POLLIN;
308 fds[nfds].revents = 0;
330 struct pollfd *fds = stack_fds;
332 fds = vk_alloc(&device->alloc, sizeof(*fds) * fenceCount, 8,
334 if (!fds)
339 nfds_t nfds = tu_fence_init_poll_fds(fenceCount, pFences, waitAll, fds);
342 result = tu_fence_poll_fds(fds, nfds, &timeout);
346 fds);
349 if (fds != stack_fds)
350 vk_free(&device->alloc, fds);