jeff@smiley.Ingres.COM (Jeff Anton) (01/03/91)
The poll system call is documented to have an error return of EAGAIN if an internal data structure allocation fails. EAGAIN traditionally is returned on fork(2) failing for a 'temporary' condition such as too many processes. What resource does poll need and can you increase this resource on typical binary configurable kernels? I've seen programs enter what seems to be infinite loops calling poll which always returns EAGAIN. It would be nice to have some ideas to clear up this problem. Jeff Anton