[PATCH GCC][1/7]Delete unused field of struct partition in loop distribution

[Bin Cheng]

Hi,
This patch set implements distribution and builtin pattern distribution for
loop nest.  It consists of below patches:
  Patches [1~4]: Cleanup and (latent) bug fixes.
  Patch [5]: Loop nest distribution of two-level innermost loop nest.
  Patches [6,7]: Loop nest builtin pattern distribution.

This is the first simple patch deleting unused field of struct partition in loop
distribution.  It's an obvious change.
Bootstrap and test in patch set on x86_64 and AArch64.

Thanks,
bin
2017-10-04  Bin Cheng  <bin.ch...@arm.com>

        * tree-loop-distribution.c (struct partition): Remove unused field
        loops of the structure.
        (partition_alloc, partition_free): Ditto.
        (build_rdg_partition_for_vertex): Ditto.
From 6f1b39f7bea2e77fc320bc70829b3e1445633d1b Mon Sep 17 00:00:00 2001
From: Bin Cheng <binch...@e108451-lin.cambridge.arm.com>
Date: Tue, 26 Sep 2017 16:54:35 +0100
Subject: [PATCH 1/7] struct-partition-20170925.txt

---
 gcc/tree-loop-distribution.c | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/gcc/tree-loop-distribution.c b/gcc/tree-loop-distribution.c
index 26b8b9a..3db3d6e 100644
--- a/gcc/tree-loop-distribution.c
+++ b/gcc/tree-loop-distribution.c
@@ -593,8 +593,6 @@ struct partition
 {
   /* Statements of the partition.  */
   bitmap stmts;
-  /* Loops of the partition.  */
-  bitmap loops;
   /* True if the partition defines variable which is used outside of loop.  */
   bool reduction_p;
   /* For builtin partition, true if it executes one iteration more than
@@ -619,7 +617,6 @@ partition_alloc (void)
 {
   partition *partition = XCNEW (struct partition);
   partition->stmts = BITMAP_ALLOC (NULL);
-  partition->loops = BITMAP_ALLOC (NULL);
   partition->reduction_p = false;
   partition->kind = PKIND_NORMAL;
   partition->datarefs = BITMAP_ALLOC (NULL);
@@ -632,7 +629,6 @@ static void
 partition_free (partition *partition)
 {
   BITMAP_FREE (partition->stmts);
-  BITMAP_FREE (partition->loops);
   BITMAP_FREE (partition->datarefs);
   free (partition);
 }
@@ -1279,8 +1275,6 @@ build_rdg_partition_for_vertex (struct graph *rdg, int v)
   FOR_EACH_VEC_ELT (nodes, i, x)
     {
       bitmap_set_bit (partition->stmts, x);
-      bitmap_set_bit (partition->loops,
-		      loop_containing_stmt (RDG_STMT (rdg, x))->num);
 
       for (j = 0; RDG_DATAREFS (rdg, x).iterate (j, &dr); ++j)
 	{
-- 
1.9.1