OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

* tree.c: Fix formatting.

Browse Source 
From-SVN: r36036
This commit is contained in:
Kazu Hirata 2000-08-29 16:08:59 +00:00 committed by Jeff Law
parent abf9af023a
commit dc478a5dd4
2 changed files with 103 additions and 98 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
gcc/ChangeLog
View File

@ -1,5 +1,7 @@
2000-08-28 Kazu Hirata <kazu@hxi.com> 2000-08-28 Kazu Hirata <kazu@hxi.com>
* tree.c: Fix formatting.
* xcoffout.c: Fix formatting. * xcoffout.c: Fix formatting.
2000-08-28 Jason Merrill <jason@redhat.com> 2000-08-28 Jason Merrill <jason@redhat.com>

23
gcc/tree.c
View File

@ -19,7 +19,6 @@ along with GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330, the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */ Boston, MA 02111-1307, USA. */
/* This file contains the low level primitives for operating on tree nodes, /* This file contains the low level primitives for operating on tree nodes,
including allocation, list operations, interning of identifiers, including allocation, list operations, interning of identifiers,
construction of data type nodes and statement nodes, construction of data type nodes and statement nodes,
@ -1279,14 +1278,15 @@ get_identifier (text)
hi &= (1 << HASHBITS) - 1; hi &= (1 << HASHBITS) - 1;
hi %= MAX_HASH_TABLE; hi %= MAX_HASH_TABLE;
/* Search table for identifier */ /* Search table for identifier. */
for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
if (IDENTIFIER_LENGTH (idp) == len if (IDENTIFIER_LENGTH (idp) == len
&& IDENTIFIER_POINTER (idp)[0] == text[0] && IDENTIFIER_POINTER (idp)[0] == text[0]
&& !bcmp (IDENTIFIER_POINTER (idp), text, len)) && !bcmp (IDENTIFIER_POINTER (idp), text, len))
return idp; /* <-- return if found */ /* Return if found. */
return idp;
/* Not found; optionally warn about a similar identifier */ /* Not found; optionally warn about a similar identifier. */
if (warn_id_clash && do_identifier_warnings && len >= id_clash_len) if (warn_id_clash && do_identifier_warnings && len >= id_clash_len)
for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len)) if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len))
@ -1345,7 +1345,7 @@ maybe_get_identifier (text)
hi &= (1 << HASHBITS) - 1; hi &= (1 << HASHBITS) - 1;
hi %= MAX_HASH_TABLE; hi %= MAX_HASH_TABLE;
/* Search table for identifier */ /* Search table for identifier. */
for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
if (IDENTIFIER_LENGTH (idp) == len if (IDENTIFIER_LENGTH (idp) == len
&& IDENTIFIER_POINTER (idp)[0] == text[0] && IDENTIFIER_POINTER (idp)[0] == text[0]
@ -1476,7 +1476,7 @@ real_value_from_int_cst (type, i)
struct brfic_args struct brfic_args
{ {
tree type; /* Input: type to conver to. */ tree type; /* Input: type to conver to. */
tree i; /* Input: operand to convert */ tree i; /* Input: operand to convert. */
REAL_VALUE_TYPE d; /* Output: floating point value. */ REAL_VALUE_TYPE d; /* Output: floating point value. */
}; };
@ -2050,7 +2050,8 @@ chainon (op1, op2)
#endif #endif
return op1; return op1;
} }
else return op2; else
return op2;
} }
/* Return the last node in a chain of nodes (chained through TREE_CHAIN). */ /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
@ -3168,7 +3169,6 @@ stabilize_reference (ref)
ref))); ref)));
break; break;
/* If arg isn't a kind of lvalue we recognize, make no change. /* If arg isn't a kind of lvalue we recognize, make no change.
Caller should recognize the error for an invalid lvalue. */ Caller should recognize the error for an invalid lvalue. */
default: default:
@ -3700,7 +3700,8 @@ valid_machine_attribute (attr_name, attr_args, decl, type)
#ifdef VALID_MACHINE_TYPE_ATTRIBUTE #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
if (validated) if (validated)
/* Don't apply the attribute to both the decl and the type. */; /* Don't apply the attribute to both the decl and the type. */
;
else if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name, else if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name,
attr_args)) attr_args))
{ {
@ -5571,6 +5572,7 @@ get_set_constructor_bytes (init, buffer, wd_size)
#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
/* Complain that the tree code of NODE does not match the expected CODE. /* Complain that the tree code of NODE does not match the expected CODE.
FILE, LINE, and FUNCTION are of the caller. */ FILE, LINE, and FUNCTION are of the caller. */
void void
tree_check_failed (node, code, file, line, function) tree_check_failed (node, code, file, line, function)
const tree node; const tree node;
@ -5586,6 +5588,7 @@ tree_check_failed (node, code, file, line, function)
/* Similar to above, except that we check for a class of tree /* Similar to above, except that we check for a class of tree
code, given in CL. */ code, given in CL. */
void void
tree_class_check_failed (node, cl, file, line, function) tree_class_check_failed (node, cl, file, line, function)
const tree node; const tree node;
@ -5601,10 +5604,10 @@ tree_class_check_failed (node, cl, file, line, function)
} }
#endif /* ENABLE_TREE_CHECKING */ #endif /* ENABLE_TREE_CHECKING */
/* For a new vector type node T, build the information necessary for /* For a new vector type node T, build the information necessary for
debuggint output. */ debuggint output. */
static void static void
finish_vector_type (t) finish_vector_type (t)
tree t; tree t;