Merged revisions 123769 via svnmerge from

[asterisk/asterisk.git] / apps / app_queue.c

/*
 * Asterisk -- An open source telephony toolkit.
 *
 * Copyright (C) 1999 - 2006, Digium, Inc.
 *
 * Mark Spencer <markster@digium.com>
 *
 * See http://www.asterisk.org for more information about
 * the Asterisk project. Please do not directly contact
 * any of the maintainers of this project for assistance;
 * the project provides a web site, mailing lists and IRC
 * channels for your use.
 *
 * This program is free software, distributed under the terms of
 * the GNU General Public License Version 2. See the LICENSE file
 * at the top of the source tree.
 */

/*! \file
 *
 * \brief True call queues with optional send URL on answer
 *
 * \author Mark Spencer <markster@digium.com>
 *
 * \arg Config in \ref Config_qu queues.conf
 *
 * \par Development notes
 * \note 2004-11-25: Persistent Dynamic Members added by:
 *             NetNation Communications (www.netnation.com)
 *             Kevin Lindsay <kevinl@netnation.com>
 *
 *             Each dynamic agent in each queue is now stored in the astdb.
 *             When asterisk is restarted, each agent will be automatically
 *             readded into their recorded queues. This feature can be
 *             configured with the 'persistent_members=<1|0>' setting in the
 *             '[general]' category in queues.conf. The default is on.
 *
 * \note 2004-06-04: Priorities in queues added by inAccess Networks (work funded by Hellas On Line (HOL) www.hol.gr).
 *
 * \note These features added by David C. Troy <dave@toad.net>:
 *    - Per-queue holdtime calculation
 *    - Estimated holdtime announcement
 *    - Position announcement
 *    - Abandoned/completed call counters
 *    - Failout timer passed as optional app parameter
 *    - Optional monitoring of calls, started when call is answered
 *
 * Patch Version 1.07 2003-12-24 01
 *
 * Added servicelevel statistic by Michiel Betel <michiel@betel.nl>
 * Added Priority jumping code for adding and removing queue members by Jonathan Stanton <asterisk@doilooklikeicare.com>
 *
 * Fixed to work with CVS as of 2004-02-25 and released as 1.07a
 * by Matthew Enger <m.enger@xi.com.au>
 *
 * \ingroup applications
 */

/*** MODULEINFO
        <depend>res_monitor</depend>
 ***/

#include "asterisk.h"

ASTERISK_FILE_VERSION(__FILE__, "$Revision$")

#include <sys/time.h>
#include <sys/signal.h>
#include <netinet/in.h>

#include "asterisk/lock.h"
#include "asterisk/file.h"
#include "asterisk/channel.h"
#include "asterisk/pbx.h"
#include "asterisk/app.h"
#include "asterisk/linkedlists.h"
#include "asterisk/module.h"
#include "asterisk/translate.h"
#include "asterisk/say.h"
#include "asterisk/features.h"
#include "asterisk/musiconhold.h"
#include "asterisk/cli.h"
#include "asterisk/manager.h"
#include "asterisk/config.h"
#include "asterisk/monitor.h"
#include "asterisk/utils.h"
#include "asterisk/causes.h"
#include "asterisk/astdb.h"
#include "asterisk/devicestate.h"
#include "asterisk/stringfields.h"
#include "asterisk/event.h"
#include "asterisk/astobj2.h"
#include "asterisk/strings.h"
#include "asterisk/global_datastores.h"
#include "asterisk/taskprocessor.h"

/*!
 * \par Please read before modifying this file.
 * There are three locks which are regularly used
 * throughout this file, the queue list lock, the lock
 * for each individual queue, and the interface list lock.
 * Please be extra careful to always lock in the following order
 * 1) queue list lock
 * 2) individual queue lock
 * 3) interface list lock
 * This order has sort of "evolved" over the lifetime of this
 * application, but it is now in place this way, so please adhere
 * to this order!
 */


enum {
        QUEUE_STRATEGY_RINGALL = 0,
        QUEUE_STRATEGY_LEASTRECENT,
        QUEUE_STRATEGY_FEWESTCALLS,
        QUEUE_STRATEGY_RANDOM,
        QUEUE_STRATEGY_RRMEMORY,
        QUEUE_STRATEGY_LINEAR,
        QUEUE_STRATEGY_WRANDOM
};

static const struct strategy {
        int strategy;
        const char *name;
} strategies[] = {
        { QUEUE_STRATEGY_RINGALL, "ringall" },
        { QUEUE_STRATEGY_LEASTRECENT, "leastrecent" },
        { QUEUE_STRATEGY_FEWESTCALLS, "fewestcalls" },
        { QUEUE_STRATEGY_RANDOM, "random" },
        { QUEUE_STRATEGY_RRMEMORY, "rrmemory" },
        { QUEUE_STRATEGY_LINEAR, "linear" },
        { QUEUE_STRATEGY_WRANDOM, "wrandom"},
};

static struct ast_taskprocessor *devicestate_tps;

#define DEFAULT_RETRY           5
#define DEFAULT_TIMEOUT         15
#define RECHECK                 1               /*!< Recheck every second to see we we're at the top yet */
#define MAX_PERIODIC_ANNOUNCEMENTS 10           /*!< The maximum periodic announcements we can have */
#define DEFAULT_MIN_ANNOUNCE_FREQUENCY 15       /*!< The minimum number of seconds between position announcements \
                                                     The default value of 15 provides backwards compatibility */
#define MAX_QUEUE_BUCKETS 53

#define RES_OKAY        0               /*!< Action completed */
#define RES_EXISTS      (-1)            /*!< Entry already exists */
#define RES_OUTOFMEMORY (-2)            /*!< Out of memory */
#define RES_NOSUCHQUEUE (-3)            /*!< No such queue */
#define RES_NOT_DYNAMIC (-4)            /*!< Member is not dynamic */

static char *app = "Queue";

static char *synopsis = "Queue a call for a call queue";

static char *descrip =
"  Queue(queuename[,options[,URL][,announceoverride][,timeout][,AGI][,macro][,gosub][,rule]):\n"
"Queues an incoming call in a particular call queue as defined in queues.conf.\n"
"This application will return to the dialplan if the queue does not exist, or\n"
"any of the join options cause the caller to not enter the queue.\n"
"The option string may contain zero or more of the following characters:\n"
"      'c' -- continue in the dialplan if the callee hangs up.\n"
"      'd' -- data-quality (modem) call (minimum delay).\n"
"      'h' -- allow callee to hang up by pressing *.\n"
"      'H' -- allow caller to hang up by pressing *.\n"
"      'n' -- no retries on the timeout; will exit this application and \n"
"             go to the next step.\n"
"      'i' -- ignore call forward requests from queue members and do nothing\n"
"             when they are requested.\n"
"      'r' -- ring instead of playing MOH. Periodic Announcements are still made, if applicable.\n"
"      't' -- allow the called user to transfer the calling user.\n"
"      'T' -- allow the calling user to transfer the call.\n"
"      'w' -- allow the called user to write the conversation to disk via Monitor.\n"
"      'W' -- allow the calling user to write the conversation to disk via Monitor.\n"
"      'k' -- Allow the called party to enable parking of the call by sending\n"
"             the DTMF sequence defined for call parking in features.conf.\n"
"      'K' -- Allow the calling party to enable parking of the call by sending\n"
"             the DTMF sequence defined for call parking in features.conf.\n"
"      'x' -- allow the called user to write the conversation to disk via MixMonitor\n"
"      'X' -- allow the calling user to write the conversation to disk via MixMonitor\n"
 
"  In addition to transferring the call, a call may be parked and then picked\n"
"up by another user.\n"
"  The optional URL will be sent to the called party if the channel supports\n"
"it.\n"
"  The optional AGI parameter will setup an AGI script to be executed on the \n"
"calling party's channel once they are connected to a queue member.\n"
"  The optional macro parameter will run a macro on the \n"
"calling party's channel once they are connected to a queue member.\n"
"  The optional gosub parameter will run a gosub on the \n"
"calling party's channel once they are connected to a queue member.\n"
"  The optional rule parameter will cause the queue's defaultrule to be\n"
"overridden by the rule specified.\n"
"  The timeout will cause the queue to fail out after a specified number of\n"
"seconds, checked between each queues.conf 'timeout' and 'retry' cycle.\n"
"  This application sets the following channel variable upon completion:\n"
"      QUEUESTATUS    The status of the call as a text string, one of\n"
"             TIMEOUT | FULL | JOINEMPTY | LEAVEEMPTY | JOINUNAVAIL | LEAVEUNAVAIL | CONTINUE\n";

static char *app_aqm = "AddQueueMember" ;
static char *app_aqm_synopsis = "Dynamically adds queue members" ;
static char *app_aqm_descrip =
"   AddQueueMember(queuename[,interface[,penalty[,options[,membername[,stateinterface]]]]]):\n"
"Dynamically adds interface to an existing queue.\n"
"If the interface is already in the queue it will return an error.\n"
"  This application sets the following channel variable upon completion:\n"
"     AQMSTATUS    The status of the attempt to add a queue member as a \n"
"                     text string, one of\n"
"           ADDED | MEMBERALREADY | NOSUCHQUEUE \n"
"Example: AddQueueMember(techsupport,SIP/3000)\n"
"";

static char *app_rqm = "RemoveQueueMember" ;
static char *app_rqm_synopsis = "Dynamically removes queue members" ;
static char *app_rqm_descrip =
"   RemoveQueueMember(queuename[,interface[,options]]):\n"
"Dynamically removes interface to an existing queue\n"
"If the interface is NOT in the queue it will return an error.\n"
"  This application sets the following channel variable upon completion:\n"
"     RQMSTATUS      The status of the attempt to remove a queue member as a\n"
"                     text string, one of\n"
"           REMOVED | NOTINQUEUE | NOSUCHQUEUE \n"
"Example: RemoveQueueMember(techsupport,SIP/3000)\n"
"";

static char *app_pqm = "PauseQueueMember" ;
static char *app_pqm_synopsis = "Pauses a queue member" ;
static char *app_pqm_descrip =
"   PauseQueueMember([queuename],interface[,options[,reason]]):\n"
"Pauses (blocks calls for) a queue member.\n"
"The given interface will be paused in the given queue.  This prevents\n"
"any calls from being sent from the queue to the interface until it is\n"
"unpaused with UnpauseQueueMember or the manager interface.  If no\n"
"queuename is given, the interface is paused in every queue it is a\n"
"member of. The application will fail if the interface is not found.\n"
"The reason string is entirely optional and is used to add extra information\n"
"to the appropriate queue_log entries and manager events.\n"
"  This application sets the following channel variable upon completion:\n"
"     PQMSTATUS      The status of the attempt to pause a queue member as a\n"
"                     text string, one of\n"
"           PAUSED | NOTFOUND\n"
"Example: PauseQueueMember(,SIP/3000)\n";

static char *app_upqm = "UnpauseQueueMember" ;
static char *app_upqm_synopsis = "Unpauses a queue member" ;
static char *app_upqm_descrip =
"   UnpauseQueueMember([queuename],interface[,options[,reason]]):\n"
"Unpauses (resumes calls to) a queue member.\n"
"This is the counterpart to PauseQueueMember and operates exactly the\n"
"same way, except it unpauses instead of pausing the given interface.\n"
"The reason string is entirely optional and is used to add extra information\n"
"to the appropriate queue_log entries and manager events.\n"
"  This application sets the following channel variable upon completion:\n"
"     UPQMSTATUS       The status of the attempt to unpause a queue \n"
"                      member as a text string, one of\n"
"            UNPAUSED | NOTFOUND\n"
"Example: UnpauseQueueMember(,SIP/3000)\n";

static char *app_ql = "QueueLog" ;
static char *app_ql_synopsis = "Writes to the queue_log" ;
static char *app_ql_descrip =
"   QueueLog(queuename,uniqueid,agent,event[,additionalinfo]):\n"
"Allows you to write your own events into the queue log\n"
"Example: QueueLog(101,${UNIQUEID},${AGENT},WENTONBREAK,600)\n";

/*! \brief Persistent Members astdb family */
static const char *pm_family = "Queue/PersistentMembers";
/* The maximum length of each persistent member queue database entry */
#define PM_MAX_LEN 8192

/*! \brief queues.conf [general] option */
static int queue_keep_stats = 0;

/*! \brief queues.conf [general] option */
static int queue_persistent_members = 0;

/*! \brief queues.conf per-queue weight option */
static int use_weight = 0;

/*! \brief queues.conf [general] option */
static int autofill_default = 0;

/*! \brief queues.conf [general] option */
static int montype_default = 0;

/*! \brief queues.conf [general] option */
static int shared_lastcall = 0;

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

/*! \brief queues.conf [general] option */
static int update_cdr = 0;

enum queue_result {
        QUEUE_UNKNOWN = 0,
        QUEUE_TIMEOUT = 1,
        QUEUE_JOINEMPTY = 2,
        QUEUE_LEAVEEMPTY = 3,
        QUEUE_JOINUNAVAIL = 4,
        QUEUE_LEAVEUNAVAIL = 5,
        QUEUE_FULL = 6,
        QUEUE_CONTINUE = 7,
};

const struct {
        enum queue_result id;
        char *text;
} queue_results[] = {
        { QUEUE_UNKNOWN, "UNKNOWN" },
        { QUEUE_TIMEOUT, "TIMEOUT" },
        { QUEUE_JOINEMPTY,"JOINEMPTY" },
        { QUEUE_LEAVEEMPTY, "LEAVEEMPTY" },
        { QUEUE_JOINUNAVAIL, "JOINUNAVAIL" },
        { QUEUE_LEAVEUNAVAIL, "LEAVEUNAVAIL" },
        { QUEUE_FULL, "FULL" },
        { QUEUE_CONTINUE, "CONTINUE" },
};

/*! \brief We define a custom "local user" structure because we
 *  use it not only for keeping track of what is in use but
 *  also for keeping track of who we're dialing.
 *
 *  There are two "links" defined in this structure, q_next and call_next.
 *  q_next links ALL defined callattempt structures into a linked list. call_next is
 *  a link which allows for a subset of the callattempts to be traversed. This subset
 *  is used in wait_for_answer so that irrelevant callattempts are not traversed. This
 *  also is helpful so that queue logs are always accurate in the case where a call to 
 *  a member times out, especially if using the ringall strategy. 
*/

struct callattempt {
        struct callattempt *q_next;
        struct callattempt *call_next;
        struct ast_channel *chan;
        char interface[256];
        int stillgoing;
        int metric;
        int oldstatus;
        time_t lastcall;
        struct call_queue *lastqueue;
        struct member *member;
};


struct queue_ent {
        struct call_queue *parent;             /*!< What queue is our parent */
        char moh[80];                          /*!< Name of musiconhold to be used */
        char announce[80];                     /*!< Announcement to play for member when call is answered */
        char context[AST_MAX_CONTEXT];         /*!< Context when user exits queue */
        char digits[AST_MAX_EXTENSION];        /*!< Digits entered while in queue */
        int valid_digits;                      /*!< Digits entered correspond to valid extension. Exited */
        int pos;                               /*!< Where we are in the queue */
        int prio;                              /*!< Our priority */
        int last_pos_said;                     /*!< Last position we told the user */
        time_t last_periodic_announce_time;    /*!< The last time we played a periodic announcement */
        int last_periodic_announce_sound;      /*!< The last periodic announcement we made */
        time_t last_pos;                       /*!< Last time we told the user their position */
        int opos;                              /*!< Where we started in the queue */
        int handled;                           /*!< Whether our call was handled */
        int pending;                           /*!< Non-zero if we are attempting to call a member */
        int max_penalty;                       /*!< Limit the members that can take this call to this penalty or lower */
        int min_penalty;                       /*!< Limit the members that can take this call to this penalty or higher */
        int linpos;                            /*!< If using linear strategy, what position are we at? */
        int linwrapped;                        /*!< Is the linpos wrapped? */
        time_t start;                          /*!< When we started holding */
        time_t expire;                         /*!< When this entry should expire (time out of queue) */
        struct ast_channel *chan;              /*!< Our channel */
        AST_LIST_HEAD_NOLOCK(,penalty_rule) qe_rules; /*!< Local copy of the queue's penalty rules */
        struct penalty_rule *pr;               /*!< Pointer to the next penalty rule to implement */
        struct queue_ent *next;                /*!< The next queue entry */
};

struct member {
        char interface[80];                 /*!< Technology/Location to dial to reach this member*/
        char state_interface[80];           /*!< Technology/Location from which to read devicestate changes */
        char membername[80];                /*!< Member name to use in queue logs */
        int penalty;                        /*!< Are we a last resort? */
        int calls;                          /*!< Number of calls serviced by this member */
        int dynamic;                        /*!< Are we dynamically added? */
        int realtime;                       /*!< Is this member realtime? */
        int status;                         /*!< Status of queue member */
        int paused;                         /*!< Are we paused (not accepting calls)? */
        time_t lastcall;                    /*!< When last successful call was hungup */
        struct call_queue *lastqueue;       /*!< Last queue we received a call */
        unsigned int dead:1;                /*!< Used to detect members deleted in realtime */
        unsigned int delme:1;               /*!< Flag to delete entry on reload */
        char rt_uniqueid[80];               /*!< Unique id of realtime member entry */
};

struct member_interface {
        char interface[80];
        AST_LIST_ENTRY(member_interface) list;    /*!< Next call queue */
};

static AST_LIST_HEAD_STATIC(interfaces, member_interface);

/* values used in multi-bit flags in call_queue */
#define QUEUE_EMPTY_NORMAL 1
#define QUEUE_EMPTY_STRICT 2
#define QUEUE_EMPTY_LOOSE 3
#define ANNOUNCEHOLDTIME_ALWAYS 1
#define ANNOUNCEHOLDTIME_ONCE 2
#define QUEUE_EVENT_VARIABLES 3

struct penalty_rule {
        int time;                           /*!< Number of seconds that need to pass before applying this rule */
        int max_value;                      /*!< The amount specified in the penalty rule for max penalty */
        int min_value;                      /*!< The amount specified in the penalty rule for min penalty */
        int max_relative;                   /*!< Is the max adjustment relative? 1 for relative, 0 for absolute */
        int min_relative;                   /*!< Is the min adjustment relative? 1 for relative, 0 for absolute */
        AST_LIST_ENTRY(penalty_rule) list;  /*!< Next penalty_rule */
};

#define ANNOUNCEPOSITION_YES 1 /*!< We announce position */
#define ANNOUNCEPOSITION_NO 2 /*!< We don't announce position */
#define ANNOUNCEPOSITION_MORE_THAN 3 /*!< We say "Currently there are more than <limit>" */
#define ANNOUNCEPOSITION_LIMIT 4 /*!< We not announce position more than <limit> */

struct call_queue {
        AST_DECLARE_STRING_FIELDS(
                /*! Queue name */
                AST_STRING_FIELD(name);
                /*! Music on Hold class */
                AST_STRING_FIELD(moh);
                /*! Announcement to play when call is answered */
                AST_STRING_FIELD(announce);
                /*! Exit context */
                AST_STRING_FIELD(context);
                /*! Macro to run upon member connection */
                AST_STRING_FIELD(membermacro);
                /*! Gosub to run upon member connection */
                AST_STRING_FIELD(membergosub);
                /*! Default rule to use if none specified in call to Queue() */
                AST_STRING_FIELD(defaultrule);
                /*! Sound file: "Your call is now first in line" (def. queue-youarenext) */
                AST_STRING_FIELD(sound_next);
                /*! Sound file: "There are currently" (def. queue-thereare) */
                AST_STRING_FIELD(sound_thereare);
                /*! Sound file: "calls waiting to speak to a representative." (def. queue-callswaiting) */
                AST_STRING_FIELD(sound_calls);
                /*! Sound file: "Currently there are more than" (def. queue-quantity1) */
                AST_STRING_FIELD(queue_quantity1);
                /*! Sound file: "callers waiting to speak with a representative" (def. queue-quantity2) */
                AST_STRING_FIELD(queue_quantity2);
                /*! Sound file: "The current estimated total holdtime is" (def. queue-holdtime) */
                AST_STRING_FIELD(sound_holdtime);
                /*! Sound file: "minutes." (def. queue-minutes) */
                AST_STRING_FIELD(sound_minutes);
                /*! Sound file: "minute." (def. queue-minute) */
                AST_STRING_FIELD(sound_minute);
                /*! Sound file: "seconds." (def. queue-seconds) */
                AST_STRING_FIELD(sound_seconds);
                /*! Sound file: "Thank you for your patience." (def. queue-thankyou) */
                AST_STRING_FIELD(sound_thanks);
                /*! Sound file: Custom announce for caller, no default */
                AST_STRING_FIELD(sound_callerannounce);
                /*! Sound file: "Hold time" (def. queue-reporthold) */
                AST_STRING_FIELD(sound_reporthold);
        );
        /*! Sound files: Custom announce, no default */
        struct ast_str *sound_periodicannounce[MAX_PERIODIC_ANNOUNCEMENTS];
        unsigned int dead:1;
        unsigned int joinempty:2;
        unsigned int eventwhencalled:2;
        unsigned int leavewhenempty:2;
        unsigned int ringinuse:1;
        unsigned int setinterfacevar:1;
        unsigned int setqueuevar:1;
        unsigned int setqueueentryvar:1;
        unsigned int reportholdtime:1;
        unsigned int wrapped:1;
        unsigned int timeoutrestart:1;
        unsigned int announceholdtime:2;
        unsigned int announceposition:3;
        int strategy:4;
        unsigned int maskmemberstatus:1;
        unsigned int realtime:1;
        unsigned int found:1;
        int announcepositionlimit;          /*!< How many positions we announce? */
        int announcefrequency;              /*!< How often to announce their position */
        int minannouncefrequency;           /*!< The minimum number of seconds between position announcements (def. 15) */
        int periodicannouncefrequency;      /*!< How often to play periodic announcement */
        int numperiodicannounce;            /*!< The number of periodic announcements configured */
        int randomperiodicannounce;         /*!< Are periodic announcments randomly chosen */
        int roundingseconds;                /*!< How many seconds do we round to? */
        int holdtime;                       /*!< Current avg holdtime, based on an exponential average */
        int callscompleted;                 /*!< Number of queue calls completed */
        int callsabandoned;                 /*!< Number of queue calls abandoned */
        int servicelevel;                   /*!< seconds setting for servicelevel*/
        int callscompletedinsl;             /*!< Number of calls answered with servicelevel*/
        char monfmt[8];                     /*!< Format to use when recording calls */
        int montype;                        /*!< Monitor type  Monitor vs. MixMonitor */
        int count;                          /*!< How many entries */
        int maxlen;                         /*!< Max number of entries */
        int wrapuptime;                     /*!< Wrapup Time */

        int retry;                          /*!< Retry calling everyone after this amount of time */
        int timeout;                        /*!< How long to wait for an answer */
        int weight;                         /*!< Respective weight */
        int autopause;                      /*!< Auto pause queue members if they fail to answer */

        /* Queue strategy things */
        int rrpos;                          /*!< Round Robin - position */
        int memberdelay;                    /*!< Seconds to delay connecting member to caller */
        int autofill;                       /*!< Ignore the head call status and ring an available agent */
        
        struct ao2_container *members;             /*!< Head of the list of members */
        /*! 
         * \brief Number of members _logged in_
         * \note There will be members in the members container that are not logged
         *       in, so this can not simply be replaced with ao2_container_count(). 
         */
        int membercount;
        struct queue_ent *head;             /*!< Head of the list of callers */
        AST_LIST_ENTRY(call_queue) list;    /*!< Next call queue */
        AST_LIST_HEAD_NOLOCK(, penalty_rule) rules; /*!< The list of penalty rules to invoke */
};

struct rule_list {
        char name[80];
        AST_LIST_HEAD_NOLOCK(,penalty_rule) rules;
        AST_LIST_ENTRY(rule_list) list;
};

AST_LIST_HEAD_STATIC(rule_lists, rule_list);

static struct ao2_container *queues;

static void update_realtime_members(struct call_queue *q);
static int set_member_paused(const char *queuename, const char *interface, const char *reason, int paused);

static void queue_transfer_fixup(void *data, struct ast_channel *old_chan, struct ast_channel *new_chan); 
/*! \brief sets the QUEUESTATUS channel variable */
static void set_queue_result(struct ast_channel *chan, enum queue_result res)
{
        int i;

        for (i = 0; i < ARRAY_LEN(queue_results); i++) {
                if (queue_results[i].id == res) {
                        pbx_builtin_setvar_helper(chan, "QUEUESTATUS", queue_results[i].text);
                        return;
                }
        }
}

static const char *int2strat(int strategy)
{
        int x;

        for (x = 0; x < ARRAY_LEN(strategies); x++) {
                if (strategy == strategies[x].strategy)
                        return strategies[x].name;
        }

        return "<unknown>";
}

static int strat2int(const char *strategy)
{
        int x;

        for (x = 0; x < ARRAY_LEN(strategies); x++) {
                if (!strcasecmp(strategy, strategies[x].name))
                        return strategies[x].strategy;
        }

        return -1;
}

static int queue_hash_cb(const void *obj, const int flags)
{
        const struct call_queue *q = obj;
        return ast_str_hash(q->name);
}

static int queue_cmp_cb(void *obj, void *arg, int flags)
{
        struct call_queue *q = obj, *q2 = arg;
        return !strcasecmp(q->name, q2->name) ? CMP_MATCH : 0;
}

static inline struct call_queue *queue_ref(struct call_queue *q)
{
        ao2_ref(q, 1);
        return q;
}

static inline struct call_queue *queue_unref(struct call_queue *q)
{
        ao2_ref(q, -1);
        return q;
}

/*! \brief Set variables of queue */
static void set_queue_variables(struct queue_ent *qe)
{
        char interfacevar[256]="";
        float sl = 0;

        if (qe->parent->setqueuevar) {
                sl = 0;
                if (qe->parent->callscompleted > 0) 
                        sl = 100 * ((float) qe->parent->callscompletedinsl / (float) qe->parent->callscompleted);

                snprintf(interfacevar, sizeof(interfacevar),
                        "QUEUENAME=%s,QUEUEMAX=%d,QUEUESTRATEGY=%s,QUEUECALLS=%d,QUEUEHOLDTIME=%d,QUEUECOMPLETED=%d,QUEUEABANDONED=%d,QUEUESRVLEVEL=%d,QUEUESRVLEVELPERF=%2.1f",
                        qe->parent->name, qe->parent->maxlen, int2strat(qe->parent->strategy), qe->parent->count, qe->parent->holdtime, qe->parent->callscompleted,
                        qe->parent->callsabandoned,  qe->parent->servicelevel, sl);
        
                pbx_builtin_setvar_multiple(qe->chan, interfacevar); 
        }
}

/*! \brief Insert the 'new' entry after the 'prev' entry of queue 'q' */
static inline void insert_entry(struct call_queue *q, struct queue_ent *prev, struct queue_ent *new, int *pos)
{
        struct queue_ent *cur;

        if (!q || !new)
                return;
        if (prev) {
                cur = prev->next;
                prev->next = new;
        } else {
                cur = q->head;
                q->head = new;
        }
        new->next = cur;
        new->parent = q;
        new->pos = ++(*pos);
        new->opos = *pos;
}

enum queue_member_status {
        QUEUE_NO_MEMBERS,
        QUEUE_NO_REACHABLE_MEMBERS,
        QUEUE_NO_UNPAUSED_REACHABLE_MEMBERS,
        QUEUE_NORMAL
};

/*! \brief Check if members are available
 *
 * This function checks to see if members are available to be called. If any member
 * is available, the function immediately returns QUEUE_NORMAL. If no members are available,
 * the appropriate reason why is returned
 */
static enum queue_member_status get_member_status(struct call_queue *q, int max_penalty, int min_penalty)
{
        struct member *member;
        struct ao2_iterator mem_iter;
        enum queue_member_status result = QUEUE_NO_MEMBERS;

        ao2_lock(q);
        mem_iter = ao2_iterator_init(q->members, 0);
        for (; (member = ao2_iterator_next(&mem_iter)); ao2_ref(member, -1)) {
                if ((max_penalty && (member->penalty > max_penalty)) || (min_penalty && (member->penalty < min_penalty)))
                        continue;

                switch (member->status) {
                case AST_DEVICE_INVALID:
                        /* nothing to do */
                        break;
                case AST_DEVICE_UNAVAILABLE:
                        if (result != QUEUE_NO_UNPAUSED_REACHABLE_MEMBERS) 
                                result = QUEUE_NO_REACHABLE_MEMBERS;
                        break;
                default:
                        if (member->paused) {
                                result = QUEUE_NO_UNPAUSED_REACHABLE_MEMBERS;
                        } else {
                                ao2_unlock(q);
                                ao2_ref(member, -1);
                                return QUEUE_NORMAL;
                        }
                        break;
                }
        }

        ao2_unlock(q);
        return result;
}

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

/*! \brief set a member's status based on device state of that member's state_interface.
 *  
 * Lock interface list find sc, iterate through each queues queue_member list for member to
 * update state inside queues
*/
static int update_status(const char *interface, const int status)
{
        struct member *cur;
        struct ao2_iterator mem_iter, queue_iter;
        struct call_queue *q;

        queue_iter = ao2_iterator_init(queues, 0);
        while ((q = ao2_iterator_next(&queue_iter))) {
                ao2_lock(q);
                mem_iter = ao2_iterator_init(q->members, 0);
                while ((cur = ao2_iterator_next(&mem_iter))) {
                        char *tmp_interface;
                        char *slash_pos;
                        tmp_interface = ast_strdupa(cur->state_interface);
                        if ((slash_pos = strchr(interface, '/')))
                                if ((slash_pos = strchr(slash_pos + 1, '/')))
                                        *slash_pos = '\0';

                        if (strcasecmp(interface, tmp_interface)) {
                                ao2_ref(cur, -1);
                                continue;
                        }

                        if (cur->status != status) {
                                cur->status = status;
                                if (q->maskmemberstatus) {
                                        ao2_ref(cur, -1);
                                        continue;
                                }

                                manager_event(EVENT_FLAG_AGENT, "QueueMemberStatus",
                                        "Queue: %s\r\n"
                                        "Location: %s\r\n"
                                        "MemberName: %s\r\n"
                                        "Membership: %s\r\n"
                                        "Penalty: %d\r\n"
                                        "CallsTaken: %d\r\n"
                                        "LastCall: %d\r\n"
                                        "Status: %d\r\n"
                                        "Paused: %d\r\n",
                                        q->name, cur->interface, cur->membername, cur->dynamic ? "dynamic" : cur->realtime ? "realtime" : "static",
                                        cur->penalty, cur->calls, (int)cur->lastcall, cur->status, cur->paused);
                        }
                        ao2_ref(cur, -1);
                }
                queue_unref(q);
                ao2_unlock(q);
        }

        return 0;
}

/*! \brief set a member's status based on device state of that member's interface*/
static int handle_statechange(void *datap)
{
        struct member_interface *curint;
        char *loc;
        char *technology;
        struct statechange *sc = datap;

        technology = ast_strdupa(sc->dev);
        loc = strchr(technology, '/');
        if (loc) {
                *loc++ = '\0';
        } else {
                ast_free(sc);
                return 0;
        }

        AST_LIST_LOCK(&interfaces);
        AST_LIST_TRAVERSE(&interfaces, curint, list) {
                char *interface;
                char *slash_pos;
                interface = ast_strdupa(curint->interface);
                if ((slash_pos = strchr(interface, '/')))
                        if ((slash_pos = strchr(slash_pos + 1, '/')))
                                *slash_pos = '\0';

                if (!strcasecmp(interface, sc->dev))
                        break;
        }
        AST_LIST_UNLOCK(&interfaces);

        if (!curint) {
                if (option_debug > 2)
                        ast_log(LOG_DEBUG, "Device '%s/%s' changed to state '%d' (%s) but we don't care because they're not a member of any queue.\n", technology, loc, sc->state, devstate2str(sc->state));
                return 0;
        }

        if (option_debug)
                ast_log(LOG_DEBUG, "Device '%s/%s' changed to state '%d' (%s)\n", technology, loc, sc->state, devstate2str(sc->state));

        update_status(sc->dev, sc->state);
        ast_free(sc);
        return 0;
}

static void device_state_cb(const struct ast_event *event, void *unused)
{
        enum ast_device_state state;
        const char *device;
        struct statechange *sc;
        size_t datapsize;

        state = ast_event_get_ie_uint(event, AST_EVENT_IE_STATE);
        device = ast_event_get_ie_str(event, AST_EVENT_IE_DEVICE);

        if (ast_strlen_zero(device)) {
                ast_log(LOG_ERROR, "Received invalid event that had no device IE\n");
                return;
        }
        datapsize = sizeof(*sc) + strlen(device) + 1;
        if (!(sc = ast_calloc(1, datapsize))) {
                ast_log(LOG_ERROR, "failed to calloc a state change struct\n");
                return;
        }
        sc->state = state;
        strcpy(sc->dev, device);
        if (ast_taskprocessor_push(devicestate_tps, handle_statechange, sc) < 0) {
                ast_free(sc);
        }
}

/*! \brief allocate space for new queue member and set fields based on parameters passed */
static struct member *create_queue_member(const char *interface, const char *membername, int penalty, int paused, const char *state_interface)
{
        struct member *cur;
        
        if ((cur = ao2_alloc(sizeof(*cur), NULL))) {
                cur->penalty = penalty;
                cur->paused = paused;
                ast_copy_string(cur->interface, interface, sizeof(cur->interface));
                if (!ast_strlen_zero(state_interface))
                        ast_copy_string(cur->state_interface, state_interface, sizeof(cur->state_interface));
                else
                        ast_copy_string(cur->state_interface, interface, sizeof(cur->state_interface));
                if (!ast_strlen_zero(membername))
                        ast_copy_string(cur->membername, membername, sizeof(cur->membername));
                else
                        ast_copy_string(cur->membername, interface, sizeof(cur->membername));
                if (!strchr(cur->interface, '/'))
                        ast_log(LOG_WARNING, "No location at interface '%s'\n", interface);
                cur->status = ast_device_state(cur->state_interface);
        }

        return cur;
}


static int compress_char(const char c)
{
        if (c < 32)
                return 0;
        else if (c > 96)
                return c - 64;
        else
                return c - 32;
}

static int member_hash_fn(const void *obj, const int flags)
{
        const struct member *mem = obj;
        const char *chname = strchr(mem->interface, '/');
        int ret = 0, i;
        if (!chname)
                chname = mem->interface;
        for (i = 0; i < 5 && chname[i]; i++)
                ret += compress_char(chname[i]) << (i * 6);
        return ret;
}

static int member_cmp_fn(void *obj1, void *obj2, int flags)
{
        struct member *mem1 = obj1, *mem2 = obj2;
        return strcasecmp(mem1->interface, mem2->interface) ? 0 : CMP_MATCH;
}

/*! 
 * \brief Initialize Queue default values.
 * \note the queue's lock  must be held before executing this function
*/
static void init_queue(struct call_queue *q)
{
        int i;
        struct penalty_rule *pr_iter;

        q->dead = 0;
        q->retry = DEFAULT_RETRY;
        q->timeout = -1;
        q->maxlen = 0;
        q->announcefrequency = 0;
        q->minannouncefrequency = DEFAULT_MIN_ANNOUNCE_FREQUENCY;
        q->announceholdtime = 1;
        q->announcepositionlimit = 10; /* Default 10 positions */
        q->announceposition = ANNOUNCEPOSITION_YES; /* Default yes */
        q->roundingseconds = 0; /* Default - don't announce seconds */
        q->servicelevel = 0;
        q->ringinuse = 1;
        q->setinterfacevar = 0;
        q->setqueuevar = 0;
        q->setqueueentryvar = 0;
        q->autofill = autofill_default;
        q->montype = montype_default;
        q->monfmt[0] = '\0';
        q->reportholdtime = 0;
        q->wrapuptime = 0;
        q->joinempty = 0;
        q->leavewhenempty = 0;
        q->memberdelay = 0;
        q->maskmemberstatus = 0;
        q->eventwhencalled = 0;
        q->weight = 0;
        q->timeoutrestart = 0;
        q->periodicannouncefrequency = 0;
        q->randomperiodicannounce = 0;
        q->numperiodicannounce = 0;
        if (!q->members) {
                if (q->strategy == QUEUE_STRATEGY_LINEAR)
                        /* linear strategy depends on order, so we have to place all members in a single bucket */
                        q->members = ao2_container_alloc(1, member_hash_fn, member_cmp_fn);
                else
                        q->members = ao2_container_alloc(37, member_hash_fn, member_cmp_fn);
        }
        q->membercount = 0;
        q->found = 1;

        ast_string_field_set(q, sound_next, "queue-youarenext");
        ast_string_field_set(q, sound_thereare, "queue-thereare");
        ast_string_field_set(q, sound_calls, "queue-callswaiting");
        ast_string_field_set(q, queue_quantity1, "queue-quantity1");
        ast_string_field_set(q, queue_quantity2, "queue-quantity2");
        ast_string_field_set(q, sound_holdtime, "queue-holdtime");
        ast_string_field_set(q, sound_minutes, "queue-minutes");
        ast_string_field_set(q, sound_minute, "queue-minute");
        ast_string_field_set(q, sound_seconds, "queue-seconds");
        ast_string_field_set(q, sound_thanks, "queue-thankyou");
        ast_string_field_set(q, sound_reporthold, "queue-reporthold");

        if ((q->sound_periodicannounce[0] = ast_str_create(32)))
                ast_str_set(&q->sound_periodicannounce[0], 0, "queue-periodic-announce");

        for (i = 1; i < MAX_PERIODIC_ANNOUNCEMENTS; i++) {
                if (q->sound_periodicannounce[i])
                        ast_str_set(&q->sound_periodicannounce[i], 0, "%s", "");
        }

        while ((pr_iter = AST_LIST_REMOVE_HEAD(&q->rules,list)))
                ast_free(pr_iter);
}

static void clear_queue(struct call_queue *q)
{
        q->holdtime = 0;
        q->callscompleted = 0;
        q->callsabandoned = 0;
        q->callscompletedinsl = 0;
        q->wrapuptime = 0;
}

static int add_to_interfaces(const char *interface)
{
        struct member_interface *curint;

        AST_LIST_LOCK(&interfaces);
        AST_LIST_TRAVERSE(&interfaces, curint, list) {
                if (!strcasecmp(curint->interface, interface))
                        break;
        }

        if (curint) {
                AST_LIST_UNLOCK(&interfaces);
                return 0;
        }

        ast_debug(1, "Adding %s to the list of interfaces that make up all of our queue members.\n", interface);
        
        if ((curint = ast_calloc(1, sizeof(*curint)))) {
                ast_copy_string(curint->interface, interface, sizeof(curint->interface));
                AST_LIST_INSERT_HEAD(&interfaces, curint, list);
        }
        AST_LIST_UNLOCK(&interfaces);

        return 0;
}

static int interface_exists_global(const char *interface)
{
        struct call_queue *q;
        struct member *mem, tmpmem;
        struct ao2_iterator queue_iter, mem_iter;
        int ret = 0;

        ast_copy_string(tmpmem.interface, interface, sizeof(tmpmem.interface));
        queue_iter = ao2_iterator_init(queues, 0);
        while ((q = ao2_iterator_next(&queue_iter))) {
                ao2_lock(q);
                mem_iter = ao2_iterator_init(q->members, 0);
                while ((mem = ao2_iterator_next(&mem_iter))) { 
                        if (!strcasecmp(mem->state_interface, interface)) {
                                ao2_ref(mem, -1);
                                ret = 1;
                                break;
                        }
                }
                ao2_unlock(q);
                queue_unref(q);
        }

        return ret;
}

static int remove_from_interfaces(const char *interface)
{
        struct member_interface *curint;

        if (interface_exists_global(interface))
                return 0;

        AST_LIST_LOCK(&interfaces);
        AST_LIST_TRAVERSE_SAFE_BEGIN(&interfaces, curint, list) {
                if (!strcasecmp(curint->interface, interface)) {
                        ast_debug(1, "Removing %s from the list of interfaces that make up all of our queue members.\n", interface);
                        AST_LIST_REMOVE_CURRENT(list);
                        ast_free(curint);
                        break;
                }
        }
        AST_LIST_TRAVERSE_SAFE_END;
        AST_LIST_UNLOCK(&interfaces);

        return 0;
}

static void clear_and_free_interfaces(void)
{
        struct member_interface *curint;

        AST_LIST_LOCK(&interfaces);
        while ((curint = AST_LIST_REMOVE_HEAD(&interfaces, list)))
                ast_free(curint);
        AST_LIST_UNLOCK(&interfaces);
}

/*! 
 * \brief Change queue penalty by adding rule.
 *
 * Check rule for errors with time or fomatting, see if rule is relative to rest 
 * of queue, iterate list of rules to find correct insertion point, insert and return.
 * \retval -1 on failure
 * \retval 0 on success 
 * \note Call this with the rule_lists locked 
*/
static int insert_penaltychange (const char *list_name, const char *content, const int linenum)
{
        char *timestr, *maxstr, *minstr, *contentdup;
        struct penalty_rule *rule = NULL, *rule_iter;
        struct rule_list *rl_iter;
        int time, inserted = 0;

        if (!(rule = ast_calloc(1, sizeof(*rule)))) {
                ast_log(LOG_ERROR, "Cannot allocate memory for penaltychange rule at line %d!\n", linenum);
                return -1;
        }

        contentdup = ast_strdupa(content);
        
        if (!(maxstr = strchr(contentdup, ','))) {
                ast_log(LOG_WARNING, "Improperly formatted penaltychange rule at line %d. Ignoring.\n", linenum);
                ast_free(rule);
                return -1;
        }

        *maxstr++ = '\0';
        timestr = contentdup;

        if ((time = atoi(timestr)) < 0) {
                ast_log(LOG_WARNING, "Improper time parameter specified for penaltychange rule at line %d. Ignoring.\n", linenum);
                ast_free(rule);
                return -1;
        }

        rule->time = time;

        if ((minstr = strchr(maxstr,',')))
                *minstr++ = '\0';
        
        /* The last check will evaluate true if either no penalty change is indicated for a given rule
         * OR if a min penalty change is indicated but no max penalty change is */
        if (*maxstr == '+' || *maxstr == '-' || *maxstr == '\0') {
                rule->max_relative = 1;
        }

        rule->max_value = atoi(maxstr);

        if (!ast_strlen_zero(minstr)) {
                if (*minstr == '+' || *minstr == '-')
                        rule->min_relative = 1;
                rule->min_value = atoi(minstr);
        } else /*there was no minimum specified, so assume this means no change*/
                rule->min_relative = 1;

        /*We have the rule made, now we need to insert it where it belongs*/
        AST_LIST_TRAVERSE(&rule_lists, rl_iter, list){
                if (strcasecmp(rl_iter->name, list_name))
                        continue;

                AST_LIST_TRAVERSE_SAFE_BEGIN(&rl_iter->rules, rule_iter, list) {
                        if (rule->time < rule_iter->time) {
                                AST_LIST_INSERT_BEFORE_CURRENT(rule, list);
                                inserted = 1;
                                break;
                        }
                }
                AST_LIST_TRAVERSE_SAFE_END;
        
                if (!inserted) {
                        AST_LIST_INSERT_TAIL(&rl_iter->rules, rule, list);
                }
        }

        return 0;
}

/*! \brief Configure a queue parameter.
 * 
 * The failunknown flag is set for config files (and static realtime) to show
 * errors for unknown parameters. It is cleared for dynamic realtime to allow
 *  extra fields in the tables.
 * \note For error reporting, line number is passed for .conf static configuration,
 * for Realtime queues, linenum is -1.
*/
static void queue_set_param(struct call_queue *q, const char *param, const char *val, int linenum, int failunknown)
{
        if (!strcasecmp(param, "musicclass") || 
                !strcasecmp(param, "music") || !strcasecmp(param, "musiconhold")) {
                ast_string_field_set(q, moh, val);
        } else if (!strcasecmp(param, "announce")) {
                ast_string_field_set(q, announce, val);
        } else if (!strcasecmp(param, "context")) {
                ast_string_field_set(q, context, val);
        } else if (!strcasecmp(param, "timeout")) {
                q->timeout = atoi(val);
                if (q->timeout < 0)
                        q->timeout = DEFAULT_TIMEOUT;
        } else if (!strcasecmp(param, "ringinuse")) {
                q->ringinuse = ast_true(val);
        } else if (!strcasecmp(param, "setinterfacevar")) {
                q->setinterfacevar = ast_true(val);
        } else if (!strcasecmp(param, "setqueuevar")) {
                q->setqueuevar = ast_true(val);
        } else if (!strcasecmp(param, "setqueueentryvar")) {
                q->setqueueentryvar = ast_true(val);
        } else if (!strcasecmp(param, "monitor-format")) {
                ast_copy_string(q->monfmt, val, sizeof(q->monfmt));
        } else if (!strcasecmp(param, "membermacro")) {
                ast_string_field_set(q, membermacro, val);
        } else if (!strcasecmp(param, "membergosub")) {
                ast_string_field_set(q, membergosub, val);
        } else if (!strcasecmp(param, "queue-youarenext")) {
                ast_string_field_set(q, sound_next, val);
        } else if (!strcasecmp(param, "queue-thereare")) {
                ast_string_field_set(q, sound_thereare, val);
        } else if (!strcasecmp(param, "queue-callswaiting")) {
                ast_string_field_set(q, sound_calls, val);
        } else if (!strcasecmp(param, "queue-quantity1")) {
                ast_string_field_set(q, queue_quantity1, val);
        } else if (!strcasecmp(param, "queue-quantity2")) {
                ast_string_field_set(q, queue_quantity2, val);
        } else if (!strcasecmp(param, "queue-holdtime")) {
                ast_string_field_set(q, sound_holdtime, val);
        } else if (!strcasecmp(param, "queue-minutes")) {
                ast_string_field_set(q, sound_minutes, val);
        } else if (!strcasecmp(param, "queue-minute")) {
                ast_string_field_set(q, sound_minute, val);
        } else if (!strcasecmp(param, "queue-seconds")) {
                ast_string_field_set(q, sound_seconds, val);
        } else if (!strcasecmp(param, "queue-thankyou")) {
                ast_string_field_set(q, sound_thanks, val);
        } else if (!strcasecmp(param, "queue-callerannounce")) {
                ast_string_field_set(q, sound_callerannounce, val);
        } else if (!strcasecmp(param, "queue-reporthold")) {
                ast_string_field_set(q, sound_reporthold, val);
        } else if (!strcasecmp(param, "announce-frequency")) {
                q->announcefrequency = atoi(val);
        } else if (!strcasecmp(param, "min-announce-frequency")) {
                q->minannouncefrequency = atoi(val);
                ast_debug(1, "%s=%s for queue '%s'\n", param, val, q->name);
        } else if (!strcasecmp(param, "announce-round-seconds")) {
                q->roundingseconds = atoi(val);
                /* Rounding to any other values just doesn't make sense... */
                if (!(q->roundingseconds == 0 || q->roundingseconds == 5 || q->roundingseconds == 10
                        || q->roundingseconds == 15 || q->roundingseconds == 20 || q->roundingseconds == 30)) {
                        if (linenum >= 0) {
                                ast_log(LOG_WARNING, "'%s' isn't a valid value for %s "
                                        "using 0 instead for queue '%s' at line %d of queues.conf\n",
                                        val, param, q->name, linenum);
                        } else {
                                ast_log(LOG_WARNING, "'%s' isn't a valid value for %s "
                                        "using 0 instead for queue '%s'\n", val, param, q->name);
                        }
                        q->roundingseconds=0;
                }
        } else if (!strcasecmp(param, "announce-holdtime")) {
                if (!strcasecmp(val, "once"))
                        q->announceholdtime = ANNOUNCEHOLDTIME_ONCE;
                else if (ast_true(val))
                        q->announceholdtime = ANNOUNCEHOLDTIME_ALWAYS;
                else
                        q->announceholdtime = 0;
        } else if (!strcasecmp(param, "announce-position")) {
                if (!strcasecmp(val, "limit"))
                        q->announceposition = ANNOUNCEPOSITION_LIMIT;
                else if (!strcasecmp(val, "more"))
                        q->announceposition = ANNOUNCEPOSITION_MORE_THAN;
                else if (ast_true(val))
                        q->announceposition = ANNOUNCEPOSITION_YES;
                else
                        q->announceposition = ANNOUNCEPOSITION_NO;
        } else if (!strcasecmp(param, "announce-position-limit")) {
                q->announcepositionlimit = atoi(val);
        } else if (!strcasecmp(param, "periodic-announce")) {
                if (strchr(val, ',')) {
                        char *s, *buf = ast_strdupa(val);
                        unsigned int i = 0;

                        while ((s = strsep(&buf, ",|"))) {
                                if (!q->sound_periodicannounce[i])
                                        q->sound_periodicannounce[i] = ast_str_create(16);
                                ast_str_set(&q->sound_periodicannounce[i], 0, "%s", s);
                                i++;
                                if (i == MAX_PERIODIC_ANNOUNCEMENTS)
                                        break;
                        }
                        q->numperiodicannounce = i;
                } else {
                        ast_str_set(&q->sound_periodicannounce[0], 0, "%s", val);
                        q->numperiodicannounce = 1;
                }
        } else if (!strcasecmp(param, "periodic-announce-frequency")) {
                q->periodicannouncefrequency = atoi(val);
        } else if (!strcasecmp(param, "random-periodic-announce")) {
                q->randomperiodicannounce = ast_true(val);
        } else if (!strcasecmp(param, "retry")) {
                q->retry = atoi(val);
                if (q->retry <= 0)
                        q->retry = DEFAULT_RETRY;
        } else if (!strcasecmp(param, "wrapuptime")) {
                q->wrapuptime = atoi(val);
        } else if (!strcasecmp(param, "autofill")) {
                q->autofill = ast_true(val);
        } else if (!strcasecmp(param, "monitor-type")) {
                if (!strcasecmp(val, "mixmonitor"))
                        q->montype = 1;
        } else if (!strcasecmp(param, "autopause")) {
                q->autopause = ast_true(val);
        } else if (!strcasecmp(param, "maxlen")) {
                q->maxlen = atoi(val);
                if (q->maxlen < 0)
                        q->maxlen = 0;
        } else if (!strcasecmp(param, "servicelevel")) {
                q->servicelevel= atoi(val);
        } else if (!strcasecmp(param, "strategy")) {
                /* We already have set this, no need to do it again */
                return;
        } else if (!strcasecmp(param, "joinempty")) {
                if (!strcasecmp(val, "loose"))
                        q->joinempty = QUEUE_EMPTY_LOOSE;
                else if (!strcasecmp(val, "strict"))
                        q->joinempty = QUEUE_EMPTY_STRICT;
                else if (ast_true(val))
                        q->joinempty = QUEUE_EMPTY_NORMAL;
                else
                        q->joinempty = 0;
        } else if (!strcasecmp(param, "leavewhenempty")) {
                if (!strcasecmp(val, "loose"))
                        q->leavewhenempty = QUEUE_EMPTY_LOOSE;
                else if (!strcasecmp(val, "strict"))
                        q->leavewhenempty = QUEUE_EMPTY_STRICT;
                else if (ast_true(val))
                        q->leavewhenempty = QUEUE_EMPTY_NORMAL;
                else
                        q->leavewhenempty = 0;
        } else if (!strcasecmp(param, "eventmemberstatus")) {
                q->maskmemberstatus = !ast_true(val);
        } else if (!strcasecmp(param, "eventwhencalled")) {
                if (!strcasecmp(val, "vars")) {
                        q->eventwhencalled = QUEUE_EVENT_VARIABLES;
                } else {
                        q->eventwhencalled = ast_true(val) ? 1 : 0;
                }
        } else if (!strcasecmp(param, "reportholdtime")) {
                q->reportholdtime = ast_true(val);
        } else if (!strcasecmp(param, "memberdelay")) {
                q->memberdelay = atoi(val);
        } else if (!strcasecmp(param, "weight")) {
                q->weight = atoi(val);
                if (q->weight)
                        use_weight++;
                /* With Realtime queues, if the last queue using weights is deleted in realtime,
                   we will not see any effect on use_weight until next reload. */
        } else if (!strcasecmp(param, "timeoutrestart")) {
                q->timeoutrestart = ast_true(val);
        } else if (!strcasecmp(param, "defaultrule")) {
                ast_string_field_set(q, defaultrule, val);
        } else if (failunknown) {
                if (linenum >= 0) {
                        ast_log(LOG_WARNING, "Unknown keyword in queue '%s': %s at line %d of queues.conf\n",
                                q->name, param, linenum);
                } else {
                        ast_log(LOG_WARNING, "Unknown keyword in queue '%s': %s\n", q->name, param);
                }
        }
}

/*!
 * \brief Find rt member record to update otherwise create one.
 *
 * Search for member in queue, if found update penalty/paused state,
 * if no memeber exists create one flag it as a RT member and add to queue member list. 
*/
static void rt_handle_member_record(struct call_queue *q, char *interface, const char *rt_uniqueid, const char *membername, const char *penalty_str, const char *paused_str, const char* state_interface)
{
        struct member *m;
        struct ao2_iterator mem_iter;
        int penalty = 0;
        int paused  = 0;
        int found = 0;

        if (penalty_str) {
                penalty = atoi(penalty_str);
                if (penalty < 0)
                        penalty = 0;
        }

        if (paused_str) {
                paused = atoi(paused_str);
                if (paused < 0)
                        paused = 0;
        }

        /* Find member by realtime uniqueid and update */
        mem_iter = ao2_iterator_init(q->members, 0);
        while ((m = ao2_iterator_next(&mem_iter))) {
                if (!strcasecmp(m->rt_uniqueid, rt_uniqueid)) {
                        m->dead = 0;    /* Do not delete this one. */
                        ast_copy_string(m->rt_uniqueid, rt_uniqueid, sizeof(m->rt_uniqueid));
                        if (paused_str)
                                m->paused = paused;
                        if (strcasecmp(state_interface, m->state_interface)) {
                                remove_from_interfaces(m->state_interface);
                                ast_copy_string(m->state_interface, state_interface, sizeof(m->state_interface));
                                add_to_interfaces(m->state_interface);
                        }          
                        m->penalty = penalty;
                        found = 1;
                        ao2_ref(m, -1);
                        break;
                }
                ao2_ref(m, -1);
        }

        /* Create a new member */
        if (!found) {
                if ((m = create_queue_member(interface, membername, penalty, paused, state_interface))) {
                        m->dead = 0;
                        m->realtime = 1;
                        ast_copy_string(m->rt_uniqueid, rt_uniqueid, sizeof(m->rt_uniqueid));
                        add_to_interfaces(m->state_interface);
                        ast_queue_log(q->name, "REALTIME", m->interface, "ADDMEMBER", "%s", "");
                        ao2_link(q->members, m);
                        ao2_ref(m, -1);
                        m = NULL;
                        q->membercount++;
                }
        }
}

/*! \brief Iterate through queue's member list and delete them */
static void free_members(struct call_queue *q, int all)
{
        /* Free non-dynamic members */
        struct member *cur;
        struct ao2_iterator mem_iter = ao2_iterator_init(q->members, 0);

        while ((cur = ao2_iterator_next(&mem_iter))) {
                if (all || !cur->dynamic) {
                        ao2_unlink(q->members, cur);
                        remove_from_interfaces(cur->state_interface);
                        q->membercount--;
                }
                ao2_ref(cur, -1);
        }
}

/*! \brief Free queue's member list then its string fields */
static void destroy_queue(void *obj)
{
        struct call_queue *q = obj;
        int i;

        free_members(q, 1);
        ast_string_field_free_memory(q);
        for (i = 0; i < MAX_PERIODIC_ANNOUNCEMENTS; i++) {
                if (q->sound_periodicannounce[i])
                        free(q->sound_periodicannounce[i]);
        }
        ao2_ref(q->members, -1);
}

static struct call_queue *alloc_queue(const char *queuename)
{
        struct call_queue *q;

        if ((q = ao2_alloc(sizeof(*q), destroy_queue))) {
                if (ast_string_field_init(q, 64)) {
                        free(q);
                        return NULL;
                }
                ast_string_field_set(q, name, queuename);
        }
        return q;
}

/*!
 * \brief Reload a single queue via realtime.
 *
 * Check for statically defined queue first, check if deleted RT queue,
 * check for new RT queue, if queue vars are not defined init them with defaults.
 * reload RT queue vars, set RT queue members dead and reload them, return finished queue.
 * \retval the queue, 
 * \retval NULL if it doesn't exist.
 * \note Should be called with the "queues" container locked. 
*/
static struct call_queue *find_queue_by_name_rt(const char *queuename, struct ast_variable *queue_vars, struct ast_config *member_config)
{
        struct ast_variable *v;
        struct call_queue *q, tmpq = {
                .name = queuename,      
        };
        struct member *m;
        struct ao2_iterator mem_iter;
        char *interface = NULL;
        const char *tmp_name;
        char *tmp;
        char tmpbuf[64];        /* Must be longer than the longest queue param name. */

        /* Static queues override realtime. */
        if ((q = ao2_find(queues, &tmpq, OBJ_POINTER))) {
                ao2_lock(q);
                if (!q->realtime) {
                        if (q->dead) {
                                ao2_unlock(q);
                                queue_unref(q);
                                return NULL;
                        } else {
                                ast_log(LOG_WARNING, "Static queue '%s' already exists. Not loading from realtime\n", q->name);
                                ao2_unlock(q);
                                return q;
                        }
                }
                queue_unref(q);
        } else if (!member_config)
                /* Not found in the list, and it's not realtime ... */
                return NULL;

        /* Check if queue is defined in realtime. */
        if (!queue_vars) {
                /* Delete queue from in-core list if it has been deleted in realtime. */
                if (q) {
                        /*! \note Hmm, can't seem to distinguish a DB failure from a not
                           found condition... So we might delete an in-core queue
                           in case of DB failure. */
                        ast_debug(1, "Queue %s not found in realtime.\n", queuename);

                        q->dead = 1;
                        /* Delete if unused (else will be deleted when last caller leaves). */
                        ao2_unlink(queues, q);
                        ao2_unlock(q);
                        queue_unref(q);
                }
                return NULL;
        }

        /* Create a new queue if an in-core entry does not exist yet. */
        if (!q) {
                struct ast_variable *tmpvar = NULL;
                if (!(q = alloc_queue(queuename)))
                        return NULL;
                ao2_lock(q);
                clear_queue(q);
                q->realtime = 1;
                /*Before we initialize the queue, we need to set the strategy, so that linear strategy
                 * will allocate the members properly
                 */
                for (tmpvar = queue_vars; tmpvar; tmpvar = tmpvar->next) {
                        if (!strcasecmp(tmpvar->name, "strategy")) {
                                q->strategy = strat2int(tmpvar->value);
                                if (q->strategy < 0) {
                                        ast_log(LOG_WARNING, "'%s' isn't a valid strategy for queue '%s', using ringall instead\n",
                                        tmpvar->value, q->name);
                                        q->strategy = QUEUE_STRATEGY_RINGALL;
                                }
                                break;
                        }
                }
                /* We traversed all variables and didn't find a strategy */
                if (!tmpvar)
                        q->strategy = QUEUE_STRATEGY_RINGALL;
                init_queue(q);          /* Ensure defaults for all parameters not set explicitly. */
                ao2_link(queues, q);
        }

        memset(tmpbuf, 0, sizeof(tmpbuf));
        for (v = queue_vars; v; v = v->next) {
                /* Convert to dashes `-' from underscores `_' as the latter are more SQL friendly. */
                if ((tmp = strchr(v->name, '_'))) {
                        ast_copy_string(tmpbuf, v->name, sizeof(tmpbuf));
                        tmp_name = tmpbuf;
                        tmp = tmpbuf;
                        while ((tmp = strchr(tmp, '_')))
                                *tmp++ = '-';
                } else
                        tmp_name = v->name;

                if (!ast_strlen_zero(v->value)) {
                        /* Don't want to try to set the option if the value is empty */
                        queue_set_param(q, tmp_name, v->value, -1, 0);
                }
        }

        /* Temporarily set realtime members dead so we can detect deleted ones. 
         * Also set the membercount correctly for realtime*/
        mem_iter = ao2_iterator_init(q->members, 0);
        while ((m = ao2_iterator_next(&mem_iter))) {
                q->membercount++;
                if (m->realtime)
                        m->dead = 1;
                ao2_ref(m, -1);
        }

        while ((interface = ast_category_browse(member_config, interface))) {
                rt_handle_member_record(q, interface,
                        ast_variable_retrieve(member_config, interface, "uniqueid"),
                        S_OR(ast_variable_retrieve(member_config, interface, "membername"),interface),
                        ast_variable_retrieve(member_config, interface, "penalty"),
                        ast_variable_retrieve(member_config, interface, "paused"),
                        S_OR(ast_variable_retrieve(member_config, interface, "state_interface"),interface));
        }

        /* Delete all realtime members that have been deleted in DB. */
        mem_iter = ao2_iterator_init(q->members, 0);
        while ((m = ao2_iterator_next(&mem_iter))) {
                if (m->dead) {
                        ast_queue_log(q->name, "REALTIME", m->interface, "REMOVEMEMBER", "%s", "");
                        ao2_unlink(q->members, m);
                        remove_from_interfaces(m->state_interface);
                        q->membercount--;
                }
                ao2_ref(m, -1);
        }

        ao2_unlock(q);

        return q;
}

static struct call_queue *load_realtime_queue(const char *queuename)
{
        struct ast_variable *queue_vars;
        struct ast_config *member_config = NULL;
        struct call_queue *q = NULL, tmpq = {
                .name = queuename,      
        };

        /* Find the queue in the in-core list first. */
        q = ao2_find(queues, &tmpq, OBJ_POINTER);

        if (!q || q->realtime) {
                /*! \note Load from realtime before taking the "queues" container lock, to avoid blocking all
                   queue operations while waiting for the DB.

                   This will be two separate database transactions, so we might
                   see queue parameters as they were before another process
                   changed the queue and member list as it was after the change.
                   Thus we might see an empty member list when a queue is
                   deleted. In practise, this is unlikely to cause a problem. */

                queue_vars = ast_load_realtime("queues", "name", queuename, NULL);
                if (queue_vars) {
                        member_config = ast_load_realtime_multientry("queue_members", "interface LIKE", "%", "queue_name", queuename, NULL);
                        if (!member_config) {
                                ast_log(LOG_ERROR, "no queue_members defined in your config (extconfig.conf).\n");
                                ast_variables_destroy(queue_vars);
                                return NULL;
                        }
                }

                ao2_lock(queues);
                q = find_queue_by_name_rt(queuename, queue_vars, member_config);
                if (member_config)
                        ast_config_destroy(member_config);
                if (queue_vars)
                        ast_variables_destroy(queue_vars);
                ao2_unlock(queues);

        } else {
                update_realtime_members(q);
        }
        return q;
}

static int update_realtime_member_field(struct member *mem, const char *queue_name, const char *field, const char *value)
{
        int ret = -1;

        if (ast_strlen_zero(mem->rt_uniqueid))
                return ret;

        if ((ast_update_realtime("queue_members", "uniqueid", mem->rt_uniqueid, field, value, NULL)) > 0)
                ret = 0;

        return ret;
}


static void update_realtime_members(struct call_queue *q)
{
        struct ast_config *member_config = NULL;
        struct member *m;
        char *interface = NULL;
        struct ao2_iterator mem_iter;

        if (!(member_config = ast_load_realtime_multientry("queue_members", "interface LIKE", "%", "queue_name", q->name , NULL))) {
                /*This queue doesn't have realtime members*/
                ast_debug(3, "Queue %s has no realtime members defined. No need for update\n", q->name);
                return;
        }

        ao2_lock(q);
        
        /* Temporarily set realtime  members dead so we can detect deleted ones.*/ 
        mem_iter = ao2_iterator_init(q->members, 0);
        while ((m = ao2_iterator_next(&mem_iter))) {
                if (m->realtime)
                        m->dead = 1;
                ao2_ref(m, -1);
        }

        while ((interface = ast_category_browse(member_config, interface))) {
                rt_handle_member_record(q, interface,
                        ast_variable_retrieve(member_config, interface, "uniqueid"),
                        S_OR(ast_variable_retrieve(member_config, interface, "membername"), interface),
                        ast_variable_retrieve(member_config, interface, "penalty"),
                        ast_variable_retrieve(member_config, interface, "paused"),
                        S_OR(ast_variable_retrieve(member_config, interface, "state_interface"), interface));
        }

        /* Delete all realtime members that have been deleted in DB. */
        mem_iter = ao2_iterator_init(q->members, 0);
        while ((m = ao2_iterator_next(&mem_iter))) {
                if (m->dead) {
                        ast_queue_log(q->name, "REALTIME", m->interface, "REMOVEMEMBER", "%s", "");
                        ao2_unlink(q->members, m);
                        remove_from_interfaces(m->state_interface);
                        q->membercount--;
                }
                ao2_ref(m, -1);
        }
        ao2_unlock(q);
        ast_config_destroy(member_config);
}

static int join_queue(char *queuename, struct queue_ent *qe, enum queue_result *reason)
{
        struct call_queue *q;
        struct queue_ent *cur, *prev = NULL;
        int res = -1;
        int pos = 0;
        int inserted = 0;
        enum queue_member_status stat;

        if (!(q = load_realtime_queue(queuename)))
                return res;

        ao2_lock(queues);
        ao2_lock(q);

        /* This is our one */
        stat = get_member_status(q, qe->max_penalty, qe->min_penalty);
        if (!q->joinempty && (stat == QUEUE_NO_MEMBERS))
                *reason = QUEUE_JOINEMPTY;
        else if ((q->joinempty == QUEUE_EMPTY_STRICT) && (stat == QUEUE_NO_REACHABLE_MEMBERS || stat == QUEUE_NO_UNPAUSED_REACHABLE_MEMBERS || stat == QUEUE_NO_MEMBERS))
                *reason = QUEUE_JOINUNAVAIL;
        else if ((q->joinempty == QUEUE_EMPTY_LOOSE) && (stat == QUEUE_NO_REACHABLE_MEMBERS || stat == QUEUE_NO_MEMBERS))
                *reason = QUEUE_JOINUNAVAIL;
        else if (q->maxlen && (q->count >= q->maxlen))
                *reason = QUEUE_FULL;
        else {
                /* There's space for us, put us at the right position inside
                 * the queue.
                 * Take into account the priority of the calling user */
                inserted = 0;
                prev = NULL;
                cur = q->head;
                while (cur) {
                        /* We have higher priority than the current user, enter
                         * before him, after all the other users with priority
                         * higher or equal to our priority. */
                        if ((!inserted) && (qe->prio > cur->prio)) {
                                insert_entry(q, prev, qe, &pos);
                                inserted = 1;
                        }
                        cur->pos = ++pos;
                        prev = cur;
                        cur = cur->next;
                }
                /* No luck, join at the end of the queue */
                if (!inserted)
                        insert_entry(q, prev, qe, &pos);
                ast_copy_string(qe->moh, q->moh, sizeof(qe->moh));
                ast_copy_string(qe->announce, q->announce, sizeof(qe->announce));
                ast_copy_string(qe->context, q->context, sizeof(qe->context));
                q->count++;
                res = 0;
                manager_event(EVENT_FLAG_CALL, "Join",
                        "Channel: %s\r\nCallerID: %s\r\nCallerIDName: %s\r\nQueue: %s\r\nPosition: %d\r\nCount: %d\r\nUniqueid: %s\r\n",
                        qe->chan->name,
                        S_OR(qe->chan->cid.cid_num, "unknown"), /* XXX somewhere else it is <unknown> */
                        S_OR(qe->chan->cid.cid_name, "unknown"),
                        q->name, qe->pos, q->count, qe->chan->uniqueid );
                ast_debug(1, "Queue '%s' Join, Channel '%s', Position '%d'\n", q->name, qe->chan->name, qe->pos );
        }
        ao2_unlock(q);
        ao2_unlock(queues);

        return res;
}

static int play_file(struct ast_channel *chan, const char *filename)
{
        int res;

        ast_stopstream(chan);

        res = ast_streamfile(chan, filename, chan->language);
        if (!res)
                res = ast_waitstream(chan, AST_DIGIT_ANY);

        ast_stopstream(chan);

        return res;
}

/*!
 * \brief Check for valid exit from queue via goto
 * \retval 0 if failure
 * \retval 1 if successful
*/
static int valid_exit(struct queue_ent *qe, char digit)
{
        int digitlen = strlen(qe->digits);

        /* Prevent possible buffer overflow */
        if (digitlen < sizeof(qe->digits) - 2) {
                qe->digits[digitlen] = digit;
                qe->digits[digitlen + 1] = '\0';
        } else {
                qe->digits[0] = '\0';
                return 0;
        }

        /* If there's no context to goto, short-circuit */
        if (ast_strlen_zero(qe->context))
                return 0;

        /* If the extension is bad, then reset the digits to blank */
        if (!ast_canmatch_extension(qe->chan, qe->context, qe->digits, 1, qe->chan->cid.cid_num)) {
                qe->digits[0] = '\0';
                return 0;
        }

        /* We have an exact match */
        if (!ast_goto_if_exists(qe->chan, qe->context, qe->digits, 1)) {
                qe->valid_digits = 1;
                /* Return 1 on a successful goto */
                return 1;
        }

        return 0;
}

static int say_position(struct queue_ent *qe, int ringing)
{
        int res = 0, avgholdmins, avgholdsecs, announceposition = 0;
        time_t now;

        /* Let minannouncefrequency seconds pass between the start of each position announcement */
        time(&now);
        if ((now - qe->last_pos) < qe->parent->minannouncefrequency)
                return 0;

        /* If either our position has changed, or we are over the freq timer, say position */
        if ((qe->last_pos_said == qe->pos) && ((now - qe->last_pos) < qe->parent->announcefrequency))
                return 0;

        if (ringing) {
                ast_indicate(qe->chan,-1);
        } else {
                ast_moh_stop(qe->chan);
        }

        if (qe->parent->announceposition == ANNOUNCEPOSITION_YES ||
                qe->parent->announceposition == ANNOUNCEPOSITION_MORE_THAN ||
                (qe->parent->announceposition == ANNOUNCEPOSITION_LIMIT &&
                qe->pos <= qe->parent->announcepositionlimit))
                        announceposition = 1;


        if (announceposition == 1) {
                /* Say we're next, if we are */
                if (qe->pos == 1) {
                        res = play_file(qe->chan, qe->parent->sound_next);
                        if (res)
                                goto playout;
                        else
                                goto posout;
                } else {
                        if (qe->parent->announceposition == ANNOUNCEPOSITION_MORE_THAN && qe->pos > qe->parent->announcepositionlimit){
                                /* More than Case*/
                                res = play_file(qe->chan, qe->parent->queue_quantity1);
                                if (res)
                                        goto playout;
                                res = ast_say_number(qe->chan, qe->parent->announcepositionlimit, AST_DIGIT_ANY, qe->chan->language, NULL); /* Needs gender */
                                if (res)
                                        goto playout;
                        } else {
                                /* Normal Case */
                                res = play_file(qe->chan, qe->parent->sound_thereare);
                                if (res)
                                        goto playout;
                                res = ast_say_number(qe->chan, qe->pos, AST_DIGIT_ANY, qe->chan->language, NULL); /* Needs gender */
                                if (res)
                                        goto playout;
                        }
                        if (qe->parent->announceposition == ANNOUNCEPOSITION_MORE_THAN && qe->pos > qe->parent->announcepositionlimit){
                                /* More than Case*/
                                res = play_file(qe->chan, qe->parent->queue_quantity2);
                                if (res)
                                        goto playout;
                        } else {
                                res = play_file(qe->chan, qe->parent->sound_calls);
                                if (res)
                                        goto playout;
                        }
                }
        }
        /* Round hold time to nearest minute */
        avgholdmins = abs(((qe->parent->holdtime + 30) - (now - qe->start)) / 60);

        /* If they have specified a rounding then round the seconds as well */
        if (qe->parent->roundingseconds) {
                avgholdsecs = (abs(((qe->parent->holdtime + 30) - (now - qe->start))) - 60 * avgholdmins) / qe->parent->roundingseconds;
                avgholdsecs *= qe->parent->roundingseconds;
        } else {
                avgholdsecs = 0;
        }

        ast_verb(3, "Hold time for %s is %d minute(s) %d seconds\n", qe->parent->name, avgholdmins, avgholdsecs);

        /* If the hold time is >1 min, if it's enabled, and if it's not
           supposed to be only once and we have already said it, say it */
    if ((avgholdmins+avgholdsecs) > 0 && qe->parent->announceholdtime &&
        ((qe->parent->announceholdtime == ANNOUNCEHOLDTIME_ONCE && !qe->last_pos) ||
        !(qe->parent->announceholdtime == ANNOUNCEHOLDTIME_ONCE))) {
                res = play_file(qe->chan, qe->parent->sound_holdtime);
                if (res)
                        goto playout;

                if (avgholdmins > 1) {
                        res = ast_say_number(qe->chan, avgholdmins, AST_DIGIT_ANY, qe->chan->language, NULL);
                        if (res)
                                goto playout;

                        if (avgholdmins == 1) {
                                res = play_file(qe->chan, qe->parent->sound_minute);
                                if (res)
                                        goto playout;
                        } else {
                                res = play_file(qe->chan, qe->parent->sound_minutes);
                                if (res)
                                        goto playout;
                        }
                }
                if (avgholdsecs > 1) {
                        res = ast_say_number(qe->chan, avgholdmins > 1 ? avgholdsecs : avgholdmins * 60 + avgholdsecs, AST_DIGIT_ANY, qe->chan->language, NULL);
                        if (res)
                                goto playout;

                        res = play_file(qe->chan, qe->parent->sound_seconds);
                        if (res)
                                goto playout;
                }

        }

posout:
        if (announceposition == 1){
                if (qe->parent->announceposition) {
                        ast_verb(3, "Told %s in %s their queue position (which was %d)\n",
                                qe->chan->name, qe->parent->name, qe->pos);
                }
                res = play_file(qe->chan, qe->parent->sound_thanks);
        }
playout:
        if ((res > 0 && !valid_exit(qe, res)) || res < 0)
                res = 0;

        /* Set our last_pos indicators */
        qe->last_pos = now;
        qe->last_pos_said = qe->pos;

        /* Don't restart music on hold if we're about to exit the caller from the queue */
        if (!res) {
                if (ringing) {
                        ast_indicate(qe->chan, AST_CONTROL_RINGING);
                } else {
                        ast_moh_start(qe->chan, qe->moh, NULL);
                }
        }
        return res;
}

static void recalc_holdtime(struct queue_ent *qe, int newholdtime)
{
        int oldvalue;

        /* Calculate holdtime using an exponential average */
        /* Thanks to SRT for this contribution */
        /* 2^2 (4) is the filter coefficient; a higher exponent would give old entries more weight */

        ao2_lock(qe->parent);
        oldvalue = qe->parent->holdtime;
        qe->parent->holdtime = (((oldvalue << 2) - oldvalue) + newholdtime) >> 2;
        ao2_unlock(qe->parent);
}

/*! \brief Caller leaving queue.
 * 
 * Search the queue to find the leaving client, if found remove from queue
 * create manager event, move others up the queue.
*/
static void leave_queue(struct queue_ent *qe)
{
        struct call_queue *q;
        struct queue_ent *cur, *prev = NULL;
        struct penalty_rule *pr_iter;
        int pos = 0;

        if (!(q = qe->parent))
                return;
        queue_ref(q);
        ao2_lock(q);

        prev = NULL;
        for (cur = q->head; cur; cur = cur->next) {
                if (cur == qe) {
                        q->count--;

                        /* Take us out of the queue */
                        manager_event(EVENT_FLAG_CALL, "Leave",
                                "Channel: %s\r\nQueue: %s\r\nCount: %d\r\nUniqueid: %s\r\n",
                                qe->chan->name, q->name,  q->count, qe->chan->uniqueid);
                        ast_debug(1, "Queue '%s' Leave, Channel '%s'\n", q->name, qe->chan->name );
                        /* Take us out of the queue */
                        if (prev)
                                prev->next = cur->next;
                        else
                                q->head = cur->next;
                        /* Free penalty rules */
                        while ((pr_iter = AST_LIST_REMOVE_HEAD(&qe->qe_rules, list)))
                                ast_free(pr_iter);
                } else {
                        /* Renumber the people after us in the queue based on a new count */
                        cur->pos = ++pos;
                        prev = cur;
                }
        }
        ao2_unlock(q);

        /*If the queue is a realtime queue, check to see if it's still defined in real time*/
        if (q->realtime) {
                if (!ast_load_realtime("queues", "name", q->name, NULL))
                        q->dead = 1;
        }

        if (q->dead) {  
                /* It's dead and nobody is in it, so kill it */
                ao2_unlink(queues, q);
                /* unref the container's reference to the queue */
                queue_unref(q);
        }
        /* unref the explicit ref earlier in the function */
        queue_unref(q);
}

/*! \brief Hang up a list of outgoing calls */
static void hangupcalls(struct callattempt *outgoing, struct ast_channel *exception)
{
        struct callattempt *oo;

        while (outgoing) {
                /* Hangup any existing lines we have open */
                if (outgoing->chan && (outgoing->chan != exception))
                        ast_hangup(outgoing->chan);
                oo = outgoing;
                outgoing = outgoing->q_next;
                if (oo->member)
                        ao2_ref(oo->member, -1);
                ast_free(oo);
        }
}

/*! 
 * \brief traverse all defined queues which have calls waiting and contain this member
 * \retval 0 if no other queue has precedence (higher weight) 
 * \retval 1 if found  
*/
static int compare_weight(struct call_queue *rq, struct member *member)
{
        struct call_queue *q;
        struct member *mem;
        int found = 0;
        struct ao2_iterator queue_iter;
        
        /* q's lock and rq's lock already set by try_calling()
         * to solve deadlock */
        queue_iter = ao2_iterator_init(queues, 0);
        while ((q = ao2_iterator_next(&queue_iter))) {
                if (q == rq) { /* don't check myself, could deadlock */
                        queue_unref(q);
                        continue;
                }
                ao2_lock(q);
                if (q->count && q->members) {
                        if ((mem = ao2_find(q->members, member, OBJ_POINTER))) {
                                ast_debug(1, "Found matching member %s in queue '%s'\n", mem->interface, q->name);
                                if (q->weight > rq->weight) {
                                        ast_debug(1, "Queue '%s' (weight %d, calls %d) is preferred over '%s' (weight %d, calls %d)\n", q->name, q->weight, q->count, rq->name, rq->weight, rq->count);
                                        found = 1;
                                }
                                ao2_ref(mem, -1);
                        }
                }
                ao2_unlock(q);
                if (found) {
                        queue_unref(q);
                        break;
                }
                queue_unref(q);
        }
        return found;
}

/*! \brief common hangup actions */
static void do_hang(struct callattempt *o)
{
        o->stillgoing = 0;
        ast_hangup(o->chan);
        o->chan = NULL;
}

/*! \brief convert "\n" to "\nVariable: " ready for manager to use */
static char *vars2manager(struct ast_channel *chan, char *vars, size_t len)
{
        struct ast_str *buf = ast_str_alloca(len + 1);
        char *tmp;

        if (pbx_builtin_serialize_variables(chan, &buf)) {
                int i, j;

                /* convert "\n" to "\nVariable: " */
                strcpy(vars, "Variable: ");
                tmp = buf->str;

                for (i = 0, j = 10; (i < len - 1) && (j < len - 1); i++, j++) {
                        vars[j] = tmp[i];

                        if (tmp[i + 1] == '\0')
                                break;
                        if (tmp[i] == '\n') {
                                vars[j++] = '\r';
                                vars[j++] = '\n';

                                ast_copy_string(&(vars[j]), "Variable: ", len - j);
                                j += 9;
                        }
                }
                if (j > len - 3)
                        j = len - 3;
                vars[j++] = '\r';
                vars[j++] = '\n';
                vars[j] = '\0';
        } else {
                /* there are no channel variables; leave it blank */
                *vars = '\0';
        }
        return vars;
}

/*! 
 * \brief Part 2 of ring_one
 *
 * Does error checking before attempting to request a channel and call a member. 
 * This function is only called from ring_one(). 
 * Failure can occur if:
 * - Agent on call
 * - Agent is paused
 * - Wrapup time not expired
 * - Priority by another queue
 *
 * \retval 1 on success to reach a free agent
 * \retval 0 on failure to get agent.
 */
static int ring_entry(struct queue_ent *qe, struct callattempt *tmp, int *busies)
{
        int res;
        int status;
        char tech[256];
        char *location;
        const char *macrocontext, *macroexten;

        /* on entry here, we know that tmp->chan == NULL */
        if ((tmp->lastqueue && tmp->lastqueue->wrapuptime && (time(NULL) - tmp->lastcall < tmp->lastqueue->wrapuptime)) ||
                (!tmp->lastqueue && qe->parent->wrapuptime && (time(NULL) - tmp->lastcall < qe->parent->wrapuptime))) {
                ast_debug(1, "Wrapuptime not yet expired on queue %s for %s\n", 
                                (tmp->lastqueue ? tmp->lastqueue->name : qe->parent->name), tmp->interface);
                if (qe->chan->cdr)
                        ast_cdr_busy(qe->chan->cdr);
                tmp->stillgoing = 0;
                (*busies)++;
                return 0;
        }

        if (!qe->parent->ringinuse && (tmp->member->status != AST_DEVICE_NOT_INUSE) && (tmp->member->status != AST_DEVICE_UNKNOWN)) {
                ast_debug(1, "%s in use, can't receive call\n", tmp->interface);
                if (qe->chan->cdr)
                        ast_cdr_busy(qe->chan->cdr);
                tmp->stillgoing = 0;
                return 0;
        }

        if (tmp->member->paused) {
                ast_debug(1, "%s paused, can't receive call\n", tmp->interface);
                if (qe->chan->cdr)
                        ast_cdr_busy(qe->chan->cdr);
                tmp->stillgoing = 0;
                return 0;
        }
        if (use_weight && compare_weight(qe->parent,tmp->member)) {
                ast_debug(1, "Priority queue delaying call to %s:%s\n", qe->parent->name, tmp->interface);
                if (qe->chan->cdr)
                        ast_cdr_busy(qe->chan->cdr);
                tmp->stillgoing = 0;
                (*busies)++;
                return 0;
        }

        ast_copy_string(tech, tmp->interface, sizeof(tech));
        if ((location = strchr(tech, '/')))
                *location++ = '\0';
        else
                location = "";

        /* Request the peer */
        tmp->chan = ast_request(tech, qe->chan->nativeformats, location, &status);
        if (!tmp->chan) {                       /* If we can't, just go on to the next call */
                if (qe->chan->cdr)
                        ast_cdr_busy(qe->chan->cdr);
                tmp->stillgoing = 0;

                update_status(tmp->member->state_interface, ast_device_state(tmp->member->state_interface));

                ao2_lock(qe->parent);
                qe->parent->rrpos++;
                qe->linpos++;
                ao2_unlock(qe->parent);


                (*busies)++;
                return 0;
        }
        
        tmp->chan->appl = "AppQueue";
        tmp->chan->data = "(Outgoing Line)";
        memset(&tmp->chan->whentohangup, 0, sizeof(tmp->chan->whentohangup));
        if (tmp->chan->cid.cid_num)
                ast_free(tmp->chan->cid.cid_num);
        tmp->chan->cid.cid_num = ast_strdup(qe->chan->cid.cid_num);
        if (tmp->chan->cid.cid_name)
                ast_free(tmp->chan->cid.cid_name);
        tmp->chan->cid.cid_name = ast_strdup(qe->chan->cid.cid_name);
        if (tmp->chan->cid.cid_ani)
                ast_free(tmp->chan->cid.cid_ani);
        tmp->chan->cid.cid_ani = ast_strdup(qe->chan->cid.cid_ani);

        /* Inherit specially named variables from parent channel */
        ast_channel_inherit_variables(qe->chan, tmp->chan);

        /* Presense of ADSI CPE on outgoing channel follows ours */
        tmp->chan->adsicpe = qe->chan->adsicpe;

        /* Inherit context and extension */
        ast_channel_lock(qe->chan);
        macrocontext = pbx_builtin_getvar_helper(qe->chan, "MACRO_CONTEXT");
        if (!ast_strlen_zero(macrocontext))
                ast_copy_string(tmp->chan->dialcontext, macrocontext, sizeof(tmp->chan->dialcontext));
        else
                ast_copy_string(tmp->chan->dialcontext, qe->chan->context, sizeof(tmp->chan->dialcontext));
        macroexten = pbx_builtin_getvar_helper(qe->chan, "MACRO_EXTEN");
        if (!ast_strlen_zero(macroexten))
                ast_copy_string(tmp->chan->exten, macroexten, sizeof(tmp->chan->exten));
        else
                ast_copy_string(tmp->chan->exten, qe->chan->exten, sizeof(tmp->chan->exten));
        ast_channel_unlock(qe->chan);

        /* Place the call, but don't wait on the answer */
        if ((res = ast_call(tmp->chan, location, 0))) {
                /* Again, keep going even if there's an error */
                ast_debug(1, "ast call on peer returned %d\n", res);
                ast_verb(3, "Couldn't call %s\n", tmp->interface);
                do_hang(tmp);
                (*busies)++;
                return 0;
        } else if (qe->parent->eventwhencalled) {
                char vars[2048];

                manager_event(EVENT_FLAG_AGENT, "AgentCalled",
                                        "Queue: %s\r\n"
                                        "AgentCalled: %s\r\n"
                                        "AgentName: %s\r\n"
                                        "ChannelCalling: %s\r\n"
                                        "DestinationChannel: %s\r\n"
                                        "CallerIDNum: %s\r\n"
                                        "CallerIDName: %s\r\n"
                                        "Context: %s\r\n"
                                        "Extension: %s\r\n"
                                        "Priority: %d\r\n"
                                        "Uniqueid: %s\r\n"
                                        "%s",
                                        qe->parent->name, tmp->interface, tmp->member->membername, qe->chan->name, tmp->chan->name,
                                        tmp->chan->cid.cid_num ? tmp->chan->cid.cid_num : "unknown",
                                        tmp->chan->cid.cid_name ? tmp->chan->cid.cid_name : "unknown",
                                        qe->chan->context, qe->chan->exten, qe->chan->priority, qe->chan->uniqueid,
                                        qe->parent->eventwhencalled == QUEUE_EVENT_VARIABLES ? vars2manager(qe->chan, vars, sizeof(vars)) : "");
                ast_verb(3, "Called %s\n", tmp->interface);
        }

        return 1;
}

/*! \brief find the entry with the best metric, or NULL */
static struct callattempt *find_best(struct callattempt *outgoing)
{
        struct callattempt *best = NULL, *cur;

        for (cur = outgoing; cur; cur = cur->q_next) {
                if (cur->stillgoing &&                                  /* Not already done */
                        !cur->chan &&                                   /* Isn't already going */
                        (!best || cur->metric < best->metric)) {                /* We haven't found one yet, or it's better */
                        best = cur;
                }
        }

        return best;
}

/*! 
 * \brief Place a call to a queue member.
 *
 * Once metrics have been calculated for each member, this function is used
 * to place a call to the appropriate member (or members). The low-level
 * channel-handling and error detection is handled in ring_entry
 *
 * \retval 1 if a member was called successfully
 * \retval 0 otherwise
 */
static int ring_one(struct queue_ent *qe, struct callattempt *outgoing, int *busies)
{
        int ret = 0;

        while (ret == 0) {
                struct callattempt *best = find_best(outgoing);
                if (!best) {
                        ast_debug(1, "Nobody left to try ringing in queue\n");
                        break;
                }
                if (qe->parent->strategy == QUEUE_STRATEGY_RINGALL) {
                        struct callattempt *cur;
                        /* Ring everyone who shares this best metric (for ringall) */
                        for (cur = outgoing; cur; cur = cur->q_next) {
                                if (cur->stillgoing && !cur->chan && cur->metric <= best->metric) {
                                        ast_debug(1, "(Parallel) Trying '%s' with metric %d\n", cur->interface, cur->metric);
                                        ret |= ring_entry(qe, cur, busies);
                                }
                        }
                } else {
                        /* Ring just the best channel */
                        ast_debug(1, "Trying '%s' with metric %d\n", best->interface, best->metric);
                        ret = ring_entry(qe, best, busies);
                }
        }

        return ret;
}

/*! \brief Search for best metric and add to Round Robbin queue */
static int store_next_rr(struct queue_ent *qe, struct callattempt *outgoing)
{
        struct callattempt *best = find_best(outgoing);

        if (best) {
                /* Ring just the best channel */
                ast_debug(1, "Next is '%s' with metric %d\n", best->interface, best->metric);
                qe->parent->rrpos = best->metric % 1000;
        } else {
                /* Just increment rrpos */
                if (qe->parent->wrapped) {
                        /* No more channels, start over */
                        qe->parent->rrpos = 0;
                } else {
                        /* Prioritize next entry */
                        qe->parent->rrpos++;
                }
        }
        qe->parent->wrapped = 0;

        return 0;
}

/*! \brief Search for best metric and add to Linear queue */
static int store_next_lin(struct queue_ent *qe, struct callattempt *outgoing)
{
        struct callattempt *best = find_best(outgoing);

        if (best) {
                /* Ring just the best channel */
                ast_debug(1, "Next is '%s' with metric %d\n", best->interface, best->metric);
                qe->linpos = best->metric % 1000;
        } else {
                /* Just increment rrpos */
                if (qe->linwrapped) {
                        /* No more channels, start over */
                        qe->linpos = 0;
                } else {
                        /* Prioritize next entry */
                        qe->linpos++;
                }
        }
        qe->linwrapped = 0;

        return 0;
}

/*! \brief Playback announcement to queued members if peroid has elapsed */
static int say_periodic_announcement(struct queue_ent *qe, int ringing)
{
        int res = 0;
        time_t now;

        /* Get the current time */
        time(&now);

        /* Check to see if it is time to announce */
        if ((now - qe->last_periodic_announce_time) < qe->parent->periodicannouncefrequency)
                return 0;

        /* Stop the music on hold so we can play our own file */
        if (ringing)
                ast_indicate(qe->chan,-1);
        else
                ast_moh_stop(qe->chan);

        ast_verb(3, "Playing periodic announcement\n");
        
        if (qe->parent->randomperiodicannounce) {
                qe->last_periodic_announce_sound = ((unsigned long) ast_random()) % qe->parent->numperiodicannounce;
        } else if (qe->last_periodic_announce_sound >= qe->parent->numperiodicannounce || 
                ast_strlen_zero(qe->parent->sound_periodicannounce[qe->last_periodic_announce_sound]->str)) {
                qe->last_periodic_announce_sound = 0;
        }
        
        /* play the announcement */
        res = play_file(qe->chan, qe->parent->sound_periodicannounce[qe->last_periodic_announce_sound]->str);

        if ((res > 0 && !valid_exit(qe, res)) || res < 0)
                res = 0;

        /* Resume Music on Hold if the caller is going to stay in the queue */
        if (!res) {
                if (ringing)
                        ast_indicate(qe->chan, AST_CONTROL_RINGING);
                else
                        ast_moh_start(qe->chan, qe->moh, NULL);
        }

        /* update last_periodic_announce_time */
        qe->last_periodic_announce_time = now;

        /* Update the current periodic announcement to the next announcement */
        if (!qe->parent->randomperiodicannounce) {
                qe->last_periodic_announce_sound++;
        }
        
        return res;
}

/*! \brief Record that a caller gave up on waiting in queue */
static void record_abandoned(struct queue_ent *qe)
{
        ao2_lock(qe->parent);
        set_queue_variables(qe);
        manager_event(EVENT_FLAG_AGENT, "QueueCallerAbandon",
                "Queue: %s\r\n"
                "Uniqueid: %s\r\n"
                "Position: %d\r\n"
                "OriginalPosition: %d\r\n"
                "HoldTime: %d\r\n",
                qe->parent->name, qe->chan->uniqueid, qe->pos, qe->opos, (int)(time(NULL) - qe->start));

        qe->parent->callsabandoned++;
        ao2_unlock(qe->parent);
}

/*! \brief RNA == Ring No Answer. Common code that is executed when we try a queue member and they don't answer. */
static void rna(int rnatime, struct queue_ent *qe, char *interface, char *membername)
{
        ast_verb(3, "Nobody picked up in %d ms\n", rnatime);
        if (qe->parent->eventwhencalled)
                manager_event(EVENT_FLAG_AGENT, "AgentRingNoAnswer",
                                                "Queue: %s\r\n"
                                                "Uniqueid: %s\r\n"
                                                "Channel: %s\r\n"
                                                "Member: %s\r\n"
                                                "MemberName: %s\r\n"
                                                "Ringtime: %d\r\n",
                                                qe->parent->name,
                                                qe->chan->uniqueid,
                                                qe->chan->name,
                                                interface,
                                                membername,
                                                rnatime);
        ast_queue_log(qe->parent->name, qe->chan->uniqueid, membername, "RINGNOANSWER", "%d", rnatime);
        if (qe->parent->autopause) {
                if (!set_member_paused(qe->parent->name, interface, "Auto-Pause", 1)) {
                        ast_verb(3, "Auto-Pausing Queue Member %s in queue %s since they failed to answer.\n", interface, qe->parent->name);
                } else {
                        ast_verb(3, "Failed to pause Queue Member %s in queue %s!\n", interface, qe->parent->name);
                }
        }
        return;
}

#define AST_MAX_WATCHERS 256
/*! \brief Wait for a member to answer the call
 *
 * \param[in] qe the queue_ent corresponding to the caller in the queue
 * \param[in] outgoing the list of callattempts. Relevant ones will have their chan and stillgoing parameters non-zero
 * \param[in] to the amount of time (in milliseconds) to wait for a response
 * \param[out] digit if a user presses a digit to exit the queue, this is the digit the caller pressed
 * \param[in] prebusies number of busy members calculated prior to calling wait_for_answer
 * \param[in] caller_disconnect if the 'H' option is used when calling Queue(), this is used to detect if the caller pressed * to disconnect the call
 * \param[in] forwardsallowed used to detect if we should allow call forwarding, based on the 'i' option to Queue()
 */
static struct callattempt *wait_for_answer(struct queue_ent *qe, struct callattempt *outgoing, int *to, char *digit, int prebusies, int caller_disconnect, int forwardsallowed)
{
        const char *queue = qe->parent->name;
        struct callattempt *o, *start = NULL, *prev = NULL;
        int status;
        int numbusies = prebusies;
        int numnochan = 0;
        int stillgoing = 0;
        int orig = *to;
        struct ast_frame *f;
        struct callattempt *peer = NULL;
        struct ast_channel *winner;
        struct ast_channel *in = qe->chan;
        char on[80] = "";
        char membername[80] = "";
        long starttime = 0;
        long endtime = 0;
#ifdef HAVE_EPOLL
        struct callattempt *epollo;
#endif

        starttime = (long) time(NULL);
#ifdef HAVE_EPOLL
        for (epollo = outgoing; epollo; epollo = epollo->q_next) {
                if (epollo->chan)
                        ast_poll_channel_add(in, epollo->chan);
        }
#endif
        
        while (*to && !peer) {
                int numlines, retry, pos = 1;
                struct ast_channel *watchers[AST_MAX_WATCHERS];
                watchers[0] = in;
                start = NULL;

                for (retry = 0; retry < 2; retry++) {
                        numlines = 0;
                        for (o = outgoing; o; o = o->q_next) { /* Keep track of important channels */
                                if (o->stillgoing) {    /* Keep track of important channels */
                                        stillgoing = 1;
                                        if (o->chan) {
                                                watchers[pos++] = o->chan;
                                                if (!start)
                                                        start = o;
                                                else
                                                        prev->call_next = o;
                                                prev = o;
                                        }
                                }
                                numlines++;
                        }
                        if (pos > 1 /* found */ || !stillgoing /* nobody listening */ ||
                                (qe->parent->strategy != QUEUE_STRATEGY_RINGALL) /* ring would not be delivered */)
                                break;
                        /* On "ringall" strategy we only move to the next penalty level
                           when *all* ringing phones are done in the current penalty level */
                        ring_one(qe, outgoing, &numbusies);
                        /* and retry... */
                }
                if (pos == 1 /* not found */) {
                        if (numlines == (numbusies + numnochan)) {
                                ast_debug(1, "Everyone is busy at this time\n");
                        } else {
                                ast_log(LOG_NOTICE, "No one is answering queue '%s' (%d/%d/%d)\n", queue, numlines, numbusies, numnochan);
                        }
                        *to = 0;
                        return NULL;
                }
                winner = ast_waitfor_n(watchers, pos, to);
                for (o = start; o; o = o->call_next) {
                        if (o->stillgoing && (o->chan) &&  (o->chan->_state == AST_STATE_UP)) {
                                if (!peer) {
                                        ast_verb(3, "%s answered %s\n", o->chan->name, in->name);
                                        peer = o;
                                }
                        } else if (o->chan && (o->chan == winner)) {

                                ast_copy_string(on, o->member->interface, sizeof(on));
                                ast_copy_string(membername, o->member->membername, sizeof(membername));

                                if (!ast_strlen_zero(o->chan->call_forward) && !forwardsallowed) {
                                        ast_verb(3, "Forwarding %s to '%s' prevented.\n", in->name, o->chan->call_forward);
                                        numnochan++;
                                        do_hang(o);
                                        winner = NULL;
                                        continue;
                                } else if (!ast_strlen_zero(o->chan->call_forward)) {
                                        char tmpchan[256];
                                        char *stuff;
                                        char *tech;

                                        ast_copy_string(tmpchan, o->chan->call_forward, sizeof(tmpchan));
                                        if ((stuff = strchr(tmpchan, '/'))) {
                                                *stuff++ = '\0';
                                                tech = tmpchan;
                                        } else {
                                                snprintf(tmpchan, sizeof(tmpchan), "%s@%s", o->chan->call_forward, o->chan->context);
                                                stuff = tmpchan;
                                                tech = "Local";
                                        }
                                        /* Before processing channel, go ahead and check for forwarding */
                                        ast_verb(3, "Now forwarding %s to '%s/%s' (thanks to %s)\n", in->name, tech, stuff, o->chan->name);
                                        /* Setup parameters */
                                        o->chan = ast_request(tech, in->nativeformats, stuff, &status);
                                        if (!o->chan) {
                                                ast_log(LOG_NOTICE, "Unable to create local channel for call forward to '%s/%s'\n", tech, stuff);
                                                o->stillgoing = 0;
                                                numnochan++;
                                        } else {
                                                ast_channel_inherit_variables(in, o->chan);
                                                ast_channel_datastore_inherit(in, o->chan);
                                                if (o->chan->cid.cid_num)
                                                        ast_free(o->chan->cid.cid_num);
                                                o->chan->cid.cid_num = ast_strdup(in->cid.cid_num);

                                                if (o->chan->cid.cid_name)
                                                        ast_free(o->chan->cid.cid_name);
                                                o->chan->cid.cid_name = ast_strdup(in->cid.cid_name);

                                                ast_string_field_set(o->chan, accountcode, in->accountcode);
                                                o->chan->cdrflags = in->cdrflags;

                                                if (in->cid.cid_ani) {
                                                        if (o->chan->cid.cid_ani)
                                                                ast_free(o->chan->cid.cid_ani);
                                                        o->chan->cid.cid_ani = ast_strdup(in->cid.cid_ani);
                                                }
                                                if (o->chan->cid.cid_rdnis)
                                                        ast_free(o->chan->cid.cid_rdnis);
                                                o->chan->cid.cid_rdnis = ast_strdup(S_OR(in->macroexten, in->exten));
                                                if (ast_call(o->chan, tmpchan, 0)) {
                                                        ast_log(LOG_NOTICE, "Failed to dial on local channel for call forward to '%s'\n", tmpchan);
                                                        do_hang(o);
                                                        numnochan++;
                                                }
                                        }
                                        /* Hangup the original channel now, in case we needed it */
                                        ast_hangup(winner);
                                        continue;
                                }
                                f = ast_read(winner);
                                if (f) {
                                        if (f->frametype == AST_FRAME_CONTROL) {
                                                switch (f->subclass) {
                                                case AST_CONTROL_ANSWER:
                                                        /* This is our guy if someone answered. */
                                                        if (!peer) {
                                                                ast_verb(3, "%s answered %s\n", o->chan->name, in->name);
                                                                peer = o;
                                                        }
                                                        break;
                                                case AST_CONTROL_BUSY:
                                                        ast_verb(3, "%s is busy\n", o->chan->name);
                                                        if (in->cdr)
                                                                ast_cdr_busy(in->cdr);
                                                        do_hang(o);
                                                        endtime = (long) time(NULL);
                                                        endtime -= starttime;
                                                        rna(endtime*1000, qe, on, membername);
                                                        if (qe->parent->strategy != QUEUE_STRATEGY_RINGALL) {
                                                                if (qe->parent->timeoutrestart)
                                                                        *to = orig;
                                                                ring_one(qe, outgoing, &numbusies);
                                                        }
                                                        numbusies++;
                                                        break;
                                                case AST_CONTROL_CONGESTION:
                                                        ast_verb(3, "%s is circuit-busy\n", o->chan->name);
                                                        if (in->cdr)
                                                                ast_cdr_busy(in->cdr);
                                                        endtime = (long) time(NULL);
                                                        endtime -= starttime;
                                                        rna(endtime*1000, qe, on, membername);
                                                        do_hang(o);
                                                        if (qe->parent->strategy != QUEUE_STRATEGY_RINGALL) {
                                                                if (qe->parent->timeoutrestart)
                                                                        *to = orig;
                                                                ring_one(qe, outgoing, &numbusies);
                                                        }
                                                        numbusies++;
                                                        break;
                                                case AST_CONTROL_RINGING:
                                                        ast_verb(3, "%s is ringing\n", o->chan->name);
                                                        break;
                                                case AST_CONTROL_OFFHOOK:
                                                        /* Ignore going off hook */
                                                        break;
                                                default:
                                                        ast_debug(1, "Dunno what to do with control type %d\n", f->subclass);
                                                }
                                        }
                                        ast_frfree(f);
                                } else {
                                        endtime = (long) time(NULL) - starttime;
                                        rna(endtime * 1000, qe, on, membername);
                                        do_hang(o);
                                        if (qe->parent->strategy != QUEUE_STRATEGY_RINGALL) {
                                                if (qe->parent->timeoutrestart)
                                                        *to = orig;
                                                ring_one(qe, outgoing, &numbusies);
                                        }
                                }
                        }
                }
                if (winner == in) {
                        f = ast_read(in);
                        if (!f || ((f->frametype == AST_FRAME_CONTROL) && (f->subclass == AST_CONTROL_HANGUP))) {
                                /* Got hung up */
                                *to = -1;
                                if (f) {
                                        if (f->data.uint32) {
                                                in->hangupcause = f->data.uint32;
                                        }
                                        ast_frfree(f);
                                }
                                return NULL;
                        }
                        if ((f->frametype == AST_FRAME_DTMF) && caller_disconnect && (f->subclass == '*')) {
                                ast_verb(3, "User hit %c to disconnect call.\n", f->subclass);
                                *to = 0;
                                ast_frfree(f);
                                return NULL;
                        }
                        if ((f->frametype == AST_FRAME_DTMF) && valid_exit(qe, f->subclass)) {
                                ast_verb(3, "User pressed digit: %c\n", f->subclass);
                                *to = 0;
                                *digit = f->subclass;
                                ast_frfree(f);
                                return NULL;
                        }
                        ast_frfree(f);
                }
                if (!*to) {
                        for (o = start; o; o = o->call_next)
                                rna(orig, qe, o->interface, o->member->membername);
                }
        }

#ifdef HAVE_EPOLL
        for (epollo = outgoing; epollo; epollo = epollo->q_next) {
                if (epollo->chan)
                        ast_poll_channel_del(in, epollo->chan);
        }
#endif

        return peer;
}

/*! 
 * \brief Check if we should start attempting to call queue members.
 *
 * The behavior of this function is dependent first on whether autofill is enabled
 * and second on whether the ring strategy is ringall. If autofill is not enabled,
 * then return true if we're the head of the queue. If autofill is enabled, then
 * we count the available members and see if the number of available members is enough
 * that given our position in the queue, we would theoretically be able to connect to
 * one of those available members
 */
static int is_our_turn(struct queue_ent *qe)
{
        struct queue_ent *ch;
        struct member *cur;
        int avl = 0;
        int idx = 0;
        int res;

        if (!qe->parent->autofill) {
                /* Atomically read the parent head -- does not need a lock */
                ch = qe->parent->head;
                /* If we are now at the top of the head, break out */
                if (ch == qe) {
                        ast_debug(1, "It's our turn (%s).\n", qe->chan->name);
                        res = 1;
                } else {
                        ast_debug(1, "It's not our turn (%s).\n", qe->chan->name);
                        res = 0;
                }       

        } else {
                /* This needs a lock. How many members are available to be served? */
                ao2_lock(qe->parent);
                        
                ch = qe->parent->head;
        
                if (qe->parent->strategy == QUEUE_STRATEGY_RINGALL) {
                        ast_debug(1, "Even though there may be multiple members available, the strategy is ringall so only the head call is allowed in\n");
                        avl = 1;
                } else {
                        struct ao2_iterator mem_iter = ao2_iterator_init(qe->parent->members, 0);
                        while ((cur = ao2_iterator_next(&mem_iter))) {
                                switch (cur->status) {
                                case AST_DEVICE_INUSE:
                                        if (!qe->parent->ringinuse)
                                                break;
                                        /* else fall through */
                                case AST_DEVICE_NOT_INUSE:
                                case AST_DEVICE_UNKNOWN:
                                        if (!cur->paused)
                                                avl++;
                                        break;
                                }
                                ao2_ref(cur, -1);
                        }
                }

                ast_debug(1, "There are %d available members.\n", avl);
        
                while ((idx < avl) && (ch) && (ch != qe)) {
                        if (!ch->pending)
                                idx++;
                        ch = ch->next;                  
                }
        
                /* If the queue entry is within avl [the number of available members] calls from the top ... */
                if (ch && idx < avl) {
                        ast_debug(1, "It's our turn (%s).\n", qe->chan->name);
                        res = 1;
                } else {
                        ast_debug(1, "It's not our turn (%s).\n", qe->chan->name);
                        res = 0;
                }
                
                ao2_unlock(qe->parent);
        }

        return res;
}

/*!
 * \brief update rules for queues
 *
 * Calculate min/max penalties making sure if relative they stay within bounds.
 * Update queues penalty and set dialplan vars, goto next list entry.
*/
static void update_qe_rule(struct queue_ent *qe)
{
        int max_penalty = qe->pr->max_relative ? qe->max_penalty + qe->pr->max_value : qe->pr->max_value;
        int min_penalty = qe->pr->min_relative ? qe->min_penalty + qe->pr->min_value : qe->pr->min_value;
        char max_penalty_str[20], min_penalty_str[20]; 
        /* a relative change to the penalty could put it below 0 */
        if (max_penalty < 0)
                max_penalty = 0;
        if (min_penalty < 0)
                min_penalty = 0;
        if (min_penalty > max_penalty)
                min_penalty = max_penalty;
        snprintf(max_penalty_str, sizeof(max_penalty_str), "%d", max_penalty);
        snprintf(min_penalty_str, sizeof(min_penalty_str), "%d", min_penalty);
        pbx_builtin_setvar_helper(qe->chan, "QUEUE_MAX_PENALTY", max_penalty_str);
        pbx_builtin_setvar_helper(qe->chan, "QUEUE_MIN_PENALTY", min_penalty_str);
        qe->max_penalty = max_penalty;
        qe->min_penalty = min_penalty;
        ast_debug(3, "Setting max penalty to %d and min penalty to %d for caller %s since %d seconds have elapsed\n", qe->max_penalty, qe->min_penalty, qe->chan->name, qe->pr->time);
        qe->pr = AST_LIST_NEXT(qe->pr, list);
}

/*! \brief The waiting areas for callers who are not actively calling members
 *
 * This function is one large loop. This function will return if a caller
 * either exits the queue or it becomes that caller's turn to attempt calling
 * queue members. Inside the loop, we service the caller with periodic announcements,
 * holdtime announcements, etc. as configured in queues.conf
 *
 * \retval  0 if the caller's turn has arrived
 * \retval -1 if the caller should exit the queue.
 */
static int wait_our_turn(struct queue_ent *qe, int ringing, enum queue_result *reason)
{
        int res = 0;

        /* This is the holding pen for callers 2 through maxlen */
        for (;;) {
                enum queue_member_status stat;

                if (is_our_turn(qe))
                        break;

                /* If we have timed out, break out */
                if (qe->expire && (time(NULL) > qe->expire)) {
                        *reason = QUEUE_TIMEOUT;
                        break;
                }

                stat = get_member_status(qe->parent, qe->max_penalty, qe->min_penalty);

                /* leave the queue if no agents, if enabled */
                if (qe->parent->leavewhenempty && (stat == QUEUE_NO_MEMBERS)) {
                        *reason = QUEUE_LEAVEEMPTY;
                        ast_queue_log(qe->parent->name, qe->chan->uniqueid, "NONE", "EXITEMPTY", "%d|%d|%ld", qe->pos, qe->opos, (long) time(NULL) - qe->start);
                        leave_queue(qe);
                        break;
                }

                /* leave the queue if no reachable agents, if enabled */
                if ((qe->parent->leavewhenempty == QUEUE_EMPTY_STRICT) && (stat == QUEUE_NO_REACHABLE_MEMBERS || stat == QUEUE_NO_UNPAUSED_REACHABLE_MEMBERS)) {
                        *reason = QUEUE_LEAVEUNAVAIL;
                        ast_queue_log(qe->parent->name, qe->chan->uniqueid, "NONE", "EXITEMPTY", "%d|%d|%ld", qe->pos, qe->opos, (long) time(NULL) - qe->start);
                        leave_queue(qe);
                        break;
                }
                if ((qe->parent->leavewhenempty == QUEUE_EMPTY_LOOSE) && (stat == QUEUE_NO_REACHABLE_MEMBERS)) {
                        *reason = QUEUE_LEAVEUNAVAIL;
                        ast_queue_log(qe->parent->name, qe->chan->uniqueid, "NONE", "EXITEMPTY", "%d|%d|%ld", qe->pos, qe->opos, (long) time(NULL) - qe->start);
                        leave_queue(qe);
                        break;
                }

                /* Make a position announcement, if enabled */
                if (qe->parent->announcefrequency &&
                        (res = say_position(qe,ringing)))
                        break;

                /* Make a periodic announcement, if enabled */
                if (qe->parent->periodicannouncefrequency &&
                        (res = say_periodic_announcement(qe,ringing)))
                        break;
                
                /* see if we need to move to the next penalty level for this queue */
                while (qe->pr && ((time(NULL) - qe->start) > qe->pr->time)) {
                        update_qe_rule(qe);
                }

                /* Wait a second before checking again */
                if ((res = ast_waitfordigit(qe->chan, RECHECK * 1000))) {
                        if (res > 0 && !valid_exit(qe, res))
                                res = 0;
                        else
                                break;
                }
        }

        return res;
}

/*!
 * \brief update the queue status
 * \retval Always 0
*/
static int update_queue(struct call_queue *q, struct member *member, int callcompletedinsl)
{
        struct member *mem;
        struct call_queue *qtmp;
        struct ao2_iterator queue_iter; 
        
        if (shared_lastcall) {
                queue_iter = ao2_iterator_init(queues, 0);
                while ((qtmp = ao2_iterator_next(&queue_iter))) {
                        ao2_lock(qtmp);
                        if ((mem = ao2_find(qtmp->members, member, OBJ_POINTER))) {
                                time(&mem->lastcall);
                                mem->calls++;
                                mem->lastqueue = q;
                                ao2_ref(mem, -1);
                        }
                        ao2_unlock(qtmp);
                        ao2_ref(qtmp, -1);
                }
        } else {
                ao2_lock(q);
                time(&member->lastcall);
                member->calls++;
                member->lastqueue = q;
                ao2_unlock(q);
        }       
        ao2_lock(q);
        q->callscompleted++;
        if (callcompletedinsl)
                q->callscompletedinsl++;
        ao2_unlock(q);
        return 0;
}

/*! \brief Calculate the metric of each member in the outgoing callattempts
 *
 * A numeric metric is given to each member depending on the ring strategy used
 * by the queue. Members with lower metrics will be called before members with
 * higher metrics
 * \retval -1 if penalties are exceeded
 * \retval 0 otherwise
 */
static int calc_metric(struct call_queue *q, struct member *mem, int pos, struct queue_ent *qe, struct callattempt *tmp)
{
        if ((qe->max_penalty && (mem->penalty > qe->max_penalty)) || (qe->min_penalty && (mem->penalty < qe->min_penalty)))
                return -1;

        switch (q->strategy) {
        case QUEUE_STRATEGY_RINGALL:
                /* Everyone equal, except for penalty */
                tmp->metric = mem->penalty * 1000000;
                break;
        case QUEUE_STRATEGY_LINEAR:
                if (pos < qe->linpos) {
                        tmp->metric = 1000 + pos;
                } else {
                        if (pos > qe->linpos)
                                /* Indicate there is another priority */
                                qe->linwrapped = 1;
                        tmp->metric = pos;
                }
                tmp->metric += mem->penalty * 1000000;
                break;
        case QUEUE_STRATEGY_RRMEMORY:
                if (pos < q->rrpos) {
                        tmp->metric = 1000 + pos;
                } else {
                        if (pos > q->rrpos)
                                /* Indicate there is another priority */
                                q->wrapped = 1;
                        tmp->metric = pos;
                }
                tmp->metric += mem->penalty * 1000000;
                break;
        case QUEUE_STRATEGY_RANDOM:
                tmp->metric = ast_random() % 1000;
                tmp->metric += mem->penalty * 1000000;
                break;
        case QUEUE_STRATEGY_WRANDOM:
                tmp->metric = ast_random() % ((1 + mem->penalty) * 1000);
                break;
        case QUEUE_STRATEGY_FEWESTCALLS:
                tmp->metric = mem->calls;
                tmp->metric += mem->penalty * 1000000;
                break;
        case QUEUE_STRATEGY_LEASTRECENT:
                if (!mem->lastcall)
                        tmp->metric = 0;
                else
                        tmp->metric = 1000000 - (time(NULL) - mem->lastcall);
                tmp->metric += mem->penalty * 1000000;
                break;
        default:
                ast_log(LOG_WARNING, "Can't calculate metric for unknown strategy %d\n", q->strategy);
                break;