mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-03-29 18:21:17 +08:00
* input.h (lineno): Rename to ... (input_line): ... here. * tree.h (lineno): Rename to ... (input_line): ... here. * scan.h (lineno): Rename to ... (input_line): ... here. * toplev.c (lineno): Rename to ... (input_line): ... here. (push_srcloc, pop_srcloc): Rename lineno to input_line. * c-common.c (c_expand_start_cond, fname_decl): Likewise. * c-decl.c (poplevel, pop_label_level, lookup_label, lookup_tag, store_parm_decls, c_expand_body_1): Likewise. * c-errors.c (pedwarn_c99): Likewise. * c-format.c (status_warning): Likewise. * c-lex.c (fe_file_change, cb_def_pragma, c_lex): Likewise. * c-opts.c (c_common_post_options, c_common_parse_file): Likewise. * c-parse.in (save_filename, maybe_type_qual, ifc): Likwise. * c-semantics.c (finish_stmt_tree, build_stmt, emit_local_var, gentrtl_goto_stmt, genrtl_expr_stmt_value, genrtl_decl_stmt, genrtl_if_stmt, genrtl_while_stmt, genrtl_do_stmt, genrtl_return_stmt, genrtl_for_stmt, build_break_stmt, build_continue_stmt, genrtl_switch_stmt, genrtl_asm_stmt, prep_stmt, find_reachable_label, expand_unreachable_stmt): Likewise. * coverage.c (create_coverage): Likewise. * diagnostic.c (pedwarn, sorry, error, fatal_error, internal_error, warning, diagnostic_report_current_module, inform): Likewise. * expr.c (expand_expr): Likewise. * integrate.c (expand_inline_function, output_inline_function): Likewise. * rtl-error.c (file_and_line_for_asm): Likewise. * tree-inline.c (find_alloca_call, find_builtin_longjmp_call, walk_tree): Likewise. * tree.c (make_node): Likewise. * ada, cp, f, java, objc, treelang: Likewise. ada * trans.c (build_unit_elab, set_lineno): Rename lineno to input_line. * utils.c (pushdecl, create_label_decl, begin_subprog_body, end_subprog_body): Likewise. * utils2.c (build_call_raise): Likewise. cp * class.c (finish_struct): Rename lineno to input_line. * decl.c (push_binding_level, pop_binding_level, suspend_binding_level, resume_binding_level, make_label_decl, use_label, start_function): Likewise. * decl2.c (warn_if_unknown_interface, start_static_initialization_or_destruction, generate_ctor_or_dtor_function, finish_file): Likewise. * error.c (cp_line_of, print_instantiation_full_context, print_instantiation_context): Likewise. * except.c (check_handlers_1, check_handlers): Likewise. * init.c (create_temporary_var): Likewise. * method.c (use_thunk, synthesize_method): Likewise. * parser.c (cp_lexer_set_source_position_from_token, cp_lexer_get_preprocessor_token): Likewise. * pt.c (push_tinst_level, pop_tinst_level, tsubst_friend_function, instantiate_class_template, tsubst_decl, tsubst, tsubst_expr, instantiate_decl): Likewise. * semantics.c (genrtl_try_block, finish_label_stmt, begin_class_definition, expand_body, genrtl_finish_function): Likewise. * tree.c (build_min_nt, build_min): Likewise. f * ansify.c (die_unless): Rename lineno to input_line. * com.c (ffecom_subscript_check_, ffecom_do_entry_, ffecom_gen_sfuncdef_, ffecom_start_progunit_, ffecom_sym_transform_, ffecom_sym_transform_assign_, bison_rule_pushlevel_, bison_rule_compstmt_, finish_function, store_parm_decls): Likewise. * intrin.c (ffeintrin_fulfill_generic): Likewise. * lex.c (ffelex_hash_, ffelex_include_, ffelex_next_line_, ffelex_file_fixed, ffelex_file_free): Likewise. * std.c (ffestd_exec_end): Likewise. * ste.c (ffeste_emit_line_note_, ffeste_start_block_, ffeste_start_stmt_): Likewise. * ste.h (ffeste_filelinenum, ffeste_set_line): Likewise. java * lex.h (lineno): Rename to ... (input_line): ... here * parse-scan.y (lineno): Rename to ... (input_line): ... here. (reset_report): Rename lineno to input_line. * check-init.c (check_init): Likewise. * class.c (push_class): Likewise. * decl.c (complete_start_java_method, end_java_method): Likewise. * expr.c (expand_byte_code): Likewise. * jcf-parse.c (give_name_to_class, parse_class_file): Likewise. * jcf-write.c (generate_bytecode_insns): Likewise. * lex.c (java_init_lex, java_allocate_new_line, do_java_lex): Likewise. * parse.h (YYNOT_TWICE): Likewise. * parse.y (empty_statement, expression_statement, java_pop_parser_context, java_parser_context_save_global, yyerror, register_fields, method_header, safe_layout_class, find_in_imports_on_demand, create_artificial_method, source_end_java_method, start_complete_expand_method, build_thisn_assign, java_complete_lhs, maybe_absorb_scoping_block): Likewise. objc * objc-act.c (objc_init): Rename lineno to input_line. (build_module_descriptor, build_selector_translation_table, build_protocol_template, build_method_prototype_list_template, build_category_template, build_selector_table, build_class_template, build_super_template, build_ivar_template, build_ivar_list_template, build_method_list_template, build_method_template, add_instance_variable): Likewise. treelang * tree1.c (treelang_init): Rename lineno to input_line. From-SVN: r66333
708 lines
19 KiB
C
708 lines
19 KiB
C
/* Mainly the interface between cpplib and the C front ends.
|
||
Copyright (C) 1987, 1988, 1989, 1992, 1994, 1995, 1996, 1997
|
||
1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
|
||
|
||
This file is part of GCC.
|
||
|
||
GCC 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, or (at your option) any later
|
||
version.
|
||
|
||
GCC 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 GCC; see the file COPYING. If not, write to the Free
|
||
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
||
02111-1307, USA. */
|
||
|
||
#include "config.h"
|
||
#include "system.h"
|
||
#include "coretypes.h"
|
||
#include "tm.h"
|
||
|
||
#include "real.h"
|
||
#include "rtl.h"
|
||
#include "tree.h"
|
||
#include "expr.h"
|
||
#include "input.h"
|
||
#include "output.h"
|
||
#include "c-tree.h"
|
||
#include "c-common.h"
|
||
#include "flags.h"
|
||
#include "timevar.h"
|
||
#include "cpplib.h"
|
||
#include "c-pragma.h"
|
||
#include "toplev.h"
|
||
#include "intl.h"
|
||
#include "tm_p.h"
|
||
#include "splay-tree.h"
|
||
#include "debug.h"
|
||
|
||
/* The current line map. */
|
||
static const struct line_map *map;
|
||
|
||
/* The line used to refresh the lineno global variable after each token. */
|
||
static unsigned int src_lineno;
|
||
|
||
/* We may keep statistics about how long which files took to compile. */
|
||
static int header_time, body_time;
|
||
static splay_tree file_info_tree;
|
||
|
||
/* File used for outputting assembler code. */
|
||
extern FILE *asm_out_file;
|
||
|
||
#undef WCHAR_TYPE_SIZE
|
||
#define WCHAR_TYPE_SIZE TYPE_PRECISION (wchar_type_node)
|
||
|
||
/* Number of bytes in a wide character. */
|
||
#define WCHAR_BYTES (WCHAR_TYPE_SIZE / BITS_PER_UNIT)
|
||
|
||
int pending_lang_change; /* If we need to switch languages - C++ only */
|
||
int c_header_level; /* depth in C headers - C++ only */
|
||
|
||
/* Nonzero tells yylex to ignore \ in string constants. */
|
||
static int ignore_escape_flag;
|
||
|
||
static tree interpret_integer PARAMS ((const cpp_token *, unsigned int));
|
||
static tree interpret_float PARAMS ((const cpp_token *, unsigned int));
|
||
static enum integer_type_kind
|
||
narrowest_unsigned_type PARAMS ((tree, unsigned int));
|
||
static enum integer_type_kind
|
||
narrowest_signed_type PARAMS ((tree, unsigned int));
|
||
static tree lex_string PARAMS ((const cpp_string *));
|
||
static tree lex_charconst PARAMS ((const cpp_token *));
|
||
static void update_header_times PARAMS ((const char *));
|
||
static int dump_one_header PARAMS ((splay_tree_node, void *));
|
||
static void cb_line_change PARAMS ((cpp_reader *, const cpp_token *, int));
|
||
static void cb_ident PARAMS ((cpp_reader *, unsigned int,
|
||
const cpp_string *));
|
||
static void cb_def_pragma PARAMS ((cpp_reader *, unsigned int));
|
||
static void cb_define PARAMS ((cpp_reader *, unsigned int,
|
||
cpp_hashnode *));
|
||
static void cb_undef PARAMS ((cpp_reader *, unsigned int,
|
||
cpp_hashnode *));
|
||
|
||
void
|
||
init_c_lex ()
|
||
{
|
||
struct cpp_callbacks *cb;
|
||
struct c_fileinfo *toplevel;
|
||
|
||
/* Set up filename timing. Must happen before cpp_read_main_file. */
|
||
file_info_tree = splay_tree_new ((splay_tree_compare_fn)strcmp,
|
||
0,
|
||
(splay_tree_delete_value_fn)free);
|
||
toplevel = get_fileinfo ("<top level>");
|
||
if (flag_detailed_statistics)
|
||
{
|
||
header_time = 0;
|
||
body_time = get_run_time ();
|
||
toplevel->time = body_time;
|
||
}
|
||
|
||
cb = cpp_get_callbacks (parse_in);
|
||
|
||
cb->line_change = cb_line_change;
|
||
cb->ident = cb_ident;
|
||
cb->def_pragma = cb_def_pragma;
|
||
cb->valid_pch = c_common_valid_pch;
|
||
cb->read_pch = c_common_read_pch;
|
||
|
||
/* Set the debug callbacks if we can use them. */
|
||
if (debug_info_level == DINFO_LEVEL_VERBOSE
|
||
&& (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG
|
||
|| write_symbols == VMS_AND_DWARF2_DEBUG))
|
||
{
|
||
cb->define = cb_define;
|
||
cb->undef = cb_undef;
|
||
}
|
||
}
|
||
|
||
struct c_fileinfo *
|
||
get_fileinfo (name)
|
||
const char *name;
|
||
{
|
||
splay_tree_node n;
|
||
struct c_fileinfo *fi;
|
||
|
||
n = splay_tree_lookup (file_info_tree, (splay_tree_key) name);
|
||
if (n)
|
||
return (struct c_fileinfo *) n->value;
|
||
|
||
fi = (struct c_fileinfo *) xmalloc (sizeof (struct c_fileinfo));
|
||
fi->time = 0;
|
||
fi->interface_only = 0;
|
||
fi->interface_unknown = 1;
|
||
splay_tree_insert (file_info_tree, (splay_tree_key) name,
|
||
(splay_tree_value) fi);
|
||
return fi;
|
||
}
|
||
|
||
static void
|
||
update_header_times (name)
|
||
const char *name;
|
||
{
|
||
/* Changing files again. This means currently collected time
|
||
is charged against header time, and body time starts back at 0. */
|
||
if (flag_detailed_statistics)
|
||
{
|
||
int this_time = get_run_time ();
|
||
struct c_fileinfo *file = get_fileinfo (name);
|
||
header_time += this_time - body_time;
|
||
file->time += this_time - body_time;
|
||
body_time = this_time;
|
||
}
|
||
}
|
||
|
||
static int
|
||
dump_one_header (n, dummy)
|
||
splay_tree_node n;
|
||
void *dummy ATTRIBUTE_UNUSED;
|
||
{
|
||
print_time ((const char *) n->key,
|
||
((struct c_fileinfo *) n->value)->time);
|
||
return 0;
|
||
}
|
||
|
||
void
|
||
dump_time_statistics ()
|
||
{
|
||
struct c_fileinfo *file = get_fileinfo (input_filename);
|
||
int this_time = get_run_time ();
|
||
file->time += this_time - body_time;
|
||
|
||
fprintf (stderr, "\n******\n");
|
||
print_time ("header files (total)", header_time);
|
||
print_time ("main file (total)", this_time - body_time);
|
||
fprintf (stderr, "ratio = %g : 1\n",
|
||
(double)header_time / (double)(this_time - body_time));
|
||
fprintf (stderr, "\n******\n");
|
||
|
||
splay_tree_foreach (file_info_tree, dump_one_header, 0);
|
||
}
|
||
|
||
static void
|
||
cb_ident (pfile, line, str)
|
||
cpp_reader *pfile ATTRIBUTE_UNUSED;
|
||
unsigned int line ATTRIBUTE_UNUSED;
|
||
const cpp_string *str ATTRIBUTE_UNUSED;
|
||
{
|
||
#ifdef ASM_OUTPUT_IDENT
|
||
if (! flag_no_ident)
|
||
{
|
||
/* Convert escapes in the string. */
|
||
tree value ATTRIBUTE_UNUSED = lex_string (str);
|
||
ASM_OUTPUT_IDENT (asm_out_file, TREE_STRING_POINTER (value));
|
||
}
|
||
#endif
|
||
}
|
||
|
||
/* Called at the start of every non-empty line. TOKEN is the first
|
||
lexed token on the line. Used for diagnostic line numbers. */
|
||
static void
|
||
cb_line_change (pfile, token, parsing_args)
|
||
cpp_reader *pfile ATTRIBUTE_UNUSED;
|
||
const cpp_token *token;
|
||
int parsing_args ATTRIBUTE_UNUSED;
|
||
{
|
||
src_lineno = SOURCE_LINE (map, token->line);
|
||
}
|
||
|
||
void
|
||
fe_file_change (new_map)
|
||
const struct line_map *new_map;
|
||
{
|
||
unsigned int to_line = SOURCE_LINE (new_map, new_map->to_line);
|
||
|
||
if (new_map->reason == LC_ENTER)
|
||
{
|
||
/* Don't stack the main buffer on the input stack;
|
||
we already did in compile_file. */
|
||
if (map == NULL)
|
||
main_input_filename = new_map->to_file;
|
||
else
|
||
{
|
||
int included_at = SOURCE_LINE (new_map - 1, new_map->from_line - 1);
|
||
|
||
input_line = included_at;
|
||
push_srcloc (new_map->to_file, 1);
|
||
(*debug_hooks->start_source_file) (included_at, new_map->to_file);
|
||
#ifndef NO_IMPLICIT_EXTERN_C
|
||
if (c_header_level)
|
||
++c_header_level;
|
||
else if (new_map->sysp == 2)
|
||
{
|
||
c_header_level = 1;
|
||
++pending_lang_change;
|
||
}
|
||
#endif
|
||
}
|
||
}
|
||
else if (new_map->reason == LC_LEAVE)
|
||
{
|
||
#ifndef NO_IMPLICIT_EXTERN_C
|
||
if (c_header_level && --c_header_level == 0)
|
||
{
|
||
if (new_map->sysp == 2)
|
||
warning ("badly nested C headers from preprocessor");
|
||
--pending_lang_change;
|
||
}
|
||
#endif
|
||
pop_srcloc ();
|
||
|
||
(*debug_hooks->end_source_file) (to_line);
|
||
}
|
||
|
||
update_header_times (new_map->to_file);
|
||
in_system_header = new_map->sysp != 0;
|
||
input_filename = new_map->to_file;
|
||
input_line = to_line;
|
||
map = new_map;
|
||
|
||
/* Hook for C++. */
|
||
extract_interface_info ();
|
||
}
|
||
|
||
static void
|
||
cb_def_pragma (pfile, line)
|
||
cpp_reader *pfile;
|
||
unsigned int line;
|
||
{
|
||
/* Issue a warning message if we have been asked to do so. Ignore
|
||
unknown pragmas in system headers unless an explicit
|
||
-Wunknown-pragmas has been given. */
|
||
if (warn_unknown_pragmas > in_system_header)
|
||
{
|
||
const unsigned char *space, *name;
|
||
const cpp_token *s;
|
||
|
||
space = name = (const unsigned char *) "";
|
||
s = cpp_get_token (pfile);
|
||
if (s->type != CPP_EOF)
|
||
{
|
||
space = cpp_token_as_text (pfile, s);
|
||
s = cpp_get_token (pfile);
|
||
if (s->type == CPP_NAME)
|
||
name = cpp_token_as_text (pfile, s);
|
||
}
|
||
|
||
input_line = SOURCE_LINE (map, line);
|
||
warning ("ignoring #pragma %s %s", space, name);
|
||
}
|
||
}
|
||
|
||
/* #define callback for DWARF and DWARF2 debug info. */
|
||
static void
|
||
cb_define (pfile, line, node)
|
||
cpp_reader *pfile;
|
||
unsigned int line;
|
||
cpp_hashnode *node;
|
||
{
|
||
(*debug_hooks->define) (SOURCE_LINE (map, line),
|
||
(const char *) cpp_macro_definition (pfile, node));
|
||
}
|
||
|
||
/* #undef callback for DWARF and DWARF2 debug info. */
|
||
static void
|
||
cb_undef (pfile, line, node)
|
||
cpp_reader *pfile ATTRIBUTE_UNUSED;
|
||
unsigned int line;
|
||
cpp_hashnode *node;
|
||
{
|
||
(*debug_hooks->undef) (SOURCE_LINE (map, line),
|
||
(const char *) NODE_NAME (node));
|
||
}
|
||
|
||
int
|
||
c_lex (value)
|
||
tree *value;
|
||
{
|
||
const cpp_token *tok;
|
||
|
||
retry:
|
||
timevar_push (TV_CPP);
|
||
do
|
||
tok = cpp_get_token (parse_in);
|
||
while (tok->type == CPP_PADDING);
|
||
timevar_pop (TV_CPP);
|
||
|
||
/* The C++ front end does horrible things with the current line
|
||
number. To ensure an accurate line number, we must reset it
|
||
every time we return a token. */
|
||
input_line = src_lineno;
|
||
|
||
*value = NULL_TREE;
|
||
switch (tok->type)
|
||
{
|
||
case CPP_NAME:
|
||
*value = HT_IDENT_TO_GCC_IDENT (HT_NODE (tok->val.node));
|
||
break;
|
||
|
||
case CPP_NUMBER:
|
||
{
|
||
unsigned int flags = cpp_classify_number (parse_in, tok);
|
||
|
||
switch (flags & CPP_N_CATEGORY)
|
||
{
|
||
case CPP_N_INVALID:
|
||
/* cpplib has issued an error. */
|
||
*value = error_mark_node;
|
||
break;
|
||
|
||
case CPP_N_INTEGER:
|
||
*value = interpret_integer (tok, flags);
|
||
break;
|
||
|
||
case CPP_N_FLOATING:
|
||
*value = interpret_float (tok, flags);
|
||
break;
|
||
|
||
default:
|
||
abort ();
|
||
}
|
||
}
|
||
break;
|
||
|
||
case CPP_OTHER:
|
||
{
|
||
cppchar_t c = tok->val.str.text[0];
|
||
|
||
if (c == '"' || c == '\'')
|
||
error ("missing terminating %c character", (int) c);
|
||
else if (ISGRAPH (c))
|
||
error ("stray '%c' in program", (int) c);
|
||
else
|
||
error ("stray '\\%o' in program", (int) c);
|
||
}
|
||
goto retry;
|
||
|
||
case CPP_CHAR:
|
||
case CPP_WCHAR:
|
||
*value = lex_charconst (tok);
|
||
break;
|
||
|
||
case CPP_STRING:
|
||
case CPP_WSTRING:
|
||
*value = lex_string (&tok->val.str);
|
||
break;
|
||
|
||
/* These tokens should not be visible outside cpplib. */
|
||
case CPP_HEADER_NAME:
|
||
case CPP_COMMENT:
|
||
case CPP_MACRO_ARG:
|
||
abort ();
|
||
|
||
default: break;
|
||
}
|
||
|
||
return tok->type;
|
||
}
|
||
|
||
/* Returns the narrowest C-visible unsigned type, starting with the
|
||
minimum specified by FLAGS, that can fit VALUE, or itk_none if
|
||
there isn't one. */
|
||
static enum integer_type_kind
|
||
narrowest_unsigned_type (value, flags)
|
||
tree value;
|
||
unsigned int flags;
|
||
{
|
||
enum integer_type_kind itk;
|
||
|
||
if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
|
||
itk = itk_unsigned_int;
|
||
else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
|
||
itk = itk_unsigned_long;
|
||
else
|
||
itk = itk_unsigned_long_long;
|
||
|
||
/* int_fits_type_p must think the type of its first argument is
|
||
wider than its second argument, or it won't do the proper check. */
|
||
TREE_TYPE (value) = widest_unsigned_literal_type_node;
|
||
|
||
for (; itk < itk_none; itk += 2 /* skip unsigned types */)
|
||
if (int_fits_type_p (value, integer_types[itk]))
|
||
return itk;
|
||
|
||
return itk_none;
|
||
}
|
||
|
||
/* Ditto, but narrowest signed type. */
|
||
static enum integer_type_kind
|
||
narrowest_signed_type (value, flags)
|
||
tree value;
|
||
unsigned int flags;
|
||
{
|
||
enum integer_type_kind itk;
|
||
|
||
if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
|
||
itk = itk_int;
|
||
else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
|
||
itk = itk_long;
|
||
else
|
||
itk = itk_long_long;
|
||
|
||
/* int_fits_type_p must think the type of its first argument is
|
||
wider than its second argument, or it won't do the proper check. */
|
||
TREE_TYPE (value) = widest_unsigned_literal_type_node;
|
||
|
||
for (; itk < itk_none; itk += 2 /* skip signed types */)
|
||
if (int_fits_type_p (value, integer_types[itk]))
|
||
return itk;
|
||
|
||
return itk_none;
|
||
}
|
||
|
||
/* Interpret TOKEN, an integer with FLAGS as classified by cpplib. */
|
||
static tree
|
||
interpret_integer (token, flags)
|
||
const cpp_token *token;
|
||
unsigned int flags;
|
||
{
|
||
tree value, type;
|
||
enum integer_type_kind itk;
|
||
cpp_num integer;
|
||
cpp_options *options = cpp_get_options (parse_in);
|
||
|
||
integer = cpp_interpret_integer (parse_in, token, flags);
|
||
integer = cpp_num_sign_extend (integer, options->precision);
|
||
value = build_int_2_wide (integer.low, integer.high);
|
||
|
||
/* The type of a constant with a U suffix is straightforward. */
|
||
if (flags & CPP_N_UNSIGNED)
|
||
itk = narrowest_unsigned_type (value, flags);
|
||
else
|
||
{
|
||
/* The type of a potentially-signed integer constant varies
|
||
depending on the base it's in, the standard in use, and the
|
||
length suffixes. */
|
||
enum integer_type_kind itk_u = narrowest_unsigned_type (value, flags);
|
||
enum integer_type_kind itk_s = narrowest_signed_type (value, flags);
|
||
|
||
/* In both C89 and C99, octal and hex constants may be signed or
|
||
unsigned, whichever fits tighter. We do not warn about this
|
||
choice differing from the traditional choice, as the constant
|
||
is probably a bit pattern and either way will work. */
|
||
if ((flags & CPP_N_RADIX) != CPP_N_DECIMAL)
|
||
itk = MIN (itk_u, itk_s);
|
||
else
|
||
{
|
||
/* In C99, decimal constants are always signed.
|
||
In C89, decimal constants that don't fit in long have
|
||
undefined behavior; we try to make them unsigned long.
|
||
In GCC's extended C89, that last is true of decimal
|
||
constants that don't fit in long long, too. */
|
||
|
||
itk = itk_s;
|
||
if (itk_s > itk_u && itk_s > itk_long)
|
||
{
|
||
if (!flag_isoc99)
|
||
{
|
||
if (itk_u < itk_unsigned_long)
|
||
itk_u = itk_unsigned_long;
|
||
itk = itk_u;
|
||
warning ("this decimal constant is unsigned only in ISO C90");
|
||
}
|
||
else if (warn_traditional)
|
||
warning ("this decimal constant would be unsigned in ISO C90");
|
||
}
|
||
}
|
||
}
|
||
|
||
if (itk == itk_none)
|
||
/* cpplib has already issued a warning for overflow. */
|
||
type = ((flags & CPP_N_UNSIGNED)
|
||
? widest_unsigned_literal_type_node
|
||
: widest_integer_literal_type_node);
|
||
else
|
||
type = integer_types[itk];
|
||
|
||
if (itk > itk_unsigned_long
|
||
&& (flags & CPP_N_WIDTH) != CPP_N_LARGE
|
||
&& ! in_system_header && ! flag_isoc99)
|
||
pedwarn ("integer constant is too large for \"%s\" type",
|
||
(flags & CPP_N_UNSIGNED) ? "unsigned long" : "long");
|
||
|
||
TREE_TYPE (value) = type;
|
||
|
||
/* Convert imaginary to a complex type. */
|
||
if (flags & CPP_N_IMAGINARY)
|
||
value = build_complex (NULL_TREE, convert (type, integer_zero_node), value);
|
||
|
||
return value;
|
||
}
|
||
|
||
/* Interpret TOKEN, a floating point number with FLAGS as classified
|
||
by cpplib. */
|
||
static tree
|
||
interpret_float (token, flags)
|
||
const cpp_token *token;
|
||
unsigned int flags;
|
||
{
|
||
tree type;
|
||
tree value;
|
||
REAL_VALUE_TYPE real;
|
||
char *copy;
|
||
size_t copylen;
|
||
const char *typename;
|
||
|
||
/* FIXME: make %T work in error/warning, then we don't need typename. */
|
||
if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
|
||
{
|
||
type = long_double_type_node;
|
||
typename = "long double";
|
||
}
|
||
else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL
|
||
|| flag_single_precision_constant)
|
||
{
|
||
type = float_type_node;
|
||
typename = "float";
|
||
}
|
||
else
|
||
{
|
||
type = double_type_node;
|
||
typename = "double";
|
||
}
|
||
|
||
/* Copy the constant to a nul-terminated buffer. If the constant
|
||
has any suffixes, cut them off; REAL_VALUE_ATOF/ REAL_VALUE_HTOF
|
||
can't handle them. */
|
||
copylen = token->val.str.len;
|
||
if ((flags & CPP_N_WIDTH) != CPP_N_MEDIUM)
|
||
/* Must be an F or L suffix. */
|
||
copylen--;
|
||
if (flags & CPP_N_IMAGINARY)
|
||
/* I or J suffix. */
|
||
copylen--;
|
||
|
||
copy = alloca (copylen + 1);
|
||
memcpy (copy, token->val.str.text, copylen);
|
||
copy[copylen] = '\0';
|
||
|
||
real_from_string (&real, copy);
|
||
real_convert (&real, TYPE_MODE (type), &real);
|
||
|
||
/* A diagnostic is required for "soft" overflow by some ISO C
|
||
testsuites. This is not pedwarn, because some people don't want
|
||
an error for this.
|
||
??? That's a dubious reason... is this a mandatory diagnostic or
|
||
isn't it? -- zw, 2001-08-21. */
|
||
if (REAL_VALUE_ISINF (real) && pedantic)
|
||
warning ("floating constant exceeds range of \"%s\"", typename);
|
||
|
||
/* Create a node with determined type and value. */
|
||
value = build_real (type, real);
|
||
if (flags & CPP_N_IMAGINARY)
|
||
value = build_complex (NULL_TREE, convert (type, integer_zero_node), value);
|
||
|
||
return value;
|
||
}
|
||
|
||
static tree
|
||
lex_string (str)
|
||
const cpp_string *str;
|
||
{
|
||
bool wide;
|
||
tree value;
|
||
char *buf, *q;
|
||
cppchar_t c;
|
||
const unsigned char *p, *limit;
|
||
|
||
wide = str->text[0] == 'L';
|
||
p = str->text + 1 + wide;
|
||
limit = str->text + str->len - 1;
|
||
q = buf = alloca ((str->len + 1) * (wide ? WCHAR_BYTES : 1));
|
||
|
||
while (p < limit)
|
||
{
|
||
c = *p++;
|
||
|
||
if (c == '\\' && !ignore_escape_flag)
|
||
c = cpp_parse_escape (parse_in, &p, limit, wide);
|
||
|
||
/* Add this single character into the buffer either as a wchar_t,
|
||
a multibyte sequence, or as a single byte. */
|
||
if (wide)
|
||
{
|
||
unsigned charwidth = TYPE_PRECISION (char_type_node);
|
||
unsigned bytemask = (1 << charwidth) - 1;
|
||
int byte;
|
||
|
||
for (byte = 0; byte < WCHAR_BYTES; ++byte)
|
||
{
|
||
int n;
|
||
if (byte >= (int) sizeof (c))
|
||
n = 0;
|
||
else
|
||
n = (c >> (byte * charwidth)) & bytemask;
|
||
if (BYTES_BIG_ENDIAN)
|
||
q[WCHAR_BYTES - byte - 1] = n;
|
||
else
|
||
q[byte] = n;
|
||
}
|
||
q += WCHAR_BYTES;
|
||
}
|
||
else
|
||
{
|
||
*q++ = c;
|
||
}
|
||
}
|
||
|
||
/* Terminate the string value, either with a single byte zero
|
||
or with a wide zero. */
|
||
|
||
if (wide)
|
||
{
|
||
memset (q, 0, WCHAR_BYTES);
|
||
q += WCHAR_BYTES;
|
||
}
|
||
else
|
||
{
|
||
*q++ = '\0';
|
||
}
|
||
|
||
value = build_string (q - buf, buf);
|
||
|
||
if (wide)
|
||
TREE_TYPE (value) = wchar_array_type_node;
|
||
else
|
||
TREE_TYPE (value) = char_array_type_node;
|
||
return value;
|
||
}
|
||
|
||
/* Converts a (possibly wide) character constant token into a tree. */
|
||
static tree
|
||
lex_charconst (token)
|
||
const cpp_token *token;
|
||
{
|
||
cppchar_t result;
|
||
tree type, value;
|
||
unsigned int chars_seen;
|
||
int unsignedp;
|
||
|
||
result = cpp_interpret_charconst (parse_in, token,
|
||
&chars_seen, &unsignedp);
|
||
|
||
/* Cast to cppchar_signed_t to get correct sign-extension of RESULT
|
||
before possibly widening to HOST_WIDE_INT for build_int_2. */
|
||
if (unsignedp || (cppchar_signed_t) result >= 0)
|
||
value = build_int_2 (result, 0);
|
||
else
|
||
value = build_int_2 ((cppchar_signed_t) result, -1);
|
||
|
||
if (token->type == CPP_WCHAR)
|
||
type = wchar_type_node;
|
||
/* In C, a character constant has type 'int'.
|
||
In C++ 'char', but multi-char charconsts have type 'int'. */
|
||
else if ((c_language == clk_c) || chars_seen > 1)
|
||
type = integer_type_node;
|
||
else
|
||
type = char_type_node;
|
||
|
||
TREE_TYPE (value) = type;
|
||
return value;
|
||
}
|