2004-05-09 08:22:15 +00:00
|
|
|
/*
|
2005-09-14 20:46:50 +00:00
|
|
|
* Asterisk -- An open source telephony toolkit.
|
2004-05-09 08:22:15 +00:00
|
|
|
*
|
2006-01-04 21:54:09 +00:00
|
|
|
* Copyright (C) 1999 - 2006, Digium, Inc.
|
2004-05-09 08:22:15 +00:00
|
|
|
*
|
2005-09-14 20:46:50 +00:00
|
|
|
* See http://www.asterisk.org for more information about
|
|
|
|
* the Asterisk project. Please do not directly contact
|
|
|
|
* any of the maintainers of this project for assistance;
|
|
|
|
* the project provides a web site, mailing lists and IRC
|
|
|
|
* channels for your use.
|
2004-05-09 08:22:15 +00:00
|
|
|
*
|
|
|
|
* This program is free software, distributed under the terms of
|
2005-09-14 20:46:50 +00:00
|
|
|
* the GNU General Public License Version 2. See the LICENSE file
|
|
|
|
* at the top of the source tree.
|
|
|
|
*/
|
|
|
|
|
2005-10-24 20:12:06 +00:00
|
|
|
/*! \file
|
2005-09-14 20:46:50 +00:00
|
|
|
*
|
2005-10-24 20:12:06 +00:00
|
|
|
* \brief Utility functions
|
2005-09-14 20:46:50 +00:00
|
|
|
*
|
2005-10-24 20:12:06 +00:00
|
|
|
* \note These are important for portability and security,
|
|
|
|
* so please use them in favour of other routines.
|
|
|
|
* Please consult the CODING GUIDELINES for more information.
|
2004-05-09 08:22:15 +00:00
|
|
|
*/
|
|
|
|
|
2012-06-15 16:20:16 +00:00
|
|
|
/*** MODULEINFO
|
|
|
|
<support_level>core</support_level>
|
|
|
|
***/
|
|
|
|
|
2006-06-07 18:54:56 +00:00
|
|
|
#include "asterisk.h"
|
|
|
|
|
2004-05-11 18:41:09 +00:00
|
|
|
#include <ctype.h>
|
2013-07-03 16:33:13 +00:00
|
|
|
#include <fcntl.h>
|
2007-06-22 04:35:12 +00:00
|
|
|
#include <sys/stat.h>
|
2010-12-12 03:58:33 +00:00
|
|
|
#include <sys/syscall.h>
|
2013-07-03 16:33:13 +00:00
|
|
|
#include <unistd.h>
|
2010-12-12 03:58:33 +00:00
|
|
|
#if defined(__APPLE__)
|
|
|
|
#include <mach/mach.h>
|
|
|
|
#elif defined(HAVE_SYS_THR_H)
|
|
|
|
#include <sys/thr.h>
|
|
|
|
#endif
|
|
|
|
|
2007-11-17 14:11:53 +00:00
|
|
|
#include "asterisk/network.h"
|
2013-05-02 06:47:16 +00:00
|
|
|
#include "asterisk/ast_version.h"
|
2007-11-17 14:11:53 +00:00
|
|
|
|
2006-03-30 23:26:22 +00:00
|
|
|
#define AST_API_MODULE /* ensure that inlinable API functions will be built in lock.h if required */
|
2005-04-21 06:02:45 +00:00
|
|
|
#include "asterisk/lock.h"
|
|
|
|
#include "asterisk/io.h"
|
|
|
|
#include "asterisk/md5.h"
|
2006-02-03 22:37:29 +00:00
|
|
|
#include "asterisk/sha1.h"
|
2007-08-03 19:41:42 +00:00
|
|
|
#include "asterisk/cli.h"
|
|
|
|
#include "asterisk/linkedlists.h"
|
2014-04-04 17:57:46 +00:00
|
|
|
#include "asterisk/astobj2.h"
|
2004-05-09 08:22:15 +00:00
|
|
|
|
2005-06-24 22:45:15 +00:00
|
|
|
#define AST_API_MODULE /* ensure that inlinable API functions will be built in this module if required */
|
|
|
|
#include "asterisk/strings.h"
|
|
|
|
|
|
|
|
#define AST_API_MODULE /* ensure that inlinable API functions will be built in this module if required */
|
|
|
|
#include "asterisk/time.h"
|
|
|
|
|
2005-06-23 23:07:55 +00:00
|
|
|
#define AST_API_MODULE /* ensure that inlinable API functions will be built in this module if required */
|
|
|
|
#include "asterisk/utils.h"
|
|
|
|
|
Merge team/russell/ast_verbose_threadstorage
- instead of defining a free() wrapper in a bunch of files, define it as
ast_free() in utils.h and remove the copies from all the files.
- centralize and abstract the code used for doing thread storage. The code
lives in threadstorage.h, with one function being implemented in utils.c.
This new API includes generic thread storage as well as special functions
for handling thread local dynamic length string buffers.
- update ast_inet_ntoa() to use the new threadstorage API
- update ast_state2str() to use the new threadstorage API
- update ast_cli() to use the new threadstorage API
- Modify manager_event() to use thread storage. Instead of using a buffer of
4096 characters as the workspace for building the manager event, use a thread
local dynamic string. Now there is no length limitation on the length of the
body of a manager event.
- Significantly simplify the handling of ast_verbose() ...
- Instead of using a static char buffer and a lock to make sure only one
thread can be using ast_verbose() at a time, use a thread local dynamic
string as the workspace for preparing the verbose message. Instead of
locking around the entire function, the only locking done now is when the
message has been built and is being deliviered to the list of registered
verbose message handlers.
- This function was doing a strdup() on every message passed to it and
keeping a queue of the last 200 messages in memory. This has been
completely removed. The only place this was used was that if there were
any messages in the verbose queue when a verbose handler was registered,
all of the messages in the queue would be fed to it. So, I just made sure
that the console verbose handler and the network verbose handler (for
remote asterisk consoles) were registered before any verbose messages.
pbx_gtkconsole and pbx_kdeconsole will now lose a few verbose messages at
startup, but I didn't feel the performance hit of this message queue was
worth saving the initial verbose output for these very rarely used modules.
- I have removed the last three arguments to the verbose handlers, leaving
only the string itself because they aren't needed anymore. For example,
ast_verbose had some logic for telling the verbose handler to add
a newline if the buffer was completely full. Now that the buffer can grow
as needed, this doesn't matter anymore.
- remove unused function, ast_verbose_dmesg() which was to dispatch the
message queue
- Convert the list of verbose handlers to use the linked list macros.
- add missing newline characters to a few ast_verbose() calls
- convert the list of log channels to use the linked list macros in logger.c
- fix close_logger() to close all of the files it opened for logging
- update ast_log() to use a thread local dynamic string for its workspace
for preparing log messages instead of a buffer of size BUFSIZ (8kB on my
system) allocated on the stack. The dynamic string in this case is limited
to only growing to a maximum size of BUFSIZ.
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@39272 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2006-08-08 06:32:04 +00:00
|
|
|
#define AST_API_MODULE
|
|
|
|
#include "asterisk/threadstorage.h"
|
|
|
|
|
2008-06-09 22:51:59 +00:00
|
|
|
#define AST_API_MODULE
|
|
|
|
#include "asterisk/config.h"
|
|
|
|
|
2017-04-18 00:06:10 +00:00
|
|
|
#define AST_API_MODULE
|
|
|
|
#include "asterisk/alertpipe.h"
|
|
|
|
|
2004-06-25 04:07:52 +00:00
|
|
|
static char base64[64];
|
|
|
|
static char b2a[256];
|
|
|
|
|
2006-10-19 01:00:57 +00:00
|
|
|
AST_THREADSTORAGE(inet_ntoa_buf);
|
2006-07-27 01:49:57 +00:00
|
|
|
|
2007-08-01 17:27:09 +00:00
|
|
|
#if !defined(HAVE_GETHOSTBYNAME_R_5) && !defined(HAVE_GETHOSTBYNAME_R_6)
|
2004-05-09 08:22:15 +00:00
|
|
|
|
2006-03-07 17:55:33 +00:00
|
|
|
#define ERANGE 34 /*!< duh? ERANGE value copied from web... */
|
2004-05-09 08:22:15 +00:00
|
|
|
#undef gethostbyname
|
|
|
|
|
2004-06-09 01:45:08 +00:00
|
|
|
AST_MUTEX_DEFINE_STATIC(__mutex);
|
|
|
|
|
2006-06-01 14:18:12 +00:00
|
|
|
/*! \brief Reentrant replacement for gethostbyname for BSD-based systems.
|
2006-03-07 17:55:33 +00:00
|
|
|
\note This
|
2012-03-22 19:51:16 +00:00
|
|
|
routine is derived from code originally written and placed in the public
|
2005-05-09 13:50:38 +00:00
|
|
|
domain by Enzo Michelangeli <em@em.no-ip.com> */
|
|
|
|
|
2004-06-22 17:42:14 +00:00
|
|
|
static int gethostbyname_r (const char *name, struct hostent *ret, char *buf,
|
2012-03-22 19:51:16 +00:00
|
|
|
size_t buflen, struct hostent **result,
|
|
|
|
int *h_errnop)
|
2004-05-09 08:22:15 +00:00
|
|
|
{
|
|
|
|
int hsave;
|
|
|
|
struct hostent *ph;
|
|
|
|
ast_mutex_lock(&__mutex); /* begin critical area */
|
|
|
|
hsave = h_errno;
|
|
|
|
|
|
|
|
ph = gethostbyname(name);
|
|
|
|
*h_errnop = h_errno; /* copy h_errno to *h_herrnop */
|
|
|
|
if (ph == NULL) {
|
|
|
|
*result = NULL;
|
|
|
|
} else {
|
|
|
|
char **p, **q;
|
|
|
|
char *pbuf;
|
2008-02-11 18:27:47 +00:00
|
|
|
int nbytes = 0;
|
|
|
|
int naddr = 0, naliases = 0;
|
2004-05-09 08:22:15 +00:00
|
|
|
/* determine if we have enough space in buf */
|
|
|
|
|
|
|
|
/* count how many addresses */
|
|
|
|
for (p = ph->h_addr_list; *p != 0; p++) {
|
|
|
|
nbytes += ph->h_length; /* addresses */
|
|
|
|
nbytes += sizeof(*p); /* pointers */
|
|
|
|
naddr++;
|
|
|
|
}
|
|
|
|
nbytes += sizeof(*p); /* one more for the terminating NULL */
|
|
|
|
|
|
|
|
/* count how many aliases, and total length of strings */
|
|
|
|
for (p = ph->h_aliases; *p != 0; p++) {
|
|
|
|
nbytes += (strlen(*p)+1); /* aliases */
|
|
|
|
nbytes += sizeof(*p); /* pointers */
|
|
|
|
naliases++;
|
|
|
|
}
|
|
|
|
nbytes += sizeof(*p); /* one more for the terminating NULL */
|
|
|
|
|
|
|
|
/* here nbytes is the number of bytes required in buffer */
|
|
|
|
/* as a terminator must be there, the minimum value is ph->h_length */
|
2006-07-10 19:05:48 +00:00
|
|
|
if (nbytes > buflen) {
|
2004-05-09 08:22:15 +00:00
|
|
|
*result = NULL;
|
|
|
|
ast_mutex_unlock(&__mutex); /* end critical area */
|
|
|
|
return ERANGE; /* not enough space in buf!! */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* There is enough space. Now we need to do a deep copy! */
|
|
|
|
/* Allocation in buffer:
|
|
|
|
from [0] to [(naddr-1) * sizeof(*p)]:
|
|
|
|
pointers to addresses
|
|
|
|
at [naddr * sizeof(*p)]:
|
|
|
|
NULL
|
|
|
|
from [(naddr+1) * sizeof(*p)] to [(naddr+naliases) * sizeof(*p)] :
|
|
|
|
pointers to aliases
|
|
|
|
at [(naddr+naliases+1) * sizeof(*p)]:
|
|
|
|
NULL
|
|
|
|
then naddr addresses (fixed length), and naliases aliases (asciiz).
|
|
|
|
*/
|
|
|
|
|
|
|
|
*ret = *ph; /* copy whole structure (not its address!) */
|
|
|
|
|
|
|
|
/* copy addresses */
|
|
|
|
q = (char **)buf; /* pointer to pointers area (type: char **) */
|
|
|
|
ret->h_addr_list = q; /* update pointer to address list */
|
2006-07-10 19:05:48 +00:00
|
|
|
pbuf = buf + ((naddr + naliases + 2) * sizeof(*p)); /* skip that area */
|
2004-05-09 08:22:15 +00:00
|
|
|
for (p = ph->h_addr_list; *p != 0; p++) {
|
|
|
|
memcpy(pbuf, *p, ph->h_length); /* copy address bytes */
|
|
|
|
*q++ = pbuf; /* the pointer is the one inside buf... */
|
|
|
|
pbuf += ph->h_length; /* advance pbuf */
|
|
|
|
}
|
|
|
|
*q++ = NULL; /* address list terminator */
|
|
|
|
|
|
|
|
/* copy aliases */
|
|
|
|
ret->h_aliases = q; /* update pointer to aliases list */
|
|
|
|
for (p = ph->h_aliases; *p != 0; p++) {
|
|
|
|
strcpy(pbuf, *p); /* copy alias strings */
|
|
|
|
*q++ = pbuf; /* the pointer is the one inside buf... */
|
|
|
|
pbuf += strlen(*p); /* advance pbuf */
|
|
|
|
*pbuf++ = 0; /* string terminator */
|
|
|
|
}
|
|
|
|
*q++ = NULL; /* terminator */
|
|
|
|
|
|
|
|
strcpy(pbuf, ph->h_name); /* copy alias strings */
|
|
|
|
ret->h_name = pbuf;
|
|
|
|
pbuf += strlen(ph->h_name); /* advance pbuf */
|
|
|
|
*pbuf++ = 0; /* string terminator */
|
|
|
|
|
|
|
|
*result = ret; /* and let *result point to structure */
|
|
|
|
|
|
|
|
}
|
|
|
|
h_errno = hsave; /* restore h_errno */
|
|
|
|
ast_mutex_unlock(&__mutex); /* end critical area */
|
|
|
|
|
2004-05-15 05:02:42 +00:00
|
|
|
return (*result == NULL); /* return 0 on success, non-zero on error */
|
2004-05-09 08:22:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
/*! \brief Re-entrant (thread safe) version of gethostbyname that replaces the
|
2005-04-06 21:12:32 +00:00
|
|
|
standard gethostbyname (which is not thread safe)
|
2004-06-29 17:54:25 +00:00
|
|
|
*/
|
2004-05-09 08:22:15 +00:00
|
|
|
struct hostent *ast_gethostbyname(const char *host, struct ast_hostent *hp)
|
|
|
|
{
|
2018-03-07 15:32:05 +00:00
|
|
|
#ifndef HAVE_GETHOSTBYNAME_R_5
|
2004-05-09 08:22:15 +00:00
|
|
|
int res;
|
2018-03-07 15:32:05 +00:00
|
|
|
#endif
|
2004-05-09 08:22:15 +00:00
|
|
|
int herrno;
|
2008-02-11 18:27:47 +00:00
|
|
|
int dots = 0;
|
2004-05-11 18:41:09 +00:00
|
|
|
const char *s;
|
2004-05-09 08:22:15 +00:00
|
|
|
struct hostent *result = NULL;
|
2004-05-11 18:41:09 +00:00
|
|
|
/* Although it is perfectly legitimate to lookup a pure integer, for
|
|
|
|
the sake of the sanity of people who like to name their peers as
|
|
|
|
integers, we break with tradition and refuse to look up a
|
|
|
|
pure integer */
|
|
|
|
s = host;
|
2007-01-23 00:11:32 +00:00
|
|
|
while (s && *s) {
|
2005-10-21 04:09:23 +00:00
|
|
|
if (*s == '.')
|
|
|
|
dots++;
|
|
|
|
else if (!isdigit(*s))
|
2004-05-11 18:41:09 +00:00
|
|
|
break;
|
|
|
|
s++;
|
|
|
|
}
|
2005-10-21 04:09:23 +00:00
|
|
|
if (!s || !*s) {
|
|
|
|
/* Forge a reply for IP's to avoid octal IP's being interpreted as octal */
|
|
|
|
if (dots != 3)
|
|
|
|
return NULL;
|
2005-10-21 14:09:03 +00:00
|
|
|
memset(hp, 0, sizeof(struct ast_hostent));
|
2006-10-31 06:21:40 +00:00
|
|
|
hp->hp.h_addrtype = AF_INET;
|
2005-10-31 15:21:12 +00:00
|
|
|
hp->hp.h_addr_list = (void *) hp->buf;
|
2005-10-21 14:09:03 +00:00
|
|
|
hp->hp.h_addr = hp->buf + sizeof(void *);
|
2011-01-19 17:59:18 +00:00
|
|
|
/* For AF_INET, this will always be 4 */
|
|
|
|
hp->hp.h_length = 4;
|
2005-10-21 04:09:23 +00:00
|
|
|
if (inet_pton(AF_INET, host, hp->hp.h_addr) > 0)
|
|
|
|
return &hp->hp;
|
2004-05-11 18:41:09 +00:00
|
|
|
return NULL;
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2005-10-21 04:09:23 +00:00
|
|
|
}
|
2007-08-01 17:53:09 +00:00
|
|
|
#ifdef HAVE_GETHOSTBYNAME_R_5
|
2004-12-14 23:36:30 +00:00
|
|
|
result = gethostbyname_r(host, &hp->hp, hp->buf, sizeof(hp->buf), &herrno);
|
|
|
|
|
|
|
|
if (!result || !hp->hp.h_addr_list || !hp->hp.h_addr_list[0])
|
|
|
|
return NULL;
|
|
|
|
#else
|
2004-05-09 08:22:15 +00:00
|
|
|
res = gethostbyname_r(host, &hp->hp, hp->buf, sizeof(hp->buf), &result, &herrno);
|
|
|
|
|
2004-05-13 21:54:30 +00:00
|
|
|
if (res || !result || !hp->hp.h_addr_list || !hp->hp.h_addr_list[0])
|
2004-05-09 08:22:15 +00:00
|
|
|
return NULL;
|
2004-12-14 23:36:30 +00:00
|
|
|
#endif
|
2004-05-09 08:22:15 +00:00
|
|
|
return &hp->hp;
|
|
|
|
}
|
2004-06-22 17:42:14 +00:00
|
|
|
|
2006-03-07 17:55:33 +00:00
|
|
|
/*! \brief Produce 32 char MD5 hash of value. */
|
2009-05-21 21:13:09 +00:00
|
|
|
void ast_md5_hash(char *output, const char *input)
|
2005-02-18 05:29:31 +00:00
|
|
|
{
|
2005-05-04 04:05:34 +00:00
|
|
|
struct MD5Context md5;
|
|
|
|
unsigned char digest[16];
|
|
|
|
char *ptr;
|
|
|
|
int x;
|
|
|
|
|
|
|
|
MD5Init(&md5);
|
2009-05-21 21:13:09 +00:00
|
|
|
MD5Update(&md5, (const unsigned char *) input, strlen(input));
|
2005-05-04 04:05:34 +00:00
|
|
|
MD5Final(digest, &md5);
|
|
|
|
ptr = output;
|
2006-07-10 19:05:48 +00:00
|
|
|
for (x = 0; x < 16; x++)
|
2014-12-17 10:23:32 +00:00
|
|
|
ptr += sprintf(ptr, "%02hhx", digest[x]);
|
2005-02-18 05:29:31 +00:00
|
|
|
}
|
|
|
|
|
2006-03-07 17:55:33 +00:00
|
|
|
/*! \brief Produce 40 char SHA1 hash of value. */
|
2009-05-21 21:13:09 +00:00
|
|
|
void ast_sha1_hash(char *output, const char *input)
|
2006-02-03 22:37:29 +00:00
|
|
|
{
|
|
|
|
struct SHA1Context sha;
|
|
|
|
char *ptr;
|
|
|
|
int x;
|
|
|
|
uint8_t Message_Digest[20];
|
|
|
|
|
|
|
|
SHA1Reset(&sha);
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2006-02-03 22:37:29 +00:00
|
|
|
SHA1Input(&sha, (const unsigned char *) input, strlen(input));
|
|
|
|
|
|
|
|
SHA1Result(&sha, Message_Digest);
|
|
|
|
ptr = output;
|
|
|
|
for (x = 0; x < 20; x++)
|
2014-12-17 10:23:32 +00:00
|
|
|
ptr += sprintf(ptr, "%02hhx", Message_Digest[x]);
|
2006-02-03 22:37:29 +00:00
|
|
|
}
|
|
|
|
|
2012-06-02 21:13:36 +00:00
|
|
|
/*! \brief Produce a 20 byte SHA1 hash of value. */
|
|
|
|
void ast_sha1_hash_uint(uint8_t *digest, const char *input)
|
|
|
|
{
|
|
|
|
struct SHA1Context sha;
|
|
|
|
|
|
|
|
SHA1Reset(&sha);
|
|
|
|
|
|
|
|
SHA1Input(&sha, (const unsigned char *) input, strlen(input));
|
|
|
|
|
|
|
|
SHA1Result(&sha, digest);
|
|
|
|
}
|
|
|
|
|
2006-03-07 17:55:33 +00:00
|
|
|
/*! \brief decode BASE64 encoded text */
|
2005-10-16 03:10:33 +00:00
|
|
|
int ast_base64decode(unsigned char *dst, const char *src, int max)
|
2004-06-25 04:07:52 +00:00
|
|
|
{
|
|
|
|
int cnt = 0;
|
|
|
|
unsigned int byte = 0;
|
|
|
|
unsigned int bits = 0;
|
|
|
|
int incnt = 0;
|
2009-11-06 19:47:11 +00:00
|
|
|
while(*src && *src != '=' && (cnt < max)) {
|
2004-06-25 04:07:52 +00:00
|
|
|
/* Shift in 6 bits of input */
|
|
|
|
byte <<= 6;
|
|
|
|
byte |= (b2a[(int)(*src)]) & 0x3f;
|
|
|
|
bits += 6;
|
|
|
|
src++;
|
|
|
|
incnt++;
|
2012-03-22 19:51:16 +00:00
|
|
|
/* If we have at least 8 bits left over, take that character
|
2004-06-25 04:07:52 +00:00
|
|
|
off the top */
|
|
|
|
if (bits >= 8) {
|
|
|
|
bits -= 8;
|
|
|
|
*dst = (byte >> bits) & 0xff;
|
|
|
|
dst++;
|
|
|
|
cnt++;
|
|
|
|
}
|
|
|
|
}
|
2010-07-02 15:57:02 +00:00
|
|
|
/* Don't worry about left over bits, they're extra anyway */
|
2004-06-25 04:07:52 +00:00
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
2006-03-07 17:55:33 +00:00
|
|
|
/*! \brief encode text to BASE64 coding */
|
2006-06-01 19:05:45 +00:00
|
|
|
int ast_base64encode_full(char *dst, const unsigned char *src, int srclen, int max, int linebreaks)
|
2004-06-25 04:07:52 +00:00
|
|
|
{
|
|
|
|
int cnt = 0;
|
2006-06-01 19:05:45 +00:00
|
|
|
int col = 0;
|
2004-06-25 04:07:52 +00:00
|
|
|
unsigned int byte = 0;
|
|
|
|
int bits = 0;
|
|
|
|
int cntin = 0;
|
2006-06-01 19:05:45 +00:00
|
|
|
/* Reserve space for null byte at end of string */
|
2004-06-25 04:07:52 +00:00
|
|
|
max--;
|
2006-07-10 19:05:48 +00:00
|
|
|
while ((cntin < srclen) && (cnt < max)) {
|
2004-06-25 04:07:52 +00:00
|
|
|
byte <<= 8;
|
|
|
|
byte |= *(src++);
|
|
|
|
bits += 8;
|
|
|
|
cntin++;
|
2006-08-25 17:48:34 +00:00
|
|
|
if ((bits == 24) && (cnt + 4 <= max)) {
|
2006-06-01 19:05:45 +00:00
|
|
|
*dst++ = base64[(byte >> 18) & 0x3f];
|
|
|
|
*dst++ = base64[(byte >> 12) & 0x3f];
|
|
|
|
*dst++ = base64[(byte >> 6) & 0x3f];
|
|
|
|
*dst++ = base64[byte & 0x3f];
|
|
|
|
cnt += 4;
|
|
|
|
col += 4;
|
|
|
|
bits = 0;
|
|
|
|
byte = 0;
|
|
|
|
}
|
|
|
|
if (linebreaks && (cnt < max) && (col == 64)) {
|
|
|
|
*dst++ = '\n';
|
2004-06-25 04:07:52 +00:00
|
|
|
cnt++;
|
2006-06-01 19:05:45 +00:00
|
|
|
col = 0;
|
2004-06-25 04:07:52 +00:00
|
|
|
}
|
|
|
|
}
|
2006-08-25 17:48:34 +00:00
|
|
|
if (bits && (cnt + 4 <= max)) {
|
2012-03-22 19:51:16 +00:00
|
|
|
/* Add one last character for the remaining bits,
|
2004-06-25 04:07:52 +00:00
|
|
|
padding the rest with 0 */
|
2006-06-01 19:05:45 +00:00
|
|
|
byte <<= 24 - bits;
|
|
|
|
*dst++ = base64[(byte >> 18) & 0x3f];
|
|
|
|
*dst++ = base64[(byte >> 12) & 0x3f];
|
|
|
|
if (bits == 16)
|
|
|
|
*dst++ = base64[(byte >> 6) & 0x3f];
|
|
|
|
else
|
|
|
|
*dst++ = '=';
|
|
|
|
*dst++ = '=';
|
|
|
|
cnt += 4;
|
|
|
|
}
|
|
|
|
if (linebreaks && (cnt < max)) {
|
|
|
|
*dst++ = '\n';
|
2004-06-25 04:07:52 +00:00
|
|
|
cnt++;
|
|
|
|
}
|
|
|
|
*dst = '\0';
|
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
2006-06-01 19:05:45 +00:00
|
|
|
int ast_base64encode(char *dst, const unsigned char *src, int srclen, int max)
|
|
|
|
{
|
|
|
|
return ast_base64encode_full(dst, src, srclen, max, 0);
|
|
|
|
}
|
|
|
|
|
2004-06-25 04:07:52 +00:00
|
|
|
static void base64_init(void)
|
|
|
|
{
|
|
|
|
int x;
|
|
|
|
memset(b2a, -1, sizeof(b2a));
|
|
|
|
/* Initialize base-64 Conversion table */
|
2006-07-10 19:05:48 +00:00
|
|
|
for (x = 0; x < 26; x++) {
|
2004-06-25 04:07:52 +00:00
|
|
|
/* A-Z */
|
|
|
|
base64[x] = 'A' + x;
|
|
|
|
b2a['A' + x] = x;
|
|
|
|
/* a-z */
|
|
|
|
base64[x + 26] = 'a' + x;
|
|
|
|
b2a['a' + x] = x + 26;
|
|
|
|
/* 0-9 */
|
|
|
|
if (x < 10) {
|
|
|
|
base64[x + 52] = '0' + x;
|
|
|
|
b2a['0' + x] = x + 52;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
base64[62] = '+';
|
|
|
|
base64[63] = '/';
|
|
|
|
b2a[(int)'+'] = 62;
|
|
|
|
b2a[(int)'/'] = 63;
|
|
|
|
}
|
|
|
|
|
2011-01-24 18:59:22 +00:00
|
|
|
const struct ast_flags ast_uri_http = {AST_URI_UNRESERVED};
|
|
|
|
const struct ast_flags ast_uri_http_legacy = {AST_URI_LEGACY_SPACE | AST_URI_UNRESERVED};
|
|
|
|
const struct ast_flags ast_uri_sip_user = {AST_URI_UNRESERVED | AST_URI_SIP_USER_UNRESERVED};
|
|
|
|
|
|
|
|
char *ast_uri_encode(const char *string, char *outbuf, int buflen, struct ast_flags spec)
|
2005-08-29 22:39:39 +00:00
|
|
|
{
|
RFC compliant uri and display-name encode/decode
1. URI Encoding
This patch changes ast_uri_encode()'s behavior when doreserved is enabled.
Previously when doreserved was enabled only a small set of reserved
characters were encoded. This set was comprised primarily of the reserved
characters defined in RFC3261 section 25.1, but contained other characters as
well. Rather than only escaping the reserved set, doreserved now escapes
all characters not within the unreserved set as defined by RFC 3261 and
RFC 2396. Also, the 'doreserved' variable has been renamed to 'do_special_char'
in attempts to avoid confusion.
When doreserve is not enabled, the previous logic of only encoding the
characters <= 0X1F and > 0X7f remains, except for the '%' character, which
must always be encoded as it signifies a HEX escaped character during the decode
process.
2. URI Decoding: Break up URI before decode.
In chan_sip.c ast_uri_decode is called on the entire URI instead of it's
individual parts after it is parsed. This is not good as ast_uri_decode
can introduce special characters back into the URI which can mess up parsing.
This patch resolves this by not decoding a URI until parsing is completely
done. There are many instances where we check to see if pedantic checking
is enabled before we decode a URI. In these cases a new macro,
SIP_PEDANTIC_DECODE, is used on the individual parsed segments of the URI
rather than constantly putting if (pedantic) { decode() } checks everywhere
in the code. In the areas where ast_uri_decode is not dependent upon
pedantic checking this macro is not used, but decoding is still moved to
each individual part of the URI. The only behavior that should change from
this patch is the time at which decoding occurs.
Since I had to look over every place URI parsing occurs to create this
patch, I found several places where we use duplicate code for parsing.
To consolidate the code, those areas have updated to use the parse_uri()
function where possible.
3. SIP display-name decoding according to RFC3261 section 25.
To properly decode the display-name portion of a FROM header, chan_sip's
get_calleridname() function required a complete re-write. More information
about this change can be found in the comments at the beginning of this function.
4. Unit Tests.
Unit tests for ast_uri_encode, ast_uri_decode, and get_calleridname() have been
written. This involved the addition of the test_utils.c file for testing the
utils api.
(closes issue #16299)
Reported by: wdoekes
Patches:
astsvn-16299-get_calleridname.diff uploaded by wdoekes (license 717)
get_calleridname_rewrite.diff uploaded by dvossel (license 671)
Tested by: wdoekes, dvossel, Nick_Lewis
Review: https://reviewboard.asterisk.org/r/469/
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@243200 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2010-01-26 16:30:08 +00:00
|
|
|
const char *ptr = string; /* Start with the string */
|
2011-01-11 18:55:16 +00:00
|
|
|
char *out = outbuf;
|
RFC compliant uri and display-name encode/decode
1. URI Encoding
This patch changes ast_uri_encode()'s behavior when doreserved is enabled.
Previously when doreserved was enabled only a small set of reserved
characters were encoded. This set was comprised primarily of the reserved
characters defined in RFC3261 section 25.1, but contained other characters as
well. Rather than only escaping the reserved set, doreserved now escapes
all characters not within the unreserved set as defined by RFC 3261 and
RFC 2396. Also, the 'doreserved' variable has been renamed to 'do_special_char'
in attempts to avoid confusion.
When doreserve is not enabled, the previous logic of only encoding the
characters <= 0X1F and > 0X7f remains, except for the '%' character, which
must always be encoded as it signifies a HEX escaped character during the decode
process.
2. URI Decoding: Break up URI before decode.
In chan_sip.c ast_uri_decode is called on the entire URI instead of it's
individual parts after it is parsed. This is not good as ast_uri_decode
can introduce special characters back into the URI which can mess up parsing.
This patch resolves this by not decoding a URI until parsing is completely
done. There are many instances where we check to see if pedantic checking
is enabled before we decode a URI. In these cases a new macro,
SIP_PEDANTIC_DECODE, is used on the individual parsed segments of the URI
rather than constantly putting if (pedantic) { decode() } checks everywhere
in the code. In the areas where ast_uri_decode is not dependent upon
pedantic checking this macro is not used, but decoding is still moved to
each individual part of the URI. The only behavior that should change from
this patch is the time at which decoding occurs.
Since I had to look over every place URI parsing occurs to create this
patch, I found several places where we use duplicate code for parsing.
To consolidate the code, those areas have updated to use the parse_uri()
function where possible.
3. SIP display-name decoding according to RFC3261 section 25.
To properly decode the display-name portion of a FROM header, chan_sip's
get_calleridname() function required a complete re-write. More information
about this change can be found in the comments at the beginning of this function.
4. Unit Tests.
Unit tests for ast_uri_encode, ast_uri_decode, and get_calleridname() have been
written. This involved the addition of the test_utils.c file for testing the
utils api.
(closes issue #16299)
Reported by: wdoekes
Patches:
astsvn-16299-get_calleridname.diff uploaded by wdoekes (license 717)
get_calleridname_rewrite.diff uploaded by dvossel (license 671)
Tested by: wdoekes, dvossel, Nick_Lewis
Review: https://reviewboard.asterisk.org/r/469/
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@243200 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2010-01-26 16:30:08 +00:00
|
|
|
const char *mark = "-_.!~*'()"; /* no encode set, RFC 2396 section 2.3, RFC 3261 sec 25 */
|
2011-01-24 18:59:22 +00:00
|
|
|
const char *user_unreserved = "&=+$,;?/"; /* user-unreserved set, RFC 3261 sec 25 */
|
2005-08-29 22:39:39 +00:00
|
|
|
|
2011-01-11 18:55:16 +00:00
|
|
|
while (*ptr && out - outbuf < buflen - 1) {
|
2011-01-24 18:59:22 +00:00
|
|
|
if (ast_test_flag(&spec, AST_URI_LEGACY_SPACE) && *ptr == ' ') {
|
|
|
|
/* for legacy encoding, encode spaces as '+' */
|
|
|
|
*out = '+';
|
|
|
|
out++;
|
|
|
|
} else if (!(ast_test_flag(&spec, AST_URI_MARK)
|
|
|
|
&& strchr(mark, *ptr))
|
|
|
|
&& !(ast_test_flag(&spec, AST_URI_ALPHANUM)
|
|
|
|
&& ((*ptr >= '0' && *ptr <= '9')
|
|
|
|
|| (*ptr >= 'A' && *ptr <= 'Z')
|
|
|
|
|| (*ptr >= 'a' && *ptr <= 'z')))
|
|
|
|
&& !(ast_test_flag(&spec, AST_URI_SIP_USER_UNRESERVED)
|
|
|
|
&& strchr(user_unreserved, *ptr))) {
|
|
|
|
|
2011-01-11 18:55:16 +00:00
|
|
|
if (out - outbuf >= buflen - 3) {
|
|
|
|
break;
|
2005-08-29 22:39:39 +00:00
|
|
|
}
|
2014-12-17 10:23:32 +00:00
|
|
|
out += sprintf(out, "%%%02hhX", (unsigned char) *ptr);
|
2011-01-11 18:55:16 +00:00
|
|
|
} else {
|
2005-08-29 22:39:39 +00:00
|
|
|
*out = *ptr; /* Continue copying the string */
|
|
|
|
out++;
|
RFC compliant uri and display-name encode/decode
1. URI Encoding
This patch changes ast_uri_encode()'s behavior when doreserved is enabled.
Previously when doreserved was enabled only a small set of reserved
characters were encoded. This set was comprised primarily of the reserved
characters defined in RFC3261 section 25.1, but contained other characters as
well. Rather than only escaping the reserved set, doreserved now escapes
all characters not within the unreserved set as defined by RFC 3261 and
RFC 2396. Also, the 'doreserved' variable has been renamed to 'do_special_char'
in attempts to avoid confusion.
When doreserve is not enabled, the previous logic of only encoding the
characters <= 0X1F and > 0X7f remains, except for the '%' character, which
must always be encoded as it signifies a HEX escaped character during the decode
process.
2. URI Decoding: Break up URI before decode.
In chan_sip.c ast_uri_decode is called on the entire URI instead of it's
individual parts after it is parsed. This is not good as ast_uri_decode
can introduce special characters back into the URI which can mess up parsing.
This patch resolves this by not decoding a URI until parsing is completely
done. There are many instances where we check to see if pedantic checking
is enabled before we decode a URI. In these cases a new macro,
SIP_PEDANTIC_DECODE, is used on the individual parsed segments of the URI
rather than constantly putting if (pedantic) { decode() } checks everywhere
in the code. In the areas where ast_uri_decode is not dependent upon
pedantic checking this macro is not used, but decoding is still moved to
each individual part of the URI. The only behavior that should change from
this patch is the time at which decoding occurs.
Since I had to look over every place URI parsing occurs to create this
patch, I found several places where we use duplicate code for parsing.
To consolidate the code, those areas have updated to use the parse_uri()
function where possible.
3. SIP display-name decoding according to RFC3261 section 25.
To properly decode the display-name portion of a FROM header, chan_sip's
get_calleridname() function required a complete re-write. More information
about this change can be found in the comments at the beginning of this function.
4. Unit Tests.
Unit tests for ast_uri_encode, ast_uri_decode, and get_calleridname() have been
written. This involved the addition of the test_utils.c file for testing the
utils api.
(closes issue #16299)
Reported by: wdoekes
Patches:
astsvn-16299-get_calleridname.diff uploaded by wdoekes (license 717)
get_calleridname_rewrite.diff uploaded by dvossel (license 671)
Tested by: wdoekes, dvossel, Nick_Lewis
Review: https://reviewboard.asterisk.org/r/469/
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@243200 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2010-01-26 16:30:08 +00:00
|
|
|
}
|
2005-08-29 22:39:39 +00:00
|
|
|
ptr++;
|
|
|
|
}
|
2011-01-11 18:55:16 +00:00
|
|
|
|
|
|
|
if (buflen) {
|
2005-08-29 22:39:39 +00:00
|
|
|
*out = '\0';
|
2011-01-11 18:55:16 +00:00
|
|
|
}
|
|
|
|
|
2005-08-29 22:39:39 +00:00
|
|
|
return outbuf;
|
|
|
|
}
|
|
|
|
|
2011-01-24 18:59:22 +00:00
|
|
|
void ast_uri_decode(char *s, struct ast_flags spec)
|
2005-08-29 22:39:39 +00:00
|
|
|
{
|
|
|
|
char *o;
|
|
|
|
unsigned int tmp;
|
|
|
|
|
|
|
|
for (o = s; *s; s++, o++) {
|
2011-01-24 18:59:22 +00:00
|
|
|
if (ast_test_flag(&spec, AST_URI_LEGACY_SPACE) && *s == '+') {
|
|
|
|
/* legacy mode, decode '+' as space */
|
|
|
|
*o = ' ';
|
|
|
|
} else if (*s == '%' && s[1] != '\0' && s[2] != '\0' && sscanf(s + 1, "%2x", &tmp) == 1) {
|
2005-08-29 22:39:39 +00:00
|
|
|
/* have '%', two chars and correct parsing */
|
|
|
|
*o = tmp;
|
|
|
|
s += 2; /* Will be incremented once more when we break out */
|
|
|
|
} else /* all other cases, just copy */
|
|
|
|
*o = *s;
|
|
|
|
}
|
|
|
|
*o = '\0';
|
|
|
|
}
|
|
|
|
|
2011-01-24 18:59:22 +00:00
|
|
|
char *ast_escape_quoted(const char *string, char *outbuf, int buflen)
|
|
|
|
{
|
|
|
|
const char *ptr = string;
|
|
|
|
char *out = outbuf;
|
|
|
|
char *allow = "\t\v !"; /* allow LWS (minus \r and \n) and "!" */
|
|
|
|
|
|
|
|
while (*ptr && out - outbuf < buflen - 1) {
|
|
|
|
if (!(strchr(allow, *ptr))
|
|
|
|
&& !(*ptr >= '#' && *ptr <= '[') /* %x23 - %x5b */
|
|
|
|
&& !(*ptr >= ']' && *ptr <= '~') /* %x5d - %x7e */
|
2011-01-25 15:52:42 +00:00
|
|
|
&& !((unsigned char) *ptr > 0x7f)) { /* UTF8-nonascii */
|
2011-01-24 18:59:22 +00:00
|
|
|
|
|
|
|
if (out - outbuf >= buflen - 2) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
out += sprintf(out, "\\%c", (unsigned char) *ptr);
|
|
|
|
} else {
|
|
|
|
*out = *ptr;
|
|
|
|
out++;
|
|
|
|
}
|
|
|
|
ptr++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buflen) {
|
|
|
|
*out = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
return outbuf;
|
|
|
|
}
|
2014-08-27 15:39:35 +00:00
|
|
|
|
2014-11-05 00:17:10 +00:00
|
|
|
char *ast_escape_semicolons(const char *string, char *outbuf, int buflen)
|
|
|
|
{
|
|
|
|
const char *ptr = string;
|
|
|
|
char *out = outbuf;
|
|
|
|
|
|
|
|
if (string == NULL || outbuf == NULL) {
|
|
|
|
ast_assert(string != NULL && outbuf != NULL);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (*ptr && out - outbuf < buflen - 1) {
|
|
|
|
if (*ptr == ';') {
|
|
|
|
if (out - outbuf >= buflen - 2) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
strcpy(out, "\\;");
|
|
|
|
out += 2;
|
|
|
|
} else {
|
|
|
|
*out = *ptr;
|
|
|
|
out++;
|
|
|
|
}
|
|
|
|
ptr++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buflen) {
|
|
|
|
*out = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
return outbuf;
|
|
|
|
}
|
|
|
|
|
2014-08-27 15:39:35 +00:00
|
|
|
void ast_unescape_quoted(char *quote_str)
|
|
|
|
{
|
|
|
|
int esc_pos;
|
|
|
|
int unesc_pos;
|
|
|
|
int quote_str_len = strlen(quote_str);
|
|
|
|
|
|
|
|
for (esc_pos = 0, unesc_pos = 0;
|
|
|
|
esc_pos < quote_str_len;
|
|
|
|
esc_pos++, unesc_pos++) {
|
|
|
|
if (quote_str[esc_pos] == '\\') {
|
|
|
|
/* at least one more char and current is \\ */
|
|
|
|
esc_pos++;
|
|
|
|
if (esc_pos >= quote_str_len) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
quote_str[unesc_pos] = quote_str[esc_pos];
|
|
|
|
}
|
|
|
|
quote_str[unesc_pos] = '\0';
|
|
|
|
}
|
|
|
|
|
2013-01-12 06:43:37 +00:00
|
|
|
int ast_xml_escape(const char *string, char * const outbuf, const size_t buflen)
|
|
|
|
{
|
|
|
|
char *dst = outbuf;
|
|
|
|
char *end = outbuf + buflen - 1; /* save one for the null terminator */
|
|
|
|
|
|
|
|
/* Handle the case for the empty output buffer */
|
|
|
|
if (buflen == 0) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Escaping rules from http://www.w3.org/TR/REC-xml/#syntax */
|
|
|
|
/* This also prevents partial entities at the end of a string */
|
|
|
|
while (*string && dst < end) {
|
|
|
|
const char *entity = NULL;
|
|
|
|
int len = 0;
|
|
|
|
|
|
|
|
switch (*string) {
|
|
|
|
case '<':
|
|
|
|
entity = "<";
|
|
|
|
len = 4;
|
|
|
|
break;
|
|
|
|
case '&':
|
|
|
|
entity = "&";
|
|
|
|
len = 5;
|
|
|
|
break;
|
|
|
|
case '>':
|
|
|
|
/* necessary if ]]> is in the string; easier to escape them all */
|
|
|
|
entity = ">";
|
|
|
|
len = 4;
|
|
|
|
break;
|
|
|
|
case '\'':
|
|
|
|
/* necessary in single-quoted strings; easier to escape them all */
|
|
|
|
entity = "'";
|
|
|
|
len = 6;
|
|
|
|
break;
|
|
|
|
case '"':
|
|
|
|
/* necessary in double-quoted strings; easier to escape them all */
|
|
|
|
entity = """;
|
|
|
|
len = 6;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
*dst++ = *string++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (entity) {
|
|
|
|
ast_assert(len == strlen(entity));
|
|
|
|
if (end - dst < len) {
|
|
|
|
/* no room for the entity; stop */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* just checked for length; strcpy is fine */
|
|
|
|
strcpy(dst, entity);
|
|
|
|
dst += len;
|
|
|
|
++string;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Write null terminator */
|
|
|
|
*dst = '\0';
|
|
|
|
/* If any chars are left in string, return failure */
|
|
|
|
return *string == '\0' ? 0 : -1;
|
|
|
|
}
|
|
|
|
|
2005-10-26 13:03:17 +00:00
|
|
|
/*! \brief ast_inet_ntoa: Recursive thread safe replacement of inet_ntoa */
|
2006-07-21 17:31:28 +00:00
|
|
|
const char *ast_inet_ntoa(struct in_addr ia)
|
2004-06-29 12:56:46 +00:00
|
|
|
{
|
2006-07-21 17:31:28 +00:00
|
|
|
char *buf;
|
|
|
|
|
Merge team/russell/ast_verbose_threadstorage
- instead of defining a free() wrapper in a bunch of files, define it as
ast_free() in utils.h and remove the copies from all the files.
- centralize and abstract the code used for doing thread storage. The code
lives in threadstorage.h, with one function being implemented in utils.c.
This new API includes generic thread storage as well as special functions
for handling thread local dynamic length string buffers.
- update ast_inet_ntoa() to use the new threadstorage API
- update ast_state2str() to use the new threadstorage API
- update ast_cli() to use the new threadstorage API
- Modify manager_event() to use thread storage. Instead of using a buffer of
4096 characters as the workspace for building the manager event, use a thread
local dynamic string. Now there is no length limitation on the length of the
body of a manager event.
- Significantly simplify the handling of ast_verbose() ...
- Instead of using a static char buffer and a lock to make sure only one
thread can be using ast_verbose() at a time, use a thread local dynamic
string as the workspace for preparing the verbose message. Instead of
locking around the entire function, the only locking done now is when the
message has been built and is being deliviered to the list of registered
verbose message handlers.
- This function was doing a strdup() on every message passed to it and
keeping a queue of the last 200 messages in memory. This has been
completely removed. The only place this was used was that if there were
any messages in the verbose queue when a verbose handler was registered,
all of the messages in the queue would be fed to it. So, I just made sure
that the console verbose handler and the network verbose handler (for
remote asterisk consoles) were registered before any verbose messages.
pbx_gtkconsole and pbx_kdeconsole will now lose a few verbose messages at
startup, but I didn't feel the performance hit of this message queue was
worth saving the initial verbose output for these very rarely used modules.
- I have removed the last three arguments to the verbose handlers, leaving
only the string itself because they aren't needed anymore. For example,
ast_verbose had some logic for telling the verbose handler to add
a newline if the buffer was completely full. Now that the buffer can grow
as needed, this doesn't matter anymore.
- remove unused function, ast_verbose_dmesg() which was to dispatch the
message queue
- Convert the list of verbose handlers to use the linked list macros.
- add missing newline characters to a few ast_verbose() calls
- convert the list of log channels to use the linked list macros in logger.c
- fix close_logger() to close all of the files it opened for logging
- update ast_log() to use a thread local dynamic string for its workspace
for preparing log messages instead of a buffer of size BUFSIZ (8kB on my
system) allocated on the stack. The dynamic string in this case is limited
to only growing to a maximum size of BUFSIZ.
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@39272 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2006-08-08 06:32:04 +00:00
|
|
|
if (!(buf = ast_threadstorage_get(&inet_ntoa_buf, INET_ADDRSTRLEN)))
|
|
|
|
return "";
|
2006-07-21 17:31:28 +00:00
|
|
|
|
|
|
|
return inet_ntop(AF_INET, &ia, buf, INET_ADDRSTRLEN);
|
2004-06-29 12:56:46 +00:00
|
|
|
}
|
2004-06-25 04:07:52 +00:00
|
|
|
|
2015-03-17 22:15:42 +00:00
|
|
|
static int dev_urandom_fd = -1;
|
2007-07-21 14:39:52 +00:00
|
|
|
|
2005-03-08 20:47:30 +00:00
|
|
|
#ifndef __linux__
|
|
|
|
#undef pthread_create /* For ast_pthread_create function only */
|
2005-10-31 21:25:21 +00:00
|
|
|
#endif /* !__linux__ */
|
2005-08-29 22:39:39 +00:00
|
|
|
|
2007-08-03 19:41:42 +00:00
|
|
|
#ifdef DEBUG_THREADS
|
|
|
|
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-08-03 19:41:42 +00:00
|
|
|
/*! \brief A reasonable maximum number of locks a thread would be holding ... */
|
2008-01-08 20:56:38 +00:00
|
|
|
#define AST_MAX_LOCKS 64
|
2007-08-03 19:41:42 +00:00
|
|
|
|
|
|
|
/* Allow direct use of pthread_mutex_t and friends */
|
|
|
|
#undef pthread_mutex_t
|
|
|
|
#undef pthread_mutex_lock
|
|
|
|
#undef pthread_mutex_unlock
|
|
|
|
#undef pthread_mutex_init
|
|
|
|
#undef pthread_mutex_destroy
|
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
/*!
|
|
|
|
* \brief Keep track of which locks a thread holds
|
2007-08-03 19:41:42 +00:00
|
|
|
*
|
|
|
|
* There is an instance of this struct for every active thread
|
|
|
|
*/
|
|
|
|
struct thr_lock_info {
|
|
|
|
/*! The thread's ID */
|
|
|
|
pthread_t thread_id;
|
|
|
|
/*! The thread name which includes where the thread was started */
|
|
|
|
const char *thread_name;
|
|
|
|
/*! This is the actual container of info for what locks this thread holds */
|
|
|
|
struct {
|
|
|
|
const char *file;
|
|
|
|
const char *func;
|
|
|
|
const char *lock_name;
|
|
|
|
void *lock_addr;
|
|
|
|
int times_locked;
|
2014-01-24 22:34:23 +00:00
|
|
|
int line_num;
|
2007-10-01 21:15:57 +00:00
|
|
|
enum ast_lock_type type;
|
2007-08-03 19:41:42 +00:00
|
|
|
/*! This thread is waiting on this lock */
|
2007-10-09 22:21:49 +00:00
|
|
|
int pending:2;
|
2013-09-09 20:13:40 +00:00
|
|
|
/*! A condition has suspended this lock */
|
|
|
|
int suspended:1;
|
2008-05-23 22:35:50 +00:00
|
|
|
#ifdef HAVE_BKTR
|
|
|
|
struct ast_bt *backtrace;
|
|
|
|
#endif
|
2007-08-03 19:41:42 +00:00
|
|
|
} locks[AST_MAX_LOCKS];
|
|
|
|
/*! This is the number of locks currently held by this thread.
|
|
|
|
* The index (num_locks - 1) has the info on the last one in the
|
|
|
|
* locks member */
|
|
|
|
unsigned int num_locks;
|
2014-01-24 22:34:23 +00:00
|
|
|
/*! The LWP id (which GDB prints) */
|
|
|
|
int lwp;
|
2012-03-22 19:51:16 +00:00
|
|
|
/*! Protects the contents of the locks member
|
2007-08-03 19:41:42 +00:00
|
|
|
* Intentionally not ast_mutex_t */
|
|
|
|
pthread_mutex_t lock;
|
|
|
|
AST_LIST_ENTRY(thr_lock_info) entry;
|
|
|
|
};
|
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
/*!
|
|
|
|
* \brief Locked when accessing the lock_infos list
|
2007-08-03 19:41:42 +00:00
|
|
|
*/
|
|
|
|
AST_MUTEX_DEFINE_STATIC(lock_infos_lock);
|
|
|
|
/*!
|
2012-03-22 19:51:16 +00:00
|
|
|
* \brief A list of each thread's lock info
|
2007-08-03 19:41:42 +00:00
|
|
|
*/
|
|
|
|
static AST_LIST_HEAD_NOLOCK_STATIC(lock_infos, thr_lock_info);
|
|
|
|
|
|
|
|
/*!
|
|
|
|
* \brief Destroy a thread's lock info
|
|
|
|
*
|
|
|
|
* This gets called automatically when the thread stops
|
|
|
|
*/
|
|
|
|
static void lock_info_destroy(void *data)
|
|
|
|
{
|
|
|
|
struct thr_lock_info *lock_info = data;
|
2008-06-19 19:48:26 +00:00
|
|
|
int i;
|
2007-08-03 19:41:42 +00:00
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_infos_lock.mutex);
|
|
|
|
AST_LIST_REMOVE(&lock_infos, lock_info, entry);
|
|
|
|
pthread_mutex_unlock(&lock_infos_lock.mutex);
|
|
|
|
|
2008-06-19 19:48:26 +00:00
|
|
|
|
|
|
|
for (i = 0; i < lock_info->num_locks; i++) {
|
2008-12-16 21:39:15 +00:00
|
|
|
if (lock_info->locks[i].pending == -1) {
|
|
|
|
/* This just means that the last lock this thread went for was by
|
|
|
|
* using trylock, and it failed. This is fine. */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
ast_log(LOG_ERROR,
|
|
|
|
"Thread '%s' still has a lock! - '%s' (%p) from '%s' in %s:%d!\n",
|
2008-06-19 19:48:26 +00:00
|
|
|
lock_info->thread_name,
|
|
|
|
lock_info->locks[i].lock_name,
|
|
|
|
lock_info->locks[i].lock_addr,
|
|
|
|
lock_info->locks[i].func,
|
|
|
|
lock_info->locks[i].file,
|
|
|
|
lock_info->locks[i].line_num
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2007-08-03 19:41:42 +00:00
|
|
|
pthread_mutex_destroy(&lock_info->lock);
|
2013-10-02 17:12:49 +00:00
|
|
|
if (lock_info->thread_name) {
|
|
|
|
ast_free((void *) lock_info->thread_name);
|
|
|
|
}
|
|
|
|
ast_free(lock_info);
|
2007-08-03 19:41:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
* \brief The thread storage key for per-thread lock info
|
|
|
|
*/
|
|
|
|
AST_THREADSTORAGE_CUSTOM(thread_lock_info, NULL, lock_info_destroy);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
|
|
|
|
2008-05-23 22:35:50 +00:00
|
|
|
void ast_store_lock_info(enum ast_lock_type type, const char *filename,
|
|
|
|
int line_num, const char *func, const char *lock_name, void *lock_addr, struct ast_bt *bt)
|
2007-08-03 19:41:42 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-08-03 19:41:42 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
|
|
|
|
for (i = 0; i < lock_info->num_locks; i++) {
|
|
|
|
if (lock_info->locks[i].lock_addr == lock_addr) {
|
|
|
|
lock_info->locks[i].times_locked++;
|
2008-05-23 22:35:50 +00:00
|
|
|
#ifdef HAVE_BKTR
|
|
|
|
lock_info->locks[i].backtrace = bt;
|
|
|
|
#endif
|
2007-08-03 19:41:42 +00:00
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (lock_info->num_locks == AST_MAX_LOCKS) {
|
|
|
|
/* Can't use ast_log here, because it will cause infinite recursion */
|
|
|
|
fprintf(stderr, "XXX ERROR XXX A thread holds more locks than '%d'."
|
|
|
|
" Increase AST_MAX_LOCKS!\n", AST_MAX_LOCKS);
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return;
|
|
|
|
}
|
2008-02-25 23:19:31 +00:00
|
|
|
|
2008-03-19 04:06:31 +00:00
|
|
|
if (i && lock_info->locks[i - 1].pending == -1) {
|
2008-02-25 23:19:31 +00:00
|
|
|
/* The last lock on the list was one that this thread tried to lock but
|
|
|
|
* failed at doing so. It has now moved on to something else, so remove
|
|
|
|
* the old lock from the list. */
|
|
|
|
i--;
|
|
|
|
lock_info->num_locks--;
|
|
|
|
memset(&lock_info->locks[i], 0, sizeof(lock_info->locks[0]));
|
|
|
|
}
|
|
|
|
|
2007-08-03 19:41:42 +00:00
|
|
|
lock_info->locks[i].file = filename;
|
|
|
|
lock_info->locks[i].line_num = line_num;
|
|
|
|
lock_info->locks[i].func = func;
|
|
|
|
lock_info->locks[i].lock_name = lock_name;
|
|
|
|
lock_info->locks[i].lock_addr = lock_addr;
|
|
|
|
lock_info->locks[i].times_locked = 1;
|
2007-10-01 21:15:57 +00:00
|
|
|
lock_info->locks[i].type = type;
|
2007-08-03 19:41:42 +00:00
|
|
|
lock_info->locks[i].pending = 1;
|
2008-05-23 22:35:50 +00:00
|
|
|
#ifdef HAVE_BKTR
|
|
|
|
lock_info->locks[i].backtrace = bt;
|
|
|
|
#endif
|
2007-08-03 19:41:42 +00:00
|
|
|
lock_info->num_locks++;
|
|
|
|
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2007-08-03 19:41:42 +00:00
|
|
|
}
|
|
|
|
|
2008-02-28 22:39:26 +00:00
|
|
|
void ast_mark_lock_acquired(void *lock_addr)
|
2007-08-03 19:41:42 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-08-03 19:41:42 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
2008-02-28 22:39:26 +00:00
|
|
|
if (lock_info->locks[lock_info->num_locks - 1].lock_addr == lock_addr) {
|
|
|
|
lock_info->locks[lock_info->num_locks - 1].pending = 0;
|
|
|
|
}
|
2007-08-03 19:41:42 +00:00
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2007-08-03 19:41:42 +00:00
|
|
|
}
|
|
|
|
|
2008-02-28 22:39:26 +00:00
|
|
|
void ast_mark_lock_failed(void *lock_addr)
|
2007-10-09 22:21:49 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-10-09 22:21:49 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
2008-02-28 22:39:26 +00:00
|
|
|
if (lock_info->locks[lock_info->num_locks - 1].lock_addr == lock_addr) {
|
|
|
|
lock_info->locks[lock_info->num_locks - 1].pending = -1;
|
|
|
|
lock_info->locks[lock_info->num_locks - 1].times_locked--;
|
|
|
|
}
|
2007-10-09 22:21:49 +00:00
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2007-10-09 22:21:49 +00:00
|
|
|
}
|
2008-05-30 21:51:17 +00:00
|
|
|
|
2008-06-27 13:54:13 +00:00
|
|
|
int ast_find_lock_info(void *lock_addr, char *filename, size_t filename_size, int *lineno, char *func, size_t func_size, char *mutex_name, size_t mutex_name_size)
|
2008-05-29 17:35:19 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2008-05-29 17:35:19 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
|
|
|
|
for (i = lock_info->num_locks - 1; i >= 0; i--) {
|
|
|
|
if (lock_info->locks[i].lock_addr == lock_addr)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == -1) {
|
|
|
|
/* Lock not found :( */
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-06-27 13:54:13 +00:00
|
|
|
ast_copy_string(filename, lock_info->locks[i].file, filename_size);
|
2008-05-29 17:35:19 +00:00
|
|
|
*lineno = lock_info->locks[i].line_num;
|
2008-06-27 13:54:13 +00:00
|
|
|
ast_copy_string(func, lock_info->locks[i].func, func_size);
|
|
|
|
ast_copy_string(mutex_name, lock_info->locks[i].lock_name, mutex_name_size);
|
2008-06-26 23:04:18 +00:00
|
|
|
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
|
2008-05-29 17:35:19 +00:00
|
|
|
return 0;
|
2016-09-19 09:46:27 +00:00
|
|
|
#else /* if defined(LOW_MEMORY) */
|
|
|
|
return -1;
|
|
|
|
#endif
|
2008-05-29 17:35:19 +00:00
|
|
|
}
|
|
|
|
|
2013-09-09 20:13:40 +00:00
|
|
|
void ast_suspend_lock_info(void *lock_addr)
|
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2013-09-09 20:13:40 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info)))) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
|
|
|
|
for (i = lock_info->num_locks - 1; i >= 0; i--) {
|
|
|
|
if (lock_info->locks[i].lock_addr == lock_addr)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == -1) {
|
|
|
|
/* Lock not found :( */
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
lock_info->locks[i].suspended = 1;
|
|
|
|
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2013-09-09 20:13:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ast_restore_lock_info(void *lock_addr)
|
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2013-09-09 20:13:40 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
|
|
|
|
for (i = lock_info->num_locks - 1; i >= 0; i--) {
|
|
|
|
if (lock_info->locks[i].lock_addr == lock_addr)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == -1) {
|
|
|
|
/* Lock not found :( */
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
lock_info->locks[i].suspended = 0;
|
|
|
|
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2013-09-09 20:13:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-05-30 21:51:17 +00:00
|
|
|
void ast_remove_lock_info(void *lock_addr, struct ast_bt *bt)
|
2007-08-03 19:41:42 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-08-03 19:41:42 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
|
|
|
|
for (i = lock_info->num_locks - 1; i >= 0; i--) {
|
|
|
|
if (lock_info->locks[i].lock_addr == lock_addr)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == -1) {
|
|
|
|
/* Lock not found :( */
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (lock_info->locks[i].times_locked > 1) {
|
|
|
|
lock_info->locks[i].times_locked--;
|
2008-05-23 22:35:50 +00:00
|
|
|
#ifdef HAVE_BKTR
|
|
|
|
lock_info->locks[i].backtrace = bt;
|
|
|
|
#endif
|
2007-08-03 19:41:42 +00:00
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i < lock_info->num_locks - 1) {
|
|
|
|
/* Not the last one ... *should* be rare! */
|
2012-03-22 19:51:16 +00:00
|
|
|
memmove(&lock_info->locks[i], &lock_info->locks[i + 1],
|
2007-08-03 19:41:42 +00:00
|
|
|
(lock_info->num_locks - (i + 1)) * sizeof(lock_info->locks[0]));
|
|
|
|
}
|
|
|
|
|
|
|
|
lock_info->num_locks--;
|
|
|
|
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2007-08-03 19:41:42 +00:00
|
|
|
}
|
|
|
|
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-10-01 21:15:57 +00:00
|
|
|
static const char *locktype2str(enum ast_lock_type type)
|
|
|
|
{
|
|
|
|
switch (type) {
|
|
|
|
case AST_MUTEX:
|
|
|
|
return "MUTEX";
|
|
|
|
case AST_RDLOCK:
|
|
|
|
return "RDLOCK";
|
|
|
|
case AST_WRLOCK:
|
|
|
|
return "WRLOCK";
|
|
|
|
}
|
|
|
|
|
|
|
|
return "UNKNOWN";
|
|
|
|
}
|
|
|
|
|
2008-05-23 22:35:50 +00:00
|
|
|
#ifdef HAVE_BKTR
|
|
|
|
static void append_backtrace_information(struct ast_str **str, struct ast_bt *bt)
|
|
|
|
{
|
2018-11-08 15:53:44 +00:00
|
|
|
struct ast_vector_string *symbols;
|
2012-08-20 14:45:07 +00:00
|
|
|
int num_frames;
|
2008-05-23 22:35:50 +00:00
|
|
|
|
|
|
|
if (!bt) {
|
|
|
|
ast_str_append(str, 0, "\tNo backtrace to print\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2012-08-27 14:13:44 +00:00
|
|
|
/* store frame count locally to avoid the memory corruption that
|
|
|
|
* sometimes happens on virtualized CentOS 6.x systems */
|
2012-08-20 15:01:08 +00:00
|
|
|
num_frames = bt->num_frames;
|
2012-08-20 14:45:07 +00:00
|
|
|
if ((symbols = ast_bt_get_symbols(bt->addresses, num_frames))) {
|
2008-05-23 22:35:50 +00:00
|
|
|
int frame_iterator;
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2018-11-08 15:53:44 +00:00
|
|
|
for (frame_iterator = 1; frame_iterator < AST_VECTOR_SIZE(symbols); ++frame_iterator) {
|
|
|
|
ast_str_append(str, 0, "\t%s\n", AST_VECTOR_GET(symbols, frame_iterator));
|
2008-05-23 22:35:50 +00:00
|
|
|
}
|
2013-08-23 18:07:40 +00:00
|
|
|
|
2018-11-08 15:53:44 +00:00
|
|
|
ast_bt_free_symbols(symbols);
|
2008-05-23 22:35:50 +00:00
|
|
|
} else {
|
|
|
|
ast_str_append(str, 0, "\tCouldn't retrieve backtrace symbols\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-04-22 14:38:46 +00:00
|
|
|
static void append_lock_information(struct ast_str **str, struct thr_lock_info *lock_info, int i)
|
|
|
|
{
|
|
|
|
int j;
|
|
|
|
ast_mutex_t *lock;
|
2008-06-03 18:26:51 +00:00
|
|
|
struct ast_lock_track *lt;
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2013-09-09 20:13:40 +00:00
|
|
|
ast_str_append(str, 0, "=== ---> %sLock #%d (%s): %s %d %s %s %p (%d%s)\n",
|
2012-03-22 19:51:16 +00:00
|
|
|
lock_info->locks[i].pending > 0 ? "Waiting for " :
|
2008-04-22 14:38:46 +00:00
|
|
|
lock_info->locks[i].pending < 0 ? "Tried and failed to get " : "", i,
|
2012-03-22 19:51:16 +00:00
|
|
|
lock_info->locks[i].file,
|
2008-04-22 14:38:46 +00:00
|
|
|
locktype2str(lock_info->locks[i].type),
|
|
|
|
lock_info->locks[i].line_num,
|
|
|
|
lock_info->locks[i].func, lock_info->locks[i].lock_name,
|
2012-03-22 19:51:16 +00:00
|
|
|
lock_info->locks[i].lock_addr,
|
2013-09-09 20:13:40 +00:00
|
|
|
lock_info->locks[i].times_locked,
|
|
|
|
lock_info->locks[i].suspended ? " - suspended" : "");
|
2008-05-23 22:35:50 +00:00
|
|
|
#ifdef HAVE_BKTR
|
|
|
|
append_backtrace_information(str, lock_info->locks[i].backtrace);
|
|
|
|
#endif
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2008-04-22 14:38:46 +00:00
|
|
|
if (!lock_info->locks[i].pending || lock_info->locks[i].pending == -1)
|
|
|
|
return;
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2008-04-22 14:38:46 +00:00
|
|
|
/* We only have further details for mutexes right now */
|
|
|
|
if (lock_info->locks[i].type != AST_MUTEX)
|
|
|
|
return;
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2008-04-22 14:38:46 +00:00
|
|
|
lock = lock_info->locks[i].lock_addr;
|
2011-01-31 06:50:49 +00:00
|
|
|
lt = lock->track;
|
2008-06-03 18:26:51 +00:00
|
|
|
ast_reentrancy_lock(lt);
|
|
|
|
for (j = 0; *str && j < lt->reentrancy; j++) {
|
2008-04-22 14:38:46 +00:00
|
|
|
ast_str_append(str, 0, "=== --- ---> Locked Here: %s line %d (%s)\n",
|
2008-06-03 18:26:51 +00:00
|
|
|
lt->file[j], lt->lineno[j], lt->func[j]);
|
2008-04-22 14:38:46 +00:00
|
|
|
}
|
2012-03-22 19:51:16 +00:00
|
|
|
ast_reentrancy_unlock(lt);
|
2008-04-22 14:38:46 +00:00
|
|
|
}
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2008-04-22 14:38:46 +00:00
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
/*! This function can help you find highly temporal locks; locks that happen for a
|
2008-04-22 14:38:46 +00:00
|
|
|
short time, but at unexpected times, usually at times that create a deadlock,
|
|
|
|
Why is this thing locked right then? Who is locking it? Who am I fighting
|
2012-03-22 19:51:16 +00:00
|
|
|
with for this lock?
|
2008-04-22 14:38:46 +00:00
|
|
|
|
|
|
|
To answer such questions, just call this routine before you would normally try
|
|
|
|
to aquire a lock. It doesn't do anything if the lock is not acquired. If the
|
|
|
|
lock is taken, it will publish a line or two to the console via ast_log().
|
|
|
|
|
|
|
|
Sometimes, the lock message is pretty uninformative. For instance, you might
|
|
|
|
find that the lock is being aquired deep within the astobj2 code; this tells
|
|
|
|
you little about higher level routines that call the astobj2 routines.
|
|
|
|
But, using gdb, you can set a break at the ast_log below, and for that
|
|
|
|
breakpoint, you can set the commands:
|
|
|
|
where
|
|
|
|
cont
|
|
|
|
which will give a stack trace and continue. -- that aught to do the job!
|
|
|
|
|
|
|
|
*/
|
2013-08-15 12:12:26 +00:00
|
|
|
void ast_log_show_lock(void *this_lock_addr)
|
2008-04-16 20:54:41 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2008-04-16 20:54:41 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
2008-04-22 14:38:46 +00:00
|
|
|
struct ast_str *str;
|
|
|
|
|
|
|
|
if (!(str = ast_str_create(4096))) {
|
|
|
|
ast_log(LOG_NOTICE,"Could not create str\n");
|
|
|
|
return;
|
|
|
|
}
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2008-04-16 20:54:41 +00:00
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_infos_lock.mutex);
|
|
|
|
AST_LIST_TRAVERSE(&lock_infos, lock_info, entry) {
|
|
|
|
int i;
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
for (i = 0; str && i < lock_info->num_locks; i++) {
|
2008-04-22 14:38:46 +00:00
|
|
|
/* ONLY show info about this particular lock, if
|
|
|
|
it's acquired... */
|
2008-04-16 20:54:41 +00:00
|
|
|
if (lock_info->locks[i].lock_addr == this_lock_addr) {
|
2008-04-22 14:38:46 +00:00
|
|
|
append_lock_information(&str, lock_info, i);
|
2008-12-15 15:21:23 +00:00
|
|
|
ast_log(LOG_NOTICE, "%s", ast_str_buffer(str));
|
2008-04-22 14:38:46 +00:00
|
|
|
break;
|
2008-04-16 20:54:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock_infos_lock.mutex);
|
2008-04-22 14:38:46 +00:00
|
|
|
ast_free(str);
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2008-04-16 20:54:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-08-15 12:12:26 +00:00
|
|
|
struct ast_str *ast_dump_locks(void)
|
2007-08-03 19:41:42 +00:00
|
|
|
{
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2007-08-03 19:41:42 +00:00
|
|
|
struct thr_lock_info *lock_info;
|
2007-10-15 19:19:01 +00:00
|
|
|
struct ast_str *str;
|
|
|
|
|
2013-08-15 12:12:26 +00:00
|
|
|
if (!(str = ast_str_create(4096))) {
|
2007-08-03 19:41:42 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
ast_str_append(&str, 0, "\n"
|
2007-08-03 19:41:42 +00:00
|
|
|
"=======================================================================\n"
|
2013-05-02 06:47:16 +00:00
|
|
|
"=== %s\n"
|
|
|
|
"=== Currently Held Locks\n"
|
2007-08-03 19:41:42 +00:00
|
|
|
"=======================================================================\n"
|
|
|
|
"===\n"
|
2008-04-16 20:54:41 +00:00
|
|
|
"=== <pending> <lock#> (<file>): <lock type> <line num> <function> <lock name> <lock addr> (times locked)\n"
|
2013-05-02 06:47:16 +00:00
|
|
|
"===\n", ast_get_version());
|
2007-08-03 19:41:42 +00:00
|
|
|
|
2013-08-15 12:12:26 +00:00
|
|
|
if (!str) {
|
|
|
|
return NULL;
|
|
|
|
}
|
2007-10-15 19:25:56 +00:00
|
|
|
|
2007-08-03 19:41:42 +00:00
|
|
|
pthread_mutex_lock(&lock_infos_lock.mutex);
|
|
|
|
AST_LIST_TRAVERSE(&lock_infos, lock_info, entry) {
|
|
|
|
int i;
|
2013-09-09 20:13:40 +00:00
|
|
|
int header_printed = 0;
|
|
|
|
pthread_mutex_lock(&lock_info->lock);
|
|
|
|
for (i = 0; str && i < lock_info->num_locks; i++) {
|
|
|
|
/* Don't show suspended locks */
|
|
|
|
if (lock_info->locks[i].suspended) {
|
|
|
|
continue;
|
2008-05-12 17:55:08 +00:00
|
|
|
}
|
2013-09-09 20:13:40 +00:00
|
|
|
|
|
|
|
if (!header_printed) {
|
2014-01-24 22:34:23 +00:00
|
|
|
if (lock_info->lwp != -1) {
|
|
|
|
ast_str_append(&str, 0, "=== Thread ID: 0x%lx LWP:%d (%s)\n",
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
(long unsigned) lock_info->thread_id, lock_info->lwp, lock_info->thread_name);
|
2014-01-24 22:34:23 +00:00
|
|
|
} else {
|
|
|
|
ast_str_append(&str, 0, "=== Thread ID: 0x%lx (%s)\n",
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
(long unsigned) lock_info->thread_id, lock_info->thread_name);
|
2014-01-24 22:34:23 +00:00
|
|
|
}
|
2013-09-09 20:13:40 +00:00
|
|
|
header_printed = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
append_lock_information(&str, lock_info, i);
|
|
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock_info->lock);
|
|
|
|
if (!str) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (header_printed) {
|
2008-05-12 17:55:08 +00:00
|
|
|
ast_str_append(&str, 0, "=== -------------------------------------------------------------------\n"
|
2013-09-09 20:13:40 +00:00
|
|
|
"===\n");
|
|
|
|
}
|
|
|
|
if (!str) {
|
|
|
|
break;
|
2007-08-03 19:41:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
pthread_mutex_unlock(&lock_infos_lock.mutex);
|
|
|
|
|
2013-08-15 12:12:26 +00:00
|
|
|
if (!str) {
|
|
|
|
return NULL;
|
|
|
|
}
|
2007-10-15 19:25:56 +00:00
|
|
|
|
2007-10-15 19:19:01 +00:00
|
|
|
ast_str_append(&str, 0, "=======================================================================\n"
|
2007-08-03 19:41:42 +00:00
|
|
|
"\n");
|
|
|
|
|
2013-08-15 12:12:26 +00:00
|
|
|
return str;
|
2016-09-19 09:46:27 +00:00
|
|
|
#else /* if defined(LOW_MEMORY) */
|
|
|
|
return NULL;
|
|
|
|
#endif
|
2013-08-15 12:12:26 +00:00
|
|
|
}
|
|
|
|
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2013-08-15 12:12:26 +00:00
|
|
|
static char *handle_show_locks(struct ast_cli_entry *e, int cmd, struct ast_cli_args *a)
|
|
|
|
{
|
|
|
|
struct ast_str *str;
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case CLI_INIT:
|
|
|
|
e->command = "core show locks";
|
|
|
|
e->usage =
|
|
|
|
"Usage: core show locks\n"
|
|
|
|
" This command is for lock debugging. It prints out which locks\n"
|
|
|
|
"are owned by each active thread.\n";
|
2016-04-01 18:09:50 +00:00
|
|
|
ast_cli_allow_at_shutdown(e);
|
2013-08-15 12:12:26 +00:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
case CLI_GENERATE:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
str = ast_dump_locks();
|
|
|
|
if (!str) {
|
2007-10-15 19:25:56 +00:00
|
|
|
return CLI_FAILURE;
|
2013-08-15 12:12:26 +00:00
|
|
|
}
|
2007-10-15 19:25:56 +00:00
|
|
|
|
2008-12-15 15:21:23 +00:00
|
|
|
ast_cli(a->fd, "%s", ast_str_buffer(str));
|
2007-10-15 19:19:01 +00:00
|
|
|
|
2007-12-12 20:05:13 +00:00
|
|
|
ast_free(str);
|
2007-10-15 19:19:01 +00:00
|
|
|
|
2007-10-15 19:25:56 +00:00
|
|
|
return CLI_SUCCESS;
|
2007-08-03 19:41:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct ast_cli_entry utils_cli[] = {
|
2007-10-22 20:05:18 +00:00
|
|
|
AST_CLI_DEFINE(handle_show_locks, "Show which locks are held by which thread"),
|
2007-08-03 19:41:42 +00:00
|
|
|
};
|
2016-09-19 09:46:27 +00:00
|
|
|
#endif /* ! LOW_MEMORY */
|
2007-08-03 19:41:42 +00:00
|
|
|
#endif /* DEBUG_THREADS */
|
|
|
|
|
2016-09-19 09:46:27 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2006-04-12 20:40:46 +00:00
|
|
|
/*
|
|
|
|
* support for 'show threads'. The start routine is wrapped by
|
|
|
|
* dummy_start(), so that ast_register_thread() and
|
|
|
|
* ast_unregister_thread() know the thread identifier.
|
|
|
|
*/
|
|
|
|
struct thr_arg {
|
|
|
|
void *(*start_routine)(void *);
|
|
|
|
void *data;
|
|
|
|
char *name;
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* on OS/X, pthread_cleanup_push() and pthread_cleanup_pop()
|
|
|
|
* are odd macros which start and end a block, so they _must_ be
|
|
|
|
* used in pairs (the latter with a '1' argument to call the
|
|
|
|
* handler on exit.
|
2006-10-04 19:51:38 +00:00
|
|
|
* On BSD we don't need this, but we keep it for compatibility.
|
2006-04-12 20:40:46 +00:00
|
|
|
*/
|
|
|
|
static void *dummy_start(void *data)
|
2004-08-08 17:15:02 +00:00
|
|
|
{
|
2006-04-12 20:40:46 +00:00
|
|
|
void *ret;
|
2006-10-04 19:51:38 +00:00
|
|
|
struct thr_arg a = *((struct thr_arg *) data); /* make a local copy */
|
2007-08-03 19:41:42 +00:00
|
|
|
#ifdef DEBUG_THREADS
|
|
|
|
struct thr_lock_info *lock_info;
|
2007-12-07 21:25:03 +00:00
|
|
|
pthread_mutexattr_t mutex_attr;
|
2007-08-03 19:41:42 +00:00
|
|
|
|
|
|
|
if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
lock_info->thread_id = pthread_self();
|
2014-01-24 22:34:23 +00:00
|
|
|
lock_info->lwp = ast_get_tid();
|
2016-01-07 09:33:02 +00:00
|
|
|
lock_info->thread_name = ast_strdup(a.name);
|
2007-12-07 21:25:03 +00:00
|
|
|
|
|
|
|
pthread_mutexattr_init(&mutex_attr);
|
|
|
|
pthread_mutexattr_settype(&mutex_attr, AST_MUTEX_KIND);
|
|
|
|
pthread_mutex_init(&lock_info->lock, &mutex_attr);
|
|
|
|
pthread_mutexattr_destroy(&mutex_attr);
|
2007-08-03 19:41:42 +00:00
|
|
|
|
|
|
|
pthread_mutex_lock(&lock_infos_lock.mutex); /* Intentionally not the wrapper */
|
|
|
|
AST_LIST_INSERT_TAIL(&lock_infos, lock_info, entry);
|
|
|
|
pthread_mutex_unlock(&lock_infos_lock.mutex); /* Intentionally not the wrapper */
|
|
|
|
#endif /* DEBUG_THREADS */
|
|
|
|
|
2012-11-18 20:27:45 +00:00
|
|
|
/* note that even though data->name is a pointer to allocated memory,
|
|
|
|
we are not freeing it here because ast_register_thread is going to
|
|
|
|
keep a copy of the pointer and then ast_unregister_thread will
|
|
|
|
free the memory
|
|
|
|
*/
|
|
|
|
ast_free(data);
|
|
|
|
ast_register_thread(a.name);
|
|
|
|
pthread_cleanup_push(ast_unregister_thread, (void *) pthread_self());
|
|
|
|
|
2006-04-12 20:40:46 +00:00
|
|
|
ret = a.start_routine(a.data);
|
2007-08-03 19:41:42 +00:00
|
|
|
|
2006-04-12 20:40:46 +00:00
|
|
|
pthread_cleanup_pop(1);
|
2006-10-04 19:51:38 +00:00
|
|
|
|
2006-04-12 20:40:46 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2006-10-04 21:10:36 +00:00
|
|
|
#endif /* !LOW_MEMORY */
|
|
|
|
|
2016-09-19 09:46:27 +00:00
|
|
|
int ast_background_stacksize(void)
|
|
|
|
{
|
|
|
|
#if !defined(LOW_MEMORY)
|
|
|
|
return AST_STACKSIZE;
|
|
|
|
#else
|
|
|
|
return AST_STACKSIZE_LOW;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2006-10-04 19:51:38 +00:00
|
|
|
int ast_pthread_create_stack(pthread_t *thread, pthread_attr_t *attr, void *(*start_routine)(void *),
|
|
|
|
void *data, size_t stacksize, const char *file, const char *caller,
|
|
|
|
int line, const char *start_fn)
|
2006-04-12 20:40:46 +00:00
|
|
|
{
|
2006-10-04 21:10:36 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2006-04-12 20:40:46 +00:00
|
|
|
struct thr_arg *a;
|
2006-10-04 21:10:36 +00:00
|
|
|
#endif
|
2006-04-12 20:40:46 +00:00
|
|
|
|
2004-08-08 17:15:02 +00:00
|
|
|
if (!attr) {
|
2012-07-31 20:21:43 +00:00
|
|
|
attr = ast_alloca(sizeof(*attr));
|
2006-10-04 19:51:38 +00:00
|
|
|
pthread_attr_init(attr);
|
2004-08-08 17:15:02 +00:00
|
|
|
}
|
2006-10-04 19:51:38 +00:00
|
|
|
|
2015-09-01 15:16:55 +00:00
|
|
|
#if defined(__linux__) || defined(__FreeBSD__)
|
|
|
|
/* On Linux and FreeBSD , pthread_attr_init() defaults to PTHREAD_EXPLICIT_SCHED,
|
2005-09-29 04:08:18 +00:00
|
|
|
which is kind of useless. Change this here to
|
|
|
|
PTHREAD_INHERIT_SCHED; that way the -p option to set realtime
|
|
|
|
priority will propagate down to new threads by default.
|
|
|
|
This does mean that callers cannot set a different priority using
|
|
|
|
PTHREAD_EXPLICIT_SCHED in the attr argument; instead they must set
|
|
|
|
the priority afterwards with pthread_setschedparam(). */
|
2006-10-04 19:51:38 +00:00
|
|
|
if ((errno = pthread_attr_setinheritsched(attr, PTHREAD_INHERIT_SCHED)))
|
|
|
|
ast_log(LOG_WARNING, "pthread_attr_setinheritsched: %s\n", strerror(errno));
|
2005-09-29 04:08:18 +00:00
|
|
|
#endif
|
|
|
|
|
2005-03-04 00:01:41 +00:00
|
|
|
if (!stacksize)
|
|
|
|
stacksize = AST_STACKSIZE;
|
2006-10-04 19:51:38 +00:00
|
|
|
|
|
|
|
if ((errno = pthread_attr_setstacksize(attr, stacksize ? stacksize : AST_STACKSIZE)))
|
|
|
|
ast_log(LOG_WARNING, "pthread_attr_setstacksize: %s\n", strerror(errno));
|
|
|
|
|
2006-10-04 21:10:36 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2006-10-04 19:51:38 +00:00
|
|
|
if ((a = ast_malloc(sizeof(*a)))) {
|
2006-04-12 20:40:46 +00:00
|
|
|
a->start_routine = start_routine;
|
|
|
|
a->data = data;
|
|
|
|
start_routine = dummy_start;
|
2012-08-21 21:01:11 +00:00
|
|
|
if (ast_asprintf(&a->name, "%-20s started at [%5d] %s %s()",
|
2008-11-02 18:52:13 +00:00
|
|
|
start_fn, line, file, caller) < 0) {
|
|
|
|
a->name = NULL;
|
|
|
|
}
|
2006-04-12 20:40:46 +00:00
|
|
|
data = a;
|
|
|
|
}
|
2006-10-04 21:10:36 +00:00
|
|
|
#endif /* !LOW_MEMORY */
|
2006-10-04 19:51:38 +00:00
|
|
|
|
2004-08-08 17:15:02 +00:00
|
|
|
return pthread_create(thread, attr, start_routine, data); /* We're in ast_pthread_create, so it's okay */
|
|
|
|
}
|
2004-08-27 04:21:09 +00:00
|
|
|
|
2007-05-24 18:30:19 +00:00
|
|
|
|
|
|
|
int ast_pthread_create_detached_stack(pthread_t *thread, pthread_attr_t *attr, void *(*start_routine)(void *),
|
|
|
|
void *data, size_t stacksize, const char *file, const char *caller,
|
|
|
|
int line, const char *start_fn)
|
|
|
|
{
|
|
|
|
unsigned char attr_destroy = 0;
|
|
|
|
int res;
|
|
|
|
|
|
|
|
if (!attr) {
|
2012-07-31 20:21:43 +00:00
|
|
|
attr = ast_alloca(sizeof(*attr));
|
2007-05-24 18:30:19 +00:00
|
|
|
pthread_attr_init(attr);
|
|
|
|
attr_destroy = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((errno = pthread_attr_setdetachstate(attr, PTHREAD_CREATE_DETACHED)))
|
|
|
|
ast_log(LOG_WARNING, "pthread_attr_setdetachstate: %s\n", strerror(errno));
|
|
|
|
|
2012-03-22 19:51:16 +00:00
|
|
|
res = ast_pthread_create_stack(thread, attr, start_routine, data,
|
2007-05-24 18:30:19 +00:00
|
|
|
stacksize, file, caller, line, start_fn);
|
|
|
|
|
|
|
|
if (attr_destroy)
|
|
|
|
pthread_attr_destroy(attr);
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2005-03-05 03:20:55 +00:00
|
|
|
int ast_wait_for_input(int fd, int ms)
|
|
|
|
{
|
|
|
|
struct pollfd pfd[1];
|
2014-06-12 17:00:08 +00:00
|
|
|
|
|
|
|
memset(pfd, 0, sizeof(pfd));
|
|
|
|
pfd[0].fd = fd;
|
|
|
|
pfd[0].events = POLLIN | POLLPRI;
|
|
|
|
return ast_poll(pfd, 1, ms);
|
|
|
|
}
|
|
|
|
|
|
|
|
int ast_wait_for_output(int fd, int ms)
|
|
|
|
{
|
|
|
|
struct pollfd pfd[1];
|
|
|
|
|
2005-03-05 03:20:55 +00:00
|
|
|
memset(pfd, 0, sizeof(pfd));
|
|
|
|
pfd[0].fd = fd;
|
2014-06-12 17:00:08 +00:00
|
|
|
pfd[0].events = POLLOUT;
|
Merged revisions 182810 via svnmerge from
https://origsvn.digium.com/svn/asterisk/branches/1.4
........
r182810 | russell | 2009-03-17 21:09:13 -0500 (Tue, 17 Mar 2009) | 44 lines
Fix cases where the internal poll() was not being used when it needed to be.
We have seen a number of problems caused by poll() not working properly on
Mac OSX. If you search around, you'll find a number of references to using
select() instead of poll() to work around these issues. In Asterisk, we've
had poll.c which implements poll() using select() internally. However, we
were still getting reports of problems.
vadim investigated a bit and realized that at least on his system, even
though we were compiling in poll.o, the system poll() was still being used.
So, the primary purpose of this patch is to ensure that we're using the
internal poll() when we want it to be used.
The changes are:
1) Remove logic for when internal poll should be used from the Makefile.
Instead, put it in the configure script. The logic in the configure
script is the same as it was in the Makefile. Ideally, we would have
a functionality test for the problem, but that's not actually possible,
since we would have to be able to run an application on the _target_
system to test poll() behavior.
2) Always include poll.o in the build, but it will be empty if AST_POLL_COMPAT
is not defined.
3) Change uses of poll() throughout the source tree to ast_poll(). I feel
that it is good practice to give the API call a new name when we are
changing its behavior and not using the system version directly in all cases.
So, normally, ast_poll() is just redefined to poll(). On systems where
AST_POLL_COMPAT is defined, ast_poll() is redefined to ast_internal_poll().
4) Change poll() in main/poll.c to be ast_internal_poll().
It's worth noting that any code that still uses poll() directly will work fine
(if they worked fine before). So, for example, out of tree modules that are
using poll() will not stop working or anything. However, for modules to work
properly on Mac OSX, ast_poll() needs to be used.
(closes issue #13404)
Reported by: agalbraith
Tested by: russell, vadim
http://reviewboard.digium.com/r/198/
........
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@182847 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2009-03-18 02:28:55 +00:00
|
|
|
return ast_poll(pfd, 1, ms);
|
2005-03-05 03:20:55 +00:00
|
|
|
}
|
|
|
|
|
2014-06-12 17:00:08 +00:00
|
|
|
static int wait_for_output(int fd, int timeoutms)
|
2008-12-22 17:09:36 +00:00
|
|
|
{
|
|
|
|
struct pollfd pfd = {
|
|
|
|
.fd = fd,
|
|
|
|
.events = POLLOUT,
|
|
|
|
};
|
|
|
|
int res;
|
2008-12-22 17:29:10 +00:00
|
|
|
struct timeval start = ast_tvnow();
|
|
|
|
int elapsed = 0;
|
2008-12-22 17:09:36 +00:00
|
|
|
|
|
|
|
/* poll() until the fd is writable without blocking */
|
Merged revisions 182810 via svnmerge from
https://origsvn.digium.com/svn/asterisk/branches/1.4
........
r182810 | russell | 2009-03-17 21:09:13 -0500 (Tue, 17 Mar 2009) | 44 lines
Fix cases where the internal poll() was not being used when it needed to be.
We have seen a number of problems caused by poll() not working properly on
Mac OSX. If you search around, you'll find a number of references to using
select() instead of poll() to work around these issues. In Asterisk, we've
had poll.c which implements poll() using select() internally. However, we
were still getting reports of problems.
vadim investigated a bit and realized that at least on his system, even
though we were compiling in poll.o, the system poll() was still being used.
So, the primary purpose of this patch is to ensure that we're using the
internal poll() when we want it to be used.
The changes are:
1) Remove logic for when internal poll should be used from the Makefile.
Instead, put it in the configure script. The logic in the configure
script is the same as it was in the Makefile. Ideally, we would have
a functionality test for the problem, but that's not actually possible,
since we would have to be able to run an application on the _target_
system to test poll() behavior.
2) Always include poll.o in the build, but it will be empty if AST_POLL_COMPAT
is not defined.
3) Change uses of poll() throughout the source tree to ast_poll(). I feel
that it is good practice to give the API call a new name when we are
changing its behavior and not using the system version directly in all cases.
So, normally, ast_poll() is just redefined to poll(). On systems where
AST_POLL_COMPAT is defined, ast_poll() is redefined to ast_internal_poll().
4) Change poll() in main/poll.c to be ast_internal_poll().
It's worth noting that any code that still uses poll() directly will work fine
(if they worked fine before). So, for example, out of tree modules that are
using poll() will not stop working or anything. However, for modules to work
properly on Mac OSX, ast_poll() needs to be used.
(closes issue #13404)
Reported by: agalbraith
Tested by: russell, vadim
http://reviewboard.digium.com/r/198/
........
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@182847 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2009-03-18 02:28:55 +00:00
|
|
|
while ((res = ast_poll(&pfd, 1, timeoutms - elapsed)) <= 0) {
|
2008-12-22 17:09:36 +00:00
|
|
|
if (res == 0) {
|
|
|
|
/* timed out. */
|
2010-01-05 17:26:50 +00:00
|
|
|
#ifndef STANDALONE
|
2010-01-05 17:16:01 +00:00
|
|
|
ast_debug(1, "Timed out trying to write\n");
|
2010-01-05 17:26:50 +00:00
|
|
|
#endif
|
2008-12-22 17:09:36 +00:00
|
|
|
return -1;
|
|
|
|
} else if (res == -1) {
|
|
|
|
/* poll() returned an error, check to see if it was fatal */
|
|
|
|
|
|
|
|
if (errno == EINTR || errno == EAGAIN) {
|
2008-12-22 17:29:10 +00:00
|
|
|
elapsed = ast_tvdiff_ms(ast_tvnow(), start);
|
|
|
|
if (elapsed >= timeoutms) {
|
|
|
|
return -1;
|
|
|
|
}
|
2008-12-22 17:09:36 +00:00
|
|
|
/* This was an acceptable error, go back into poll() */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Fatal error, bail. */
|
|
|
|
ast_log(LOG_ERROR, "poll returned error: %s\n", strerror(errno));
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
2008-12-22 17:29:10 +00:00
|
|
|
elapsed = ast_tvdiff_ms(ast_tvnow(), start);
|
|
|
|
if (elapsed >= timeoutms) {
|
|
|
|
return -1;
|
|
|
|
}
|
2008-12-22 17:09:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-11-07 08:34:26 +00:00
|
|
|
/*!
|
|
|
|
* Try to write string, but wait no more than ms milliseconds before timing out.
|
|
|
|
*
|
|
|
|
* \note The code assumes that the file descriptor has NONBLOCK set,
|
|
|
|
* so there is only one system call made to do a write, unless we actually
|
|
|
|
* have a need to wait. This way, we get better performance.
|
|
|
|
* If the descriptor is blocking, all assumptions on the guaranteed
|
|
|
|
* detail do not apply anymore.
|
|
|
|
*/
|
2012-03-22 19:51:16 +00:00
|
|
|
int ast_carefulwrite(int fd, char *s, int len, int timeoutms)
|
2006-05-05 21:01:39 +00:00
|
|
|
{
|
2008-12-22 17:29:10 +00:00
|
|
|
struct timeval start = ast_tvnow();
|
2006-05-05 21:01:39 +00:00
|
|
|
int res = 0;
|
2008-12-22 17:29:10 +00:00
|
|
|
int elapsed = 0;
|
2008-12-18 21:44:47 +00:00
|
|
|
|
2006-05-05 21:01:39 +00:00
|
|
|
while (len) {
|
2014-06-12 17:00:08 +00:00
|
|
|
if (wait_for_output(fd, timeoutms - elapsed)) {
|
2008-12-22 17:09:36 +00:00
|
|
|
return -1;
|
2008-12-18 21:44:47 +00:00
|
|
|
}
|
|
|
|
|
2006-05-05 21:01:39 +00:00
|
|
|
res = write(fd, s, len);
|
2008-12-18 21:44:47 +00:00
|
|
|
|
|
|
|
if (res < 0 && errno != EAGAIN && errno != EINTR) {
|
|
|
|
/* fatal error from write() */
|
main/utils: Don't emit an ERROR message if the read end of a pipe closes
An ERROR or WARNING message should generally indicate that something has gone
wrong in Asterisk. In the case of writing to a file descriptor, Asterisk is not
in control of when the far end closes its reading on a file descriptor. If the
far end does close the file descriptor in an unclean fashion, this isn't a bug
or error in Asterisk, particularly when the situation can be gracefully
handled in Asterisk.
Currently, when this happens, a user would see the following somewhat cryptic
ERROR message:
"utils.c: write() returned error: Broken pipe"
There's a few problems with this:
(1) It doesn't provide any context, other than 'something broke a pipe'
(2) As noted, it isn't actually an error in Asterisk
(3) It can get rather spammy if the thing breaking the pipe occurs often, such
as a FastAGI server
(4) Spammy ERROR messages make Asterisk appear to be having issues, or can even
mask legitimate issues
This patch changes ast_carefulwrite to only log an ERROR if we actually had one
that was reasonably under our control. For debugging purposes, we still emit
a debug message if we detect that the far side has stopped reading.
Change-Id: Ia503bb1efcec685fa6f3017bedf98061f8e1b566
2015-12-13 19:13:55 +00:00
|
|
|
if (errno == EPIPE) {
|
|
|
|
#ifndef STANDALONE
|
|
|
|
ast_debug(1, "write() failed due to reading end being closed: %s\n", strerror(errno));
|
|
|
|
#endif
|
|
|
|
} else {
|
|
|
|
ast_log(LOG_ERROR, "write() returned error: %s\n", strerror(errno));
|
|
|
|
}
|
2006-05-05 21:01:39 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2008-12-18 21:44:47 +00:00
|
|
|
|
|
|
|
if (res < 0) {
|
|
|
|
/* It was an acceptable error */
|
2006-05-05 21:01:39 +00:00
|
|
|
res = 0;
|
2008-12-18 21:44:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Update how much data we have left to write */
|
2006-05-05 21:01:39 +00:00
|
|
|
len -= res;
|
|
|
|
s += res;
|
|
|
|
res = 0;
|
2008-12-22 17:29:10 +00:00
|
|
|
|
|
|
|
elapsed = ast_tvdiff_ms(ast_tvnow(), start);
|
|
|
|
if (elapsed >= timeoutms) {
|
2012-03-22 19:51:16 +00:00
|
|
|
/* We've taken too long to write
|
2008-12-22 17:29:10 +00:00
|
|
|
* This is only an error condition if we haven't finished writing. */
|
|
|
|
res = len ? -1 : 0;
|
|
|
|
break;
|
|
|
|
}
|
2006-05-05 21:01:39 +00:00
|
|
|
}
|
2008-12-18 21:44:47 +00:00
|
|
|
|
2006-05-05 21:01:39 +00:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2005-06-24 22:45:15 +00:00
|
|
|
char *ast_strip_quoted(char *s, const char *beg_quotes, const char *end_quotes)
|
|
|
|
{
|
|
|
|
char *e;
|
|
|
|
char *q;
|
|
|
|
|
|
|
|
s = ast_strip(s);
|
2007-01-17 20:57:51 +00:00
|
|
|
if ((q = strchr(beg_quotes, *s)) && *q != '\0') {
|
2005-06-24 22:45:15 +00:00
|
|
|
e = s + strlen(s) - 1;
|
|
|
|
if (*e == *(end_quotes + (q - beg_quotes))) {
|
|
|
|
s++;
|
|
|
|
*e = '\0';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2014-09-18 19:23:39 +00:00
|
|
|
char *ast_strsep(char **iss, const char sep, uint32_t flags)
|
|
|
|
{
|
|
|
|
char *st = *iss;
|
|
|
|
char *is;
|
|
|
|
int inquote = 0;
|
|
|
|
int found = 0;
|
|
|
|
char stack[8];
|
|
|
|
|
2017-07-28 01:58:22 +00:00
|
|
|
if (ast_strlen_zero(st)) {
|
2014-09-18 19:23:39 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
memset(stack, 0, sizeof(stack));
|
|
|
|
|
|
|
|
for(is = st; *is; is++) {
|
|
|
|
if (*is == '\\') {
|
|
|
|
if (*++is != '\0') {
|
|
|
|
is++;
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (*is == '\'' || *is == '"') {
|
|
|
|
if (*is == stack[inquote]) {
|
|
|
|
stack[inquote--] = '\0';
|
|
|
|
} else {
|
|
|
|
if (++inquote >= sizeof(stack)) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
stack[inquote] = *is;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (*is == sep && !inquote) {
|
|
|
|
*is = '\0';
|
|
|
|
found = 1;
|
|
|
|
*iss = is + 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!found) {
|
|
|
|
*iss = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & AST_STRSEP_STRIP) {
|
|
|
|
st = ast_strip_quoted(st, "'\"", "'\"");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & AST_STRSEP_TRIM) {
|
|
|
|
st = ast_strip(st);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & AST_STRSEP_UNESCAPE) {
|
|
|
|
ast_unescape_quoted(st);
|
|
|
|
}
|
|
|
|
|
|
|
|
return st;
|
|
|
|
}
|
|
|
|
|
2007-08-17 19:13:25 +00:00
|
|
|
char *ast_unescape_semicolon(char *s)
|
|
|
|
{
|
|
|
|
char *e;
|
|
|
|
char *work = s;
|
|
|
|
|
|
|
|
while ((e = strchr(work, ';'))) {
|
|
|
|
if ((e > work) && (*(e-1) == '\\')) {
|
|
|
|
memmove(e - 1, e, strlen(e) + 1);
|
|
|
|
work = e;
|
2007-10-29 14:29:18 +00:00
|
|
|
} else {
|
|
|
|
work = e + 1;
|
2007-08-17 19:13:25 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2007-12-19 17:09:01 +00:00
|
|
|
/* !\brief unescape some C sequences in place, return pointer to the original string.
|
|
|
|
*/
|
|
|
|
char *ast_unescape_c(char *src)
|
|
|
|
{
|
|
|
|
char c, *ret, *dst;
|
|
|
|
|
|
|
|
if (src == NULL)
|
|
|
|
return NULL;
|
|
|
|
for (ret = dst = src; (c = *src++); *dst++ = c ) {
|
|
|
|
if (c != '\\')
|
|
|
|
continue; /* copy char at the end of the loop */
|
|
|
|
switch ((c = *src++)) {
|
|
|
|
case '\0': /* special, trailing '\' */
|
|
|
|
c = '\\';
|
|
|
|
break;
|
|
|
|
case 'b': /* backspace */
|
|
|
|
c = '\b';
|
|
|
|
break;
|
|
|
|
case 'f': /* form feed */
|
|
|
|
c = '\f';
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
c = '\n';
|
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
c = '\r';
|
|
|
|
break;
|
|
|
|
case 't':
|
|
|
|
c = '\t';
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* default, use the char literally */
|
|
|
|
}
|
|
|
|
*dst = '\0';
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
/*
|
|
|
|
* Standard escape sequences - Note, '\0' is not included as a valid character
|
|
|
|
* to escape, but instead is used here as a NULL terminator for the string.
|
|
|
|
*/
|
|
|
|
char escape_sequences[] = {
|
|
|
|
'\a', '\b', '\f', '\n', '\r', '\t', '\v', '\\', '\'', '\"', '\?', '\0'
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Standard escape sequences output map (has to maintain matching order with
|
|
|
|
* escape_sequences). '\0' is included here as a NULL terminator for the string.
|
|
|
|
*/
|
|
|
|
static char escape_sequences_map[] = {
|
|
|
|
'a', 'b', 'f', 'n', 'r', 't', 'v', '\\', '\'', '"', '?', '\0'
|
|
|
|
};
|
|
|
|
|
2015-07-15 20:40:32 +00:00
|
|
|
char *ast_escape(char *dest, const char *s, size_t size, const char *to_escape)
|
2015-06-08 14:44:04 +00:00
|
|
|
{
|
|
|
|
char *p;
|
2015-07-15 20:40:32 +00:00
|
|
|
char *c;
|
2015-06-08 14:44:04 +00:00
|
|
|
|
2015-07-15 20:40:32 +00:00
|
|
|
if (!dest || !size) {
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
if (ast_strlen_zero(s)) {
|
|
|
|
*dest = '\0';
|
2015-06-08 14:44:04 +00:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ast_strlen_zero(to_escape)) {
|
2015-07-15 20:40:32 +00:00
|
|
|
ast_copy_string(dest, s, size);
|
2015-06-08 14:44:04 +00:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
2015-07-15 20:40:32 +00:00
|
|
|
for (p = dest; *s && --size; ++s, ++p) {
|
2015-06-08 14:44:04 +00:00
|
|
|
/* If in the list of characters to escape then escape it */
|
|
|
|
if (strchr(to_escape, *s)) {
|
2015-07-15 20:40:32 +00:00
|
|
|
if (!--size) {
|
|
|
|
/* Not enough room left for the escape sequence. */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
/*
|
|
|
|
* See if the character to escape is part of the standard escape
|
|
|
|
* sequences. If so we'll have to use its mapped counterpart
|
|
|
|
* otherwise just use the current character.
|
|
|
|
*/
|
2015-07-15 20:40:32 +00:00
|
|
|
c = strchr(escape_sequences, *s);
|
2015-06-08 14:44:04 +00:00
|
|
|
*p++ = '\\';
|
|
|
|
*p = c ? escape_sequences_map[c - escape_sequences] : *s;
|
|
|
|
} else {
|
|
|
|
*p = *s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*p = '\0';
|
2015-07-15 20:40:32 +00:00
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
2015-07-15 20:40:32 +00:00
|
|
|
char *ast_escape_c(char *dest, const char *s, size_t size)
|
2015-06-08 14:44:04 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Note - This is an optimized version of ast_escape. When looking only
|
|
|
|
* for escape_sequences a couple of checks used in the generic case can
|
|
|
|
* be left out thus making it slightly more efficient.
|
|
|
|
*/
|
|
|
|
char *p;
|
2015-07-15 20:40:32 +00:00
|
|
|
char *c;
|
2015-06-08 14:44:04 +00:00
|
|
|
|
2015-07-15 20:40:32 +00:00
|
|
|
if (!dest || !size) {
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
if (ast_strlen_zero(s)) {
|
|
|
|
*dest = '\0';
|
2015-06-08 14:44:04 +00:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
2015-07-15 20:40:32 +00:00
|
|
|
for (p = dest; *s && --size; ++s, ++p) {
|
2015-06-08 14:44:04 +00:00
|
|
|
/*
|
|
|
|
* See if the character to escape is part of the standard escape
|
|
|
|
* sequences. If so use its mapped counterpart.
|
|
|
|
*/
|
2015-07-15 20:40:32 +00:00
|
|
|
c = strchr(escape_sequences, *s);
|
2015-06-08 14:44:04 +00:00
|
|
|
if (c) {
|
2015-07-15 20:40:32 +00:00
|
|
|
if (!--size) {
|
|
|
|
/* Not enough room left for the escape sequence. */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
*p++ = '\\';
|
|
|
|
*p = escape_sequences_map[c - escape_sequences];
|
|
|
|
} else {
|
|
|
|
*p = *s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*p = '\0';
|
2015-07-15 20:40:32 +00:00
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
static char *escape_alloc(const char *s, size_t *size)
|
|
|
|
{
|
2015-07-15 20:40:32 +00:00
|
|
|
if (!s) {
|
2015-06-08 14:44:04 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The result string needs to be twice the size of the given
|
|
|
|
* string just in case every character in it needs to be escaped.
|
|
|
|
*/
|
2015-07-15 20:40:32 +00:00
|
|
|
*size = strlen(s) * 2 + 1;
|
|
|
|
return ast_malloc(*size);
|
2015-06-08 14:44:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
char *ast_escape_alloc(const char *s, const char *to_escape)
|
|
|
|
{
|
|
|
|
size_t size = 0;
|
|
|
|
char *dest = escape_alloc(s, &size);
|
2015-07-15 20:40:32 +00:00
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
return ast_escape(dest, s, size, to_escape);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *ast_escape_c_alloc(const char *s)
|
|
|
|
{
|
|
|
|
size_t size = 0;
|
|
|
|
char *dest = escape_alloc(s, &size);
|
2015-07-15 20:40:32 +00:00
|
|
|
|
2015-06-08 14:44:04 +00:00
|
|
|
return ast_escape_c(dest, s, size);
|
|
|
|
}
|
|
|
|
|
2005-10-01 15:41:27 +00:00
|
|
|
int ast_build_string_va(char **buffer, size_t *space, const char *fmt, va_list ap)
|
2005-05-15 22:33:02 +00:00
|
|
|
{
|
|
|
|
int result;
|
|
|
|
|
|
|
|
if (!buffer || !*buffer || !space || !*space)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
result = vsnprintf(*buffer, *space, fmt, ap);
|
|
|
|
|
|
|
|
if (result < 0)
|
|
|
|
return -1;
|
|
|
|
else if (result > *space)
|
|
|
|
result = *space;
|
|
|
|
|
|
|
|
*buffer += result;
|
|
|
|
*space -= result;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-10-01 15:41:27 +00:00
|
|
|
int ast_build_string(char **buffer, size_t *space, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
int result;
|
|
|
|
|
|
|
|
va_start(ap, fmt);
|
|
|
|
result = ast_build_string_va(buffer, space, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2012-06-08 21:08:17 +00:00
|
|
|
int ast_regex_string_to_regex_pattern(const char *regex_string, struct ast_str **regex_pattern)
|
2012-04-03 19:31:25 +00:00
|
|
|
{
|
|
|
|
int regex_len = strlen(regex_string);
|
|
|
|
int ret = 3;
|
|
|
|
|
|
|
|
/* Chop off the leading / if there is one */
|
|
|
|
if ((regex_len >= 1) && (regex_string[0] == '/')) {
|
2012-06-08 21:08:17 +00:00
|
|
|
ast_str_set(regex_pattern, 0, "%s", regex_string + 1);
|
2012-04-03 19:31:25 +00:00
|
|
|
ret -= 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Chop off the ending / if there is one */
|
|
|
|
if ((regex_len > 1) && (regex_string[regex_len - 1] == '/')) {
|
2012-06-08 21:08:17 +00:00
|
|
|
ast_str_truncate(*regex_pattern, -1);
|
2012-04-03 19:31:25 +00:00
|
|
|
ret -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2005-06-24 22:45:15 +00:00
|
|
|
int ast_true(const char *s)
|
|
|
|
{
|
2005-10-26 18:54:24 +00:00
|
|
|
if (ast_strlen_zero(s))
|
2005-06-24 22:45:15 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Determine if this is a true value */
|
|
|
|
if (!strcasecmp(s, "yes") ||
|
|
|
|
!strcasecmp(s, "true") ||
|
|
|
|
!strcasecmp(s, "y") ||
|
|
|
|
!strcasecmp(s, "t") ||
|
|
|
|
!strcasecmp(s, "1") ||
|
|
|
|
!strcasecmp(s, "on"))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ast_false(const char *s)
|
|
|
|
{
|
2005-10-26 18:54:24 +00:00
|
|
|
if (ast_strlen_zero(s))
|
2005-06-24 22:45:15 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Determine if this is a false value */
|
|
|
|
if (!strcasecmp(s, "no") ||
|
|
|
|
!strcasecmp(s, "false") ||
|
|
|
|
!strcasecmp(s, "n") ||
|
|
|
|
!strcasecmp(s, "f") ||
|
|
|
|
!strcasecmp(s, "0") ||
|
|
|
|
!strcasecmp(s, "off"))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-07-15 23:00:47 +00:00
|
|
|
#define ONE_MILLION 1000000
|
|
|
|
/*
|
|
|
|
* put timeval in a valid range. usec is 0..999999
|
|
|
|
* negative values are not allowed and truncated.
|
|
|
|
*/
|
|
|
|
static struct timeval tvfix(struct timeval a)
|
|
|
|
{
|
|
|
|
if (a.tv_usec >= ONE_MILLION) {
|
2005-08-23 17:55:59 +00:00
|
|
|
ast_log(LOG_WARNING, "warning too large timestamp %ld.%ld\n",
|
2008-05-15 10:56:29 +00:00
|
|
|
(long)a.tv_sec, (long int) a.tv_usec);
|
2005-12-13 16:07:19 +00:00
|
|
|
a.tv_sec += a.tv_usec / ONE_MILLION;
|
2005-07-15 23:00:47 +00:00
|
|
|
a.tv_usec %= ONE_MILLION;
|
|
|
|
} else if (a.tv_usec < 0) {
|
2005-07-19 15:32:03 +00:00
|
|
|
ast_log(LOG_WARNING, "warning negative timestamp %ld.%ld\n",
|
2008-05-15 10:56:29 +00:00
|
|
|
(long)a.tv_sec, (long int) a.tv_usec);
|
2005-07-15 23:00:47 +00:00
|
|
|
a.tv_usec = 0;
|
|
|
|
}
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct timeval ast_tvadd(struct timeval a, struct timeval b)
|
|
|
|
{
|
|
|
|
/* consistency checks to guarantee usec in 0..999999 */
|
|
|
|
a = tvfix(a);
|
|
|
|
b = tvfix(b);
|
|
|
|
a.tv_sec += b.tv_sec;
|
|
|
|
a.tv_usec += b.tv_usec;
|
|
|
|
if (a.tv_usec >= ONE_MILLION) {
|
|
|
|
a.tv_sec++;
|
|
|
|
a.tv_usec -= ONE_MILLION;
|
|
|
|
}
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct timeval ast_tvsub(struct timeval a, struct timeval b)
|
|
|
|
{
|
|
|
|
/* consistency checks to guarantee usec in 0..999999 */
|
|
|
|
a = tvfix(a);
|
|
|
|
b = tvfix(b);
|
|
|
|
a.tv_sec -= b.tv_sec;
|
|
|
|
a.tv_usec -= b.tv_usec;
|
|
|
|
if (a.tv_usec < 0) {
|
|
|
|
a.tv_sec-- ;
|
|
|
|
a.tv_usec += ONE_MILLION;
|
|
|
|
}
|
|
|
|
return a;
|
|
|
|
}
|
2012-11-07 19:15:26 +00:00
|
|
|
|
|
|
|
int ast_remaining_ms(struct timeval start, int max_ms)
|
|
|
|
{
|
|
|
|
int ms;
|
|
|
|
|
|
|
|
if (max_ms < 0) {
|
|
|
|
ms = max_ms;
|
|
|
|
} else {
|
|
|
|
ms = max_ms - ast_tvdiff_ms(ast_tvnow(), start);
|
|
|
|
if (ms < 0) {
|
|
|
|
ms = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ms;
|
|
|
|
}
|
|
|
|
|
2013-06-17 03:00:38 +00:00
|
|
|
void ast_format_duration_hh_mm_ss(int duration, char *buf, size_t length)
|
|
|
|
{
|
|
|
|
int durh, durm, durs;
|
|
|
|
durh = duration / 3600;
|
|
|
|
durm = (duration % 3600) / 60;
|
|
|
|
durs = duration % 60;
|
|
|
|
snprintf(buf, length, "%02d:%02d:%02d", durh, durm, durs);
|
|
|
|
}
|
|
|
|
|
2005-07-15 23:00:47 +00:00
|
|
|
#undef ONE_MILLION
|
|
|
|
|
2007-07-21 14:39:52 +00:00
|
|
|
#ifndef linux
|
2006-01-10 08:33:52 +00:00
|
|
|
AST_MUTEX_DEFINE_STATIC(randomlock);
|
2007-07-21 14:39:52 +00:00
|
|
|
#endif
|
2006-01-10 08:33:52 +00:00
|
|
|
|
2006-01-10 00:55:45 +00:00
|
|
|
long int ast_random(void)
|
|
|
|
{
|
|
|
|
long int res;
|
2012-12-13 16:18:52 +00:00
|
|
|
|
2007-07-21 14:39:52 +00:00
|
|
|
if (dev_urandom_fd >= 0) {
|
|
|
|
int read_res = read(dev_urandom_fd, &res, sizeof(res));
|
2007-11-26 15:28:13 +00:00
|
|
|
if (read_res > 0) {
|
2007-11-27 17:01:19 +00:00
|
|
|
long int rm = RAND_MAX;
|
2007-11-26 15:28:13 +00:00
|
|
|
res = res < 0 ? ~res : res;
|
2007-11-27 17:01:19 +00:00
|
|
|
rm++;
|
|
|
|
return res % rm;
|
2007-11-26 15:28:13 +00:00
|
|
|
}
|
2007-07-21 14:39:52 +00:00
|
|
|
}
|
2012-12-13 16:18:52 +00:00
|
|
|
|
2012-11-29 17:16:50 +00:00
|
|
|
/* XXX - Thread safety really depends on the libc, not the OS.
|
|
|
|
*
|
|
|
|
* But... popular Linux libc's (uClibc, glibc, eglibc), all have a
|
|
|
|
* somewhat thread safe random(3) (results are random, but not
|
|
|
|
* reproducible). The libc's for other systems (BSD, et al.), not so
|
|
|
|
* much.
|
|
|
|
*/
|
2007-07-21 14:39:52 +00:00
|
|
|
#ifdef linux
|
|
|
|
res = random();
|
|
|
|
#else
|
2006-01-10 00:55:45 +00:00
|
|
|
ast_mutex_lock(&randomlock);
|
|
|
|
res = random();
|
|
|
|
ast_mutex_unlock(&randomlock);
|
2007-07-21 14:39:52 +00:00
|
|
|
#endif
|
2006-01-10 00:55:45 +00:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2012-03-22 21:25:22 +00:00
|
|
|
void ast_replace_subargument_delimiter(char *s)
|
|
|
|
{
|
|
|
|
for (; *s; s++) {
|
|
|
|
if (*s == '^') {
|
|
|
|
*s = ',';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-09-23 02:57:14 +00:00
|
|
|
char *ast_process_quotes_and_slashes(char *start, char find, char replace_with)
|
|
|
|
{
|
2012-03-22 19:51:16 +00:00
|
|
|
char *dataPut = start;
|
2005-09-23 02:57:14 +00:00
|
|
|
int inEscape = 0;
|
|
|
|
int inQuotes = 0;
|
|
|
|
|
|
|
|
for (; *start; start++) {
|
|
|
|
if (inEscape) {
|
|
|
|
*dataPut++ = *start; /* Always goes verbatim */
|
|
|
|
inEscape = 0;
|
2006-07-10 19:05:48 +00:00
|
|
|
} else {
|
2005-09-23 02:57:14 +00:00
|
|
|
if (*start == '\\') {
|
|
|
|
inEscape = 1; /* Do not copy \ into the data */
|
|
|
|
} else if (*start == '\'') {
|
2006-07-10 19:05:48 +00:00
|
|
|
inQuotes = 1 - inQuotes; /* Do not copy ' into the data */
|
2005-09-23 02:57:14 +00:00
|
|
|
} else {
|
|
|
|
/* Replace , with |, unless in quotes */
|
2006-07-10 19:05:48 +00:00
|
|
|
*dataPut++ = inQuotes ? *start : ((*start == find) ? replace_with : *start);
|
2005-09-23 02:57:14 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (start != dataPut)
|
|
|
|
*dataPut = 0;
|
|
|
|
return dataPut;
|
|
|
|
}
|
2005-12-20 20:20:04 +00:00
|
|
|
|
2013-11-23 17:26:57 +00:00
|
|
|
void ast_join_delim(char *s, size_t len, const char * const w[], unsigned int size, char delim)
|
2005-12-20 20:20:04 +00:00
|
|
|
{
|
|
|
|
int x, ofs = 0;
|
|
|
|
const char *src;
|
|
|
|
|
|
|
|
/* Join words into a string */
|
|
|
|
if (!s)
|
|
|
|
return;
|
2015-02-06 21:26:46 +00:00
|
|
|
for (x = 0; ofs < len && x < size && w[x] ; x++) {
|
2005-12-20 20:20:04 +00:00
|
|
|
if (x > 0)
|
2013-11-23 17:26:57 +00:00
|
|
|
s[ofs++] = delim;
|
2005-12-20 20:20:04 +00:00
|
|
|
for (src = w[x]; *src && ofs < len; src++)
|
|
|
|
s[ofs++] = *src;
|
|
|
|
}
|
|
|
|
if (ofs == len)
|
|
|
|
ofs--;
|
|
|
|
s[ofs] = '\0';
|
|
|
|
}
|
2006-01-04 21:54:09 +00:00
|
|
|
|
2013-11-23 17:26:57 +00:00
|
|
|
char *ast_to_camel_case_delim(const char *s, const char *delim)
|
|
|
|
{
|
|
|
|
char *res = ast_strdup(s);
|
|
|
|
char *front, *back, *buf = res;
|
|
|
|
int size;
|
|
|
|
|
|
|
|
front = strtok_r(buf, delim, &back);
|
|
|
|
|
|
|
|
while (front) {
|
|
|
|
size = strlen(front);
|
|
|
|
*front = toupper(*front);
|
|
|
|
ast_copy_string(buf, front, size + 1);
|
|
|
|
buf += size;
|
|
|
|
front = strtok_r(NULL, delim, &back);
|
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2007-07-18 19:47:20 +00:00
|
|
|
/*! \brief
|
|
|
|
* get values from config variables.
|
|
|
|
*/
|
|
|
|
int ast_get_timeval(const char *src, struct timeval *dst, struct timeval _default, int *consumed)
|
|
|
|
{
|
|
|
|
long double dtv = 0.0;
|
|
|
|
int scanned;
|
|
|
|
|
|
|
|
if (dst == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*dst = _default;
|
|
|
|
|
|
|
|
if (ast_strlen_zero(src))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* only integer at the moment, but one day we could accept more formats */
|
2009-08-10 19:20:57 +00:00
|
|
|
if (sscanf(src, "%30Lf%n", &dtv, &scanned) > 0) {
|
2007-07-18 19:47:20 +00:00
|
|
|
dst->tv_sec = dtv;
|
|
|
|
dst->tv_usec = (dtv - dst->tv_sec) * 1000000.0;
|
|
|
|
if (consumed)
|
|
|
|
*consumed = scanned;
|
|
|
|
return 0;
|
|
|
|
} else
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2006-03-07 17:55:33 +00:00
|
|
|
/*! \brief
|
2006-02-15 00:24:24 +00:00
|
|
|
* get values from config variables.
|
|
|
|
*/
|
2006-02-23 17:13:57 +00:00
|
|
|
int ast_get_time_t(const char *src, time_t *dst, time_t _default, int *consumed)
|
2006-02-15 00:24:24 +00:00
|
|
|
{
|
|
|
|
long t;
|
2006-02-23 17:13:57 +00:00
|
|
|
int scanned;
|
2006-02-15 00:24:24 +00:00
|
|
|
|
|
|
|
if (dst == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*dst = _default;
|
|
|
|
|
|
|
|
if (ast_strlen_zero(src))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* only integer at the moment, but one day we could accept more formats */
|
2009-08-10 19:20:57 +00:00
|
|
|
if (sscanf(src, "%30ld%n", &t, &scanned) == 1) {
|
2006-02-15 00:24:24 +00:00
|
|
|
*dst = t;
|
2006-02-23 17:13:57 +00:00
|
|
|
if (consumed)
|
|
|
|
*consumed = scanned;
|
2006-02-15 00:24:24 +00:00
|
|
|
return 0;
|
|
|
|
} else
|
|
|
|
return -1;
|
|
|
|
}
|
2006-07-10 19:05:48 +00:00
|
|
|
|
2006-10-12 18:43:52 +00:00
|
|
|
void ast_enable_packet_fragmentation(int sock)
|
|
|
|
{
|
2006-10-13 15:47:42 +00:00
|
|
|
#if defined(HAVE_IP_MTU_DISCOVER)
|
2006-10-12 18:43:52 +00:00
|
|
|
int val = IP_PMTUDISC_DONT;
|
2012-03-22 19:51:16 +00:00
|
|
|
|
2006-10-12 18:43:52 +00:00
|
|
|
if (setsockopt(sock, IPPROTO_IP, IP_MTU_DISCOVER, &val, sizeof(val)))
|
|
|
|
ast_log(LOG_WARNING, "Unable to disable PMTU discovery. Large UDP packets may fail to be delivered when sent from this socket.\n");
|
2006-10-13 15:47:42 +00:00
|
|
|
#endif /* HAVE_IP_MTU_DISCOVER */
|
2006-10-12 18:43:52 +00:00
|
|
|
}
|
2007-06-22 04:35:12 +00:00
|
|
|
|
|
|
|
int ast_mkdir(const char *path, int mode)
|
|
|
|
{
|
|
|
|
char *ptr;
|
|
|
|
int len = strlen(path), count = 0, x, piececount = 0;
|
|
|
|
char *tmp = ast_strdupa(path);
|
|
|
|
char **pieces;
|
2012-07-31 20:21:43 +00:00
|
|
|
char *fullpath = ast_alloca(len + 1);
|
2007-06-22 04:35:12 +00:00
|
|
|
int res = 0;
|
|
|
|
|
|
|
|
for (ptr = tmp; *ptr; ptr++) {
|
|
|
|
if (*ptr == '/')
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Count the components to the directory path */
|
2012-07-31 20:21:43 +00:00
|
|
|
pieces = ast_alloca(count * sizeof(*pieces));
|
2007-06-22 04:35:12 +00:00
|
|
|
for (ptr = tmp; *ptr; ptr++) {
|
|
|
|
if (*ptr == '/') {
|
|
|
|
*ptr = '\0';
|
|
|
|
pieces[piececount++] = ptr + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*fullpath = '\0';
|
|
|
|
for (x = 0; x < piececount; x++) {
|
|
|
|
/* This looks funky, but the buffer is always ideally-sized, so it's fine. */
|
|
|
|
strcat(fullpath, "/");
|
|
|
|
strcat(fullpath, pieces[x]);
|
|
|
|
res = mkdir(fullpath, mode);
|
|
|
|
if (res && errno != EEXIST)
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-07-03 17:58:45 +00:00
|
|
|
static int safe_mkdir(const char *base_path, char *path, int mode)
|
|
|
|
{
|
2013-10-02 17:12:49 +00:00
|
|
|
RAII_VAR(char *, absolute_path, NULL, ast_std_free);
|
2013-07-03 17:58:45 +00:00
|
|
|
|
|
|
|
absolute_path = realpath(path, NULL);
|
|
|
|
|
|
|
|
if (absolute_path) {
|
|
|
|
/* Path exists, but is it in the right place? */
|
|
|
|
if (!ast_begins_with(absolute_path, base_path)) {
|
|
|
|
return EPERM;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* It is in the right place! */
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
/* Path doesn't exist. */
|
|
|
|
|
|
|
|
/* The slash terminating the subpath we're checking */
|
|
|
|
char *path_term = strchr(path, '/');
|
|
|
|
/* True indicates the parent path is within base_path */
|
|
|
|
int parent_is_safe = 0;
|
|
|
|
int res;
|
|
|
|
|
|
|
|
while (path_term) {
|
2013-10-02 17:12:49 +00:00
|
|
|
RAII_VAR(char *, absolute_subpath, NULL, ast_std_free);
|
2013-07-03 17:58:45 +00:00
|
|
|
|
|
|
|
/* Truncate the path one past the slash */
|
|
|
|
char c = *(path_term + 1);
|
|
|
|
*(path_term + 1) = '\0';
|
|
|
|
absolute_subpath = realpath(path, NULL);
|
|
|
|
|
|
|
|
if (absolute_subpath) {
|
|
|
|
/* Subpath exists, but is it safe? */
|
|
|
|
parent_is_safe = ast_begins_with(
|
|
|
|
absolute_subpath, base_path);
|
|
|
|
} else if (parent_is_safe) {
|
|
|
|
/* Subpath does not exist, but parent is safe
|
|
|
|
* Create it */
|
|
|
|
res = mkdir(path, mode);
|
|
|
|
if (res != 0) {
|
|
|
|
ast_assert(errno != EEXIST);
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Subpath did not exist, parent was not safe
|
|
|
|
* Fail! */
|
|
|
|
errno = EPERM;
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
/* Restore the path */
|
|
|
|
*(path_term + 1) = c;
|
|
|
|
/* Move on to the next slash */
|
|
|
|
path_term = strchr(path_term + 1, '/');
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now to build the final path, but only if it's safe */
|
|
|
|
if (!parent_is_safe) {
|
|
|
|
errno = EPERM;
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
res = mkdir(path, mode);
|
|
|
|
if (res != 0 && errno != EEXIST) {
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int ast_safe_mkdir(const char *base_path, const char *path, int mode)
|
|
|
|
{
|
2013-10-02 17:12:49 +00:00
|
|
|
RAII_VAR(char *, absolute_base_path, NULL, ast_std_free);
|
2013-07-03 17:58:45 +00:00
|
|
|
RAII_VAR(char *, p, NULL, ast_free);
|
|
|
|
|
|
|
|
if (base_path == NULL || path == NULL) {
|
|
|
|
errno = EFAULT;
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = ast_strdup(path);
|
|
|
|
if (p == NULL) {
|
|
|
|
errno = ENOMEM;
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
absolute_base_path = realpath(base_path, NULL);
|
|
|
|
if (absolute_base_path == NULL) {
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
return safe_mkdir(absolute_base_path, p, mode);
|
|
|
|
}
|
|
|
|
|
2013-10-24 20:34:53 +00:00
|
|
|
static void utils_shutdown(void)
|
|
|
|
{
|
|
|
|
close(dev_urandom_fd);
|
|
|
|
dev_urandom_fd = -1;
|
|
|
|
#if defined(DEBUG_THREADS) && !defined(LOW_MEMORY)
|
|
|
|
ast_cli_unregister_multiple(utils_cli, ARRAY_LEN(utils_cli));
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2007-08-03 19:41:42 +00:00
|
|
|
int ast_utils_init(void)
|
|
|
|
{
|
|
|
|
dev_urandom_fd = open("/dev/urandom", O_RDONLY);
|
|
|
|
base64_init();
|
|
|
|
#ifdef DEBUG_THREADS
|
2008-04-10 22:02:32 +00:00
|
|
|
#if !defined(LOW_MEMORY)
|
2008-07-11 18:09:35 +00:00
|
|
|
ast_cli_register_multiple(utils_cli, ARRAY_LEN(utils_cli));
|
2008-04-10 22:02:32 +00:00
|
|
|
#endif
|
2007-08-03 19:41:42 +00:00
|
|
|
#endif
|
2015-03-26 22:24:26 +00:00
|
|
|
ast_register_cleanup(utils_shutdown);
|
2007-08-03 19:41:42 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2008-05-23 12:37:31 +00:00
|
|
|
|
2009-04-23 20:36:35 +00:00
|
|
|
|
|
|
|
/*!
|
|
|
|
*\brief Parse digest authorization header.
|
|
|
|
*\return Returns -1 if we have no auth or something wrong with digest.
|
|
|
|
*\note This function may be used for Digest request and responce header.
|
|
|
|
* request arg is set to nonzero, if we parse Digest Request.
|
|
|
|
* pedantic arg can be set to nonzero if we need to do addition Digest check.
|
|
|
|
*/
|
|
|
|
int ast_parse_digest(const char *digest, struct ast_http_digest *d, int request, int pedantic) {
|
2012-03-15 19:11:03 +00:00
|
|
|
char *c;
|
2009-04-23 20:36:35 +00:00
|
|
|
struct ast_str *str = ast_str_create(16);
|
|
|
|
|
2012-03-15 19:11:03 +00:00
|
|
|
/* table of recognised keywords, and places where they should be copied */
|
|
|
|
const struct x {
|
|
|
|
const char *key;
|
|
|
|
const ast_string_field *field;
|
|
|
|
} *i, keys[] = {
|
|
|
|
{ "username=", &d->username },
|
|
|
|
{ "realm=", &d->realm },
|
|
|
|
{ "nonce=", &d->nonce },
|
|
|
|
{ "uri=", &d->uri },
|
|
|
|
{ "domain=", &d->domain },
|
|
|
|
{ "response=", &d->response },
|
|
|
|
{ "cnonce=", &d->cnonce },
|
|
|
|
{ "opaque=", &d->opaque },
|
|
|
|
/* Special cases that cannot be directly copied */
|
|
|
|
{ "algorithm=", NULL },
|
|
|
|
{ "qop=", NULL },
|
|
|
|
{ "nc=", NULL },
|
|
|
|
{ NULL, 0 },
|
|
|
|
};
|
|
|
|
|
2009-04-23 20:36:35 +00:00
|
|
|
if (ast_strlen_zero(digest) || !d || !str) {
|
|
|
|
ast_free(str);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
ast_str_set(&str, 0, "%s", digest);
|
|
|
|
|
|
|
|
c = ast_skip_blanks(ast_str_buffer(str));
|
|
|
|
|
2011-05-05 02:34:29 +00:00
|
|
|
if (strncasecmp(c, "Digest ", strlen("Digest "))) {
|
2009-04-23 20:36:35 +00:00
|
|
|
ast_log(LOG_WARNING, "Missing Digest.\n");
|
|
|
|
ast_free(str);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
c += strlen("Digest ");
|
|
|
|
|
|
|
|
/* lookup for keys/value pair */
|
2012-03-15 19:11:03 +00:00
|
|
|
while (c && *c && *(c = ast_skip_blanks(c))) {
|
2009-04-23 20:36:35 +00:00
|
|
|
/* find key */
|
2012-03-15 19:11:03 +00:00
|
|
|
for (i = keys; i->key != NULL; i++) {
|
|
|
|
char *src, *separator;
|
|
|
|
int unescape = 0;
|
|
|
|
if (strncasecmp(c, i->key, strlen(i->key)) != 0) {
|
|
|
|
continue;
|
2009-04-23 20:36:35 +00:00
|
|
|
}
|
|
|
|
|
2012-03-15 19:11:03 +00:00
|
|
|
/* Found. Skip keyword, take text in quotes or up to the separator. */
|
|
|
|
c += strlen(i->key);
|
|
|
|
if (*c == '"') {
|
|
|
|
src = ++c;
|
|
|
|
separator = "\"";
|
|
|
|
unescape = 1;
|
|
|
|
} else {
|
|
|
|
src = c;
|
|
|
|
separator = ",";
|
2009-04-23 20:36:35 +00:00
|
|
|
}
|
2012-03-15 19:11:03 +00:00
|
|
|
strsep(&c, separator); /* clear separator and move ptr */
|
|
|
|
if (unescape) {
|
|
|
|
ast_unescape_c(src);
|
|
|
|
}
|
|
|
|
if (i->field) {
|
|
|
|
ast_string_field_ptr_set(d, i->field, src);
|
|
|
|
} else {
|
|
|
|
/* Special cases that require additional procesing */
|
|
|
|
if (!strcasecmp(i->key, "algorithm=")) {
|
|
|
|
if (strcasecmp(src, "MD5")) {
|
|
|
|
ast_log(LOG_WARNING, "Digest algorithm: \"%s\" not supported.\n", src);
|
|
|
|
ast_free(str);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
} else if (!strcasecmp(i->key, "qop=") && !strcasecmp(src, "auth")) {
|
|
|
|
d->qop = 1;
|
|
|
|
} else if (!strcasecmp(i->key, "nc=")) {
|
|
|
|
unsigned long u;
|
|
|
|
if (sscanf(src, "%30lx", &u) != 1) {
|
|
|
|
ast_log(LOG_WARNING, "Incorrect Digest nc value: \"%s\".\n", src);
|
|
|
|
ast_free(str);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
ast_string_field_set(d, nc, src);
|
|
|
|
}
|
2009-04-23 20:36:35 +00:00
|
|
|
}
|
2012-03-15 19:11:03 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i->key == NULL) { /* not found, try ',' */
|
|
|
|
strsep(&c, ",");
|
2009-04-23 20:36:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
ast_free(str);
|
|
|
|
|
|
|
|
/* Digest checkout */
|
|
|
|
if (ast_strlen_zero(d->realm) || ast_strlen_zero(d->nonce)) {
|
|
|
|
/* "realm" and "nonce" MUST be always exist */
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!request) {
|
|
|
|
/* Additional check for Digest response */
|
|
|
|
if (ast_strlen_zero(d->username) || ast_strlen_zero(d->uri) || ast_strlen_zero(d->response)) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pedantic && d->qop && (ast_strlen_zero(d->cnonce) || ast_strlen_zero(d->nc))) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-12-12 03:58:33 +00:00
|
|
|
int ast_get_tid(void)
|
|
|
|
{
|
|
|
|
int ret = -1;
|
|
|
|
#if defined (__linux) && defined(SYS_gettid)
|
|
|
|
ret = syscall(SYS_gettid); /* available since Linux 1.4.11 */
|
|
|
|
#elif defined(__sun)
|
|
|
|
ret = pthread_self();
|
|
|
|
#elif defined(__APPLE__)
|
|
|
|
ret = mach_thread_self();
|
|
|
|
mach_port_deallocate(mach_task_self(), ret);
|
|
|
|
#elif defined(__FreeBSD__) && defined(HAVE_SYS_THR_H)
|
|
|
|
long lwpid;
|
|
|
|
thr_self(&lwpid); /* available since sys/thr.h creation 2003 */
|
|
|
|
ret = lwpid;
|
|
|
|
#endif
|
|
|
|
return ret;
|
|
|
|
}
|
2010-12-18 00:08:13 +00:00
|
|
|
|
|
|
|
char *ast_utils_which(const char *binary, char *fullpath, size_t fullpath_size)
|
|
|
|
{
|
|
|
|
const char *envPATH = getenv("PATH");
|
|
|
|
char *tpath, *path;
|
|
|
|
struct stat unused;
|
|
|
|
if (!envPATH) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
tpath = ast_strdupa(envPATH);
|
|
|
|
while ((path = strsep(&tpath, ":"))) {
|
|
|
|
snprintf(fullpath, fullpath_size, "%s/%s", path, binary);
|
|
|
|
if (!stat(fullpath, &unused)) {
|
|
|
|
return fullpath;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2016-11-22 17:20:06 +00:00
|
|
|
int ast_check_ipv6(void)
|
|
|
|
{
|
|
|
|
int udp6_socket = socket(AF_INET6, SOCK_DGRAM, 0);
|
|
|
|
|
|
|
|
if (udp6_socket < 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
close(udp6_socket);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2016-07-19 03:46:19 +00:00
|
|
|
void DO_CRASH_NORETURN ast_do_crash(void)
|
2012-11-08 17:38:31 +00:00
|
|
|
{
|
|
|
|
#if defined(DO_CRASH)
|
|
|
|
abort();
|
|
|
|
/*
|
|
|
|
* Just in case abort() doesn't work or something else super
|
|
|
|
* silly, and for Qwell's amusement.
|
|
|
|
*/
|
|
|
|
*((int *) 0) = 0;
|
|
|
|
#endif /* defined(DO_CRASH) */
|
|
|
|
}
|
|
|
|
|
2016-07-19 03:46:19 +00:00
|
|
|
void DO_CRASH_NORETURN __ast_assert_failed(int condition, const char *condition_str, const char *file, int line, const char *function)
|
2012-11-08 17:38:31 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Attempt to put it into the logger, but hope that at least
|
|
|
|
* someone saw the message on stderr ...
|
|
|
|
*/
|
|
|
|
fprintf(stderr, "FRACK!, Failed assertion %s (%d) at line %d in %s of %s\n",
|
|
|
|
condition_str, condition, line, function, file);
|
2016-09-16 23:54:07 +00:00
|
|
|
ast_log(__LOG_ERROR, file, line, function, "FRACK!, Failed assertion %s (%d)\n",
|
|
|
|
condition_str, condition);
|
2014-04-04 17:57:46 +00:00
|
|
|
|
|
|
|
/* Generate a backtrace for the assert */
|
2014-07-18 17:55:38 +00:00
|
|
|
ast_log_backtrace();
|
2014-04-04 17:57:46 +00:00
|
|
|
|
2012-11-08 17:38:31 +00:00
|
|
|
/*
|
|
|
|
* Give the logger a chance to get the message out, just in case
|
|
|
|
* we abort(), or Asterisk crashes due to whatever problem just
|
|
|
|
* happened after we exit ast_assert().
|
|
|
|
*/
|
|
|
|
usleep(1);
|
|
|
|
ast_do_crash();
|
|
|
|
}
|
2014-06-24 02:50:15 +00:00
|
|
|
|
|
|
|
char *ast_eid_to_str(char *s, int maxlen, struct ast_eid *eid)
|
|
|
|
{
|
|
|
|
int x;
|
|
|
|
char *os = s;
|
|
|
|
if (maxlen < 18) {
|
|
|
|
if (s && (maxlen > 0)) {
|
|
|
|
*s = '\0';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for (x = 0; x < 5; x++) {
|
2014-12-17 10:23:32 +00:00
|
|
|
sprintf(s, "%02hhx:", eid->eid[x]);
|
2014-06-24 02:50:15 +00:00
|
|
|
s += 3;
|
|
|
|
}
|
2014-12-17 10:23:32 +00:00
|
|
|
sprintf(s, "%02hhx", eid->eid[5]);
|
2014-06-24 02:50:15 +00:00
|
|
|
}
|
|
|
|
return os;
|
|
|
|
}
|
|
|
|
|
2018-04-20 10:50:03 +00:00
|
|
|
#if defined(__OpenBSD__) || defined(__NetBSD__) || defined(__FreeBSD__) || defined(__DragonFly__) || defined(__Darwin__)
|
2016-10-16 22:25:35 +00:00
|
|
|
#include <ifaddrs.h>
|
|
|
|
#include <net/if_dl.h>
|
|
|
|
|
2014-06-24 02:50:15 +00:00
|
|
|
void ast_set_default_eid(struct ast_eid *eid)
|
|
|
|
{
|
2016-10-16 22:25:35 +00:00
|
|
|
struct ifaddrs *ifap, *ifaphead;
|
|
|
|
int rtnerr;
|
|
|
|
const struct sockaddr_dl *sdl;
|
|
|
|
int alen;
|
|
|
|
caddr_t ap;
|
2014-06-24 02:50:15 +00:00
|
|
|
char eid_str[20];
|
2016-10-16 22:25:35 +00:00
|
|
|
unsigned char empty_mac[6] = {0, 0, 0, 0, 0, 0};
|
|
|
|
unsigned char full_mac[6] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
|
2014-06-24 02:50:15 +00:00
|
|
|
|
2016-10-16 22:25:35 +00:00
|
|
|
rtnerr = getifaddrs(&ifaphead);
|
|
|
|
if (rtnerr) {
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
2014-06-24 02:50:15 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2016-10-16 22:25:35 +00:00
|
|
|
if (!ifaphead) {
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (ifap = ifaphead; ifap; ifap = ifap->ifa_next) {
|
|
|
|
if (ifap->ifa_addr->sa_family != AF_LINK) {
|
|
|
|
continue;
|
2014-06-24 02:50:15 +00:00
|
|
|
}
|
|
|
|
|
2016-10-16 22:25:35 +00:00
|
|
|
sdl = (const struct sockaddr_dl *) ifap->ifa_addr;
|
|
|
|
ap = ((caddr_t) ((sdl)->sdl_data + (sdl)->sdl_nlen));
|
|
|
|
alen = sdl->sdl_alen;
|
|
|
|
if (alen != 6 || !(memcmp(ap, &empty_mac, 6) && memcmp(ap, &full_mac, 6))) {
|
|
|
|
continue;
|
2014-06-24 02:50:15 +00:00
|
|
|
}
|
|
|
|
|
2016-10-16 22:25:35 +00:00
|
|
|
memcpy(eid, ap, sizeof(*eid));
|
|
|
|
ast_debug(1, "Seeding global EID '%s'\n",
|
|
|
|
ast_eid_to_str(eid_str, sizeof(eid_str), eid));
|
|
|
|
freeifaddrs(ifaphead);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
freeifaddrs(ifaphead);
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
#elif defined(SOLARIS)
|
|
|
|
#include <sys/sockio.h>
|
|
|
|
#include <net/if_arp.h>
|
|
|
|
|
|
|
|
void ast_set_default_eid(struct ast_eid *eid)
|
|
|
|
{
|
|
|
|
int s;
|
|
|
|
int x;
|
|
|
|
struct lifreq *ifr = NULL;
|
|
|
|
struct lifnum ifn;
|
|
|
|
struct lifconf ifc;
|
|
|
|
struct arpreq ar;
|
|
|
|
struct sockaddr_in *sa, *sa2;
|
|
|
|
char *buf = NULL;
|
|
|
|
char eid_str[20];
|
|
|
|
int bufsz;
|
|
|
|
unsigned char empty_mac[6] = {0, 0, 0, 0, 0, 0};
|
|
|
|
unsigned char full_mac[6] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
|
|
|
|
|
|
|
|
s = socket(AF_INET, SOCK_STREAM, 0);
|
|
|
|
if (s <= 0) {
|
|
|
|
ast_log(LOG_WARNING, "Unable to open a socket for seeding global EID. "
|
|
|
|
" You will have to set it manually.\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get a count of interfaces on the machine */
|
|
|
|
ifn.lifn_family = AF_UNSPEC;
|
|
|
|
ifn.lifn_flags = 0;
|
|
|
|
ifn.lifn_count = 0;
|
|
|
|
if (ioctl(s, SIOCGLIFNUM, &ifn) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
" You will have to set it manually.\n");
|
2014-06-24 02:50:15 +00:00
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
2016-10-16 22:25:35 +00:00
|
|
|
|
|
|
|
bufsz = ifn.lifn_count * sizeof(struct lifreq);
|
|
|
|
if (!(buf = ast_malloc(bufsz))) {
|
|
|
|
ast_log(LOG_WARNING, "Unable to allocate memory for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
memset(buf, 0, bufsz);
|
|
|
|
|
|
|
|
/* Get a list of interfaces on the machine */
|
|
|
|
ifc.lifc_len = bufsz;
|
|
|
|
ifc.lifc_buf = buf;
|
|
|
|
ifc.lifc_family = AF_UNSPEC;
|
|
|
|
ifc.lifc_flags = 0;
|
|
|
|
if (ioctl(s, SIOCGLIFCONF, &ifc) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
ast_free(buf);
|
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (ifr = (struct lifreq *)buf, x = 0; x < ifn.lifn_count; ifr++, x++) {
|
|
|
|
unsigned char *p;
|
|
|
|
|
|
|
|
sa = (struct sockaddr_in *)&(ifr->lifr_addr);
|
|
|
|
sa2 = (struct sockaddr_in *)&(ar.arp_pa);
|
|
|
|
*sa2 = *sa;
|
|
|
|
|
|
|
|
if(ioctl(s, SIOCGARP, &ar) >= 0) {
|
|
|
|
p = (unsigned char *)&(ar.arp_ha.sa_data);
|
|
|
|
if (!(memcmp(p, &empty_mac, 6) && memcmp(p, &full_mac, 6))) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(eid, p, sizeof(*eid));
|
|
|
|
ast_debug(1, "Seeding global EID '%s'\n",
|
|
|
|
ast_eid_to_str(eid_str, sizeof(eid_str), eid));
|
|
|
|
ast_free(buf);
|
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
ast_free(buf);
|
2014-06-24 02:50:15 +00:00
|
|
|
close(s);
|
2016-10-16 22:25:35 +00:00
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-06-24 02:50:15 +00:00
|
|
|
#else
|
2016-10-16 22:25:35 +00:00
|
|
|
void ast_set_default_eid(struct ast_eid *eid)
|
|
|
|
{
|
|
|
|
int s;
|
|
|
|
int i;
|
|
|
|
struct ifreq *ifr;
|
|
|
|
struct ifreq *ifrp;
|
|
|
|
struct ifconf ifc;
|
|
|
|
char *buf = NULL;
|
2014-06-24 02:50:15 +00:00
|
|
|
char eid_str[20];
|
2016-10-16 22:25:35 +00:00
|
|
|
int bufsz, num_interfaces;
|
|
|
|
unsigned char empty_mac[6] = {0, 0, 0, 0, 0, 0};
|
|
|
|
unsigned char full_mac[6] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
|
|
|
|
|
|
|
|
s = socket(AF_INET, SOCK_STREAM, 0);
|
2017-12-19 05:17:08 +00:00
|
|
|
if (s < 0) {
|
2016-10-16 22:25:35 +00:00
|
|
|
ast_log(LOG_WARNING, "Unable to open socket for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ifc.ifc_len = 0;
|
|
|
|
ifc.ifc_buf = NULL;
|
|
|
|
if (ioctl(s, SIOCGIFCONF, &ifc) || ifc.ifc_len <= 0) {
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
bufsz = ifc.ifc_len;
|
|
|
|
|
|
|
|
if (!(buf = ast_malloc(bufsz))) {
|
|
|
|
ast_log(LOG_WARNING, "Unable to allocate memory for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ifc.ifc_buf = buf;
|
|
|
|
if (ioctl(s, SIOCGIFCONF, &ifc) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "Unable to retrieve ethernet interfaces for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
ast_free(buf);
|
|
|
|
close(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ifrp = ifc.ifc_req;
|
|
|
|
num_interfaces = ifc.ifc_len / sizeof(*ifr);
|
|
|
|
|
|
|
|
for (i = 0; i < num_interfaces; i++) {
|
|
|
|
ifr = &ifrp[i];
|
|
|
|
if (!ioctl(s, SIOCGIFHWADDR, ifr)) {
|
|
|
|
unsigned char *hwaddr = (unsigned char *) ifr->ifr_hwaddr.sa_data;
|
|
|
|
|
|
|
|
if (!(memcmp(hwaddr, &empty_mac, 6) && memcmp(hwaddr, &full_mac, 6))) {
|
|
|
|
continue;
|
2014-06-24 02:50:15 +00:00
|
|
|
}
|
2016-10-16 22:25:35 +00:00
|
|
|
|
|
|
|
memcpy(eid, hwaddr, sizeof(*eid));
|
|
|
|
ast_debug(1, "Seeding global EID '%s' from '%s' using 'siocgifhwaddr'\n",
|
|
|
|
ast_eid_to_str(eid_str, sizeof(eid_str), eid), ifr->ifr_name);
|
|
|
|
ast_free(buf);
|
|
|
|
close(s);
|
|
|
|
return;
|
2014-06-24 02:50:15 +00:00
|
|
|
}
|
|
|
|
}
|
2016-10-16 22:25:35 +00:00
|
|
|
|
|
|
|
ast_log(LOG_WARNING, "No ethernet interface found for seeding global EID. "
|
|
|
|
"You will have to set it manually.\n");
|
|
|
|
ast_free(buf);
|
|
|
|
close(s);
|
|
|
|
|
|
|
|
return;
|
2014-06-24 02:50:15 +00:00
|
|
|
}
|
2016-10-16 22:25:35 +00:00
|
|
|
#endif /* LINUX */
|
2014-06-24 02:50:15 +00:00
|
|
|
|
|
|
|
int ast_str_to_eid(struct ast_eid *eid, const char *s)
|
|
|
|
{
|
|
|
|
unsigned int eid_int[6];
|
|
|
|
int x;
|
|
|
|
|
|
|
|
if (sscanf(s, "%2x:%2x:%2x:%2x:%2x:%2x", &eid_int[0], &eid_int[1], &eid_int[2],
|
|
|
|
&eid_int[3], &eid_int[4], &eid_int[5]) != 6) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (x = 0; x < 6; x++) {
|
|
|
|
eid->eid[x] = eid_int[x];
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ast_eid_cmp(const struct ast_eid *eid1, const struct ast_eid *eid2)
|
|
|
|
{
|
|
|
|
return memcmp(eid1, eid2, sizeof(*eid1));
|
|
|
|
}
|
2015-12-08 23:49:20 +00:00
|
|
|
|
2016-08-10 19:41:38 +00:00
|
|
|
int ast_eid_is_empty(const struct ast_eid *eid)
|
|
|
|
{
|
|
|
|
struct ast_eid empty_eid;
|
|
|
|
|
|
|
|
memset(&empty_eid, 0, sizeof(empty_eid));
|
|
|
|
return memcmp(eid, &empty_eid, sizeof(empty_eid)) ? 0 : 1;
|
|
|
|
}
|
|
|
|
|
2015-12-08 23:49:20 +00:00
|
|
|
int ast_file_is_readable(const char *filename)
|
|
|
|
{
|
|
|
|
#if defined(HAVE_EACCESS) || defined(HAVE_EUIDACCESS)
|
|
|
|
#if defined(HAVE_EUIDACCESS) && !defined(HAVE_EACCESS)
|
|
|
|
#define eaccess euidaccess
|
|
|
|
#endif
|
|
|
|
return eaccess(filename, R_OK) == 0;
|
|
|
|
#else
|
|
|
|
int fd = open(filename, O_RDONLY | O_NONBLOCK);
|
|
|
|
if (fd < 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
close(fd);
|
|
|
|
return 1;
|
|
|
|
#endif
|
|
|
|
}
|
2015-12-12 17:08:50 +00:00
|
|
|
|
|
|
|
int ast_compare_versions(const char *version1, const char *version2)
|
|
|
|
{
|
2015-12-14 21:25:02 +00:00
|
|
|
unsigned int major[2] = { 0 };
|
|
|
|
unsigned int minor[2] = { 0 };
|
|
|
|
unsigned int patch[2] = { 0 };
|
|
|
|
unsigned int extra[2] = { 0 };
|
|
|
|
int res;
|
2015-12-12 17:08:50 +00:00
|
|
|
|
2015-12-14 21:25:02 +00:00
|
|
|
sscanf(version1, "%u.%u.%u.%u", &major[0], &minor[0], &patch[0], &extra[0]);
|
|
|
|
sscanf(version2, "%u.%u.%u.%u", &major[1], &minor[1], &patch[1], &extra[1]);
|
2015-12-12 17:08:50 +00:00
|
|
|
|
2015-12-14 21:25:02 +00:00
|
|
|
res = major[0] - major[1];
|
|
|
|
if (res) {
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
res = minor[0] - minor[1];
|
|
|
|
if (res) {
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
res = patch[0] - patch[1];
|
|
|
|
if (res) {
|
|
|
|
return res;
|
2015-12-12 17:08:50 +00:00
|
|
|
}
|
2015-12-14 21:25:02 +00:00
|
|
|
return extra[0] - extra[1];
|
2015-12-12 17:08:50 +00:00
|
|
|
}
|
2017-12-07 15:52:39 +00:00
|
|
|
|
|
|
|
int __ast_fd_set_flags(int fd, int flags, enum ast_fd_flag_operation op,
|
|
|
|
const char *file, int lineno, const char *function)
|
|
|
|
{
|
|
|
|
int f;
|
|
|
|
|
|
|
|
f = fcntl(fd, F_GETFL);
|
|
|
|
if (f == -1) {
|
|
|
|
ast_log(__LOG_ERROR, file, lineno, function,
|
|
|
|
"Failed to get fcntl() flags for file descriptor: %s\n", strerror(errno));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
case AST_FD_FLAG_SET:
|
2018-12-11 15:06:15 +00:00
|
|
|
if ((f & flags) == flags) {
|
|
|
|
/* There is nothing to set */
|
|
|
|
return 0;
|
|
|
|
}
|
2017-12-07 15:52:39 +00:00
|
|
|
f |= flags;
|
|
|
|
break;
|
|
|
|
case AST_FD_FLAG_CLEAR:
|
2018-12-11 15:06:15 +00:00
|
|
|
if (!(f & flags)) {
|
|
|
|
/* There is nothing to clear */
|
|
|
|
return 0;
|
|
|
|
}
|
2017-12-07 15:52:39 +00:00
|
|
|
f &= ~flags;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ast_assert(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
f = fcntl(fd, F_SETFL, f);
|
|
|
|
if (f == -1) {
|
|
|
|
ast_log(__LOG_ERROR, file, lineno, function,
|
|
|
|
"Failed to set fcntl() flags for file descriptor: %s\n", strerror(errno));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2018-06-18 23:04:54 +00:00
|
|
|
|
2018-12-07 12:57:48 +00:00
|
|
|
#ifndef HAVE_SOCK_NONBLOCK
|
|
|
|
int ast_socket_nonblock(int domain, int type, int protocol)
|
|
|
|
{
|
|
|
|
int s = socket(domain, type, protocol);
|
|
|
|
if (s < 0) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ast_fd_set_flags(s, O_NONBLOCK)) {
|
|
|
|
close(s);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef HAVE_PIPE2
|
|
|
|
int ast_pipe_nonblock(int filedes[2])
|
|
|
|
{
|
|
|
|
int p = pipe(filedes);
|
|
|
|
if (p < 0) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ast_fd_set_flags(filedes[0], O_NONBLOCK)
|
|
|
|
|| ast_fd_set_flags(filedes[1], O_NONBLOCK)) {
|
|
|
|
close(filedes[0]);
|
|
|
|
close(filedes[1]);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-06-18 23:04:54 +00:00
|
|
|
/*!
|
|
|
|
* \brief A thread local indicating whether the current thread is a user interface.
|
|
|
|
*/
|
|
|
|
AST_THREADSTORAGE(thread_user_interface_tl);
|
|
|
|
|
|
|
|
int ast_thread_user_interface_set(int is_user_interface)
|
|
|
|
{
|
|
|
|
int *thread_user_interface;
|
|
|
|
|
|
|
|
thread_user_interface = ast_threadstorage_get(
|
|
|
|
&thread_user_interface_tl, sizeof(*thread_user_interface));
|
|
|
|
if (thread_user_interface == NULL) {
|
|
|
|
ast_log(LOG_ERROR, "Error setting user interface status for current thread\n");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
*thread_user_interface = !!is_user_interface;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ast_thread_is_user_interface(void)
|
|
|
|
{
|
|
|
|
int *thread_user_interface;
|
|
|
|
|
|
|
|
thread_user_interface = ast_threadstorage_get(
|
|
|
|
&thread_user_interface_tl, sizeof(*thread_user_interface));
|
|
|
|
if (thread_user_interface == NULL) {
|
|
|
|
ast_log(LOG_ERROR, "Error checking thread's user interface status\n");
|
|
|
|
/* On error, assume that we are not a user interface thread */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return *thread_user_interface;
|
|
|
|
}
|