X-Git-Url: http://winboard.nl/cgi-bin?a=blobdiff_plain;f=engineoutput.c;h=3e9da121a73fbb638d1c1f23ae4b8f0ac391f760;hb=4011e8678d85310eedf19fd00aa5d96a9a60770a;hp=2532ef84676be57fe6dba60112b2fc8613795c9f;hpb=bf20302f6fa856f6c2d3f3feb5dfbf3fd1ab9652;p=xboard.git

diff --git a/engineoutput.c b/engineoutput.c
index 2532ef8..3e9da12 100644
--- a/engineoutput.c
+++ b/engineoutput.c
@@ -5,7 +5,7 @@
  *
  * Copyright 2005 Alessandro Scotti
  *
- * Enhancements Copyright 1995, 2009, 2010, 2011, 2012, 2013, 2014 Free Software Foundation, Inc.
+ * Enhancements Copyright 1995, 2009, 2010, 2011, 2012, 2013, 2014, 2015 Free Software Foundation, Inc.
  *
  * ------------------------------------------------------------------------
  *
@@ -96,6 +96,7 @@ static int  columnMask = 0xF0;
 
 #define MAX_VAR 400
 static int scores[MAX_VAR], textEnd[MAX_VAR], keys[MAX_VAR], curDepth[2], nrVariations[2];
+static char fail[MAX_VAR];
 
 extern int initialRulePlies;
 
@@ -403,6 +404,7 @@ static int
 InsertionPoint (int len, EngineOutputData *ed)
 {
 	int i, offs = 0, newScore = ed->score, n = ed->which;
+	char failType;
 
 	if(ed->nodes == 0 && ed->score == 0 && ed->time == 0)
 		newScore = 1e6; // info lines inserted on top
@@ -410,6 +412,9 @@ InsertionPoint (int len, EngineOutputData *ed)
 		curDepth[n] = ed->depth;
 		nrVariations[n] = 0; // throw away everything we had
 	}
+	i = strlen(ed->pv); if(i > 0) i--;
+	failType = ed->pv[i];
+	if(failType != '?' && failType != '!') failType = ' ';
 	// loop through all lines. Note even / odd used for different panes
 	for(i=nrVariations[n]-2; i>=0; i-=2) {
 		// put new item behind those we haven't looked at
@@ -417,18 +422,21 @@ InsertionPoint (int len, EngineOutputData *ed)
 		textEnd[i+n+2] = offs + len;
 		scores[i+n+2] = newScore;
 		keys[i+n+2] = ed->moveKey;
+		fail[i+n+2] = failType;
 		if(ed->moveKey != keys[i+n] && // same move always tops previous one (as a higher score must be a fail low)
-		   newScore < scores[i+n]) break;
+		   newScore < scores[i+n] && fail[i+n] == ' ') break;
 		// if it had higher score as previous, move previous in stead
 		scores[i+n+2] = ed->moveKey == keys[i+n] ? newScore : scores[i+n]; // correct scores of fail-low/high searches
 		textEnd[i+n+2] = textEnd[i+n] + len;
 		keys[i+n+2] = keys[i+n];
+		fail[i+n+2] = fail[i+n];
 	}
 	if(i<0) {
 		offs = 0;
 		textEnd[n] = offs + len;
 		scores[n] = newScore;
 		keys[n] = ed->moveKey;
+		fail[n] = failType;
 	}
 	nrVariations[n] += 2;
       return offs + strlen(header[ed->which]);
@@ -588,7 +596,7 @@ UpdateControls (EngineOutputData *ed)
         }
         Format(s_seld, params[0]); Format(s_knps, params[1]); Format(s_hits, hits); 
 
-        fail = ed->pv[strlen(ed->pv)-1];
+        if(*ed->pv) fail = ed->pv[strlen(ed->pv)-1]; else fail = ' ';
 	if(fail != '?' && fail != '!') fail = ' ';
 
         /* Score */
@@ -606,6 +614,9 @@ UpdateControls (EngineOutputData *ed)
         }
 
         /* Time */
+        if(time_secs >= 3600)
+            snprintf( s_time, sizeof(s_time)/sizeof(s_time[0]), "%d:%02d:%02d\t", time_secs / 3600, (time_secs / 60) % 60, time_secs % 60 );
+        else
         snprintf( s_time, sizeof(s_time)/sizeof(s_time[0]), "%d:%02d.%02d\t", time_secs / 60, time_secs % 60, time_cent );
 
         if(columnMask & 2) s_score[0] = NULLCHAR; // [HGM] hide: erase columns the user has hidden