alias.c: Fix comment formatting.
* alias.c: Fix comment formatting. * bitmap.c: Likewise. * builtins.c: Likewise. * calls.c: Likewise. * c-common.c: Likewise. * c-decl.c: Likewise. * c-dump.c: Likewise. * c-lex.c: Likewise. * collect2.c: Likewise. * combine.c: Likewise. * conflict.c: Likewise. * cppfiles.c: Likewise. * cppinit.c: Likewise. * cpplex.c: Likewise. * cpplib.c: Likewise. * cppmacro.c: Likewise. * cppspec.c: Likewise. * c-pragma.c: Likewise. * crtstuff.c: Likewise. * cse.c: Likewise. * cselib.c: Likewise. * c-semantics.c: Likewise. * c-typeck.c: Likewise. From-SVN: r44547
This commit is contained in:
parent
60a78ccfac
commit
ec5c56db8b
24 changed files with 172 additions and 146 deletions
|
@ -1,3 +1,29 @@
|
|||
2001-08-01 Kazu Hirata <kazu@hxi.com>
|
||||
|
||||
* alias.c: Fix comment formatting.
|
||||
* bitmap.c: Likewise.
|
||||
* builtins.c: Likewise.
|
||||
* calls.c: Likewise.
|
||||
* c-common.c: Likewise.
|
||||
* c-decl.c: Likewise.
|
||||
* c-dump.c: Likewise.
|
||||
* c-lex.c: Likewise.
|
||||
* collect2.c: Likewise.
|
||||
* combine.c: Likewise.
|
||||
* conflict.c: Likewise.
|
||||
* cppfiles.c: Likewise.
|
||||
* cppinit.c: Likewise.
|
||||
* cpplex.c: Likewise.
|
||||
* cpplib.c: Likewise.
|
||||
* cppmacro.c: Likewise.
|
||||
* cppspec.c: Likewise.
|
||||
* c-pragma.c: Likewise.
|
||||
* crtstuff.c: Likewise.
|
||||
* cse.c: Likewise.
|
||||
* cselib.c: Likewise.
|
||||
* c-semantics.c: Likewise.
|
||||
* c-typeck.c: Likewise.
|
||||
|
||||
2001-08-01 H.J. Lu <hjl@gnu.org>
|
||||
|
||||
* config/mips/linux.h (ASM_OUTPUT_IDENT): Defined.
|
||||
|
|
12
gcc/alias.c
12
gcc/alias.c
|
@ -352,7 +352,7 @@ objects_must_conflict_p (t1, t2)
|
|||
!= (t2 != 0 && AGGREGATE_TYPE_P (t2)))
|
||||
return 0;
|
||||
|
||||
/* Otherwise they conflict only if the alias sets conflict. */
|
||||
/* Otherwise they conflict only if the alias sets conflict. */
|
||||
return alias_sets_conflict_p (t1 ? get_alias_set (t1) : 0,
|
||||
t2 ? get_alias_set (t2) : 0);
|
||||
}
|
||||
|
@ -758,7 +758,7 @@ find_base_value (src)
|
|||
if (GET_CODE (src) != PLUS && GET_CODE (src) != MINUS)
|
||||
break;
|
||||
|
||||
/* ... fall through ... */
|
||||
/* ... fall through ... */
|
||||
|
||||
case PLUS:
|
||||
case MINUS:
|
||||
|
@ -807,7 +807,7 @@ find_base_value (src)
|
|||
|
||||
case AND:
|
||||
/* If the second operand is constant set the base
|
||||
address to the first operand. */
|
||||
address to the first operand. */
|
||||
if (GET_CODE (XEXP (src, 1)) == CONST_INT && INTVAL (XEXP (src, 1)) != 0)
|
||||
return find_base_value (XEXP (src, 0));
|
||||
return 0;
|
||||
|
@ -1344,7 +1344,7 @@ base_alias_check (x, y, x_mode, y_mode)
|
|||
if (flag_argument_noalias > 1)
|
||||
return 0;
|
||||
|
||||
/* Weak noalias assertion (arguments are distinct, but may match globals). */
|
||||
/* Weak noalias assertion (arguments are distinct, but may match globals). */
|
||||
return ! (GET_MODE (x_base) == VOIDmode && GET_MODE (y_base) == VOIDmode);
|
||||
}
|
||||
|
||||
|
@ -2103,7 +2103,7 @@ init_alias_once ()
|
|||
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
||||
/* Check whether this register can hold an incoming pointer
|
||||
argument. FUNCTION_ARG_REGNO_P tests outgoing register
|
||||
numbers, so translate if necessary due to register windows. */
|
||||
numbers, so translate if necessary due to register windows. */
|
||||
if (FUNCTION_ARG_REGNO_P (OUTGOING_REGNO (i))
|
||||
&& HARD_REGNO_MODE_OK (i, Pmode))
|
||||
SET_HARD_REG_BIT (argument_registers, i);
|
||||
|
@ -2231,7 +2231,7 @@ init_alias_analysis ()
|
|||
|
||||
/* If this insn has a noalias note, process it, Otherwise,
|
||||
scan for sets. A simple set will have no side effects
|
||||
which could change the base value of any other register. */
|
||||
which could change the base value of any other register. */
|
||||
|
||||
if (GET_CODE (PATTERN (insn)) == SET
|
||||
&& REG_NOTES (insn) != 0
|
||||
|
|
|
@ -38,8 +38,8 @@ static int bitmap_obstack_init = FALSE;
|
|||
#endif
|
||||
|
||||
/* Global data */
|
||||
bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
|
||||
static bitmap_element *bitmap_free; /* Freelist of bitmap elements. */
|
||||
bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
|
||||
static bitmap_element *bitmap_free; /* Freelist of bitmap elements. */
|
||||
|
||||
static void bitmap_element_free PARAMS ((bitmap, bitmap_element *));
|
||||
static bitmap_element *bitmap_element_allocate PARAMS ((void));
|
||||
|
@ -583,7 +583,7 @@ bitmap_operation (to, from1, from2, operation)
|
|||
}
|
||||
|
||||
/* Find the appropriate element from TO. Begin by discarding
|
||||
elements that we've skipped. */
|
||||
elements that we've skipped. */
|
||||
while (to_ptr && to_ptr->indx < indx)
|
||||
{
|
||||
changed = 1;
|
||||
|
@ -671,7 +671,7 @@ bitmap_equal_p (a, b)
|
|||
}
|
||||
|
||||
/* Or into bitmap TO bitmap FROM1 and'ed with the complement of
|
||||
bitmap FROM2. */
|
||||
bitmap FROM2. */
|
||||
|
||||
void
|
||||
bitmap_ior_and_compl (to, from1, from2)
|
||||
|
|
|
@ -510,7 +510,7 @@ expand_builtin_setjmp_setup (buf_addr, receiver_label)
|
|||
current_function_calls_setjmp = 1;
|
||||
|
||||
/* Set this so all the registers get saved in our frame; we need to be
|
||||
able to copy the saved values for any registers from frames we unwind. */
|
||||
able to copy the saved values for any registers from frames we unwind. */
|
||||
current_function_has_nonlocal_label = 1;
|
||||
}
|
||||
|
||||
|
@ -757,7 +757,7 @@ get_memory_rtx (exp)
|
|||
return mem;
|
||||
|
||||
set_mem_attributes (mem, exp, 0);
|
||||
/* memcpy, memset and other builtin stringops can alias with anything. */
|
||||
/* memcpy, memset and other builtin stringops can alias with anything. */
|
||||
set_mem_alias_set (mem, 0);
|
||||
return mem;
|
||||
}
|
||||
|
@ -2480,7 +2480,7 @@ expand_builtin_strncat (arglist, target, mode)
|
|||
fn = built_in_decls[BUILT_IN_STRCAT];
|
||||
|
||||
/* If the replacement _DECL isn't initialized, don't do the
|
||||
transformation. */
|
||||
transformation. */
|
||||
if (!fn)
|
||||
return 0;
|
||||
|
||||
|
@ -2574,7 +2574,7 @@ expand_builtin_strcspn (arglist, target, mode)
|
|||
fn = built_in_decls[BUILT_IN_STRLEN];
|
||||
|
||||
/* If the replacement _DECL isn't initialized, don't do the
|
||||
transformation. */
|
||||
transformation. */
|
||||
if (!fn)
|
||||
return 0;
|
||||
|
||||
|
@ -3141,7 +3141,7 @@ expand_builtin_ffs (arglist, target, subtarget)
|
|||
}
|
||||
|
||||
/* If the string passed to fputs is a constant and is one character
|
||||
long, we attempt to transform this call into __builtin_fputc(). */
|
||||
long, we attempt to transform this call into __builtin_fputc(). */
|
||||
|
||||
static rtx
|
||||
expand_builtin_fputs (arglist, ignore)
|
||||
|
@ -3152,11 +3152,11 @@ expand_builtin_fputs (arglist, ignore)
|
|||
fn_fwrite = built_in_decls[BUILT_IN_FWRITE];
|
||||
|
||||
/* If the return value is used, or the replacement _DECL isn't
|
||||
initialized, don't do the transformation. */
|
||||
initialized, don't do the transformation. */
|
||||
if (!ignore || !fn_fputc || !fn_fwrite)
|
||||
return 0;
|
||||
|
||||
/* Verify the arguments in the original call. */
|
||||
/* Verify the arguments in the original call. */
|
||||
if (!validate_arglist (arglist, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)
|
||||
|| current_function_check_memory_usage)
|
||||
return 0;
|
||||
|
|
|
@ -222,23 +222,23 @@ enum attrs {A_PACKED, A_NOCOMMON, A_COMMON, A_NORETURN, A_CONST, A_T_UNION,
|
|||
A_UNUSED, A_FORMAT, A_FORMAT_ARG, A_WEAK, A_ALIAS, A_MALLOC,
|
||||
A_NO_LIMIT_STACK, A_PURE};
|
||||
|
||||
/* Information about how a function name is generated. */
|
||||
/* Information about how a function name is generated. */
|
||||
struct fname_var_t
|
||||
{
|
||||
tree *decl; /* pointer to the VAR_DECL. */
|
||||
unsigned rid; /* RID number for the identifier. */
|
||||
tree *decl; /* pointer to the VAR_DECL. */
|
||||
unsigned rid; /* RID number for the identifier. */
|
||||
int pretty; /* How pretty is it? */
|
||||
};
|
||||
|
||||
/* The three ways of getting then name of the current function. */
|
||||
/* The three ways of getting then name of the current function. */
|
||||
|
||||
const struct fname_var_t fname_vars[] =
|
||||
{
|
||||
/* C99 compliant __func__, must be first. */
|
||||
/* C99 compliant __func__, must be first. */
|
||||
{&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
|
||||
/* GCC __FUNCTION__ compliant. */
|
||||
/* GCC __FUNCTION__ compliant. */
|
||||
{&function_name_decl_node, RID_FUNCTION_NAME, 0},
|
||||
/* GCC __PRETTY_FUNCTION__ compliant. */
|
||||
/* GCC __PRETTY_FUNCTION__ compliant. */
|
||||
{&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
|
||||
{NULL, 0, 0},
|
||||
};
|
||||
|
@ -359,7 +359,7 @@ c_finish_else ()
|
|||
RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
|
||||
}
|
||||
|
||||
/* Push current bindings for the function name VAR_DECLS. */
|
||||
/* Push current bindings for the function name VAR_DECLS. */
|
||||
|
||||
void
|
||||
start_fname_decls ()
|
||||
|
@ -389,7 +389,7 @@ start_fname_decls ()
|
|||
function's body in a COMPOUND_STMT containing these decls too. This
|
||||
must be done _before_ finish_stmt_tree is called. If there is no
|
||||
current function, we must be at file scope and no statements are
|
||||
involved. Pop the previous bindings. */
|
||||
involved. Pop the previous bindings. */
|
||||
|
||||
void
|
||||
finish_fname_decls ()
|
||||
|
@ -403,7 +403,7 @@ finish_fname_decls ()
|
|||
|
||||
if (body)
|
||||
{
|
||||
/* They were called into existance, so add to statement tree. */
|
||||
/* They were called into existance, so add to statement tree. */
|
||||
body = chainon (body,
|
||||
TREE_CHAIN (DECL_SAVED_TREE (current_function_decl)));
|
||||
body = build_stmt (COMPOUND_STMT, body);
|
||||
|
@ -417,7 +417,7 @@ finish_fname_decls ()
|
|||
|
||||
if (stack)
|
||||
{
|
||||
/* We had saved values, restore them. */
|
||||
/* We had saved values, restore them. */
|
||||
tree saved;
|
||||
|
||||
for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
|
||||
|
@ -433,7 +433,7 @@ finish_fname_decls ()
|
|||
}
|
||||
|
||||
/* Return the text name of the current function, suitable prettified
|
||||
by PRETTY_P. */
|
||||
by PRETTY_P. */
|
||||
|
||||
const char *
|
||||
fname_as_string (pretty_p)
|
||||
|
@ -496,7 +496,7 @@ fname_decl (rid, id)
|
|||
{
|
||||
/* We created some statement tree for the decl. This belongs
|
||||
at the start of the function, so remove it now and reinsert
|
||||
it after the function is complete. */
|
||||
it after the function is complete. */
|
||||
tree stmts = TREE_CHAIN (saved_last_tree);
|
||||
|
||||
TREE_CHAIN (saved_last_tree) = NULL_TREE;
|
||||
|
@ -1975,7 +1975,7 @@ type_for_mode (mode, unsignedp)
|
|||
return 0;
|
||||
}
|
||||
|
||||
/* Return an unsigned type the same as TYPE in other respects. */
|
||||
/* Return an unsigned type the same as TYPE in other respects. */
|
||||
tree
|
||||
unsigned_type (type)
|
||||
tree type;
|
||||
|
@ -3951,7 +3951,7 @@ c_unsafe_for_reeval (exp)
|
|||
return -1;
|
||||
}
|
||||
|
||||
/* Tree code classes. */
|
||||
/* Tree code classes. */
|
||||
|
||||
#define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
|
||||
|
||||
|
@ -3984,7 +3984,7 @@ static const char *c_tree_code_name[] = {
|
|||
#undef DEFTREECODE
|
||||
|
||||
/* Adds the tree codes specific to the C front end to the list of all
|
||||
tree codes. */
|
||||
tree codes. */
|
||||
|
||||
void
|
||||
add_c_tree_codes ()
|
||||
|
@ -4053,33 +4053,33 @@ c_expand_builtin (exp, target, tmode, modifier)
|
|||
|
||||
/* Check an arglist to *printf for problems. The arglist should start
|
||||
at the format specifier, with the remaining arguments immediately
|
||||
following it. */
|
||||
following it. */
|
||||
static int
|
||||
is_valid_printf_arglist (arglist)
|
||||
tree arglist;
|
||||
{
|
||||
/* Save this value so we can restore it later. */
|
||||
/* Save this value so we can restore it later. */
|
||||
const int SAVE_pedantic = pedantic;
|
||||
int diagnostic_occurred = 0;
|
||||
|
||||
/* Set this to a known value so the user setting won't affect code
|
||||
generation. */
|
||||
pedantic = 1;
|
||||
/* Check to make sure there are no format specifier errors. */
|
||||
/* Check to make sure there are no format specifier errors. */
|
||||
check_function_format (&diagnostic_occurred,
|
||||
maybe_get_identifier("printf"),
|
||||
NULL_TREE, arglist);
|
||||
|
||||
/* Restore the value of `pedantic'. */
|
||||
/* Restore the value of `pedantic'. */
|
||||
pedantic = SAVE_pedantic;
|
||||
|
||||
/* If calling `check_function_format_ptr' produces a warning, we
|
||||
return false, otherwise we return true. */
|
||||
return false, otherwise we return true. */
|
||||
return ! diagnostic_occurred;
|
||||
}
|
||||
|
||||
/* If the arguments passed to printf are suitable for optimizations,
|
||||
we attempt to transform the call. */
|
||||
we attempt to transform the call. */
|
||||
static rtx
|
||||
c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
|
||||
tree arglist;
|
||||
|
@ -4093,16 +4093,16 @@ c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
|
|||
tree fn, format_arg, stripped_string;
|
||||
|
||||
/* If the return value is used, or the replacement _DECL isn't
|
||||
initialized, don't do the transformation. */
|
||||
initialized, don't do the transformation. */
|
||||
if (!ignore || !fn_putchar || !fn_puts)
|
||||
return 0;
|
||||
|
||||
/* Verify the required arguments in the original call. */
|
||||
/* Verify the required arguments in the original call. */
|
||||
if (arglist == 0
|
||||
|| (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE))
|
||||
return 0;
|
||||
|
||||
/* Check the specifier vs. the parameters. */
|
||||
/* Check the specifier vs. the parameters. */
|
||||
if (!is_valid_printf_arglist (arglist))
|
||||
return 0;
|
||||
|
||||
|
@ -4118,13 +4118,13 @@ c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
|
|||
|
||||
/* OK! We can attempt optimization. */
|
||||
|
||||
/* If the format specifier was "%s\n", call __builtin_puts(arg2). */
|
||||
/* If the format specifier was "%s\n", call __builtin_puts(arg2). */
|
||||
if (strcmp (TREE_STRING_POINTER (stripped_string), "%s\n") == 0)
|
||||
{
|
||||
arglist = TREE_CHAIN (arglist);
|
||||
fn = fn_puts;
|
||||
}
|
||||
/* If the format specifier was "%c", call __builtin_putchar (arg2). */
|
||||
/* If the format specifier was "%c", call __builtin_putchar (arg2). */
|
||||
else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
|
||||
{
|
||||
arglist = TREE_CHAIN (arglist);
|
||||
|
@ -4132,7 +4132,7 @@ c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* We can't handle anything else with % args or %% ... yet. */
|
||||
/* We can't handle anything else with % args or %% ... yet. */
|
||||
if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
|
||||
return 0;
|
||||
|
||||
|
@ -4143,7 +4143,7 @@ c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
|
|||
{
|
||||
/* Given printf("c"), (where c is any one character,)
|
||||
convert "c"[0] to an int and pass that to the replacement
|
||||
function. */
|
||||
function. */
|
||||
arglist = build_int_2 (TREE_STRING_POINTER (stripped_string)[0], 0);
|
||||
arglist = build_tree_list (NULL_TREE, arglist);
|
||||
|
||||
|
@ -4180,7 +4180,7 @@ c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
|
|||
}
|
||||
|
||||
/* If the arguments passed to fprintf are suitable for optimizations,
|
||||
we attempt to transform the call. */
|
||||
we attempt to transform the call. */
|
||||
static rtx
|
||||
c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
|
||||
tree arglist;
|
||||
|
@ -4194,11 +4194,11 @@ c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
|
|||
tree fn, format_arg, stripped_string;
|
||||
|
||||
/* If the return value is used, or the replacement _DECL isn't
|
||||
initialized, don't do the transformation. */
|
||||
initialized, don't do the transformation. */
|
||||
if (!ignore || !fn_fputc || !fn_fputs)
|
||||
return 0;
|
||||
|
||||
/* Verify the required arguments in the original call. */
|
||||
/* Verify the required arguments in the original call. */
|
||||
if (arglist == 0
|
||||
|| (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE)
|
||||
|| (TREE_CHAIN (arglist) == 0)
|
||||
|
@ -4206,7 +4206,7 @@ c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
|
|||
POINTER_TYPE))
|
||||
return 0;
|
||||
|
||||
/* Check the specifier vs. the parameters. */
|
||||
/* Check the specifier vs. the parameters. */
|
||||
if (!is_valid_printf_arglist (TREE_CHAIN (arglist)))
|
||||
return 0;
|
||||
|
||||
|
@ -4222,7 +4222,7 @@ c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
|
|||
|
||||
/* OK! We can attempt optimization. */
|
||||
|
||||
/* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
|
||||
/* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
|
||||
if (strcmp (TREE_STRING_POINTER (stripped_string), "%s") == 0)
|
||||
{
|
||||
tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
|
||||
|
@ -4231,7 +4231,7 @@ c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
|
|||
newarglist);
|
||||
fn = fn_fputs;
|
||||
}
|
||||
/* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
|
||||
/* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
|
||||
else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
|
||||
{
|
||||
tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
|
||||
|
@ -4242,7 +4242,7 @@ c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* We can't handle anything else with % args or %% ... yet. */
|
||||
/* We can't handle anything else with % args or %% ... yet. */
|
||||
if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
|
||||
return 0;
|
||||
|
||||
|
|
|
@ -3098,7 +3098,7 @@ c_make_fname_decl (id, type_dep)
|
|||
build_index_type (size_int (length)));
|
||||
|
||||
decl = build_decl (VAR_DECL, id, type);
|
||||
/* We don't push the decl, so have to set its context here. */
|
||||
/* We don't push the decl, so have to set its context here. */
|
||||
DECL_CONTEXT (decl) = current_function_decl;
|
||||
|
||||
TREE_STATIC (decl) = 1;
|
||||
|
|
24
gcc/c-dump.c
24
gcc/c-dump.c
|
@ -139,9 +139,9 @@ queue_and_dump_type (di, t)
|
|||
}
|
||||
|
||||
/* Dump column control */
|
||||
#define SOL_COLUMN 25 /* Start of line column. */
|
||||
#define EOL_COLUMN 55 /* End of line column. */
|
||||
#define COLUMN_ALIGNMENT 15 /* Alignment. */
|
||||
#define SOL_COLUMN 25 /* Start of line column. */
|
||||
#define EOL_COLUMN 55 /* End of line column. */
|
||||
#define COLUMN_ALIGNMENT 15 /* Alignment. */
|
||||
|
||||
/* Insert a new line in the dump output, and indent to an appropriate
|
||||
place to start printing more fields. */
|
||||
|
@ -736,7 +736,7 @@ dequeue_and_dump (di)
|
|||
}
|
||||
|
||||
/* Return non-zero if FLAG has been specified for the dump, and NODE
|
||||
is not the root node of the dump. */
|
||||
is not the root node of the dump. */
|
||||
|
||||
int dump_flag (di, flag, node)
|
||||
dump_info_p di;
|
||||
|
@ -786,16 +786,16 @@ dump_node (t, flags, stream)
|
|||
splay_tree_delete (di.nodes);
|
||||
}
|
||||
|
||||
/* Define a tree dump switch. */
|
||||
/* Define a tree dump switch. */
|
||||
struct dump_file_info
|
||||
{
|
||||
const char *suffix; /* suffix to give output file. */
|
||||
const char *suffix; /* suffix to give output file. */
|
||||
const char *swtch; /* command line switch */
|
||||
int flags; /* user flags */
|
||||
int state; /* state of play */
|
||||
};
|
||||
|
||||
/* Table of tree dump switches. */
|
||||
/* Table of tree dump switches. */
|
||||
static struct dump_file_info dump_files[TDI_end] =
|
||||
{
|
||||
{".tu", "dump-translation-unit", 0, 0},
|
||||
|
@ -808,7 +808,7 @@ static struct dump_file_info dump_files[TDI_end] =
|
|||
/* Begin a tree dump for PHASE. Stores any user supplied flag in
|
||||
*FLAG_PTR and returns a stream to write to. If the dump is not
|
||||
enabled, returns NULL.
|
||||
Multiple calls will reopen and append to the dump file. */
|
||||
Multiple calls will reopen and append to the dump file. */
|
||||
|
||||
FILE *
|
||||
dump_begin (phase, flag_ptr)
|
||||
|
@ -834,7 +834,7 @@ dump_begin (phase, flag_ptr)
|
|||
return stream;
|
||||
}
|
||||
|
||||
/* Returns non-zero if tree dump PHASE is enabled. */
|
||||
/* Returns non-zero if tree dump PHASE is enabled. */
|
||||
|
||||
int
|
||||
dump_enabled_p (phase)
|
||||
|
@ -843,7 +843,7 @@ dump_enabled_p (phase)
|
|||
return dump_files[phase].state;
|
||||
}
|
||||
|
||||
/* Returns the switch name of PHASE. */
|
||||
/* Returns the switch name of PHASE. */
|
||||
|
||||
const char *
|
||||
dump_flag_name (phase)
|
||||
|
@ -853,7 +853,7 @@ dump_flag_name (phase)
|
|||
}
|
||||
|
||||
/* Finish a tree dump for PHASE. STREAM is the stream created by
|
||||
dump_begin. */
|
||||
dump_begin. */
|
||||
|
||||
void
|
||||
dump_end (phase, stream)
|
||||
|
@ -864,7 +864,7 @@ dump_end (phase, stream)
|
|||
}
|
||||
|
||||
/* Parse ARG as a dump switch. Return non-zero if it is, and store the
|
||||
relevant details in the dump_files array. */
|
||||
relevant details in the dump_files array. */
|
||||
|
||||
int
|
||||
dump_switch_p (arg)
|
||||
|
|
12
gcc/c-lex.c
12
gcc/c-lex.c
|
@ -73,7 +73,7 @@ extern FILE *asm_out_file;
|
|||
/* Number of bytes in a wide character. */
|
||||
#define WCHAR_BYTES (WCHAR_TYPE_SIZE / BITS_PER_UNIT)
|
||||
|
||||
int indent_level; /* Number of { minus number of }. */
|
||||
int indent_level; /* Number of { minus number of }. */
|
||||
int pending_lang_change; /* If we need to switch languages - C++ only */
|
||||
int c_header_level; /* depth in C headers - C++ only */
|
||||
|
||||
|
@ -309,7 +309,7 @@ cb_def_pragma (pfile)
|
|||
{
|
||||
/* 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. */
|
||||
-Wunknown-pragmas has been given. */
|
||||
if (warn_unknown_pragmas > in_system_header)
|
||||
{
|
||||
const unsigned char *space, *name = 0;
|
||||
|
@ -826,7 +826,7 @@ lex_number (str, len)
|
|||
Two HOST_WIDE_INTs is the largest int literal we can store.
|
||||
In order to detect overflow below, the number of parts (TOTAL_PARTS)
|
||||
must be exactly the number of parts needed to hold the bits
|
||||
of two HOST_WIDE_INTs. */
|
||||
of two HOST_WIDE_INTs. */
|
||||
#define TOTAL_PARTS ((HOST_BITS_PER_WIDE_INT / HOST_BITS_PER_CHAR) * 2)
|
||||
unsigned int parts[TOTAL_PARTS];
|
||||
|
||||
|
@ -936,7 +936,7 @@ lex_number (str, len)
|
|||
/* If the highest-order part overflows (gets larger than
|
||||
a host char will hold) then the whole number has
|
||||
overflowed. Record this and truncate the highest-order
|
||||
part. */
|
||||
part. */
|
||||
if (parts[TOTAL_PARTS - 1] >> HOST_BITS_PER_CHAR)
|
||||
{
|
||||
overflow = 1;
|
||||
|
@ -1123,7 +1123,7 @@ lex_number (str, len)
|
|||
}
|
||||
}
|
||||
|
||||
/* If the literal overflowed, pedwarn about it now. */
|
||||
/* If the literal overflowed, pedwarn about it now. */
|
||||
if (overflow)
|
||||
{
|
||||
warn = 1;
|
||||
|
@ -1264,7 +1264,7 @@ lex_number (str, len)
|
|||
TREE_TYPE (value) = type;
|
||||
|
||||
/* If it's still an integer (not a complex), and it doesn't
|
||||
fit in the type we choose for it, then pedwarn. */
|
||||
fit in the type we choose for it, then pedwarn. */
|
||||
|
||||
if (! warn
|
||||
&& TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
|
||||
|
|
|
@ -53,7 +53,7 @@ static struct align_stack * alignment_stack = NULL;
|
|||
#pragma pack(push,<n>) is encountered, this stores the value of
|
||||
maximum_field_alignment in effect. When the final pop_alignment()
|
||||
happens, we restore the value to this, not to a value of 0 for
|
||||
maximum_field_alignment. Value is in bits. */
|
||||
maximum_field_alignment. Value is in bits. */
|
||||
static int default_alignment;
|
||||
#define SET_GLOBAL_ALIGNMENT(ALIGN) \
|
||||
(default_alignment = maximum_field_alignment = (ALIGN))
|
||||
|
@ -84,7 +84,7 @@ push_alignment (alignment, id)
|
|||
|
||||
/* The current value of maximum_field_alignment is not necessarily
|
||||
0 since there may be a #pragma pack(<n>) in effect; remember it
|
||||
so that we can restore it after the final #pragma pop(). */
|
||||
so that we can restore it after the final #pragma pop(). */
|
||||
if (alignment_stack == NULL)
|
||||
default_alignment = maximum_field_alignment;
|
||||
|
||||
|
|
|
@ -278,7 +278,7 @@ emit_local_var (decl)
|
|||
expand_end_target_temps ();
|
||||
}
|
||||
|
||||
/* Helper for generating the RTL at the beginning of a scope. */
|
||||
/* Helper for generating the RTL at the beginning of a scope. */
|
||||
|
||||
void
|
||||
genrtl_do_pushlevel ()
|
||||
|
@ -287,7 +287,7 @@ genrtl_do_pushlevel ()
|
|||
clear_last_expr ();
|
||||
}
|
||||
|
||||
/* Generate the RTL for DESTINATION, which is a GOTO_STMT. */
|
||||
/* Generate the RTL for DESTINATION, which is a GOTO_STMT. */
|
||||
|
||||
void
|
||||
genrtl_goto_stmt (destination)
|
||||
|
@ -312,7 +312,7 @@ genrtl_goto_stmt (destination)
|
|||
expand_computed_goto (destination);
|
||||
}
|
||||
|
||||
/* Generate the RTL for EXPR, which is an EXPR_STMT. */
|
||||
/* Generate the RTL for EXPR, which is an EXPR_STMT. */
|
||||
|
||||
void
|
||||
genrtl_expr_stmt (expr)
|
||||
|
@ -333,7 +333,7 @@ genrtl_expr_stmt (expr)
|
|||
}
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a DECL_STMT. */
|
||||
/* Generate the RTL for T, which is a DECL_STMT. */
|
||||
|
||||
void
|
||||
genrtl_decl_stmt (t)
|
||||
|
@ -368,7 +368,7 @@ genrtl_decl_stmt (t)
|
|||
(*lang_expand_decl_stmt) (t);
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is an IF_STMT. */
|
||||
/* Generate the RTL for T, which is an IF_STMT. */
|
||||
|
||||
void
|
||||
genrtl_if_stmt (t)
|
||||
|
@ -389,7 +389,7 @@ genrtl_if_stmt (t)
|
|||
expand_end_cond ();
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a WHILE_STMT. */
|
||||
/* Generate the RTL for T, which is a WHILE_STMT. */
|
||||
|
||||
void
|
||||
genrtl_while_stmt (t)
|
||||
|
@ -411,7 +411,7 @@ genrtl_while_stmt (t)
|
|||
expand_end_loop ();
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a DO_STMT. */
|
||||
/* Generate the RTL for T, which is a DO_STMT. */
|
||||
|
||||
void
|
||||
genrtl_do_stmt (t)
|
||||
|
@ -445,7 +445,7 @@ genrtl_do_stmt (t)
|
|||
}
|
||||
}
|
||||
|
||||
/* Build the node for a return statement and return it. */
|
||||
/* Build the node for a return statement and return it. */
|
||||
|
||||
tree
|
||||
build_return_stmt (expr)
|
||||
|
@ -454,7 +454,7 @@ build_return_stmt (expr)
|
|||
return (build_stmt (RETURN_STMT, expr));
|
||||
}
|
||||
|
||||
/* Generate the RTL for STMT, which is a RETURN_STMT. */
|
||||
/* Generate the RTL for STMT, which is a RETURN_STMT. */
|
||||
|
||||
void
|
||||
genrtl_return_stmt (stmt)
|
||||
|
@ -481,7 +481,7 @@ genrtl_return_stmt (stmt)
|
|||
}
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a FOR_STMT. */
|
||||
/* Generate the RTL for T, which is a FOR_STMT. */
|
||||
|
||||
void
|
||||
genrtl_for_stmt (t)
|
||||
|
@ -527,7 +527,7 @@ genrtl_for_stmt (t)
|
|||
expand_end_loop ();
|
||||
}
|
||||
|
||||
/* Build a break statement node and return it. */
|
||||
/* Build a break statement node and return it. */
|
||||
|
||||
tree
|
||||
build_break_stmt ()
|
||||
|
@ -535,7 +535,7 @@ build_break_stmt ()
|
|||
return (build_stmt (BREAK_STMT));
|
||||
}
|
||||
|
||||
/* Generate the RTL for a BREAK_STMT. */
|
||||
/* Generate the RTL for a BREAK_STMT. */
|
||||
|
||||
void
|
||||
genrtl_break_stmt ()
|
||||
|
@ -545,7 +545,7 @@ genrtl_break_stmt ()
|
|||
error ("break statement not within loop or switch");
|
||||
}
|
||||
|
||||
/* Build a continue statement node and return it. */
|
||||
/* Build a continue statement node and return it. */
|
||||
|
||||
tree
|
||||
build_continue_stmt ()
|
||||
|
@ -553,7 +553,7 @@ build_continue_stmt ()
|
|||
return (build_stmt (CONTINUE_STMT));
|
||||
}
|
||||
|
||||
/* Generate the RTL for a CONTINUE_STMT. */
|
||||
/* Generate the RTL for a CONTINUE_STMT. */
|
||||
|
||||
void
|
||||
genrtl_continue_stmt ()
|
||||
|
@ -563,7 +563,7 @@ genrtl_continue_stmt ()
|
|||
error ("continue statement not within a loop");
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a SCOPE_STMT. */
|
||||
/* Generate the RTL for T, which is a SCOPE_STMT. */
|
||||
|
||||
void
|
||||
genrtl_scope_stmt (t)
|
||||
|
@ -608,7 +608,7 @@ genrtl_scope_stmt (t)
|
|||
}
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a SWITCH_STMT. */
|
||||
/* Generate the RTL for T, which is a SWITCH_STMT. */
|
||||
|
||||
void
|
||||
genrtl_switch_stmt (t)
|
||||
|
@ -620,7 +620,7 @@ genrtl_switch_stmt (t)
|
|||
cond = expand_cond (SWITCH_COND (t));
|
||||
if (cond == error_mark_node)
|
||||
/* The code is in error, but we don't want expand_end_case to
|
||||
crash. */
|
||||
crash. */
|
||||
cond = boolean_false_node;
|
||||
|
||||
emit_line_note (input_filename, lineno);
|
||||
|
@ -629,7 +629,7 @@ genrtl_switch_stmt (t)
|
|||
expand_end_case (cond);
|
||||
}
|
||||
|
||||
/* Create a CASE_LABEL tree node and return it. */
|
||||
/* Create a CASE_LABEL tree node and return it. */
|
||||
|
||||
tree
|
||||
build_case_label (low_value, high_value, label_decl)
|
||||
|
@ -641,7 +641,7 @@ build_case_label (low_value, high_value, label_decl)
|
|||
}
|
||||
|
||||
|
||||
/* Generate the RTL for a CASE_LABEL. */
|
||||
/* Generate the RTL for a CASE_LABEL. */
|
||||
|
||||
void
|
||||
genrtl_case_label (case_label)
|
||||
|
@ -668,7 +668,7 @@ genrtl_case_label (case_label)
|
|||
CASE_LABEL_DECL (case_label), &duplicate);
|
||||
}
|
||||
|
||||
/* Generate the RTL for T, which is a COMPOUND_STMT. */
|
||||
/* Generate the RTL for T, which is a COMPOUND_STMT. */
|
||||
|
||||
void
|
||||
genrtl_compound_stmt (t)
|
||||
|
@ -687,7 +687,7 @@ genrtl_compound_stmt (t)
|
|||
#endif
|
||||
}
|
||||
|
||||
/* Generate the RTL for an ASM_STMT. */
|
||||
/* Generate the RTL for an ASM_STMT. */
|
||||
|
||||
void
|
||||
genrtl_asm_stmt (cv_qualifier, string, output_operands,
|
||||
|
@ -716,7 +716,7 @@ genrtl_asm_stmt (cv_qualifier, string, output_operands,
|
|||
input_filename, lineno);
|
||||
}
|
||||
|
||||
/* Generate the RTL for a DECL_CLEANUP. */
|
||||
/* Generate the RTL for a DECL_CLEANUP. */
|
||||
|
||||
void
|
||||
genrtl_decl_cleanup (decl, cleanup)
|
||||
|
@ -740,7 +740,7 @@ prep_stmt (t)
|
|||
}
|
||||
|
||||
/* Generate the RTL for the statement T, its substatements, and any
|
||||
other statements at its nesting level. */
|
||||
other statements at its nesting level. */
|
||||
|
||||
void
|
||||
expand_stmt (t)
|
||||
|
|
|
@ -5850,7 +5850,7 @@ add_pending_init (purpose, value)
|
|||
{
|
||||
if (r->balance < 0)
|
||||
{
|
||||
/* L rotation. */
|
||||
/* L rotation. */
|
||||
p->left = r->right;
|
||||
if (p->left)
|
||||
p->left->parent = p;
|
||||
|
@ -5874,7 +5874,7 @@ add_pending_init (purpose, value)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* LR rotation. */
|
||||
/* LR rotation. */
|
||||
struct init_node *t = r->right;
|
||||
|
||||
r->right = t->left;
|
||||
|
@ -5923,7 +5923,7 @@ add_pending_init (purpose, value)
|
|||
{
|
||||
if (r->balance > 0)
|
||||
{
|
||||
/* R rotation. */
|
||||
/* R rotation. */
|
||||
p->right = r->left;
|
||||
if (p->right)
|
||||
p->right->parent = p;
|
||||
|
@ -5982,7 +5982,7 @@ add_pending_init (purpose, value)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* p->balance == -1; growth of right side balances the node. */
|
||||
/* p->balance == -1; growth of right side balances the node. */
|
||||
p->balance = 0;
|
||||
break;
|
||||
}
|
||||
|
|
|
@ -4619,7 +4619,7 @@ store_one_arg (arg, argblock, flags, variable_size, reg_parm_stack_space)
|
|||
}
|
||||
|
||||
/* If parm is passed both in stack and in register and offset is
|
||||
greater than reg_parm_stack_space, split the offset. */
|
||||
greater than reg_parm_stack_space, split the offset. */
|
||||
if (arg->reg && arg->pass_on_stack)
|
||||
{
|
||||
if (arg->offset.constant < reg_parm_stack_space && arg->offset.var)
|
||||
|
|
|
@ -33,7 +33,7 @@ Boston, MA 02111-1307, USA. */
|
|||
# define SIGCHLD SIGCLD
|
||||
#endif
|
||||
|
||||
#ifdef vfork /* Autoconf may define this to fork for us. */
|
||||
#ifdef vfork /* Autoconf may define this to fork for us. */
|
||||
# define VFORK_STRING "fork"
|
||||
#else
|
||||
# define VFORK_STRING "vfork"
|
||||
|
@ -258,7 +258,7 @@ struct path_prefix
|
|||
};
|
||||
|
||||
#ifdef COLLECT_EXPORT_LIST
|
||||
/* Lists to keep libraries to be scanned for global constructors/destructors. */
|
||||
/* Lists to keep libraries to be scanned for global constructors/destructors. */
|
||||
static struct head libs; /* list of libraries */
|
||||
static struct path_prefix cmdline_lib_dirs; /* directories specified with -L */
|
||||
static struct path_prefix libpath_lib_dirs; /* directories in LIBPATH */
|
||||
|
@ -1435,7 +1435,7 @@ main (argc, argv)
|
|||
return 0;
|
||||
}
|
||||
|
||||
/* Sort ctor and dtor lists by priority. */
|
||||
/* Sort ctor and dtor lists by priority. */
|
||||
sort_ids (&constructors);
|
||||
sort_ids (&destructors);
|
||||
|
||||
|
@ -1711,7 +1711,7 @@ extract_init_priority (name)
|
|||
++pos;
|
||||
pos += 10; /* strlen ("GLOBAL__X_") */
|
||||
|
||||
/* Extract init_p number from ctor/dtor name. */
|
||||
/* Extract init_p number from ctor/dtor name. */
|
||||
pri = atoi (name + pos);
|
||||
return pri ? pri : DEFAULT_INIT_PRIORITY;
|
||||
}
|
||||
|
@ -2957,7 +2957,7 @@ static const char *aix_std_libs[] = {
|
|||
};
|
||||
|
||||
/* This function checks the filename and returns 1
|
||||
if this name matches the location of a standard AIX library. */
|
||||
if this name matches the location of a standard AIX library. */
|
||||
static int
|
||||
ignore_library (name)
|
||||
const char *name;
|
||||
|
|
|
@ -84,7 +84,7 @@ Boston, MA 02111-1307, USA. */
|
|||
#include "basic-block.h"
|
||||
#include "insn-config.h"
|
||||
#include "function.h"
|
||||
/* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
|
||||
/* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
|
||||
#include "expr.h"
|
||||
#include "insn-attr.h"
|
||||
#include "recog.h"
|
||||
|
@ -2469,7 +2469,7 @@ try_combine (i3, i2, i1, new_direct_jump_p)
|
|||
}
|
||||
#ifdef HAVE_cc0
|
||||
/* If I2 is the setter CC0 and I3 is the user CC0 then check whether
|
||||
they are adjacent to each other or not. */
|
||||
they are adjacent to each other or not. */
|
||||
{
|
||||
rtx p = prev_nonnote_insn (i3);
|
||||
if (p && p != i2 && GET_CODE (p) == INSN && newi2pat
|
||||
|
@ -3056,7 +3056,7 @@ find_split_point (loc, insn)
|
|||
|
||||
case NE:
|
||||
/* if STORE_FLAG_VALUE is -1, this is (NE X 0) and only one bit of X
|
||||
is known to be on, this can be converted into a NEG of a shift. */
|
||||
is known to be on, this can be converted into a NEG of a shift. */
|
||||
if (STORE_FLAG_VALUE == -1 && XEXP (SET_SRC (x), 1) == const0_rtx
|
||||
&& GET_MODE (SET_SRC (x)) == GET_MODE (XEXP (SET_SRC (x), 0))
|
||||
&& 1 <= (pos = exact_log2
|
||||
|
|
|
@ -103,7 +103,7 @@ struct conflict_graph_def
|
|||
conflicts exist involving that reg. */
|
||||
conflict_graph_arc *neighbor_heads;
|
||||
|
||||
/* Arcs are allocated from here. */
|
||||
/* Arcs are allocated from here. */
|
||||
struct obstack arc_obstack;
|
||||
};
|
||||
|
||||
|
@ -122,7 +122,7 @@ static int print_conflict PARAMS ((int, int, void *));
|
|||
static void mark_reg PARAMS ((rtx, rtx, void *));
|
||||
|
||||
/* Callback function to compute the hash value of an arc. Uses
|
||||
current_graph to locate the graph to which the arc belongs. */
|
||||
current_graph to locate the graph to which the arc belongs. */
|
||||
|
||||
static unsigned
|
||||
arc_hash (arcp)
|
||||
|
|
|
@ -219,11 +219,11 @@ open_file (pfile, filename)
|
|||
return 0;
|
||||
}
|
||||
|
||||
/* Don't reopen an idempotent file. */
|
||||
/* Don't reopen an idempotent file. */
|
||||
if (DO_NOT_REREAD (file))
|
||||
return file;
|
||||
|
||||
/* Don't reopen one which is already loaded. */
|
||||
/* Don't reopen one which is already loaded. */
|
||||
if (file->buffer != NULL)
|
||||
return file;
|
||||
|
||||
|
@ -1066,11 +1066,11 @@ _cpp_simplify_pathname (path)
|
|||
return path;
|
||||
|
||||
#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
|
||||
/* Convert all backslashes to slashes. */
|
||||
/* Convert all backslashes to slashes. */
|
||||
for (from = path; *from; from++)
|
||||
if (*from == '\\') *from = '/';
|
||||
|
||||
/* Skip over leading drive letter if present. */
|
||||
/* Skip over leading drive letter if present. */
|
||||
if (ISALPHA (path[0]) && path[1] == ':')
|
||||
from = to = &path[2];
|
||||
else
|
||||
|
|
|
@ -38,7 +38,7 @@ Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
|||
|
||||
/* Windows does not natively support inodes, and neither does MSDOS.
|
||||
Cygwin's emulation can generate non-unique inodes, so don't use it.
|
||||
VMS has non-numeric inodes. */
|
||||
VMS has non-numeric inodes. */
|
||||
#ifdef VMS
|
||||
# define INO_T_EQ(a, b) (!memcmp (&(a), &(b), sizeof (a)))
|
||||
#else
|
||||
|
@ -198,7 +198,7 @@ path_include (pfile, list, path)
|
|||
}
|
||||
|
||||
/* Append DIR to include path PATH. DIR must be permanently allocated
|
||||
and writable. */
|
||||
and writable. */
|
||||
static void
|
||||
append_include_chain (pfile, dir, path, cxx_aware)
|
||||
cpp_reader *pfile;
|
||||
|
@ -241,7 +241,7 @@ append_include_chain (pfile, dir, path, cxx_aware)
|
|||
new->dev = st.st_dev;
|
||||
/* Both systm and after include file lists should be treated as system
|
||||
include files since these two lists are really just a concatenation
|
||||
of one "system" list. */
|
||||
of one "system" list. */
|
||||
if (path == SYSTEM || path == AFTER)
|
||||
#ifdef NO_IMPLICIT_EXTERN_C
|
||||
new->sysp = 1;
|
||||
|
@ -468,7 +468,7 @@ init_library ()
|
|||
}
|
||||
}
|
||||
|
||||
/* Initialize a cpp_reader structure. */
|
||||
/* Initialize a cpp_reader structure. */
|
||||
cpp_reader *
|
||||
cpp_create_reader (table, lang)
|
||||
hash_table *table;
|
||||
|
@ -809,7 +809,7 @@ init_standard_includes (pfile)
|
|||
if (specd_prefix != 0 && cpp_GCC_INCLUDE_DIR_len)
|
||||
{
|
||||
/* Remove the `include' from /usr/local/lib/gcc.../include.
|
||||
GCC_INCLUDE_DIR will always end in /include. */
|
||||
GCC_INCLUDE_DIR will always end in /include. */
|
||||
int default_len = cpp_GCC_INCLUDE_DIR_len;
|
||||
char *default_prefix = (char *) alloca (default_len + 1);
|
||||
int specd_len = strlen (specd_prefix);
|
||||
|
@ -1399,7 +1399,7 @@ cpp_handle_option (pfile, argc, argv)
|
|||
CPP_OPTION (pfile, no_standard_includes) = 1;
|
||||
break;
|
||||
case OPT_nostdincplusplus:
|
||||
/* -nostdinc++ causes no default C++-specific include directories. */
|
||||
/* -nostdinc++ causes no default C++-specific include directories. */
|
||||
CPP_OPTION (pfile, no_standard_cplusplus_includes) = 1;
|
||||
break;
|
||||
case OPT_o:
|
||||
|
@ -1696,7 +1696,7 @@ cpp_post_options (pfile)
|
|||
if (CPP_OPTION (pfile, cplusplus))
|
||||
CPP_OPTION (pfile, warn_traditional) = 0;
|
||||
|
||||
/* Set this if it hasn't been set already. */
|
||||
/* Set this if it hasn't been set already. */
|
||||
if (CPP_OPTION (pfile, user_label_prefix) == NULL)
|
||||
CPP_OPTION (pfile, user_label_prefix) = USER_LABEL_PREFIX;
|
||||
|
||||
|
@ -1780,7 +1780,7 @@ print_help ()
|
|||
{
|
||||
fprintf (stderr, _("Usage: %s [switches] input output\n"), progname);
|
||||
/* To keep the lines from getting too long for some compilers, limit
|
||||
to about 500 characters (6 lines) per chunk. */
|
||||
to about 500 characters (6 lines) per chunk. */
|
||||
fputs (_("\
|
||||
Switches:\n\
|
||||
-include <file> Include the contents of <file> before other files\n\
|
||||
|
|
|
@ -447,7 +447,7 @@ skip_whitespace (pfile, c)
|
|||
break;
|
||||
c = *buffer->cur++;
|
||||
}
|
||||
/* We only want non-vertical space, i.e. ' ' \t \f \v \0. */
|
||||
/* We only want non-vertical space, i.e. ' ' \t \f \v \0. */
|
||||
while (is_nvspace (c));
|
||||
|
||||
/* Remember the next character. */
|
||||
|
@ -960,7 +960,7 @@ _cpp_lex_token (pfile, result)
|
|||
case '$':
|
||||
if (!CPP_OPTION (pfile, dollars_in_ident))
|
||||
goto random_char;
|
||||
/* Fall through... */
|
||||
/* Fall through... */
|
||||
|
||||
case '_':
|
||||
case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
|
||||
|
|
12
gcc/cpplib.c
12
gcc/cpplib.c
|
@ -154,7 +154,7 @@ SCCS_ENTRY /* 0 SVR4? */
|
|||
instead of void, because some old compilers have trouble with
|
||||
pointers to functions returning void. */
|
||||
|
||||
/* Don't invoke CONCAT2 with any whitespace or K&R cc will fail. */
|
||||
/* Don't invoke CONCAT2 with any whitespace or K&R cc will fail. */
|
||||
#define D(name, t, o, f) static void CONCAT2(do_,name) PARAMS ((cpp_reader *));
|
||||
DIRECTIVE_TABLE
|
||||
#undef D
|
||||
|
@ -167,7 +167,7 @@ enum
|
|||
};
|
||||
#undef D
|
||||
|
||||
/* Don't invoke CONCAT2 with any whitespace or K&R cc will fail. */
|
||||
/* Don't invoke CONCAT2 with any whitespace or K&R cc will fail. */
|
||||
#define D(name, t, origin, flags) \
|
||||
{ CONCAT2(do_,name), (const U_CHAR *) STRINGX(name), \
|
||||
sizeof STRINGX(name) - 1, origin, flags },
|
||||
|
@ -914,7 +914,7 @@ do_ident (pfile)
|
|||
This implementation never macro-expands the text after #pragma. */
|
||||
|
||||
/* Sub-handlers for the pragmas needing treatment here.
|
||||
They return 1 if the token buffer is to be popped, 0 if not. */
|
||||
They return 1 if the token buffer is to be popped, 0 if not. */
|
||||
struct pragma_entry
|
||||
{
|
||||
struct pragma_entry *next;
|
||||
|
@ -1647,7 +1647,7 @@ do_unassert (pfile)
|
|||
/* Process the string STR as if it appeared as the body of a #define.
|
||||
If STR is just an identifier, define it with value 1.
|
||||
If STR has anything after the identifier, then it should
|
||||
be identifier=definition. */
|
||||
be identifier=definition. */
|
||||
|
||||
void
|
||||
cpp_define (pfile, str)
|
||||
|
@ -1696,7 +1696,7 @@ cpp_undef (pfile, macro)
|
|||
run_directive (pfile, T_UNDEF, BUF_CL_OPTION, macro, strlen (macro));
|
||||
}
|
||||
|
||||
/* Process the string STR as if it appeared as the body of a #assert. */
|
||||
/* Process the string STR as if it appeared as the body of a #assert. */
|
||||
void
|
||||
cpp_assert (pfile, str)
|
||||
cpp_reader *pfile;
|
||||
|
@ -1705,7 +1705,7 @@ cpp_assert (pfile, str)
|
|||
handle_assertion (pfile, str, T_ASSERT);
|
||||
}
|
||||
|
||||
/* Process STR as if it appeared as the body of an #unassert. */
|
||||
/* Process STR as if it appeared as the body of an #unassert. */
|
||||
void
|
||||
cpp_unassert (pfile, str)
|
||||
cpp_reader *pfile;
|
||||
|
|
|
@ -1195,7 +1195,7 @@ warn_of_redefinition (pfile, node, macro2)
|
|||
return 0;
|
||||
|
||||
/* Redefinition of a macro is allowed if and only if the old and new
|
||||
definitions are the same. (6.10.3 paragraph 2). */
|
||||
definitions are the same. (6.10.3 paragraph 2). */
|
||||
macro1 = node->value.macro;
|
||||
|
||||
/* The quick failures. */
|
||||
|
|
|
@ -27,7 +27,7 @@ Boston, MA 02111-1307, USA. */
|
|||
are errors. It defaults to -x c for files with unrecognized
|
||||
extensions, unless -x options appear in argv, in which case we
|
||||
assume the user knows what they're doing. If no explicit input is
|
||||
mentioned, it will read stdin. */
|
||||
mentioned, it will read stdin. */
|
||||
|
||||
/* Snarfed from gcc.c: */
|
||||
|
||||
|
@ -69,7 +69,7 @@ static const char *const known_suffixes[] =
|
|||
NULL
|
||||
};
|
||||
|
||||
/* Filter argc and argv before processing by the gcc driver proper. */
|
||||
/* Filter argc and argv before processing by the gcc driver proper. */
|
||||
void
|
||||
lang_specific_driver (in_argc, in_argv, in_added_libraries)
|
||||
int *in_argc;
|
||||
|
@ -92,7 +92,7 @@ lang_specific_driver (in_argc, in_argv, in_added_libraries)
|
|||
int seen_input = 0;
|
||||
|
||||
/* Positions to insert -xc, -xassembler-with-cpp, and -o, if necessary.
|
||||
0 means unnecessary. */
|
||||
0 means unnecessary. */
|
||||
int lang_c_here = 0;
|
||||
int lang_S_here = 0;
|
||||
int o_here = 0;
|
||||
|
@ -227,11 +227,11 @@ lang_specific_driver (in_argc, in_argv, in_added_libraries)
|
|||
*in_argv = new_argv;
|
||||
}
|
||||
|
||||
/* Called before linking. Returns 0 on success and -1 on failure. */
|
||||
/* Called before linking. Returns 0 on success and -1 on failure. */
|
||||
int lang_specific_pre_link ()
|
||||
{
|
||||
return 0; /* Not used for cpp. */
|
||||
return 0; /* Not used for cpp. */
|
||||
}
|
||||
|
||||
/* Number of extra output files that lang_specific_pre_link may generate. */
|
||||
int lang_specific_extra_outfiles = 0; /* Not used for cpp. */
|
||||
/* Number of extra output files that lang_specific_pre_link may generate. */
|
||||
int lang_specific_extra_outfiles = 0; /* Not used for cpp. */
|
||||
|
|
|
@ -556,13 +556,13 @@ STATIC ui32 __FRAME_END__[] __attribute__ ((__unused__)) = { 0 };
|
|||
by putting a constructor in crtbegin.o and a destructor in crtend.o.
|
||||
|
||||
crtend.o also puts in the terminating zero in the frame information
|
||||
segment. */
|
||||
segment. */
|
||||
|
||||
/* The crtstuff for other object formats use the symbol __EH_FRAME_BEGIN__
|
||||
to figure out the start of the exception frame, but here we use
|
||||
getsectbynamefromheader to find this value. Either method would work,
|
||||
but this method avoids creating any global symbols, which seems
|
||||
cleaner. */
|
||||
cleaner. */
|
||||
|
||||
#include <mach-o/ldsyms.h>
|
||||
extern const struct section *
|
||||
|
@ -600,7 +600,7 @@ __dereg_frame_dtor (void)
|
|||
__deregister_frame_info ((void *) eh_frame->addr);
|
||||
}
|
||||
|
||||
/* Terminate the frame section with a final zero. */
|
||||
/* Terminate the frame section with a final zero. */
|
||||
|
||||
/* Force cc1 to switch to .data section. */
|
||||
static void * force_to_data[1] __attribute__ ((__unused__)) = { };
|
||||
|
|
|
@ -6251,7 +6251,7 @@ cse_insn (insn, libcall_insn)
|
|||
|
||||
This section previously turned the REG_EQUIV into a REG_EQUAL
|
||||
note. We cannot do that because REG_EQUIV may provide an
|
||||
uninitialised stack slot when REG_PARM_STACK_SPACE is used. */
|
||||
uninitialised stack slot when REG_PARM_STACK_SPACE is used. */
|
||||
|
||||
if (prev != 0 && GET_CODE (prev) == INSN
|
||||
&& GET_CODE (PATTERN (prev)) == SET
|
||||
|
@ -7381,7 +7381,7 @@ check_for_label_ref (rtl, data)
|
|||
/* If this insn uses a LABEL_REF and there isn't a REG_LABEL note for it,
|
||||
we must rerun jump since it needs to place the note. If this is a
|
||||
LABEL_REF for a CODE_LABEL that isn't in the insn chain, don't do this
|
||||
since no REG_LABEL will be added. */
|
||||
since no REG_LABEL will be added. */
|
||||
return (GET_CODE (*rtl) == LABEL_REF
|
||||
&& INSN_UID (XEXP (*rtl, 0)) != 0
|
||||
&& ! find_reg_note (insn, REG_LABEL, XEXP (*rtl, 0)));
|
||||
|
|
|
@ -992,7 +992,7 @@ cselib_mem_conflict_p (mem_base, val)
|
|||
code = GET_CODE (val);
|
||||
switch (code)
|
||||
{
|
||||
/* Get rid of a few simple cases quickly. */
|
||||
/* Get rid of a few simple cases quickly. */
|
||||
case REG:
|
||||
case PC:
|
||||
case CC0:
|
||||
|
|
Loading…
Add table
Reference in a new issue