diff options
author | Joseph Myers <jsm28@cam.ac.uk> | 2000-11-03 18:55:54 +0000 |
---|---|---|
committer | Joseph Myers <jsm28@gcc.gnu.org> | 2000-11-03 18:55:54 +0000 |
commit | da61dec94bb88a1f29a984ad3a311a83f696e751 (patch) | |
tree | 4cb28c9deaf8fa480ffad4062b24bc022b087a25 /gcc/tree.c | |
parent | def3263a3364034c8cd6cd865975529f9fd80e69 (diff) | |
download | gcc-da61dec94bb88a1f29a984ad3a311a83f696e751.zip gcc-da61dec94bb88a1f29a984ad3a311a83f696e751.tar.gz gcc-da61dec94bb88a1f29a984ad3a311a83f696e751.tar.bz2 |
Use memset/memcmp instead of bzero/bcmp.
* c-decl.c (duplicate_decls, copy_lang_decl), dwarfout.c
(dwarfout_line), gcc.c (main, save_string), tree.c (init_obstacks,
perm_calloc, get_identifier, maybe_get_identifier,
real_value_from_int_cst, simple_cst_equal), varasm.c
(assemble_name, assemble_real, immed_real_const_1,
compare_constant_1, decode_rtx_const, output_constant_pool): Use
strrchr () instead of rindex (). Use memcmp () instead of bcmp
(). Use memcpy () instead of bcopy (). Use memset () instead of
bzero ().
cp:
* tree.c (cp_tree_equal): Use memcmp () instead of bcmp ().
From-SVN: r37228
Diffstat (limited to 'gcc/tree.c')
-rw-r--r-- | gcc/tree.c | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -205,7 +205,7 @@ init_obstacks () gcc_obstack_init (&permanent_obstack); /* Init the hash table of identifiers. */ - bzero ((char *) hash_table, sizeof hash_table); + memset ((char *) hash_table, 0, sizeof hash_table); ggc_add_tree_root (hash_table, sizeof hash_table / sizeof (tree)); /* Initialize the hash table of types. */ @@ -257,7 +257,7 @@ perm_calloc (nelem, size) long size; { char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size); - bzero (rval, nelem * size); + memset (rval, 0, nelem * size); return rval; } @@ -591,7 +591,7 @@ get_identifier (text) for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) if (IDENTIFIER_LENGTH (idp) == len && IDENTIFIER_POINTER (idp)[0] == text[0] - && !bcmp (IDENTIFIER_POINTER (idp), text, len)) + && !memcmp (IDENTIFIER_POINTER (idp), text, len)) /* Return if found. */ return idp; @@ -655,7 +655,7 @@ maybe_get_identifier (text) for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) if (IDENTIFIER_LENGTH (idp) == len && IDENTIFIER_POINTER (idp)[0] == text[0] - && !bcmp (IDENTIFIER_POINTER (idp), text, len)) + && !memcmp (IDENTIFIER_POINTER (idp), text, len)) return idp; /* <-- return if found */ return NULL_TREE; @@ -739,7 +739,7 @@ real_value_from_int_cst (type, i) #ifdef REAL_ARITHMETIC /* Clear all bits of the real value type so that we can later do bitwise comparisons to see if two values are the same. */ - bzero ((char *) &d, sizeof d); + memset ((char *) &d, 0, sizeof d); if (! TREE_UNSIGNED (TREE_TYPE (i))) REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i), @@ -3625,7 +3625,7 @@ simple_cst_equal (t1, t2) case STRING_CST: return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) - && ! bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), + && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), TREE_STRING_LENGTH (t1))); case CONSTRUCTOR: |