Lines Matching refs:entry
253 * The sockhash has its own separate subhash in each entry that need to be
293 /* make/add new hash entry */
305 static void sh_delentry(struct Curl_sh_entry *entry,
308 Curl_hash_destroy(&entry->transfers);
310 /* We remove the hash entry. This will end up in a call to
316 * free a sockhash entry
347 * limiting. It simply has a fixed-size array, and on each entry in the array
464 /* We add the new easy entry last in the list. */
2793 * It is important that the 'now' value is set at the entry of this function
2920 /* remove the extracted entry */
2940 struct Curl_sh_entry *entry;
2961 entry = sh_getentry(&multi->sockhash, s);
2962 if(entry) {
2974 entry = sh_addentry(&multi->sockhash, s);
2975 if(!entry)
2982 entry->readers--;
2984 entry->writers--;
2986 entry->readers++;
2988 entry->writers++;
2992 entry->users++;
2994 entry->readers++;
2996 entry->writers++;
2999 if(!Curl_hash_add(&entry->transfers, (char *)&data, /* hash key */
3001 Curl_hash_destroy(&entry->transfers);
3006 comboaction = (entry->writers ? CURL_POLL_OUT : 0) |
3007 (entry->readers ? CURL_POLL_IN : 0);
3010 if(last_action && ((int)entry->action == comboaction))
3017 entry->socketp);
3026 entry->action = comboaction; /* store the current action state */
3031 * remove multi->sockhash entry when this was the last transfer */
3046 entry = sh_getentry(&multi->sockhash, s);
3049 if(entry) {
3052 entry->users--;
3054 entry->writers--;
3056 entry->readers--;
3057 if(!entry->users) {
3061 multi->socket_userp, entry->socketp);
3068 sh_delentry(entry, &multi->sockhash, s);
3072 if(Curl_hash_delete(&entry->transfers, (char *)&data,
3111 struct Curl_sh_entry *entry = sh_getentry(&multi->sockhash, s);
3113 if(entry) {
3118 multi->socket_userp, entry->socketp);
3123 sh_delentry(entry, &multi->sockhash, s);
3164 /* remove outdated entry */
3179 /* copy the first entry to 'tv' */
3222 struct Curl_sh_entry *entry = sh_getentry(&multi->sockhash, s);
3224 if(!entry)
3236 Curl_hash_start_iterate(&entry->transfers, &iter);
3638 /* The current splay tree entry is sooner than this new expiry time.
3639 We don't need to update our splay tree entry. */
3643 /* Since this is an updated time, we must remove the previous entry from
3687 /* Since this is an cleared time, we must remove the previous entry from
3818 a[i] = NULL; /* last entry is a NULL */