wok view syslinux/stuff/extra/md5sum.c @ rev 13316

syslinux: typo
author Pascal Bellard <pascal.bellard@slitaz.org>
date Thu Aug 30 08:52:08 2012 +0200 (2012-08-30)
parents ee8093de2126
children 20cd0d6b9f64
line source
1 /*
2 * Based on busybox code.
3 *
4 * Compute MD5 checksum of strings according to the
5 * definition of MD5 in RFC 1321 from April 1992.
6 *
7 * Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
8 *
9 * Copyright (C) 1995-1999 Free Software Foundation, Inc.
10 * Copyright (C) 2001 Manuel Novoa III
11 * Copyright (C) 2003 Glenn L. McGrath
12 * Copyright (C) 2003 Erik Andersen
13 * Copyright (C) 2010 Denys Vlasenko
14 * Copyright (C) 2012 Pascal Bellard
15 *
16 * Licensed under GPLv2 or later
17 */
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include <string.h>
22 #include <unistd.h>
23 #include <fcntl.h>
24 #include <console.h>
25 #include <com32.h>
27 #define ALIGN1
29 static uint8_t wbuffer[64]; /* always correctly aligned for uint64_t */
30 static uint64_t total64; /* must be directly before hash[] */
31 static uint32_t hash[8]; /* 4 elements for md5, 5 for sha1, 8 for sha256 */
33 /* Emit a string of hex representation of bytes */
34 static char* bin2hex(char *p)
35 {
36 static const char bb_hexdigits_upcase[] ALIGN1 = "0123456789abcdef";
37 int count = 16;
38 const char *cp = (const char *) hash;
39 while (count) {
40 unsigned char c = *cp++;
41 /* put lowercase hex digits */
42 *p++ = bb_hexdigits_upcase[c >> 4];
43 *p++ = bb_hexdigits_upcase[c & 0xf];
44 count--;
45 }
46 return p;
47 }
49 //#define rotl32(x,n) (((x) << (n)) | ((x) >> (32 - (n))))
50 static uint32_t rotl32(uint32_t x, unsigned n)
51 {
52 return (x << n) | (x >> (32 - n));
53 }
55 static void md5_process_block64(void);
57 /* Feed data through a temporary buffer.
58 * The internal buffer remembers previous data until it has 64
59 * bytes worth to pass on.
60 */
61 static void common64_hash(const void *buffer, size_t len)
62 {
63 unsigned bufpos = total64 & 63;
65 total64 += len;
67 while (1) {
68 unsigned remaining = 64 - bufpos;
69 if (remaining > len)
70 remaining = len;
71 /* Copy data into aligned buffer */
72 memcpy(wbuffer + bufpos, buffer, remaining);
73 len -= remaining;
74 buffer = (const char *)buffer + remaining;
75 bufpos += remaining;
76 /* clever way to do "if (bufpos != 64) break; ... ; bufpos = 0;" */
77 bufpos -= 64;
78 if (bufpos != 0)
79 break;
80 /* Buffer is filled up, process it */
81 md5_process_block64();
82 /*bufpos = 0; - already is */
83 }
84 }
86 /* Process the remaining bytes in the buffer */
87 static void common64_end(void)
88 {
89 unsigned bufpos = total64 & 63;
90 /* Pad the buffer to the next 64-byte boundary with 0x80,0,0,0... */
91 wbuffer[bufpos++] = 0x80;
93 /* This loop iterates either once or twice, no more, no less */
94 while (1) {
95 unsigned remaining = 64 - bufpos;
96 memset(wbuffer + bufpos, 0, remaining);
97 /* Do we have enough space for the length count? */
98 if (remaining >= 8) {
99 /* Store the 64-bit counter of bits in the buffer */
100 uint64_t t = total64 << 3;
101 /* wbuffer is suitably aligned for this */
102 *(uint64_t *) (&wbuffer[64 - 8]) = t;
103 }
104 md5_process_block64();
105 if (remaining >= 8)
106 break;
107 bufpos = 0;
108 }
109 }
111 /* These are the four functions used in the four steps of the MD5 algorithm
112 * and defined in the RFC 1321. The first function is a little bit optimized
113 * (as found in Colin Plumbs public domain implementation).
114 * #define FF(b, c, d) ((b & c) | (~b & d))
115 */
116 #undef FF
117 #undef FG
118 #undef FH
119 #undef FI
120 #define FF(b, c, d) (d ^ (b & (c ^ d)))
121 #define FG(b, c, d) FF(d, b, c)
122 #define FH(b, c, d) (b ^ c ^ d)
123 #define FI(b, c, d) (c ^ (b | ~d))
125 /* Hash a single block, 64 bytes long and 4-byte aligned */
126 static void md5_process_block64(void)
127 {
128 /* Before we start, one word to the strange constants.
129 They are defined in RFC 1321 as
130 T[i] = (int)(4294967296.0 * fabs(sin(i))), i=1..64
131 */
132 static const uint32_t C_array[] = {
133 /* round 1 */
134 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
135 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
136 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
137 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
138 /* round 2 */
139 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
140 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
141 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
142 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
143 /* round 3 */
144 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
145 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
146 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
147 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
148 /* round 4 */
149 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
150 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
151 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
152 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
153 };
154 static const char P_array[] ALIGN1 = {
155 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, /* 1 */
156 1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, /* 2 */
157 5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2, /* 3 */
158 0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9 /* 4 */
159 };
160 uint32_t *words = (void*) wbuffer;
161 uint32_t A = hash[0];
162 uint32_t B = hash[1];
163 uint32_t C = hash[2];
164 uint32_t D = hash[3];
166 static const char S_array[] ALIGN1 = {
167 7, 12, 17, 22,
168 5, 9, 14, 20,
169 4, 11, 16, 23,
170 6, 10, 15, 21
171 };
172 const uint32_t *pc;
173 const char *pp;
174 const char *ps;
175 int i;
176 uint32_t temp;
179 pc = C_array;
180 pp = P_array;
181 ps = S_array - 4;
183 for (i = 0; i < 64; i++) {
184 if ((i & 0x0f) == 0)
185 ps += 4;
186 temp = A;
187 switch (i >> 4) {
188 case 0:
189 temp += FF(B, C, D);
190 break;
191 case 1:
192 temp += FG(B, C, D);
193 break;
194 case 2:
195 temp += FH(B, C, D);
196 break;
197 case 3:
198 temp += FI(B, C, D);
199 }
200 temp += words[(int) (*pp++)] + *pc++;
201 temp = rotl32(temp, ps[i & 3]);
202 temp += B;
203 A = D;
204 D = C;
205 C = B;
206 B = temp;
207 }
208 /* Add checksum to the starting values */
209 hash[0] += A;
210 hash[1] += B;
211 hash[2] += C;
212 hash[3] += D;
214 }
215 #undef FF
216 #undef FG
217 #undef FH
218 #undef FI
220 /* Initialize structure containing state of computation.
221 * (RFC 1321, 3.3: Step 3)
222 */
223 static void md5_begin(void)
224 {
225 hash[0] = 0x67452301;
226 hash[1] = 0xefcdab89;
227 hash[2] = 0x98badcfe;
228 hash[3] = 0x10325476;
229 total64 = 0;
230 }
232 /* Used also for sha1 and sha256 */
233 #define md5_hash common64_hash
235 /* Process the remaining bytes in the buffer and put result from CTX
236 * in first 16 bytes following RESBUF. The result is always in little
237 * endian byte order, so that a byte-wise output yields to the wanted
238 * ASCII representation of the message digest.
239 */
240 #define md5_end common64_end
242 /*
243 * Copyright (C) 2003 Glenn L. McGrath
244 * Copyright (C) 2003-2004 Erik Andersen
245 *
246 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
247 */
249 static char *unrockridge(const char *name)
250 {
251 static char buffer[256];
252 int i = 0, j = 8;
253 while (*name && i < 255) {
254 char c = *name++;
255 //if (c == '\\') c = '/';
256 if (c == '.') {
257 for (j = i; --j >= 0 && buffer[j] != '/';)
258 if (buffer[j] == '.') buffer[j] = '_';
259 if (i - j > 9) i = j + 9;
260 j = i + 4;
261 }
262 else if (c == '/') j = i + 9;
263 else if (i >= j) continue;
264 else if (c >= 'a' && c <= 'z') c += 'A' - 'a';
265 else if ((c < 'A' || c > 'Z') && (c < '0' || c > '9')) c = '_';
266 buffer[i++] = c;
267 }
268 buffer[i] = 0;
269 return buffer;
270 }
272 static uint8_t *hash_file(const char *filename)
273 {
274 int src_fd, count;
275 uint8_t in_buf[4096];
276 static uint8_t hash_value[16*2+1];
278 src_fd = open(filename, O_RDONLY);
279 if (src_fd < 0) {
280 src_fd = open(unrockridge(filename), O_RDONLY);
281 }
282 if (src_fd < 0) {
283 return NULL;
284 }
286 md5_begin();
287 while ((count = read(src_fd, in_buf, 4096)) > 0) {
288 md5_hash(in_buf, count);
289 }
291 close(src_fd);
293 if (count)
294 return NULL;
296 md5_end();
297 bin2hex((char *)hash_value);
299 return hash_value;
300 }
302 static int main_say(int argc, char **argv)
303 {
304 int i;
305 for (i = 1; i < argc; i++) {
306 printf("%s ",argv[i]);
307 }
308 sleep(5);
309 }
311 static int main_md5sum(int argc, char **argv)
312 {
313 int files = 0, tested = 0, good = 0;
314 static char clear_eol[] = " ";
316 (void) argc;
317 /* -c implied */
318 argv++;
319 do {
320 FILE *fp;
321 char eol, *line, buffer[256];
322 fp = fopen(*argv,"r");
323 if (fp == NULL)
324 fp = fopen(unrockridge(*argv),"r");
326 while ((line = fgets(buffer,256,fp)) != NULL) {
327 uint8_t *hash_value;
328 char *filename_ptr, *status;
329 int len = strlen(line);
331 if (line[0] < '0')
332 continue;
333 if (line[len-1] == '\n')
334 line[len-1] = 0;
335 filename_ptr = strstr(line, " ");
336 /* handle format for binary checksums */
337 if (filename_ptr == NULL) {
338 filename_ptr = strstr(line, " *");
339 }
340 if (filename_ptr == NULL) {
341 continue;
342 }
343 *filename_ptr = '\0';
344 *++filename_ptr = '/';
345 if (filename_ptr[1] == '/')
346 filename_ptr++;
348 files++;
349 status = "NOT CHECKED";
350 eol = '\n';
351 hash_value = hash_file(filename_ptr);
352 if (hash_value) {
353 tested++;
354 status = "BROKEN";
355 if (!strcmp((char*)hash_value, line)) {
356 good++;
357 status = "OK";
358 eol = ' ';
359 }
360 }
361 printf("\r%s: %s%s%c", filename_ptr, status, clear_eol, eol);
362 }
363 fclose(fp);
364 } while (*++argv);
365 printf("\r%d files OK, %d broken, %d not checked.%s\n",
366 good, tested - good, files - tested, clear_eol);
367 sleep(5);
368 return 0;
369 }
371 /*
372 * ifmem.c
373 *
374 * Run one command if the memory is large enought, and another if it isn't.
375 *
376 * Usage:
377 *
378 * label boot_kernel
379 * kernel ifmem.c
380 * append size_in_KB boot_large [size_in_KB boot_medium] boot_small
381 *
382 * label boot_large
383 * kernel vmlinuz_large_memory
384 * append ...
385 *
386 * label boot_small
387 * kernel vmlinuz_small_memory
388 * append ...
389 */
391 #include <inttypes.h>
392 #include <alloca.h>
393 #include <syslinux/boot.h>
395 struct e820_data {
396 uint64_t base;
397 uint64_t len;
398 uint32_t type;
399 uint32_t extattr;
400 } __attribute__((packed));
402 // Get memory size in Kb
403 static unsigned long memory_size(void)
404 {
405 uint64_t bytes = 0;
406 static com32sys_t ireg, oreg;
407 static struct e820_data ed;
409 ireg.eax.w[0] = 0xe820;
410 ireg.edx.l = 0x534d4150;
411 ireg.ecx.l = sizeof(struct e820_data);
412 ireg.edi.w[0] = OFFS(__com32.cs_bounce);
413 ireg.es = SEG(__com32.cs_bounce);
415 ed.extattr = 1;
417 do {
418 memcpy(__com32.cs_bounce, &ed, sizeof ed);
420 __intcall(0x15, &ireg, &oreg);
421 if (oreg.eflags.l & EFLAGS_CF ||
422 oreg.eax.l != 0x534d4150 ||
423 oreg.ecx.l < 20)
424 break;
426 memcpy(&ed, __com32.cs_bounce, sizeof ed);
428 if (ed.type == 1)
429 bytes += ed.len;
431 ireg.ebx.l = oreg.ebx.l;
432 } while (ireg.ebx.l);
434 if (!bytes) {
435 memset(&ireg, 0, sizeof ireg);
436 ireg.eax.w[0] = 0x8800;
437 __intcall(0x15, &ireg, &oreg);
438 return ireg.eax.w[0];
439 }
440 return bytes >> 10;
441 }
443 static void usage(const char *msg)
444 {
445 fprintf(stderr,"\n%s\n.",msg);
446 sleep(5);
447 exit(1);
448 }
450 static int main_ifmem(int argc, char *argv[])
451 {
452 int i;
453 unsigned long ram_size;
455 if (argc < 4) {
456 usage("Usage: ifmem.c32 size_KB boot_large_memory boot_small_memory");
457 }
459 // find target according to ram size
460 ram_size = memory_size();
461 printf("Total memory found %luK.\n",ram_size);
462 ram_size += (1 << 10); // add 1M to round boundaries...
464 i = 1;
465 do {
466 char *s = argv[i];
467 char *p = s;
468 unsigned long scale = 1;
470 while (*p >= '0' && *p <= '9') p++;
471 switch (*p | 0x20) {
472 case 'g': scale <<= 10;
473 case 'm': scale <<= 10;
474 default : *p = 0; break;
475 }
476 i++; // seek to label
477 if (ram_size >= scale * strtoul(s, NULL, 0)) break;
478 i++; // next size or default label
479 } while (i + 1 < argc);
481 if (i != argc) syslinux_run_command(argv[i]);
482 else syslinux_run_default();
483 return -1;
484 }
486 #include <syslinux/reboot.h>
488 static int main_reboot(int argc, char *argv[])
489 {
490 int warm = 0;
491 int i;
493 for (i = 1; i < argc; i++) {
494 if (!strcmp(argv[i], "-w") || !strcmp(argv[i], "--warm"))
495 warm = 1;
496 }
498 syslinux_reboot(warm);
499 }
501 /* APM poweroff module.
502 * based on poweroff.asm, Copyright 2009 Sebastian Herbszt
503 */
505 static int main_poweroff(int argc, char *argv[])
506 {
507 static com32sys_t ireg, oreg;
508 static char notsupported[] ="APM 1.1+ not supported";
509 unsigned i;
510 static struct {
511 unsigned short ax;
512 unsigned short bx;
513 unsigned short cx;
514 char *msg;
515 } inst[] = {
516 { 0x5300, // APM Installation Check (00h)
517 0, // APM BIOS (0000h)
518 0, "APM not present" },
519 { 0x5301, // APM Real Mode Interface Connect (01h)
520 0, // APM BIOS (0000h)
521 0, "APM RM interface connect failed" },
522 { 0x530E, // APM Driver Version (0Eh)
523 0, // APM BIOS (0000h)
524 0x0101, // APM Driver Version version 1.1
525 notsupported },
526 { 0x5307, // Set Power State (07h)
527 1, // All devices power managed by the APM
528 3, // Power state off
529 "Power off failed" }
530 };
532 (void) argc;
533 (void) argv;
534 for (i = 0; i < sizeof(inst)/sizeof(inst[0]); i++) {
535 char *msg = inst[i].msg;
537 ireg.eax.w[0] = inst[i].ax;
538 ireg.ebx.w[0] = inst[i].bx;
539 ireg.ecx.w[0] = inst[i].cx;
540 __intcall(0x15, &ireg, &oreg);
541 if ((oreg.eflags.l & EFLAGS_CF) == 0) {
542 switch (inst[i].ax) {
543 case 0x5300 :
544 if (oreg.ebx.w[0] != 0x504D /* 'PM' */) break;
545 msg = "Power management disabled";
546 if (oreg.ecx.w[0] & 8) break; // bit 3 APM BIOS Power Management disabled
547 case 0x530E :
548 msg = notsupported;
549 if (oreg.eax.w[0] < 0x101) break;
550 default : continue;
551 }
552 }
553 printf("%s.\n", msg);
554 return 1;
555 }
556 return 0;
557 }
559 /*
560 * Copyright 2009 Intel Corporation; author: H. Peter Anvin
561 */
563 #include <syslinux/keyboard.h>
564 #include <syslinux/loadfile.h>
565 #include <syslinux/adv.h>
567 static void setlinuxarg(int slot, int argc, char *argv[])
568 {
569 for (; argc--; argv++)
570 syslinux_setadv(slot++, strlen(*argv), *argv);
571 }
573 static int main_kbdmap(int argc, char *argv[])
574 {
575 const struct syslinux_keyboard_map *const kmap = syslinux_keyboard_map();
576 size_t map_size, size, i;
577 char *kbdmap, *msg;
579 if (argc < 3)
580 usage("Usage: kbdmap archive.cpio mapfile [cmdline]..");
582 // Save extra cmdline arguments
583 setlinuxarg(1, argc - 3, argv + 3);
585 msg = "Load error";
586 if (kmap->version != 1 ||
587 loadfile(argv[1], (void **) &kbdmap, &map_size) ||
588 strncmp(kbdmap, "07070", 5))
589 goto kbdmap_error;
591 // search for mapfile in cpio archive
592 for (i = 0; i < map_size;) {
593 int len, j;
594 char *name;
596 for (j = size = 0; j < 8; j++) {
597 char c = kbdmap[54 + i + j] - '0';
598 if (c > 9) c += '0' + 10 - 'A';
599 size <<= 4;
600 size += c;
601 }
602 i += 110;
603 name = kbdmap + i;
604 len = 1 + strlen(name);
605 i += len;
606 i += ((-i)&3);
607 if (!strcmp(name, argv[2])) {
608 kbdmap += i;
609 break;
610 }
611 i += size + ((-size)&3);
612 }
614 msg = "Filename error";
615 if (i >= map_size)
616 goto kbdmap_error;
618 msg = "Format error";
619 if (size != kmap->length)
620 goto kbdmap_error;
622 memcpy(kmap->map, kbdmap, size);
624 return 0;
626 kbdmap_error:
627 printf("%s.\n",msg);
628 return 1;
629 }
631 /* ----------------------------------------------------------------------- *
632 *
633 * Copyright 2007-2008 H. Peter Anvin - All Rights Reserved
634 * Copyright 2009 Intel Corporation; author: H. Peter Anvin
635 *
636 * Permission is hereby granted, free of charge, to any person
637 * obtaining a copy of this software and associated documentation
638 * files (the "Software"), to deal in the Software without
639 * restriction, including without limitation the rights to use,
640 * copy, modify, merge, publish, distribute, sublicense, and/or
641 * sell copies of the Software, and to permit persons to whom
642 * the Software is furnished to do so, subject to the following
643 * conditions:
644 *
645 * The above copyright notice and this permission notice shall
646 * be included in all copies or substantial portions of the Software.
647 *
648 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
649 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
650 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
651 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
652 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
653 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
654 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
655 * OTHER DEALINGS IN THE SOFTWARE.
656 *
657 * ----------------------------------------------------------------------- */
659 /*
660 * linux.c
661 *
662 * Sample module to load Linux kernels. This module can also create
663 * a file out of the DHCP return data if running under PXELINUX.
664 *
665 * If -dhcpinfo is specified, the DHCP info is written into the file
666 * /dhcpinfo.dat in the initramfs.
667 *
668 * Usage: linux.c32 [-dhcpinfo] kernel arguments...
669 */
671 #include <stdbool.h>
672 #include <stdlib.h>
673 #include <stdio.h>
674 #include <string.h>
675 #include <console.h>
676 #include <syslinux/loadfile.h>
677 #include <syslinux/linux.h>
678 #include <syslinux/pxe.h>
680 const char *progname = "linux.c32";
682 /* Find the last instance of a particular command line argument
683 (which should include the final =; do not use for boolean arguments) */
684 static char *find_argument(char **argv, const char *argument)
685 {
686 int la = strlen(argument);
687 char **arg;
688 char *ptr = NULL;
690 for (arg = argv; *arg; arg++) {
691 if (!memcmp(*arg, argument, la))
692 ptr = *arg + la;
693 }
695 return ptr;
696 }
698 /* Search for a boolean argument; return its position, or 0 if not present */
699 static int find_boolean(char **argv, const char *argument)
700 {
701 char **arg;
703 for (arg = argv; *arg; arg++) {
704 if (!strcmp(*arg, argument))
705 return (arg - argv) + 1;
706 }
708 return 0;
709 }
711 /* Stitch together the command line from a set of argv's */
712 static char *make_cmdline(char **argv)
713 {
714 char **arg;
715 size_t bytes, size;
716 char *cmdline, *p;
717 int i;
719 bytes = 1; /* Just in case we have a zero-entry cmdline */
720 for (arg = argv; *arg; arg++) {
721 bytes += strlen(*arg) + 1;
722 }
723 for (i = 0; i < 255; i++)
724 if (syslinux_getadv(i, &size))
725 bytes += ++size;
727 p = cmdline = malloc(bytes);
728 if (!cmdline)
729 return NULL;
731 for (arg = argv; *arg; arg++) {
732 int len = strlen(*arg);
733 memcpy(p, *arg, len);
734 p[len] = ' ';
735 p += len + 1;
736 }
738 for (i = 0; i < 255; i++) {
739 const void *q = syslinux_getadv(i, &size);
740 if (q == NULL) continue;
741 memcpy(p, q, size);
742 p[size] = ' ';
743 p += size + 1;
744 }
746 if (p > cmdline)
747 p--; /* Remove the last space */
748 *p = '\0';
750 return cmdline;
751 }
753 static int main_linux(int argc, char *argv[])
754 {
755 const char *kernel_name;
756 struct initramfs *initramfs;
757 char *cmdline;
758 char *boot_image;
759 void *kernel_data;
760 size_t kernel_len;
761 bool opt_dhcpinfo = false;
762 bool opt_quiet = false;
763 void *dhcpdata;
764 size_t dhcplen;
765 char **argp, *arg, *p;
767 (void)argc;
768 argp = argv + 1;
770 while ((arg = *argp) && arg[0] == '-') {
771 if (!strcmp("-dhcpinfo", arg)) {
772 opt_dhcpinfo = true;
773 } else {
774 fprintf(stderr, "%s: unknown option: %s\n", progname, arg);
775 return 1;
776 }
777 argp++;
778 }
780 if (!arg) {
781 fprintf(stderr, "%s: missing kernel name\n", progname);
782 return 1;
783 }
785 kernel_name = arg;
787 boot_image = malloc(strlen(kernel_name) + 12);
788 if (!boot_image)
789 goto bail;
790 strcpy(boot_image, "BOOT_IMAGE=");
791 strcpy(boot_image + 11, kernel_name);
792 /* argp now points to the kernel name, and the command line follows.
793 Overwrite the kernel name with the BOOT_IMAGE= argument, and thus
794 we have the final argument. */
795 *argp = boot_image;
797 if (find_boolean(argp, "quiet"))
798 opt_quiet = true;
800 if (!opt_quiet)
801 printf("Loading %s... ", kernel_name);
802 if (loadfile(kernel_name, &kernel_data, &kernel_len)) {
803 if (opt_quiet)
804 printf("Loading %s ", kernel_name);
805 printf("failed!\n");
806 goto bail;
807 }
808 if (!opt_quiet)
809 printf("ok\n");
811 cmdline = make_cmdline(argp);
812 if (!cmdline)
813 goto bail;
815 /* Initialize the initramfs chain */
816 initramfs = initramfs_init();
817 if (!initramfs)
818 goto bail;
820 if ((arg = find_argument(argp, "initrd="))) {
821 do {
822 p = strchr(arg, ',');
823 if (p)
824 *p = '\0';
826 if (!opt_quiet)
827 printf("Loading %s... ", arg);
828 if (initramfs_load_archive(initramfs, arg)) {
829 if (opt_quiet)
830 printf("Loading %s ", kernel_name);
831 printf("failed!\n");
832 goto bail;
833 }
834 if (!opt_quiet)
835 printf("ok\n");
837 if (p)
838 *p++ = ',';
839 } while ((arg = p));
840 }
842 /* Append the DHCP info */
843 if (opt_dhcpinfo &&
844 !pxe_get_cached_info(PXENV_PACKET_TYPE_DHCP_ACK, &dhcpdata, &dhcplen)) {
845 if (initramfs_add_file(initramfs, dhcpdata, dhcplen, dhcplen,
846 "/dhcpinfo.dat", 0, 0755))
847 goto bail;
848 }
850 /* This should not return... */
851 syslinux_boot_linux(kernel_data, kernel_len, initramfs, cmdline);
853 bail:
854 fprintf(stderr, "Kernel load failure (insufficient memory?)\n");
855 return 1;
856 }
858 static int main_setarg(int argc, char *argv[])
859 {
860 if (argc < 3) {
861 usage("Usage: setarg.c32 argnum [args]...");
862 }
863 setlinuxarg(atoi(argv[1]), argc - 2, argv + 2);
864 return 0;
865 }
867 static int main_ifarg(int argc, char *argv[])
868 {
869 int i;
870 size_t size;
872 if (argc < 3) {
873 usage("Usage: ifarg.c32 [argnum labelifset]... labelifnoneset");
874 }
875 for (i = 1; i < argc - 1; i += 2) {
876 int n = atoi(argv[i]);
877 if (n == -1) {
878 for (n = 0; n < 255; n++) {
879 if (syslinux_getadv(n, &size))
880 goto found;
881 }
882 continue;
883 }
884 else if (! syslinux_getadv(n, &size)) continue;
885 found:
886 syslinux_run_command(argv[i+1]);
887 }
888 if (i != argc) syslinux_run_command(argv[i]);
889 else syslinux_run_default();
890 return 0;
891 }
893 /* ----------------------------------------------------------------------- *
894 *
895 * Copyright 2007-2008 H. Peter Anvin - All Rights Reserved
896 *
897 * This program is free software; you can redistribute it and/or modify
898 * it under the terms of the GNU General Public License as published by
899 * the Free Software Foundation, Inc., 53 Temple Place Ste 330,
900 * Boston MA 02111-1307, USA; either version 2 of the License, or
901 * (at your option) any later version; incorporated herein by reference.
902 *
903 * ----------------------------------------------------------------------- */
905 static int main_listarg(int argc, char *argv[])
906 {
907 uint8_t *p, *ep;
908 size_t s = syslinux_adv_size();
909 char buf[256];
911 (void) argc;
912 (void) argv;
913 p = syslinux_adv_ptr();
915 printf("args size: %zd bytes at %p\n", s, p);
917 ep = p + s; /* Need at least opcode+len */
918 while (p < ep - 1 && *p) {
919 int t = *p++;
920 int l = *p++;
922 if (p + l > ep)
923 break;
925 memcpy(buf, p, l);
926 buf[l] = '\0';
928 printf("arg %3d: \"%s\"\n", t, buf);
930 p += l;
931 }
932 sleep(5);
933 return 0;
934 }
936 int main(int argc, char *argv[])
937 {
938 unsigned i;
939 static struct {
940 char *name;
941 int (*main)(int argc, char *argv[]);
942 } bin[] = {
943 { "say", main_say },
944 { "md5sum", main_md5sum },
945 { "ifmem", main_ifmem },
946 { "reboot", main_reboot },
947 { "poweroff", main_poweroff },
948 { "kbdmap", main_kbdmap },
949 { "linux", main_linux },
950 { "setarg", main_setarg },
951 { "ifarg", main_ifarg },
952 { "listarg", main_listarg }
953 };
955 openconsole(&dev_null_r, &dev_stdcon_w);
957 if (strstr(argv[0], "c32box")) { argc--; argv++; }
958 for (i = 0; i < sizeof(bin)/sizeof(bin[0]); i++)
959 if (strstr(argv[0], bin[i].name))
960 return bin[i].main(argc, argv);
961 printf("No %s in c32box modules\n", argv[0]);
962 for (i = 0; i < sizeof(bin)/sizeof(bin[0]); i++)
963 printf(" %s \n",bin[i].name);
964 return 1;
965 }