Home
last modified time | relevance | path

Searched refs:ufds (Results 1 – 7 of 7) sorted by relevance

/curl/lib/
H A Dselect.c282 if(ufds) { in Curl_poll()
324 if(ufds[i].revents & POLLHUP) in Curl_poll()
325 ufds[i].revents |= POLLIN; in Curl_poll()
326 if(ufds[i].revents & POLLERR) in Curl_poll()
338 ufds[i].revents = 0; in Curl_poll()
341 VERIFY_SOCK(ufds[i].fd); in Curl_poll()
344 if(ufds[i].fd > maxfd) in Curl_poll()
345 maxfd = ufds[i].fd; in Curl_poll()
371 ufds[i].revents = 0; in Curl_poll()
377 if(ufds[i].events & POLLIN) in Curl_poll()
[all …]
H A Dselect.h84 int Curl_poll(struct pollfd ufds[], unsigned int nfds, timediff_t timeout_ms);
H A Dmulti.c1188 struct curl_waitfd *ufds, in curl_multi_waitfds() argument
1197 if(!ufds) in curl_multi_waitfds()
1206 Curl_waitfds_init(&cwfds, ufds, size); in curl_multi_waitfds()
/curl/docs/libcurl/
H A Dcurl_multi_waitfds.md28 struct curl_waitfd *ufds,
43 libcurl fills provided *ufds* array up to the *size*.
65 struct curl_waitfd *ufds;
89 ufds = (struct curl_waitfd*)malloc(fd_count * sizeof(struct curl_waitfd));
92 mc = curl_multi_waitfds(multi, ufds, fd_count, NULL);
96 free(ufds);
100 /* Do polling on descriptors in ufds */
102 free(ufds);
/curl/tests/libtest/
H A Dlib2405.c136 struct curl_waitfd ufds[10]; in test_run() local
166 mc = curl_multi_waitfds(multi, ufds, 10, &fd_count); in test_run()
191 mc = curl_multi_poll(multi1, ufds, fd_count, 500, &numfds); in test_run()
234 struct curl_waitfd ufds[10]; in empty_multi_test() local
242 mc = curl_multi_waitfds(multi, ufds, 10, &fd_count); in empty_multi_test()
264 mc = curl_multi_waitfds(multi, ufds, 10, &fd_count); in empty_multi_test()
/curl/include/curl/
H A Dmulti.h473 struct curl_waitfd *ufds,
/curl/packages/OS400/
H A Dcurl.inc.in3039 d ufds * value curl_waitfd *

Completed in 37 milliseconds