diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index 0186f62e281cd7ef70d86aa3417dc1d2980ca8b9..4e858912106294e82082bd5f62a07c963f60f2a7 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,5 +1,6 @@
 2007-01-14  Jan Hubicka  <jh@suse.cz>
 
+	* gcc.dg/tree-prof/stringop-1.c: Update pattern for memcpy folding.
 	* gcc.dg/tree-ssa/vrp11.c: Fix thinkos in my last patch.
 	* gcc.dg/always_inline3.c: Update for pre-inline tail recursion
 	elimination.
diff --git a/gcc/testsuite/gcc.dg/tree-prof/stringop-1.c b/gcc/testsuite/gcc.dg/tree-prof/stringop-1.c
index eca3de169675af3c3e4033a266894215a940f931..b57715efcb0b18a121ff938c0f07045547d9f8de 100644
--- a/gcc/testsuite/gcc.dg/tree-prof/stringop-1.c
+++ b/gcc/testsuite/gcc.dg/tree-prof/stringop-1.c
@@ -15,6 +15,7 @@ main()
 }
 /* { dg-final-use { scan-tree-dump "Single value 4 stringop" "tree_profile"} } */
 /* Really this ought to simplify into assignment, but we are not there yet.  */
-/* { dg-final-use { scan-tree-dump "memcpy.*4\\)" "optimized"} } */
+/* a[0] = b[0] is what we fold the resulting memcpy into.  */
+/* { dg-final-use { scan-tree-dump "a.0. = b.0." "optimized"} } */
 /* { dg-final-use { cleanup-tree-dump "optimized" } } */
 /* { dg-final-use { cleanup-tree-dump "tree_profile" } } */