[BACK]Return to paste.c CVS log [TXT][DIR] Up to [local] / src / usr.bin / tmux

Annotation of src/usr.bin/tmux/paste.c, Revision 1.40

1.40    ! nicm        1: /* $OpenBSD: paste.c,v 1.39 2017/01/24 13:28:33 nicm Exp $ */
1.1       nicm        2:
                      3: /*
1.34      nicm        4:  * Copyright (c) 2007 Nicholas Marriott <nicholas.marriott@gmail.com>
1.1       nicm        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:
1.12      nicm       21: #include <stdlib.h>
1.1       nicm       22: #include <string.h>
1.38      nicm       23: #include <time.h>
1.9       nicm       24: #include <vis.h>
1.1       nicm       25:
                     26: #include "tmux.h"
                     27:
1.7       nicm       28: /*
1.19      nicm       29:  * Set of paste buffers. Note that paste buffer data is not necessarily a C
1.7       nicm       30:  * string!
                     31:  */
1.1       nicm       32:
1.28      nicm       33: struct paste_buffer {
                     34:        char            *data;
                     35:        size_t           size;
                     36:
                     37:        char            *name;
1.35      nicm       38:        time_t           created;
1.28      nicm       39:        int              automatic;
                     40:        u_int            order;
                     41:
                     42:        RB_ENTRY(paste_buffer) name_entry;
                     43:        RB_ENTRY(paste_buffer) time_entry;
                     44: };
                     45:
1.36      nicm       46: static u_int   paste_next_index;
                     47: static u_int   paste_next_order;
                     48: static u_int   paste_num_automatic;
1.37      nicm       49: static RB_HEAD(paste_name_tree, paste_buffer) paste_by_name;
                     50: static RB_HEAD(paste_time_tree, paste_buffer) paste_by_time;
1.19      nicm       51:
1.36      nicm       52: static int     paste_cmp_names(const struct paste_buffer *,
                     53:                    const struct paste_buffer *);
                     54: RB_GENERATE_STATIC(paste_name_tree, paste_buffer, name_entry, paste_cmp_names);
                     55:
                     56: static int     paste_cmp_times(const struct paste_buffer *,
                     57:                    const struct paste_buffer *);
                     58: RB_GENERATE_STATIC(paste_time_tree, paste_buffer, time_entry, paste_cmp_times);
1.18      nicm       59:
1.36      nicm       60: static int
1.19      nicm       61: paste_cmp_names(const struct paste_buffer *a, const struct paste_buffer *b)
1.1       nicm       62: {
1.19      nicm       63:        return (strcmp(a->name, b->name));
                     64: }
1.1       nicm       65:
1.36      nicm       66: static int
1.19      nicm       67: paste_cmp_times(const struct paste_buffer *a, const struct paste_buffer *b)
                     68: {
                     69:        if (a->order > b->order)
                     70:                return (-1);
                     71:        if (a->order < b->order)
                     72:                return (1);
                     73:        return (0);
1.1       nicm       74: }
                     75:
1.28      nicm       76: /* Get paste buffer name. */
                     77: const char *
                     78: paste_buffer_name(struct paste_buffer *pb)
                     79: {
                     80:        return (pb->name);
                     81: }
                     82:
1.35      nicm       83: /* Get paste buffer order. */
                     84: u_int
                     85: paste_buffer_order(struct paste_buffer *pb)
                     86: {
                     87:        return (pb->order);
                     88: }
                     89:
                     90: /* Get paste buffer created. */
                     91: time_t
                     92: paste_buffer_created(struct paste_buffer *pb)
                     93: {
                     94:        return (pb->created);
                     95: }
                     96:
1.28      nicm       97: /* Get paste buffer data. */
                     98: const char *
                     99: paste_buffer_data(struct paste_buffer *pb, size_t *size)
                    100: {
                    101:        if (size != NULL)
                    102:                *size = pb->size;
                    103:        return (pb->data);
                    104: }
                    105:
1.35      nicm      106: /* Walk paste buffers by time. */
1.1       nicm      107: struct paste_buffer *
1.19      nicm      108: paste_walk(struct paste_buffer *pb)
1.1       nicm      109: {
1.19      nicm      110:        if (pb == NULL)
                    111:                return (RB_MIN(paste_time_tree, &paste_by_time));
                    112:        return (RB_NEXT(paste_time_tree, &paste_by_time, pb));
1.1       nicm      113: }
                    114:
1.21      nicm      115: /* Get the most recent automatic buffer. */
1.1       nicm      116: struct paste_buffer *
1.28      nicm      117: paste_get_top(const char **name)
1.1       nicm      118: {
1.19      nicm      119:        struct paste_buffer     *pb;
                    120:
                    121:        pb = RB_MIN(paste_time_tree, &paste_by_time);
                    122:        if (pb == NULL)
1.1       nicm      123:                return (NULL);
1.28      nicm      124:        if (name != NULL)
                    125:                *name = pb->name;
1.19      nicm      126:        return (pb);
1.1       nicm      127: }
                    128:
1.19      nicm      129: /* Get a paste buffer by name. */
                    130: struct paste_buffer *
                    131: paste_get_name(const char *name)
                    132: {
                    133:        struct paste_buffer     pbfind;
1.1       nicm      134:
1.19      nicm      135:        if (name == NULL || *name == '\0')
                    136:                return (NULL);
1.1       nicm      137:
1.23      nicm      138:        pbfind.name = (char *)name;
1.19      nicm      139:        return (RB_FIND(paste_name_tree, &paste_by_name, &pbfind));
1.1       nicm      140: }
                    141:
1.30      nicm      142: /* Free a paste buffer. */
                    143: void
                    144: paste_free(struct paste_buffer *pb)
1.1       nicm      145: {
1.19      nicm      146:        RB_REMOVE(paste_name_tree, &paste_by_name, pb);
                    147:        RB_REMOVE(paste_time_tree, &paste_by_time, pb);
                    148:        if (pb->automatic)
                    149:                paste_num_automatic--;
1.1       nicm      150:
1.12      nicm      151:        free(pb->data);
1.19      nicm      152:        free(pb->name);
1.12      nicm      153:        free(pb);
1.1       nicm      154: }
                    155:
1.8       nicm      156: /*
1.19      nicm      157:  * Add an automatic buffer, freeing the oldest automatic item if at limit. Note
1.7       nicm      158:  * that the caller is responsible for allocating data.
                    159:  */
1.1       nicm      160: void
1.40    ! nicm      161: paste_add(const char *prefix, char *data, size_t size)
1.1       nicm      162: {
1.19      nicm      163:        struct paste_buffer     *pb, *pb1;
                    164:        u_int                    limit;
1.2       nicm      165:
1.40    ! nicm      166:        if (prefix == NULL)
        !           167:                prefix = "buffer";
        !           168:
1.39      nicm      169:        if (size == 0) {
                    170:                free(data);
1.2       nicm      171:                return;
1.39      nicm      172:        }
1.1       nicm      173:
1.32      nicm      174:        limit = options_get_number(global_options, "buffer-limit");
1.19      nicm      175:        RB_FOREACH_REVERSE_SAFE(pb, paste_time_tree, &paste_by_time, pb1) {
                    176:                if (paste_num_automatic < limit)
                    177:                        break;
                    178:                if (pb->automatic)
1.30      nicm      179:                        paste_free(pb);
1.3       nicm      180:        }
1.1       nicm      181:
                    182:        pb = xmalloc(sizeof *pb);
1.19      nicm      183:
                    184:        pb->name = NULL;
                    185:        do {
                    186:                free(pb->name);
1.40    ! nicm      187:                xasprintf(&pb->name, "%s%u", prefix, paste_next_index);
1.19      nicm      188:                paste_next_index++;
                    189:        } while (paste_get_name(pb->name) != NULL);
1.1       nicm      190:
                    191:        pb->data = data;
1.4       nicm      192:        pb->size = size;
1.19      nicm      193:
                    194:        pb->automatic = 1;
                    195:        paste_num_automatic++;
                    196:
1.35      nicm      197:        pb->created = time(NULL);
                    198:
1.19      nicm      199:        pb->order = paste_next_order++;
                    200:        RB_INSERT(paste_name_tree, &paste_by_name, pb);
                    201:        RB_INSERT(paste_time_tree, &paste_by_time, pb);
1.1       nicm      202: }
                    203:
1.19      nicm      204: /* Rename a paste buffer. */
                    205: int
                    206: paste_rename(const char *oldname, const char *newname, char **cause)
                    207: {
1.20      nicm      208:        struct paste_buffer     *pb, *pb_new;
1.19      nicm      209:
                    210:        if (cause != NULL)
                    211:                *cause = NULL;
                    212:
                    213:        if (oldname == NULL || *oldname == '\0') {
                    214:                if (cause != NULL)
                    215:                        *cause = xstrdup("no buffer");
                    216:                return (-1);
                    217:        }
                    218:        if (newname == NULL || *newname == '\0') {
                    219:                if (cause != NULL)
                    220:                        *cause = xstrdup("new name is empty");
                    221:                return (-1);
                    222:        }
                    223:
                    224:        pb = paste_get_name(oldname);
                    225:        if (pb == NULL) {
                    226:                if (cause != NULL)
1.20      nicm      227:                        xasprintf(cause, "no buffer %s", oldname);
                    228:                return (-1);
                    229:        }
                    230:
                    231:        pb_new = paste_get_name(newname);
                    232:        if (pb_new != NULL) {
                    233:                if (cause != NULL)
                    234:                        xasprintf(cause, "buffer %s already exists", newname);
1.19      nicm      235:                return (-1);
                    236:        }
                    237:
                    238:        RB_REMOVE(paste_name_tree, &paste_by_name, pb);
                    239:
                    240:        free(pb->name);
                    241:        pb->name = xstrdup(newname);
                    242:
                    243:        if (pb->automatic)
                    244:                paste_num_automatic--;
                    245:        pb->automatic = 0;
                    246:
                    247:        RB_INSERT(paste_name_tree, &paste_by_name, pb);
                    248:
                    249:        return (0);
                    250: }
1.7       nicm      251:
1.8       nicm      252: /*
1.19      nicm      253:  * Add or replace an item in the store. Note that the caller is responsible for
1.7       nicm      254:  * allocating data.
                    255:  */
1.1       nicm      256: int
1.19      nicm      257: paste_set(char *data, size_t size, const char *name, char **cause)
1.1       nicm      258: {
1.30      nicm      259:        struct paste_buffer     *pb, *old;
1.7       nicm      260:
1.19      nicm      261:        if (cause != NULL)
                    262:                *cause = NULL;
                    263:
1.15      nicm      264:        if (size == 0) {
                    265:                free(data);
1.7       nicm      266:                return (0);
1.15      nicm      267:        }
1.19      nicm      268:        if (name == NULL) {
1.40    ! nicm      269:                paste_add(NULL, data, size);
1.19      nicm      270:                return (0);
                    271:        }
1.1       nicm      272:
1.19      nicm      273:        if (*name == '\0') {
                    274:                if (cause != NULL)
                    275:                        *cause = xstrdup("empty buffer name");
1.1       nicm      276:                return (-1);
1.19      nicm      277:        }
                    278:
                    279:        pb = xmalloc(sizeof *pb);
1.1       nicm      280:
1.19      nicm      281:        pb->name = xstrdup(name);
1.1       nicm      282:
                    283:        pb->data = data;
1.4       nicm      284:        pb->size = size;
1.19      nicm      285:
                    286:        pb->automatic = 0;
                    287:        pb->order = paste_next_order++;
1.35      nicm      288:
                    289:        pb->created = time(NULL);
1.27      nicm      290:
1.30      nicm      291:        if ((old = paste_get_name(name)) != NULL)
                    292:                paste_free(old);
1.19      nicm      293:
                    294:        RB_INSERT(paste_name_tree, &paste_by_name, pb);
                    295:        RB_INSERT(paste_time_tree, &paste_by_time, pb);
1.1       nicm      296:
                    297:        return (0);
1.9       nicm      298: }
                    299:
1.17      nicm      300: /* Convert start of buffer into a nice string. */
1.9       nicm      301: char *
1.33      nicm      302: paste_make_sample(struct paste_buffer *pb)
1.9       nicm      303: {
1.17      nicm      304:        char            *buf;
                    305:        size_t           len, used;
                    306:        const int        flags = VIS_OCTAL|VIS_TAB|VIS_NL;
                    307:        const size_t     width = 200;
1.9       nicm      308:
                    309:        len = pb->size;
                    310:        if (len > width)
                    311:                len = width;
1.25      nicm      312:        buf = xreallocarray(NULL, len, 4 + 4);
1.9       nicm      313:
1.33      nicm      314:        used = utf8_strvis(buf, pb->data, len, flags);
1.13      nicm      315:        if (pb->size > width || used > width)
1.17      nicm      316:                strlcpy(buf + width, "...", 4);
1.9       nicm      317:        return (buf);
1.1       nicm      318: }