/*************************************************************************//*                                                                       *//*                  Language Technologies Institute                      *//*                     Carnegie Mellon University                        *//*                        Copyright (c) 1999                             *//*                        All Rights Reserved.                           *//*                                                                       *//*  Permission is hereby granted, free of charge, to use and distribute  *//*  this software and its documentation without restriction, including   *//*  without limitation the rights to use, copy, modify, merge, publish,  *//*  distribute, sublicense, and/or sell copies of this work, and to      *//*  permit persons to whom this work is furnished to do so, subject to   *//*  the following conditions:                                            *//*   1. The code must retain the above copyright notice, this list of    *//*      conditions and the following disclaimer.                         *//*   2. Any modifications must be clearly marked as such.                *//*   3. Original authors' names are not deleted.                         *//*   4. The authors' names are not used to endorse or promote products   *//*      derived from this software without specific prior written        *//*      permission.                                                      *//*                                                                       *//*  CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK         *//*  DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING      *//*  ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT   *//*  SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE      *//*  FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES    *//*  WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN   *//*  AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,          *//*  ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF       *//*  THIS SOFTWARE.                                                       *//*                                                                       *//*************************************************************************//*             Author:  Alan W Black (awb@cs.cmu.edu)                    *//*               Date:  August 2000                                      *//*************************************************************************//*                                                                       *//*  Some File stuff                                                      *//*                                                                       *//*************************************************************************/#ifndef _CST_FILE_H__#define _CST_FILE_H__ #define CST_WRONG_FORMAT -2#define CST_ERROR_FORMAT -1#define CST_OK_FORMAT     0 #ifdef UNDER_CE/* File access stuff (WinCE 2.11 is really damaged) */#include <windows.h>#include <winbase.h>typedef HANDLE cst_file;#elif __palmos__#include <PalmOS.h>#include <System/StdIOPalm.h>typedef FILE * cst_file;#else#include <stdio.h>typedef FILE * cst_file;#endif /* File mapping stuff */#ifdef _WIN32#include <windows.h>typedef struct cst_filemap_struct {    void *mem;    cst_file fh;    size_t mapsize;    HANDLE h;} cst_filemap;#elif __palmos__typedef struct cst_filemap_struct {    void *mem;    cst_file fh;    unsigned int mapsize;    int fd;} cst_filemap;#elsetypedef struct cst_filemap_struct {    void *mem;    cst_file fh;    size_t mapsize;    int fd;} cst_filemap;#endif #define CST_OPEN_WRITE (1<<0)#define CST_OPEN_READ (1<<1)#define CST_OPEN_APPEND (1<<2)/* We actually ignore this -- files are always opened in in binary mode */#define CST_OPEN_BINARY (1<<3) #define CST_SEEK_ABSOLUTE 0#define CST_SEEK_RELATIVE 1#define CST_SEEK_ENDREL 2 cst_file cst_fopen(const char *path, int mode);long cst_fwrite(cst_file fh, const void *buf, long size, long count);long cst_fread(cst_file fh, void *buf, long size, long count);int cst_fprintf(cst_file fh, const char *fmt, ...);int cst_sprintf(char *s, const char *fmt, ...);#ifdef _WIN32#define snprintf c99_snprintf #ifdef __GNUC__#define INLINE static inline#else#define INLINE __inline#endif INLINE int c99_vsnprintf(char* str, size_t size, const char* format,va_list ap)  {       int count = -1;       if (size != 0)           count = _vsnprintf_s(str, size, _TRUNCATE, format, ap);       if (count == -1)           count = _vscprintf(format, ap);       return count;   }INLINE int c99_snprintf(char* str, size_t size, const char* format, ...){       int count;       va_list ap;        va_start(ap, format);       count = c99_vsnprintf(str, size, format, ap);       va_end(ap);       return count;   }#endif#define cst_snprintf snprintf #if defined(__palmos__)#include <stdarg.h>int cst_vsprintf(char *s, const char *fmt, va_list args);#endifint cst_fclose(cst_file fh);int cst_fgetc(cst_file fh); /* These aren't LFS-compliant.  I don't think we'll need >2G files. */long cst_ftell(cst_file fh);long cst_fseek(cst_file fh, long pos, int whence);long cst_filesize(cst_file fh); cst_filemap *cst_mmap_file(const char *path);int cst_munmap_file(cst_filemap *map); cst_filemap *cst_read_whole_file(const char *path);int cst_free_whole_file(cst_filemap *map); cst_filemap *cst_read_part_file(const char *path);int cst_free_part_file(cst_filemap *map); int cst_urlp(const char *url);cst_file cst_url_open(const char *url); #endif