Lines Matching defs:next
243 struct http_state *next;
357 hs->next = http_connections;
367 http_connections = hs->next;
370 for (last = http_connections; last->next != NULL; last = last->next) {
371 if (last->next == hs) {
372 last->next = hs->next;
385 while (hs && hs->next) {
388 if (hs->next->ssi != NULL) {
398 LWIP_ASSERT("broken list", hs != hs->next);
399 hs = hs->next;
402 LWIP_ASSERT("hs_free_next->next != NULL", hs_free_next->next != NULL);
403 LWIP_ASSERT("hs_free_next->next->pcb != NULL", hs_free_next->next->pcb != NULL);
405 http_close_or_abort_conn(hs_free_next->next->pcb, hs_free_next->next, 1); /* this also unlinks the http_state from the list */
580 when all data has been enqueued but the connection stays open for the next
714 /* Find the start of the next name=value pair and replace the delimiter
1045 /* Fix up the header position for the next time round. */
1051 /* Yes - move on to the next one */
1087 * either close the file or read the next block (if supported).
1279 /* Move on to the next character in the buffer */
1293 /* Have we found the next character we expect for the tag leadin? */
1295 /* Yes - move to the next one unless we have found the complete
1320 /* Move on to the next character in the buffer */
1335 /* Move on to the next character in the buffer */
1373 /* Move on to the next character in the buffer */
1386 /* Move on to the next character in the buffer */
1392 /* Have we found the next character we expect for the tag leadout? */
1394 /* Yes - move to the next one unless we have found the complete
1398 /* Move on to the next character in the buffer */
1613 /* Have we run out of file data to send? If so, we need to read the next
1850 q = q->next;
2010 if (hs->req->next != NULL) {
2102 /* restore header for next try */