blob: d97dcfb2822a9fc953695c79f1826a1a3e368623 [file] [log] [blame]
adamdunkels9fcf9d62003-09-04 19:46:32 +00001/*
2 * Copyright (c) 2001, Swedish Institute of Computer Science.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the Swedish Institute
16 * of Computer Science and its contributors.
17 * 4. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 * This file is part of the lwIP TCP/IP stack.
34 *
35 * Author: Adam Dunkels <adam@sics.se>
36 *
37 * $Id: httpd-fs.c,v 1.1 2003/09/04 19:46:33 adamdunkels Exp $
38 */
39
40#include "uip.h"
41#include "httpd.h"
42#include "httpd-fs.h"
43#include "httpd-fsdata.h"
44
45#include "httpd-fsdata.c"
46
47#if HTTPD_FS_STATISTICS
48static u16_t count[HTTPD_FS_NUMFILES];
49#endif /* HTTPD_FS_STATISTICS */
50
51/*-----------------------------------------------------------------------------------*/
52static u8_t
53httpd_fs_strcmp(const char *str1, const char *str2)
54{
55 u8_t i;
56 i = 0;
57 loop:
58
59 if(str2[i] == 0 ||
60 str1[i] == '\r' ||
61 str1[i] == '\n') {
62 return 0;
63 }
64
65 if(str1[i] != str2[i]) {
66 return 1;
67 }
68
69
70 ++i;
71 goto loop;
72}
73/*-----------------------------------------------------------------------------------*/
74int
75httpd_fs_open(const char *name, struct httpd_fs_file *file)
76{
77#if HTTPD_FS_STATISTICS
78 u16_t i = 0;
79#endif /* HTTPD_FS_STATISTICS */
80 struct httpd_fsdata_file_noconst *f;
81
82 for(f = (struct httpd_fsdata_file_noconst *)HTTPD_FS_ROOT;
83 f != NULL;
84 f = (struct httpd_fsdata_file_noconst *)f->next) {
85
86 if(httpd_fs_strcmp(name, f->name) == 0) {
87 file->data = f->data;
88 file->len = f->len;
89#if HTTPD_FS_STATISTICS
90 ++count[i];
91#endif /* HTTPD_FS_STATISTICS */
92 return 1;
93 }
94#if HTTPD_FS_STATISTICS
95 ++i;
96#endif /* HTTPD_FS_STATISTICS */
97
98 }
99 return 0;
100}
101/*-----------------------------------------------------------------------------------*/
102void
103httpd_fs_init(void)
104{
105#if HTTPD_FS_STATISTICS
106 u16_t i;
107 for(i = 0; i < HTTPD_FS_NUMFILES; i++) {
108 count[i] = 0;
109 }
110#endif /* HTTPD_FS_STATISTICS */
111}
112/*-----------------------------------------------------------------------------------*/
113#if HTTPD_FS_STATISTICS
114u16_t httpd_fs_count
115(char *name)
116{
117 struct httpd_fsdata_file_noconst *f;
118 u16_t i;
119
120 i = 0;
121 for(f = (struct httpd_fsdata_file_noconst *)HTTPD_FS_ROOT;
122 f != NULL;
123 f = (struct httpd_fsdata_file_noconst *)f->next) {
124
125 if(httpd_fs_strcmp(name, f->name) == 0) {
126 return count[i];
127 }
128 ++i;
129 }
130 return 0;
131}
132#endif /* HTTPD_FS_STATISTICS */
133/*-----------------------------------------------------------------------------------*/