89 lines
2.8 KiB
C
89 lines
2.8 KiB
C
/*
|
|
* Copyright (c) 2004, 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. 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 Contiki operating system.
|
|
*
|
|
* Author: Adam Dunkels <adam@sics.se>
|
|
*
|
|
* $Id: cfs-posix.c,v 1.10 2008/01/24 13:08:35 adamdunkels Exp $
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <fcntl.h>
|
|
#include <unistd.h>
|
|
|
|
#include "cfs/cfs.h"
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
int
|
|
cfs_open(const char *n, int f)
|
|
{
|
|
int s = 0;
|
|
if(f == CFS_READ) {
|
|
s = O_RDONLY;
|
|
} else if(f & CFS_WRITE) {
|
|
s = O_CREAT;
|
|
if(f & CFS_READ) {
|
|
s |= O_RDWR;
|
|
} else {
|
|
s |= O_WRONLY;
|
|
}
|
|
if(f & CFS_APPEND) {
|
|
s |= O_APPEND;
|
|
} else {
|
|
s |= O_TRUNC;
|
|
}
|
|
}
|
|
return open(n, s);
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
cfs_close(int f)
|
|
{
|
|
close(f);
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
int
|
|
cfs_read(int f, void *b, unsigned int l)
|
|
{
|
|
return read(f, b, l);
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
int
|
|
cfs_write(int f, const void *b, unsigned int l)
|
|
{
|
|
return write(f, b, l);
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
unsigned int
|
|
cfs_seek(int f, unsigned int o)
|
|
{
|
|
return lseek(f, o, SEEK_SET);
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|