cgram.c revision 1.19 1 1.19 rillig /* $NetBSD: cgram.c,v 1.19 2021/04/25 20:14:29 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.19 rillig __RCSID("$NetBSD: cgram.c,v 1.19 2021/04/25 20:14:29 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.19 rillig static void
220 1.19 rillig getquote(FILE *f)
221 1.19 rillig {
222 1.10 rillig struct string line;
223 1.10 rillig string_init(&line);
224 1.10 rillig
225 1.10 rillig int ch;
226 1.10 rillig while ((ch = fgetc(f)) != EOF) {
227 1.10 rillig if (ch == '\n') {
228 1.10 rillig string_finish(&line);
229 1.10 rillig stringarray_add(&lines, &line);
230 1.10 rillig string_init(&line);
231 1.10 rillig } else if (ch == '\t') {
232 1.10 rillig string_add(&line, ' ');
233 1.10 rillig while (line.len % 8 != 0)
234 1.10 rillig string_add(&line, ' ');
235 1.10 rillig } else if (ch == '\b') {
236 1.10 rillig if (line.len > 0)
237 1.10 rillig line.len--;
238 1.10 rillig } else {
239 1.10 rillig string_add(&line, (char)ch);
240 1.10 rillig }
241 1.4 rillig }
242 1.4 rillig
243 1.10 rillig stringarray_dup(&sollines, &lines);
244 1.4 rillig
245 1.10 rillig extent_y = (int)lines.num;
246 1.10 rillig for (int i = 0; i < extent_y; i++)
247 1.10 rillig extent_x = imax(extent_x, (int)lines.v[i].len);
248 1.18 wiz }
249 1.18 wiz
250 1.18 wiz static void
251 1.18 wiz readfile(const char *name)
252 1.18 wiz {
253 1.18 wiz FILE *f = fopen(name, "r");
254 1.18 wiz if (f == NULL)
255 1.18 wiz err(1, "%s", name);
256 1.18 wiz
257 1.18 wiz getquote(f);
258 1.18 wiz
259 1.18 wiz if (fclose(f) != 0)
260 1.19 rillig err(1, "%s", name);
261 1.18 wiz }
262 1.18 wiz
263 1.18 wiz
264 1.18 wiz static void
265 1.18 wiz readquote(void)
266 1.18 wiz {
267 1.18 wiz FILE *f = popen(_PATH_FORTUNE, "r");
268 1.18 wiz if (f == NULL)
269 1.18 wiz err(1, "%s", _PATH_FORTUNE);
270 1.18 wiz
271 1.18 wiz getquote(f);
272 1.4 rillig
273 1.12 rillig if (pclose(f) != 0)
274 1.12 rillig exit(1); /* error message must come from child process */
275 1.4 rillig }
276 1.4 rillig
277 1.4 rillig static void
278 1.4 rillig encode(void)
279 1.4 rillig {
280 1.4 rillig int key[26];
281 1.9 rillig
282 1.4 rillig for (int i = 0; i < 26; i++)
283 1.4 rillig key[i] = i;
284 1.9 rillig
285 1.4 rillig for (int i = 26; i > 1; i--) {
286 1.9 rillig int c = (int)(random() % i);
287 1.4 rillig int t = key[i - 1];
288 1.4 rillig key[i - 1] = key[c];
289 1.4 rillig key[c] = t;
290 1.4 rillig }
291 1.4 rillig
292 1.10 rillig for (int y = 0; y < extent_y; y++) {
293 1.10 rillig for (char *p = lines.v[y].s; *p != '\0'; p++) {
294 1.9 rillig if (ch_islower(*p))
295 1.9 rillig *p = (char)('a' + key[*p - 'a']);
296 1.9 rillig if (ch_isupper(*p))
297 1.9 rillig *p = (char)('A' + key[*p - 'A']);
298 1.4 rillig }
299 1.4 rillig }
300 1.4 rillig }
301 1.4 rillig
302 1.14 rillig static void
303 1.14 rillig substitute(char a, char b)
304 1.4 rillig {
305 1.14 rillig char la = ch_tolower(a);
306 1.14 rillig char ua = ch_toupper(a);
307 1.14 rillig char lb = ch_tolower(b);
308 1.14 rillig char ub = ch_toupper(b);
309 1.4 rillig
310 1.9 rillig for (int y = 0; y < (int)lines.num; y++) {
311 1.10 rillig for (char *p = lines.v[y].s; *p != '\0'; p++) {
312 1.14 rillig if (*p == la)
313 1.14 rillig *p = lb;
314 1.14 rillig else if (*p == ua)
315 1.14 rillig *p = ub;
316 1.14 rillig else if (*p == lb)
317 1.14 rillig *p = la;
318 1.14 rillig else if (*p == ub)
319 1.14 rillig *p = ua;
320 1.4 rillig }
321 1.4 rillig }
322 1.1 dholland }
323 1.1 dholland
324 1.10 rillig static bool
325 1.10 rillig is_solved(void)
326 1.10 rillig {
327 1.10 rillig for (size_t i = 0; i < lines.num; i++)
328 1.10 rillig if (strcmp(lines.v[i].s, sollines.v[i].s) != 0)
329 1.10 rillig return false;
330 1.10 rillig return true;
331 1.10 rillig }
332 1.10 rillig
333 1.13 rillig ////////////////////////////////////////////////////////////
334 1.13 rillig
335 1.4 rillig static void
336 1.4 rillig redraw(void)
337 1.4 rillig {
338 1.4 rillig erase();
339 1.10 rillig
340 1.10 rillig int max_y = imin(LINES - 1, extent_y - offset_y);
341 1.10 rillig for (int y = 0; y < max_y; y++) {
342 1.10 rillig move(y, 0);
343 1.10 rillig
344 1.10 rillig int len = (int)lines.v[offset_y + y].len;
345 1.10 rillig int max_x = imin(COLS - 1, len - offset_x);
346 1.10 rillig const char *line = lines.v[offset_y + y].s;
347 1.10 rillig const char *solline = sollines.v[offset_y + y].s;
348 1.10 rillig
349 1.10 rillig for (int x = 0; x < max_x; x++) {
350 1.10 rillig char ch = line[offset_x + x];
351 1.10 rillig bool bold = hinting &&
352 1.10 rillig ch == solline[offset_x + x] &&
353 1.10 rillig ch_isalpha(ch);
354 1.10 rillig
355 1.10 rillig if (bold)
356 1.10 rillig attron(A_BOLD);
357 1.10 rillig addch(ch);
358 1.10 rillig if (bold)
359 1.10 rillig attroff(A_BOLD);
360 1.4 rillig }
361 1.4 rillig clrtoeol();
362 1.4 rillig }
363 1.4 rillig
364 1.4 rillig move(LINES - 1, 0);
365 1.16 rillig addstr("~ to quit, * to cheat, ^pnfb to move");
366 1.16 rillig
367 1.15 rillig if (is_solved()) {
368 1.16 rillig if (extent_y + 1 - offset_y < LINES - 2)
369 1.16 rillig move(extent_y + 1 - offset_y, 0);
370 1.16 rillig else
371 1.16 rillig addch(' ');
372 1.15 rillig attron(A_BOLD | A_STANDOUT);
373 1.15 rillig addstr("*solved*");
374 1.15 rillig attroff(A_BOLD | A_STANDOUT);
375 1.15 rillig }
376 1.4 rillig
377 1.10 rillig move(cursor_y - offset_y, cursor_x - offset_x);
378 1.4 rillig
379 1.4 rillig refresh();
380 1.4 rillig }
381 1.4 rillig
382 1.1 dholland ////////////////////////////////////////////////////////////
383 1.1 dholland
384 1.4 rillig static void
385 1.10 rillig saturate_cursor(void)
386 1.10 rillig {
387 1.11 rillig cursor_y = imax(cursor_y, 0);
388 1.11 rillig cursor_y = imin(cursor_y, cur_max_y());
389 1.10 rillig
390 1.10 rillig assert(cursor_x >= 0);
391 1.10 rillig cursor_x = imin(cursor_x, cur_max_x());
392 1.10 rillig }
393 1.10 rillig
394 1.10 rillig static void
395 1.10 rillig scroll_into_view(void)
396 1.10 rillig {
397 1.10 rillig if (cursor_x < offset_x)
398 1.10 rillig offset_x = cursor_x;
399 1.10 rillig if (cursor_x > offset_x + COLS - 1)
400 1.10 rillig offset_x = cursor_x - (COLS - 1);
401 1.10 rillig
402 1.10 rillig if (cursor_y < offset_y)
403 1.10 rillig offset_y = cursor_y;
404 1.10 rillig if (cursor_y > offset_y + LINES - 2)
405 1.10 rillig offset_y = cursor_y - (LINES - 2);
406 1.10 rillig }
407 1.10 rillig
408 1.13 rillig static bool
409 1.13 rillig can_go_left(void)
410 1.13 rillig {
411 1.13 rillig return cursor_y > 0 ||
412 1.13 rillig (cursor_y == 0 && cursor_x > 0);
413 1.13 rillig }
414 1.13 rillig
415 1.13 rillig static bool
416 1.13 rillig can_go_right(void)
417 1.13 rillig {
418 1.13 rillig return cursor_y < cur_max_y() ||
419 1.13 rillig (cursor_y == cur_max_y() && cursor_x < cur_max_x());
420 1.13 rillig }
421 1.13 rillig
422 1.13 rillig static void
423 1.13 rillig go_to_prev_line(void)
424 1.13 rillig {
425 1.13 rillig cursor_y--;
426 1.13 rillig cursor_x = cur_max_x();
427 1.13 rillig }
428 1.13 rillig
429 1.13 rillig static void
430 1.13 rillig go_to_next_line(void)
431 1.13 rillig {
432 1.13 rillig cursor_x = 0;
433 1.13 rillig cursor_y++;
434 1.13 rillig }
435 1.13 rillig
436 1.13 rillig static void
437 1.13 rillig go_left(void)
438 1.13 rillig {
439 1.13 rillig if (cursor_x > 0)
440 1.13 rillig cursor_x--;
441 1.13 rillig else if (cursor_y > 0)
442 1.13 rillig go_to_prev_line();
443 1.13 rillig }
444 1.13 rillig
445 1.13 rillig static void
446 1.13 rillig go_right(void)
447 1.13 rillig {
448 1.13 rillig if (cursor_x < cur_max_x())
449 1.13 rillig cursor_x++;
450 1.13 rillig else if (cursor_y < cur_max_y())
451 1.13 rillig go_to_next_line();
452 1.13 rillig }
453 1.13 rillig
454 1.13 rillig static void
455 1.13 rillig go_to_prev_word(void)
456 1.13 rillig {
457 1.13 rillig while (can_go_left() && ch_isspace(char_left_of_cursor()))
458 1.13 rillig go_left();
459 1.13 rillig
460 1.13 rillig while (can_go_left() && !ch_isspace(char_left_of_cursor()))
461 1.13 rillig go_left();
462 1.13 rillig }
463 1.13 rillig
464 1.13 rillig static void
465 1.13 rillig go_to_next_word(void)
466 1.13 rillig {
467 1.13 rillig while (can_go_right() && !ch_isspace(char_at_cursor()))
468 1.13 rillig go_right();
469 1.13 rillig
470 1.13 rillig while (can_go_right() && ch_isspace(char_at_cursor()))
471 1.13 rillig go_right();
472 1.13 rillig }
473 1.13 rillig
474 1.14 rillig static bool
475 1.14 rillig can_substitute_here(int ch)
476 1.14 rillig {
477 1.14 rillig return isascii(ch) &&
478 1.14 rillig ch_isalpha((char)ch) &&
479 1.14 rillig cursor_x < cur_max_x() &&
480 1.14 rillig ch_isalpha(char_at_cursor());
481 1.14 rillig }
482 1.14 rillig
483 1.10 rillig static void
484 1.10 rillig handle_char_input(int ch)
485 1.4 rillig {
486 1.14 rillig if (ch == char_at_cursor())
487 1.14 rillig go_right();
488 1.14 rillig else if (can_substitute_here(ch)) {
489 1.14 rillig substitute(char_at_cursor(), (char)ch);
490 1.13 rillig go_right();
491 1.14 rillig } else
492 1.10 rillig beep();
493 1.1 dholland }
494 1.1 dholland
495 1.10 rillig static bool
496 1.10 rillig handle_key(void)
497 1.10 rillig {
498 1.10 rillig int ch = getch();
499 1.10 rillig
500 1.10 rillig switch (ch) {
501 1.10 rillig case 1: /* ^A */
502 1.10 rillig case KEY_HOME:
503 1.10 rillig cursor_x = 0;
504 1.10 rillig break;
505 1.10 rillig case 2: /* ^B */
506 1.10 rillig case KEY_LEFT:
507 1.13 rillig go_left();
508 1.10 rillig break;
509 1.10 rillig case 5: /* ^E */
510 1.10 rillig case KEY_END:
511 1.10 rillig cursor_x = cur_max_x();
512 1.10 rillig break;
513 1.10 rillig case 6: /* ^F */
514 1.10 rillig case KEY_RIGHT:
515 1.13 rillig go_right();
516 1.13 rillig break;
517 1.13 rillig case '\t':
518 1.13 rillig go_to_next_word();
519 1.13 rillig break;
520 1.13 rillig case KEY_BTAB:
521 1.13 rillig go_to_prev_word();
522 1.13 rillig break;
523 1.13 rillig case '\n':
524 1.13 rillig go_to_next_line();
525 1.10 rillig break;
526 1.10 rillig case 12: /* ^L */
527 1.10 rillig clear();
528 1.10 rillig break;
529 1.10 rillig case 14: /* ^N */
530 1.10 rillig case KEY_DOWN:
531 1.11 rillig cursor_y++;
532 1.10 rillig break;
533 1.10 rillig case 16: /* ^P */
534 1.10 rillig case KEY_UP:
535 1.11 rillig cursor_y--;
536 1.11 rillig break;
537 1.11 rillig case KEY_PPAGE:
538 1.11 rillig cursor_y -= LINES - 2;
539 1.11 rillig break;
540 1.11 rillig case KEY_NPAGE:
541 1.11 rillig cursor_y += LINES - 2;
542 1.10 rillig break;
543 1.10 rillig case '*':
544 1.10 rillig hinting = !hinting;
545 1.10 rillig break;
546 1.10 rillig case '~':
547 1.10 rillig return false;
548 1.17 rillig case KEY_RESIZE:
549 1.17 rillig break;
550 1.10 rillig default:
551 1.10 rillig handle_char_input(ch);
552 1.10 rillig break;
553 1.10 rillig }
554 1.10 rillig return true;
555 1.10 rillig }
556 1.1 dholland
557 1.10 rillig static void
558 1.18 wiz init(const char *filename)
559 1.4 rillig {
560 1.4 rillig stringarray_init(&lines);
561 1.4 rillig stringarray_init(&sollines);
562 1.9 rillig srandom((unsigned int)time(NULL));
563 1.19 rillig if (filename != NULL) {
564 1.18 wiz readfile(filename);
565 1.18 wiz } else {
566 1.18 wiz readquote();
567 1.18 wiz }
568 1.4 rillig encode();
569 1.13 rillig
570 1.13 rillig initscr();
571 1.13 rillig cbreak();
572 1.13 rillig noecho();
573 1.13 rillig keypad(stdscr, true);
574 1.10 rillig }
575 1.4 rillig
576 1.10 rillig static void
577 1.10 rillig loop(void)
578 1.10 rillig {
579 1.10 rillig for (;;) {
580 1.10 rillig redraw();
581 1.10 rillig if (!handle_key())
582 1.10 rillig break;
583 1.10 rillig saturate_cursor();
584 1.10 rillig scroll_into_view();
585 1.10 rillig }
586 1.10 rillig }
587 1.4 rillig
588 1.10 rillig static void
589 1.10 rillig clean_up(void)
590 1.10 rillig {
591 1.13 rillig endwin();
592 1.13 rillig
593 1.4 rillig stringarray_cleanup(&sollines);
594 1.4 rillig stringarray_cleanup(&lines);
595 1.1 dholland }
596 1.10 rillig
597 1.10 rillig ////////////////////////////////////////////////////////////
598 1.10 rillig
599 1.10 rillig int
600 1.18 wiz main(int argc, char *argv[])
601 1.10 rillig {
602 1.18 wiz init(argc > 1 ? argv[1] : NULL);
603 1.10 rillig loop();
604 1.10 rillig clean_up();
605 1.10 rillig }
606