@@ -439,10 +439,10 @@ report_multiple_error_messages(Step *step, int nextra, Step **extrastep)
439
439
440
440
initPQExpBuffer (& buffer );
441
441
appendPQExpBufferStr (& buffer ,step -> name );
442
-
442
+
443
443
for (n = 0 ;n < nextra ;++ n )
444
444
appendPQExpBuffer (& buffer ," %s" ,extrastep [n ]-> name );
445
-
445
+
446
446
if (step -> errormsg )
447
447
{
448
448
fprintf (stdout ,"error in steps %s: %s\n" ,buffer .data ,
@@ -460,7 +460,7 @@ report_multiple_error_messages(Step *step, int nextra, Step **extrastep)
460
460
free (extrastep [n ]-> errormsg );
461
461
extrastep [n ]-> errormsg = NULL ;
462
462
}
463
-
463
+
464
464
termPQExpBuffer (& buffer );
465
465
}
466
466
@@ -779,7 +779,7 @@ try_complete_step(Step *step, int flags)
779
779
td += (int64 )current_time .tv_usec - (int64 )start_time .tv_usec ;
780
780
781
781
/*
782
- * After 60 seconds, try to cancel the query.
782
+ * After 60 seconds, try to cancel the query.
783
783
*
784
784
* If the user tries to test an invalid permutation, we don't
785
785
* want to hang forever, especially when this is running in the