Logo Search packages:      
Sourcecode: ne version File versions  Download package


/* Terminfo database scanning and keyboard escape sequence matching functions.

      Copyright (C) 1993-1998 Sebastiano Vigna 
      Copyright (C) 1999-2006 Todd M. Lewis and Sebastiano Vigna

      This file is part of ne, the nice editor.

      This program is free software; you can redistribute it and/or modify it
      under the terms of the GNU General Public License as published by the
      Free Software Foundation; either version 2, or (at your option) any
      later version.
      This program is distributed in the hope that it will be useful, but
      WITHOUT ANY WARRANTY; without even the implied warranty of
      General Public License for more details.
      You should have received a copy of the GNU General Public License along
      with this program; see the file COPYING.  If not, write to the Free
      Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
      02111-1307, USA.  */

#include "ne.h"
#include <time.h>
#include <signal.h>
#include <errno.h>
#include <string.h>

#ifdef _AMIGA
#include <proto/dos.h>

/* Maximum number of key definitions from terminfo */

#define MAX_TERM_KEY 512

/* Size of the keyboard input buffer. */

#define KBD_BUF_SIZE 512

/* This structure describes a key in the terminfo database. These structures
are ordered with respect to the string field to optimize their scanning. The
order is *inverted* w.r.t. strcmp(). */

typedef struct {
      unsigned char *string;
      int code;
} term_key;

static term_key key[MAX_TERM_KEY];
static int num_keys = 0;

/* Function to pass to qsort for sorting the key capabilities array. */

static int keycmp(const void *t1, const void *t2) {
      return -strcmp((char *)((term_key *)t1)->string, (char *)((term_key *)t2)->string);

/* Search the key capability s in the ordered capability vector; if found at
position pos return -pos-1 (i.e., always a negative number), otherwise return
the correct place for insertion of s */

int binsearch(const char * const s) {
      int l,r,m = 0;

      if (num_keys) {
            l = 0;
            r = num_keys - 1;
            while(l <= r) {
                  m = (l + r) / 2;
                  if (is_prefix(s, key[m].string)) return -m - 1;
                  if (strcmp(key[m].string, s) > 0) l = m + 1;
                  else if (strcmp(key[m].string, s) < 0) r = m - 1;
      else return 0;

      return l;

void dump_keys( void )
    int i;
    for (i = 0; i < num_keys; i++)
        unsigned char *p = key[i].string;
        fprintf(stderr,"%3d: \"",i);
        while ( *p )
            if ( isprint(*p) ) fprintf(stderr,"%c",*p);
            else               fprintf(stderr,"\\x%02x", *p );
        fprintf (stderr,"\"\t-> %d\n", key[i].code );


/* Sets the first free position in the key capabilities array to the cap_string
      capability, and increment the first free position counter.

static void key_set(const char * const cap_string, const int code) {

      if (!cap_string) return;

      key[num_keys].string = (unsigned char *)cap_string;
      key[num_keys].code = code;


/* key_may_set() sets a key capability string IFF it isn't already
assigned. It assumes the array is already sorted, and it keeps it
that way. This is part of the horrible hack to make cursor and
function keys work on numerous terminals which have broken terminfo
and termcap entries, or for weak terminal emulators which happen to
produce well-known sequences. */

static void key_may_set(const char * const cap_string, const int code) {
      int pos;

      if (!cap_string || (pos = binsearch(cap_string)) < 0) return;

      memmove(key + pos + 1, key + pos, (num_keys - pos) * sizeof *key);
      key[pos].string = (unsigned char *)cap_string;
      key[pos].code = code;
      assert(num_keys < MAX_TERM_KEY - 1);

/* Here we scan the terminfo database and build a term_key structure for
each key available. num_keys records the number of entries. The array is
sorted in reverse order with respect to string field (this optimizes the
comparisons, assuming that usually almost all control sequences start with a
character smaller than ' ', while the characters typed by the user are
almost always greater than or equal to ' '). */

extern const char meta_prefixed[128][3];

void read_key_capabilities(void) {
      int i;

      if (!ansi) {
            /* Cursor movement keys */

            key_set(key_up,    NE_KEY_UP);
            key_set(key_down,  NE_KEY_DOWN);
            key_set(key_left,  NE_KEY_LEFT);
            key_set(key_right, NE_KEY_RIGHT);
            key_set(key_home,  NE_KEY_HOME);
            key_set(key_end,   NE_KEY_END);
            key_set(key_npage, NE_KEY_NPAGE);
            key_set(key_ppage, NE_KEY_PPAGE);
            key_set(key_sf,    NE_KEY_SCROLL_FORWARD);
            key_set(key_sr,    NE_KEY_SCROLL_REVERSE);

      /* Editing keys */

            key_set(key_eol,   NE_KEY_CLEAR_TO_EOL);
            key_set(key_eos,   NE_KEY_CLEAR_TO_EOS);
            key_set(key_backspace, NE_KEY_BACKSPACE);
            key_set(key_dl,    NE_KEY_DELETE_LINE);
            key_set(key_il,    NE_KEY_INSERT_LINE);
            key_set(key_dc,    NE_KEY_DELETE_CHAR);
            key_set(key_ic,    NE_KEY_INSERT_CHAR);
            key_set(key_eic,   NE_KEY_EXIT_INSERT_CHAR);
            key_set(key_clear, NE_KEY_CLEAR);

            /* Keypad keys */

            key_set(key_a1, NE_KEY_A1);
            key_set(key_a3, NE_KEY_A3);
            key_set(key_b2, NE_KEY_B2);
            key_set(key_c1, NE_KEY_C1);
            key_set(key_c3, NE_KEY_C3);

            /* Tab keys (never used in the standard configuration) */

            key_set(key_catab, NE_KEY_CLEAR_ALL_TABS);
            key_set(key_ctab,  NE_KEY_CLEAR_TAB);
            key_set(key_stab,  NE_KEY_SET_TAB);

            /* Function keys */

            key_set(key_f0,  NE_KEY_F(0));
            key_set(key_f1,  NE_KEY_F(1));
            key_set(key_f2,  NE_KEY_F(2));
            key_set(key_f3,  NE_KEY_F(3));
            key_set(key_f4,  NE_KEY_F(4));
            key_set(key_f5,  NE_KEY_F(5));
            key_set(key_f6,  NE_KEY_F(6));
            key_set(key_f7,  NE_KEY_F(7));
            key_set(key_f8,  NE_KEY_F(8));
            key_set(key_f9,  NE_KEY_F(9));
            key_set(key_f10, NE_KEY_F(10));
            key_set(key_f11, NE_KEY_F(11));
            key_set(key_f12, NE_KEY_F(12));
            key_set(key_f13, NE_KEY_F(13));
            key_set(key_f14, NE_KEY_F(14));
            key_set(key_f15, NE_KEY_F(15));
            key_set(key_f16, NE_KEY_F(16));
            key_set(key_f17, NE_KEY_F(17));
            key_set(key_f18, NE_KEY_F(18));
            key_set(key_f19, NE_KEY_F(19));
            key_set(key_f20, NE_KEY_F(20));
            key_set(key_f21, NE_KEY_F(21));
            key_set(key_f22, NE_KEY_F(22));
            key_set(key_f23, NE_KEY_F(23));
            key_set(key_f24, NE_KEY_F(24));
            key_set(key_f25, NE_KEY_F(25));
            key_set(key_f26, NE_KEY_F(26));
            key_set(key_f27, NE_KEY_F(27));
            key_set(key_f28, NE_KEY_F(28));
            key_set(key_f29, NE_KEY_F(29));
            key_set(key_f30, NE_KEY_F(30));
            key_set(key_f31, NE_KEY_F(31));
            key_set(key_f32, NE_KEY_F(32));
            key_set(key_f33, NE_KEY_F(33));
            key_set(key_f34, NE_KEY_F(34));
            key_set(key_f35, NE_KEY_F(35));
            key_set(key_f36, NE_KEY_F(36));
            key_set(key_f37, NE_KEY_F(37));
            key_set(key_f38, NE_KEY_F(38));
            key_set(key_f39, NE_KEY_F(39));
            key_set(key_f40, NE_KEY_F(40));
            key_set(key_f41, NE_KEY_F(41));
            key_set(key_f42, NE_KEY_F(42));
            key_set(key_f43, NE_KEY_F(43));
            key_set(key_f44, NE_KEY_F(44));
            key_set(key_f45, NE_KEY_F(45));
            key_set(key_f46, NE_KEY_F(46));
            key_set(key_f47, NE_KEY_F(47));
            key_set(key_f48, NE_KEY_F(48));
            key_set(key_f49, NE_KEY_F(49));
            key_set(key_f50, NE_KEY_F(50));
            key_set(key_f51, NE_KEY_F(51));
            key_set(key_f52, NE_KEY_F(52));
            key_set(key_f53, NE_KEY_F(53));
            key_set(key_f54, NE_KEY_F(54));
            key_set(key_f55, NE_KEY_F(55));
            key_set(key_f56, NE_KEY_F(56));
            key_set(key_f57, NE_KEY_F(57));
            key_set(key_f58, NE_KEY_F(58));
            key_set(key_f59, NE_KEY_F(59));
            key_set(key_f60, NE_KEY_F(60));
            key_set(key_f61, NE_KEY_F(61));
            key_set(key_f62, NE_KEY_F(62));
            key_set(key_f63, NE_KEY_F(63));

      /* Fake (simulated) command key. */

      key_set("\x1B:", NE_KEY_COMMAND);

      assert(num_keys < MAX_TERM_KEY - 1);

      D(fprintf(stderr,"Got %d keys from terminfo\n\r", num_keys);)

      qsort(key, num_keys, sizeof(term_key), keycmp);

      /* A nice hack for common cursor movements borrowed from pico.

            Unfortunately, quite a few terminfo and termcap entries out there have
            bad values for cursor key capability strings. (The f# values are
            generally is sad shape too, but that's a much larger problem.)  However,
            certain escape sequences are quite common among large sets of terminals,
            and so we define the most common ones here.
            key_may_set() won't assign key cap strings if that sequence is already
            taken, so we shouldn't be doing too much damage if the terminfo or
            termcap happens to be correct.  */

      key_may_set("\x1b[A",   NE_KEY_UP);
      key_may_set("\x1b?x",   NE_KEY_UP);
      /*    key_may_set("\x1b" "A", NE_KEY_UP);*/
      key_may_set("\x1bOA",   NE_KEY_UP);

      key_may_set("\x1b[B",   NE_KEY_DOWN);
      key_may_set("\x1b?r",   NE_KEY_DOWN);
      /* key_may_set("\x1b" "B",    NE_KEY_DOWN);*/
      key_may_set("\x1bOB",   NE_KEY_DOWN);

      key_may_set("\x1b[D",   NE_KEY_LEFT);
      key_may_set("\x1b?t",   NE_KEY_LEFT);
      /*key_may_set("\x1b" "D",     NE_KEY_LEFT);*/
      key_may_set("\x1bOD",   NE_KEY_LEFT);

      key_may_set("\x1b[C",   NE_KEY_RIGHT);
      key_may_set("\x1b?v",   NE_KEY_RIGHT);
      /*key_may_set("\x1b" "C",     NE_KEY_RIGHT);*/
      key_may_set("\x1bOC",   NE_KEY_RIGHT);

      key_may_set("\x1b[1~",  NE_KEY_HOME);
      key_may_set("\x1b[4~",  NE_KEY_END);
      key_may_set("\x1b[6~",  NE_KEY_NPAGE);
      key_may_set("\x1b[5~",  NE_KEY_PPAGE);
      key_may_set("\x1b[2~",  NE_KEY_INSERT_CHAR);
      key_may_set("\x1b[3~",  NE_KEY_DELETE_CHAR);

      key_may_set("\x1b[H",  NE_KEY_HOME);
      key_may_set("\x1b[L",  NE_KEY_INSERT_CHAR);

      /* gnome-terminal bizarre home/end keys */
      key_may_set("\x1bOH",  NE_KEY_HOME);
      key_may_set("\x1bOF",  NE_KEY_END);

      /* The fundamental F1 escape key has been stolen by Gnome. We replace it
            with a double escape, if possible. */

      key_may_set("\x1B\x1B", NE_KEY_F(1));

   /* More hacking. Function keys are routinely defined wrong on bazillions of
      systems. This sections codes the F1-F10 keys for vt100, xterms and PCs. I
      can't believe vendors can ship such buggy termcap/terminfo entries.  This
      also handles the case of an otherwise limited terminal emulator which
      happens to produce these sequences for function keys.  */

   /* xterm fkeys: kf1=\E[11~ kf2=\E[12~ kf3=\E[13~ kf4=\E[14~  kf5=\E[15~
                   kf6=\E[17~ kf7=\E[18~ kf8=\E[19~ kf9=\E[20~ kf10=\E[21~ kf11=\E[23~ kf12=\E[24~ */

      key_may_set("\x1b[11~",  NE_KEY_F(1));
      key_may_set("\x1b[12~",  NE_KEY_F(2));
      key_may_set("\x1b[13~",  NE_KEY_F(3));
      key_may_set("\x1b[14~",  NE_KEY_F(4));
      key_may_set("\x1b[15~",  NE_KEY_F(5));
      key_may_set("\x1b[17~",  NE_KEY_F(6));
      key_may_set("\x1b[18~",  NE_KEY_F(7));
      key_may_set("\x1b[19~",  NE_KEY_F(8));
      key_may_set("\x1b[20~",  NE_KEY_F(9));
      key_may_set("\x1b[21~", NE_KEY_F(10));
      key_may_set("\x1b[23~", NE_KEY_F(11));
      key_may_set("\x1b[24~", NE_KEY_F(12));

   /* vt100 keys:   k1=\EOP    k2=\EOQ    k3=\EOR    k4=\EOS     k5=\EOt 
                    k6=\EOu    k7=\EOv    k8=\EOl    k9=\EOw    k10=\EOy */
      key_may_set("\x1bOP",  NE_KEY_F(1));
      key_may_set("\x1bOQ",  NE_KEY_F(2));
      key_may_set("\x1bOR",  NE_KEY_F(3));
      key_may_set("\x1bOS",  NE_KEY_F(4));
      key_may_set("\x1bOt",  NE_KEY_F(5));
      key_may_set("\x1bOu",  NE_KEY_F(6));
      key_may_set("\x1bOv",  NE_KEY_F(7));
      key_may_set("\x1bOl",  NE_KEY_F(8));
      key_may_set("\x1bOw",  NE_KEY_F(9));
      key_may_set("\x1bOy", NE_KEY_F(10));

   /* pc keys:   k1=\E[[A   k2=\E[[B    k3=\E[[C    k4=\E[[D     k5=\E[[E */
      key_may_set("\x1b[[A",  NE_KEY_F(1));
      key_may_set("\x1b[[B",  NE_KEY_F(2));
      key_may_set("\x1b[[C",  NE_KEY_F(3));
      key_may_set("\x1b[[D",  NE_KEY_F(4));
      key_may_set("\x1b[[E",  NE_KEY_F(5));

      /* If at this point any sequence of the form ESC+ASCII character is free, we bind
            it to the simulated META key. */

      for(i = 1; i < 128; i++) key_may_set(meta_prefixed[i], NE_KEY_META(i));


/* Sets the escape time, which is an option, but it's global to ne and it's not
      saved in autopreferences files. However, an EscapeTime command can be
      attached manually to any preferences file. */

static int escape_time = 10;

void set_escape_time(const int new_escape_time) {
      escape_time = new_escape_time;

/* Sets the current timeout in the termios structure relative to stdin. If the
      timeout value (in tenth of a second) is positive, VMIN is set to 0,
      otherwise to 1. */

#ifndef _AMIGA

static void set_termios_timeout(const int timeout) {

      struct termios termios;

      tcgetattr(0, &termios);

      termios.c_cc[VTIME] = timeout;
      termios.c_cc[VMIN] = timeout ? 0 : 1;

      tcsetattr(0, TCSANOW, &termios);


/* Reads in characters, and tries to match them with the sequences
      corresponding to special keys. Returns a positive number, denoting
      a character (possibly INVALID_CHAR), or a negative number denoting a key
      code (if x is the key code, -x-1 will be returned).

      This function tries to be highly optimized and efficient by employing a
      sorted array of strings for the terminal keys. An index keeps track of the
      key which has a partial match with the current contents of the keyboard
      buffer. As each character is input, a match is tried with the rest of the
      string. If a new character does not match, we can just increment the key
      counter (because the array is sorted). When we get out of the array, we give
      back the first char in the keyboard buffer (the next call will retry a match
      on the following chars). */

int get_key_code(void) {

      static int cur_len = 0;
      static unsigned char kbd_buffer[KBD_BUF_SIZE];

      int c, last_match = 0, cur_key = 0, partial_match = FALSE, partial_is_utf8 = FALSE;

      while(TRUE) {

            if (cur_len) {

                  /* Something is already in the buffer. last_match is the position
                  we have to check. */

                  while(last_match < cur_len) {
                        if (last_match == 0 && io_utf8 && kbd_buffer[0] >= 0x80) {
                              partial_is_utf8 = TRUE;
                        else if (partial_is_utf8) {   /* Our partial match is an UTF-8 sequence. */
                              if ((kbd_buffer[last_match] & 0xC0) == 0x80) {
                                    if (utf8len(kbd_buffer[0]) == ++last_match) {
                                          c = utf8char(kbd_buffer);
                                          if (cur_len -= last_match) memmove(kbd_buffer, kbd_buffer + last_match, cur_len);
                                          return c == -1 ? INVALID_CHAR : c;
                              else {
                                    /* A UTF-8 error. We discard the first character and try again. */
                                    if (--cur_len) memmove(kbd_buffer, kbd_buffer + 1, cur_len);
                                    partial_is_utf8 = FALSE;
                                    last_match = 0;
                        else {
                              /* First easy case. We felt off the array. We return the first character
                                    in the buffer and restart the match. */
                              if (!key[cur_key].string) {
                                    c = kbd_buffer[0];
                                    if (--cur_len) memmove(kbd_buffer, kbd_buffer + 1, cur_len);
                                    return c;
                              /* Second case. We have a partial match on the first last_match
                                    characters. If another character matches, either the string is terminated,
                                    and we return the key code, or we increment the match count. */
                              else if (key[cur_key].string[last_match] == kbd_buffer[last_match]) {
                                    if (key[cur_key].string[last_match + 1] == 0) {
                                          if (cur_len -= last_match + 1) memmove(kbd_buffer, kbd_buffer + last_match + 1, cur_len);
                                          assert(key[cur_key].code < NUM_KEYS);
                                          return -key[cur_key].code - 1;
                                    else last_match++;
                              /* The tricky part. If there is a failed match, the order guarantees that
                                    no match if possible if the code of the keyboard char is greater than the code of
                                    the capability char. Otherwise, we check for the first capability starting
                                    with the current keyboard characters. */
                              else {
                                    if (kbd_buffer[last_match] > key[cur_key].string[last_match]) {
                                          c = kbd_buffer[0];
                                          if (--cur_len) memmove(kbd_buffer, kbd_buffer + 1, cur_len);
                                          return c;
                                    else {
                                          last_match = 0;
                  /* If we have a partial match, let's look at stdin for escape_time
                        tenths of second. If nothing arrives, it is probably time to return
                        what we got. Note that this won't work properly if the terminal has
                        a key capability which is a prefix of another key capability. */
                  partial_match = TRUE;

#ifdef _AMIGA
            if (!partial_match || WaitForChar(Input(), 100000 * escape_time)) c = getchar();
            else c = EOF;
            if (partial_match) set_termios_timeout(escape_time);

            errno = 0;

            c = getchar();

            if (c == EOF && (!partial_match || errno) && errno != EINTR) kill(getpid(), SIGTERM);

            if (c == EOF && errno == EINTR) return -NE_KEY_IGNORE - 1;

            if (partial_match) set_termios_timeout(0);

            partial_match = FALSE;

            if (c != EOF) {
                  if (cur_len < KBD_BUF_SIZE) kbd_buffer[cur_len++] = c;
            else {
                  if (cur_len) {

                        /* We ran out of time. If our match was not UTF-8, then the current
                              partial match is discarded, and the first character of the
                              keyboard buffer is returned. Otherwise, we reject the partially
                              received UTF-8 sequence. */

                        if (partial_is_utf8) cur_len = last_match = partial_is_utf8 = 0;
                        else {
                              c = kbd_buffer[0];
                              if (--cur_len) memmove(kbd_buffer, kbd_buffer + 1, cur_len);
                              return c;

Generated by  Doxygen 1.6.0   Back to index