Skip to content

R
riscv-gcc-1
Commit 6491eb15 by Janis Johnson Committed by Janis Johnson
Options

nothrow1.C: Use cleanup-tree-dump. 

	* g++.dg/opt/nothrow1.C: Use cleanup-tree-dump.
	g++.dg/tree-ssa/empty-1.C, g++.dg/tree-ssa/nothrow-1.C,
	g++.dg/tree-ssa/pointer-reference-alias.C,
	g++.dg/tree-ssa/pr15791-3.C, g++.dg/tree-ssa/pr15791-4.C,
	g++.dg/tree-ssa/pr15791-5.C, g++.dg/tree-ssa/ssa-cast-1.C
	g++.dg/tree-ssa/ssa-sra-1.C, g++.dg/tree-ssa/ssa-sra-2.C: Ditto
	g++.dg/vect/pr19951.cc: Ditto.
	* gcc.dg/builtins-43.c, gcc.dg/builtins-44.c, gcc.dg/builtins-45.c,
	gcc.dg/builtins-47.c: Ditto.
	* gcc.dg/pr15784-1.c, gcc.dg/pr15784-2.c, gcc.dg/pr15784-3.c,
	gcc.dg/pr20115-1.c: Ditto.
	* gcc.dg/tree-ssa/20030530-2.c,
	gcc.dg/tree-ssa/20030611-1.c, gcc.dg/tree-ssa/20030703-1.c,
	gcc.dg/tree-ssa/20030703-2.c, gcc.dg/tree-ssa/20030708-1.c,
	gcc.dg/tree-ssa/20030709-1.c, gcc.dg/tree-ssa/20030709-2.c,
	gcc.dg/tree-ssa/20030709-3.c, gcc.dg/tree-ssa/20030710-1.c,
	gcc.dg/tree-ssa/20030711-1.c, gcc.dg/tree-ssa/20030711-2.c,
	gcc.dg/tree-ssa/20030711-3.c, gcc.dg/tree-ssa/20030714-1.c,
	gcc.dg/tree-ssa/20030714-2.c, gcc.dg/tree-ssa/20030728-1.c,
	gcc.dg/tree-ssa/20030729-1.c, gcc.dg/tree-ssa/20030730-1.c,
	gcc.dg/tree-ssa/20030730-2.c, gcc.dg/tree-ssa/20030731-1.c,
	gcc.dg/tree-ssa/20030731-2.c, gcc.dg/tree-ssa/20030807-1.c,
	gcc.dg/tree-ssa/20030807-10.c, gcc.dg/tree-ssa/20030807-11.c,
	gcc.dg/tree-ssa/20030807-2.c, gcc.dg/tree-ssa/20030807-3.c,
	gcc.dg/tree-ssa/20030807-5.c, gcc.dg/tree-ssa/20030807-6.c,
	gcc.dg/tree-ssa/20030807-7.c, gcc.dg/tree-ssa/20030807-8.c,
	gcc.dg/tree-ssa/20030807-9.c, gcc.dg/tree-ssa/20030808-1.c,
	gcc.dg/tree-ssa/20030814-1.c, gcc.dg/tree-ssa/20030814-2.c,
	gcc.dg/tree-ssa/20030814-3.c, gcc.dg/tree-ssa/20030814-4.c,
	gcc.dg/tree-ssa/20030814-5.c, gcc.dg/tree-ssa/20030814-6.c,
	gcc.dg/tree-ssa/20030814-7.c, gcc.dg/tree-ssa/20030815-1.c,
	gcc.dg/tree-ssa/20030824-1.c,
	gcc.dg/tree-ssa/20030824-2.c, gcc.dg/tree-ssa/20030825-1.c,
	gcc.dg/tree-ssa/20030907-1.c, gcc.dg/tree-ssa/20030917-1.c,
	gcc.dg/tree-ssa/20030917-3.c, gcc.dg/tree-ssa/20030922-1.c,
	gcc.dg/tree-ssa/20030922-2.c, gcc.dg/tree-ssa/20031015-1.c,
	gcc.dg/tree-ssa/20031021-1.c, gcc.dg/tree-ssa/20031022-1.c,
	gcc.dg/tree-ssa/20031106-1.c, gcc.dg/tree-ssa/20031106-2.c,
	gcc.dg/tree-ssa/20031106-3.c, gcc.dg/tree-ssa/20031106-4.c,
	gcc.dg/tree-ssa/20031106-5.c, gcc.dg/tree-ssa/20031106-6.c,
	gcc.dg/tree-ssa/20031216-1.c, gcc.dg/tree-ssa/20040204-1.c,
	gcc.dg/tree-ssa/20040210-1.c, gcc.dg/tree-ssa/20040211-1.c,
	gcc.dg/tree-ssa/20040216-1.c, gcc.dg/tree-ssa/20040305-1.c,
	gcc.dg/tree-ssa/20040430-1.c, gcc.dg/tree-ssa/20040513-1.c,
	gcc.dg/tree-ssa/20040513-2.c, gcc.dg/tree-ssa/20040514-1.c,
	gcc.dg/tree-ssa/20040514-2.c, gcc.dg/tree-ssa/20040517-1.c,
	gcc.dg/tree-ssa/20040518-1.c, gcc.dg/tree-ssa/20040518-2.c,
	gcc.dg/tree-ssa/20040615-1.c, gcc.dg/tree-ssa/20040624-1.c,
	gcc.dg/tree-ssa/20040703-1.c, gcc.dg/tree-ssa/20040721-1.c,
	gcc.dg/tree-ssa/20040729-1.c, gcc.dg/tree-ssa/20040911-1.c,
	gcc.dg/tree-ssa/20041002-1.c, gcc.dg/tree-ssa/20041122-1.c,
	gcc.dg/tree-ssa/20050128-1.c, gcc.dg/tree-ssa/20050215-1.c,
	gcc.dg/tree-ssa/asm-1.c, gcc.dg/tree-ssa/asm-2.c,
	gcc.dg/tree-ssa/asm-3.c, gcc.dg/tree-ssa/cfgcleanup-1.c,
	gcc.dg/tree-ssa/complex-1.c, gcc.dg/tree-ssa/complex-2.c,
	gcc.dg/tree-ssa/copy-headers.c, gcc.dg/tree-ssa/ifc-20040816-1.c,
	gcc.dg/tree-ssa/ifc-20040816-2.c, gcc.dg/tree-ssa/inline_asm-1.c,
	gcc.dg/tree-ssa/inline_asm-2.c, gcc.dg/tree-ssa/loop-1.c,
	gcc.dg/tree-ssa/loop-2.c, gcc.dg/tree-ssa/loop-3.c,
	gcc.dg/tree-ssa/loop-4.c, gcc.dg/tree-ssa/loop-5.c,
	gcc.dg/tree-ssa/loop-6.c, gcc.dg/tree-ssa/loop-7.c,
	gcc.dg/tree-ssa/ltrans-1.c, gcc.dg/tree-ssa/ltrans-2.c,
	gcc.dg/tree-ssa/ltrans-3.c, gcc.dg/tree-ssa/ltrans-4.c,
	gcc.dg/tree-ssa/ltrans-5.c, gcc.dg/tree-ssa/pr15349.c,
	gcc.dg/tree-ssa/pr15791-3.c, gcc.dg/tree-ssa/pr15791-4.c,
	gcc.dg/tree-ssa/pr15791-5.c, gcc.dg/tree-ssa/pr16721.c,
	gcc.dg/tree-ssa/pr19633.c, gcc.dg/tree-ssa/sra-1.c,
	gcc.dg/tree-ssa/sra-2.c, gcc.dg/tree-ssa/sra-3.c,
	gcc.dg/tree-ssa/ssa-ccp-1.c, gcc.dg/tree-ssa/ssa-ccp-10.c,
	gcc.dg/tree-ssa/ssa-ccp-11.c, gcc.dg/tree-ssa/ssa-ccp-2.c,
	gcc.dg/tree-ssa/ssa-ccp-3.c, gcc.dg/tree-ssa/ssa-ccp-7.c,
	gcc.dg/tree-ssa/ssa-ccp-9.c, gcc.dg/tree-ssa/ssa-dce-1.c,
	gcc.dg/tree-ssa/ssa-dce-2.c, gcc.dg/tree-ssa/ssa-dce-3.c,
	gcc.dg/tree-ssa/ssa-dom-ccp-1.c, gcc.dg/tree-ssa/ssa-dom-cse-1.c,
	gcc.dg/tree-ssa/ssa-dom-thread-1.c, gcc.dg/tree-ssa/ssa-pre-1.c,
	gcc.dg/tree-ssa/ssa-pre-2.c, gcc.dg/tree-ssa/ssa-pre-3.c,
	gcc.dg/tree-ssa/ssa-pre-4.c, gcc.dg/tree-ssa/ssa-pre-5.c,
	gcc.dg/tree-ssa/ssa-pre-6.c, gcc.dg/tree-ssa/ssa-sink-1.c,
	gcc.dg/tree-ssa/ssa-sink-2.c, gcc.dg/tree-ssa/ssa-sink-3.c,
	gcc.dg/tree-ssa/ssa-sink-4.c, gcc.dg/tree-ssa/tailcall-1.c,
	gcc.dg/tree-ssa/tailcall-2.c, gcc.dg/tree-ssa/tailrecursion-1.c,
	gcc.dg/tree-ssa/tailrecursion-2.c, gcc.dg/tree-ssa/tailrecursion-3.c,
	gcc.dg/tree-ssa/tailrecursion-4.c, gcc.dg/tree-ssa/tailrecursion-5.c,
	gcc.dg/tree-ssa/useless-1.c: Ditto.
	gcc.dg/vect/pr16105.c, gcc.dg/vect/pr18308.c, gcc.dg/vect/pr18400.c,
	gcc.dg/vect/pr18425.c, gcc.dg/vect/pr18536.c, gcc.dg/vect/vect-1.c,
	gcc.dg/vect/vect-10.c, gcc.dg/vect/vect-11.c, gcc.dg/vect/vect-12.c,
	gcc.dg/vect/vect-13.c, gcc.dg/vect/vect-14.c, gcc.dg/vect/vect-15.c,
	gcc.dg/vect/vect-16.c, gcc.dg/vect/vect-17.c, gcc.dg/vect/vect-18.c,
	gcc.dg/vect/vect-19.c, gcc.dg/vect/vect-2.c, gcc.dg/vect/vect-20.c,
	gcc.dg/vect/vect-21.c, gcc.dg/vect/vect-22.c, gcc.dg/vect/vect-23.c,
	gcc.dg/vect/vect-24.c, gcc.dg/vect/vect-25.c, gcc.dg/vect/vect-26.c,
	gcc.dg/vect/vect-27.c, gcc.dg/vect/vect-28.c, gcc.dg/vect/vect-29.c,
	gcc.dg/vect/vect-3.c, gcc.dg/vect/vect-30.c, gcc.dg/vect/vect-31.c,
	gcc.dg/vect/vect-32.c, gcc.dg/vect/vect-33.c, gcc.dg/vect/vect-34.c,
	gcc.dg/vect/vect-35.c, gcc.dg/vect/vect-36.c, gcc.dg/vect/vect-37.c,
	gcc.dg/vect/vect-38.c, gcc.dg/vect/vect-4.c, gcc.dg/vect/vect-40.c,
	gcc.dg/vect/vect-41.c, gcc.dg/vect/vect-42.c, gcc.dg/vect/vect-43.c,
	gcc.dg/vect/vect-44.c, gcc.dg/vect/vect-45.c, gcc.dg/vect/vect-46.c,
	gcc.dg/vect/vect-47.c, gcc.dg/vect/vect-48.c, gcc.dg/vect/vect-49.c,
	gcc.dg/vect/vect-5.c, gcc.dg/vect/vect-50.c, gcc.dg/vect/vect-51.c,
	gcc.dg/vect/vect-52.c, gcc.dg/vect/vect-53.c, gcc.dg/vect/vect-54.c,
	gcc.dg/vect/vect-55.c, gcc.dg/vect/vect-56.c, gcc.dg/vect/vect-57.c,
	gcc.dg/vect/vect-58.c, gcc.dg/vect/vect-59.c, gcc.dg/vect/vect-6.c,
	gcc.dg/vect/vect-60.c, gcc.dg/vect/vect-61.c, gcc.dg/vect/vect-62.c,
	gcc.dg/vect/vect-63.c, gcc.dg/vect/vect-64.c, gcc.dg/vect/vect-65.c,
	gcc.dg/vect/vect-66.c, gcc.dg/vect/vect-67.c, gcc.dg/vect/vect-68.c,
	gcc.dg/vect/vect-69.c, gcc.dg/vect/vect-7.c, gcc.dg/vect/vect-70.c,
	gcc.dg/vect/vect-71.c, gcc.dg/vect/vect-72.c, gcc.dg/vect/vect-73.c,
	gcc.dg/vect/vect-74.c, gcc.dg/vect/vect-75.c, gcc.dg/vect/vect-76.c,
	gcc.dg/vect/vect-77.c, gcc.dg/vect/vect-78.c, gcc.dg/vect/vect-79.c,
	gcc.dg/vect/vect-8.c, gcc.dg/vect/vect-80.c, gcc.dg/vect/vect-82.c,
	gcc.dg/vect/vect-82_64.c, gcc.dg/vect/vect-83.c,
	gcc.dg/vect/vect-83_64.c, gcc.dg/vect/vect-85.c,
	gcc.dg/vect/vect-86.c, gcc.dg/vect/vect-87.c, gcc.dg/vect/vect-88.c,
	gcc.dg/vect/vect-89.c, gcc.dg/vect/vect-9.c, gcc.dg/vect/vect-96.c,
	gcc.dg/vect/vect-97.c, gcc.dg/vect/vect-98.c, gcc.dg/vect/vect-all.c,
	gcc.dg/vect/vect-none.c: Ditto.
	* treelang/compile/extrafunc.tree, treelang/compile/extravar.tree,
	treelang/compile/unsigned.tree: Ditto.

From-SVN: r97342
parent 515e6cd0
Showing with 233 additions and 34 deletions
gcc/testsuite/ChangeLog
2005-03-31 Janis Johnson <janis187@us.ibm.com>
* g++.dg/opt/nothrow1.C: Use cleanup-tree-dump.
g++.dg/tree-ssa/empty-1.C, g++.dg/tree-ssa/nothrow-1.C,
g++.dg/tree-ssa/pointer-reference-alias.C,
g++.dg/tree-ssa/pr15791-3.C, g++.dg/tree-ssa/pr15791-4.C,
g++.dg/tree-ssa/pr15791-5.C, g++.dg/tree-ssa/ssa-cast-1.C
g++.dg/tree-ssa/ssa-sra-1.C, g++.dg/tree-ssa/ssa-sra-2.C: Ditto
g++.dg/vect/pr19951.cc: Ditto.
* gcc.dg/builtins-43.c, gcc.dg/builtins-44.c, gcc.dg/builtins-45.c,
gcc.dg/builtins-47.c: Ditto.
* gcc.dg/pr15784-1.c, gcc.dg/pr15784-2.c, gcc.dg/pr15784-3.c,
gcc.dg/pr20115-1.c: Ditto.
* gcc.dg/tree-ssa/20030530-2.c,
gcc.dg/tree-ssa/20030611-1.c, gcc.dg/tree-ssa/20030703-1.c,
gcc.dg/tree-ssa/20030703-2.c, gcc.dg/tree-ssa/20030708-1.c,
gcc.dg/tree-ssa/20030709-1.c, gcc.dg/tree-ssa/20030709-2.c,
gcc.dg/tree-ssa/20030709-3.c, gcc.dg/tree-ssa/20030710-1.c,
gcc.dg/tree-ssa/20030711-1.c, gcc.dg/tree-ssa/20030711-2.c,
gcc.dg/tree-ssa/20030711-3.c, gcc.dg/tree-ssa/20030714-1.c,
gcc.dg/tree-ssa/20030714-2.c, gcc.dg/tree-ssa/20030728-1.c,
gcc.dg/tree-ssa/20030729-1.c, gcc.dg/tree-ssa/20030730-1.c,
gcc.dg/tree-ssa/20030730-2.c, gcc.dg/tree-ssa/20030731-1.c,
gcc.dg/tree-ssa/20030731-2.c, gcc.dg/tree-ssa/20030807-1.c,
gcc.dg/tree-ssa/20030807-10.c, gcc.dg/tree-ssa/20030807-11.c,
gcc.dg/tree-ssa/20030807-2.c, gcc.dg/tree-ssa/20030807-3.c,
gcc.dg/tree-ssa/20030807-5.c, gcc.dg/tree-ssa/20030807-6.c,
gcc.dg/tree-ssa/20030807-7.c, gcc.dg/tree-ssa/20030807-8.c,
gcc.dg/tree-ssa/20030807-9.c, gcc.dg/tree-ssa/20030808-1.c,
gcc.dg/tree-ssa/20030814-1.c, gcc.dg/tree-ssa/20030814-2.c,
gcc.dg/tree-ssa/20030814-3.c, gcc.dg/tree-ssa/20030814-4.c,
gcc.dg/tree-ssa/20030814-5.c, gcc.dg/tree-ssa/20030814-6.c,
gcc.dg/tree-ssa/20030814-7.c, gcc.dg/tree-ssa/20030815-1.c,
gcc.dg/tree-ssa/20030824-1.c,
gcc.dg/tree-ssa/20030824-2.c, gcc.dg/tree-ssa/20030825-1.c,
gcc.dg/tree-ssa/20030907-1.c, gcc.dg/tree-ssa/20030917-1.c,
gcc.dg/tree-ssa/20030917-3.c, gcc.dg/tree-ssa/20030922-1.c,
gcc.dg/tree-ssa/20030922-2.c, gcc.dg/tree-ssa/20031015-1.c,
gcc.dg/tree-ssa/20031021-1.c, gcc.dg/tree-ssa/20031022-1.c,
gcc.dg/tree-ssa/20031106-1.c, gcc.dg/tree-ssa/20031106-2.c,
gcc.dg/tree-ssa/20031106-3.c, gcc.dg/tree-ssa/20031106-4.c,
gcc.dg/tree-ssa/20031106-5.c, gcc.dg/tree-ssa/20031106-6.c,
gcc.dg/tree-ssa/20031216-1.c, gcc.dg/tree-ssa/20040204-1.c,
gcc.dg/tree-ssa/20040210-1.c, gcc.dg/tree-ssa/20040211-1.c,
gcc.dg/tree-ssa/20040216-1.c, gcc.dg/tree-ssa/20040305-1.c,
gcc.dg/tree-ssa/20040430-1.c, gcc.dg/tree-ssa/20040513-1.c,
gcc.dg/tree-ssa/20040513-2.c, gcc.dg/tree-ssa/20040514-1.c,
gcc.dg/tree-ssa/20040514-2.c, gcc.dg/tree-ssa/20040517-1.c,
gcc.dg/tree-ssa/20040518-1.c, gcc.dg/tree-ssa/20040518-2.c,
gcc.dg/tree-ssa/20040615-1.c, gcc.dg/tree-ssa/20040624-1.c,
gcc.dg/tree-ssa/20040703-1.c, gcc.dg/tree-ssa/20040721-1.c,
gcc.dg/tree-ssa/20040729-1.c, gcc.dg/tree-ssa/20040911-1.c,
gcc.dg/tree-ssa/20041002-1.c, gcc.dg/tree-ssa/20041122-1.c,
gcc.dg/tree-ssa/20050128-1.c, gcc.dg/tree-ssa/20050215-1.c,
gcc.dg/tree-ssa/asm-1.c, gcc.dg/tree-ssa/asm-2.c,
gcc.dg/tree-ssa/asm-3.c, gcc.dg/tree-ssa/cfgcleanup-1.c,
gcc.dg/tree-ssa/complex-1.c, gcc.dg/tree-ssa/complex-2.c,
gcc.dg/tree-ssa/copy-headers.c, gcc.dg/tree-ssa/ifc-20040816-1.c,
gcc.dg/tree-ssa/ifc-20040816-2.c, gcc.dg/tree-ssa/inline_asm-1.c,
gcc.dg/tree-ssa/inline_asm-2.c, gcc.dg/tree-ssa/loop-1.c,
gcc.dg/tree-ssa/loop-2.c, gcc.dg/tree-ssa/loop-3.c,
gcc.dg/tree-ssa/loop-4.c, gcc.dg/tree-ssa/loop-5.c,
gcc.dg/tree-ssa/loop-6.c, gcc.dg/tree-ssa/loop-7.c,
gcc.dg/tree-ssa/ltrans-1.c, gcc.dg/tree-ssa/ltrans-2.c,
gcc.dg/tree-ssa/ltrans-3.c, gcc.dg/tree-ssa/ltrans-4.c,
gcc.dg/tree-ssa/ltrans-5.c, gcc.dg/tree-ssa/pr15349.c,
gcc.dg/tree-ssa/pr15791-3.c, gcc.dg/tree-ssa/pr15791-4.c,
gcc.dg/tree-ssa/pr15791-5.c, gcc.dg/tree-ssa/pr16721.c,
gcc.dg/tree-ssa/pr19633.c, gcc.dg/tree-ssa/sra-1.c,
gcc.dg/tree-ssa/sra-2.c, gcc.dg/tree-ssa/sra-3.c,
gcc.dg/tree-ssa/ssa-ccp-1.c, gcc.dg/tree-ssa/ssa-ccp-10.c,
gcc.dg/tree-ssa/ssa-ccp-11.c, gcc.dg/tree-ssa/ssa-ccp-2.c,
gcc.dg/tree-ssa/ssa-ccp-3.c, gcc.dg/tree-ssa/ssa-ccp-7.c,
gcc.dg/tree-ssa/ssa-ccp-9.c, gcc.dg/tree-ssa/ssa-dce-1.c,
gcc.dg/tree-ssa/ssa-dce-2.c, gcc.dg/tree-ssa/ssa-dce-3.c,
gcc.dg/tree-ssa/ssa-dom-ccp-1.c, gcc.dg/tree-ssa/ssa-dom-cse-1.c,
gcc.dg/tree-ssa/ssa-dom-thread-1.c, gcc.dg/tree-ssa/ssa-pre-1.c,
gcc.dg/tree-ssa/ssa-pre-2.c, gcc.dg/tree-ssa/ssa-pre-3.c,
gcc.dg/tree-ssa/ssa-pre-4.c, gcc.dg/tree-ssa/ssa-pre-5.c,
gcc.dg/tree-ssa/ssa-pre-6.c, gcc.dg/tree-ssa/ssa-sink-1.c,
gcc.dg/tree-ssa/ssa-sink-2.c, gcc.dg/tree-ssa/ssa-sink-3.c,
gcc.dg/tree-ssa/ssa-sink-4.c, gcc.dg/tree-ssa/tailcall-1.c,
gcc.dg/tree-ssa/tailcall-2.c, gcc.dg/tree-ssa/tailrecursion-1.c,
gcc.dg/tree-ssa/tailrecursion-2.c, gcc.dg/tree-ssa/tailrecursion-3.c,
gcc.dg/tree-ssa/tailrecursion-4.c, gcc.dg/tree-ssa/tailrecursion-5.c,
gcc.dg/tree-ssa/useless-1.c: Ditto.
gcc.dg/vect/pr16105.c, gcc.dg/vect/pr18308.c, gcc.dg/vect/pr18400.c,
gcc.dg/vect/pr18425.c, gcc.dg/vect/pr18536.c, gcc.dg/vect/vect-1.c,
gcc.dg/vect/vect-10.c, gcc.dg/vect/vect-11.c, gcc.dg/vect/vect-12.c,
gcc.dg/vect/vect-13.c, gcc.dg/vect/vect-14.c, gcc.dg/vect/vect-15.c,
gcc.dg/vect/vect-16.c, gcc.dg/vect/vect-17.c, gcc.dg/vect/vect-18.c,
gcc.dg/vect/vect-19.c, gcc.dg/vect/vect-2.c, gcc.dg/vect/vect-20.c,
gcc.dg/vect/vect-21.c, gcc.dg/vect/vect-22.c, gcc.dg/vect/vect-23.c,
gcc.dg/vect/vect-24.c, gcc.dg/vect/vect-25.c, gcc.dg/vect/vect-26.c,
gcc.dg/vect/vect-27.c, gcc.dg/vect/vect-28.c, gcc.dg/vect/vect-29.c,
gcc.dg/vect/vect-3.c, gcc.dg/vect/vect-30.c, gcc.dg/vect/vect-31.c,
gcc.dg/vect/vect-32.c, gcc.dg/vect/vect-33.c, gcc.dg/vect/vect-34.c,
gcc.dg/vect/vect-35.c, gcc.dg/vect/vect-36.c, gcc.dg/vect/vect-37.c,
gcc.dg/vect/vect-38.c, gcc.dg/vect/vect-4.c, gcc.dg/vect/vect-40.c,
gcc.dg/vect/vect-41.c, gcc.dg/vect/vect-42.c, gcc.dg/vect/vect-43.c,
gcc.dg/vect/vect-44.c, gcc.dg/vect/vect-45.c, gcc.dg/vect/vect-46.c,
gcc.dg/vect/vect-47.c, gcc.dg/vect/vect-48.c, gcc.dg/vect/vect-49.c,
gcc.dg/vect/vect-5.c, gcc.dg/vect/vect-50.c, gcc.dg/vect/vect-51.c,
gcc.dg/vect/vect-52.c, gcc.dg/vect/vect-53.c, gcc.dg/vect/vect-54.c,
gcc.dg/vect/vect-55.c, gcc.dg/vect/vect-56.c, gcc.dg/vect/vect-57.c,
gcc.dg/vect/vect-58.c, gcc.dg/vect/vect-59.c, gcc.dg/vect/vect-6.c,
gcc.dg/vect/vect-60.c, gcc.dg/vect/vect-61.c, gcc.dg/vect/vect-62.c,
gcc.dg/vect/vect-63.c, gcc.dg/vect/vect-64.c, gcc.dg/vect/vect-65.c,
gcc.dg/vect/vect-66.c, gcc.dg/vect/vect-67.c, gcc.dg/vect/vect-68.c,
gcc.dg/vect/vect-69.c, gcc.dg/vect/vect-7.c, gcc.dg/vect/vect-70.c,
gcc.dg/vect/vect-71.c, gcc.dg/vect/vect-72.c, gcc.dg/vect/vect-73.c,
gcc.dg/vect/vect-74.c, gcc.dg/vect/vect-75.c, gcc.dg/vect/vect-76.c,
gcc.dg/vect/vect-77.c, gcc.dg/vect/vect-78.c, gcc.dg/vect/vect-79.c,
gcc.dg/vect/vect-8.c, gcc.dg/vect/vect-80.c, gcc.dg/vect/vect-82.c,
gcc.dg/vect/vect-82_64.c, gcc.dg/vect/vect-83.c,
gcc.dg/vect/vect-83_64.c, gcc.dg/vect/vect-85.c,
gcc.dg/vect/vect-86.c, gcc.dg/vect/vect-87.c, gcc.dg/vect/vect-88.c,
gcc.dg/vect/vect-89.c, gcc.dg/vect/vect-9.c, gcc.dg/vect/vect-96.c,
gcc.dg/vect/vect-97.c, gcc.dg/vect/vect-98.c, gcc.dg/vect/vect-all.c,
gcc.dg/vect/vect-none.c: Ditto.
* treelang/compile/extrafunc.tree, treelang/compile/extravar.tree,
treelang/compile/unsigned.tree: Ditto.
* gcc.dg/altivec-16.c: Use cleanup-saved-temps.
* gcc.dg/cpp/direct2s.c: Ditto.
* gcc.dg/cpp/paste4.c: Ditto.
......
gcc/testsuite/g++.dg/opt/nothrow1.C
......@@ -22,3 +22,4 @@ int main()
// The catch block should be optimized away.
// { dg-final { scan-tree-dump-times "-42" 0 "optimized" } }
// { dg-final { cleanup-tree-dump "optimized" } }
gcc/testsuite/g++.dg/tree-ssa/empty-1.C
......@@ -11,3 +11,4 @@ S bar (const S &a)
/* Test whether memcpy call has been optimized out. */
/* { dg-final { scan-tree-dump-times "memcpy" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/g++.dg/tree-ssa/nothrow-1.C
......@@ -17,3 +17,4 @@ void q()
}
/* We shouldnotice nothrow attribute. */
/* { dg-final { scan-tree-dump-times "exception" 0 "cfg"} } */
/* { dg-final { cleanup-tree-dump "cfg" } } */
gcc/testsuite/g++.dg/tree-ssa/pointer-reference-alias.C
......@@ -9,5 +9,5 @@ int f(int *a)
}
/* There should be only one dereferencing of a. */
/* { dg-final { scan-tree-dump-times "\\*a" 1 "vars"} } */
/* { dg-final { scan-tree-dump-times "\\*a" 1 "vars" } } */
/* { dg-final { cleanup-tree-dump "vars" } } */
gcc/testsuite/g++.dg/tree-ssa/pr15791-3.C
......@@ -10,4 +10,4 @@ int f(int i, unsigned j)
}
/* { dg-final { scan-tree-dump-times "i == j" 0 "gimple" } } */
/* { dg-final { cleanup-tree-dump "gimple" } } */
gcc/testsuite/g++.dg/tree-ssa/pr15791-4.C
......@@ -10,4 +10,4 @@ int f(int i, int j)
}
/* { dg-final { scan-tree-dump-times "i == j" 0 "gimple" } } */
/* { dg-final { cleanup-tree-dump "gimple" } } */
gcc/testsuite/g++.dg/tree-ssa/pr15791-5.C
......@@ -10,4 +10,4 @@ int foo(int i, int j)
}
/* { dg-final { scan-tree-dump-times "i == j" 1 "gimple" } } */
/* { dg-final { cleanup-tree-dump "gimple" } } */
gcc/testsuite/g++.dg/tree-ssa/ssa-cast-1.C
......@@ -9,4 +9,4 @@ int &f(int *a)
/* There should be no cast as pointer and references are
considered the same type. */
/* { dg-final { scan-tree-dump-times "\\(int &\\)" 0 "vars"} } */
/* { dg-final { cleanup-tree-dump "vars" } } */
gcc/testsuite/g++.dg/tree-ssa/ssa-sra-1.C
......@@ -58,3 +58,4 @@ void temp()
/* We should have removed the casts from pointers to references and caused SRA to happen. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "vars"} } */
/* { dg-final { cleanup-tree-dump "vars" } } */
gcc/testsuite/g++.dg/tree-ssa/ssa-sra-2.C
......@@ -49,3 +49,4 @@ void test()
/* We should have removed the casts from pointers to references and caused SRA to happen. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "vars"} } */
/* { dg-final { cleanup-tree-dump "vars" } } */
gcc/testsuite/g++.dg/vect/pr19951.cc
......@@ -15,3 +15,5 @@ void bar()
for (;;)
foo();
}
/* { dg-final { cleanup-tree-dump "vect" } } */
gcc/testsuite/gcc.dg/builtins-43.c
......@@ -47,7 +47,8 @@ main ()
/* Check that all instances of __builtin_isnan were folded. */
/* { dg-final { scan-tree-dump-times "isnan" 0 "generic" } } */
/* { dg-final { cleanup-tree-dump "generic" } } */
/* Check that all instances of link_error were subject to DCE. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/builtins-44.c
......@@ -52,4 +52,4 @@ main ()
/* Check that all instances of link_error were subject to DCE. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/builtins-45.c
......@@ -44,4 +44,4 @@ main ()
/* Check that all instances of link_error were subject to DCE. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/builtins-47.c
......@@ -17,4 +17,4 @@ int main ()
/* { dg-final { scan-tree-dump-times "sqrt" 0 "gimple" } } */
/* { dg-final { scan-tree-dump-times "pow" 0 "gimple" } } */
/* { dg-final { cleanup-tree-dump "gimple" } } */
gcc/testsuite/gcc.dg/pr15784-1.c
......@@ -40,3 +40,4 @@ int i (float x) {
return fabs(x) == -0.0;
}
/* { dg-final { scan-tree-dump-times "ABS_EXPR" 0 "generic" } } */
/* { dg-final { cleanup-tree-dump "generic" } } */
gcc/testsuite/gcc.dg/pr15784-2.c
......@@ -9,3 +9,4 @@ int a (float x) {
}
/* { dg-final { scan-tree-dump-times "ABS_EXPR" 0 "generic" } } */
/* { dg-final { cleanup-tree-dump "generic" } } */
gcc/testsuite/gcc.dg/pr15784-3.c
......@@ -9,3 +9,4 @@ int a (float x) {
}
/* { dg-final { scan-tree-dump-times "ABS_EXPR" 1 "generic" } } */
/* { dg-final { cleanup-tree-dump "generic" } } */
gcc/testsuite/gcc.dg/pr20115-1.c
......@@ -12,3 +12,4 @@ int bar()
/* Check that we only have one call to foo. */
/* { dg-final { scan-tree-dump-times "foo" 1 "dom1" } } */
/* { dg-final { cleanup-tree-dump "dom1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030530-2.c
......@@ -23,4 +23,5 @@ rs6000_emit_prologue (int i, rs6000_stack_t *info)
commutative operands correctly. */
/* { dg-final { scan-tree-dump-times "\\+" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030611-1.c
......@@ -11,3 +11,4 @@ shit(int a)
/* There should be precisely one call to square. If there is more than one,
then the dominator optimizations failed to remove the redundant call. */
/* { dg-final { scan-tree-dump-times "square" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030703-1.c
......@@ -19,3 +19,4 @@ foo(int index)
/* There should be exactly one IF conditional. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030703-2.c
......@@ -41,3 +41,4 @@ get_alias_set (t)
if() to disappear. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030708-1.c
......@@ -40,4 +40,4 @@ nonlocal_mentioned_p (x)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030709-1.c
......@@ -13,3 +13,4 @@ foo ()
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030709-2.c
......@@ -51,3 +51,4 @@ get_alias_set (t)
collapse down to a simple return 0 without any conditionals). */
/* { dg-final { scan-tree-dump-times "if " 1 "cddce"} } */
/* { dg-final { cleanup-tree-dump "cddce" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030709-3.c
......@@ -44,3 +44,5 @@ record_component_aliases (type)
/* There should be one IF conditional. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030710-1.c
......@@ -52,3 +52,4 @@ record_component_aliases (type)
/* There should be two loads of vec.length. */
/* { dg-final { scan-tree-dump-times "vec.length" 2 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030711-1.c
......@@ -52,3 +52,4 @@ record_component_aliases (type)
/* There should be four loads of vec.length. */
/* { dg-final { scan-tree-dump-times "vec.length" 4 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030711-2.c
......@@ -65,3 +65,5 @@ get_alias_set (t,z)
/* There should be one load of alias. */
/* { dg-final { scan-tree-dump-times "->alias" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030711-3.c
......@@ -57,3 +57,5 @@ get_alias_set (t)
/* There should be one load of alias. */
/* { dg-final { scan-tree-dump-times "->alias" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030714-1.c
......@@ -41,3 +41,5 @@ find_base_value (src)
/* There should be three loads of ->code. */
/* { dg-final { scan-tree-dump-times "->code" 3 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030714-2.c
......@@ -36,4 +36,4 @@ get_alias_set (t)
properly. */
/* { dg-final { scan-tree-dump-times "if " 3 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030728-1.c
......@@ -44,4 +44,4 @@ objects_must_conflict_p (t1, t2)
/* There should be two assignments of variables to the value zero. */
/* { dg-final { scan-tree-dump-times " = 0" 2 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030729-1.c
......@@ -50,3 +50,5 @@ readonly_fields_p (type)
/* There should be one load of ->common.code. We currently fail this
because we load from ->common.code using different types. */
/* { dg-final { scan-tree-dump-times "common\.code" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030730-1.c
......@@ -21,4 +21,4 @@ foo (int attr_kind, unsigned long offset)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030730-2.c
......@@ -21,3 +21,4 @@ foo (int attr_kind, unsigned long offset)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030731-1.c
......@@ -64,3 +64,4 @@ store_expr (exp, target, want_value)
immediately dominates the comparison in question. We need something
stronger. */
/* { dg-final { scan-tree-dump-times "target.*!= 0" 0 "dom3" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030731-2.c
......@@ -14,3 +14,4 @@ bar (int i, int partial, int args_addr)
/* There should be only one IF conditional since the first does nothing
useful. */
/* { dg-final { scan-tree-dump-times "if " 1 "ccp"} } */
/* { dg-final { cleanup-tree-dump "ccp" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-1.c
......@@ -42,5 +42,4 @@ bar (rtx r)
which combines the result of those two tests into a new test
must always be true and it is optimized appropriately. */
/* { dg-final { scan-tree-dump-times "if " 2 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-10.c
......@@ -23,3 +23,4 @@ subreg_highpart_offset (outermode, innermode)
/* There should be one right shift by 2 places. */
/* { dg-final { scan-tree-dump-times " >> 2" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-11.c
......@@ -18,3 +18,4 @@ foo (reg)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-2.c
......@@ -25,3 +25,4 @@ foo(int n)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-3.c
......@@ -24,4 +24,4 @@ cpp_parse_escape (pstr, limit, wide)
/* There should be precisely three IF statements. If there is
more than two, then the dominator optimizations failed. */
/* { dg-final { scan-tree-dump-times "if " 3 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-5.c
......@@ -35,3 +35,5 @@ foo ()
/* There should be two IF statements. One for 'current_sym_addr->code == 42'.
The other one for '(EXPR)->unchanging'. */
/* { dg-final { scan-tree-dump-times "if " 2 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-6.c
......@@ -40,5 +40,4 @@ foo4 (distance, i, j)
/* There should be no ABS_EXPR. */
/* { dg-final { scan-tree-dump-times "ABS_EXPR " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-7.c
......@@ -35,3 +35,4 @@ simplify_condition (cond_p)
/* There should be exactly one IF conditional. TBAA is not able to
determine that 'decl' and 'cond' can't alias. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-8.c
......@@ -50,3 +50,4 @@ output_location_lists (die)
/* There should be exactly one IF conditional, in output_location_lists. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030807-9.c
......@@ -17,3 +17,4 @@ ooof ()
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030808-1.c
......@@ -38,3 +38,4 @@ delete_dead_jumptables ()
/* There should be no IF statements. */
/* { dg-final { scan-tree-dump-times "if " 0 "cddce"} } */
/* { dg-final { cleanup-tree-dump "cddce" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-1.c
......@@ -18,4 +18,4 @@ com(int *blah)
more than one, then the dominator optimizations failed. */
/* { dg-final { scan-tree-dump-times "\\*blah" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-2.c
......@@ -19,4 +19,4 @@ foo (int value)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-3.c
......@@ -20,4 +20,4 @@ foo (int value)
/* There should be one IF conditional. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-4.c
......@@ -35,7 +35,9 @@ blah (decl, set)
/* There should be precisely one reference to pointer_alias_set. If there is
more than one, then the dominator optimizations failed. */
/* { dg-final { scan-tree-dump-times "pointer_alias_set" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
/* The assignment set = -1 in the ELSE clause of the last IF
statement should be removed by the final cleanup phase. */
/* { dg-final { scan-tree-dump-times "set = -1" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-5.c
......@@ -35,7 +35,9 @@ blah (decl, set)
/* There should be precisely one reference to pointer_alias_set. If there is
more than one, then the dominator optimizations failed. */
/* { dg-final { scan-tree-dump-times "pointer_alias_set" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
/* The assignment set = -1 in the ELSE clause of the last IF
statement should be removed by the final cleanup phase. */
/* { dg-final { scan-tree-dump-times "set = -1" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-6.c
......@@ -42,3 +42,4 @@ foo (t, set)
/* ??? Will fail until we properly distinguish member stores. At
present the write to type.alias_set kills the previous load. */
/* { dg-final { scan-tree-dump-times "common.code" 1 "dom3" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030814-7.c
......@@ -39,3 +39,4 @@ mark_constant_function (void)
This if we find current_function_decl used as an argument, then
we have failed. */
/* { dg-final { scan-tree-dump-times "\\(current_function_decl\\)" 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030815-1.c
......@@ -39,5 +39,4 @@ blah (unsigned int regno)
eliminate some useless typecasting. The first type cast is needed
to convert the unsigned int regno parameter into a struct rtx_def **. */
/* { dg-final { scan-tree-dump-times "\\(struct rtx_def \\* \\*\\)" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030824-1.c
......@@ -20,3 +20,4 @@ int foo (int x, int y)
/* The addition should be optimized into 'y+x'. */
/* { dg-final { scan-tree-dump-times "\[xy\] \\+ \[xy]" 1 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030824-2.c
......@@ -20,3 +20,4 @@ int foo (int x, int y)
/* This function should be optimized into 'return y+x'. */
/* { dg-final { scan-tree-dump-times "return \[xy\] \\+ \[xy\]" 1 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030825-1.c
......@@ -26,3 +26,4 @@ xxx:;
/* Bla should not be optimized away. */
/* { dg-final { scan-tree-dump-times "bla" 1 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030907-1.c
......@@ -27,3 +27,4 @@ int main()
/* The abort() call clearly is unreachable. */
/* { dg-final { scan-tree-dump-times "abort" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030917-1.c
......@@ -16,5 +16,4 @@ findbestextension (int blah, int blah2)
/* The argument to "foo" should be a variable, not a constant. */
/* { dg-final { scan-tree-dump-times "foo .defval" 1 "ccp"} } */
/* { dg-final { cleanup-tree-dump "ccp" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030917-3.c
......@@ -21,5 +21,4 @@ main ()
/* The argument to "printf" should be a constant, not a variable. */
/* { dg-final { scan-tree-dump-times "printf.*, 0" 1 "ccp"} } */
/* { dg-final { cleanup-tree-dump "ccp" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030922-1.c
......@@ -31,3 +31,4 @@ voidify_wrapper_expr (tree wrapper)
/* There should be no IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20030922-2.c
......@@ -20,3 +20,4 @@ rgn_rank (rtx insn1, rtx insn2)
/* There should be two IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 2 "dom1" } } */
/* { dg-final { cleanup-tree-dump "dom1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031015-1.c
......@@ -14,3 +14,4 @@ main(void)
}
/* { dg-final { scan-tree-dump-times "V_MAY_DEF" 2 "alias1" } } */
/* { dg-final { cleanup-tree-dump "alias1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031021-1.c
......@@ -18,3 +18,4 @@ int main()
/* We should only store to a.i, not load from it. */
/* { dg-final { scan-tree-dump-times "a.i" 1 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031022-1.c
......@@ -25,3 +25,4 @@ blah (int arf)
/* There should be one load from entry_exit_blocks[1].pred. */
/* { dg-final { scan-tree-dump-times "entry_exit_blocks.1..pred" 1 "dom1"} } */
/* { dg-final { cleanup-tree-dump "dom1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031106-1.c
......@@ -18,3 +18,4 @@ void foo (int testarray[])
/* There should be no link_error calls. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031106-2.c
......@@ -25,3 +25,5 @@ void foo (struct s* teststruct)
/* There should be no link_error calls. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031106-3.c
......@@ -19,3 +19,4 @@ void foo (int testarray[])
/* There should be no link_error calls. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031106-4.c
......@@ -27,3 +27,4 @@ void foo (struct s* r)
/* There should be no link_error calls. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031106-5.c
......@@ -26,3 +26,4 @@ void foo2 (struct s* r, struct s* p)
/* There should be no link_error calls. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031106-6.c
......@@ -26,3 +26,4 @@ struct s foo (struct s r)
/* There should be no references to any of "temp_struct*"
temporaries. */
/* { dg-final { scan-tree-dump-times "temp_struct" 0 "optimized" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20031216-1.c
......@@ -17,3 +17,4 @@ foo (int b)
/* The comparison should be eliminated, there should be no reference
to link_error. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040204-1.c
......@@ -34,3 +34,4 @@ void test55 (int x, int y)
by teaching dom to look through && and register all components
as true. */
/* { dg-final { scan-tree-dump-times "link_error" 0 "optimized" { xfail { ! powerpc*-*-* } } } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040210-1.c
......@@ -30,3 +30,4 @@ main(){
/* Should have no more than two ifs left after straightening. */
/* { dg-final { scan-tree-dump-times "if " 2 "phiopt1"} } */
/* { dg-final { cleanup-tree-dump "phiopt1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040211-1.c
......@@ -38,3 +38,4 @@ com (rtx insn, int blah)
/* Cddce cannot remove possibly infinite loops and there is no way how to
determine whether the loop in can_move_up ends. */
/* { dg-final { scan-tree-dump "if " "cddce"} } */
/* { dg-final { cleanup-tree-dump "cddce" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040216-1.c
......@@ -15,4 +15,4 @@ foo(int *z, int *y, int xx)
/* We should convert two COND_EXPRs into straightline code. */
/* { dg-final { scan-tree-dump-times "Deleted dead store" 2 "dse1"} } */
/* { dg-final { cleanup-tree-dump "dse1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040305-1.c
......@@ -24,7 +24,9 @@ void foo(int edx, int eax)
/* Verify that we did a forward propagation. */
/* { dg-final { scan-tree-dump-times "Replaced" 1 "forwprop1"} } */
/* { dg-final { cleanup-tree-dump "forwprop1" } } */
/* After cddce we should have two IF statements remaining as the other
two tests can be threaded. */
/* { dg-final { scan-tree-dump-times "if " 2 "cddce"} } */
/* { dg-final { cleanup-tree-dump "cddce" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040430-1.c
......@@ -23,3 +23,4 @@ int main()
}
/* { dg-final { scan-tree-dump-times "if " 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040513-1.c
......@@ -14,5 +14,4 @@ foo (unsigned int a)
/* There should be no casts to a _Bool since we can use the temporary
holding (a>>5)&1 directly. */
/* { dg-final { scan-tree-dump-times "\\(_Bool\\)" 0 "forwprop1"} } */
/* { dg-final { cleanup-tree-dump "forwprop1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040513-2.c
......@@ -22,3 +22,4 @@ int t(int i)
/* There should be no link_error calls, if there is any, the
optimization has failed */
/* { dg-final { scan-tree-dump-times "link_error" 0 "dom2"} } */
/* { dg-final { cleanup-tree-dump "dom2" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040514-1.c
......@@ -16,3 +16,4 @@ end:
/* Should have no ifs left after straightening. */
/* { dg-final { scan-tree-dump-times "if " 0 "phiopt1"} } */
/* { dg-final { cleanup-tree-dump "phiopt1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040514-2.c
......@@ -15,3 +15,4 @@ foo2 (distance, i, j)
/* { dg-final { scan-tree-dump-times "ABS_EXPR " 1 "dom3"} } */
/* { dg-final { scan-tree-dump-times "if " 0 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040517-1.c
......@@ -18,3 +18,4 @@ void bar (void)
does not alias any other pointer.
Hence, we must have a VDEF for a before and after the call to foo(). */
/* { dg-final { scan-tree-dump-times "V_MAY_DEF" 1 "alias1"} } */
/* { dg-final { cleanup-tree-dump "alias1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040518-1.c
......@@ -10,3 +10,4 @@ int f(int a, int b)
/* Should have no ifs left after straightening. */
/* { dg-final { scan-tree-dump-times "if " 0 "phiopt1"} } */
/* { dg-final { cleanup-tree-dump "phiopt1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040518-2.c
......@@ -14,3 +14,4 @@ int t( int i)
/* We should convert one COND_EXPRs into straightline code with ABS. */
/* { dg-final { scan-tree-dump-times "straightline" 1 "phiopt1"} } */
/* { dg-final { scan-tree-dump-times "ABS_EXPR" 1 "phiopt1"} } */
/* { dg-final { cleanup-tree-dump "phiopt1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040615-1.c
......@@ -14,3 +14,4 @@ foo (unsigned int a, unsigned int b)
}
/* { dg-final { scan-tree-dump-times "bar2" 0 "dom1" } } */
/* { dg-final { cleanup-tree-dump "dom1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040624-1.c
......@@ -18,4 +18,4 @@ foo (unsigned int a, unsigned int b)
conditional. */
/* { dg-final { scan-tree-dump-times "if " 1 "dom1" } } */
/* { dg-final { cleanup-tree-dump "dom1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040703-1.c
......@@ -10,3 +10,4 @@ float foo(float x)
/* We should *not* fold the arithmetic. */
/* { dg-final { scan-tree-dump-times "0\\.0" 0 "dom2"} } */
/* { dg-final { cleanup-tree-dump "dom2" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040721-1.c
......@@ -25,3 +25,4 @@ main ()
/* There should be no G on the RHS of an assignment. */
/* { dg-final { scan-tree-dump-times "= G;" 0 "ccp"} } */
/* { dg-final { cleanup-tree-dump "ccp" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040729-1.c
......@@ -16,3 +16,4 @@ foo ()
operands. But 'p' itself is not volatile and taking the address of
a volatile does not constitute a volatile operand. */
/* { dg-final { scan-tree-dump-times "&x" 0 "dce3"} } */
/* { dg-final { cleanup-tree-dump "dce3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20040911-1.c
......@@ -19,3 +19,4 @@ int foo (int i)
}
/* { dg-final { scan-tree-dump-not "VUSE <c" "alias1" } } */
/* { dg-final { cleanup-tree-dump "alias1" } } */
gcc/testsuite/gcc.dg/tree-ssa/20041002-1.c
......@@ -21,3 +21,4 @@ bar (int i)
}
/* { dg-final { scan-tree-dump-times "if" 0 "ssa" } } */
/* { dg-final { cleanup-tree-dump "ssa" } } */
gcc/testsuite/gcc.dg/tree-ssa/20041122-1.c
......@@ -35,5 +35,4 @@ find_unreachable_blocks (int frobit)
modify e or e->dest. The net result is that we only need one
load of e->dest. */
/* { dg-final { scan-tree-dump-times "->dest" 1 "dom3" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
gcc/testsuite/gcc.dg/tree-ssa/20050128-1.c
......@@ -11,3 +11,4 @@ foo (int align)
/* We should have optimized away the mod operator before we genericized
the code. */
/* { dg-final { scan-tree-dump-times "%" 0 "generic"} } */
/* { dg-final { cleanup-tree-dump "generic" } } */
gcc/testsuite/gcc.dg/tree-ssa/20050215-1.c
......@@ -11,3 +11,4 @@ int foo (void)
/* Make sure the optimizers don't introduce overflow where one
did not exist in the original. */
/* { dg-final { scan-tree-dump-times "-0+4" 0 "optimized"} } */
/* { dg-final { cleanup-tree-dump "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