buffer.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319
  1. /* buffer.c, Ait Emacs, Kevin Bloom, Public Domain, 2023-2024 */
  2. #include <assert.h>
  3. #include <string.h>
  4. #include "header.h"
  5. #include "termbox.h"
  6. /* list of keywords _must_ end with NULL */
  7. keywords_t keywords[] = {
  8. /* programming */
  9. {".c", "//", "/*", "*/", FALSE, FALSE},
  10. {".h", "//", "/*", "*/", FALSE, FALSE},
  11. {".css", "//", "/*", "*/", FALSE, FALSE},
  12. {".html", "", "<!--", "-->", FALSE, FALSE},
  13. {".js", "//", "/*", "*/", TRUE, TRUE},
  14. {".jsx", "//", "/*", "*/", TRUE, TRUE},
  15. {".ts", "//", "/*", "*/", TRUE, TRUE},
  16. {".tsx", "//", "/*", "*/", TRUE, TRUE},
  17. {".lisp", ";;", NULL, NULL, FALSE, FALSE},
  18. {".clj", ";;", NULL, NULL, FALSE, FALSE},
  19. {".cljs", ";;", NULL, NULL, FALSE, FALSE},
  20. {".joke", ";;", NULL, NULL, FALSE, FALSE},
  21. {".hs", "--", NULL, NULL, FALSE, FALSE},
  22. {".sh", "#", NULL, NULL, FALSE, FALSE},
  23. {".awk", "#", NULL, NULL, FALSE, FALSE},
  24. {".java", "//", "/*", "*/", FALSE, FALSE},
  25. {".sql", "--", NULL, NULL, FALSE, FALSE},
  26. {".nix", "#", NULL, NULL, TRUE, TRUE},
  27. /* non-programming */
  28. {".md", "#", NULL, NULL, FALSE, TRUE},
  29. {"NULL", NULL, NULL, NULL, FALSE, FALSE },
  30. };
  31. void buffer_init(buffer_t *bp)
  32. {
  33. bp->b_mark = NOMARK;
  34. bp->b_pmark[0] = NOMARK;
  35. bp->b_pmark[1] = NOMARK;
  36. bp->b_pmark[2] = NOMARK;
  37. bp->b_pmark[3] = NOMARK;
  38. bp->b_pmark[4] = NOMARK;
  39. bp->b_point = 0;
  40. bp->b_cpoint = 0;
  41. bp->b_opoint = 0;
  42. bp->b_page = 0;
  43. bp->b_epage = 0;
  44. bp->b_reframe = 0;
  45. bp->b_size = 0;
  46. bp->b_psize = 0;
  47. bp->b_flags = 0;
  48. bp->b_cnt = 0;
  49. bp->b_buf = NULL;
  50. bp->b_ebuf = NULL;
  51. bp->b_gap = NULL;
  52. bp->b_egap = NULL;
  53. bp->b_next = NULL;
  54. bp->b_fname[0] = '\0';
  55. bp->b_fmtime = 0;
  56. bp->b_bname[0] = '\0';
  57. bp->b_path = TRUE;
  58. bp->b_undo = NULL;
  59. bp->b_redo = NULL;
  60. bp->b_keywords = NULL;
  61. bp->b_line = 1;
  62. }
  63. /* Find a buffer by filename or create if requested */
  64. buffer_t* find_buffer (char *fname, int cflag)
  65. {
  66. buffer_t *bp = NULL;
  67. buffer_t *ebp = NULL;
  68. buffer_t *sb = NULL;
  69. keywords_t *k;
  70. char filepath[PATH_MAX];
  71. int len, extlen, c = 0;
  72. int match = FALSE, i = 1;
  73. strcpy(filepath, fname);
  74. bp = bheadp;
  75. lastbp = curbp;
  76. while (bp != NULL) {
  77. if (strcmp (fname, bp->b_fname) == 0 || strcmp(fname, bp->b_bname) == 0) {
  78. return (bp);
  79. }
  80. bp = bp->b_next;
  81. }
  82. if (cflag != FALSE) {
  83. if ((bp = (buffer_t *) malloc (sizeof (buffer_t))) == NULL)
  84. return (0);
  85. buffer_init(bp);
  86. assert(bp != NULL);
  87. if(filepath[0] != '\0') {
  88. strcpy(bp->b_fname, fname);
  89. modify_buffer_name(bp, 0);
  90. bp->b_fname[0] = '\0';
  91. for (c = 0, ebp = bheadp; ebp != NULL; ebp = ebp->b_next, c++) {
  92. while((match = compare_buffer_name(bp, ebp)) == TRUE && i < 20) {
  93. strcpy(bp->b_fname, fname);
  94. modify_buffer_name(bp, i);
  95. bp->b_fname[0] = '\0';
  96. modify_buffer_name(ebp, i);
  97. i++;
  98. }
  99. if(match) break;
  100. i = 1;
  101. }
  102. bp->b_bname[strlen(bp->b_bname)] = '\0';
  103. for(k = keywords; k->slc != NULL; ++k) {
  104. len = strlen(bp->b_bname);
  105. extlen = strlen(k->extension) - 1;
  106. c = 0;
  107. for(int f = len - 1 - extlen; c <= extlen; f++, c++) {
  108. if(bp->b_bname[f] != k->extension[c]) {
  109. c = 0;
  110. break;
  111. }
  112. }
  113. if(c > 0) {
  114. bp->b_keywords = k;
  115. break;
  116. }
  117. }
  118. }
  119. /* find the place in the list to insert this buffer */
  120. if (bheadp == NULL) {
  121. bheadp = bp;
  122. } else if (strcmp (bheadp->b_fname, fname) > 0) {
  123. /* insert at the beginning */
  124. bp->b_next = bheadp;
  125. bheadp = bp;
  126. } else {
  127. for (sb = bheadp; sb->b_next != NULL; sb = sb->b_next)
  128. if (strcmp (sb->b_next->b_fname, fname) > 0)
  129. break;
  130. /* and insert it */
  131. bp->b_next = sb->b_next;
  132. sb->b_next = bp;
  133. }
  134. }
  135. return bp;
  136. }
  137. /* unlink from the list of buffers, free associated memory, assumes buffer has been saved if modified */
  138. int delete_buffer (buffer_t *bp)
  139. {
  140. buffer_t *sb = NULL;
  141. /* we must have switched to a different buffer first */
  142. assert(bp != curbp);
  143. /* if buffer is the head buffer */
  144. if (bp == bheadp) {
  145. bheadp = bp->b_next;
  146. } else {
  147. /* find place where the bp buffer is next */
  148. for (sb = bheadp; sb->b_next != bp && sb->b_next != NULL; sb = sb->b_next)
  149. ;
  150. assert(sb->b_next == bp || sb->b_next == NULL);
  151. sb->b_next = bp->b_next;
  152. }
  153. if(bp == lastbp) {
  154. lastbp = NULL;
  155. }
  156. /* now we can delete */
  157. free(bp->b_buf);
  158. free(bp);
  159. return TRUE;
  160. }
  161. void last_buffer()
  162. {
  163. buffer_t *t;
  164. disassociate_b(curwp);
  165. if(lastbp == NULL) {
  166. lastbp = curbp;
  167. curbp = curbp->b_next != NULL ? curbp->b_next : bheadp;
  168. } else {
  169. t = curbp;
  170. curbp = lastbp;
  171. lastbp = t;
  172. }
  173. associate_b2w(curbp,curwp);
  174. }
  175. void next_buffer()
  176. {
  177. disassociate_b(curwp);
  178. lastbp = curbp;
  179. curbp = curbp->b_next != NULL ? curbp->b_next : bheadp;
  180. associate_b2w(curbp,curwp);
  181. }
  182. void switch_buffer()
  183. {
  184. buffer_t *next;
  185. int ret = 0;
  186. char message[TEMPBUF] = "Switch to buffer (default ";
  187. assert(curbp != NULL);
  188. assert(bheadp != NULL);
  189. next = lastbp != NULL ? lastbp : curbp->b_next;
  190. if(next == NULL)
  191. next = bheadp;
  192. strcat(message, next->b_bname);
  193. strcat(message, "): ");
  194. next = getbuffername(message, (char*)temp, PATH_MAX, &ret);
  195. if(!ret)
  196. return;
  197. if(next == curbp) {
  198. msg("Same buffer!");
  199. return;
  200. }
  201. if(next == NULL) {
  202. next = lastbp != NULL ? lastbp : curbp->b_next;
  203. if(next == NULL)
  204. next = bheadp;
  205. }
  206. if(next != NULL) {
  207. tb_present();
  208. disassociate_b(curwp);
  209. lastbp = curbp;
  210. curbp = next;
  211. associate_b2w(curbp,curwp);
  212. } else {
  213. msg("Buffer doesn't exist");
  214. }
  215. tb_set_cursor(0, MSGLINE);
  216. clrtoeol("", MSGLINE);
  217. }
  218. char* get_buffer_name(buffer_t *bp)
  219. {
  220. return (strlen(bp->b_fname) > 0) ? bp->b_fname : bp->b_bname;
  221. }
  222. int count_buffers()
  223. {
  224. buffer_t* bp;
  225. int i = 0;
  226. for (i=0, bp=bheadp; bp != NULL; bp = bp->b_next)
  227. i++;
  228. return i;
  229. }
  230. int modified_buffers()
  231. {
  232. buffer_t* bp;
  233. for (bp=bheadp; bp != NULL; bp = bp->b_next)
  234. if (bp->b_flags & B_MODIFIED)
  235. return TRUE;
  236. return FALSE;
  237. }
  238. int compare_buffer_name(buffer_t *bp, buffer_t *ebp)
  239. {
  240. int match = FALSE;
  241. int elen = strlen(ebp->b_bname);
  242. int len = strlen(bp->b_bname);
  243. int longer_name = elen > len ? elen : len;
  244. for(int i = 0; i < longer_name; i++)
  245. if(ebp->b_bname[i] == bp->b_bname[i]) {
  246. match = TRUE;
  247. } else {
  248. match = FALSE;
  249. break;
  250. }
  251. return match;
  252. }
  253. /* Used to either truncate or expand buffer name
  254. flag = 0, truncate to file name only (.mailrc)
  255. flag > 0, truncate to previous directory / file name (i.e. home/.mailrc)
  256. i.e. for a file found at /home/kev/src/ait/README.md, if we had a flag
  257. of 3, we'd see: kev/src/ait/README.md
  258. */
  259. void modify_buffer_name(buffer_t *bp, int flag)
  260. {
  261. char *dir, fname[PATH_MAX + 1];
  262. const char *list_dirs[20];
  263. int d = 0;
  264. strcpy(fname, bp->b_fname);
  265. dir = "\0";
  266. dir = strtok(fname, "/");
  267. while( dir != NULL ) {
  268. list_dirs[d] = dir;
  269. d++;
  270. dir = strtok(NULL, "/");
  271. }
  272. if(flag > 0) {
  273. strcpy(bp->b_bname, list_dirs[d-(flag + 1)]);
  274. strcat(bp->b_bname, "/");
  275. flag--;
  276. for(; flag > 0; flag--) {
  277. strcat(bp->b_bname, list_dirs[d-(flag + 1)]);
  278. strcat(bp->b_bname, "/");
  279. }
  280. }
  281. strcat(bp->b_bname, list_dirs[d-1]);
  282. free(dir);
  283. }