aboutsummaryrefslogtreecommitdiff
path: root/zlib
diff options
context:
space:
mode:
authorZack Weinberg <zack@gcc.gnu.org>2004-05-22 18:16:39 +0000
committerZack Weinberg <zack@gcc.gnu.org>2004-05-22 18:16:39 +0000
commit6f312d18d4788838bbd51c409a29b11ad8ccf009 (patch)
tree409d944e4e6302902eb8e16c793a145c374d08c1 /zlib
parentc1c52409c7f80e9656eb8a1a9e09f7f29f1c866a (diff)
downloadgcc-6f312d18d4788838bbd51c409a29b11ad8ccf009.zip
gcc-6f312d18d4788838bbd51c409a29b11ad8ccf009.tar.gz
gcc-6f312d18d4788838bbd51c409a29b11ad8ccf009.tar.bz2
[multiple changes]
2004-05-22 Andrew Pinski <pinskia@physics.uc.edu> * c-common.c (c_common_truthvalue_conversion): Handle UNEQ_EXPR, UNLE_EXPR, UNGE_EXPR, UNLT_EXPR, UNGT_EXPR, ORDERED_EXPR, and UNORDERED_EXPR as comparison operators, i.e. set the type to truthvalue_type_node and return. 2004-05-22 Zack Weinberg <zack@codesourcery.com> * tree.h (struct tree_decl): Add possibly_inlined bit. (DECL_POSSIBLY_INLINED): New accessor macro. * cgraph.h: Remove declaration of cgraph_inline_hash. * cgraph.c: Remove definition of cgraph_inline_hash. (hash_node): Revert to hashing DECL_UID. (eq_node): Take two pointers to cgraph_node structures. Compare DECL_UIDs. (cgraph_remove_node): Pass the node directly to htab_find_slot. (cgraph_varpool_hash_node): Rename hash_varpool_node; hash on DECL_UID. (eq_cgraph_varpool_node): Rename eq_varpool_node; take two pointers to cgraph_varpool_node structures; compare DECL_UIDs. (cgraph_node): Allocate a temporary node on the stack, fill in its DECL field, and pass that to htab_find_slot. (cgraph_varpool_node): Likewise. (cgraph_function_possibly_inlined_p): If global info is ready, return the DECL_POSSIBLY_INLINED bit. * cgraphunit.c (cgraph_mark_inline_edge): Set DECL_POSSIBLY_INLINED instead of mucking with cgraph_inline_hash. From-SVN: r82140
Diffstat (limited to 'zlib')
0 files changed, 0 insertions, 0 deletions