HomeSort by: relevance | last modified time | path
    Searched defs:nedges (Results 1 - 2 of 2) sorted by relevancy

  /src/sys/kern/
sys_epoll.c 557 epoll_recover_watch_tree(struct epoll_edge *edges, size_t nedges, size_t nfds) {
562 for (i = 0; i < nfds && (edges == NULL || nedges_so_far < nedges); i++)
600 epoll_dfs(struct epoll_edge *edges, size_t nedges, struct epoll_seen *seen,
608 KASSERT(nedges > 0);
621 for (i = 0; i < nedges; i++) {
625 error = epoll_dfs(edges, nedges, seen, nseen,
645 size_t nedges, nfds, seen_size; local in function:epoll_check_loop_and_depth
664 nedges = 1 + epoll_recover_watch_tree(NULL, 0, nfds);
666 edges = kmem_zalloc(nedges * sizeof(*edges), KM_SLEEP);
668 epoll_recover_watch_tree(edges + 1, nedges - 1, nfds)
    [all...]
sys_epoll.c 557 epoll_recover_watch_tree(struct epoll_edge *edges, size_t nedges, size_t nfds) {
562 for (i = 0; i < nfds && (edges == NULL || nedges_so_far < nedges); i++)
600 epoll_dfs(struct epoll_edge *edges, size_t nedges, struct epoll_seen *seen,
608 KASSERT(nedges > 0);
621 for (i = 0; i < nedges; i++) {
625 error = epoll_dfs(edges, nedges, seen, nseen,
645 size_t nedges, nfds, seen_size; local in function:epoll_check_loop_and_depth
664 nedges = 1 + epoll_recover_watch_tree(NULL, 0, nfds);
666 edges = kmem_zalloc(nedges * sizeof(*edges), KM_SLEEP);
668 epoll_recover_watch_tree(edges + 1, nedges - 1, nfds)
    [all...]

Completed in 51 milliseconds