1 /* $OpenBSD$ */ 2 3 /* 4 * Copyright (c) 2017 Nicholas Marriott <nicholas.marriott@gmail.com> 5 * 6 * Permission to use, copy, modify, and distribute this software for any 7 * purpose with or without fee is hereby granted, provided that the above 8 * copyright notice and this permission notice appear in all copies. 9 * 10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 14 * WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER 15 * IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING 16 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 17 */ 18 19 #include <sys/types.h> 20 21 #include <stdlib.h> 22 #include <string.h> 23 #include <time.h> 24 25 #include "tmux.h" 26 27 static struct screen *window_buffer_init(struct window_pane *, 28 struct cmd_find_state *, struct args *); 29 static void window_buffer_free(struct window_pane *); 30 static void window_buffer_resize(struct window_pane *, u_int, 31 u_int); 32 static void window_buffer_key(struct window_pane *, 33 struct client *, struct session *, key_code, 34 struct mouse_event *); 35 36 #define WINDOW_BUFFER_DEFAULT_COMMAND "paste-buffer -b '%%'" 37 38 #define WINDOW_BUFFER_DEFAULT_FORMAT \ 39 "#{buffer_size} bytes (#{t:buffer_created})" 40 41 const struct window_mode window_buffer_mode = { 42 .name = "buffer-mode", 43 44 .init = window_buffer_init, 45 .free = window_buffer_free, 46 .resize = window_buffer_resize, 47 .key = window_buffer_key, 48 }; 49 50 enum window_buffer_sort_type { 51 WINDOW_BUFFER_BY_TIME, 52 WINDOW_BUFFER_BY_NAME, 53 WINDOW_BUFFER_BY_SIZE, 54 }; 55 static const char *window_buffer_sort_list[] = { 56 "time", 57 "name", 58 "size" 59 }; 60 61 struct window_buffer_itemdata { 62 const char *name; 63 u_int order; 64 size_t size; 65 }; 66 67 struct window_buffer_modedata { 68 struct mode_tree_data *data; 69 char *command; 70 char *format; 71 72 struct window_buffer_itemdata **item_list; 73 u_int item_size; 74 }; 75 76 static struct window_buffer_itemdata * 77 window_buffer_add_item(struct window_buffer_modedata *data) 78 { 79 struct window_buffer_itemdata *item; 80 81 data->item_list = xreallocarray(data->item_list, data->item_size + 1, 82 sizeof *data->item_list); 83 item = data->item_list[data->item_size++] = xcalloc(1, sizeof *item); 84 return (item); 85 } 86 87 static void 88 window_buffer_free_item(struct window_buffer_itemdata *item) 89 { 90 free(__UNCONST(item->name)); 91 free(item); 92 } 93 94 static int 95 window_buffer_cmp_name(const void *a0, const void *b0) 96 { 97 const struct window_buffer_itemdata *const *a = a0; 98 const struct window_buffer_itemdata *const *b = b0; 99 100 return (strcmp((*a)->name, (*b)->name)); 101 } 102 103 static int 104 window_buffer_cmp_time(const void *a0, const void *b0) 105 { 106 const struct window_buffer_itemdata *const *a = a0; 107 const struct window_buffer_itemdata *const *b = b0; 108 109 if ((*a)->order > (*b)->order) 110 return (-1); 111 if ((*a)->order < (*b)->order) 112 return (1); 113 return (strcmp((*a)->name, (*b)->name)); 114 } 115 116 static int 117 window_buffer_cmp_size(const void *a0, const void *b0) 118 { 119 const struct window_buffer_itemdata *const *a = a0; 120 const struct window_buffer_itemdata *const *b = b0; 121 122 if ((*a)->size > (*b)->size) 123 return (-1); 124 if ((*a)->size < (*b)->size) 125 return (1); 126 return (strcmp((*a)->name, (*b)->name)); 127 } 128 129 static void 130 window_buffer_build(void *modedata, u_int sort_type, __unused uint64_t *tag, 131 const char *filter) 132 { 133 struct window_buffer_modedata *data = modedata; 134 struct window_buffer_itemdata *item; 135 u_int i; 136 struct paste_buffer *pb; 137 char *text, *cp; 138 struct format_tree *ft; 139 140 for (i = 0; i < data->item_size; i++) 141 window_buffer_free_item(data->item_list[i]); 142 free(data->item_list); 143 data->item_list = NULL; 144 data->item_size = 0; 145 146 pb = NULL; 147 while ((pb = paste_walk(pb)) != NULL) { 148 item = window_buffer_add_item(data); 149 item->name = xstrdup(paste_buffer_name(pb)); 150 paste_buffer_data(pb, &item->size); 151 item->order = paste_buffer_order(pb); 152 } 153 154 switch (sort_type) { 155 case WINDOW_BUFFER_BY_NAME: 156 qsort(data->item_list, data->item_size, sizeof *data->item_list, 157 window_buffer_cmp_name); 158 break; 159 case WINDOW_BUFFER_BY_TIME: 160 qsort(data->item_list, data->item_size, sizeof *data->item_list, 161 window_buffer_cmp_time); 162 break; 163 case WINDOW_BUFFER_BY_SIZE: 164 qsort(data->item_list, data->item_size, sizeof *data->item_list, 165 window_buffer_cmp_size); 166 break; 167 } 168 169 for (i = 0; i < data->item_size; i++) { 170 item = data->item_list[i]; 171 172 pb = paste_get_name(item->name); 173 if (pb == NULL) 174 continue; 175 ft = format_create(NULL, NULL, FORMAT_NONE, 0); 176 format_defaults_paste_buffer(ft, pb); 177 178 if (filter != NULL) { 179 cp = format_expand(ft, filter); 180 if (!format_true(cp)) { 181 free(cp); 182 format_free(ft); 183 continue; 184 } 185 free(cp); 186 } 187 188 text = format_expand(ft, data->format); 189 mode_tree_add(data->data, NULL, item, item->order, item->name, 190 text, -1); 191 free(text); 192 193 format_free(ft); 194 } 195 196 } 197 198 static struct screen * 199 window_buffer_draw(__unused void *modedata, void *itemdata, u_int sx, u_int sy) 200 { 201 struct window_buffer_itemdata *item = itemdata; 202 struct paste_buffer *pb; 203 static struct screen s; 204 struct screen_write_ctx ctx; 205 char line[1024]; 206 const char *pdata, *end, *cp; 207 size_t psize, at; 208 u_int i; 209 210 pb = paste_get_name(item->name); 211 if (pb == NULL) 212 return (NULL); 213 214 screen_init(&s, sx, sy, 0); 215 216 screen_write_start(&ctx, NULL, &s); 217 screen_write_clearscreen(&ctx, 8); 218 219 pdata = end = paste_buffer_data(pb, &psize); 220 for (i = 0; i < sy; i++) { 221 at = 0; 222 while (end != pdata + psize && *end != '\n') { 223 if ((sizeof line) - at > 5) { 224 cp = vis(line + at, *end, VIS_TAB|VIS_OCTAL, 0); 225 at = cp - line; 226 } 227 end++; 228 } 229 if (at > sx) 230 at = sx; 231 line[at] = '\0'; 232 233 if (*line != '\0') { 234 screen_write_cursormove(&ctx, 0, i); 235 screen_write_puts(&ctx, &grid_default_cell, "%s", line); 236 } 237 238 if (end == pdata + psize) 239 break; 240 end++; 241 } 242 243 screen_write_stop(&ctx); 244 return (&s); 245 } 246 247 static int 248 window_buffer_search(__unused void *modedata, void *itemdata, const char *ss) 249 { 250 struct window_buffer_itemdata *item = itemdata; 251 struct paste_buffer *pb; 252 const char *bufdata; 253 size_t bufsize; 254 255 if ((pb = paste_get_name(item->name)) == NULL) 256 return (0); 257 if (strstr(item->name, ss) != NULL) 258 return (1); 259 bufdata = paste_buffer_data(pb, &bufsize); 260 return (memmem(bufdata, bufsize, ss, strlen(ss)) != NULL); 261 } 262 263 static struct screen * 264 window_buffer_init(struct window_pane *wp, __unused struct cmd_find_state *fs, 265 struct args *args) 266 { 267 struct window_buffer_modedata *data; 268 struct screen *s; 269 270 wp->modedata = data = xcalloc(1, sizeof *data); 271 272 if (args == NULL || !args_has(args, 'F')) 273 data->format = xstrdup(WINDOW_BUFFER_DEFAULT_FORMAT); 274 else 275 data->format = xstrdup(args_get(args, 'F')); 276 if (args == NULL || args->argc == 0) 277 data->command = xstrdup(WINDOW_BUFFER_DEFAULT_COMMAND); 278 else 279 data->command = xstrdup(args->argv[0]); 280 281 data->data = mode_tree_start(wp, args, window_buffer_build, 282 window_buffer_draw, window_buffer_search, data, 283 window_buffer_sort_list, nitems(window_buffer_sort_list), &s); 284 285 mode_tree_build(data->data); 286 mode_tree_draw(data->data); 287 288 return (s); 289 } 290 291 static void 292 window_buffer_free(struct window_pane *wp) 293 { 294 struct window_buffer_modedata *data = wp->modedata; 295 u_int i; 296 297 if (data == NULL) 298 return; 299 300 mode_tree_free(data->data); 301 302 for (i = 0; i < data->item_size; i++) 303 window_buffer_free_item(data->item_list[i]); 304 free(data->item_list); 305 306 free(data->format); 307 free(data->command); 308 309 free(data); 310 } 311 312 static void 313 window_buffer_resize(struct window_pane *wp, u_int sx, u_int sy) 314 { 315 struct window_buffer_modedata *data = wp->modedata; 316 317 mode_tree_resize(data->data, sx, sy); 318 } 319 320 static void 321 window_buffer_do_delete(void* modedata, void *itemdata, __unused key_code key) 322 { 323 struct window_buffer_modedata *data = modedata; 324 struct window_buffer_itemdata *item = itemdata; 325 struct paste_buffer *pb; 326 327 if (item == mode_tree_get_current(data->data)) 328 mode_tree_down(data->data, 0); 329 if ((pb = paste_get_name(item->name)) != NULL) 330 paste_free(pb); 331 } 332 333 static void 334 window_buffer_key(struct window_pane *wp, struct client *c, 335 __unused struct session *s, key_code key, struct mouse_event *m) 336 { 337 struct window_buffer_modedata *data = wp->modedata; 338 struct window_buffer_itemdata *item; 339 char *command, *name; 340 int finished; 341 342 /* 343 * t = toggle tag 344 * T = tag none 345 * C-t = tag all 346 * q = exit 347 * O = change sort order 348 * 349 * d = delete buffer 350 * D = delete tagged buffers 351 * Enter = paste buffer 352 */ 353 354 finished = mode_tree_key(data->data, c, &key, m); 355 switch (key) { 356 case 'd': 357 item = mode_tree_get_current(data->data); 358 window_buffer_do_delete(data, item, key); 359 mode_tree_build(data->data); 360 break; 361 case 'D': 362 mode_tree_each_tagged(data->data, window_buffer_do_delete, key, 363 0); 364 mode_tree_build(data->data); 365 break; 366 case '\r': 367 item = mode_tree_get_current(data->data); 368 command = xstrdup(data->command); 369 name = xstrdup(item->name); 370 window_pane_reset_mode(wp); 371 mode_tree_run_command(c, NULL, command, name); 372 free(name); 373 free(command); 374 return; 375 } 376 if (finished || paste_get_top(NULL) == NULL) 377 window_pane_reset_mode(wp); 378 else { 379 mode_tree_draw(data->data); 380 wp->flags |= PANE_REDRAW; 381 } 382 } 383