Fri Sep 25 19:28:16 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: 93377 $")
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 
00232 
00233 AST_MUTEX_DEFINE_STATIC(test_lock);
00234 AST_MUTEX_DEFINE_STATIC(test_lock2);
00235 static pthread_t test_thread; 
00236 static int lock_count = 0;
00237 static int test_errors = 0;
00238 
00239 /*! \brief This is a regression test for recursive mutexes.
00240    test_for_thread_safety() will return 0 if recursive mutex locks are
00241    working properly, and non-zero if they are not working properly. */
00242 static void *test_thread_body(void *data) 
00243 { 
00244    ast_mutex_lock(&test_lock);
00245    lock_count += 10;
00246    if (lock_count != 10) 
00247       test_errors++;
00248    ast_mutex_lock(&test_lock);
00249    lock_count += 10;
00250    if (lock_count != 20) 
00251       test_errors++;
00252    ast_mutex_lock(&test_lock2);
00253    ast_mutex_unlock(&test_lock);
00254    lock_count -= 10;
00255    if (lock_count != 10) 
00256       test_errors++;
00257    ast_mutex_unlock(&test_lock);
00258    lock_count -= 10;
00259    ast_mutex_unlock(&test_lock2);
00260    if (lock_count != 0) 
00261       test_errors++;
00262    return NULL;
00263 } 
00264 
00265 int test_for_thread_safety(void)
00266 { 
00267    ast_mutex_lock(&test_lock2);
00268    ast_mutex_lock(&test_lock);
00269    lock_count += 1;
00270    ast_mutex_lock(&test_lock);
00271    lock_count += 1;
00272    ast_pthread_create(&test_thread, NULL, test_thread_body, NULL); 
00273    usleep(100);
00274    if (lock_count != 2) 
00275       test_errors++;
00276    ast_mutex_unlock(&test_lock);
00277    lock_count -= 1;
00278    usleep(100); 
00279    if (lock_count != 1) 
00280       test_errors++;
00281    ast_mutex_unlock(&test_lock);
00282    lock_count -= 1;
00283    if (lock_count != 0) 
00284       test_errors++;
00285    ast_mutex_unlock(&test_lock2);
00286    usleep(100);
00287    if (lock_count != 0) 
00288       test_errors++;
00289    pthread_join(test_thread, NULL);
00290    return(test_errors);          /* return 0 on success. */
00291 }
00292 
00293 /*! \brief Produce 32 char MD5 hash of value. */
00294 void ast_md5_hash(char *output, char *input)
00295 {
00296    struct MD5Context md5;
00297    unsigned char digest[16];
00298    char *ptr;
00299    int x;
00300 
00301    MD5Init(&md5);
00302    MD5Update(&md5, (unsigned char *)input, strlen(input));
00303    MD5Final(digest, &md5);
00304    ptr = output;
00305    for (x = 0; x < 16; x++)
00306       ptr += sprintf(ptr, "%2.2x", digest[x]);
00307 }
00308 
00309 /*! \brief Produce 40 char SHA1 hash of value. */
00310 void ast_sha1_hash(char *output, char *input)
00311 {
00312    struct SHA1Context sha;
00313    char *ptr;
00314    int x;
00315    uint8_t Message_Digest[20];
00316 
00317    SHA1Reset(&sha);
00318    
00319    SHA1Input(&sha, (const unsigned char *) input, strlen(input));
00320 
00321    SHA1Result(&sha, Message_Digest);
00322    ptr = output;
00323    for (x = 0; x < 20; x++)
00324       ptr += sprintf(ptr, "%2.2x", Message_Digest[x]);
00325 }
00326 
00327 /*! \brief decode BASE64 encoded text */
00328 int ast_base64decode(unsigned char *dst, const char *src, int max)
00329 {
00330    int cnt = 0;
00331    unsigned int byte = 0;
00332    unsigned int bits = 0;
00333    int incnt = 0;
00334    while(*src && (cnt < max)) {
00335       /* Shift in 6 bits of input */
00336       byte <<= 6;
00337       byte |= (b2a[(int)(*src)]) & 0x3f;
00338       bits += 6;
00339       src++;
00340       incnt++;
00341       /* If we have at least 8 bits left over, take that character 
00342          off the top */
00343       if (bits >= 8)  {
00344          bits -= 8;
00345          *dst = (byte >> bits) & 0xff;
00346          dst++;
00347          cnt++;
00348       }
00349    }
00350    /* Dont worry about left over bits, they're extra anyway */
00351    return cnt;
00352 }
00353 
00354 /*! \brief encode text to BASE64 coding */
00355 int ast_base64encode_full(char *dst, const unsigned char *src, int srclen, int max, int linebreaks)
00356 {
00357    int cnt = 0;
00358    int col = 0;
00359    unsigned int byte = 0;
00360    int bits = 0;
00361    int cntin = 0;
00362    /* Reserve space for null byte at end of string */
00363    max--;
00364    while ((cntin < srclen) && (cnt < max)) {
00365       byte <<= 8;
00366       byte |= *(src++);
00367       bits += 8;
00368       cntin++;
00369       if ((bits == 24) && (cnt + 4 <= max)) {
00370          *dst++ = base64[(byte >> 18) & 0x3f];
00371          *dst++ = base64[(byte >> 12) & 0x3f];
00372          *dst++ = base64[(byte >> 6) & 0x3f];
00373          *dst++ = base64[byte & 0x3f];
00374          cnt += 4;
00375          col += 4;
00376          bits = 0;
00377          byte = 0;
00378       }
00379       if (linebreaks && (cnt < max) && (col == 64)) {
00380          *dst++ = '\n';
00381          cnt++;
00382          col = 0;
00383       }
00384    }
00385    if (bits && (cnt + 4 <= max)) {
00386       /* Add one last character for the remaining bits, 
00387          padding the rest with 0 */
00388       byte <<= 24 - bits;
00389       *dst++ = base64[(byte >> 18) & 0x3f];
00390       *dst++ = base64[(byte >> 12) & 0x3f];
00391       if (bits == 16)
00392          *dst++ = base64[(byte >> 6) & 0x3f];
00393       else
00394          *dst++ = '=';
00395       *dst++ = '=';
00396       cnt += 4;
00397    }
00398    if (linebreaks && (cnt < max)) {
00399       *dst++ = '\n';
00400       cnt++;
00401    }
00402    *dst = '\0';
00403    return cnt;
00404 }
00405 
00406 int ast_base64encode(char *dst, const unsigned char *src, int srclen, int max)
00407 {
00408    return ast_base64encode_full(dst, src, srclen, max, 0);
00409 }
00410 
00411 static void base64_init(void)
00412 {
00413    int x;
00414    memset(b2a, -1, sizeof(b2a));
00415    /* Initialize base-64 Conversion table */
00416    for (x = 0; x < 26; x++) {
00417       /* A-Z */
00418       base64[x] = 'A' + x;
00419       b2a['A' + x] = x;
00420       /* a-z */
00421       base64[x + 26] = 'a' + x;
00422       b2a['a' + x] = x + 26;
00423       /* 0-9 */
00424       if (x < 10) {
00425          base64[x + 52] = '0' + x;
00426          b2a['0' + x] = x + 52;
00427       }
00428    }
00429    base64[62] = '+';
00430    base64[63] = '/';
00431    b2a[(int)'+'] = 62;
00432    b2a[(int)'/'] = 63;
00433 }
00434 
00435 /*! \brief  ast_uri_encode: Turn text string to URI-encoded %XX version
00436 \note    At this point, we're converting from ISO-8859-x (8-bit), not UTF8
00437    as in the SIP protocol spec 
00438    If doreserved == 1 we will convert reserved characters also.
00439    RFC 2396, section 2.4
00440    outbuf needs to have more memory allocated than the instring
00441    to have room for the expansion. Every char that is converted
00442    is replaced by three ASCII characters.
00443 
00444    Note: The doreserved option is needed for replaces header in
00445    SIP transfers.
00446 */
00447 char *ast_uri_encode(const char *string, char *outbuf, int buflen, int doreserved) 
00448 {
00449    char *reserved = ";/?:@&=+$, ";  /* Reserved chars */
00450 
00451    const char *ptr  = string; /* Start with the string */
00452    char *out = NULL;
00453    char *buf = NULL;
00454 
00455    ast_copy_string(outbuf, string, buflen);
00456 
00457    /* If there's no characters to convert, just go through and don't do anything */
00458    while (*ptr) {
00459       if (((unsigned char) *ptr) > 127 || (doreserved && strchr(reserved, *ptr)) ) {
00460          /* Oops, we need to start working here */
00461          if (!buf) {
00462             buf = outbuf;
00463             out = buf + (ptr - string) ;  /* Set output ptr */
00464          }
00465          out += sprintf(out, "%%%02x", (unsigned char) *ptr);
00466       } else if (buf) {
00467          *out = *ptr;   /* Continue copying the string */
00468          out++;
00469       } 
00470       ptr++;
00471    }
00472    if (buf)
00473       *out = '\0';
00474    return outbuf;
00475 }
00476 
00477 /*! \brief  ast_uri_decode: Decode SIP URI, URN, URL (overwrite the string)  */
00478 void ast_uri_decode(char *s) 
00479 {
00480    char *o;
00481    unsigned int tmp;
00482 
00483    for (o = s; *s; s++, o++) {
00484       if (*s == '%' && strlen(s) > 2 && sscanf(s + 1, "%2x", &tmp) == 1) {
00485          /* have '%', two chars and correct parsing */
00486          *o = tmp;
00487          s += 2;  /* Will be incremented once more when we break out */
00488       } else /* all other cases, just copy */
00489          *o = *s;
00490    }
00491    *o = '\0';
00492 }
00493 
00494 /*! \brief  ast_inet_ntoa: Recursive thread safe replacement of inet_ntoa */
00495 const char *ast_inet_ntoa(struct in_addr ia)
00496 {
00497    char *buf;
00498 
00499    if (!(buf = ast_threadstorage_get(&inet_ntoa_buf, INET_ADDRSTRLEN)))
00500       return "";
00501 
00502    return inet_ntop(AF_INET, &ia, buf, INET_ADDRSTRLEN);
00503 }
00504 
00505 #ifndef __linux__
00506 #undef pthread_create /* For ast_pthread_create function only */
00507 #endif /* !__linux__ */
00508 
00509 #if !defined(LOW_MEMORY)
00510 
00511 #ifdef DEBUG_THREADS
00512 
00513 /*! \brief A reasonable maximum number of locks a thread would be holding ... */
00514 #define AST_MAX_LOCKS 32
00515 
00516 /* Allow direct use of pthread_mutex_t and friends */
00517 #undef pthread_mutex_t
00518 #undef pthread_mutex_lock
00519 #undef pthread_mutex_unlock
00520 #undef pthread_mutex_init
00521 #undef pthread_mutex_destroy
00522 
00523 /*! 
00524  * \brief Keep track of which locks a thread holds 
00525  *
00526  * There is an instance of this struct for every active thread
00527  */
00528 struct thr_lock_info {
00529    /*! The thread's ID */
00530    pthread_t thread_id;
00531    /*! The thread name which includes where the thread was started */
00532    const char *thread_name;
00533    /*! This is the actual container of info for what locks this thread holds */
00534    struct {
00535       const char *file;
00536       int line_num;
00537       const char *func;
00538       const char *lock_name;
00539       void *lock_addr;
00540       int times_locked;
00541       enum ast_lock_type type;
00542       /*! This thread is waiting on this lock */
00543       int pending:2;
00544    } locks[AST_MAX_LOCKS];
00545    /*! This is the number of locks currently held by this thread.
00546     *  The index (num_locks - 1) has the info on the last one in the
00547     *  locks member */
00548    unsigned int num_locks;
00549    /*! Protects the contents of the locks member 
00550     * Intentionally not ast_mutex_t */
00551    pthread_mutex_t lock;
00552    AST_LIST_ENTRY(thr_lock_info) entry;
00553 };
00554 
00555 /*! 
00556  * \brief Locked when accessing the lock_infos list 
00557  */
00558 AST_MUTEX_DEFINE_STATIC(lock_infos_lock);
00559 /*!
00560  * \brief A list of each thread's lock info 
00561  */
00562 static AST_LIST_HEAD_NOLOCK_STATIC(lock_infos, thr_lock_info);
00563 
00564 /*!
00565  * \brief Destroy a thread's lock info
00566  *
00567  * This gets called automatically when the thread stops
00568  */
00569 static void lock_info_destroy(void *data)
00570 {
00571    struct thr_lock_info *lock_info = data;
00572 
00573    pthread_mutex_lock(&lock_infos_lock.mutex);
00574    AST_LIST_REMOVE(&lock_infos, lock_info, entry);
00575    pthread_mutex_unlock(&lock_infos_lock.mutex);
00576 
00577    pthread_mutex_destroy(&lock_info->lock);
00578    free((void *) lock_info->thread_name);
00579    free(lock_info);
00580 }
00581 
00582 /*!
00583  * \brief The thread storage key for per-thread lock info
00584  */
00585 AST_THREADSTORAGE_CUSTOM(thread_lock_info, thread_lock_info_init, lock_info_destroy);
00586 
00587 void ast_store_lock_info(enum ast_lock_type type, const char *filename,
00588    int line_num, const char *func, const char *lock_name, void *lock_addr)
00589 {
00590    struct thr_lock_info *lock_info;
00591    int i;
00592 
00593    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00594       return;
00595 
00596    pthread_mutex_lock(&lock_info->lock);
00597 
00598    for (i = 0; i < lock_info->num_locks; i++) {
00599       if (lock_info->locks[i].lock_addr == lock_addr) {
00600          lock_info->locks[i].times_locked++;
00601          pthread_mutex_unlock(&lock_info->lock);
00602          return;
00603       }
00604    }
00605 
00606    if (lock_info->num_locks == AST_MAX_LOCKS) {
00607       /* Can't use ast_log here, because it will cause infinite recursion */
00608       fprintf(stderr, "XXX ERROR XXX A thread holds more locks than '%d'."
00609          "  Increase AST_MAX_LOCKS!\n", AST_MAX_LOCKS);
00610       pthread_mutex_unlock(&lock_info->lock);
00611       return;
00612    }
00613    
00614    lock_info->locks[i].file = filename;
00615    lock_info->locks[i].line_num = line_num;
00616    lock_info->locks[i].func = func;
00617    lock_info->locks[i].lock_name = lock_name;
00618    lock_info->locks[i].lock_addr = lock_addr;
00619    lock_info->locks[i].times_locked = 1;
00620    lock_info->locks[i].type = type;
00621    lock_info->locks[i].pending = 1;
00622    lock_info->num_locks++;
00623 
00624    pthread_mutex_unlock(&lock_info->lock);
00625 }
00626 
00627 void ast_mark_lock_acquired(void)
00628 {
00629    struct thr_lock_info *lock_info;
00630 
00631    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00632       return;
00633 
00634    pthread_mutex_lock(&lock_info->lock);
00635    lock_info->locks[lock_info->num_locks - 1].pending = 0;
00636    pthread_mutex_unlock(&lock_info->lock);
00637 }
00638 
00639 void ast_mark_lock_failed(void)
00640 {
00641    struct thr_lock_info *lock_info;
00642 
00643    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00644       return;
00645 
00646    pthread_mutex_lock(&lock_info->lock);
00647    lock_info->locks[lock_info->num_locks - 1].pending = -1;
00648    lock_info->locks[lock_info->num_locks - 1].times_locked--;
00649    pthread_mutex_unlock(&lock_info->lock);
00650 }
00651 
00652 void ast_remove_lock_info(void *lock_addr)
00653 {
00654    struct thr_lock_info *lock_info;
00655    int i = 0;
00656 
00657    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00658       return;
00659 
00660    pthread_mutex_lock(&lock_info->lock);
00661 
00662    for (i = lock_info->num_locks - 1; i >= 0; i--) {
00663       if (lock_info->locks[i].lock_addr == lock_addr)
00664          break;
00665    }
00666 
00667    if (i == -1) {
00668       /* Lock not found :( */
00669       pthread_mutex_unlock(&lock_info->lock);
00670       return;
00671    }
00672 
00673    if (lock_info->locks[i].times_locked > 1) {
00674       lock_info->locks[i].times_locked--;
00675       pthread_mutex_unlock(&lock_info->lock);
00676       return;
00677    }
00678 
00679    if (i < lock_info->num_locks - 1) {
00680       /* Not the last one ... *should* be rare! */
00681       memmove(&lock_info->locks[i], &lock_info->locks[i + 1], 
00682          (lock_info->num_locks - (i + 1)) * sizeof(lock_info->locks[0]));
00683    }
00684 
00685    lock_info->num_locks--;
00686 
00687    pthread_mutex_unlock(&lock_info->lock);
00688 }
00689 
00690 static const char *locktype2str(enum ast_lock_type type)
00691 {
00692    switch (type) {
00693    case AST_MUTEX:
00694       return "MUTEX";
00695    case AST_RDLOCK:
00696       return "RDLOCK";
00697    case AST_WRLOCK:
00698       return "WRLOCK";
00699    }
00700 
00701    return "UNKNOWN";
00702 }
00703 
00704 static int handle_show_locks(int fd, int argc, char *argv[])
00705 {
00706    struct thr_lock_info *lock_info;
00707    struct ast_dynamic_str *str;
00708 
00709    if (!(str = ast_dynamic_str_create(4096)))
00710       return RESULT_FAILURE;
00711 
00712    ast_dynamic_str_append(&str, 0, "\n" 
00713                "=======================================================================\n"
00714                "=== Currently Held Locks ==============================================\n"
00715                "=======================================================================\n"
00716                "===\n"
00717             "=== <file> <line num> <function> <lock name> <lock addr> (times locked)\n"
00718             "===\n");
00719 
00720    if (!str)
00721       return RESULT_FAILURE;
00722 
00723    pthread_mutex_lock(&lock_infos_lock.mutex);
00724    AST_LIST_TRAVERSE(&lock_infos, lock_info, entry) {
00725       int i;
00726       ast_dynamic_str_append(&str, 0, "=== Thread ID: %u (%s)\n", (int) lock_info->thread_id,
00727          lock_info->thread_name);
00728       pthread_mutex_lock(&lock_info->lock);
00729       for (i = 0; str && i < lock_info->num_locks; i++) {
00730          int j;
00731          ast_mutex_t *lock;
00732 
00733          ast_dynamic_str_append(&str, 0, "=== ---> %sLock #%d (%s): %s %d %s %s %p (%d)\n", 
00734             lock_info->locks[i].pending > 0 ? "Waiting for " : 
00735                lock_info->locks[i].pending < 0 ? "Tried and failed to get " : "", i,
00736             lock_info->locks[i].file, 
00737             locktype2str(lock_info->locks[i].type),
00738             lock_info->locks[i].line_num,
00739             lock_info->locks[i].func, lock_info->locks[i].lock_name,
00740             lock_info->locks[i].lock_addr, 
00741             lock_info->locks[i].times_locked);
00742 
00743          if (!lock_info->locks[i].pending || lock_info->locks[i].pending == -1)
00744             continue;
00745 
00746          /* We only have further details for mutexes right now */
00747          if (lock_info->locks[i].type != AST_MUTEX)
00748             continue;
00749 
00750          lock = lock_info->locks[i].lock_addr;
00751 
00752          ast_reentrancy_lock(lock);
00753          for (j = 0; str && j < lock->reentrancy; j++) {
00754             ast_dynamic_str_append(&str, 0, "=== --- ---> Locked Here: %s line %d (%s)\n",
00755                lock->file[j], lock->lineno[j], lock->func[j]);
00756          }
00757          ast_reentrancy_unlock(lock);  
00758       }
00759       pthread_mutex_unlock(&lock_info->lock);
00760       if (!str)
00761          break;
00762       ast_dynamic_str_append(&str, 0, "=== -------------------------------------------------------------------\n"
00763                   "===\n");
00764       if (!str)
00765          break;
00766    }
00767    pthread_mutex_unlock(&lock_infos_lock.mutex);
00768 
00769    if (!str)
00770       return RESULT_FAILURE;
00771 
00772    ast_dynamic_str_append(&str, 0, "=======================================================================\n"
00773                "\n");
00774 
00775    if (!str)
00776       return RESULT_FAILURE;
00777 
00778    ast_cli(fd, "%s", str->str);
00779 
00780    free(str);
00781 
00782    return RESULT_SUCCESS;
00783 }
00784 
00785 static char show_locks_help[] =
00786 "Usage: core show locks\n"
00787 "       This command is for lock debugging.  It prints out which locks\n"
00788 "are owned by each active thread.\n";
00789 
00790 static struct ast_cli_entry utils_cli[] = {
00791    { { "core", "show", "locks", NULL }, handle_show_locks,
00792      "Show which locks are locked by which thread", show_locks_help },
00793 };
00794 
00795 #endif /* DEBUG_THREADS */
00796 
00797 
00798 
00799 /*
00800  * support for 'show threads'. The start routine is wrapped by
00801  * dummy_start(), so that ast_register_thread() and
00802  * ast_unregister_thread() know the thread identifier.
00803  */
00804 struct thr_arg {
00805    void *(*start_routine)(void *);
00806    void *data;
00807    char *name;
00808 };
00809 
00810 /*
00811  * on OS/X, pthread_cleanup_push() and pthread_cleanup_pop()
00812  * are odd macros which start and end a block, so they _must_ be
00813  * used in pairs (the latter with a '1' argument to call the
00814  * handler on exit.
00815  * On BSD we don't need this, but we keep it for compatibility.
00816  */
00817 static void *dummy_start(void *data)
00818 {
00819    void *ret;
00820    struct thr_arg a = *((struct thr_arg *) data);  /* make a local copy */
00821 #ifdef DEBUG_THREADS
00822    struct thr_lock_info *lock_info;
00823    pthread_mutexattr_t mutex_attr;
00824 #endif
00825 
00826    /* note that even though data->name is a pointer to allocated memory,
00827       we are not freeing it here because ast_register_thread is going to
00828       keep a copy of the pointer and then ast_unregister_thread will
00829       free the memory
00830    */
00831    free(data);
00832    ast_register_thread(a.name);
00833    pthread_cleanup_push(ast_unregister_thread, (void *) pthread_self());
00834 
00835 #ifdef DEBUG_THREADS
00836    if (!(lock_info = ast_threadstorage_get(&thread_lock_info, sizeof(*lock_info))))
00837       return NULL;
00838 
00839    lock_info->thread_id = pthread_self();
00840    lock_info->thread_name = strdup(a.name);
00841 
00842    pthread_mutexattr_init(&mutex_attr);
00843    pthread_mutexattr_settype(&mutex_attr, AST_MUTEX_KIND);
00844    pthread_mutex_init(&lock_info->lock, &mutex_attr);
00845    pthread_mutexattr_destroy(&mutex_attr);
00846 
00847    pthread_mutex_lock(&lock_infos_lock.mutex); /* Intentionally not the wrapper */
00848    AST_LIST_INSERT_TAIL(&lock_infos, lock_info, entry);
00849    pthread_mutex_unlock(&lock_infos_lock.mutex); /* Intentionally not the wrapper */
00850 #endif /* DEBUG_THREADS */
00851 
00852    ret = a.start_routine(a.data);
00853 
00854    pthread_cleanup_pop(1);
00855 
00856    return ret;
00857 }
00858 
00859 #endif /* !LOW_MEMORY */
00860 
00861 int ast_pthread_create_stack(pthread_t *thread, pthread_attr_t *attr, void *(*start_routine)(void *),
00862               void *data, size_t stacksize, const char *file, const char *caller,
00863               int line, const char *start_fn)
00864 {
00865 #if !defined(LOW_MEMORY)
00866    struct thr_arg *a;
00867 #endif
00868 
00869    if (!attr) {
00870       attr = alloca(sizeof(*attr));
00871       pthread_attr_init(attr);
00872    }
00873 
00874 #ifdef __linux__
00875    /* On Linux, pthread_attr_init() defaults to PTHREAD_EXPLICIT_SCHED,
00876       which is kind of useless. Change this here to
00877       PTHREAD_INHERIT_SCHED; that way the -p option to set realtime
00878       priority will propagate down to new threads by default.
00879       This does mean that callers cannot set a different priority using
00880       PTHREAD_EXPLICIT_SCHED in the attr argument; instead they must set
00881       the priority afterwards with pthread_setschedparam(). */
00882    if ((errno = pthread_attr_setinheritsched(attr, PTHREAD_INHERIT_SCHED)))
00883       ast_log(LOG_WARNING, "pthread_attr_setinheritsched: %s\n", strerror(errno));
00884 #endif
00885 
00886    if (!stacksize)
00887       stacksize = AST_STACKSIZE;
00888 
00889    if ((errno = pthread_attr_setstacksize(attr, stacksize ? stacksize : AST_STACKSIZE)))
00890       ast_log(LOG_WARNING, "pthread_attr_setstacksize: %s\n", strerror(errno));
00891 
00892 #if !defined(LOW_MEMORY)
00893    if ((a = ast_malloc(sizeof(*a)))) {
00894       a->start_routine = start_routine;
00895       a->data = data;
00896       start_routine = dummy_start;
00897       asprintf(&a->name, "%-20s started at [%5d] %s %s()",
00898           start_fn, line, file, caller);
00899       data = a;
00900    }
00901 #endif /* !LOW_MEMORY */
00902 
00903    return pthread_create(thread, attr, start_routine, data); /* We're in ast_pthread_create, so it's okay */
00904 }
00905 
00906 int ast_wait_for_input(int fd, int ms)
00907 {
00908    struct pollfd pfd[1];
00909    memset(pfd, 0, sizeof(pfd));
00910    pfd[0].fd = fd;
00911    pfd[0].events = POLLIN|POLLPRI;
00912    return poll(pfd, 1, ms);
00913 }
00914 
00915 int ast_carefulwrite(int fd, char *s, int len, int timeoutms) 
00916 {
00917    /* Try to write string, but wait no more than ms milliseconds
00918       before timing out */
00919    int res = 0;
00920    struct pollfd fds[1];
00921    while (len) {
00922       res = write(fd, s, len);
00923       if ((res < 0) && (errno != EAGAIN)) {
00924          return -1;
00925       }
00926       if (res < 0)
00927          res = 0;
00928       len -= res;
00929       s += res;
00930       res = 0;
00931       if (len) {
00932          fds[0].fd = fd;
00933          fds[0].events = POLLOUT;
00934          /* Wait until writable again */
00935          res = poll(fds, 1, timeoutms);
00936          if (res < 1)
00937             return -1;
00938       }
00939    }
00940    return res;
00941 }
00942 
00943 char *ast_strip_quoted(char *s, const char *beg_quotes, const char *end_quotes)
00944 {
00945    char *e;
00946    char *q;
00947 
00948    s = ast_strip(s);
00949    if ((q = strchr(beg_quotes, *s)) && *q != '\0') {
00950       e = s + strlen(s) - 1;
00951       if (*e == *(end_quotes + (q - beg_quotes))) {
00952          s++;
00953          *e = '\0';
00954       }
00955    }
00956 
00957    return s;
00958 }
00959 
00960 char *ast_unescape_semicolon(char *s)
00961 {
00962    char *e;
00963    char *work = s;
00964 
00965    while ((e = strchr(work, ';'))) {
00966       if ((e > work) && (*(e-1) == '\\')) {
00967          memmove(e - 1, e, strlen(e) + 1);
00968          work = e;
00969       } else {
00970          work = e + 1;
00971       }
00972    }
00973 
00974    return s;
00975 }
00976 
00977 int ast_build_string_va(char **buffer, size_t *space, const char *fmt, va_list ap)
00978 {
00979    int result;
00980 
00981    if (!buffer || !*buffer || !space || !*space)
00982       return -1;
00983 
00984    result = vsnprintf(*buffer, *space, fmt, ap);
00985 
00986    if (result < 0)
00987       return -1;
00988    else if (result > *space)
00989       result = *space;
00990 
00991    *buffer += result;
00992    *space -= result;
00993    return 0;
00994 }
00995 
00996 int ast_build_string(char **buffer, size_t *space, const char *fmt, ...)
00997 {
00998    va_list ap;
00999    int result;
01000 
01001    va_start(ap, fmt);
01002    result = ast_build_string_va(buffer, space, fmt, ap);
01003    va_end(ap);
01004 
01005    return result;
01006 }
01007 
01008 int ast_true(const char *s)
01009 {
01010    if (ast_strlen_zero(s))
01011       return 0;
01012 
01013    /* Determine if this is a true value */
01014    if (!strcasecmp(s, "yes") ||
01015        !strcasecmp(s, "true") ||
01016        !strcasecmp(s, "y") ||
01017        !strcasecmp(s, "t") ||
01018        !strcasecmp(s, "1") ||
01019        !strcasecmp(s, "on"))
01020       return -1;
01021 
01022    return 0;
01023 }
01024 
01025 int ast_false(const char *s)
01026 {
01027    if (ast_strlen_zero(s))
01028       return 0;
01029 
01030    /* Determine if this is a false value */
01031    if (!strcasecmp(s, "no") ||
01032        !strcasecmp(s, "false") ||
01033        !strcasecmp(s, "n") ||
01034        !strcasecmp(s, "f") ||
01035        !strcasecmp(s, "0") ||
01036        !strcasecmp(s, "off"))
01037       return -1;
01038 
01039    return 0;
01040 }
01041 
01042 #define ONE_MILLION  1000000
01043 /*
01044  * put timeval in a valid range. usec is 0..999999
01045  * negative values are not allowed and truncated.
01046  */
01047 static struct timeval tvfix(struct timeval a)
01048 {
01049    if (a.tv_usec >= ONE_MILLION) {
01050       ast_log(LOG_WARNING, "warning too large timestamp %ld.%ld\n",
01051          a.tv_sec, (long int) a.tv_usec);
01052       a.tv_sec += a.tv_usec / ONE_MILLION;
01053       a.tv_usec %= ONE_MILLION;
01054    } else if (a.tv_usec < 0) {
01055       ast_log(LOG_WARNING, "warning negative timestamp %ld.%ld\n",
01056          a.tv_sec, (long int) a.tv_usec);
01057       a.tv_usec = 0;
01058    }
01059    return a;
01060 }
01061 
01062 struct timeval ast_tvadd(struct timeval a, struct timeval b)
01063 {
01064    /* consistency checks to guarantee usec in 0..999999 */
01065    a = tvfix(a);
01066    b = tvfix(b);
01067    a.tv_sec += b.tv_sec;
01068    a.tv_usec += b.tv_usec;
01069    if (a.tv_usec >= ONE_MILLION) {
01070       a.tv_sec++;
01071       a.tv_usec -= ONE_MILLION;
01072    }
01073    return a;
01074 }
01075 
01076 struct timeval ast_tvsub(struct timeval a, struct timeval b)
01077 {
01078    /* consistency checks to guarantee usec in 0..999999 */
01079    a = tvfix(a);
01080    b = tvfix(b);
01081    a.tv_sec -= b.tv_sec;
01082    a.tv_usec -= b.tv_usec;
01083    if (a.tv_usec < 0) {
01084       a.tv_sec-- ;
01085       a.tv_usec += ONE_MILLION;
01086    }
01087    return a;
01088 }
01089 #undef ONE_MILLION
01090 
01091 /*! \brief glibc puts a lock inside random(3), so that the results are thread-safe.
01092  * BSD libc (and others) do not. */
01093 #ifndef linux
01094 
01095 AST_MUTEX_DEFINE_STATIC(randomlock);
01096 
01097 long int ast_random(void)
01098 {
01099    long int res;
01100    ast_mutex_lock(&randomlock);
01101    res = random();
01102    ast_mutex_unlock(&randomlock);
01103    return res;
01104 }
01105 #endif
01106 
01107 char *ast_process_quotes_and_slashes(char *start, char find, char replace_with)
01108 {
01109    char *dataPut = start;
01110    int inEscape = 0;
01111    int inQuotes = 0;
01112 
01113    for (; *start; start++) {
01114       if (inEscape) {
01115          *dataPut++ = *start;       /* Always goes verbatim */
01116          inEscape = 0;
01117       } else {
01118          if (*start == '\\') {
01119             inEscape = 1;      /* Do not copy \ into the data */
01120          } else if (*start == '\'') {
01121             inQuotes = 1 - inQuotes;   /* Do not copy ' into the data */
01122          } else {
01123             /* Replace , with |, unless in quotes */
01124             *dataPut++ = inQuotes ? *start : ((*start == find) ? replace_with : *start);
01125          }
01126       }
01127    }
01128    if (start != dataPut)
01129       *dataPut = 0;
01130    return dataPut;
01131 }
01132 
01133 void ast_join(char *s, size_t len, char * const w[])
01134 {
01135    int x, ofs = 0;
01136    const char *src;
01137 
01138    /* Join words into a string */
01139    if (!s)
01140       return;
01141    for (x = 0; ofs < len && w[x]; x++) {
01142       if (x > 0)
01143          s[ofs++] = ' ';
01144       for (src = w[x]; *src && ofs < len; src++)
01145          s[ofs++] = *src;
01146    }
01147    if (ofs == len)
01148       ofs--;
01149    s[ofs] = '\0';
01150 }
01151 
01152 const char __ast_string_field_empty[] = "";
01153 
01154 static int add_string_pool(struct ast_string_field_mgr *mgr, size_t size)
01155 {
01156    struct ast_string_field_pool *pool;
01157 
01158    if (!(pool = ast_calloc(1, sizeof(*pool) + size)))
01159       return -1;
01160    
01161    pool->prev = mgr->pool;
01162    mgr->pool = pool;
01163    mgr->size = size;
01164    mgr->space = size;
01165    mgr->used = 0;
01166 
01167    return 0;
01168 }
01169 
01170 int __ast_string_field_init(struct ast_string_field_mgr *mgr, size_t size,
01171              ast_string_field *fields, int num_fields)
01172 {
01173    int index;
01174 
01175    if (add_string_pool(mgr, size))
01176       return -1;
01177 
01178    for (index = 0; index < num_fields; index++)
01179       fields[index] = __ast_string_field_empty;
01180 
01181    return 0;
01182 }
01183 
01184 ast_string_field __ast_string_field_alloc_space(struct ast_string_field_mgr *mgr, size_t needed,
01185                   ast_string_field *fields, int num_fields)
01186 {
01187    char *result = NULL;
01188 
01189    if (__builtin_expect(needed > mgr->space, 0)) {
01190       size_t new_size = mgr->size * 2;
01191 
01192       while (new_size < needed)
01193          new_size *= 2;
01194 
01195       if (add_string_pool(mgr, new_size))
01196          return NULL;
01197    }
01198 
01199    result = mgr->pool->base + mgr->used;
01200    mgr->used += needed;
01201    mgr->space -= needed;
01202    return result;
01203 }
01204 
01205 void __ast_string_field_index_build_va(struct ast_string_field_mgr *mgr,
01206                 ast_string_field *fields, int num_fields,
01207                 int index, const char *format, va_list ap1, va_list ap2)
01208 {
01209    size_t needed;
01210 
01211    needed = vsnprintf(mgr->pool->base + mgr->used, mgr->space, format, ap1) + 1;
01212 
01213    va_end(ap1);
01214 
01215    if (needed > mgr->space) {
01216       size_t new_size = mgr->size * 2;
01217 
01218       while (new_size < needed)
01219          new_size *= 2;
01220 
01221       if (add_string_pool(mgr, new_size))
01222          return;
01223 
01224       vsprintf(mgr->pool->base + mgr->used, format, ap2);
01225    }
01226 
01227    fields[index] = mgr->pool->base + mgr->used;
01228    mgr->used += needed;
01229    mgr->space -= needed;
01230 }
01231 
01232 void __ast_string_field_index_build(struct ast_string_field_mgr *mgr,
01233                 ast_string_field *fields, int num_fields,
01234                 int index, const char *format, ...)
01235 {
01236    va_list ap1, ap2;
01237 
01238    va_start(ap1, format);
01239    va_start(ap2, format);     /* va_copy does not exist on FreeBSD */
01240 
01241    __ast_string_field_index_build_va(mgr, fields, num_fields, index, format, ap1, ap2);
01242 
01243    va_end(ap1);
01244    va_end(ap2);
01245 }
01246 
01247 AST_MUTEX_DEFINE_STATIC(fetchadd_m); /* used for all fetc&add ops */
01248 
01249 int ast_atomic_fetchadd_int_slow(volatile int *p, int v)
01250 {
01251         int ret;
01252         ast_mutex_lock(&fetchadd_m);
01253         ret = *p;
01254         *p += v;
01255         ast_mutex_unlock(&fetchadd_m);
01256         return ret;
01257 }
01258 
01259 /*! \brief
01260  * get values from config variables.
01261  */
01262 int ast_get_time_t(const char *src, time_t *dst, time_t _default, int *consumed)
01263 {
01264    long t;
01265    int scanned;
01266 
01267    if (dst == NULL)
01268       return -1;
01269 
01270    *dst = _default;
01271 
01272    if (ast_strlen_zero(src))
01273       return -1;
01274 
01275    /* only integer at the moment, but one day we could accept more formats */
01276    if (sscanf(src, "%ld%n", &t, &scanned) == 1) {
01277       *dst = t;
01278       if (consumed)
01279          *consumed = scanned;
01280       return 0;
01281    } else
01282       return -1;
01283 }
01284 
01285 int ast_dynamic_str_thread_build_va(struct ast_dynamic_str **buf, size_t max_len,
01286    struct ast_threadstorage *ts, int append, const char *fmt, va_list ap)
01287 {
01288    int res;
01289    int offset = (append && (*buf)->len) ? strlen((*buf)->str) : 0;
01290 #if defined(DEBUG_THREADLOCALS)
01291    struct ast_dynamic_str *old_buf = *buf;
01292 #endif /* defined(DEBUG_THREADLOCALS) */
01293 
01294    res = vsnprintf((*buf)->str + offset, (*buf)->len - offset, fmt, ap);
01295 
01296    /* Check to see if there was not enough space in the string buffer to prepare
01297     * the string.  Also, if a maximum length is present, make sure the current
01298     * length is less than the maximum before increasing the size. */
01299    if ((res + offset + 1) > (*buf)->len && (max_len ? ((*buf)->len < max_len) : 1)) {
01300       /* Set the new size of the string buffer to be the size needed
01301        * to hold the resulting string (res) plus one byte for the
01302        * terminating '\0'.  If this size is greater than the max, set
01303        * the new length to be the maximum allowed. */
01304       if (max_len)
01305          (*buf)->len = ((res + offset + 1) < max_len) ? (res + offset + 1) : max_len;
01306       else
01307          (*buf)->len = res + offset + 1;
01308 
01309       if (!(*buf = ast_realloc(*buf, (*buf)->len + sizeof(*(*buf)))))
01310          return AST_DYNSTR_BUILD_FAILED;
01311 
01312       if (append)
01313          (*buf)->str[offset] = '\0';
01314 
01315       if (ts) {
01316          pthread_setspecific(ts->key, *buf);
01317 #if defined(DEBUG_THREADLOCALS)
01318          __ast_threadstorage_object_replace(old_buf, *buf, (*buf)->len + sizeof(*(*buf)));
01319 #endif /* defined(DEBUG_THREADLOCALS) */
01320       }
01321 
01322       /* va_end() and va_start() must be done before calling
01323        * vsnprintf() again. */
01324       return AST_DYNSTR_BUILD_RETRY;
01325    }
01326 
01327    return res;
01328 }
01329 
01330 void ast_enable_packet_fragmentation(int sock)
01331 {
01332 #if defined(HAVE_IP_MTU_DISCOVER)
01333    int val = IP_PMTUDISC_DONT;
01334    
01335    if (setsockopt(sock, IPPROTO_IP, IP_MTU_DISCOVER, &val, sizeof(val)))
01336       ast_log(LOG_WARNING, "Unable to disable PMTU discovery. Large UDP packets may fail to be delivered when sent from this socket.\n");
01337 #endif /* HAVE_IP_MTU_DISCOVER */
01338 }
01339 
01340 int ast_utils_init(void)
01341 {
01342    base64_init();
01343 #ifdef DEBUG_THREADS
01344    ast_cli_register_multiple(utils_cli, sizeof(utils_cli) / sizeof(utils_cli[0]));
01345 #endif
01346    return 0;
01347 }
01348 
01349 

Generated on Fri Sep 25 19:28:16 2009 for Asterisk - the Open Source PBX by  doxygen 1.5.5