2016-05-25 20:42:47 +08:00
|
|
|
/* ----------------------------------------------------------------------- *
|
|
|
|
*
|
|
|
|
* Copyright 1996-2016 The NASM Authors - All Rights Reserved
|
|
|
|
* See the file AUTHORS included with the NASM distribution for
|
|
|
|
* the specific copyright holders.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following
|
|
|
|
* conditions are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT OWNER 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.
|
|
|
|
*
|
|
|
|
* ----------------------------------------------------------------------- */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nasmlib.c library routines for the Netwide Assembler
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "compiler.h"
|
|
|
|
#include "nasmlib.h"
|
2018-11-29 06:55:58 +08:00
|
|
|
#include "nctype.h"
|
2016-05-25 20:42:47 +08:00
|
|
|
|
|
|
|
#ifndef nasm_stricmp
|
|
|
|
int nasm_stricmp(const char *s1, const char *s2)
|
|
|
|
{
|
|
|
|
unsigned char c1, c2;
|
|
|
|
int d;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
c1 = nasm_tolower(*s1++);
|
|
|
|
c2 = nasm_tolower(*s2++);
|
|
|
|
d = c1-c2;
|
|
|
|
|
|
|
|
if (d)
|
|
|
|
return d;
|
|
|
|
if (!c1)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef nasm_strnicmp
|
|
|
|
int nasm_strnicmp(const char *s1, const char *s2, size_t n)
|
|
|
|
{
|
|
|
|
unsigned char c1, c2;
|
|
|
|
int d;
|
|
|
|
|
|
|
|
while (n--) {
|
|
|
|
c1 = nasm_tolower(*s1++);
|
|
|
|
c2 = nasm_tolower(*s2++);
|
|
|
|
d = c1-c2;
|
|
|
|
|
|
|
|
if (d)
|
|
|
|
return d;
|
|
|
|
if (!c1)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int nasm_memicmp(const char *s1, const char *s2, size_t n)
|
|
|
|
{
|
|
|
|
unsigned char c1, c2;
|
|
|
|
int d;
|
|
|
|
|
|
|
|
while (n--) {
|
|
|
|
c1 = nasm_tolower(*s1++);
|
|
|
|
c2 = nasm_tolower(*s2++);
|
|
|
|
d = c1-c2;
|
|
|
|
if (d)
|
|
|
|
return d;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef nasm_strsep
|
|
|
|
char *nasm_strsep(char **stringp, const char *delim)
|
|
|
|
{
|
|
|
|
char *s = *stringp;
|
|
|
|
char *e;
|
|
|
|
|
|
|
|
if (!s)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
e = strpbrk(s, delim);
|
|
|
|
if (e)
|
|
|
|
*e++ = '\0';
|
|
|
|
|
|
|
|
*stringp = e;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* skip leading spaces */
|
|
|
|
char *nasm_skip_spaces(const char *p)
|
|
|
|
{
|
|
|
|
if (p)
|
|
|
|
while (*p && nasm_isspace(*p))
|
|
|
|
p++;
|
|
|
|
return (char *)p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* skip leading non-spaces */
|
|
|
|
char *nasm_skip_word(const char *p)
|
|
|
|
{
|
|
|
|
if (p)
|
|
|
|
while (*p && !nasm_isspace(*p))
|
|
|
|
p++;
|
|
|
|
return (char *)p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* zap leading spaces with zero */
|
|
|
|
char *nasm_zap_spaces_fwd(char *p)
|
|
|
|
{
|
|
|
|
if (p)
|
|
|
|
while (*p && nasm_isspace(*p))
|
|
|
|
*p++ = 0x0;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* zap spaces with zero in reverse order */
|
|
|
|
char *nasm_zap_spaces_rev(char *p)
|
|
|
|
{
|
|
|
|
if (p)
|
|
|
|
while (*p && nasm_isspace(*p))
|
|
|
|
*p-- = 0x0;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* zap leading and trailing spaces */
|
|
|
|
char *nasm_trim_spaces(char *p)
|
|
|
|
{
|
|
|
|
p = nasm_zap_spaces_fwd(p);
|
|
|
|
nasm_zap_spaces_fwd(nasm_skip_word(p));
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* return the word extracted from a stream
|
|
|
|
* or NULL if nothing left
|
|
|
|
*/
|
|
|
|
char *nasm_get_word(char *p, char **tail)
|
|
|
|
{
|
|
|
|
char *word = nasm_skip_spaces(p);
|
|
|
|
char *next = nasm_skip_word(word);
|
|
|
|
|
|
|
|
if (word && *word) {
|
|
|
|
if (*next)
|
|
|
|
*next++ = '\0';
|
|
|
|
} else
|
|
|
|
word = next = NULL;
|
|
|
|
|
|
|
|
/* NOTE: the tail may start with spaces */
|
|
|
|
*tail = next;
|
|
|
|
|
|
|
|
return word;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Extract "opt=val" values from the stream and
|
|
|
|
* returns "opt"
|
|
|
|
*
|
|
|
|
* Exceptions:
|
|
|
|
* 1) If "=val" passed the NULL returned though
|
|
|
|
* you may continue handling the tail via "next"
|
|
|
|
* 2) If "=" passed the NULL is returned and "val"
|
|
|
|
* is set to NULL as well
|
|
|
|
*/
|
|
|
|
char *nasm_opt_val(char *p, char **val, char **next)
|
|
|
|
{
|
|
|
|
char *q, *nxt;
|
|
|
|
|
|
|
|
*val = *next = NULL;
|
|
|
|
|
|
|
|
p = nasm_get_word(p, &nxt);
|
|
|
|
if (!p)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
q = strchr(p, '=');
|
|
|
|
if (q) {
|
|
|
|
if (q == p)
|
|
|
|
p = NULL;
|
|
|
|
*q++='\0';
|
|
|
|
if (*q) {
|
|
|
|
*val = q;
|
|
|
|
} else {
|
|
|
|
q = nasm_get_word(q + 1, &nxt);
|
|
|
|
if (q)
|
|
|
|
*val = q;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
q = nasm_skip_spaces(nxt);
|
|
|
|
if (q && *q == '=') {
|
|
|
|
q = nasm_get_word(q + 1, &nxt);
|
|
|
|
if (q)
|
|
|
|
*val = q;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*next = nxt;
|
|
|
|
return p;
|
|
|
|
}
|