2005-02-20 14:27:00 +00:00
|
|
|
/**
|
|
|
|
* the network chunk-API
|
2006-10-04 13:26:23 +00:00
|
|
|
*
|
|
|
|
*
|
2005-02-20 14:27:00 +00:00
|
|
|
*/
|
|
|
|
|
2009-10-11 14:31:42 +00:00
|
|
|
#include "chunk.h"
|
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
2005-09-14 08:00:33 +00:00
|
|
|
#include <sys/mman.h>
|
2005-02-20 14:27:00 +00:00
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
chunkqueue *chunkqueue_init(void) {
|
|
|
|
chunkqueue *cq;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
cq = calloc(1, sizeof(*cq));
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
cq->first = NULL;
|
|
|
|
cq->last = NULL;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
cq->unused = NULL;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
return cq;
|
|
|
|
}
|
|
|
|
|
|
|
|
static chunk *chunk_init(void) {
|
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c = calloc(1, sizeof(*c));
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
c->type = MEM_CHUNK;
|
2005-09-14 08:00:33 +00:00
|
|
|
c->mem = buffer_init();
|
|
|
|
c->file.name = buffer_init();
|
2015-02-08 12:37:10 +00:00
|
|
|
c->file.start = c->file.length = c->file.mmap.offset = 0;
|
2005-09-14 08:00:33 +00:00
|
|
|
c->file.fd = -1;
|
|
|
|
c->file.mmap.start = MAP_FAILED;
|
2015-02-08 12:37:10 +00:00
|
|
|
c->file.mmap.length = 0;
|
|
|
|
c->file.is_temp = 0;
|
|
|
|
c->offset = 0;
|
2005-02-20 14:27:00 +00:00
|
|
|
c->next = NULL;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2005-09-08 10:00:32 +00:00
|
|
|
static void chunk_reset(chunk *c) {
|
2015-02-08 12:37:10 +00:00
|
|
|
if (NULL == c) return;
|
|
|
|
|
|
|
|
c->type = MEM_CHUNK;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-09-14 08:00:33 +00:00
|
|
|
buffer_reset(c->mem);
|
2005-09-26 08:53:58 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (c->file.is_temp && !buffer_string_is_empty(c->file.name)) {
|
2005-09-26 08:53:58 +00:00
|
|
|
unlink(c->file.name->ptr);
|
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-09-14 08:00:33 +00:00
|
|
|
buffer_reset(c->file.name);
|
|
|
|
|
|
|
|
if (c->file.fd != -1) {
|
|
|
|
close(c->file.fd);
|
|
|
|
c->file.fd = -1;
|
|
|
|
}
|
|
|
|
if (MAP_FAILED != c->file.mmap.start) {
|
|
|
|
munmap(c->file.mmap.start, c->file.mmap.length);
|
|
|
|
c->file.mmap.start = MAP_FAILED;
|
2005-09-08 10:00:32 +00:00
|
|
|
}
|
2015-02-08 12:37:10 +00:00
|
|
|
c->file.start = c->file.length = c->file.mmap.offset = 0;
|
|
|
|
c->file.mmap.length = 0;
|
|
|
|
c->file.is_temp = 0;
|
|
|
|
c->offset = 0;
|
|
|
|
c->next = NULL;
|
2005-09-08 10:00:32 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
static void chunk_free(chunk *c) {
|
|
|
|
if (NULL == c) return;
|
|
|
|
|
|
|
|
chunk_reset(c);
|
|
|
|
|
|
|
|
buffer_free(c->mem);
|
|
|
|
buffer_free(c->file.name);
|
|
|
|
|
|
|
|
free(c);
|
|
|
|
}
|
2005-09-08 10:00:32 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
void chunkqueue_free(chunkqueue *cq) {
|
|
|
|
chunk *c, *pc;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (NULL == cq) return;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
for (c = cq->first; c; ) {
|
|
|
|
pc = c;
|
|
|
|
c = c->next;
|
|
|
|
chunk_free(pc);
|
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
for (c = cq->unused; c; ) {
|
|
|
|
pc = c;
|
|
|
|
c = c->next;
|
|
|
|
chunk_free(pc);
|
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
free(cq);
|
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
static void chunkqueue_push_unused_chunk(chunkqueue *cq, chunk *c) {
|
|
|
|
force_assert(NULL != cq && NULL != c);
|
|
|
|
|
|
|
|
/* keep at max 4 chunks in the 'unused'-cache */
|
|
|
|
if (cq->unused_chunks > 4) {
|
|
|
|
chunk_free(c);
|
|
|
|
} else {
|
|
|
|
chunk_reset(c);
|
|
|
|
c->next = cq->unused;
|
|
|
|
cq->unused = c;
|
|
|
|
cq->unused_chunks++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
static chunk *chunkqueue_get_unused_chunk(chunkqueue *cq) {
|
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
force_assert(NULL != cq);
|
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
/* check if we have a unused chunk */
|
2015-02-08 12:37:10 +00:00
|
|
|
if (0 == cq->unused) {
|
2005-02-20 14:27:00 +00:00
|
|
|
c = chunk_init();
|
|
|
|
} else {
|
|
|
|
/* take the first element from the list (a stack) */
|
|
|
|
c = cq->unused;
|
|
|
|
cq->unused = c->next;
|
|
|
|
c->next = NULL;
|
2005-09-08 10:00:32 +00:00
|
|
|
cq->unused_chunks--;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
static void chunkqueue_prepend_chunk(chunkqueue *cq, chunk *c) {
|
2005-02-20 14:27:00 +00:00
|
|
|
c->next = cq->first;
|
|
|
|
cq->first = c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (NULL == cq->last) {
|
2005-02-20 14:27:00 +00:00
|
|
|
cq->last = c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
static void chunkqueue_append_chunk(chunkqueue *cq, chunk *c) {
|
2005-02-20 14:27:00 +00:00
|
|
|
if (cq->last) {
|
|
|
|
cq->last->next = c;
|
|
|
|
}
|
|
|
|
cq->last = c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (NULL == cq->first) {
|
2005-02-20 14:27:00 +00:00
|
|
|
cq->first = c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void chunkqueue_reset(chunkqueue *cq) {
|
2015-02-08 12:37:10 +00:00
|
|
|
chunk *cur = cq->first;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
cq->first = cq->last = NULL;
|
|
|
|
|
|
|
|
while (NULL != cur) {
|
|
|
|
chunk *next = cur->next;
|
|
|
|
chunkqueue_push_unused_chunk(cq, cur);
|
|
|
|
cur = next;
|
2005-09-08 10:00:32 +00:00
|
|
|
}
|
|
|
|
|
2005-09-14 08:00:33 +00:00
|
|
|
cq->bytes_in = 0;
|
|
|
|
cq->bytes_out = 0;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_append_file(chunkqueue *cq, buffer *fn, off_t offset, off_t len) {
|
2005-02-20 14:27:00 +00:00
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (0 == len) return;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c->type = FILE_CHUNK;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
buffer_copy_buffer(c->file.name, fn);
|
2005-10-24 11:36:22 +00:00
|
|
|
c->file.start = offset;
|
2005-09-14 08:00:33 +00:00
|
|
|
c->file.length = len;
|
2005-02-20 14:27:00 +00:00
|
|
|
c->offset = 0;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
chunkqueue_append_chunk(cq, c);
|
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_append_buffer(chunkqueue *cq, buffer *mem) {
|
2005-02-20 14:27:00 +00:00
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (buffer_string_is_empty(mem)) return;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2006-09-21 08:03:40 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
|
|
|
c->type = MEM_CHUNK;
|
2015-02-08 12:37:10 +00:00
|
|
|
force_assert(NULL != c->mem);
|
|
|
|
buffer_move(c->mem, mem);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2006-09-21 08:03:40 +00:00
|
|
|
chunkqueue_append_chunk(cq, c);
|
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_prepend_buffer(chunkqueue *cq, buffer *mem) {
|
2005-02-20 14:27:00 +00:00
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (buffer_string_is_empty(mem)) return;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
|
|
|
c->type = MEM_CHUNK;
|
2015-02-08 12:37:10 +00:00
|
|
|
force_assert(NULL != c->mem);
|
|
|
|
buffer_move(c->mem, mem);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
chunkqueue_prepend_chunk(cq, c);
|
|
|
|
}
|
|
|
|
|
2006-09-21 08:03:40 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_append_mem(chunkqueue *cq, const char * mem, size_t len) {
|
2005-02-20 14:27:00 +00:00
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (0 == len) return;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
|
|
|
c->type = MEM_CHUNK;
|
2015-02-08 12:37:10 +00:00
|
|
|
buffer_copy_string_len(c->mem, mem, len);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
chunkqueue_append_chunk(cq, c);
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer * chunkqueue_get_prepend_buffer(chunkqueue *cq) {
|
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c->type = MEM_CHUNK;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
chunkqueue_prepend_chunk(cq, c);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-09-14 08:00:33 +00:00
|
|
|
return c->mem;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
buffer *chunkqueue_get_append_buffer(chunkqueue *cq) {
|
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
c->type = MEM_CHUNK;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
chunkqueue_append_chunk(cq, c);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-09-14 08:00:33 +00:00
|
|
|
return c->mem;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_set_tempdirs(chunkqueue *cq, array *tempdirs) {
|
|
|
|
force_assert(NULL != cq);
|
2005-11-01 07:50:08 +00:00
|
|
|
cq->tempdirs = tempdirs;
|
|
|
|
}
|
|
|
|
|
2005-09-26 08:53:58 +00:00
|
|
|
chunk *chunkqueue_get_append_tempfile(chunkqueue *cq) {
|
|
|
|
chunk *c;
|
2005-11-01 07:50:08 +00:00
|
|
|
buffer *template = buffer_init_string("/var/tmp/lighttpd-upload-XXXXXX");
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-09-26 08:53:58 +00:00
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
|
|
|
|
|
|
|
c->type = FILE_CHUNK;
|
2005-11-01 07:50:08 +00:00
|
|
|
|
2005-11-02 12:38:53 +00:00
|
|
|
if (cq->tempdirs && cq->tempdirs->used) {
|
2005-11-01 07:50:08 +00:00
|
|
|
size_t i;
|
|
|
|
|
|
|
|
/* we have several tempdirs, only if all of them fail we jump out */
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-11-01 07:50:08 +00:00
|
|
|
for (i = 0; i < cq->tempdirs->used; i++) {
|
|
|
|
data_string *ds = (data_string *)cq->tempdirs->data[i];
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
buffer_copy_buffer(template, ds->value);
|
|
|
|
buffer_append_slash(template);
|
2008-07-30 19:38:32 +00:00
|
|
|
buffer_append_string_len(template, CONST_STR_LEN("lighttpd-upload-XXXXXX"));
|
2005-11-01 07:50:08 +00:00
|
|
|
|
|
|
|
if (-1 != (c->file.fd = mkstemp(template->ptr))) {
|
|
|
|
/* only trigger the unlink if we created the temp-file successfully */
|
|
|
|
c->file.is_temp = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (-1 != (c->file.fd = mkstemp(template->ptr))) {
|
|
|
|
/* only trigger the unlink if we created the temp-file successfully */
|
|
|
|
c->file.is_temp = 1;
|
|
|
|
}
|
2005-10-31 08:14:02 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
buffer_copy_buffer(c->file.name, template);
|
2005-10-31 08:14:02 +00:00
|
|
|
c->file.length = 0;
|
2005-09-26 08:53:58 +00:00
|
|
|
|
|
|
|
chunkqueue_append_chunk(cq, c);
|
2005-11-01 07:50:08 +00:00
|
|
|
|
|
|
|
buffer_free(template);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-09-26 08:53:58 +00:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_steal(chunkqueue *dest, chunkqueue *src, off_t len) {
|
|
|
|
while (len > 0) {
|
|
|
|
chunk *c = src->first;
|
|
|
|
off_t clen = 0;
|
2005-09-26 08:53:58 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (NULL == c) break;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
switch (c->type) {
|
|
|
|
case MEM_CHUNK:
|
2015-02-08 12:37:10 +00:00
|
|
|
clen = buffer_string_length(c->mem);
|
2005-02-20 14:27:00 +00:00
|
|
|
break;
|
|
|
|
case FILE_CHUNK:
|
2015-02-08 12:37:10 +00:00
|
|
|
clen = c->file.length;
|
2005-02-20 14:27:00 +00:00
|
|
|
break;
|
2015-02-08 12:37:10 +00:00
|
|
|
}
|
|
|
|
force_assert(clen >= c->offset);
|
|
|
|
clen -= c->offset;
|
|
|
|
|
|
|
|
if (len >= clen) {
|
|
|
|
/* move complete chunk */
|
|
|
|
src->first = c->next;
|
|
|
|
if (c == src->last) src->last = NULL;
|
|
|
|
|
|
|
|
chunkqueue_append_chunk(dest, c);
|
|
|
|
src->bytes_out += clen;
|
|
|
|
dest->bytes_in += clen;
|
|
|
|
len -= clen;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* partial chunk with length "len" */
|
|
|
|
|
|
|
|
switch (c->type) {
|
|
|
|
case MEM_CHUNK:
|
|
|
|
chunkqueue_append_mem(dest, c->mem->ptr + c->offset, len);
|
|
|
|
break;
|
|
|
|
case FILE_CHUNK:
|
|
|
|
/* tempfile flag is in "last" chunk after the split */
|
|
|
|
chunkqueue_append_file(dest, c->file.name, c->file.start + c->offset, len);
|
2005-02-20 14:27:00 +00:00
|
|
|
break;
|
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
c->offset += len;
|
|
|
|
src->bytes_out += len;
|
|
|
|
dest->bytes_in += len;
|
|
|
|
len = 0;
|
|
|
|
}
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
off_t chunkqueue_length(chunkqueue *cq) {
|
2005-02-20 14:27:00 +00:00
|
|
|
off_t len = 0;
|
|
|
|
chunk *c;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
for (c = cq->first; c; c = c->next) {
|
2015-02-08 12:37:10 +00:00
|
|
|
off_t c_len = 0;
|
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
switch (c->type) {
|
|
|
|
case MEM_CHUNK:
|
2015-02-08 12:37:10 +00:00
|
|
|
c_len = buffer_string_length(c->mem);
|
2005-02-20 14:27:00 +00:00
|
|
|
break;
|
2015-02-08 12:37:10 +00:00
|
|
|
case FILE_CHUNK:
|
|
|
|
c_len = c->file.length;
|
2005-02-20 14:27:00 +00:00
|
|
|
break;
|
|
|
|
}
|
2015-02-08 12:37:10 +00:00
|
|
|
force_assert(c_len >= c->offset);
|
|
|
|
len += c_len - c->offset;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2005-02-20 14:27:00 +00:00
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
int chunkqueue_is_empty(chunkqueue *cq) {
|
2015-02-08 12:37:10 +00:00
|
|
|
return NULL == cq->first;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
void chunkqueue_remove_finished_chunks(chunkqueue *cq) {
|
2005-09-08 10:00:32 +00:00
|
|
|
chunk *c;
|
2005-02-20 14:27:00 +00:00
|
|
|
|
2005-09-08 10:00:32 +00:00
|
|
|
for (c = cq->first; c; c = cq->first) {
|
2015-02-08 12:37:10 +00:00
|
|
|
off_t c_len = 0;
|
2005-02-20 14:27:00 +00:00
|
|
|
|
2005-09-08 10:00:32 +00:00
|
|
|
switch (c->type) {
|
|
|
|
case MEM_CHUNK:
|
2015-02-08 12:37:10 +00:00
|
|
|
c_len = buffer_string_length(c->mem);
|
2005-09-08 10:00:32 +00:00
|
|
|
break;
|
|
|
|
case FILE_CHUNK:
|
2015-02-08 12:37:10 +00:00
|
|
|
c_len = c->file.length;
|
2005-09-08 10:00:32 +00:00
|
|
|
break;
|
|
|
|
}
|
2015-02-08 12:37:10 +00:00
|
|
|
force_assert(c_len >= c->offset);
|
2005-02-20 14:27:00 +00:00
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
if (c_len > c->offset) break; /* not finished yet */
|
2005-09-08 10:00:32 +00:00
|
|
|
|
|
|
|
cq->first = c->next;
|
|
|
|
if (c == cq->last) cq->last = NULL;
|
|
|
|
|
2015-02-08 12:37:10 +00:00
|
|
|
chunkqueue_push_unused_chunk(cq, c);
|
2005-09-08 10:00:32 +00:00
|
|
|
}
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|