[asterisk/asterisk.git] / main / pbx.c

/*
 * Asterisk -- An open source telephony toolkit.
 *
 * Copyright (C) 1999 - 2006, Digium, Inc.
 *
 * Mark Spencer <markster@digium.com>
 *
 * 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.
 *
 * This program is free software, distributed under the terms of
 * the GNU General Public License Version 2. See the LICENSE file
 * at the top of the source tree.
 */

/*! \file
 *
 * \brief Core PBX routines.
 *
 * \author Mark Spencer <markster@digium.com>
 */

#include "asterisk.h"

ASTERISK_FILE_VERSION(__FILE__, "$Revision$")

#include <ctype.h>
#include <errno.h>
#include <time.h>
#include <sys/time.h>
#include <limits.h>
#if defined(HAVE_SYSINFO)
#include <sys/sysinfo.h>
#endif
#if defined(SOLARIS)
#include <sys/loadavg.h>
#endif

#include "asterisk/lock.h"
#include "asterisk/cli.h"
#include "asterisk/pbx.h"
#include "asterisk/channel.h"
#include "asterisk/options.h"
#include "asterisk/logger.h"
#include "asterisk/file.h"
#include "asterisk/callerid.h"
#include "asterisk/cdr.h"
#include "asterisk/config.h"
#include "asterisk/term.h"
#include "asterisk/manager.h"
#include "asterisk/ast_expr.h"
#include "asterisk/linkedlists.h"
#define SAY_STUBS       /* generate declarations and stubs for say methods */
#include "asterisk/say.h"
#include "asterisk/utils.h"
#include "asterisk/causes.h"
#include "asterisk/musiconhold.h"
#include "asterisk/app.h"
#include "asterisk/devicestate.h"
#include "asterisk/stringfields.h"
#include "asterisk/event.h"
#include "asterisk/hashtab.h"
#include "asterisk/module.h"
#include "asterisk/indications.h"

/*!
 * \note I M P O R T A N T :
 *
 *              The speed of extension handling will likely be among the most important
 * aspects of this PBX.  The switching scheme as it exists right now isn't
 * terribly bad (it's O(N+M), where N is the # of extensions and M is the avg #
 * of priorities, but a constant search time here would be great ;-)
 *
 * A new algorithm to do searching based on a 'compiled' pattern tree is introduced
 * here, and shows a fairly flat (constant) search time, even for over
 * 1000 patterns. Might Still needs some work-- there are some fine points of the matching
 * spec about tie-breaking based on the characters in character sets, but this
 * should be do-able via the weight system currently being used.
 *
 * Also, using a hash table for context/priority name lookup can help prevent
 * the find_extension routines from absorbing exponential cpu cycles. I've tested
 * find_extension with red-black trees, which have O(log2(n)) speed. Right now,
 * I'm using hash tables, which do searches (ideally) in O(1) time.
 *
 */

#ifdef LOW_MEMORY
#define EXT_DATA_SIZE 256
#else
#define EXT_DATA_SIZE 8192
#endif

#define SWITCH_DATA_LENGTH 256

#define VAR_BUF_SIZE 4096

#define VAR_NORMAL              1
#define VAR_SOFTTRAN    2
#define VAR_HARDTRAN    3

#define BACKGROUND_SKIP         (1 << 0)
#define BACKGROUND_NOANSWER     (1 << 1)
#define BACKGROUND_MATCHEXTEN   (1 << 2)
#define BACKGROUND_PLAYBACK     (1 << 3)

AST_APP_OPTIONS(background_opts, {
        AST_APP_OPTION('s', BACKGROUND_SKIP),
        AST_APP_OPTION('n', BACKGROUND_NOANSWER),
        AST_APP_OPTION('m', BACKGROUND_MATCHEXTEN),
        AST_APP_OPTION('p', BACKGROUND_PLAYBACK),
});

#define WAITEXTEN_MOH           (1 << 0)
#define WAITEXTEN_DIALTONE      (1 << 1)

AST_APP_OPTIONS(waitexten_opts, {
        AST_APP_OPTION_ARG('m', WAITEXTEN_MOH, 0),
        AST_APP_OPTION_ARG('d', WAITEXTEN_DIALTONE, 0),
});

struct ast_context;
struct ast_app;

/*!
   \brief ast_exten: An extension
        The dialplan is saved as a linked list with each context
        having it's own linked list of extensions - one item per
        priority.
*/
struct ast_exten {
        char *exten;                    /*!< Extension name */
        int matchcid;                   /*!< Match caller id ? */
        const char *cidmatch;           /*!< Caller id to match for this extension */
        int priority;                   /*!< Priority */
        const char *label;              /*!< Label */
        struct ast_context *parent;     /*!< The context this extension belongs to  */
        const char *app;                /*!< Application to execute */
        struct ast_app *cached_app;     /*!< Cached location of application */
        void *data;                     /*!< Data to use (arguments) */
        void (*datad)(void *);          /*!< Data destructor */
        struct ast_exten *peer;         /*!< Next higher priority with our extension */
        struct ast_hashtab *peer_tree;    /*!< Priorities list in tree form -- only on the head of the peer list */
        struct ast_hashtab *peer_label_tree; /*!< labeled priorities in the peer list -- only on the head of the peer list */
        const char *registrar;          /*!< Registrar */
        struct ast_exten *next;         /*!< Extension with a greater ID */
        char stuff[0];
};

/*! \brief ast_include: include= support in extensions.conf */
struct ast_include {
        const char *name;
        const char *rname;                      /*!< Context to include */
        const char *registrar;                  /*!< Registrar */
        int hastime;                            /*!< If time construct exists */
        struct ast_timing timing;               /*!< time construct */
        struct ast_include *next;               /*!< Link them together */
        char stuff[0];
};

/*! \brief ast_sw: Switch statement in extensions.conf */
struct ast_sw {
        char *name;
        const char *registrar;                  /*!< Registrar */
        char *data;                             /*!< Data load */
        int eval;
        AST_LIST_ENTRY(ast_sw) list;
        char *tmpdata;
        char stuff[0];
};

/*! \brief ast_ignorepat: Ignore patterns in dial plan */
struct ast_ignorepat {
        const char *registrar;
        struct ast_ignorepat *next;
        const char pattern[0];
};

/*! \brief match_char: forms a syntax tree for quick matching of extension patterns */
struct match_char
{
        int is_pattern; /* the pattern started with '_' */
        int deleted;    /* if this is set, then... don't return it */
        char *x;       /* the pattern itself-- matches a single char */
        int specificity; /* simply the strlen of x, or 10 for X, 9 for Z, and 8 for N; and '.' and '!' will add 11 ? */
        struct match_char *alt_char;
        struct match_char *next_char;
        struct ast_exten *exten; /* attached to last char of a pattern for exten */
};

struct scoreboard  /* make sure all fields are 0 before calling new_find_extension */
{
        int total_specificity;
        int total_length;
        char last_char;   /* set to ! or . if they are the end of the pattern */
        int canmatch;     /* if the string to match was just too short */
        struct ast_exten *canmatch_exten;
        struct ast_exten *exten;
};

/*! \brief ast_context: An extension context */
struct ast_context {
        ast_rwlock_t lock;                      /*!< A lock to prevent multiple threads from clobbering the context */
        struct ast_exten *root;                 /*!< The root of the list of extensions */
        struct ast_hashtab *root_tree;            /*!< For exact matches on the extensions in the pattern tree, and for traversals of the pattern_tree  */
        struct match_char *pattern_tree;        /*!< A tree to speed up extension pattern matching */
        struct ast_context *next;               /*!< Link them together */
        struct ast_include *includes;           /*!< Include other contexts */
        struct ast_ignorepat *ignorepats;       /*!< Patterns for which to continue playing dialtone */
        const char *registrar;                  /*!< Registrar */
        AST_LIST_HEAD_NOLOCK(, ast_sw) alts;    /*!< Alternative switches */
        ast_mutex_t macrolock;                  /*!< A lock to implement "exclusive" macros - held whilst a call is executing in the macro */
        char name[0];                           /*!< Name of the context */
};


/*! \brief ast_app: A registered application */
struct ast_app {
        int (*execute)(struct ast_channel *chan, void *data);
        const char *synopsis;                   /*!< Synopsis text for 'show applications' */
        const char *description;                /*!< Description (help text) for 'show application &lt;name&gt;' */
        AST_RWLIST_ENTRY(ast_app) list;         /*!< Next app in list */
        struct ast_module *module;              /*!< Module this app belongs to */
        char name[0];                           /*!< Name of the application */
};

/*! \brief ast_state_cb: An extension state notify register item */
struct ast_state_cb {
        int id;
        void *data;
        ast_state_cb_type callback;
        struct ast_state_cb *next;
};

/*! \brief Structure for dial plan hints

  \note Hints are pointers from an extension in the dialplan to one or
  more devices (tech/name) 
        - See \ref AstExtState
*/
struct ast_hint {
        struct ast_exten *exten;        /*!< Extension */
        int laststate;                  /*!< Last known state */
        struct ast_state_cb *callbacks; /*!< Callback list for this extension */
        AST_RWLIST_ENTRY(ast_hint) list;/*!< Pointer to next hint in list */
};

static const struct cfextension_states {
        int extension_state;
        const char * const text;
} extension_states[] = {
        { AST_EXTENSION_NOT_INUSE,                     "Idle" },
        { AST_EXTENSION_INUSE,                         "InUse" },
        { AST_EXTENSION_BUSY,                          "Busy" },
        { AST_EXTENSION_UNAVAILABLE,                   "Unavailable" },
        { AST_EXTENSION_RINGING,                       "Ringing" },
        { AST_EXTENSION_INUSE | AST_EXTENSION_RINGING, "InUse&Ringing" },
        { AST_EXTENSION_ONHOLD,                        "Hold" },
        { AST_EXTENSION_INUSE | AST_EXTENSION_ONHOLD,  "InUse&Hold" }
};

struct statechange {
        AST_LIST_ENTRY(statechange) entry;
        char dev[0];
};

/*!
 * \brief Data used by the device state thread
 */
static struct {
        /*! Set to 1 to stop the thread */
        unsigned int stop:1;
        /*! The device state monitoring thread */
        pthread_t thread;
        /*! Lock for the state change queue */
        ast_mutex_t lock;
        /*! Condition for the state change queue */
        ast_cond_t cond;
        /*! Queue of state changes */
        AST_LIST_HEAD_NOLOCK(, statechange) state_change_q;
} device_state = {
        .thread = AST_PTHREADT_NULL,
};

struct pbx_exception {
        AST_DECLARE_STRING_FIELDS(
                AST_STRING_FIELD(context);      /*!< Context associated with this exception */
                AST_STRING_FIELD(exten);        /*!< Exten associated with this exception */
                AST_STRING_FIELD(reason);               /*!< The exception reason */
        );

        int priority;                           /*!< Priority associated with this exception */
};

static int pbx_builtin_answer(struct ast_channel *, void *);
static int pbx_builtin_goto(struct ast_channel *, void *);
static int pbx_builtin_hangup(struct ast_channel *, void *);
static int pbx_builtin_background(struct ast_channel *, void *);
static int pbx_builtin_wait(struct ast_channel *, void *);
static int pbx_builtin_waitexten(struct ast_channel *, void *);
static int pbx_builtin_keepalive(struct ast_channel *, void *);
static int pbx_builtin_resetcdr(struct ast_channel *, void *);
static int pbx_builtin_setamaflags(struct ast_channel *, void *);
static int pbx_builtin_ringing(struct ast_channel *, void *);
static int pbx_builtin_progress(struct ast_channel *, void *);
static int pbx_builtin_congestion(struct ast_channel *, void *);
static int pbx_builtin_busy(struct ast_channel *, void *);
static int pbx_builtin_noop(struct ast_channel *, void *);
static int pbx_builtin_gotoif(struct ast_channel *, void *);
static int pbx_builtin_gotoiftime(struct ast_channel *, void *);
static int pbx_builtin_execiftime(struct ast_channel *, void *);
static int pbx_builtin_saynumber(struct ast_channel *, void *);
static int pbx_builtin_saydigits(struct ast_channel *, void *);
static int pbx_builtin_saycharacters(struct ast_channel *, void *);
static int pbx_builtin_sayphonetic(struct ast_channel *, void *);
int pbx_builtin_setvar(struct ast_channel *, void *);
static int pbx_builtin_setvar_multiple(struct ast_channel *, void *);
static int pbx_builtin_importvar(struct ast_channel *, void *);
static void set_ext_pri(struct ast_channel *c, const char *exten, int pri);
void new_find_extension(const char *str, struct scoreboard *score, struct match_char *tree, int length, int spec, const char *callerid);
struct match_char *already_in_tree(struct match_char *current, char *pat);
struct match_char *add_exten_to_pattern_tree(struct ast_context *con, struct ast_exten *e1);
struct match_char *add_pattern_node(struct ast_context *con, struct match_char *current, char *pattern, int is_pattern, int already, int specificity);
void create_match_char_tree(struct ast_context *con);
struct ast_exten *get_canmatch_exten(struct match_char *node);
void destroy_pattern_tree(struct match_char *pattern_tree);
static int hashtab_compare_contexts(const void *ah_a, const void *ah_b);
static int hashtab_compare_extens(const void *ha_a, const void *ah_b);
static int hashtab_compare_exten_numbers(const void *ah_a, const void *ah_b);
static int hashtab_compare_exten_labels(const void *ah_a, const void *ah_b);
static unsigned int hashtab_hash_contexts(const void *obj);
static unsigned int hashtab_hash_extens(const void *obj);
static unsigned int hashtab_hash_priority(const void *obj);
static unsigned int hashtab_hash_labels(const void *obj);

/* labels, contexts are case sensitive  priority numbers are ints */
static int hashtab_compare_contexts(const void *ah_a, const void *ah_b)
{
        const struct ast_context *ac = ah_a;
        const struct ast_context *bc = ah_b;
        /* assume context names are registered in a string table! */
        return strcmp(ac->name, bc->name);
}

static int hashtab_compare_extens(const void *ah_a, const void *ah_b)
{
        const struct ast_exten *ac = ah_a;
        const struct ast_exten *bc = ah_b;
        int x = strcmp(ac->exten, bc->exten);
        if (x) /* if exten names are diff, then return */
                return x;
        /* but if they are the same, do the cidmatch values match? */
        if (ac->matchcid && bc->matchcid) {
                return strcmp(ac->cidmatch,bc->cidmatch);
        } else if (!ac->matchcid && !bc->matchcid) {
                return 0; /* if there's no matchcid on either side, then this is a match */
        } else {
                return 1; /* if there's matchcid on one but not the other, they are different */
        }
}

static int hashtab_compare_exten_numbers(const void *ah_a, const void *ah_b)
{
        const struct ast_exten *ac = ah_a;
        const struct ast_exten *bc = ah_b;
        return ac->priority != bc->priority;
}

static int hashtab_compare_exten_labels(const void *ah_a, const void *ah_b)
{
        const struct ast_exten *ac = ah_a;
        const struct ast_exten *bc = ah_b;
        return strcmp(ac->label, bc->label);
}

static unsigned int hashtab_hash_contexts(const void *obj)
{
        const struct ast_context *ac = obj;
        return ast_hashtab_hash_string(ac->name);
}

static unsigned int hashtab_hash_extens(const void *obj)
{
        const struct ast_exten *ac = obj;
        unsigned int x = ast_hashtab_hash_string(ac->exten);
        unsigned int y = 0;
        if (ac->matchcid)
                y = ast_hashtab_hash_string(ac->cidmatch);
        return x+y;
}

static unsigned int hashtab_hash_priority(const void *obj)
{
        const struct ast_exten *ac = obj;
        return ast_hashtab_hash_int(ac->priority);
}

static unsigned int hashtab_hash_labels(const void *obj)
{
        const struct ast_exten *ac = obj;
        return ast_hashtab_hash_string(ac->label);
}


AST_RWLOCK_DEFINE_STATIC(globalslock);
static struct varshead globals = AST_LIST_HEAD_NOLOCK_INIT_VALUE;

static int autofallthrough = 1;

/*! \brief Subscription for device state change events */
static struct ast_event_sub *device_state_sub;

AST_MUTEX_DEFINE_STATIC(maxcalllock);
static int countcalls;

static AST_RWLIST_HEAD_STATIC(acf_root, ast_custom_function);

/*! \brief Declaration of builtin applications */
static struct pbx_builtin {
        char name[AST_MAX_APP];
        int (*execute)(struct ast_channel *chan, void *data);
        char *synopsis;
        char *description;
} builtins[] =
{
        /* These applications are built into the PBX core and do not
           need separate modules */

        { "Answer", pbx_builtin_answer,
        "Answer a channel if ringing",
        "  Answer([delay]): If the call has not been answered, this application will\n"
        "answer it. Otherwise, it has no effect on the call. If a delay is specified,\n"
        "Asterisk will wait this number of milliseconds before returning to\n"
        "the dialplan after answering the call.\n"
        },

        { "BackGround", pbx_builtin_background,
        "Play an audio file while waiting for digits of an extension to go to.",
        "  Background(filename1[&filename2...][,options[,langoverride][,context]]):\n"
        "This application will play the given list of files while waiting for an\n"
        "extension to be dialed by the calling channel. To continue waiting for digits\n"
        "after this application has finished playing files, the WaitExten application\n"
        "should be used. The 'langoverride' option explicitly specifies which language\n"
        "to attempt to use for the requested sound files. If a 'context' is specified,\n"
        "this is the dialplan context that this application will use when exiting to a\n"
        "dialed extension."
        "  If one of the requested sound files does not exist, call processing will be\n"
        "terminated.\n"
        "  Options:\n"
        "    s - Causes the playback of the message to be skipped\n"
        "          if the channel is not in the 'up' state (i.e. it\n"
        "          hasn't been answered yet). If this happens, the\n"
        "          application will return immediately.\n"
        "    n - Don't answer the channel before playing the files.\n"
        "    m - Only break if a digit hit matches a one digit\n"
        "          extension in the destination context.\n"
        "This application sets the following channel variable upon completion:\n"
        " BACKGROUNDSTATUS    The status of the background attempt as a text string, one of\n"
        "               SUCCESS | FAILED\n"
        },

        { "Busy", pbx_builtin_busy,
        "Indicate the Busy condition",
        "  Busy([timeout]): This application will indicate the busy condition to\n"
        "the calling channel. If the optional timeout is specified, the calling channel\n"
        "will be hung up after the specified number of seconds. Otherwise, this\n"
        "application will wait until the calling channel hangs up.\n"
        },

        { "Congestion", pbx_builtin_congestion,
        "Indicate the Congestion condition",
        "  Congestion([timeout]): This application will indicate the congestion\n"
        "condition to the calling channel. If the optional timeout is specified, the\n"
        "calling channel will be hung up after the specified number of seconds.\n"
        "Otherwise, this application will wait until the calling channel hangs up.\n"
        },

        { "ExecIfTime", pbx_builtin_execiftime,
        "Conditional application execution based on the current time",
        "  ExecIfTime(<times>,<weekdays>,<mdays>,<months>?appname[(appargs)]):\n"
        "This application will execute the specified dialplan application, with optional\n"
        "arguments, if the current time matches the given time specification.\n"
        },

        { "Goto", pbx_builtin_goto,
        "Jump to a particular priority, extension, or context",
        "  Goto([[context,]extension,]priority): This application will set the current\n"
        "context, extension, and priority in the channel structure. After it completes, the\n"
        "pbx engine will continue dialplan execution at the specified location.\n"
        "If no specific extension, or extension and context, are specified, then this\n"
        "application will just set the specified priority of the current extension.\n"
        "  At least a priority is required as an argument, or the goto will return a -1,\n"
        "and the channel and call will be terminated.\n"
        "  If the location that is put into the channel information is bogus, and asterisk cannot\n"
        "find that location in the dialplan,\n"
        "then the execution engine will try to find and execute the code in the 'i' (invalid)\n"
        "extension in the current context. If that does not exist, it will try to execute the\n"
        "'h' extension. If either or neither the 'h' or 'i' extensions have been defined, the\n"
        "channel is hung up, and the execution of instructions on the channel is terminated.\n"
        "What this means is that, for example, you specify a context that does not exist, then\n"
        "it will not be possible to find the 'h' or 'i' extensions, and the call will terminate!\n"
        },

        { "GotoIf", pbx_builtin_gotoif,
        "Conditional goto",
        "  GotoIf(condition?[labeliftrue]:[labeliffalse]): This application will set the current\n"
        "context, extension, and priority in the channel structure based on the evaluation of\n"
        "the given condition. After this application completes, the\n"
        "pbx engine will continue dialplan execution at the specified location in the dialplan.\n"
        "The channel will continue at\n"
        "'labeliftrue' if the condition is true, or 'labeliffalse' if the condition is\n"
        "false. The labels are specified with the same syntax as used within the Goto\n"
        "application.  If the label chosen by the condition is omitted, no jump is\n"
        "performed, and the execution passes to the next instruction.\n"
        "If the target location is bogus, and does not exist, the execution engine will try \n"
        "to find and execute the code in the 'i' (invalid)\n"
        "extension in the current context. If that does not exist, it will try to execute the\n"
        "'h' extension. If either or neither the 'h' or 'i' extensions have been defined, the\n"
        "channel is hung up, and the execution of instructions on the channel is terminated.\n"
        "Remember that this command can set the current context, and if the context specified\n"
        "does not exist, then it will not be able to find any 'h' or 'i' extensions there, and\n"
        "the channel and call will both be terminated!\n"
        },

        { "GotoIfTime", pbx_builtin_gotoiftime,
        "Conditional Goto based on the current time",
        "  GotoIfTime(<times>,<weekdays>,<mdays>,<months>?[[context,]exten,]priority):\n"
        "This application will set the context, extension, and priority in the channel structure\n"
        "if the current time matches the given time specification. Otherwise, nothing is done.\n"
        "Further information on the time specification can be found in examples\n"
        "illustrating how to do time-based context includes in the dialplan.\n" 
        "If the target jump location is bogus, the same actions would be taken as for Goto.\n"
        },

        { "ImportVar", pbx_builtin_importvar,
        "Import a variable from a channel into a new variable",
        "  ImportVar(newvar=channelname,variable): This application imports a variable\n"
        "from the specified channel (as opposed to the current one) and stores it as\n"
        "a variable in the current channel (the channel that is calling this\n"
        "application). Variables created by this application have the same inheritance\n"
        "properties as those created with the Set application. See the documentation for\n"
        "Set for more information.\n"
        },

        { "Hangup", pbx_builtin_hangup,
        "Hang up the calling channel",
        "  Hangup([causecode]): This application will hang up the calling channel.\n"
        "If a causecode is given the channel's hangup cause will be set to the given\n"
        "value.\n"
        },

        { "NoOp", pbx_builtin_noop,
        "Do Nothing (No Operation)",
        "  NoOp(): This application does nothing. However, it is useful for debugging\n"
        "purposes. Any text that is provided as arguments to this application can be\n"
        "viewed at the Asterisk CLI. This method can be used to see the evaluations of\n"
        "variables or functions without having any effect. Alternatively, see the\n"
  "Verbose() application for finer grain control of output at custom verbose levels.\n"
        },

        { "Progress", pbx_builtin_progress,
        "Indicate progress",
        "  Progress(): This application will request that in-band progress information\n"
        "be provided to the calling channel.\n"
        },

        { "RaiseException", pbx_builtin_raise_exception,
        "Handle an exceptional condition",
        "  RaiseException(<reason>): This application will jump to the \"e\" extension\n"
        "in the current context, setting the dialplan function EXCEPTION(). If the \"e\"\n"
        "extension does not exist, the call will hangup.\n"
        },

        { "ResetCDR", pbx_builtin_resetcdr,
        "Resets the Call Data Record",
        "  ResetCDR([options]):  This application causes the Call Data Record to be\n"
        "reset.\n"
        "  Options:\n"
        "    w -- Store the current CDR record before resetting it.\n"
        "    a -- Store any stacked records.\n"
        "    v -- Save CDR variables.\n"
        },

        { "Ringing", pbx_builtin_ringing,
        "Indicate ringing tone",
        "  Ringing(): This application will request that the channel indicate a ringing\n"
        "tone to the user.\n"
        },

        { "SayAlpha", pbx_builtin_saycharacters,
        "Say Alpha",
        "  SayAlpha(string): This application will play the sounds that correspond to\n"
        "the letters of the given string.\n"
        },

        { "SayDigits", pbx_builtin_saydigits,
        "Say Digits",
        "  SayDigits(digits): This application will play the sounds that correspond\n"
        "to the digits of the given number. This will use the language that is currently\n"
        "set for the channel. See the LANGUAGE function for more information on setting\n"
        "the language for the channel.\n"
        },

        { "SayNumber", pbx_builtin_saynumber,
        "Say Number",
        "  SayNumber(digits[,gender]): This application will play the sounds that\n"
        "correspond to the given number. Optionally, a gender may be specified.\n"
        "This will use the language that is currently set for the channel. See the\n"
        "LANGUAGE function for more information on setting the language for the channel.\n"
        },

        { "SayPhonetic", pbx_builtin_sayphonetic,
        "Say Phonetic",
        "  SayPhonetic(string): This application will play the sounds from the phonetic\n"
        "alphabet that correspond to the letters in the given string.\n"
        },

        { "Set", pbx_builtin_setvar,
        "Set channel variable or function value",
        "  Set(name=value)\n"
        "This function can be used to set the value of channel variables or dialplan\n"
        "functions. When setting variables, if the variable name is prefixed with _,\n"
        "the variable will be inherited into channels created from the current\n"
        "channel. If the variable name is prefixed with __, the variable will be\n"
        "inherited into channels created from the current channel and all children\n"
        "channels.\n"
        },

        { "MSet", pbx_builtin_setvar_multiple,
        "Set channel variable(s) or function value(s)",
        "  MSet(name1=value1,name2=value2,...)\n"
        "This function can be used to set the value of channel variables or dialplan\n"
        "functions. When setting variables, if the variable name is prefixed with _,\n"
        "the variable will be inherited into channels created from the current\n"
        "channel. If the variable name is prefixed with __, the variable will be\n"
        "inherited into channels created from the current channel and all children\n"
        "channels.\n\n"
        "MSet behaves in a similar fashion to the way Set worked in 1.2/1.4 and is thus\n"
        "prone to doing things that you may not expect.  Avoid its use if possible.\n"
        },

        { "SetAMAFlags", pbx_builtin_setamaflags,
        "Set the AMA Flags",
        "  SetAMAFlags([flag]): This application will set the channel's AMA Flags for\n"
        "  billing purposes.\n"
        },

        { "Wait", pbx_builtin_wait,
        "Waits for some time",
        "  Wait(seconds): This application waits for a specified number of seconds.\n"
        "Then, dialplan execution will continue at the next priority.\n"
        "  Note that the seconds can be passed with fractions of a second. For example,\n"
        "'1.5' will ask the application to wait for 1.5 seconds.\n"
        },

        { "WaitExten", pbx_builtin_waitexten,
        "Waits for an extension to be entered",
        "  WaitExten([seconds][,options]): This application waits for the user to enter\n"
        "a new extension for a specified number of seconds.\n"
        "  Note that the seconds can be passed with fractions of a second. For example,\n"
        "'1.5' will ask the application to wait for 1.5 seconds.\n"
        "  Options:\n"
        "    m[(x)] - Provide music on hold to the caller while waiting for an extension.\n"
        "               Optionally, specify the class for music on hold within parenthesis.\n"
        },

        { "KeepAlive", pbx_builtin_keepalive,
        "returns AST_PBX_KEEPALIVE value",
        "  KeepAlive(): This application is chiefly meant for internal use with Gosubs.\n"
        "Please do not run it alone from the dialplan!\n"
        },

};

static struct ast_context *contexts;
static struct ast_hashtab *contexts_tree = NULL;

AST_RWLOCK_DEFINE_STATIC(conlock);              /*!< Lock for the ast_context list */

static AST_RWLIST_HEAD_STATIC(apps, ast_app);

static AST_RWLIST_HEAD_STATIC(switches, ast_switch);

static int stateid = 1;
/* WARNING:
   When holding this list's lock, do _not_ do anything that will cause conlock
   to be taken, unless you _already_ hold it. The ast_merge_contexts_and_delete
   function will take the locks in conlock/hints order, so any other
   paths that require both locks must also take them in that order.
*/
static AST_RWLIST_HEAD_STATIC(hints, ast_hint);
struct ast_state_cb *statecbs;

/*
   \note This function is special. It saves the stack so that no matter
   how many times it is called, it returns to the same place */
int pbx_exec(struct ast_channel *c,             /*!< Channel */
             struct ast_app *app,               /*!< Application */
             void *data)                        /*!< Data for execution */
{
        int res;
        struct ast_module_user *u = NULL;
        const char *saved_c_appl;
        const char *saved_c_data;

        if (c->cdr &&  !ast_check_hangup(c))
                ast_cdr_setapp(c->cdr, app->name, data);

        /* save channel values */
        saved_c_appl= c->appl;
        saved_c_data= c->data;

        c->appl = app->name;
        c->data = data;
        if (app->module)
                u = __ast_module_user_add(app->module, c);
        res = app->execute(c, data);
        if (app->module && u)
                __ast_module_user_remove(app->module, u);
        /* restore channel values */
        c->appl = saved_c_appl;
        c->data = saved_c_data;
        return res;
}


/*! Go no deeper than this through includes (not counting loops) */
#define AST_PBX_MAX_STACK       128

/*! \brief Find application handle in linked list
 */
struct ast_app *pbx_findapp(const char *app)
{
        struct ast_app *tmp;

        AST_RWLIST_RDLOCK(&apps);
        AST_RWLIST_TRAVERSE(&apps, tmp, list) {
                if (!strcasecmp(tmp->name, app))
                        break;
        }
        AST_RWLIST_UNLOCK(&apps);

        return tmp;
}

static struct ast_switch *pbx_findswitch(const char *sw)
{
        struct ast_switch *asw;

        AST_RWLIST_RDLOCK(&switches);
        AST_RWLIST_TRAVERSE(&switches, asw, list) {
                if (!strcasecmp(asw->name, sw))
                        break;
        }
        AST_RWLIST_UNLOCK(&switches);

        return asw;
}

static inline int include_valid(struct ast_include *i)
{
        if (!i->hastime)
                return 1;

        return ast_check_timing(&(i->timing));
}

static void pbx_destroy(struct ast_pbx *p)
{
        ast_free(p);
}

/* form a tree that fully describes all the patterns in a context's extensions 
 * in this tree, a "node" consists of a series of match_char structs linked in a chain
 * via the alt_char pointers. More than one pattern can share the same parts of the 
 * tree as other extensions with the same pattern to that point. The algorithm to
 * find which pattern best matches a string, would follow **all** matching paths. As
 * complete matches are found, a "max" match record would be updated if the match first involves 
 * a longer string, then, on a tie, a smaller total of specificity. This can be accomplished
 * by recursive calls affecting a shared scoreboard.
 * As and example, consider these 4 extensions:
 * (a) NXXNXXXXXX
 * (b) 307754XXXX 
 * (c) fax
 * (d) NXXXXXXXXX
 *
 * In the above, between (a) and (d), (a) is a more specific pattern than (d), and would win over
 * most numbers. For all numbers beginning with 307754, (b) should always win.
 *
 * These pattern should form a tree that looks like this:
 *   { "N" }  --next-->  { "X" }  --next--> { "X" } --next--> { "N" } --next--> { "X" } ... blah ... --> { "X" exten_match: (a) }
 *      |                                                        |
 *      |                                                        |alt
 *      |alt                                                     |
 *      |                                                     { "X" } --next--> { "X" } ... blah ... --> { "X" exten_match: (d) }
 *      |
 *   { "3" }  --next-->  { "0" }  --next--> { "7" } --next--> { "7" } --next--> { "5" } ... blah ... --> { "X" exten_match: (b) }
 *      |
 *      |alt
 *      |
 *   { "f" }  --next-->  { "a" }  --next--> { "x"  exten_match: (c) }
 *
 *   In the above, I could easily turn "N" into "23456789", but I think that a quick "if( *z >= '2' && *z <= '9' )" might take
 *   fewer CPU cycles than a call to index("23456789",*z), where *z is the char to match...
 *
 *   traversal is pretty simple: one routine merely traverses the alt list, and for each match in the pattern,  it calls itself
 *   on the corresponding next pointer, incrementing also the pointer of the string to be matched, and passing the total specificity and length.
 *   We pass a pointer to a scoreboard down through, also.
 *   When an exten_match pointer is set, or a '.' or a '!' is encountered, we update the scoreboard only if the length is greater, or in case
 *   of equal length, if the specificity is lower, and return. Hope the limit on stack depth won't be a problem... this routine should 
 *   be pretty lean as far a stack usage goes. Any non-match terminates the recursion down a branch.
 *
 *   In the above example, with the number "3077549999" as the pattern, the traversor should match extensions a, b and d.  All are
 *   of length 10; but they have total specificities of  96, 46, and 98, respectively. (b) wins with its lower specificity number!
 *
 *   Just how much time this algorithm might save over a plain linear traversal over all possible patterns is unknown. But, it should
 *   be pretty close to optimal for this sort of overall algorithm.
 *
 * */

/* you only really update the scoreboard, if the new score is BETTER than the 
 * one stored there. ignore it otherwise.
 */


static void update_scoreboard(struct scoreboard *board, int length, int spec, struct ast_exten *exten, char last, const char *callerid, int deleted)
{
        /* doing a matchcid() check here would be easy and cheap, but...
           unfortunately, it only works if an extension can have only one 
           cid to match. That's not real life. CID patterns need to exist 
           in the tree for this sort of thing to work properly. */

        /* if this extension is marked as deleted, then skip this -- if it never shows
           on the scoreboard, it will never be found */
        if (deleted)
                return;
        
        if (length > board->total_length) {
                board->total_specificity = spec;
                board->total_length = length;
                board->exten = exten;
                board->last_char = last;
        } else if (length == board->total_length && spec < board->total_specificity) {
                board->total_specificity = spec;
                board->total_length = length;
                board->exten = exten;
                board->last_char = last;
        }
}

#ifdef NEED_DEBUG
static void log_match_char_tree(struct match_char *node, char *prefix)
{
        char my_prefix[1024];
        
        ast_log(LOG_DEBUG,"%s%s:%c:%d:%s\n", prefix, node->x, node->is_pattern ? 'Y':'N', node->specificity, node->exten? "EXTEN":"");
        strcpy(my_prefix,prefix);
        strcat(my_prefix,"+       ");
        if (node->next_char)
                print_match_char_tree(node->next_char, my_prefix);
        if (node->alt_char)
                print_match_char_tree(node->alt_char, prefix);
}
#endif

static void cli_match_char_tree(struct match_char *node, char *prefix, int fd)
{
        char my_prefix[1024];
        if (strlen(node->x) > 1 )
                ast_cli(fd, "%s[%s]:%c:%d:%s%s\n", prefix, node->x, node->is_pattern ? 'Y':'N', node->specificity, node->exten? "EXTEN:":"", node->exten ? node->exten->exten : "");
        else
                ast_cli(fd, "%s%s:%c:%d:%s%s\n", prefix, node->x, node->is_pattern ? 'Y':'N', node->specificity, node->exten? "EXTEN:":"", node->exten ? node->exten->exten : "");
        strcpy(my_prefix,prefix);
        strcat(my_prefix,"+       ");
        if (node->next_char)
                cli_match_char_tree(node->next_char, my_prefix, fd);
        if (node->alt_char)
                cli_match_char_tree(node->alt_char, prefix, fd);
}

struct ast_exten *get_canmatch_exten(struct match_char *node)
{
        /* find the exten at the end of the rope */
        struct match_char *node2 = node;
        for (node2 = node; node2; node2 = node2->next_char)
                if (node2->exten)
                        return node2->exten;
        return 0;
}

void new_find_extension(const char *str, struct scoreboard *score, struct match_char *tree, int length, int spec, const char *callerid)
{
        struct match_char *p; /* note minimal stack storage requirements */
        for (p=tree; p; p=p->alt_char) {
                if (p->x[0] == 'N' && p->x[1] == 0 && *str >= '2' && *str <= '9' ) {
                        if (p->exten) /* if a shorter pattern matches along the way, might as well report it */
                                update_scoreboard(score, length+1, spec+p->specificity, p->exten,0,callerid, p->deleted);

                        if (p->next_char && ( *(str+1) || (p->next_char->x[0] == '/' && p->next_char->x[1] == 0))) {
                                if (*(str+1))
                                        new_find_extension(str+1, score, p->next_char, length+1, spec+p->specificity, callerid);
                                else
                                        new_find_extension("/", score, p->next_char, length+1, spec+p->specificity, callerid);
                        } else if (p->next_char && !*(str+1)) {
                                score->canmatch = 1;
                                score->canmatch_exten = get_canmatch_exten(p);
                        } else {
                                return;
                        }
                } else if (p->x[0] == 'Z' && p->x[1] == 0 && *str >= '1' && *str <= '9' ) {
                        if (p->exten) /* if a shorter pattern matches along the way, might as well report it */
                                update_scoreboard(score, length+1, spec+p->specificity, p->exten,0,callerid, p->deleted);

                        if (p->next_char && ( *(str+1) || (p->next_char->x[0] == '/' && p->next_char->x[1] == 0))) {
                                if (*(str+1))
                                        new_find_extension(str+1, score, p->next_char, length+1, spec+p->specificity, callerid);
                                else
                                        new_find_extension("/", score, p->next_char, length+1, spec+p->specificity, callerid);
                        } else if (p->next_char && !*(str+1)) {
                                score->canmatch = 1;
                                score->canmatch_exten = get_canmatch_exten(p);
                        } else {
                                return;
                        }
                } else if (p->x[0] == 'X' && p->x[1] == 0 && *str >= '0' && *str <= '9' ) {
                        if (p->exten) /* if a shorter pattern matches along the way, might as well report it */
                                update_scoreboard(score, length+1, spec+p->specificity, p->exten,0,callerid, p->deleted);

                        if (p->next_char && ( *(str+1) || (p->next_char->x[0] == '/' && p->next_char->x[1] == 0))) {
                                if (*(str+1))
                                        new_find_extension(str+1, score, p->next_char, length+1, spec+p->specificity, callerid);
                                else
                                        new_find_extension("/", score, p->next_char, length+1, spec+p->specificity, callerid);
                        } else if (p->next_char && !*(str+1)) {
                                score->canmatch = 1;
                                score->canmatch_exten = get_canmatch_exten(p);
                        } else {
                                return;
                        }
                } else if (p->x[0] == '.' && p->x[1] == 0) {
                        /* how many chars will the . match against? */
                        int i = 0;
                        while (*str++) {
                                i++;
                        }
                        if (p->exten)
                                update_scoreboard(score, length+i, spec+(i*p->specificity), p->exten, '.', callerid, p->deleted);
                        if (p->next_char && p->next_char->x[0] == '/' && p->next_char->x[1] == 0) {
                                new_find_extension("/", score, p->next_char, length+i, spec+(p->specificity*i), callerid);
                        }
                        return;
                } else if (p->x[0] == '!' && p->x[1] == 0) {
                        /* how many chars will the . match against? */
                        int i = 0;
                        while (*str++) {
                                i++;
                        }
                        if (p->exten)
                                update_scoreboard(score, length+1, spec+(p->specificity*i), p->exten, '!', callerid, p->deleted);
                        if (p->next_char && p->next_char->x[0] == '/' && p->next_char->x[1] == 0) {
                                new_find_extension("/", score, p->next_char, length+i, spec+(p->specificity*i), callerid);
                        }
                        return;
                } else if (p->x[0] == '/' && p->x[1] == 0) {
                        /* the pattern in the tree includes the cid match! */
                        if (p->next_char && callerid && *callerid) {
                                new_find_extension(callerid, score, p->next_char, length+1, spec, callerid);
                        }
                } else if (index(p->x, *str)) {
                        if (p->exten) /* if a shorter pattern matches along the way, might as well report it */
                                update_scoreboard(score, length+1, spec+p->specificity, p->exten,0,callerid, p->deleted);


                        if (p->next_char && ( *(str+1) || (p->next_char->x[0] == '/' && p->next_char->x[1] == 0))) {
                                if (*(str+1)) {
                                        new_find_extension(str+1, score, p->next_char, length+1, spec+p->specificity, callerid);
                                } else {
                                        new_find_extension("/", score, p->next_char, length+1, spec+p->specificity, callerid);
                                }
                        } else if (p->next_char && !*(str+1)) {
                                score->canmatch = 1;
                                score->canmatch_exten = get_canmatch_exten(p);
                        } else {
                                return;
                        }
                }
        }
}

/* the algorithm for forming the extension pattern tree is also a bit simple; you 
 * traverse all the extensions in a context, and for each char of the extension,
 * you see if it exists in the tree; if it doesn't, you add it at the appropriate
 * spot. What more can I say? At the end of the list, you cap it off by adding the
 * address of the extension involved. Duplicate patterns will be complained about.
 *
 * Ideally, this would be done for each context after it is created and fully 
 * filled. It could be done as a finishing step after extensions.conf or .ael is
 * loaded, or it could be done when the first search is encountered. It should only
 * have to be done once, until the next unload or reload.
 *
 * I guess forming this pattern tree would be analogous to compiling a regex.
 */


struct match_char *already_in_tree(struct match_char *current, char *pat)
{
        struct match_char *t;
        if (!current)
                return 0;
        for (t=current; t; t=t->alt_char) {
                if (strcmp(pat,t->x) == 0) /* uh, we may want to sort exploded [] contents to make matching easy */
                        return t;
        }
        return 0;
}

struct match_char *add_pattern_node(struct ast_context *con, struct match_char *current, char *pattern, int is_pattern, int already, int specificity)
{
        struct match_char *m = ast_calloc(1,sizeof(struct match_char));
        m->x = ast_strdup(pattern);
        m->is_pattern = is_pattern;
        if (specificity == 1 && is_pattern && pattern[0] == 'N')
                m->specificity = 98;
        else if (specificity == 1 && is_pattern && pattern[0] == 'Z')
                m->specificity = 99;
        else if (specificity == 1 && is_pattern && pattern[0] == 'X')
                m->specificity = 100;
        else if (specificity == 1 && is_pattern && pattern[0] == '.')
                m->specificity = 200;
        else if (specificity == 1 && is_pattern && pattern[0] == '!')
                m->specificity = 200;
        else
                m->specificity = specificity;
        
        if (!con->pattern_tree) {
                con->pattern_tree = m;
        } else {
                if (already) { /* switch to the new regime (traversing vs appending)*/
                        m->alt_char = current->alt_char;
                        current->alt_char = m;
                } else {
                        if (current->next_char) {
                                m->alt_char = current->next_char->alt_char;
                                current->next_char = m;
                        } else {
                                current->next_char = m;
                        }
                }
        }
        return m;
}

struct match_char *add_exten_to_pattern_tree(struct ast_context *con, struct ast_exten *e1)
{
        struct match_char *m1=0,*m2=0;
        int specif;
        int already;
        int pattern = 0;
        char buf[256];
        char extenbuf[512];
        char *s1 = extenbuf;
        int l1 = strlen(e1->exten) + strlen(e1->cidmatch) + 2;
        

        strncpy(extenbuf,e1->exten,sizeof(extenbuf));
        if (e1->matchcid &&  l1 <= sizeof(extenbuf)) {
                strcat(extenbuf,"/");
                strcat(extenbuf,e1->cidmatch);
        } else if (l1 > sizeof(extenbuf)) {
                ast_log(LOG_ERROR,"The pattern %s/%s is too big to deal with: it will be ignored! Disaster!\n", e1->exten, e1->cidmatch);
                return 0;
        }
#ifdef NEED_DEBUG
        ast_log(LOG_DEBUG,"Adding exten %s%c%s to tree\n", s1, e1->matchcid? '/':' ', e1->matchcid? e1->cidmatch : "");
#endif
        m1 = con->pattern_tree; /* each pattern starts over at the root of the pattern tree */
        already = 1;

        if ( *s1 == '_') {
                pattern = 1;
                s1++;
        }
        while( *s1 ) {
                if (pattern && *s1 == '[' && *(s1-1) != '\\') {
                        char *s2 = buf;
                        buf[0] = 0;
                        s1++; /* get past the '[' */
                        while (*s1 != ']' && *(s1-1) != '\\' ) {
                                if (*s1 == '\\') {
                                        if (*(s1+1) == ']') {
                                                *s2++ = ']';
                                                s1++;s1++;
                                        } else if (*(s1+1) == '\\') {
                                                *s2++ = '\\';
                                                s1++;s1++;
                                        } else if (*(s1+1) == '-') {
                                                *s2++ = '-';
                                                s1++; s1++;
                                        } else if (*(s1+1) == '[') {
                                                *s2++ = '[';
                                                s1++; s1++;
                                        }
                                } else if (*s1 == '-') { /* remember to add some error checking to all this! */
                                        char s3 = *(s1-1);
                                        char s4 = *(s1+1);
                                        for (s3++; s3 <= s4; s3++) {
                                                *s2++ = s3;
                                        }
                                        s1++; s1++;
                                } else {
                                        *s2++ = *s1++;
                                }
                        }
                        *s2 = 0; /* null terminate the exploded range */
                        specif = strlen(buf);
                } else {
                        if (*s1 == '\\') {
                                s1++;
                                buf[0] = *s1;
                        } else {
                                buf[0] = *s1;
                        }
                        buf[1] = 0;
                        specif = 1;
                }
                m2 = 0;
                if (already && (m2=already_in_tree(m1,buf)) && m2->next_char) {
                        if (!(*(s1+1)))  /* if this is the end of the pattern, but not the end of the tree, then mark this node with the exten...
                                                                a shorter pattern might win if the longer one doesn't match */
                                m2->exten = e1;
                        m1 = m2->next_char; /* m1 points to the node to compare against */
                } else {
                        if (m2) {
                                m1 = m2;
                        } else 
                                m1 = add_pattern_node(con, m1, buf, pattern, already,specif); /* m1 is the node just added */
                        if (!(*(s1+1)))
                                m1->exten = e1;
                        already = 0;
                }
                s1++; /* advance to next char */
        }
        return m1;
}

void create_match_char_tree(struct ast_context *con)
{
        struct ast_hashtab_iter *t1;
        struct ast_exten *e1;
#ifdef NEED_DEBUG
        int biggest_bucket, resizes, numobjs, numbucks;
        
        ast_log(LOG_DEBUG,"Creating Extension Trie for context %s\n", con->name);
        ast_hashtab_get_stats(con->root_tree, &biggest_bucket, &resizes, &numobjs, &numbucks);
        ast_log(LOG_DEBUG,"This tree has %d objects in %d bucket lists, longest list=%d objects, and has resized %d times\n",
                        numobjs, numbucks, biggest_bucket, resizes);
#endif
        t1 = ast_hashtab_start_traversal(con->root_tree);
        while( (e1 = ast_hashtab_next(t1)) ) {
                if (e1->exten)
                        add_exten_to_pattern_tree(con, e1);
                else
                        ast_log(LOG_ERROR,"Attempt to create extension with no extension name.\n");
        }
        ast_hashtab_end_traversal(t1);
}

void destroy_pattern_tree(struct match_char *pattern_tree) /* pattern tree is a simple binary tree, sort of, so the proper way to destroy it is... recursively! */
{
        /* destroy all the alternates */
        if (pattern_tree->alt_char) {
                destroy_pattern_tree(pattern_tree->alt_char);
                pattern_tree->alt_char = 0;
        }
        /* destroy all the nexts */
        if (pattern_tree->next_char) {
                destroy_pattern_tree(pattern_tree->next_char);
                pattern_tree->next_char = 0;
        }
        pattern_tree->exten = 0; /* never hurts to make sure there's no pointers laying around */
        if (pattern_tree->x)
                free(pattern_tree->x);
        free(pattern_tree);
}

/*
 * Special characters used in patterns:
 *      '_'     underscore is the leading character of a pattern.
 *              In other position it is treated as a regular char.
 *      ' ' '-' space and '-' are separator and ignored.
 *      .       one or more of any character. Only allowed at the end of
 *              a pattern.
 *      !       zero or more of anything. Also impacts the result of CANMATCH
 *              and MATCHMORE. Only allowed at the end of a pattern.
 *              In the core routine, ! causes a match with a return code of 2.
 *              In turn, depending on the search mode: (XXX check if it is implemented)
 *              - E_MATCH retuns 1 (does match)
 *              - E_MATCHMORE returns 0 (no match)
 *              - E_CANMATCH returns 1 (does match)
 *
 *      /       should not appear as it is considered the separator of the CID info.
 *              XXX at the moment we may stop on this char.
 *
 *      X Z N   match ranges 0-9, 1-9, 2-9 respectively.
 *      [       denotes the start of a set of character. Everything inside
 *              is considered literally. We can have ranges a-d and individual
 *              characters. A '[' and '-' can be considered literally if they
 *              are just before ']'.
 *              XXX currently there is no way to specify ']' in a range, nor \ is
 *              considered specially.
 *
 * When we compare a pattern with a specific extension, all characters in the extension
 * itself are considered literally with the only exception of '-' which is considered
 * as a separator and thus ignored.
 * XXX do we want to consider space as a separator as well ?
 * XXX do we want to consider the separators in non-patterns as well ?
 */

/*!
 * \brief helper functions to sort extensions and patterns in the desired way,
 * so that more specific patterns appear first.
 *
 * ext_cmp1 compares individual characters (or sets of), returning
 * an int where bits 0-7 are the ASCII code of the first char in the set,
 * while bit 8-15 are the cardinality of the set minus 1.
 * This way more specific patterns (smaller cardinality) appear first.
 * Wildcards have a special value, so that we can directly compare them to
 * sets by subtracting the two values. In particular:
 *      0x000xx         one character, xx
 *      0x0yyxx         yy character set starting with xx
 *      0x10000         '.' (one or more of anything)
 *      0x20000         '!' (zero or more of anything)
 *      0x30000         NUL (end of string)
 *      0x40000         error in set.
 * The pointer to the string is advanced according to needs.
 * NOTES:
 *      1. the empty set is equivalent to NUL.
 *      2. given that a full set has always 0 as the first element,
 *         we could encode the special cases as 0xffXX where XX
 *         is 1, 2, 3, 4 as used above.
 */
static int ext_cmp1(const char **p)
{
        uint32_t chars[8];
        int c, cmin = 0xff, count = 0;
        const char *end;

        /* load, sign extend and advance pointer until we find
         * a valid character.
         */
        while ( (c = *(*p)++) && (c == ' ' || c == '-') )
                ;       /* ignore some characters */

        /* always return unless we have a set of chars */
        switch (c) {
        default:        /* ordinary character */
                return 0x0000 | (c & 0xff);

        case 'N':       /* 2..9 */
                return 0x0700 | '2' ;

        case 'X':       /* 0..9 */
                return 0x0900 | '0';

        case 'Z':       /* 1..9 */
                return 0x0800 | '1';

        case '.':       /* wildcard */
                return 0x10000;

        case '!':       /* earlymatch */
                return 0x20000; /* less specific than NULL */

        case '\0':      /* empty string */
                *p = NULL;
                return 0x30000;

        case '[':       /* pattern */
                break;
        }
        /* locate end of set */
        end = strchr(*p, ']');  

        if (end == NULL) {
                ast_log(LOG_WARNING, "Wrong usage of [] in the extension\n");
                return 0x40000; /* XXX make this entry go last... */
        }

        bzero(chars, sizeof(chars));    /* clear all chars in the set */
        for (; *p < end  ; (*p)++) {
                unsigned char c1, c2;   /* first-last char in range */
                c1 = (unsigned char)((*p)[0]);
                if (*p + 2 < end && (*p)[1] == '-') { /* this is a range */
                        c2 = (unsigned char)((*p)[2]);
                        *p += 2;        /* skip a total of 3 chars */
                } else                  /* individual character */
                        c2 = c1;
                if (c1 < cmin)
                        cmin = c1;
                for (; c1 <= c2; c1++) {
                        uint32_t mask = 1 << (c1 % 32);
                        if ( (chars[ c1 / 32 ] & mask) == 0)
                                count += 0x100;
                        chars[ c1 / 32 ] |= mask;
                }
        }
        (*p)++;
        return count == 0 ? 0x30000 : (count | cmin);
}

/*!
 * \brief the full routine to compare extensions in rules.
 */
static int ext_cmp(const char *a, const char *b)
{
        /* make sure non-patterns come first.
         * If a is not a pattern, it either comes first or
         * we use strcmp to compare the strings.
         */
        int ret = 0;

        if (a[0] != '_')
                return (b[0] == '_') ? -1 : strcmp(a, b);

        /* Now we know a is a pattern; if b is not, a comes first */
        if (b[0] != '_')
                return 1;
#if 0   /* old mode for ext matching */
        return strcmp(a, b);
#endif
        /* ok we need full pattern sorting routine */
        while (!ret && a && b)
                ret = ext_cmp1(&a) - ext_cmp1(&b);
        if (ret == 0)
                return 0;
        else
                return (ret > 0) ? 1 : -1;
}

int ast_extension_cmp(const char *a, const char *b)
{
        return ext_cmp(a, b);
}

/*!
 * \internal
 * \brief used ast_extension_{match|close}
 * mode is as follows:
 *      E_MATCH         success only on exact match
 *      E_MATCHMORE     success only on partial match (i.e. leftover digits in pattern)
 *      E_CANMATCH      either of the above.
 * \retval 0 on no-match
 * \retval 1 on match
 * \retval 2 on early match.
 */

static int _extension_match_core(const char *pattern, const char *data, enum ext_match_t mode)
{
        mode &= E_MATCH_MASK;   /* only consider the relevant bits */

        if ( (mode == E_MATCH) && (pattern[0] == '_') && (strcasecmp(pattern,data)==0) ) /* note: if this test is left out, then _x. will not match _x. !!! */
                return 1;

        if (pattern[0] != '_') { /* not a pattern, try exact or partial match */
                int ld = strlen(data), lp = strlen(pattern);

                if (lp < ld)            /* pattern too short, cannot match */
                        return 0;
                /* depending on the mode, accept full or partial match or both */
                if (mode == E_MATCH)
                        return !strcmp(pattern, data); /* 1 on match, 0 on fail */
                if (ld == 0 || !strncasecmp(pattern, data, ld)) /* partial or full match */
                        return (mode == E_MATCHMORE) ? lp > ld : 1; /* XXX should consider '!' and '/' ? */
                else
                        return 0;
        }
        pattern++; /* skip leading _ */
        /*
         * XXX below we stop at '/' which is a separator for the CID info. However we should
         * not store '/' in the pattern at all. When we insure it, we can remove the checks.
         */
        while (*data && *pattern && *pattern != '/') {
                const char *end;

                if (*data == '-') { /* skip '-' in data (just a separator) */
                        data++;
                        continue;
                }
                switch (toupper(*pattern)) {
                case '[':       /* a range */
                        end = strchr(pattern+1, ']'); /* XXX should deal with escapes ? */
                        if (end == NULL) {
                                ast_log(LOG_WARNING, "Wrong usage of [] in the extension\n");
                                return 0;       /* unconditional failure */
                        }
                        for (pattern++; pattern != end; pattern++) {
                                if (pattern+2 < end && pattern[1] == '-') { /* this is a range */
                                        if (*data >= pattern[0] && *data <= pattern[2])
                                                break;  /* match found */
                                        else {
                                                pattern += 2; /* skip a total of 3 chars */
                                                continue;
                                        }
                                } else if (*data == pattern[0])
                                        break;  /* match found */
                        }
                        if (pattern == end)
                                return 0;
                        pattern = end;  /* skip and continue */
                        break;
                case 'N':
                        if (*data < '2' || *data > '9')
                                return 0;
                        break;
                case 'X':
                        if (*data < '0' || *data > '9')
                                return 0;
                        break;
                case 'Z':
                        if (*data < '1' || *data > '9')
                                return 0;
                        break;
                case '.':       /* Must match, even with more digits */
                        return 1;
                case '!':       /* Early match */
                        return 2;
                case ' ':
                case '-':       /* Ignore these in patterns */
                        data--; /* compensate the final data++ */
                        break;
                default:
                        if (*data != *pattern)
                                return 0;
                }
                data++;
                pattern++;
        }
        if (*data)                      /* data longer than pattern, no match */
                return 0;
        /*
         * match so far, but ran off the end of the data.
         * Depending on what is next, determine match or not.
         */
        if (*pattern == '\0' || *pattern == '/')        /* exact match */
                return (mode == E_MATCHMORE) ? 0 : 1;   /* this is a failure for E_MATCHMORE */
        else if (*pattern == '!')                       /* early match */
                return 2;
        else                                            /* partial match */
                return (mode == E_MATCH) ? 0 : 1;       /* this is a failure for E_MATCH */
}

/*
 * Wrapper around _extension_match_core() to do performance measurement
 * using the profiling code.
 */
static int extension_match_core(const char *pattern, const char *data, enum ext_match_t mode)
{
        int i;
        static int prof_id = -2;        /* marker for 'unallocated' id */
        if (prof_id == -2)
                prof_id = ast_add_profile("ext_match", 0);
        ast_mark(prof_id, 1);
        i = _extension_match_core(pattern, data, mode);
        ast_mark(prof_id, 0);
        return i;
}

int ast_extension_match(const char *pattern, const char *data)
{
        return extension_match_core(pattern, data, E_MATCH);
}

int ast_extension_close(const char *pattern, const char *data, int needmore)
{
        if (needmore != E_MATCHMORE && needmore != E_CANMATCH)
                ast_log(LOG_WARNING, "invalid argument %d\n", needmore);
        return extension_match_core(pattern, data, needmore);
}

struct fake_context /* this struct is purely for matching in the hashtab */
{
        ast_rwlock_t lock;                      
        struct ast_exten *root;         
        struct ast_hashtab *root_tree;            
        struct match_char *pattern_tree;       
        struct ast_context *next;       
        struct ast_include *includes;           
        struct ast_ignorepat *ignorepats;       
        const char *registrar;  
        AST_LIST_HEAD_NOLOCK(, ast_sw) alts;    
        ast_mutex_t macrolock;          
        char name[256];         
};

struct ast_context *ast_context_find(const char *name)
{
        struct ast_context *tmp = NULL;
        struct fake_context item;
        strncpy(item.name,name,256);
        ast_rdlock_contexts();
        if( contexts_tree ) {
                tmp = ast_hashtab_lookup(contexts_tree,&item);
    } else {
                while ( (tmp = ast_walk_contexts(tmp)) ) {
                        if (!name || !strcasecmp(name, tmp->name))
                                break;
                }
        }
        ast_unlock_contexts();
        return tmp;
}

#define STATUS_NO_CONTEXT       1
#define STATUS_NO_EXTENSION     2
#define STATUS_NO_PRIORITY      3
#define STATUS_NO_LABEL         4
#define STATUS_SUCCESS          5

struct ast_exten *pbx_find_extension(struct ast_channel *chan,
        struct ast_context *bypass, struct pbx_find_info *q,
        const char *context, const char *exten, int priority,
        const char *label, const char *callerid, enum ext_match_t action)
{
        int x, res;
        struct ast_context *tmp=0;
        struct ast_exten *e=0, *eroot=0;
        struct ast_include *i = 0;
        struct ast_sw *sw = 0;
        struct ast_exten pattern = {0};
        struct scoreboard score = {0};

        pattern.label = label;
        pattern.priority = priority;


        /* Initialize status if appropriate */
        if (q->stacklen == 0) {
                q->status = STATUS_NO_CONTEXT;
                q->swo = NULL;
                q->data = NULL;
                q->foundcontext = NULL;
        } else if (q->stacklen >= AST_PBX_MAX_STACK) {
                ast_log(LOG_WARNING, "Maximum PBX stack exceeded\n");
                return NULL;
        }

        /* Check first to see if we've already been checked */
        for (x = 0; x < q->stacklen; x++) {
                if (!strcasecmp(q->incstack[x], context))
                        return NULL;
        }

        if (bypass)     /* bypass means we only look there */
                tmp = bypass;
        else {  /* look in contexts */
                struct fake_context item;
                strncpy(item.name,context,256);
                tmp = ast_hashtab_lookup(contexts_tree,&item);
#ifdef NOTNOW
                tmp = NULL;
                while ((tmp = ast_walk_contexts(tmp)) ) {
                        if (!strcmp(tmp->name, context))
                                break;
                }
#endif
                if (!tmp)
                        return NULL;
        }

        if (q->status < STATUS_NO_EXTENSION)
                q->status = STATUS_NO_EXTENSION;
        
        /* Do a search for matching extension */
        eroot = NULL;
        score.total_specificity = 0;
        score.exten = 0;
        score.total_length = 0;
        if (!tmp->pattern_tree && tmp->root_tree)
        {
                create_match_char_tree(tmp);
#ifdef NEED_DEBUG
                ast_log(LOG_DEBUG,"Tree Created in context %s:\n", context);
                print_match_char_tree(tmp->pattern_tree," ");
#endif
        }
        
        new_find_extension(exten, &score, tmp->pattern_tree, 0, 0, callerid);
        eroot = score.exten;

        if (score.last_char == '!' && action == E_MATCHMORE) {
                /* We match an extension ending in '!'.
                 * The decision in this case is final and is NULL (no match).
                 */
                return NULL;
        }

        if (!eroot && (action == E_CANMATCH || action == E_MATCHMORE) && score.canmatch_exten) {
                q->status = STATUS_SUCCESS;
                return score.canmatch_exten;
        }

        if (action == E_MATCHMORE && eroot)
                return NULL;  /* according to the code, complete matches are null matches in MATCHMORE mode */

        if (eroot) {
                /* found entry, now look for the right priority */
                if (q->status < STATUS_NO_PRIORITY)
                        q->status = STATUS_NO_PRIORITY;
                e = NULL;
                if (action == E_FINDLABEL && label ) {
                        if (q->status < STATUS_NO_LABEL)
                                q->status = STATUS_NO_LABEL;
                        e = ast_hashtab_lookup(eroot->peer_label_tree, &pattern);
                } else {
                        e = ast_hashtab_lookup(eroot->peer_tree, &pattern);
                }
                if (e) {        /* found a valid match */
                        q->status = STATUS_SUCCESS;
                        q->foundcontext = context;
                        return e;
                }
        }

#ifdef NOTNOW2
        /* scan the list trying to match extension and CID */
        eroot = NULL;
        while ( (eroot = ast_walk_context_extensions(tmp, eroot)) ) {
                int match = extension_match_core(eroot->exten, exten, action);
                /* 0 on fail, 1 on match, 2 on earlymatch */

                if (!match || (eroot->matchcid && !matchcid(eroot->cidmatch, callerid)))
                        continue;       /* keep trying */
                if (match == 2 && action == E_MATCHMORE) {
                        /* We match an extension ending in '!'.
                         * The decision in this case is final and is NULL (no match).
                         */
                        return NULL;
                }
                /* found entry, now look for the right priority */
                if (q->status < STATUS_NO_PRIORITY)
                        q->status = STATUS_NO_PRIORITY;
                e = NULL;
                if (action == E_FINDLABEL && label ) {
                        if (q->status < STATUS_NO_LABEL)
                                q->status = STATUS_NO_LABEL;
                        e = ast_hashtab_lookup(eroot->peer_label_tree, &pattern);
                } else {
                        e = ast_hashtab_lookup(eroot->peer_tree, &pattern);
                }
#ifdef NOTNOW
                while ( (e = ast_walk_extension_priorities(eroot, e)) ) {
                        /* Match label or priority */
                        if (action == E_FINDLABEL) {
                                if (q->status < STATUS_NO_LABEL)
                                        q->status = STATUS_NO_LABEL;
                                if (label && e->label && !strcmp(label, e->label))
                                        break;  /* found it */
                        } else if (e->priority == priority) {
                                break;  /* found it */
                        } /* else keep searching */
                }
#endif
                if (e) {        /* found a valid match */
                        q->status = STATUS_SUCCESS;
                        q->foundcontext = context;
                        return e;
                }
        }
#endif
        /* Check alternative switches */
        AST_LIST_TRAVERSE(&tmp->alts, sw, list) {
                struct ast_switch *asw = pbx_findswitch(sw->name);
                ast_switch_f *aswf = NULL;
                char *datap;

                if (!asw) {
                        ast_log(LOG_WARNING, "No such switch '%s'\n", sw->name);
                        continue;
                }
                /* Substitute variables now */
                
                if (sw->eval)
                        pbx_substitute_variables_helper(chan, sw->data, sw->tmpdata, SWITCH_DATA_LENGTH - 1);

                /* equivalent of extension_match_core() at the switch level */
                if (action == E_CANMATCH)
                        aswf = asw->canmatch;
                else if (action == E_MATCHMORE)
                        aswf = asw->matchmore;
                else /* action == E_MATCH */
                        aswf = asw->exists;
                datap = sw->eval ? sw->tmpdata : sw->data;
                res = !aswf ? 0 : aswf(chan, context, exten, priority, callerid, datap);
                if (res) {      /* Got a match */
                        q->swo = asw;
                        q->data = datap;
                        q->foundcontext = context;
                        /* XXX keep status = STATUS_NO_CONTEXT ? */
                        return NULL;
                }
        }
        q->incstack[q->stacklen++] = tmp->name; /* Setup the stack */
        /* Now try any includes we have in this context */
        for (i = tmp->includes; i; i = i->next) {
                if (include_valid(i)) {
                        if ((e = pbx_find_extension(chan, bypass, q, i->rname, exten, priority, label, callerid, action)))
                                return e;
                        if (q->swo)
                                return NULL;
                }
        }
        return NULL;
}

/*! 
 * \brief extract offset:length from variable name.
 * \return 1 if there is a offset:length part, which is
 * trimmed off (values go into variables)
 */
static int parse_variable_name(char *var, int *offset, int *length, int *isfunc)
{
        int parens=0;

        *offset = 0;
        *length = INT_MAX;
        *isfunc = 0;
        for (; *var; var++) {
                if (*var == '(') {
                        (*isfunc)++;
                        parens++;
                } else if (*var == ')') {
                        parens--;
                } else if (*var == ':' && parens == 0) {
                        *var++ = '\0';
                        sscanf(var, "%d:%d", offset, length);
                        return 1; /* offset:length valid */
                }
        }
        return 0;
}

/*! 
 *\brief takes a substring. It is ok to call with value == workspace.
 * \param value
 * \param offset < 0 means start from the end of the string and set the beginning
 *   to be that many characters back.
 * \param length is the length of the substring, a value less than 0 means to leave
 * that many off the end.
 * \param workspace
 * \param workspace_len
 * Always return a copy in workspace.
 */
static char *substring(const char *value, int offset, int length, char *workspace, size_t workspace_len)
{
        char *ret = workspace;
        int lr; /* length of the input string after the copy */

        ast_copy_string(workspace, value, workspace_len); /* always make a copy */

        lr = strlen(ret); /* compute length after copy, so we never go out of the workspace */

        /* Quick check if no need to do anything */
        if (offset == 0 && length >= lr)        /* take the whole string */
                return ret;

        if (offset < 0) {       /* translate negative offset into positive ones */
                offset = lr + offset;
                if (offset < 0) /* If the negative offset was greater than the length of the string, just start at the beginning */
                        offset = 0;
        }

        /* too large offset result in empty string so we know what to return */
        if (offset >= lr)
                return ret + lr;        /* the final '\0' */

        ret += offset;          /* move to the start position */
        if (length >= 0 && length < lr - offset)        /* truncate if necessary */
                ret[length] = '\0';
        else if (length < 0) {
                if (lr > offset - length) /* After we remove from the front and from the rear, is there anything left? */
                        ret[lr + length - offset] = '\0';
                else
                        ret[0] = '\0';
        }

        return ret;
}

/*! \brief  Support for Asterisk built-in variables in the dialplan

\note   See also
        - \ref AstVar   Channel variables
        - \ref AstCauses The HANGUPCAUSE variable
 */
void pbx_retrieve_variable(struct ast_channel *c, const char *var, char **ret, char *workspace, int workspacelen, struct varshead *headp)
{
        const char not_found = '\0';
        char *tmpvar;
        const char *s;  /* the result */
        int offset, length;
        int i, need_substring;
        struct varshead *places[2] = { headp, &globals };       /* list of places where we may look */

        if (c) {
                ast_channel_lock(c);
                places[0] = &c->varshead;
        }
        /*
         * Make a copy of var because parse_variable_name() modifies the string.
         * Then if called directly, we might need to run substring() on the result;
         * remember this for later in 'need_substring', 'offset' and 'length'
         */
        tmpvar = ast_strdupa(var);      /* parse_variable_name modifies the string */
        need_substring = parse_variable_name(tmpvar, &offset, &length, &i /* ignored */);

        /*
         * Look first into predefined variables, then into variable lists.
         * Variable 's' points to the result, according to the following rules:
         * s == &not_found (set at the beginning) means that we did not find a
         *      matching variable and need to look into more places.
         * If s != &not_found, s is a valid result string as follows:
         * s = NULL if the variable does not have a value;
         *      you typically do this when looking for an unset predefined variable.
         * s = workspace if the result has been assembled there;
         *      typically done when the result is built e.g. with an snprintf(),
         *      so we don't need to do an additional copy.
         * s != workspace in case we have a string, that needs to be copied
         *      (the ast_copy_string is done once for all at the end).
         *      Typically done when the result is already available in some string.
         */
        s = &not_found; /* default value */
        if (c) {        /* This group requires a valid channel */
                /* Names with common parts are looked up a piece at a time using strncmp. */
                if (!strncmp(var, "CALL", 4)) {
                        if (!strncmp(var + 4, "ING", 3)) {
                                if (!strcmp(var + 7, "PRES")) {                 /* CALLINGPRES */
                                        snprintf(workspace, workspacelen, "%d", c->cid.cid_pres);
                                        s = workspace;
                                } else if (!strcmp(var + 7, "ANI2")) {          /* CALLINGANI2 */
                                        snprintf(workspace, workspacelen, "%d", c->cid.cid_ani2);
                                        s = workspace;
                                } else if (!strcmp(var + 7, "TON")) {           /* CALLINGTON */
                                        snprintf(workspace, workspacelen, "%d", c->cid.cid_ton);
                                        s = workspace;
                                } else if (!strcmp(var + 7, "TNS")) {           /* CALLINGTNS */
                                        snprintf(workspace, workspacelen, "%d", c->cid.cid_tns);
                                        s = workspace;
                                }
                        }
                } else if (!strcmp(var, "HINT")) {
                        s = ast_get_hint(workspace, workspacelen, NULL, 0, c, c->context, c->exten) ? workspace : NULL;
                } else if (!strcmp(var, "HINTNAME")) {
                        s = ast_get_hint(NULL, 0, workspace, workspacelen, c, c->context, c->exten) ? workspace : NULL;
                } else if (!strcmp(var, "EXTEN")) {
                        s = c->exten;
                } else if (!strcmp(var, "CONTEXT")) {
                        s = c->context;
                } else if (!strcmp(var, "PRIORITY")) {
                        snprintf(workspace, workspacelen, "%d", c->priority);
                        s = workspace;
                } else if (!strcmp(var, "CHANNEL")) {
                        s = c->name;
                } else if (!strcmp(var, "UNIQUEID")) {
                        s = c->uniqueid;
                } else if (!strcmp(var, "HANGUPCAUSE")) {
                        snprintf(workspace, workspacelen, "%d", c->hangupcause);
                        s = workspace;
                }
        }
        if (s == &not_found) { /* look for more */
                if (!strcmp(var, "EPOCH")) {
                        snprintf(workspace, workspacelen, "%u",(int)time(NULL));
                        s = workspace;
                } else if (!strcmp(var, "SYSTEMNAME")) {
                        s = ast_config_AST_SYSTEM_NAME;
                }
        }
        /* if not found, look into chanvars or global vars */
        for (i = 0; s == &not_found && i < (sizeof(places) / sizeof(places[0])); i++) {
                struct ast_var_t *variables;
                if (!places[i])
                        continue;
                if (places[i] == &globals)
                        ast_rwlock_rdlock(&globalslock);
                AST_LIST_TRAVERSE(places[i], variables, entries) {
                        if (strcasecmp(ast_var_name(variables), var)==0) {
                                s = ast_var_value(variables);
                                break;
                        }
                }
                if (places[i] == &globals)
                        ast_rwlock_unlock(&globalslock);
        }
        if (s == &not_found || s == NULL)
                *ret = NULL;
        else {
                if (s != workspace)
                        ast_copy_string(workspace, s, workspacelen);
                *ret = workspace;
                if (need_substring)
                        *ret = substring(*ret, offset, length, workspace, workspacelen);
        }

        if (c)
                ast_channel_unlock(c);
}

static void exception_store_free(void *data)
{
        struct pbx_exception *exception = data;
        ast_string_field_free_memory(exception);
        ast_free(exception);
}

static struct ast_datastore_info exception_store_info = {
        .type = "EXCEPTION",
        .destroy = exception_store_free,
};

int pbx_builtin_raise_exception(struct ast_channel *chan, void *vreason)
{
        const char *reason = vreason;
        struct ast_datastore *ds = ast_channel_datastore_find(chan, &exception_store_info, NULL);
        struct pbx_exception *exception = NULL;

        if (!ds) {
                ds = ast_channel_datastore_alloc(&exception_store_info, NULL);
                if (!ds)
                        return -1;
                exception = ast_calloc(1, sizeof(struct pbx_exception));
                if (!exception) {
                        ast_channel_datastore_free(ds);
                        return -1;
                }
                if (ast_string_field_init(exception, 128)) {
                        ast_free(exception);
                        ast_channel_datastore_free(ds);
                        return -1;
                }
                ds->data = exception;
                ast_channel_datastore_add(chan, ds);
        } else
                exception = ds->data;

        ast_string_field_set(exception, reason, reason);
        ast_string_field_set(exception, context, chan->context);
        ast_string_field_set(exception, exten, chan->exten);
        exception->priority = chan->priority;
        set_ext_pri(chan, "e", 0);
        return 0;
}

static int acf_exception_read(struct ast_channel *chan, const char *name, char *data, char *buf, size_t buflen)
{
        struct ast_datastore *ds = ast_channel_datastore_find(chan, &exception_store_info, NULL);
        struct pbx_exception *exception = NULL;
        if (!ds || !ds->data)
                return -1;
        exception = ds->data;
        if (!strcasecmp(data, "REASON"))
                ast_copy_string(buf, exception->reason, buflen);
        else if (!strcasecmp(data, "CONTEXT"))
                ast_copy_string(buf, exception->context, buflen);
        else if (!strncasecmp(data, "EXTEN", 5))
                ast_copy_string(buf, exception->exten, buflen);
        else if (!strcasecmp(data, "PRIORITY"))
                snprintf(buf, buflen, "%d", exception->priority);
        else
                return -1;
        return 0;
}

static struct ast_custom_function exception_function = {
        .name = "EXCEPTION",
        .synopsis = "Retrieve the details of the current dialplan exception",
        .desc =
"The following fields are available for retrieval:\n"
"  reason    INVALID, ERROR, RESPONSETIMEOUT, ABSOLUTETIMEOUT, or custom\n"
"               value set by the RaiseException() application\n"
"  context   The context executing when the exception occurred\n"
"  exten     The extension executing when the exception occurred\n"
"  priority  The numeric priority executing when the exception occurred\n",
        .syntax = "EXCEPTION(<field>)",
        .read = acf_exception_read,
};

static char *handle_show_functions(struct ast_cli_entry *e, int cmd, struct ast_cli_args *a)
{
        struct ast_custom_function *acf;
        int count_acf = 0;
        int like = 0;

        switch (cmd) {
        case CLI_INIT:
                e->command = "core show functions [like]";
                e->usage = 
                        "Usage: core show functions [like <text>]\n"
                        "       List builtin functions, optionally only those matching a given string\n";
                return NULL;
        case CLI_GENERATE:
                return NULL;
        }

        if (a->argc == 5 && (!strcmp(a->argv[3], "like")) ) {
                like = 1;
        } else if (a->argc != 3) {
                return CLI_SHOWUSAGE;
        }

        ast_cli(a->fd, "%s Custom Functions:\n--------------------------------------------------------------------------------\n", like ? "Matching" : "Installed");

        AST_RWLIST_RDLOCK(&acf_root);
        AST_RWLIST_TRAVERSE(&acf_root, acf, acflist) {
                if (!like || strstr(acf->name, a->argv[4])) {
                        count_acf++;
                        ast_cli(a->fd, "%-20.20s  %-35.35s  %s\n", acf->name, acf->syntax, acf->synopsis);
                }
        }
        AST_RWLIST_UNLOCK(&acf_root);

        ast_cli(a->fd, "%d %scustom functions installed.\n", count_acf, like ? "matching " : "");

        return CLI_SUCCESS;
}

static char *handle_show_function(struct ast_cli_entry *e, int cmd, struct ast_cli_args *a)
{
        struct ast_custom_function *acf;
        /* Maximum number of characters added by terminal coloring is 22 */
        char infotitle[64 + AST_MAX_APP + 22], syntitle[40], destitle[40];
        char info[64 + AST_MAX_APP], *synopsis = NULL, *description = NULL;
        char stxtitle[40], *syntax = NULL;
        int synopsis_size, description_size, syntax_size;
        char *ret = NULL;
        int which = 0;
        int wordlen;

        switch (cmd) {
        case CLI_INIT:
                e->command = "core show function";
                e->usage = 
                        "Usage: core show function <function>\n"
                        "       Describe a particular dialplan function.\n";
                return NULL;
        case CLI_GENERATE:      
                wordlen = strlen(a->word);
                /* case-insensitive for convenience in this 'complete' function */
                AST_RWLIST_RDLOCK(&acf_root);
                AST_RWLIST_TRAVERSE(&acf_root, acf, acflist) {
                        if (!strncasecmp(a->word, acf->name, wordlen) && ++which > a->n) {
                                ret = ast_strdup(acf->name);
                                break;
                        }
                }
                AST_RWLIST_UNLOCK(&acf_root);

                return ret;
        }

        if (a->argc < 4)
                return CLI_SHOWUSAGE;

        if (!(acf = ast_custom_function_find(a->argv[3]))) {
                ast_cli(a->fd, "No function by that name registered.\n");
                return CLI_FAILURE;

        }

        if (acf->synopsis)
                synopsis_size = strlen(acf->synopsis) + 23;
        else
                synopsis_size = strlen("Not available") + 23;
        synopsis = alloca(synopsis_size);

        if (acf->desc)
                description_size = strlen(acf->desc) + 23;
        else
                description_size = strlen("Not available") + 23;
        description = alloca(description_size);

        if (acf->syntax)
                syntax_size = strlen(acf->syntax) + 23;
        else
                syntax_size = strlen("Not available") + 23;
        syntax = alloca(syntax_size);

        snprintf(info, 64 + AST_MAX_APP, "\n  -= Info about function '%s' =- \n\n", acf->name);
        term_color(infotitle, info, COLOR_MAGENTA, 0, 64 + AST_MAX_APP + 22);
        term_color(stxtitle, "[Syntax]\n", COLOR_MAGENTA, 0, 40);
        term_color(syntitle, "[Synopsis]\n", COLOR_MAGENTA, 0, 40);
        term_color(destitle, "[Description]\n", COLOR_MAGENTA, 0, 40);
        term_color(syntax,
                   acf->syntax ? acf->syntax : "Not available",
                   COLOR_CYAN, 0, syntax_size);
        term_color(synopsis,
                   acf->synopsis ? acf->synopsis : "Not available",
                   COLOR_CYAN, 0, synopsis_size);
        term_color(description,
                   acf->desc ? acf->desc : "Not available",
                   COLOR_CYAN, 0, description_size);

        ast_cli(a->fd,"%s%s%s\n\n%s%s\n\n%s%s\n", infotitle, stxtitle, syntax, syntitle, synopsis, destitle, description);

        return CLI_SUCCESS;
}

struct ast_custom_function *ast_custom_function_find(const char *name)
{
        struct ast_custom_function *acf = NULL;

        AST_RWLIST_RDLOCK(&acf_root);
        AST_RWLIST_TRAVERSE(&acf_root, acf, acflist) {
                if (!strcmp(name, acf->name))
                        break;
        }
        AST_RWLIST_UNLOCK(&acf_root);

        return acf;
}

int ast_custom_function_unregister(struct ast_custom_function *acf)
{
        struct ast_custom_function *cur;

        if (!acf)
                return -1;

        AST_RWLIST_WRLOCK(&acf_root);
        if ((cur = AST_RWLIST_REMOVE(&acf_root, acf, acflist)))
                ast_verb(2, "Unregistered custom function %s\n", cur->name);
        AST_RWLIST_UNLOCK(&acf_root);

        return cur ? 0 : -1;
}

int __ast_custom_function_register(struct ast_custom_function *acf, struct ast_module *mod)
{
        struct ast_custom_function *cur;

        if (!acf)
                return -1;

        acf->mod = mod;

        AST_RWLIST_WRLOCK(&acf_root);

        AST_RWLIST_TRAVERSE(&acf_root, cur, acflist) {
                if (!strcmp(acf->name, cur->name)) {
                        ast_log(LOG_ERROR, "Function %s already registered.\n", acf->name);
                        AST_RWLIST_UNLOCK(&acf_root);
                        return -1;
                }
        }

        /* Store in alphabetical order */
        AST_RWLIST_TRAVERSE_SAFE_BEGIN(&acf_root, cur, acflist) {
                if (strcasecmp(acf->name, cur->name) < 0) {
                        AST_RWLIST_INSERT_BEFORE_CURRENT(acf, acflist);
                        break;
                }
        }
        AST_RWLIST_TRAVERSE_SAFE_END;
        if (!cur)
                AST_RWLIST_INSERT_TAIL(&acf_root, acf, acflist);

        AST_RWLIST_UNLOCK(&acf_root);

        ast_verb(2, "Registered custom function %s\n", acf->name);

        return 0;
}

/*! \brief return a pointer to the arguments of the function,
 * and terminates the function name with '\\0'
 */
static char *func_args(char *function)
{
        char *args = strchr(function, '(');

        if (!args)
                ast_log(LOG_WARNING, "Function doesn't contain parentheses.  Assuming null argument.\n");
        else {
                char *p;
                *args++ = '\0';
                if ((p = strrchr(args, ')')) )
                        *p = '\0';
                else
                        ast_log(LOG_WARNING, "Can't find trailing parenthesis?\n");
        }
        return args;
}

int ast_func_read(struct ast_channel *chan, const char *function, char *workspace, size_t len)
{
        char *copy = ast_strdupa(function);
        char *args = func_args(copy);
        struct ast_custom_function *acfptr = ast_custom_function_find(copy);

        if (acfptr == NULL)
                ast_log(LOG_ERROR, "Function %s not registered\n", copy);
        else if (!acfptr->read)
                ast_log(LOG_ERROR, "Function %s cannot be read\n", copy);
        else {
                int res;
                struct ast_module_user *u = NULL;
                if (acfptr->mod)
                        u = __ast_module_user_add(acfptr->mod, chan);
                res = acfptr->read(chan, copy, args, workspace, len);
                if (acfptr->mod && u)
                        __ast_module_user_remove(acfptr->mod, u);
                return res;
        }
        return -1;
}

int ast_func_write(struct ast_channel *chan, const char *function, const char *value)
{
        char *copy = ast_strdupa(function);
        char *args = func_args(copy);
        struct ast_custom_function *acfptr = ast_custom_function_find(copy);

        if (acfptr == NULL)
                ast_log(LOG_ERROR, "Function %s not registered\n", copy);
        else if (!acfptr->write)
                ast_log(LOG_ERROR, "Function %s cannot be written to\n", copy);
        else {
                int res;
                struct ast_module_user *u = NULL;
                if (acfptr->mod)
                        u = __ast_module_user_add(acfptr->mod, chan);
                res = acfptr->write(chan, copy, args, value);
                if (acfptr->mod && u)
                        __ast_module_user_remove(acfptr->mod, u);
                return res;
        }

        return -1;
}

static void pbx_substitute_variables_helper_full(struct ast_channel *c, struct varshead *headp, const char *cp1, char *cp2, int count)
{
        /* Substitutes variables into cp2, based on string cp1, cp2 NO LONGER NEEDS TO BE ZEROED OUT!!!!  */
        char *cp4;
        const char *tmp, *whereweare;
        int length, offset, offset2, isfunction;
        char *workspace = NULL;
        char *ltmp = NULL, *var = NULL;
        char *nextvar, *nextexp, *nextthing;
        char *vars, *vare;
        int pos, brackets, needsub, len;
        
        *cp2 = 0; /* just in case nothing ends up there */
        whereweare=tmp=cp1;
        while (!ast_strlen_zero(whereweare) && count) {
                /* Assume we're copying the whole remaining string */
                pos = strlen(whereweare);
                nextvar = NULL;
                nextexp = NULL;
                nextthing = strchr(whereweare, '$');
                if (nextthing) {
                        switch (nextthing[1]) {
                        case '{':
                                nextvar = nextthing;
                                pos = nextvar - whereweare;
                                break;
                        case '[':
                                nextexp = nextthing;
                                pos = nextexp - whereweare;
                                break;
                        default:
                                pos = 1;
                        }
                }

                if (pos) {
                        /* Can't copy more than 'count' bytes */
                        if (pos > count)
                                pos = count;

                        /* Copy that many bytes */
                        memcpy(cp2, whereweare, pos);

                        count -= pos;
                        cp2 += pos;
                        whereweare += pos;
                        *cp2 = 0;
                }

                if (nextvar) {
                        /* We have a variable.  Find the start and end, and determine
                           if we are going to have to recursively call ourselves on the
                           contents */
                        vars = vare = nextvar + 2;
                        brackets = 1;
                        needsub = 0;

                        /* Find the end of it */
                        while (brackets && *vare) {
                                if ((vare[0] == '$') && (vare[1] == '{')) {
                                        needsub++;
                                } else if (vare[0] == '{') {
                                        brackets++;
                                } else if (vare[0] == '}') {
                                        brackets--;
                                } else if ((vare[0] == '$') && (vare[1] == '['))
                                        needsub++;
                                vare++;
                        }
                        if (brackets)
                                ast_log(LOG_NOTICE, "Error in extension logic (missing '}')\n");
                        len = vare - vars - 1;

                        /* Skip totally over variable string */
                        whereweare += (len + 3);

                        if (!var)
                                var = alloca(VAR_BUF_SIZE);

                        /* Store variable name (and truncate) */
                        ast_copy_string(var, vars, len + 1);

                        /* Substitute if necessary */
                        if (needsub) {
                                if (!ltmp)
                                        ltmp = alloca(VAR_BUF_SIZE);

                                pbx_substitute_variables_helper_full(c, headp, var, ltmp, VAR_BUF_SIZE - 1);
                                vars = ltmp;
                        } else {
                                vars = var;
                        }

                        if (!workspace)
                                workspace = alloca(VAR_BUF_SIZE);

                        workspace[0] = '\0';

                        parse_variable_name(vars, &offset, &offset2, &isfunction);
                        if (isfunction) {
                                /* Evaluate function */
                                if (c || !headp)
                                        cp4 = ast_func_read(c, vars, workspace, VAR_BUF_SIZE) ? NULL : workspace;
                                else {
                                        struct varshead old;
                                        struct ast_channel *c = ast_channel_alloc(0, 0, "", "", "", "", "", 0, "Bogus/%p", vars);
                                        if (c) {
                                                memcpy(&old, &c->varshead, sizeof(old));
                                                memcpy(&c->varshead, headp, sizeof(c->varshead));
                                                cp4 = ast_func_read(c, vars, workspace, VAR_BUF_SIZE) ? NULL : workspace;
                                                /* Don't deallocate the varshead that was passed in */
                                                memcpy(&c->varshead, &old, sizeof(c->varshead));
                                                ast_channel_free(c);
                                        } else
                                                ast_log(LOG_ERROR, "Unable to allocate bogus channel for variable substitution.  Function results may be blank.\n");
                                }
                                ast_debug(1, "Function result is '%s'\n", cp4 ? cp4 : "(null)");
                        } else {
                                /* Retrieve variable value */
                                pbx_retrieve_variable(c, vars, &cp4, workspace, VAR_BUF_SIZE, headp);
                        }
                        if (cp4) {
                                cp4 = substring(cp4, offset, offset2, workspace, VAR_BUF_SIZE);

                                length = strlen(cp4);
                                if (length > count)
                                        length = count;
                                memcpy(cp2, cp4, length);
                                count -= length;
                                cp2 += length;
                                *cp2 = 0;
                        }
                } else if (nextexp) {
                        /* We have an expression.  Find the start and end, and determine
                           if we are going to have to recursively call ourselves on the
                           contents */
                        vars = vare = nextexp + 2;
                        brackets = 1;
                        needsub = 0;

                        /* Find the end of it */
                        while (brackets && *vare) {
                                if ((vare[0] == '$') && (vare[1] == '[')) {
                                        needsub++;
                                        brackets++;
                                        vare++;
                                } else if (vare[0] == '[') {
                                        brackets++;
                                } else if (vare[0] == ']') {
                                        brackets--;
                                } else if ((vare[0] == '$') && (vare[1] == '{')) {
                                        needsub++;
                                        vare++;
                                }
                                vare++;
                        }
                        if (brackets)
                                ast_log(LOG_NOTICE, "Error in extension logic (missing ']')\n");
                        len = vare - vars - 1;

                        /* Skip totally over expression */
                        whereweare += (len + 3);

                        if (!var)
                                var = alloca(VAR_BUF_SIZE);

                        /* Store variable name (and truncate) */
                        ast_copy_string(var, vars, len + 1);

                        /* Substitute if necessary */
                        if (needsub) {
                                if (!ltmp)
                                        ltmp = alloca(VAR_BUF_SIZE);

                                pbx_substitute_variables_helper_full(c, headp, var, ltmp, VAR_BUF_SIZE - 1);
                                vars = ltmp;
                        } else {
                                vars = var;
                        }

                        length = ast_expr(vars, cp2, count, c);

                        if (length) {
                                ast_debug(1, "Expression result is '%s'\n", cp2);
                                count -= length;
                                cp2 += length;
                                *cp2 = 0;
                        }
                }
        }
}

void pbx_substitute_variables_helper(struct ast_channel *c, const char *cp1, char *cp2, int count)
{
        pbx_substitute_variables_helper_full(c, (c) ? &c->varshead : NULL, cp1, cp2, count);
}

void pbx_substitute_variables_varshead(struct varshead *headp, const char *cp1, char *cp2, int count)
{
        pbx_substitute_variables_helper_full(NULL, headp, cp1, cp2, count);
}

static void pbx_substitute_variables(char *passdata, int datalen, struct ast_channel *c, struct ast_exten *e)
{
        const char *tmp;

        /* Nothing more to do */
        if (!e->data)
                return;

        /* No variables or expressions in e->data, so why scan it? */
        if ((!(tmp = strchr(e->data, '$'))) || (!strstr(tmp, "${") && !strstr(tmp, "$["))) {
                ast_copy_string(passdata, e->data, datalen);
                return;
        }

        pbx_substitute_variables_helper(c, e->data, passdata, datalen - 1);
}

/*! \brief The return value depends on the action:
 *
 * E_MATCH, E_CANMATCH, E_MATCHMORE require a real match,
 *      and return 0 on failure, -1 on match;
 * E_FINDLABEL maps the label to a priority, and returns
 *      the priority on success, ... XXX
 * E_SPAWN, spawn an application,
 *      
 * \retval 0 on success.
 * \retval  -1 on failure.
 */
static int pbx_extension_helper(struct ast_channel *c, struct ast_context *con,
  const char *context, const char *exten, int priority,
  const char *label, const char *callerid, enum ext_match_t action, int *found, int combined_find_spawn)
{
        struct ast_exten *e;
        struct ast_app *app;
        int res;
        struct pbx_find_info q = { .stacklen = 0 }; /* the rest is reset in pbx_find_extension */
        char passdata[EXT_DATA_SIZE];

        int matching_action = (action == E_MATCH || action == E_CANMATCH || action == E_MATCHMORE);
        
        ast_rdlock_contexts();
        if (found)
                *found = 0;
        e = pbx_find_extension(c, con, &q, context, exten, priority, label, callerid, action);
        if (e) {
                if (found)
                        *found = 1;
                if (matching_action) {
                        ast_unlock_contexts();
                        return -1;      /* success, we found it */
                } else if (action == E_FINDLABEL) { /* map the label to a priority */
                        res = e->priority;
                        ast_unlock_contexts();
                        return res;     /* the priority we were looking for */
                } else {        /* spawn */
                        if (!e->cached_app)
                                e->cached_app = pbx_findapp(e->app);
                        app = e->cached_app;
                        ast_unlock_contexts();
                        if (!app) {
                                ast_log(LOG_WARNING, "No application '%s' for extension (%s, %s, %d)\n", e->app, context, exten, priority);
                                return -1;
                        }
                        if (c->context != context)
                                ast_copy_string(c->context, context, sizeof(c->context));
                        if (c->exten != exten)
                                ast_copy_string(c->exten, exten, sizeof(c->exten));
                        c->priority = priority;
                        pbx_substitute_variables(passdata, sizeof(passdata), c, e);
                        if (option_debug) {
                                char atmp[80];
                                char atmp2[EXT_DATA_SIZE+100];
                                ast_debug(1, "Launching '%s'\n", app->name);
                                snprintf(atmp, sizeof(atmp), "STACK-%s-%s-%d", context, exten, priority);
                                snprintf(atmp2, sizeof(atmp2), "%s(\"%s\", \"%s\") %s",
                                        app->name, c->name, passdata, "in new stack");
                                pbx_builtin_setvar_helper(c, atmp, atmp2);
                        }
                        if (option_verbose > 2) {
                                char tmp[80], tmp2[80], tmp3[EXT_DATA_SIZE];
                                ast_verb(3, "Executing [%s@%s:%d] %s(\"%s\", \"%s\") %s\n",
                                        exten, context, priority,
                                        term_color(tmp, app->name, COLOR_BRCYAN, 0, sizeof(tmp)),
                                        term_color(tmp2, c->name, COLOR_BRMAGENTA, 0, sizeof(tmp2)),
                                        term_color(tmp3, passdata, COLOR_BRMAGENTA, 0, sizeof(tmp3)),
                                        "in new stack");
                        }
                        manager_event(EVENT_FLAG_CALL, "Newexten",
                                        "Channel: %s\r\n"
                                        "Context: %s\r\n"
                                        "Extension: %s\r\n"
                                        "Priority: %d\r\n"
                                        "Application: %s\r\n"
                                        "AppData: %s\r\n"
                                        "Uniqueid: %s\r\n",
                                        c->name, c->context, c->exten, c->priority, app->name, passdata, c->uniqueid);
                        return pbx_exec(c, app, passdata);      /* 0 on success, -1 on failure */
                }
        } else if (q.swo) {     /* not found here, but in another switch */
                ast_unlock_contexts();
                if (matching_action)
                        return -1;
                else {
                        if (!q.swo->exec) {
                                ast_log(LOG_WARNING, "No execution engine for switch %s\n", q.swo->name);
                                res = -1;
                        }
                        return q.swo->exec(c, q.foundcontext ? q.foundcontext : context, exten, priority, callerid, q.data);
                }
        } else {        /* not found anywhere, see what happened */
                ast_unlock_contexts();
                switch (q.status) {
                case STATUS_NO_CONTEXT:
                        if (!matching_action && !combined_find_spawn)
                                ast_log(LOG_NOTICE, "Cannot find extension context '%s'\n", context);
                        break;
                case STATUS_NO_EXTENSION:
                        if (!matching_action && !combined_find_spawn)
                                ast_log(LOG_NOTICE, "Cannot find extension '%s' in context '%s'\n", exten, context);
                        break;
                case STATUS_NO_PRIORITY:
                        if (!matching_action && !combined_find_spawn)
                                ast_log(LOG_NOTICE, "No such priority %d in extension '%s' in context '%s'\n", priority, exten, context);
                        break;
                case STATUS_NO_LABEL:
                        if (context && !combined_find_spawn)
                                ast_log(LOG_NOTICE, "No such label '%s' in extension '%s' in context '%s'\n", label, exten, context);
                        break;
                default:
                        ast_debug(1, "Shouldn't happen!\n");
                }

                return (matching_action) ? 0 : -1;
        }
}

/*! \brief Find hint for given extension in context */
static struct ast_exten *ast_hint_extension(struct ast_channel *c, const char *context, const char *exten)
{
        struct ast_exten *e;
        struct pbx_find_info q = { .stacklen = 0 }; /* the rest is set in pbx_find_context */

        ast_rdlock_contexts();
        e = pbx_find_extension(c, NULL, &q, context, exten, PRIORITY_HINT, NULL, "", E_MATCH);
        ast_unlock_contexts();

        return e;
}

/*! \brief Check state of extension by using hints */
static int ast_extension_state2(struct ast_exten *e)
{
        char hint[AST_MAX_EXTENSION];
        char *cur, *rest;
        int allunavailable = 1, allbusy = 1, allfree = 1, allonhold = 1;
        int busy = 0, inuse = 0, ring = 0;

        if (!e)
                return -1;

        ast_copy_string(hint, ast_get_extension_app(e), sizeof(hint));

        rest = hint;    /* One or more devices separated with a & character */
        while ( (cur = strsep(&rest, "&")) ) {
                int res = ast_device_state(cur);
                switch (res) {
                case AST_DEVICE_NOT_INUSE:
                        allunavailable = 0;
                        allbusy = 0;
                        allonhold = 0;
                        break;
                case AST_DEVICE_INUSE:
                        inuse = 1;
                        allunavailable = 0;
                        allfree = 0;
                        allonhold = 0;
                        break;
                case AST_DEVICE_RINGING:
                        ring = 1;
                        allunavailable = 0;
                        allfree = 0;
                        allonhold = 0;
                        break;
                case AST_DEVICE_RINGINUSE:
                        inuse = 1;
                        ring = 1;
                        allunavailable = 0;
                        allfree = 0;
                        allonhold = 0;
                        break;
                case AST_DEVICE_ONHOLD:
                        allunavailable = 0;
                        allfree = 0;
                        break;
                case AST_DEVICE_BUSY:
                        allunavailable = 0;
                        allfree = 0;
                        allonhold = 0;
                        busy = 1;
                        break;
                case AST_DEVICE_UNAVAILABLE:
                case AST_DEVICE_INVALID:
                        allbusy = 0;
                        allfree = 0;
                        allonhold = 0;
                        break;
                default:
                        allunavailable = 0;
                        allbusy = 0;
                        allfree = 0;
                        allonhold = 0;
                }
        }

        if (!inuse && ring)
                return AST_EXTENSION_RINGING;
        if (inuse && ring)
                return (AST_EXTENSION_INUSE | AST_EXTENSION_RINGING);
        if (inuse)
                return AST_EXTENSION_INUSE;
        if (allfree)
                return AST_EXTENSION_NOT_INUSE;
        if (allonhold)
                return AST_EXTENSION_ONHOLD;
        if (allbusy)
                return AST_EXTENSION_BUSY;
        if (allunavailable)
                return AST_EXTENSION_UNAVAILABLE;
        if (busy)
                return AST_EXTENSION_INUSE;

        return AST_EXTENSION_NOT_INUSE;
}

/*! \brief Return extension_state as string */
const char *ast_extension_state2str(int extension_state)
{
        int i;

        for (i = 0; (i < (sizeof(extension_states) / sizeof(extension_states[0]))); i++) {
                if (extension_states[i].extension_state == extension_state)
                        return extension_states[i].text;
        }
        return "Unknown";
}

/*! \brief Check extension state for an extension by using hint */
int ast_extension_state(struct ast_channel *c, const char *context, const char *exten)
{
        struct ast_exten *e;

        e = ast_hint_extension(c, context, exten);      /* Do we have a hint for this extension ? */
        if (!e)
                return -1;                              /* No hint, return -1 */

        return ast_extension_state2(e);                 /* Check all devices in the hint */
}

static void handle_statechange(const char *device)
{
        struct ast_hint *hint;

        AST_RWLIST_RDLOCK(&hints);

        AST_RWLIST_TRAVERSE(&hints, hint, list) {
                struct ast_state_cb *cblist;
                char buf[AST_MAX_EXTENSION];
                char *parse = buf;
                char *cur;
                int state;

                ast_copy_string(buf, ast_get_extension_app(hint->exten), sizeof(buf));
                while ( (cur = strsep(&parse, "&")) ) {
                        if (!strcasecmp(cur, device))
                                break;
                }
                if (!cur)
                        continue;

                /* Get device state for this hint */
                state = ast_extension_state2(hint->exten);

                if ((state == -1) || (state == hint->laststate))
                        continue;

                /* Device state changed since last check - notify the watchers */

                /* For general callbacks */
                for (cblist = statecbs; cblist; cblist = cblist->next)
                        cblist->callback(hint->exten->parent->name, hint->exten->exten, state, cblist->data);

                /* For extension callbacks */
                for (cblist = hint->callbacks; cblist; cblist = cblist->next)
                        cblist->callback(hint->exten->parent->name, hint->exten->exten, state, cblist->data);

                hint->laststate = state;        /* record we saw the change */
        }

        AST_RWLIST_UNLOCK(&hints);
}

static int statechange_queue(const char *dev)
{
        struct statechange *sc;

        if (!(sc = ast_calloc(1, sizeof(*sc) + strlen(dev) + 1)))
                return 0;

        strcpy(sc->dev, dev);

        ast_mutex_lock(&device_state.lock);
        AST_LIST_INSERT_TAIL(&device_state.state_change_q, sc, entry);
        ast_cond_signal(&device_state.cond);
        ast_mutex_unlock(&device_state.lock);

        return 0;
}

static void *device_state_thread(void *data)
{
        struct statechange *sc;

        while (!device_state.stop) {
                ast_mutex_lock(&device_state.lock);
                while (!(sc = AST_LIST_REMOVE_HEAD(&device_state.state_change_q, entry))) {
                        ast_cond_wait(&device_state.cond, &device_state.lock);
                        /* Check to see if we were woken up to see the request to stop */
                        if (device_state.stop) {
                                ast_mutex_unlock(&device_state.lock);
                                return NULL;
                        }
                }
                ast_mutex_unlock(&device_state.lock);

                handle_statechange(sc->dev);

                ast_free(sc);
        }

        return NULL;
}

/*! \brief  Add watcher for extension states */
int ast_extension_state_add(const char *context, const char *exten,
                            ast_state_cb_type callback, void *data)
{
        struct ast_hint *hint;
        struct ast_state_cb *cblist;
        struct ast_exten *e;

        /* If there's no context and extension:  add callback to statecbs list */
        if (!context && !exten) {
                AST_RWLIST_WRLOCK(&hints);

                for (cblist = statecbs; cblist; cblist = cblist->next) {
                        if (cblist->callback == callback) {
                                cblist->data = data;
                                AST_RWLIST_UNLOCK(&hints);
                                return 0;
                        }
                }

                /* Now insert the callback */
                if (!(cblist = ast_calloc(1, sizeof(*cblist)))) {
                        AST_RWLIST_UNLOCK(&hints);
                        return -1;
                }
                cblist->id = 0;
                cblist->callback = callback;
                cblist->data = data;

                cblist->next = statecbs;
                statecbs = cblist;

                AST_RWLIST_UNLOCK(&hints);
                return 0;
        }

        if (!context || !exten)
                return -1;

        /* This callback type is for only one hint, so get the hint */
        e = ast_hint_extension(NULL, context, exten);
        if (!e) {
                return -1;
        }

        /* Find the hint in the list of hints */
        AST_RWLIST_WRLOCK(&hints);

        AST_RWLIST_TRAVERSE(&hints, hint, list) {
                if (hint->exten == e)
                        break;
        }

        if (!hint) {
                /* We have no hint, sorry */
                AST_RWLIST_UNLOCK(&hints);
                return -1;
        }

        /* Now insert the callback in the callback list  */
        if (!(cblist = ast_calloc(1, sizeof(*cblist)))) {
                AST_RWLIST_UNLOCK(&hints);
                return -1;
        }
        cblist->id = stateid++;         /* Unique ID for this callback */
        cblist->callback = callback;    /* Pointer to callback routine */
        cblist->data = data;            /* Data for the callback */

        cblist->next = hint->callbacks;
        hint->callbacks = cblist;

        AST_RWLIST_UNLOCK(&hints);
        return cblist->id;
}

/*! \brief Remove a watcher from the callback list */
int ast_extension_state_del(int id, ast_state_cb_type callback)
{
        struct ast_state_cb **p_cur = NULL;     /* address of pointer to us */
        int ret = -1;

        if (!id && !callback)
                return -1;

        AST_RWLIST_WRLOCK(&hints);

        if (!id) {      /* id == 0 is a callback without extension */
                for (p_cur = &statecbs; *p_cur; p_cur = &(*p_cur)->next) {
                        if ((*p_cur)->callback == callback)
                                break;
                }
        } else { /* callback with extension, find the callback based on ID */
                struct ast_hint *hint;
                AST_RWLIST_TRAVERSE(&hints, hint, list) {
                        for (p_cur = &hint->callbacks; *p_cur; p_cur = &(*p_cur)->next) {
                                if ((*p_cur)->id == id)
                                        break;
                        }
                        if (*p_cur)     /* found in the inner loop */
                                break;
                }
        }
        if (p_cur && *p_cur) {
                struct ast_state_cb *cur = *p_cur;
                *p_cur = cur->next;
                ast_free(cur);
                ret = 0;
        }
        AST_RWLIST_UNLOCK(&hints);
        return ret;
}

/*! \brief Add hint to hint list, check initial extension state */
static int ast_add_hint(struct ast_exten *e)
{
        struct ast_hint *hint;

        if (!e)
                return -1;

        AST_RWLIST_WRLOCK(&hints);

        /* Search if hint exists, do nothing */
        AST_RWLIST_TRAVERSE(&hints, hint, list) {
                if (hint->exten == e) {
                        AST_RWLIST_UNLOCK(&hints);
                        ast_debug(2, "HINTS: Not re-adding existing hint %s: %s\n", ast_get_extension_name(e), ast_get_extension_app(e));
                        return -1;
                }
        }

        ast_debug(2, "HINTS: Adding hint %s: %s\n", ast_get_extension_name(e), ast_get_extension_app(e));

        if (!(hint = ast_calloc(1, sizeof(*hint)))) {
                AST_RWLIST_UNLOCK(&hints);
                return -1;
        }
        /* Initialize and insert new item at the top */
        hint->exten = e;
        hint->laststate = ast_extension_state2(e);
        AST_RWLIST_INSERT_HEAD(&hints, hint, list);

        AST_RWLIST_UNLOCK(&hints);
        return 0;
}

/*! \brief Change hint for an extension */
static int ast_change_hint(struct ast_exten *oe, struct ast_exten *ne)
{
        struct ast_hint *hint;
        int res = -1;

        AST_RWLIST_WRLOCK(&hints);
        AST_RWLIST_TRAVERSE(&hints, hint, list) {
                if (hint->exten == oe) {
                        hint->exten = ne;
                        res = 0;
                        break;
                }
        }
        AST_RWLIST_UNLOCK(&hints);

        return res;
}

/*! \brief Remove hint from extension */
static int ast_remove_hint(struct ast_exten *e)
{
        /* Cleanup the Notifys if hint is removed */
        struct ast_hint *hint;
        struct ast_state_cb *cblist, *cbprev;
        int res = -1;

        if (!e)
                return -1;

        AST_RWLIST_TRAVERSE_SAFE_BEGIN(&hints, hint, list) {
                if (hint->exten == e) {
                        cbprev = NULL;
                        cblist = hint->callbacks;
                        while (cblist) {
                                /* Notify with -1 and remove all callbacks */
                                cbprev = cblist;
                                cblist = cblist->next;
                                cbprev->callback(hint->exten->parent->name, hint->exten->exten, AST_EXTENSION_DEACTIVATED, cbprev->data);
                                ast_free(cbprev);
                        }
                        hint->callbacks = NULL;
                        AST_RWLIST_REMOVE_CURRENT(list);
                        ast_free(hint);
                        res = 0;
                        break;
                }
        }
        AST_RWLIST_TRAVERSE_SAFE_END;

        return res;
}


/*! \brief Get hint for channel */
int ast_get_hint(char *hint, int hintsize, char *name, int namesize, struct ast_channel *c, const char *context, const char *exten)
{
        struct ast_exten *e = ast_hint_extension(c, context, exten);

        if (e) {
                if (hint)
                        ast_copy_string(hint, ast_get_extension_app(e), hintsize);
                if (name) {
                        const char *tmp = ast_get_extension_app_data(e);
                        if (tmp)
                                ast_copy_string(name, tmp, namesize);
                }
                return -1;
        }
        return 0;
}

int ast_exists_extension(struct ast_channel *c, const char *context, const char *exten, int priority, const char *callerid)
{
        return pbx_extension_helper(c, NULL, context, exten, priority, NULL, callerid, E_MATCH, 0, 0);
}

int ast_findlabel_extension(struct ast_channel *c, const char *context, const char *exten, const char *label, const char *callerid)
{
        return pbx_extension_helper(c, NULL, context, exten, 0, label, callerid, E_FINDLABEL, 0, 0);
}

int ast_findlabel_extension2(struct ast_channel *c, struct ast_context *con, const char *exten, const char *label, const char *callerid)
{
        return pbx_extension_helper(c, con, NULL, exten, 0, label, callerid, E_FINDLABEL, 0, 0);
}

int ast_canmatch_extension(struct ast_channel *c, const char *context, const char *exten, int priority, const char *callerid)
{
        return pbx_extension_helper(c, NULL, context, exten, priority, NULL, callerid, E_CANMATCH, 0, 0);
}

int ast_matchmore_extension(struct ast_channel *c, const char *context, const char *exten, int priority, const char *callerid)
{
        return pbx_extension_helper(c, NULL, context, exten, priority, NULL, callerid, E_MATCHMORE, 0, 0);
}

int ast_spawn_extension(struct ast_channel *c, const char *context, const char *exten, int priority, const char *callerid, int *found, int combined_find_spawn)
{
        return pbx_extension_helper(c, NULL, context, exten, priority, NULL, callerid, E_SPAWN, found, combined_find_spawn);
}

/*! helper function to set extension and priority */
static void set_ext_pri(struct ast_channel *c, const char *exten, int pri)
{
        ast_copy_string(c->exten, exten, sizeof(c->exten));
        c->priority = pri;
}

/*!
 * \brief collect digits from the channel into the buffer.
 * \retval 0 on timeout or done.
 * \retval -1 on error.
*/
static int collect_digits(struct ast_channel *c, int waittime, char *buf, int buflen, int pos)
{
        int digit;

        buf[pos] = '\0';        /* make sure it is properly terminated */
        while (ast_matchmore_extension(c, c->context, buf, 1, c->cid.cid_num)) {
                /* As long as we're willing to wait, and as long as it's not defined,
                   keep reading digits until we can't possibly get a right answer anymore.  */
                digit = ast_waitfordigit(c, waittime * 1000);
                if (c->_softhangup == AST_SOFTHANGUP_ASYNCGOTO) {
                        c->_softhangup = 0;
                } else {
                        if (!digit)     /* No entry */
                                break;
                        if (digit < 0)  /* Error, maybe a  hangup */
                                return -1;
                        if (pos < buflen - 1) { /* XXX maybe error otherwise ? */
                                buf[pos++] = digit;
                                buf[pos] = '\0';
                        }
                        waittime = c->pbx->dtimeout;
                }
        }
        return 0;
}

static int __ast_pbx_run(struct ast_channel *c)
{
        int found = 0;  /* set if we find at least one match */
        int res = 0;
        int autoloopflag;
        int error = 0;          /* set an error conditions */

        /* A little initial setup here */
        if (c->pbx) {
                ast_log(LOG_WARNING, "%s already has PBX structure??\n", c->name);
                /* XXX and now what ? */
                ast_free(c->pbx);
        }
        if (!(c->pbx = ast_calloc(1, sizeof(*c->pbx))))
                return -1;
        if (c->amaflags) {
                if (!c->cdr) {
                        c->cdr = ast_cdr_alloc();
                        if (!c->cdr) {
                                ast_log(LOG_WARNING, "Unable to create Call Detail Record\n");
                                ast_free(c->pbx);
                                return -1;
                        }
                        ast_cdr_init(c->cdr, c);
                }
        }
        /* Set reasonable defaults */
        c->pbx->rtimeout = 10;
        c->pbx->dtimeout = 5;

        autoloopflag = ast_test_flag(c, AST_FLAG_IN_AUTOLOOP);  /* save value to restore at the end */
        ast_set_flag(c, AST_FLAG_IN_AUTOLOOP);

        /* Start by trying whatever the channel is set to */
        if (!ast_exists_extension(c, c->context, c->exten, c->priority, c->cid.cid_num)) {
                /* If not successful fall back to 's' */
                ast_verb(2, "Starting %s at %s,%s,%d failed so falling back to exten 's'\n", c->name, c->context, c->exten, c->priority);
                /* XXX the original code used the existing priority in the call to
                 * ast_exists_extension(), and reset it to 1 afterwards.
                 * I believe the correct thing is to set it to 1 immediately.
                 */
                set_ext_pri(c, "s", 1);
                if (!ast_exists_extension(c, c->context, c->exten, c->priority, c->cid.cid_num)) {
                        /* JK02: And finally back to default if everything else failed */
                        ast_verb(2, "Starting %s at %s,%s,%d still failed so falling back to context 'default'\n", c->name, c->context, c->exten, c->priority);
                        ast_copy_string(c->context, "default", sizeof(c->context));
                }
        }
        if (c->cdr && ast_tvzero(c->cdr->start))
                ast_cdr_start(c->cdr);
        for (;;) {
                char dst_exten[256];    /* buffer to accumulate digits */
                int pos = 0;            /* XXX should check bounds */
                int digit = 0;

                /* loop on priorities in this context/exten */
                while ( !(res = ast_spawn_extension(c, c->context, c->exten, c->priority, c->cid.cid_num, &found,1))) {
                        if (c->_softhangup == AST_SOFTHANGUP_TIMEOUT && ast_exists_extension(c, c->context, "T", 1, c->cid.cid_num)) {
                                set_ext_pri(c, "T", 0); /* 0 will become 1 with the c->priority++; at the end */
                                /* If the AbsoluteTimeout is not reset to 0, we'll get an infinite loop */
                                c->whentohangup = 0;
                                c->_softhangup &= ~AST_SOFTHANGUP_TIMEOUT;
                        } else if (c->_softhangup == AST_SOFTHANGUP_TIMEOUT && ast_exists_extension(c, c->context, "e", 1, c->cid.cid_num)) {
                                pbx_builtin_raise_exception(c, "ABSOLUTETIMEOUT");
                                /* If the AbsoluteTimeout is not reset to 0, we'll get an infinite loop */
                                c->whentohangup = 0;
                                c->_softhangup &= ~AST_SOFTHANGUP_TIMEOUT;
                        } else if (ast_check_hangup(c)) {
                                ast_debug(1, "Extension %s, priority %d returned normally even though call was hung up\n",
                                        c->exten, c->priority);
                                error = 1;
                                break;
                        }
                        c->priority++;
                } /* end while  - from here on we can use 'break' to go out */
                if (found && res) {
                        /* Something bad happened, or a hangup has been requested. */
                        if (strchr("0123456789ABCDEF*#", res)) {
                                ast_debug(1, "Oooh, got something to jump out with ('%c')!\n", res);
                                pos = 0;
                                dst_exten[pos++] = digit = res;
                                dst_exten[pos] = '\0';
                        } else if (res == AST_PBX_KEEPALIVE) {
                                ast_debug(1, "Spawn extension (%s,%s,%d) exited KEEPALIVE on '%s'\n", c->context, c->exten, c->priority, c->name);
                                ast_verb(2, "Spawn extension (%s, %s, %d) exited KEEPALIVE on '%s'\n", c->context, c->exten, c->priority, c->name);
                                error = 1;
                        } else {
                                ast_debug(1, "Spawn extension (%s,%s,%d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
                                ast_verb(2, "Spawn extension (%s, %s, %d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
                                
                                if ((res == AST_PBX_ERROR) && ast_exists_extension(c, c->context, "e", 1, c->cid.cid_num)) {
                                        /* if we are already on the 'e' exten, don't jump to it again */
                                        if (!strcmp(c->exten, "e")) {
                                                if (option_verbose > 1)
                                                        ast_verbose(VERBOSE_PREFIX_2 "Spawn extension (%s, %s, %d) exited ERROR while already on 'e' exten on '%s'\n", c->context, c->exten, c->priority, c->name);
                                                error = 1;
                                        } else {
                                                pbx_builtin_raise_exception(c, "ERROR");
                                                continue;
                                        }
                                }
                                
                                if (c->_softhangup == AST_SOFTHANGUP_ASYNCGOTO) {
                                        c->_softhangup = 0;
                                } else if (c->_softhangup == AST_SOFTHANGUP_TIMEOUT) {
                                        /* atimeout, nothing bad */
                                } else {
                                        if (c->cdr)
                                                ast_cdr_update(c);
                                        error = 1;
                                        break;
                                }
                        }
                }
                if (error)
                        break;

                /*!\note
                 * We get here on a failure of some kind:  non-existing extension or
                 * hangup.  We have options, here.  We can either catch the failure
                 * and continue, or we can drop out entirely. */

                if (!ast_exists_extension(c, c->context, c->exten, 1, c->cid.cid_num)) {
                        /*!\note
                         * If there is no match at priority 1, it is not a valid extension anymore.
                         * Try to continue at "i" (for invalid) or "e" (for exception) or exit if
                         * neither exist.
                         */
                        if (ast_exists_extension(c, c->context, "i", 1, c->cid.cid_num)) {
                                ast_verb(3, "Sent into invalid extension '%s' in context '%s' on %s\n", c->exten, c->context, c->name);
                                pbx_builtin_setvar_helper(c, "INVALID_EXTEN", c->exten);
                                set_ext_pri(c, "i", 1);
                        } else if (ast_exists_extension(c, c->context, "e", 1, c->cid.cid_num)) {
                                pbx_builtin_raise_exception(c, "INVALID");
                        } else {
                                ast_log(LOG_WARNING, "Channel '%s' sent into invalid extension '%s' in context '%s', but no invalid handler\n",
                                        c->name, c->exten, c->context);
                                error = 1; /* we know what to do with it */
                                break;
                        }
                } else if (c->_softhangup == AST_SOFTHANGUP_TIMEOUT) {
                        /* If we get this far with AST_SOFTHANGUP_TIMEOUT, then we know that the "T" extension is next. */
                        c->_softhangup = 0;
                } else {        /* keypress received, get more digits for a full extension */
                        int waittime = 0;
                        if (digit)
                                waittime = c->pbx->dtimeout;
                        else if (!autofallthrough)
                                waittime = c->pbx->rtimeout;
                        if (!waittime) {
                                const char *status = pbx_builtin_getvar_helper(c, "DIALSTATUS");
                                if (!status)
                                        status = "UNKNOWN";
                                ast_verb(3, "Auto fallthrough, channel '%s' status is '%s'\n", c->name, status);
                                if (!strcasecmp(status, "CONGESTION"))
                                        res = pbx_builtin_congestion(c, "10");
                                else if (!strcasecmp(status, "CHANUNAVAIL"))
                                        res = pbx_builtin_congestion(c, "10");
                                else if (!strcasecmp(status, "BUSY"))
                                        res = pbx_builtin_busy(c, "10");
                                error = 1; /* XXX disable message */
                                break;  /* exit from the 'for' loop */
                        }

                        if (collect_digits(c, waittime, dst_exten, sizeof(dst_exten), pos))
                                break;
                        if (ast_exists_extension(c, c->context, dst_exten, 1, c->cid.cid_num)) /* Prepare the next cycle */
                                set_ext_pri(c, dst_exten, 1);
                        else {
                                /* No such extension */
                                if (!ast_strlen_zero(dst_exten)) {
                                        /* An invalid extension */
                                        if (ast_exists_extension(c, c->context, "i", 1, c->cid.cid_num)) {
                                                ast_verb(3, "Invalid extension '%s' in context '%s' on %s\n", dst_exten, c->context, c->name);
                                                pbx_builtin_setvar_helper(c, "INVALID_EXTEN", dst_exten);
                                                set_ext_pri(c, "i", 1);
                                        } else if (ast_exists_extension(c, c->context, "e", 1, c->cid.cid_num)) {
                                                pbx_builtin_raise_exception(c, "INVALID");
                                        } else {
                                                ast_log(LOG_WARNING, "Invalid extension '%s', but no rule 'i' in context '%s'\n", dst_exten, c->context);
                                                found = 1; /* XXX disable message */
                                                break;
                                        }
                                } else {
                                        /* A simple timeout */
                                        if (ast_exists_extension(c, c->context, "t", 1, c->cid.cid_num)) {
                                                ast_verb(3, "Timeout on %s\n", c->name);
                                                set_ext_pri(c, "t", 1);
                                        } else if (ast_exists_extension(c, c->context, "e", 1, c->cid.cid_num)) {
                                                pbx_builtin_raise_exception(c, "RESPONSETIMEOUT");
                                        } else {
                                                ast_log(LOG_WARNING, "Timeout, but no rule 't' in context '%s'\n", c->context);
                                                found = 1; /* XXX disable message */
                                                break;
                                        }
                                }
                        }
                        if (c->cdr) {
                                ast_verb(2, "CDR updated on %s\n",c->name);
                                ast_cdr_update(c);
                        }
                }
        }
        if (!found && !error)
                ast_log(LOG_WARNING, "Don't know what to do with '%s'\n", c->name);
        if (res != AST_PBX_KEEPALIVE)
                ast_softhangup(c, c->hangupcause ? c->hangupcause : AST_CAUSE_NORMAL_CLEARING);
        if ((res != AST_PBX_KEEPALIVE) && ast_exists_extension(c, c->context, "h", 1, c->cid.cid_num)) {
                if (c->cdr && ast_opt_end_cdr_before_h_exten)
                        ast_cdr_end(c->cdr);
                set_ext_pri(c, "h", 1);
                while ((res = ast_spawn_extension(c, c->context, c->exten, c->priority, c->cid.cid_num, &found, 1)) == 0) {
                        c->priority++;
                }
                if (found && res) {
                        /* Something bad happened, or a hangup has been requested. */
                        ast_debug(1, "Spawn extension (%s,%s,%d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
                        ast_verb(2, "Spawn extension (%s, %s, %d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
                }
        }
        ast_set2_flag(c, autoloopflag, AST_FLAG_IN_AUTOLOOP);

        pbx_destroy(c->pbx);
        c->pbx = NULL;
        if (res != AST_PBX_KEEPALIVE)
                ast_hangup(c);
        return 0;
}

/*! 
 * \brief Increase call count for channel
 * \retval 0 on success
 * \retval non-zero if a configured limit (maxcalls, maxload, minmemfree) was reached 
*/
static int increase_call_count(const struct ast_channel *c)
{
        int failed = 0;
        double curloadavg;
#if defined(HAVE_SYSINFO)
        long curfreemem;
        struct sysinfo sys_info;
#endif

        ast_mutex_lock(&maxcalllock);
        if (option_maxcalls) {
                if (countcalls >= option_maxcalls) {
                        ast_log(LOG_NOTICE, "Maximum call limit of %d calls exceeded by '%s'!\n", option_maxcalls, c->name);
                        failed = -1;
                }
        }
        if (option_maxload) {
                getloadavg(&curloadavg, 1);
                if (curloadavg >= option_maxload) {
                        ast_log(LOG_NOTICE, "Maximum loadavg limit of %f load exceeded by '%s' (currently %f)!\n", option_maxload, c->name, curloadavg);
                        failed = -1;
                }
        }
#if defined(HAVE_SYSINFO)
        if (option_minmemfree) {
                if (!sysinfo(&sys_info)) {
                        /* make sure that the free system memory is above the configured low watermark
                         * convert the amount of freeram from mem_units to MB */
                        curfreemem = sys_info.freeram / sys_info.mem_unit; 
                        curfreemem /= 1024*1024; 
                        if (curfreemem < option_minmemfree) {
                                ast_log(LOG_WARNING, "Available system memory (~%ldMB) is below the configured low watermark (%ldMB)\n", curfreemem, option_minmemfree);
                                failed = -1;
                        }
                }
        }
#endif
                
        if (!failed)
                countcalls++;
        ast_mutex_unlock(&maxcalllock);

        return failed;
}

static void decrease_call_count(void)
{
        ast_mutex_lock(&maxcalllock);
        if (countcalls > 0)
                countcalls--;
        ast_mutex_unlock(&maxcalllock);
}

static void destroy_exten(struct ast_exten *e)
{
        if (e->priority == PRIORITY_HINT)
                ast_remove_hint(e);

        if (e->peer_tree)
                ast_hashtab_destroy(e->peer_tree,0);
        if (e->peer_label_tree)
                ast_hashtab_destroy(e->peer_label_tree, 0);
        if (e->datad)
                e->datad(e->data);
        ast_free(e);
}

static void *pbx_thread(void *data)
{
        /* Oh joyeous kernel, we're a new thread, with nothing to do but
           answer this channel and get it going.
        */
        /* NOTE:
           The launcher of this function _MUST_ increment 'countcalls'
           before invoking the function; it will be decremented when the
           PBX has finished running on the channel
         */
        struct ast_channel *c = data;

        __ast_pbx_run(c);
        decrease_call_count();

        pthread_exit(NULL);

        return NULL;
}

enum ast_pbx_result ast_pbx_start(struct ast_channel *c)
{
        pthread_t t;

        if (!c) {
                ast_log(LOG_WARNING, "Asked to start thread on NULL channel?\n");
                return AST_PBX_FAILED;
        }

        if (increase_call_count(c))
                return AST_PBX_CALL_LIMIT;

        /* Start a new thread, and get something handling this channel. */
        if (ast_pthread_create_detached(&t, NULL, pbx_thread, c)) {
                ast_log(LOG_WARNING, "Failed to create new channel thread\n");
                return AST_PBX_FAILED;
        }

        return AST_PBX_SUCCESS;
}

enum ast_pbx_result ast_pbx_run(struct ast_channel *c)
{
        enum ast_pbx_result res = AST_PBX_SUCCESS;

        if (increase_call_count(c))
                return AST_PBX_CALL_LIMIT;

        res = __ast_pbx_run(c);
        decrease_call_count();

        return res;
}

int ast_active_calls(void)
{
        return countcalls;
}

int pbx_set_autofallthrough(int newval)
{
        int oldval = autofallthrough;
        autofallthrough = newval;
        return oldval;
}

/*!
 * \brief lookup for a context with a given name,
 * \retval with conlock held if found.
 * \retval NULL if not found.
*/
static struct ast_context *find_context_locked(const char *context)
{
        struct ast_context *c = NULL;
        struct fake_context item;
        strncpy(item.name, context, 256);
        ast_rdlock_contexts();
        c = ast_hashtab_lookup(contexts_tree,&item);

#ifdef NOTNOW

        while ( (c = ast_walk_contexts(c)) ) {
                if (!strcmp(ast_get_context_name(c), context))
                        return c;
        }
#endif
        ast_unlock_contexts();

        return c;
}

/*!
 * \brief Remove included contexts.
 * This function locks contexts list by &conlist, search for the right context
 * structure, leave context list locked and call ast_context_remove_include2
 * which removes include, unlock contexts list and return ...
*/
int ast_context_remove_include(const char *context, const char *include, const char *registrar)
{
        int ret = -1;
        struct ast_context *c = find_context_locked(context);

        if (c) {
                /* found, remove include from this context ... */
                ret = ast_context_remove_include2(c, include, registrar);
                ast_unlock_contexts();
        }
        return ret;
}

/*!
 * \brief Locks context, remove included contexts, unlocks context.
 * When we call this function, &conlock lock must be locked, because when
 * we giving *con argument, some process can remove/change this context
 * and after that there can be segfault.
 *
 * \retval 0 on success.
 * \retval -1 on failure.
 */
int ast_context_remove_include2(struct ast_context *con, const char *include, const char *registrar)
{
        struct ast_include *i, *pi = NULL;
        int ret = -1;

        ast_wrlock_context(con);

        /* find our include */
        for (i = con->includes; i; pi = i, i = i->next) {
                if (!strcmp(i->name, include) &&
                                (!registrar || !strcmp(i->registrar, registrar))) {
                        /* remove from list */
                        if (pi)
                                pi->next = i->next;
                        else
                                con->includes = i->next;
                        /* free include and return */
                        ast_free(i);
                        ret = 0;
                        break;
                }
        }

        ast_unlock_context(con);

        return ret;
}

/*!
 * \note This function locks contexts list by &conlist, search for the rigt context
 * structure, leave context list locked and call ast_context_remove_switch2
 * which removes switch, unlock contexts list and return ...
 */
int ast_context_remove_switch(const char *context, const char *sw, const char *data, const char *registrar)
{
        int ret = -1; /* default error return */
        struct ast_context *c = find_context_locked(context);

        if (c) {
                /* remove switch from this context ... */
                ret = ast_context_remove_switch2(c, sw, data, registrar);
                ast_unlock_contexts();
        }
        return ret;
}

/*!
 * \brief This function locks given context, removes switch, unlock context and
 * return.
 * \note When we call this function, &conlock lock must be locked, because when
 * we giving *con argument, some process can remove/change this context
 * and after that there can be segfault.
 *
 */
int ast_context_remove_switch2(struct ast_context *con, const char *sw, const char *data, const char *registrar)
{
        struct ast_sw *i;
        int ret = -1;

        ast_wrlock_context(con);

        /* walk switches */
        AST_LIST_TRAVERSE_SAFE_BEGIN(&con->alts, i, list) {
                if (!strcmp(i->name, sw) && !strcmp(i->data, data) &&
                        (!registrar || !strcmp(i->registrar, registrar))) {
                        /* found, remove from list */
                        AST_LIST_REMOVE_CURRENT(list);
                        ast_free(i); /* free switch and return */
                        ret = 0;
                        break;