mirror of
https://github.com/yasm/yasm
synced 2026-08-26 22:26:05 -04:00
9f6cb6783f
libintl dependency in modules. Also standardize initialize() and cleanup() functions. Move replace_extension() from file.c to main.c. Clean up some extern variable declarations in various places (particularly nasm-compatible parser). svn path=/trunk/yasm/; revision=792
169 lines
5.1 KiB
C
169 lines
5.1 KiB
C
/* $IdPath$
|
|
* Big and little endian file functions header file.
|
|
*
|
|
* Copyright (C) 2001 Peter Johnson
|
|
*
|
|
* This file is part of YASM.
|
|
*
|
|
* YASM is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* YASM is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*/
|
|
#ifndef YASM_FILE_H
|
|
#define YASM_FILE_H
|
|
|
|
/* These functions only work properly if p is an (unsigned char *) */
|
|
|
|
#define WRITE_8(ptr, val) \
|
|
*((ptr)++) = (unsigned char)((val) & 0xFF)
|
|
|
|
#define WRITE_16_L(ptr, val) \
|
|
do { \
|
|
*((ptr)++) = (unsigned char)((val) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
} while (0)
|
|
|
|
#define WRITE_32_L(ptr, val) \
|
|
do { \
|
|
*((ptr)++) = (unsigned char)((val) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)(((val) >> 16) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)(((val) >> 24) & 0xFF); \
|
|
} while (0)
|
|
|
|
#define WRITE_16_B(ptr, val) \
|
|
do { \
|
|
*((ptr)++) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)((val) & 0xFF); \
|
|
} while (0)
|
|
|
|
#define WRITE_32_B(ptr, val) \
|
|
do { \
|
|
*((ptr)++) = (unsigned char)(((val) >> 24) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)(((val) >> 16) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
*((ptr)++) = (unsigned char)((val) & 0xFF); \
|
|
} while (0)
|
|
|
|
|
|
/* Non-incrementing versions of the above. */
|
|
|
|
#define SAVE_8(ptr, val) \
|
|
*(ptr) = (unsigned char)((val) & 0xFF)
|
|
|
|
#define SAVE_16_L(ptr, val) \
|
|
do { \
|
|
*(ptr) = (unsigned char)((val) & 0xFF); \
|
|
*((ptr)+1) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
} while (0)
|
|
|
|
#define SAVE_32_L(ptr, val) \
|
|
do { \
|
|
*(ptr) = (unsigned char)((val) & 0xFF); \
|
|
*((ptr)+1) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
*((ptr)+2) = (unsigned char)(((val) >> 16) & 0xFF); \
|
|
*((ptr)+3) = (unsigned char)(((val) >> 24) & 0xFF); \
|
|
} while (0)
|
|
|
|
#define SAVE_16_B(ptr, val) \
|
|
do { \
|
|
*(ptr) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
*((ptr)+1) = (unsigned char)((val) & 0xFF); \
|
|
} while (0)
|
|
|
|
#define SAVE_32_B(ptr, val) \
|
|
do { \
|
|
*(ptr) = (unsigned char)(((val) >> 24) & 0xFF); \
|
|
*((ptr)+1) = (unsigned char)(((val) >> 16) & 0xFF); \
|
|
*((ptr)+2) = (unsigned char)(((val) >> 8) & 0xFF); \
|
|
*((ptr)+3) = (unsigned char)((val) & 0xFF); \
|
|
} while (0)
|
|
|
|
/* Direct-to-file versions of the above. Using the above macros and a single
|
|
* fwrite() will probably be faster than calling these functions many times.
|
|
* These functions return 1 if the write was successful, 0 if not (so their
|
|
* return values can be used like the return value from fwrite()).
|
|
*/
|
|
|
|
size_t fwrite_16_l(unsigned short val, FILE *f);
|
|
size_t fwrite_32_l(unsigned long val, FILE *f);
|
|
size_t fwrite_16_b(unsigned short val, FILE *f);
|
|
size_t fwrite_32_b(unsigned long val, FILE *f);
|
|
|
|
/* Read/Load versions. val is the variable to receive the data. */
|
|
|
|
#define READ_8(val, ptr) \
|
|
(val) = *((ptr)++) & 0xFF
|
|
|
|
#define READ_16_L(val, ptr) \
|
|
do { \
|
|
(val) = *((ptr)++) & 0xFF; \
|
|
(val) |= (*((ptr)++) & 0xFF) << 8; \
|
|
} while (0)
|
|
|
|
#define READ_32_L(val, ptr) \
|
|
do { \
|
|
(val) = *((ptr)++) & 0xFF; \
|
|
(val) |= (*((ptr)++) & 0xFF) << 8; \
|
|
(val) |= (*((ptr)++) & 0xFF) << 16; \
|
|
(val) |= (*((ptr)++) & 0xFF) << 24; \
|
|
} while (0)
|
|
|
|
#define READ_16_B(val, ptr) \
|
|
do { \
|
|
(val) = (*((ptr)++) & 0xFF) << 8; \
|
|
(val) |= *((ptr)++) & 0xFF; \
|
|
} while (0)
|
|
|
|
#define READ_32_B(val, ptr) \
|
|
do { \
|
|
(val) = (*((ptr)++) & 0xFF) << 24; \
|
|
(val) |= (*((ptr)++) & 0xFF) << 16; \
|
|
(val) |= (*((ptr)++) & 0xFF) << 8; \
|
|
(val) |= *((ptr)++) & 0xFF; \
|
|
} while (0)
|
|
|
|
/* Non-incrementing versions of the above. */
|
|
|
|
#define LOAD_8(val, ptr) \
|
|
(val) = *(ptr) & 0xFF
|
|
|
|
#define LOAD_16_L(val, ptr) \
|
|
do { \
|
|
(val) = *(ptr) & 0xFF; \
|
|
(val) |= (*((ptr)+1) & 0xFF) << 8; \
|
|
} while (0)
|
|
|
|
#define LOAD_32_L(val, ptr) \
|
|
do { \
|
|
(val) = (unsigned long)(*(ptr) & 0xFF); \
|
|
(val) |= (unsigned long)((*((ptr)+1) & 0xFF) << 8); \
|
|
(val) |= (unsigned long)((*((ptr)+2) & 0xFF) << 16); \
|
|
(val) |= (unsigned long)((*((ptr)+3) & 0xFF) << 24); \
|
|
} while (0)
|
|
|
|
#define LOAD_16_B(val, ptr) \
|
|
do { \
|
|
(val) = (*(ptr) & 0xFF) << 8; \
|
|
(val) |= *((ptr)+1) & 0xFF; \
|
|
} while (0)
|
|
|
|
#define LOAD_32_B(val, ptr) \
|
|
do { \
|
|
(val) = (unsigned long)((*(ptr) & 0xFF) << 24); \
|
|
(val) |= (unsigned long)((*((ptr)+1) & 0xFF) << 16); \
|
|
(val) |= (unsigned long)((*((ptr)+2) & 0xFF) << 8); \
|
|
(val) |= (unsigned long)(*((ptr)+3) & 0xFF); \
|
|
} while (0)
|
|
|
|
#endif
|