buffer.c 7.2 KB

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