/* * Copyright (c) 2001, 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. All advertising materials mentioning features or use of this software *    must display the following acknowledgement: *      This product includes software developed by the Swedish Institute *      of Computer Science and its contributors. * 4. Neither the name of the Institute nor the names of its contributors  *    may be used to endorse or promote products derived from this software  *    without specific prior written permission.  * * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``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 INSTITUTE OR CONTRIBUTORS 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> * * $Id: fs.c,v 1.6 2001/11/25 18:47:36 adam Exp $ */#include "uip.h"#include "fs.h"#include "fsdata.h"#define NULL (void *)0#include "fsdata.c"#ifdef FS_STATISTICS#if FS_STATISTICS == 1static u16_t count[FS_NUMFILES];#endif /* FS_STATISTICS */#endif /* FS_STATISTICS *//*-----------------------------------------------------------------------------------*/static u8_tfs_strcmp(const char *str1, const char *str2){  u8_t i;  i = 0; loop:  if(str2[i] == 0 ||     str1[i] == '\r' ||      str1[i] == '\n') {    return 0;  }  if(str1[i] != str2[i]) {    return 1;  }  ++i;  goto loop;}/*-----------------------------------------------------------------------------------*/intfs_open(const char *name, struct fs_file *file){#ifdef FS_STATISTICS#if FS_STATISTICS == 1  u16_t i = 0;#endif /* FS_STATISTICS */#endif /* FS_STATISTICS */  struct fsdata_file_noconst *f;  for(f = (struct fsdata_file_noconst *)FS_ROOT;      f != NULL;      f = (struct fsdata_file_noconst *)f->next) {    if(fs_strcmp(name, f->name) == 0) {      file->data = f->data;      file->len = f->len;#ifdef FS_STATISTICS#if FS_STATISTICS == 1      ++count[i];#endif /* FS_STATISTICS */#endif /* FS_STATISTICS */      return 1;    }#ifdef FS_STATISTICS#if FS_STATISTICS == 1    ++i;#endif /* FS_STATISTICS */#endif /* FS_STATISTICS */  }  return 0;}/*-----------------------------------------------------------------------------------*/voidfs_init(void){#ifdef FS_STATISTICS#if FS_STATISTICS == 1  u16_t i;  for(i = 0; i < FS_NUMFILES; i++) {    count[i] = 0;  }#endif /* FS_STATISTICS */#endif /* FS_STATISTICS */}/*-----------------------------------------------------------------------------------*/#ifdef FS_STATISTICS#if FS_STATISTICS == 1  u16_t fs_count(char *name){  struct fsdata_file_noconst *f;  u16_t i;  i = 0;  for(f = (struct fsdata_file_noconst *)FS_ROOT;      f != NULL;      f = (struct fsdata_file_noconst *)f->next) {    if(fs_strcmp(name, f->name) == 0) {      return count[i];    }    ++i;  }  return 0;}#endif /* FS_STATISTICS */#endif /* FS_STATISTICS *//*-----------------------------------------------------------------------------------*/