2 * od implementation for busybox
3 * Based on code from util-linux v 2.11l
6 * The Regents of the University of California. All rights reserved.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * Original copyright notice is retained at the end of this file.
32 #define isdecdigit(c) (isdigit)(c)
33 #define ishexdigit(c) (isxdigit)(c)
36 odoffset(int argc, char ***argvp)
43 * The offset syntax of od(1) was genuinely bizarre. First, if
44 * it started with a plus it had to be an offset. Otherwise, if
45 * there were at least two arguments, a number or lower-case 'x'
46 * followed by a number makes it an offset. By default it was
47 * octal; if it started with 'x' or '0x' it was hex. If it ended
48 * in a '.', it was decimal. If a 'b' or 'B' was appended, it
49 * multiplied the number by 512 or 1024 byte units. There was
50 * no way to assign a block count to a hex offset.
52 * We assumes it's a file if the offset is bad.
57 /* hey someone is probably piping to us ... */
64 && ((p[0] != 'x') || !ishexdigit(p[1])))))
69 * bb_dump_skip over leading '+', 'x[0-9a-fA-f]' or '0x', and
74 if (p[0] == 'x' && ishexdigit(p[1])) {
77 } else if (p[0] == '0' && p[1] == 'x') {
82 /* bb_dump_skip over the number */
84 for (num = p; ishexdigit(*p); ++p);
86 for (num = p; isdecdigit(*p); ++p);
88 /* check for no number */
92 /* if terminates with a '.', base is decimal */
99 bb_dump_skip = strtol(num, &end, base ? base : 8);
101 /* if end isn't the same as p, we got a non-octal digit */
109 } else if (*p == 'B') {
110 bb_dump_skip *= 1024;
119 * If the offset uses a non-octal base, the base of
120 * the offset is changed as well. This isn't pretty,
123 #define TYPE_OFFSET 7
133 bb_dump_fshead->nextfu->fmt[TYPE_OFFSET]
134 = bb_dump_fshead->nextfs->nextfu->fmt[TYPE_OFFSET]
142 static const char * const add_strings[] = {
143 "16/1 \"%3_u \" \"\\n\"", /* a */
144 "8/2 \" %06o \" \"\\n\"", /* B, o */
145 "16/1 \"%03o \" \"\\n\"", /* b */
146 "16/1 \"%3_c \" \"\\n\"", /* c */
147 "8/2 \" %05u \" \"\\n\"", /* d */
148 "4/4 \" %010u \" \"\\n\"", /* D */
149 "2/8 \" %21.14e \" \"\\n\"", /* e (undocumented in od), F */
150 "4/4 \" %14.7e \" \"\\n\"", /* f */
151 "4/4 \" %08x \" \"\\n\"", /* H, X */
152 "8/2 \" %04x \" \"\\n\"", /* h, x */
153 "4/4 \" %11d \" \"\\n\"", /* I, L, l */
154 "8/2 \" %6d \" \"\\n\"", /* i */
155 "4/4 \" %011o \" \"\\n\"", /* O */
158 static const char od_opts[] = "aBbcDdeFfHhIiLlOoXxv";
160 static const char od_o2si[] = {
163 9, 0xa, 0xb, 0xa, 0xa,
167 int od_main(int argc, char **argv)
172 bb_dump_vflag = FIRST;
175 while ((ch = getopt(argc, argv, od_opts)) > 0) {
178 } else if (((p = strchr(od_opts, ch)) != NULL) && (*p != '\0')) {
181 bb_dump_add("\"%07.7_Ao\n\"");
182 bb_dump_add("\"%07.7_ao \"");
184 bb_dump_add("\" \"");
186 bb_dump_add(add_strings[(int)od_o2si[(p-od_opts)]]);
187 } else { /* P, p, s, w, or other unhandled */
191 if (!bb_dump_fshead) {
192 bb_dump_add("\"%07.7_Ao\n\"");
193 bb_dump_add("\"%07.7_ao \" 8/2 \"%06o \" \"\\n\"");
199 odoffset(argc, &argv);
201 return(bb_dump_dump(argv));
205 * Copyright (c) 1990 The Regents of the University of California.
206 * All rights reserved.
208 * Redistribution and use in source and binary forms, with or without
209 * modification, are permitted provided that the following conditions
211 * 1. Redistributions of source code must retain the above copyright
212 * notice, this list of conditions and the following disclaimer.
213 * 2. Redistributions in binary form must reproduce the above copyright
214 * notice, this list of conditions and the following disclaimer in the
215 * documentation and/or other materials provided with the distribution.
216 * 3. Neither the name of the University nor the names of its contributors
217 * may be used to endorse or promote products derived from this software
218 * without specific prior written permission.
220 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
221 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
222 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
223 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
224 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
225 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
226 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
227 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
228 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
229 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF