cgram.c revision 1.16 1 1.16 rillig /* $NetBSD: cgram.c,v 1.16 2021/02/26 15:15:34 rillig Exp $ */
2 1.4 rillig
3 1.1 dholland /*-
4 1.10 rillig * Copyright (c) 2013, 2021 The NetBSD Foundation, Inc.
5 1.1 dholland * All rights reserved.
6 1.1 dholland *
7 1.1 dholland * This code is derived from software contributed to The NetBSD Foundation
8 1.10 rillig * by David A. Holland and Roland Illig.
9 1.1 dholland *
10 1.1 dholland * Redistribution and use in source and binary forms, with or without
11 1.1 dholland * modification, are permitted provided that the following conditions
12 1.1 dholland * are met:
13 1.1 dholland * 1. Redistributions of source code must retain the above copyright
14 1.1 dholland * notice, this list of conditions and the following disclaimer.
15 1.1 dholland * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 dholland * notice, this list of conditions and the following disclaimer in the
17 1.1 dholland * documentation and/or other materials provided with the distribution.
18 1.1 dholland *
19 1.1 dholland * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 dholland * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 dholland * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 dholland * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 dholland * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 dholland * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 dholland * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 dholland * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 dholland * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 dholland * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 dholland * POSSIBILITY OF SUCH DAMAGE.
30 1.1 dholland */
31 1.1 dholland
32 1.10 rillig #include <sys/cdefs.h>
33 1.10 rillig #if defined(__RCSID) && !defined(lint)
34 1.16 rillig __RCSID("$NetBSD: cgram.c,v 1.16 2021/02/26 15:15:34 rillig Exp $");
35 1.10 rillig #endif
36 1.10 rillig
37 1.5 rillig #include <assert.h>
38 1.5 rillig #include <ctype.h>
39 1.5 rillig #include <curses.h>
40 1.5 rillig #include <err.h>
41 1.6 rillig #include <stdbool.h>
42 1.1 dholland #include <stdio.h>
43 1.5 rillig #include <stdlib.h>
44 1.1 dholland #include <string.h>
45 1.1 dholland #include <time.h>
46 1.5 rillig
47 1.1 dholland #include "pathnames.h"
48 1.1 dholland
49 1.1 dholland ////////////////////////////////////////////////////////////
50 1.1 dholland
51 1.8 rillig static char
52 1.8 rillig ch_toupper(char ch)
53 1.8 rillig {
54 1.8 rillig return (char)toupper((unsigned char)ch);
55 1.8 rillig }
56 1.8 rillig
57 1.8 rillig static char
58 1.8 rillig ch_tolower(char ch)
59 1.8 rillig {
60 1.8 rillig return (char)tolower((unsigned char)ch);
61 1.8 rillig }
62 1.8 rillig
63 1.8 rillig static bool
64 1.8 rillig ch_isalpha(char ch)
65 1.8 rillig {
66 1.10 rillig return isalpha((unsigned char)ch) != 0;
67 1.8 rillig }
68 1.8 rillig
69 1.8 rillig static bool
70 1.8 rillig ch_islower(char ch)
71 1.8 rillig {
72 1.10 rillig return islower((unsigned char)ch) != 0;
73 1.8 rillig }
74 1.8 rillig
75 1.8 rillig static bool
76 1.13 rillig ch_isspace(char ch)
77 1.13 rillig {
78 1.13 rillig return isspace((unsigned char)ch) != 0;
79 1.13 rillig }
80 1.13 rillig
81 1.13 rillig static bool
82 1.8 rillig ch_isupper(char ch)
83 1.8 rillig {
84 1.10 rillig return isupper((unsigned char)ch) != 0;
85 1.10 rillig }
86 1.10 rillig
87 1.10 rillig static int
88 1.10 rillig imax(int a, int b)
89 1.10 rillig {
90 1.10 rillig return a > b ? a : b;
91 1.10 rillig }
92 1.10 rillig
93 1.10 rillig static int
94 1.10 rillig imin(int a, int b)
95 1.10 rillig {
96 1.10 rillig return a < b ? a : b;
97 1.8 rillig }
98 1.8 rillig
99 1.1 dholland ////////////////////////////////////////////////////////////
100 1.1 dholland
101 1.10 rillig struct string {
102 1.10 rillig char *s;
103 1.10 rillig size_t len;
104 1.10 rillig size_t cap;
105 1.10 rillig };
106 1.10 rillig
107 1.1 dholland struct stringarray {
108 1.10 rillig struct string *v;
109 1.9 rillig size_t num;
110 1.1 dholland };
111 1.1 dholland
112 1.4 rillig static void
113 1.10 rillig string_init(struct string *s)
114 1.10 rillig {
115 1.10 rillig s->s = NULL;
116 1.10 rillig s->len = 0;
117 1.10 rillig s->cap = 0;
118 1.10 rillig }
119 1.10 rillig
120 1.10 rillig static void
121 1.10 rillig string_add(struct string *s, char ch)
122 1.10 rillig {
123 1.10 rillig if (s->len >= s->cap) {
124 1.10 rillig s->cap = 2 * s->cap + 16;
125 1.10 rillig s->s = realloc(s->s, s->cap);
126 1.10 rillig if (s->s == NULL)
127 1.10 rillig errx(1, "Out of memory");
128 1.10 rillig }
129 1.10 rillig s->s[s->len++] = ch;
130 1.10 rillig }
131 1.10 rillig
132 1.10 rillig static void
133 1.10 rillig string_finish(struct string *s)
134 1.10 rillig {
135 1.10 rillig string_add(s, '\0');
136 1.10 rillig s->len--;
137 1.10 rillig }
138 1.10 rillig
139 1.10 rillig static void
140 1.4 rillig stringarray_init(struct stringarray *a)
141 1.4 rillig {
142 1.4 rillig a->v = NULL;
143 1.4 rillig a->num = 0;
144 1.4 rillig }
145 1.4 rillig
146 1.4 rillig static void
147 1.4 rillig stringarray_cleanup(struct stringarray *a)
148 1.4 rillig {
149 1.10 rillig for (size_t i = 0; i < a->num; i++)
150 1.10 rillig free(a->v[i].s);
151 1.4 rillig free(a->v);
152 1.4 rillig }
153 1.4 rillig
154 1.4 rillig static void
155 1.10 rillig stringarray_add(struct stringarray *a, struct string *s)
156 1.4 rillig {
157 1.10 rillig size_t num = a->num++;
158 1.10 rillig a->v = realloc(a->v, a->num * sizeof a->v[0]);
159 1.10 rillig if (a->v == NULL)
160 1.4 rillig errx(1, "Out of memory");
161 1.10 rillig a->v[num] = *s;
162 1.10 rillig }
163 1.10 rillig
164 1.10 rillig static void
165 1.10 rillig stringarray_dup(struct stringarray *dst, const struct stringarray *src)
166 1.10 rillig {
167 1.10 rillig assert(dst->num == 0);
168 1.10 rillig for (size_t i = 0; i < src->num; i++) {
169 1.10 rillig struct string str;
170 1.10 rillig string_init(&str);
171 1.10 rillig for (const char *p = src->v[i].s; *p != '\0'; p++)
172 1.10 rillig string_add(&str, *p);
173 1.10 rillig string_finish(&str);
174 1.10 rillig stringarray_add(dst, &str);
175 1.4 rillig }
176 1.1 dholland }
177 1.1 dholland
178 1.1 dholland ////////////////////////////////////////////////////////////
179 1.1 dholland
180 1.1 dholland static struct stringarray lines;
181 1.1 dholland static struct stringarray sollines;
182 1.1 dholland static bool hinting;
183 1.10 rillig static int extent_x;
184 1.10 rillig static int extent_y;
185 1.10 rillig static int offset_x;
186 1.10 rillig static int offset_y;
187 1.10 rillig static int cursor_x;
188 1.10 rillig static int cursor_y;
189 1.10 rillig
190 1.10 rillig static int
191 1.10 rillig cur_max_x(void)
192 1.10 rillig {
193 1.10 rillig return (int)lines.v[cursor_y].len;
194 1.10 rillig }
195 1.10 rillig
196 1.10 rillig static int
197 1.10 rillig cur_max_y(void)
198 1.10 rillig {
199 1.10 rillig return extent_y - 1;
200 1.10 rillig }
201 1.1 dholland
202 1.13 rillig static char
203 1.13 rillig char_left_of_cursor(void)
204 1.13 rillig {
205 1.13 rillig if (cursor_x > 0)
206 1.13 rillig return lines.v[cursor_y].s[cursor_x - 1];
207 1.13 rillig assert(cursor_y > 0);
208 1.13 rillig return '\n'; /* eol of previous line */
209 1.13 rillig }
210 1.13 rillig
211 1.13 rillig static char
212 1.13 rillig char_at_cursor(void)
213 1.13 rillig {
214 1.13 rillig if (cursor_x == cur_max_x())
215 1.13 rillig return '\n';
216 1.13 rillig return lines.v[cursor_y].s[cursor_x];
217 1.13 rillig }
218 1.13 rillig
219 1.4 rillig static void
220 1.4 rillig readquote(void)
221 1.4 rillig {
222 1.4 rillig FILE *f = popen(_PATH_FORTUNE, "r");
223 1.10 rillig if (f == NULL)
224 1.4 rillig err(1, "%s", _PATH_FORTUNE);
225 1.10 rillig
226 1.10 rillig struct string line;
227 1.10 rillig string_init(&line);
228 1.10 rillig
229 1.10 rillig int ch;
230 1.10 rillig while ((ch = fgetc(f)) != EOF) {
231 1.10 rillig if (ch == '\n') {
232 1.10 rillig string_finish(&line);
233 1.10 rillig stringarray_add(&lines, &line);
234 1.10 rillig string_init(&line);
235 1.10 rillig } else if (ch == '\t') {
236 1.10 rillig string_add(&line, ' ');
237 1.10 rillig while (line.len % 8 != 0)
238 1.10 rillig string_add(&line, ' ');
239 1.10 rillig } else if (ch == '\b') {
240 1.10 rillig if (line.len > 0)
241 1.10 rillig line.len--;
242 1.10 rillig } else {
243 1.10 rillig string_add(&line, (char)ch);
244 1.10 rillig }
245 1.4 rillig }
246 1.4 rillig
247 1.10 rillig stringarray_dup(&sollines, &lines);
248 1.4 rillig
249 1.10 rillig extent_y = (int)lines.num;
250 1.10 rillig for (int i = 0; i < extent_y; i++)
251 1.10 rillig extent_x = imax(extent_x, (int)lines.v[i].len);
252 1.4 rillig
253 1.12 rillig if (pclose(f) != 0)
254 1.12 rillig exit(1); /* error message must come from child process */
255 1.4 rillig }
256 1.4 rillig
257 1.4 rillig static void
258 1.4 rillig encode(void)
259 1.4 rillig {
260 1.4 rillig int key[26];
261 1.9 rillig
262 1.4 rillig for (int i = 0; i < 26; i++)
263 1.4 rillig key[i] = i;
264 1.9 rillig
265 1.4 rillig for (int i = 26; i > 1; i--) {
266 1.9 rillig int c = (int)(random() % i);
267 1.4 rillig int t = key[i - 1];
268 1.4 rillig key[i - 1] = key[c];
269 1.4 rillig key[c] = t;
270 1.4 rillig }
271 1.4 rillig
272 1.10 rillig for (int y = 0; y < extent_y; y++) {
273 1.10 rillig for (char *p = lines.v[y].s; *p != '\0'; p++) {
274 1.9 rillig if (ch_islower(*p))
275 1.9 rillig *p = (char)('a' + key[*p - 'a']);
276 1.9 rillig if (ch_isupper(*p))
277 1.9 rillig *p = (char)('A' + key[*p - 'A']);
278 1.4 rillig }
279 1.4 rillig }
280 1.4 rillig }
281 1.4 rillig
282 1.14 rillig static void
283 1.14 rillig substitute(char a, char b)
284 1.4 rillig {
285 1.14 rillig char la = ch_tolower(a);
286 1.14 rillig char ua = ch_toupper(a);
287 1.14 rillig char lb = ch_tolower(b);
288 1.14 rillig char ub = ch_toupper(b);
289 1.4 rillig
290 1.9 rillig for (int y = 0; y < (int)lines.num; y++) {
291 1.10 rillig for (char *p = lines.v[y].s; *p != '\0'; p++) {
292 1.14 rillig if (*p == la)
293 1.14 rillig *p = lb;
294 1.14 rillig else if (*p == ua)
295 1.14 rillig *p = ub;
296 1.14 rillig else if (*p == lb)
297 1.14 rillig *p = la;
298 1.14 rillig else if (*p == ub)
299 1.14 rillig *p = ua;
300 1.4 rillig }
301 1.4 rillig }
302 1.1 dholland }
303 1.1 dholland
304 1.10 rillig static bool
305 1.10 rillig is_solved(void)
306 1.10 rillig {
307 1.10 rillig for (size_t i = 0; i < lines.num; i++)
308 1.10 rillig if (strcmp(lines.v[i].s, sollines.v[i].s) != 0)
309 1.10 rillig return false;
310 1.10 rillig return true;
311 1.10 rillig }
312 1.10 rillig
313 1.13 rillig ////////////////////////////////////////////////////////////
314 1.13 rillig
315 1.4 rillig static void
316 1.4 rillig redraw(void)
317 1.4 rillig {
318 1.4 rillig erase();
319 1.10 rillig
320 1.10 rillig int max_y = imin(LINES - 1, extent_y - offset_y);
321 1.10 rillig for (int y = 0; y < max_y; y++) {
322 1.10 rillig move(y, 0);
323 1.10 rillig
324 1.10 rillig int len = (int)lines.v[offset_y + y].len;
325 1.10 rillig int max_x = imin(COLS - 1, len - offset_x);
326 1.10 rillig const char *line = lines.v[offset_y + y].s;
327 1.10 rillig const char *solline = sollines.v[offset_y + y].s;
328 1.10 rillig
329 1.10 rillig for (int x = 0; x < max_x; x++) {
330 1.10 rillig char ch = line[offset_x + x];
331 1.10 rillig bool bold = hinting &&
332 1.10 rillig ch == solline[offset_x + x] &&
333 1.10 rillig ch_isalpha(ch);
334 1.10 rillig
335 1.10 rillig if (bold)
336 1.10 rillig attron(A_BOLD);
337 1.10 rillig addch(ch);
338 1.10 rillig if (bold)
339 1.10 rillig attroff(A_BOLD);
340 1.4 rillig }
341 1.4 rillig clrtoeol();
342 1.4 rillig }
343 1.4 rillig
344 1.4 rillig move(LINES - 1, 0);
345 1.16 rillig addstr("~ to quit, * to cheat, ^pnfb to move");
346 1.16 rillig
347 1.15 rillig if (is_solved()) {
348 1.16 rillig if (extent_y + 1 - offset_y < LINES - 2)
349 1.16 rillig move(extent_y + 1 - offset_y, 0);
350 1.16 rillig else
351 1.16 rillig addch(' ');
352 1.15 rillig attron(A_BOLD | A_STANDOUT);
353 1.15 rillig addstr("*solved*");
354 1.15 rillig attroff(A_BOLD | A_STANDOUT);
355 1.15 rillig }
356 1.4 rillig
357 1.10 rillig move(cursor_y - offset_y, cursor_x - offset_x);
358 1.4 rillig
359 1.4 rillig refresh();
360 1.4 rillig }
361 1.4 rillig
362 1.1 dholland ////////////////////////////////////////////////////////////
363 1.1 dholland
364 1.4 rillig static void
365 1.10 rillig saturate_cursor(void)
366 1.10 rillig {
367 1.11 rillig cursor_y = imax(cursor_y, 0);
368 1.11 rillig cursor_y = imin(cursor_y, cur_max_y());
369 1.10 rillig
370 1.10 rillig assert(cursor_x >= 0);
371 1.10 rillig cursor_x = imin(cursor_x, cur_max_x());
372 1.10 rillig }
373 1.10 rillig
374 1.10 rillig static void
375 1.10 rillig scroll_into_view(void)
376 1.10 rillig {
377 1.10 rillig if (cursor_x < offset_x)
378 1.10 rillig offset_x = cursor_x;
379 1.10 rillig if (cursor_x > offset_x + COLS - 1)
380 1.10 rillig offset_x = cursor_x - (COLS - 1);
381 1.10 rillig
382 1.10 rillig if (cursor_y < offset_y)
383 1.10 rillig offset_y = cursor_y;
384 1.10 rillig if (cursor_y > offset_y + LINES - 2)
385 1.10 rillig offset_y = cursor_y - (LINES - 2);
386 1.10 rillig }
387 1.10 rillig
388 1.13 rillig static bool
389 1.13 rillig can_go_left(void)
390 1.13 rillig {
391 1.13 rillig return cursor_y > 0 ||
392 1.13 rillig (cursor_y == 0 && cursor_x > 0);
393 1.13 rillig }
394 1.13 rillig
395 1.13 rillig static bool
396 1.13 rillig can_go_right(void)
397 1.13 rillig {
398 1.13 rillig return cursor_y < cur_max_y() ||
399 1.13 rillig (cursor_y == cur_max_y() && cursor_x < cur_max_x());
400 1.13 rillig }
401 1.13 rillig
402 1.13 rillig static void
403 1.13 rillig go_to_prev_line(void)
404 1.13 rillig {
405 1.13 rillig cursor_y--;
406 1.13 rillig cursor_x = cur_max_x();
407 1.13 rillig }
408 1.13 rillig
409 1.13 rillig static void
410 1.13 rillig go_to_next_line(void)
411 1.13 rillig {
412 1.13 rillig cursor_x = 0;
413 1.13 rillig cursor_y++;
414 1.13 rillig }
415 1.13 rillig
416 1.13 rillig static void
417 1.13 rillig go_left(void)
418 1.13 rillig {
419 1.13 rillig if (cursor_x > 0)
420 1.13 rillig cursor_x--;
421 1.13 rillig else if (cursor_y > 0)
422 1.13 rillig go_to_prev_line();
423 1.13 rillig }
424 1.13 rillig
425 1.13 rillig static void
426 1.13 rillig go_right(void)
427 1.13 rillig {
428 1.13 rillig if (cursor_x < cur_max_x())
429 1.13 rillig cursor_x++;
430 1.13 rillig else if (cursor_y < cur_max_y())
431 1.13 rillig go_to_next_line();
432 1.13 rillig }
433 1.13 rillig
434 1.13 rillig static void
435 1.13 rillig go_to_prev_word(void)
436 1.13 rillig {
437 1.13 rillig while (can_go_left() && ch_isspace(char_left_of_cursor()))
438 1.13 rillig go_left();
439 1.13 rillig
440 1.13 rillig while (can_go_left() && !ch_isspace(char_left_of_cursor()))
441 1.13 rillig go_left();
442 1.13 rillig }
443 1.13 rillig
444 1.13 rillig static void
445 1.13 rillig go_to_next_word(void)
446 1.13 rillig {
447 1.13 rillig while (can_go_right() && !ch_isspace(char_at_cursor()))
448 1.13 rillig go_right();
449 1.13 rillig
450 1.13 rillig while (can_go_right() && ch_isspace(char_at_cursor()))
451 1.13 rillig go_right();
452 1.13 rillig }
453 1.13 rillig
454 1.14 rillig static bool
455 1.14 rillig can_substitute_here(int ch)
456 1.14 rillig {
457 1.14 rillig return isascii(ch) &&
458 1.14 rillig ch_isalpha((char)ch) &&
459 1.14 rillig cursor_x < cur_max_x() &&
460 1.14 rillig ch_isalpha(char_at_cursor());
461 1.14 rillig }
462 1.14 rillig
463 1.10 rillig static void
464 1.10 rillig handle_char_input(int ch)
465 1.4 rillig {
466 1.14 rillig if (ch == char_at_cursor())
467 1.14 rillig go_right();
468 1.14 rillig else if (can_substitute_here(ch)) {
469 1.14 rillig substitute(char_at_cursor(), (char)ch);
470 1.13 rillig go_right();
471 1.14 rillig } else
472 1.10 rillig beep();
473 1.1 dholland }
474 1.1 dholland
475 1.10 rillig static bool
476 1.10 rillig handle_key(void)
477 1.10 rillig {
478 1.10 rillig int ch = getch();
479 1.10 rillig
480 1.10 rillig switch (ch) {
481 1.10 rillig case 1: /* ^A */
482 1.10 rillig case KEY_HOME:
483 1.10 rillig cursor_x = 0;
484 1.10 rillig break;
485 1.10 rillig case 2: /* ^B */
486 1.10 rillig case KEY_LEFT:
487 1.13 rillig go_left();
488 1.10 rillig break;
489 1.10 rillig case 5: /* ^E */
490 1.10 rillig case KEY_END:
491 1.10 rillig cursor_x = cur_max_x();
492 1.10 rillig break;
493 1.10 rillig case 6: /* ^F */
494 1.10 rillig case KEY_RIGHT:
495 1.13 rillig go_right();
496 1.13 rillig break;
497 1.13 rillig case '\t':
498 1.13 rillig go_to_next_word();
499 1.13 rillig break;
500 1.13 rillig case KEY_BTAB:
501 1.13 rillig go_to_prev_word();
502 1.13 rillig break;
503 1.13 rillig case '\n':
504 1.13 rillig go_to_next_line();
505 1.10 rillig break;
506 1.10 rillig case 12: /* ^L */
507 1.10 rillig clear();
508 1.10 rillig break;
509 1.10 rillig case 14: /* ^N */
510 1.10 rillig case KEY_DOWN:
511 1.11 rillig cursor_y++;
512 1.10 rillig break;
513 1.10 rillig case 16: /* ^P */
514 1.10 rillig case KEY_UP:
515 1.11 rillig cursor_y--;
516 1.11 rillig break;
517 1.11 rillig case KEY_PPAGE:
518 1.11 rillig cursor_y -= LINES - 2;
519 1.11 rillig break;
520 1.11 rillig case KEY_NPAGE:
521 1.11 rillig cursor_y += LINES - 2;
522 1.10 rillig break;
523 1.10 rillig case '*':
524 1.10 rillig hinting = !hinting;
525 1.10 rillig break;
526 1.10 rillig case '~':
527 1.10 rillig return false;
528 1.10 rillig default:
529 1.10 rillig handle_char_input(ch);
530 1.10 rillig break;
531 1.10 rillig }
532 1.10 rillig return true;
533 1.10 rillig }
534 1.1 dholland
535 1.10 rillig static void
536 1.10 rillig init(void)
537 1.4 rillig {
538 1.4 rillig stringarray_init(&lines);
539 1.4 rillig stringarray_init(&sollines);
540 1.9 rillig srandom((unsigned int)time(NULL));
541 1.4 rillig readquote();
542 1.4 rillig encode();
543 1.13 rillig
544 1.13 rillig initscr();
545 1.13 rillig cbreak();
546 1.13 rillig noecho();
547 1.13 rillig keypad(stdscr, true);
548 1.10 rillig }
549 1.4 rillig
550 1.10 rillig static void
551 1.10 rillig loop(void)
552 1.10 rillig {
553 1.10 rillig for (;;) {
554 1.10 rillig redraw();
555 1.10 rillig if (!handle_key())
556 1.10 rillig break;
557 1.10 rillig saturate_cursor();
558 1.10 rillig scroll_into_view();
559 1.10 rillig }
560 1.10 rillig }
561 1.4 rillig
562 1.10 rillig static void
563 1.10 rillig clean_up(void)
564 1.10 rillig {
565 1.13 rillig endwin();
566 1.13 rillig
567 1.4 rillig stringarray_cleanup(&sollines);
568 1.4 rillig stringarray_cleanup(&lines);
569 1.1 dholland }
570 1.10 rillig
571 1.10 rillig ////////////////////////////////////////////////////////////
572 1.10 rillig
573 1.10 rillig int
574 1.10 rillig main(void)
575 1.10 rillig {
576 1.10 rillig init();
577 1.10 rillig loop();
578 1.10 rillig clean_up();
579 1.10 rillig }
580