/*
- *
- * Bacula Director -- User Agent Input and scanning code
- *
- * Kern Sibbald, October MMI
- */
+ Bacula® - The Network Backup Solution
-/*
- Copyright (C) 2000, 2001, 2002 Kern Sibbald and John Walker
+ Copyright (C) 2001-2008 Free Software Foundation Europe e.V.
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License as
- published by the Free Software Foundation; either version 2 of
- the License, or (at your option) any later version.
+ The main author of Bacula is Kern Sibbald, with contributions from
+ many others, a complete list can be found in the file AUTHORS.
+ This program is Free Software; you can redistribute it and/or
+ modify it under the terms of version two of the GNU General Public
+ License as published by the Free Software Foundation and included
+ in the file LICENSE.
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
- You should have received a copy of the GNU General Public
- License along with this program; if not, write to the Free
- Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- MA 02111-1307, USA.
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+ 02110-1301, USA.
+ Bacula® is a registered trademark of Kern Sibbald.
+ The licensor of Bacula is the Free Software Foundation Europe
+ (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
+ Switzerland, email:ftf@fsfeurope.org.
+*/
+/*
+ *
+ * Bacula Director -- User Agent Input and scanning code
+ *
+ * Kern Sibbald, October MMI
+ *
+ * Version $Id$
*/
#include "bacula.h"
#include "dird.h"
-#include "ua.h"
/* Imported variables */
/* Exported functions */
-int get_cmd(UAContext *ua, char *prompt)
+int get_cmd(UAContext *ua, const char *prompt)
{
BSOCK *sock = ua->UA_sock;
+ int stat;
ua->cmd[0] = 0;
- bnet_fsend(sock, "%s", prompt);
- bnet_sig(sock, BNET_PROMPT); /* request more input */
+ if (!sock || ua->batch) { /* No UA or batch mode */
+ return 0;
+ }
+ sock->fsend("%s", prompt);
+ sock->signal(BNET_PROMPT); /* request more input */
for ( ;; ) {
- if (bnet_recv(sock) < 0) {
- return 0;
+ stat = sock->recv();
+ if (stat == BNET_SIGNAL) {
+ continue; /* ignore signals */
+ }
+ if (is_bnet_stop(sock)) {
+ return 0; /* error or terminate */
}
- ua->cmd = (char *) check_pool_memory_size(ua->cmd, sock->msglen+1);
- strcpy(ua->cmd, sock->msg);
- ua->cmd[sock->msglen] = 0;
+ pm_strcpy(ua->cmd, sock->msg);
strip_trailing_junk(ua->cmd);
if (strcmp(ua->cmd, ".messages") == 0) {
- qmessagescmd(ua, ua->cmd);
+ qmessagescmd(ua, ua->cmd);
}
- /* ****FIXME**** if .command, go off and do it. For now ignore it. */
- if (ua->cmd[0] == '.' && ua->cmd[1] != 0) {
- continue; /* dot command */
+ /* Lone dot => break */
+ if (ua->cmd[0] == '.' && ua->cmd[1] == 0) {
+ return 0;
}
- /* Lone dot => break or actual response */
break;
}
return 1;
}
-/*
- * Return next argument from command line. Note, this
- * routine is destructive.
+/*
+ * Get a positive integer
+ * Returns: false if failure
+ * true if success => value in ua->pint32_val
*/
-char *next_arg(char **s)
+bool get_pint(UAContext *ua, const char *prompt)
{
- char *p, *n;
-
- /* skip past spaces to next arg */
- for (p=*s; *p && *p == ' '; p++)
- {}
- /* Determine start of argument */
- if (*p == '"') {
- n = p+1; /* skip leading quote */
- } else {
- n = p;
- }
- /* Scan argment and terminate it */
- for ( ; *p && *p != ' '; p++) {
- if (*p == '"') {
- for (p++; *p && *p != '"'; p++) {
- *(p-1) = *p;
- *p = 0;
- }
- break;
+ double dval;
+ ua->pint32_val = 0;
+ ua->int64_val = 0;
+ for (;;) {
+ ua->cmd[0] = 0;
+ if (!get_cmd(ua, prompt)) {
+ return false;
}
+ /* Kludge for slots blank line => 0 */
+ if (ua->cmd[0] == 0 && strncmp(prompt, _("Enter slot"), strlen(_("Enter slot"))) == 0) {
+ return true;
+ }
+ if (!is_a_number(ua->cmd)) {
+ ua->warning_msg(_("Expected a positive integer, got: %s\n"), ua->cmd);
+ continue;
+ }
+ errno = 0;
+ dval = strtod(ua->cmd, NULL);
+ if (errno != 0 || dval < 0) {
+ ua->warning_msg(_("Expected a positive integer, got: %s\n"), ua->cmd);
+ continue;
+ }
+ ua->pint32_val = (uint32_t)dval;
+ ua->int64_val = (int64_t)dval;
+ return true;
}
- if (*p) { /* if more arguments */
- *p++ = 0; /* terminate this one */
- }
- *s = p;
- return n;
-}
+}
/*
- * This routine parses the input command line.
- * It makes a copy in args, then builds an
- * argc, argv like list where
- *
- * argc = count of arguments
- * argk[i] = argument keyword (part preceding =)
- * argv[i] = argument value (part after =)
- *
- * example: arg1 arg2=abc arg3=
- *
- * argc = c
- * argk[0] = arg1
- * argv[0] = NULL
- * argk[1] = arg2
- * argv[1] = abc
- * argk[2] = arg3
- * argv[2] =
+ * Test a yes or no response
+ * Returns: false if failure
+ * true if success => ret == 1 for yes
+ * ret == 0 for no
*/
+bool is_yesno(char *val, int *ret)
+{
+ *ret = 0;
+ if ((strcasecmp(val, _("yes")) == 0) ||
+ (strcasecmp(val, NT_("yes")) == 0))
+ {
+ *ret = 1;
+ } else if ((strcasecmp(val, _("no")) == 0) ||
+ (strcasecmp(val, NT_("no")) == 0))
+ {
+ *ret = 0;
+ } else {
+ return false;
+ }
-void parse_command_args(UAContext *ua)
+ return true;
+}
+
+/*
+ * Gets a yes or no response
+ * Returns: false if failure
+ * true if success => ua->pint32_val == 1 for yes
+ * ua->pint32_val == 0 for no
+ */
+bool get_yesno(UAContext *ua, const char *prompt)
{
- BSOCK *sock = ua->UA_sock;
- char *p, *n;
- int i;
-
- ua->args = (char *) check_pool_memory_size(ua->args, sock->msglen+1);
- strcpy(ua->args, sock->msg);
- ua->args[sock->msglen] = 0;
- strip_trailing_junk(ua->args);
- ua->argc = 0;
- p = ua->args;
- /* Pick up all arguments */
- while (ua->argc < MAX_ARGS) {
- n = next_arg(&p);
- if (*n) {
- ua->argk[ua->argc++] = n;
- } else {
- break;
+ int len;
+ int ret;
+ ua->pint32_val = 0;
+ for (;;) {
+ if (ua->api) ua->UA_sock->signal(BNET_YESNO);
+ if (!get_cmd(ua, prompt)) {
+ return false;
}
- }
- /* Separate keyword and value */
- for (i=0; i<ua->argc; i++) {
- p = strchr(ua->argk[i], '=');
- if (p) {
- *p++ = 0; /* terminate keyword and point to value */
- if (strlen(p) > MAX_NAME_LENGTH-1) {
- p[MAX_NAME_LENGTH-1] = 0; /* truncate to max len */
- }
+ len = strlen(ua->cmd);
+ if (len < 1 || len > 3) {
+ continue;
}
- ua->argv[i] = p; /* save ptr to value or NULL */
+ if (is_yesno(ua->cmd, &ret)) {
+ ua->pint32_val = ret;
+ return true;
+ }
+ ua->warning_msg(_("Invalid response. You must answer yes or no.\n"));
}
-#ifdef xxxxxxxxx
- for (i=0; i<ua->argc; i++) {
- Dmsg3(000, "Arg %d: kw=%s val=%s\n", i,
- ua->argk[i], ua->argv[i]?ua->argv[i]:"NULL");
+}
+
+/*
+ * Gets an Enabled value => 0, 1, 2, yes, no, archived
+ * Returns: 0, 1, 2 if OK
+ * -1 on error
+ */
+int get_enabled(UAContext *ua, const char *val)
+{
+ int Enabled = -1;
+
+ if (strcasecmp(val, "yes") == 0 || strcasecmp(val, "true") == 0) {
+ Enabled = 1;
+ } else if (strcasecmp(val, "no") == 0 || strcasecmp(val, "false") == 0) {
+ Enabled = 0;
+ } else if (strcasecmp(val, "archived") == 0) {
+ Enabled = 2;
+ } else {
+ Enabled = atoi(val);
+ }
+ if (Enabled < 0 || Enabled > 2) {
+ ua->error_msg(_("Invalid Enabled value, it must be yes, no, archived, 0, 1, or 2\n"));
+ return -1;
}
-#endif
+ return Enabled;
+}
+
+void parse_ua_args(UAContext *ua)
+{
+ parse_args(ua->cmd, &ua->args, &ua->argc, ua->argk, ua->argv, MAX_CMD_ARGS);
}
projects / bacula / bacula / blobdiff