Mercurial > vim

comparison src/term.c @ 14862:27b9a84395b5 v8.1.0443

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
patch 8.1.0443: unnecessary static function prototypes commit https://github.com/vim/vim/commit/6dff58f15cede9139b2fcfc64c9064326ea3d3b0 Author: Bram Moolenaar <Bram@vim.org> Date: Sun Sep 30 21:43:26 2018 +0200 patch 8.1.0443: unnecessary static function prototypes Problem: Unnecessary static function prototypes. Solution: Remove unnecessary prototypes.
author Christian Brabandt <cb@256bit.org>
date Sun, 30 Sep 2018 21:45:07 +0200
parents 7cc2d28778ac
children cf4d6489c9eb
comparison
equal deleted inserted replaced
14861:41fbdae837df 14862:27b9a84395b5
72 }; 72 };
73 73
74 /* start of keys that are not directly used by Vim but can be mapped */ 74 /* start of keys that are not directly used by Vim but can be mapped */
75 #define BT_EXTRA_KEYS 0x101 75 #define BT_EXTRA_KEYS 0x101
76 76
77 static struct builtin_term *find_builtin_term(char_u *name);
78 static void parse_builtin_tcap(char_u *s); 77 static void parse_builtin_tcap(char_u *s);
79 static void gather_termleader(void); 78 static void gather_termleader(void);
80 #ifdef FEAT_TERMRESPONSE 79 #ifdef FEAT_TERMRESPONSE
81 static void req_codes_from_term(void); 80 static void req_codes_from_term(void);
82 static void req_more_codes_from_term(void); 81 static void req_more_codes_from_term(void);
89 static int get_bytes_from_buf(char_u *, char_u *, int); 88 static int get_bytes_from_buf(char_u *, char_u *, int);
90 #endif 89 #endif
91 static void del_termcode_idx(int idx); 90 static void del_termcode_idx(int idx);
92 static int term_is_builtin(char_u *name); 91 static int term_is_builtin(char_u *name);
93 static int term_7to8bit(char_u *p); 92 static int term_7to8bit(char_u *p);
94 #ifdef FEAT_TERMRESPONSE
95 static void switch_to_8bit(void);
96 #endif
97 93
98 #ifdef HAVE_TGETENT 94 #ifdef HAVE_TGETENT
99 static char_u *tgetent_error(char_u *, char_u *); 95 static char_u *tgetent_error(char_u *, char_u *);
100 96
101 /* 97 /*
2427 2423
2428 /* 2424 /*
2429 * minimal tgoto() implementation. 2425 * minimal tgoto() implementation.
2430 * no padding and we only parse for %i %d and %+char 2426 * no padding and we only parse for %i %d and %+char
2431 */ 2427 */
2432 static char *tgoto(char *, int, int);
2433
2434 static char * 2428 static char *
2435 tgoto(char *cm, int x, int y) 2429 tgoto(char *cm, int x, int y)
2436 { 2430 {
2437 static char buf[30]; 2431 static char buf[30];
2438 char *p, *s, *e; 2432 char *p, *s, *e;
3144 { 3138 {
3145 shift = 8 * (sizeof(long_u) - i); 3139 shift = 8 * (sizeof(long_u) - i);
3146 dst[i - 1] = (char_u) ((val >> shift) & 0xff); 3140 dst[i - 1] = (char_u) ((val >> shift) & 0xff);
3147 } 3141 }
3148 } 3142 }
3149
3150 static int get_long_from_buf(char_u *buf, long_u *val);
3151 3143
3152 /* 3144 /*
3153 * Interpret the next string of bytes in buf as a long integer, with the most 3145 * Interpret the next string of bytes in buf as a long integer, with the most
3154 * significant byte first. Note that it is assumed that buf has been through 3146 * significant byte first. Note that it is assumed that buf has been through
3155 * inchar(), so that NUL and K_SPECIAL will be represented as three bytes each. 3147 * inchar(), so that NUL and K_SPECIAL will be represented as three bytes each.