Thu Dec 17 13:33:38 2009

Asterisk developer's documentation


utils.c

Go to the documentation of this file.
00001 /*
00002  * Asterisk -- An open source telephony toolkit.
00003  *
00004  * Copyright (C) 1999 - 2006, Digium, Inc.
00005  *
00006  * See http://www.asterisk.org for more information about
00007  * the Asterisk project. Please do not directly contact
00008  * any of the maintainers of this project for assistance;
00009  * the project provides a web site, mailing lists and IRC
00010  * channels for your use.
00011  *
00012  * This program is free software, distributed under the terms of
00013  * the GNU General Public License Version 2. See the LICENSE file
00014  * at the top of the source tree.
00015  */
00016 
00017 /*! \file
00018  *
00019  * \brief Utility functions
00020  *
00021  * \note These are important for portability and security,
00022  * so please use them in favour of other routines.
00023  * Please consult the CODING GUIDELINES for more information.
00024  */
00025 
00026 #include "asterisk.h"
00027 
00028 ASTERISK_FILE_VERSION(__FILE__, "$Revision: 228378 $")
00029 
00030 #include <ctype.h>
00031 #include <string.h>
00032 #include <unistd.h>
00033 #include <stdlib.h>
00034 #include <errno.h>
00035 #include <stdarg.h>
00036 #include <stdio.h>
00037 #include <sys/types.h>
00038 #include <sys/socket.h>
00039 #include <netinet/in.h>
00040 #include <arpa/inet.h>
00041 
00042 #define AST_API_MODULE     /* ensure that inlinable API functions will be built in lock.h if required */
00043 #include "asterisk/lock.h"
00044 #include "asterisk/io.h"
00045 #include "asterisk/logger.h"
00046 #include "asterisk/md5.h"
00047 #include "asterisk/sha1.h"
00048 #include "asterisk/options.h"
00049 #include "asterisk/cli.h"
00050 #include "asterisk/linkedlists.h"
00051 
00052 #define AST_API_MODULE     /* ensure that inlinable API functions will be built in this module if required */
00053 #include "asterisk/strings.h"
00054 
00055 #define AST_API_MODULE     /* ensure that inlinable API functions will be built in this module if required */
00056 #include "asterisk/time.h"
00057 
00058 #define AST_API_MODULE     /* ensure that inlinable API functions will be built in this module if required */
00059 #include "asterisk/stringfields.h"
00060 
00061 #define AST_API_MODULE     /* ensure that inlinable API functions will be built in this module if required */
00062 #include "asterisk/utils.h"
00063 
00064 #define AST_API_MODULE
00065 #include "asterisk/threadstorage.h"
00066 
00067 static char base64[64];
00068 static char b2a[256];
00069 
00070 AST_THREADSTORAGE(inet_ntoa_buf, inet_ntoa_buf_init);
00071 
00072 #if !defined(HAVE_GETHOSTBYNAME_R_5) && !defined(HAVE_GETHOSTBYNAME_R_6)
00073 
00074 #define ERANGE 34 /*!< duh? ERANGE value copied from web... */
00075 #undef gethostbyname
00076 
00077 AST_MUTEX_DEFINE_STATIC(__mutex);
00078 
00079 /*! \brief Reentrant replacement for gethostbyname for BSD-based systems.
00080 \note This
00081 routine is derived from code originally written and placed in the public 
00082 domain by Enzo Michelangeli <em@em.no-ip.com> */
00083 
00084 static int gethostbyname_r (const char *name, struct hostent *ret, char *buf,
00085             size_t buflen, struct hostent **result, 
00086             int *h_errnop) 
00087 {
00088    int hsave;
00089    struct hostent *ph;
00090    ast_mutex_lock(&__mutex); /* begin critical area */
00091    hsave = h_errno;
00092 
00093    ph = gethostbyname(name);
00094    *h_errnop = h_errno; /* copy h_errno to *h_herrnop */
00095    if (ph == NULL) {
00096       *result = NULL;
00097    } else {
00098       char **p, **q;
00099       char *pbuf;
00100       int nbytes=0;
00101       int naddr=0, naliases=0;
00102       /* determine if we have enough space in buf */
00103 
00104       /* count how many addresses */
00105       for (p = ph->h_addr_list; *p != 0; p++) {
00106          nbytes += ph->h_length; /* addresses */
00107          nbytes += sizeof(*p); /* pointers */
00108          naddr++;
00109       }
00110       nbytes += sizeof(*p); /* one more for the terminating NULL */
00111 
00112       /* count how many aliases, and total length of strings */
00113       for (p = ph->h_aliases; *p != 0; p++) {
00114          nbytes += (strlen(*p)+1); /* aliases */
00115          nbytes += sizeof(*p);  /* pointers */
00116          naliases++;
00117       }
00118       nbytes += sizeof(*p); /* one more for the terminating NULL */
00119 
00120       /* here nbytes is the number of bytes required in buffer */
00121       /* as a terminator must be there, the minimum value is ph->h_length */
00122       if (nbytes > buflen) {
00123          *result = NULL;
00124          ast_mutex_unlock(&__mutex); /* end critical area */
00125          return ERANGE; /* not enough space in buf!! */
00126       }
00127 
00128       /* There is enough space. Now we need to do a deep copy! */
00129       /* Allocation in buffer:
00130          from [0] to [(naddr-1) * sizeof(*p)]:
00131          pointers to addresses
00132          at [naddr * sizeof(*p)]:
00133          NULL
00134          from [(naddr+1) * sizeof(*p)] to [(naddr+naliases) * sizeof(*p)] :
00135          pointers to aliases
00136          at [(naddr+naliases+1) * sizeof(*p)]:
00137          NULL
00138          then naddr addresses (fixed length), and naliases aliases (asciiz).
00139       */
00140 
00141       *ret = *ph;   /* copy whole structure (not its address!) */
00142 
00143       /* copy addresses */
00144       q = (char **)buf; /* pointer to pointers area (type: char **) */
00145       ret->h_addr_list = q; /* update pointer to address list */
00146       pbuf = buf + ((naddr + naliases + 2) * sizeof(*p)); /* skip that area */
00147       for (p = ph->h_addr_list; *p != 0; p++) {
00148          memcpy(pbuf, *p, ph->h_length); /* copy address bytes */
00149          *q++ = pbuf; /* the pointer is the one inside buf... */
00150          pbuf += ph->h_length; /* advance pbuf */
00151       }
00152       *q++ = NULL; /* address list terminator */
00153 
00154       /* copy aliases */
00155       ret->h_aliases = q; /* update pointer to aliases list */
00156       for (p = ph->h_aliases; *p != 0; p++) {
00157          strcpy(pbuf, *p); /* copy alias strings */
00158          *q++ = pbuf; /* the pointer is the one inside buf... */
00159          pbuf += strlen(*p); /* advance pbuf */
00160          *pbuf++ = 0; /* string terminator */
00161       }
00162       *q++ = NULL; /* terminator */
00163 
00164       strcpy(pbuf, ph->h_name); /* copy alias strings */
00165       ret->h_name = pbuf;
00166       pbuf += strlen(ph->h_name); /* advance pbuf */
00167       *pbuf++ = 0; /* string terminator */
00168 
00169       *result = ret;  /* and let *result point to structure */
00170 
00171    }
00172    h_errno = hsave;  /* restore h_errno */
00173    ast_mutex_unlock(&__mutex); /* end critical area */
00174 
00175    return (*result == NULL); /* return 0 on success, non-zero on error */
00176 }
00177 
00178 
00179 #endif
00180 
00181 /*! \brief Re-entrant (thread safe) version of gethostbyname that replaces the 
00182    standard gethostbyname (which is not thread safe)
00183 */
00184 struct hostent *ast_gethostbyname(const char *host, struct ast_hostent *hp)
00185 {
00186    int res;
00187    int herrno;
00188    int dots=0;
00189    const char *s;
00190    struct hostent *result = NULL;
00191    /* Although it is perfectly legitimate to lookup a pure integer, for
00192       the sake of the sanity of people who like to name their peers as
00193       integers, we break with tradition and refuse to look up a
00194       pure integer */
00195    s = host;
00196    res = 0;
00197    while(s && *s) {
00198       if (*s == '.')
00199          dots++;
00200       else if (!isdigit(*s))
00201          break;
00202       s++;
00203    }
00204    if (!s || !*s) {
00205       /* Forge a reply for IP's to avoid octal IP's being interpreted as octal */
00206       if (dots != 3)
00207          return NULL;
00208       memset(hp, 0, sizeof(struct ast_hostent));
00209       hp->hp.h_addrtype = AF_INET;
00210       hp->hp.h_addr_list = (void *) hp->buf;
00211       hp->hp.h_addr = hp->buf + sizeof(void *);
00212       if (inet_pton(AF_INET, host, hp->hp.h_addr) > 0)
00213          return &hp->hp;
00214       return NULL;
00215       
00216    }
00217 #ifdef HAVE_GETHOSTBYNAME_R_5
00218    result = gethostbyname_r(host, &hp->hp, hp->buf, sizeof(hp->buf), &herrno);
00219 
00220    if (!result || !hp->hp.h_addr_list || !hp->hp.h_addr_list[0])
00221       return NULL;
00222 #else
00223    res = gethostbyname_r(host, &hp->hp, hp->buf, sizeof(hp->buf), &result, &herrno);
00224 
00225    if (res || !result || !hp->hp.h_addr_list || !hp->hp.h_addr_list[0])
00226       return NULL;
00227 #endif
00228    return &hp->hp;
00229 }
00230 
00231 /*! \brief Produce 32 char MD5 hash of value. */
00232 void ast_md5_hash(char *output, char *input)
00233 {
00234    struct MD5Context md5;
00235    unsigned char digest[16];
00236    char *ptr;
00237    int x;
00238 
00239    MD5Init(&md5);
00240    MD5Update(&md5, (unsigned char *)input, strlen(input));
00241    MD5Final(digest, &md5);
00242    ptr = output;
00243    for (x = 0; x < 16; x++)
00244       ptr += sprintf(ptr, "%2.2x", digest[x]);
00245 }
00246 
00247 /*! \brief Produce 40 char SHA1 hash of value. */
00248 void ast_sha1_hash(char *output, char *input)
00249 {
00250    struct SHA1Context sha;
00251    char *ptr;
00252    int x;
00253    uint8_t Message_Digest[20];
00254 
00255    SHA1Reset(&sha);
00256    
00257    SHA1Input(&sha, (const unsigned char *) input, strlen(input));
00258 
00259    SHA1Result(&sha, Message_Digest);
00260    ptr = output;
00261    for (x = 0; x < 20; x++)
00262       ptr += sprintf(ptr, "%2.2x", Message_Digest[x]);
00263 }
00264 
00265 /*! \brief decode BASE64 encoded text */
00266 int ast_base64decode(unsigned char *dst, const char *src, int max)
00267 {
00268    int cnt = 0;
00269    unsigned int byte = 0;
00270    unsigned int bits = 0;
00271    int incnt = 0;
00272    while(*src && *src != '=' && (cnt < max)) {
00273       /* Shift in 6 bits of input */
00274       byte <<= 6;
00275       byte |= (b2a[(int)(*src)]) & 0x3f;
00276       bits += 6;
00277       src++;
00278       incnt++;
00279       /* If we have at least 8 bits left over, take that character 
00280          off the top */
00281       if (bits >= 8)  {
00282          bits -= 8;
00283          *dst = (byte >> bits) & 0xff;
00284          dst++;
00285          cnt++;
00286       }
00287    }
00288    /* Dont worry about left over bits, they're extra anyway */
00289    return cnt;
00290 }
00291 
00292 /*! \brief encode text to BASE64 coding */
00293 int ast_base64encode_full(char *dst, const unsigned char *src, int srclen, int max, int linebreaks)
00294 {
00295    int cnt = 0;
00296    int col = 0;
00297    unsigned int byte = 0;
00298    int bits = 0;
00299    int cntin = 0;
00300    /* Reserve space for null byte at end of string */
00301    max--;
00302    while ((cntin < srclen) && (cnt < max)) {
00303       byte <<= 8;
00304       byte |= *(src++);
00305       bits += 8;
00306       cntin++;
00307       if ((bits == 24) && (cnt + 4 <= max)) {
00308          *dst++ = base64[(byte >> 18) & 0x3f];
00309          *dst++ = base64[(byte >> 12) & 0x3f];
00310          *dst++ = base64[(byte >> 6) & 0x3f];
00311          *dst++ = base64[byte & 0x3f];
00312          cnt += 4;
00313          col += 4;
00314          bits = 0;
00315          byte = 0;
00316       }
00317       if (linebreaks && (cnt < max) && (col == 64)) {
00318          *dst++ = '\n';
00319          cnt++;
00320          col = 0;
00321       }
00322    }
00323    if (bits && (cnt + 4 <= max)) {
00324       /* Add one last character for the remaining bits, 
00325          padding the rest with 0 */
00326       byte <<= 24 - bits;
00327       *dst++ = base64[(byte >> 18) & 0x3f];
00328       *dst++ = base64[(byte >> 12) & 0x3f];
00329       if (bits == 16)
00330          *dst++ = base64[(byte >> 6) & 0x3f];
00331       else
00332          *dst++ = '=';
00333       *dst++ = '=';
00334       cnt += 4;
00335    }
00336    if (linebreaks && (cnt < max)) {
00337       *dst++ = '\n';
00338       cnt++;
00339    }
00340    *dst = '\0';
00341    return cnt;
00342 }
00343 
00344 int ast_base64encode(char *dst, const unsigned char *src, int srclen, int max)
00345 {
00346    return ast_base64encode_full(dst, src, srclen, max, 0);
00347 }
00348 
00349 static void base64_init(void)
00350 {
00351    int x;
00352    memset(b2a, -1, sizeof(b2a));
00353    /* Initialize base-64 Conversion table */
00354    for (x = 0; x < 26; x++) {
00355       /* A-Z */
00356       base64[x] = 'A' + x;
00357       b2a['A' + x] = x;
00358       /* a-z */
00359       base64[x + 26] = 'a' + x;
00360       b2a['a' + x] = x + 26;
00361       /* 0-9 */
00362       if (x < 10) {
00363          base64[x + 52] = '0' + x;
00364          b2a['0' + x] = x + 52;
00365       }
00366    }
00367    base64[62] = '+';
00368    base64[63] = '/';
00369    b2a[(int)'+'] = 62;
00370    b2a[(int)'/'] = 63;
00371 }
00372 
00373 /*! \brief  ast_uri_encode: Turn text string to URI-encoded %XX version
00374 \note    At this point, we're converting from ISO-8859-x (8-bit), not UTF8
00375    as in the SIP protocol spec 
00376    If doreserved == 1 we will convert reserved characters also.
00377    RFC 2396, section 2.4
00378    outbuf needs to have more memory allocated than the instring
00379    to have room for the expansion. Every char that is converted
00380    is replaced by three ASCII characters.
00381 
00382    Note: The doreserved option is needed for replaces header in
00383    SIP transfers.
00384 */
00385 char *ast_uri_encode(const char *string, char *outbuf, int buflen, int doreserved) 
00386 {
00387    char *reserved = ";/?:@&=+$,# "; /* Reserved chars */
00388 
00389    const char *ptr  = string; /* Start with the string */
00390    char *out = NULL;
00391    char *buf = NULL;
00392 
00393    ast_copy_string(outbuf, string, buflen);
00394 
00395    /* If there's no characters to convert, just go through and don't do anything */
00396    while (*ptr) {
00397       if (((unsigned char) *ptr) > 127 || (doreserved && strchr(reserved, *ptr)) ) {
00398          /* Oops, we need to start working here */
00399          if (!buf) {
00400             buf = outbuf;
00401             out = buf + (ptr - string) ;  /* Set output ptr */
00402          }
00403          out += sprintf(out, "%%%02x", (unsigned char) *ptr);
00404       } else if (buf) {
00405          *out = *ptr;   /* Continue copying the string */
00406          out++;
00407       } 
00408       ptr++;
00409    }
00410    if (buf)
00411       *out = '\0';
00412    return outbuf;
00413 }
00414 
00415 /*! \brief  ast_uri_decode: Decode SIP URI, URN, URL (overwrite the string)  */
00416 void ast_uri_decode(char *s) 
00417 {
00418    char *o;
00419    unsigned int tmp;
00420 
00421    for (o = s; *s; s++, o++) {
00422       if (*s == '%' && strlen(s) > 2 && sscanf(s + 1, "%2x", &tmp) == 1) {
00423          /* have '%', two chars and correct parsing */
00424          *o = tmp;
00425          s += 2;  /* Will be incremented once more when we break out */
00426       } else /* all other cases, just copy */
00427          *o = *s;
00428    }
00429    *o = '\0';
00430 }
00431 
00432 /*! \brief  ast_inet_ntoa: Recursive thread safe replacement of inet_ntoa */
00433 const char *ast_inet_ntoa(struct in_addr ia)
00434 {
00435    char *buf;
00436 
00437    if (!(buf = ast_threadstorage_get(&inet_ntoa_buf, INET_ADDRSTRLEN)))
00438       return "";
00439 
00440    return inet_ntop(AF_INET, &ia, buf, INET_ADDRSTRLEN);
00441 }
00442 
00443 #ifndef __linux__
00444 #undef pthread_create /* For ast_pthread_create function only */
00445 #endif /* !__linux__ */
00446 
00447 #if !defined(LOW_MEMORY)
00448 
00449 #ifdef DEBUG_THREADS
00450 
00451 /*! \brief A reasonable maximum number of locks a thread would be holding ... */
00452 #define AST_MAX_LOCKS 64
00453 
00454 /* Allow direct use of pthread_mutex_t and friends */
00455 #undef pthread_mutex_t
00456 #undef pthread_mutex_lock
00457 #undef pthread_mutex_unlock
00458 #undef pthread_mutex_init
00459 #undef pthread_mutex_destroy
00460 
00461 /*! 
00462  * \brief Keep track of which locks a thread holds 
00463  *
00464  * There is an instance of this struct for every active thread
00465  */
00466 struct thr_lock_info {
00467    /*! The thread's ID */
00468    pthread_t thread_id;
00469    /*! The thread name which includes where the thread was started */
00470    const char *thread_name;
00471    /*! This is the actual container of info for what locks this thread holds */
00472    struct {
00473       const char *file;
00474       int line_num;
00475       const char *func;
00476       const char *lock_name;
00477       void *lock_addr;
00478       int times_locked;
00479       enum ast_lock_type type;
00480       /*! This thread is waiting on this lock */
00481       int pending:2;
00482    } locks[AST_MAX_LOCKS];
00483    /*! This is the number of locks currently held by this thread.
00484     *  The index (num_locks - 1) has the info on the last one in the
00485     *  locks member */
00486    unsigned int num_locks;
00487    /*! Protects the contents of the locks member 
00488     * Intentionally not ast_mutex_t */
00489    pthread_mutex_t lock;
00490    AST_LIST_ENTRY(thr_lock_info) entry;
00491 };
00492 
00493 /*! 
00494  * \brief Locked when accessing the lock_infos list 
00495  */
00496 AST_MUTEX_DEFINE_STATIC(lock_infos_lock);
00497 /*!
00498  * \brief A list of each thread's lock info 
00499  */
00500 static AST_LIST_HEAD_NOLOCK_STATIC(lock_infos, thr_lock_info);
00501 
00502 /*!
00503  * \brief Destroy a thread's lock info
00504  *
00505  * This gets called automatically when the thread stops
00506  */
00507 static void lock_info_destroy(void *data)
00508 {
00509    struct thr_lock_info *lock_info = data;
00510    int i;
00511 
00512    pthread_mutex_lock(&lock_infos_lock.mutex);
00513    AST_LIST_REMOVE(&lock_infos, lock_info, entry);
00514    pthread_mutex_unlock(&lock_infos_lock.mutex);
00515 
00516 
00517    for (i = 0; i < lock_info->num_locks; i++) {
00518       if (lock_info->locks[i].pending == -1) {
00519          /* This just means that the last lock this thread went for was by
00520           * using trylock, and it failed.  This is fine. */
00521          break;
00522       }
00523 
00524       ast_log(LOG_ERROR, 
00525          "Thread '%s' still has a lock! - '%s' (%p) from '%s' in %s:%d!\n", 
00526          lock_info->thread_name,
00527          lock_info->locks[i].lock_name,
00528          lock_info->locks[i].lock_addr,
00529          lock_info->locks[i].func,
00530          lock_info->locks[i].file,
00531          lock_info->locks[i].line_num
00532       );
00533    }
00534 
00535    pthread_mutex_destroy(&lock_info->lock);
00536    free((void *) lock_info->thread_name);
00537    free(lock_info);
00538 }
00539 
00540 /*!
00541  * \brief The thread storage key for per-thread lock info
00542  */
00543 AST_THREADSTORAGE_CUSTOM(thread_lock_info, thread_lock_info_init, lock_info_destroy);
00544 
00545 void ast_store_lock_info(enum ast_lock_type type, const char *filename,
00546    int line_num, const char *func, const char *lock_name, void *lock_addr)
00547 {
00548    struct thr_lock_info *lock_info;
00549    int i;
00550 
00551    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00552       return;
00553 
00554    pthread_mutex_lock(&lock_info->lock);
00555 
00556    for (i = 0; i < lock_info->num_locks; i++) {
00557       if (lock_info->locks[i].lock_addr == lock_addr) {
00558          lock_info->locks[i].times_locked++;
00559          pthread_mutex_unlock(&lock_info->lock);
00560          return;
00561       }
00562    }
00563 
00564    if (lock_info->num_locks == AST_MAX_LOCKS) {
00565       /* Can't use ast_log here, because it will cause infinite recursion */
00566       fprintf(stderr, "XXX ERROR XXX A thread holds more locks than '%d'."
00567          "  Increase AST_MAX_LOCKS!\n", AST_MAX_LOCKS);
00568       pthread_mutex_unlock(&lock_info->lock);
00569       return;
00570    }
00571 
00572    if (i && lock_info->locks[i - 1].pending == -1) {
00573       /* The last lock on the list was one that this thread tried to lock but
00574        * failed at doing so.  It has now moved on to something else, so remove
00575        * the old lock from the list. */
00576       i--;
00577       lock_info->num_locks--;
00578       memset(&lock_info->locks[i], 0, sizeof(lock_info->locks[0]));
00579    }
00580 
00581    lock_info->locks[i].file = filename;
00582    lock_info->locks[i].line_num = line_num;
00583    lock_info->locks[i].func = func;
00584    lock_info->locks[i].lock_name = lock_name;
00585    lock_info->locks[i].lock_addr = lock_addr;
00586    lock_info->locks[i].times_locked = 1;
00587    lock_info->locks[i].type = type;
00588    lock_info->locks[i].pending = 1;
00589    lock_info->num_locks++;
00590 
00591    pthread_mutex_unlock(&lock_info->lock);
00592 }
00593 
00594 void ast_mark_lock_acquired(void *lock_addr)
00595 {
00596    struct thr_lock_info *lock_info;
00597 
00598    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00599       return;
00600 
00601    pthread_mutex_lock(&lock_info->lock);
00602    if (lock_info->locks[lock_info->num_locks - 1].lock_addr == lock_addr) {
00603       lock_info->locks[lock_info->num_locks - 1].pending = 0;
00604    }
00605    pthread_mutex_unlock(&lock_info->lock);
00606 }
00607 
00608 void ast_mark_lock_failed(void *lock_addr)
00609 {
00610    struct thr_lock_info *lock_info;
00611 
00612    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00613       return;
00614 
00615    pthread_mutex_lock(&lock_info->lock);
00616    if (lock_info->locks[lock_info->num_locks - 1].lock_addr == lock_addr) {
00617       lock_info->locks[lock_info->num_locks - 1].pending = -1;
00618       lock_info->locks[lock_info->num_locks - 1].times_locked--;
00619    }
00620    pthread_mutex_unlock(&lock_info->lock);
00621 }
00622 
00623 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)
00624 {
00625    struct thr_lock_info *lock_info;
00626    int i = 0;
00627 
00628    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00629       return -1;
00630 
00631    pthread_mutex_lock(&lock_info->lock);
00632 
00633    for (i = lock_info->num_locks - 1; i >= 0; i--) {
00634       if (lock_info->locks[i].lock_addr == lock_addr)
00635          break;
00636    }
00637 
00638    if (i == -1) {
00639       /* Lock not found :( */
00640       pthread_mutex_unlock(&lock_info->lock);
00641       return -1;
00642    }
00643 
00644    ast_copy_string(filename, lock_info->locks[i].file, filename_size);
00645    *lineno = lock_info->locks[i].line_num;
00646    ast_copy_string(func, lock_info->locks[i].func, func_size);
00647    ast_copy_string(mutex_name, lock_info->locks[i].lock_name, mutex_name_size);
00648 
00649    pthread_mutex_unlock(&lock_info->lock);
00650 
00651    return 0;
00652 }
00653 
00654 void ast_remove_lock_info(void *lock_addr)
00655 {
00656    struct thr_lock_info *lock_info;
00657    int i = 0;
00658 
00659    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00660       return;
00661 
00662    pthread_mutex_lock(&lock_info->lock);
00663 
00664    for (i = lock_info->num_locks - 1; i >= 0; i--) {
00665       if (lock_info->locks[i].lock_addr == lock_addr)
00666          break;
00667    }
00668 
00669    if (i == -1) {
00670       /* Lock not found :( */
00671       pthread_mutex_unlock(&lock_info->lock);
00672       return;
00673    }
00674 
00675    if (lock_info->locks[i].times_locked > 1) {
00676       lock_info->locks[i].times_locked--;
00677       pthread_mutex_unlock(&lock_info->lock);
00678       return;
00679    }
00680 
00681    if (i < lock_info->num_locks - 1) {
00682       /* Not the last one ... *should* be rare! */
00683       memmove(&lock_info->locks[i], &lock_info->locks[i + 1], 
00684          (lock_info->num_locks - (i + 1)) * sizeof(lock_info->locks[0]));
00685    }
00686 
00687    lock_info->num_locks--;
00688 
00689    pthread_mutex_unlock(&lock_info->lock);
00690 }
00691 
00692 static const char *locktype2str(enum ast_lock_type type)
00693 {
00694    switch (type) {
00695    case AST_MUTEX:
00696       return "MUTEX";
00697    case AST_RDLOCK:
00698       return "RDLOCK";
00699    case AST_WRLOCK:
00700       return "WRLOCK";
00701    }
00702 
00703    return "UNKNOWN";
00704 }
00705 
00706 static int handle_show_locks(int fd, int argc, char *argv[])
00707 {
00708    struct thr_lock_info *lock_info;
00709    struct ast_dynamic_str *str;
00710 
00711    if (!(str = ast_dynamic_str_create(4096)))
00712       return RESULT_FAILURE;
00713 
00714    ast_dynamic_str_append(&str, 0, "\n" 
00715                "=======================================================================\n"
00716                "=== Currently Held Locks ==============================================\n"
00717                "=======================================================================\n"
00718                "===\n"
00719             "=== <file> <line num> <function> <lock name> <lock addr> (times locked)\n"
00720             "===\n");
00721 
00722    if (!str)
00723       return RESULT_FAILURE;
00724 
00725    pthread_mutex_lock(&lock_infos_lock.mutex);
00726    AST_LIST_TRAVERSE(&lock_infos, lock_info, entry) {
00727       int i;
00728       if (lock_info->num_locks) {
00729          ast_dynamic_str_append(&str, 0, "=== Thread ID: %ld (%s)\n", (long) lock_info->thread_id,
00730             lock_info->thread_name);
00731          pthread_mutex_lock(&lock_info->lock);
00732          for (i = 0; str && i < lock_info->num_locks; i++) {
00733             int j;
00734             ast_mutex_t *lock;
00735 
00736             ast_dynamic_str_append(&str, 0, "=== ---> %sLock #%d (%s): %s %d %s %s %p (%d)\n", 
00737                lock_info->locks[i].pending > 0 ? "Waiting for " : 
00738                   lock_info->locks[i].pending < 0 ? "Tried and failed to get " : "", i,
00739                lock_info->locks[i].file, 
00740                locktype2str(lock_info->locks[i].type),
00741                lock_info->locks[i].line_num,
00742                lock_info->locks[i].func, lock_info->locks[i].lock_name,
00743                lock_info->locks[i].lock_addr, 
00744                lock_info->locks[i].times_locked);
00745 
00746             if (!lock_info->locks[i].pending || lock_info->locks[i].pending == -1)
00747                continue;
00748 
00749             /* We only have further details for mutexes right now */
00750             if (lock_info->locks[i].type != AST_MUTEX)
00751                continue;
00752 
00753             lock = lock_info->locks[i].lock_addr;
00754 
00755             ast_reentrancy_lock(lock);
00756             for (j = 0; str && j < lock->reentrancy; j++) {
00757                ast_dynamic_str_append(&str, 0, "=== --- ---> Locked Here: %s line %d (%s)\n",
00758                   lock->file[j], lock->lineno[j], lock->func[j]);
00759             }
00760             ast_reentrancy_unlock(lock);  
00761          }
00762          pthread_mutex_unlock(&lock_info->lock);
00763          if (!str)
00764             break;
00765          ast_dynamic_str_append(&str, 0, "=== -------------------------------------------------------------------\n"
00766                      "===\n");
00767          if (!str)
00768             break;
00769       }
00770    }
00771    pthread_mutex_unlock(&lock_infos_lock.mutex);
00772 
00773    if (!str)
00774       return RESULT_FAILURE;
00775 
00776    ast_dynamic_str_append(&str, 0, "=======================================================================\n"
00777                "\n");
00778 
00779    if (!str)
00780       return RESULT_FAILURE;
00781 
00782    ast_cli(fd, "%s", str->str);
00783 
00784    free(str);
00785 
00786    return RESULT_SUCCESS;
00787 }
00788 
00789 static char show_locks_help[] =
00790 "Usage: core show locks\n"
00791 "       This command is for lock debugging.  It prints out which locks\n"
00792 "are owned by each active thread.\n";
00793 
00794 static struct ast_cli_entry utils_cli[] = {
00795    { { "core", "show", "locks", NULL }, handle_show_locks,
00796      "Show which locks are locked by which thread", show_locks_help },
00797 };
00798 
00799 #endif /* DEBUG_THREADS */
00800 
00801 
00802 
00803 /*
00804  * support for 'show threads'. The start routine is wrapped by
00805  * dummy_start(), so that ast_register_thread() and
00806  * ast_unregister_thread() know the thread identifier.
00807  */
00808 struct thr_arg {
00809    void *(*start_routine)(void *);
00810    void *data;
00811    char *name;
00812 };
00813 
00814 /*
00815  * on OS/X, pthread_cleanup_push() and pthread_cleanup_pop()
00816  * are odd macros which start and end a block, so they _must_ be
00817  * used in pairs (the latter with a '1' argument to call the
00818  * handler on exit.
00819  * On BSD we don't need this, but we keep it for compatibility.
00820  */
00821 static void *dummy_start(void *data)
00822 {
00823    void *ret;
00824    struct thr_arg a = *((struct thr_arg *) data);  /* make a local copy */
00825 #ifdef DEBUG_THREADS
00826    struct thr_lock_info *lock_info;
00827    pthread_mutexattr_t mutex_attr;
00828 #endif
00829 
00830    /* note that even though data->name is a pointer to allocated memory,
00831       we are not freeing it here because ast_register_thread is going to
00832       keep a copy of the pointer and then ast_unregister_thread will
00833       free the memory
00834    */
00835    free(data);
00836    ast_register_thread(a.name);
00837    pthread_cleanup_push(ast_unregister_thread, (void *) pthread_self());
00838 
00839 #ifdef DEBUG_THREADS
00840    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00841       return NULL;
00842 
00843    lock_info->thread_id = pthread_self();
00844    lock_info->thread_name = strdup(a.name);
00845 
00846    pthread_mutexattr_init(&mutex_attr);
00847    pthread_mutexattr_settype(&mutex_attr, AST_MUTEX_KIND);
00848    pthread_mutex_init(&lock_info->lock, &mutex_attr);
00849    pthread_mutexattr_destroy(&mutex_attr);
00850 
00851    pthread_mutex_lock(&lock_infos_lock.mutex); /* Intentionally not the wrapper */
00852    AST_LIST_INSERT_TAIL(&lock_infos, lock_info, entry);
00853    pthread_mutex_unlock(&lock_infos_lock.mutex); /* Intentionally not the wrapper */
00854 #endif /* DEBUG_THREADS */
00855 
00856    ret = a.start_routine(a.data);
00857 
00858    pthread_cleanup_pop(1);
00859 
00860    return ret;
00861 }
00862 
00863 #endif /* !LOW_MEMORY */
00864 
00865 int ast_pthread_create_stack(pthread_t *thread, pthread_attr_t *attr, void *(*start_routine)(void *),
00866               void *data, size_t stacksize, const char *file, const char *caller,
00867               int line, const char *start_fn)
00868 {
00869 #if !defined(LOW_MEMORY)
00870    struct thr_arg *a;
00871 #endif
00872 
00873    if (!attr) {
00874       attr = alloca(sizeof(*attr));
00875       pthread_attr_init(attr);
00876    }
00877 
00878 #ifdef __linux__
00879    /* On Linux, pthread_attr_init() defaults to PTHREAD_EXPLICIT_SCHED,
00880       which is kind of useless. Change this here to
00881       PTHREAD_INHERIT_SCHED; that way the -p option to set realtime
00882       priority will propagate down to new threads by default.
00883       This does mean that callers cannot set a different priority using
00884       PTHREAD_EXPLICIT_SCHED in the attr argument; instead they must set
00885       the priority afterwards with pthread_setschedparam(). */
00886    if ((errno = pthread_attr_setinheritsched(attr, PTHREAD_INHERIT_SCHED)))
00887       ast_log(LOG_WARNING, "pthread_attr_setinheritsched: %s\n", strerror(errno));
00888 #endif
00889 
00890    if (!stacksize)
00891       stacksize = AST_STACKSIZE;
00892 
00893    if ((errno = pthread_attr_setstacksize(attr, stacksize ? stacksize : AST_STACKSIZE)))
00894       ast_log(LOG_WARNING, "pthread_attr_setstacksize: %s\n", strerror(errno));
00895 
00896 #if !defined(LOW_MEMORY)
00897    if ((a = ast_malloc(sizeof(*a)))) {
00898       a->start_routine = start_routine;
00899       a->data = data;
00900       start_routine = dummy_start;
00901       if (asprintf(&a->name, "%-20s started at [%5d] %s %s()",
00902               start_fn, line, file, caller) < 0) {
00903          ast_log(LOG_WARNING, "asprintf() failed: %s\n", strerror(errno));
00904          a->name = NULL;
00905       }
00906       data = a;
00907    }
00908 #endif /* !LOW_MEMORY */
00909 
00910    return pthread_create(thread, attr, start_routine, data); /* We're in ast_pthread_create, so it's okay */
00911 }
00912 
00913 int ast_wait_for_input(int fd, int ms)
00914 {
00915    struct pollfd pfd[1];
00916    memset(pfd, 0, sizeof(pfd));
00917    pfd[0].fd = fd;
00918    pfd[0].events = POLLIN|POLLPRI;
00919    return ast_poll(pfd, 1, ms);
00920 }
00921 
00922 int ast_carefulwrite(int fd, char *s, int len, int timeoutms) 
00923 {
00924    struct timeval start = ast_tvnow();
00925    int res = 0;
00926    int elapsed = 0;
00927 
00928    while (len) {
00929       struct pollfd pfd = {
00930          .fd = fd,
00931          .events = POLLOUT,
00932       };
00933 
00934       /* poll() until the fd is writable without blocking */
00935       while ((res = ast_poll(&pfd, 1, timeoutms - elapsed)) <= 0) {
00936          if (res == 0) {
00937             /* timed out. */
00938             ast_log(LOG_NOTICE, "Timed out trying to write\n");
00939             return -1;
00940          } else if (res == -1) {
00941             /* poll() returned an error, check to see if it was fatal */
00942 
00943             if (errno == EINTR || errno == EAGAIN) {
00944                elapsed = ast_tvdiff_ms(ast_tvnow(), start);
00945                if (elapsed > timeoutms) {
00946                   /* We've taken too long to write 
00947                    * This is only an error condition if we haven't finished writing. */
00948                   res = len ? -1 : 0;
00949                   break;
00950                }
00951                /* This was an acceptable error, go back into poll() */
00952                continue;
00953             }
00954 
00955             /* Fatal error, bail. */
00956             ast_log(LOG_ERROR, "poll returned error: %s\n", strerror(errno));
00957 
00958             return -1;
00959          }
00960       }
00961 
00962       res = write(fd, s, len);
00963 
00964       if (res < 0 && errno != EAGAIN && errno != EINTR) {
00965          /* fatal error from write() */
00966          ast_log(LOG_ERROR, "write() returned error: %s\n", strerror(errno));
00967          return -1;
00968       }
00969 
00970       if (res < 0) {
00971          /* It was an acceptable error */
00972          res = 0;
00973       }
00974 
00975       /* Update how much data we have left to write */
00976       len -= res;
00977       s += res;
00978       res = 0;
00979 
00980       elapsed = ast_tvdiff_ms(ast_tvnow(), start);
00981       if (elapsed > timeoutms) {
00982          /* We've taken too long to write 
00983           * This is only an error condition if we haven't finished writing. */
00984          res = len ? -1 : 0;
00985          break;
00986       }
00987    }
00988 
00989    return res;
00990 }
00991 
00992 char *ast_strip_quoted(char *s, const char *beg_quotes, const char *end_quotes)
00993 {
00994    char *e;
00995    char *q;
00996 
00997    s = ast_strip(s);
00998    if ((q = strchr(beg_quotes, *s)) && *q != '\0') {
00999       e = s + strlen(s) - 1;
01000       if (*e == *(end_quotes + (q - beg_quotes))) {
01001          s++;
01002          *e = '\0';
01003       }
01004    }
01005 
01006    return s;
01007 }
01008 
01009 char *ast_unescape_semicolon(char *s)
01010 {
01011    char *e;
01012    char *work = s;
01013 
01014    while ((e = strchr(work, ';'))) {
01015       if ((e > work) && (*(e-1) == '\\')) {
01016          memmove(e - 1, e, strlen(e) + 1);
01017          work = e;
01018       } else {
01019          work = e + 1;
01020       }
01021    }
01022 
01023    return s;
01024 }
01025 
01026 int ast_build_string_va(char **buffer, size_t *space, const char *fmt, va_list ap)
01027 {
01028    int result;
01029 
01030    if (!buffer || !*buffer || !space || !*space)
01031       return -1;
01032 
01033    result = vsnprintf(*buffer, *space, fmt, ap);
01034 
01035    if (result < 0)
01036       return -1;
01037    else if (result > *space)
01038       result = *space;
01039 
01040    *buffer += result;
01041    *space -= result;
01042    return 0;
01043 }
01044 
01045 int ast_build_string(char **buffer, size_t *space, const char *fmt, ...)
01046 {
01047    va_list ap;
01048    int result;
01049 
01050    va_start(ap, fmt);
01051    result = ast_build_string_va(buffer, space, fmt, ap);
01052    va_end(ap);
01053 
01054    return result;
01055 }
01056 
01057 int ast_true(const char *s)
01058 {
01059    if (ast_strlen_zero(s))
01060       return 0;
01061 
01062    /* Determine if this is a true value */
01063    if (!strcasecmp(s, "yes") ||
01064        !strcasecmp(s, "true") ||
01065        !strcasecmp(s, "y") ||
01066        !strcasecmp(s, "t") ||
01067        !strcasecmp(s, "1") ||
01068        !strcasecmp(s, "on"))
01069       return -1;
01070 
01071    return 0;
01072 }
01073 
01074 int ast_false(const char *s)
01075 {
01076    if (ast_strlen_zero(s))
01077       return 0;
01078 
01079    /* Determine if this is a false value */
01080    if (!strcasecmp(s, "no") ||
01081        !strcasecmp(s, "false") ||
01082        !strcasecmp(s, "n") ||
01083        !strcasecmp(s, "f") ||
01084        !strcasecmp(s, "0") ||
01085        !strcasecmp(s, "off"))
01086       return -1;
01087 
01088    return 0;
01089 }
01090 
01091 #define ONE_MILLION  1000000
01092 /*
01093  * put timeval in a valid range. usec is 0..999999
01094  * negative values are not allowed and truncated.
01095  */
01096 static struct timeval tvfix(struct timeval a)
01097 {
01098    if (a.tv_usec >= ONE_MILLION) {
01099       ast_log(LOG_WARNING, "warning too large timestamp %ld.%ld\n",
01100          a.tv_sec, (long int) a.tv_usec);
01101       a.tv_sec += a.tv_usec / ONE_MILLION;
01102       a.tv_usec %= ONE_MILLION;
01103    } else if (a.tv_usec < 0) {
01104       ast_log(LOG_WARNING, "warning negative timestamp %ld.%ld\n",
01105          a.tv_sec, (long int) a.tv_usec);
01106       a.tv_usec = 0;
01107    }
01108    return a;
01109 }
01110 
01111 struct timeval ast_tvadd(struct timeval a, struct timeval b)
01112 {
01113    /* consistency checks to guarantee usec in 0..999999 */
01114    a = tvfix(a);
01115    b = tvfix(b);
01116    a.tv_sec += b.tv_sec;
01117    a.tv_usec += b.tv_usec;
01118    if (a.tv_usec >= ONE_MILLION) {
01119       a.tv_sec++;
01120       a.tv_usec -= ONE_MILLION;
01121    }
01122    return a;
01123 }
01124 
01125 struct timeval ast_tvsub(struct timeval a, struct timeval b)
01126 {
01127    /* consistency checks to guarantee usec in 0..999999 */
01128    a = tvfix(a);
01129    b = tvfix(b);
01130    a.tv_sec -= b.tv_sec;
01131    a.tv_usec -= b.tv_usec;
01132    if (a.tv_usec < 0) {
01133       a.tv_sec-- ;
01134       a.tv_usec += ONE_MILLION;
01135    }
01136    return a;
01137 }
01138 #undef ONE_MILLION
01139 
01140 /*! \brief glibc puts a lock inside random(3), so that the results are thread-safe.
01141  * BSD libc (and others) do not. */
01142 #ifndef linux
01143 
01144 AST_MUTEX_DEFINE_STATIC(randomlock);
01145 
01146 long int ast_random(void)
01147 {
01148    long int res;
01149    ast_mutex_lock(&randomlock);
01150    res = random();
01151    ast_mutex_unlock(&randomlock);
01152    return res;
01153 }
01154 #endif
01155 
01156 char *ast_process_quotes_and_slashes(char *start, char find, char replace_with)
01157 {
01158    char *dataPut = start;
01159    int inEscape = 0;
01160    int inQuotes = 0;
01161 
01162    for (; *start; start++) {
01163       if (inEscape) {
01164          *dataPut++ = *start;       /* Always goes verbatim */
01165          inEscape = 0;
01166       } else {
01167          if (*start == '\\') {
01168             inEscape = 1;      /* Do not copy \ into the data */
01169          } else if (*start == '\'') {
01170             inQuotes = 1 - inQuotes;   /* Do not copy ' into the data */
01171          } else {
01172             /* Replace , with |, unless in quotes */
01173             *dataPut++ = inQuotes ? *start : ((*start == find) ? replace_with : *start);
01174          }
01175       }
01176    }
01177    if (start != dataPut)
01178       *dataPut = 0;
01179    return dataPut;
01180 }
01181 
01182 void ast_join(char *s, size_t len, char * const w[])
01183 {
01184    int x, ofs = 0;
01185    const char *src;
01186 
01187    /* Join words into a string */
01188    if (!s)
01189       return;
01190    for (x = 0; ofs < len && w[x]; x++) {
01191       if (x > 0)
01192          s[ofs++] = ' ';
01193       for (src = w[x]; *src && ofs < len; src++)
01194          s[ofs++] = *src;
01195    }
01196    if (ofs == len)
01197       ofs--;
01198    s[ofs] = '\0';
01199 }
01200 
01201 const char __ast_string_field_empty[] = "";
01202 
01203 static int add_string_pool(struct ast_string_field_mgr *mgr, size_t size)
01204 {
01205    struct ast_string_field_pool *pool;
01206 
01207    if (!(pool = ast_calloc(1, sizeof(*pool) + size)))
01208       return -1;
01209    
01210    pool->prev = mgr->pool;
01211    mgr->pool = pool;
01212    mgr->size = size;
01213    mgr->space = size;
01214    mgr->used = 0;
01215 
01216    return 0;
01217 }
01218 
01219 int __ast_string_field_init(struct ast_string_field_mgr *mgr, size_t size,
01220              ast_string_field *fields, int num_fields)
01221 {
01222    int index;
01223 
01224    if (add_string_pool(mgr, size))
01225       return -1;
01226 
01227    for (index = 0; index < num_fields; index++)
01228       fields[index] = __ast_string_field_empty;
01229 
01230    return 0;
01231 }
01232 
01233 ast_string_field __ast_string_field_alloc_space(struct ast_string_field_mgr *mgr, size_t needed,
01234                   ast_string_field *fields, int num_fields)
01235 {
01236    char *result = NULL;
01237 
01238    if (__builtin_expect(needed > mgr->space, 0)) {
01239       size_t new_size = mgr->size * 2;
01240 
01241       while (new_size < needed)
01242          new_size *= 2;
01243 
01244       if (add_string_pool(mgr, new_size))
01245          return NULL;
01246    }
01247 
01248    result = mgr->pool->base + mgr->used;
01249    mgr->used += needed;
01250    mgr->space -= needed;
01251    return result;
01252 }
01253 
01254 void __ast_string_field_index_build_va(struct ast_string_field_mgr *mgr,
01255                    ast_string_field *fields, int num_fields,
01256                    int index, const char *format, va_list ap1, va_list ap2)
01257 {
01258    size_t needed;
01259    size_t available;
01260    char *target;
01261 
01262    /* if the field already has space allocated, try to reuse it;
01263       otherwise, use the empty space at the end of the current
01264       pool
01265    */
01266    if (fields[index][0] != '\0') {
01267       target = (char *) fields[index];
01268       available = strlen(fields[index]) + 1;
01269    } else {
01270       target = mgr->pool->base + mgr->used;
01271       available = mgr->space;
01272    }
01273 
01274    needed = vsnprintf(target, available, format, ap1) + 1;
01275 
01276    va_end(ap1);
01277 
01278    if (needed > available) {
01279       /* if the space needed can be satisfied by using the current
01280          pool (which could only occur if we tried to use the field's
01281          allocated space and failed), then use that space; otherwise
01282          allocate a new pool
01283       */
01284       if (needed <= mgr->space) {
01285          target = mgr->pool->base + mgr->used;
01286       } else {
01287          size_t new_size = mgr->size * 2;
01288 
01289          while (new_size < needed)
01290             new_size *= 2;
01291          
01292          if (add_string_pool(mgr, new_size))
01293             return;
01294          
01295          target = mgr->pool->base + mgr->used;
01296       }
01297 
01298       vsprintf(target, format, ap2);
01299    }
01300 
01301    if (fields[index] != target) {
01302       fields[index] = target;
01303       mgr->used += needed;
01304       mgr->space -= needed;
01305    }
01306 }
01307 
01308 void __ast_string_field_index_build(struct ast_string_field_mgr *mgr,
01309                 ast_string_field *fields, int num_fields,
01310                 int index, const char *format, ...)
01311 {
01312    va_list ap1, ap2;
01313 
01314    va_start(ap1, format);
01315    va_start(ap2, format);     /* va_copy does not exist on FreeBSD */
01316 
01317    __ast_string_field_index_build_va(mgr, fields, num_fields, index, format, ap1, ap2);
01318 
01319    va_end(ap1);
01320    va_end(ap2);
01321 }
01322 
01323 AST_MUTEX_DEFINE_STATIC(fetchadd_m); /* used for all fetc&add ops */
01324 
01325 int ast_atomic_fetchadd_int_slow(volatile int *p, int v)
01326 {
01327         int ret;
01328         ast_mutex_lock(&fetchadd_m);
01329         ret = *p;
01330         *p += v;
01331         ast_mutex_unlock(&fetchadd_m);
01332         return ret;
01333 }
01334 
01335 /*! \brief
01336  * get values from config variables.
01337  */
01338 int ast_get_time_t(const char *src, time_t *dst, time_t _default, int *consumed)
01339 {
01340    long t;
01341    int scanned;
01342 
01343    if (dst == NULL)
01344       return -1;
01345 
01346    *dst = _default;
01347 
01348    if (ast_strlen_zero(src))
01349       return -1;
01350 
01351    /* only integer at the moment, but one day we could accept more formats */
01352    if (sscanf(src, "%30ld%n", &t, &scanned) == 1) {
01353       *dst = t;
01354       if (consumed)
01355          *consumed = scanned;
01356       return 0;
01357    } else
01358       return -1;
01359 }
01360 
01361 int ast_dynamic_str_thread_build_va(struct ast_dynamic_str **buf, size_t max_len,
01362    struct ast_threadstorage *ts, int append, const char *fmt, va_list ap)
01363 {
01364    int res;
01365    int offset = (append && (*buf)->len) ? strlen((*buf)->str) : 0;
01366 #if defined(DEBUG_THREADLOCALS)
01367    struct ast_dynamic_str *old_buf = *buf;
01368 #endif /* defined(DEBUG_THREADLOCALS) */
01369 
01370    res = vsnprintf((*buf)->str + offset, (*buf)->len - offset, fmt, ap);
01371 
01372    /* Check to see if there was not enough space in the string buffer to prepare
01373     * the string.  Also, if a maximum length is present, make sure the current
01374     * length is less than the maximum before increasing the size. */
01375    if ((res + offset + 1) > (*buf)->len && (max_len ? ((*buf)->len < max_len) : 1)) {
01376       /* Set the new size of the string buffer to be the size needed
01377        * to hold the resulting string (res) plus one byte for the
01378        * terminating '\0'.  If this size is greater than the max, set
01379        * the new length to be the maximum allowed. */
01380       if (max_len)
01381          (*buf)->len = ((res + offset + 1) < max_len) ? (res + offset + 1) : max_len;
01382       else
01383          (*buf)->len = res + offset + 1;
01384 
01385       if (!(*buf = ast_realloc(*buf, (*buf)->len + sizeof(*(*buf)))))
01386          return AST_DYNSTR_BUILD_FAILED;
01387 
01388       if (append)
01389          (*buf)->str[offset] = '\0';
01390 
01391       if (ts) {
01392          pthread_setspecific(ts->key, *buf);
01393 #if defined(DEBUG_THREADLOCALS)
01394          __ast_threadstorage_object_replace(old_buf, *buf, (*buf)->len + sizeof(*(*buf)));
01395 #endif /* defined(DEBUG_THREADLOCALS) */
01396       }
01397 
01398       /* va_end() and va_start() must be done before calling
01399        * vsnprintf() again. */
01400       return AST_DYNSTR_BUILD_RETRY;
01401    }
01402 
01403    return res;
01404 }
01405 
01406 void ast_enable_packet_fragmentation(int sock)
01407 {
01408 #if defined(HAVE_IP_MTU_DISCOVER)
01409    int val = IP_PMTUDISC_DONT;
01410    
01411    if (setsockopt(sock, IPPROTO_IP, IP_MTU_DISCOVER, &val, sizeof(val)))
01412       ast_log(LOG_WARNING, "Unable to disable PMTU discovery. Large UDP packets may fail to be delivered when sent from this socket.\n");
01413 #endif /* HAVE_IP_MTU_DISCOVER */
01414 }
01415 
01416 int ast_utils_init(void)
01417 {
01418    base64_init();
01419 #ifdef DEBUG_THREADS
01420 #if !defined(LOW_MEMORY)
01421    ast_cli_register_multiple(utils_cli, sizeof(utils_cli) / sizeof(utils_cli[0]));
01422 #endif
01423 #endif
01424    return 0;
01425 }
01426 
01427 #ifndef __AST_DEBUG_MALLOC
01428 int _ast_asprintf(char **ret, const char *file, int lineno, const char *func, const char *fmt, ...)
01429 {
01430    int res;
01431    va_list ap;
01432 
01433    va_start(ap, fmt);
01434    if ((res = vasprintf(ret, fmt, ap)) == -1) {
01435       MALLOC_FAILURE_MSG;
01436    }
01437    va_end(ap);
01438 
01439    return res;
01440 }
01441 #endif

Generated on Thu Dec 17 13:33:38 2009 for Asterisk - the Open Source PBX by  doxygen 1.4.7