2 * Copyright (C) 2004 Manuel Novoa III <mjn3@codepoet.org>
3 * Copyright (C) 2005 Konstantin A. Klubnichkin and Oleg I. Vdovikin
4 * Copyright (C) 2006 OpenWrt developers <openwrt-developers@openwrt.org>
5 * Copyright (C) 2006 Waldemar Brodkorb <wbx@freewrt.org>
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
33 #if __BYTE_ORDER == __BIG_ENDIAN
34 #define STORE32_LE(X) bswap_32(X)
35 #elif __BYTE_ORDER == __LITTLE_ENDIAN
36 #define STORE32_LE(X) (X)
38 #error unkown endianness!
41 uint32_t crc32buf(char *buf
, size_t len
);
43 /**********************************************************************/
46 #define TRX_MAGIC 0x30524448 /* "HDR0" */
48 #define TRX_MAX_LEN 0x697800
49 #define TRX_NO_HEADER 1 /* Do not write TRX header */
52 uint32_t magic
; /* "HDR0" */
53 uint32_t len
; /* Length of file including header */
54 uint32_t crc32
; /* 32-bit CRC from flag_version to end of file */
55 uint32_t flag_version
; /* 0:15 flags, 16:31 version */
56 uint32_t offsets
[3]; /* Offsets of partitions from start of header */
59 /**********************************************************************/
61 void usage(void) __attribute__ (( __noreturn__
));
65 fprintf(stderr
, "Usage: trx [-p product_id] [-v version] [-o outfile] [-m maxlen] [-a align] [-b offset] file [file [file]]\n");
69 int main(int argc
, char **argv
)
79 unsigned long maxlen
= TRX_MAX_LEN
;
83 uint8_t version
[4]; /* Firmware version */
84 uint8_t prod_id
[12]; /* Product Id */
85 uint8_t comp_hw
[4][4]; /* Compatible hw list maj-min min/maj-min max */
86 uint8_t pad
[32]; /* Padding */
88 .version
= { 1, 9, 2, 7 }, /* version is set to 1.9.2.7 by default */
89 .comp_hw
[0] = { 0, 2, 2, 99 } /* hardcoded hw compat list 0.02 - 2.99 */
93 if (!(buf
= malloc(maxlen
))) {
94 fprintf(stderr
, "malloc failed\n");
98 p
= (struct trx_header
*) buf
;
100 p
->magic
= STORE32_LE(TRX_MAGIC
);
101 cur_len
= sizeof(struct trx_header
);
102 p
->flag_version
= STORE32_LE((TRX_VERSION
<< 16));
107 while ((c
= getopt(argc
, argv
, "-:o:p:v:m:a:b:")) != -1) {
110 p
->offsets
[i
++] = STORE32_LE(cur_len
);
112 if (!(in
= fopen(optarg
, "r"))) {
113 fprintf(stderr
, "can not open \"%s\" for reading\n", optarg
);
116 n
= fread(buf
+ cur_len
, 1, maxlen
- cur_len
, in
);
118 fprintf(stderr
, "fread failure or file \"%s\" too large\n",optarg
);
126 memset(buf
+ cur_len
+ n
, 0, ROUND
- (n
& (ROUND
-1)));
127 n
+= ROUND
- (n
& (ROUND
-1));
130 /* reserve space for asus footer */
131 if (asus
.prod_id
[0]) {
132 cur_len
+= sizeof(asus
);
137 if (ofn
&& !(out
= fopen(ofn
, "w"))) {
138 fprintf(stderr
, "can not open \"%s\" for writing\n", ofn
);
145 maxlen
= strtoul(optarg
, &e
, 0);
146 if (errno
|| (e
== optarg
) || *e
) {
147 fprintf(stderr
, "illegal numeric string\n");
152 if (maxlen
& (ROUND
-1)) {
153 maxlen
+= (ROUND
- (maxlen
& (ROUND
-1)));
155 if (maxlen
< ROUND
) {
156 fprintf(stderr
, "maxlen too small (or wrapped)\n");
159 if (maxlen
> TRX_MAX_LEN
) {
160 fprintf(stderr
, "WARNING: maxlen exceeds default maximum! Beware of overwriting nvram!\n");
162 if (!(buf
= realloc(buf
,maxlen
))) {
163 fprintf(stderr
, "realloc failed");
169 n
= strtoul(optarg
, &e
, 0);
170 if (errno
|| (e
== optarg
) || *e
) {
171 fprintf(stderr
, "illegal numeric string\n");
174 if (cur_len
& (n
-1)) {
175 n
= n
- (cur_len
& (n
-1));
176 memset(buf
+ cur_len
, 0, n
);
182 n
= strtoul(optarg
, &e
, 0);
183 if (errno
|| (e
== optarg
) || *e
) {
184 fprintf(stderr
, "illegal numeric string\n");
188 fprintf(stderr
, "WARNING: current length exceeds -b %d offset\n",n
);
190 memset(buf
+ cur_len
, 0, n
- cur_len
);
195 if ((n
= strlen(optarg
)) > sizeof(asus
.prod_id
)) {
196 fprintf(stderr
, "product id too long\n");
199 memset(asus
.prod_id
, ' ', sizeof(asus
.prod_id
));
200 memcpy(asus
.prod_id
, optarg
, n
);
203 for (n
= 0; n
< sizeof(asus
.version
) / sizeof(asus
.version
[0]); n
++)
205 if (n
!= 0 && optarg
[0] == '.' && optarg
[1]) optarg
++;
206 else if (n
!= 0) break;
208 asus
.version
[n
] = strtoul(optarg
, &optarg
, 10);
212 fprintf(stderr
, "invalid version string\n");
222 fprintf(stderr
, "we require atleast one filename\n");
228 n
= cur_len
& (ROUND
-1);
230 memset(buf
+ cur_len
, 0, ROUND
- n
);
231 cur_len
+= ROUND
- n
;
233 /* add asus footer */
234 if (asus
.prod_id
[0]) {
235 memcpy(buf
+ cur_len
- sizeof(asus
), &asus
, sizeof(asus
));
238 p
->crc32
= crc32buf((char *) &p
->flag_version
,
239 cur_len
- offsetof(struct trx_header
, flag_version
));
240 p
->crc32
= STORE32_LE(p
->crc32
);
242 p
->len
= STORE32_LE(cur_len
);
244 if (!fwrite(buf
, cur_len
, 1, out
) || fflush(out
)) {
245 fprintf(stderr
, "fwrite failed\n");
254 /**********************************************************************/
255 /* The following was grabbed and tweaked from the old snippets collection
256 * of public domain C code. */
258 /**********************************************************************\
259 |* Demonstration program to compute the 32-bit CRC used as the frame *|
260 |* check sequence in ADCCP (ANSI X3.66, also known as FIPS PUB 71 *|
261 |* and FED-STD-1003, the U.S. versions of CCITT's X.25 link-level *|
262 |* protocol). The 32-bit FCS was added via the Federal Register, *|
263 |* 1 June 1982, p.23798. I presume but don't know for certain that *|
264 |* this polynomial is or will be included in CCITT V.41, which *|
265 |* defines the 16-bit CRC (often called CRC-CCITT) polynomial. FIPS *|
266 |* PUB 78 says that the 32-bit FCS reduces otherwise undetected *|
267 |* errors by a factor of 10^-5 over 16-bit FCS. *|
268 \**********************************************************************/
270 /* Copyright (C) 1986 Gary S. Brown. You may use this program, or
271 code or tables extracted from it, as desired without restriction.*/
273 /* First, the polynomial itself and its table of feedback terms. The */
275 /* X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0 */
276 /* Note that we take it "backwards" and put the highest-order term in */
277 /* the lowest-order bit. The X^32 term is "implied"; the LSB is the */
278 /* X^31 term, etc. The X^0 term (usually shown as "+1") results in */
279 /* the MSB being 1. */
281 /* Note that the usual hardware shift register implementation, which */
282 /* is what we're using (we're merely optimizing it by doing eight-bit */
283 /* chunks at a time) shifts bits into the lowest-order term. In our */
284 /* implementation, that means shifting towards the right. Why do we */
285 /* do it this way? Because the calculated CRC must be transmitted in */
286 /* order from highest-order term to lowest-order term. UARTs transmit */
287 /* characters in order from LSB to MSB. By storing the CRC this way, */
288 /* we hand it to the UART in the order low-byte to high-byte; the UART */
289 /* sends each low-bit to hight-bit; and the result is transmission bit */
290 /* by bit from highest- to lowest-order term without requiring any bit */
291 /* shuffling on our part. Reception works similarly. */
293 /* The feedback terms table consists of 256, 32-bit entries. Notes: */
295 /* 1. The table can be generated at runtime if desired; code to do so */
296 /* is shown later. It might not be obvious, but the feedback */
297 /* terms simply represent the results of eight shift/xor opera- */
298 /* tions for all combinations of data and CRC register values. */
300 /* 2. The CRC accumulation logic is the same for all CRC polynomials, */
301 /* be they sixteen or thirty-two bits wide. You simply choose the */
302 /* appropriate table. Alternatively, because the table can be */
303 /* generated at runtime, you can start by generating the table for */
304 /* the polynomial in question and use exactly the same "updcrc", */
305 /* if your application needn't simultaneously handle two CRC */
306 /* polynomials. (Note, however, that XMODEM is strange.) */
308 /* 3. For 16-bit CRCs, the table entries need be only 16 bits wide; */
309 /* of course, 32-bit entries work OK if the high 16 bits are zero. */
311 /* 4. The values must be right-shifted by eight bits by the "updcrc" */
312 /* logic; the shift must be unsigned (bring in zeroes). On some */
313 /* hardware you could probably optimize the shift in assembler by */
314 /* using byte-swap instructions. */
316 static const uint32_t crc_32_tab
[] = { /* CRC polynomial 0xedb88320 */
317 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
318 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
319 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
320 0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
321 0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
322 0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
323 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
324 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
325 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
326 0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
327 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
328 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
329 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
330 0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
331 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
332 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
333 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
334 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
335 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
336 0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
337 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
338 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
339 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
340 0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
341 0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
342 0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
343 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
344 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
345 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
346 0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
347 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
348 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
349 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
350 0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
351 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
352 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
353 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
354 0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
355 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
356 0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
357 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
358 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
359 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
362 #define UPDC32(octet,crc) (crc_32_tab[((crc) ^ (octet)) & 0xff] ^ ((crc) >> 8))
364 uint32_t crc32buf(char *buf
, size_t len
)
370 for ( ; len
; --len
, ++buf
)
372 crc
= UPDC32(*buf
, crc
);