compile.c revision 1.10
1/* $NetBSD: compile.c,v 1.10 2017/02/11 14:57:15 roy Exp $ */ 2 3/* 4 * Copyright (c) 2009, 2010, 2011 The NetBSD Foundation, Inc. 5 * 6 * This code is derived from software contributed to The NetBSD Foundation 7 * by Roy Marples. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 */ 29 30#if HAVE_NBTOOL_CONFIG_H 31#include "nbtool_config.h" 32#endif 33 34#include <sys/cdefs.h> 35__RCSID("$NetBSD: compile.c,v 1.10 2017/02/11 14:57:15 roy Exp $"); 36 37#if !HAVE_NBTOOL_CONFIG_H || HAVE_SYS_ENDIAN_H 38#include <sys/endian.h> 39#endif 40 41#include <assert.h> 42#include <ctype.h> 43#include <err.h> 44#include <errno.h> 45#include <limits.h> 46#include <stdarg.h> 47#include <stdlib.h> 48#include <stdint.h> 49#include <stdio.h> 50#include <string.h> 51#include <term_private.h> 52#include <term.h> 53 54static void __printflike(2, 3) 55dowarn(int flags, const char *fmt, ...) 56{ 57 va_list va; 58 59 errno = EINVAL; 60 if (flags & TIC_WARNING) { 61 va_start(va, fmt); 62 vwarnx(fmt, va); 63 va_end(va); 64 } 65} 66 67char * 68_ti_grow_tbuf(TBUF *tbuf, size_t len) 69{ 70 char *buf; 71 size_t l; 72 73 _DIAGASSERT(tbuf != NULL); 74 75 l = tbuf->bufpos + len; 76 if (l > tbuf->buflen) { 77 if (tbuf->buflen == 0) 78 buf = malloc(l); 79 else 80 buf = realloc(tbuf->buf, l); 81 if (buf == NULL) 82 return NULL; 83 tbuf->buf = buf; 84 tbuf->buflen = l; 85 } 86 return tbuf->buf; 87} 88 89char * 90_ti_find_cap(TBUF *tbuf, char type, short ind) 91{ 92 size_t n; 93 short num; 94 char *cap; 95 96 _DIAGASSERT(tbuf != NULL); 97 98 cap = tbuf->buf; 99 for (n = tbuf->entries; n > 0; n--) { 100 num = le16dec(cap); 101 cap += sizeof(uint16_t); 102 if (num == ind) 103 return cap; 104 switch (type) { 105 case 'f': 106 cap++; 107 break; 108 case 'n': 109 cap += sizeof(uint16_t); 110 break; 111 case 's': 112 num = le16dec(cap); 113 cap += sizeof(uint16_t); 114 cap += num; 115 break; 116 } 117 } 118 119 errno = ESRCH; 120 return NULL; 121} 122 123char * 124_ti_find_extra(TBUF *tbuf, const char *code) 125{ 126 size_t n; 127 short num; 128 char *cap; 129 130 _DIAGASSERT(tbuf != NULL); 131 _DIAGASSERT(code != NULL); 132 133 cap = tbuf->buf; 134 for (n = tbuf->entries; n > 0; n--) { 135 num = le16dec(cap); 136 cap += sizeof(uint16_t); 137 if (strcmp(cap, code) == 0) 138 return cap + num; 139 cap += num; 140 switch (*cap++) { 141 case 'f': 142 cap++; 143 break; 144 case 'n': 145 cap += sizeof(uint16_t); 146 break; 147 case 's': 148 num = le16dec(cap); 149 cap += sizeof(uint16_t); 150 cap += num; 151 break; 152 } 153 } 154 155 errno = ESRCH; 156 return NULL; 157} 158 159size_t 160_ti_store_extra(TIC *tic, int wrn, char *id, char type, char flag, short num, 161 char *str, size_t strl, int flags) 162{ 163 size_t l; 164 165 _DIAGASSERT(tic != NULL); 166 167 if (strcmp(id, "use") != 0) { 168 if (_ti_find_extra(&tic->extras, id) != NULL) 169 return 0; 170 if (!(flags & TIC_EXTRA)) { 171 if (wrn != 0) 172 dowarn(flags, "%s: %s: unknown capability", 173 tic->name, id); 174 return 0; 175 } 176 } 177 178 l = strlen(id) + 1; 179 if (l > UINT16_T_MAX) { 180 dowarn(flags, "%s: %s: cap name is too long", tic->name, id); 181 return 0; 182 } 183 184 if (!_ti_grow_tbuf(&tic->extras, 185 l + strl + (sizeof(uint16_t) * 2) + 1)) 186 return 0; 187 le16enc(tic->extras.buf + tic->extras.bufpos, l); 188 tic->extras.bufpos += sizeof(uint16_t); 189 memcpy(tic->extras.buf + tic->extras.bufpos, id, l); 190 tic->extras.bufpos += l; 191 tic->extras.buf[tic->extras.bufpos++] = type; 192 switch (type) { 193 case 'f': 194 tic->extras.buf[tic->extras.bufpos++] = flag; 195 break; 196 case 'n': 197 le16enc(tic->extras.buf + tic->extras.bufpos, num); 198 tic->extras.bufpos += sizeof(uint16_t); 199 break; 200 case 's': 201 le16enc(tic->extras.buf + tic->extras.bufpos, strl); 202 tic->extras.bufpos += sizeof(uint16_t); 203 memcpy(tic->extras.buf + tic->extras.bufpos, str, strl); 204 tic->extras.bufpos += strl; 205 break; 206 } 207 tic->extras.entries++; 208 return 1; 209} 210 211ssize_t 212_ti_flatten(uint8_t **buf, const TIC *tic) 213{ 214 size_t buflen, len, alen, dlen; 215 uint8_t *cap; 216 217 _DIAGASSERT(buf != NULL); 218 _DIAGASSERT(tic != NULL); 219 220 len = strlen(tic->name) + 1; 221 if (tic->alias == NULL) 222 alen = 0; 223 else 224 alen = strlen(tic->alias) + 1; 225 if (tic->desc == NULL) 226 dlen = 0; 227 else 228 dlen = strlen(tic->desc) + 1; 229 buflen = sizeof(char) + 230 sizeof(uint16_t) + len + 231 sizeof(uint16_t) + alen + 232 sizeof(uint16_t) + dlen + 233 (sizeof(uint16_t) * 2) + tic->flags.bufpos + 234 (sizeof(uint16_t) * 2) + tic->nums.bufpos + 235 (sizeof(uint16_t) * 2) + tic->strs.bufpos + 236 (sizeof(uint16_t) * 2) + tic->extras.bufpos; 237 *buf = malloc(buflen); 238 if (*buf == NULL) 239 return -1; 240 241 cap = *buf; 242 *cap++ = 1; 243 le16enc(cap, len); 244 cap += sizeof(uint16_t); 245 memcpy(cap, tic->name, len); 246 cap += len; 247 248 le16enc(cap, alen); 249 cap += sizeof(uint16_t); 250 if (tic->alias != NULL) { 251 memcpy(cap, tic->alias, alen); 252 cap += alen; 253 } 254 le16enc(cap, dlen); 255 cap += sizeof(uint16_t); 256 if (tic->desc != NULL) { 257 memcpy(cap, tic->desc, dlen); 258 cap += dlen; 259 } 260 261 if (tic->flags.entries == 0) { 262 le16enc(cap, 0); 263 cap += sizeof(uint16_t); 264 } else { 265 le16enc(cap, (tic->flags.bufpos + sizeof(uint16_t))); 266 cap += sizeof(uint16_t); 267 le16enc(cap, tic->flags.entries); 268 cap += sizeof(uint16_t); 269 memcpy(cap, tic->flags.buf, tic->flags.bufpos); 270 cap += tic->flags.bufpos; 271 } 272 273 if (tic->nums.entries == 0) { 274 le16enc(cap, 0); 275 cap += sizeof(uint16_t); 276 } else { 277 le16enc(cap, (tic->nums.bufpos + sizeof(uint16_t))); 278 cap += sizeof(uint16_t); 279 le16enc(cap, tic->nums.entries); 280 cap += sizeof(uint16_t); 281 memcpy(cap, tic->nums.buf, tic->nums.bufpos); 282 cap += tic->nums.bufpos; 283 } 284 285 if (tic->strs.entries == 0) { 286 le16enc(cap, 0); 287 cap += sizeof(uint16_t); 288 } else { 289 le16enc(cap, (tic->strs.bufpos + sizeof(uint16_t))); 290 cap += sizeof(uint16_t); 291 le16enc(cap, tic->strs.entries); 292 cap += sizeof(uint16_t); 293 memcpy(cap, tic->strs.buf, tic->strs.bufpos); 294 cap += tic->strs.bufpos; 295 } 296 297 if (tic->extras.entries == 0) { 298 le16enc(cap, 0); 299 cap += sizeof(uint16_t); 300 } else { 301 le16enc(cap, (tic->extras.bufpos + sizeof(uint16_t))); 302 cap += sizeof(uint16_t); 303 le16enc(cap, tic->extras.entries); 304 cap += sizeof(uint16_t); 305 memcpy(cap, tic->extras.buf, tic->extras.bufpos); 306 cap += tic->extras.bufpos; 307 } 308 309 return cap - *buf; 310} 311 312static int 313encode_string(const char *term, const char *cap, TBUF *tbuf, const char *str, 314 int flags) 315{ 316 int slash, i, num; 317 char ch, *p, *s, last; 318 319 if (_ti_grow_tbuf(tbuf, strlen(str) + 1) == NULL) 320 return -1; 321 p = s = tbuf->buf + tbuf->bufpos; 322 slash = 0; 323 last = '\0'; 324 /* Convert escape codes */ 325 while ((ch = *str++) != '\0') { 326 if (ch == '\n') { 327 /* Following a newline, strip leading whitespace from 328 * capability strings. */ 329 while (isspace((unsigned char)*str)) 330 str++; 331 continue; 332 } 333 if (slash == 0 && ch == '\\') { 334 slash = 1; 335 continue; 336 } 337 if (slash == 0) { 338 if (last != '%' && ch == '^') { 339 ch = *str++; 340 if (((unsigned char)ch) >= 128) 341 dowarn(flags, 342 "%s: %s: illegal ^ character", 343 term, cap); 344 if (ch == '\0') 345 break; 346 if (ch == '?') 347 ch = '\177'; 348 else if ((ch &= 037) == 0) 349 ch = (char)128; 350 } 351 *p++ = ch; 352 last = ch; 353 continue; 354 } 355 slash = 0; 356 if (ch >= '0' && ch <= '7') { 357 num = ch - '0'; 358 for (i = 0; i < 2; i++) { 359 if (*str < '0' || *str > '7') { 360 if (isdigit((unsigned char)*str)) 361 dowarn(flags, 362 "%s: %s: non octal" 363 " digit", term, cap); 364 else 365 break; 366 } 367 num = num * 8 + *str++ - '0'; 368 } 369 if (num == 0) 370 num = 0200; 371 *p++ = (char)num; 372 continue; 373 } 374 switch (ch) { 375 case 'a': 376 *p++ = '\a'; 377 break; 378 case 'b': 379 *p++ = '\b'; 380 break; 381 case 'e': /* FALLTHROUGH */ 382 case 'E': 383 *p++ = '\033'; 384 break; 385 case 'f': 386 *p++ = '\014'; 387 break; 388 case 'l': /* FALLTHROUGH */ 389 case 'n': 390 *p++ = '\n'; 391 break; 392 case 'r': 393 *p++ = '\r'; 394 break; 395 case 's': 396 *p++ = ' '; 397 break; 398 case 't': 399 *p++ = '\t'; 400 break; 401 default: 402 /* We should warn here */ 403 case '^': 404 case ',': 405 case ':': 406 case '|': 407 *p++ = ch; 408 break; 409 } 410 last = ch; 411 } 412 *p++ = '\0'; 413 tbuf->bufpos += p - s; 414 return 0; 415} 416 417char * 418_ti_get_token(char **cap, char sep) 419{ 420 char esc, *token; 421 422 while (isspace((unsigned char)**cap)) 423 (*cap)++; 424 if (**cap == '\0') 425 return NULL; 426 427 /* We can't use stresep(3) as ^ we need two escape chars */ 428 esc = '\0'; 429 for (token = *cap; 430 **cap != '\0' && (esc != '\0' || **cap != sep); 431 (*cap)++) 432 { 433 if (esc == '\0') { 434 if (**cap == '\\' || **cap == '^') 435 esc = **cap; 436 } else { 437 /* termcap /E/ is valid */ 438 if (sep == ':' && esc == '\\' && **cap == 'E') 439 esc = 'x'; 440 else 441 esc = '\0'; 442 } 443 } 444 445 if (**cap != '\0') 446 *(*cap)++ = '\0'; 447 448 return token; 449} 450 451TIC * 452_ti_compile(char *cap, int flags) 453{ 454 char *token, *p, *e, *name, *desc, *alias; 455 signed char flag; 456 long cnum; 457 short num; 458 ssize_t ind; 459 size_t len; 460 TBUF buf; 461 TIC *tic; 462 463 _DIAGASSERT(cap != NULL); 464 465 name = _ti_get_token(&cap, ','); 466 if (name == NULL) { 467 dowarn(flags, "no seperator found: %s", cap); 468 return NULL; 469 } 470 desc = strrchr(name, '|'); 471 if (desc != NULL) 472 *desc++ = '\0'; 473 alias = strchr(name, '|'); 474 if (alias != NULL) 475 *alias++ = '\0'; 476 477 tic = calloc(sizeof(*tic), 1); 478 if (tic == NULL) 479 return NULL; 480 481 buf.buf = NULL; 482 buf.buflen = 0; 483 484 tic->name = strdup(name); 485 if (tic->name == NULL) 486 goto error; 487 if (alias != NULL && flags & TIC_ALIAS) { 488 tic->alias = strdup(alias); 489 if (tic->alias == NULL) 490 goto error; 491 } 492 if (desc != NULL && flags & TIC_DESCRIPTION) { 493 tic->desc = strdup(desc); 494 if (tic->desc == NULL) 495 goto error; 496 } 497 498 for (token = _ti_get_token(&cap, ','); 499 token != NULL && *token != '\0'; 500 token = _ti_get_token(&cap, ',')) 501 { 502 /* Skip commented caps */ 503 if (!(flags & TIC_COMMENT) && token[0] == '.') 504 continue; 505 506 /* Obsolete entries */ 507 if (token[0] == 'O' && token[1] == 'T') { 508 if (!(flags & TIC_EXTRA)) 509 continue; 510 token += 2; 511 } 512 513 /* str cap */ 514 p = strchr(token, '='); 515 if (p != NULL) { 516 *p++ = '\0'; 517 /* Don't use the string if we already have it */ 518 ind = _ti_strindex(token); 519 if (ind != -1 && 520 _ti_find_cap(&tic->strs, 's', ind) != NULL) 521 continue; 522 523 /* Encode the string to our scratch buffer */ 524 buf.bufpos = 0; 525 if (encode_string(tic->name, token, 526 &buf, p, flags) == -1) 527 goto error; 528 if (buf.bufpos > UINT16_T_MAX) { 529 dowarn(flags, "%s: %s: string is too long", 530 tic->name, token); 531 continue; 532 } 533 if (!VALID_STRING(buf.buf)) { 534 dowarn(flags, "%s: %s: invalid string", 535 tic->name, token); 536 continue; 537 } 538 539 if (ind == -1) 540 _ti_store_extra(tic, 1, token, 's', -1, -2, 541 buf.buf, buf.bufpos, flags); 542 else { 543 if (!_ti_grow_tbuf(&tic->strs, 544 (sizeof(uint16_t) * 2) + buf.bufpos)) 545 goto error; 546 le16enc(tic->strs.buf + tic->strs.bufpos, ind); 547 tic->strs.bufpos += sizeof(uint16_t); 548 le16enc(tic->strs.buf + tic->strs.bufpos, 549 buf.bufpos); 550 tic->strs.bufpos += sizeof(uint16_t); 551 memcpy(tic->strs.buf + tic->strs.bufpos, 552 buf.buf, buf.bufpos); 553 tic->strs.bufpos += buf.bufpos; 554 tic->strs.entries++; 555 } 556 continue; 557 } 558 559 /* num cap */ 560 p = strchr(token, '#'); 561 if (p != NULL) { 562 *p++ = '\0'; 563 /* Don't use the number if we already have it */ 564 ind = _ti_numindex(token); 565 if (ind != -1 && 566 _ti_find_cap(&tic->nums, 'n', ind) != NULL) 567 continue; 568 569 cnum = strtol(p, &e, 0); 570 if (*e != '\0') { 571 dowarn(flags, "%s: %s: not a number", 572 tic->name, token); 573 continue; 574 } 575 if (!VALID_NUMERIC(cnum)) { 576 dowarn(flags, "%s: %s: number out of range", 577 tic->name, token); 578 continue; 579 } 580 num = (short)cnum; 581 if (ind == -1) 582 _ti_store_extra(tic, 1, token, 'n', -1, 583 num, NULL, 0, flags); 584 else { 585 if (_ti_grow_tbuf(&tic->nums, 586 sizeof(uint16_t) * 2) == NULL) 587 goto error; 588 le16enc(tic->nums.buf + tic->nums.bufpos, ind); 589 tic->nums.bufpos += sizeof(uint16_t); 590 le16enc(tic->nums.buf + tic->nums.bufpos, num); 591 tic->nums.bufpos += sizeof(uint16_t); 592 tic->nums.entries++; 593 } 594 continue; 595 } 596 597 flag = 1; 598 len = strlen(token) - 1; 599 if (token[len] == '@') { 600 flag = CANCELLED_BOOLEAN; 601 token[len] = '\0'; 602 } 603 ind = _ti_flagindex(token); 604 if (ind == -1 && flag == CANCELLED_BOOLEAN) { 605 if ((ind = _ti_numindex(token)) != -1) { 606 if (_ti_find_cap(&tic->nums, 'n', ind) != NULL) 607 continue; 608 if (_ti_grow_tbuf(&tic->nums, 609 sizeof(uint16_t) * 2) == NULL) 610 goto error; 611 le16enc(tic->nums.buf + tic->nums.bufpos, ind); 612 tic->nums.bufpos += sizeof(uint16_t); 613 le16enc(tic->nums.buf + tic->nums.bufpos, 614 (uint16_t)CANCELLED_NUMERIC); 615 tic->nums.bufpos += sizeof(uint16_t); 616 tic->nums.entries++; 617 continue; 618 } else if ((ind = _ti_strindex(token)) != -1) { 619 if (_ti_find_cap(&tic->strs, 's', ind) != NULL) 620 continue; 621 if (_ti_grow_tbuf(&tic->strs, 622 (sizeof(uint16_t) * 2) + 1) == NULL) 623 goto error; 624 le16enc(tic->strs.buf + tic->strs.bufpos, ind); 625 tic->strs.bufpos += sizeof(uint16_t); 626 le16enc(tic->strs.buf + tic->strs.bufpos, 0); 627 tic->strs.bufpos += sizeof(uint16_t); 628 tic->strs.entries++; 629 continue; 630 } 631 } 632 if (ind == -1) 633 _ti_store_extra(tic, 1, token, 'f', flag, 0, NULL, 0, 634 flags); 635 else if (_ti_find_cap(&tic->flags, 'f', ind) == NULL) { 636 if (_ti_grow_tbuf(&tic->flags, sizeof(uint16_t) + 1) 637 == NULL) 638 goto error; 639 le16enc(tic->flags.buf + tic->flags.bufpos, ind); 640 tic->flags.bufpos += sizeof(uint16_t); 641 tic->flags.buf[tic->flags.bufpos++] = flag; 642 tic->flags.entries++; 643 } 644 } 645 646 free(buf.buf); 647 return tic; 648 649error: 650 free(buf.buf); 651 _ti_freetic(tic); 652 return NULL; 653} 654 655void 656_ti_freetic(TIC *tic) 657{ 658 659 if (tic != NULL) { 660 free(tic->name); 661 free(tic->alias); 662 free(tic->desc); 663 free(tic->extras.buf); 664 free(tic->flags.buf); 665 free(tic->nums.buf); 666 free(tic->strs.buf); 667 free(tic); 668 } 669} 670