gcc/

	* alloc-pool.c, asan.c, auto-inc-dec.c, basic-block.h, bb-reorder.c,
	bitmap.c, bitmap.h, bt-load.c, builtins.c, calls.c, cfgcleanup.c,
	cfgexpand.c, cfghooks.c, cfgloop.c, cfgloopmanip.c, cfgrtl.c, cgraph.c,
	cgraph.h, cgraphbuild.c, cgraphclones.c, cgraphunit.c, collect2.c,
	combine-stack-adj.c, combine.c, compare-elim.c, context.c, context.h,
	cprop.c, cse.c, cselib.c, dbxout.c, dce.c, defaults.h, df-core.c,
	df-problems.c, df-scan.c, df.h, diagnostic.c, double-int.c, dse.c,
	dumpfile.c, dwarf2asm.c, dwarf2cfi.c, dwarf2out.c, emit-rtl.c,
	errors.c, except.c, expmed.c, expr.c, file-find.c, final.c,
	fixed-value.c, fold-const.c, function.c, fwprop.c, gcc-ar.c, gcc.c,
	gcov-io.c, gcov-io.h, gcov.c, gcse.c, genattr-common.c, genattr.c,
	genattrtab.c, genautomata.c, genconfig.c, genemit.c, genextract.c,
	genflags.c, gengenrtl.c, gengtype-state.c, gengtype.c, genmodes.c,
	genopinit.c, genoutput.c, genpeep.c, genpreds.c, genrecog.c,
	gensupport.c, ggc-common.c, ggc-page.c, gimple-fold.c, gimple-low.c,
	gimple-pretty-print.c, gimple-ssa-strength-reduction.c, gimple.c,
	gimple.h, godump.c, graphite-clast-to-gimple.c,
	graphite-optimize-isl.c, graphite-poly.h, graphite-sese-to-poly.c,
	graphite.c, haifa-sched.c, hash-table.c, hash-table.h, hwint.c,
	hwint.h, ifcvt.c, incpath.c, init-regs.c, input.h, intl.c, intl.h,
	ipa-cp.c, ipa-devirt.c, ipa-inline-analysis.c, ipa-inline.c,
	ipa-profile.c, ipa-pure-const.c, ipa-reference.c, ipa-split.c,
	ipa-utils.c, ipa.c, ira-build.c, ira.c, jump.c, loop-doloop.c,
	loop-init.c, loop-invariant.c, loop-iv.c, lower-subreg.c, lto-cgraph.c,
	lto-streamer-in.c, lto-streamer-out.c, lto-wrapper.c, mcf.c,
	mode-switching.c, modulo-sched.c, omp-low.c, optabs.c, opts.c,
	pass_manager.h, passes.c, plugin.c, postreload-gcse.c, postreload.c,
	predict.c, prefix.c, pretty-print.c, print-rtl.c, print-tree.c,
	profile.c, read-md.c, real.c, real.h, recog.c, ree.c, reg-stack.c,
	regcprop.c, reginfo.c, regmove.c, regrename.c, regs.h, regstat.c,
	reload1.c, reorg.c, rtl.c, rtl.h, rtlanal.c, sbitmap.c, sched-rgn.c,
	sdbout.c, sel-sched-ir.c, sel-sched.c, sparseset.c, stack-ptr-mod.c,
	statistics.c, stmt.c, stor-layout.c, store-motion.c, streamer-hooks.h,
	system.h, target-hooks-macros.h, targhooks.c, targhooks.h, toplev.c,
	tracer.c, trans-mem.c, tree-browser.c, tree-call-cdce.c, tree-cfg.c,
	tree-cfgcleanup.c, tree-complex.c, tree-data-ref.c, tree-data-ref.h,
	tree-eh.c, tree-emutls.c, tree-flow.h, tree-if-conv.c, tree-into-ssa.c,
	tree-iterator.c, tree-loop-distribution.c, tree-mudflap.c,
	tree-nested.c, tree-nomudflap.c, tree-nrv.c, tree-object-size.c,
	tree-optimize.c, tree-pass.h, tree-pretty-print.c, tree-profile.c,
	tree-scalar-evolution.c, tree-sra.c, tree-ssa-ccp.c,
	tree-ssa-coalesce.c, tree-ssa-copy.c, tree-ssa-copyrename.c,
	tree-ssa-dce.c, tree-ssa-dom.c, tree-ssa-dse.c, tree-ssa-forwprop.c,
	tree-ssa-ifcombine.c, tree-ssa-live.c, tree-ssa-loop-ch.c,
	tree-ssa-loop-im.c, tree-ssa-loop-ivopts.c, tree-ssa-loop-prefetch.c,
	tree-ssa-loop.c, tree-ssa-math-opts.c, tree-ssa-operands.c,
	tree-ssa-phiopt.c, tree-ssa-phiprop.c, tree-ssa-pre.c,
	tree-ssa-reassoc.c, tree-ssa-sink.c, tree-ssa-strlen.c,
	tree-ssa-structalias.c, tree-ssa-threadedge.c, tree-ssa-threadupdate.c,
	tree-ssa-uncprop.c, tree-ssa-uninit.c, tree-ssa.c, tree-ssanames.c,
	tree-stdarg.c, tree-switch-conversion.c, tree-tailcall.c,
	tree-vect-data-refs.c, tree-vect-generic.c, tree-vect-loop-manip.c,
	tree-vect-stmts.c, tree-vectorizer.c, tree-vectorizer.h, tree-vrp.c,
	tree.c, tree.h, tsan.c, tsystem.h, value-prof.c, var-tracking.c,
	varasm.c, vec.h, vmsdbgout.c, vtable-verify.c, web.c: Add missing
	whitespace before "(".


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@203004 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 12 insertions, 11 deletions

diff --git a/gcc/genrecog.c b/gcc/genrecog.c
index 691b0281175..814be7d17e3 100644
--- a/gcc/genrecog.c
+++ b/gcc/genrecog.c
@@ -58,7 +58,7 @@
 #include "gensupport.h"
 
 #define OUTPUT_LABEL(INDENT_STRING, LABEL_NUMBER) \
-  printf("%sL%d: ATTRIBUTE_UNUSED_LABEL\n", (INDENT_STRING), (LABEL_NUMBER))
+  printf ("%sL%d: ATTRIBUTE_UNUSED_LABEL\n", (INDENT_STRING), (LABEL_NUMBER))
 
 /* Ways of obtaining an rtx to be tested.  */
 enum position_type {
@@ -1619,7 +1619,7 @@ write_afterward (struct decision *start, struct decision *afterward,
 		 const char *indent)
 {
   if (!afterward || start->subroutine_number > 0)
-    printf("%sgoto ret0;\n", indent);
+    printf ("%sgoto ret0;\n", indent);
   else
     {
       change_state (start->position, afterward->position, indent);
@@ -1669,7 +1669,7 @@ write_switch (struct decision *start, int depth)
       struct decision *ret;
       RTX_CODE code;
 
-      memset (codemap, 0, sizeof(codemap));
+      memset (codemap, 0, sizeof (codemap));
 
       printf ("  switch (GET_CODE (x%d))\n    {\n", depth);
       code = p->tests->u.code;
@@ -1762,7 +1762,8 @@ write_switch (struct decision *start, int depth)
       if (type == DT_elt_zero_wide_safe)
 	{
 	  indent = "  ";
-	  printf("  if ((int) XWINT (x%d, 0) == XWINT (x%d, 0))\n", depth, depth);
+	  printf ("  if ((int) XWINT (x%d, 0) == XWINT (x%d, 0))\n",
+		  depth, depth);
 	}
       printf ("%s  switch (", indent);
       switch (type)
@@ -1937,7 +1938,7 @@ write_action (struct decision *p, struct decision_test *test,
 
   if (test->type == DT_accept_op)
     {
-      printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
+      printf ("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
 
       /* Only allow DT_accept_insn to follow.  */
       if (test->next)
@@ -1992,7 +1993,7 @@ write_action (struct decision *p, struct decision_test *test,
     }
   else
     {
-      printf("%sgoto L%d;\n", indent, success->number);
+      printf ("%sgoto L%d;\n", indent, success->number);
       success->need_label = 1;
     }
 
@@ -2357,7 +2358,7 @@ make_insn_sequence (rtx insn, enum routine_type type)
 
   validate_pattern (x, insn, NULL_RTX, 0);
 
-  memset(&head, 0, sizeof(head));
+  memset (&head, 0, sizeof (head));
   last = add_to_sequence (x, &head, &root_pos, type, 1);
 
   /* Find the end of the test chain on the last node.  */
@@ -2423,7 +2424,7 @@ make_insn_sequence (rtx insn, enum routine_type type)
 		}
 
 	      /* Recognize it.  */
-	      memset (&clobber_head, 0, sizeof(clobber_head));
+	      memset (&clobber_head, 0, sizeof (clobber_head));
 	      last = add_to_sequence (new_rtx, &clobber_head, &root_pos,
 				      type, 1);
 
@@ -2493,7 +2494,7 @@ process_tree (struct decision_head *head, enum routine_type subroutine_type)
       /* We run this after find_afterward, because find_afterward needs
 	 the redundant DT_mode tests on predicates to determine whether
 	 two tests can both be true or not.  */
-      simplify_tests(head);
+      simplify_tests (head);
 
       write_subroutines (head, subroutine_type);
     }
@@ -2601,12 +2602,12 @@ debug_decision_2 (struct decision_test *test)
       break;
     case DT_pred:
       fprintf (stderr, "pred=(%s,%s)",
-	       test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
+	       test->u.pred.name, GET_MODE_NAME (test->u.pred.mode));
       break;
     case DT_c_test:
       {
 	char sub[16+4];
-	strncpy (sub, test->u.c_test, sizeof(sub));
+	strncpy (sub, test->u.c_test, sizeof (sub));
 	memcpy (sub+16, "...", 4);
 	fprintf (stderr, "c_test=\"%s\"", sub);
       }