od.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * od implementation for busybox
  4. * Based on code from util-linux v 2.11l
  5. *
  6. * Copyright (c) 1990
  7. * The Regents of the University of California. All rights reserved.
  8. *
  9. * Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
  10. *
  11. * Original copyright notice is retained at the end of this file.
  12. */
  13. #include "libbb.h"
  14. #if ENABLE_DESKTOP
  15. /* This one provides -t (busybox's own build script needs it) */
  16. #include "od_bloaty.c"
  17. #else
  18. #include "dump.h"
  19. static void
  20. odoffset(dumper_t *dumper, int argc, char ***argvp)
  21. {
  22. char *num, *p;
  23. int base;
  24. char *end;
  25. /*
  26. * The offset syntax of od(1) was genuinely bizarre. First, if
  27. * it started with a plus it had to be an offset. Otherwise, if
  28. * there were at least two arguments, a number or lower-case 'x'
  29. * followed by a number makes it an offset. By default it was
  30. * octal; if it started with 'x' or '0x' it was hex. If it ended
  31. * in a '.', it was decimal. If a 'b' or 'B' was appended, it
  32. * multiplied the number by 512 or 1024 byte units. There was
  33. * no way to assign a block count to a hex offset.
  34. *
  35. * We assumes it's a file if the offset is bad.
  36. */
  37. p = **argvp;
  38. if (!p) {
  39. /* hey someone is probably piping to us ... */
  40. return;
  41. }
  42. if ((*p != '+')
  43. && (argc < 2
  44. || (!isdigit(p[0])
  45. && ((p[0] != 'x') || !isxdigit(p[1])))))
  46. return;
  47. base = 0;
  48. /*
  49. * skip over leading '+', 'x[0-9a-fA-f]' or '0x', and
  50. * set base.
  51. */
  52. if (p[0] == '+')
  53. ++p;
  54. if (p[0] == 'x' && isxdigit(p[1])) {
  55. ++p;
  56. base = 16;
  57. } else if (p[0] == '0' && p[1] == 'x') {
  58. p += 2;
  59. base = 16;
  60. }
  61. /* skip over the number */
  62. if (base == 16)
  63. for (num = p; isxdigit(*p); ++p)
  64. continue;
  65. else
  66. for (num = p; isdigit(*p); ++p)
  67. continue;
  68. /* check for no number */
  69. if (num == p)
  70. return;
  71. /* if terminates with a '.', base is decimal */
  72. if (*p == '.') {
  73. if (base)
  74. return;
  75. base = 10;
  76. }
  77. dumper->dump_skip = strtol(num, &end, base ? base : 8);
  78. /* if end isn't the same as p, we got a non-octal digit */
  79. if (end != p)
  80. dumper->dump_skip = 0;
  81. else {
  82. if (*p) {
  83. if (*p == 'b') {
  84. dumper->dump_skip *= 512;
  85. ++p;
  86. } else if (*p == 'B') {
  87. dumper->dump_skip *= 1024;
  88. ++p;
  89. }
  90. }
  91. if (*p)
  92. dumper->dump_skip = 0;
  93. else {
  94. ++*argvp;
  95. /*
  96. * If the offset uses a non-octal base, the base of
  97. * the offset is changed as well. This isn't pretty,
  98. * but it's easy.
  99. */
  100. #define TYPE_OFFSET 7
  101. {
  102. char x_or_d;
  103. if (base == 16) {
  104. x_or_d = 'x';
  105. goto DO_X_OR_D;
  106. }
  107. if (base == 10) {
  108. x_or_d = 'd';
  109. DO_X_OR_D:
  110. dumper->fshead->nextfu->fmt[TYPE_OFFSET]
  111. = dumper->fshead->nextfs->nextfu->fmt[TYPE_OFFSET]
  112. = x_or_d;
  113. }
  114. }
  115. }
  116. }
  117. }
  118. static const char *const add_strings[] = {
  119. "16/1 \"%3_u \" \"\\n\"", /* a */
  120. "8/2 \" %06o \" \"\\n\"", /* B, o */
  121. "16/1 \"%03o \" \"\\n\"", /* b */
  122. "16/1 \"%3_c \" \"\\n\"", /* c */
  123. "8/2 \" %05u \" \"\\n\"", /* d */
  124. "4/4 \" %010u \" \"\\n\"", /* D */
  125. "2/8 \" %21.14e \" \"\\n\"", /* e (undocumented in od), F */
  126. "4/4 \" %14.7e \" \"\\n\"", /* f */
  127. "4/4 \" %08x \" \"\\n\"", /* H, X */
  128. "8/2 \" %04x \" \"\\n\"", /* h, x */
  129. "4/4 \" %11d \" \"\\n\"", /* I, L, l */
  130. "8/2 \" %6d \" \"\\n\"", /* i */
  131. "4/4 \" %011o \" \"\\n\"", /* O */
  132. };
  133. static const char od_opts[] ALIGN1 = "aBbcDdeFfHhIiLlOoXxv";
  134. static const char od_o2si[] ALIGN1 = {
  135. 0, 1, 2, 3, 5,
  136. 4, 6, 6, 7, 8,
  137. 9, 0xa, 0xb, 0xa, 0xa,
  138. 0xb, 1, 8, 9,
  139. };
  140. int od_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
  141. int od_main(int argc, char **argv)
  142. {
  143. int ch;
  144. int first = 1;
  145. char *p;
  146. dumper_t *dumper = alloc_dumper();
  147. while ((ch = getopt(argc, argv, od_opts)) > 0) {
  148. if (ch == 'v') {
  149. dumper->dump_vflag = ALL;
  150. } else if (((p = strchr(od_opts, ch)) != NULL) && (*p != '\0')) {
  151. if (first) {
  152. first = 0;
  153. bb_dump_add(dumper, "\"%07.7_Ao\n\"");
  154. bb_dump_add(dumper, "\"%07.7_ao \"");
  155. } else {
  156. bb_dump_add(dumper, "\" \"");
  157. }
  158. bb_dump_add(dumper, add_strings[(int)od_o2si[(p - od_opts)]]);
  159. } else { /* P, p, s, w, or other unhandled */
  160. bb_show_usage();
  161. }
  162. }
  163. if (!dumper->fshead) {
  164. bb_dump_add(dumper, "\"%07.7_Ao\n\"");
  165. bb_dump_add(dumper, "\"%07.7_ao \" 8/2 \"%06o \" \"\\n\"");
  166. }
  167. argc -= optind;
  168. argv += optind;
  169. odoffset(dumper, argc, &argv);
  170. return bb_dump_dump(dumper, argv);
  171. }
  172. #endif /* ENABLE_DESKTOP */
  173. /*-
  174. * Copyright (c) 1990 The Regents of the University of California.
  175. * All rights reserved.
  176. *
  177. * Redistribution and use in source and binary forms, with or without
  178. * modification, are permitted provided that the following conditions
  179. * are met:
  180. * 1. Redistributions of source code must retain the above copyright
  181. * notice, this list of conditions and the following disclaimer.
  182. * 2. Redistributions in binary form must reproduce the above copyright
  183. * notice, this list of conditions and the following disclaimer in the
  184. * documentation and/or other materials provided with the distribution.
  185. * 3. Neither the name of the University nor the names of its contributors
  186. * may be used to endorse or promote products derived from this software
  187. * without specific prior written permission.
  188. *
  189. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  190. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  191. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  192. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  193. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  194. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  195. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  196. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  197. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  198. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  199. * SUCH DAMAGE.
  200. */