1 1.30 rillig /* $NetBSD: cgram.c,v 1.30 2023/05/10 12:30:27 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.25 dholland * by 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.30 rillig __RCSID("$NetBSD: cgram.c,v 1.30 2023/05/10 12:30:27 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.21 rillig static bool 51 1.21 rillig ch_islower(char ch) 52 1.8 rillig { 53 1.21 rillig return ch >= 'a' && ch <= 'z'; 54 1.8 rillig } 55 1.8 rillig 56 1.8 rillig static bool 57 1.21 rillig ch_isupper(char ch) 58 1.8 rillig { 59 1.21 rillig return ch >= 'A' && ch <= 'Z'; 60 1.8 rillig } 61 1.8 rillig 62 1.8 rillig static bool 63 1.21 rillig ch_isalpha(char ch) 64 1.8 rillig { 65 1.21 rillig return ch_islower(ch) || ch_isupper(ch); 66 1.8 rillig } 67 1.8 rillig 68 1.21 rillig static char 69 1.21 rillig ch_toupper(char ch) 70 1.13 rillig { 71 1.21 rillig return ch_islower(ch) ? (char)(ch - 'a' + 'A') : ch; 72 1.13 rillig } 73 1.13 rillig 74 1.21 rillig static char 75 1.21 rillig ch_tolower(char ch) 76 1.8 rillig { 77 1.21 rillig return ch_isupper(ch) ? (char)(ch - 'A' + 'a') : ch; 78 1.10 rillig } 79 1.10 rillig 80 1.10 rillig static int 81 1.10 rillig imax(int a, int b) 82 1.10 rillig { 83 1.10 rillig return a > b ? a : b; 84 1.10 rillig } 85 1.10 rillig 86 1.10 rillig static int 87 1.10 rillig imin(int a, int b) 88 1.10 rillig { 89 1.10 rillig return a < b ? a : b; 90 1.8 rillig } 91 1.8 rillig 92 1.1 dholland //////////////////////////////////////////////////////////// 93 1.1 dholland 94 1.10 rillig struct string { 95 1.10 rillig char *s; 96 1.10 rillig size_t len; 97 1.10 rillig size_t cap; 98 1.10 rillig }; 99 1.10 rillig 100 1.1 dholland struct stringarray { 101 1.10 rillig struct string *v; 102 1.9 rillig size_t num; 103 1.1 dholland }; 104 1.1 dholland 105 1.4 rillig static void 106 1.10 rillig string_init(struct string *s) 107 1.10 rillig { 108 1.10 rillig s->s = NULL; 109 1.10 rillig s->len = 0; 110 1.10 rillig s->cap = 0; 111 1.10 rillig } 112 1.10 rillig 113 1.10 rillig static void 114 1.10 rillig string_add(struct string *s, char ch) 115 1.10 rillig { 116 1.10 rillig if (s->len >= s->cap) { 117 1.10 rillig s->cap = 2 * s->cap + 16; 118 1.10 rillig s->s = realloc(s->s, s->cap); 119 1.10 rillig if (s->s == NULL) 120 1.10 rillig errx(1, "Out of memory"); 121 1.10 rillig } 122 1.10 rillig s->s[s->len++] = ch; 123 1.10 rillig } 124 1.10 rillig 125 1.10 rillig static void 126 1.10 rillig string_finish(struct string *s) 127 1.10 rillig { 128 1.10 rillig string_add(s, '\0'); 129 1.10 rillig s->len--; 130 1.10 rillig } 131 1.10 rillig 132 1.10 rillig static void 133 1.4 rillig stringarray_init(struct stringarray *a) 134 1.4 rillig { 135 1.4 rillig a->v = NULL; 136 1.4 rillig a->num = 0; 137 1.4 rillig } 138 1.4 rillig 139 1.4 rillig static void 140 1.23 rillig stringarray_done(struct stringarray *a) 141 1.4 rillig { 142 1.10 rillig for (size_t i = 0; i < a->num; i++) 143 1.10 rillig free(a->v[i].s); 144 1.4 rillig free(a->v); 145 1.4 rillig } 146 1.4 rillig 147 1.4 rillig static void 148 1.10 rillig stringarray_add(struct stringarray *a, struct string *s) 149 1.4 rillig { 150 1.10 rillig size_t num = a->num++; 151 1.26 nia if (reallocarr(&a->v, a->num, sizeof(a->v[0])) != 0) 152 1.4 rillig errx(1, "Out of memory"); 153 1.10 rillig a->v[num] = *s; 154 1.10 rillig } 155 1.10 rillig 156 1.10 rillig static void 157 1.10 rillig stringarray_dup(struct stringarray *dst, const struct stringarray *src) 158 1.10 rillig { 159 1.10 rillig assert(dst->num == 0); 160 1.10 rillig for (size_t i = 0; i < src->num; i++) { 161 1.10 rillig struct string str; 162 1.10 rillig string_init(&str); 163 1.10 rillig for (const char *p = src->v[i].s; *p != '\0'; p++) 164 1.10 rillig string_add(&str, *p); 165 1.10 rillig string_finish(&str); 166 1.10 rillig stringarray_add(dst, &str); 167 1.4 rillig } 168 1.1 dholland } 169 1.1 dholland 170 1.1 dholland //////////////////////////////////////////////////////////// 171 1.1 dholland 172 1.1 dholland static struct stringarray lines; 173 1.1 dholland static struct stringarray sollines; 174 1.1 dholland static bool hinting; 175 1.10 rillig static int extent_x; 176 1.10 rillig static int extent_y; 177 1.10 rillig static int offset_x; 178 1.10 rillig static int offset_y; 179 1.10 rillig static int cursor_x; 180 1.10 rillig static int cursor_y; 181 1.10 rillig 182 1.10 rillig static int 183 1.10 rillig cur_max_x(void) 184 1.10 rillig { 185 1.10 rillig return (int)lines.v[cursor_y].len; 186 1.10 rillig } 187 1.10 rillig 188 1.10 rillig static int 189 1.10 rillig cur_max_y(void) 190 1.10 rillig { 191 1.10 rillig return extent_y - 1; 192 1.10 rillig } 193 1.1 dholland 194 1.13 rillig static char 195 1.13 rillig char_left_of_cursor(void) 196 1.13 rillig { 197 1.13 rillig if (cursor_x > 0) 198 1.13 rillig return lines.v[cursor_y].s[cursor_x - 1]; 199 1.13 rillig assert(cursor_y > 0); 200 1.13 rillig return '\n'; /* eol of previous line */ 201 1.13 rillig } 202 1.13 rillig 203 1.13 rillig static char 204 1.13 rillig char_at_cursor(void) 205 1.13 rillig { 206 1.13 rillig if (cursor_x == cur_max_x()) 207 1.13 rillig return '\n'; 208 1.13 rillig return lines.v[cursor_y].s[cursor_x]; 209 1.13 rillig } 210 1.13 rillig 211 1.19 rillig static void 212 1.19 rillig getquote(FILE *f) 213 1.19 rillig { 214 1.10 rillig struct string line; 215 1.10 rillig string_init(&line); 216 1.10 rillig 217 1.10 rillig int ch; 218 1.10 rillig while ((ch = fgetc(f)) != EOF) { 219 1.10 rillig if (ch == '\n') { 220 1.10 rillig string_finish(&line); 221 1.10 rillig stringarray_add(&lines, &line); 222 1.10 rillig string_init(&line); 223 1.10 rillig } else if (ch == '\t') { 224 1.10 rillig string_add(&line, ' '); 225 1.10 rillig while (line.len % 8 != 0) 226 1.10 rillig string_add(&line, ' '); 227 1.10 rillig } else if (ch == '\b') { 228 1.10 rillig if (line.len > 0) 229 1.10 rillig line.len--; 230 1.10 rillig } else { 231 1.10 rillig string_add(&line, (char)ch); 232 1.10 rillig } 233 1.4 rillig } 234 1.4 rillig 235 1.10 rillig stringarray_dup(&sollines, &lines); 236 1.4 rillig 237 1.10 rillig extent_y = (int)lines.num; 238 1.10 rillig for (int i = 0; i < extent_y; i++) 239 1.10 rillig extent_x = imax(extent_x, (int)lines.v[i].len); 240 1.18 wiz } 241 1.18 wiz 242 1.18 wiz static void 243 1.18 wiz readfile(const char *name) 244 1.18 wiz { 245 1.18 wiz FILE *f = fopen(name, "r"); 246 1.18 wiz if (f == NULL) 247 1.18 wiz err(1, "%s", name); 248 1.18 wiz 249 1.18 wiz getquote(f); 250 1.18 wiz 251 1.18 wiz if (fclose(f) != 0) 252 1.19 rillig err(1, "%s", name); 253 1.18 wiz } 254 1.18 wiz 255 1.18 wiz 256 1.18 wiz static void 257 1.18 wiz readquote(void) 258 1.18 wiz { 259 1.18 wiz FILE *f = popen(_PATH_FORTUNE, "r"); 260 1.18 wiz if (f == NULL) 261 1.18 wiz err(1, "%s", _PATH_FORTUNE); 262 1.18 wiz 263 1.18 wiz getquote(f); 264 1.4 rillig 265 1.12 rillig if (pclose(f) != 0) 266 1.12 rillig exit(1); /* error message must come from child process */ 267 1.4 rillig } 268 1.4 rillig 269 1.4 rillig static void 270 1.4 rillig encode(void) 271 1.4 rillig { 272 1.4 rillig int key[26]; 273 1.9 rillig 274 1.4 rillig for (int i = 0; i < 26; i++) 275 1.4 rillig key[i] = i; 276 1.9 rillig 277 1.4 rillig for (int i = 26; i > 1; i--) { 278 1.9 rillig int c = (int)(random() % i); 279 1.4 rillig int t = key[i - 1]; 280 1.4 rillig key[i - 1] = key[c]; 281 1.4 rillig key[c] = t; 282 1.4 rillig } 283 1.4 rillig 284 1.10 rillig for (int y = 0; y < extent_y; y++) { 285 1.10 rillig for (char *p = lines.v[y].s; *p != '\0'; p++) { 286 1.9 rillig if (ch_islower(*p)) 287 1.9 rillig *p = (char)('a' + key[*p - 'a']); 288 1.9 rillig if (ch_isupper(*p)) 289 1.9 rillig *p = (char)('A' + key[*p - 'A']); 290 1.4 rillig } 291 1.4 rillig } 292 1.4 rillig } 293 1.4 rillig 294 1.14 rillig static void 295 1.14 rillig substitute(char a, char b) 296 1.4 rillig { 297 1.14 rillig char la = ch_tolower(a); 298 1.14 rillig char ua = ch_toupper(a); 299 1.14 rillig char lb = ch_tolower(b); 300 1.14 rillig char ub = ch_toupper(b); 301 1.4 rillig 302 1.9 rillig for (int y = 0; y < (int)lines.num; y++) { 303 1.10 rillig for (char *p = lines.v[y].s; *p != '\0'; p++) { 304 1.14 rillig if (*p == la) 305 1.14 rillig *p = lb; 306 1.14 rillig else if (*p == ua) 307 1.14 rillig *p = ub; 308 1.14 rillig else if (*p == lb) 309 1.14 rillig *p = la; 310 1.14 rillig else if (*p == ub) 311 1.14 rillig *p = ua; 312 1.4 rillig } 313 1.4 rillig } 314 1.1 dholland } 315 1.1 dholland 316 1.10 rillig static bool 317 1.10 rillig is_solved(void) 318 1.10 rillig { 319 1.10 rillig for (size_t i = 0; i < lines.num; i++) 320 1.10 rillig if (strcmp(lines.v[i].s, sollines.v[i].s) != 0) 321 1.10 rillig return false; 322 1.10 rillig return true; 323 1.10 rillig } 324 1.10 rillig 325 1.13 rillig //////////////////////////////////////////////////////////// 326 1.13 rillig 327 1.4 rillig static void 328 1.4 rillig redraw(void) 329 1.4 rillig { 330 1.4 rillig erase(); 331 1.10 rillig 332 1.10 rillig int max_y = imin(LINES - 1, extent_y - offset_y); 333 1.10 rillig for (int y = 0; y < max_y; y++) { 334 1.10 rillig move(y, 0); 335 1.10 rillig 336 1.10 rillig int len = (int)lines.v[offset_y + y].len; 337 1.10 rillig int max_x = imin(COLS - 1, len - offset_x); 338 1.10 rillig const char *line = lines.v[offset_y + y].s; 339 1.10 rillig const char *solline = sollines.v[offset_y + y].s; 340 1.10 rillig 341 1.10 rillig for (int x = 0; x < max_x; x++) { 342 1.10 rillig char ch = line[offset_x + x]; 343 1.10 rillig bool bold = hinting && 344 1.22 rillig (ch == solline[offset_x + x] || !ch_isalpha(ch)); 345 1.10 rillig 346 1.10 rillig if (bold) 347 1.10 rillig attron(A_BOLD); 348 1.10 rillig addch(ch); 349 1.10 rillig if (bold) 350 1.10 rillig attroff(A_BOLD); 351 1.4 rillig } 352 1.4 rillig clrtoeol(); 353 1.4 rillig } 354 1.4 rillig 355 1.4 rillig move(LINES - 1, 0); 356 1.16 rillig addstr("~ to quit, * to cheat, ^pnfb to move"); 357 1.16 rillig 358 1.15 rillig if (is_solved()) { 359 1.16 rillig if (extent_y + 1 - offset_y < LINES - 2) 360 1.16 rillig move(extent_y + 1 - offset_y, 0); 361 1.16 rillig else 362 1.16 rillig addch(' '); 363 1.15 rillig attron(A_BOLD | A_STANDOUT); 364 1.15 rillig addstr("*solved*"); 365 1.15 rillig attroff(A_BOLD | A_STANDOUT); 366 1.15 rillig } 367 1.4 rillig 368 1.10 rillig move(cursor_y - offset_y, cursor_x - offset_x); 369 1.4 rillig 370 1.4 rillig refresh(); 371 1.4 rillig } 372 1.4 rillig 373 1.1 dholland //////////////////////////////////////////////////////////// 374 1.1 dholland 375 1.4 rillig static void 376 1.10 rillig saturate_cursor(void) 377 1.10 rillig { 378 1.11 rillig cursor_y = imax(cursor_y, 0); 379 1.11 rillig cursor_y = imin(cursor_y, cur_max_y()); 380 1.10 rillig 381 1.10 rillig assert(cursor_x >= 0); 382 1.10 rillig cursor_x = imin(cursor_x, cur_max_x()); 383 1.10 rillig } 384 1.10 rillig 385 1.10 rillig static void 386 1.10 rillig scroll_into_view(void) 387 1.10 rillig { 388 1.10 rillig if (cursor_x < offset_x) 389 1.10 rillig offset_x = cursor_x; 390 1.10 rillig if (cursor_x > offset_x + COLS - 1) 391 1.10 rillig offset_x = cursor_x - (COLS - 1); 392 1.10 rillig 393 1.10 rillig if (cursor_y < offset_y) 394 1.10 rillig offset_y = cursor_y; 395 1.10 rillig if (cursor_y > offset_y + LINES - 2) 396 1.10 rillig offset_y = cursor_y - (LINES - 2); 397 1.10 rillig } 398 1.10 rillig 399 1.13 rillig static bool 400 1.13 rillig can_go_left(void) 401 1.13 rillig { 402 1.13 rillig return cursor_y > 0 || 403 1.13 rillig (cursor_y == 0 && cursor_x > 0); 404 1.13 rillig } 405 1.13 rillig 406 1.13 rillig static bool 407 1.13 rillig can_go_right(void) 408 1.13 rillig { 409 1.13 rillig return cursor_y < cur_max_y() || 410 1.13 rillig (cursor_y == cur_max_y() && cursor_x < cur_max_x()); 411 1.13 rillig } 412 1.13 rillig 413 1.13 rillig static void 414 1.13 rillig go_to_prev_line(void) 415 1.13 rillig { 416 1.13 rillig cursor_y--; 417 1.13 rillig cursor_x = cur_max_x(); 418 1.13 rillig } 419 1.13 rillig 420 1.13 rillig static void 421 1.13 rillig go_to_next_line(void) 422 1.13 rillig { 423 1.13 rillig cursor_x = 0; 424 1.13 rillig cursor_y++; 425 1.13 rillig } 426 1.13 rillig 427 1.13 rillig static void 428 1.13 rillig go_left(void) 429 1.13 rillig { 430 1.13 rillig if (cursor_x > 0) 431 1.13 rillig cursor_x--; 432 1.13 rillig else if (cursor_y > 0) 433 1.13 rillig go_to_prev_line(); 434 1.13 rillig } 435 1.13 rillig 436 1.13 rillig static void 437 1.13 rillig go_right(void) 438 1.13 rillig { 439 1.13 rillig if (cursor_x < cur_max_x()) 440 1.13 rillig cursor_x++; 441 1.13 rillig else if (cursor_y < cur_max_y()) 442 1.13 rillig go_to_next_line(); 443 1.13 rillig } 444 1.13 rillig 445 1.13 rillig static void 446 1.13 rillig go_to_prev_word(void) 447 1.13 rillig { 448 1.27 rillig while (can_go_left() && !ch_isalpha(char_left_of_cursor())) 449 1.13 rillig go_left(); 450 1.13 rillig 451 1.27 rillig while (can_go_left() && ch_isalpha(char_left_of_cursor())) 452 1.13 rillig go_left(); 453 1.13 rillig } 454 1.13 rillig 455 1.13 rillig static void 456 1.13 rillig go_to_next_word(void) 457 1.13 rillig { 458 1.27 rillig while (can_go_right() && ch_isalpha(char_at_cursor())) 459 1.13 rillig go_right(); 460 1.13 rillig 461 1.27 rillig while (can_go_right() && !ch_isalpha(char_at_cursor())) 462 1.13 rillig go_right(); 463 1.13 rillig } 464 1.13 rillig 465 1.14 rillig static bool 466 1.14 rillig can_substitute_here(int ch) 467 1.14 rillig { 468 1.14 rillig return isascii(ch) && 469 1.14 rillig ch_isalpha((char)ch) && 470 1.14 rillig cursor_x < cur_max_x() && 471 1.14 rillig ch_isalpha(char_at_cursor()); 472 1.14 rillig } 473 1.14 rillig 474 1.10 rillig static void 475 1.10 rillig handle_char_input(int ch) 476 1.4 rillig { 477 1.14 rillig if (ch == char_at_cursor()) 478 1.14 rillig go_right(); 479 1.14 rillig else if (can_substitute_here(ch)) { 480 1.14 rillig substitute(char_at_cursor(), (char)ch); 481 1.13 rillig go_right(); 482 1.14 rillig } else 483 1.10 rillig beep(); 484 1.1 dholland } 485 1.1 dholland 486 1.10 rillig static bool 487 1.10 rillig handle_key(void) 488 1.10 rillig { 489 1.10 rillig int ch = getch(); 490 1.10 rillig 491 1.30 rillig #define CTRL(letter) (letter - 64) 492 1.10 rillig switch (ch) { 493 1.30 rillig case CTRL('A'): 494 1.29 rillig case KEY_BEG: 495 1.10 rillig case KEY_HOME: 496 1.10 rillig cursor_x = 0; 497 1.10 rillig break; 498 1.30 rillig case CTRL('B'): 499 1.10 rillig case KEY_LEFT: 500 1.13 rillig go_left(); 501 1.10 rillig break; 502 1.30 rillig case CTRL('E'): 503 1.10 rillig case KEY_END: 504 1.10 rillig cursor_x = cur_max_x(); 505 1.10 rillig break; 506 1.30 rillig case CTRL('F'): 507 1.10 rillig case KEY_RIGHT: 508 1.13 rillig go_right(); 509 1.13 rillig break; 510 1.13 rillig case '\t': 511 1.13 rillig go_to_next_word(); 512 1.13 rillig break; 513 1.13 rillig case KEY_BTAB: 514 1.13 rillig go_to_prev_word(); 515 1.13 rillig break; 516 1.13 rillig case '\n': 517 1.13 rillig go_to_next_line(); 518 1.10 rillig break; 519 1.30 rillig case CTRL('L'): 520 1.10 rillig clear(); 521 1.10 rillig break; 522 1.30 rillig case CTRL('N'): 523 1.10 rillig case KEY_DOWN: 524 1.11 rillig cursor_y++; 525 1.10 rillig break; 526 1.30 rillig case CTRL('P'): 527 1.10 rillig case KEY_UP: 528 1.11 rillig cursor_y--; 529 1.11 rillig break; 530 1.11 rillig case KEY_PPAGE: 531 1.11 rillig cursor_y -= LINES - 2; 532 1.11 rillig break; 533 1.11 rillig case KEY_NPAGE: 534 1.11 rillig cursor_y += LINES - 2; 535 1.10 rillig break; 536 1.10 rillig case '*': 537 1.10 rillig hinting = !hinting; 538 1.10 rillig break; 539 1.10 rillig case '~': 540 1.10 rillig return false; 541 1.17 rillig case KEY_RESIZE: 542 1.17 rillig break; 543 1.10 rillig default: 544 1.10 rillig handle_char_input(ch); 545 1.10 rillig break; 546 1.10 rillig } 547 1.10 rillig return true; 548 1.10 rillig } 549 1.1 dholland 550 1.10 rillig static void 551 1.18 wiz init(const char *filename) 552 1.4 rillig { 553 1.4 rillig stringarray_init(&lines); 554 1.4 rillig stringarray_init(&sollines); 555 1.9 rillig srandom((unsigned int)time(NULL)); 556 1.19 rillig if (filename != NULL) { 557 1.18 wiz readfile(filename); 558 1.18 wiz } else { 559 1.18 wiz readquote(); 560 1.18 wiz } 561 1.4 rillig encode(); 562 1.13 rillig 563 1.13 rillig initscr(); 564 1.13 rillig cbreak(); 565 1.13 rillig noecho(); 566 1.13 rillig keypad(stdscr, true); 567 1.10 rillig } 568 1.4 rillig 569 1.10 rillig static void 570 1.10 rillig loop(void) 571 1.10 rillig { 572 1.10 rillig for (;;) { 573 1.10 rillig redraw(); 574 1.10 rillig if (!handle_key()) 575 1.10 rillig break; 576 1.10 rillig saturate_cursor(); 577 1.10 rillig scroll_into_view(); 578 1.10 rillig } 579 1.10 rillig } 580 1.4 rillig 581 1.10 rillig static void 582 1.23 rillig done(void) 583 1.10 rillig { 584 1.28 rillig move(LINES - 1, 0); 585 1.28 rillig clrtoeol(); 586 1.28 rillig refresh(); 587 1.28 rillig 588 1.13 rillig endwin(); 589 1.13 rillig 590 1.23 rillig stringarray_done(&sollines); 591 1.23 rillig stringarray_done(&lines); 592 1.1 dholland } 593 1.10 rillig 594 1.20 rillig 595 1.20 rillig static void __dead 596 1.20 rillig usage(void) 597 1.20 rillig { 598 1.20 rillig 599 1.20 rillig fprintf(stderr, "usage: %s [file]\n", getprogname()); 600 1.20 rillig exit(1); 601 1.20 rillig } 602 1.10 rillig 603 1.10 rillig int 604 1.18 wiz main(int argc, char *argv[]) 605 1.10 rillig { 606 1.20 rillig 607 1.20 rillig setprogname(argv[0]); 608 1.20 rillig if (argc != 1 && argc != 2) 609 1.20 rillig usage(); 610 1.20 rillig 611 1.18 wiz init(argc > 1 ? argv[1] : NULL); 612 1.10 rillig loop(); 613 1.23 rillig done(); 614 1.24 dholland return 0; 615 1.10 rillig } 616