bitmap.c (bitmap_clear): Don't declare as inline.

	* bitmap.c (bitmap_clear): Don't declare as inline.
	* gimple.c (gimplify_assign): Likewise.
	* tree-ssa-sccvn.c (vn_nary_op_compute_hash): Likewise.
	* haifa-sched.c (insn_cost): Don't declare with HAIFA_INLINE.
	(sched_scan_info): Remove duplicate definition.

From-SVN: r148539

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 6c525da5d3652dd3a5969e43c170e67576b3473f..794442cc1e88e752ea941c11426bce39a0c63ef0 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,11 @@
+2009-06-16  Ian Lance Taylor  <iant@google.com>
+
+       * bitmap.c (bitmap_clear): Don't declare as inline.
+       * gimple.c (gimplify_assign): Likewise.
+       * tree-ssa-sccvn.c (vn_nary_op_compute_hash): Likewise.
+       * haifa-sched.c (insn_cost): Don't declare with HAIFA_INLINE.
+       (sched_scan_info): Remove duplicate definition.
+
 2009-06-16  Ian Lance Taylor  <iant@google.com>
 
        * c-common.c (skip_evaluation): Don't define.

diff --git a/gcc/bitmap.c b/gcc/bitmap.c
index 8e0a7241104233fc5ee46c828d46b6aa0ccd4311..61a40ee352dde4b874014195eb2a74881649c6e1 100644 (file)
--- a/gcc/bitmap.c
+++ b/gcc/bitmap.c
@@ -291,7 +291,7 @@ bitmap_elt_clear_from (bitmap head, bitmap_element *elt)
 
 /* Clear a bitmap by freeing the linked list.  */
 
-inline void
+void
 bitmap_clear (bitmap head)
 {
   if (head->first)

diff --git a/gcc/gimple.c b/gcc/gimple.c
index 24727bc88735691debf46d4ad2343fdfb68336da..91057b4db89a39d69315a05e45e7f3ef2207b718 100644 (file)
--- a/gcc/gimple.c
+++ b/gcc/gimple.c
@@ -448,7 +448,7 @@ gimple_build_assign_with_ops_stat (enum tree_code subcode, tree lhs, tree op1,
 
    This function returns the newly created GIMPLE_ASSIGN tuple.  */
 
-inline gimple
+gimple
 gimplify_assign (tree dst, tree src, gimple_seq *seq_p)
 { 
   tree t = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src);

diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index f876b458d2d3f1a9695ef368d38a9a29e31b4854..eff10c87628e9e194b820c2c8366e68a8aee9123 100644 (file)
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -601,7 +601,7 @@ static rtx last_scheduled_insn;
 /* Compute cost of executing INSN.
    This is the number of cycles between instruction issue and
    instruction results.  */
-HAIFA_INLINE int
+int
 insn_cost (rtx insn)
 {
   int cost;
@@ -4721,8 +4721,6 @@ check_cfg (rtx head, rtx tail)
 
 #endif /* ENABLE_CHECKING */
 
-const struct sched_scan_info_def *sched_scan_info;
-
 /* Extend per basic block data structures.  */
 static void
 extend_bb (void)

diff --git a/gcc/tree-ssa-sccvn.c b/gcc/tree-ssa-sccvn.c
index 6d263ded1775fe7840ebb9d1cbfa508b53cecd73..8557b0b07c9d37215f28c682afcd907fc9be06bd 100644 (file)
--- a/gcc/tree-ssa-sccvn.c
+++ b/gcc/tree-ssa-sccvn.c
@@ -1362,7 +1362,7 @@ vn_reference_insert_pieces (tree vuse, alias_set_type set, tree type,
 
 /* Compute and return the hash value for nary operation VBO1.  */
 
-inline hashval_t
+hashval_t
 vn_nary_op_compute_hash (const vn_nary_op_t vno1)
 {
   hashval_t hash = 0;