Cross Reference: /illumos-gate/usr/src/uts/common/syscall/poll.c

Lines Matching defs:entry
79 	kstat_named_t	pollcachemiss;	/* every list entry is dif from cache */
121  *	a (two-dimensional) hashed array of polldat_t structures - one entry
229  * (which hold poll locks on entry to xx_poll(), then acquire foo)
441 		 * poll cache list entry.  As such, we elect not to support
501 			 * Note that pcs_usradr field of an used entry won't be
509 				 * found an unused entry. Use it to cache
720 		 * entry. We hold the ps_lock when cleaning hash table.
922  * on entry.
936  * add a polldat entry to pollhead ph_list. The polldat struct is used
961  * Delete the polldat entry from ph_list.
993  * Zeroing out the revents field of each entry in current poll list is
1038  * This routine returns a pointer to a cached poll fd entry, or NULL if it
1301 	 * If this entry was used to cache a poll fd which was closed, and
1302 	 * this entry has not been cleaned, do it now.
1315 		 * the entry is never used or cleared by removing a cached
1323 	 * entry on uf_fpollinfo list.
1346 	 * a VOP_POLL is called on every pollfd entry; therefore each
1350 	 * entry.
1407  * The entry is not really deleted. The fields are cleared so that the
1408  * entry is no longer useful, but it will remain in the hash table for reuse
1455 		 * entire entry.
1689 					 * entry so that close() won't race
1696 						 * entry in cached poll list
1863  * is held upon entry.
1879 	int		entry;
1918 			entry = refp->xf_position;
1919 			ASSERT((entry >= 0) && (entry < nfds));
1920 			ASSERT(pollfdp[entry].fd == fd);
1931 				pollfdp[entry].revents = POLLNVAL;
1938 					for (i = entry + 1; i < nfds; i++) {
1955 				pollfdp[entry].revents = POLLNVAL;
1962 					for (i = entry + 1; i < nfds; i++) {
1995 			error = VOP_POLL(fp->f_vnode, pollfdp[entry].events, 0,
1996 			    &pollfdp[entry].revents, &php, NULL);
1999 			 * poll entry. To prevent close() coming in to clear
2000 			 * this entry.
2026 			if (pollfdp[entry].revents) {
2037 					    pollfdp, entry, &fdcnt);
2052 				 * entry is polling different events on this fd.
2058 				    (pollfdp[entry].events == pdp->pd_events) &&
2086 					    pollfdp, entry, &fdcnt);
2161 			 * invalidate this cache entry in the cached poll list
2216 	 * the cached poll fd entry in that poll list, which will force a
2217 	 * removal of this cached entry in next poll(). The cleanup is done
2236 				 * mark every matching entry in pcs_pollfd
2519  * this cache entry. We can't clean the polldat entry clean up here because
2521  * poll and let exiting lwp go. No lock is help upon entry. So it's OK for
2874 			int entry;
2881 			entry = refp->xf_position;
2882 			ASSERT(entry >= 0);
2883 			ASSERT(pollfdp[entry].revents == 0);
2887 				for (j = entry + 1; j < ps->ps_nfds; j++) {
3001     int entry, int *fdcntp)
3007 	fd = pollfdp[entry].fd;
3008 	for (i = entry + 1; i < nfds; i++) {
3010 			if (pollfdp[i].events == pollfdp[entry].events) {
3012 				    pollfdp[entry].revents) != 0) {