Home | History | Annotate | Line # | Download | only in libedit
hist.c revision 1.1
      1 /*-
      2  * Copyright (c) 1992, 1993
      3  *	The Regents of the University of California.  All rights reserved.
      4  *
      5  * This code is derived from software contributed to Berkeley by
      6  * Christos Zoulas of Cornell University.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     11  * 1. Redistributions of source code must retain the above copyright
     12  *    notice, this list of conditions and the following disclaimer.
     13  * 2. Redistributions in binary form must reproduce the above copyright
     14  *    notice, this list of conditions and the following disclaimer in the
     15  *    documentation and/or other materials provided with the distribution.
     16  * 3. All advertising materials mentioning features or use of this software
     17  *    must display the following acknowledgement:
     18  *	This product includes software developed by the University of
     19  *	California, Berkeley and its contributors.
     20  * 4. Neither the name of the University nor the names of its contributors
     21  *    may be used to endorse or promote products derived from this software
     22  *    without specific prior written permission.
     23  *
     24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  * SUCH DAMAGE.
     35  */
     36 
     37 #if !defined(lint) && !defined(SCCSID)
     38 static char sccsid[] = "@(#)hist.c	8.1 (Berkeley) 6/4/93";
     39 #endif /* not lint && not SCCSID */
     40 
     41 /*
     42  * hist.c: History access functions
     43  */
     44 #include "sys.h"
     45 #include <stdlib.h>
     46 #include "el.h"
     47 
     48 /* hist_init():
     49  *	Initialization function.
     50  */
     51 protected int
     52 hist_init(el)
     53     EditLine *el;
     54 {
     55     el->el_history.fun  = NULL;
     56     el->el_history.ref  = NULL;
     57     el->el_history.buf   = (char *) el_malloc(EL_BUFSIZ);
     58     el->el_history.last  = el->el_history.buf;
     59     return 0;
     60 }
     61 
     62 
     63 /* hist_end():
     64  *	clean up history;
     65  */
     66 protected void
     67 hist_end(el)
     68     EditLine *el;
     69 {
     70     el_free((ptr_t) el->el_history.buf);
     71     el->el_history.buf   = NULL;
     72 }
     73 
     74 
     75 /* hist_set():
     76  *	Set new history interface
     77  */
     78 protected int
     79 hist_set(el, fun, ptr)
     80     EditLine *el;
     81     hist_fun_t fun;
     82     ptr_t ptr;
     83 
     84 {
     85     el->el_history.ref = ptr;
     86     el->el_history.fun = fun;
     87     return 0;
     88 }
     89 
     90 
     91 /* hist_get():
     92  *	Get a history line and update it in the buffer.
     93  *	eventno tells us the event to get.
     94  */
     95 protected el_action_t
     96 hist_get(el)
     97     EditLine *el;
     98 {
     99     const char    *hp;
    100     int     h;
    101 
    102     if (el->el_history.eventno == 0) {	/* if really the current line */
    103 	(void) strncpy(el->el_line.buffer, el->el_history.buf, EL_BUFSIZ);
    104 	el->el_line.lastchar = el->el_line.buffer +
    105 		(el->el_history.last - el->el_history.buf);
    106 
    107 #ifdef KSHVI
    108     if (el->el_map.type == MAP_VI)
    109 	el->el_line.cursor = el->el_line.buffer;
    110     else
    111 #endif /* KSHVI */
    112 	el->el_line.cursor = el->el_line.lastchar;
    113 
    114 	return CC_REFRESH;
    115     }
    116 
    117     if (el->el_history.ref == NULL)
    118 	return CC_ERROR;
    119 
    120     hp = HIST_FIRST(el);
    121 
    122     if (hp == NULL)
    123 	return CC_ERROR;
    124 
    125     for (h = 1; h < el->el_history.eventno; h++)
    126 	if ((hp = HIST_NEXT(el)) == NULL) {
    127 	    el->el_history.eventno = h;
    128 	    return CC_ERROR;
    129 	}
    130 
    131     (void) strncpy(el->el_line.buffer, hp, EL_BUFSIZ);
    132     el->el_line.lastchar = el->el_line.buffer + strlen(el->el_line.buffer);
    133 
    134     if (el->el_line.lastchar > el->el_line.buffer) {
    135 	if (el->el_line.lastchar[-1] == '\n')
    136 	    el->el_line.lastchar--;
    137 	if (el->el_line.lastchar[-1] == ' ')
    138 	    el->el_line.lastchar--;
    139 	if (el->el_line.lastchar < el->el_line.buffer)
    140 	    el->el_line.lastchar = el->el_line.buffer;
    141     }
    142 
    143 #ifdef KSHVI
    144     if (el->el_map.type == MAP_VI)
    145 	el->el_line.cursor = el->el_line.buffer;
    146     else
    147 #endif /* KSHVI */
    148 	el->el_line.cursor = el->el_line.lastchar;
    149 
    150     return CC_REFRESH;
    151 }
    152 
    153 /* hist_list()
    154  *	List history entries
    155  */
    156 protected int
    157 /*ARGSUSED*/
    158 hist_list(el, argc, argv)
    159     EditLine *el;
    160     int argc;
    161     char **argv;
    162 {
    163     const char *str;
    164 
    165     if (el->el_history.ref == NULL)
    166 	return -1;
    167     for (str = HIST_LAST(el); str != NULL; str = HIST_PREV(el))
    168 	(void) fprintf(el->el_outfile, "%d %s", el->el_history.ev->num, str);
    169     return 0;
    170 }
    171