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"
|
2015-02-08 19:10:36 +00:00
|
|
|
#include "base.h"
|
|
|
|
#include "log.h"
|
2009-10-11 14:31:42 +00:00
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
void chunkqueue_get_memory(chunkqueue *cq, char **mem, size_t *len, size_t min_size, size_t alloc_size) {
|
|
|
|
static const size_t REALLOC_MAX_SIZE = 256;
|
2005-02-20 14:27:00 +00:00
|
|
|
chunk *c;
|
2015-02-08 19:10:36 +00:00
|
|
|
buffer *b;
|
|
|
|
char *dummy_mem;
|
|
|
|
size_t dummy_len;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
force_assert(NULL != cq);
|
|
|
|
if (NULL == mem) mem = &dummy_mem;
|
|
|
|
if (NULL == len) len = &dummy_len;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
/* default values: */
|
|
|
|
if (0 == min_size) min_size = 1024;
|
|
|
|
if (0 == alloc_size) alloc_size = 4096;
|
|
|
|
if (alloc_size < min_size) alloc_size = min_size;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
if (NULL != cq->last && MEM_CHUNK == cq->last->type) {
|
|
|
|
size_t have;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
b = cq->last->mem;
|
|
|
|
have = buffer_string_space(b);
|
2005-02-20 14:27:00 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
/* unused buffer: allocate space */
|
|
|
|
if (buffer_string_is_empty(b)) {
|
|
|
|
buffer_string_prepare_copy(b, alloc_size);
|
|
|
|
have = buffer_string_space(b);
|
|
|
|
}
|
|
|
|
/* if buffer is really small just make it bigger */
|
|
|
|
else if (have < min_size && b->size <= REALLOC_MAX_SIZE) {
|
2015-02-08 19:10:44 +00:00
|
|
|
size_t cur_len = buffer_string_length(b);
|
|
|
|
size_t new_size = cur_len + min_size, append;
|
2015-02-08 19:10:36 +00:00
|
|
|
if (new_size < alloc_size) new_size = alloc_size;
|
|
|
|
|
2015-02-08 19:10:44 +00:00
|
|
|
append = new_size - cur_len;
|
2015-02-08 19:10:36 +00:00
|
|
|
if (append >= min_size) {
|
|
|
|
buffer_string_prepare_append(b, append);
|
|
|
|
have = buffer_string_space(b);
|
|
|
|
}
|
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
/* return pointer into existing buffer if large enough */
|
|
|
|
if (have >= min_size) {
|
|
|
|
*mem = b->ptr + buffer_string_length(b);
|
|
|
|
*len = have;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
/* allocate new chunk */
|
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
2005-02-20 14:27:00 +00:00
|
|
|
c->type = MEM_CHUNK;
|
|
|
|
chunkqueue_append_chunk(cq, c);
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
b = c->mem;
|
|
|
|
buffer_string_prepare_append(b, alloc_size);
|
|
|
|
|
|
|
|
*mem = b->ptr + buffer_string_length(b);
|
|
|
|
*len = buffer_string_space(b);
|
|
|
|
}
|
|
|
|
|
|
|
|
void chunkqueue_use_memory(chunkqueue *cq, size_t len) {
|
|
|
|
buffer *b;
|
|
|
|
|
|
|
|
force_assert(NULL != cq);
|
|
|
|
force_assert(NULL != cq->last && MEM_CHUNK == cq->last->type);
|
|
|
|
b = cq->last->mem;
|
|
|
|
|
|
|
|
if (len > 0) {
|
2015-02-08 19:10:44 +00:00
|
|
|
buffer_commit(b, len);
|
2015-02-08 19:10:36 +00:00
|
|
|
} else if (buffer_string_is_empty(b)) {
|
|
|
|
/* unused buffer: can't remove chunk easily from
|
|
|
|
* end of list, so just reset the buffer
|
|
|
|
*/
|
|
|
|
buffer_reset(b);
|
|
|
|
}
|
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;
|
|
|
|
}
|
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
void chunkqueue_steal(chunkqueue *dest, chunkqueue *src, off_t len) {
|
|
|
|
while (len > 0) {
|
|
|
|
chunk *c = src->first;
|
|
|
|
off_t clen = 0, use;
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
if (NULL == c) break;
|
2005-09-26 08:53:58 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
switch (c->type) {
|
|
|
|
case MEM_CHUNK:
|
|
|
|
clen = buffer_string_length(c->mem);
|
|
|
|
break;
|
|
|
|
case FILE_CHUNK:
|
|
|
|
clen = c->file.length;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
force_assert(clen >= c->offset);
|
|
|
|
clen -= c->offset;
|
|
|
|
use = len >= clen ? clen : len;
|
|
|
|
|
|
|
|
src->bytes_out += use;
|
|
|
|
dest->bytes_in += use;
|
|
|
|
len -= use;
|
|
|
|
|
|
|
|
if (0 == clen) {
|
|
|
|
/* drop empty chunk */
|
|
|
|
src->first = c->next;
|
|
|
|
if (c == src->last) src->last = NULL;
|
|
|
|
chunkqueue_push_unused_chunk(src, c);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (use == clen) {
|
|
|
|
/* move complete chunk */
|
|
|
|
src->first = c->next;
|
|
|
|
if (c == src->last) src->last = NULL;
|
|
|
|
|
|
|
|
chunkqueue_append_chunk(dest, c);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* partial chunk with length "use" */
|
|
|
|
|
|
|
|
switch (c->type) {
|
|
|
|
case MEM_CHUNK:
|
|
|
|
chunkqueue_append_mem(dest, c->mem->ptr + c->offset, use);
|
|
|
|
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, use);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
c->offset += use;
|
|
|
|
force_assert(0 == len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static chunk *chunkqueue_get_append_tempfile(chunkqueue *cq) {
|
|
|
|
chunk *c;
|
|
|
|
buffer *template = buffer_init_string("/var/tmp/lighttpd-upload-XXXXXX");
|
|
|
|
int fd;
|
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
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
if (-1 != (fd = mkstemp(template->ptr))) break;
|
2005-11-01 07:50:08 +00:00
|
|
|
}
|
|
|
|
} else {
|
2015-02-08 19:10:36 +00:00
|
|
|
fd = mkstemp(template->ptr);
|
2005-10-31 08:14:02 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
if (-1 == fd) {
|
|
|
|
buffer_free(template);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
c = chunkqueue_get_unused_chunk(cq);
|
|
|
|
c->type = FILE_CHUNK;
|
|
|
|
c->file.fd = fd;
|
|
|
|
c->file.is_temp = 1;
|
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 19:10:36 +00:00
|
|
|
static int chunkqueue_append_to_tempfile(server *srv, chunkqueue *dest, const char *mem, size_t len) {
|
2015-08-13 18:44:30 +00:00
|
|
|
/* copy everything to max MAX_TEMPFILE_SIZE sized tempfiles */
|
|
|
|
static const off_t MAX_TEMPFILE_SIZE = 16 * 1024 * 1024; /* 16MB */
|
2015-02-08 19:10:36 +00:00
|
|
|
chunk *dst_c = NULL;
|
|
|
|
ssize_t written;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if the last chunk is
|
2015-08-13 18:44:30 +00:00
|
|
|
* - smaller than MAX_TEMPFILE_SIZE
|
2015-02-08 19:10:36 +00:00
|
|
|
* - not read yet (offset == 0)
|
2015-08-13 18:44:30 +00:00
|
|
|
* -> append to it (so it might actually become larger than MAX_TEMPFILE_SIZE)
|
2015-02-08 19:10:36 +00:00
|
|
|
* otherwise
|
|
|
|
* -> create a new chunk
|
|
|
|
*
|
|
|
|
* */
|
|
|
|
|
|
|
|
if (NULL != dest->last
|
2015-08-13 18:44:27 +00:00
|
|
|
&& FILE_CHUNK == dest->last->type
|
2015-02-08 19:10:36 +00:00
|
|
|
&& dest->last->file.is_temp
|
|
|
|
&& -1 != dest->last->file.fd
|
|
|
|
&& 0 == dest->last->offset) {
|
|
|
|
/* ok, take the last chunk for our job */
|
|
|
|
dst_c = dest->last;
|
|
|
|
|
2015-08-13 18:44:30 +00:00
|
|
|
if (dest->last->file.length >= MAX_TEMPFILE_SIZE) {
|
2015-02-08 19:10:36 +00:00
|
|
|
/* the chunk is too large now, close it */
|
|
|
|
if (-1 != dst_c->file.fd) {
|
|
|
|
close(dst_c->file.fd);
|
|
|
|
dst_c->file.fd = -1;
|
|
|
|
}
|
|
|
|
dst_c = chunkqueue_get_append_tempfile(dest);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
dst_c = chunkqueue_get_append_tempfile(dest);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (NULL == dst_c) {
|
|
|
|
/* we don't have file to write to,
|
|
|
|
* EACCES might be one reason.
|
|
|
|
*
|
|
|
|
* Instead of sending 500 we send 413 and say the request is too large
|
|
|
|
*/
|
|
|
|
|
2015-07-05 22:00:17 +00:00
|
|
|
log_error_write(srv, __FILE__, __LINE__, "ss",
|
|
|
|
"denying upload as opening temp-file for upload failed:",
|
|
|
|
strerror(errno));
|
2015-02-08 19:10:36 +00:00
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (0 > (written = write(dst_c->file.fd, mem, len)) || (size_t) written != len) {
|
|
|
|
/* write failed for some reason ... disk full ? */
|
|
|
|
log_error_write(srv, __FILE__, __LINE__, "sbs",
|
|
|
|
"denying upload as writing to file failed:",
|
|
|
|
dst_c->file.name, strerror(errno));
|
|
|
|
|
|
|
|
close(dst_c->file.fd);
|
|
|
|
dst_c->file.fd = -1;
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
dst_c->file.length += len;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int chunkqueue_steal_with_tempfiles(server *srv, chunkqueue *dest, chunkqueue *src, off_t len) {
|
2015-02-08 12:37:10 +00:00
|
|
|
while (len > 0) {
|
|
|
|
chunk *c = src->first;
|
2015-02-08 19:10:36 +00:00
|
|
|
off_t clen = 0, use;
|
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;
|
2015-02-08 19:10:36 +00:00
|
|
|
use = len >= clen ? clen : len;
|
2015-02-08 12:37:10 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
src->bytes_out += use;
|
|
|
|
dest->bytes_in += use;
|
|
|
|
len -= use;
|
|
|
|
|
|
|
|
if (0 == clen) {
|
|
|
|
/* drop empty chunk */
|
2015-02-08 12:37:10 +00:00
|
|
|
src->first = c->next;
|
|
|
|
if (c == src->last) src->last = NULL;
|
2015-02-08 19:10:36 +00:00
|
|
|
chunkqueue_push_unused_chunk(src, c);
|
2015-02-08 12:37:10 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
if (FILE_CHUNK == c->type) {
|
|
|
|
if (use == clen) {
|
|
|
|
/* move complete chunk */
|
|
|
|
src->first = c->next;
|
|
|
|
if (c == src->last) src->last = NULL;
|
2015-02-08 12:37:10 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
chunkqueue_append_chunk(dest, c);
|
|
|
|
} else {
|
|
|
|
/* partial chunk with length "use" */
|
|
|
|
/* tempfile flag is in "last" chunk after the split */
|
|
|
|
chunkqueue_append_file(dest, c->file.name, c->file.start + c->offset, use);
|
|
|
|
|
|
|
|
c->offset += use;
|
|
|
|
force_assert(0 == len);
|
|
|
|
}
|
|
|
|
continue;
|
2005-02-20 14:27:00 +00:00
|
|
|
}
|
2006-10-04 13:26:23 +00:00
|
|
|
|
2015-02-08 19:10:36 +00:00
|
|
|
/* store "use" bytes from memory chunk in tempfile */
|
|
|
|
if (0 != chunkqueue_append_to_tempfile(srv, dest, c->mem->ptr + c->offset, use)) {
|
|
|
|
/* undo counters */
|
|
|
|
src->bytes_out -= use;
|
|
|
|
dest->bytes_in -= use;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
c->offset += use;
|
|
|
|
if (use == clen) {
|
|
|
|
/* finished chunk */
|
|
|
|
src->first = c->next;
|
|
|
|
if (c == src->last) src->last = NULL;
|
|
|
|
chunkqueue_push_unused_chunk(src, c);
|
|
|
|
}
|
2015-02-08 12:37:10 +00:00
|
|
|
}
|
2015-02-08 19:10:36 +00:00
|
|
|
|
|
|
|
return 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
|
|
|
}
|
|