parse.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  1. /* $OpenBSD: parse.c,v 1.1 2013/10/28 22:13:13 miod Exp $ */
  2. /* $NetBSD: parse.c,v 1.4 2013/01/22 15:48:40 tsutsui Exp $ */
  3. /*
  4. * Copyright (c) 1992 OMRON Corporation.
  5. *
  6. * This code is derived from software contributed to Berkeley by
  7. * OMRON Corporation.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions
  11. * are met:
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. * 2. Redistributions in binary form must reproduce the above copyright
  15. * notice, this list of conditions and the following disclaimer in the
  16. * documentation and/or other materials provided with the distribution.
  17. * 3. All advertising materials mentioning features or use of this software
  18. * must display the following acknowledgement:
  19. * This product includes software developed by the University of
  20. * California, Berkeley and its contributors.
  21. * 4. Neither the name of the University nor the names of its contributors
  22. * may be used to endorse or promote products derived from this software
  23. * without specific prior written permission.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  26. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  29. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  30. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  31. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  32. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  33. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  34. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  35. * SUCH DAMAGE.
  36. *
  37. * @(#)parse.c 8.1 (Berkeley) 6/10/93
  38. */
  39. /*
  40. * Copyright (c) 1992, 1993
  41. * The Regents of the University of California. All rights reserved.
  42. *
  43. * This code is derived from software contributed to Berkeley by
  44. * OMRON Corporation.
  45. *
  46. * Redistribution and use in source and binary forms, with or without
  47. * modification, are permitted provided that the following conditions
  48. * are met:
  49. * 1. Redistributions of source code must retain the above copyright
  50. * notice, this list of conditions and the following disclaimer.
  51. * 2. Redistributions in binary form must reproduce the above copyright
  52. * notice, this list of conditions and the following disclaimer in the
  53. * documentation and/or other materials provided with the distribution.
  54. * 3. Neither the name of the University nor the names of its contributors
  55. * may be used to endorse or promote products derived from this software
  56. * without specific prior written permission.
  57. *
  58. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  59. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  60. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  61. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  62. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  63. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  64. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  65. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  66. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  67. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  68. * SUCH DAMAGE.
  69. *
  70. * @(#)parse.c 8.1 (Berkeley) 6/10/93
  71. */
  72. /*
  73. * parse.c -- command parser
  74. * by A.Fujita, JAN-30-1992
  75. */
  76. #include <lib/libkern/libkern.h>
  77. #include <luna88k/stand/boot/samachdep.h>
  78. #include <luna88k/stand/boot/status.h>
  79. static int cmd_help(int, char *[]);
  80. int
  81. exit_program(int argc, char *argv[])
  82. {
  83. return(ST_EXIT);
  84. }
  85. static const char helpmsg[] =
  86. "commands are:\n"
  87. "boot [device(unit,part)filename]\n"
  88. " (ex. \"boot sd(0,0)bsd\", \"boot le(0,0)obsd\" etc.)\n"
  89. "help\n"
  90. "exit\n"
  91. ;
  92. static int
  93. cmd_help(int argc, char *argv[])
  94. {
  95. printf(helpmsg);
  96. return ST_NORMAL;
  97. }
  98. struct command_entry {
  99. char *name;
  100. int (*func)(int, char **);
  101. };
  102. struct command_entry entries[] = {
  103. { "b", boot },
  104. { "boot", boot },
  105. { "exit", exit_program },
  106. { "help", cmd_help },
  107. { "quit", exit_program },
  108. { 0, 0 }
  109. };
  110. int
  111. parse(int argc, char *argv[])
  112. {
  113. int i, status = ST_NOTFOUND;
  114. for (i = 0; entries[i].name != (char *) 0; i++) {
  115. if (!strcmp(argv[0], entries[i].name)) {
  116. status = (*entries[i].func)(argc, argv);
  117. break;
  118. }
  119. }
  120. return(status);
  121. }
  122. /*
  123. * getargs -- make argument arrays
  124. */
  125. int
  126. getargs(char buffer[], char *argv[], int maxargs)
  127. {
  128. int n = 0;
  129. char *p = buffer;
  130. argv[n++] = p;
  131. while (*p != '\0') {
  132. if ( *p == ' ' ) {
  133. *p = '\0';
  134. } else if (p != buffer && *(p-1) == '\0') {
  135. if ( n < maxargs )
  136. argv[n++] = p;
  137. }
  138. p++;
  139. }
  140. return(n);
  141. }