1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
Author: Lukas Geyer <lukas@debian.org>
Description: General code cleanup, fixed several format mismatches in printf().
--- sjeng-11.2.orig/proof.c
+++ sjeng-11.2/proof.c
@@ -79,7 +79,7 @@
void losers_pn_eval (node_t *this);
unsigned char *membuff;
-int bufftop = 0;
+unsigned int bufftop = 0;
void* Xmalloc(int size)
{
@@ -506,7 +506,6 @@
int i;
move_s moves[MOVE_BUFF];
int l, num_moves;
- int reploop;
int ic;
if (node->expanded)
@@ -1024,7 +1023,7 @@
node_t *root;
node_t *mostproving;
node_t *currentnode;
- int leastlooked, leastlooked_l, leastlooked_i;
+ int leastlooked, leastlooked_l = 0, leastlooked_i = 0;
int losers;
int xnodecount;
int firsts, alternates;
@@ -1364,7 +1363,7 @@
#endif
{
#ifdef PN2
- printf("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d ", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters);
+ printf("P: %d D: %d N: %d S: %ld Mem: %2.2fM Iters: %d ", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters);
printf ("PV: ");
@@ -1415,7 +1414,7 @@
}
};
- printf ("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d MaxDepth: %d\n", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof (node_t) / (float) (1024 * 1024))), iters,maxply);
+ printf ("P: %d D: %d N: %d S: %ld Mem: %2.2fM Iters: %d MaxDepth: %d\n", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof (node_t) / (float) (1024 * 1024))), iters,maxply);
if (xb_mode && post)
printf ("tellics whisper proof %d, disproof %d, %d nodes, %d forwards, %d iters, highest depth %d\n", root->proof, root->disproof, nodecount, forwards, iters, maxply);
@@ -1608,7 +1607,7 @@
}
};
- printf("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d\n", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters);
+ printf("P: %d D: %d N: %d S: %ld Mem: %2.2fM Iters: %d\n", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters);
while(currentnode != root)
{
|
