2007-10-01 20:48:42 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2001-2003 Swedish Institute of Computer Science.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|
|
|
* are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
|
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
|
|
|
|
* SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
|
|
|
|
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|
|
|
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
|
|
|
|
* OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* This file is part of the lwIP TCP/IP stack.
|
|
|
|
*
|
|
|
|
* Author: Adam Dunkels <adam@sics.se>
|
|
|
|
*
|
|
|
|
*/
|
2010-03-18 06:34:35 +00:00
|
|
|
#include "lwip/opt.h"
|
2007-10-01 20:48:42 +00:00
|
|
|
#include "lwip/def.h"
|
|
|
|
#include "fs.h"
|
|
|
|
#include "fsdata.h"
|
2009-08-11 14:34:28 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
2010-04-01 12:19:18 +00:00
|
|
|
/** Set this to 1 to include "fsdata_custom.c" instead of "fsdata.c" for the
|
|
|
|
* file system (to prevent changing the file included in CVS) */
|
|
|
|
#ifndef HTTPD_USE_CUSTUM_FSDATA
|
|
|
|
#define HTTPD_USE_CUSTUM_FSDATA 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if HTTPD_USE_CUSTUM_FSDATA
|
|
|
|
#include "fsdata_custom.c"
|
|
|
|
#else /* HTTPD_USE_CUSTUM_FSDATA */
|
|
|
|
#include "fsdata.c"
|
|
|
|
#endif /* HTTPD_USE_CUSTUM_FSDATA */
|
|
|
|
|
2010-02-17 21:19:17 +00:00
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
/* Define the number of open files that we can support. */
|
|
|
|
#ifndef LWIP_MAX_OPEN_FILES
|
|
|
|
#define LWIP_MAX_OPEN_FILES 10
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Define the file system memory allocation structure. */
|
|
|
|
struct fs_table {
|
|
|
|
struct fs_file file;
|
2010-03-18 06:34:35 +00:00
|
|
|
u8_t inuse;
|
2010-02-17 21:19:17 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Allocate file system memory */
|
|
|
|
struct fs_table fs_memory[LWIP_MAX_OPEN_FILES];
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
static struct fs_file *
|
|
|
|
fs_malloc(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for(i = 0; i < LWIP_MAX_OPEN_FILES; i++) {
|
|
|
|
if(fs_memory[i].inuse == 0) {
|
|
|
|
fs_memory[i].inuse = 1;
|
|
|
|
return(&fs_memory[i].file);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
static void
|
|
|
|
fs_free(struct fs_file *file)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for(i = 0; i < LWIP_MAX_OPEN_FILES; i++) {
|
|
|
|
if(&fs_memory[i].file == file) {
|
|
|
|
fs_memory[i].inuse = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
struct fs_file *
|
|
|
|
fs_open(const char *name)
|
2007-10-01 20:48:42 +00:00
|
|
|
{
|
2010-02-17 21:19:17 +00:00
|
|
|
struct fs_file *file;
|
2008-03-27 18:33:18 +00:00
|
|
|
const struct fsdata_file *f;
|
2007-10-01 20:48:42 +00:00
|
|
|
|
2010-02-17 21:19:17 +00:00
|
|
|
file = fs_malloc();
|
|
|
|
if(file == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
for(f = FS_ROOT; f != NULL; f = f->next) {
|
|
|
|
if (!strcmp(name, (char *)f->name)) {
|
|
|
|
file->data = (const char *)f->data;
|
2007-10-01 20:48:42 +00:00
|
|
|
file->len = f->len;
|
2010-02-17 21:19:17 +00:00
|
|
|
file->index = f->len;
|
|
|
|
file->pextension = NULL;
|
2010-02-24 11:51:05 +00:00
|
|
|
file->http_header_included = f->http_header_included;
|
2010-03-18 06:34:35 +00:00
|
|
|
#if HTTPD_PRECALCULATED_CHECKSUM
|
|
|
|
file->chksum_count = f->chksum_count;
|
|
|
|
file->chksum = f->chksum;
|
|
|
|
#endif /* HTTPD_PRECALCULATED_CHECKSUM */
|
2010-02-17 21:19:17 +00:00
|
|
|
return file;
|
2007-10-01 20:48:42 +00:00
|
|
|
}
|
|
|
|
}
|
2010-02-17 21:19:17 +00:00
|
|
|
fs_free(file);
|
|
|
|
return NULL;
|
2007-10-01 20:48:42 +00:00
|
|
|
}
|
2010-02-17 21:19:17 +00:00
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
void
|
|
|
|
fs_close(struct fs_file *file)
|
|
|
|
{
|
|
|
|
fs_free(file);
|
|
|
|
}
|
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
int
|
|
|
|
fs_read(struct fs_file *file, char *buffer, int count)
|
|
|
|
{
|
|
|
|
int read;
|
|
|
|
|
|
|
|
if(file->index == file->len) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
read = file->len - file->index;
|
|
|
|
if(read > count) {
|
|
|
|
read = count;
|
|
|
|
}
|
|
|
|
|
2010-03-18 06:34:35 +00:00
|
|
|
MEMCPY(buffer, (file->data + file->index), read);
|
2010-02-17 21:19:17 +00:00
|
|
|
file->index += read;
|
|
|
|
|
|
|
|
return(read);
|
|
|
|
}
|
2010-03-08 18:58:21 +00:00
|
|
|
/*-----------------------------------------------------------------------------------*/
|
|
|
|
int fs_bytes_left(struct fs_file *file)
|
|
|
|
{
|
|
|
|
return file->len - file->index;
|
|
|
|
}
|