PageRenderTime 27ms CodeModel.GetById 15ms RepoModel.GetById 0ms app.codeStats 1ms

/usr.bin/m4/gnum4.c

https://bitbucket.org/freebsd/freebsd-base
C | 696 lines | 558 code | 69 blank | 69 comment | 150 complexity | 39009be0673bd6beaf2c7c219e3b97f0 MD5 | raw file
  1. /* $OpenBSD: gnum4.c,v 1.52 2017/08/21 21:41:13 deraadt Exp $ */
  2. /*-
  3. * SPDX-License-Identifier: BSD-2-Clause
  4. *
  5. * Copyright (c) 1999 Marc Espie
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions
  9. * are met:
  10. * 1. Redistributions of source code must retain the above copyright
  11. * notice, this list of conditions and the following disclaimer.
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  17. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  20. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  22. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  23. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  24. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  25. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  26. * SUCH DAMAGE.
  27. */
  28. #include <sys/cdefs.h>
  29. __FBSDID("$FreeBSD$");
  30. /*
  31. * functions needed to support gnu-m4 extensions, including a fake freezing
  32. */
  33. #include <sys/types.h>
  34. #include <sys/wait.h>
  35. #include <ctype.h>
  36. #include <err.h>
  37. #include <paths.h>
  38. #include <regex.h>
  39. #include <stdarg.h>
  40. #include <stddef.h>
  41. #include <stdlib.h>
  42. #include <stdint.h>
  43. #include <stdio.h>
  44. #include <string.h>
  45. #include <errno.h>
  46. #include <unistd.h>
  47. #include <limits.h>
  48. #include "mdef.h"
  49. #include "stdd.h"
  50. #include "extern.h"
  51. int mimic_gnu = 0;
  52. /*
  53. * Support for include path search
  54. * First search in the current directory.
  55. * If not found, and the path is not absolute, include path kicks in.
  56. * First, -I options, in the order found on the command line.
  57. * Then M4PATH env variable
  58. */
  59. static struct path_entry {
  60. char *name;
  61. struct path_entry *next;
  62. } *first, *last;
  63. static struct path_entry *new_path_entry(const char *);
  64. static void ensure_m4path(void);
  65. static struct input_file *dopath(struct input_file *, const char *);
  66. static struct path_entry *
  67. new_path_entry(const char *dirname)
  68. {
  69. struct path_entry *n;
  70. n = malloc(sizeof(struct path_entry));
  71. if (!n)
  72. errx(1, "out of memory");
  73. n->name = xstrdup(dirname);
  74. n->next = 0;
  75. return n;
  76. }
  77. void
  78. addtoincludepath(const char *dirname)
  79. {
  80. struct path_entry *n;
  81. n = new_path_entry(dirname);
  82. if (last) {
  83. last->next = n;
  84. last = n;
  85. }
  86. else
  87. last = first = n;
  88. }
  89. static void
  90. ensure_m4path(void)
  91. {
  92. static int envpathdone = 0;
  93. char *envpath;
  94. char *sweep;
  95. char *path;
  96. if (envpathdone)
  97. return;
  98. envpathdone = TRUE;
  99. envpath = getenv("M4PATH");
  100. if (!envpath)
  101. return;
  102. /* for portability: getenv result is read-only */
  103. envpath = xstrdup(envpath);
  104. for (sweep = envpath;
  105. (path = strsep(&sweep, ":")) != NULL;)
  106. addtoincludepath(path);
  107. free(envpath);
  108. }
  109. static
  110. struct input_file *
  111. dopath(struct input_file *i, const char *filename)
  112. {
  113. char path[PATH_MAX];
  114. struct path_entry *pe;
  115. FILE *f;
  116. for (pe = first; pe; pe = pe->next) {
  117. snprintf(path, sizeof(path), "%s/%s", pe->name, filename);
  118. if ((f = fopen(path, "r")) != NULL) {
  119. set_input(i, f, path);
  120. return i;
  121. }
  122. }
  123. return NULL;
  124. }
  125. struct input_file *
  126. fopen_trypath(struct input_file *i, const char *filename)
  127. {
  128. FILE *f;
  129. f = fopen(filename, "r");
  130. if (f != NULL) {
  131. set_input(i, f, filename);
  132. return i;
  133. }
  134. if (filename[0] == '/')
  135. return NULL;
  136. ensure_m4path();
  137. return dopath(i, filename);
  138. }
  139. void
  140. doindir(const char *argv[], int argc)
  141. {
  142. ndptr n;
  143. struct macro_definition *p = NULL;
  144. n = lookup(argv[2]);
  145. if (n == NULL || (p = macro_getdef(n)) == NULL)
  146. m4errx(1, "indir: undefined macro %s.", argv[2]);
  147. argv[1] = p->defn;
  148. eval(argv+1, argc-1, p->type, is_traced(n));
  149. }
  150. void
  151. dobuiltin(const char *argv[], int argc)
  152. {
  153. ndptr p;
  154. argv[1] = NULL;
  155. p = macro_getbuiltin(argv[2]);
  156. if (p != NULL)
  157. eval(argv+1, argc-1, macro_builtin_type(p), is_traced(p));
  158. else
  159. m4errx(1, "unknown builtin %s.", argv[2]);
  160. }
  161. /* We need some temporary buffer space, as pb pushes BACK and substitution
  162. * proceeds forward... */
  163. static char *buffer;
  164. static size_t bufsize = 0;
  165. static size_t current = 0;
  166. static void addchars(const char *, size_t);
  167. static void addchar(int);
  168. static char *twiddle(const char *);
  169. static char *getstring(void);
  170. static void exit_regerror(int, regex_t *, const char *);
  171. static void do_subst(const char *, regex_t *, const char *, const char *,
  172. regmatch_t *);
  173. static void do_regexpindex(const char *, regex_t *, const char *, regmatch_t *);
  174. static void do_regexp(const char *, regex_t *, const char *, const char *,
  175. regmatch_t *);
  176. static void add_sub(int, const char *, regex_t *, regmatch_t *);
  177. static void add_replace(const char *, regex_t *, const char *, regmatch_t *);
  178. #define addconstantstring(s) addchars((s), sizeof(s)-1)
  179. static void
  180. addchars(const char *c, size_t n)
  181. {
  182. if (n == 0)
  183. return;
  184. while (current + n > bufsize) {
  185. if (bufsize == 0)
  186. bufsize = 1024;
  187. else if (bufsize <= SIZE_MAX/2) {
  188. bufsize *= 2;
  189. } else {
  190. errx(1, "size overflow");
  191. }
  192. buffer = xrealloc(buffer, bufsize, NULL);
  193. }
  194. memcpy(buffer+current, c, n);
  195. current += n;
  196. }
  197. static void
  198. addchar(int c)
  199. {
  200. if (current +1 > bufsize) {
  201. if (bufsize == 0)
  202. bufsize = 1024;
  203. else
  204. bufsize *= 2;
  205. buffer = xrealloc(buffer, bufsize, NULL);
  206. }
  207. buffer[current++] = c;
  208. }
  209. static char *
  210. getstring(void)
  211. {
  212. addchar('\0');
  213. current = 0;
  214. return buffer;
  215. }
  216. static void
  217. exit_regerror(int er, regex_t *re, const char *source)
  218. {
  219. size_t errlen;
  220. char *errbuf;
  221. errlen = regerror(er, re, NULL, 0);
  222. errbuf = xalloc(errlen,
  223. "malloc in regerror: %lu", (unsigned long)errlen);
  224. regerror(er, re, errbuf, errlen);
  225. m4errx(1, "regular expression error in %s: %s.", source, errbuf);
  226. }
  227. /* warnx() plus check to see if we need to change exit code or exit .
  228. * -E flag functionality.
  229. */
  230. void
  231. m4_warnx(const char *fmt, ...)
  232. {
  233. va_list ap;
  234. va_start(ap, fmt);
  235. warnx(fmt, ap);
  236. va_end(ap);
  237. if (fatal_warns)
  238. exit(1);
  239. if (error_warns)
  240. exit_code = 1;
  241. }
  242. static void
  243. add_sub(int n, const char *string, regex_t *re, regmatch_t *pm)
  244. {
  245. if (n > (int)re->re_nsub)
  246. m4_warnx("No subexpression %d", n);
  247. /* Subexpressions that did not match are
  248. * not an error. */
  249. else if (pm[n].rm_so != -1 &&
  250. pm[n].rm_eo != -1) {
  251. addchars(string + pm[n].rm_so,
  252. pm[n].rm_eo - pm[n].rm_so);
  253. }
  254. }
  255. /* Add replacement string to the output buffer, recognizing special
  256. * constructs and replacing them with substrings of the original string.
  257. */
  258. static void
  259. add_replace(const char *string, regex_t *re, const char *replace, regmatch_t *pm)
  260. {
  261. const char *p;
  262. for (p = replace; *p != '\0'; p++) {
  263. if (*p == '&' && !mimic_gnu) {
  264. add_sub(0, string, re, pm);
  265. continue;
  266. }
  267. if (*p == '\\') {
  268. if (p[1] == '\\') {
  269. addchar(p[1]);
  270. p++;
  271. continue;
  272. }
  273. if (p[1] == '&') {
  274. if (mimic_gnu)
  275. add_sub(0, string, re, pm);
  276. else
  277. addchar(p[1]);
  278. p++;
  279. continue;
  280. }
  281. if (isdigit((unsigned char)p[1])) {
  282. add_sub(*(++p) - '0', string, re, pm);
  283. continue;
  284. }
  285. }
  286. addchar(*p);
  287. }
  288. }
  289. static void
  290. do_subst(const char *string, regex_t *re, const char *source,
  291. const char *replace, regmatch_t *pm)
  292. {
  293. int error;
  294. int flags = 0;
  295. const char *last_match = NULL;
  296. while ((error = regexec(re, string, re->re_nsub+1, pm, flags)) == 0) {
  297. if (pm[0].rm_eo != 0) {
  298. if (string[pm[0].rm_eo-1] == '\n')
  299. flags = 0;
  300. else
  301. flags = REG_NOTBOL;
  302. }
  303. /* NULL length matches are special... We use the `vi-mode'
  304. * rule: don't allow a NULL-match at the last match
  305. * position.
  306. */
  307. if (pm[0].rm_so == pm[0].rm_eo &&
  308. string + pm[0].rm_so == last_match) {
  309. if (*string == '\0')
  310. return;
  311. addchar(*string);
  312. if (*string++ == '\n')
  313. flags = 0;
  314. else
  315. flags = REG_NOTBOL;
  316. continue;
  317. }
  318. last_match = string + pm[0].rm_so;
  319. addchars(string, pm[0].rm_so);
  320. add_replace(string, re, replace, pm);
  321. string += pm[0].rm_eo;
  322. }
  323. if (error != REG_NOMATCH)
  324. exit_regerror(error, re, source);
  325. pbstr(string);
  326. }
  327. static void
  328. do_regexp(const char *string, regex_t *re, const char *source,
  329. const char *replace, regmatch_t *pm)
  330. {
  331. int error;
  332. switch(error = regexec(re, string, re->re_nsub+1, pm, 0)) {
  333. case 0:
  334. add_replace(string, re, replace, pm);
  335. pbstr(getstring());
  336. break;
  337. case REG_NOMATCH:
  338. break;
  339. default:
  340. exit_regerror(error, re, source);
  341. }
  342. }
  343. static void
  344. do_regexpindex(const char *string, regex_t *re, const char *source,
  345. regmatch_t *pm)
  346. {
  347. int error;
  348. switch(error = regexec(re, string, re->re_nsub+1, pm, 0)) {
  349. case 0:
  350. pbunsigned(pm[0].rm_so);
  351. break;
  352. case REG_NOMATCH:
  353. pbnum(-1);
  354. break;
  355. default:
  356. exit_regerror(error, re, source);
  357. }
  358. }
  359. /* In Gnu m4 mode, parentheses for backmatch don't work like POSIX 1003.2
  360. * says. So we twiddle with the regexp before passing it to regcomp.
  361. */
  362. static char *
  363. twiddle(const char *p)
  364. {
  365. /* + at start of regexp is a normal character for Gnu m4 */
  366. if (*p == '^') {
  367. addchar(*p);
  368. p++;
  369. }
  370. if (*p == '+') {
  371. addchar('\\');
  372. }
  373. /* This could use strcspn for speed... */
  374. while (*p != '\0') {
  375. if (*p == '\\') {
  376. switch(p[1]) {
  377. case '(':
  378. case ')':
  379. case '|':
  380. addchar(p[1]);
  381. break;
  382. case 'w':
  383. addconstantstring("[_a-zA-Z0-9]");
  384. break;
  385. case 'W':
  386. addconstantstring("[^_a-zA-Z0-9]");
  387. break;
  388. case '<':
  389. addconstantstring("[[:<:]]");
  390. break;
  391. case '>':
  392. addconstantstring("[[:>:]]");
  393. break;
  394. default:
  395. addchars(p, 2);
  396. break;
  397. }
  398. p+=2;
  399. continue;
  400. }
  401. if (*p == '(' || *p == ')' || *p == '|')
  402. addchar('\\');
  403. addchar(*p);
  404. p++;
  405. }
  406. return getstring();
  407. }
  408. /* patsubst(string, regexp, opt replacement) */
  409. /* argv[2]: string
  410. * argv[3]: regexp
  411. * argv[4]: opt rep
  412. */
  413. void
  414. dopatsubst(const char *argv[], int argc)
  415. {
  416. if (argc <= 3) {
  417. m4_warnx("Too few arguments to patsubst");
  418. return;
  419. }
  420. /* special case: empty regexp */
  421. if (argv[3][0] == '\0') {
  422. const char *s;
  423. size_t len;
  424. if (argc > 4 && argv[4])
  425. len = strlen(argv[4]);
  426. else
  427. len = 0;
  428. for (s = argv[2]; *s != '\0'; s++) {
  429. addchars(argv[4], len);
  430. addchar(*s);
  431. }
  432. } else {
  433. int error;
  434. regex_t re;
  435. regmatch_t *pmatch;
  436. int mode = REG_EXTENDED;
  437. const char *source;
  438. size_t l = strlen(argv[3]);
  439. if (!mimic_gnu ||
  440. (argv[3][0] == '^') ||
  441. (l > 0 && argv[3][l-1] == '$'))
  442. mode |= REG_NEWLINE;
  443. source = mimic_gnu ? twiddle(argv[3]) : argv[3];
  444. error = regcomp(&re, source, mode);
  445. if (error != 0)
  446. exit_regerror(error, &re, source);
  447. pmatch = xreallocarray(NULL, re.re_nsub+1, sizeof(regmatch_t),
  448. NULL);
  449. do_subst(argv[2], &re, source,
  450. argc > 4 && argv[4] != NULL ? argv[4] : "", pmatch);
  451. free(pmatch);
  452. regfree(&re);
  453. }
  454. pbstr(getstring());
  455. }
  456. void
  457. doregexp(const char *argv[], int argc)
  458. {
  459. int error;
  460. regex_t re;
  461. regmatch_t *pmatch;
  462. const char *source;
  463. if (argc <= 3) {
  464. m4_warnx("Too few arguments to regexp");
  465. return;
  466. }
  467. /* special gnu case */
  468. if (argv[3][0] == '\0' && mimic_gnu) {
  469. if (argc == 4 || argv[4] == NULL)
  470. return;
  471. else
  472. pbstr(argv[4]);
  473. }
  474. source = mimic_gnu ? twiddle(argv[3]) : argv[3];
  475. error = regcomp(&re, source, REG_EXTENDED|REG_NEWLINE);
  476. if (error != 0)
  477. exit_regerror(error, &re, source);
  478. pmatch = xreallocarray(NULL, re.re_nsub+1, sizeof(regmatch_t), NULL);
  479. if (argc == 4 || argv[4] == NULL)
  480. do_regexpindex(argv[2], &re, source, pmatch);
  481. else
  482. do_regexp(argv[2], &re, source, argv[4], pmatch);
  483. free(pmatch);
  484. regfree(&re);
  485. }
  486. void
  487. doformat(const char *argv[], int argc)
  488. {
  489. const char *format = argv[2];
  490. int pos = 3;
  491. int left_padded;
  492. long width;
  493. size_t l;
  494. const char *thisarg = NULL;
  495. char temp[2];
  496. long extra;
  497. while (*format != 0) {
  498. if (*format != '%') {
  499. addchar(*format++);
  500. continue;
  501. }
  502. format++;
  503. if (*format == '%') {
  504. addchar(*format++);
  505. continue;
  506. }
  507. if (*format == 0) {
  508. addchar('%');
  509. break;
  510. }
  511. if (*format == '*') {
  512. format++;
  513. if (pos >= argc)
  514. m4errx(1,
  515. "Format with too many format specifiers.");
  516. width = strtol(argv[pos++], NULL, 10);
  517. } else {
  518. width = strtol(format, __DECONST(char **,&format), 10);
  519. }
  520. if (width < 0) {
  521. left_padded = 1;
  522. width = -width;
  523. } else {
  524. left_padded = 0;
  525. }
  526. if (*format == '.') {
  527. format++;
  528. if (*format == '*') {
  529. format++;
  530. if (pos >= argc)
  531. m4errx(1,
  532. "Format with too many format specifiers.");
  533. extra = strtol(argv[pos++], NULL, 10);
  534. } else {
  535. extra = strtol(format, __DECONST(char **, &format), 10);
  536. }
  537. } else {
  538. extra = LONG_MAX;
  539. }
  540. if (pos >= argc)
  541. m4errx(1, "Format with too many format specifiers.");
  542. switch(*format) {
  543. case 's':
  544. thisarg = argv[pos++];
  545. break;
  546. case 'c':
  547. temp[0] = strtoul(argv[pos++], NULL, 10);
  548. temp[1] = 0;
  549. thisarg = temp;
  550. break;
  551. default:
  552. m4errx(1, "Unsupported format specification: %s.",
  553. argv[2]);
  554. }
  555. format++;
  556. l = strlen(thisarg);
  557. if ((long)l > extra)
  558. l = extra;
  559. if (!left_padded) {
  560. while ((long)l < width--)
  561. addchar(' ');
  562. }
  563. addchars(thisarg, l);
  564. if (left_padded) {
  565. while ((long)l < width--)
  566. addchar(' ');
  567. }
  568. }
  569. pbstr(getstring());
  570. }
  571. void
  572. doesyscmd(const char *cmd)
  573. {
  574. int p[2];
  575. pid_t cpid;
  576. char *argv[4];
  577. int cc;
  578. int status;
  579. /* Follow gnu m4 documentation: first flush buffers. */
  580. fflush(NULL);
  581. argv[0] = __DECONST(char *, "sh");
  582. argv[1] = __DECONST(char *, "-c");
  583. argv[2] = __DECONST(char *, cmd);
  584. argv[3] = NULL;
  585. /* Just set up standard output, share stderr and stdin with m4 */
  586. if (pipe(p) == -1)
  587. err(1, "bad pipe");
  588. switch(cpid = fork()) {
  589. case -1:
  590. err(1, "bad fork");
  591. /* NOTREACHED */
  592. case 0:
  593. (void) close(p[0]);
  594. (void) dup2(p[1], 1);
  595. (void) close(p[1]);
  596. execv(_PATH_BSHELL, argv);
  597. exit(1);
  598. default:
  599. /* Read result in two stages, since m4's buffer is
  600. * pushback-only. */
  601. (void) close(p[1]);
  602. do {
  603. char result[BUFSIZE];
  604. cc = read(p[0], result, sizeof result);
  605. if (cc > 0)
  606. addchars(result, cc);
  607. } while (cc > 0 || (cc == -1 && errno == EINTR));
  608. (void) close(p[0]);
  609. while (waitpid(cpid, &status, 0) == -1) {
  610. if (errno != EINTR)
  611. break;
  612. }
  613. pbstr(getstring());
  614. }
  615. }
  616. void
  617. getdivfile(const char *name)
  618. {
  619. FILE *f;
  620. int c;
  621. f = fopen(name, "r");
  622. if (!f)
  623. return;
  624. while ((c = getc(f))!= EOF)
  625. putc(c, active);
  626. (void) fclose(f);
  627. }