Contiki 2.5
httpd-fs.c
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 <adam@sics.se>
32  *
33  * $Id: httpd-fs.c,v 1.1 2007/11/28 09:40:13 matsutsuka Exp $
34  */
35 
36 #include "contiki-net.h"
37 #include "httpd.h"
38 #include "httpd-fs.h"
39 #include "httpd-fsdata.h"
40 
41 #include "httpd-fsdata.c"
42 #include "ctk/libconio_arch-small.h"
43 
44 #if HTTPD_FS_STATISTICS
45 static u16_t count[HTTPD_FS_NUMFILES];
46 #endif /* HTTPD_FS_STATISTICS */
47 
48 /*-----------------------------------------------------------------------------------*/
49 static u8_t
50 httpd_fs_strcmp(const char *str1, const char *str2)
51 {
52  u8_t i;
53  i = 0;
54 
55 loop:
56  if(str2[i] == 0 ||
57  str1[i] == '\r' ||
58  str1[i] == '\n') {
59  return 0;
60  }
61 
62  if(str1[i] != str2[i]) {
63  return 1;
64  }
65 
66  ++i;
67  goto loop;
68 }
69 /*-----------------------------------------------------------------------------------*/
70 int
71 httpd_fs_open(const char *name, struct httpd_fs_file *file)
72 {
73 #if HTTPD_FS_STATISTICS
74  u16_t i = 0;
75 #endif /* HTTPD_FS_STATISTICS */
76  char* ch;
77  struct httpd_fsdata_file_noconst *f;
78 
79  libputs_arch(name);
80  for(f = (struct httpd_fsdata_file_noconst *)HTTPD_FS_ROOT;
81  f != NULL;
82  f = (struct httpd_fsdata_file_noconst *)f->next) {
83 
84  if(httpd_fs_strcmp(name, f->name) == 0) {
85  file->data = f->data;
86  file->len = f->len;
87 #if HTTPD_FS_STATISTICS
88  ++count[i];
89 #endif /* HTTPD_FS_STATISTICS */
90  return 1;
91  }
92 #if HTTPD_FS_STATISTICS
93  ++i;
94 #endif /* HTTPD_FS_STATISTICS */
95 
96  }
97  return 0;
98 }
99 /*-----------------------------------------------------------------------------------*/
100 void
101 httpd_fs_init(void)
102 {
103 #if HTTPD_FS_STATISTICS
104  u16_t i;
105  for(i = 0; i < HTTPD_FS_NUMFILES; i++) {
106  count[i] = 0;
107  }
108 #endif /* HTTPD_FS_STATISTICS */
109 }
110 /*-----------------------------------------------------------------------------------*/
111 #if HTTPD_FS_STATISTICS
112 u16_t
113 httpd_fs_count(char *name)
114 {
115  struct httpd_fsdata_file_noconst *f;
116  u16_t i;
117 
118  i = 0;
119  for(f = (struct httpd_fsdata_file_noconst *)HTTPD_FS_ROOT;
120  f != NULL;
121  f = (struct httpd_fsdata_file_noconst *)f->next) {
122 
123  if(httpd_fs_strcmp(name, f->name) == 0) {
124  return count[i];
125  }
126  ++i;
127  }
128  return 0;
129 }
130 #endif /* HTTPD_FS_STATISTICS */
131 /*-----------------------------------------------------------------------------------*/