1 /*
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. Neither the name of the Institute nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * This file is part of the lwIP TCP/IP stack.
30 *
31 * Author: Adam Dunkels <[email protected]>
32 *
33 * $Id: httpd-fs.c,v 1.1 2006/06/07 09:13:08 adam Exp $
34 */
35
36 #include "httpd.h"
37 #include "httpd-fs.h"
38 #include "httpd-fsdata.h"
39
40 #ifndef NULL
41 #define NULL 0
42 #endif /* NULL */
43
44 #include "httpd-fsdata.c"
45
46 #if HTTPD_FS_STATISTICS
47 static u16_t count[HTTPD_FS_NUMFILES];
48 #endif /* HTTPD_FS_STATISTICS */
49
50 /*-----------------------------------------------------------------------------------*/
51 static u8_t
httpd_fs_strcmp(const char * str1,const char * str2)52 httpd_fs_strcmp(const char *str1, const char *str2)
53 {
54 u8_t i;
55 i = 0;
56 loop:
57
58 if(str2[i] == 0 ||
59 str1[i] == '\r' ||
60 str1[i] == '\n') {
61 return 0;
62 }
63
64 if(str1[i] != str2[i]) {
65 return 1;
66 }
67
68
69 ++i;
70 goto loop;
71 }
72 /*-----------------------------------------------------------------------------------*/
73 int
httpd_fs_open(const char * name,struct httpd_fs_file * file)74 httpd_fs_open(const char *name, struct httpd_fs_file *file)
75 {
76 #if HTTPD_FS_STATISTICS
77 u16_t i = 0;
78 #endif /* HTTPD_FS_STATISTICS */
79 struct httpd_fsdata_file_noconst *f;
80
81 for(f = (struct httpd_fsdata_file_noconst *)HTTPD_FS_ROOT;
82 f != NULL;
83 f = (struct httpd_fsdata_file_noconst *)f->next) {
84
85 if(httpd_fs_strcmp(name, f->name) == 0) {
86 file->data = f->data;
87 file->len = f->len;
88 #if HTTPD_FS_STATISTICS
89 ++count[i];
90 #endif /* HTTPD_FS_STATISTICS */
91 return 1;
92 }
93 #if HTTPD_FS_STATISTICS
94 ++i;
95 #endif /* HTTPD_FS_STATISTICS */
96
97 }
98 return 0;
99 }
100 /*-----------------------------------------------------------------------------------*/
101 void
httpd_fs_init(void)102 httpd_fs_init(void)
103 {
104 #if HTTPD_FS_STATISTICS
105 u16_t i;
106 for(i = 0; i < HTTPD_FS_NUMFILES; i++) {
107 count[i] = 0;
108 }
109 #endif /* HTTPD_FS_STATISTICS */
110 }
111 /*-----------------------------------------------------------------------------------*/
112 #if HTTPD_FS_STATISTICS
httpd_fs_count(char * name)113 u16_t httpd_fs_count
114 (char *name)
115 {
116 struct httpd_fsdata_file_noconst *f;
117 u16_t i;
118
119 i = 0;
120 for(f = (struct httpd_fsdata_file_noconst *)HTTPD_FS_ROOT;
121 f != NULL;
122 f = (struct httpd_fsdata_file_noconst *)f->next) {
123
124 if(httpd_fs_strcmp(name, f->name) == 0) {
125 return count[i];
126 }
127 ++i;
128 }
129 return 0;
130 }
131 #endif /* HTTPD_FS_STATISTICS */
132 /*-----------------------------------------------------------------------------------*/
133