2003-10-22 13:34:59 +00:00
|
|
|
/*
|
2005-09-15 15:44:26 +00:00
|
|
|
* Asterisk -- An open source telephony toolkit.
|
2003-10-22 13:34:59 +00:00
|
|
|
*
|
2006-02-12 04:28:58 +00:00
|
|
|
* Copyright (c) 2003-2006 Tilghman Lesher. All rights reserved.
|
2003-10-22 13:34:59 +00:00
|
|
|
*
|
2004-04-12 16:08:20 +00:00
|
|
|
* Tilghman Lesher <app_cut__v003@the-tilghman.com>
|
2003-10-22 13:34:59 +00:00
|
|
|
*
|
|
|
|
* This code is released by the author with no restrictions on usage.
|
|
|
|
*
|
2005-09-15 15:44:26 +00:00
|
|
|
* See http://www.asterisk.org for more information about
|
|
|
|
* the Asterisk project. Please do not directly contact
|
|
|
|
* any of the maintainers of this project for assistance;
|
|
|
|
* the project provides a web site, mailing lists and IRC
|
|
|
|
* channels for your use.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2005-10-24 20:12:06 +00:00
|
|
|
/*! \file
|
2005-12-30 21:18:06 +00:00
|
|
|
*
|
2005-12-15 19:05:41 +00:00
|
|
|
* \brief CUT function
|
2005-09-15 15:44:26 +00:00
|
|
|
*
|
2005-12-30 21:18:06 +00:00
|
|
|
* \author Tilghman Lesher <app_cut__v003@the-tilghman.com>
|
|
|
|
*
|
2005-12-15 19:05:41 +00:00
|
|
|
* \ingroup functions
|
2003-10-22 13:34:59 +00:00
|
|
|
*/
|
|
|
|
|
2006-06-07 18:54:56 +00:00
|
|
|
#include "asterisk.h"
|
|
|
|
|
|
|
|
ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
|
|
|
|
|
2003-10-25 17:44:48 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <string.h>
|
2005-06-06 22:39:32 +00:00
|
|
|
|
2005-04-21 06:02:45 +00:00
|
|
|
#include "asterisk/file.h"
|
|
|
|
#include "asterisk/logger.h"
|
|
|
|
#include "asterisk/options.h"
|
|
|
|
#include "asterisk/channel.h"
|
|
|
|
#include "asterisk/pbx.h"
|
|
|
|
#include "asterisk/module.h"
|
2005-11-01 21:02:07 +00:00
|
|
|
#include "asterisk/app.h"
|
2003-10-22 13:34:59 +00:00
|
|
|
|
|
|
|
/* Maximum length of any variable */
|
|
|
|
#define MAXRESULT 1024
|
|
|
|
|
2005-08-26 20:01:22 +00:00
|
|
|
struct sortable_keys {
|
|
|
|
char *key;
|
|
|
|
float value;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int sort_subroutine(const void *arg1, const void *arg2)
|
2003-10-22 13:34:59 +00:00
|
|
|
{
|
2005-08-26 20:01:22 +00:00
|
|
|
const struct sortable_keys *one=arg1, *two=arg2;
|
2006-04-14 22:55:58 +00:00
|
|
|
if (one->value < two->value)
|
2005-08-26 20:01:22 +00:00
|
|
|
return -1;
|
2006-04-14 22:55:58 +00:00
|
|
|
else if (one->value == two->value)
|
2005-08-26 20:01:22 +00:00
|
|
|
return 0;
|
2006-04-14 22:55:58 +00:00
|
|
|
else
|
2005-08-26 20:01:22 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define ERROR_NOARG (-1)
|
|
|
|
#define ERROR_NOMEM (-2)
|
|
|
|
#define ERROR_USAGE (-3)
|
|
|
|
|
|
|
|
static int sort_internal(struct ast_channel *chan, char *data, char *buffer, size_t buflen)
|
|
|
|
{
|
|
|
|
char *strings, *ptrkey, *ptrvalue;
|
2005-10-18 16:48:19 +00:00
|
|
|
int count=1, count2, element_count=0;
|
2005-08-26 20:01:22 +00:00
|
|
|
struct sortable_keys *sortable_keys;
|
|
|
|
|
|
|
|
memset(buffer, 0, buflen);
|
|
|
|
|
2006-04-14 22:55:58 +00:00
|
|
|
if (!data)
|
2005-08-26 20:01:22 +00:00
|
|
|
return ERROR_NOARG;
|
|
|
|
|
2006-05-10 13:22:15 +00:00
|
|
|
strings = ast_strdupa(data);
|
2005-08-26 20:01:22 +00:00
|
|
|
|
|
|
|
for (ptrkey = strings; *ptrkey; ptrkey++) {
|
2006-04-14 22:55:58 +00:00
|
|
|
if (*ptrkey == '|')
|
2005-08-26 20:01:22 +00:00
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
sortable_keys = alloca(count * sizeof(struct sortable_keys));
|
|
|
|
|
|
|
|
memset(sortable_keys, 0, count * sizeof(struct sortable_keys));
|
|
|
|
|
|
|
|
/* Parse each into a struct */
|
|
|
|
count2 = 0;
|
|
|
|
while ((ptrkey = strsep(&strings, "|"))) {
|
|
|
|
ptrvalue = index(ptrkey, ':');
|
|
|
|
if (!ptrvalue) {
|
|
|
|
count--;
|
|
|
|
continue;
|
|
|
|
}
|
2006-04-14 22:55:58 +00:00
|
|
|
*ptrvalue++ = '\0';
|
2005-08-26 20:01:22 +00:00
|
|
|
sortable_keys[count2].key = ptrkey;
|
|
|
|
sscanf(ptrvalue, "%f", &sortable_keys[count2].value);
|
|
|
|
count2++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Sort the structs */
|
|
|
|
qsort(sortable_keys, count, sizeof(struct sortable_keys), sort_subroutine);
|
|
|
|
|
|
|
|
for (count2 = 0; count2 < count; count2++) {
|
2005-10-18 16:48:19 +00:00
|
|
|
int blen = strlen(buffer);
|
|
|
|
if (element_count++) {
|
|
|
|
strncat(buffer + blen, ",", buflen - blen - 1);
|
2005-12-16 00:55:39 +00:00
|
|
|
blen++;
|
2005-10-18 16:48:19 +00:00
|
|
|
}
|
2005-12-16 00:55:39 +00:00
|
|
|
strncat(buffer + blen, sortable_keys[count2].key, buflen - blen - 1);
|
2005-08-26 20:01:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cut_internal(struct ast_channel *chan, char *data, char *buffer, size_t buflen)
|
|
|
|
{
|
2006-01-11 19:52:29 +00:00
|
|
|
char *parse;
|
|
|
|
AST_DECLARE_APP_ARGS(args,
|
|
|
|
AST_APP_ARG(varname);
|
|
|
|
AST_APP_ARG(delimiter);
|
|
|
|
AST_APP_ARG(field);
|
|
|
|
);
|
|
|
|
|
|
|
|
memset(buffer, 0, buflen);
|
|
|
|
|
2006-05-10 13:22:15 +00:00
|
|
|
parse = ast_strdupa(data);
|
2003-10-22 13:34:59 +00:00
|
|
|
|
2006-01-11 19:52:29 +00:00
|
|
|
AST_STANDARD_APP_ARGS(args, parse);
|
2003-10-22 13:34:59 +00:00
|
|
|
|
|
|
|
/* Check and parse arguments */
|
2007-01-07 14:44:49 +00:00
|
|
|
if (args.argc < 3) {
|
2006-01-11 19:52:29 +00:00
|
|
|
return ERROR_NOARG;
|
|
|
|
} else {
|
2003-10-22 13:34:59 +00:00
|
|
|
char d, ds[2];
|
2006-01-11 19:52:29 +00:00
|
|
|
char *tmp = alloca(strlen(args.varname) + 4);
|
2004-04-12 16:08:20 +00:00
|
|
|
char varvalue[MAXRESULT], *tmp2=varvalue;
|
2003-10-22 13:34:59 +00:00
|
|
|
|
2004-04-12 16:08:20 +00:00
|
|
|
if (tmp) {
|
2006-01-11 19:52:29 +00:00
|
|
|
snprintf(tmp, strlen(args.varname) + 4, "${%s}", args.varname);
|
2004-04-12 16:08:20 +00:00
|
|
|
memset(varvalue, 0, sizeof(varvalue));
|
2003-10-22 13:34:59 +00:00
|
|
|
} else {
|
2005-08-26 20:01:22 +00:00
|
|
|
return ERROR_NOMEM;
|
2003-10-22 13:34:59 +00:00
|
|
|
}
|
|
|
|
|
2007-01-07 14:44:49 +00:00
|
|
|
if (args.delimiter[0] == '\\') {
|
|
|
|
if (args.delimiter[1] == 'n')
|
|
|
|
d = '\n';
|
|
|
|
else if (args.delimiter[1] == 't')
|
|
|
|
d = '\t';
|
|
|
|
else if (args.delimiter[1])
|
|
|
|
d = args.delimiter[1];
|
|
|
|
else
|
|
|
|
d = '-';
|
|
|
|
} else if (args.delimiter[0])
|
|
|
|
d = args.delimiter[0];
|
|
|
|
else
|
|
|
|
d = '-';
|
2003-10-22 13:34:59 +00:00
|
|
|
|
|
|
|
/* String form of the delimiter, for use with strsep(3) */
|
2004-07-14 07:22:30 +00:00
|
|
|
snprintf(ds, sizeof(ds), "%c", d);
|
2003-10-22 13:34:59 +00:00
|
|
|
|
|
|
|
pbx_substitute_variables_helper(chan, tmp, tmp2, MAXRESULT - 1);
|
|
|
|
|
|
|
|
if (tmp2) {
|
|
|
|
int curfieldnum = 1;
|
2006-04-14 22:55:58 +00:00
|
|
|
while (tmp2 != NULL && args.field != NULL) {
|
2006-01-11 19:52:29 +00:00
|
|
|
char *nextgroup = strsep(&(args.field), "&");
|
2003-10-22 13:34:59 +00:00
|
|
|
int num1 = 0, num2 = MAXRESULT;
|
|
|
|
char trashchar;
|
|
|
|
|
|
|
|
if (sscanf(nextgroup, "%d-%d", &num1, &num2) == 2) {
|
|
|
|
/* range with both start and end */
|
|
|
|
} else if (sscanf(nextgroup, "-%d", &num2) == 1) {
|
|
|
|
/* range with end */
|
|
|
|
num1 = 0;
|
|
|
|
} else if ((sscanf(nextgroup, "%d%c", &num1, &trashchar) == 2) && (trashchar == '-')) {
|
|
|
|
/* range with start */
|
|
|
|
num2 = MAXRESULT;
|
|
|
|
} else if (sscanf(nextgroup, "%d", &num1) == 1) {
|
|
|
|
/* single number */
|
|
|
|
num2 = num1;
|
|
|
|
} else {
|
2005-08-26 20:01:22 +00:00
|
|
|
return ERROR_USAGE;
|
2003-10-22 13:34:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Get to start, if any */
|
|
|
|
if (num1 > 0) {
|
2006-04-14 22:55:58 +00:00
|
|
|
while (tmp2 != (char *)NULL + 1 && curfieldnum < num1) {
|
2003-10-22 13:34:59 +00:00
|
|
|
tmp2 = index(tmp2, d) + 1;
|
|
|
|
curfieldnum++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Most frequent problem is the expectation of reordering fields */
|
2006-04-14 22:55:58 +00:00
|
|
|
if ((num1 > 0) && (curfieldnum > num1))
|
2005-08-26 20:01:22 +00:00
|
|
|
ast_log(LOG_WARNING, "We're already past the field you wanted?\n");
|
2003-10-22 13:34:59 +00:00
|
|
|
|
|
|
|
/* Re-null tmp2 if we added 1 to NULL */
|
2003-10-25 17:44:48 +00:00
|
|
|
if (tmp2 == (char *)NULL + 1)
|
2003-10-22 13:34:59 +00:00
|
|
|
tmp2 = NULL;
|
|
|
|
|
|
|
|
/* Output fields until we either run out of fields or num2 is reached */
|
2006-04-14 22:55:58 +00:00
|
|
|
while (tmp2 != NULL && curfieldnum <= num2) {
|
2003-10-22 13:34:59 +00:00
|
|
|
char *tmp3 = strsep(&tmp2, ds);
|
2005-08-26 20:01:22 +00:00
|
|
|
int curlen = strlen(buffer);
|
2003-10-22 13:34:59 +00:00
|
|
|
|
2006-04-14 22:55:58 +00:00
|
|
|
if (curlen)
|
2005-08-26 20:01:22 +00:00
|
|
|
snprintf(buffer + curlen, buflen - curlen, "%c%s", d, tmp3);
|
2006-04-14 22:55:58 +00:00
|
|
|
else
|
2005-08-26 20:01:22 +00:00
|
|
|
snprintf(buffer, buflen, "%s", tmp3);
|
2003-10-22 13:34:59 +00:00
|
|
|
|
|
|
|
curfieldnum++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-08-26 20:01:22 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2003-10-22 13:34:59 +00:00
|
|
|
|
2007-01-06 00:13:33 +00:00
|
|
|
static int acf_sort_exec(struct ast_channel *chan, const char *cmd, char *data, char *buf, size_t len)
|
2005-08-26 20:01:22 +00:00
|
|
|
{
|
2006-08-21 02:11:39 +00:00
|
|
|
struct ast_module_user *u;
|
2006-02-12 04:28:58 +00:00
|
|
|
int ret = -1;
|
2005-08-26 20:01:22 +00:00
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
u = ast_module_user_add(chan);
|
2005-08-26 20:01:22 +00:00
|
|
|
|
|
|
|
switch (sort_internal(chan, data, buf, len)) {
|
|
|
|
case ERROR_NOARG:
|
|
|
|
ast_log(LOG_ERROR, "SORT() requires an argument\n");
|
|
|
|
break;
|
|
|
|
case ERROR_NOMEM:
|
|
|
|
ast_log(LOG_ERROR, "Out of memory\n");
|
|
|
|
break;
|
|
|
|
case 0:
|
2006-02-12 04:28:58 +00:00
|
|
|
ret = 0;
|
2005-08-26 20:01:22 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ast_log(LOG_ERROR, "Unknown internal error\n");
|
|
|
|
}
|
2006-08-21 02:11:39 +00:00
|
|
|
|
|
|
|
ast_module_user_remove(u);
|
2006-02-12 04:28:58 +00:00
|
|
|
|
|
|
|
return ret;
|
2005-08-26 20:01:22 +00:00
|
|
|
}
|
|
|
|
|
2007-01-06 00:13:33 +00:00
|
|
|
static int acf_cut_exec(struct ast_channel *chan, const char *cmd, char *data, char *buf, size_t len)
|
2005-08-26 20:01:22 +00:00
|
|
|
{
|
2006-02-12 04:28:58 +00:00
|
|
|
int ret = -1;
|
2006-08-21 02:11:39 +00:00
|
|
|
struct ast_module_user *u;
|
2005-08-26 20:01:22 +00:00
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
u = ast_module_user_add(chan);
|
2005-08-26 20:01:22 +00:00
|
|
|
|
|
|
|
switch (cut_internal(chan, data, buf, len)) {
|
|
|
|
case ERROR_NOARG:
|
2006-01-11 19:52:29 +00:00
|
|
|
ast_log(LOG_ERROR, "Syntax: CUT(<varname>,<char-delim>,<range-spec>) - missing argument!\n");
|
2005-08-26 20:01:22 +00:00
|
|
|
break;
|
|
|
|
case ERROR_NOMEM:
|
|
|
|
ast_log(LOG_ERROR, "Out of memory\n");
|
|
|
|
break;
|
|
|
|
case ERROR_USAGE:
|
2005-12-15 19:05:41 +00:00
|
|
|
ast_log(LOG_ERROR, "Usage: CUT(<varname>,<char-delim>,<range-spec>)\n");
|
2005-08-26 20:01:22 +00:00
|
|
|
break;
|
|
|
|
case 0:
|
2006-02-12 04:28:58 +00:00
|
|
|
ret = 0;
|
2005-08-26 20:01:22 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ast_log(LOG_ERROR, "Unknown internal error\n");
|
|
|
|
}
|
2006-08-21 02:11:39 +00:00
|
|
|
|
|
|
|
ast_module_user_remove(u);
|
2006-02-12 04:28:58 +00:00
|
|
|
|
|
|
|
return ret;
|
2005-08-26 20:01:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
struct ast_custom_function acf_sort = {
|
|
|
|
.name = "SORT",
|
|
|
|
.synopsis = "Sorts a list of key/vals into a list of keys, based upon the vals",
|
|
|
|
.syntax = "SORT(key1:val1[...][,keyN:valN])",
|
|
|
|
.desc =
|
|
|
|
"Takes a comma-separated list of keys and values, each separated by a colon, and returns a\n"
|
|
|
|
"comma-separated list of the keys, sorted by their values. Values will be evaluated as\n"
|
|
|
|
"floating-point numbers.\n",
|
|
|
|
.read = acf_sort_exec,
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ast_custom_function acf_cut = {
|
|
|
|
.name = "CUT",
|
|
|
|
.synopsis = "Slices and dices strings, based upon a named delimiter.",
|
|
|
|
.syntax = "CUT(<varname>,<char-delim>,<range-spec>)",
|
|
|
|
.desc =
|
|
|
|
" varname - variable you want cut\n"
|
|
|
|
" char-delim - defaults to '-'\n"
|
|
|
|
" range-spec - number of the field you want (1-based offset)\n"
|
|
|
|
" may also be specified as a range (with -)\n"
|
|
|
|
" or group of ranges and fields (with &)\n",
|
|
|
|
.read = acf_cut_exec,
|
|
|
|
};
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
static int unload_module(void)
|
2003-10-22 13:34:59 +00:00
|
|
|
{
|
2006-02-11 03:14:05 +00:00
|
|
|
int res = 0;
|
2005-10-18 22:52:21 +00:00
|
|
|
|
2006-02-11 03:14:05 +00:00
|
|
|
res |= ast_custom_function_unregister(&acf_cut);
|
2005-10-18 22:52:21 +00:00
|
|
|
res |= ast_custom_function_unregister(&acf_sort);
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
ast_module_user_hangup_all();
|
2005-10-18 22:52:21 +00:00
|
|
|
|
|
|
|
return res;
|
2003-10-22 13:34:59 +00:00
|
|
|
}
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
static int load_module(void)
|
2003-10-22 13:34:59 +00:00
|
|
|
{
|
2006-02-11 03:14:05 +00:00
|
|
|
int res = 0;
|
2005-10-18 22:52:21 +00:00
|
|
|
|
2006-02-11 03:14:05 +00:00
|
|
|
res |= ast_custom_function_register(&acf_cut);
|
2005-10-18 22:52:21 +00:00
|
|
|
res |= ast_custom_function_register(&acf_sort);
|
|
|
|
|
|
|
|
return res;
|
2003-10-22 13:34:59 +00:00
|
|
|
}
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
AST_MODULE_INFO_STANDARD(ASTERISK_GPL_KEY, "Cut out information from a string");
|