Debian Codegraph @

doc/SystemTap_Beginners_Guide/testsuite/systemtap.base/towers.c

raw
1 # include <stdio.h>
2 # include <stdlib.h>
3
4 #define towersbase 2.39
5
6 /* Towers */
7 #define maxcells 18
8 #define stackrange 3
9 #define true 1
10 #define false 0
11
12 struct element
13 {
14 int discsize;
15 int next;
16 };
17
18 /* Towers */
19 int stack[stackrange + 1];
20 struct element cellspace[maxcells + 1];
21 int freelist, movesdone;
22
23 /* Program to Solve the Towers of Hanoi */
24
25 void
26 error (char *emsg)
27 {
28 printf ("Error in Towers: %s\n", emsg);
29 }
30
31 void
32 makenull (int s)
33 {
34 stack[s] = 0;
35 }
36
37 int
38 get_element ()
39 {
40 int temp;
41 if (freelist > 0)
42 {
43 temp = freelist;
44 freelist = cellspace[freelist].next;
45 }
46 else
47 error ("out of space ");
48 return (temp);
49 }
50
51 void
52 push (int i, int s)
53 {
54 int errorfound, localel;
55 errorfound = false;
56 if (stack[s] > 0)
57 if (cellspace[stack[s]].discsize <= i)
58 {
59 errorfound = true;
60 error ("disc size error");
61 };
62 if (!errorfound)
63 {
64 localel = get_element ();
65 cellspace[localel].next = stack[s];
66 stack[s] = localel;
67 cellspace[localel].discsize = i;
68 }
69 }
70
71 void
72 init (int s, int n)
73 {
74 int discctr;
75 makenull (s);
76 for (discctr = n; discctr >= 1; discctr--)
77 push (discctr, s);
78 }
79
80 int
81 pop (int s)
82 {
83 int temp, temp1;
84 if (stack[s] > 0)
85 {
86 temp1 = cellspace[stack[s]].discsize;
87 temp = cellspace[stack[s]].next;
88 cellspace[stack[s]].next = freelist;
89 freelist = stack[s];
90 stack[s] = temp;
91 return (temp1);
92 }
93 else
94 error ("nothing to pop ");
95 return 0;
96 }
97
98 void
99 move (int s1, int s2)
100 {
101 push (pop (s1), s2);
102 movesdone = movesdone + 1;
103 }
104
105 void
106 tower (int i, int j, int k)
107 {
108 int other;
109 if (k == 1)
110 move (i, j);
111 else
112 {
113 other = 6 - i - j;
114 tower (i, other, k - 1);
115 move (i, j);
116 tower (other, j, k - 1);
117 }
118 }
119
120
121 void
122 towers ()
123 {
124 int i;
125 for (i = 1; i <= maxcells; i++)
126 cellspace[i].next = i - 1;
127 freelist = maxcells;
128 init (1, 14);
129 makenull (2);
130 makenull (3);
131 movesdone = 0;
132 tower (1, 2, 14);
133 if (movesdone != 16383)
134 printf (" error in Towers.\n");
135 }
136
137 #ifndef LOOP
138 #define LOOP 500
139 #endif
140
141 int
142 main ()
143 {
144 int i;
145 for (i= 0; i < LOOP; i++)
146 towers();
147 return 0;
148 }
149