static char *
string_format( char *str, int *retlen, int refcon )
{
int on=0, len=0, add;
char ch;
while( sscanf(str,"%c%n\n", &ch, &add) > 0 ) {
str+=add;
if( ch == '"' ) {
on=!on;
continue;
}
if( on ) {
obstack_1grow( &oftree.stack, ch );
len++;
} else if( ch == ',' ){
obstack_1grow( &oftree.stack, 0 );
len++;
}
}
obstack_1grow( &oftree.stack, 0 );
len++;
*retlen = len;
return obstack_finish( &oftree.stack );
}
static void
mangle_pointer_type (tree type)
{
int match;
tree pointer_type;
/* Search for the type already in the compression table */
if ((match = find_compression_pointer_match (type)) >= 0)
{
emit_compression_string (match);
return;
}
/* This didn't work. We start by mangling the pointed-to type */
pointer_type = type;
type = TREE_TYPE (type);
gcc_assert (TREE_CODE (type) == RECORD_TYPE);
obstack_1grow (mangle_obstack, 'P');
if (mangle_record_type (type, /* for_pointer = */ 1))
obstack_1grow (mangle_obstack, 'E');
/* Don't forget to insert the pointer type in the table */
compression_table_add (pointer_type);
}
/* Read NUL-separated tokens from stream IN into T until EOF or error.
The final NUL is optional. Always append a NULL pointer to the
resulting list of token pointers, but that pointer isn't counted
via t->n_tok. Return true if successful. */
bool
readtokens0 (FILE *in, struct Tokens *t)
{
while (1)
{
int c = fgetc (in);
if (c == EOF)
{
size_t len = obstack_object_size (&t->o_data);
/* If the current object has nonzero length, then there
was no NUL byte at EOF -- or maybe there was an error,
in which case, we need to append a NUL byte to our buffer. */
if (len)
{
obstack_1grow (&t->o_data, '\0');
save_token (t);
}
break;
}
obstack_1grow (&t->o_data, c);
if (c == '\0')
save_token (t);
}
/* Add a NULL pointer at the end, in case the caller (like du)
requires an argv-style array of strings. */
obstack_ptr_grow (&t->o_tok, NULL);
t->tok = obstack_finish (&t->o_tok);
t->tok_len = obstack_finish (&t->o_tok_len);
return ! ferror (in);
}
static void
acls_one_line (const char *prefix, char delim,
const char *aclstring, size_t len)
{
/* support both long and short text representation of posix acls */
struct obstack stk;
int pref_len = strlen (prefix);
const char *oldstring = aclstring;
int pos = 0;
if (!aclstring || !len)
return;
obstack_init (&stk);
while (pos <= len)
{
int move = strcspn (aclstring, ",\n");
if (!move)
break;
if (oldstring != aclstring)
obstack_1grow (&stk, delim);
obstack_grow (&stk, prefix, pref_len);
obstack_grow (&stk, aclstring, move);
aclstring += move + 1;
}
obstack_1grow (&stk, '\0');
fprintf (stdlis, "%s", (char *) obstack_finish (&stk));
obstack_free (&stk, NULL);
}
/* Read a braced string (a la Tcl) onto the obstack. Caller has
scanned the leading brace. Note that unlike quoted strings,
the outermost braces _are_ included in the string constant. */
static char *
read_braced_string (struct obstack *ob, FILE *infile)
{
int c;
int brace_depth = 1; /* caller-processed */
unsigned long starting_read_rtx_lineno = read_rtx_lineno;
obstack_1grow (ob, '{');
while (brace_depth)
{
c = getc (infile); /* Read the string */
if (c == '\n')
read_rtx_lineno++;
else if (c == '{')
brace_depth++;
else if (c == '}')
brace_depth--;
else if (c == '\\')
{
read_escape (ob, infile);
continue;
}
else if (c == EOF)
fatal_with_file_and_line
(infile, "missing closing } for opening brace on line %lu",
starting_read_rtx_lineno);
obstack_1grow (ob, c);
}
obstack_1grow (ob, 0);
return obstack_finish (ob);
}
static void
prepare_symbols (void)
{
MUSCLE_INSERT_INT ("tokens_number", ntokens);
MUSCLE_INSERT_INT ("nterms_number", nvars);
MUSCLE_INSERT_INT ("symbols_number", nsyms);
MUSCLE_INSERT_INT ("undef_token_number", undeftoken->number);
MUSCLE_INSERT_INT ("user_token_number_max", max_user_token_number);
muscle_insert_symbol_number_table ("translate",
token_translations,
token_translations[0],
1, max_user_token_number + 1);
/* tname -- token names. */
{
int i;
/* We assume that the table will be output starting at column 2. */
int j = 2;
struct quoting_options *qo = clone_quoting_options (0);
set_quoting_style (qo, c_quoting_style);
set_quoting_flags (qo, QA_SPLIT_TRIGRAPHS);
for (i = 0; i < nsyms; i++)
{
char *cp = quotearg_alloc (symbols[i]->tag, -1, qo);
/* Width of the next token, including the two quotes, the
comma and the space. */
int width = strlen (cp) + 2;
if (j + width > 75)
{
obstack_sgrow (&format_obstack, "\n ");
j = 1;
}
if (i)
obstack_1grow (&format_obstack, ' ');
obstack_escape (&format_obstack, cp);
free (cp);
obstack_1grow (&format_obstack, ',');
j += width;
}
free (qo);
obstack_sgrow (&format_obstack, " ]b4_null[");
/* Finish table and store. */
muscle_insert ("tname", obstack_finish0 (&format_obstack));
}
/* Output YYTOKNUM. */
{
int i;
int *values = xnmalloc (ntokens, sizeof *values);
for (i = 0; i < ntokens; ++i)
values[i] = symbols[i]->user_token_number;
muscle_insert_int_table ("toknum", values,
values[0], 1, ntokens);
free (values);
}
}
static void
prepare_symbols (void)
{
MUSCLE_INSERT_BOOL ("token_table", token_table_flag);
MUSCLE_INSERT_INT ("tokens_number", ntokens);
MUSCLE_INSERT_INT ("nterms_number", nvars);
MUSCLE_INSERT_INT ("undef_token_number", undeftoken->number);
MUSCLE_INSERT_INT ("user_token_number_max", max_user_token_number);
muscle_insert_symbol_number_table ("translate",
token_translations,
token_translations[0],
1, max_user_token_number + 1);
/* tname -- token names. */
{
int i;
/* We assume that the table will be output starting at column 2. */
int j = 2;
for (i = 0; i < nsyms; i++)
{
char const *cp = quotearg_style (c_quoting_style, symbols[i]->tag);
/* Width of the next token, including the two quotes, the
comma and the space. */
int width = strlen (cp) + 2;
if (j + width > 75)
{
obstack_sgrow (&format_obstack, "\n ");
j = 1;
}
if (i)
obstack_1grow (&format_obstack, ' ');
MUSCLE_OBSTACK_SGROW (&format_obstack, cp);
obstack_1grow (&format_obstack, ',');
j += width;
}
/* Add a NULL entry to list of tokens (well, 0, as NULL might not be
defined). */
obstack_sgrow (&format_obstack, " 0");
/* Finish table and store. */
obstack_1grow (&format_obstack, 0);
muscle_insert ("tname", obstack_finish (&format_obstack));
}
/* Output YYTOKNUM. */
{
int i;
int *values = xnmalloc (ntokens, sizeof *values);
for (i = 0; i < ntokens; ++i)
values[i] = symbols[i]->user_token_number;
muscle_insert_int_table ("toknum", values,
values[0], 1, ntokens);
free (values);
}
}
static char *
obstack_fgets (FILE *stream, struct obstack *ob)
{
int c;
while ((c = getc (stream)) != EOF && c != '\n')
obstack_1grow (ob, c);
if (obstack_object_size (ob) == 0)
return NULL;
obstack_1grow (ob, '\0');
return obstack_finish (ob);
}
static void
mangle_array_type (tree p_type)
{
tree type, elt_type;
int match;
type = TREE_TYPE (p_type);
gcc_assert (type);
elt_type = TYPE_ARRAY_ELEMENT (type);
/* We cache a bit of the Jarray <> mangle. */
if (!atms)
{
atms = get_identifier ("6JArray");
}
/* Maybe we have what we're looking for in the compression table. */
if ((match = find_compression_array_match (p_type)) >= 0)
{
emit_compression_string (match);
return;
}
/* We know for a fact that all arrays are pointers */
obstack_1grow (mangle_obstack, 'P');
/* Maybe we already have a Jarray<t> somewhere. PSx_ will be enough. */
if ((match = find_compression_record_match (type, NULL)) > 0)
{
emit_compression_string (match);
return;
}
/* Maybe we already have just JArray somewhere */
if ((match = find_compression_array_template_match (atms)) > 0)
emit_compression_string (match);
else
{
/* Start the template mangled name */
obstack_grow (mangle_obstack,
IDENTIFIER_POINTER (atms), IDENTIFIER_LENGTH (atms));
/* Insert in the compression table */
compression_table_add (atms);
}
/* Mangle Jarray <elt_type> */
obstack_1grow (mangle_obstack, 'I');
mangle_type (elt_type);
obstack_1grow (mangle_obstack, 'E');
/* Add `Jarray <elt_type>' and `Jarray <elt_type> *' to the table */
compression_table_add (type);
compression_table_add (p_type);
}
static int
recompile_files (void)
{
file *f;
putenv (xstrdup ("COMPILER_PATH="));
putenv (xstrdup ("LIBRARY_PATH="));
while ((f = file_pop ()) != NULL)
{
char *line, *command;
FILE *stream = fopen (f->key, "r");
const char *const outname = frob_extension (f->key, ".rnw");
FILE *output = fopen (outname, "w");
while ((line = tfgets (stream)) != NULL)
{
switch (line[0])
{
case 'C':
case 'O':
maybe_tweak (line, f);
}
fprintf (output, "%s\n", line);
}
fclose (stream);
fclose (output);
rename (outname, f->key);
obstack_grow (&temporary_obstack, "cd ", 3);
obstack_grow (&temporary_obstack, f->dir, strlen (f->dir));
obstack_grow (&temporary_obstack, "; ", 2);
obstack_grow (&temporary_obstack, c_file_name, strlen (c_file_name));
obstack_1grow (&temporary_obstack, ' ');
obstack_grow (&temporary_obstack, f->args, strlen (f->args));
obstack_1grow (&temporary_obstack, ' ');
command = obstack_copy0 (&temporary_obstack, f->main, strlen (f->main));
if (tlink_verbose)
fprintf (stderr, _("collect: recompiling %s\n"), f->main);
if (tlink_verbose >= 3)
fprintf (stderr, "%s\n", command);
if (system (command) != 0)
return 0;
read_repo_file (f);
obstack_free (&temporary_obstack, temporary_firstobj);
}
return 1;
}
/* Read a nul-terminated string from FP and store it in STK.
Store the number of bytes read (including nul terminator) in PCOUNT.
Return the last character read or EOF on end of file. */
static int
read_obstack (FILE *fp, struct obstack *stk, size_t *pcount)
{
int c;
size_t i;
for (i = 0, c = getc (fp); c != EOF && c != 0; c = getc (fp), i++)
obstack_1grow (stk, c);
obstack_1grow (stk, 0);
*pcount = i;
return c;
}
static void
set_conflicts (state *s, symbol **errors)
{
int i;
transitions *trans = s->transitions;
reductions *reds = s->reductions;
int nerrs = 0;
if (s->consistent)
return;
bitset_zero (lookahead_set);
FOR_EACH_SHIFT (trans, i)
bitset_set (lookahead_set, TRANSITION_SYMBOL (trans, i));
/* Loop over all rules which require lookahead in this state. First
check for shift-reduce conflict, and try to resolve using
precedence. */
for (i = 0; i < reds->num; ++i)
if (reds->rules[i]->prec && reds->rules[i]->prec->prec
&& !bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set))
resolve_sr_conflict (s, i, errors, &nerrs);
if (nerrs)
{
/* Some tokens have been explicitly made errors. Allocate a
permanent errs structure for this state, to record them. */
state_errs_set (s, nerrs, errors);
}
if (obstack_object_size (&solved_conflicts_obstack))
{
obstack_1grow (&solved_conflicts_obstack, '\0');
s->solved_conflicts = obstack_finish (&solved_conflicts_obstack);
}
if (obstack_object_size (&solved_conflicts_xml_obstack))
{
obstack_1grow (&solved_conflicts_xml_obstack, '\0');
s->solved_conflicts_xml = obstack_finish (&solved_conflicts_xml_obstack);
}
/* Loop over all rules which require lookahead in this state. Check
for conflicts not resolved above. */
for (i = 0; i < reds->num; ++i)
{
if (!bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set))
conflicts[s->number] = 1;
bitset_or (lookahead_set, lookahead_set, reds->lookahead_tokens[i]);
}
}
static void
append_unicode_mangled_name (const char *name, int len)
{
const unsigned char *ptr;
const unsigned char *limit = (const unsigned char *)name + len;
int uuU = 0;
for (ptr = (const unsigned char *) name; ptr < limit; )
{
int ch = UTF8_GET(ptr, limit);
if ((ISALNUM (ch) && ch != 'U') || ch == '$')
{
obstack_1grow (mangle_obstack, ch);
uuU = 0;
}
/* Everything else needs encoding */
else
{
/* Buffer large enough for UINT_MAX plus the prefix. */
char buf [13];
if (ch == '_' || ch == 'U')
{
/* Prepare to recognize __U */
if (ch == '_' && (uuU < 3))
{
uuU++;
obstack_1grow (mangle_obstack, ch);
}
/* We recognize __U that we wish to encode
__U_. Finish the encoding. */
else if (ch == 'U' && (uuU == 2))
{
uuU = 0;
obstack_grow (mangle_obstack, "U_", 2);
}
/* Otherwise, just reset uuU and emit the character we
have. */
else
{
uuU = 0;
obstack_1grow (mangle_obstack, ch);
}
continue;
}
sprintf (buf, "__U%x_", ch);
obstack_grow (mangle_obstack, buf, strlen (buf));
uuU = 0;
}
}
}
/* Subroutine of the string readers. Handles backslash escapes.
Caller has read the backslash, but not placed it into the obstack. */
static void
read_escape (struct obstack *ob, FILE *infile)
{
int c = getc (infile);
switch (c)
{
/* Backslash-newline is replaced by nothing, as in C. */
case '\n':
read_rtx_lineno++;
return;
/* \" \' \\ are replaced by the second character. */
case '\\':
case '"':
case '\'':
break;
/* Standard C string escapes:
\a \b \f \n \r \t \v
\[0-7] \x
all are passed through to the output string unmolested.
In normal use these wind up in a string constant processed
by the C compiler, which will translate them appropriately.
We do not bother checking that \[0-7] are followed by up to
two octal digits, or that \x is followed by N hex digits.
\? \u \U are left out because they are not in traditional C. */
case 'a': case 'b': case 'f': case 'n': case 'r': case 't': case 'v':
case '0': case '1': case '2': case '3': case '4': case '5': case '6':
case '7': case 'x':
obstack_1grow (ob, '\\');
break;
/* \; makes stuff for a C string constant containing
newline and tab. */
case ';':
obstack_grow (ob, "\\n\\t", 4);
return;
/* pass anything else through, but issue a warning. */
default:
fprintf (stderr, "%s:%d: warning: unrecognized escape \\%c\n",
read_rtx_filename, read_rtx_lineno, c);
obstack_1grow (ob, '\\');
break;
}
obstack_1grow (ob, c);
}
static void
obstack_code_rename (struct obstack *stk, char *from, char *to)
{
char *s;
s = from[0] == 0 ? from :
safer_name_suffix (from, false, absolute_names_option);
obstack_1grow (stk, 'R');
obstack_grow (stk, s, strlen (s) + 1);
s = to[0] == 0 ? to:
safer_name_suffix (to, false, absolute_names_option);
obstack_1grow (stk, 'T');
obstack_grow (stk, s, strlen (s) + 1);
}
void
read_file_verbatim (struct obstack *obs)
{
int ch;
int (*f)(void);
struct obstack *st;
if (next != NULL)
st = obs;
else
st = push_string_init ();
f = isp->funcs->read_func;
if (f != NULL)
{
while ((ch = (*f)()) != CHAR_RETRY)
obstack_1grow (st, ch);
}
else
{
MP4HERROR ((warning_status, 0,
"INTERNAL ERROR: Input stack botch in read_file_verbatim ()"));
exit (1);
}
push_string_finish (READ_BODY);
}
static char *
read_string (struct obstack *ob, FILE *infile, int star_if_braced)
{
char *stringbuf;
int saw_paren = 0;
int c;
c = read_skip_spaces (infile);
if (c == '(')
{
saw_paren = 1;
c = read_skip_spaces (infile);
}
if (c == '"')
stringbuf = read_quoted_string (ob, infile);
else if (c == '{')
{
if (star_if_braced)
obstack_1grow (ob, '*');
stringbuf = read_braced_string (ob, infile);
}
else
fatal_with_file_and_line (infile, "expected `\"' or `{', found `%c'", c);
if (saw_paren)
{
c = read_skip_spaces (infile);
if (c != ')')
fatal_expected_char (infile, ')', c);
}
return stringbuf;
}
static int obst_chadd(lc_appendable_t *obj, int ch)
{
struct obstack *obst = (struct obstack*)obj->obj;
obstack_1grow(obst, (char) ch);
obj->written++;
return 1;
}
const char *
push_string_finish (read_type expansion)
{
const char *ret = NULL;
if (next == NULL)
return NULL;
if (obstack_object_size (current_input) > 0)
{
obstack_1grow (current_input, '\0');
next->u.u_s.start = (unsigned char *) obstack_finish (current_input);
if (expansion == READ_ATTR_VERB || expansion == READ_ATTR_ASIS
|| expansion == READ_BODY)
{
TOKEN_DATA_TYPE (&token_read) = TOKEN_TEXT;
TOKEN_DATA_TEXT (&token_read) = xstrdup ((char *) next->u.u_s.start);
next->u.u_s.current = next->u.u_s.start + strlen ((char *) next->u.u_s.start);
}
else
next->u.u_s.current = next->u.u_s.start;
next->prev = isp;
isp = next;
ret = (char *) isp->u.u_s.start; /* for immediate use only */
}
else
obstack_free (current_input, next); /* people might leave garbage on it. */
next = NULL;
return ret;
}
void
append_incremental_renames (struct directory *dir)
{
struct obstack stk;
size_t size;
struct directory *dp;
const char *dump;
if (dirhead == NULL)
return;
obstack_init (&stk);
dump = directory_contents (dir);
if (dump)
{
size = dumpdir_size (dump) - 1;
obstack_grow (&stk, dump, size);
}
else
size = 0;
for (dp = dirhead; dp; dp = dp->next)
store_rename (dp, &stk);
if (obstack_object_size (&stk) != size)
{
obstack_1grow (&stk, 0);
dumpdir_free (dir->dump);
dir->dump = dumpdir_create (obstack_finish (&stk));
}
obstack_free (&stk, NULL);
}
static void
mangle_vtable (tree type)
{
MANGLE_RAW_STRING ("TV");
mangle_record_type (type, /* for_pointer = */ 0);
obstack_1grow (mangle_obstack, 'E');
}
static void eval_link(char *pid, char *link_rel, enum field field, char **ptr,
char *format_str, struct obstack *mem_pool)
{
char *link_file, *link;
/* path to the link file like. /proc/{pid}/{link_rel} */
link_file = proc_pid_file(pid, link_rel, mem_pool);
/* It's okay to use canonicalize_file_name instead of readlink on linux
* for the cwd symlink, since on linux the links we care about will never
* be relative links (cwd, exec)
* Doing this because readlink works on static buffers */
link = canonicalize_file_name(link_file);
/* we no longer need need the path to the link file */
obstack_free(mem_pool, link_file);
if (link == NULL)
return;
/* copy the path onto our obstack, set the value (somewhere in pts)
* and free the results of canonicalize_file_name */
obstack_printf(mem_pool, link);
obstack_1grow(mem_pool, '\0');
*ptr = (char *) obstack_finish(mem_pool);
free(link);
/* enable whatever field we successfuly retrived */
field_enable(format_str, field);
}
void
muscle_grow (const char *key, const char *val, const char *separator)
{
muscle_entry probe;
muscle_entry *entry = NULL;
probe.key = key;
entry = hash_lookup (muscle_table, &probe);
if (!entry)
{
/* First insertion in the hash. */
entry = xmalloc (sizeof *entry);
entry->key = key;
hash_insert (muscle_table, entry);
entry->value = xstrdup (val);
}
else
{
/* Grow the current value. */
char *new_val;
obstack_sgrow (&muscle_obstack, entry->value);
free (entry->value);
obstack_sgrow (&muscle_obstack, separator);
obstack_sgrow (&muscle_obstack, val);
obstack_1grow (&muscle_obstack, 0);
new_val = obstack_finish (&muscle_obstack);
entry->value = xstrdup (new_val);
obstack_free (&muscle_obstack, new_val);
}
}
static void
prepare (void)
{
/* Flags. */
MUSCLE_INSERT_BOOL ("debug_flag", debug_flag);
MUSCLE_INSERT_BOOL ("defines_flag", defines_flag);
MUSCLE_INSERT_BOOL ("error_verbose_flag", error_verbose);
MUSCLE_INSERT_BOOL ("locations_flag", locations_flag);
MUSCLE_INSERT_BOOL ("pure_flag", pure_parser);
MUSCLE_INSERT_BOOL ("synclines_flag", !no_lines_flag);
/* File names. */
MUSCLE_INSERT_STRING ("prefix", spec_name_prefix ? spec_name_prefix : "yy");
#define DEFINE(Name) MUSCLE_INSERT_STRING (#Name, Name ? Name : "")
DEFINE (dir_prefix);
DEFINE (parser_file_name);
DEFINE (spec_defines_file);
DEFINE (spec_file_prefix);
DEFINE (spec_graph_file);
DEFINE (spec_name_prefix);
DEFINE (spec_outfile);
DEFINE (spec_verbose_file);
#undef DEFINE
/* User Code. */
obstack_1grow (&pre_prologue_obstack, 0);
obstack_1grow (&post_prologue_obstack, 0);
muscle_insert ("pre_prologue", obstack_finish (&pre_prologue_obstack));
muscle_insert ("post_prologue", obstack_finish (&post_prologue_obstack));
/* Find the right skeleton file. */
if (!skeleton)
{
if (glr_parser || nondeterministic_parser)
skeleton = "glr.c";
else
skeleton = "yacc.c";
}
/* About the skeletons. */
{
char const *pkgdatadir = getenv ("BISON_PKGDATADIR");
MUSCLE_INSERT_STRING ("pkgdatadir", pkgdatadir ? pkgdatadir : PKGDATADIR);
MUSCLE_INSERT_C_STRING ("skeleton", skeleton);
}
}
/* Terminates the obstring as determined by its implementation. This also puts
a null character at the end of the string so one can use the string
actively. This function will return the final obstack address. */
char* close_obstring(struct obstack* strob)
{
/* Places NULL char at the end of string */
obstack_1grow(strob, 0);
/* Closes the obstack-string */
return obstack_finish(strob);
}
void driver_add_flag(struct obstack *obst, const char *format, ...)
{
char buf[65536];
va_list ap;
va_start(ap, format);
#ifdef _WIN32
int len =
#endif
vsnprintf(buf, sizeof(buf), format, ap);
va_end(ap);
obstack_1grow(obst, ' ');
#ifdef _WIN32
obstack_1grow(obst, '"');
obstack_grow(obst, buf, len);
obstack_1grow(obst, '"');
#else
/* escape stuff... */
for (char *c = buf; *c != '\0'; ++c) {
switch (*c) {
case ' ':
case '"':
case '$':
case '&':
case '(':
case ')':
case ';':
case '<':
case '>':
case '\'':
case '\\':
case '\n':
case '\r':
case '\t':
case '`':
case '|':
obstack_1grow(obst, '\\');
/* FALLTHROUGH */
default:
obstack_1grow(obst, *c);
break;
}
}
#endif
}
static char *
get_string (void)
{
for (;;)
{
char c;
if (safe_read (STDIN_FILENO, &c, 1) != 1)
exit (EXIT_SUCCESS);
if (c == '\n')
break;
obstack_1grow (&string_stk, c);
}
obstack_1grow (&string_stk, 0);
return obstack_finish (&string_stk);
}
void
s_ifdef (int test_defined)
{
/* Points to name of symbol. */
char *name;
/* Points to symbol. */
symbolS *symbolP;
struct conditional_frame cframe;
char c;
/* Leading whitespace is part of operand. */
SKIP_WHITESPACE ();
name = input_line_pointer;
if (!is_name_beginner (*name))
{
as_bad (_("invalid identifier for \".ifdef\""));
obstack_1grow (&cond_obstack, 0);
ignore_rest_of_line ();
return;
}
c = get_symbol_end ();
symbolP = symbol_find (name);
*input_line_pointer = c;
initialize_cframe (&cframe);
if (cframe.dead_tree)
cframe.ignoring = 1;
else
{
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
&& S_IS_DEFINED (symbolP)
&& S_GET_SEGMENT (symbolP) != reg_section;
cframe.ignoring = ! (test_defined ^ is_defined);
}
current_cframe = ((struct conditional_frame *)
obstack_copy (&cond_obstack, &cframe,
sizeof (cframe)));
if (LISTING_SKIP_COND ()
&& cframe.ignoring
&& (cframe.previous_cframe == NULL
|| ! cframe.previous_cframe->ignoring))
listing_list (2);
demand_empty_rest_of_line ();
}
char *
ui_file_obsavestring (struct ui_file *file, struct obstack *obstack,
long *length)
{
ui_file_put (file, do_ui_file_obsavestring, obstack);
*length = obstack_object_size (obstack);
obstack_1grow (obstack, '\0');
return obstack_finish (obstack);
}
static symbol_t *finalize_symbol_string(void)
{
obstack_1grow(&symbol_obstack, '\0');
char *string = obstack_finish(&symbol_obstack);
symbol_t *symbol = symbol_table_insert(string);
if (symbol->string != string)
obstack_free(&symbol_obstack, string);
return symbol;
}
