blob: 1e6091322afcae7cd94bb3800f8100130170d68c (
plain)
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
/* For copyright information, see olden_v1.0/COPYRIGHT */
/* node.c
*/
#include <stdio.h>
#ifdef SS_PLAIN
#include "ssplain.h"
#endif SS_PLAIN
#include "tree.h"
int dealwithargs(int argc, char *argv[]);
typedef struct {
long level;
} startmsg_t;
int TreeAdd (/* tree_t *t */);
extern tree_t *TreeAlloc (/* int level */);
main (int argc, char *argv[])
{
tree_t *root;
int i, result = 0;
filestuff();
(void)dealwithargs(argc, argv);
chatting("Treeadd with %d levels\n", level);
chatting("About to enter TreeAlloc\n");
root = TreeAlloc (level);
chatting("About to enter TreeAdd\n");
for (i = 0; i < iters; i++)
{
fprintf(stderr, "Iteration %d...", i);
result = TreeAdd (root);
fprintf(stderr, "done\n");
}
chatting("Received result of %d\n",result);
exit(0);
}
/* TreeAdd:
*/
int TreeAdd (t)
register tree_t *t;
{
if (t == NULL)
{
return 0;
}
else
{
int leftval;
int rightval;
tree_t *tleft, *tright;
int value;
tleft = t->left;
leftval = TreeAdd(tleft);
tright = t->right;
rightval = TreeAdd(tright);
value = t->val;
return leftval + rightval + value;
}
} /* end of TreeAdd */
|
