parse.c revision 1.3
1 /* $NetBSD: parse.c,v 1.3 2013/01/21 11:58:12 tsutsui Exp $ */ 2 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 /* 74 * parse.c -- command parser 75 * by A.Fujita, JAN-30-1992 76 */ 77 78 #include <lib/libkern/libkern.h> 79 #include <luna68k/stand/boot/samachdep.h> 80 #include <luna68k/stand/boot/status.h> 81 82 static int cmd_help(int, char *[]); 83 84 int 85 check_args(int argc, char *argv[]) 86 { 87 int i; 88 89 for ( i = 0; i < argc; i++) 90 printf("argv[%d] = \"%s\"\n", i, argv[i]); 91 92 return(ST_NORMAL); 93 } 94 95 int 96 exit_program(int argc, char *argv[]) 97 { 98 return(ST_EXIT); 99 } 100 101 static const char helpmsg[] = 102 "commands are:\n" 103 "boot [device(unit,part)filename]\n" 104 " (ex. \"boot sd(0,0)netbsd\", \"boot le(0,0)netbsd.old\" etc.)\n" 105 "ls [device(unit, part)[path]]\n" 106 " (ex. \"ls sd(0,0)/bin\")\n" 107 "help\n" 108 "exit\n" 109 #if 0 /* debug commands */ 110 "checkargs\n" 111 "disklabel\n" 112 "howto\n" 113 "screen\n" 114 "scsi\n" 115 #endif 116 ; 117 118 static int 119 cmd_help(int argc, char *argv[]) 120 { 121 122 printf(helpmsg); 123 return ST_NORMAL; 124 } 125 126 struct command_entry { 127 char *name; 128 int (*func)(int, char **); 129 }; 130 131 struct command_entry entries[] = { 132 { "b", boot }, 133 { "boot", boot }, 134 { "chkargs", check_args }, 135 { "disklabel", disklabel }, 136 { "exit", exit_program }, 137 #ifdef notyet 138 { "fsdump", fsdump }, 139 { "fsrestore", fsrestore }, 140 #endif 141 { "help", cmd_help }, 142 { "howto", how_to_boot }, 143 { "ls", cmd_ls }, 144 { "screen", screen }, 145 #ifdef notyet 146 { "tape", tape }, 147 { "tp", tape }, 148 #endif 149 { "scsi", scsi }, 150 { "quit", exit_program }, 151 { 0, 0 } 152 }; 153 154 155 int 156 parse(int argc, char *argv[]) 157 { 158 int i, status = ST_NOTFOUND; 159 160 for (i = 0; entries[i].name != (char *) 0; i++) { 161 if (!strcmp(argv[0], entries[i].name)) { 162 status = (*entries[i].func)(argc, argv); 163 break; 164 } 165 } 166 167 return(status); 168 } 169 170 171 172 /* 173 * getargs -- make argument arrays 174 */ 175 176 int 177 getargs(char buffer[], char *argv[], int maxargs) 178 { 179 int n = 0; 180 char *p = buffer; 181 182 argv[n++] = p; 183 while (*p != '\0') { 184 if ( *p == ' ' ) { 185 *p = '\0'; 186 } else if (p != buffer && *(p-1) == '\0') { 187 if ( n < maxargs ) 188 argv[n++] = p; 189 } 190 p++; 191 } 192 193 return(n); 194 } 195
Indexes created Wed Sep 24 15:09:51 GMT 2025