2012-11-17 19:07:00 -05:00
|
|
|
/*
|
|
|
|
* parser.c
|
|
|
|
*
|
2013-01-10 21:05:29 -05:00
|
|
|
* Copyright (C) 2012, 2013 James Booth <boothj5@gmail.com>
|
2012-11-17 19:07:00 -05:00
|
|
|
*
|
|
|
|
* This file is part of Profanity.
|
|
|
|
*
|
|
|
|
* Profanity 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 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Profanity 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 Profanity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include <glib.h>
|
|
|
|
|
2012-11-17 21:40:49 -05:00
|
|
|
/*
|
|
|
|
* Take a full line of input and return an array of strings representing
|
|
|
|
* the arguments of a command.
|
|
|
|
* If the number of arguments found is less than min, or more than max
|
|
|
|
* NULL is returned.
|
|
|
|
*
|
|
|
|
* inp - The line of input
|
|
|
|
* min - The minimum allowed number of arguments
|
|
|
|
* max - The maxmimum allowed number of arguments
|
|
|
|
*
|
|
|
|
* Returns - An NULL terminated array of strings representing the aguments
|
|
|
|
* of the command, or NULL if the validation fails.
|
|
|
|
*
|
|
|
|
* E.g. the following input line:
|
|
|
|
*
|
|
|
|
* /cmd arg1 arg2
|
|
|
|
*
|
|
|
|
* Will return a pointer to the following array:
|
|
|
|
*
|
|
|
|
* { "arg1", "arg2", NULL }
|
|
|
|
*
|
|
|
|
*/
|
2012-11-17 19:07:00 -05:00
|
|
|
gchar **
|
2012-11-17 21:40:49 -05:00
|
|
|
parse_args(const char * const inp, int min, int max)
|
2012-11-17 19:07:00 -05:00
|
|
|
{
|
|
|
|
if (inp == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// copy and strip input of leading/trailing whitepsace
|
|
|
|
char *copy = strdup(inp);
|
|
|
|
g_strstrip(copy);
|
|
|
|
|
|
|
|
int inp_size = strlen(copy);
|
|
|
|
gboolean in_token = FALSE;
|
|
|
|
char *token_start = ©[0];
|
|
|
|
int token_size = 0;
|
|
|
|
GSList *tokens = NULL;
|
|
|
|
|
|
|
|
// add tokens to GSList
|
|
|
|
int i;
|
|
|
|
for (i = 0; i <= inp_size; i++) {
|
|
|
|
if (!in_token) {
|
|
|
|
if (copy[i] == ' ') {
|
|
|
|
continue;
|
|
|
|
} else {
|
|
|
|
in_token = TRUE;
|
|
|
|
token_start = ©[i];
|
|
|
|
token_size++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (copy[i] == ' ' || copy[i] == '\0') {
|
2012-11-17 19:25:08 -05:00
|
|
|
tokens = g_slist_append(tokens, g_strndup(token_start,
|
2012-11-17 19:07:00 -05:00
|
|
|
token_size));
|
|
|
|
token_size = 0;
|
|
|
|
in_token = FALSE;
|
|
|
|
} else {
|
|
|
|
token_size++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-11-17 19:25:08 -05:00
|
|
|
|
2012-11-17 21:40:49 -05:00
|
|
|
int num = g_slist_length(tokens) - 1;
|
2012-11-17 19:25:08 -05:00
|
|
|
|
|
|
|
// if num args not valid return NULL
|
2012-11-17 21:40:49 -05:00
|
|
|
if ((num < min) || (num > max)) {
|
2012-11-17 19:25:08 -05:00
|
|
|
g_slist_free_full(tokens, free);
|
2012-11-25 21:20:44 -05:00
|
|
|
g_free(copy);
|
2012-11-17 19:25:08 -05:00
|
|
|
return NULL;
|
|
|
|
|
2012-11-17 19:38:37 -05:00
|
|
|
// if min allowed is 0 and 0 found, return empty char* array
|
2012-11-17 21:40:49 -05:00
|
|
|
} else if (min == 0 && num == 0) {
|
2012-11-25 21:20:44 -05:00
|
|
|
g_slist_free_full(tokens, free);
|
2012-11-17 21:40:49 -05:00
|
|
|
gchar **args = malloc((num + 1) * sizeof(*args));
|
2012-11-17 19:38:37 -05:00
|
|
|
args[0] = NULL;
|
2012-11-25 21:20:44 -05:00
|
|
|
g_free(copy);
|
2012-11-17 19:38:37 -05:00
|
|
|
return args;
|
|
|
|
|
2012-11-17 19:25:08 -05:00
|
|
|
// otherwise return args array
|
|
|
|
} else {
|
2012-11-17 21:40:49 -05:00
|
|
|
gchar **args = malloc((num + 1) * sizeof(*args));
|
2012-11-17 19:25:08 -05:00
|
|
|
GSList *token = tokens;
|
|
|
|
token = g_slist_next(token);
|
|
|
|
int arg_count = 0;
|
|
|
|
|
|
|
|
while (token != NULL) {
|
|
|
|
args[arg_count++] = strdup(token->data);
|
|
|
|
token = g_slist_next(token);
|
|
|
|
}
|
|
|
|
|
|
|
|
args[arg_count] = NULL;
|
|
|
|
g_slist_free_full(tokens, free);
|
2012-11-25 21:20:44 -05:00
|
|
|
g_free(copy);
|
2012-11-17 19:25:08 -05:00
|
|
|
|
|
|
|
return args;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-11-17 21:40:49 -05:00
|
|
|
/*
|
|
|
|
* Take a full line of input and return an array of strings representing
|
|
|
|
* the arguments of a command. This function handles when the last parameter
|
|
|
|
* to the command is free text e.g.
|
|
|
|
*
|
|
|
|
* /msg user@host here is a message
|
|
|
|
*
|
|
|
|
* If the number of arguments found is less than min, or more than max
|
|
|
|
* NULL is returned.
|
|
|
|
*
|
|
|
|
* inp - The line of input
|
|
|
|
* min - The minimum allowed number of arguments
|
|
|
|
* max - The maxmimum allowed number of arguments
|
|
|
|
*
|
|
|
|
* Returns - An NULL terminated array of strings representing the aguments
|
|
|
|
* of the command, or NULL if the validation fails.
|
|
|
|
*
|
|
|
|
* E.g. the following input line:
|
|
|
|
*
|
|
|
|
* /cmd arg1 arg2 some free text
|
|
|
|
*
|
|
|
|
* Will return a pointer to the following array:
|
|
|
|
*
|
|
|
|
* { "arg1", "arg2", "some free text", NULL }
|
|
|
|
*
|
|
|
|
*/
|
2012-11-17 19:25:08 -05:00
|
|
|
gchar **
|
2012-11-17 21:40:49 -05:00
|
|
|
parse_args_with_freetext(const char * const inp, int min, int max)
|
2012-11-17 19:25:08 -05:00
|
|
|
{
|
|
|
|
if (inp == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// copy and strip input of leading/trailing whitepsace
|
|
|
|
char *copy = strdup(inp);
|
|
|
|
g_strstrip(copy);
|
|
|
|
|
|
|
|
int inp_size = strlen(copy);
|
|
|
|
gboolean in_token = FALSE;
|
|
|
|
gboolean in_freetext = FALSE;
|
|
|
|
char *token_start = ©[0];
|
|
|
|
int token_size = 0;
|
|
|
|
int num_tokens = 0;
|
|
|
|
GSList *tokens = NULL;
|
|
|
|
|
|
|
|
// add tokens to GSList
|
|
|
|
int i;
|
|
|
|
for (i = 0; i <= inp_size; i++) {
|
|
|
|
if (!in_token) {
|
|
|
|
if (copy[i] == ' ') {
|
|
|
|
continue;
|
|
|
|
} else {
|
|
|
|
in_token = TRUE;
|
|
|
|
num_tokens++;
|
|
|
|
if (num_tokens == max + 1) {
|
|
|
|
in_freetext = TRUE;
|
|
|
|
}
|
|
|
|
token_start = ©[i];
|
|
|
|
token_size++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if ((!in_freetext && copy[i] == ' ') || copy[i] == '\0') {
|
|
|
|
tokens = g_slist_append(tokens, g_strndup(token_start,
|
|
|
|
token_size));
|
|
|
|
token_size = 0;
|
|
|
|
in_token = FALSE;
|
|
|
|
} else {
|
|
|
|
token_size++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-11-17 21:40:49 -05:00
|
|
|
int num = g_slist_length(tokens) - 1;
|
2012-11-17 19:07:00 -05:00
|
|
|
|
|
|
|
// if num args not valid return NULL
|
2012-11-17 21:40:49 -05:00
|
|
|
if ((num < min) || (num > max)) {
|
2012-11-17 19:07:00 -05:00
|
|
|
g_slist_free_full(tokens, free);
|
|
|
|
free(copy);
|
|
|
|
return NULL;
|
|
|
|
|
2012-11-17 19:38:37 -05:00
|
|
|
// if min allowed is 0 and 0 found, return empty char* array
|
2012-11-17 21:40:49 -05:00
|
|
|
} else if (min == 0 && num == 0) {
|
|
|
|
gchar **args = malloc((num + 1) * sizeof(*args));
|
2012-11-17 19:38:37 -05:00
|
|
|
args[0] = NULL;
|
|
|
|
return args;
|
|
|
|
|
2012-11-17 19:07:00 -05:00
|
|
|
// otherwise return args array
|
|
|
|
} else {
|
2012-11-17 21:40:49 -05:00
|
|
|
gchar **args = malloc((num + 1) * sizeof(*args));
|
2012-11-17 19:07:00 -05:00
|
|
|
GSList *token = tokens;
|
|
|
|
token = g_slist_next(token);
|
|
|
|
int arg_count = 0;
|
|
|
|
|
|
|
|
while (token != NULL) {
|
|
|
|
args[arg_count++] = strdup(token->data);
|
|
|
|
token = g_slist_next(token);
|
|
|
|
}
|
|
|
|
|
|
|
|
args[arg_count] = NULL;
|
|
|
|
g_slist_free_full(tokens, free);
|
|
|
|
free(copy);
|
|
|
|
|
|
|
|
return args;
|
|
|
|
}
|
|
|
|
}
|