display.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580
  1. /* display.c, Ait, BSD 3-Clause, Kevin Bloom, 2023,
  2. Derived from: Atto January 2017
  3. Derived from: Anthony's Editor January 93
  4. */
  5. #include "header.h"
  6. #include "util.h"
  7. #define TB_IMPL
  8. #include "termbox.h"
  9. int moving_past = FALSE;
  10. /* Reverse scan for start of logical line containing offset */
  11. point_t lnstart(buffer_t *bp, register point_t off)
  12. {
  13. register char_t *p;
  14. do
  15. p = ptr(bp, --off);
  16. while (bp->b_buf < p && *p != '\n');
  17. return (bp->b_buf < p ? ++off : 0);
  18. }
  19. /* Forward scan for start of logical line segment (corresponds to screen line) containing 'finish' */
  20. point_t segstart(buffer_t *bp, window_t *wp, point_t start, point_t finish)
  21. {
  22. char_t *p;
  23. int c = 0;
  24. point_t scan = start;
  25. while (scan < finish) {
  26. p = ptr(bp, scan);
  27. if (*p == '\n') {
  28. c = 0;
  29. start = scan + 1;
  30. } else if (wp->w_cols <= c) {
  31. c = 0;
  32. start = scan;
  33. }
  34. scan += utf8_size(*ptr(bp,scan));
  35. c += *p == '\t' ? 8 - (c & 7) : 1;
  36. }
  37. return (c < wp->w_cols ? start : finish);
  38. }
  39. /* Forward scan for start of logical line segment following 'finish' */
  40. point_t segnext(buffer_t *bp, window_t *wp, point_t start, point_t finish)
  41. {
  42. char_t *p;
  43. int c = 0;
  44. point_t scan = segstart(bp, wp, start, finish);
  45. for (;;) {
  46. p = ptr(bp, scan);
  47. if (bp->b_ebuf <= p || wp->w_cols <= c)
  48. break;
  49. scan += utf8_size(*ptr(bp,scan));
  50. if (*p == '\n')
  51. break;
  52. c += *p == '\t' ? 8 - (c & 7) : 1;
  53. }
  54. return (p < bp->b_ebuf ? scan : pos(bp, bp->b_ebuf));
  55. }
  56. /* Move up one screen line */
  57. point_t upup(buffer_t *bp, window_t *wp, point_t off)
  58. {
  59. point_t curr = lnstart(bp, off);
  60. point_t seg = segstart(bp, wp, curr, off);
  61. if(wp->w_row == wp->w_top)
  62. moving_past = TRUE;
  63. if (curr < seg)
  64. off = segstart(bp, wp, curr, seg-1);
  65. else
  66. off = segstart(bp, wp, lnstart(bp,curr-1), curr-1);
  67. return (off);
  68. }
  69. /* Move down one screen line */
  70. point_t dndn(buffer_t *bp, window_t *wp, point_t off)
  71. {
  72. if(wp->w_row == wp->w_rows - wp->w_top - 1)
  73. moving_past = TRUE;
  74. return (segnext(bp, wp, lnstart(bp,off), off));
  75. }
  76. /* Return the offset of a column on the specified line */
  77. point_t lncolumn(buffer_t *bp, point_t offset, int column)
  78. {
  79. int c = 0;
  80. char_t *p;
  81. while ((p = ptr(bp, offset)) < bp->b_ebuf && *p != '\n' && c < column) {
  82. c += *p == '\t' ? 4 : 1;
  83. offset += utf8_size(*ptr(bp,offset));
  84. }
  85. return (offset);
  86. }
  87. void display(window_t *wp, int flag, point_t ln_start, point_t ln_end)
  88. {
  89. char_t *p, z, *g;
  90. int i, j, nch, region = 0, searchlen = strlen(searchtext), b = 0, case_sense = FALSE;
  91. int trailing_whitespace = FALSE, w = 0, token_type = ID_DEFAULT, color = TB_DEFAULT;
  92. buffer_t *bp = wp->w_bufp;
  93. point_t matching_bracket = -1;
  94. int prow = bp->b_row;
  95. /* find start of screen, handle scroll up off page or top of file */
  96. /* point is always within b_page and b_epage */
  97. if (bp->b_point < bp->b_page)
  98. bp->b_page = segstart(bp, wp, lnstart(bp,bp->b_point), bp->b_point);
  99. /* reframe when scrolled off bottom */
  100. if (bp->b_reframe == 1 || (bp->b_epage <= bp->b_point && curbp->b_point != pos(curbp, curbp->b_ebuf))) {
  101. bp->b_reframe = 0;
  102. /* Find end of screen plus one. */
  103. bp->b_page = dndn(bp, wp, bp->b_point);
  104. /* if we scroll to EOF we show 1 blank line at bottom of screen */
  105. if (pos(bp, bp->b_ebuf) <= bp->b_page) {
  106. bp->b_page = pos(bp, bp->b_ebuf);
  107. i = wp->w_rows - 1;
  108. } else {
  109. i = wp->w_rows - 0;
  110. }
  111. /* Scan backwards the required number of lines. */
  112. while (0 < i--)
  113. bp->b_page = upup(bp, wp, bp->b_page);
  114. }
  115. // tb_set_cursor(wp->w_left, wp->w_top); /* start from top of window */
  116. i = wp->w_top;
  117. j = wp->w_left;
  118. bp->b_epage = bp->b_page;
  119. set_parse_state(bp, bp->b_epage); /* are we in a multline comment ? */
  120. // tb_clear();
  121. /* paint screen from top of page until we hit maxline */
  122. while (1) {
  123. /* reached point - store the cursor position */
  124. if (bp->b_point == bp->b_epage) {
  125. bp->b_row = i;
  126. bp->b_col = j;
  127. }
  128. if(bp->b_epage < ln_start && bp->b_epage > ln_end) {
  129. bp->b_epage++;
  130. continue;
  131. }
  132. p = ptr(bp, bp->b_epage);
  133. nch = 1;
  134. if (wp->w_top + wp->w_rows <= i || bp->b_ebuf <= p) /* maxline */
  135. break;
  136. if(curwp == wp && (z = is_bracket(*p)) != 0) {
  137. if(z == '\'' || z == '"' || z == '`')
  138. z = 0;
  139. else if(z != '\'' || z != '"') { //"
  140. matching_bracket = find_matching_bracket(bp, (z == '}' || z == ']' || z == ')' || z == '>') ? -1 : 1);
  141. }
  142. }
  143. if (*p != '\r') {
  144. nch = utf8_size(*p);
  145. if(wp == curwp &&
  146. bp->b_mark != NOMARK &&
  147. ((bp->b_mark <= bp->b_epage &&
  148. bp->b_point > bp->b_epage) ||
  149. (bp->b_point <= bp->b_epage &&
  150. bp->b_mark > bp->b_epage))
  151. ) {
  152. region = 1;
  153. } else if(matching_bracket >= 0 && bp->b_epage == matching_bracket) {
  154. region = 1;
  155. } else if(curwp == wp) {
  156. if(found_point > 0 &&
  157. search_dir == 1 &&
  158. found_point - searchlen <= bp->b_epage &&
  159. bp->b_epage < found_point)
  160. region = 1;
  161. else if(found_point > 0 &&
  162. search_dir == 2 &&
  163. found_point + searchlen >= bp->b_epage &&
  164. bp->b_epage > found_point)
  165. region = 1;
  166. else if(found_point > 0 && tolower(searchtext[0]) == tolower(*p) && b == 0) {
  167. if(isupper(searchtext[0]))
  168. case_sense = TRUE;
  169. while(b < searchlen) {
  170. if(isupper(searchtext[b])) {
  171. case_sense = TRUE;
  172. if(searchtext[b] == *(p+b)) {
  173. region = 1;
  174. } else {
  175. region = 0;
  176. b = 0;
  177. break;
  178. }
  179. } else if (case_sense) {
  180. if(searchtext[b] == *(p+b)) {
  181. region = 1;
  182. } else {
  183. region = 0;
  184. b = 0;
  185. break;
  186. }
  187. } else if(!case_sense && searchtext[b] == tolower(*(p+b))) {
  188. region = 1;
  189. } else {
  190. region = 0;
  191. b = 0;
  192. break;
  193. }
  194. b++;
  195. }
  196. b = b < 0 ? 0 : b - 1;
  197. } else if(b > 0) {
  198. b--;
  199. region = 1;
  200. } else {
  201. region = 0;
  202. b = 0;
  203. }
  204. }
  205. if(nch > 1) {
  206. wchar_t c;
  207. if(mbtowc(&c, (char*)p, 6) < 0) mbtowc(NULL, NULL, 0);
  208. j++;
  209. uint32_t uni;
  210. tb_utf8_char_to_unicode(&uni, (char *)p);
  211. tb_set_cell(j-1, i, uni, region ? TB_BLACK : TB_DEFAULT, region ? TB_WHITE : TB_DEFAULT);
  212. } else if(*p < 32 && *p != '\n' && *p != '\t') {
  213. char ctrl = unctrl(*p);
  214. tb_set_cell(j, i, '^', TB_RED, region ? TB_WHITE : TB_DEFAULT);
  215. tb_set_cell(j+1, i, ctrl, TB_RED, region ? TB_WHITE : TB_DEFAULT);
  216. j += 2;
  217. } else if (isprint(*p) || *p == '\t' || *p == '\n') {
  218. /* Figure out if the whitespace is trailing or not. */
  219. while(isspace(*p) && *p != '\n' && isspace(*(g = ptr(bp, bp->b_epage + w))) && bp->b_point != bp->b_epage + w) {
  220. if(*g == '\n') {
  221. trailing_whitespace = TRUE;
  222. break;
  223. }
  224. w++;
  225. }
  226. w = 0;
  227. if(trailing_whitespace && *p != '\t') {
  228. j++;
  229. uint32_t uni;
  230. tb_utf8_char_to_unicode(&uni, (char *)p);
  231. tb_set_cell(j-1, i, uni, TB_DEFAULT, TB_RED);
  232. } else if(*p == '\t') {
  233. j += 4;
  234. for(int t = 4; t > 0; t--)
  235. tb_set_cell(j-t, i, 0x2500, TB_RED, region ? TB_WHITE : TB_DEFAULT);
  236. } else {
  237. j++;
  238. uint32_t uni;
  239. tb_utf8_char_to_unicode(&uni, (char *)p);
  240. token_type = parse_text(bp, bp->b_epage);
  241. switch(token_type) {
  242. case ID_SYMBOL: {
  243. color = TB_MAGENTA;
  244. break;
  245. }
  246. case ID_DOUBLE_STRING: {
  247. color = TB_GREEN;
  248. break;
  249. }
  250. case ID_SINGLE_STRING: {
  251. color = TB_GREEN;
  252. break;
  253. }
  254. case ID_BACK_STRING: {
  255. color = TB_CYAN;
  256. break;
  257. }
  258. case ID_DIGITS: {
  259. color = TB_CYAN;
  260. break;
  261. }
  262. case ID_LINE_COMMENT: {
  263. color = TB_BLUE;
  264. break;
  265. }
  266. case ID_BLOCK_COMMENT: {
  267. color = TB_BLUE;
  268. break;
  269. }
  270. default: {
  271. color = TB_DEFAULT;
  272. break;
  273. }
  274. }
  275. tb_set_cell(j-1, i, uni, region ? TB_BLACK : color, region ? TB_WHITE : TB_DEFAULT);
  276. }
  277. }
  278. }
  279. trailing_whitespace = FALSE;
  280. if (*p == '\n' || wp->w_cols <= j - wp->w_left) {
  281. j -= wp->w_cols;
  282. if (j < wp->w_left)
  283. j = wp->w_left;
  284. ++i;
  285. }
  286. bp->b_epage = bp->b_epage + nch;
  287. }
  288. b2w(wp); /* save buffer stuff on window */
  289. modeline(wp);
  290. if (wp == curwp && flag) {
  291. dispmsg();
  292. tb_set_cursor(bp->b_col, bp->b_row); /* set cursor */
  293. }
  294. wp->w_update = FALSE;
  295. if(bp->b_row == prow && !moving_past) {
  296. bp->b_pcol = bp->b_col;
  297. wp->w_pcol = bp->b_col;
  298. }
  299. moving_past = FALSE;
  300. tb_present();
  301. }
  302. void modeline(window_t *wp)
  303. {
  304. int i, current = 0, lastln = 0;
  305. char lch, mch, och;
  306. char mltemp[TEMPBUF];
  307. char *percent = NULL;
  308. point_t pg = lnstart(curbp, curbp->b_page),
  309. ebuf = pos(curbp, curbp->b_ebuf);
  310. float dec = 0.0, mod = 0.0;
  311. get_line_stats(&current, &lastln, wp->w_bufp);
  312. lch = (wp == curwp ? '=' : '-');
  313. mch = ((wp->w_bufp->b_flags & B_MODIFIED) ? '*' : lch);
  314. och = ((wp->w_bufp->b_flags & B_OVERWRITE) ? 'O' : lch);
  315. /* Based on the b_page, determine if you're at the top, bottom or
  316. somewhere in-between the buffer. If in-between, calculate the
  317. percentage from the bottom. We round up always because that's
  318. what Emacs does.
  319. */
  320. percent = (char *) malloc(sizeof(char *)*3);
  321. if(pg == 0) {
  322. percent = "Top";
  323. } else if(curbp->b_epage == ebuf) {
  324. percent = "Bot";
  325. } else {
  326. mod = curbp->b_page * 100 % ebuf;
  327. dec = curbp->b_page * 100.0 / ebuf;
  328. if(mod != 0)
  329. dec++;
  330. sprintf(percent, "%d%%", (int)(dec));
  331. }
  332. sprintf(mltemp, "%c%c%c %s %c%c (%d,%d) %c%c %s ", lch,och,mch, wp->w_bufp->b_bname,
  333. lch, lch, current, wp->w_col - wp->w_left, lch, lch, percent);
  334. addstrxy(mltemp, wp->w_left, wp->w_top + wp->w_rows, 1);
  335. for (i = strlen(mltemp); i < wp->w_cols; i++)
  336. addchxy(lch, i+wp->w_left, wp->w_top + wp->w_rows, 1);
  337. }
  338. void dispmsg()
  339. {
  340. tb_set_cursor(0, MSGLINE);
  341. if (msgflag) {
  342. addstr(msgline);
  343. msgflag = FALSE;
  344. }
  345. clrtoeol(msgline, MSGLINE);
  346. }
  347. void display_prompt_and_response(char *prompt, char *response)
  348. {
  349. char full[NAME_MAX];
  350. strcpy(full, prompt);
  351. strcat(full, response);
  352. print_to_msgline(prompt);
  353. /* if we have a value print it and go to end of it */
  354. if (response[0] != '\0')
  355. addstr(response);
  356. clrtoeol(full, MSGLINE);
  357. }
  358. /* clear:
  359. 0: don't clear anything (same page movements)
  360. 1: clear line
  361. 2: clear all
  362. */
  363. void update_display(int clear)
  364. {
  365. window_t *wp;
  366. buffer_t *bp;
  367. point_t lns = curbp->b_point - curwp->w_col;
  368. point_t p = lns;
  369. int rm = 0, fnl = FALSE;
  370. bp = curwp->w_bufp;
  371. bp->b_cpoint = bp->b_point; /* cpoint only ever set here */
  372. if(clear == 2) {
  373. tb_clear();
  374. tb_present();
  375. } else if(clear == 1) {
  376. for(int c = 0; c <= curwp->w_cols; c++) {
  377. char_t *cp = ptr(curbp, p);
  378. if(*cp != '\n')
  379. p++;
  380. cp = ptr(curbp, p);
  381. if(*cp == '\n')
  382. fnl = TRUE;
  383. if(c == curwp->w_cols && !fnl) {
  384. c = 0;
  385. rm++;
  386. fnl = FALSE;
  387. } else if(c == curwp->w_cols) {
  388. break;
  389. }
  390. tb_set_cell(curwp->w_left + c, curwp->w_row + rm, ' ', TB_DEFAULT, TB_DEFAULT);
  391. }
  392. tb_present();
  393. }
  394. /* only one window */
  395. if (wheadp->w_next == NULL) {
  396. display(curwp, TRUE, lns, p);
  397. tb_present();
  398. bp->b_psize = bp->b_size;
  399. return;
  400. }
  401. display(curwp, FALSE, lns, p); /* this is key, we must call our win first to get accurate page and epage etc */
  402. if(curwp->w_left != 0)
  403. for(int i = curwp->w_top; i < curwp->w_rows+curwp->w_top+1; i++)
  404. tb_set_cell(curwp->w_left - 1, i, '|', TB_WHITE, TB_DEFAULT);
  405. /* never curwp, to reduce renderings only re-render other windows when a clear
  406. has been done
  407. */
  408. if(clear == 2)
  409. for (wp=wheadp; wp != NULL; wp = wp->w_next) {
  410. if (wp != curwp) {
  411. w2b(wp);
  412. for(int i = wp->w_top; i < wp->w_rows+wp->w_top+1; i++)
  413. tb_set_cell(wp->w_left - 1, i, '|', TB_WHITE, TB_DEFAULT);
  414. display(wp, FALSE, 0, 0);
  415. }
  416. }
  417. /* now display our window and buffer */
  418. w2b(curwp);
  419. dispmsg();
  420. tb_set_cursor(curwp->w_col, curwp->w_row); /* set cursor for curwp */
  421. tb_present();
  422. bp->b_psize = bp->b_size; /* now safe to save previous size for next time */
  423. }
  424. void w2b(window_t *w)
  425. {
  426. w->w_bufp->b_point = w->w_point;
  427. w->w_bufp->b_page = w->w_page;
  428. w->w_bufp->b_epage = w->w_epage;
  429. w->w_bufp->b_row = w->w_row;
  430. w->w_bufp->b_col = w->w_col;
  431. w->w_bufp->b_pcol = w->w_pcol;
  432. // tb_set_cursor(w->w_col, w->w_row);
  433. /* fixup pointers in other windows of the same buffer, if size of edit text changed */
  434. if (w->w_bufp->b_point > w->w_bufp->b_cpoint) {
  435. w->w_bufp->b_point += (w->w_bufp->b_size - w->w_bufp->b_psize);
  436. w->w_bufp->b_page += (w->w_bufp->b_size - w->w_bufp->b_psize);
  437. w->w_bufp->b_epage += (w->w_bufp->b_size - w->w_bufp->b_psize);
  438. }
  439. }
  440. void b2w(window_t *w)
  441. {
  442. w->w_point = w->w_bufp->b_point;
  443. w->w_page = w->w_bufp->b_page;
  444. w->w_epage = w->w_bufp->b_epage;
  445. w->w_row = w->w_bufp->b_row;
  446. w->w_col = w->w_bufp->b_col;
  447. w->w_pcol = w->w_bufp->b_pcol;
  448. w->w_bufp->b_size = (w->w_bufp->b_ebuf - w->w_bufp->b_buf) - (w->w_bufp->b_egap - w->w_bufp->b_gap);
  449. // tb_set_cursor(w->w_col, w->w_row);
  450. }
  451. /* flag = default answer, FALSE=n, TRUE=y */
  452. int yesno(int flag)
  453. {
  454. struct tb_event ev;
  455. tb_present();
  456. if(tb_poll_event(&ev) != TB_OK) return 0;
  457. if (ev.ch == '\r' || ev.ch == '\n')
  458. return (flag);
  459. return (tolower(ev.ch) == 'y');
  460. }
  461. char yesnomaybeso(char d)
  462. {
  463. struct tb_event ev;
  464. tb_present();
  465. if(tb_poll_event(&ev) != TB_OK) return 0;
  466. if (ev.ch == '\r' || ev.ch == '\n')
  467. return (d);
  468. return tolower(ev.ch);
  469. }
  470. void print_tb(const char *str, int x, int y, uint16_t fg, uint16_t bg)
  471. {
  472. while (*str) {
  473. uint32_t uni;
  474. str += tb_utf8_char_to_unicode(&uni, str);
  475. tb_set_cell(x, y, uni, fg, bg);
  476. x++;
  477. }
  478. }
  479. void printf_tb(int x, int y, uint16_t fg, uint16_t bg, const char *fmt, ...)
  480. {
  481. char buf[4096];
  482. va_list vl;
  483. va_start(vl, fmt);
  484. vsnprintf(buf, sizeof(buf), fmt, vl);
  485. va_end(vl);
  486. print_tb(buf, x, y, fg, bg);
  487. }
  488. void addstr(const char *str)
  489. {
  490. printf_tb(global.cursor_x, global.cursor_y, TB_DEFAULT, TB_DEFAULT, str);
  491. tb_set_cursor(global.cursor_x+strlen(str), global.cursor_y);
  492. }
  493. void addch(char c)
  494. {
  495. printf_tb(global.cursor_x, global.cursor_y, TB_DEFAULT, TB_DEFAULT, "%c", c);
  496. tb_set_cursor(global.cursor_x+1, global.cursor_y);
  497. }
  498. /*
  499. Print char at point x,y. If within the region, highlight it.
  500. */
  501. void addchxy(char c, int x, int y, int region)
  502. {
  503. int fg = region == 0 ? TB_DEFAULT : TB_BLACK;
  504. int bg = region == 0 ? TB_DEFAULT : TB_WHITE;
  505. if(c != '\n' && c != '\r')
  506. printf_tb(x, y, fg, bg, "%c", c);
  507. else
  508. printf_tb(x, y, fg, bg, " ");
  509. }
  510. void addstrxy(char *c, int x, int y, int region)
  511. {
  512. int fg = region == 0 ? TB_DEFAULT : TB_BLACK;
  513. int bg = region == 0 ? TB_DEFAULT : TB_WHITE;
  514. printf_tb(x, y, fg, bg, "%s", c);
  515. }
  516. void clrtoeol(const char *str, int line)
  517. {
  518. int l = strlen(str);
  519. int size = COLS-l;
  520. char blanks[size], entire[COLS];
  521. if(size == 0) {
  522. for(int i=0; i<size; i++) {
  523. entire[i]=' ';
  524. }
  525. printf_tb(l, line, TB_DEFAULT, TB_DEFAULT, "%s", entire);
  526. } else {
  527. for(int i=0; i<size; i++) {
  528. blanks[i]=' ';
  529. }
  530. printf_tb(l, line, TB_DEFAULT, TB_DEFAULT, "%s", blanks);
  531. }
  532. }