/* $NetBSD: term.c,v 1.13.4.1 2012/06/23 22:54:57 riz Exp $ */ /* * Copyright (c) 2009, 2010, 2011 The NetBSD Foundation, Inc. * * This code is derived from software contributed to The NetBSD Foundation * by Roy Marples. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include __RCSID("$NetBSD: term.c,v 1.13.4.1 2012/06/23 22:54:57 riz Exp $"); #include #include #include #include #include #include #include #include #include #include #include #include #define _PATH_TERMINFO "/usr/share/misc/terminfo" static char database[PATH_MAX]; static char pathbuf[PATH_MAX]; const char *_ti_database; /* Include a generated list of pre-compiled terminfo descriptions. */ #include "compiled_terms.c" static int _ti_readterm(TERMINAL *term, const char *cap, size_t caplen, int flags) { uint8_t ver; uint16_t ind, num; size_t len; TERMUSERDEF *ud; ver = *cap++; /* Only read version 1 structures */ if (ver != 1) { errno = EINVAL; return -1; } term->flags = calloc(TIFLAGMAX + 1, sizeof(char)); if (term->flags == NULL) return -1; term->nums = malloc((TINUMMAX + 1) * sizeof(short)); if (term->nums == NULL) return -1; memset(term->nums, (short)-1, (TINUMMAX + 1) * sizeof(short)); term->strs = calloc(TISTRMAX + 1, sizeof(char *)); if (term->strs == NULL) return -1; term->_arealen = caplen; term->_area = malloc(term->_arealen); if (term->_area == NULL) return -1; memcpy(term->_area, cap, term->_arealen); cap = term->_area; len = le16dec(cap); cap += sizeof(uint16_t); term->name = cap; cap += len; len = le16dec(cap); cap += sizeof(uint16_t); if (len == 0) term->_alias = NULL; else { term->_alias = cap; cap += len; } len = le16dec(cap); cap += sizeof(uint16_t); if (len == 0) term->desc = NULL; else { term->desc = cap; cap += len; } num = le16dec(cap); cap += sizeof(uint16_t); if (num != 0) { num = le16dec(cap); cap += sizeof(uint16_t); for (; num != 0; num--) { ind = le16dec(cap); cap += sizeof(uint16_t); term->flags[ind] = *cap++; if (flags == 0 && !VALID_BOOLEAN(term->flags[ind])) term->flags[ind] = 0; } } num = le16dec(cap); cap += sizeof(uint16_t); if (num != 0) { num = le16dec(cap); cap += sizeof(uint16_t); for (; num != 0; num--) { ind = le16dec(cap); cap += sizeof(uint16_t); term->nums[ind] = le16dec(cap); if (flags == 0 && !VALID_NUMERIC(term->nums[ind])) term->nums[ind] = ABSENT_NUMERIC; cap += sizeof(uint16_t); } } num = le16dec(cap); cap += sizeof(uint16_t); if (num != 0) { num = le16dec(cap); cap += sizeof(uint16_t); for (; num != 0; num--) { ind = le16dec(cap); cap += sizeof(uint16_t); len = le16dec(cap); cap += sizeof(uint16_t); if (len > 0) term->strs[ind] = cap; else if (flags == 0) term->strs[ind] = ABSENT_STRING; else term->strs[ind] = CANCELLED_STRING; cap += len; } } num = le16dec(cap); cap += sizeof(uint16_t); if (num != 0) { term->_nuserdefs = le16dec(cap); term->_userdefs = malloc(sizeof(*term->_userdefs) * num); cap += sizeof(uint16_t); for (num = 0; num < term->_nuserdefs; num++) { ud = &term->_userdefs[num]; len = le16dec(cap); cap += sizeof(uint16_t); ud->id = cap; cap += len; ud->type = *cap++; switch (ud->type) { case 'f': ud->flag = *cap++; if (flags == 0 && !VALID_BOOLEAN(ud->flag)) ud->flag = 0; ud->num = ABSENT_NUMERIC; ud->str = ABSENT_STRING; break; case 'n': ud->flag = ABSENT_BOOLEAN; ud->num = le16dec(cap); if (flags == 0 && !VALID_NUMERIC(ud->num)) ud->num = ABSENT_NUMERIC; ud->str = ABSENT_STRING; cap += sizeof(uint16_t); break; case 's': ud->flag = ABSENT_BOOLEAN; ud->num = ABSENT_NUMERIC; len = le16dec(cap); cap += sizeof(uint16_t); if (len > 0) ud->str = cap; else if (flags == 0) ud->str = ABSENT_STRING; else ud->str = CANCELLED_STRING; cap += len; break; default: errno = EINVAL; return -1; } } } return 1; } static int _ti_dbgetterm(TERMINAL *term, const char *path, const char *name, int flags) { struct cdbr *db; const void *data; char *db_name; const uint8_t *data8; size_t len, klen; int r; if (asprintf(&db_name, "%s.cdb", path) < 0) return -1; db = cdbr_open(db_name, CDBR_DEFAULT); free(db_name); if (db == NULL) return -1; klen = strlen(name) + 1; if (cdbr_find(db, name, klen, &data, &len) == -1) goto fail; data8 = data; if (len == 0) goto fail; /* Check for alias first, fall through to processing normal entries. */ if (data8[0] == 2) { if (klen + 7 > len || le16dec(data8 + 5) != klen) goto fail; if (memcmp(data8 + 7, name, klen)) goto fail; if (cdbr_get(db, le32dec(data8 + 1), &data, &len)) goto fail; data8 = data; if (data8[0] != 1) goto fail; } else if (data8[0] != 1) goto fail; else if (klen + 3 >= len || le16dec(data8 + 1) != klen) goto fail; else if (memcmp(data8 + 3, name, klen)) goto fail; strlcpy(database, path, sizeof(database)); _ti_database = database; r = _ti_readterm(term, data, len, flags); cdbr_close(db); return r; fail: cdbr_close(db); return 0; } static int _ti_dbgettermp(TERMINAL *term, const char *path, const char *name, int flags) { const char *p; size_t l; int r, e; e = -1; r = 0; do { for (p = path; *path != '\0' && *path != ':'; path++) continue; l = path - p; if (l != 0 && l + 1 < sizeof(pathbuf)) { memcpy(pathbuf, p, l); pathbuf[l] = '\0'; r = _ti_dbgetterm(term, pathbuf, name, flags); if (r == 1) return 1; if (r == 0) e = 0; } } while (*path++ == ':'); return e; } static int ticcmp(const TIC *tic, const char *name) { char *alias, *s; size_t len, l; if (strcmp(tic->name, name) == 0) return 0; if (tic->alias == NULL) return -1; len = strlen(name); alias = tic->alias; while (*alias != '\0') { s = strchr(alias, '|'); if (s == NULL) l = strlen(alias); else l = s - alias; if (len == l && memcmp(alias, name, l) == 0) return 0; if (s == NULL) break; alias = s + 1; } return 1; } static int _ti_findterm(TERMINAL *term, const char *name, int flags) { int r; char *c, *e, h[PATH_MAX]; TIC *tic; uint8_t *f; ssize_t len; _DIAGASSERT(term != NULL); _DIAGASSERT(name != NULL); database[0] = '\0'; _ti_database = NULL; r = 0; if ((e = getenv("TERMINFO")) != NULL && *e != '\0') if (e[0] == '/') return _ti_dbgetterm(term, e, name, flags); c = NULL; if (e == NULL && (c = getenv("TERMCAP")) != NULL) { if (*c != '\0' && *c != '/') { c = strdup(c); if (c != NULL) { e = captoinfo(c); free(c); } } } if (e != NULL) { if (c == NULL) e = strdup(e); /* So we don't destroy env */ if (e == NULL) tic = NULL; else tic = _ti_compile(e, TIC_WARNING | TIC_ALIAS | TIC_DESCRIPTION | TIC_EXTRA); if (c == NULL && e != NULL) free(e); if (tic != NULL && ticcmp(tic, name) == 0) { len = _ti_flatten(&f, tic); if (len != -1) { r = _ti_readterm(term, (char *)f, (size_t)len, flags); free(f); } } _ti_freetic(tic); if (r == 1) { if (c == NULL) _ti_database = "$TERMINFO"; else _ti_database = "$TERMCAP"; return r; } } if ((e = getenv("TERMINFO_DIRS")) != NULL) return _ti_dbgettermp(term, e, name, flags); if ((e = getenv("HOME")) != NULL) { snprintf(h, sizeof(h), "%s/.terminfo", e); r = _ti_dbgetterm(term, h, name, flags); } if (r != 1) r = _ti_dbgettermp(term, _PATH_TERMINFO, name, flags); return r; } int _ti_getterm(TERMINAL *term, const char *name, int flags) { int r; size_t i; const struct compiled_term *t; r = _ti_findterm(term, name, flags); if (r == 1) return r; for (i = 0; i < __arraycount(compiled_terms); i++) { t = &compiled_terms[i]; if (strcmp(name, t->name) == 0) { r = _ti_readterm(term, t->cap, t->caplen, flags); break; } } return r; }