From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 1666) id 070F43858427; Thu, 2 May 2024 07:01:32 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 070F43858427 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1714633293; bh=QdnjPECZHIEIsAye1ZVpItRXQJNQ6m+3kzJmeYZpaqI=; h=From:To:Subject:Date:From; b=wjLxm+S3DEB1IfSWtRF4taaUwvINAzsHJBVZB0n3QlfeCy+O1Hz3A4/l0mMYtBtBn NwOq8RzOtxN7iU6CPcrovKwycfRazxba4+kqPwIS09cfi72uJFwaXM+rJcQS9c+pP4 2fyzO4SsfWA8qgYdl+S32PM7Q8RFrAU2bm/S4A5o= MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset="utf-8" From: Richard Biener To: gcc-cvs@gcc.gnu.org Subject: [gcc r15-104] Make graph dumps use graphviz format X-Act-Checkin: gcc X-Git-Author: Richard Biener X-Git-Refname: refs/heads/master X-Git-Oldrev: 5176402d6fdbf131d176b5f43ac6449c1bda072b X-Git-Newrev: c59708fba3f98a4cc257741b88216b6caf6b4a87 Message-Id: <20240502070133.070F43858427@sourceware.org> Date: Thu, 2 May 2024 07:01:32 +0000 (GMT) List-Id: https://gcc.gnu.org/g:c59708fba3f98a4cc257741b88216b6caf6b4a87 commit r15-104-gc59708fba3f98a4cc257741b88216b6caf6b4a87 Author: Richard Biener Date: Tue Apr 30 13:01:43 2024 +0200 Make graph dumps use graphviz format SLP build eventually uses graphds graphs, the following makes its dump use graphviz format so you can easily visualize it. * graphds.cc (dump_graph): Dump in graphviz format. Diff: --- gcc/graphds.cc | 17 ++++++----------- 1 file changed, 6 insertions(+), 11 deletions(-) diff --git a/gcc/graphds.cc b/gcc/graphds.cc index 17d08966f53..ed5bfeb2808 100644 --- a/gcc/graphds.cc +++ b/gcc/graphds.cc @@ -31,22 +31,17 @@ dump_graph (FILE *f, struct graph *g) int i; struct graph_edge *e; + fprintf (f, "digraph {\n"); for (i = 0; i < g->n_vertices; i++) { - if (!g->vertices[i].pred - && !g->vertices[i].succ) - continue; - - fprintf (f, "%d (%d)\t<-", i, g->vertices[i].component); + fprintf (f, "\"%d\" [label=\"%d (%d): %p\"];\n", + i, i, g->vertices[i].component, g->vertices[i].data); for (e = g->vertices[i].pred; e; e = e->pred_next) - fprintf (f, " %d", e->src); - fprintf (f, "\n"); - - fprintf (f, "\t->"); + fprintf (f, "\"%d\" -> \"%d\" [label=\"%p\"];\n", e->src, e->dest, e->data); for (e = g->vertices[i].succ; e; e = e->succ_next) - fprintf (f, " %d", e->dest); - fprintf (f, "\n"); + fprintf (f, "\"%d\" -> \"%d\";\n", e->src, e->dest); } + fprintf (f, "}\n"); } /* Creates a new graph with N_VERTICES vertices. */