Commit 11c16c2a by Jakub Jelinek Committed by Jakub Jelinek

vrp101.c: Fix scan-tree-dump regex.

	* gcc.dg/tree-ssa/vrp101.c: Fix scan-tree-dump regex.
	* gcc.dg/tree-ssa/builtin-sprintf-2.c: Likewise.  Adjust comment.

From-SVN: r249180
parent f3bc6d3a
2017-06-14 Jakub Jelinek <jakub@redhat.com>
* gcc.dg/tree-ssa/vrp101.c: Fix scan-tree-dump regex.
* gcc.dg/tree-ssa/builtin-sprintf-2.c: Likewise. Adjust comment.
2017-06-13 Jakub Jelinek <jakub@redhat.com> 2017-06-13 Jakub Jelinek <jakub@redhat.com>
PR c++/80973 PR c++/80973
......
...@@ -279,18 +279,18 @@ RNG (0, 6, 8, "%s%ls", "1", L"2"); ...@@ -279,18 +279,18 @@ RNG (0, 6, 8, "%s%ls", "1", L"2");
<bb 2>: <bb 2>:
result_3 = __builtin_sprintf (&MEM[(void *)&buf8k + 8192B], "%c", 32); result_3 = __builtin_sprintf (&MEM[(void *)&buf8k + 8192B], "%c", 32);
if (result_3 != 0) if (result_3 != 0)
goto <bb 3>; [50.0%] goto <bb 3>; [50.0%] [count: INV]
else else
goto <bb 4>; [50.0%] goto <bb 4>; [50.0%] [count: INV]
<bb 3>[50.0%]: <bb 3>[50.0%] [count: INV]:
must_not_eliminate (); must_not_eliminate ();
*/ */
/* Only conditional calls to must_not_eliminate must be made (with /* Only conditional calls to must_not_eliminate must be made (with
any probability): any probability):
{ dg-final { scan-tree-dump-times "> \\\[\[0-9.\]+%\\\]\\ \\\[count:\\[^:\\]*\\\]:\n *must_not_eliminate" 127 "optimized" { target { ilp32 || lp64 } } } } { dg-final { scan-tree-dump-times "> \\\[\[0-9.\]+%\\\] \\\[count: \[^0-9INV\]*\\\]:\n *must_not_eliminate" 127 "optimized" { target { ilp32 || lp64 } } } }
{ dg-final { scan-tree-dump-times "> \\\[\[0-9.\]+%\\\]\\ \\\[count:\\[^:\\]*\\\]:\n *must_not_eliminate" 96 "optimized" { target { { ! ilp32 } && { ! lp64 } } } } } { dg-final { scan-tree-dump-times "> \\\[\[0-9.\]+%\\\] \\\[count: \[^0-9INV\]*\\\]:\n *must_not_eliminate" 96 "optimized" { target { { ! ilp32 } && { ! lp64 } } } } }
No unconditional calls to abort should be made: No unconditional calls to abort should be made:
{ dg-final { scan-tree-dump-not ";\n *must_not_eliminate" "optimized" } } */ { dg-final { scan-tree-dump-not ";\n *must_not_eliminate" "optimized" } } */
...@@ -10,4 +10,4 @@ int main () ...@@ -10,4 +10,4 @@ int main ()
return 0; return 0;
} }
/* { dg-final { scan-tree-dump "<bb 2> \\\[\[0-9.\]+%\\\] \\\[count: \\[^:\\]*\\\]:\[\n\r \]*return 0;" "optimized" } } */ /* { dg-final { scan-tree-dump "<bb 2> \\\[\[0-9.\]+%\\\] \\\[count: \[0-9INV\]*\\\]:\[\n\r \]*return 0;" "optimized" } } */
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment