2 * Copyright (c) 1998 - 2000 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 RCSID("$Id: ss.c 15429 2005-06-16 19:24:11Z lha $");
44 ss_request_table *table;
47 static struct ss_subst subsystems[2];
48 static int num_subsystems;
51 ss_create_invocation(const char *subsystem,
54 ss_request_table *table,
59 if(num_subsystems >= sizeof(subsystems) / sizeof(subsystems[0])) {
63 ss = &subsystems[num_subsystems];
64 ss->name = ss->version = ss->info = NULL;
65 if (subsystem != NULL) {
66 ss->name = strdup (subsystem);
67 if (ss->name == NULL) {
72 if (version != NULL) {
73 ss->version = strdup (version);
74 if (ss->version == NULL) {
80 ss->info = strdup (info);
81 if (ss->info == NULL) {
88 return num_subsystems++;
92 ss_error (int idx, long code, const char *fmt, ...)
96 com_err_va (subsystems[idx].name, code, fmt, ap);
101 ss_perror (int idx, long code, const char *msg)
103 ss_error(idx, code, "%s", msg);
107 ss_execute_command(int idx, char **argv)
113 ret = sl_command(subsystems[idx].table, argc, argv);
114 if (ret == SL_BADCOMMAND)
115 return SS_ET_COMMAND_NOT_FOUND;
120 ss_execute_line (int idx, const char *line)
122 char *buf = strdup(line);
129 sl_make_argv(buf, &argc, &argv);
130 ret = sl_command(subsystems[idx].table, argc, argv);
132 if (ret == SL_BADCOMMAND)
133 return SS_ET_COMMAND_NOT_FOUND;
140 char *prompt = malloc(strlen(subsystems[idx].name) + 3);
144 strcpy(prompt, subsystems[idx].name);
145 strcat(prompt, ": ");
146 sl_loop(subsystems[idx].table, prompt);
152 ss_list_requests(int argc, char **argv /* , int idx, void *info */)
154 sl_help(subsystems[0 /* idx */].table, argc, argv);
159 ss_quit(int argc, char **argv)