util.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /*
  3. * Copyright 2011 The Chromium Authors, All Rights Reserved.
  4. * Copyright 2008 Jon Loeliger, Freescale Semiconductor, Inc.
  5. *
  6. * util_is_printable_string contributed by
  7. * Pantelis Antoniou <pantelis.antoniou AT gmail.com>
  8. */
  9. #include <ctype.h>
  10. #include <stdio.h>
  11. #include <stdlib.h>
  12. #include <stdarg.h>
  13. #include <string.h>
  14. #include <assert.h>
  15. #include <inttypes.h>
  16. #include <errno.h>
  17. #include <fcntl.h>
  18. #include <unistd.h>
  19. #include "libfdt.h"
  20. #include "util.h"
  21. #include "version_gen.h"
  22. char *xstrdup(const char *s)
  23. {
  24. int len = strlen(s) + 1;
  25. char *d = xmalloc(len);
  26. memcpy(d, s, len);
  27. return d;
  28. }
  29. char *xstrndup(const char *s, size_t n)
  30. {
  31. size_t len = strnlen(s, n) + 1;
  32. char *d = xmalloc(len);
  33. memcpy(d, s, len - 1);
  34. d[len - 1] = '\0';
  35. return d;
  36. }
  37. int xavsprintf_append(char **strp, const char *fmt, va_list ap)
  38. {
  39. int n, size = 0; /* start with 128 bytes */
  40. char *p;
  41. va_list ap_copy;
  42. p = *strp;
  43. if (p)
  44. size = strlen(p);
  45. va_copy(ap_copy, ap);
  46. n = vsnprintf(NULL, 0, fmt, ap_copy) + 1;
  47. va_end(ap_copy);
  48. p = xrealloc(p, size + n);
  49. n = vsnprintf(p + size, n, fmt, ap);
  50. *strp = p;
  51. return strlen(p);
  52. }
  53. int xasprintf_append(char **strp, const char *fmt, ...)
  54. {
  55. int n;
  56. va_list ap;
  57. va_start(ap, fmt);
  58. n = xavsprintf_append(strp, fmt, ap);
  59. va_end(ap);
  60. return n;
  61. }
  62. int xasprintf(char **strp, const char *fmt, ...)
  63. {
  64. int n;
  65. va_list ap;
  66. *strp = NULL;
  67. va_start(ap, fmt);
  68. n = xavsprintf_append(strp, fmt, ap);
  69. va_end(ap);
  70. return n;
  71. }
  72. char *join_path(const char *path, const char *name)
  73. {
  74. int lenp = strlen(path);
  75. int lenn = strlen(name);
  76. int len;
  77. int needslash = 1;
  78. char *str;
  79. len = lenp + lenn + 2;
  80. if ((lenp > 0) && (path[lenp-1] == '/')) {
  81. needslash = 0;
  82. len--;
  83. }
  84. str = xmalloc(len);
  85. memcpy(str, path, lenp);
  86. if (needslash) {
  87. str[lenp] = '/';
  88. lenp++;
  89. }
  90. memcpy(str+lenp, name, lenn+1);
  91. return str;
  92. }
  93. bool util_is_printable_string(const void *data, int len)
  94. {
  95. const char *s = data;
  96. const char *ss, *se;
  97. /* zero length is not */
  98. if (len == 0)
  99. return 0;
  100. /* must terminate with zero */
  101. if (s[len - 1] != '\0')
  102. return 0;
  103. se = s + len;
  104. while (s < se) {
  105. ss = s;
  106. while (s < se && *s && isprint((unsigned char)*s))
  107. s++;
  108. /* not zero, or not done yet */
  109. if (*s != '\0' || s == ss)
  110. return 0;
  111. s++;
  112. }
  113. return 1;
  114. }
  115. /*
  116. * Parse a octal encoded character starting at index i in string s. The
  117. * resulting character will be returned and the index i will be updated to
  118. * point at the character directly after the end of the encoding, this may be
  119. * the '\0' terminator of the string.
  120. */
  121. static char get_oct_char(const char *s, int *i)
  122. {
  123. char x[4];
  124. char *endx;
  125. long val;
  126. x[3] = '\0';
  127. strncpy(x, s + *i, 3);
  128. val = strtol(x, &endx, 8);
  129. assert(endx > x);
  130. (*i) += endx - x;
  131. return val;
  132. }
  133. /*
  134. * Parse a hexadecimal encoded character starting at index i in string s. The
  135. * resulting character will be returned and the index i will be updated to
  136. * point at the character directly after the end of the encoding, this may be
  137. * the '\0' terminator of the string.
  138. */
  139. static char get_hex_char(const char *s, int *i)
  140. {
  141. char x[3];
  142. char *endx;
  143. long val;
  144. x[2] = '\0';
  145. strncpy(x, s + *i, 2);
  146. val = strtol(x, &endx, 16);
  147. if (!(endx > x))
  148. die("\\x used with no following hex digits\n");
  149. (*i) += endx - x;
  150. return val;
  151. }
  152. char get_escape_char(const char *s, int *i)
  153. {
  154. char c = s[*i];
  155. int j = *i + 1;
  156. char val;
  157. switch (c) {
  158. case 'a':
  159. val = '\a';
  160. break;
  161. case 'b':
  162. val = '\b';
  163. break;
  164. case 't':
  165. val = '\t';
  166. break;
  167. case 'n':
  168. val = '\n';
  169. break;
  170. case 'v':
  171. val = '\v';
  172. break;
  173. case 'f':
  174. val = '\f';
  175. break;
  176. case 'r':
  177. val = '\r';
  178. break;
  179. case '0':
  180. case '1':
  181. case '2':
  182. case '3':
  183. case '4':
  184. case '5':
  185. case '6':
  186. case '7':
  187. j--; /* need to re-read the first digit as
  188. * part of the octal value */
  189. val = get_oct_char(s, &j);
  190. break;
  191. case 'x':
  192. val = get_hex_char(s, &j);
  193. break;
  194. default:
  195. val = c;
  196. }
  197. (*i) = j;
  198. return val;
  199. }
  200. int utilfdt_read_err(const char *filename, char **buffp, size_t *len)
  201. {
  202. int fd = 0; /* assume stdin */
  203. char *buf = NULL;
  204. size_t bufsize = 1024, offset = 0;
  205. int ret = 0;
  206. *buffp = NULL;
  207. if (strcmp(filename, "-") != 0) {
  208. fd = open(filename, O_RDONLY);
  209. if (fd < 0)
  210. return errno;
  211. }
  212. /* Loop until we have read everything */
  213. buf = xmalloc(bufsize);
  214. do {
  215. /* Expand the buffer to hold the next chunk */
  216. if (offset == bufsize) {
  217. bufsize *= 2;
  218. buf = xrealloc(buf, bufsize);
  219. }
  220. ret = read(fd, &buf[offset], bufsize - offset);
  221. if (ret < 0) {
  222. ret = errno;
  223. break;
  224. }
  225. offset += ret;
  226. } while (ret != 0);
  227. /* Clean up, including closing stdin; return errno on error */
  228. close(fd);
  229. if (ret)
  230. free(buf);
  231. else
  232. *buffp = buf;
  233. if (len)
  234. *len = bufsize;
  235. return ret;
  236. }
  237. char *utilfdt_read(const char *filename, size_t *len)
  238. {
  239. char *buff;
  240. int ret = utilfdt_read_err(filename, &buff, len);
  241. if (ret) {
  242. fprintf(stderr, "Couldn't open blob from '%s': %s\n", filename,
  243. strerror(ret));
  244. return NULL;
  245. }
  246. /* Successful read */
  247. return buff;
  248. }
  249. int utilfdt_write_err(const char *filename, const void *blob)
  250. {
  251. int fd = 1; /* assume stdout */
  252. int totalsize;
  253. int offset;
  254. int ret = 0;
  255. const char *ptr = blob;
  256. if (strcmp(filename, "-") != 0) {
  257. fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666);
  258. if (fd < 0)
  259. return errno;
  260. }
  261. totalsize = fdt_totalsize(blob);
  262. offset = 0;
  263. while (offset < totalsize) {
  264. ret = write(fd, ptr + offset, totalsize - offset);
  265. if (ret < 0) {
  266. ret = -errno;
  267. break;
  268. }
  269. offset += ret;
  270. }
  271. /* Close the file/stdin; return errno on error */
  272. if (fd != 1)
  273. close(fd);
  274. return ret < 0 ? -ret : 0;
  275. }
  276. int utilfdt_write(const char *filename, const void *blob)
  277. {
  278. int ret = utilfdt_write_err(filename, blob);
  279. if (ret) {
  280. fprintf(stderr, "Couldn't write blob to '%s': %s\n", filename,
  281. strerror(ret));
  282. }
  283. return ret ? -1 : 0;
  284. }
  285. int utilfdt_decode_type(const char *fmt, int *type, int *size)
  286. {
  287. int qualifier = 0;
  288. if (!*fmt)
  289. return -1;
  290. /* get the conversion qualifier */
  291. *size = -1;
  292. if (strchr("hlLb", *fmt)) {
  293. qualifier = *fmt++;
  294. if (qualifier == *fmt) {
  295. switch (*fmt++) {
  296. /* TODO: case 'l': qualifier = 'L'; break;*/
  297. case 'h':
  298. qualifier = 'b';
  299. break;
  300. }
  301. }
  302. }
  303. /* we should now have a type */
  304. if ((*fmt == '\0') || !strchr("iuxsr", *fmt))
  305. return -1;
  306. /* convert qualifier (bhL) to byte size */
  307. if (*fmt != 's' && *fmt != 'r')
  308. *size = qualifier == 'b' ? 1 :
  309. qualifier == 'h' ? 2 :
  310. qualifier == 'l' ? 4 : -1;
  311. *type = *fmt++;
  312. /* that should be it! */
  313. if (*fmt)
  314. return -1;
  315. return 0;
  316. }
  317. void utilfdt_print_data(const char *data, int len)
  318. {
  319. int i;
  320. const char *s;
  321. /* no data, don't print */
  322. if (len == 0)
  323. return;
  324. if (util_is_printable_string(data, len)) {
  325. printf(" = ");
  326. s = data;
  327. do {
  328. printf("\"%s\"", s);
  329. s += strlen(s) + 1;
  330. if (s < data + len)
  331. printf(", ");
  332. } while (s < data + len);
  333. } else if ((len % 4) == 0) {
  334. const fdt32_t *cell = (const fdt32_t *)data;
  335. printf(" = <");
  336. for (i = 0, len /= 4; i < len; i++)
  337. printf("0x%08" PRIx32 "%s", fdt32_to_cpu(cell[i]),
  338. i < (len - 1) ? " " : "");
  339. printf(">");
  340. } else {
  341. const unsigned char *p = (const unsigned char *)data;
  342. printf(" = [");
  343. for (i = 0; i < len; i++)
  344. printf("%02x%s", *p++, i < len - 1 ? " " : "");
  345. printf("]");
  346. }
  347. }
  348. void NORETURN util_version(void)
  349. {
  350. printf("Version: %s\n", DTC_VERSION);
  351. exit(0);
  352. }
  353. void NORETURN util_usage(const char *errmsg, const char *synopsis,
  354. const char *short_opts,
  355. struct option const long_opts[],
  356. const char * const opts_help[])
  357. {
  358. FILE *fp = errmsg ? stderr : stdout;
  359. const char a_arg[] = "<arg>";
  360. size_t a_arg_len = strlen(a_arg) + 1;
  361. size_t i;
  362. int optlen;
  363. fprintf(fp,
  364. "Usage: %s\n"
  365. "\n"
  366. "Options: -[%s]\n", synopsis, short_opts);
  367. /* prescan the --long opt length to auto-align */
  368. optlen = 0;
  369. for (i = 0; long_opts[i].name; ++i) {
  370. /* +1 is for space between --opt and help text */
  371. int l = strlen(long_opts[i].name) + 1;
  372. if (long_opts[i].has_arg == a_argument)
  373. l += a_arg_len;
  374. if (optlen < l)
  375. optlen = l;
  376. }
  377. for (i = 0; long_opts[i].name; ++i) {
  378. /* helps when adding new applets or options */
  379. assert(opts_help[i] != NULL);
  380. /* first output the short flag if it has one */
  381. if (long_opts[i].val > '~')
  382. fprintf(fp, " ");
  383. else
  384. fprintf(fp, " -%c, ", long_opts[i].val);
  385. /* then the long flag */
  386. if (long_opts[i].has_arg == no_argument)
  387. fprintf(fp, "--%-*s", optlen, long_opts[i].name);
  388. else
  389. fprintf(fp, "--%s %s%*s", long_opts[i].name, a_arg,
  390. (int)(optlen - strlen(long_opts[i].name) - a_arg_len), "");
  391. /* finally the help text */
  392. fprintf(fp, "%s\n", opts_help[i]);
  393. }
  394. if (errmsg) {
  395. fprintf(fp, "\nError: %s\n", errmsg);
  396. exit(EXIT_FAILURE);
  397. } else
  398. exit(EXIT_SUCCESS);
  399. }