nasm/nasmlib.h

281 lines
8.2 KiB
C
Raw Normal View History

2002-05-01 04:53:55 +08:00
/* nasmlib.h header file for nasmlib.c
2002-05-01 04:51:32 +08:00
*
* The Netwide Assembler is copyright (C) 1996 Simon Tatham and
* Julian Hall. All rights reserved. The software is
* redistributable under the licence given in the file "Licence"
* distributed in the NASM archive.
*/
#ifndef NASM_NASMLIB_H
#define NASM_NASMLIB_H
#include <inttypes.h>
#include <stdio.h>
2002-05-01 04:52:08 +08:00
/*
* If this is defined, the wrappers around malloc et al will
* transform into logging variants, which will cause NASM to create
* a file called `malloc.log' when run, and spew details of all its
* memory management into that. That can then be analysed to detect
* memory leaks and potentially other problems too.
*/
/* #define LOGALLOC */
2002-05-01 04:51:32 +08:00
/*
* Wrappers around malloc, realloc and free. nasm_malloc will
* fatal-error and die rather than return NULL; nasm_realloc will
* do likewise, and will also guarantee to work right on being
* passed a NULL pointer; nasm_free will do nothing if it is passed
* a NULL pointer.
*/
2005-01-16 06:15:51 +08:00
#ifdef NASM_NASM_H /* need efunc defined for this */
void nasm_set_malloc_error(efunc);
2002-05-01 04:52:08 +08:00
#ifndef LOGALLOC
2005-01-16 06:15:51 +08:00
void *nasm_malloc(size_t);
void *nasm_realloc(void *, size_t);
void nasm_free(void *);
char *nasm_strdup(const char *);
char *nasm_strndup(char *, size_t);
2002-05-01 04:52:08 +08:00
#else
void *nasm_malloc_log(char *, int, size_t);
void *nasm_realloc_log(char *, int, void *, size_t);
void nasm_free_log(char *, int, void *);
char *nasm_strdup_log(char *, int, const char *);
char *nasm_strndup_log(char *, int, char *, size_t);
2002-05-01 04:52:08 +08:00
#define nasm_malloc(x) nasm_malloc_log(__FILE__,__LINE__,x)
#define nasm_realloc(x,y) nasm_realloc_log(__FILE__,__LINE__,x,y)
#define nasm_free(x) nasm_free_log(__FILE__,__LINE__,x)
#define nasm_strdup(x) nasm_strdup_log(__FILE__,__LINE__,x)
2002-05-01 04:52:49 +08:00
#define nasm_strndup(x,y) nasm_strndup_log(__FILE__,__LINE__,x,y)
2002-05-01 04:52:08 +08:00
#endif
#endif
2002-05-01 04:51:32 +08:00
/*
* ANSI doesn't guarantee the presence of `stricmp' or
* `strcasecmp'.
*/
2002-05-01 04:59:21 +08:00
#if defined(stricmp) || defined(strcasecmp)
#if defined(stricmp)
#define nasm_stricmp stricmp
#else
#define nasm_stricmp strcasecmp
#endif
#else
int nasm_stricmp(const char *, const char *);
2002-05-01 04:59:21 +08:00
#endif
#if defined(strnicmp) || defined(strncasecmp)
#if defined(strnicmp)
#define nasm_strnicmp strnicmp
#else
#define nasm_strnicmp strncasecmp
#endif
#else
int nasm_strnicmp(const char *, const char *, int);
2002-05-01 04:59:21 +08:00
#endif
2002-05-01 04:51:32 +08:00
#if defined(strsep)
#define nasm_strsep strsep
#else
char *nasm_strsep(char **stringp, const char *delim);
#endif
2002-05-01 04:51:32 +08:00
/*
* Convert a string into a number, using NASM number rules. Sets
* `*error' to TRUE if an error occurs, and FALSE otherwise.
*/
int64_t readnum(char *str, int *error);
2002-05-01 04:51:32 +08:00
2002-05-01 04:53:55 +08:00
/*
* Convert a character constant into a number. Sets
* `*warn' to TRUE if an overflow occurs, and FALSE otherwise.
* str points to and length covers the middle of the string,
* without the quotes.
*/
int64_t readstrnum(char *str, int length, int *warn);
2002-05-01 04:53:55 +08:00
2002-05-01 04:51:32 +08:00
/*
* seg_init: Initialise the segment-number allocator.
* seg_alloc: allocate a hitherto unused segment number.
*/
void seg_init(void);
int32_t seg_alloc(void);
2002-05-01 04:51:32 +08:00
/*
* many output formats will be able to make use of this: a standard
* function to add an extension to the name of the input file
*/
2002-05-01 04:52:08 +08:00
#ifdef NASM_NASM_H
void standard_extension(char *inname, char *outname, char *extension,
2005-01-16 06:15:51 +08:00
efunc error);
2002-05-01 04:52:08 +08:00
#endif
2002-05-01 04:51:32 +08:00
/*
* some handy macros that will probably be of use in more than one
* output format: convert integers into little-endian byte packed
* format in memory
*/
#define WRITECHAR(p,v) \
2002-05-01 04:51:32 +08:00
do { \
*(p)++ = (v) & 0xFF; \
} while (0)
#define WRITESHORT(p,v) \
do { \
WRITECHAR(p,v); \
WRITECHAR(p,(v) >> 8); \
} while (0)
#define WRITELONG(p,v) \
do { \
WRITECHAR(p,v); \
WRITECHAR(p,(v) >> 8); \
WRITECHAR(p,(v) >> 16); \
WRITECHAR(p,(v) >> 24); \
2002-05-01 04:51:32 +08:00
} while (0)
#define WRITEDLONG(p,v) \
do { \
WRITECHAR(p,v); \
WRITECHAR(p,(v) >> 8); \
WRITECHAR(p,(v) >> 16); \
WRITECHAR(p,(v) >> 24); \
WRITECHAR(p,(v) >> 32); \
WRITECHAR(p,(v) >> 40); \
WRITECHAR(p,(v) >> 48); \
WRITECHAR(p,(v) >> 56); \
} while (0)
2002-05-01 04:51:32 +08:00
/*
* and routines to do the same thing to a file
*/
void fwriteint16_t(int data, FILE * fp);
void fwriteint32_t(int32_t data, FILE * fp);
2007-04-28 14:18:48 +08:00
void fwriteint64_t(int64_t data, FILE * fp);
2002-05-01 04:51:32 +08:00
/*
* Routines to manage a dynamic random access array of int32_ts which
2002-05-01 04:51:32 +08:00
* may grow in size to be more than the largest single malloc'able
* chunk.
*/
2005-01-16 06:15:51 +08:00
#define RAA_BLKSIZE 4096 /* this many longs allocated at once */
#define RAA_LAYERSIZE 1024 /* this many _pointers_ allocated */
2002-05-01 04:53:55 +08:00
typedef struct RAA RAA;
typedef union RAA_UNION RAA_UNION;
typedef struct RAA_LEAF RAA_LEAF;
typedef struct RAA_BRANCH RAA_BRANCH;
struct RAA {
/*
* Number of layers below this one to get to the real data. 0
* means this structure is a leaf, holding RAA_BLKSIZE real
* data items; 1 and above mean it's a branch, holding
* RAA_LAYERSIZE pointers to the next level branch or leaf
* structures.
*/
int layers;
/*
* Number of real data items spanned by one position in the
* `data' array at this level. This number is 1, trivially, for
* a leaf (level 0): for a level 1 branch it should be
* RAA_BLKSIZE, and for a level 2 branch it's
* RAA_LAYERSIZE*RAA_BLKSIZE.
*/
int32_t stepsize;
2002-05-01 04:53:55 +08:00
union RAA_UNION {
2005-01-16 06:15:51 +08:00
struct RAA_LEAF {
int32_t data[RAA_BLKSIZE];
2005-01-16 06:15:51 +08:00
} l;
struct RAA_BRANCH {
struct RAA *data[RAA_LAYERSIZE];
} b;
2002-05-01 04:53:55 +08:00
} u;
};
2005-01-16 06:15:51 +08:00
struct RAA *raa_init(void);
void raa_free(struct RAA *);
int32_t raa_read(struct RAA *, int32_t);
struct RAA *raa_write(struct RAA *r, int32_t posn, int32_t value);
2002-05-01 04:51:32 +08:00
/*
* Routines to manage a dynamic sequential-access array, under the
* same restriction on maximum mallocable block. This array may be
* written to in two ways: a contiguous chunk can be reserved of a
* given size with a pointer returned OR single-byte data may be
2002-05-01 04:51:32 +08:00
* written. The array can also be read back in the same two ways:
* as a series of big byte-data blocks or as a list of structures
* of a given size.
*/
2002-05-01 04:53:55 +08:00
struct SAA {
/*
* members `end' and `elem_len' are only valid in first link in
* list; `rptr' and `rpos' are used for reading
*/
struct SAA *next, *end, *rptr;
int32_t elem_len, length, posn, start, rpos;
char *data;
2002-05-01 04:53:55 +08:00
};
2002-05-01 04:51:32 +08:00
struct SAA *saa_init(int32_t elem_len); /* 1 == byte */
2005-01-16 06:15:51 +08:00
void saa_free(struct SAA *);
void *saa_wstruct(struct SAA *); /* return a structure of elem_len */
void saa_wbytes(struct SAA *, const void *, int32_t); /* write arbitrary bytes */
2005-01-16 06:15:51 +08:00
void saa_rewind(struct SAA *); /* for reading from beginning */
void *saa_rstruct(struct SAA *); /* return NULL on EOA */
void *saa_rbytes(struct SAA *, int32_t *); /* return 0 on EOA */
void saa_rnbytes(struct SAA *, void *, int32_t); /* read a given no. of bytes */
void saa_fread(struct SAA *s, int32_t posn, void *p, int32_t len); /* fixup */
void saa_fwrite(struct SAA *s, int32_t posn, void *p, int32_t len); /* fixup */
2005-01-16 06:15:51 +08:00
void saa_fpwrite(struct SAA *, FILE *);
2002-05-01 04:51:32 +08:00
2002-05-01 04:52:49 +08:00
#ifdef NASM_NASM_H
/*
* Library routines to manipulate expression data types.
*/
int is_reloc(expr *);
int is_simple(expr *);
2005-01-16 06:15:51 +08:00
int is_really_simple(expr *);
2002-05-01 04:52:49 +08:00
int is_unknown(expr *);
int is_just_unknown(expr *);
int64_t reloc_value(expr *);
int32_t reloc_seg(expr *);
int32_t reloc_wrt(expr *);
2002-05-01 04:52:49 +08:00
#endif
/*
* Binary search routine. Returns index into `array' of an entry
* matching `string', or <0 if no match. `array' is taken to
* contain `size' elements.
*
* bsi() is case sensitive, bsii() is case insensitive.
2002-05-01 04:52:49 +08:00
*/
int bsi(char *string, const char **array, int size);
int bsii(char *string, const char **array, int size);
2002-05-01 04:53:55 +08:00
char *src_set_fname(char *newname);
int32_t src_set_linnum(int32_t newline);
int32_t src_get_linnum(void);
2002-05-01 04:53:55 +08:00
/*
* src_get may be used if you simply want to know the source file and line.
* It is also used if you maintain private status about the source location
* It return 0 if the information was the same as the last time you
* checked, -1 if the name changed and (new-old) if just the line changed.
*/
int src_get(int32_t *xline, char **xname);
2002-05-01 04:53:55 +08:00
void nasm_quote(char **str);
char *nasm_strcat(char *one, char *two);
2002-05-01 04:53:55 +08:00
void null_debug_routine(const char *directive, const char *params);
2002-05-01 04:53:55 +08:00
extern struct dfmt null_debug_form;
extern struct dfmt *null_debug_arr[2];
const char *prefix_name(int);
2002-05-01 04:51:32 +08:00
#endif