buffer.c 22 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153
  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_buffer(struct session *ses, int size)
  26. {
  27. int cnt;
  28. push_call("init_buffer(%p,%p)",ses,size);
  29. if (size && size == ses->scroll->size)
  30. {
  31. pop_call();
  32. return;
  33. }
  34. if (ses->scroll->buffer)
  35. {
  36. for (cnt = 0 ; cnt < ses->scroll->used ; cnt++)
  37. {
  38. free(ses->scroll->buffer[cnt]->str);
  39. free(ses->scroll->buffer[cnt]);
  40. }
  41. free(ses->scroll->buffer);
  42. }
  43. if (ses->scroll->input)
  44. {
  45. str_free(ses->scroll->input);
  46. }
  47. if (size)
  48. {
  49. ses->scroll->buffer = (struct buffer_data **) calloc(size, sizeof(struct buffer_data *));
  50. ses->scroll->input = str_dup("");
  51. ses->scroll->size = size;
  52. ses->scroll->used = 0;
  53. ses->scroll->wrap = get_scroll_cols(ses);
  54. add_line_buffer(ses, "", 0);
  55. ses->scroll->line = -1;
  56. }
  57. else
  58. {
  59. free(ses->scroll);
  60. }
  61. pop_call();
  62. return;
  63. }
  64. void check_buffer(struct session *ses)
  65. {
  66. struct buffer_data *buffer;
  67. char temp[STRING_SIZE];
  68. int index, wrap;
  69. push_call("check_buffer(%p)",ses);
  70. if (!HAS_BIT(ses->scroll->flags, SCROLL_FLAG_RESIZE))
  71. {
  72. pop_call();
  73. return;
  74. }
  75. DEL_BIT(ses->scroll->flags, SCROLL_FLAG_RESIZE);
  76. wrap = get_scroll_cols(ses);
  77. for (index = ses->scroll->used - 1 ; index > 0 ; index--)
  78. {
  79. buffer = ses->scroll->buffer[index];
  80. if (buffer->height == 1 && buffer->width < wrap - 1)
  81. {
  82. buffer->height = buffer->lines;
  83. }
  84. else
  85. {
  86. buffer->lines = word_wrap_split(ses, buffer->str, temp, wrap, 0, 0, FLAG_NONE, &buffer->height, &buffer->width);
  87. }
  88. }
  89. ses->scroll->wrap = wrap;
  90. ses->scroll->time = gtd->time;
  91. ses->scroll->base = 0;
  92. ses->scroll->line = -1;
  93. pop_call();
  94. return;
  95. }
  96. void add_line_buffer(struct session *ses, char *line, int prompt)
  97. {
  98. char temp[STRING_SIZE];
  99. char *pti, *pto;
  100. int cnt, purge;
  101. int cur_row, cur_col, top_row, bot_row;
  102. struct buffer_data *buffer;
  103. push_call("add_line_buffer(%p,%s,%d)",ses,line,prompt);
  104. if (gtd->level->scroll)
  105. {
  106. pop_call();
  107. return;
  108. }
  109. if (HAS_BIT(ses->flags, SES_FLAG_CONVERTMETA))
  110. {
  111. convert_meta(line, temp, TRUE);
  112. line = temp;
  113. }
  114. cur_row = ses->cur_row;
  115. cur_col = ses->cur_col;
  116. top_row = ses->split->top_row;
  117. bot_row = ses->split->bot_row;
  118. if (str_len(ses->scroll->input) + strlen(line) + 100 >= BUFFER_SIZE)
  119. {
  120. str_cat_printf(&ses->scroll->input, "\n\e[1;31m#BUFFER: LINE LENGTH OF (%d) EXEEDS MAXIMUM SIZE OF (%d)%s\n", str_len(ses->scroll->input) + strlen(line), BUFFER_SIZE, COLOR_TEXT);
  121. }
  122. else
  123. {
  124. if (prompt == TRUE)
  125. {
  126. str_cat(&ses->scroll->input, line);
  127. pop_call();
  128. return;
  129. }
  130. else
  131. {
  132. str_cat(&ses->scroll->input, line);
  133. }
  134. }
  135. pti = pto = ses->scroll->input;
  136. while (*pti != 0)
  137. {
  138. while (skip_vt102_codes_non_graph(pti))
  139. {
  140. interpret_vt102_codes(ses, pti, FALSE);
  141. pti += skip_vt102_codes_non_graph(pti);
  142. }
  143. if (*pti == 0)
  144. {
  145. break;
  146. }
  147. if (SCROLL(ses))
  148. {
  149. *pto++ = *pti++;
  150. }
  151. else
  152. {
  153. pti++;
  154. }
  155. }
  156. *pto = 0;
  157. if (HAS_BIT(ses->flags, SES_FLAG_SNOOP) && ses != gtd->ses)
  158. {
  159. tintin_printf2(gtd->ses, "%s[%s%s] %s", COLOR_TEXT, ses->name, ses->scroll->input, COLOR_TEXT);
  160. }
  161. ses->scroll->buffer[ses->scroll->used] = calloc(1, sizeof(struct buffer_data));
  162. buffer = ses->scroll->buffer[ses->scroll->used];
  163. buffer->lines = word_wrap_split(ses, ses->scroll->input, temp, ses->wrap, 0, 0, FLAG_NONE, &buffer->height, &buffer->width);
  164. buffer->time = gtd->time;
  165. buffer->str = strdup(ses->scroll->input);
  166. if (gtd->level->grep || prompt == -1)
  167. {
  168. SET_BIT(buffer->flags, BUFFER_FLAG_GREP);
  169. }
  170. ses->scroll->used++;
  171. str_cpy(&ses->scroll->input, "");
  172. if (!HAS_BIT(ses->logmode, LOG_FLAG_LOW))
  173. {
  174. if (ses->logfile)
  175. {
  176. logit(ses, temp, ses->logfile, LOG_FLAG_LINEFEED);
  177. }
  178. }
  179. if (gtd->chat)
  180. {
  181. chat_forward_session(ses, temp);
  182. }
  183. if (ses->scroll->used == ses->scroll->size)
  184. {
  185. if (ses->scroll->size < 100000)
  186. {
  187. purge = ses->scroll->size / 10;
  188. }
  189. else
  190. {
  191. purge = 10000;
  192. }
  193. for (cnt = 0 ; cnt < purge ; cnt++)
  194. {
  195. free(ses->scroll->buffer[cnt]->str);
  196. free(ses->scroll->buffer[cnt]);
  197. }
  198. memmove(&ses->scroll->buffer[0], &ses->scroll->buffer[purge], (ses->scroll->size - purge) * sizeof(struct buffer_data *));
  199. ses->scroll->used -= purge;
  200. ses->scroll->line = URANGE(-1, ses->scroll->line - purge, ses->scroll->used - 1);
  201. }
  202. ses->cur_row = cur_row;
  203. ses->cur_col = cur_col;
  204. ses->split->top_row = top_row;
  205. ses->split->bot_row = bot_row;
  206. pop_call();
  207. return;
  208. }
  209. void buffer_print(struct session *ses, int index, int start, int end)
  210. {
  211. struct buffer_data *buffer;
  212. char *pti, temp[STRING_SIZE];
  213. int col, swap, raw_len, str_len, col_len, height, width;
  214. push_call("buffer_print(%p,%d,%d,%d)",ses,index,start,end);
  215. col_len = get_scroll_cols(ses);
  216. if (start == 0 && end == 0)
  217. {
  218. if (HAS_BIT(ses->flags, SES_FLAG_PRINTBUFFER) || ses->scroll->line == ses->scroll->used - 1)
  219. {
  220. pti = ses->scroll->input;
  221. raw_len = string_str_raw_len(ses, pti, 0, col_len - 1);
  222. }
  223. else
  224. {
  225. pti = temp;
  226. raw_len = temp[0] = 0;
  227. }
  228. if (ses->cur_row != ses->split->bot_row)
  229. {
  230. print_stdout("%02d \e[1;32mmisaligned (%d)", ses->cur_row, ses->scroll->line);
  231. }
  232. else
  233. {
  234. // print_stdout("\e[1;36m%02d\e[0m", ses->cur_row);//
  235. print_stdout("\e[%dX%.*s", col_len, raw_len, pti);
  236. }
  237. }
  238. else
  239. {
  240. buffer = ses->scroll->buffer[index];
  241. if (buffer->height == 1)
  242. {
  243. // print_stdout("\e[1;37m%02d", ses->cur_row);//
  244. word_wrap_split(ses, buffer->str, temp, ses->wrap, start, end, 0, &height, &width);
  245. print_stdout("%s", temp);
  246. erase_cols(col_len - buffer->width);
  247. goto_pos(ses, ++ses->cur_row, ses->split->top_col);
  248. }
  249. else
  250. {
  251. word_wrap_split(ses, buffer->str, temp, ses->wrap, start, end, WRAP_FLAG_SPLIT, &height, &width);
  252. pti = temp;
  253. col = 0;
  254. while (TRUE)
  255. {
  256. if (pti[col] == '\n' || pti[col] == 0)
  257. {
  258. swap = pti[col];
  259. pti[col] = 0;
  260. str_len = strip_vt102_strlen(ses, pti);
  261. // debug info
  262. /* if (start == 0)
  263. {
  264. if (end == buffer->height)
  265. {
  266. print_stdout("\e[1;31m%02d\e[0m(%d)(%d)(%d)", ses->cur_row, buffer->lines, buffer->height, buffer->width);
  267. }
  268. else
  269. {
  270. print_stdout("\e[1;33m%02d\e[0m", ses->cur_row);
  271. }
  272. }
  273. else
  274. {
  275. if (end == buffer->height)
  276. {
  277. print_stdout("\e[1;32m%02d\e[0m", ses->cur_row);
  278. }
  279. else
  280. {
  281. print_stdout("\e[1;34m%02d\e[0m", ses->cur_row);
  282. }
  283. }
  284. */
  285. print_stdout("%s", pti);
  286. erase_cols(col_len - str_len);
  287. pti += col + 1;
  288. col = 0;
  289. goto_pos(ses, ++ses->cur_row, ses->split->top_col);
  290. if (swap == 0)
  291. {
  292. break;
  293. }
  294. continue;
  295. }
  296. col++;
  297. }
  298. }
  299. }
  300. pop_call();
  301. return;
  302. }
  303. int show_buffer(struct session *ses)
  304. {
  305. int scroll_size, scroll_cnt, scroll_tmp, scroll_add, scroll_cut, start, end;
  306. if (ses != gtd->ses)
  307. {
  308. return TRUE;
  309. }
  310. push_call("show_buffer(%p)",ses);
  311. check_buffer(ses);
  312. scroll_size = get_scroll_rows(ses);
  313. scroll_add = 0;
  314. scroll_cnt = URANGE(0, ses->scroll->line, ses->scroll->used - 1);
  315. scroll_cut = 0;
  316. if (ses->scroll->base)
  317. {
  318. scroll_add -= ses->scroll->base;
  319. }
  320. // scroll_cut is cut from top line
  321. while (TRUE)
  322. {
  323. scroll_tmp = ses->scroll->buffer[scroll_cnt]->height;
  324. if (scroll_add + scroll_tmp >= scroll_size)
  325. {
  326. if (scroll_add + scroll_tmp == scroll_size)
  327. {
  328. scroll_add += scroll_tmp;
  329. }
  330. else
  331. {
  332. scroll_cut = scroll_size - scroll_add;
  333. }
  334. break;
  335. }
  336. scroll_add += scroll_tmp;
  337. if (scroll_cnt == 0) // home
  338. {
  339. erase_scroll_region(ses);
  340. break;
  341. }
  342. scroll_cnt--;
  343. }
  344. save_pos(ses);
  345. if (scroll_cnt == 0) // home
  346. {
  347. goto_pos(ses, ses->split->bot_row - scroll_add, ses->split->top_col);
  348. }
  349. else
  350. {
  351. goto_pos(ses, ses->split->top_row, ses->split->top_col);
  352. }
  353. if (IS_SPLIT(ses))
  354. {
  355. SET_BIT(ses->flags, SES_FLAG_READMUD);
  356. }
  357. // scroll_cut is taken from top line
  358. // scroll_base is taken from the bot line
  359. if (scroll_cut)
  360. {
  361. scroll_tmp = ses->scroll->buffer[scroll_cnt]->height;
  362. // bottom
  363. if (scroll_cut == scroll_size)
  364. {
  365. start = scroll_tmp - scroll_cut;
  366. end = scroll_tmp;
  367. if (end - start != scroll_size)
  368. {
  369. // print_stdout("\e[1;32mcnt %d, base: %d, size: %d, add %d, tmp %d, scroll_cut %d start %d end %d\n", scroll_cnt, ses->scroll->base, scroll_size, scroll_add, scroll_tmp, scroll_cut, start, end);
  370. }
  371. else
  372. {
  373. buffer_print(ses, scroll_cnt, start, end);
  374. }
  375. }
  376. // middle chunk
  377. else if (scroll_cut > scroll_size)
  378. {
  379. start = scroll_tmp - scroll_cut;
  380. end = scroll_tmp - scroll_cut + scroll_size;
  381. // if (end - start > scroll_size)
  382. {
  383. // print_stdout("\e[1;1H\e[1;33mcnt %d, base: %d, size: %d, add %d, tmp %d, scroll_cut %d start %d end %d\n", scroll_cnt, ses->scroll->base, scroll_size, scroll_add, scroll_tmp, scroll_cut, start, end);
  384. }
  385. // else
  386. {
  387. buffer_print(ses, scroll_cnt, start, end);
  388. }
  389. goto eof;
  390. }
  391. // top chunk
  392. else if (scroll_add == 0)
  393. {
  394. start = ses->scroll->base;
  395. end = scroll_tmp - scroll_cut;
  396. // if (end - start > scroll_size)
  397. {
  398. // print_stdout("\e[1;1H\e[1;34mcnt %d, base: %d, size: %d, add %d, tmp %d, scroll_cut %d start %d end %d\n", scroll_cnt, ses->scroll->base, scroll_size, scroll_add, scroll_tmp, scroll_cut, start, end);
  399. }
  400. // else
  401. {
  402. buffer_print(ses, scroll_cnt, start, end);
  403. }
  404. goto eof;
  405. }
  406. // bot chunk
  407. else
  408. {
  409. start = scroll_tmp - scroll_cut;
  410. end = scroll_tmp;
  411. // if (end - start > scroll_size)
  412. {
  413. // print_stdout("\e[1;1H\e[1;35mcnt %d, base: %d, size: %d, add %d, tmp %d, scroll_cut %d start %d end %d\n", scroll_cnt, ses->scroll->base, scroll_size, scroll_add, scroll_tmp, scroll_cut, start, end);
  414. }
  415. // else
  416. {
  417. buffer_print(ses, scroll_cnt, start, end);
  418. }
  419. }
  420. scroll_cnt++;
  421. scroll_cut = 0;
  422. }
  423. while (TRUE)
  424. {
  425. if (scroll_cnt == ses->scroll->used)
  426. {
  427. break;
  428. }
  429. scroll_tmp = ses->scroll->buffer[scroll_cnt]->height;
  430. if (scroll_add - scroll_tmp < 0)
  431. {
  432. break;
  433. }
  434. scroll_add -= scroll_tmp;
  435. start = 0;
  436. end = scroll_tmp;
  437. buffer_print(ses, scroll_cnt, start, end);
  438. scroll_cnt++;
  439. }
  440. if (scroll_cnt < ses->scroll->used && ses->scroll->base)
  441. {
  442. scroll_tmp = ses->scroll->buffer[scroll_cnt]->height;
  443. start = 0;
  444. end = scroll_tmp - ses->scroll->base;
  445. buffer_print(ses, scroll_cnt, start, end);
  446. }
  447. eof:
  448. // prompt
  449. buffer_print(ses, 0, 0, 0);
  450. restore_pos(ses);
  451. if (IS_SPLIT(ses))
  452. {
  453. DEL_BIT(ses->flags, SES_FLAG_READMUD);
  454. }
  455. pop_call();
  456. return TRUE;
  457. }
  458. DO_COMMAND(do_buffer)
  459. {
  460. char arg1[BUFFER_SIZE];
  461. int cnt;
  462. arg = get_arg_in_braces(ses, arg, arg1, GET_ONE);
  463. check_buffer(ses);
  464. if (*arg1 == 0)
  465. {
  466. tintin_header(ses, " BUFFER OPTIONS ");
  467. for (cnt = 0 ; *buffer_table[cnt].name != 0 ; cnt++)
  468. {
  469. tintin_printf2(ses, " [%-13s] %s", buffer_table[cnt].name, buffer_table[cnt].desc);
  470. }
  471. tintin_header(ses, "");
  472. return ses;
  473. }
  474. for (cnt = 0 ; *buffer_table[cnt].name ; cnt++)
  475. {
  476. if (!is_abbrev(arg1, buffer_table[cnt].name))
  477. {
  478. continue;
  479. }
  480. buffer_table[cnt].fun(ses, arg);
  481. return ses;
  482. }
  483. do_buffer(ses, "");
  484. return ses;
  485. }
  486. DO_BUFFER(buffer_clear)
  487. {
  488. int cnt;
  489. for (cnt = 1 ; cnt < ses->scroll->used ; cnt++)
  490. {
  491. free(ses->scroll->buffer[cnt]->str);
  492. free(ses->scroll->buffer[cnt]);
  493. }
  494. ses->scroll->used = 1;
  495. ses->scroll->line = - 1;
  496. }
  497. DO_BUFFER(buffer_up)
  498. {
  499. char arg1[BUFFER_SIZE];
  500. int scroll_size;
  501. check_buffer(ses);
  502. if (ses->scroll->line == -1)
  503. {
  504. ses->scroll->line = ses->scroll->used - 1;
  505. ses->scroll->base = 0;
  506. }
  507. arg = sub_arg_in_braces(ses, arg, arg1, GET_ONE, SUB_VAR|SUB_FUN);
  508. if (is_math(ses, arg1))
  509. {
  510. scroll_size = URANGE(1, get_number(ses, arg1), get_scroll_rows(ses));
  511. }
  512. else
  513. {
  514. scroll_size = get_scroll_rows(ses);
  515. }
  516. while (scroll_size)
  517. {
  518. scroll_size--;
  519. ses->scroll->base++;
  520. if (ses->scroll->base == ses->scroll->buffer[ses->scroll->line]->height)
  521. {
  522. if (ses->scroll->line == 0)
  523. {
  524. ses->scroll->line = 0;
  525. ses->scroll->base = 0;
  526. return;
  527. }
  528. ses->scroll->line--;
  529. ses->scroll->base = 0;
  530. }
  531. }
  532. show_buffer(ses);
  533. return;
  534. }
  535. DO_BUFFER(buffer_down)
  536. {
  537. char arg1[BUFFER_SIZE];
  538. int scroll_size;
  539. if (ses->scroll->line == -1)
  540. {
  541. return;
  542. }
  543. check_buffer(ses);
  544. arg = sub_arg_in_braces(ses, arg, arg1, GET_ONE, SUB_VAR|SUB_FUN);
  545. if (is_math(ses, arg1))
  546. {
  547. scroll_size = URANGE(1, get_number(ses, arg1), get_scroll_rows(ses));
  548. }
  549. else
  550. {
  551. scroll_size = get_scroll_rows(ses);
  552. }
  553. while (scroll_size)
  554. {
  555. scroll_size--;
  556. if (ses->scroll->base == 0)
  557. {
  558. if (++ses->scroll->line == ses->scroll->used)
  559. {
  560. buffer_end(ses, "");
  561. return;
  562. }
  563. ses->scroll->base = ses->scroll->buffer[ses->scroll->line]->height;
  564. }
  565. ses->scroll->base--;
  566. }
  567. show_buffer(ses);
  568. }
  569. DO_BUFFER(buffer_home)
  570. {
  571. check_buffer(ses);
  572. ses->scroll->line = 0;
  573. ses->scroll->base = 0;
  574. buffer_down(ses, "");
  575. }
  576. DO_BUFFER(buffer_end)
  577. {
  578. check_buffer(ses);
  579. ses->scroll->line = ses->scroll->used - 1;
  580. ses->scroll->base = 0;
  581. show_buffer(ses);
  582. ses->scroll->line = -1;
  583. }
  584. DO_BUFFER(buffer_lock)
  585. {
  586. char arg1[BUFFER_SIZE];
  587. check_buffer(ses);
  588. sub_arg_in_braces(ses, arg, arg1, GET_ONE, SUB_VAR|SUB_FUN);
  589. if (!strcasecmp(arg1, "ON"))
  590. {
  591. ses->scroll->line = ses->scroll->used + 1;
  592. }
  593. else if (!strcasecmp(arg1, "OFF"))
  594. {
  595. buffer_end(ses, "");
  596. }
  597. else
  598. {
  599. if (ses->scroll->line == -1)
  600. {
  601. ses->scroll->line = ses->scroll->used + 1;
  602. }
  603. else
  604. {
  605. buffer_end(ses, "");
  606. }
  607. }
  608. }
  609. DO_BUFFER(buffer_find)
  610. {
  611. char arg1[BUFFER_SIZE], arg2[BUFFER_SIZE];
  612. int scroll_cnt, grep_cnt, grep_max, page;
  613. check_buffer(ses);
  614. grep_cnt = grep_max = scroll_cnt = 0;
  615. arg = sub_arg_in_braces(ses, arg, arg1, GET_ONE, SUB_VAR|SUB_FUN);
  616. if (*arg1 == 0)
  617. {
  618. show_error(gtd->ses, LIST_COMMAND, "#BUFFER, FIND WHAT?");
  619. return;
  620. }
  621. if (is_math(ses, arg1))
  622. {
  623. page = get_number(ses, arg1);
  624. arg = sub_arg_in_braces(ses, arg, arg2, GET_ALL, SUB_VAR|SUB_FUN);
  625. if (*arg2 == 0)
  626. {
  627. show_error(gtd->ses, LIST_COMMAND, "#BUFFER, FIND OCCURANCE %d OF WHAT?", page);
  628. return;
  629. }
  630. }
  631. else
  632. {
  633. page = 1;
  634. strcpy(arg2, arg1);
  635. }
  636. if (page > 0)
  637. {
  638. for (scroll_cnt = ses->scroll->used - 1; scroll_cnt ; scroll_cnt--)
  639. {
  640. if (HAS_BIT(ses->scroll->buffer[scroll_cnt]->flags, BUFFER_FLAG_GREP))
  641. {
  642. continue;
  643. }
  644. if (find(ses, ses->scroll->buffer[scroll_cnt]->str, arg2, SUB_NONE, REGEX_FLAG_NONE))
  645. {
  646. grep_cnt++;
  647. if (grep_cnt == page)
  648. {
  649. break;
  650. }
  651. }
  652. }
  653. }
  654. else
  655. {
  656. for (scroll_cnt = 0 ; scroll_cnt < ses->scroll->used ; scroll_cnt++)
  657. {
  658. if (HAS_BIT(ses->scroll->buffer[scroll_cnt]->flags, BUFFER_FLAG_GREP))
  659. {
  660. continue;
  661. }
  662. if (find(ses, ses->scroll->buffer[scroll_cnt]->str, arg2, SUB_NONE, REGEX_FLAG_NONE))
  663. {
  664. grep_cnt--;
  665. if (grep_cnt == page)
  666. {
  667. break;
  668. }
  669. }
  670. }
  671. }
  672. if (scroll_cnt < 0 || scroll_cnt >= ses->scroll->used)
  673. {
  674. show_error(gtd->ses, LIST_COMMAND, "#BUFFER FIND, NO MATCHES FOUND.");
  675. return;
  676. }
  677. ses->scroll->line = scroll_cnt;
  678. show_buffer(ses);
  679. return;
  680. }
  681. DO_BUFFER(buffer_get)
  682. {
  683. char arg1[BUFFER_SIZE], arg2[BUFFER_SIZE], arg3[BUFFER_SIZE];
  684. int cnt, min, max;
  685. check_buffer(ses);
  686. arg = sub_arg_in_braces(ses, arg, arg1, GET_NST, SUB_NONE);
  687. if (*arg1 == 0)
  688. {
  689. show_error(ses, LIST_COMMAND, "#SYNTAX: #BUFFER GET <VARIABLE> [LOWER BOUND] [UPPER BOUND]");
  690. return;
  691. }
  692. arg = sub_arg_in_braces(ses, arg, arg2, GET_ONE, SUB_VAR|SUB_FUN);
  693. arg = sub_arg_in_braces(ses, arg, arg3, GET_ONE, SUB_VAR|SUB_FUN);
  694. min = get_number(ses, arg2);
  695. if (min < 0)
  696. {
  697. min = ses->scroll->used + min;
  698. }
  699. min = URANGE(1, min, ses->scroll->used - 1);
  700. if (*arg3 == 0)
  701. {
  702. set_nest_node_ses(ses, arg1, "%s", ses->scroll->buffer[min]->str);
  703. return;
  704. }
  705. max = get_number(ses, arg3);
  706. if (max < 0)
  707. {
  708. max = ses->scroll->used + max;
  709. }
  710. max = URANGE(1, max, ses->scroll->used - 1);
  711. if (min > max)
  712. {
  713. show_error(ses, LIST_COMMAND, "#ERROR: #BUFFER GET {%s} {%d} {%d} LOWER BOUND EXCEEDS UPPER BOUND.", arg1, min, max);
  714. return;
  715. }
  716. cnt = 0;
  717. set_nest_node_ses(ses, arg1, "");
  718. while (min <= max)
  719. {
  720. sprintf(arg2, "%s[%d]", arg1, ++cnt);
  721. set_nest_node_ses(ses, arg2, "%s", ses->scroll->buffer[min++]->str);
  722. }
  723. show_message(ses, LIST_COMMAND, "#BUFFER GET: %d LINES SAVED TO {%s}.", cnt, arg1);
  724. return;
  725. }
  726. DO_BUFFER(buffer_write)
  727. {
  728. FILE *fp;
  729. char arg1[BUFFER_SIZE], out[STRING_SIZE];
  730. int cnt;
  731. check_buffer(ses);
  732. arg = sub_arg_in_braces(ses, arg, arg1, GET_ONE, SUB_VAR|SUB_FUN);
  733. if (*arg1 == 0)
  734. {
  735. show_error(ses, LIST_COMMAND, "#SYNTAX: #BUFFER WRITE <FILENAME>]");
  736. }
  737. else
  738. {
  739. if ((fp = fopen(arg1, "w")))
  740. {
  741. show_message(ses, LIST_COMMAND, "#OK: WRITING BUFFER TO '%s'.", arg1);
  742. loginit(ses, fp, ses->logmode + LOG_FLAG_OVERWRITE);
  743. for (cnt = 0 ; cnt < ses->scroll->used ; cnt++)
  744. {
  745. if (HAS_BIT(ses->logmode, LOG_FLAG_PLAIN))
  746. {
  747. strip_vt102_codes(ses->scroll->buffer[cnt]->str, out);
  748. }
  749. else if (HAS_BIT(ses->logmode, LOG_FLAG_HTML))
  750. {
  751. vt102_to_html(ses, ses->scroll->buffer[cnt]->str, out);
  752. }
  753. else
  754. {
  755. strcpy(out, ses->scroll->buffer[cnt]->str);
  756. }
  757. fprintf(fp, "%s\n", out);
  758. }
  759. fclose(fp);
  760. }
  761. else
  762. {
  763. show_error(ses, LIST_COMMAND, "#ERROR: #BUFFER WRITE {%s} - FAILED TO OPEN FILE.", arg1);
  764. }
  765. }
  766. return;
  767. }
  768. DO_BUFFER(buffer_info)
  769. {
  770. int index, memory;
  771. check_buffer(ses);
  772. tintin_printf2(ses, "Scroll row: %d", ses->scroll->used);
  773. tintin_printf2(ses, "Scroll max: %d", ses->scroll->size);
  774. tintin_printf2(ses, "Scroll line: %d", ses->scroll->line);
  775. tintin_printf2(ses, "Scroll base: %d", ses->scroll->base);
  776. tintin_printf2(ses, "Scroll wrap: %d", ses->scroll->wrap);
  777. tintin_printf2(ses, "");
  778. memory = 0;
  779. for (index = 0 ; index < ses->scroll->used ; index++)
  780. {
  781. memory += sizeof(struct buffer_data) + strlen(ses->scroll->buffer[index]->str);
  782. }
  783. tintin_printf2(ses, "Memory use: %d", memory);
  784. }
  785. DO_COMMAND(do_grep)
  786. {
  787. char arg1[BUFFER_SIZE], arg2[BUFFER_SIZE];
  788. int scroll_cnt, grep_cnt, grep_min, grep_max, grep_add, page;
  789. check_buffer(ses);
  790. grep_cnt = grep_add = scroll_cnt = grep_min = 0;
  791. grep_max = ses->split->bot_row - ses->split->top_row - 2;
  792. arg = sub_arg_in_braces(ses, arg, arg1, GET_ONE, SUB_VAR|SUB_FUN);
  793. if (*arg1 == 0)
  794. {
  795. show_error(ses, LIST_COMMAND, "#SYNTAX: GREP [#] <SEARCH TEXT>");
  796. return ses;
  797. }
  798. if (is_math(ses, arg1))
  799. {
  800. page = get_number(ses, arg1);
  801. arg = get_arg_in_braces(ses, arg, arg2, GET_ALL);
  802. if (*arg2 == 0)
  803. {
  804. show_error(ses, LIST_COMMAND, "#SYNTAX: #grep {%s} <SEARCH TEXT>", arg1);
  805. return ses;
  806. }
  807. }
  808. else
  809. {
  810. page = 1;
  811. strcpy(arg2, arg1);
  812. }
  813. if (page > 0)
  814. {
  815. grep_min = grep_max * page - grep_max;
  816. grep_max = grep_max * page;
  817. }
  818. else
  819. {
  820. grep_min = grep_max * (page * -1) - grep_max;
  821. grep_max = grep_max * (page * -1);
  822. }
  823. gtd->level->grep++;
  824. tintin_header(ses, " GREPPING PAGE %d FOR %s ", page, arg2);
  825. if (page > 0)
  826. {
  827. for (scroll_cnt = ses->scroll->used - 1 ; scroll_cnt > 0 ; scroll_cnt--)
  828. {
  829. if (HAS_BIT(ses->scroll->buffer[scroll_cnt]->flags, BUFFER_FLAG_GREP))
  830. {
  831. continue;
  832. }
  833. if (find(ses, ses->scroll->buffer[scroll_cnt]->str, arg2, SUB_NONE, REGEX_FLAG_NONE))
  834. {
  835. grep_add = ses->scroll->buffer[scroll_cnt]->height;
  836. if (grep_cnt + grep_add > grep_max)
  837. {
  838. break;
  839. }
  840. grep_cnt += grep_add;
  841. }
  842. }
  843. if (grep_cnt <= grep_min)
  844. {
  845. show_error(ses, LIST_COMMAND, "#NO MATCHES FOUND.");
  846. gtd->level->grep--;
  847. return ses;
  848. }
  849. while (++scroll_cnt < ses->scroll->used)
  850. {
  851. if (HAS_BIT(ses->scroll->buffer[scroll_cnt]->flags, BUFFER_FLAG_GREP))
  852. {
  853. continue;
  854. }
  855. if (find(ses, ses->scroll->buffer[scroll_cnt]->str, arg2, SUB_NONE, REGEX_FLAG_NONE))
  856. {
  857. grep_add = ses->scroll->buffer[scroll_cnt]->height;
  858. if (grep_cnt - grep_add < grep_min)
  859. {
  860. break;
  861. }
  862. grep_cnt -= grep_add;
  863. tintin_puts2(ses, ses->scroll->buffer[scroll_cnt]->str);
  864. }
  865. }
  866. }
  867. else
  868. {
  869. for (scroll_cnt = 0 ; scroll_cnt < ses->scroll->used ; scroll_cnt++)
  870. {
  871. if (HAS_BIT(ses->scroll->buffer[scroll_cnt]->flags, BUFFER_FLAG_GREP))
  872. {
  873. continue;
  874. }
  875. if (find(ses, ses->scroll->buffer[scroll_cnt]->str, arg2, SUB_NONE, REGEX_FLAG_NONE))
  876. {
  877. grep_add = ses->scroll->buffer[scroll_cnt]->height;
  878. if (grep_cnt + grep_add >= grep_min)
  879. {
  880. grep_cnt += grep_add;
  881. tintin_puts2(ses, ses->scroll->buffer[scroll_cnt]->str);
  882. if (grep_cnt + grep_add > grep_max)
  883. {
  884. break;
  885. }
  886. }
  887. }
  888. }
  889. if (grep_cnt == 0)
  890. {
  891. show_error(ses, LIST_COMMAND, "#NO MATCHES FOUND.");
  892. gtd->level->grep--;
  893. return ses;
  894. }
  895. }
  896. tintin_header(ses, "");
  897. gtd->level->grep--;
  898. return ses;
  899. }