1 /****************************************************************************
2 * Copyright (c) 1998-2016,2017 Free Software Foundation, Inc. *
4 * Permission is hereby granted, free of charge, to any person obtaining a *
5 * copy of this software and associated documentation files (the *
6 * "Software"), to deal in the Software without restriction, including *
7 * without limitation the rights to use, copy, modify, merge, publish, *
8 * distribute, distribute with modifications, sublicense, and/or sell *
9 * copies of the Software, and to permit persons to whom the Software is *
10 * furnished to do so, subject to the following conditions: *
12 * The above copyright notice and this permission notice shall be included *
13 * in all copies or substantial portions of the Software. *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
16 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
18 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
21 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * Except as contained in this notice, the name(s) of the above copyright *
24 * holders shall not be used in advertising or otherwise to promote the *
25 * sale, use or other dealings in this Software without prior written *
27 ****************************************************************************/
29 /****************************************************************************
30 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
31 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
32 * and: Thomas E. Dickey 1996-on *
33 ****************************************************************************/
36 * read_entry.c -- Routine for reading in a compiled terminfo file
39 #include <curses.priv.h>
40 #include <hashed_db.h>
44 MODULE_ID("$Id: read_entry.c,v 1.140 2017/02/05 01:49:55 tom Exp $")
46 #define TYPE_CALLOC(type,elts) typeCalloc(type, (unsigned)(elts))
48 #define MyNumber(n) (short) LOW_MSB(n)
50 #if NCURSES_USE_DATABASE
52 convert_shorts(char *buf, short *Numbers, int count)
55 for (i = 0; i < count; i++) {
56 if (IS_NEG1(buf + 2 * i))
57 Numbers[i] = ABSENT_NUMERIC;
58 else if (IS_NEG2(buf + 2 * i))
59 Numbers[i] = CANCELLED_NUMERIC;
61 Numbers[i] = MyNumber(buf + 2 * i);
62 TR(TRACE_DATABASE, ("get Numbers[%d]=%d", i, Numbers[i]));
67 convert_strings(char *buf, char **Strings, int count, int size, char *table)
72 for (i = 0; i < count; i++) {
73 if (IS_NEG1(buf + 2 * i)) {
74 Strings[i] = ABSENT_STRING;
75 } else if (IS_NEG2(buf + 2 * i)) {
76 Strings[i] = CANCELLED_STRING;
77 } else if (MyNumber(buf + 2 * i) > size) {
78 Strings[i] = ABSENT_STRING;
80 Strings[i] = (MyNumber(buf + 2 * i) + table);
81 TR(TRACE_DATABASE, ("Strings[%d] = %s", i, _nc_visbuf(Strings[i])));
84 /* make sure all strings are NUL terminated */
85 if (VALID_STRING(Strings[i])) {
86 for (p = Strings[i]; p <= table + size; p++)
89 /* if there is no NUL, ignore the string */
91 Strings[i] = ABSENT_STRING;
97 fake_read(char *src, int *offset, int limit, char *dst, unsigned want)
99 int have = (limit - *offset);
102 if ((int) want > have)
103 want = (unsigned) have;
104 memcpy(dst, src + *offset, (size_t) want);
105 *offset += (int) want;
112 #define Read(buf, count) fake_read(buffer, &offset, limit, (char *) buf, (unsigned) count)
114 #define read_shorts(buf, count) \
115 (Read(buf, (count)*2) == (int) (count)*2)
117 #define even_boundary(value) \
118 if ((value) % 2 != 0) Read(buf, 1)
122 _nc_init_termtype(TERMTYPE *const tp)
127 tp->num_Booleans = BOOLCOUNT;
128 tp->num_Numbers = NUMCOUNT;
129 tp->num_Strings = STRCOUNT;
130 tp->ext_Booleans = 0;
134 if (tp->Booleans == 0)
135 TYPE_MALLOC(NCURSES_SBOOL, BOOLCOUNT, tp->Booleans);
136 if (tp->Numbers == 0)
137 TYPE_MALLOC(short, NUMCOUNT, tp->Numbers);
138 if (tp->Strings == 0)
139 TYPE_MALLOC(char *, STRCOUNT, tp->Strings);
141 for_each_boolean(i, tp)
142 tp->Booleans[i] = FALSE;
144 for_each_number(i, tp)
145 tp->Numbers[i] = ABSENT_NUMERIC;
147 for_each_string(i, tp)
148 tp->Strings[i] = ABSENT_STRING;
151 #if NCURSES_USE_DATABASE
154 valid_shorts(char *buffer, int limit)
158 for (n = 0; n < limit; ++n) {
159 if (MyNumber(buffer + (n * 2)) > 0) {
169 * Return TGETENT_YES if read, TGETENT_NO if not found or garbled.
172 _nc_read_termtype(TERMTYPE *ptr, char *buffer, int limit)
175 int name_size, bool_count, num_count, str_count, str_size;
177 char buf[MAX_ENTRY_SIZE + 2];
182 (T_CALLED("_nc_read_termtype(ptr=%p, buffer=%p, limit=%d)"),
183 ptr, buffer, limit));
185 TR(TRACE_DATABASE, ("READ termtype header @%d", offset));
187 memset(ptr, 0, sizeof(*ptr));
189 /* grab the header */
190 if (!read_shorts(buf, 6)
191 || !IS_TIC_MAGIC(buf)) {
192 returnDB(TGETENT_NO);
196 name_size = MyNumber(buf + 2);
197 bool_count = MyNumber(buf + 4);
198 num_count = MyNumber(buf + 6);
199 str_count = MyNumber(buf + 8);
200 str_size = MyNumber(buf + 10);
203 ("TERMTYPE name_size=%d, bool=%d/%d, num=%d/%d str=%d/%d(%d)",
204 name_size, bool_count, BOOLCOUNT, num_count, NUMCOUNT,
205 str_count, STRCOUNT, str_size));
211 returnDB(TGETENT_NO);
214 want = (unsigned) (str_size + name_size + 1);
216 /* try to allocate space for the string table */
217 if (str_count * 2 >= MAX_ENTRY_SIZE
218 || (string_table = typeMalloc(char, want)) == 0) {
219 returnDB(TGETENT_NO);
223 if ((string_table = typeMalloc(char, want)) == 0) {
224 returnDB(TGETENT_NO);
228 /* grab the name (a null-terminated string) */
229 want = min(MAX_NAME_SIZE, (unsigned) name_size);
230 ptr->str_table = string_table;
231 ptr->term_names = string_table;
232 if ((have = (unsigned) Read(ptr->term_names, want)) != want) {
233 memset(ptr->term_names + have, 0, (size_t) (want - have));
235 ptr->term_names[want] = '\0';
236 string_table += (want + 1);
238 if (have > MAX_NAME_SIZE)
239 offset = (int) (have - MAX_NAME_SIZE);
241 /* grab the booleans */
242 if ((ptr->Booleans = TYPE_CALLOC(NCURSES_SBOOL,
243 max(BOOLCOUNT, bool_count))) == 0
244 || Read(ptr->Booleans, (unsigned) bool_count) < bool_count) {
245 returnDB(TGETENT_NO);
249 * If booleans end on an odd byte, skip it. The machine they
250 * originally wrote terminfo on must have been a 16-bit
251 * word-oriented machine that would trap out if you tried a
252 * word access off a 2-byte boundary.
254 even_boundary(name_size + bool_count);
256 /* grab the numbers */
257 if ((ptr->Numbers = TYPE_CALLOC(short, max(NUMCOUNT, num_count))) == 0
258 || !read_shorts(buf, num_count)) {
259 returnDB(TGETENT_NO);
261 convert_shorts(buf, ptr->Numbers, num_count);
263 if ((ptr->Strings = TYPE_CALLOC(char *, max(STRCOUNT, str_count))) == 0) {
264 returnDB(TGETENT_NO);
268 /* grab the string offsets */
269 if (!read_shorts(buf, str_count)) {
270 returnDB(TGETENT_NO);
272 /* finally, grab the string table itself */
273 if (Read(string_table, (unsigned) str_size) != str_size) {
274 returnDB(TGETENT_NO);
276 convert_strings(buf, ptr->Strings, str_count, str_size, string_table);
280 ptr->num_Booleans = BOOLCOUNT;
281 ptr->num_Numbers = NUMCOUNT;
282 ptr->num_Strings = STRCOUNT;
285 * Read extended entries, if any, after the normal end of terminfo data.
287 even_boundary(str_size);
288 TR(TRACE_DATABASE, ("READ extended_header @%d", offset));
289 if (_nc_user_definable && read_shorts(buf, 5) && valid_shorts(buf, 5)) {
290 int ext_bool_count = MyNumber(buf + 0);
291 int ext_num_count = MyNumber(buf + 2);
292 int ext_str_count = MyNumber(buf + 4);
293 int ext_str_size = MyNumber(buf + 6);
294 int ext_str_limit = MyNumber(buf + 8);
295 unsigned need = (unsigned) (ext_bool_count + ext_num_count + ext_str_count);
298 if (need >= (MAX_ENTRY_SIZE / 2)
299 || ext_str_size >= MAX_ENTRY_SIZE
300 || ext_str_limit >= MAX_ENTRY_SIZE
301 || ext_bool_count < 0
305 || ext_str_limit < 0) {
306 returnDB(TGETENT_NO);
309 ptr->num_Booleans = UShort(BOOLCOUNT + ext_bool_count);
310 ptr->num_Numbers = UShort(NUMCOUNT + ext_num_count);
311 ptr->num_Strings = UShort(STRCOUNT + ext_str_count);
313 TYPE_REALLOC(NCURSES_SBOOL, ptr->num_Booleans, ptr->Booleans);
314 TYPE_REALLOC(short, ptr->num_Numbers, ptr->Numbers);
315 TYPE_REALLOC(char *, ptr->num_Strings, ptr->Strings);
317 TR(TRACE_DATABASE, ("extended header is %d/%d/%d(%d:%d)",
318 ext_bool_count, ext_num_count, ext_str_count,
319 ext_str_size, ext_str_limit));
321 TR(TRACE_DATABASE, ("READ %d extended-booleans @%d",
322 ext_bool_count, offset));
323 if ((ptr->ext_Booleans = UShort(ext_bool_count)) != 0) {
324 if (Read(ptr->Booleans + BOOLCOUNT, (unsigned)
325 ext_bool_count) != ext_bool_count) {
326 returnDB(TGETENT_NO);
329 even_boundary(ext_bool_count);
331 TR(TRACE_DATABASE, ("READ %d extended-numbers @%d",
332 ext_num_count, offset));
333 if ((ptr->ext_Numbers = UShort(ext_num_count)) != 0) {
334 if (!read_shorts(buf, ext_num_count)) {
335 returnDB(TGETENT_NO);
337 TR(TRACE_DATABASE, ("Before converting extended-numbers"));
338 convert_shorts(buf, ptr->Numbers + NUMCOUNT, ext_num_count);
341 TR(TRACE_DATABASE, ("READ extended-offsets @%d", offset));
342 if ((unsigned) (ext_str_count + (int) need) >= (MAX_ENTRY_SIZE / 2)) {
343 returnDB(TGETENT_NO);
345 if ((ext_str_count || need)
346 && !read_shorts(buf, ext_str_count + (int) need)) {
347 returnDB(TGETENT_NO);
350 TR(TRACE_DATABASE, ("READ %d bytes of extended-strings @%d",
351 ext_str_limit, offset));
354 ptr->ext_str_table = typeMalloc(char, (size_t) ext_str_limit);
355 if (ptr->ext_str_table == 0) {
356 returnDB(TGETENT_NO);
358 if (Read(ptr->ext_str_table, (unsigned) ext_str_limit) != ext_str_limit) {
359 returnDB(TGETENT_NO);
361 TR(TRACE_DATABASE, ("first extended-string is %s", _nc_visbuf(ptr->ext_str_table)));
364 if ((ptr->ext_Strings = UShort(ext_str_count)) != 0) {
366 ("Before computing extended-string capabilities str_count=%d, ext_str_count=%d",
367 str_count, ext_str_count));
368 convert_strings(buf, ptr->Strings + str_count, ext_str_count,
369 ext_str_limit, ptr->ext_str_table);
370 for (i = ext_str_count - 1; i >= 0; i--) {
371 TR(TRACE_DATABASE, ("MOVE from [%d:%d] %s",
373 _nc_visbuf(ptr->Strings[i + str_count])));
374 ptr->Strings[i + STRCOUNT] = ptr->Strings[i + str_count];
375 if (VALID_STRING(ptr->Strings[i + STRCOUNT]))
376 base += (int) (strlen(ptr->Strings[i + STRCOUNT]) + 1);
377 TR(TRACE_DATABASE, ("... to [%d] %s",
379 _nc_visbuf(ptr->Strings[i + STRCOUNT])));
384 if (ext_str_count >= (MAX_ENTRY_SIZE / 2)) {
385 returnDB(TGETENT_NO);
387 if ((ptr->ext_Names = TYPE_CALLOC(char *, need)) == 0) {
388 returnDB(TGETENT_NO);
391 ("ext_NAMES starting @%d in extended_strings, first = %s",
392 base, _nc_visbuf(ptr->ext_str_table + base)));
393 convert_strings(buf + (2 * ext_str_count),
396 ext_str_limit, ptr->ext_str_table + base);
400 ("...done reading terminfo bool %d(%d) num %d(%d) str %d(%d)",
401 ptr->num_Booleans, ptr->ext_Booleans,
402 ptr->num_Numbers, ptr->ext_Numbers,
403 ptr->num_Strings, ptr->ext_Strings));
405 TR(TRACE_DATABASE, ("extend: num_Booleans:%d", ptr->num_Booleans));
407 #endif /* NCURSES_XNAMES */
409 TR(TRACE_DATABASE, ("...done reading terminfo bool %d num %d str %d",
410 bool_count, num_count, str_count));
412 TR(TRACE_DATABASE, ("normal: num_Booleans:%d", ptr->num_Booleans));
416 for (i = bool_count; i < BOOLCOUNT; i++)
417 ptr->Booleans[i] = FALSE;
418 for (i = num_count; i < NUMCOUNT; i++)
419 ptr->Numbers[i] = ABSENT_NUMERIC;
420 for (i = str_count; i < STRCOUNT; i++)
421 ptr->Strings[i] = ABSENT_STRING;
423 returnDB(TGETENT_YES);
428 * _nc_read_file_entry(filename, ptr)
430 * Read the compiled terminfo entry in the given file into the
431 * structure pointed to by ptr, allocating space for the string
435 _nc_read_file_entry(const char *const filename, TERMTYPE *ptr)
436 /* return 1 if read, 0 if not found or garbled */
441 if (_nc_access(filename, R_OK) < 0
442 || (fp = fopen(filename, "rb")) == 0) {
443 TR(TRACE_DATABASE, ("cannot open terminfo %s (errno=%d)", filename, errno));
447 char buffer[MAX_ENTRY_SIZE + 1];
449 if ((limit = (int) fread(buffer, sizeof(char), sizeof(buffer), fp))
452 TR(TRACE_DATABASE, ("read terminfo %s", filename));
453 if ((code = _nc_read_termtype(ptr, buffer, limit)) == TGETENT_NO) {
454 _nc_free_termtype(ptr);
467 * Return if if we can build the filename of a ".db" file.
470 make_db_filename(char *filename, unsigned limit, const char *const path)
472 static const char suffix[] = DBM_SUFFIX;
474 size_t lens = sizeof(suffix) - 1;
475 size_t size = strlen(path);
476 size_t test = lens + size;
481 && !strcmp(path + size - lens, suffix))
482 _nc_STRCPY(filename, path, limit);
484 _nc_SPRINTF(filename, _nc_SLIMIT(limit) "%s%s", path, suffix);
492 * Return true if we can build the name of a filesystem entry.
495 make_dir_filename(char *filename,
497 const char *const path,
502 #if NCURSES_USE_TERMCAP
503 if (_nc_is_dir_path(path))
506 unsigned need = (unsigned) (LEAF_LEN + 3 + strlen(path) + strlen(name));
509 _nc_SPRINTF(filename, _nc_SLIMIT(limit)
510 "%s/" LEAF_FMT "/%s", path, *name, name);
518 lookup_b64(int *target, const char **source)
523 * ncurses' quickdump writes only RFC 4648 "url/filename-safe" encoding,
524 * but accepts RFC-3548
526 for (j = 0; j < 4; ++j) {
527 int ch = UChar(**source);
529 if (ch >= 'A' && ch <= 'Z') {
530 target[j] = (ch - 'A');
531 } else if (ch >= 'a' && ch <= 'z') {
532 target[j] = 26 + (ch - 'a');
533 } else if (ch >= '0' && ch <= '9') {
534 target[j] = 52 + (ch - '0');
535 } else if (ch == '-' || ch == '+') {
537 } else if (ch == '_' || ch == '/') {
539 } else if (ch == '=') {
551 decode_hex(const char **source)
557 for (nibble = 0; nibble < 2; ++nibble) {
559 ch = UChar(**source);
561 if (ch >= '0' && ch <= '9') {
563 } else if (ch >= 'A' && ch <= 'F') {
566 } else if (ch >= 'a' && ch <= 'f') {
579 decode_quickdump(char *target, const char *source)
584 if (!strncmp(source, "b64:", 4)) {
586 while (*source != '\0') {
588 int ch = lookup_b64(bits, &source);
589 if (ch < 0 || (ch + target - base) >= MAX_ENTRY_SIZE) {
594 *target++ = (char) ((bits[0] << 2) | (bits[1] >> 4));
596 *target++ = (char) ((bits[1] << 4) | (bits[2] >> 2));
598 *target++ = (char) ((bits[2] << 6) | bits[3]);
602 } else if (!strncmp(source, "hex:", 4)) {
604 while (*source != '\0') {
605 int ch = decode_hex(&source);
606 if (ch < 0 || (target - base) >= MAX_ENTRY_SIZE) {
610 *target++ = (char) ch;
618 * Build a terminfo pathname and try to read the data. Returns TGETENT_YES on
619 * success, TGETENT_NO on failure.
622 _nc_read_tic_entry(char *filename,
624 const char *const path,
628 int code = TGETENT_NO;
632 char buffer[MAX_ENTRY_SIZE + 1];
636 (T_CALLED("_nc_read_tic_entry(file=%p, path=%s, name=%s)"),
637 filename, path, name));
639 if ((used = decode_quickdump(buffer, path)) != 0
640 && (code = _nc_read_termtype(tp, buffer, used)) == TGETENT_YES
641 && _nc_name_match(tp->term_names, name, "|")) {
642 TR(TRACE_DATABASE, ("loaded quick-dump for %s", name));
645 if (make_db_filename(filename, limit, path)
646 && (capdbp = _nc_db_open(filename, FALSE)) != 0) {
650 char *save = strdup(name);
652 memset(&key, 0, sizeof(key));
654 key.size = strlen(save);
657 * This lookup could return termcap data, which we do not want. We are
658 * looking for compiled (binary) terminfo data.
660 * cgetent uses a two-level lookup. On the first it uses the given
661 * name to return a record containing only the aliases for an entry.
662 * On the second (using that list of aliases as a key), it returns the
663 * content of the terminal description. We expect second lookup to
664 * return data beginning with the same set of aliases.
666 * For compiled terminfo, the list of aliases in the second case will
667 * be null-terminated. A termcap entry will not be, and will run on
668 * into the description. So we can easily distinguish between the two
669 * (source/binary) by checking the lengths.
671 while (_nc_db_get(capdbp, &key, &data) == 0) {
672 char *have = (char *) data.data;
673 used = (int) data.size - 1;
676 if (data.size > key.size
677 && IS_TIC_MAGIC(have)) {
678 code = _nc_read_termtype(tp, have, used);
679 if (code == TGETENT_NO) {
680 _nc_free_termtype(tp);
687 * Just in case we have a corrupt database, do not waste time with
694 * Prepare for the second level.
701 } else /* may be either filesystem or flat file */
703 if (make_dir_filename(filename, limit, path, name)) {
704 code = _nc_read_file_entry(filename, tp);
706 #if NCURSES_USE_TERMCAP
707 else if (code != TGETENT_YES) {
708 code = _nc_read_termcap_entry(name, tp);
709 _nc_SPRINTF(filename, _nc_SLIMIT(PATH_MAX)
710 "%.*s", PATH_MAX - 1, _nc_get_source());
715 #endif /* NCURSES_USE_DATABASE */
718 * _nc_read_entry(char *name, char *filename, TERMTYPE *tp)
720 * Find and read the compiled entry for a given terminal type,
721 * if it exists. We take pains here to make sure no combination
722 * of environment variables and terminal type name can be used to
723 * overrun the file buffer.
727 _nc_read_entry(const char *const name, char *const filename, TERMTYPE *const tp)
729 int code = TGETENT_NO;
731 _nc_SPRINTF(filename, _nc_SLIMIT(PATH_MAX)
732 "%.*s", PATH_MAX - 1, name);
734 if (strlen(name) == 0
735 || strcmp(name, ".") == 0
736 || strcmp(name, "..") == 0
737 || _nc_pathlast(name) != 0
738 || strchr(name, NCURSES_PATHSEP) != 0) {
739 TR(TRACE_DATABASE, ("illegal or missing entry name '%s'", name));
741 #if NCURSES_USE_DATABASE
746 _nc_first_db(&state, &offset);
748 while ((path = _nc_next_db(&state, &offset)) != 0) {
749 code = _nc_read_tic_entry(filename, PATH_MAX, path, name, tp);
750 if (code == TGETENT_YES) {
755 #elif NCURSES_USE_TERMCAP
756 if (code != TGETENT_YES) {
757 code = _nc_read_termcap_entry(name, tp);
758 _nc_SPRINTF(filename, _nc_SLIMIT(PATH_MAX)
759 "%.*s", PATH_MAX - 1, _nc_get_source());