class.c (finish_struct_1): Correct comment.

	* class.c (finish_struct_1): Correct comment.
	* cp-tree.c (DECL_SORTED_FIELDS): Likewise.

From-SVN: r59828

diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index 60789ee32d46dd0e8e6dfe2ccfacec917eb1177c..3ea81f71794fa86536de4068ad19127f6aa0eecc 100644 (file)
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -1,3 +1,8 @@
+2002-12-04  Geoffrey Keating  <geoffk@apple.com>
+
+       * class.c (finish_struct_1): Correct comment.
+       * cp-tree.c (DECL_SORTED_FIELDS): Likewise.
+
 2002-12-04  Gabriel Dos Reis  <gdr@integrable-solutions.net>
 
        PR C++/8799

diff --git a/gcc/cp/class.c b/gcc/cp/class.c
index e3ea2db9da0a5269b04066c2ed582680d6c45e90..06d09681e6f71ffe03040835cf6686bbea28c3fa 100644 (file)
--- a/gcc/cp/class.c
+++ b/gcc/cp/class.c
@@ -5280,8 +5280,7 @@ finish_struct_1 (t)
   /* Done with FIELDS...now decide whether to sort these for
      faster lookups later.
 
-     The C front-end only does this when n_fields > 15.  We use
-     a smaller number because most searches fail (succeeding
+     We use a small number because most searches fail (succeeding
      ultimately as the search bores through the inheritance
      hierarchy), and we want this failure to occur quickly.  */
 

diff --git a/gcc/cp/cp-tree.h b/gcc/cp/cp-tree.h
index 4c0efd20e049812df5407d85d31a8d60a97a3a1a..f8a0195ef073ea659bf75ef90c89300c08e7efaa 100644 (file)
--- a/gcc/cp/cp-tree.h
+++ b/gcc/cp/cp-tree.h
@@ -2189,7 +2189,7 @@ struct lang_decl GTY(())
 #define DECL_PENDING_INLINE_INFO(NODE) \
   (DECL_LANG_SPECIFIC (NODE)->u.f.u.pending_inline_info)
 
-/* For a TYPE_DECL: if this function has many fields, we'll sort them
+/* For a TYPE_DECL: if this structure has many fields, we'll sort them
    and put them into a TREE_VEC.  */
 #define DECL_SORTED_FIELDS(NODE) \
   (DECL_LANG_SPECIFIC (TYPE_DECL_CHECK (NODE))->u.f.u.sorted_fields)