tree-data-ref.h (dot_rdg): Remove prototype.

	* tree-data-ref.h (dot_rdg): Remove prototype.
	* tree-data-ref.c (dog_rdg_1, dot_rdg): Remove.

From-SVN: r155287

1 files changed, 0 insertions, 64 deletions

diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c
index 1b0421c5ef0..dbdd3237d5e 100644
--- a/gcc/tree-data-ref.c
+++ b/gcc/tree-data-ref.c
@@ -4630,70 +4630,6 @@ debug_rdg (struct graph *rdg)
   dump_rdg (stderr, rdg);
 }
 
-static void
-dot_rdg_1 (FILE *file, struct graph *rdg)
-{
-  int i;
-
-  fprintf (file, "digraph RDG {\n");
-
-  for (i = 0; i < rdg->n_vertices; i++)
-    {
-      struct vertex *v = &(rdg->vertices[i]);
-      struct graph_edge *e;
-
-      /* Highlight reads from memory.  */
-      if (RDG_MEM_READS_STMT (rdg, i))
-	fprintf (file, "%d [style=filled, fillcolor=green]\n", i);
-
-      /* Highlight stores to memory.  */
-      if (RDG_MEM_WRITE_STMT (rdg, i))
-	fprintf (file, "%d [style=filled, fillcolor=red]\n", i);
-
-      if (v->succ)
-	for (e = v->succ; e; e = e->succ_next)
-	  switch (RDGE_TYPE (e))
-	    {
-	    case input_dd:
-	      fprintf (file, "%d -> %d [label=input] \n", i, e->dest);
-	      break;
-
-	    case output_dd:
-	      fprintf (file, "%d -> %d [label=output] \n", i, e->dest);
-	      break;
-
-	    case flow_dd:
-	      /* These are the most common dependences: don't print these. */
-	      fprintf (file, "%d -> %d \n", i, e->dest);
-	      break;
-
-	    case anti_dd:
-	      fprintf (file, "%d -> %d [label=anti] \n", i, e->dest);
-	      break;
-
-	    default:
-	      gcc_unreachable ();
-	    }
-    }
-
-  fprintf (file, "}\n\n");
-}
-
-/* Display SCOP using dotty.  */
-
-void
-dot_rdg (struct graph *rdg)
-{
-  FILE *file = fopen ("/tmp/rdg.dot", "w");
-  gcc_assert (file != NULL);
-
-  dot_rdg_1 (file, rdg);
-  fclose (file);
-
-  system ("dotty /tmp/rdg.dot");
-}
-
-
 /* This structure is used for recording the mapping statement index in
    the RDG.  */