1999-05-03 09:29:11 +02:00
|
|
|
/* cond.c - conditional assembly pseudo-ops, and .include
|
2018-01-03 06:17:27 +01:00
|
|
|
Copyright (C) 1990-2018 Free Software Foundation, Inc.
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
This file is part of GAS, the GNU Assembler.
|
|
|
|
|
|
|
|
GAS is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
2007-07-03 13:01:12 +02:00
|
|
|
the Free Software Foundation; either version 3, or (at your option)
|
1999-05-03 09:29:11 +02:00
|
|
|
any later version.
|
|
|
|
|
|
|
|
GAS 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 GAS; see the file COPYING. If not, write to the Free
|
2005-05-05 11:13:19 +02:00
|
|
|
Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
|
|
|
|
02110-1301, USA. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
#include "as.h"
|
2006-06-07 13:27:58 +02:00
|
|
|
#include "sb.h"
|
1999-05-03 09:29:11 +02:00
|
|
|
#include "macro.h"
|
|
|
|
|
|
|
|
#include "obstack.h"
|
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
/* This is allocated to grow and shrink as .ifdef/.endif pairs are
|
|
|
|
scanned. */
|
1999-05-03 09:29:11 +02:00
|
|
|
struct obstack cond_obstack;
|
|
|
|
|
2018-04-16 17:39:15 +02:00
|
|
|
struct file_line
|
|
|
|
{
|
2016-02-22 15:11:27 +01:00
|
|
|
const char *file;
|
1999-05-03 09:29:11 +02:00
|
|
|
unsigned int line;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* We push one of these structures for each .if, and pop it at the
|
|
|
|
.endif. */
|
|
|
|
|
2018-04-16 17:39:15 +02:00
|
|
|
struct conditional_frame
|
|
|
|
{
|
1999-05-03 09:29:11 +02:00
|
|
|
/* The source file & line number of the "if". */
|
|
|
|
struct file_line if_file_line;
|
|
|
|
/* The source file & line of the "else". */
|
|
|
|
struct file_line else_file_line;
|
|
|
|
/* The previous conditional. */
|
|
|
|
struct conditional_frame *previous_cframe;
|
|
|
|
/* Have we seen an else yet? */
|
|
|
|
int else_seen;
|
|
|
|
/* Whether we are currently ignoring input. */
|
|
|
|
int ignoring;
|
2001-03-31 04:06:24 +02:00
|
|
|
/* Whether a conditional at a higher level is ignoring input.
|
|
|
|
Set also when a branch of an "if .. elseif .." tree has matched
|
|
|
|
to prevent further matches. */
|
1999-05-03 09:29:11 +02:00
|
|
|
int dead_tree;
|
|
|
|
/* Macro nesting level at which this conditional was created. */
|
|
|
|
int macro_nest;
|
|
|
|
};
|
|
|
|
|
2003-11-21 02:52:16 +01:00
|
|
|
static void initialize_cframe (struct conditional_frame *cframe);
|
|
|
|
static char *get_mri_string (int, int *);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
static struct conditional_frame *current_cframe = NULL;
|
|
|
|
|
2002-07-19 13:35:06 +02:00
|
|
|
/* Performs the .ifdef (test_defined == 1) and
|
|
|
|
the .ifndef (test_defined == 0) pseudo op. */
|
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_ifdef (int test_defined)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
2000-09-01 01:17:47 +02:00
|
|
|
/* Points to name of symbol. */
|
2002-07-19 13:35:06 +02:00
|
|
|
char *name;
|
2000-09-01 01:17:47 +02:00
|
|
|
/* Points to symbol. */
|
2002-07-19 13:35:06 +02:00
|
|
|
symbolS *symbolP;
|
1999-05-03 09:29:11 +02:00
|
|
|
struct conditional_frame cframe;
|
2002-07-19 13:35:06 +02:00
|
|
|
char c;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
/* Leading whitespace is part of operand. */
|
|
|
|
SKIP_WHITESPACE ();
|
1999-05-03 09:29:11 +02:00
|
|
|
name = input_line_pointer;
|
|
|
|
|
2015-08-21 17:42:14 +02:00
|
|
|
if (!is_name_beginner (*name) && *name != '"')
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
as_bad (_("invalid identifier for \".ifdef\""));
|
|
|
|
obstack_1grow (&cond_obstack, 0);
|
|
|
|
ignore_rest_of_line ();
|
2002-07-19 13:35:06 +02:00
|
|
|
return;
|
1999-05-03 09:29:11 +02:00
|
|
|
}
|
2002-07-19 13:35:06 +02:00
|
|
|
|
2015-08-21 17:42:14 +02:00
|
|
|
c = get_symbol_name (& name);
|
2002-07-19 13:35:06 +02:00
|
|
|
symbolP = symbol_find (name);
|
2015-08-21 17:42:14 +02:00
|
|
|
(void) restore_line_pointer (c);
|
2002-07-19 13:35:06 +02:00
|
|
|
|
|
|
|
initialize_cframe (&cframe);
|
2013-01-10 20:51:55 +01:00
|
|
|
|
2002-07-19 13:35:06 +02:00
|
|
|
if (cframe.dead_tree)
|
|
|
|
cframe.ignoring = 1;
|
1999-05-03 09:29:11 +02:00
|
|
|
else
|
|
|
|
{
|
2002-07-19 13:35:06 +02:00
|
|
|
int is_defined;
|
|
|
|
|
|
|
|
/* Use the same definition of 'defined' as .equiv so that a symbol
|
|
|
|
which has been referenced but not yet given a value/address is
|
|
|
|
considered to be undefined. */
|
|
|
|
is_defined =
|
|
|
|
symbolP != NULL
|
2005-11-17 08:29:28 +01:00
|
|
|
&& (S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP))
|
2002-07-19 13:35:06 +02:00
|
|
|
&& S_GET_SEGMENT (symbolP) != reg_section;
|
|
|
|
|
|
|
|
cframe.ignoring = ! (test_defined ^ is_defined);
|
|
|
|
}
|
|
|
|
|
2018-04-16 17:39:15 +02:00
|
|
|
current_cframe =
|
|
|
|
(struct conditional_frame *) obstack_alloc (&cond_obstack, sizeof cframe);
|
|
|
|
memcpy (current_cframe, &cframe, sizeof cframe);
|
2002-07-19 13:35:06 +02:00
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& cframe.ignoring
|
|
|
|
&& (cframe.previous_cframe == NULL
|
|
|
|
|| ! cframe.previous_cframe->ignoring))
|
|
|
|
listing_list (2);
|
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
2000-09-01 01:17:47 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_if (int arg)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
expressionS operand;
|
|
|
|
struct conditional_frame cframe;
|
|
|
|
int t;
|
|
|
|
char *stop = NULL;
|
2015-04-28 12:22:57 +02:00
|
|
|
char stopc = 0;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
if (flag_mri)
|
|
|
|
stop = mri_comment_field (&stopc);
|
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
/* Leading whitespace is part of operand. */
|
|
|
|
SKIP_WHITESPACE ();
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
if (current_cframe != NULL && current_cframe->ignoring)
|
|
|
|
{
|
|
|
|
operand.X_add_number = 0;
|
|
|
|
while (! is_end_of_line[(unsigned char) *input_line_pointer])
|
|
|
|
++input_line_pointer;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-10-11 13:16:17 +02:00
|
|
|
expression_and_evaluate (&operand);
|
1999-05-03 09:29:11 +02:00
|
|
|
if (operand.X_op != O_constant)
|
|
|
|
as_bad (_("non-constant expression in \".if\" statement"));
|
|
|
|
}
|
|
|
|
|
|
|
|
switch ((operatorT) arg)
|
|
|
|
{
|
|
|
|
case O_eq: t = operand.X_add_number == 0; break;
|
|
|
|
case O_ne: t = operand.X_add_number != 0; break;
|
|
|
|
case O_lt: t = operand.X_add_number < 0; break;
|
|
|
|
case O_le: t = operand.X_add_number <= 0; break;
|
|
|
|
case O_ge: t = operand.X_add_number >= 0; break;
|
|
|
|
case O_gt: t = operand.X_add_number > 0; break;
|
|
|
|
default:
|
|
|
|
abort ();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If the above error is signaled, this will dispatch
|
|
|
|
using an undefined result. No big deal. */
|
|
|
|
initialize_cframe (&cframe);
|
|
|
|
cframe.ignoring = cframe.dead_tree || ! t;
|
2018-04-16 17:39:15 +02:00
|
|
|
current_cframe =
|
|
|
|
(struct conditional_frame *) obstack_alloc (&cond_obstack, sizeof cframe);
|
|
|
|
memcpy (current_cframe, & cframe, sizeof cframe);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& cframe.ignoring
|
|
|
|
&& (cframe.previous_cframe == NULL
|
|
|
|
|| ! cframe.previous_cframe->ignoring))
|
|
|
|
listing_list (2);
|
|
|
|
|
|
|
|
if (flag_mri)
|
|
|
|
mri_comment_end (stop, stopc);
|
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
2000-09-01 01:17:47 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2005-05-06 08:38:11 +02:00
|
|
|
/* Performs the .ifb (test_blank == 1) and
|
|
|
|
the .ifnb (test_blank == 0) pseudo op. */
|
|
|
|
|
|
|
|
void
|
|
|
|
s_ifb (int test_blank)
|
|
|
|
{
|
|
|
|
struct conditional_frame cframe;
|
|
|
|
|
|
|
|
initialize_cframe (&cframe);
|
2013-01-10 20:51:55 +01:00
|
|
|
|
2005-05-06 08:38:11 +02:00
|
|
|
if (cframe.dead_tree)
|
|
|
|
cframe.ignoring = 1;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
int is_eol;
|
|
|
|
|
|
|
|
SKIP_WHITESPACE ();
|
|
|
|
is_eol = is_end_of_line[(unsigned char) *input_line_pointer];
|
|
|
|
cframe.ignoring = (test_blank == !is_eol);
|
|
|
|
}
|
|
|
|
|
2018-04-16 17:39:15 +02:00
|
|
|
current_cframe =
|
|
|
|
(struct conditional_frame *) obstack_alloc (&cond_obstack, sizeof cframe);
|
|
|
|
memcpy (current_cframe, &cframe, sizeof cframe);
|
2005-05-06 08:38:11 +02:00
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& cframe.ignoring
|
|
|
|
&& (cframe.previous_cframe == NULL
|
|
|
|
|| ! cframe.previous_cframe->ignoring))
|
|
|
|
listing_list (2);
|
|
|
|
|
|
|
|
ignore_rest_of_line ();
|
|
|
|
}
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
/* Get a string for the MRI IFC or IFNC pseudo-ops. */
|
|
|
|
|
|
|
|
static char *
|
2003-11-21 02:52:16 +01:00
|
|
|
get_mri_string (int terminator, int *len)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
char *ret;
|
|
|
|
char *s;
|
|
|
|
|
|
|
|
SKIP_WHITESPACE ();
|
|
|
|
s = ret = input_line_pointer;
|
|
|
|
if (*input_line_pointer == '\'')
|
|
|
|
{
|
|
|
|
++s;
|
|
|
|
++input_line_pointer;
|
|
|
|
while (! is_end_of_line[(unsigned char) *input_line_pointer])
|
|
|
|
{
|
|
|
|
*s++ = *input_line_pointer++;
|
|
|
|
if (s[-1] == '\'')
|
|
|
|
{
|
|
|
|
if (*input_line_pointer != '\'')
|
|
|
|
break;
|
|
|
|
++input_line_pointer;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SKIP_WHITESPACE ();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
while (*input_line_pointer != terminator
|
|
|
|
&& ! is_end_of_line[(unsigned char) *input_line_pointer])
|
|
|
|
++input_line_pointer;
|
|
|
|
s = input_line_pointer;
|
|
|
|
while (s > ret && (s[-1] == ' ' || s[-1] == '\t'))
|
|
|
|
--s;
|
|
|
|
}
|
|
|
|
|
|
|
|
*len = s - ret;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The MRI IFC and IFNC pseudo-ops. */
|
|
|
|
|
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_ifc (int arg)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
char *stop = NULL;
|
2015-04-28 12:22:57 +02:00
|
|
|
char stopc = 0;
|
1999-05-03 09:29:11 +02:00
|
|
|
char *s1, *s2;
|
|
|
|
int len1, len2;
|
|
|
|
int res;
|
|
|
|
struct conditional_frame cframe;
|
|
|
|
|
|
|
|
if (flag_mri)
|
|
|
|
stop = mri_comment_field (&stopc);
|
|
|
|
|
|
|
|
s1 = get_mri_string (',', &len1);
|
|
|
|
|
|
|
|
if (*input_line_pointer != ',')
|
|
|
|
as_bad (_("bad format for ifc or ifnc"));
|
|
|
|
else
|
|
|
|
++input_line_pointer;
|
|
|
|
|
|
|
|
s2 = get_mri_string (';', &len2);
|
|
|
|
|
|
|
|
res = len1 == len2 && strncmp (s1, s2, len1) == 0;
|
|
|
|
|
|
|
|
initialize_cframe (&cframe);
|
|
|
|
cframe.ignoring = cframe.dead_tree || ! (res ^ arg);
|
2018-04-16 17:39:15 +02:00
|
|
|
current_cframe =
|
|
|
|
(struct conditional_frame *) obstack_alloc (&cond_obstack, sizeof cframe);
|
|
|
|
memcpy (current_cframe, &cframe, sizeof cframe);
|
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
1999-05-03 09:29:11 +02:00
|
|
|
&& cframe.ignoring
|
|
|
|
&& (cframe.previous_cframe == NULL
|
|
|
|
|| ! cframe.previous_cframe->ignoring))
|
|
|
|
listing_list (2);
|
|
|
|
|
|
|
|
if (flag_mri)
|
|
|
|
mri_comment_end (stop, stopc);
|
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
|
|
|
}
|
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_elseif (int arg)
|
2000-02-08 15:13:57 +01:00
|
|
|
{
|
|
|
|
if (current_cframe == NULL)
|
|
|
|
{
|
* read.c: Standardize error/warning messages - don't capitalise, no
final period or newline, don't say "ignored" or "zero assumed" for
as_bad messages. In some cases, change the wording to that used
elsewhere for similar messages.
* app.c, as.c, atof-generic.c, cgen.c, cond.c, depend.c, dwarf2dbg.c,
ecoff.c, expr.c, frags.c, input-file.c, input-scrub.c, listing.c,
output-file.c, stabs.c, subsegs.c, symbols.c, write.c: Likewise.
* ecoff.c (ecoff_directive_end): Test for missing name by
comparing input line pointers rather than reading string.
(ecoff_directive_ent): Likewise.
* read.c (s_set): Likewise.
(s_align): Report a warning rather than an error for
alignment too large.
(s_comm): Check for missing symbol name.
(s_lcomm_internal): Likewise.
(s_lsym): Likewise.
(s_globl): Use is_end_of_line instead of looking for '\n'.
(s_lcomm_internal): Likewise.
(ignore_rest_of_line): Report a warning rather than an error.
2001-08-01 03:44:25 +02:00
|
|
|
as_bad (_("\".elseif\" without matching \".if\""));
|
2000-02-08 15:13:57 +01:00
|
|
|
}
|
|
|
|
else if (current_cframe->else_seen)
|
|
|
|
{
|
* read.c: Standardize error/warning messages - don't capitalise, no
final period or newline, don't say "ignored" or "zero assumed" for
as_bad messages. In some cases, change the wording to that used
elsewhere for similar messages.
* app.c, as.c, atof-generic.c, cgen.c, cond.c, depend.c, dwarf2dbg.c,
ecoff.c, expr.c, frags.c, input-file.c, input-scrub.c, listing.c,
output-file.c, stabs.c, subsegs.c, symbols.c, write.c: Likewise.
* ecoff.c (ecoff_directive_end): Test for missing name by
comparing input line pointers rather than reading string.
(ecoff_directive_ent): Likewise.
* read.c (s_set): Likewise.
(s_align): Report a warning rather than an error for
alignment too large.
(s_comm): Check for missing symbol name.
(s_lcomm_internal): Likewise.
(s_lsym): Likewise.
(s_globl): Use is_end_of_line instead of looking for '\n'.
(s_lcomm_internal): Likewise.
(ignore_rest_of_line): Report a warning rather than an error.
2001-08-01 03:44:25 +02:00
|
|
|
as_bad (_("\".elseif\" after \".else\""));
|
2000-02-08 15:13:57 +01:00
|
|
|
as_bad_where (current_cframe->else_file_line.file,
|
|
|
|
current_cframe->else_file_line.line,
|
2011-05-17 18:15:59 +02:00
|
|
|
_("here is the previous \".else\""));
|
2000-02-08 15:13:57 +01:00
|
|
|
as_bad_where (current_cframe->if_file_line.file,
|
|
|
|
current_cframe->if_file_line.line,
|
2011-05-17 18:15:59 +02:00
|
|
|
_("here is the previous \".if\""));
|
2000-02-08 15:13:57 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2016-02-22 15:11:27 +01:00
|
|
|
current_cframe->else_file_line.file
|
|
|
|
= as_where (¤t_cframe->else_file_line.line);
|
2000-02-08 15:13:57 +01:00
|
|
|
|
2001-03-31 08:47:54 +02:00
|
|
|
current_cframe->dead_tree |= !current_cframe->ignoring;
|
|
|
|
current_cframe->ignoring = current_cframe->dead_tree;
|
|
|
|
}
|
2000-02-08 15:13:57 +01:00
|
|
|
|
2001-03-31 04:06:24 +02:00
|
|
|
if (current_cframe == NULL || current_cframe->ignoring)
|
2000-02-08 15:13:57 +01:00
|
|
|
{
|
|
|
|
while (! is_end_of_line[(unsigned char) *input_line_pointer])
|
|
|
|
++input_line_pointer;
|
2001-03-31 08:47:54 +02:00
|
|
|
|
|
|
|
if (current_cframe == NULL)
|
|
|
|
return;
|
2000-02-08 15:13:57 +01:00
|
|
|
}
|
2001-03-31 08:47:54 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
expressionS operand;
|
|
|
|
int t;
|
2001-03-31 04:06:24 +02:00
|
|
|
|
2001-03-31 08:47:54 +02:00
|
|
|
/* Leading whitespace is part of operand. */
|
|
|
|
SKIP_WHITESPACE ();
|
2001-03-31 04:06:24 +02:00
|
|
|
|
2005-10-11 13:16:17 +02:00
|
|
|
expression_and_evaluate (&operand);
|
2001-03-31 08:47:54 +02:00
|
|
|
if (operand.X_op != O_constant)
|
|
|
|
as_bad (_("non-constant expression in \".elseif\" statement"));
|
2000-09-01 01:17:47 +02:00
|
|
|
|
2001-03-31 08:47:54 +02:00
|
|
|
switch ((operatorT) arg)
|
|
|
|
{
|
|
|
|
case O_eq: t = operand.X_add_number == 0; break;
|
|
|
|
case O_ne: t = operand.X_add_number != 0; break;
|
|
|
|
case O_lt: t = operand.X_add_number < 0; break;
|
|
|
|
case O_le: t = operand.X_add_number <= 0; break;
|
|
|
|
case O_ge: t = operand.X_add_number >= 0; break;
|
|
|
|
case O_gt: t = operand.X_add_number > 0; break;
|
|
|
|
default:
|
|
|
|
abort ();
|
|
|
|
return;
|
|
|
|
}
|
2000-02-08 15:13:57 +01:00
|
|
|
|
2001-03-31 08:47:54 +02:00
|
|
|
current_cframe->ignoring = current_cframe->dead_tree || ! t;
|
|
|
|
}
|
2000-02-08 15:13:57 +01:00
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& (current_cframe->previous_cframe == NULL
|
|
|
|
|| ! current_cframe->previous_cframe->ignoring))
|
2001-03-31 08:47:54 +02:00
|
|
|
{
|
|
|
|
if (! current_cframe->ignoring)
|
|
|
|
listing_list (1);
|
|
|
|
else
|
|
|
|
listing_list (2);
|
|
|
|
}
|
2000-02-08 15:13:57 +01:00
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
|
|
|
}
|
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_endif (int arg ATTRIBUTE_UNUSED)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
struct conditional_frame *hold;
|
|
|
|
|
|
|
|
if (current_cframe == NULL)
|
|
|
|
{
|
|
|
|
as_bad (_("\".endif\" without \".if\""));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& current_cframe->ignoring
|
|
|
|
&& (current_cframe->previous_cframe == NULL
|
|
|
|
|| ! current_cframe->previous_cframe->ignoring))
|
|
|
|
listing_list (1);
|
|
|
|
|
|
|
|
hold = current_cframe;
|
|
|
|
current_cframe = current_cframe->previous_cframe;
|
|
|
|
obstack_free (&cond_obstack, hold);
|
|
|
|
} /* if one pop too many */
|
|
|
|
|
|
|
|
if (flag_mri)
|
|
|
|
{
|
|
|
|
while (! is_end_of_line[(unsigned char) *input_line_pointer])
|
|
|
|
++input_line_pointer;
|
|
|
|
}
|
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
2000-09-01 01:17:47 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_else (int arg ATTRIBUTE_UNUSED)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
if (current_cframe == NULL)
|
|
|
|
{
|
* read.c: Standardize error/warning messages - don't capitalise, no
final period or newline, don't say "ignored" or "zero assumed" for
as_bad messages. In some cases, change the wording to that used
elsewhere for similar messages.
* app.c, as.c, atof-generic.c, cgen.c, cond.c, depend.c, dwarf2dbg.c,
ecoff.c, expr.c, frags.c, input-file.c, input-scrub.c, listing.c,
output-file.c, stabs.c, subsegs.c, symbols.c, write.c: Likewise.
* ecoff.c (ecoff_directive_end): Test for missing name by
comparing input line pointers rather than reading string.
(ecoff_directive_ent): Likewise.
* read.c (s_set): Likewise.
(s_align): Report a warning rather than an error for
alignment too large.
(s_comm): Check for missing symbol name.
(s_lcomm_internal): Likewise.
(s_lsym): Likewise.
(s_globl): Use is_end_of_line instead of looking for '\n'.
(s_lcomm_internal): Likewise.
(ignore_rest_of_line): Report a warning rather than an error.
2001-08-01 03:44:25 +02:00
|
|
|
as_bad (_("\".else\" without matching \".if\""));
|
1999-05-03 09:29:11 +02:00
|
|
|
}
|
|
|
|
else if (current_cframe->else_seen)
|
|
|
|
{
|
2011-05-17 18:15:59 +02:00
|
|
|
as_bad (_("duplicate \".else\""));
|
1999-05-03 09:29:11 +02:00
|
|
|
as_bad_where (current_cframe->else_file_line.file,
|
|
|
|
current_cframe->else_file_line.line,
|
2011-05-17 18:15:59 +02:00
|
|
|
_("here is the previous \".else\""));
|
1999-05-03 09:29:11 +02:00
|
|
|
as_bad_where (current_cframe->if_file_line.file,
|
|
|
|
current_cframe->if_file_line.line,
|
2011-05-17 18:15:59 +02:00
|
|
|
_("here is the previous \".if\""));
|
1999-05-03 09:29:11 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2016-02-22 15:11:27 +01:00
|
|
|
current_cframe->else_file_line.file
|
|
|
|
= as_where (¤t_cframe->else_file_line.line);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2001-03-31 08:47:54 +02:00
|
|
|
current_cframe->ignoring =
|
|
|
|
current_cframe->dead_tree | !current_cframe->ignoring;
|
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& (current_cframe->previous_cframe == NULL
|
|
|
|
|| ! current_cframe->previous_cframe->ignoring))
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
2001-03-31 08:47:54 +02:00
|
|
|
if (! current_cframe->ignoring)
|
|
|
|
listing_list (1);
|
|
|
|
else
|
|
|
|
listing_list (2);
|
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
current_cframe->else_seen = 1;
|
2001-03-31 08:47:54 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
if (flag_mri)
|
|
|
|
{
|
|
|
|
while (! is_end_of_line[(unsigned char) *input_line_pointer])
|
|
|
|
++input_line_pointer;
|
|
|
|
}
|
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
2000-09-01 01:17:47 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
s_ifeqs (int arg)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
char *s1, *s2;
|
|
|
|
int len1, len2;
|
|
|
|
int res;
|
|
|
|
struct conditional_frame cframe;
|
|
|
|
|
|
|
|
s1 = demand_copy_C_string (&len1);
|
|
|
|
|
|
|
|
SKIP_WHITESPACE ();
|
|
|
|
if (*input_line_pointer != ',')
|
|
|
|
{
|
|
|
|
as_bad (_(".ifeqs syntax error"));
|
|
|
|
ignore_rest_of_line ();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
++input_line_pointer;
|
|
|
|
|
|
|
|
s2 = demand_copy_C_string (&len2);
|
|
|
|
|
|
|
|
res = len1 == len2 && strncmp (s1, s2, len1) == 0;
|
|
|
|
|
|
|
|
initialize_cframe (&cframe);
|
|
|
|
cframe.ignoring = cframe.dead_tree || ! (res ^ arg);
|
2018-04-16 17:39:15 +02:00
|
|
|
current_cframe =
|
|
|
|
(struct conditional_frame *) obstack_alloc (&cond_obstack, sizeof cframe);
|
|
|
|
memcpy (current_cframe, &cframe, sizeof cframe);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
if (LISTING_SKIP_COND ()
|
|
|
|
&& cframe.ignoring
|
|
|
|
&& (cframe.previous_cframe == NULL
|
|
|
|
|| ! cframe.previous_cframe->ignoring))
|
|
|
|
listing_list (2);
|
|
|
|
|
|
|
|
demand_empty_rest_of_line ();
|
2000-09-01 01:17:47 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
int
|
2003-11-21 02:52:16 +01:00
|
|
|
ignore_input (void)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
char *s;
|
|
|
|
|
|
|
|
s = input_line_pointer;
|
|
|
|
|
2000-02-24 02:56:31 +01:00
|
|
|
if (NO_PSEUDO_DOT || flag_m68k_mri)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
if (s[-1] != '.')
|
|
|
|
--s;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (s[-1] != '.')
|
|
|
|
return (current_cframe != NULL) && (current_cframe->ignoring);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We cannot ignore certain pseudo ops. */
|
|
|
|
if (((s[0] == 'i'
|
|
|
|
|| s[0] == 'I')
|
|
|
|
&& (!strncasecmp (s, "if", 2)
|
|
|
|
|| !strncasecmp (s, "ifdef", 5)
|
|
|
|
|| !strncasecmp (s, "ifndef", 6)))
|
|
|
|
|| ((s[0] == 'e'
|
|
|
|
|| s[0] == 'E')
|
|
|
|
&& (!strncasecmp (s, "else", 4)
|
|
|
|
|| !strncasecmp (s, "endif", 5)
|
|
|
|
|| !strncasecmp (s, "endc", 4))))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return (current_cframe != NULL) && (current_cframe->ignoring);
|
2000-09-01 01:17:47 +02:00
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
2000-09-01 01:17:47 +02:00
|
|
|
static void
|
2003-11-21 02:52:16 +01:00
|
|
|
initialize_cframe (struct conditional_frame *cframe)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
memset (cframe, 0, sizeof (*cframe));
|
2016-02-22 15:11:27 +01:00
|
|
|
cframe->if_file_line.file
|
|
|
|
= as_where (&cframe->if_file_line.line);
|
1999-05-03 09:29:11 +02:00
|
|
|
cframe->previous_cframe = current_cframe;
|
|
|
|
cframe->dead_tree = current_cframe != NULL && current_cframe->ignoring;
|
|
|
|
cframe->macro_nest = macro_nest;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Give an error if a conditional is unterminated inside a macro or
|
|
|
|
the assembly as a whole. If NEST is non negative, we are being
|
|
|
|
called because of the end of a macro expansion. If NEST is
|
|
|
|
negative, we are being called at the of the input files. */
|
|
|
|
|
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
cond_finish_check (int nest)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
if (current_cframe != NULL && current_cframe->macro_nest >= nest)
|
|
|
|
{
|
|
|
|
if (nest >= 0)
|
|
|
|
as_bad (_("end of macro inside conditional"));
|
|
|
|
else
|
|
|
|
as_bad (_("end of file inside conditional"));
|
2018-04-16 17:39:15 +02:00
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
as_bad_where (current_cframe->if_file_line.file,
|
|
|
|
current_cframe->if_file_line.line,
|
|
|
|
_("here is the start of the unterminated conditional"));
|
|
|
|
if (current_cframe->else_seen)
|
|
|
|
as_bad_where (current_cframe->else_file_line.file,
|
|
|
|
current_cframe->else_file_line.line,
|
|
|
|
_("here is the \"else\" of the unterminated conditional"));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This function is called when we exit out of a macro. We assume
|
|
|
|
that any conditionals which began within the macro are correctly
|
|
|
|
nested, and just pop them off the stack. */
|
|
|
|
|
|
|
|
void
|
2003-11-21 02:52:16 +01:00
|
|
|
cond_exit_macro (int nest)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
while (current_cframe != NULL && current_cframe->macro_nest >= nest)
|
|
|
|
{
|
|
|
|
struct conditional_frame *hold;
|
|
|
|
|
|
|
|
hold = current_cframe;
|
|
|
|
current_cframe = current_cframe->previous_cframe;
|
|
|
|
obstack_free (&cond_obstack, hold);
|
|
|
|
}
|
|
|
|
}
|