Lines Matching refs:data

70   struct Curl_easy *data = easy;
75 if(!name || !hout || !data ||
79 if(!Curl_llist_count(&data->state.httphdrs))
81 if(request > data->state.requests)
84 request = data->state.requests;
87 for(e = data->state.httphdrs.head; e; e = e->next) {
106 for(e = data->state.httphdrs.head; e; e = e->next) {
121 &data->state.headerout[0]);
122 *hout = &data->state.headerout[0];
132 struct Curl_easy *data = easy;
139 if(request > data->state.requests)
142 request = data->state.requests;
152 pick = data->state.httphdrs.head;
172 for(e = data->state.httphdrs.head; e; e = e->next) {
183 &data->state.headerout[1]);
184 return &data->state.headerout[1];
222 static CURLcode unfold_value(struct Curl_easy *data, const char *value,
230 DEBUGASSERT(data->state.prevhead);
231 hs = data->state.prevhead;
249 Curl_llist_remove(&data->state.httphdrs, &hs->node, NULL);
261 /* put the data at the end of the previous data, not the newline */
266 Curl_llist_insert_next(&data->state.httphdrs, data->state.httphdrs.tail,
268 data->state.prevhead = newhs;
277 CURLcode Curl_headers_push(struct Curl_easy *data, const char *header,
301 if(data->state.prevhead)
303 return unfold_value(data, header, hlen);
327 hs->request = data->state.requests;
330 Curl_llist_insert_next(&data->state.httphdrs, data->state.httphdrs.tail,
332 data->state.prevhead = hs;
342 static void headers_init(struct Curl_easy *data)
344 Curl_llist_init(&data->state.httphdrs, NULL);
345 data->state.prevhead = NULL;
351 CURLcode Curl_headers_cleanup(struct Curl_easy *data)
356 for(e = data->state.httphdrs.head; e; e = n) {
361 headers_init(data);