trx.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366
  1. /*
  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>
  6. *
  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.
  11. *
  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.
  16. *
  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
  20. */
  21. #include <stdio.h>
  22. #include <stdlib.h>
  23. #include <stddef.h>
  24. #include <stdint.h>
  25. #include <string.h>
  26. #include <errno.h>
  27. #include <unistd.h>
  28. uint32_t crc32buf(char *buf, size_t len);
  29. /**********************************************************************/
  30. /* from trxhdr.h */
  31. #define TRX_MAGIC 0x30524448 /* "HDR0" */
  32. #define TRX_VERSION 1
  33. #define TRX_MAX_LEN 0x697800
  34. #define TRX_NO_HEADER 1 /* Do not write TRX header */
  35. struct trx_header {
  36. uint32_t magic; /* "HDR0" */
  37. uint32_t len; /* Length of file including header */
  38. uint32_t crc32; /* 32-bit CRC from flag_version to end of file */
  39. uint32_t flag_version; /* 0:15 flags, 16:31 version */
  40. uint32_t offsets[3]; /* Offsets of partitions from start of header */
  41. };
  42. /**********************************************************************/
  43. void usage(void) __attribute__ (( __noreturn__ ));
  44. void usage(void)
  45. {
  46. fprintf(stderr, "Usage: trx [-p product_id] [-v version] [-o outfile] [-m maxlen] [-a align] [-b offset] file [file [file]]\n");
  47. exit(EXIT_FAILURE);
  48. }
  49. int main(int argc, char **argv)
  50. {
  51. FILE *out = stdout;
  52. FILE *in;
  53. char *ofn = NULL;
  54. char *buf;
  55. char *e;
  56. int c, i;
  57. size_t n;
  58. uint32_t cur_len;
  59. unsigned long maxlen = TRX_MAX_LEN;
  60. struct trx_header *p;
  61. struct {
  62. uint8_t version[4]; /* Firmware version */
  63. uint8_t prod_id[12]; /* Product Id */
  64. uint8_t comp_hw[4][4]; /* Compatible hw list maj-min min/maj-min max */
  65. uint8_t pad[32]; /* Padding */
  66. } asus = {
  67. .version = { 1, 9, 2, 7 }, /* version is set to 1.9.2.7 by default */
  68. .comp_hw[0] = { 0, 2, 2, 99 } /* hardcoded hw compat list 0.02 - 2.99 */
  69. };
  70. if (!(buf = malloc(maxlen))) {
  71. fprintf(stderr, "malloc failed\n");
  72. return EXIT_FAILURE;
  73. }
  74. p = (struct trx_header *) buf;
  75. p->magic = TRX_MAGIC;
  76. cur_len = sizeof(struct trx_header);
  77. p->flag_version = (TRX_VERSION << 16);
  78. in = NULL;
  79. i = 0;
  80. while ((c = getopt(argc, argv, "-:o:p:v:m:a:b:")) != -1) {
  81. switch (c) {
  82. case 1:
  83. p->offsets[i++] = cur_len;
  84. if (!(in = fopen(optarg, "r"))) {
  85. fprintf(stderr, "can not open \"%s\" for reading\n", optarg);
  86. usage();
  87. }
  88. n = fread(buf + cur_len, 1, maxlen - cur_len, in);
  89. if (!feof(in)) {
  90. fprintf(stderr, "fread failure or file \"%s\" too large\n",optarg);
  91. fclose(in);
  92. return EXIT_FAILURE;
  93. }
  94. fclose(in);
  95. #undef ROUND
  96. #define ROUND 4
  97. if (n & (ROUND-1)) {
  98. memset(buf + cur_len + n, 0, ROUND - (n & (ROUND-1)));
  99. n += ROUND - (n & (ROUND-1));
  100. }
  101. cur_len += n;
  102. /* reserve space for asus footer */
  103. if (asus.prod_id[0]) {
  104. cur_len += sizeof(asus);
  105. }
  106. break;
  107. case 'o':
  108. ofn = optarg;
  109. if (ofn && !(out = fopen(ofn, "w"))) {
  110. fprintf(stderr, "can not open \"%s\" for writing\n", ofn);
  111. usage();
  112. }
  113. break;
  114. case 'm':
  115. errno = 0;
  116. maxlen = strtoul(optarg, &e, 0);
  117. if (errno || (e == optarg) || *e) {
  118. fprintf(stderr, "illegal numeric string\n");
  119. usage();
  120. }
  121. #undef ROUND
  122. #define ROUND 0x1000
  123. if (maxlen & (ROUND-1)) {
  124. maxlen += (ROUND - (maxlen & (ROUND-1)));
  125. }
  126. if (maxlen < ROUND) {
  127. fprintf(stderr, "maxlen too small (or wrapped)\n");
  128. usage();
  129. }
  130. if (maxlen > TRX_MAX_LEN) {
  131. fprintf(stderr, "WARNING: maxlen exceeds default maximum! Beware of overwriting nvram!\n");
  132. }
  133. if (!(buf = realloc(buf,maxlen))) {
  134. fprintf(stderr, "realloc failed");
  135. return EXIT_FAILURE;
  136. }
  137. break;
  138. case 'a':
  139. errno = 0;
  140. n = strtoul(optarg, &e, 0);
  141. if (errno || (e == optarg) || *e) {
  142. fprintf(stderr, "illegal numeric string\n");
  143. usage();
  144. }
  145. if (cur_len & (n-1)) {
  146. n = n - (cur_len & (n-1));
  147. memset(buf + cur_len, 0, n);
  148. cur_len += n;
  149. }
  150. break;
  151. case 'b':
  152. errno = 0;
  153. n = strtoul(optarg, &e, 0);
  154. if (errno || (e == optarg) || *e) {
  155. fprintf(stderr, "illegal numeric string\n");
  156. usage();
  157. }
  158. if (n < cur_len) {
  159. fprintf(stderr, "WARNING: current length exceeds -b %d offset\n",(int)n);
  160. } else {
  161. memset(buf + cur_len, 0, n - cur_len);
  162. cur_len = n;
  163. }
  164. break;
  165. case 'p':
  166. if ((n = strlen(optarg)) > sizeof(asus.prod_id)) {
  167. fprintf(stderr, "product id too long\n");
  168. usage();
  169. }
  170. memset(asus.prod_id, ' ', sizeof(asus.prod_id));
  171. memcpy(asus.prod_id, optarg, n);
  172. break;
  173. case 'v':
  174. for (n = 0; n < sizeof(asus.version) / sizeof(asus.version[0]); n++)
  175. {
  176. if (n != 0 && optarg[0] == '.' && optarg[1]) optarg++;
  177. else if (n != 0) break;
  178. asus.version[n] = strtoul(optarg, &optarg, 10);
  179. }
  180. if (*optarg)
  181. {
  182. fprintf(stderr, "invalid version string\n");
  183. usage();
  184. }
  185. break;
  186. default:
  187. usage();
  188. }
  189. }
  190. if (!in) {
  191. fprintf(stderr, "we require atleast one filename\n");
  192. usage();
  193. }
  194. #undef ROUND
  195. #define ROUND 0x1000
  196. n = cur_len & (ROUND-1);
  197. if (n) {
  198. memset(buf + cur_len, 0, ROUND - n);
  199. cur_len += ROUND - n;
  200. }
  201. /* add asus footer */
  202. if (asus.prod_id[0]) {
  203. memcpy(buf + cur_len - sizeof(asus), &asus, sizeof(asus));
  204. }
  205. p->crc32 = crc32buf((char *) &p->flag_version,
  206. cur_len - offsetof(struct trx_header, flag_version));
  207. p->crc32 = p->crc32;
  208. p->len = cur_len;
  209. if (!fwrite(buf, cur_len, 1, out) || fflush(out)) {
  210. fprintf(stderr, "fwrite failed\n");
  211. return EXIT_FAILURE;
  212. }
  213. fclose(out);
  214. return EXIT_SUCCESS;
  215. }
  216. /**********************************************************************/
  217. /* The following was grabbed and tweaked from the old snippets collection
  218. * of public domain C code. */
  219. /**********************************************************************\
  220. |* Demonstration program to compute the 32-bit CRC used as the frame *|
  221. |* check sequence in ADCCP (ANSI X3.66, also known as FIPS PUB 71 *|
  222. |* and FED-STD-1003, the U.S. versions of CCITT's X.25 link-level *|
  223. |* protocol). The 32-bit FCS was added via the Federal Register, *|
  224. |* 1 June 1982, p.23798. I presume but don't know for certain that *|
  225. |* this polynomial is or will be included in CCITT V.41, which *|
  226. |* defines the 16-bit CRC (often called CRC-CCITT) polynomial. FIPS *|
  227. |* PUB 78 says that the 32-bit FCS reduces otherwise undetected *|
  228. |* errors by a factor of 10^-5 over 16-bit FCS. *|
  229. \**********************************************************************/
  230. /* Copyright (C) 1986 Gary S. Brown. You may use this program, or
  231. code or tables extracted from it, as desired without restriction.*/
  232. /* First, the polynomial itself and its table of feedback terms. The */
  233. /* polynomial is */
  234. /* 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 */
  235. /* Note that we take it "backwards" and put the highest-order term in */
  236. /* the lowest-order bit. The X^32 term is "implied"; the LSB is the */
  237. /* X^31 term, etc. The X^0 term (usually shown as "+1") results in */
  238. /* the MSB being 1. */
  239. /* Note that the usual hardware shift register implementation, which */
  240. /* is what we're using (we're merely optimizing it by doing eight-bit */
  241. /* chunks at a time) shifts bits into the lowest-order term. In our */
  242. /* implementation, that means shifting towards the right. Why do we */
  243. /* do it this way? Because the calculated CRC must be transmitted in */
  244. /* order from highest-order term to lowest-order term. UARTs transmit */
  245. /* characters in order from LSB to MSB. By storing the CRC this way, */
  246. /* we hand it to the UART in the order low-byte to high-byte; the UART */
  247. /* sends each low-bit to hight-bit; and the result is transmission bit */
  248. /* by bit from highest- to lowest-order term without requiring any bit */
  249. /* shuffling on our part. Reception works similarly. */
  250. /* The feedback terms table consists of 256, 32-bit entries. Notes: */
  251. /* */
  252. /* 1. The table can be generated at runtime if desired; code to do so */
  253. /* is shown later. It might not be obvious, but the feedback */
  254. /* terms simply represent the results of eight shift/xor opera- */
  255. /* tions for all combinations of data and CRC register values. */
  256. /* */
  257. /* 2. The CRC accumulation logic is the same for all CRC polynomials, */
  258. /* be they sixteen or thirty-two bits wide. You simply choose the */
  259. /* appropriate table. Alternatively, because the table can be */
  260. /* generated at runtime, you can start by generating the table for */
  261. /* the polynomial in question and use exactly the same "updcrc", */
  262. /* if your application needn't simultaneously handle two CRC */
  263. /* polynomials. (Note, however, that XMODEM is strange.) */
  264. /* */
  265. /* 3. For 16-bit CRCs, the table entries need be only 16 bits wide; */
  266. /* of course, 32-bit entries work OK if the high 16 bits are zero. */
  267. /* */
  268. /* 4. The values must be right-shifted by eight bits by the "updcrc" */
  269. /* logic; the shift must be unsigned (bring in zeroes). On some */
  270. /* hardware you could probably optimize the shift in assembler by */
  271. /* using byte-swap instructions. */
  272. static const uint32_t crc_32_tab[] = { /* CRC polynomial 0xedb88320 */
  273. 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
  274. 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
  275. 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
  276. 0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
  277. 0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
  278. 0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
  279. 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
  280. 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
  281. 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
  282. 0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
  283. 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
  284. 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
  285. 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
  286. 0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
  287. 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
  288. 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
  289. 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
  290. 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
  291. 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
  292. 0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
  293. 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
  294. 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
  295. 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
  296. 0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
  297. 0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
  298. 0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
  299. 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
  300. 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
  301. 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
  302. 0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
  303. 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
  304. 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
  305. 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
  306. 0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
  307. 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
  308. 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
  309. 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
  310. 0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
  311. 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
  312. 0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
  313. 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
  314. 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
  315. 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
  316. };
  317. #define UPDC32(octet,crc) (crc_32_tab[((crc) ^ (octet)) & 0xff] ^ ((crc) >> 8))
  318. uint32_t crc32buf(char *buf, size_t len)
  319. {
  320. uint32_t crc;
  321. crc = 0xFFFFFFFF;
  322. for ( ; len; --len, ++buf)
  323. {
  324. crc = UPDC32(*buf, crc);
  325. }
  326. return crc;
  327. }