espressif/binutils-gdb
1
0
Fork 0
mirror of https://github.com/espressif/binutils-gdb.git synced 2025-10-20 14:22:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix formatting

Browse Source
This commit is contained in:
Nick Clifton
2000-09-03 21:51:27 +00:00
parent 6ddeca85d5
commit 958b5f013a
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
gas/expr.c
View File

@ -859,7 +859,7 @@ operand (expressionP)
input_line_pointer++; input_line_pointer++;
floating_constant (expressionP); floating_constant (expressionP);
expressionP->X_add_number = expressionP->X_add_number =
-(isupper ((unsigned char) c) ? tolower (c) : c); - (isupper ((unsigned char) c) ? tolower (c) : c);
} }
else else
{ {
@ -982,7 +982,7 @@ operand (expressionP)
input_line_pointer++; input_line_pointer++;
floating_constant (expressionP); floating_constant (expressionP);
expressionP->X_add_number = expressionP->X_add_number =
-(isupper ((unsigned char) c) ? tolower (c) : c); - (isupper ((unsigned char) c) ? tolower (c) : c);
break; break;
case '$': case '$':
@ -1069,7 +1069,7 @@ operand (expressionP)
/* input_line_pointer -> char after operand. */ /* input_line_pointer -> char after operand. */
if (c == '-') if (c == '-')
{ {
expressionP->X_add_number = -expressionP->X_add_number; expressionP->X_add_number = - expressionP->X_add_number;
/* Notice: '-' may overflow: no warning is given. /* Notice: '-' may overflow: no warning is given.
This is compatible with other people's This is compatible with other people's
assemblers. Sigh. */ assemblers. Sigh. */
@ -1817,27 +1817,27 @@ expr (rankarg, resultP)
case O_subtract: resultP->X_add_number -= v; break; case O_subtract: resultP->X_add_number -= v; break;
case O_eq: case O_eq:
resultP->X_add_number = resultP->X_add_number =
resultP->X_add_number == v ? ~(offsetT) 0 : 0; resultP->X_add_number == v ? ~ (offsetT) 0 : 0;
break; break;
case O_ne: case O_ne:
resultP->X_add_number = resultP->X_add_number =
resultP->X_add_number != v ? ~(offsetT) 0 : 0; resultP->X_add_number != v ? ~ (offsetT) 0 : 0;
break; break;
case O_lt: case O_lt:
resultP->X_add_number = resultP->X_add_number =
resultP->X_add_number < v ? ~(offsetT) 0 : 0; resultP->X_add_number < v ? ~ (offsetT) 0 : 0;
break; break;
case O_le: case O_le:
resultP->X_add_number = resultP->X_add_number =
resultP->X_add_number <= v ? ~(offsetT) 0 : 0; resultP->X_add_number <= v ? ~ (offsetT) 0 : 0;
break; break;
case O_ge: case O_ge:
resultP->X_add_number = resultP->X_add_number =
resultP->X_add_number >= v ? ~(offsetT) 0 : 0; resultP->X_add_number >= v ? ~ (offsetT) 0 : 0;
break; break;
case O_gt: case O_gt:
resultP->X_add_number = resultP->X_add_number =
resultP->X_add_number > v ? ~(offsetT) 0 : 0; resultP->X_add_number > v ? ~ (offsetT) 0 : 0;
break; break;
case O_logical_and: case O_logical_and:
resultP->X_add_number = resultP->X_add_number && v; resultP->X_add_number = resultP->X_add_number && v;