vt102.c 19 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195
  1. /******************************************************************************
  2. * This file is part of TinTin++ *
  3. * *
  4. * Copyright 2004-2020 Igor van den Hoven *
  5. * *
  6. * TinTin++ is free software; you can redistribute it and/or modify *
  7. * it under the terms of the GNU General Public License as published by *
  8. * the Free Software Foundation; either version 3 of the License, or *
  9. * (at your option) any later version. *
  10. * *
  11. * This program is distributed in the hope that it will be useful, *
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of *
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
  14. * GNU General Public License for more details. *
  15. * *
  16. * You should have received a copy of the GNU General Public License *
  17. * along with TinTin++. If not, see https://www.gnu.org/licenses. *
  18. ******************************************************************************/
  19. /******************************************************************************
  20. * T I N T I N + + *
  21. * *
  22. * coded by Igor van den Hoven 2004 *
  23. ******************************************************************************/
  24. #include "tintin.h"
  25. void init_pos(struct session *ses, int row, int col)
  26. {
  27. push_call("init_pos(%p)",ses);
  28. goto_pos(ses, row, col);
  29. gtd->screen->sav_row[0] = ses->cur_row;
  30. gtd->screen->sav_col[0] = ses->cur_col;
  31. gtd->screen->sav_lev = 1;
  32. pop_call();
  33. return;
  34. }
  35. void save_pos(struct session *ses)
  36. {
  37. push_call("save_pos(%p)",ses);
  38. gtd->screen->sav_row[gtd->screen->sav_lev] = ses->cur_row;
  39. gtd->screen->sav_col[gtd->screen->sav_lev] = ses->cur_col;
  40. if (gtd->screen->sav_lev < STACK_SIZE)
  41. {
  42. gtd->screen->sav_lev++;
  43. }
  44. else
  45. {
  46. syserr_printf(ses, "sav_lev++ above 1000.");
  47. }
  48. if (!HAS_BIT(gtd->flags, TINTIN_FLAG_HIDDENCURSOR))
  49. {
  50. print_stdout("\e[?25l");
  51. }
  52. pop_call();
  53. return;
  54. }
  55. void restore_pos(struct session *ses)
  56. {
  57. if (gtd->screen->sav_lev > 0)
  58. {
  59. gtd->screen->sav_lev--;
  60. }
  61. else
  62. {
  63. gtd->screen->sav_lev = 0;
  64. syserr_printf(ses, "sav_lev-- below 0.");
  65. }
  66. if (gtd->screen->sav_row[gtd->screen->sav_lev] == gtd->screen->rows)
  67. {
  68. goto_pos(ses, gtd->screen->rows, inputline_cur_pos());
  69. }
  70. else
  71. {
  72. goto_pos(ses, gtd->screen->sav_row[gtd->screen->sav_lev], gtd->screen->sav_col[gtd->screen->sav_lev]);
  73. }
  74. if (!HAS_BIT(gtd->flags, TINTIN_FLAG_HIDDENCURSOR))
  75. {
  76. print_stdout("\e[?25h");
  77. }
  78. SET_BIT(gtd->flags, TINTIN_FLAG_FLUSH);
  79. }
  80. void goto_pos(struct session *ses, int row, int col)
  81. {
  82. print_stdout("\e[%d;%dH", row, col);
  83. if (col < 1)
  84. {
  85. print_stdout("debug: goto_pos(%d,%d)\n",row,col);
  86. }
  87. ses->cur_row = row;
  88. ses->cur_col = col;
  89. }
  90. void erase_cols(int cnt)
  91. {
  92. if (cnt)
  93. {
  94. print_stdout("\e[%dX", cnt);
  95. }
  96. }
  97. void erase_row(struct session *ses)
  98. {
  99. if (ses->wrap == gtd->screen->cols || ses->cur_row == gtd->screen->rows)
  100. {
  101. print_stdout("\e[2K");
  102. }
  103. else
  104. {
  105. save_pos(ses);
  106. goto_pos(ses, ses->cur_row, ses->split->top_col);
  107. erase_cols(ses->wrap);
  108. restore_pos(ses);
  109. }
  110. }
  111. void erase_lines(struct session *ses, int rows)
  112. {
  113. print_stdout("\e[%dM", rows);
  114. }
  115. void erase_toeol(void)
  116. {
  117. print_stdout("\e[K");
  118. }
  119. /*
  120. unused
  121. */
  122. void reset(struct session *ses)
  123. {
  124. ses->cur_row = 1;
  125. ses->cur_col = 1;
  126. print_stdout("\ec");
  127. }
  128. void scroll_region(struct session *ses, int top, int bot)
  129. {
  130. push_call("scroll_region(%p,%d,%d)",ses,top,bot);
  131. print_stdout("\e[%d;%dr", top, bot);
  132. ses->split->top_row = top;
  133. ses->split->bot_row = bot;
  134. check_all_events(ses, SUB_ARG, 0, 4, "VT100 SCROLL REGION", ntos(top), ntos(bot), ntos(gtd->screen->rows), ntos(gtd->screen->cols), ntos(get_scroll_cols(ses)));
  135. pop_call();
  136. return;
  137. }
  138. void reset_scroll_region(struct session *ses)
  139. {
  140. if (ses == gtd->ses)
  141. {
  142. print_stdout("\e[r");
  143. }
  144. ses->split->top_row = 1;
  145. ses->split->top_col = 1;
  146. ses->split->bot_row = gtd->screen->rows;
  147. ses->split->bot_col = gtd->screen->cols;
  148. }
  149. int skip_vt102_codes(char *str)
  150. {
  151. int skip = 0;
  152. push_call("skip_vt102_codes(%p)",str);
  153. switch (str[0])
  154. {
  155. case 5: /* ENQ */
  156. case 7: /* BEL */
  157. case 8: /* BS */
  158. // case 9: HT
  159. // case 10: LF
  160. case 11: /* VT */
  161. case 12: /* FF */
  162. case 13: /* CR */
  163. case 14: /* SO */
  164. case 15: /* SI */
  165. case 17: /* DC1 */
  166. case 19: /* DC3 */
  167. case 24: /* CAN */
  168. case 26: /* SUB */
  169. pop_call();
  170. return 1;
  171. case 27: /* ESC */
  172. break;
  173. case 28: // HTML_OPEN
  174. for (skip = 1 ; str[skip] ; skip++)
  175. {
  176. if (str[skip] == 30) // HTML_CLOSE
  177. {
  178. return skip + 1;
  179. }
  180. }
  181. return 0;
  182. case 127: /* DEL */
  183. pop_call();
  184. return 1;
  185. default:
  186. pop_call();
  187. return 0;
  188. }
  189. switch (str[1])
  190. {
  191. case '\0':
  192. pop_call();
  193. return 1;
  194. case '%':
  195. case '#':
  196. case '(':
  197. case ')':
  198. pop_call();
  199. return str[2] ? 3 : 2;
  200. case ']':
  201. switch (str[2])
  202. {
  203. case 0:
  204. pop_call();
  205. return 2;
  206. case 'P':
  207. for (skip = 3 ; skip < 10 ; skip++)
  208. {
  209. if (str[skip] == 0)
  210. {
  211. break;
  212. }
  213. }
  214. pop_call();
  215. return skip;
  216. case 'R':
  217. pop_call();
  218. return str[3] ? 3 : 2;
  219. }
  220. pop_call();
  221. return 2;
  222. case '[':
  223. break;
  224. default:
  225. pop_call();
  226. return 2;
  227. }
  228. for (skip = 2 ; str[skip] != 0 ; skip++)
  229. {
  230. if (isalpha((int) str[skip]))
  231. {
  232. pop_call();
  233. return skip + 1;
  234. }
  235. switch (str[skip])
  236. {
  237. case '@':
  238. case '`':
  239. case ']':
  240. pop_call();
  241. return skip + 1;
  242. }
  243. }
  244. pop_call();
  245. return skip;
  246. }
  247. int find_color_code(char *str)
  248. {
  249. int skip;
  250. switch (str[0])
  251. {
  252. case 27: /* ESC */
  253. break;
  254. default:
  255. return 0;
  256. }
  257. switch (str[1])
  258. {
  259. case '[':
  260. break;
  261. default:
  262. return 0;
  263. }
  264. for (skip = 2 ; str[skip] != 0 ; skip++)
  265. {
  266. switch (str[skip])
  267. {
  268. case 'm':
  269. return skip + 1;
  270. case '@':
  271. case '`':
  272. case ']':
  273. return 0;
  274. }
  275. if (isalpha((int) str[skip]))
  276. {
  277. return 0;
  278. }
  279. }
  280. return 0;
  281. }
  282. int find_secure_color_code(char *str)
  283. {
  284. int skip, valid = 1;
  285. switch (str[0])
  286. {
  287. case 27: /* ESC */
  288. break;
  289. default:
  290. return 0;
  291. }
  292. switch (str[1])
  293. {
  294. case '[':
  295. break;
  296. default:
  297. return 0;
  298. }
  299. for (skip = 2 ; str[skip] != 0 ; skip++)
  300. {
  301. switch (str[skip])
  302. {
  303. case 'm':
  304. if (valid)
  305. {
  306. return skip + 1;
  307. }
  308. return 0;
  309. case ';':
  310. valid = 0;
  311. break;
  312. case '0':
  313. case '1':
  314. case '2':
  315. case '3':
  316. case '4':
  317. case '5':
  318. case '6':
  319. case '7':
  320. case '8':
  321. case '9':
  322. valid = 1;
  323. break;
  324. default:
  325. return 0;
  326. }
  327. }
  328. return 0;
  329. }
  330. int skip_vt102_codes_non_graph(char *str)
  331. {
  332. int skip = 0;
  333. switch (str[skip])
  334. {
  335. case 5: /* ENQ */
  336. case 7: /* BEL */
  337. /* case 8: *//* BS */
  338. /* case 9: *//* HT */
  339. /* case 10: *//* LF */
  340. case 11: /* VT */
  341. case 12: /* FF */
  342. case 13: /* CR */
  343. case 14: /* SO */
  344. case 15: /* SI */
  345. case 17: /* DC1 */
  346. case 19: /* DC3 */
  347. case 24: /* CAN */
  348. case 26: /* SUB */
  349. case 127: /* DEL */
  350. return 1;
  351. case 27: /* ESC */
  352. break;
  353. default:
  354. return 0;
  355. }
  356. switch (str[1])
  357. {
  358. case '\0':
  359. return 0;
  360. case 'c':
  361. case 'D':
  362. case 'E':
  363. case 'H':
  364. case 'M':
  365. case 'Z':
  366. case '7':
  367. case '8':
  368. case '>':
  369. case '=':
  370. return 2;
  371. case '%':
  372. case '#':
  373. case '(':
  374. case ')':
  375. return str[2] ? 3 : 2;
  376. case ']':
  377. switch (str[2])
  378. {
  379. case 'P':
  380. for (skip = 3 ; skip < 10 ; skip++)
  381. {
  382. if (str[skip] == 0)
  383. {
  384. break;
  385. }
  386. }
  387. return skip;
  388. case 'R':
  389. return 3;
  390. }
  391. return 2;
  392. case '[':
  393. break;
  394. default:
  395. return 2;
  396. }
  397. for (skip = 2 ; str[skip] != 0 ; skip++)
  398. {
  399. switch (str[skip])
  400. {
  401. case 'm':
  402. return 0;
  403. case '@':
  404. case '`':
  405. case ']':
  406. return skip + 1;
  407. }
  408. if (isalpha((int) str[skip]))
  409. {
  410. return skip + 1;
  411. }
  412. }
  413. return 0;
  414. }
  415. void strip_vt102_codes(char *str, char *buf)
  416. {
  417. char *pti, *pto;
  418. pti = (char *) str;
  419. pto = (char *) buf;
  420. while (*pti)
  421. {
  422. while (skip_vt102_codes(pti))
  423. {
  424. pti += skip_vt102_codes(pti);
  425. }
  426. if (*pti)
  427. {
  428. *pto++ = *pti++;
  429. }
  430. }
  431. *pto = 0;
  432. }
  433. void strip_vt102_codes_non_graph(char *str, char *buf)
  434. {
  435. char *pti, *pto;
  436. pti = str;
  437. pto = buf;
  438. while (*pti)
  439. {
  440. while (skip_vt102_codes_non_graph(pti))
  441. {
  442. pti += skip_vt102_codes_non_graph(pti);
  443. }
  444. if (*pti)
  445. {
  446. *pto++ = *pti++;
  447. }
  448. }
  449. *pto = 0;
  450. }
  451. void strip_non_vt102_codes(char *str, char *buf)
  452. {
  453. char *pti, *pto;
  454. int len;
  455. pti = str;
  456. pto = buf;
  457. while (*pti)
  458. {
  459. while ((len = skip_vt102_codes(pti)) != 0)
  460. {
  461. memcpy(pto, pti, len);
  462. pti += len;
  463. pto += len;
  464. }
  465. if (*pti)
  466. {
  467. pti++;
  468. }
  469. }
  470. *pto = 0;
  471. }
  472. char *strip_vt102_strstr(char *str, char *buf, int *len)
  473. {
  474. char *pti, *ptm, *pts;
  475. push_call("strip_vt102_strstr(%p,%p,%p)",str,buf,len);
  476. pts = str;
  477. while (*pts)
  478. {
  479. pti = pts;
  480. ptm = buf;
  481. while (*pti)
  482. {
  483. if (*pti++ != *ptm++)
  484. {
  485. break;
  486. }
  487. if (*ptm == 0)
  488. {
  489. if (len)
  490. {
  491. *len = pti - pts;
  492. }
  493. pop_call();
  494. return pts;
  495. }
  496. while (skip_vt102_codes(pti))
  497. {
  498. pti += skip_vt102_codes(pti);
  499. }
  500. }
  501. pts++;
  502. }
  503. pop_call();
  504. return NULL;
  505. }
  506. // mix old and str, then copy compressed color string to buf which can point to old.
  507. void get_color_codes(char *old, char *str, char *buf, int flags)
  508. {
  509. char *pti, *pto, col[100], tmp[BUFFER_SIZE];
  510. int len, vtc, fgc, bgc, cnt;
  511. int rgb[6] = { 0, 0, 0, 0, 0, 0 };
  512. push_call("get_color_codes(%p,%p,%p,%d)",old,str,buf,flags);
  513. pto = tmp;
  514. pti = old;
  515. while (*pti)
  516. {
  517. while ((len = find_color_code(pti)) != 0)
  518. {
  519. memcpy(pto, pti, len);
  520. pti += len;
  521. pto += len;
  522. }
  523. if (*pti)
  524. {
  525. pti++;
  526. }
  527. }
  528. pti = str;
  529. while (*pti)
  530. {
  531. while ((len = find_color_code(pti)) != 0)
  532. {
  533. memcpy(pto, pti, len);
  534. pti += len;
  535. pto += len;
  536. }
  537. if (!HAS_BIT(flags, GET_ALL))
  538. {
  539. break;
  540. }
  541. if (*pti == '\n')
  542. {
  543. break;
  544. }
  545. if (*pti)
  546. {
  547. pti++;
  548. }
  549. }
  550. *pto = 0;
  551. if (strlen(tmp) == 0)
  552. {
  553. buf[0] = 0;
  554. pop_call();
  555. return;
  556. }
  557. vtc = 0;
  558. fgc = -1;
  559. bgc = -1;
  560. pti = tmp;
  561. while (*pti)
  562. {
  563. switch (*pti)
  564. {
  565. case 27:
  566. pti += 2;
  567. if (pti[-1] == 'm')
  568. {
  569. vtc = 0;
  570. fgc = -1;
  571. bgc = -1;
  572. break;
  573. }
  574. for (cnt = 0 ; pti[cnt] ; cnt++)
  575. {
  576. col[cnt] = pti[cnt];
  577. if (pti[cnt] == ';' || pti[cnt] == 'm')
  578. {
  579. col[cnt] = 0;
  580. cnt = -1;
  581. pti += 1 + strlen(col);
  582. if (HAS_BIT(vtc, COL_XTF_R))
  583. {
  584. fgc = URANGE(0, atoi(col), 255);
  585. DEL_BIT(vtc, COL_XTF_5|COL_XTF_R);
  586. SET_BIT(vtc, COL_XTF);
  587. }
  588. else if (HAS_BIT(vtc, COL_XTB_R))
  589. {
  590. bgc = URANGE(0, atoi(col), 255);
  591. DEL_BIT(vtc, COL_XTB_5|COL_XTB_R);
  592. SET_BIT(vtc, COL_XTB);
  593. }
  594. else if (HAS_BIT(vtc, COL_TCF_R))
  595. {
  596. if (rgb[0] == 256)
  597. {
  598. rgb[0] = URANGE(0, atoi(col), 255);
  599. }
  600. else if (rgb[1] == 256)
  601. {
  602. rgb[1] = URANGE(0, atoi(col), 255);
  603. }
  604. else
  605. {
  606. rgb[2] = URANGE(0, atoi(col), 255);
  607. fgc = rgb[0] * 256 * 256 + rgb[1] * 256 + rgb[2];
  608. DEL_BIT(vtc, COL_TCF_2|COL_TCF_R);
  609. SET_BIT(vtc, COL_TCB);
  610. }
  611. }
  612. else if (HAS_BIT(vtc, COL_TCB_R))
  613. {
  614. if (rgb[3] == 256)
  615. {
  616. rgb[3] = URANGE(0, atoi(col), 255);
  617. }
  618. else if (rgb[4] == 256)
  619. {
  620. rgb[4] = URANGE(0, atoi(col), 255);
  621. }
  622. else
  623. {
  624. rgb[5] = URANGE(0, atoi(col), 255);
  625. fgc = rgb[3] * 256 * 256 + rgb[4] * 256 + rgb[5];
  626. DEL_BIT(vtc, COL_TCB_2|COL_TCF_R);
  627. SET_BIT(vtc, COL_TCB);
  628. }
  629. }
  630. else
  631. {
  632. switch (atoi(col))
  633. {
  634. case 0:
  635. vtc = 0;
  636. fgc = -1;
  637. bgc = -1;
  638. break;
  639. case 1:
  640. SET_BIT(vtc, COL_BLD);
  641. break;
  642. case 2:
  643. if (HAS_BIT(vtc, COL_TCF_2))
  644. {
  645. rgb[0] = rgb[1] = rgb[2] = 256;
  646. SET_BIT(vtc, COL_TCF_R);
  647. }
  648. else if (HAS_BIT(vtc, COL_TCB_2))
  649. {
  650. rgb[3] = rgb[4] = rgb[5] = 256;
  651. SET_BIT(vtc, COL_TCB_R);
  652. }
  653. else
  654. {
  655. DEL_BIT(vtc, COL_BLD);
  656. }
  657. break;
  658. case 4:
  659. SET_BIT(vtc, COL_UND);
  660. break;
  661. case 5:
  662. if (HAS_BIT(vtc, COL_XTF_5))
  663. {
  664. SET_BIT(vtc, COL_XTF_R);
  665. }
  666. else if (HAS_BIT(vtc, COL_XTB_5))
  667. {
  668. SET_BIT(vtc, COL_XTB_R);
  669. }
  670. else
  671. {
  672. SET_BIT(vtc, COL_BLK);
  673. }
  674. break;
  675. case 7:
  676. SET_BIT(vtc, COL_REV);
  677. break;
  678. case 21:
  679. case 22:
  680. DEL_BIT(vtc, COL_BLD);
  681. break;
  682. case 24:
  683. DEL_BIT(vtc, COL_UND);
  684. break;
  685. case 25:
  686. DEL_BIT(vtc, COL_BLK);
  687. break;
  688. case 27:
  689. DEL_BIT(vtc, COL_REV);
  690. break;
  691. case 38:
  692. SET_BIT(vtc, COL_XTF_5|COL_TCF_2);
  693. fgc = -1;
  694. break;
  695. case 48:
  696. SET_BIT(vtc, COL_XTB_5|COL_TCB_2);
  697. bgc = -1;
  698. break;
  699. default:
  700. switch (atoi(col) / 10)
  701. {
  702. case 3:
  703. case 10:
  704. fgc = atoi(col);
  705. DEL_BIT(vtc, COL_XTF|COL_TCF);
  706. break;
  707. case 4:
  708. case 9:
  709. bgc = atoi(col);
  710. DEL_BIT(vtc, COL_XTB|COL_TCB);
  711. break;
  712. }
  713. break;
  714. }
  715. }
  716. }
  717. if (pti[-1] == 'm')
  718. {
  719. break;
  720. }
  721. }
  722. break;
  723. default:
  724. pti++;
  725. break;
  726. }
  727. }
  728. strcpy(buf, "\e[0");
  729. if (HAS_BIT(vtc, COL_BLD))
  730. {
  731. strcat(buf, ";1");
  732. }
  733. if (HAS_BIT(vtc, COL_UND))
  734. {
  735. strcat(buf, ";4");
  736. }
  737. if (HAS_BIT(vtc, COL_BLK))
  738. {
  739. strcat(buf, ";5");
  740. }
  741. if (HAS_BIT(vtc, COL_REV))
  742. {
  743. strcat(buf, ";7");
  744. }
  745. if (HAS_BIT(vtc, COL_XTF))
  746. {
  747. cat_sprintf(buf, ";38;5;%d", fgc);
  748. }
  749. else if (HAS_BIT(vtc, COL_TCF))
  750. {
  751. cat_sprintf(buf, ";38;2;%d;%d;%d", fgc / 256 / 256, fgc / 256 % 256, fgc % 256);
  752. }
  753. else if (fgc != -1)
  754. {
  755. cat_sprintf(buf, ";%d", fgc);
  756. }
  757. if (HAS_BIT(vtc, COL_XTB))
  758. {
  759. cat_sprintf(buf, ";48;5;%d", bgc);
  760. }
  761. else if (HAS_BIT(vtc, COL_TCB))
  762. {
  763. cat_sprintf(buf, ";48;2;%d;%d;%d", bgc / 256 / 256, bgc / 256 % 256, bgc % 256);
  764. }
  765. else if (bgc != -1)
  766. {
  767. cat_sprintf(buf, ";%d", bgc);
  768. }
  769. strcat(buf, "m");
  770. pop_call();
  771. return;
  772. }
  773. int strip_vt102_strlen(struct session *ses, char *str)
  774. {
  775. char *pti;
  776. int w, i = 0;
  777. pti = str;
  778. while (*pti)
  779. {
  780. if (skip_vt102_codes(pti))
  781. {
  782. pti += skip_vt102_codes(pti);
  783. continue;
  784. }
  785. if (*pti == '\t')
  786. {
  787. i += ses->tab_width - i % ses->tab_width;
  788. pti++;
  789. }
  790. else if (HAS_BIT(ses->charset, CHARSET_FLAG_UTF8) && is_utf8_head(pti))
  791. {
  792. pti += get_utf8_width(pti, &w);
  793. i += w;
  794. }
  795. else
  796. {
  797. pti++;
  798. i++;
  799. }
  800. }
  801. return i;
  802. }
  803. int strip_vt102_width(struct session *ses, char *str, int *lines)
  804. {
  805. char *pti;
  806. int w, i = 0, max = 0;
  807. *lines = 1;
  808. pti = str;
  809. while (*pti)
  810. {
  811. if (*pti == '\n')
  812. {
  813. *lines += 1;
  814. if (i > max)
  815. {
  816. max = i;
  817. i = 0;
  818. }
  819. }
  820. if (skip_vt102_codes(pti))
  821. {
  822. pti += skip_vt102_codes(pti);
  823. continue;
  824. }
  825. if (*pti == '\t')
  826. {
  827. i += ses->tab_width - i % ses->tab_width;
  828. pti++;
  829. }
  830. else if (HAS_BIT(ses->charset, CHARSET_FLAG_UTF8) && is_utf8_head(pti))
  831. {
  832. pti += get_utf8_width(pti, &w);
  833. i += w;
  834. }
  835. else
  836. {
  837. pti++;
  838. i++;
  839. }
  840. }
  841. if (i > max)
  842. {
  843. return i;
  844. }
  845. return max;
  846. }
  847. int strip_color_strlen(struct session *ses, char *str)
  848. {
  849. char buf[BUFFER_SIZE];
  850. substitute(ses, str, buf, SUB_ESC|SUB_COL);
  851. return strip_vt102_strlen(ses, buf);
  852. }
  853. int interpret_vt102_codes(struct session *ses, char *str, int real)
  854. {
  855. char data[BUFFER_SIZE] = { 0 };
  856. int skip = 0;
  857. switch (str[skip])
  858. {
  859. case 8:
  860. ses->cur_col = UMAX(1, ses->cur_col - 1);
  861. return TRUE;
  862. case 27: /* ESC */
  863. break;
  864. case 11: /* VT */
  865. ses->cur_row = UMIN(gtd->screen->rows, ses->cur_row + 1);
  866. return TRUE;
  867. case 12: /* FF */
  868. ses->cur_row = UMIN(gtd->screen->rows, ses->cur_row + 1);
  869. return TRUE;
  870. case 13: /* CR */
  871. ses->cur_col = 1;
  872. return TRUE;
  873. default:
  874. return TRUE;
  875. }
  876. switch (str[1])
  877. {
  878. case '7':
  879. ses->sav_row = ses->cur_row;
  880. ses->sav_col = ses->cur_col;
  881. return TRUE;
  882. case '8':
  883. ses->cur_row = ses->sav_row;
  884. ses->cur_col = ses->sav_col;
  885. return TRUE;
  886. case 'c':
  887. ses->cur_row = 1;
  888. ses->cur_col = 1;
  889. ses->sav_row = ses->cur_row;
  890. ses->sav_col = ses->cur_col;
  891. return TRUE;
  892. case 'D':
  893. ses->cur_row = URANGE(1, ses->cur_row + 1, gtd->screen->rows);
  894. return TRUE;
  895. case 'E':
  896. ses->cur_row = URANGE(1, ses->cur_row + 1, gtd->screen->rows);
  897. ses->cur_col = 1;
  898. return TRUE;
  899. case 'M':
  900. ses->cur_row = URANGE(1, ses->cur_row - 1, gtd->screen->rows);
  901. return TRUE;
  902. case '[':
  903. break;
  904. default:
  905. return TRUE;
  906. }
  907. for (skip = 2 ; str[skip] != 0 ; skip++)
  908. {
  909. switch (str[skip])
  910. {
  911. case '@':
  912. case '`':
  913. case ']':
  914. return TRUE;
  915. case 'c':
  916. return FALSE;
  917. case 'A':
  918. ses->cur_row -= UMAX(1, atoi(data));
  919. break;
  920. case 'B':
  921. case 'e':
  922. ses->cur_row += UMAX(1, atoi(data));
  923. break;
  924. case 'C':
  925. case 'a':
  926. ses->cur_col += UMAX(1, atoi(data));
  927. break;
  928. case 'D':
  929. ses->cur_col -= UMAX(1, atoi(data));
  930. break;
  931. case 'E':
  932. ses->cur_row -= UMAX(1, atoi(data));
  933. ses->cur_col = 1;
  934. break;
  935. case 'F':
  936. ses->cur_row -= UMAX(1, atoi(data));
  937. ses->cur_col = 1;
  938. break;
  939. case 'G':
  940. ses->cur_col = UMAX(1, atoi(data));
  941. break;
  942. case 'H':
  943. case 'f':
  944. if (sscanf(data, "%d;%d", &ses->cur_row, &ses->cur_col) != 2)
  945. {
  946. if (sscanf(data, "%d", &ses->cur_row) == 1)
  947. {
  948. ses->cur_col = 1;
  949. }
  950. else
  951. {
  952. ses->cur_row = 1;
  953. ses->cur_col = 1;
  954. }
  955. }
  956. break;
  957. case 'd':
  958. ses->cur_row = atoi(data);
  959. break;
  960. case 'r':
  961. if (sscanf(data, "%d;%d", &ses->split->top_row, &ses->split->bot_row) != 2)
  962. {
  963. if (sscanf(data, "%d", &ses->split->top_row) != 1)
  964. {
  965. ses->split->top_row = 1;
  966. ses->split->bot_row = gtd->screen->rows;
  967. }
  968. else
  969. {
  970. ses->split->bot_row = gtd->screen->rows;
  971. }
  972. }
  973. ses->cur_row = 1;
  974. ses->cur_col = 1;
  975. break;
  976. case 's':
  977. ses->sav_row = ses->cur_row;
  978. ses->sav_col = ses->cur_col;
  979. break;
  980. case 'u':
  981. ses->cur_row = ses->sav_row;
  982. ses->cur_col = ses->sav_col;
  983. break;
  984. case 'x':
  985. return FALSE;
  986. default:
  987. data[skip - 2] = str[skip];
  988. data[skip - 1] = 0;
  989. break;
  990. }
  991. if (isalpha((int) str[skip]))
  992. {
  993. ses->cur_row = URANGE(1, ses->cur_row, gtd->screen->rows);
  994. ses->cur_col = URANGE(1, ses->cur_col, gtd->screen->cols + 1);
  995. ses->split->top_row = URANGE(1, ses->split->top_row, gtd->screen->rows);
  996. ses->split->bot_row = ses->split->bot_row ? URANGE(1, ses->split->bot_row, gtd->screen->rows) : gtd->screen->rows;
  997. return TRUE;
  998. }
  999. }
  1000. return TRUE;
  1001. }