diff mbox

[match-and-simplify] Remove printing "for expression"

Message ID CAAgBjMkRYt1Gd8fEgnEwKND0aX1yqZcGgqAK5KutcLyDmNzD0Q@mail.gmail.com
State New
Headers show

Commit Message

Prathamesh Kulkarni Jan. 10, 2015, 5:06 p.m. UTC 
On 8 January 2015 at 17:52, Richard Biener <rguenther@suse.de> wrote:
> On Sun, 21 Dec 2014, Prathamesh Kulkarni wrote:
>
>> Hi,
>> I removed printing "for expression:" from print_matches. I think it
>> is out of place tvim here and we call print_matches after lowering.
>> OK to commit ?
>
> Hum, it's now a very simple wrapper around print_operand - why
> not replace the two callers with its content?
Indeed. Done the changes in the attached patch.
OK to commit to match-and-simplify branch ?

Thanks,
Prathamesh
>
> Thanks,
> Richard.
>
>> Thanks,
>> Prathamesh
>>
>
> --
> Richard Biener <rguenther@suse.de>
> SUSE LINUX GmbH, GF: Felix Imendoerffer, Jane Smithard, Jennifer Guild,
> Dilip Upmanyu, Graham Norton HRB 21284 (AG Nuernberg)
2015-01-10 Prathamesh Kulkarni <prathamesh.kulkarni@linaro.org>

	* genmatch.c (print_matches): Remove.
	(main): Replace calls to print_matches by print_operand.
diff mbox

Patch

Index: gcc/genmatch.c
===================================================================
--- gcc/genmatch.c	(revision 219424)
+++ gcc/genmatch.c	(working copy)
@@ -644,15 +644,6 @@ 
     gcc_unreachable ();
 }
 
-DEBUG_FUNCTION void
-print_matches (struct simplify *s, FILE *f = stderr)
-{
-  fprintf (f, "for expression: ");
-  print_operand (s->match, f);
-  putc ('\n', f);
-}
-
-
 /* AST lowering.  */
 
 /* Lowering of commutative operators.  */
@@ -3672,7 +3663,7 @@ 
 
       if (verbose)
 	for (unsigned i = 0; i < pred->matchers.length (); ++i)
-	  print_matches (pred->matchers[i]);
+	  print_operand (pred->matchers[i]->match); 
 
       decision_tree dt;
       for (unsigned i = 0; i < pred->matchers.length (); ++i)
@@ -3689,7 +3680,7 @@ 
 
   if (verbose)
     for (unsigned i = 0; i < p.simplifiers.length (); ++i)
-      print_matches (p.simplifiers[i]);
+      print_operand (p.simplifiers[i]->match);
 
   decision_tree dt;
   for (unsigned i = 0; i < p.simplifiers.length (); ++i)