mirror of
				https://github.com/asterisk/asterisk.git
				synced 2025-10-25 22:18:07 +00:00 
			
		
		
		
	git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@760 65c4cc65-6c06-0410-ace0-fbb531ad65f3
		
			
				
	
	
		
			4368 lines
		
	
	
		
			110 KiB
		
	
	
	
		
			C
		
	
	
		
			Executable File
		
	
	
	
	
			
		
		
	
	
			4368 lines
		
	
	
		
			110 KiB
		
	
	
	
		
			C
		
	
	
		
			Executable File
		
	
	
	
	
| /*
 | |
|  * Asterisk -- A telephony toolkit for Linux.
 | |
|  *
 | |
|  * Core PBX routines.
 | |
|  * 
 | |
|  * Copyright (C) 1999, Mark Spencer
 | |
|  *
 | |
|  * Mark Spencer <markster@linux-support.net>
 | |
|  *
 | |
|  * This program is free software, distributed under the terms of
 | |
|  * the GNU General Public License
 | |
|  */
 | |
| 
 | |
| #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/term.h>
 | |
| #include <asterisk/manager.h>
 | |
| #include <asterisk/ast_expr.h>
 | |
| #include <asterisk/channel_pvt.h>
 | |
| #include <asterisk/linkedlists.h>
 | |
| #include <string.h>
 | |
| #include <unistd.h>
 | |
| #include <stdlib.h>
 | |
| #include <stdio.h>
 | |
| #include <setjmp.h>
 | |
| #include <ctype.h>
 | |
| #include <errno.h>
 | |
| #include <time.h>
 | |
| #include <sys/time.h>
 | |
| #include "asterisk.h"
 | |
| 
 | |
| /*
 | |
|  * 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 ;-) 
 | |
|  *
 | |
|  */
 | |
| 
 | |
| 
 | |
| struct ast_context;
 | |
| 
 | |
| struct ast_pbx {
 | |
| 	int dtimeout;					/* Timeout between digits (seconds) */
 | |
| 	int rtimeout;					/* Timeout for response (seconds) */
 | |
| };
 | |
| 
 | |
| /* An extension */
 | |
| struct ast_exten {
 | |
| 	char exten[AST_MAX_EXTENSION];
 | |
| 	int matchcid;
 | |
| 	char cidmatch[AST_MAX_EXTENSION];
 | |
| 	int priority;
 | |
| 	/* An extension */
 | |
| 	struct ast_context *parent;
 | |
| 	/* Application to execute */
 | |
| 	char app[AST_MAX_EXTENSION];
 | |
| 	/* Data to use */
 | |
| 	void *data;
 | |
| 	/* Data destructor */
 | |
| 	void (*datad)(void *);
 | |
| 	/* Next higher priority with our extension */
 | |
| 	struct ast_exten *peer;
 | |
| 	/* Registrar */
 | |
| 	char *registrar;
 | |
| 	/* Extension with a greater ID */
 | |
| 	struct ast_exten *next;
 | |
| };
 | |
| 
 | |
| struct ast_include {
 | |
| 	char name[AST_MAX_EXTENSION];
 | |
| 	char rname[AST_MAX_EXTENSION];
 | |
| 	char *registrar;
 | |
| 	int hastime;
 | |
| 	unsigned int monthmask;
 | |
| 	unsigned int daymask;
 | |
| 	unsigned int dowmask;
 | |
| 	unsigned int minmask[24];
 | |
| 	struct ast_include *next;
 | |
| };
 | |
| 
 | |
| struct ast_sw {
 | |
| 	char name[AST_MAX_EXTENSION];
 | |
| 	char *registrar;
 | |
| 	char data[AST_MAX_EXTENSION];
 | |
| 	struct ast_sw *next;
 | |
| };
 | |
| 
 | |
| struct ast_ignorepat {
 | |
| 	char pattern[AST_MAX_EXTENSION];
 | |
| 	char *registrar;
 | |
| 	struct ast_ignorepat *next;
 | |
| };
 | |
| 
 | |
| /* An extension context */
 | |
| struct ast_context {
 | |
| 	/* Name of the context */
 | |
| 	char name[AST_MAX_EXTENSION];
 | |
| 	/* A lock to prevent multiple threads from clobbering the context */
 | |
| 	pthread_mutex_t lock;
 | |
| 	/* The root of the list of extensions */
 | |
| 	struct ast_exten *root;
 | |
| 	/* Link them together */
 | |
| 	struct ast_context *next;
 | |
| 	/* Include other contexts */
 | |
| 	struct ast_include *includes;
 | |
| 	/* Patterns for which to continue playing dialtone */
 | |
| 	struct ast_ignorepat *ignorepats;
 | |
| 	/* Registrar */
 | |
| 	char *registrar;
 | |
| 	/* Alternative switches */
 | |
| 	struct ast_sw *alts;
 | |
| };
 | |
| 
 | |
| 
 | |
| /* An application */
 | |
| struct ast_app {
 | |
| 	/* Name of the application */
 | |
| 	char name[AST_MAX_APP];
 | |
| 	int (*execute)(struct ast_channel *chan, void *data);
 | |
| 	char *synopsis;
 | |
| 	char *description;
 | |
| 	struct ast_app *next;
 | |
| };
 | |
| 
 | |
| /* An extension state notify */
 | |
| struct ast_state_cb {
 | |
|     int id;
 | |
|     void *data;
 | |
|     ast_state_cb_type callback;
 | |
|     struct ast_state_cb *next;
 | |
| };
 | |
| 	    
 | |
| struct ast_hint {
 | |
|     struct ast_exten *exten;
 | |
|     int laststate; 
 | |
|     struct ast_state_cb *callbacks;
 | |
|     struct ast_hint *next;
 | |
| };
 | |
| 
 | |
| 
 | |
| static int pbx_builtin_prefix(struct ast_channel *, void *);
 | |
| static int pbx_builtin_stripmsd(struct ast_channel *, void *);
 | |
| 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_dtimeout(struct ast_channel *, void *);
 | |
| static int pbx_builtin_rtimeout(struct ast_channel *, void *);
 | |
| static int pbx_builtin_atimeout(struct ast_channel *, void *);
 | |
| static int pbx_builtin_wait(struct ast_channel *, void *);
 | |
| static int pbx_builtin_setlanguage(struct ast_channel *, void *);
 | |
| static int pbx_builtin_ringing(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_setvar(struct ast_channel *, void *);
 | |
| static int pbx_builtin_setglobalvar(struct ast_channel *, void *);
 | |
| static int pbx_builtin_noop(struct ast_channel *, void *);
 | |
| static int pbx_builtin_gotoif(struct ast_channel *, void *);
 | |
| void pbx_builtin_setvar_helper(struct ast_channel *chan, char *name, char *value);
 | |
| char *pbx_builtin_getvar_helper(struct ast_channel *chan, char *name);
 | |
| 
 | |
| static struct varshead globals = AST_LIST_HEAD_INITIALIZER(varshead);
 | |
| 
 | |
| 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(): If the channel is ringing, answer it, otherwise do nothing. \n"
 | |
| "Returns 0 unless it tries to answer the channel and fails.\n"   },
 | |
| 
 | |
| 	{ "Goto", pbx_builtin_goto, 
 | |
| "Goto a particular priority, extension, or context",
 | |
| "  Goto([[context|]extension|]priority):  Set the  priority to the specified\n"
 | |
| "value, optionally setting the extension and optionally the context as well.\n"
 | |
| "The extension BYEXTENSION is special in that it uses the current extension,\n"
 | |
| "thus  permitting  you  to go to a different  context, without  specifying a\n"
 | |
| "specific extension. Always returns 0, even if the given context, extension,\n"
 | |
| "or priority is invalid.\n" },
 | |
| 
 | |
| 	{ "Hangup", pbx_builtin_hangup,
 | |
| "Unconditional hangup",
 | |
| "  Hangup(): Unconditionally hangs up a given channel by returning -1 always.\n" },
 | |
| 
 | |
| 	{ "DigitTimeout", pbx_builtin_dtimeout,
 | |
| "Set maximum timeout between digits",
 | |
| "  DigitTimeout(seconds): Set the  maximum  amount of time permitted between\n"
 | |
| "digits when the user is typing in an extension.  When this timeout expires,\n"
 | |
| "after the user has started to  type  in an extension, the extension will be\n"
 | |
| "considered  complete, and  will be interpreted.  Note that if an  extension\n"
 | |
| "typed in is valid, it will not have to timeout to be tested,  so  typically\n"
 | |
| "at  the  expiry of  this timeout, the  extension will be considered invalid\n"
 | |
| "(and  thus  control  would be passed to the 'i' extension, or if it doesn't\n"
 | |
| "exist the call would be terminated).  Always returns 0.\n" },
 | |
| 
 | |
| 	{ "ResponseTimeout", pbx_builtin_rtimeout,
 | |
| "Set maximum timeout awaiting response",
 | |
| "  ResponseTimeout(seconds): Set the maximum amount of time permitted after\n"
 | |
| "falling through a series of priorities for a channel in which the user may\n"
 | |
| "begin typing an extension.  If the user does not type an extension in this\n"
 | |
| "amount of time, control will pass to the 't' extension if  it  exists, and\n"
 | |
| "if not the call would be terminated.  Always returns 0.\n"  },
 | |
| 
 | |
| 	{ "AbsoluteTimeout", pbx_builtin_atimeout,
 | |
| "Set absolute maximum time of call",
 | |
| "  AbsoluteTimeout(seconds): Set the absolute maximum amount of time permitted\n"
 | |
| "for a call.  A setting of 0 disables the timeout.  Always returns 0.\n" },
 | |
| 
 | |
| 	{ "BackGround", pbx_builtin_background,
 | |
| "Play a file while awaiting extension",
 | |
| "  Background(filename): Plays a given file, while simultaneously waiting for\n"
 | |
| "the user to begin typing an extension. The  timeouts  do not count until the\n"
 | |
| "last BackGround application as ended. Always returns 0.\n" },
 | |
| 
 | |
| 	{ "Wait", pbx_builtin_wait, 
 | |
| "Waits for some time", 
 | |
| "  Wait(seconds): Waits for a specified number of seconds, then returns 0.\n" },
 | |
| 
 | |
| 	{ "StripMSD", pbx_builtin_stripmsd,
 | |
| "Strip leading digits",
 | |
| "  StripMSD(count): Strips the leading  'count'  digits  from  the  channel's\n"
 | |
| "associated extension. For example, the  number  5551212 when stripped with a\n"
 | |
| "count of 3 would be changed to 1212.  This app always returns 0, and the PBX\n"
 | |
| "will continue processing at the next priority for the *new* extension.\n"
 | |
| "  So, for  example, if  priority 3 of 5551212  is  StripMSD 3, the next step\n"
 | |
| "executed will be priority 4 of 1212.  If you switch into an  extension which\n"
 | |
| "has no first step, the PBX will treat it as though the user dialed an\n"
 | |
| "invalid extension.\n" },
 | |
| 
 | |
| 	{ "Prefix", pbx_builtin_prefix, 
 | |
| "Prepend leading digits",
 | |
| "  Prefix(digits): Prepends the  digit  string  specified  by  digits to the\n"
 | |
| "channel's associated extension. For example, the number 1212 when  prefixed\n"
 | |
| "with '555' will become 5551212. This app always returns 0, and the PBX will\n"
 | |
| "continue processing at the next priority for the *new* extension.\n"
 | |
| "  So, for example, if priority  3  of 1212 is  Prefix  555, the  next  step\n"
 | |
| "executed will be priority 4 of 5551212. If  you  switch  into an  extension\n"
 | |
| "which has no first step, the PBX will treat it as though the user dialed an\n"
 | |
| "invalid extension.\n" },
 | |
| 
 | |
| 	{ "SetLanguage", pbx_builtin_setlanguage,
 | |
| "Sets user language",
 | |
| "  SetLanguage(language):  Set  the  channel  language to 'language'.  This\n"
 | |
| "information is used for the generation of numbers, and to select a natural\n"
 | |
| "language file when available.  For example, if language is set to 'fr' and\n"
 | |
| "the file 'demo-congrats' is requested  to  be  played,  if the file 'demo-\n"
 | |
| "congrats-fr' exists, then it will play that file, and if not will play the\n"
 | |
| "normal 'demo-congrats'. Always returns 0.\n"  },
 | |
| 
 | |
| 	{ "Ringing", pbx_builtin_ringing,
 | |
| "Indicate ringing tone",
 | |
| "  Ringing(): Request that the channel indicate ringing tone to the user.\n"
 | |
| "Always returns 0.\n" },
 | |
| 
 | |
| 	{ "Congestion", pbx_builtin_congestion,
 | |
| "Indicate congestion and stop",
 | |
| "  Congestion(): Requests that the channel indicate congestion and then\n"
 | |
| "waits for the user to hang up.  Always returns -1." },
 | |
| 
 | |
| 	{ "Busy", pbx_builtin_busy,
 | |
| "Indicate busy condition and stop",
 | |
| "  Busy(): Requests that the channel indicate busy condition and then waits\n"
 | |
| "for the user to hang up.  Always returns -1." },
 | |
| 
 | |
| 	{ "SetVar", pbx_builtin_setvar,
 | |
| "Set variable to value",
 | |
| "  Setvar(#n=value): Sets variable n to value" },
 | |
| 
 | |
| 	{ "SetGlobalVar", pbx_builtin_setglobalvar,
 | |
| "Set variable to value",
 | |
| "  Setvar(#n=value): Sets global variable n to value" },
 | |
| 
 | |
| 	{ "NoOp", pbx_builtin_noop,
 | |
| "No operation",
 | |
| "  NoOp(): No-operation; Does nothing." },
 | |
| 
 | |
| 	{ "GotoIf", pbx_builtin_gotoif,
 | |
| "Conditional goto",
 | |
| "  GotoIf(Condition?label1:label2): Go to label 1 if condition is\n"
 | |
| "true, to label2 if condition is false. Either label1 or label2 may be\n"
 | |
| "omitted (in that case, we just don't take the particular branch) but not\n"
 | |
| "both.  Look for the condition syntax in examples or documentation." },
 | |
| 
 | |
| };
 | |
| 
 | |
| /* Lock for the application list */
 | |
| static pthread_mutex_t applock = AST_MUTEX_INITIALIZER;
 | |
| static struct ast_context *contexts = NULL;
 | |
| /* Lock for the ast_context list */
 | |
| static pthread_mutex_t conlock = AST_MUTEX_INITIALIZER;
 | |
| static struct ast_app *apps = NULL;
 | |
| 
 | |
| /* Lock for switches */
 | |
| static pthread_mutex_t switchlock = AST_MUTEX_INITIALIZER;
 | |
| struct ast_switch *switches = NULL;
 | |
| 
 | |
| /* Lock for extension state notifys */
 | |
| static pthread_mutex_t hintlock = AST_MUTEX_INITIALIZER;
 | |
| static int stateid = 1;
 | |
| struct ast_hint *hints = NULL;
 | |
| struct ast_state_cb *statecbs = NULL;
 | |
| 
 | |
| int pbx_exec(struct ast_channel *c, /* Channel */
 | |
| 					struct ast_app *app,
 | |
| 					void *data,				/* Data for execution */
 | |
| 					int newstack)			/* Force stack increment */
 | |
| {
 | |
| 	/* 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 res;
 | |
| 	int stack = c->stack;
 | |
| 	int (*execute)(struct ast_channel *chan, void *data) = app->execute; 
 | |
| 	if (newstack && stack > AST_CHANNEL_MAX_STACK - 2) {
 | |
| 		/* Don't allow us to go over the max number of stacks we
 | |
| 		   permit saving. */
 | |
| 		ast_log(LOG_WARNING, "Stack overflow, cannot create another stack\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	if (newstack && (res = setjmp(c->jmp[++c->stack]))) {
 | |
| 		/* Okay, here's where it gets weird.  If newstack is non-zero, 
 | |
| 		   then we increase the stack increment, but setjmp is not going
 | |
| 		   to return until longjmp is called -- when the application
 | |
| 		   exec'd is finished running. */
 | |
| 		if (res == 1)
 | |
| 			res = 0;
 | |
| 		if (c->stack != stack + 1) 
 | |
| 			ast_log(LOG_WARNING, "Stack returned to an unexpected place!\n");
 | |
| 		else if (c->app[c->stack])
 | |
| 			ast_log(LOG_WARNING, "Application may have forgotten to free its memory\n");
 | |
| 		c->stack = stack;
 | |
| 		return res;
 | |
| 	} else {
 | |
| 		if (c->cdr)
 | |
| 			ast_cdr_setapp(c->cdr, app->name, data);
 | |
| 		c->appl = app->name;
 | |
| 		c->data = data;		
 | |
| 		res = execute(c, data);
 | |
| 		c->appl = NULL;
 | |
| 		c->data = NULL;		
 | |
| 		/* Any application that returns, we longjmp back, just in case. */
 | |
| 		if (c->stack != stack + 1)
 | |
| 			ast_log(LOG_WARNING, "Stack is not at expected value\n");
 | |
| 		longjmp(c->jmp[stack+1], res);
 | |
| 		/* Never returns */
 | |
| 	}
 | |
| }
 | |
| 
 | |
| 
 | |
| /* Go no deeper than this through includes (not counting loops) */
 | |
| #define AST_PBX_MAX_STACK	64
 | |
| 
 | |
| #define HELPER_EXISTS 0
 | |
| #define HELPER_SPAWN 1
 | |
| #define HELPER_EXEC 2
 | |
| #define HELPER_CANMATCH 3
 | |
| #define HELPER_MATCHMORE 4
 | |
| 
 | |
| struct ast_app *pbx_findapp(char *app) 
 | |
| {
 | |
| 	struct ast_app *tmp;
 | |
| 	if (ast_pthread_mutex_lock(&applock)) {
 | |
| 		ast_log(LOG_WARNING, "Unable to obtain application lock\n");
 | |
| 		return NULL;
 | |
| 	}
 | |
| 	tmp = apps;
 | |
| 	while(tmp) {
 | |
| 		if (!strcasecmp(tmp->name, app))
 | |
| 			break;
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	ast_pthread_mutex_unlock(&applock);
 | |
| 	return tmp;
 | |
| }
 | |
| 
 | |
| static struct ast_switch *pbx_findswitch(char *sw)
 | |
| {
 | |
| 	struct ast_switch *asw;
 | |
| 	if (ast_pthread_mutex_lock(&switchlock)) {
 | |
| 		ast_log(LOG_WARNING, "Unable to obtain application lock\n");
 | |
| 		return NULL;
 | |
| 	}
 | |
| 	asw = switches;
 | |
| 	while(asw) {
 | |
| 		if (!strcasecmp(asw->name, sw))
 | |
| 			break;
 | |
| 		asw = asw->next;
 | |
| 	}
 | |
| 	ast_pthread_mutex_unlock(&switchlock);
 | |
| 	return asw;
 | |
| }
 | |
| 
 | |
| static inline int include_valid(struct ast_include *i)
 | |
| {
 | |
| 	struct tm tm;
 | |
| 	time_t t;
 | |
| 	if (!i->hastime)
 | |
| 		return 1;
 | |
| 	time(&t);
 | |
| 	localtime_r(&t,&tm);
 | |
| 	if (!&tm) {
 | |
| 		ast_log(LOG_WARNING, "Failed to get local time\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 
 | |
| 	/* If it's not the right month, return */
 | |
| 	if (!(i->monthmask & (1 << tm.tm_mon))) {
 | |
| 		return 0;
 | |
| 	}
 | |
| 
 | |
| 	/* If it's not that time of the month.... */
 | |
| 	/* Warning, tm_mday has range 1..31! */
 | |
| 	if (!(i->daymask & (1 << (tm.tm_mday-1))))
 | |
| 		return 0;
 | |
| 
 | |
| 	/* If it's not the right day of the week */
 | |
| 	if (!(i->dowmask & (1 << tm.tm_wday)))
 | |
| 		return 0;
 | |
| 
 | |
| 	/* Sanity check the hour just to be safe */
 | |
| 	if ((tm.tm_hour < 0) || (tm.tm_hour > 23)) {
 | |
| 		ast_log(LOG_WARNING, "Insane time...\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 
 | |
| 	/* Now the tough part, we calculate if it fits
 | |
| 	   in the right time based on min/hour */
 | |
| 	if (!(i->minmask[tm.tm_hour] & (1 << (tm.tm_min / 2))))
 | |
| 		return 0;
 | |
| 
 | |
| 	/* If we got this far, then we're good */
 | |
| 	return 1;
 | |
| }
 | |
| 
 | |
| static void pbx_destroy(struct ast_pbx *p)
 | |
| {
 | |
| 	free(p);
 | |
| }
 | |
| 
 | |
| #define EXTENSION_MATCH_CORE(data,pattern,match) {\
 | |
| 	/* All patterns begin with _ */\
 | |
| 	if (pattern[0] != '_') \
 | |
| 		return 0;\
 | |
| 	/* Start optimistic */\
 | |
| 	match=1;\
 | |
| 	pattern++;\
 | |
| 	while(match && *data && *pattern && (*pattern != '/')) {\
 | |
| 		switch(toupper(*pattern)) {\
 | |
| 		case '[': \
 | |
| 		{\
 | |
| 			int i,border=0;\
 | |
| 			char *where;\
 | |
| 			match=0;\
 | |
| 			pattern++;\
 | |
| 			where=strchr(pattern,']');\
 | |
| 			if (where)\
 | |
| 				border=(int)(where-pattern);\
 | |
| 			if (!where || border > strlen(pattern)) {\
 | |
| 				ast_log(LOG_WARNING, "Wrong usage of [] in the extension\n");\
 | |
| 				return match;\
 | |
| 			}\
 | |
| 			for (i=0; i<border; i++) {\
 | |
| 				int res=0;\
 | |
| 				if (i+2<border)\
 | |
| 					if (pattern[i+1]=='-') {\
 | |
| 						if (*data >= pattern[i] && *data <= pattern[i+2]) {\
 | |
| 							res=1;\
 | |
| 						} else {\
 | |
| 							i+=2;\
 | |
| 							continue;\
 | |
| 						}\
 | |
| 					}\
 | |
| 				if (res==1 || *data==pattern[i]) {\
 | |
| 					match = 1;\
 | |
| 					break;\
 | |
| 				}\
 | |
| 			}\
 | |
| 			pattern+=border;\
 | |
| 			break;\
 | |
| 		}\
 | |
| 		case 'N':\
 | |
| 			if ((*data < '2') || (*data > '9'))\
 | |
| 				match=0;\
 | |
| 			break;\
 | |
| 		case 'X':\
 | |
| 			if ((*data < '0') || (*data > '9'))\
 | |
| 				match = 0;\
 | |
| 			break;\
 | |
| 		case 'Z':\
 | |
| 			if ((*data < '1') || (*data > '9'))\
 | |
| 				match = 0;\
 | |
| 			break;\
 | |
| 		case '.':\
 | |
| 			/* Must match */\
 | |
| 			return 1;\
 | |
| 		case ' ':\
 | |
| 		case '-':\
 | |
| 			/* Ignore these characters */\
 | |
| 			data--;\
 | |
| 			break;\
 | |
| 		default:\
 | |
| 			if (*data != *pattern)\
 | |
| 				match =0;\
 | |
| 		}\
 | |
| 		data++;\
 | |
| 		pattern++;\
 | |
| 	}\
 | |
| }
 | |
| 
 | |
| int ast_extension_match(char *pattern, char *data)
 | |
| {
 | |
| 	int match;
 | |
| 	/* If they're the same return */
 | |
| 	if (!strcmp(pattern, data))
 | |
| 		return 1;
 | |
| 	EXTENSION_MATCH_CORE(data,pattern,match);
 | |
| 	/* Must be at the end of both */
 | |
| 	if (*data || (*pattern && (*pattern != '/')))
 | |
| 		match = 0;
 | |
| 	return match;
 | |
| }
 | |
| 
 | |
| static int extension_close(char *pattern, char *data, int needmore)
 | |
| {
 | |
| 	int match;
 | |
| 	/* If "data" is longer, it can'be a subset of pattern unless
 | |
| 	   pattern is a pattern match */
 | |
| 	if ((strlen(pattern) < strlen(data)) && (pattern[0] != '_'))
 | |
| 		return 0;
 | |
| 	
 | |
| 	if ((!strlen((char *)data) || !strncasecmp(pattern, data, strlen(data))) && 
 | |
| 		(!needmore || (strlen(pattern) > strlen(data)))) {
 | |
| 		return 1;
 | |
| 	}
 | |
| 	EXTENSION_MATCH_CORE(data,pattern,match);
 | |
| 	/* If there's more or we don't care about more, return non-zero, otlherwise it's a miss */
 | |
| 	if (!needmore || *pattern) {
 | |
| 		return match;
 | |
| 	} else
 | |
| 		return 0;
 | |
| }
 | |
| 
 | |
| struct ast_context *ast_context_find(char *name)
 | |
| {
 | |
| 	struct ast_context *tmp;
 | |
| 	ast_pthread_mutex_lock(&conlock);
 | |
| 	if (name) {
 | |
| 		tmp = contexts;
 | |
| 		while(tmp) {
 | |
| 			if (!strcasecmp(name, tmp->name))
 | |
| 				break;
 | |
| 			tmp = tmp->next;
 | |
| 		}
 | |
| 	} else
 | |
| 		tmp = contexts;
 | |
| 	ast_pthread_mutex_unlock(&conlock);
 | |
| 	return tmp;
 | |
| }
 | |
| 
 | |
| #define STATUS_NO_CONTEXT   1
 | |
| #define STATUS_NO_EXTENSION 2
 | |
| #define STATUS_NO_PRIORITY  3
 | |
| #define STATUS_SUCCESS	    4
 | |
| 
 | |
| static int matchcid(char *cidpattern, char *callerid)
 | |
| {
 | |
| 	char tmp[AST_MAX_EXTENSION];
 | |
| 	int failresult;
 | |
| 	char *name, *num;
 | |
| 	
 | |
| 	/* If the Caller*ID pattern is empty, then we're matching NO Caller*ID, so
 | |
| 	   failing to get a number should count as a match, otherwise not */
 | |
| 
 | |
| 
 | |
| 	if (strlen(cidpattern))
 | |
| 		failresult = 0;
 | |
| 	else
 | |
| 		failresult = 1;
 | |
| 
 | |
| 	if (!callerid)
 | |
| 		return failresult;
 | |
| 
 | |
| 	/* Copy original Caller*ID */
 | |
| 	strncpy(tmp, callerid, sizeof(tmp)-1);
 | |
| 	/* Parse Number */
 | |
| 	if (ast_callerid_parse(tmp, &name, &num)) 
 | |
| 		return failresult;
 | |
| 	if (!num)
 | |
| 		return failresult;
 | |
| 	ast_shrink_phone_number(num);
 | |
| 	return ast_extension_match(cidpattern, num);
 | |
| }
 | |
| 
 | |
| static struct ast_exten *pbx_find_extension(struct ast_channel *chan, char *context, char *exten, int priority, char *callerid, int action, char *incstack[], int *stacklen, int *status, struct ast_switch **swo, char **data)
 | |
| {
 | |
| 	int x, res;
 | |
| 	struct ast_context *tmp;
 | |
| 	struct ast_exten *e, *eroot;
 | |
| 	struct ast_include *i;
 | |
| 	struct ast_sw *sw;
 | |
| 	struct ast_switch *asw;
 | |
| 	/* Initialize status if appropriate */
 | |
| 	if (!*stacklen) {
 | |
| 		*status = STATUS_NO_CONTEXT;
 | |
| 		*swo = NULL;
 | |
| 		*data = NULL;
 | |
| 	}
 | |
| 	/* Check for stack overflow */
 | |
| 	if (*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<*stacklen;x++) {
 | |
| 		if (!strcasecmp(incstack[x], context))
 | |
| 			return NULL;
 | |
| 	}
 | |
| 	tmp = contexts;
 | |
| 	while(tmp) {
 | |
| 		/* Match context */
 | |
| 		if (!strcmp(tmp->name, context)) {
 | |
| 			if (*status < STATUS_NO_EXTENSION)
 | |
| 				*status = STATUS_NO_EXTENSION;
 | |
| 			eroot = tmp->root;
 | |
| 			while(eroot) {
 | |
| 				/* Match extension */
 | |
| 				if ((((action != HELPER_MATCHMORE) && ast_extension_match(eroot->exten, exten)) ||
 | |
| 						((action == HELPER_CANMATCH) && (extension_close(eroot->exten, exten, 0))) ||
 | |
| 						((action == HELPER_MATCHMORE) && (extension_close(eroot->exten, exten, 1)))) &&
 | |
| 						(!eroot->matchcid || matchcid(eroot->cidmatch, callerid))) {
 | |
| 						e = eroot;
 | |
| 						if (*status < STATUS_NO_PRIORITY)
 | |
| 							*status = STATUS_NO_PRIORITY;
 | |
| 						while(e) {
 | |
| 							/* Match priority */
 | |
| 							if (e->priority == priority) {
 | |
| 								*status = STATUS_SUCCESS;
 | |
| 								return e;
 | |
| 							}
 | |
| 							e = e->peer;
 | |
| 						}
 | |
| 				}
 | |
| 				eroot = eroot->next;
 | |
| 			}
 | |
| 			/* Check alternative switches */
 | |
| 			sw = tmp->alts;
 | |
| 			while(sw) {
 | |
| 				if ((asw = pbx_findswitch(sw->name))) {
 | |
| 					if (action == HELPER_CANMATCH)
 | |
| 						res = asw->canmatch ? asw->canmatch(chan, context, exten, priority, callerid, sw->data) : 0;
 | |
| 					else if (action == HELPER_MATCHMORE)
 | |
| 						res = asw->matchmore ? asw->matchmore(chan, context, exten, priority, callerid, sw->data) : 0;
 | |
| 					else
 | |
| 						res = asw->exists ? asw->exists(chan, context, exten, priority, callerid, sw->data) : 0;
 | |
| 					if (res) {
 | |
| 						/* Got a match */
 | |
| 						*swo = asw;
 | |
| 						*data = sw->data;
 | |
| 						return NULL;
 | |
| 					}
 | |
| 				} else {
 | |
| 					ast_log(LOG_WARNING, "No such switch '%s'\n", sw->name);
 | |
| 				}
 | |
| 				sw = sw->next;
 | |
| 			}
 | |
| 			/* Setup the stack */
 | |
| 			incstack[*stacklen] = tmp->name;
 | |
| 			(*stacklen)++;
 | |
| 			/* Now try any includes we have in this context */
 | |
| 			i = tmp->includes;
 | |
| 			while(i) {
 | |
| 				if (include_valid(i)) {
 | |
| 					if ((e = pbx_find_extension(chan, i->rname, exten, priority, callerid, action, incstack, stacklen, status, swo, data))) 
 | |
| 						return e;
 | |
| 					if (*swo) 
 | |
| 						return NULL;
 | |
| 				}
 | |
| 				i = i->next;
 | |
| 			}
 | |
| 		}
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| static void pbx_substitute_variables_temp(struct ast_channel *c,char *cp3,char **cp4, char *workspace, int workspacelen)
 | |
| {
 | |
| 	char *first,*second;
 | |
| 	int offset,offset2;
 | |
| 	struct ast_var_t *variables;
 | |
| 	char *name, *num; /* for callerid name + num variables */
 | |
| 	struct varshead *headp;
 | |
|         headp=&c->varshead;
 | |
|         *cp4=NULL;
 | |
|         /* Now we have the variable name on cp3 */
 | |
| 	if ((first=strchr(cp3,':'))) {
 | |
| 		*first='\0';
 | |
| 		pbx_substitute_variables_temp(c,cp3,cp4,workspace,workspacelen);
 | |
| 		if (!(*cp4)) return;
 | |
| 		offset=atoi(first+1);
 | |
| 	 	if ((second=strchr(first+1,':'))) {
 | |
| 			*second='\0';
 | |
| 			offset2=atoi(second+1);
 | |
| 		} else
 | |
| 			offset2=strlen(*cp4)-offset;
 | |
| 		if (abs(offset)>strlen(*cp4)) {
 | |
| 			if (offset>=0) offset=strlen(*cp4);
 | |
| 			else offset=-strlen(*cp4);
 | |
| 		}
 | |
| 		if ((offset<0 && offset2>-offset) || (offset>=0 && offset+offset2>strlen(*cp4))) {
 | |
| 			if (offset>=0) offset2=strlen(*cp4)-offset;
 | |
| 			else offset2=strlen(*cp4)+offset;
 | |
| 		}
 | |
| 		if (offset>=0)
 | |
| 			*cp4+=offset;
 | |
| 		else
 | |
| 			*cp4+=strlen(*cp4)+offset;
 | |
| 		(*cp4)[offset2] = '\0';
 | |
| 	} else if (!strcmp(cp3, "CALLERIDNUM")) {
 | |
| 		if (c->callerid)
 | |
| 			strncpy(workspace, c->callerid, workspacelen - 1);
 | |
| 		ast_callerid_parse(workspace, &name, &num);
 | |
| 		if (num) {
 | |
| 			ast_shrink_phone_number(num);
 | |
| 			*cp4 = num;
 | |
| 		} else
 | |
| 			*cp4 = "";
 | |
| 	} else if (!strcmp(cp3, "CALLERIDNAME")) {
 | |
| 		if (c->callerid)
 | |
| 			strncpy(workspace, c->callerid, workspacelen - 1);
 | |
| 		ast_callerid_parse(workspace, &name, &num);
 | |
| 		if (name)
 | |
| 			*cp4 = name;
 | |
| 		else
 | |
| 			*cp4 = "";
 | |
| 	} else if (!strcmp(cp3, "CALLERID")) {
 | |
| 		*cp4 = c->callerid;
 | |
| 		if (!(*cp4))
 | |
| 			*cp4 = "";
 | |
| 	} else if (!strcmp(cp3, "HINT")) {
 | |
| 		if (!ast_get_hint(workspace, workspacelen - 1, c, c->context, c->exten))
 | |
| 			*cp4 = "";
 | |
| 		else
 | |
| 			*cp4 = workspace;
 | |
| 	} else if (!strcmp(cp3, "EXTEN")) {
 | |
| 		*cp4 = c->exten;
 | |
| 	} else if (!strncmp(cp3, "EXTEN-", strlen("EXTEN-")) && 
 | |
| 		/* XXX Remove me eventually */
 | |
| 		(sscanf(cp3 + strlen("EXTEN-"), "%d", &offset) == 1)) {
 | |
| 		if (offset < 0)
 | |
| 			offset=0;
 | |
| 		if (offset > strlen(c->exten))
 | |
| 			offset = strlen(c->exten);
 | |
| 		*cp4 = c->exten + offset;
 | |
| 		ast_log(LOG_WARNING, "The use of 'EXTEN-foo' has been derprecated in favor of 'EXTEN:foo'\n");
 | |
| #if 0
 | |
| 	} else if (!strncmp(cp3, "EXTEN:", strlen("EXTEN:")) && 
 | |
| 		(sscanf(cp3 + strlen("EXTEN:"), "%d", &offset) == 1)) {
 | |
| 		if (offset < 0)
 | |
| 			offset=0;
 | |
| 		if (offset > strlen(c->exten))
 | |
| 			offset = strlen(c->exten);
 | |
| 		*cp4 = c->exten + offset;
 | |
| #endif
 | |
| 	} else if (!strcmp(cp3, "RDNIS")) {
 | |
| 		*cp4 = c->rdnis;
 | |
| 		if (!(*cp4))
 | |
| 			*cp4 = "";
 | |
| 	} else if (!strcmp(cp3, "CONTEXT")) {
 | |
| 		*cp4 = c->context;
 | |
| 	} else if (!strcmp(cp3, "PRIORITY")) {
 | |
| 		snprintf(workspace, workspacelen, "%d", c->priority);
 | |
| 		*cp4 = workspace;
 | |
| 	} else if (!strcmp(cp3, "CHANNEL")) {
 | |
| 		*cp4 = c->name;
 | |
| 	} else {
 | |
| 		AST_LIST_TRAVERSE(headp,variables,entries) {
 | |
| #if 0
 | |
| 			ast_log(LOG_WARNING,"Comparing variable '%s' with '%s'\n",cp3,ast_var_name(variables));
 | |
| #endif
 | |
| 			if (strcasecmp(ast_var_name(variables),cp3)==0)
 | |
| 				*cp4=ast_var_value(variables);
 | |
| 		}
 | |
| 		if (!(*cp4)) {
 | |
| 			/* Try globals */
 | |
| 			AST_LIST_TRAVERSE(&globals,variables,entries) {
 | |
| #if 0
 | |
| 				ast_log(LOG_WARNING,"Comparing variable '%s' with '%s'\n",cp3,ast_var_name(variables));
 | |
| #endif
 | |
| 				if (strcasecmp(ast_var_name(variables),cp3)==0)
 | |
| 					*cp4=ast_var_value(variables);
 | |
| 			}
 | |
| 		}
 | |
| 		if (!(*cp4)) {
 | |
| 			int len=strlen(cp3);
 | |
| 			int len_env=strlen("ENV(");
 | |
| 			if (len > (len_env+1) && !strncasecmp(cp3,"ENV(",len_env) && !strcmp(cp3+len-1,")")) {
 | |
| 				cp3[len-1]='\0';
 | |
| 				*cp4=getenv(cp3+len_env);
 | |
| 			}
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| static void pbx_substitute_variables_helper(struct ast_channel *c,char *cp1,char **ecp2,int count)
 | |
| {
 | |
| 	char *cp4,*cp2;
 | |
| 	char *tmp,*wherearewe,*finish=NULL,*ltmp,*lval,*nextvar;
 | |
| 	int length,variables=0;
 | |
| 	char workspace[256];
 | |
| 
 | |
| 	wherearewe=tmp=cp1;
 | |
| 	cp2=*ecp2;
 | |
| 	*cp2='\0';
 | |
| 	do {
 | |
| 		char *start,*start2;
 | |
| 		if ((tmp=strstr(wherearewe,"${"))) {
 | |
| 			variables++;
 | |
| 			length=(int)(tmp-wherearewe);
 | |
| 			strncat(cp2,wherearewe,length);
 | |
| 			wherearewe=tmp;
 | |
| 			
 | |
| 			ltmp=malloc(sizeof(char)*256);
 | |
| 			start=start2=tmp+1;
 | |
| 			do {
 | |
| 				if (variables==0) {
 | |
| 					nextvar=strstr(start2,"${");
 | |
| 					if (nextvar) {
 | |
| 						if ((int)(finish-nextvar)>0) {
 | |
| 							variables++;
 | |
| 							start2=nextvar+1;
 | |
| 						} else break;
 | |
| 					} else break;
 | |
| 				}
 | |
| 				finish=strchr(start,'}');
 | |
| 				if (finish) {
 | |
| 					variables--;
 | |
| 					start=finish+1;
 | |
| 				} else {
 | |
| 					if (variables>0) {
 | |
| 						ast_log(LOG_NOTICE, "Error in extension logic\n");
 | |
| 						cp2[0]='\0';
 | |
| 						return;
 | |
| 					}
 | |
| 					break;
 | |
| 				}
 | |
| 			} while (1);
 | |
| 			
 | |
| 			length=(int)(finish-tmp);
 | |
| 			wherearewe+=length+1;
 | |
| 			lval=strndup(tmp+2,length-2);
 | |
| 			pbx_substitute_variables_helper(c,lval,<mp,count+1);
 | |
| 			free(lval);
 | |
| 			if (ltmp) {
 | |
| 				length=strlen(ltmp);
 | |
| 				strncat(cp2,ltmp,length);
 | |
| 			}
 | |
| 		} else {
 | |
| 			if (wherearewe!=cp1) {
 | |
| 				if (*wherearewe) {
 | |
| 					length=strlen(wherearewe);
 | |
| 					strncat(cp2,wherearewe,length);
 | |
| 				}
 | |
| 				strcat(cp2,"\0");
 | |
| 				
 | |
| 				cp1=cp2;
 | |
| 			}
 | |
| 			if (count) {			
 | |
| 				pbx_substitute_variables_temp(c,cp1,&cp4, workspace, sizeof(workspace));
 | |
| 				if (cp4) {
 | |
| 					/* reset output variable so we could store the result */
 | |
| 					*cp2='\0';
 | |
| 					length=strlen(cp4);
 | |
| 					strncat(cp2,cp4,length);
 | |
| 				} else
 | |
| 					cp2[0]='\0';
 | |
| 			}
 | |
| 			break;
 | |
| 		}
 | |
| 	} while(1);
 | |
| }
 | |
| 
 | |
| static void *pbx_substitute_variables(struct ast_channel *c, struct ast_exten *e) {
 | |
| 	char *cp1,*cp3,*cp4,*cp5;
 | |
| 	char *cp2;
 | |
| 	char c1,c2;
 | |
| 	int m,mve,origlen,quoted,dolsign,docopy;
 | |
|         
 | |
| 	/* No variables or expressions in e->data, so why scan it? */
 | |
| 	if (!strstr(e->data,"${") && !strstr(e->data,"$[")) {
 | |
| 		return strndup(e->data,strlen(e->data)+1);
 | |
| 	}
 | |
| 	
 | |
| 	cp1=e->data;
 | |
| 	cp2=malloc(sizeof(char)*256);
 | |
| 	pbx_substitute_variables_helper(c,cp1,(char **)&cp2,0);
 | |
| 
 | |
| 	/* Second stage, expression evaluation */
 | |
| 	if ((strstr(cp2,"$[")==NULL)) {
 | |
| 		/* No expressions in cp2, return it */
 | |
| 		return(cp2);
 | |
| 	}
 | |
| 	/* else, do expression evaluation */
 | |
| 	
 | |
| 	dolsign=0;
 | |
| 	docopy=1;
 | |
| 	origlen=strlen(cp2)+1;
 | |
| 	
 | |
| 	cp5=malloc(origlen);
 | |
| 	memset(cp5,0,origlen);
 | |
| 	cp4=NULL;
 | |
| 	cp1=cp2;
 | |
| 	quoted=0;
 | |
| 	
 | |
| 	do {
 | |
| 		c1=*cp1;
 | |
| 		mve=0;
 | |
| 	        switch (c1) {
 | |
| 	        	case '$' : 
 | |
| 	        		dolsign=1;
 | |
| 	        		docopy=0;
 | |
| 	        		break;
 | |
| 	        	case '[' :
 | |
| 	        		if (dolsign==0) {
 | |
| 	        			docopy=1;
 | |
| 	        			dolsign=0;
 | |
| 	        			break;
 | |
| 	        		}
 | |
| 	        		dolsign=0;
 | |
| 	        		docopy=0;
 | |
| 	        		m=0;
 | |
| 	        		mve=1;
 | |
| 	        		cp1++;
 | |
| 	        		
 | |
| 	        		while (((c2=*(cp1+m))!=']') && (c2!='\0')) {
 | |
| 	        			m++;
 | |
| 	        		}
 | |
| 	        		cp3=malloc(m+2);
 | |
| 	        		strncpy(cp3,cp1,m);
 | |
| 	        		cp3[m]='\0';
 | |
| 	        		cp1+=m;
 | |
| 	        		/* Now we have the expression to evaluate on cp3 */
 | |
| 	        		cp4=ast_expr(cp3);
 | |
| 	        		free(cp3);
 | |
| 	        		break;
 | |
| 	        	default :
 | |
| 	        		if (dolsign==1) {
 | |
| 	        			strncat((char *)cp5,"$",1);
 | |
| 	        		}
 | |
| 	        		dolsign=0;
 | |
| 	        		docopy=1;
 | |
| 	        		mve=0;
 | |
| 	        		break;
 | |
| 	        }
 | |
| 	        if (cp1!='\0') {
 | |
| 	        	if (mve==0) {
 | |
| 	        		if (docopy==1) {
 | |
| 		        		strncat((char *)cp5,&c1,1);
 | |
| 		        	}
 | |
| 	        	} else {
 | |
| 	        		if (cp4!=NULL) {
 | |
| 		        		cp5=realloc(cp5,origlen+strlen(cp4)+1);
 | |
| 		        		strncat((char *)cp5,cp4,strlen(cp4));
 | |
| 		        		free(cp4);
 | |
| 		        	} else {
 | |
| 		        		ast_log(LOG_WARNING,"mve!=0 and cp4=NULL, something gone astray\n");
 | |
| 		        	}
 | |
| 	        	}
 | |
| 	        }
 | |
| 	                
 | |
| 	} while (*cp1++!='\0');
 | |
| 	free(cp2);
 | |
| 	return(cp5);
 | |
| }
 | |
| 	        		
 | |
| 	        	
 | |
| 		                                                
 | |
| 
 | |
| static int pbx_extension_helper(struct ast_channel *c, char *context, char *exten, int priority, char *callerid, int action) 
 | |
| {
 | |
| 	struct ast_exten *e;
 | |
| 	struct ast_app *app;
 | |
| 	struct ast_switch *sw;
 | |
| 	char *data;
 | |
| 	char *newdata;
 | |
| 	int newstack = 0;
 | |
| 	int res;
 | |
| 	int status = 0;
 | |
| 	char *incstack[AST_PBX_MAX_STACK];
 | |
| 	int stacklen = 0;
 | |
| 	char tmp[80];
 | |
| 	char tmp2[80];
 | |
| 	char tmp3[256];
 | |
| 	if (ast_pthread_mutex_lock(&conlock)) {
 | |
| 		ast_log(LOG_WARNING, "Unable to obtain lock\n");
 | |
| 		if ((action == HELPER_EXISTS) || (action == HELPER_CANMATCH) || (action == HELPER_MATCHMORE))
 | |
| 			return 0;
 | |
| 		else
 | |
| 			return -1;
 | |
| 	}
 | |
| 	e = pbx_find_extension(c, context, exten, priority, callerid, action, incstack, &stacklen, &status, &sw, &data);
 | |
| 	if (e) {
 | |
| 		switch(action) {
 | |
| 		case HELPER_CANMATCH:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			return -1;
 | |
| 		case HELPER_EXISTS:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			return -1;
 | |
| 		case HELPER_MATCHMORE:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			return -1;
 | |
| 		case HELPER_SPAWN:
 | |
| 			newstack++;
 | |
| 			/* Fall through */
 | |
| 		case HELPER_EXEC:
 | |
| 			app = pbx_findapp(e->app);
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			if (app) {
 | |
| 				strncpy(c->context, context, sizeof(c->context-1));
 | |
| 				strncpy(c->exten, exten, sizeof(c->exten)-1);
 | |
| 				c->priority = priority;
 | |
| 				newdata=pbx_substitute_variables(c,e);
 | |
| 				if (option_debug)
 | |
| 						ast_log(LOG_DEBUG, "Launching '%s'\n", app->name);
 | |
| 				else if (option_verbose > 2)
 | |
| 						ast_verbose( VERBOSE_PREFIX_3 "Executing %s(\"%s\", \"%s\") %s\n", 
 | |
| 								term_color(tmp, app->name, COLOR_BRCYAN, 0, sizeof(tmp)),
 | |
| 								term_color(tmp2, c->name, COLOR_BRMAGENTA, 0, sizeof(tmp2)),
 | |
| 								term_color(tmp3, (newdata ? (char *)newdata : NULL), COLOR_BRMAGENTA, 0, sizeof(tmp3)),
 | |
| 								(newstack ? "in new stack" : "in same stack"));
 | |
| 				res = pbx_exec(c, app, newdata, newstack);
 | |
| 				free(newdata);
 | |
| 				return res;
 | |
| 			} else {
 | |
| 				ast_log(LOG_WARNING, "No application '%s' for extension (%s, %s, %d)\n", e->app, context, exten, priority);
 | |
| 				return -1;
 | |
| 			}
 | |
| 		default:
 | |
| 			ast_log(LOG_WARNING, "Huh (%d)?\n", action);			return -1;
 | |
| 		}
 | |
| 	} else if (sw) {
 | |
| 		switch(action) {
 | |
| 		case HELPER_CANMATCH:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			return -1;
 | |
| 		case HELPER_EXISTS:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			return -1;
 | |
| 		case HELPER_MATCHMORE:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			return -1;
 | |
| 		case HELPER_SPAWN:
 | |
| 			newstack++;
 | |
| 			/* Fall through */
 | |
| 		case HELPER_EXEC:
 | |
| 			pthread_mutex_unlock(&conlock);
 | |
| 			if (sw->exec)
 | |
| 				res = sw->exec(c, context, exten, priority, callerid, newstack, data);
 | |
| 			else {
 | |
| 				ast_log(LOG_WARNING, "No execution engine for switch %s\n", sw->name);
 | |
| 				res = -1;
 | |
| 			}
 | |
| 			return res;
 | |
| 		default:
 | |
| 			ast_log(LOG_WARNING, "Huh (%d)?\n", action);
 | |
| 			return -1;
 | |
| 		}
 | |
| 	} else {
 | |
| 		pthread_mutex_unlock(&conlock);
 | |
| 		switch(status) {
 | |
| 		case STATUS_NO_CONTEXT:
 | |
| 			if ((action != HELPER_EXISTS) && (action != HELPER_MATCHMORE))
 | |
| 				ast_log(LOG_NOTICE, "Cannot find extension context '%s'\n", context);
 | |
| 			break;
 | |
| 		case STATUS_NO_EXTENSION:
 | |
| 			if ((action != HELPER_EXISTS) && (action !=  HELPER_CANMATCH) && (action != HELPER_MATCHMORE))
 | |
| 				ast_log(LOG_NOTICE, "Cannot find extension '%s' in context '%s'\n", exten, context);
 | |
| 			break;
 | |
| 		case STATUS_NO_PRIORITY:
 | |
| 			if ((action != HELPER_EXISTS) && (action !=  HELPER_CANMATCH) && (action != HELPER_MATCHMORE))
 | |
| 				ast_log(LOG_NOTICE, "No such priority %d in extension '%s' in context '%s'\n", priority, exten, context);
 | |
| 			break;
 | |
| 		default:
 | |
| 			ast_log(LOG_DEBUG, "Shouldn't happen!\n");
 | |
| 		}
 | |
| 		if ((action != HELPER_EXISTS) && (action != HELPER_CANMATCH) && (action != HELPER_MATCHMORE))
 | |
| 			return -1;
 | |
| 		else
 | |
| 			return 0;
 | |
| 	}
 | |
| 
 | |
| }
 | |
| 
 | |
| static struct ast_exten *ast_hint_extension(struct ast_channel *c, char *context, char *exten)
 | |
| {
 | |
| 	struct ast_exten *e;
 | |
| 	struct ast_switch *sw;
 | |
| 	char *data;
 | |
| 	int status = 0;
 | |
| 	char *incstack[AST_PBX_MAX_STACK];
 | |
| 	int stacklen = 0;
 | |
| 
 | |
| 	if (ast_pthread_mutex_lock(&conlock)) {
 | |
| 		ast_log(LOG_WARNING, "Unable to obtain lock\n");
 | |
| 		return NULL;
 | |
| 	}
 | |
| 	e = pbx_find_extension(c, context, exten, PRIORITY_HINT, "", HELPER_EXISTS, incstack, &stacklen, &status, &sw, &data);
 | |
| 	ast_pthread_mutex_unlock(&conlock);	
 | |
| 	return e;
 | |
| }
 | |
| 
 | |
| static int ast_extension_state2(struct ast_exten *e)
 | |
| {
 | |
|     char hint[AST_MAX_EXTENSION] = "";    
 | |
|     char *cur, *rest;
 | |
|     int res = -1;
 | |
|     int allunavailable = 1, allbusy = 1, allfree = 1;
 | |
|     int busy = 0;
 | |
| 
 | |
|     strncpy(hint, ast_get_extension_app(e), sizeof(hint)-1);
 | |
|     
 | |
|     cur = hint;    
 | |
|     do {
 | |
| 	rest = strchr(cur, '&');
 | |
| 	if (rest) {
 | |
| 	    *rest = 0;
 | |
| 	    rest++;
 | |
| 	}
 | |
| 	
 | |
| 	res = ast_device_state(cur);
 | |
| 	switch (res) {
 | |
|     case AST_DEVICE_NOT_INUSE:
 | |
| 		allunavailable = 0;
 | |
| 		allbusy = 0;
 | |
| 		break;
 | |
|     case AST_DEVICE_INUSE:
 | |
| 		return AST_EXTENSION_INUSE;
 | |
|     case AST_DEVICE_BUSY:
 | |
| 		allunavailable = 0;
 | |
| 		allfree = 0;
 | |
| 		busy = 1;
 | |
| 		break;
 | |
|     case AST_DEVICE_UNAVAILABLE:
 | |
|     case AST_DEVICE_INVALID:
 | |
| 		allbusy = 0;
 | |
| 		allfree = 0;
 | |
| 		break;
 | |
|     default:
 | |
| 		allunavailable = 0;
 | |
| 		allbusy = 0;
 | |
| 		allfree = 0;
 | |
| 	}
 | |
|         cur = rest;
 | |
|     } while (cur);
 | |
| 
 | |
|     if (allfree)
 | |
| 		return AST_EXTENSION_NOT_INUSE;
 | |
|     if (allbusy)
 | |
| 		return AST_EXTENSION_BUSY;
 | |
|     if (allunavailable)
 | |
| 		return AST_EXTENSION_UNAVAILABLE;
 | |
|     if (busy) 
 | |
| 		return AST_EXTENSION_INUSE;
 | |
| 	
 | |
|     return AST_EXTENSION_NOT_INUSE;
 | |
| }
 | |
| 
 | |
| 
 | |
| int ast_extension_state(struct ast_channel *c, char *context, char *exten)
 | |
| {
 | |
|     struct ast_exten *e;
 | |
| 
 | |
|     e = ast_hint_extension(c, context, exten);    
 | |
|     if (!e) 
 | |
| 	return -1;
 | |
| 
 | |
|     return ast_extension_state2(e);    
 | |
| }
 | |
| 
 | |
| int ast_device_state_changed(const char *fmt, ...) 
 | |
| {
 | |
|     struct ast_hint *list;
 | |
|     struct ast_state_cb *cblist;
 | |
|     char hint[AST_MAX_EXTENSION];
 | |
|     char device[AST_MAX_EXTENSION];
 | |
|     char *cur, *rest;
 | |
|     int state;
 | |
|     
 | |
|     va_list ap;
 | |
| 
 | |
|     va_start(ap, fmt);
 | |
|     vsnprintf(device, sizeof(device)-1, fmt, ap);
 | |
|     va_end(ap);
 | |
| 
 | |
|     rest = strchr(device, '-');
 | |
|     if (rest) {
 | |
| 	*rest = 0;
 | |
|     }
 | |
|         
 | |
|     pthread_mutex_lock(&hintlock);
 | |
| 
 | |
|     list = hints;
 | |
|     
 | |
|     while (list) {
 | |
| 	
 | |
| 	strcpy(hint, ast_get_extension_app(list->exten));
 | |
| 	cur = hint;
 | |
| 	do {
 | |
| 	    rest = strchr(cur, '&');
 | |
| 	    if (rest) {
 | |
| 		*rest = 0;
 | |
| 		rest++;
 | |
| 	    }
 | |
| 	    
 | |
| 	    if (!strcmp(cur, device)) {
 | |
| 	    // Found extension execute callbacks 
 | |
| 		state = ast_extension_state2(list->exten);
 | |
| 		if ((state != -1) && (state != list->laststate)) {
 | |
| 		    // For general callbacks
 | |
| 		    cblist = statecbs;
 | |
| 		    while (cblist) {
 | |
| 			cblist->callback(list->exten->parent->name, list->exten->exten, state, cblist->data);
 | |
| 			cblist = cblist->next;
 | |
| 		    }
 | |
| 		    
 | |
| 		    // For extension callbacks
 | |
|     		    cblist = list->callbacks;
 | |
| 		    while (cblist) {
 | |
| 			cblist->callback(list->exten->parent->name, list->exten->exten, state, cblist->data);
 | |
| 			cblist = cblist->next;
 | |
| 		    }
 | |
| 		    
 | |
| 		    list->laststate = state;
 | |
| 		}
 | |
| 		break;
 | |
| 	    }
 | |
| 	    cur = rest;
 | |
| 	} while (cur);
 | |
| 	
 | |
| 	list = list->next;
 | |
|     }
 | |
| 
 | |
|     pthread_mutex_unlock(&hintlock);
 | |
|     return 1;
 | |
| }
 | |
| 			
 | |
| int ast_extension_state_add(char *context, char *exten, 
 | |
| 			    ast_state_cb_type callback, void *data)
 | |
| {
 | |
|     struct ast_hint *list;
 | |
|     struct ast_state_cb *cblist;
 | |
|     struct ast_exten *e;
 | |
| 
 | |
|     /* No context and extension add callback to statecbs list */
 | |
|     if (!context && !exten) {
 | |
| 	pthread_mutex_lock(&hintlock);
 | |
| 
 | |
| 	cblist = statecbs;
 | |
| 	while (cblist) {
 | |
| 	    if (cblist->callback == callback) {
 | |
| 		cblist->data = data;
 | |
| 		pthread_mutex_unlock(&hintlock);
 | |
| 	    }
 | |
| 	    
 | |
| 	    cblist = cblist->next;
 | |
| 	}
 | |
| 	
 | |
| 	/* Now inserts the callback */
 | |
| 	cblist = malloc(sizeof(struct ast_state_cb));
 | |
| 	if (!cblist) {
 | |
| 	    pthread_mutex_unlock(&hintlock);
 | |
| 	    return -1;
 | |
| 	}
 | |
| 	memset(cblist, 0, sizeof(struct ast_state_cb));
 | |
| 	cblist->id = 0;
 | |
| 	cblist->callback = callback;
 | |
| 	cblist->data = data;
 | |
| 
 | |
|         cblist->next = statecbs;
 | |
| 	statecbs = cblist;
 | |
| 
 | |
| 	pthread_mutex_unlock(&hintlock);
 | |
| 	return 0;
 | |
|     }
 | |
| 
 | |
|     if (!context || !exten)
 | |
| 	return -1;
 | |
| 
 | |
|     /* This callback type is for only one hint */
 | |
|     e = ast_hint_extension(NULL, context, exten);    
 | |
|     if (!e) {
 | |
|         return -1;
 | |
|     }
 | |
|     
 | |
|     pthread_mutex_lock(&hintlock);
 | |
|     list = hints;        
 | |
|     
 | |
|     while (list) {
 | |
| 	if (list->exten == e)
 | |
| 	    break;	    
 | |
| 	list = list->next;    
 | |
|     }
 | |
| 
 | |
|     if (!list) {
 | |
| 	pthread_mutex_unlock(&hintlock);
 | |
| 	return -1;
 | |
|     }
 | |
| 
 | |
|     /* Now inserts the callback */
 | |
|     cblist = malloc(sizeof(struct ast_state_cb));
 | |
|     if (!cblist) {
 | |
| 	pthread_mutex_unlock(&hintlock);
 | |
| 	return -1;
 | |
|     }
 | |
|     memset(cblist, 0, sizeof(struct ast_state_cb));
 | |
|     cblist->id = stateid++;
 | |
|     cblist->callback = callback;
 | |
|     cblist->data = data;
 | |
| 
 | |
|     cblist->next = list->callbacks;
 | |
|     list->callbacks = cblist;
 | |
| 
 | |
|     pthread_mutex_unlock(&hintlock);
 | |
|     return cblist->id;
 | |
| }
 | |
| 
 | |
| int ast_extension_state_del(int id, ast_state_cb_type callback)
 | |
| {
 | |
|     struct ast_hint *list;
 | |
|     struct ast_state_cb *cblist, *cbprev;
 | |
|     
 | |
|     if (!id && !callback)
 | |
| 	return -1;
 | |
|             
 | |
|     pthread_mutex_lock(&hintlock);
 | |
| 
 | |
|     /* id is zero is a callback without extension */
 | |
|     if (!id) {
 | |
| 	cbprev = NULL;
 | |
| 	cblist = statecbs;
 | |
| 	while (cblist) {
 | |
| 	    if (cblist->callback == callback) {
 | |
| 		if (!cbprev)
 | |
| 		    statecbs = cblist->next;
 | |
| 		else
 | |
| 		    cbprev->next = cblist->next;
 | |
| 
 | |
| 		free(cblist);
 | |
| 
 | |
| 	        pthread_mutex_unlock(&hintlock);
 | |
| 		return 0;
 | |
| 	    }
 | |
| 	    cbprev = cblist;
 | |
| 	    cblist = cblist->next;
 | |
| 	}
 | |
| 
 | |
|         pthread_mutex_lock(&hintlock);
 | |
| 	return -1;
 | |
|     }
 | |
| 
 | |
|     /* id greater zero is a callback with extension */
 | |
|     list = hints;
 | |
|     while (list) {
 | |
| 	cblist = list->callbacks;
 | |
| 	cbprev = NULL;
 | |
| 	while (cblist) {
 | |
| 	    if (cblist->id==id) {
 | |
| 		if (!cbprev)
 | |
| 		    list->callbacks = cblist->next;		
 | |
| 		else
 | |
| 		    cbprev->next = cblist->next;
 | |
| 		
 | |
| 		free(cblist);
 | |
| 		
 | |
| 		pthread_mutex_unlock(&hintlock);
 | |
| 		return 0;		
 | |
| 	    }		
 | |
|     	    cbprev = cblist;				
 | |
| 	    cblist = cblist->next;
 | |
| 	}
 | |
| 	list = list->next;
 | |
|     }
 | |
|     
 | |
|     pthread_mutex_unlock(&hintlock);
 | |
|     return -1;
 | |
| }
 | |
| 
 | |
| static int ast_add_hint(struct ast_exten *e)
 | |
| {
 | |
|     struct ast_hint *list;
 | |
| 
 | |
|     if (!e) return -1;
 | |
|     
 | |
|     pthread_mutex_lock(&hintlock);
 | |
|     list = hints;        
 | |
|     
 | |
|     /* Search if hint exists, do nothing */
 | |
|     while (list) {
 | |
| 	if (list->exten == e) {
 | |
| 	    pthread_mutex_unlock(&hintlock);
 | |
| 	    return -1;
 | |
| 	}
 | |
| 	list = list->next;    
 | |
|     }
 | |
| 
 | |
|     list = malloc(sizeof(struct ast_hint));
 | |
|     if (!list) {
 | |
| 	pthread_mutex_unlock(&hintlock);
 | |
| 	return -1;
 | |
|     }
 | |
|     /* Initialize and insert new item */
 | |
|     memset(list, 0, sizeof(struct ast_hint));
 | |
|     list->exten = e;
 | |
|     list->laststate = ast_extension_state2(e);
 | |
|     list->next = hints;
 | |
|     hints = list;
 | |
| 
 | |
|     pthread_mutex_unlock(&hintlock);
 | |
|     return 0;
 | |
| }
 | |
| 
 | |
| static int ast_change_hint(struct ast_exten *oe, struct ast_exten *ne)
 | |
| { 
 | |
|     struct ast_hint *list;
 | |
| 
 | |
|     pthread_mutex_lock(&hintlock);
 | |
|     
 | |
|     list = hints;
 | |
|     
 | |
|     while(list) {
 | |
| 	if (list->exten == oe) {
 | |
| 	    list->exten = ne;
 | |
| 	    pthread_mutex_unlock(&hintlock);	
 | |
| 	    return 0;
 | |
| 	}
 | |
| 	list = list->next;
 | |
|     }
 | |
|     pthread_mutex_unlock(&hintlock);
 | |
| 
 | |
|     return -1;
 | |
| }
 | |
| 
 | |
| static int ast_remove_hint(struct ast_exten *e)
 | |
| {
 | |
|     /* Cleanup the Notifys if hint is removed */
 | |
|     struct ast_hint *list, *prev = NULL;
 | |
|     struct ast_state_cb *cblist, *cbprev;
 | |
| 
 | |
|     if (!e) 
 | |
| 	return -1;
 | |
| 
 | |
|     pthread_mutex_lock(&hintlock);
 | |
| 
 | |
|     list = hints;    
 | |
|     while(list) {
 | |
| 	if (list->exten==e) {
 | |
| 	    cbprev = NULL;
 | |
| 	    cblist = list->callbacks;
 | |
| 	    while (cblist) {
 | |
| 		/* Notify with -1 and remove all callbacks */
 | |
| 		cbprev = cblist;	    
 | |
| 		cblist = cblist->next;
 | |
| 		cbprev->callback(list->exten->parent->name, list->exten->exten, -1, cbprev->data);
 | |
| 		free(cbprev);
 | |
| 	    }
 | |
| 	    list->callbacks = NULL;
 | |
| 
 | |
| 	    if (!prev)
 | |
| 		hints = list->next;
 | |
| 	    else
 | |
| 		prev->next = list->next;
 | |
| 
 | |
| 	    free(list);
 | |
| 	    
 | |
| 	    pthread_mutex_unlock(&hintlock);
 | |
| 	    return 0;
 | |
| 	} else {
 | |
| 	    prev = list;
 | |
|     	    list = list->next;    
 | |
| 	}
 | |
|     }
 | |
| 
 | |
|     pthread_mutex_unlock(&hintlock);
 | |
|     return -1;
 | |
| }
 | |
| 
 | |
| 
 | |
| int ast_get_hint(char *hint, int maxlen, struct ast_channel *c, char *context, char *exten)
 | |
| {
 | |
| 	struct ast_exten *e;
 | |
| 	e = ast_hint_extension(c, context, exten);
 | |
| 	if (e) {	
 | |
| 	    strncpy(hint, ast_get_extension_app(e), maxlen);
 | |
| 	    return -1;
 | |
| 	}
 | |
| 	return 0;	
 | |
| }
 | |
| 
 | |
| int ast_exists_extension(struct ast_channel *c, char *context, char *exten, int priority, char *callerid) 
 | |
| {
 | |
| 	return pbx_extension_helper(c, context, exten, priority, callerid, HELPER_EXISTS);
 | |
| }
 | |
| 
 | |
| int ast_canmatch_extension(struct ast_channel *c, char *context, char *exten, int priority, char *callerid)
 | |
| {
 | |
| 	return pbx_extension_helper(c, context, exten, priority, callerid, HELPER_CANMATCH);
 | |
| }
 | |
| 
 | |
| int ast_matchmore_extension(struct ast_channel *c, char *context, char *exten, int priority, char *callerid)
 | |
| {
 | |
| 	return pbx_extension_helper(c, context, exten, priority, callerid, HELPER_MATCHMORE);
 | |
| }
 | |
| 
 | |
| int ast_spawn_extension(struct ast_channel *c, char *context, char *exten, int priority, char *callerid) 
 | |
| {
 | |
| 	return pbx_extension_helper(c, context, exten, priority, callerid, HELPER_SPAWN);
 | |
| }
 | |
| 
 | |
| int ast_pbx_run(struct ast_channel *c)
 | |
| {
 | |
| 	int firstpass = 1;
 | |
| 	char digit;
 | |
| 	char exten[256];
 | |
| 	int pos;
 | |
| 	int waittime;
 | |
| 	int res=0;
 | |
| 
 | |
| 	/* A little initial setup here */
 | |
| 	if (c->pbx)
 | |
| 		ast_log(LOG_WARNING, "%s already has PBX structure??\n", c->name);
 | |
| 	c->pbx = malloc(sizeof(struct ast_pbx));
 | |
| 	if (!c->pbx) {
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	if (c->amaflags) {
 | |
| 		if (c->cdr) {
 | |
| 			ast_log(LOG_WARNING, "%s already has a call record??\n", c->name);
 | |
| 		} else {
 | |
| 			c->cdr = ast_cdr_alloc();
 | |
| 			if (!c->cdr) {
 | |
| 				ast_log(LOG_WARNING, "Unable to create Call Detail Record\n");
 | |
| 				free(c->pbx);
 | |
| 				return -1;
 | |
| 			}
 | |
| 			ast_cdr_init(c->cdr, c);
 | |
| 		}
 | |
| 	}
 | |
| 	memset(c->pbx, 0, sizeof(struct ast_pbx));
 | |
| 	/* Set reasonable defaults */
 | |
| 	c->pbx->rtimeout = 10;
 | |
| 	c->pbx->dtimeout = 5;
 | |
| 
 | |
| 	/* Start by trying whatever the channel is set to */
 | |
| 	if (!ast_exists_extension(c, c->context, c->exten, c->priority, c->callerid)) {
 | |
| 		/* JK02: If not successfull fall back to 's' */
 | |
| 		strncpy(c->exten, "s", sizeof(c->exten)-1);
 | |
| 		if (!ast_exists_extension(c, c->context, c->exten, c->priority, c->callerid)) {
 | |
| 			/* JK02: And finally back to default if everything else failed */
 | |
| 			strncpy(c->context, "default", sizeof(c->context)-1);
 | |
| 		}
 | |
| 		c->priority = 1;
 | |
| 	}
 | |
| 	if (c->cdr)
 | |
| 		ast_cdr_start(c->cdr);
 | |
| 	for(;;) {
 | |
| 		pos = 0;
 | |
| 		digit = 0;
 | |
| 		while(ast_exists_extension(c, c->context, c->exten, c->priority, c->callerid)) {
 | |
| 			memset(exten, 0, sizeof(exten));
 | |
| 			manager_event(EVENT_FLAG_CALL, "Newexten", 
 | |
| 				"Channel: %s\r\n"
 | |
| 				"Context: %s\r\n"
 | |
| 				"Extension: %s\r\n"
 | |
| 				"Priority: %d\r\n",
 | |
| 				c->name, c->context, c->exten, c->priority);			
 | |
| 			if ((res = ast_spawn_extension(c, c->context, c->exten, c->priority, c->callerid))) {
 | |
| 				/* Something bad happened, or a hangup has been requested. */
 | |
| 				if (((res >= '0') && (res <= '9')) || ((res >= 'A') && (res <= 'F')) ||
 | |
| 					(res == '*') || (res == '#')) {
 | |
| 					ast_log(LOG_DEBUG, "Oooh, got something to jump out with ('%c')!\n", res);
 | |
| 					memset(exten, 0, sizeof(exten));
 | |
| 					pos = 0;
 | |
| 					exten[pos++] = digit = res;
 | |
| 					break;
 | |
| 				}
 | |
| 				switch(res) {
 | |
| 				case AST_PBX_KEEPALIVE:
 | |
| 					if (option_debug)
 | |
| 						ast_log(LOG_DEBUG, "Spawn extension (%s,%s,%d) exited KEEPALIVE on '%s'\n", c->context, c->exten, c->priority, c->name);
 | |
| 					else if (option_verbose > 1)
 | |
| 						ast_verbose( VERBOSE_PREFIX_2 "Spawn extension (%s, %s, %d) exited KEEPALIVE on '%s'\n", c->context, c->exten, c->priority, c->name);
 | |
| 					goto out;
 | |
| 					break;
 | |
| 				default:
 | |
| 					if (option_debug)
 | |
| 						ast_log(LOG_DEBUG, "Spawn extension (%s,%s,%d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
 | |
| 					else if (option_verbose > 1)
 | |
| 						ast_verbose( VERBOSE_PREFIX_2 "Spawn extension (%s, %s, %d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
 | |
| 					if (c->_softhangup == AST_SOFTHANGUP_ASYNCGOTO) {
 | |
| 						c->_softhangup =0;
 | |
| 						break;
 | |
| 					}
 | |
| 					/* atimeout */
 | |
| 					if (c->_softhangup == AST_SOFTHANGUP_TIMEOUT) {
 | |
| 						break;
 | |
| 					}
 | |
| 					goto out;
 | |
| 				}
 | |
| 			}
 | |
| 			if ((c->_softhangup == AST_SOFTHANGUP_TIMEOUT) && (ast_exists_extension(c,c->context,"T",1,c->callerid))) {
 | |
| 				strncpy(c->exten,"T",sizeof(c->exten) - 1);
 | |
| 				/* If the AbsoluteTimeout is not reset to 0, we'll get an infinite loop */
 | |
| 				c->whentohangup = 0;
 | |
| 			} else if (c->_softhangup) {
 | |
| 				ast_log(LOG_DEBUG, "Extension %s, priority %d returned normally even though call was hung up\n",
 | |
| 					c->exten, c->priority);
 | |
| 				goto out;
 | |
| 			}
 | |
| 			firstpass = 0;
 | |
| 			c->priority++;
 | |
| 		}
 | |
| 		if (!ast_exists_extension(c, c->context, c->exten, 1, c->callerid)) {
 | |
| 			/* It's not a valid extension anymore */
 | |
| 			if (ast_exists_extension(c, c->context, "i", 1, c->callerid)) {
 | |
| 				if (option_verbose > 2)
 | |
| 					ast_verbose(VERBOSE_PREFIX_3 "Sent into invalid extension '%s' in context '%s' on %s\n", c->exten, c->context, c->name);
 | |
| 				strncpy(c->exten, "i", sizeof(c->exten)-1);
 | |
| 				c->priority = 1;
 | |
| 			} 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);
 | |
| 				goto out;
 | |
| 			}
 | |
| 		} 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 {
 | |
| 			/* Done, wait for an extension */
 | |
| 			if (digit)
 | |
| 				waittime = c->pbx->dtimeout;
 | |
| 			else
 | |
| 				waittime = c->pbx->rtimeout;
 | |
| 			while (ast_matchmore_extension(c, c->context, exten, 1, c->callerid)) {
 | |
| 				/* 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 */
 | |
| 						goto out;
 | |
| 					exten[pos++] = digit;
 | |
| 					waittime = c->pbx->dtimeout;
 | |
| 				}
 | |
| 			}
 | |
| 			if (ast_exists_extension(c, c->context, exten, 1, c->callerid)) {
 | |
| 				/* Prepare the next cycle */
 | |
| 				strncpy(c->exten, exten, sizeof(c->exten)-1);
 | |
| 				c->priority = 1;
 | |
| 			} else {
 | |
| 				/* No such extension */
 | |
| 				if (strlen(exten)) {
 | |
| 					/* An invalid extension */
 | |
| 					if (ast_exists_extension(c, c->context, "i", 1, c->callerid)) {
 | |
| 						if (option_verbose > 2)
 | |
| 							ast_verbose( VERBOSE_PREFIX_3 "Invalid extension '%s' in context '%s' on %s\n", exten, c->context, c->name);
 | |
| 						strncpy(c->exten, "i", sizeof(c->exten)-1);
 | |
| 						c->priority = 1;
 | |
| 					} else {
 | |
| 						ast_log(LOG_WARNING, "Invalid extension, but no rule 'i' in context '%s'\n", c->context);
 | |
| 						goto out;
 | |
| 					}
 | |
| 				} else {
 | |
| 					/* A simple timeout */
 | |
| 					if (ast_exists_extension(c, c->context, "t", 1, c->callerid)) {
 | |
| 						if (option_verbose > 2)
 | |
| 							ast_verbose( VERBOSE_PREFIX_3 "Timeout on %s\n", c->name);
 | |
| 						strncpy(c->exten, "t", sizeof(c->exten)-1);
 | |
| 						c->priority = 1;
 | |
| 					} else {
 | |
| 						ast_log(LOG_WARNING, "Timeout, but no rule 't' in context '%s'\n", c->context);
 | |
| 						goto out;
 | |
| 					}
 | |
| 				}	
 | |
| 			}
 | |
| 		}
 | |
| 	}
 | |
| 	if (firstpass) 
 | |
| 		ast_log(LOG_WARNING, "Don't know what to do with '%s'\n", c->name);
 | |
| out:
 | |
| 	if (ast_exists_extension(c, c->context, "h", 1, c->callerid)) {
 | |
| 		strcpy(c->exten, "h");
 | |
| 		c->priority = 1;
 | |
| 		while(ast_exists_extension(c, c->context, c->exten, c->priority, c->callerid)) {
 | |
| 			if ((res = ast_spawn_extension(c, c->context, c->exten, c->priority, c->callerid))) {
 | |
| 				/* Something bad happened, or a hangup has been requested. */
 | |
| 				if (option_debug)
 | |
| 					ast_log(LOG_DEBUG, "Spawn extension (%s,%s,%d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
 | |
| 				else if (option_verbose > 1)
 | |
| 					ast_verbose( VERBOSE_PREFIX_2 "Spawn extension (%s, %s, %d) exited non-zero on '%s'\n", c->context, c->exten, c->priority, c->name);
 | |
| 				break;
 | |
| 			}
 | |
| 			c->priority++;
 | |
| 		}
 | |
| 	}
 | |
| 
 | |
| 	pbx_destroy(c->pbx);
 | |
| 	c->pbx = NULL;
 | |
| 	if (res != AST_PBX_KEEPALIVE)
 | |
| 		ast_hangup(c);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| 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.  The setjmp stuff is fairly
 | |
| 	   confusing, but necessary to get smooth transitions between
 | |
| 	   the execution of different applications (without the use of
 | |
| 	   additional threads) */
 | |
| 	struct ast_channel *c = data;
 | |
| 	ast_pbx_run(c);
 | |
| 	pthread_exit(NULL);
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| int ast_pbx_start(struct ast_channel *c)
 | |
| {
 | |
| 	pthread_t t;
 | |
| 	pthread_attr_t attr;
 | |
| 	if (!c) {
 | |
| 		ast_log(LOG_WARNING, "Asked to start thread on NULL channel?\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	   
 | |
| 	/* Start a new thread, and get something handling this channel. */
 | |
| 	pthread_attr_init(&attr);
 | |
| 	pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
 | |
| 	if (pthread_create(&t, &attr, pbx_thread, c)) {
 | |
| 		ast_log(LOG_WARNING, "Failed to create new channel thread\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * This function locks contexts list by &conlist, search for the rigt 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(char *context, char *include, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) return -1;
 | |
| 
 | |
| 	/* walk contexts and search for the right one ...*/
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		/* we found one ... */
 | |
| 		if (!strcmp(ast_get_context_name(c), context)) {
 | |
| 			int ret;
 | |
| 			/* remove include from this context ... */	
 | |
| 			ret = ast_context_remove_include2(c, include, registrar);
 | |
| 
 | |
| 			ast_unlock_contexts();
 | |
| 
 | |
| 			/* ... return results */
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right one context */
 | |
| 	ast_unlock_contexts();
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * 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.
 | |
|  *
 | |
|  * This function locks given context, removes include, unlock context and
 | |
|  * return.
 | |
|  */
 | |
| int ast_context_remove_include2(struct ast_context *con, char *include, char *registrar)
 | |
| {
 | |
| 	struct ast_include *i, *pi = NULL;
 | |
| 
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) return -1;
 | |
| 
 | |
| 	/* walk includes */
 | |
| 	i = con->includes;
 | |
| 	while (i) {
 | |
| 		/* find our include */
 | |
| 		if (!strcmp(i->name, include) && 
 | |
| 			(!strcmp(i->registrar, registrar) || !registrar)) {
 | |
| 			/* remove from list */
 | |
| 			if (pi)
 | |
| 				pi->next = i->next;
 | |
| 			else
 | |
| 				con->includes = i->next;
 | |
| 			/* free include and return */
 | |
| 			free(i);
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			return 0;
 | |
| 		}
 | |
| 		pi = i;
 | |
| 		i = i->next;
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right include */
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * 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(char *context, char *sw, char *data, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) return -1;
 | |
| 
 | |
| 	/* walk contexts and search for the right one ...*/
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		/* we found one ... */
 | |
| 		if (!strcmp(ast_get_context_name(c), context)) {
 | |
| 			int ret;
 | |
| 			/* remove switch from this context ... */	
 | |
| 			ret = ast_context_remove_switch2(c, sw, data, registrar);
 | |
| 
 | |
| 			ast_unlock_contexts();
 | |
| 
 | |
| 			/* ... return results */
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right one context */
 | |
| 	ast_unlock_contexts();
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * 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.
 | |
|  *
 | |
|  * This function locks given context, removes switch, unlock context and
 | |
|  * return.
 | |
|  */
 | |
| int ast_context_remove_switch2(struct ast_context *con, char *sw, char *data, char *registrar)
 | |
| {
 | |
| 	struct ast_sw *i, *pi = NULL;
 | |
| 
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) return -1;
 | |
| 
 | |
| 	/* walk switchs */
 | |
| 	i = con->alts;
 | |
| 	while (i) {
 | |
| 		/* find our switch */
 | |
| 		if (!strcmp(i->name, sw) && !strcmp(i->data, data) && 
 | |
| 			(!strcmp(i->registrar, registrar) || !registrar)) {
 | |
| 			/* remove from list */
 | |
| 			if (pi)
 | |
| 				pi->next = i->next;
 | |
| 			else
 | |
| 				con->alts = i->next;
 | |
| 			/* free switch and return */
 | |
| 			free(i);
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			return 0;
 | |
| 		}
 | |
| 		pi = i;
 | |
| 		i = i->next;
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right switch */
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * This functions lock contexts list, search for the right context,
 | |
|  * call ast_context_remove_extension2, unlock contexts list and return.
 | |
|  * In this function we are using
 | |
|  */
 | |
| int ast_context_remove_extension(char *context, char *extension, int priority, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) return -1;
 | |
| 
 | |
| 	/* walk contexts ... */
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		/* ... search for the right one ... */
 | |
| 		if (!strcmp(ast_get_context_name(c), context)) {
 | |
| 			/* ... remove extension ... */
 | |
| 			int ret = ast_context_remove_extension2(c, extension, priority,
 | |
| 				registrar);
 | |
| 			/* ... unlock contexts list and return */
 | |
| 			ast_unlock_contexts();
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right context */
 | |
| 	ast_unlock_contexts();
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * When do you want to call this function, make sure that &conlock is locked,
 | |
|  * because some process can handle with your *con context before you lock
 | |
|  * it.
 | |
|  *
 | |
|  * This functionc locks given context, search for the right extension and
 | |
|  * fires out all peer in this extensions with given priority. If priority
 | |
|  * is set to 0, all peers are removed. After that, unlock context and
 | |
|  * return.
 | |
|  */
 | |
| int ast_context_remove_extension2(struct ast_context *con, char *extension, int priority, char *registrar)
 | |
| {
 | |
| 	struct ast_exten *exten, *prev_exten = NULL;
 | |
| 
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) return -1;
 | |
| 
 | |
| 	/* go through all extensions in context and search the right one ... */
 | |
| 	exten = con->root;
 | |
| 	while (exten) {
 | |
| 
 | |
| 		/* look for right extension */
 | |
| 		if (!strcmp(exten->exten, extension) &&
 | |
| 			(!strcmp(exten->registrar, registrar) || !registrar)) {
 | |
| 			struct ast_exten *peer;
 | |
| 
 | |
| 			/* should we free all peers in this extension? (priority == 0)? */
 | |
| 			if (priority == 0) {
 | |
| 				/* remove this extension from context list */
 | |
| 				if (prev_exten)
 | |
| 					prev_exten->next = exten->next;
 | |
| 				else
 | |
| 					con->root = exten->next;
 | |
| 
 | |
| 				/* fire out all peers */
 | |
| 				peer = exten; 
 | |
| 				while (peer) {
 | |
| 					exten = peer->peer;
 | |
| 					
 | |
| 					if (!peer->priority==PRIORITY_HINT) 
 | |
| 					    ast_remove_hint(peer);
 | |
| 
 | |
| 					peer->datad(peer->data);
 | |
| 					free(peer);
 | |
| 
 | |
| 					peer = exten;
 | |
| 				}
 | |
| 
 | |
| 				ast_pthread_mutex_unlock(&con->lock);
 | |
| 				return 0;
 | |
| 			} else {
 | |
| 				/* remove only extension with exten->priority == priority */
 | |
| 				struct ast_exten *previous_peer = NULL;
 | |
| 
 | |
| 				peer = exten;
 | |
| 				while (peer) {
 | |
| 					/* is this our extension? */
 | |
| 					if (peer->priority == priority &&
 | |
| 						(!strcmp(peer->registrar, registrar) || !registrar)) {
 | |
| 						/* we are first priority extension? */
 | |
| 						if (!previous_peer) {
 | |
| 							/* exists previous extension here? */
 | |
| 							if (prev_exten) {
 | |
| 								/* yes, so we must change next pointer in
 | |
| 								 * previous connection to next peer
 | |
| 								 */
 | |
| 								if (peer->peer) {
 | |
| 									prev_exten->next = peer->peer;
 | |
| 									peer->peer->next = exten->next;
 | |
| 								} else
 | |
| 									prev_exten->next = exten->next;
 | |
| 							} else {
 | |
| 								/* no previous extension, we are first
 | |
| 								 * extension, so change con->root ...
 | |
| 								 */
 | |
| 								if (peer->peer)
 | |
| 									con->root = peer->peer;
 | |
| 								else
 | |
| 									con->root = exten->next; 
 | |
| 							}
 | |
| 						} else {
 | |
| 							/* we are not first priority in extension */
 | |
| 							previous_peer->peer = peer->peer;
 | |
| 						}
 | |
| 
 | |
| 						/* now, free whole priority extension */
 | |
| 						if (peer->priority==PRIORITY_HINT)
 | |
| 						    ast_remove_hint(peer);
 | |
| 						peer->datad(peer->data);
 | |
| 						free(peer);
 | |
| 
 | |
| 						ast_pthread_mutex_unlock(&con->lock);
 | |
| 						return 0;
 | |
| 					} else {
 | |
| 						/* this is not right extension, skip to next peer */
 | |
| 						previous_peer = peer;
 | |
| 						peer = peer->peer;
 | |
| 					}
 | |
| 				}
 | |
| 
 | |
| 				ast_pthread_mutex_unlock(&con->lock);
 | |
| 				return -1;
 | |
| 			}
 | |
| 		}
 | |
| 
 | |
| 		prev_exten = exten;
 | |
| 		exten = exten->next;
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find right extension */
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| 
 | |
| int ast_register_application(char *app, int (*execute)(struct ast_channel *, void *), char *synopsis, char *description)
 | |
| {
 | |
| 	struct ast_app *tmp;
 | |
| 	char tmps[80];
 | |
| 	if (ast_pthread_mutex_lock(&applock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock application list\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	tmp = apps;
 | |
| 	while(tmp) {
 | |
| 		if (!strcasecmp(app, tmp->name)) {
 | |
| 			ast_log(LOG_WARNING, "Already have an application '%s'\n", app);
 | |
| 			ast_pthread_mutex_unlock(&applock);
 | |
| 			return -1;
 | |
| 		}
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	tmp = malloc(sizeof(struct ast_app));
 | |
| 	if (tmp) {
 | |
| 		memset(tmp, 0, sizeof(struct ast_app));
 | |
| 		strncpy(tmp->name, app, sizeof(tmp->name)-1);
 | |
| 		tmp->execute = execute;
 | |
| 		tmp->synopsis = synopsis;
 | |
| 		tmp->description = description;
 | |
| 		tmp->next = apps;
 | |
| 		apps = tmp;
 | |
| 	} else {
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 		ast_pthread_mutex_unlock(&applock);
 | |
| 		return -1;
 | |
| 	}
 | |
| 	if (option_verbose > 1)
 | |
| 		ast_verbose( VERBOSE_PREFIX_2 "Registered application '%s'\n", term_color(tmps, tmp->name, COLOR_BRCYAN, 0, sizeof(tmps)));
 | |
| 	ast_pthread_mutex_unlock(&applock);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| int ast_register_switch(struct ast_switch *sw)
 | |
| {
 | |
| 	struct ast_switch *tmp, *prev=NULL;
 | |
| 	if (ast_pthread_mutex_lock(&switchlock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock switch lock\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	tmp = switches;
 | |
| 	while(tmp) {
 | |
| 		if (!strcasecmp(tmp->name, sw->name))
 | |
| 			break;
 | |
| 		prev = tmp;
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	if (tmp) {	
 | |
| 		ast_pthread_mutex_unlock(&switchlock);
 | |
| 		ast_log(LOG_WARNING, "Switch '%s' already found\n", sw->name);
 | |
| 		return -1;
 | |
| 	}
 | |
| 	sw->next = NULL;
 | |
| 	if (prev) 
 | |
| 		prev->next = sw;
 | |
| 	else
 | |
| 		switches = sw;
 | |
| 	ast_pthread_mutex_unlock(&switchlock);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| void ast_unregister_switch(struct ast_switch *sw)
 | |
| {
 | |
| 	struct ast_switch *tmp, *prev=NULL;
 | |
| 	if (ast_pthread_mutex_lock(&switchlock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock switch lock\n");
 | |
| 		return;
 | |
| 	}
 | |
| 	tmp = switches;
 | |
| 	while(tmp) {
 | |
| 		if (tmp == sw) {
 | |
| 			if (prev)
 | |
| 				prev->next = tmp->next;
 | |
| 			else
 | |
| 				switches = tmp->next;
 | |
| 			tmp->next = NULL;
 | |
| 			break;			
 | |
| 		}
 | |
| 		prev = tmp;
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	ast_pthread_mutex_unlock(&switchlock);
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Help for CLI commands ...
 | |
|  */
 | |
| static char show_application_help[] = 
 | |
| "Usage: show application <application> [<application> [<application> [...]]]\n"
 | |
| "       Describes a particular application.\n";
 | |
| 
 | |
| static char show_applications_help[] =
 | |
| "Usage: show applications\n"
 | |
| "       List applications which are currently available.\n";
 | |
| 
 | |
| static char show_dialplan_help[] =
 | |
| "Usage: show dialplan [exten@][context]\n"
 | |
| "       Show dialplan\n";
 | |
| 
 | |
| static char show_switches_help[] = 
 | |
| "Usage: show switches\n"
 | |
| "       Show registered switches\n";
 | |
| 
 | |
| /*
 | |
|  * IMPLEMENTATION OF CLI FUNCTIONS IS IN THE SAME ORDER AS COMMANDS HELPS
 | |
|  *
 | |
|  */
 | |
| 
 | |
| /*
 | |
|  * 'show application' CLI command implementation functions ...
 | |
|  */
 | |
| 
 | |
| /*
 | |
|  * There is a possibility to show informations about more than one
 | |
|  * application at one time. You can type 'show application Dial Echo' and
 | |
|  * you will see informations about these two applications ...
 | |
|  */
 | |
| static char *complete_show_application(char *line, char *word,
 | |
| 	int pos, int state)
 | |
| {
 | |
| 	struct ast_app *a;
 | |
| 	int which = 0;
 | |
| 
 | |
| 	/* try to lock applications list ... */
 | |
| 	if (ast_pthread_mutex_lock(&applock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock application list\n");
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	/* ... walk all applications ... */
 | |
| 	a = apps; 
 | |
| 	while (a) {
 | |
| 		/* ... check if word matches this application ... */
 | |
| 		if (!strncasecmp(word, a->name, strlen(word))) {
 | |
| 			/* ... if this is right app serve it ... */
 | |
| 			if (++which > state) {
 | |
| 				char *ret = strdup(a->name);
 | |
| 				ast_pthread_mutex_unlock(&applock);
 | |
| 				return ret;
 | |
| 			}
 | |
| 		}
 | |
| 		a = a->next; 
 | |
| 	}
 | |
| 
 | |
| 	/* no application match */
 | |
| 	ast_pthread_mutex_unlock(&applock);
 | |
| 	return NULL; 
 | |
| }
 | |
| 
 | |
| static int handle_show_application(int fd, int argc, char *argv[])
 | |
| {
 | |
| 	struct ast_app *a;
 | |
| 	char buf[2048];
 | |
| 	int app, no_registered_app = 1;
 | |
| 
 | |
| 	if (argc < 3) return RESULT_SHOWUSAGE;
 | |
| 
 | |
| 	/* try to lock applications list ... */
 | |
| 	if (ast_pthread_mutex_lock(&applock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock application list\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* ... go through all applications ... */
 | |
| 	a = apps; 
 | |
| 	while (a) {
 | |
| 		/* ... compare this application name with all arguments given
 | |
| 		 * to 'show application' command ... */
 | |
| 		for (app = 2; app < argc; app++) {
 | |
| 			if (!strcasecmp(a->name, argv[app])) {
 | |
| 				no_registered_app = 0;
 | |
| 
 | |
| 				/* ... one of our applications, show info ...*/
 | |
| 				snprintf(buf, sizeof(buf),
 | |
| 					"\n  -= Info about application '%s' =- \n\n"
 | |
| 					"[Synopsis]:\n  %s\n\n"
 | |
| 					"[Description]:\n%s\n",
 | |
| 					a->name,
 | |
| 					a->synopsis ? a->synopsis : "Not available",
 | |
| 					a->description ? a-> description : "Not available");
 | |
| 				ast_cli(fd, buf);
 | |
| 			}
 | |
| 		}
 | |
| 		a = a->next; 
 | |
| 	}
 | |
| 
 | |
| 	ast_pthread_mutex_unlock(&applock);
 | |
| 
 | |
| 	/* we found at least one app? no? */
 | |
| 	if (no_registered_app) {
 | |
| 		ast_cli(fd, "Your application(s) is (are) not registered\n");
 | |
| 		return RESULT_FAILURE;
 | |
| 	}
 | |
| 
 | |
| 	return RESULT_SUCCESS;
 | |
| }
 | |
| 
 | |
| static int handle_show_switches(int fd, int argc, char *argv[])
 | |
| {
 | |
| 	struct ast_switch *sw;
 | |
| 	if (!switches) {
 | |
| 		ast_cli(fd, "There are no registered alternative switches\n");
 | |
| 		return RESULT_SUCCESS;
 | |
| 	}
 | |
| 	/* ... we have applications ... */
 | |
| 	ast_cli(fd, "\n    -= Registered Asterisk Alternative Switches =-\n");
 | |
| 	if (ast_pthread_mutex_lock(&switchlock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock switches\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	sw = switches;
 | |
| 	while (sw) {
 | |
| 		ast_cli(fd, "%s: %s\n", sw->name, sw->description);
 | |
| 		sw = sw->next;
 | |
| 	}
 | |
| 	ast_pthread_mutex_unlock(&switchlock);
 | |
| 	return RESULT_SUCCESS;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * 'show applications' CLI command implementation functions ...
 | |
|  */
 | |
| static int handle_show_applications(int fd, int argc, char *argv[])
 | |
| {
 | |
| 	struct ast_app *a;
 | |
| 
 | |
| 	/* try to lock applications list ... */
 | |
| 	if (ast_pthread_mutex_lock(&applock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock application list\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* ... go to first application ... */
 | |
| 	a = apps; 
 | |
| 
 | |
| 	/* ... have we got at least one application (first)? no? */
 | |
| 	if (!a) {
 | |
| 		ast_cli(fd, "There is no registered applications\n");
 | |
| 		ast_pthread_mutex_unlock(&applock);
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* ... we have applications ... */
 | |
| 	ast_cli(fd, "\n    -= Registered Asterisk Applications =-\n");
 | |
| 
 | |
| 	/* ... go through all applications ... */
 | |
| 	while (a) {
 | |
| 		/* ... show informations about applications ... */
 | |
| 		ast_cli(fd,"  %15s: %s\n",
 | |
| 			a->name,
 | |
| 			a->synopsis ? a->synopsis : "<Synopsis not available>");
 | |
| 		a = a->next; 
 | |
| 	}
 | |
| 
 | |
| 	/* ... unlock and return */
 | |
| 	ast_pthread_mutex_unlock(&applock);
 | |
| 
 | |
| 	return RESULT_SUCCESS;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * 'show dialplan' CLI command implementation functions ...
 | |
|  */
 | |
| static char *complete_show_dialplan_context(char *line, char *word, int pos,
 | |
| 	int state)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 	int which = 0;
 | |
| 
 | |
| 	/* we are do completion of [exten@]context on second postion only */
 | |
| 	if (pos != 2) return NULL;
 | |
| 
 | |
| 	/* try to lock contexts list ... */
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock context list\n");
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	/* ... walk through all contexts ... */
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while(c) {
 | |
| 		/* ... word matches context name? yes? ... */
 | |
| 		if (!strncasecmp(word, ast_get_context_name(c), strlen(word))) {
 | |
| 			/* ... for serve? ... */
 | |
| 			if (++which > state) {
 | |
| 				/* ... yes, serve this context name ... */
 | |
| 				char *ret = strdup(ast_get_context_name(c));
 | |
| 				ast_unlock_contexts();
 | |
| 				return ret;
 | |
| 			}
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	/* ... unlock and return */
 | |
| 	ast_unlock_contexts();
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| static int handle_show_dialplan(int fd, int argc, char *argv[])
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 	char *exten = NULL, *context = NULL;
 | |
| 	int context_existence = 0, extension_existence = 0;
 | |
| 
 | |
| 	if (argc != 3 && argc != 2) return -1;
 | |
| 
 | |
| 	/* we obtain [exten@]context? if yes, split them ... */
 | |
| 	if (argc == 3) {
 | |
| 		char *splitter = argv[2];
 | |
| 		/* is there a '@' character? */
 | |
| 		if (strchr(argv[2], '@')) {
 | |
| 			/* yes, split into exten & context ... */
 | |
| 			exten   = strsep(&splitter, "@");
 | |
| 			context = splitter;
 | |
| 
 | |
| 			/* check for length and change to NULL if !strlen() */
 | |
| 			if (!strlen(exten))   exten = NULL;
 | |
| 			if (!strlen(context)) context = NULL;
 | |
| 		} else
 | |
| 		{
 | |
| 			/* no '@' char, only context given */
 | |
| 			context = argv[2];
 | |
| 			if (!strlen(context)) context = NULL;
 | |
| 		}
 | |
| 	}
 | |
| 
 | |
| 	/* try to lock contexts */
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		ast_cli(LOG_WARNING, "Failed to lock contexts list\n");
 | |
| 		return RESULT_FAILURE;
 | |
| 	}
 | |
| 
 | |
| 	/* walk all contexts ... */
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		/* show this context? */
 | |
| 		if (!context ||
 | |
| 			!strcmp(ast_get_context_name(c), context)) {
 | |
| 			context_existence = 1;
 | |
| 
 | |
| 			/* try to lock context before walking in ... */
 | |
| 			if (!ast_lock_context(c)) {
 | |
| 				struct ast_exten *e;
 | |
| 				struct ast_include *i;
 | |
| 				struct ast_ignorepat *ip;
 | |
| 				struct ast_sw *sw;
 | |
| 				char buf[256], buf2[256];
 | |
| 				int context_info_printed = 0;
 | |
| 
 | |
| 				/* are we looking for exten too? if yes, we print context
 | |
| 				 * if we our extension only
 | |
| 				 */
 | |
| 				if (!exten) {
 | |
| 					ast_cli(fd, "[ Context '%s' created by '%s' ]\n",
 | |
| 						ast_get_context_name(c), ast_get_context_registrar(c));
 | |
| 					context_info_printed = 1;
 | |
| 				}
 | |
| 
 | |
| 				/* walk extensions ... */
 | |
| 				e = ast_walk_context_extensions(c, NULL);
 | |
| 				while (e) {
 | |
| 					struct ast_exten *p;
 | |
| 
 | |
| 					/* looking for extension? is this our extension? */
 | |
| 					if (exten &&
 | |
| 						strcmp(ast_get_extension_name(e), exten))
 | |
| 					{
 | |
| 						/* we are looking for extension and it's not our
 | |
|  						 * extension, so skip to next extension */
 | |
| 						e = ast_walk_context_extensions(c, e);
 | |
| 						continue;
 | |
| 					}
 | |
| 
 | |
| 					extension_existence = 1;
 | |
| 
 | |
| 					/* may we print context info? */	
 | |
| 					if (!context_info_printed) {
 | |
| 						ast_cli(fd, "[ Context '%s' created by '%s' ]\n",
 | |
| 							ast_get_context_name(c),
 | |
| 							ast_get_context_registrar(c));
 | |
| 						context_info_printed = 1;
 | |
| 					}
 | |
| 
 | |
| 					/* write extension name and first peer */	
 | |
| 					bzero(buf, sizeof(buf));		
 | |
| 					snprintf(buf, sizeof(buf), "'%s' =>",
 | |
| 						ast_get_extension_name(e));
 | |
| 
 | |
| 					snprintf(buf2, sizeof(buf2),
 | |
| 						"%d. %s(%s)",
 | |
| 						ast_get_extension_priority(e),
 | |
| 						ast_get_extension_app(e),
 | |
| 						(char *)ast_get_extension_app_data(e));
 | |
| 
 | |
| 					ast_cli(fd, "  %-17s %-45s [%s]\n", buf, buf2,
 | |
| 						ast_get_extension_registrar(e));
 | |
| 
 | |
| 					/* walk next extension peers */
 | |
| 					p = ast_walk_extension_priorities(e, e);
 | |
| 					while (p) {
 | |
| 						bzero((void *)buf2, sizeof(buf2));
 | |
| 
 | |
| 						snprintf(buf2, sizeof(buf2),
 | |
| 							"%d. %s(%s)",
 | |
| 							ast_get_extension_priority(p),
 | |
| 							ast_get_extension_app(p),
 | |
| 							(char *)ast_get_extension_app_data(p));
 | |
| 
 | |
| 						ast_cli(fd,"  %-17s %-45s [%s]\n",
 | |
| 							"", buf2,
 | |
| 							ast_get_extension_registrar(p));	
 | |
| 
 | |
| 						p = ast_walk_extension_priorities(e, p);
 | |
| 					}
 | |
| 					e = ast_walk_context_extensions(c, e);
 | |
| 				}
 | |
| 
 | |
| 				/* include & ignorepat we all printing if we are not
 | |
| 				 * looking for exact extension
 | |
| 				 */
 | |
| 				if (!exten) {
 | |
| 					if (ast_walk_context_extensions(c, NULL))
 | |
| 						ast_cli(fd, "\n");
 | |
| 
 | |
| 					/* walk included and write info ... */
 | |
| 					i = ast_walk_context_includes(c, NULL);
 | |
| 					while (i) {
 | |
| 						bzero(buf, sizeof(buf));
 | |
| 						snprintf(buf, sizeof(buf), "'%s'",
 | |
| 							ast_get_include_name(i));
 | |
| 						ast_cli(fd, "  Include =>        %-45s [%s]\n",
 | |
| 							buf, ast_get_include_registrar(i));
 | |
| 						i = ast_walk_context_includes(c, i);
 | |
| 					}
 | |
| 
 | |
| 					/* walk ignore patterns and write info ... */
 | |
| 					ip = ast_walk_context_ignorepats(c, NULL);
 | |
| 					while (ip) {
 | |
| 						bzero(buf, sizeof(buf));
 | |
| 						snprintf(buf, sizeof(buf), "'%s'",
 | |
| 							ast_get_ignorepat_name(ip));
 | |
| 						ast_cli(fd, "  Ignore pattern => %-45s [%s]\n",
 | |
| 							buf, ast_get_ignorepat_registrar(ip));	
 | |
| 						ip = ast_walk_context_ignorepats(c, ip);
 | |
| 					}
 | |
| 					sw = ast_walk_context_switches(c, NULL);
 | |
| 					while(sw) {
 | |
| 						bzero(buf, sizeof(buf));
 | |
| 						snprintf(buf, sizeof(buf), "'%s/%s'",
 | |
| 							ast_get_switch_name(sw),
 | |
| 							ast_get_switch_data(sw));
 | |
| 						ast_cli(fd, "  Alt. Switch =>    %-45s [%s]\n",
 | |
| 							buf, ast_get_switch_registrar(sw));	
 | |
| 						sw = ast_walk_context_switches(c, sw);
 | |
| 					}
 | |
| 				}
 | |
| 	
 | |
| 				ast_unlock_context(c);
 | |
| 
 | |
| 				/* if we print something in context, make an empty line */
 | |
| 				if (context_info_printed) ast_cli(fd, "\n");
 | |
| 			}
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 	ast_unlock_contexts();
 | |
| 
 | |
| 	/* check for input failure and throw some error messages */
 | |
| 	if (context && !context_existence) {
 | |
| 		ast_cli(fd, "There is no existence of '%s' context\n",
 | |
| 			context);
 | |
| 		return RESULT_FAILURE;
 | |
| 	}
 | |
| 
 | |
| 	if (exten && !extension_existence) {
 | |
| 		if (context)
 | |
| 			ast_cli(fd, "There is no existence of %s@%s extension\n",
 | |
| 				exten, context);
 | |
| 		else
 | |
| 			ast_cli(fd,
 | |
| 				"There is no existence of '%s' extension in all contexts\n",
 | |
| 				exten);
 | |
| 		return RESULT_FAILURE;
 | |
| 	}
 | |
| 
 | |
| 	/* everything ok */
 | |
| 	return RESULT_SUCCESS;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * CLI entries for upper commands ...
 | |
|  */
 | |
| static struct ast_cli_entry show_applications_cli = 
 | |
| 	{ { "show", "applications", NULL }, 
 | |
| 	handle_show_applications, "Shows registered applications",
 | |
| 	show_applications_help };
 | |
| 
 | |
| static struct ast_cli_entry show_application_cli =
 | |
| 	{ { "show", "application", NULL }, 
 | |
| 	handle_show_application, "Describe a specific application",
 | |
| 	show_application_help, complete_show_application };
 | |
| 
 | |
| static struct ast_cli_entry show_dialplan_cli =
 | |
| 	{ { "show", "dialplan", NULL },
 | |
| 		handle_show_dialplan, "Show dialplan",
 | |
| 		show_dialplan_help, complete_show_dialplan_context };
 | |
| 
 | |
| static struct ast_cli_entry show_switches_cli =
 | |
| 	{ { "show", "switches", NULL },
 | |
| 		handle_show_switches, "Show alternative switches",
 | |
| 		show_switches_help, NULL };
 | |
| 
 | |
| int ast_unregister_application(char *app) {
 | |
| 	struct ast_app *tmp, *tmpl = NULL;
 | |
| 	if (ast_pthread_mutex_lock(&applock)) {
 | |
| 		ast_log(LOG_ERROR, "Unable to lock application list\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	tmp = apps;
 | |
| 	while(tmp) {
 | |
| 		if (!strcasecmp(app, tmp->name)) {
 | |
| 			if (tmpl)
 | |
| 				tmpl->next = tmp->next;
 | |
| 			else
 | |
| 				apps = tmp->next;
 | |
| 			if (option_verbose > 1)
 | |
| 				ast_verbose( VERBOSE_PREFIX_2 "Unregistered application '%s'\n", tmp->name);
 | |
| 			ast_pthread_mutex_unlock(&applock);
 | |
| 			return 0;
 | |
| 		}
 | |
| 		tmpl = tmp;
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	ast_pthread_mutex_unlock(&applock);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| struct ast_context *ast_context_create(char *name, char *registrar)
 | |
| {
 | |
| 	struct ast_context *tmp;
 | |
| 	
 | |
| 	ast_pthread_mutex_lock(&conlock);
 | |
| 	tmp = contexts;
 | |
| 	while(tmp) {
 | |
| 		if (!strcasecmp(tmp->name, name)) {
 | |
| 			ast_pthread_mutex_unlock(&conlock);
 | |
| 			ast_log(LOG_WARNING, "Tried to register context '%s', already in use\n", name);
 | |
| 			return NULL;
 | |
| 		}
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	tmp = malloc(sizeof(struct ast_context));
 | |
| 	if (tmp) {
 | |
| 		memset(tmp, 0, sizeof(struct ast_context));
 | |
| 		ast_pthread_mutex_init(&tmp->lock);
 | |
| 		strncpy(tmp->name, name, sizeof(tmp->name)-1);
 | |
| 		tmp->root = NULL;
 | |
| 		tmp->registrar = registrar;
 | |
| 		tmp->next = contexts;
 | |
| 		tmp->includes = NULL;
 | |
| 		tmp->ignorepats = NULL;
 | |
| 		contexts = tmp;
 | |
| 		if (option_debug)
 | |
| 			ast_log(LOG_DEBUG, "Registered context '%s'\n", tmp->name);
 | |
| 		else if (option_verbose > 2)
 | |
| 			ast_verbose( VERBOSE_PREFIX_3 "Registered extension context '%s'\n", tmp->name);
 | |
| 	} else
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 	
 | |
| 	ast_pthread_mutex_unlock(&conlock);
 | |
| 	return tmp;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * errno values
 | |
|  *  EBUSY  - can't lock
 | |
|  *  ENODATA - no existence of context
 | |
|  */
 | |
| int ast_context_add_include(char *context, char *include, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* walk contexts ... */
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		/* ... search for the right one ... */
 | |
| 		if (!strcmp(ast_get_context_name(c), context)) {
 | |
| 			int ret = ast_context_add_include2(c, include, registrar);
 | |
| 			/* ... unlock contexts list and return */
 | |
| 			ast_unlock_contexts();
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right context */
 | |
| 	ast_unlock_contexts();
 | |
| 	errno = ENODATA;
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| #define FIND_NEXT \
 | |
| do { \
 | |
| 	c = info; \
 | |
| 	while(*c && (*c != '|')) c++; \
 | |
| 	if (*c) { *c = '\0'; c++; } else c = NULL; \
 | |
| } while(0)
 | |
| 
 | |
| static void get_timerange(struct ast_include *i, char *times)
 | |
| {
 | |
| 	char *e;
 | |
| 	int x;
 | |
| 	int s1, s2;
 | |
| 	int e1, e2;
 | |
| 	/* Star is all times */
 | |
| 	if (!strlen(times) || !strcmp(times, "*")) {
 | |
| 		for (x=0;x<24;x++)
 | |
| 			i->minmask[x] = (1 << 30) - 1;
 | |
| 		return;
 | |
| 	}
 | |
| 	/* Otherwise expect a range */
 | |
| 	e = strchr(times, '-');
 | |
| 	if (!e) {
 | |
| 		ast_log(LOG_WARNING, "Time range is not valid. Assuming no time.\n");
 | |
| 		return;
 | |
| 	}
 | |
| 	*e = '\0';
 | |
| 	e++;
 | |
| 	while(*e && !isdigit(*e)) e++;
 | |
| 	if (!*e) {
 | |
| 		ast_log(LOG_WARNING, "Invalid time range.  Assuming no time.\n");
 | |
| 		return;
 | |
| 	}
 | |
| 	if (sscanf(times, "%d:%d", &s1, &s2) != 2) {
 | |
| 		ast_log(LOG_WARNING, "%s isn't a time.  Assuming no time.\n", times);
 | |
| 		return;
 | |
| 	}
 | |
| 	if (sscanf(e, "%d:%d", &e1, &e2) != 2) {
 | |
| 		ast_log(LOG_WARNING, "%s isn't a time.  Assuming no time.\n", e);
 | |
| 		return;
 | |
| 	}
 | |
| 	s1 = s1 * 30 + s2/2;
 | |
| 	if ((s1 < 0) || (s1 >= 24*30)) {
 | |
| 		ast_log(LOG_WARNING, "%s isn't a valid star time. Assuming no time.\n", times);
 | |
| 		return;
 | |
| 	}
 | |
| 	e1 = e1 * 30 + e2/2;
 | |
| 	if ((e1 < 0) || (e2 >= 24*30)) {
 | |
| 		ast_log(LOG_WARNING, "%s isn't a valid start time. Assuming no time.\n", times);
 | |
| 		return;
 | |
| 	}
 | |
| 	/* Go through the time and enable each appropriate bit */
 | |
| 	for (x=s1;x != e1;x = (x + 1) % (24 * 30)) {
 | |
| 		i->minmask[x/30] |= (1 << (x % 30));
 | |
| 	}
 | |
| 	/* Do the last one */
 | |
| 	i->minmask[x/30] |= (1 << (x % 30));
 | |
| 	/* All done */
 | |
| }
 | |
| 
 | |
| static char *days[] =
 | |
| {
 | |
| 	"sun",
 | |
| 	"mon",
 | |
| 	"tue",
 | |
| 	"wed",
 | |
| 	"thu",
 | |
| 	"fri",
 | |
| 	"sat",
 | |
| };
 | |
| 
 | |
| static unsigned int get_dow(char *dow)
 | |
| {
 | |
| 	char *c;
 | |
| 	/* The following line is coincidence, really! */
 | |
| 	int s, e, x;
 | |
| 	unsigned int mask;
 | |
| 	/* Check for all days */
 | |
| 	if (!strlen(dow) || !strcmp(dow, "*"))
 | |
| 		return (1 << 7) - 1;
 | |
| 	/* Get start and ending days */
 | |
| 	c = strchr(dow, '-');
 | |
| 	if (c) {
 | |
| 		*c = '\0';
 | |
| 		c++;
 | |
| 	} else
 | |
| 		c = NULL;
 | |
| 	/* Find the start */
 | |
| 	s = 0;
 | |
| 	while((s < 7) && strcasecmp(dow, days[s])) s++;
 | |
| 	if (s >= 7) {
 | |
| 		ast_log(LOG_WARNING, "Invalid day '%s', assuming none\n", dow);
 | |
| 		return 0;
 | |
| 	}
 | |
| 	if (c) {
 | |
| 		e = 0;
 | |
| 		while((e < 7) && strcasecmp(c, days[e])) e++;
 | |
| 		if (e >= 7) {
 | |
| 			ast_log(LOG_WARNING, "Invalid day '%s', assuming none\n", c);
 | |
| 			return 0;
 | |
| 		}
 | |
| 	} else
 | |
| 		e = s;
 | |
| 	mask = 0;
 | |
| 	for (x=s;x!=e;x = (x + 1) % 7) {
 | |
| 		mask |= (1 << x);
 | |
| 	}
 | |
| 	/* One last one */
 | |
| 	mask |= (1 << x);
 | |
| 	return mask;
 | |
| }
 | |
| 
 | |
| static unsigned int get_day(char *day)
 | |
| {
 | |
| 	char *c;
 | |
| 	/* The following line is coincidence, really! */
 | |
| 	int s, e, x;
 | |
| 	unsigned int mask;
 | |
| 	/* Check for all days */
 | |
| 	if (!strlen(day) || !strcmp(day, "*")) {
 | |
| 		mask = (1 << 30)  + ((1 << 30) - 1);
 | |
| 		return mask;
 | |
| 	}
 | |
| 	/* Get start and ending days */
 | |
| 	c = strchr(day, '-');
 | |
| 	if (c) {
 | |
| 		*c = '\0';
 | |
| 		c++;
 | |
| 	}
 | |
| 	/* Find the start */
 | |
| 	if (sscanf(day, "%d", &s) != 1) {
 | |
| 		ast_log(LOG_WARNING, "Invalid day '%s', assuming none\n", day);
 | |
| 		return 0;
 | |
| 	}
 | |
| 	if ((s < 1) || (s > 31)) {
 | |
| 		ast_log(LOG_WARNING, "Invalid day '%s', assuming none\n", day);
 | |
| 		return 0;
 | |
| 	}
 | |
| 	s--;
 | |
| 	if (c) {
 | |
| 		if (sscanf(c, "%d", &e) != 1) {
 | |
| 			ast_log(LOG_WARNING, "Invalid day '%s', assuming none\n", c);
 | |
| 			return 0;
 | |
| 		}
 | |
| 		if ((e < 1) || (e > 31)) {
 | |
| 			ast_log(LOG_WARNING, "Invalid day '%s', assuming none\n", c);
 | |
| 			return 0;
 | |
| 		}
 | |
| 		e--;
 | |
| 	} else
 | |
| 		e = s;
 | |
| 	mask = 0;
 | |
| 	for (x=s;x!=e;x = (x + 1) % 31) {
 | |
| 		mask |= (1 << x);
 | |
| 	}
 | |
| 	mask |= (1 << x);
 | |
| 	return mask;
 | |
| }
 | |
| 
 | |
| static char *months[] =
 | |
| {
 | |
| 	"jan",
 | |
| 	"feb",
 | |
| 	"mar",
 | |
| 	"apr",
 | |
| 	"may",
 | |
| 	"jun",
 | |
| 	"jul",
 | |
| 	"aug",
 | |
| 	"sep",
 | |
| 	"oct",
 | |
| 	"nov",
 | |
| 	"dec",
 | |
| };
 | |
| 
 | |
| static unsigned int get_month(char *mon)
 | |
| {
 | |
| 	char *c;
 | |
| 	/* The following line is coincidence, really! */
 | |
| 	int s, e, x;
 | |
| 	unsigned int mask;
 | |
| 	/* Check for all days */
 | |
| 	if (!strlen(mon) || !strcmp(mon, "*")) 
 | |
| 		return (1 << 12) - 1;
 | |
| 	/* Get start and ending days */
 | |
| 	c = strchr(mon, '-');
 | |
| 	if (c) {
 | |
| 		*c = '\0';
 | |
| 		c++;
 | |
| 	}
 | |
| 	/* Find the start */
 | |
| 	s = 0;
 | |
| 	while((s < 12) && strcasecmp(mon, months[s])) s++;
 | |
| 	if (s >= 12) {
 | |
| 		ast_log(LOG_WARNING, "Invalid month '%s', assuming none\n", mon);
 | |
| 		return 0;
 | |
| 	}
 | |
| 	if (c) {
 | |
| 		e = 0;
 | |
| 		while((e < 12) && strcasecmp(mon, months[e])) e++;
 | |
| 		if (e >= 12) {
 | |
| 			ast_log(LOG_WARNING, "Invalid month '%s', assuming none\n", c);
 | |
| 			return 0;
 | |
| 		}
 | |
| 	} else
 | |
| 		e = s;
 | |
| 	mask = 0;
 | |
| 	for (x=s;x!=e;x = (x + 1) % 12) {
 | |
| 		mask |= (1 << x);
 | |
| 	}
 | |
| 	/* One last one */
 | |
| 	mask |= (1 << x);
 | |
| 	return mask;
 | |
| }
 | |
| 
 | |
| static void build_timing(struct ast_include *i, char *info)
 | |
| {
 | |
| 	char *c;
 | |
| 	/* Check for empty just in case */
 | |
| 	if (!strlen(info))
 | |
| 		return;
 | |
| 	i->hastime = 1;
 | |
| 	/* Assume everything except time */
 | |
| 	i->monthmask = (1 << 12) - 1;
 | |
| 	i->daymask = (1 << 30) - 1 + (1 << 30);
 | |
| 	i->dowmask = (1 << 7) - 1;
 | |
| 	/* Avoid using str tok */
 | |
| 	FIND_NEXT;
 | |
| 	/* Info has the time range, start with that */
 | |
| 	get_timerange(i, info);
 | |
| 	info = c;
 | |
| 	if (!info)
 | |
| 		return;
 | |
| 	FIND_NEXT;
 | |
| 	/* Now check for day of week */
 | |
| 	i->dowmask = get_dow(info);
 | |
| 
 | |
| 	info = c;
 | |
| 	if (!info)
 | |
| 		return;
 | |
| 	FIND_NEXT;
 | |
| 	/* Now check for the day of the month */
 | |
| 	i->daymask = get_day(info);
 | |
| 	info = c;
 | |
| 	if (!info)
 | |
| 		return;
 | |
| 	FIND_NEXT;
 | |
| 	/* And finally go for the month */
 | |
| 	i->monthmask = get_month(info);
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * errno values
 | |
|  *  ENOMEM - out of memory
 | |
|  *  EBUSY  - can't lock
 | |
|  *  EEXIST - already included
 | |
|  *  EINVAL - there is no existence of context for inclusion
 | |
|  */
 | |
| int ast_context_add_include2(struct ast_context *con, char *value,
 | |
| 	char *registrar)
 | |
| {
 | |
| 	struct ast_include *new_include;
 | |
| 	char *c;
 | |
| 	struct ast_include *i, *il = NULL; /* include, include_last */
 | |
| 
 | |
| 	/* allocate new include structure ... */
 | |
| 	if (!(new_include = malloc(sizeof(struct ast_include)))) {
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 		errno = ENOMEM;
 | |
| 		return -1;
 | |
| 	}
 | |
| 	
 | |
| 	/* ... fill in this structure ... */
 | |
| 	memset(new_include, 0, sizeof(struct ast_include));
 | |
| 	strncpy(new_include->name, value, sizeof(new_include->name)-1);
 | |
| 	strncpy(new_include->rname, value, sizeof(new_include->rname)-1);
 | |
| 	c = new_include->rname;
 | |
| 	/* Strip off timing info */
 | |
| 	while(*c && (*c != '|')) c++; 
 | |
| 	/* Process if it's there */
 | |
| 	if (*c) {
 | |
| 		build_timing(new_include, c+1);
 | |
| 		*c = '\0';
 | |
| 	}
 | |
| 	new_include->next      = NULL;
 | |
| 	new_include->registrar = registrar;
 | |
| 
 | |
| 	/* ... try to lock this context ... */
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) {
 | |
| 		free(new_include);
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* ... go to last include and check if context is already included too... */
 | |
| 	i = con->includes;
 | |
| 	while (i) {
 | |
| 		if (!strcasecmp(i->name, new_include->name)) {
 | |
| 			free(new_include);
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			errno = EEXIST;
 | |
| 			return -1;
 | |
| 		}
 | |
| 		il = i;
 | |
| 		i = i->next;
 | |
| 	}
 | |
| 
 | |
| 	/* ... include new context into context list, unlock, return */
 | |
| 	if (il)
 | |
| 		il->next = new_include;
 | |
| 	else
 | |
| 		con->includes = new_include;
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose(VERBOSE_PREFIX_3 "Including context '%s' in context '%s'\n", new_include->name, ast_get_context_name(con)); 
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * errno values
 | |
|  *  EBUSY  - can't lock
 | |
|  *  ENODATA - no existence of context
 | |
|  */
 | |
| int ast_context_add_switch(char *context, char *sw, char *data, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* walk contexts ... */
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		/* ... search for the right one ... */
 | |
| 		if (!strcmp(ast_get_context_name(c), context)) {
 | |
| 			int ret = ast_context_add_switch2(c, sw, data, registrar);
 | |
| 			/* ... unlock contexts list and return */
 | |
| 			ast_unlock_contexts();
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	/* we can't find the right context */
 | |
| 	ast_unlock_contexts();
 | |
| 	errno = ENODATA;
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * errno values
 | |
|  *  ENOMEM - out of memory
 | |
|  *  EBUSY  - can't lock
 | |
|  *  EEXIST - already included
 | |
|  *  EINVAL - there is no existence of context for inclusion
 | |
|  */
 | |
| int ast_context_add_switch2(struct ast_context *con, char *value,
 | |
| 	char *data, char *registrar)
 | |
| {
 | |
| 	struct ast_sw *new_sw;
 | |
| 	struct ast_sw *i, *il = NULL; /* sw, sw_last */
 | |
| 
 | |
| 	/* allocate new sw structure ... */
 | |
| 	if (!(new_sw = malloc(sizeof(struct ast_sw)))) {
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 		errno = ENOMEM;
 | |
| 		return -1;
 | |
| 	}
 | |
| 	
 | |
| 	/* ... fill in this structure ... */
 | |
| 	memset(new_sw, 0, sizeof(struct ast_sw));
 | |
| 	strncpy(new_sw->name, value, sizeof(new_sw->name)-1);
 | |
| 	if (data)
 | |
| 		strncpy(new_sw->data, data, sizeof(new_sw->data)-1);
 | |
| 	else
 | |
| 		strncpy(new_sw->data, "", sizeof(new_sw->data)-1);
 | |
| 	new_sw->next      = NULL;
 | |
| 	new_sw->registrar = registrar;
 | |
| 
 | |
| 	/* ... try to lock this context ... */
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) {
 | |
| 		free(new_sw);
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	/* ... go to last sw and check if context is already swd too... */
 | |
| 	i = con->alts;
 | |
| 	while (i) {
 | |
| 		if (!strcasecmp(i->name, new_sw->name)) {
 | |
| 			free(new_sw);
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			errno = EEXIST;
 | |
| 			return -1;
 | |
| 		}
 | |
| 		il = i;
 | |
| 		i = i->next;
 | |
| 	}
 | |
| 
 | |
| 	/* ... sw new context into context list, unlock, return */
 | |
| 	if (il)
 | |
| 		il->next = new_sw;
 | |
| 	else
 | |
| 		con->alts = new_sw;
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose(VERBOSE_PREFIX_3 "Including switch '%s/%s' in context '%s'\n", new_sw->name, new_sw->data, ast_get_context_name(con)); 
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * EBUSY  - can't lock
 | |
|  * ENODATA - there is not context existence
 | |
|  */
 | |
| int ast_context_remove_ignorepat(char *context, char *ignorepat, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		if (!strcmp(ast_get_context_name(c), context)) {
 | |
| 			int ret = ast_context_remove_ignorepat2(c, ignorepat, registrar);
 | |
| 			ast_unlock_contexts();
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	ast_unlock_contexts();
 | |
| 	errno = ENODATA;
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| int ast_context_remove_ignorepat2(struct ast_context *con, char *ignorepat, char *registrar)
 | |
| {
 | |
| 	struct ast_ignorepat *ip, *ipl = NULL;
 | |
| 
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) {
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	ip = con->ignorepats;
 | |
| 	while (ip) {
 | |
| 		if (!strcmp(ip->pattern, ignorepat) &&
 | |
| 			(registrar == ip->registrar || !registrar)) {
 | |
| 			if (ipl) {
 | |
| 				ipl->next = ip->next;
 | |
| 				free(ip);
 | |
| 			} else {
 | |
| 				con->ignorepats = ip->next;
 | |
| 				free(ip);
 | |
| 			}
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			return 0;
 | |
| 		}
 | |
| 		ipl = ip; ip = ip->next;
 | |
| 	}
 | |
| 
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 	errno = EINVAL;
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * EBUSY - can't lock
 | |
|  * ENODATA - there is no existence of context
 | |
|  */
 | |
| int ast_context_add_ignorepat(char *con, char *value, char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		if (!strcmp(ast_get_context_name(c), con)) {
 | |
| 			int ret = ast_context_add_ignorepat2(c, value, registrar);
 | |
| 			ast_unlock_contexts();
 | |
| 			return ret;
 | |
| 		} 
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	ast_unlock_contexts();
 | |
| 	errno = ENODATA;
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| int ast_context_add_ignorepat2(struct ast_context *con, char *value, char *registrar)
 | |
| {
 | |
| 	struct ast_ignorepat *ignorepat, *ignorepatc, *ignorepatl = NULL;
 | |
| 	ignorepat = malloc(sizeof(struct ast_ignorepat));
 | |
| 	if (!ignorepat) {
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 		errno = ENOMEM;
 | |
| 		return -1;
 | |
| 	}
 | |
| 	memset(ignorepat, 0, sizeof(struct ast_ignorepat));
 | |
| 	strncpy(ignorepat->pattern, value, sizeof(ignorepat->pattern)-1);
 | |
| 	ignorepat->next = NULL;
 | |
| 	ignorepat->registrar = registrar;
 | |
| 	ast_pthread_mutex_lock(&con->lock);
 | |
| 	ignorepatc = con->ignorepats;
 | |
| 	while(ignorepatc) {
 | |
| 		ignorepatl = ignorepatc;
 | |
| 		if (!strcasecmp(ignorepatc->pattern, value)) {
 | |
| 			/* Already there */
 | |
| 			pthread_mutex_unlock(&con->lock);
 | |
| 			errno = EEXIST;
 | |
| 			return -1;
 | |
| 		}
 | |
| 		ignorepatc = ignorepatc->next;
 | |
| 	}
 | |
| 	if (ignorepatl) 
 | |
| 		ignorepatl->next = ignorepat;
 | |
| 	else
 | |
| 		con->ignorepats = ignorepat;
 | |
| 	pthread_mutex_unlock(&con->lock);
 | |
| 	return 0;
 | |
| 	
 | |
| }
 | |
| 
 | |
| int ast_ignore_pattern(char *context, char *pattern)
 | |
| {
 | |
| 	struct ast_context *con;
 | |
| 	struct ast_ignorepat *pat;
 | |
| 	con = ast_context_find(context);
 | |
| 	if (con) {
 | |
| 		pat = con->ignorepats;
 | |
| 		while (pat) {
 | |
| 			if (ast_extension_match(pat->pattern, pattern))
 | |
| 				return 1;
 | |
| 			pat = pat->next;
 | |
| 		}
 | |
| 	} 
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * EBUSY   - can't lock
 | |
|  * ENODATA  - no existence of context
 | |
|  *
 | |
|  */
 | |
| int ast_add_extension(char *context, int replace, char *extension, int priority, char *callerid,
 | |
| 	char *application, void *data, void (*datad)(void *), char *registrar)
 | |
| {
 | |
| 	struct ast_context *c;
 | |
| 
 | |
| 	if (ast_lock_contexts()) {
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	c = ast_walk_contexts(NULL);
 | |
| 	while (c) {
 | |
| 		if (!strcmp(context, ast_get_context_name(c))) {
 | |
| 			int ret = ast_add_extension2(c, replace, extension, priority, callerid,
 | |
| 				application, data, datad, registrar);
 | |
| 			ast_unlock_contexts();
 | |
| 			return ret;
 | |
| 		}
 | |
| 		c = ast_walk_contexts(c);
 | |
| 	}
 | |
| 
 | |
| 	ast_unlock_contexts();
 | |
| 	errno = ENODATA;
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| int ast_async_goto(struct ast_channel *chan, char *context, char *exten, int priority, int needlock)
 | |
| {
 | |
| 	int res = 0;
 | |
| 	if (needlock)
 | |
| 		ast_pthread_mutex_lock(&chan->lock);
 | |
| 	if (chan->pbx) {
 | |
| 		/* This channel is currently in the PBX */
 | |
| 		if (context && strlen(context))
 | |
| 			strncpy(chan->context, context, sizeof(chan->context) - 1);
 | |
| 		if (exten && strlen(exten))
 | |
| 			strncpy(chan->exten, exten, sizeof(chan->context) - 1);
 | |
| 		if (priority)
 | |
| 			chan->priority = priority - 1;
 | |
| 		ast_softhangup_nolock(chan, AST_SOFTHANGUP_ASYNCGOTO);
 | |
| 		if (needlock)
 | |
| 			ast_pthread_mutex_unlock(&chan->lock);
 | |
| 	} else {
 | |
| 		/* In order to do it when the channel doesn't really exist within
 | |
| 		   the PBX, we have to make a new channel, masquerade, and start the PBX
 | |
| 		   at the new location */
 | |
| 		struct ast_channel *tmpchan;
 | |
| 		struct ast_frame *f;
 | |
| 		tmpchan = ast_channel_alloc(0);
 | |
| 		if (tmpchan) {
 | |
| 			snprintf(tmpchan->name, sizeof(tmpchan->name), "AsyncGoto/%s", chan->name);
 | |
| 			ast_setstate(tmpchan, chan->_state);
 | |
| 			/* Make formats okay */
 | |
| 			tmpchan->readformat = chan->readformat;
 | |
| 			tmpchan->writeformat = chan->writeformat;
 | |
| 			/* Setup proper location */
 | |
| 			if (context && strlen(context))
 | |
| 				strncpy(tmpchan->context, context, sizeof(tmpchan->context) - 1);
 | |
| 			else
 | |
| 				strncpy(tmpchan->context, chan->context, sizeof(tmpchan->context) - 1);
 | |
| 			if (exten && strlen(exten))
 | |
| 				strncpy(tmpchan->exten, exten, sizeof(tmpchan->exten) - 1);
 | |
| 			else
 | |
| 				strncpy(tmpchan->exten, chan->exten, sizeof(tmpchan->exten) - 1);
 | |
| 			if (priority)
 | |
| 				tmpchan->priority = priority;
 | |
| 			else
 | |
| 				tmpchan->priority = chan->priority;
 | |
| 			if (needlock)
 | |
| 				ast_pthread_mutex_unlock(&chan->lock);
 | |
| 			
 | |
| 			/* Masquerade into temp channel */
 | |
| 			ast_channel_masquerade(tmpchan, chan);
 | |
| 			
 | |
| 			/* Make the masquerade happen by reading a frame from the tmp channel */
 | |
| 			f = ast_read(tmpchan);
 | |
| 			if (f)
 | |
| 				ast_frfree(f);
 | |
| 			/* Start the PBX going on our stolen channel */
 | |
| 			if (ast_pbx_start(tmpchan)) {
 | |
| 				ast_log(LOG_WARNING, "Unable to start PBX on %s\n", tmpchan->name);
 | |
| 				ast_hangup(tmpchan);
 | |
| 				res = -1;
 | |
| 			}
 | |
| 		} else {
 | |
| 			res = -1;
 | |
| 			if (needlock)
 | |
| 				ast_pthread_mutex_unlock(&chan->lock);
 | |
| 		}
 | |
| 	}
 | |
| 	return res;
 | |
| }
 | |
| 
 | |
| int ast_async_goto_by_name(char *channame, char *context, char *exten, int priority)
 | |
| {
 | |
| 	struct ast_channel *chan;
 | |
| 	chan = ast_channel_walk(NULL);
 | |
| 	while(chan) {
 | |
| 		if (!strcasecmp(channame, chan->name))
 | |
| 			break;
 | |
| 		chan = ast_channel_walk(chan);
 | |
| 	}
 | |
| 	if (chan)
 | |
| 		return ast_async_goto(chan, context, exten, priority, 1);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| static void ext_strncpy(char *dst, char *src, int len)
 | |
| {
 | |
| 	int count=0;
 | |
| 	while(*src && (count < len - 1)) {
 | |
| 		switch(*src) {
 | |
| 		case ' ':
 | |
| //otherwise exten => [a-b],1,... doesn't work
 | |
| //		case '-':
 | |
| 			/* Ignore */
 | |
| 			break;
 | |
| 		default:
 | |
| 			*dst = *src;
 | |
| 			dst++;
 | |
| 		}
 | |
| 		src++;
 | |
| 		count++;
 | |
| 	}
 | |
| 	*dst = '\0';
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * EBUSY - can't lock
 | |
|  * EEXIST - extension with the same priority exist and no replace is set
 | |
|  *
 | |
|  */
 | |
| int ast_add_extension2(struct ast_context *con,
 | |
| 					  int replace, char *extension, int priority, char *callerid,
 | |
| 					  char *application, void *data, void (*datad)(void *),
 | |
| 					  char *registrar)
 | |
| {
 | |
| 
 | |
| #define LOG do { 	if (option_debug) {\
 | |
| 		if (tmp->matchcid) { \
 | |
| 			ast_log(LOG_DEBUG, "Added extension '%s' priority %d (CID match '%s') to %s\n", tmp->exten, tmp->priority, tmp->cidmatch, con->name); \
 | |
| 		} else { \
 | |
| 			ast_log(LOG_DEBUG, "Added extension '%s' priority %d to %s\n", tmp->exten, tmp->priority, con->name); \
 | |
| 		} \
 | |
| 	} else if (option_verbose > 2) { \
 | |
| 		if (tmp->matchcid) { \
 | |
| 			ast_verbose( VERBOSE_PREFIX_3 "Added extension '%s' priority %d (CID match '%s')to %s\n", tmp->exten, tmp->priority, tmp->cidmatch, con->name); \
 | |
| 		} else {  \
 | |
| 			ast_verbose( VERBOSE_PREFIX_3 "Added extension '%s' priority %d to %s\n", tmp->exten, tmp->priority, con->name); \
 | |
| 		} \
 | |
| 	} } while(0)
 | |
| 
 | |
| 	/*
 | |
| 	 * This is a fairly complex routine.  Different extensions are kept
 | |
| 	 * in order by the extension number.  Then, extensions of different
 | |
| 	 * priorities (same extension) are kept in a list, according to the
 | |
| 	 * peer pointer.
 | |
| 	 */
 | |
| 	struct ast_exten *tmp, *e, *el = NULL, *ep = NULL;
 | |
| 	int res;
 | |
| 	/* Be optimistic:  Build the extension structure first */
 | |
| 	tmp = malloc(sizeof(struct ast_exten));
 | |
| 	if (tmp) {
 | |
| 		memset(tmp, 0, sizeof(struct ast_exten));
 | |
| 		ext_strncpy(tmp->exten, extension, sizeof(tmp->exten));
 | |
| 		tmp->priority = priority;
 | |
| 		if (callerid) {
 | |
| 			ext_strncpy(tmp->cidmatch, callerid, sizeof(tmp->cidmatch));
 | |
| 			tmp->matchcid = 1;
 | |
| 		} else {
 | |
| 			strcpy(tmp->cidmatch, "");
 | |
| 			tmp->matchcid = 0;
 | |
| 		}
 | |
| 		strncpy(tmp->app, application, sizeof(tmp->app)-1);
 | |
| 		tmp->parent = con;
 | |
| 		tmp->data = data;
 | |
| 		tmp->datad = datad;
 | |
| 		tmp->registrar = registrar;
 | |
| 		tmp->peer = NULL;
 | |
| 		tmp->next =  NULL;
 | |
| 	} else {
 | |
| 		ast_log(LOG_WARNING, "Out of memory\n");
 | |
| 		errno = ENOMEM;
 | |
| 		return -1;
 | |
| 	}
 | |
| 	if (ast_pthread_mutex_lock(&con->lock)) {
 | |
| 		free(tmp);
 | |
| 		/* And properly destroy the data */
 | |
| 		datad(data);
 | |
| 		ast_log(LOG_WARNING, "Failed to lock context '%s'\n", con->name);
 | |
| 		errno = EBUSY;
 | |
| 		return -1;
 | |
| 	}
 | |
| 	e = con->root;
 | |
| 	while(e) {
 | |
| 		res= strcasecmp(e->exten, extension);
 | |
| 		if (!res) {
 | |
| 			if (!e->matchcid && !tmp->matchcid)
 | |
| 				res = 0;
 | |
| 			else if (tmp->matchcid && !e->matchcid)
 | |
| 				res = 1;
 | |
| 			else if (e->matchcid && !tmp->matchcid)
 | |
| 				res = -1;
 | |
| 			else
 | |
| 				res = strcasecmp(e->cidmatch, tmp->cidmatch);
 | |
| 		}
 | |
| 		if (res == 0) {
 | |
| 			/* We have an exact match, now we find where we are
 | |
| 			   and be sure there's no duplicates */
 | |
| 			while(e) {
 | |
| 				if (e->priority == tmp->priority) {
 | |
| 					/* Can't have something exactly the same.  Is this a
 | |
| 					   replacement?  If so, replace, otherwise, bonk. */
 | |
| 					if (replace) {
 | |
| 						if (ep) {
 | |
| 							/* We're in the peer list, insert ourselves */
 | |
| 							ep->peer = tmp;
 | |
| 							tmp->peer = e->peer;
 | |
| 						} else if (el) {
 | |
| 							/* We're the first extension. Take over e's functions */
 | |
| 							el->next = tmp;
 | |
| 							tmp->next = e->next;
 | |
| 							tmp->peer = e->peer;
 | |
| 						} else {
 | |
| 							/* We're the very first extension.  */
 | |
| 							con->root = tmp;
 | |
| 							tmp->next = e->next;
 | |
| 							tmp->peer = e->peer;
 | |
| 						}
 | |
| 						if (tmp->priority == PRIORITY_HINT)
 | |
| 						    ast_change_hint(e,tmp);
 | |
| 						/* Destroy the old one */
 | |
| 						e->datad(e->data);
 | |
| 						free(e);
 | |
| 						ast_pthread_mutex_unlock(&con->lock);
 | |
| 						if (tmp->priority == PRIORITY_HINT)
 | |
| 						    ast_change_hint(e, tmp);
 | |
| 						/* And immediately return success. */
 | |
| 						LOG;
 | |
| 						return 0;
 | |
| 					} else {
 | |
| 						ast_log(LOG_WARNING, "Unable to register extension '%s', priority %d in '%s', already in use\n", tmp->exten, tmp->priority, con->name);
 | |
| 						tmp->datad(tmp->data);
 | |
| 						free(tmp);
 | |
| 						ast_pthread_mutex_unlock(&con->lock);
 | |
| 						errno = EEXIST;
 | |
| 						return -1;
 | |
| 					}
 | |
| 				} else if (e->priority > tmp->priority) {
 | |
| 					/* Slip ourselves in just before e */
 | |
| 					if (ep) {
 | |
| 						/* Easy enough, we're just in the peer list */
 | |
| 						ep->peer = tmp;
 | |
| 						tmp->peer = e;
 | |
| 					} else if (el) {
 | |
| 						/* We're the first extension in this peer list */
 | |
| 						el->next = tmp;
 | |
| 						tmp->next = e->next;
 | |
| 						e->next = NULL;
 | |
| 						tmp->peer = e;
 | |
| 					} else {
 | |
| 						/* We're the very first extension altogether */
 | |
| 						tmp->next = con->root;
 | |
| 						/* Con->root must always exist or we couldn't get here */
 | |
| 						tmp->peer = con->root->peer;
 | |
| 						con->root = tmp;
 | |
| 					}
 | |
| 					ast_pthread_mutex_unlock(&con->lock);
 | |
| 					/* And immediately return success. */
 | |
| 					if (tmp->priority == PRIORITY_HINT)
 | |
| 					    ast_add_hint(tmp);
 | |
| 					
 | |
| 					LOG;
 | |
| 					return 0;
 | |
| 				}
 | |
| 				ep = e;
 | |
| 				e = e->peer;
 | |
| 			}
 | |
| 			/* If we make it here, then it's time for us to go at the very end.
 | |
| 			   ep *must* be defined or we couldn't have gotten here. */
 | |
| 			ep->peer = tmp;
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			if (tmp->priority == PRIORITY_HINT)
 | |
| 			    ast_add_hint(tmp);
 | |
| 			
 | |
| 			/* And immediately return success. */
 | |
| 			LOG;
 | |
| 			return 0;
 | |
| 				
 | |
| 		} else if (res > 0) {
 | |
| 			/* Insert ourselves just before 'e'.  We're the first extension of
 | |
| 			   this kind */
 | |
| 			tmp->next = e;
 | |
| 			if (el) {
 | |
| 				/* We're in the list somewhere */
 | |
| 				el->next = tmp;
 | |
| 			} else {
 | |
| 				/* We're at the top of the list */
 | |
| 				con->root = tmp;
 | |
| 			}
 | |
| 			ast_pthread_mutex_unlock(&con->lock);
 | |
| 			if (tmp->priority == PRIORITY_HINT)
 | |
| 			    ast_add_hint(tmp);
 | |
| 
 | |
| 			/* And immediately return success. */
 | |
| 			LOG;
 | |
| 			return 0;
 | |
| 		}			
 | |
| 			
 | |
| 		el = e;
 | |
| 		e = e->next;
 | |
| 	}
 | |
| 	/* If we fall all the way through to here, then we need to be on the end. */
 | |
| 	if (el)
 | |
| 		el->next = tmp;
 | |
| 	else
 | |
| 		con->root = tmp;
 | |
| 	ast_pthread_mutex_unlock(&con->lock);
 | |
| 	if (tmp->priority == PRIORITY_HINT)
 | |
| 	    ast_add_hint(tmp);
 | |
| 	LOG;
 | |
| 	return 0;	
 | |
| }
 | |
| 
 | |
| struct async_stat {
 | |
| 	pthread_t p;
 | |
| 	struct ast_channel *chan;
 | |
| 	char context[AST_MAX_EXTENSION];
 | |
| 	char exten[AST_MAX_EXTENSION];
 | |
| 	int priority;
 | |
| 	int timeout;
 | |
| 	char app[AST_MAX_EXTENSION];
 | |
| 	char appdata[1024];
 | |
| };
 | |
| 
 | |
| static void *async_wait(void *data) 
 | |
| {
 | |
| 	struct async_stat *as = data;
 | |
| 	struct ast_channel *chan = as->chan;
 | |
| 	int timeout = as->timeout;
 | |
| 	int res;
 | |
| 	struct ast_frame *f;
 | |
| 	struct ast_app *app;
 | |
| 	
 | |
| 	while(timeout && (chan->_state != AST_STATE_UP)) {
 | |
| 		res = ast_waitfor(chan, timeout);
 | |
| 		if (res < 1) 
 | |
| 			break;
 | |
| 		if (timeout > -1)
 | |
| 			timeout = res;
 | |
| 		f = ast_read(chan);
 | |
| 		if (!f)
 | |
| 			break;
 | |
| 		if (f->frametype == AST_FRAME_CONTROL) {
 | |
| 			if ((f->subclass == AST_CONTROL_BUSY)  ||
 | |
| 				(f->subclass == AST_CONTROL_CONGESTION) )
 | |
| 					break;
 | |
| 		}
 | |
| 		ast_frfree(f);
 | |
| 	}
 | |
| 	if (chan->_state == AST_STATE_UP) {
 | |
| 		if (strlen(as->app)) {
 | |
| 			app = pbx_findapp(as->app);
 | |
| 			if (app) {
 | |
| 				if (option_verbose > 2)
 | |
| 					ast_verbose(VERBOSE_PREFIX_3 "Lauching %s(%s) on %s\n", as->app, as->appdata, chan->name);
 | |
| 				pbx_exec(chan, app, as->appdata, 1);
 | |
| 			} else
 | |
| 				ast_log(LOG_WARNING, "No such application '%s'\n", as->app);
 | |
| 		} else {
 | |
| 			if (strlen(as->context))
 | |
| 				strncpy(chan->context, as->context, sizeof(chan->context) - 1);
 | |
| 			if (strlen(as->exten))
 | |
| 				strncpy(chan->exten, as->exten, sizeof(chan->exten) - 1);
 | |
| 			if (as->priority > 0)
 | |
| 				chan->priority = as->priority;
 | |
| 			/* Run the PBX */
 | |
| 			if (ast_pbx_run(chan)) {
 | |
| 				ast_log(LOG_WARNING, "Failed to start PBX on %s\n", chan->name);
 | |
| 			} else {
 | |
| 				/* PBX will have taken care of this */
 | |
| 				chan = NULL;
 | |
| 			}
 | |
| 		}
 | |
| 			
 | |
| 	}
 | |
| 	free(as);
 | |
| 	if (chan)
 | |
| 		ast_hangup(chan);
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| int ast_pbx_outgoing_exten(char *type, int format, void *data, int timeout, char *context, char *exten, int priority, int *reason, int sync, char *callerid, char *variable )
 | |
| {
 | |
| 	struct ast_channel *chan;
 | |
| 	struct async_stat *as;
 | |
| 	int res = -1;
 | |
| 	char *var, *tmp;
 | |
| 	if (sync) {
 | |
| 		chan = ast_request_and_dial(type, format, data, timeout, reason, callerid);
 | |
| 		if (chan) {
 | |
| 			/* JDG chanvar */
 | |
| 			tmp = variable;
 | |
| 			/* FIXME replace this call with strsep  NOT*/
 | |
| 			while( (var = strtok_r(NULL, "|", &tmp)) ) {
 | |
| 				pbx_builtin_setvar( chan, var );
 | |
| 			} /* /JDG */
 | |
| 			if (chan->_state == AST_STATE_UP) {
 | |
| 				res = 0;
 | |
| 				if (option_verbose > 3)
 | |
| 					ast_verbose(VERBOSE_PREFIX_4 "Channel %s was answered.\n", chan->name);
 | |
| 				if (context && strlen(context))
 | |
| 					strncpy(chan->context, context, sizeof(chan->context) - 1);
 | |
| 				if (exten && strlen(exten))
 | |
| 					strncpy(chan->exten, exten, sizeof(chan->exten) - 1);
 | |
| 				if (callerid && strlen(callerid))
 | |
| 					strncpy(chan->callerid, callerid, sizeof(chan->callerid) - 1);
 | |
| 				if (priority > 0)
 | |
| 					chan->priority = priority;
 | |
| 				if (sync > 1) {
 | |
| 					if (ast_pbx_run(chan)) {
 | |
| 						ast_log(LOG_WARNING, "Unable to run PBX on %s\n", chan->name);
 | |
| 						ast_hangup(chan);
 | |
| 						res = -1;
 | |
| 					}
 | |
| 				} else {
 | |
| 					if (ast_pbx_start(chan)) {
 | |
| 						ast_log(LOG_WARNING, "Unable to start PBX on %s\n", chan->name);
 | |
| 						ast_hangup(chan);
 | |
| 						res = -1;
 | |
| 					} 
 | |
| 				}
 | |
| 			} else {
 | |
| 				if (option_verbose > 3)
 | |
| 					ast_verbose(VERBOSE_PREFIX_4 "Channel %s was never answered.\n", chan->name);
 | |
| 				ast_hangup(chan);
 | |
| 			}
 | |
| 		}
 | |
| 	} else {
 | |
| 		as = malloc(sizeof(struct async_stat));
 | |
| 		if (!as)
 | |
| 			return -1;
 | |
| 		memset(as, 0, sizeof(struct async_stat));
 | |
| 		chan = ast_request_and_dial(type, format, data, 0, reason, callerid);
 | |
| 		if (!chan) {
 | |
| 			free(as);
 | |
| 			return -1;
 | |
| 		}
 | |
| 		as->chan = chan;
 | |
| 		strncpy(as->context, context, sizeof(as->context) - 1);
 | |
| 		strncpy(as->exten,  exten, sizeof(as->exten) - 1);
 | |
| 		as->priority = priority;
 | |
| 		as->timeout = timeout;
 | |
| 		if (pthread_create(&as->p, NULL, async_wait, as)) {
 | |
| 			ast_log(LOG_WARNING, "Failed to start async wait\n");
 | |
| 			free(as);
 | |
| 			ast_hangup(chan);
 | |
| 			return -1;
 | |
| 		}
 | |
| 		res = 0;
 | |
| 	}
 | |
| 	return res;
 | |
| }
 | |
| 
 | |
| struct app_tmp {
 | |
| 	char app[256];
 | |
| 	char data[256];
 | |
| 	struct ast_channel *chan;
 | |
| 	pthread_t t;
 | |
| };
 | |
| 
 | |
| static void *ast_pbx_run_app(void *data)
 | |
| {
 | |
| 	struct app_tmp *tmp = data;
 | |
| 	struct ast_app *app;
 | |
| 	app = pbx_findapp(tmp->app);
 | |
| 	if (app) {
 | |
| 		if (option_verbose > 3)
 | |
| 			ast_verbose(VERBOSE_PREFIX_4 "Lauching %s(%s) on %s\n", tmp->app, tmp->data, tmp->chan->name);
 | |
| 		pbx_exec(tmp->chan, app, tmp->data, 1);
 | |
| 	} else
 | |
| 		ast_log(LOG_WARNING, "No such application '%s'\n", tmp->app);
 | |
| 	ast_hangup(tmp->chan);
 | |
| 	free(tmp);
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| int ast_pbx_outgoing_app(char *type, int format, void *data, int timeout, char *app, char *appdata, int *reason, int sync, char *callerid)
 | |
| {
 | |
| 	struct ast_channel *chan;
 | |
| 	struct async_stat *as;
 | |
| 	struct app_tmp *tmp;
 | |
| 	int res = -1;
 | |
| 	if (!app || !strlen(app))
 | |
| 		return -1;
 | |
| 	if (sync) {
 | |
| 		chan = ast_request_and_dial(type, format, data, timeout, reason, callerid);
 | |
| 		if (chan) {
 | |
| 			if (chan->_state == AST_STATE_UP) {
 | |
| 				res = 0;
 | |
| 				if (option_verbose > 3)
 | |
| 					ast_verbose(VERBOSE_PREFIX_4 "Channel %s was answered.\n", chan->name);
 | |
| 				tmp = malloc(sizeof(struct app_tmp));
 | |
| 				if (tmp) {
 | |
| 					memset(tmp, 0, sizeof(struct app_tmp));
 | |
| 					strncpy(tmp->app, app, sizeof(tmp->app) - 1);
 | |
| 					strncpy(tmp->data, appdata, sizeof(tmp->data) - 1);
 | |
| 					tmp->chan = chan;
 | |
| 					if (sync > 1) {
 | |
| 						ast_pbx_run_app(tmp);
 | |
| 					} else {
 | |
| 						if (pthread_create(&tmp->t, NULL, ast_pbx_run_app, tmp)) {
 | |
| 							ast_log(LOG_WARNING, "Unable to spawn execute thread on %s: %s\n", chan->name, strerror(errno));
 | |
| 							free(tmp);
 | |
| 							ast_hangup(chan);
 | |
| 							res = -1;
 | |
| 						}
 | |
| 					}
 | |
| 				} else {
 | |
| 					ast_log(LOG_WARNING, "Out of memory :(\n");
 | |
| 					res = -1;
 | |
| 				}
 | |
| 			} else {
 | |
| 				if (option_verbose > 3)
 | |
| 					ast_verbose(VERBOSE_PREFIX_4 "Channel %s was never answered.\n", chan->name);
 | |
| 				ast_hangup(chan);
 | |
| 			}
 | |
| 		}
 | |
| 	} else {
 | |
| 		as = malloc(sizeof(struct async_stat));
 | |
| 		if (!as)
 | |
| 			return -1;
 | |
| 		memset(as, 0, sizeof(struct async_stat));
 | |
| 		chan = ast_request_and_dial(type, format, data, 0, reason, callerid);
 | |
| 		if (!chan) {
 | |
| 			free(as);
 | |
| 			return -1;
 | |
| 		}
 | |
| 		as->chan = chan;
 | |
| 		strncpy(as->app, app, sizeof(as->app) - 1);
 | |
| 		if (appdata)
 | |
| 			strncpy(as->appdata,  appdata, sizeof(as->appdata) - 1);
 | |
| 		as->timeout = timeout;
 | |
| 		if (pthread_create(&as->p, NULL, async_wait, as)) {
 | |
| 			ast_log(LOG_WARNING, "Failed to start async wait\n");
 | |
| 			free(as);
 | |
| 			ast_hangup(chan);
 | |
| 			return -1;
 | |
| 		}
 | |
| 		res = 0;
 | |
| 	}
 | |
| 	return res;
 | |
| }
 | |
| 
 | |
| static void destroy_exten(struct ast_exten *e)
 | |
| {
 | |
| 	if (e->priority == PRIORITY_HINT)
 | |
| 		ast_remove_hint(e);
 | |
| 
 | |
| 	if (e->datad)
 | |
| 		e->datad(e->data);
 | |
| 	free(e);
 | |
| }
 | |
| 
 | |
| void ast_context_destroy(struct ast_context *con, char *registrar)
 | |
| {
 | |
| 	struct ast_context *tmp, *tmpl=NULL;
 | |
| 	struct ast_include *tmpi, *tmpil= NULL;
 | |
| 	struct ast_sw *sw, *swl= NULL;
 | |
| 	struct ast_exten *e, *el, *en;
 | |
| 	ast_pthread_mutex_lock(&conlock);
 | |
| 	tmp = contexts;
 | |
| 	while(tmp) {
 | |
| 		if (((tmp == con) || !con) &&
 | |
| 		    (!registrar || !strcasecmp(registrar, tmp->registrar))) {
 | |
| 			/* Okay, let's lock the structure to be sure nobody else
 | |
| 			   is searching through it. */
 | |
| 			if (ast_pthread_mutex_lock(&tmp->lock)) {
 | |
| 				ast_log(LOG_WARNING, "Unable to lock context lock\n");
 | |
| 				return;
 | |
| 			}
 | |
| 			if (tmpl)
 | |
| 				tmpl->next = tmp->next;
 | |
| 			else
 | |
| 				contexts = tmp->next;
 | |
| 			/* Okay, now we're safe to let it go -- in a sense, we were
 | |
| 			   ready to let it go as soon as we locked it. */
 | |
| 			ast_pthread_mutex_unlock(&tmp->lock);
 | |
| 			for (tmpi = tmp->includes; tmpi; ) {
 | |
| 				/* Free includes */
 | |
| 				tmpil = tmpi;
 | |
| 				tmpi = tmpi->next;
 | |
| 				free(tmpil);
 | |
| 				tmpil = tmpi;
 | |
| 			}
 | |
| 			for (sw = tmp->alts; sw; ) {
 | |
| 				swl = sw;
 | |
| 				sw = sw->next;
 | |
| 				free(swl);
 | |
| 				swl = sw;
 | |
| 			}
 | |
| 			for (e = tmp->root; e;) {
 | |
| 				for (en = e->peer; en;) {
 | |
| 					el = en;
 | |
| 					en = en->peer;
 | |
| 					destroy_exten(el);
 | |
| 				}
 | |
| 				el = e;
 | |
| 				e = e->next;
 | |
| 				destroy_exten(el);
 | |
| 			}
 | |
| 			free(tmp);
 | |
| 			if (!con) {
 | |
| 				/* Might need to get another one -- restart */
 | |
| 				tmp = contexts;
 | |
| 				tmpl = NULL;
 | |
| 				tmpil = NULL;
 | |
| 				continue;
 | |
| 			}
 | |
| 			ast_pthread_mutex_unlock(&conlock);
 | |
| 			return;
 | |
| 		}
 | |
| 		tmpl = tmp;
 | |
| 		tmp = tmp->next;
 | |
| 	}
 | |
| 	ast_pthread_mutex_unlock(&conlock);
 | |
| }
 | |
| 
 | |
| static void wait_for_hangup(struct ast_channel *chan)
 | |
| {
 | |
| 	int res;
 | |
| 	struct ast_frame *f;
 | |
| 	do {
 | |
| 		res = ast_waitfor(chan, -1);
 | |
| 		if (res < 0)
 | |
| 			return;
 | |
| 		f = ast_read(chan);
 | |
| 		if (f)
 | |
| 			ast_frfree(f);
 | |
| 	} while(f);
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_ringing(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	ast_indicate(chan, AST_CONTROL_RINGING);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_busy(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	ast_indicate(chan, AST_CONTROL_BUSY);		
 | |
| 	wait_for_hangup(chan);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_congestion(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	ast_indicate(chan, AST_CONTROL_CONGESTION);
 | |
| 	wait_for_hangup(chan);
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_answer(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	return ast_answer(chan);
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_setlanguage(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	/* Copy the language as specified */
 | |
| 	strncpy(chan->language, (char *)data, sizeof(chan->language)-1);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_hangup(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	/* Just return non-zero and it will hang up */
 | |
| 	return -1;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_stripmsd(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	char newexten[AST_MAX_EXTENSION] = "";
 | |
| 	if (!data || !atoi(data)) {
 | |
| 		ast_log(LOG_DEBUG, "Ignoring, since number of digits to strip is 0\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 	if (strlen(chan->exten) > atoi(data)) {
 | |
| 		strncpy(newexten, chan->exten + atoi(data), sizeof(newexten)-1);
 | |
| 	}
 | |
| 	strncpy(chan->exten, newexten, sizeof(chan->exten)-1);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_prefix(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	char newexten[AST_MAX_EXTENSION] = "";
 | |
| 	if (!data || !strlen(data)) {
 | |
| 		ast_log(LOG_DEBUG, "Ignoring, since there is no prefix to add\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 	snprintf(newexten, sizeof(newexten), "%s%s", (char *)data, chan->exten);
 | |
| 	strncpy(chan->exten, newexten, sizeof(chan->exten)-1);
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose(VERBOSE_PREFIX_3 "Prepended prefix, new extension is %s\n", chan->exten);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_wait(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	int ms;
 | |
| 	/* Wait for "n" seconds */
 | |
| 	if (data && atoi((char *)data)) {
 | |
| 		ms = atoi((char *)data) * 1000;
 | |
| 		return ast_safe_sleep(chan, ms);
 | |
| 	}
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_background(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	int res;
 | |
| 	/* Answer if need be */
 | |
| 	if (chan->_state != AST_STATE_UP)
 | |
| 		if (ast_answer(chan))
 | |
| 			return -1;
 | |
| 	/* Stop anything playing */
 | |
| 	ast_stopstream(chan);
 | |
| 	/* Stream a file */
 | |
| 	res = ast_streamfile(chan, (char *)data, chan->language);
 | |
| 	if (!res) {
 | |
| 		res = ast_waitstream(chan, AST_DIGIT_ANY);
 | |
| 		ast_stopstream(chan);
 | |
| 	}
 | |
| 	return res;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_atimeout(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	int x = atoi((char *) data);
 | |
| 	/* Set the timeout for how long to wait between digits */
 | |
| 	ast_channel_setwhentohangup(chan,x);
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose( VERBOSE_PREFIX_3 "Set Absolute Timeout to %d\n", x);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_rtimeout(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	/* Set the timeout for how long to wait between digits */
 | |
| 	chan->pbx->rtimeout = atoi((char *)data);
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose( VERBOSE_PREFIX_3 "Set Response Timeout to %d\n", chan->pbx->rtimeout);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_dtimeout(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	/* Set the timeout for how long to wait between digits */
 | |
| 	chan->pbx->dtimeout = atoi((char *)data);
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose( VERBOSE_PREFIX_3 "Set Digit Timeout to %d\n", chan->pbx->dtimeout);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_goto(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	char *s;
 | |
| 	char *exten, *pri, *context;
 | |
| 	char *stringp=NULL;
 | |
| 	if (!data || !strlen(data)) {
 | |
| 		ast_log(LOG_WARNING, "Goto requires an argument (optional context|optional extension|priority)\n");
 | |
| 		return -1;
 | |
| 	}
 | |
| 	s = strdup((void *) data);
 | |
| 	stringp=s;
 | |
| 	context = strsep(&stringp, "|");
 | |
| 	exten = strsep(&stringp, "|");
 | |
| 	if (!exten) {
 | |
| 		/* Only a priority in this one */
 | |
| 		pri = context;
 | |
| 		exten = NULL;
 | |
| 		context = NULL;
 | |
| 	} else {
 | |
| 		pri = strsep(&stringp, "|");
 | |
| 		if (!pri) {
 | |
| 			/* Only an extension and priority in this one */
 | |
| 			pri = exten;
 | |
| 			exten = context;
 | |
| 			context = NULL;
 | |
| 		}
 | |
| 	}
 | |
| 	if (atoi(pri) < 0) {
 | |
| 		ast_log(LOG_WARNING, "Priority '%s' must be a number > 0\n", pri);
 | |
| 		free(s);
 | |
| 		return -1;
 | |
| 	}
 | |
| 	/* At this point we have a priority and maybe an extension and a context */
 | |
| 	chan->priority = atoi(pri) - 1;
 | |
| 	if (exten && strcasecmp(exten, "BYEXTENSION"))
 | |
| 		strncpy(chan->exten, exten, sizeof(chan->exten)-1);
 | |
| 	if (context)
 | |
| 		strncpy(chan->context, context, sizeof(chan->context)-1);
 | |
| 	if (option_verbose > 2)
 | |
| 		ast_verbose( VERBOSE_PREFIX_3 "Goto (%s,%s,%d)\n", chan->context,chan->exten, chan->priority+1);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| char *pbx_builtin_getvar_helper(struct ast_channel *chan, char *name) {
 | |
| 	struct ast_var_t *variables;
 | |
| 	struct varshead *headp;
 | |
| 
 | |
|     if (chan)
 | |
|         headp=&chan->varshead;
 | |
| 	else
 | |
| 		headp=&globals;
 | |
| 
 | |
| 	if (name) {
 | |
| 		AST_LIST_TRAVERSE(headp,variables,entries) {
 | |
| 			if (!strcmp(name, ast_var_name(variables)))
 | |
| 				return ast_var_value(variables);
 | |
| 		}
 | |
| 		if (headp != &globals) {
 | |
| 			/* Check global variables if we haven't already */
 | |
| 			headp = &globals;
 | |
| 			AST_LIST_TRAVERSE(headp,variables,entries) {
 | |
| 				if (!strcmp(name, ast_var_name(variables)))
 | |
| 					return ast_var_value(variables);
 | |
| 			}
 | |
| 		}
 | |
| 	}
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| void pbx_builtin_setvar_helper(struct ast_channel *chan, char *name, char *value) {
 | |
| 	struct ast_var_t *newvariable;
 | |
|         struct varshead *headp;
 | |
|     if (chan)
 | |
|         headp=&chan->varshead;
 | |
| 	else
 | |
| 		headp=&globals;
 | |
|                 
 | |
| 	AST_LIST_TRAVERSE (headp,newvariable,entries) {
 | |
| 		if (strcasecmp(ast_var_name(newvariable),name)==0) {
 | |
| 			/* there is already such a variable, delete it */
 | |
| 			AST_LIST_REMOVE(headp,newvariable,ast_var_t,entries);
 | |
| 			ast_var_delete(newvariable);
 | |
| 			break;
 | |
| 		}
 | |
| 	} 
 | |
| 	
 | |
| 	if (value) {
 | |
| 		if ((option_verbose > 1) && (headp == &globals))
 | |
| 			ast_verbose(VERBOSE_PREFIX_3 "Setting global variable '%s' to '%s'\n",name, value);
 | |
| 		newvariable=ast_var_assign(name,value);	
 | |
| 		AST_LIST_INSERT_HEAD(headp,newvariable,entries);
 | |
| 	}
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_setvar(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	char *name;
 | |
| 	char *value;
 | |
| 	char *stringp=NULL;
 | |
|                 
 | |
| 	if (!data || !strlen(data)) {
 | |
| 		ast_log(LOG_WARNING, "Ignoring, since there is no variable to set\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 	
 | |
| 	stringp=data;
 | |
| 	name=strsep(&stringp,"=");
 | |
| 	value=strsep(&stringp,"\0"); 
 | |
| 	
 | |
| 	pbx_builtin_setvar_helper(chan,name,value);
 | |
| 			
 | |
|         return(0);
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_setglobalvar(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	char *name;
 | |
| 	char *value;
 | |
| 	char *stringp=NULL;
 | |
|                 
 | |
| 	if (!data || !strlen(data)) {
 | |
| 		ast_log(LOG_WARNING, "Ignoring, since there is no variable to set\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 	
 | |
| 	stringp=data;
 | |
| 	name=strsep(&stringp,"=");
 | |
| 	value=strsep(&stringp,"\0"); 
 | |
| 	
 | |
| 	pbx_builtin_setvar_helper(NULL,name,value);
 | |
| 			
 | |
|         return(0);
 | |
| }
 | |
| 
 | |
| 
 | |
| static int pbx_builtin_noop(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| 
 | |
| void pbx_builtin_clear_globals(void)
 | |
| {
 | |
| 	struct ast_var_t *vardata;
 | |
| 	while (!AST_LIST_EMPTY(&globals)) {
 | |
| 		vardata = AST_LIST_FIRST(&globals);
 | |
| 		AST_LIST_REMOVE_HEAD(&globals, entries);
 | |
| 		ast_var_delete(vardata);
 | |
| 	}
 | |
| }
 | |
| 
 | |
| static int pbx_checkcondition(char *condition) {
 | |
| 	char *s;
 | |
| 	int ret;
 | |
| 	
 | |
| 	s=strdup(condition);
 | |
| 	
 | |
| 	ret=1;
 | |
| 	
 | |
| 	if ((strcasecmp(s,"0")) || (strlen(s)==0)) {
 | |
| 		ret=0;
 | |
| 	}
 | |
| 	
 | |
| 	free(s);
 | |
| 	return(ret);
 | |
| }
 | |
| 
 | |
| static int pbx_builtin_gotoif(struct ast_channel *chan, void *data)
 | |
| {
 | |
| 	char *condition,*branch1,*branch2,*branch;
 | |
| 	char *s;
 | |
| 	int rc;
 | |
| 	char *stringp=NULL;
 | |
| 
 | |
| 	if (!data || !strlen(data)) {
 | |
| 		ast_log(LOG_WARNING, "Ignoring, since there is no variable to set\n");
 | |
| 		return 0;
 | |
| 	}
 | |
| 	
 | |
| 	s=strdup(data);
 | |
| 	stringp=s;
 | |
| 	condition=strsep(&stringp,"?");
 | |
| 	branch1=strsep(&stringp,":");
 | |
| 	branch2=strsep(&stringp,"");
 | |
| 	
 | |
| 	if (pbx_checkcondition(condition)) {
 | |
| 		branch=branch2;
 | |
| 	} else {
 | |
| 		branch=branch1;
 | |
| 	}
 | |
| 	
 | |
| 	if ((branch==NULL) || (strlen(branch)==0)) {
 | |
| 		ast_log(LOG_WARNING, "Not taking any branch\n");
 | |
| 		return(0);
 | |
| 	}
 | |
| 	
 | |
| 	rc=pbx_builtin_goto(chan,branch);
 | |
| 	free(s);
 | |
| 	return(rc);
 | |
| }           
 | |
| 	
 | |
| int load_pbx(void)
 | |
| {
 | |
| 	int x;
 | |
| 	/* Initialize the PBX */
 | |
| 	if (option_verbose) {
 | |
| 		ast_verbose( "Asterisk PBX Core Initializing\n");
 | |
| 		ast_verbose( "Registering builtin applications:\n");
 | |
| 	}
 | |
| 	ast_cli_register(&show_applications_cli);
 | |
| 	ast_cli_register(&show_application_cli);
 | |
| 	ast_cli_register(&show_dialplan_cli);
 | |
| 	ast_cli_register(&show_switches_cli);
 | |
| 	for (x=0;x<sizeof(builtins) / sizeof(struct pbx_builtin); x++) {
 | |
| 		if (option_verbose)
 | |
| 			ast_verbose( VERBOSE_PREFIX_1 "[%s]\n", builtins[x].name);
 | |
| 		if (ast_register_application(builtins[x].name, builtins[x].execute, builtins[x].synopsis, builtins[x].description)) {
 | |
| 			ast_log(LOG_ERROR, "Unable to register builtin application '%s'\n", builtins[x].name);
 | |
| 			return -1;
 | |
| 		}
 | |
| 	}
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Lock context list functions ...
 | |
|  */
 | |
| int ast_lock_contexts()
 | |
| {
 | |
| 	return ast_pthread_mutex_lock(&conlock);
 | |
| }
 | |
| 
 | |
| int ast_unlock_contexts()
 | |
| {
 | |
| 	return ast_pthread_mutex_unlock(&conlock);
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Lock context ...
 | |
|  */
 | |
| int ast_lock_context(struct ast_context *con)
 | |
| {
 | |
| 	return ast_pthread_mutex_lock(&con->lock);
 | |
| }
 | |
| 
 | |
| int ast_unlock_context(struct ast_context *con)
 | |
| {
 | |
| 	return ast_pthread_mutex_unlock(&con->lock);
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Name functions ...
 | |
|  */
 | |
| char *ast_get_context_name(struct ast_context *con)
 | |
| {
 | |
| 	return con ? con->name : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_extension_name(struct ast_exten *exten)
 | |
| {
 | |
| 	return exten ? exten->exten : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_include_name(struct ast_include *inc)
 | |
| {
 | |
| 	return inc ? inc->name : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_ignorepat_name(struct ast_ignorepat *ip)
 | |
| {
 | |
| 	return ip ? ip->pattern : NULL;
 | |
| }
 | |
| 
 | |
| int ast_get_extension_priority(struct ast_exten *exten)
 | |
| {
 | |
| 	return exten ? exten->priority : -1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Registrar info functions ...
 | |
|  */
 | |
| char *ast_get_context_registrar(struct ast_context *c)
 | |
| {
 | |
| 	return c ? c->registrar : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_extension_registrar(struct ast_exten *e)
 | |
| {
 | |
| 	return e ? e->registrar : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_include_registrar(struct ast_include *i)
 | |
| {
 | |
| 	return i ? i->registrar : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_ignorepat_registrar(struct ast_ignorepat *ip)
 | |
| {
 | |
| 	return ip ? ip->registrar : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_extension_app(struct ast_exten *e)
 | |
| {
 | |
| 	return e ? e->app : NULL;
 | |
| }
 | |
| 
 | |
| void *ast_get_extension_app_data(struct ast_exten *e)
 | |
| {
 | |
| 	return e ? e->data : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_switch_name(struct ast_sw *sw)
 | |
| {
 | |
| 	return sw ? sw->name : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_switch_data(struct ast_sw *sw)
 | |
| {
 | |
| 	return sw ? sw->data : NULL;
 | |
| }
 | |
| 
 | |
| char *ast_get_switch_registrar(struct ast_sw *sw)
 | |
| {
 | |
| 	return sw ? sw->registrar : NULL;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Walking functions ...
 | |
|  */
 | |
| struct ast_context *ast_walk_contexts(struct ast_context *con)
 | |
| {
 | |
| 	if (!con)
 | |
| 		return contexts;
 | |
| 	else
 | |
| 		return con->next;
 | |
| }
 | |
| 
 | |
| struct ast_exten *ast_walk_context_extensions(struct ast_context *con,
 | |
| 	struct ast_exten *exten)
 | |
| {
 | |
| 	if (!exten)
 | |
| 		return con ? con->root : NULL;
 | |
| 	else
 | |
| 		return exten->next;
 | |
| }
 | |
| 
 | |
| struct ast_sw *ast_walk_context_switches(struct ast_context *con,
 | |
| 	struct ast_sw *sw)
 | |
| {
 | |
| 	if (!sw)
 | |
| 		return con ? con->alts : NULL;
 | |
| 	else
 | |
| 		return sw->next;
 | |
| }
 | |
| 
 | |
| struct ast_exten *ast_walk_extension_priorities(struct ast_exten *exten,
 | |
| 	struct ast_exten *priority)
 | |
| {
 | |
| 	if (!priority)
 | |
| 		return exten;
 | |
| 	else
 | |
| 		return priority->peer;
 | |
| }
 | |
| 
 | |
| struct ast_include *ast_walk_context_includes(struct ast_context *con,
 | |
| 	struct ast_include *inc)
 | |
| {
 | |
| 	if (!inc)
 | |
| 		return con ? con->includes : NULL;
 | |
| 	else
 | |
| 		return inc->next;
 | |
| }
 | |
| 
 | |
| struct ast_ignorepat *ast_walk_context_ignorepats(struct ast_context *con,
 | |
| 	struct ast_ignorepat *ip)
 | |
| {
 | |
| 	if (!ip)
 | |
| 		return con ? con->ignorepats : NULL;
 | |
| 	else
 | |
| 		return ip->next;
 | |
| }
 |