Sat Jul 26 06:12:59 2008

Asterisk developer's documentation


astobj2.c

Go to the documentation of this file.
00001 /*
00002  * astobj2 - replacement containers for asterisk data structures.
00003  *
00004  * Copyright (C) 2006 Marta Carbone, Luigi Rizzo - Univ. di Pisa, Italy
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 /*
00018  * Function implementing astobj2 objects.
00019  */
00020 #include "asterisk.h"
00021 
00022 ASTERISK_FILE_VERSION(__FILE__, "$Revision: 90348 $")
00023 
00024 #include "asterisk/astobj2.h"
00025 #include "asterisk/utils.h"
00026 #include "asterisk/cli.h"
00027 
00028 /*!
00029  * astobj2 objects are always prepended this data structure,
00030  * which contains a lock, a reference counter,
00031  * the flags and a pointer to a destructor.
00032  * The refcount is used to decide when it is time to
00033  * invoke the destructor.
00034  * The magic number is used for consistency check.
00035  * XXX the lock is not always needed, and its initialization may be
00036  * expensive. Consider making it external.
00037  */
00038 struct __priv_data {
00039    ast_mutex_t lock;
00040    int ref_counter;
00041    ao2_destructor_fn destructor_fn;
00042    /*! for stats */
00043    size_t data_size;
00044    /*! magic number.  This is used to verify that a pointer passed in is a
00045     *  valid astobj2 */
00046    uint32_t magic;
00047 };
00048 
00049 #define  AO2_MAGIC   0xa570b123
00050 
00051 /*!
00052  * What an astobj2 object looks like: fixed-size private data
00053  * followed by variable-size user data.
00054  */
00055 struct astobj2 {
00056    struct __priv_data priv_data;
00057    void *user_data[0];
00058 };
00059 
00060 #ifdef AST_DEVMODE
00061 #define AO2_DEBUG 1
00062 #endif
00063 
00064 #ifdef AO2_DEBUG
00065 struct ao2_stats {
00066    volatile int total_objects;
00067    volatile int total_mem;
00068    volatile int total_containers;
00069    volatile int total_refs;
00070    volatile int total_locked;
00071 };
00072 
00073 static struct ao2_stats ao2;
00074 #endif
00075 
00076 #ifndef HAVE_BKTR /* backtrace support */
00077 void ao2_bt(void) {}
00078 #else
00079 #include <execinfo.h>    /* for backtrace */
00080 
00081 void ao2_bt(void)
00082 {
00083     int c, i;
00084 #define N1  20
00085     void *addresses[N1];
00086     char **strings;
00087 
00088     c = backtrace(addresses, N1);
00089     strings = backtrace_symbols(addresses,c);
00090     ast_verbose("backtrace returned: %d\n", c);
00091     for(i = 0; i < c; i++) {
00092         ast_verbose("%d: %p %s\n", i, addresses[i], strings[i]);
00093     }
00094     free(strings);
00095 }
00096 #endif
00097 
00098 /*!
00099  * \brief convert from a pointer _p to a user-defined object
00100  *
00101  * \return the pointer to the astobj2 structure
00102  */
00103 static inline struct astobj2 *INTERNAL_OBJ(void *user_data)
00104 {
00105    struct astobj2 *p;
00106 
00107    if (!user_data) {
00108       ast_log(LOG_ERROR, "user_data is NULL\n");
00109       return NULL;
00110    }
00111 
00112    p = (struct astobj2 *) ((char *) user_data - sizeof(*p));
00113    if (AO2_MAGIC != (p->priv_data.magic) ) {
00114       ast_log(LOG_ERROR, "bad magic number 0x%x for %p\n", p->priv_data.magic, p);
00115       p = NULL;
00116    }
00117 
00118    return p;
00119 }
00120 
00121 /*!
00122  * \brief convert from a pointer _p to an astobj2 object
00123  *
00124  * \return the pointer to the user-defined portion.
00125  */
00126 #define EXTERNAL_OBJ(_p)   ((_p) == NULL ? NULL : (_p)->user_data)
00127 
00128 int ao2_lock(void *user_data)
00129 {
00130    struct astobj2 *p = INTERNAL_OBJ(user_data);
00131 
00132    if (p == NULL)
00133       return -1;
00134 
00135 #ifdef AO2_DEBUG
00136    ast_atomic_fetchadd_int(&ao2.total_locked, 1);
00137 #endif
00138 
00139    return ast_mutex_lock(&p->priv_data.lock);
00140 }
00141 
00142 int ao2_unlock(void *user_data)
00143 {
00144    struct astobj2 *p = INTERNAL_OBJ(user_data);
00145 
00146    if (p == NULL)
00147       return -1;
00148 
00149 #ifdef AO2_DEBUG
00150    ast_atomic_fetchadd_int(&ao2.total_locked, -1);
00151 #endif
00152 
00153    return ast_mutex_unlock(&p->priv_data.lock);
00154 }
00155 
00156 /*
00157  * The argument is a pointer to the user portion.
00158  */
00159 int ao2_ref(void *user_data, const int delta)
00160 {
00161    int current_value;
00162    int ret;
00163    struct astobj2 *obj = INTERNAL_OBJ(user_data);
00164 
00165    if (obj == NULL)
00166       return -1;
00167 
00168    /* if delta is 0, just return the refcount */
00169    if (delta == 0)
00170       return (obj->priv_data.ref_counter);
00171 
00172    /* we modify with an atomic operation the reference counter */
00173    ret = ast_atomic_fetchadd_int(&obj->priv_data.ref_counter, delta);
00174    current_value = ret + delta;
00175 
00176 #ifdef AO2_DEBUG  
00177    ast_atomic_fetchadd_int(&ao2.total_refs, delta);
00178 #endif
00179 
00180    /* this case must never happen */
00181    if (current_value < 0)
00182       ast_log(LOG_ERROR, "refcount %d on object %p\n", current_value, user_data);
00183 
00184    if (current_value <= 0) { /* last reference, destroy the object */
00185       if (obj->priv_data.destructor_fn != NULL) 
00186          obj->priv_data.destructor_fn(user_data);
00187 
00188       ast_mutex_destroy(&obj->priv_data.lock);
00189 #ifdef AO2_DEBUG
00190       ast_atomic_fetchadd_int(&ao2.total_mem, - obj->priv_data.data_size);
00191       ast_atomic_fetchadd_int(&ao2.total_objects, -1);
00192 #endif
00193       /* for safety, zero-out the astobj2 header and also the
00194        * first word of the user-data, which we make sure is always
00195        * allocated. */
00196       bzero(obj, sizeof(struct astobj2 *) + sizeof(void *) );
00197       free(obj);
00198    }
00199 
00200    return ret;
00201 }
00202 
00203 /*
00204  * We always alloc at least the size of a void *,
00205  * for debugging purposes.
00206  */
00207 void *ao2_alloc(size_t data_size, ao2_destructor_fn destructor_fn)
00208 {
00209    /* allocation */
00210    struct astobj2 *obj;
00211 
00212    if (data_size < sizeof(void *))
00213       data_size = sizeof(void *);
00214 
00215    obj = ast_calloc(1, sizeof(*obj) + data_size);
00216 
00217    if (obj == NULL)
00218       return NULL;
00219 
00220    ast_mutex_init(&obj->priv_data.lock);
00221    obj->priv_data.magic = AO2_MAGIC;
00222    obj->priv_data.data_size = data_size;
00223    obj->priv_data.ref_counter = 1;
00224    obj->priv_data.destructor_fn = destructor_fn;   /* can be NULL */
00225 
00226 #ifdef AO2_DEBUG
00227    ast_atomic_fetchadd_int(&ao2.total_objects, 1);
00228    ast_atomic_fetchadd_int(&ao2.total_mem, data_size);
00229    ast_atomic_fetchadd_int(&ao2.total_refs, 1);
00230 #endif
00231 
00232    /* return a pointer to the user data */
00233    return EXTERNAL_OBJ(obj);
00234 }
00235 
00236 /* internal callback to destroy a container. */
00237 static void container_destruct(void *c);
00238 
00239 /* each bucket in the container is a tailq. */
00240 AST_LIST_HEAD_NOLOCK(bucket, bucket_list);
00241 
00242 /*!
00243  * A container; stores the hash and callback functions, information on
00244  * the size, the hash bucket heads, and a version number, starting at 0
00245  * (for a newly created, empty container)
00246  * and incremented every time an object is inserted or deleted.
00247  * The assumption is that an object is never moved in a container,
00248  * but removed and readded with the new number.
00249  * The version number is especially useful when implementing iterators.
00250  * In fact, we can associate a unique, monotonically increasing number to
00251  * each object, which means that, within an iterator, we can store the
00252  * version number of the current object, and easily look for the next one,
00253  * which is the next one in the list with a higher number.
00254  * Since all objects have a version >0, we can use 0 as a marker for
00255  * 'we need the first object in the bucket'.
00256  *
00257  * \todo Linking and unlink objects is typically expensive, as it
00258  * involves a malloc() of a small object which is very inefficient.
00259  * To optimize this, we allocate larger arrays of bucket_list's
00260  * when we run out of them, and then manage our own freelist.
00261  * This will be more efficient as we can do the freelist management while
00262  * we hold the lock (that we need anyways).
00263  */
00264 struct ao2_container {
00265    ao2_hash_fn hash_fn;
00266    ao2_callback_fn cmp_fn;
00267    int n_buckets;
00268    /*! Number of elements in the container */
00269    int elements;
00270    /*! described above */
00271    int version;
00272    /*! variable size */
00273    struct bucket buckets[0];
00274 };
00275  
00276 /*!
00277  * \brief always zero hash function
00278  *
00279  * it is convenient to have a hash function that always returns 0.
00280  * This is basically used when we want to have a container that is
00281  * a simple linked list.
00282  *
00283  * \returns 0
00284  */
00285 static int hash_zero(const void *user_obj, const int flags)
00286 {
00287    return 0;
00288 }
00289 
00290 /*
00291  * A container is just an object, after all!
00292  */
00293 struct ao2_container *
00294 ao2_container_alloc(const uint n_buckets, ao2_hash_fn hash_fn,
00295       ao2_callback_fn cmp_fn)
00296 {
00297    /* XXX maybe consistency check on arguments ? */
00298    /* compute the container size */
00299    size_t container_size = sizeof(struct ao2_container) + n_buckets * sizeof(struct bucket);
00300 
00301    struct ao2_container *c = ao2_alloc(container_size, container_destruct);
00302 
00303    if (!c)
00304       return NULL;
00305    
00306    c->version = 1;   /* 0 is a reserved value here */
00307    c->n_buckets = n_buckets;
00308    c->hash_fn = hash_fn ? hash_fn : hash_zero;
00309    c->cmp_fn = cmp_fn;
00310 
00311 #ifdef AO2_DEBUG
00312    ast_atomic_fetchadd_int(&ao2.total_containers, 1);
00313 #endif
00314 
00315    return c;
00316 }
00317 
00318 /*!
00319  * return the number of elements in the container
00320  */
00321 int ao2_container_count(struct ao2_container *c)
00322 {
00323    return c->elements;
00324 }
00325 
00326 /*!
00327  * A structure to create a linked list of entries,
00328  * used within a bucket.
00329  * XXX \todo this should be private to the container code
00330  */
00331 struct bucket_list {
00332    AST_LIST_ENTRY(bucket_list) entry;
00333    int version;
00334    struct astobj2 *astobj;    /* pointer to internal data */
00335 }; 
00336 
00337 /*
00338  * link an object to a container
00339  */
00340 void *__ao2_link(struct ao2_container *c, void *user_data, int iax2_hack)
00341 {
00342    int i;
00343    /* create a new list entry */
00344    struct bucket_list *p;
00345    struct astobj2 *obj = INTERNAL_OBJ(user_data);
00346    
00347    if (!obj)
00348       return NULL;
00349 
00350    if (INTERNAL_OBJ(c) == NULL)
00351       return NULL;
00352 
00353    p = ast_calloc(1, sizeof(*p));
00354    if (!p)
00355       return NULL;
00356 
00357    i = c->hash_fn(user_data, OBJ_POINTER);
00358 
00359    ao2_lock(c);
00360    i %= c->n_buckets;
00361    p->astobj = obj;
00362    p->version = ast_atomic_fetchadd_int(&c->version, 1);
00363    if (iax2_hack)
00364       AST_LIST_INSERT_HEAD(&c->buckets[i], p, entry);
00365    else
00366       AST_LIST_INSERT_TAIL(&c->buckets[i], p, entry);
00367    ast_atomic_fetchadd_int(&c->elements, 1);
00368    ao2_ref(user_data, +1);
00369    ao2_unlock(c);
00370    
00371    return p;
00372 }
00373 
00374 /*!
00375  * \brief another convenience function is a callback that matches on address
00376  */
00377 int ao2_match_by_addr(void *user_data, void *arg, int flags)
00378 {
00379    return (user_data == arg) ? (CMP_MATCH | CMP_STOP) : 0;
00380 }
00381 
00382 /*
00383  * Unlink an object from the container
00384  * and destroy the associated * ao2_bucket_list structure.
00385  */
00386 void *ao2_unlink(struct ao2_container *c, void *user_data)
00387 {
00388    if (INTERNAL_OBJ(user_data) == NULL)   /* safety check on the argument */
00389       return NULL;
00390 
00391    ao2_callback(c, OBJ_UNLINK | OBJ_POINTER | OBJ_NODATA, ao2_match_by_addr, user_data);
00392 
00393    return NULL;
00394 }
00395 
00396 /*! 
00397  * \brief special callback that matches all 
00398  */ 
00399 static int cb_true(void *user_data, void *arg, int flags)
00400 {
00401    return CMP_MATCH;
00402 }
00403 
00404 /*!
00405  * Browse the container using different stategies accoding the flags.
00406  * \return Is a pointer to an object or to a list of object if OBJ_MULTIPLE is 
00407  * specified.
00408  */
00409 void *ao2_callback(struct ao2_container *c,
00410    const enum search_flags flags,
00411    ao2_callback_fn cb_fn, void *arg)
00412 {
00413    int i, last;   /* search boundaries */
00414    void *ret = NULL;
00415 
00416    if (INTERNAL_OBJ(c) == NULL)  /* safety check on the argument */
00417       return NULL;
00418 
00419    if ((flags & (OBJ_MULTIPLE | OBJ_NODATA)) == OBJ_MULTIPLE) {
00420       ast_log(LOG_WARNING, "multiple data return not implemented yet (flags %x)\n", flags);
00421       return NULL;
00422    }
00423 
00424    /* override the match function if necessary */
00425 #if 0
00426    /* Removing this slightly changes the meaning of OBJ_POINTER, but makes it
00427     * do what I want it to.  I'd like to hint to ao2_callback that the arg is
00428     * of the same object type, so it can be passed to the hash function.
00429     * However, I don't want to imply that this is the object being searched for. */
00430    if (flags & OBJ_POINTER)
00431       cb_fn = match_by_addr;
00432    else
00433 #endif
00434    if (cb_fn == NULL)   /* if NULL, match everything */
00435       cb_fn = cb_true;
00436    /*
00437     * XXX this can be optimized.
00438     * If we have a hash function and lookup by pointer,
00439     * run the hash function. Otherwise, scan the whole container
00440     * (this only for the time being. We need to optimize this.)
00441     */
00442    if ((flags & OBJ_POINTER)) /* we know hash can handle this case */
00443       i = c->hash_fn(arg, flags & OBJ_POINTER) % c->n_buckets;
00444    else        /* don't know, let's scan all buckets */
00445       i = -1;     /* XXX this must be fixed later. */
00446 
00447    /* determine the search boundaries: i..last-1 */
00448    if (i < 0) {
00449       i = 0;
00450       last = c->n_buckets;
00451    } else {
00452       last = i + 1;
00453    }
00454 
00455    ao2_lock(c);   /* avoid modifications to the content */
00456 
00457    for (; i < last ; i++) {
00458       /* scan the list with prev-cur pointers */
00459       struct bucket_list *cur;
00460 
00461       AST_LIST_TRAVERSE_SAFE_BEGIN(&c->buckets[i], cur, entry) {
00462          int match = cb_fn(EXTERNAL_OBJ(cur->astobj), arg, flags) & (CMP_MATCH | CMP_STOP);
00463 
00464          /* we found the object, performing operations according flags */
00465          if (match == 0) { /* no match, no stop, continue */
00466             continue;
00467          } else if (match == CMP_STOP) {  /* no match but stop, we are done */
00468             i = last;
00469             break;
00470          }
00471          /* we have a match (CMP_MATCH) here */
00472          if (!(flags & OBJ_NODATA)) {  /* if must return the object, record the value */
00473             /* it is important to handle this case before the unlink */
00474             ret = EXTERNAL_OBJ(cur->astobj);
00475             ao2_ref(ret, 1);
00476          }
00477 
00478          if (flags & OBJ_UNLINK) {  /* must unlink */
00479             struct bucket_list *x = cur;
00480 
00481             /* we are going to modify the container, so update version */
00482             ast_atomic_fetchadd_int(&c->version, 1);
00483             AST_LIST_REMOVE_CURRENT(&c->buckets[i], entry);
00484             /* update number of elements and version */
00485             ast_atomic_fetchadd_int(&c->elements, -1);
00486             ao2_ref(EXTERNAL_OBJ(x->astobj), -1);
00487             free(x); /* free the link record */
00488          }
00489 
00490          if ((match & CMP_STOP) || (flags & OBJ_MULTIPLE) == 0) {
00491             /* We found the only match we need */
00492             i = last;   /* force exit from outer loop */
00493             break;
00494          }
00495          if (!(flags & OBJ_NODATA)) {
00496 #if 0 /* XXX to be completed */
00497             /*
00498              * This is the multiple-return case. We need to link
00499              * the object in a list. The refcount is already increased.
00500              */
00501 #endif
00502          }
00503       }
00504       AST_LIST_TRAVERSE_SAFE_END
00505    }
00506    ao2_unlock(c);
00507    return ret;
00508 }
00509 
00510 /*!
00511  * the find function just invokes the default callback with some reasonable flags.
00512  */
00513 void *ao2_find(struct ao2_container *c, void *arg, enum search_flags flags)
00514 {
00515    return ao2_callback(c, flags, c->cmp_fn, arg);
00516 }
00517 
00518 /*!
00519  * initialize an iterator so we start from the first object
00520  */
00521 struct ao2_iterator ao2_iterator_init(struct ao2_container *c, int flags)
00522 {
00523    struct ao2_iterator a = {
00524       .c = c,
00525       .flags = flags
00526    };
00527    
00528    return a;
00529 }
00530 
00531 /*
00532  * move to the next element in the container.
00533  */
00534 void * ao2_iterator_next(struct ao2_iterator *a)
00535 {
00536    int lim;
00537    struct bucket_list *p = NULL;
00538    void *ret = NULL;
00539 
00540    if (INTERNAL_OBJ(a->c) == NULL)
00541       return NULL;
00542 
00543    if (!(a->flags & F_AO2I_DONTLOCK))
00544       ao2_lock(a->c);
00545 
00546    /* optimization. If the container is unchanged and
00547     * we have a pointer, try follow it
00548     */
00549    if (a->c->version == a->c_version && (p = a->obj) ) {
00550       if ( (p = AST_LIST_NEXT(p, entry)) )
00551          goto found;
00552       /* nope, start from the next bucket */
00553       a->bucket++;
00554       a->version = 0;
00555       a->obj = NULL;
00556    }
00557 
00558    lim = a->c->n_buckets;
00559 
00560    /* Browse the buckets array, moving to the next
00561     * buckets if we don't find the entry in the current one.
00562     * Stop when we find an element with version number greater
00563     * than the current one (we reset the version to 0 when we
00564     * switch buckets).
00565     */
00566    for (; a->bucket < lim; a->bucket++, a->version = 0) {
00567       /* scan the current bucket */
00568       AST_LIST_TRAVERSE(&a->c->buckets[a->bucket], p, entry) {
00569          if (p->version > a->version)
00570             goto found;
00571       }
00572    }
00573 
00574 found:
00575    if (p) {
00576       a->version = p->version;
00577       a->obj = p;
00578       a->c_version = a->c->version;
00579       ret = EXTERNAL_OBJ(p->astobj);
00580       /* inc refcount of returned object */
00581       ao2_ref(ret, 1);
00582    }
00583 
00584    if (!(a->flags & F_AO2I_DONTLOCK))
00585       ao2_unlock(a->c);
00586 
00587    return ret;
00588 }
00589 
00590 /* callback for destroying container.
00591  * we can make it simple as we know what it does
00592  */
00593 static int cd_cb(void *obj, void *arg, int flag)
00594 {
00595    ao2_ref(obj, -1);
00596    return 0;
00597 }
00598    
00599 static void container_destruct(void *_c)
00600 {
00601    struct ao2_container *c = _c;
00602 
00603    ao2_callback(c, OBJ_UNLINK, cd_cb, NULL);
00604 
00605 #ifdef AO2_DEBUG
00606    ast_atomic_fetchadd_int(&ao2.total_containers, -1);
00607 #endif
00608 }
00609 
00610 #ifdef AO2_DEBUG
00611 static int print_cb(void *obj, void *arg, int flag)
00612 {
00613    int *fd = arg;
00614    char *s = (char *)obj;
00615 
00616    ast_cli(*fd, "string <%s>\n", s);
00617    return 0;
00618 }
00619 
00620 /*
00621  * Print stats
00622  */
00623 static int handle_astobj2_stats(int fd, int argc, char *argv[])
00624 {
00625    ast_cli(fd, "Objects    : %d\n", ao2.total_objects);
00626    ast_cli(fd, "Containers : %d\n", ao2.total_containers);
00627    ast_cli(fd, "Memory     : %d\n", ao2.total_mem);
00628    ast_cli(fd, "Locked     : %d\n", ao2.total_locked);
00629    ast_cli(fd, "Refs       : %d\n", ao2.total_refs);
00630    return 0;
00631 }
00632 
00633 /*
00634  * This is testing code for astobj
00635  */
00636 static int handle_astobj2_test(int fd, int argc, char *argv[])
00637 {
00638    struct ao2_container *c1;
00639    int i, lim;
00640    char *obj;
00641    static int prof_id = -1;
00642 
00643    if (prof_id == -1)
00644       prof_id = ast_add_profile("ao2_alloc", 0);
00645 
00646    ast_cli(fd, "argc %d argv %s %s %s\n", argc, argv[0], argv[1], argv[2]);
00647    lim = atoi(argv[2]);
00648    ast_cli(fd, "called astobj_test\n");
00649 
00650    handle_astobj2_stats(fd, 0, NULL);
00651    /*
00652     * allocate a container with no default callback, and no hash function.
00653     * No hash means everything goes in the same bucket.
00654     */
00655    c1 = ao2_container_alloc(100, NULL /* no callback */, NULL /* no hash */);
00656    ast_cli(fd, "container allocated as %p\n", c1);
00657 
00658    /*
00659     * fill the container with objects.
00660     * ao2_alloc() gives us a reference which we pass to the
00661     * container when we do the insert.
00662     */
00663    for (i = 0; i < lim; i++) {
00664       ast_mark(prof_id, 1 /* start */);
00665       obj = ao2_alloc(80, NULL);
00666       ast_mark(prof_id, 0 /* stop */);
00667       ast_cli(fd, "object %d allocated as %p\n", i, obj);
00668       sprintf(obj, "-- this is obj %d --", i);
00669       ao2_link(c1, obj);
00670    }
00671    ast_cli(fd, "testing callbacks\n");
00672    ao2_callback(c1, 0, print_cb, &fd);
00673 
00674    ast_cli(fd, "testing iterators, remove every second object\n");
00675    {
00676       struct ao2_iterator ai;
00677       int x = 0;
00678 
00679       ai = ao2_iterator_init(c1, 0);
00680       while ( (obj = ao2_iterator_next(&ai)) ) {
00681          ast_cli(fd, "iterator on <%s>\n", obj);
00682          if (x++ & 1)
00683             ao2_unlink(c1, obj);
00684          ao2_ref(obj, -1);
00685       }
00686       ast_cli(fd, "testing iterators again\n");
00687       ai = ao2_iterator_init(c1, 0);
00688       while ( (obj = ao2_iterator_next(&ai)) ) {
00689          ast_cli(fd, "iterator on <%s>\n", obj);
00690          ao2_ref(obj, -1);
00691       }
00692    }
00693    ast_cli(fd, "testing callbacks again\n");
00694    ao2_callback(c1, 0, print_cb, &fd);
00695 
00696    ast_verbose("now you should see an error message:\n");
00697    ao2_ref(&i, -1);  /* i is not a valid object so we print an error here */
00698 
00699    ast_cli(fd, "destroy container\n");
00700    ao2_ref(c1, -1);  /* destroy container */
00701    handle_astobj2_stats(fd, 0, NULL);
00702    return 0;
00703 }
00704 
00705 static struct ast_cli_entry cli_astobj2[] = {
00706    { { "astobj2", "stats", NULL },
00707    handle_astobj2_stats, "Print astobj2 statistics", },
00708    { { "astobj2", "test", NULL } , handle_astobj2_test, "Test astobj2", },
00709 };
00710 #endif /* AO2_DEBUG */
00711 
00712 int astobj2_init(void)
00713 {
00714 #ifdef AO2_DEBUG
00715    ast_cli_register_multiple(cli_astobj2, ARRAY_LEN(cli_astobj2));
00716 #endif
00717 
00718    return 0;
00719 }

Generated on Sat Jul 26 06:12:59 2008 for Asterisk - the Open Source PBX by  doxygen 1.5.1