espressif/binutils-gdb
1
0
Fork 0
mirror of https://github.com/espressif/binutils-gdb.git synced 2025-06-05 06:23:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

c-exp.y: misc cleanup, no code changes

Browse Source 
gdb/ChangeLog:

	* c-exp.y: Whitespace cleanup.
	(classify_inner_name): Remove extra ;.
This commit is contained in:
Doug Evans
2015-01-03 12:01:29 -08:00
parent cc73dbcc08
commit 4d29c0a8b7
2 changed files with 36 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
gdb/ChangeLog
View File

@ -1,3 +1,8 @@
2015-01-03 Doug Evans <xdje42@gmail.com>
* c-exp.y: Whitespace cleanup.
(classify_inner_name): Remove extra ;.
2015-01-02 Maciej W. Rozycki <macro@codesourcery.com>
* mips-tdep.c (mips32_scan_prologue): Keep the extracted stack

10
gdb/c-exp.y
View File

@ -1679,6 +1679,7 @@ write_destructor_name (struct parser_state *par_state, struct stoken token)
/* Returns a stoken of the operator name given by OP (which does not
include the string "operator"). */
static struct stoken
operator_stoken (const char *op)
{
@ -2159,6 +2160,7 @@ c_parse_escape (const char **ptr, struct obstack *output)
stored in VALUE. This returns a token value, either STRING or
CHAR, depending on what was parsed. *HOST_CHARS is set to the
number of host characters in the literal. */
static int
parse_string_or_char (const char *tokptr, const char **outptr,
struct typed_stoken *value, int *host_chars)
@ -2408,14 +2410,12 @@ scan_macro_expansion (char *expansion)
lexptr = copy;
}
static int
scanning_macro_expansion (void)
{
return macro_original_text != 0;
}
static void
finished_macro_expansion (void)
{
@ -2427,7 +2427,6 @@ finished_macro_expansion (void)
macro_original_text = 0;
}
static void
scan_macro_cleanup (void *dummy)
{
@ -2754,7 +2753,6 @@ lex_one_token (struct parser_state *par_state, int *is_quoted_name)
that we look ahead only when the '<' adjoins non-whitespace
characters; for comparison expressions, e.g. "a < b > c",
there must be spaces before the '<', etc. */
const char *p = find_template_name_end (tokstart + namelen);
if (p)
@ -2870,6 +2868,7 @@ static struct obstack name_obstack;
in which lookups start; this can be NULL to mean the global scope.
IS_QUOTED_NAME is non-zero if the name token was originally quoted
in single quotes. */
static int
classify_name (struct parser_state *par_state, const struct block *block,
int is_quoted_name)
@ -3042,7 +3041,7 @@ classify_inner_name (struct parser_state *par_state,
return ERROR;
case LOC_TYPEDEF:
yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym);;
yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym);
return TYPENAME;
default:
@ -3062,6 +3061,7 @@ classify_inner_name (struct parser_state *par_state,
types. See the comment in lex_one_token for an example. However,
this is still an improvement over the earlier approach, and will
suffice until we move to better parsing technology. */
static int
yylex (void)
{