* should never be passed directly to ao2_alloc.
*/
AO2_ALLOC_OPT_LOCK_OBJ = AO2_ALLOC_OPT_LOCK_MASK,
+ /*! The ao2 object will not record any REF_DEBUG entries */
+ AO2_ALLOC_OPT_NO_REF_DEBUG = (1 << 2),
};
/*!
* - the returned pointer cannot be free()'d or realloc()'ed;
* rather, we just call ao2_ref(o, -1);
*
- * \note refdebug logging is skipped if debug_msg is NULL
- *
* @{
*/
* can go away is when we release our reference, and it is
* the last one in existence.
*
- * \note refdebug logging is skipped if tag is NULL
* @{
*/
* \note This field is constant after object creation. It shares
* a uint32_t with \ref lockused and \ref magic.
*/
- uint32_t options:2;
+ uint32_t options:3;
/*!
* \brief Set to 1 when the lock is used if refdebug is enabled.
*
* all bitfields into a single 'uint32_t flags' field and use
* atomic operations from \file lock.h to perform writes.
*/
- uint32_t magic:29;
+ uint32_t magic:28;
};
-#define AO2_MAGIC 0x1a70b123
-#define AO2_WEAK 0x1a70b122
+#define AO2_MAGIC 0xa70b123
+#define AO2_WEAK 0xa70b122
#define IS_AO2_MAGIC_BAD(p) (AO2_MAGIC != (p->priv_data.magic | 1))
/*!
__ast_assert_failed(0, excessive_ref_buf, file, line, func);
}
- if (ref_log && tag) {
+ if (ref_log && !(obj->priv_data.options & AO2_ALLOC_OPT_NO_REF_DEBUG)) {
fprintf(ref_log, "%p,%s%d,%d,%s,%d,%s,%d,%s\n", user_data,
(delta < 0 ? "" : "+"), delta, ast_get_tid(),
- file, line, func, (int)ret, tag);
+ file, line, func, (int)ret, tag ?: "");
fflush(ref_log);
}
return ret;
ast_log(__LOG_ERROR, file, line, func,
"Invalid refcount %d on ao2 object %p\n", (int)current_value, user_data);
if (ref_log) {
- /* Log to ref_log invalid even if (tag == NULL) */
+ /* Log to ref_log even if AO2_ALLOC_OPT_NO_REF_DEBUG */
fprintf(ref_log, "%p,%d,%d,%s,%d,%s,**invalid**,%s\n",
user_data, delta, ast_get_tid(), file, line, func, tag ?: "");
fflush(ref_log);
break;
}
- if (ref_log && tag) {
+ if (ref_log && !(obj->priv_data.options & AO2_ALLOC_OPT_NO_REF_DEBUG)) {
fprintf(ref_log, "%p,%d,%d,%s,%d,%s,**destructor**lock-state:%s**,%s\n",
- user_data, delta, ast_get_tid(), file, line, func, lock_state, tag);
+ user_data, delta, ast_get_tid(), file, line, func, lock_state, tag ?: "");
fflush(ref_log);
}
ast_atomic_fetchadd_int(&ao2.total_refs, 1);
#endif
- if (ref_log && tag) {
+ if (ref_log && !(obj->priv_data.options & AO2_ALLOC_OPT_NO_REF_DEBUG)) {
fprintf(ref_log, "%p,+1,%d,%s,%d,%s,**constructor**%zu**%zu**,%s\n",
- EXTERNAL_OBJ(obj), ast_get_tid(), file, line, func, overhead, data_size, tag);
+ EXTERNAL_OBJ(obj), ast_get_tid(), file, line, func, overhead, data_size, tag ?: "");
fflush(ref_log);
}
if (flags & AO2_UNLINK_NODE_UNREF_NODE) {
/* Remove node from container */
- ao2_t_ref(node, -1, NULL);
+ ao2_ref(node, -1);
}
return 1;
res = 1;
break;
case AO2_CONTAINER_INSERT_NODE_REJECTED:
- ao2_t_ref(node, -1, NULL);
+ ao2_ref(node, -1);
break;
}
}
}
if (node) {
/* Unref the node from self->v_table->traverse_first/traverse_next() */
- ao2_t_ref(node, -1, NULL);
+ ao2_ref(node, -1);
}
if (flags & OBJ_NOLOCK) {
ao2_rdlock(iter->c);
}
- ao2_t_ref(iter->last_node, -1, NULL);
+ ao2_ref(iter->last_node, -1);
iter->last_node = NULL;
if (iter->flags & AO2_ITERATOR_DONTLOCK) {
__ao2_ref(ret, +1, tag ?: "Next iterator object.", file, line, func);
/* Bump the container's node ref for the iterator. */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
}
} else {
/* The iteration has completed. */
/* Replace the iterator's node */
if (iter->last_node) {
- ao2_t_ref(iter->last_node, -1, NULL);
+ ao2_ref(iter->last_node, -1);
}
iter->last_node = node;
{
struct ao2_container *dest = arg;
- return ao2_t_link_flags(dest, obj, OBJ_NOLOCK, NULL) ? 0 : (CMP_MATCH | CMP_STOP);
+ return ao2_link_flags(dest, obj, OBJ_NOLOCK) ? 0 : (CMP_MATCH | CMP_STOP);
}
int ao2_container_dup(struct ao2_container *dest, struct ao2_container *src, enum search_flags flags)
ao2_t_ref(obj, -1, "Failed to put this object into the dest container.");
/* Remove all items from the dest container. */
- ao2_t_callback(dest, OBJ_NOLOCK | OBJ_UNLINK | OBJ_NODATA | OBJ_MULTIPLE, NULL,
- NULL, NULL);
+ ao2_callback(dest, OBJ_NOLOCK | OBJ_UNLINK | OBJ_NODATA | OBJ_MULTIPLE, NULL,
+ NULL);
res = -1;
}
if (!(flags & OBJ_NOLOCK)) {
return 0;
}
- ret = ao2_t_link_flags(dest, obj, OBJ_NOLOCK, NULL) ? 0 : (CMP_MATCH | CMP_STOP);
+ ret = ao2_link_flags(dest, obj, OBJ_NOLOCK) ? 0 : (CMP_MATCH | CMP_STOP);
ao2_ref(obj, -1);
return ret;
ao2_t_ref(obj, -1, "Failed to put this object into the dest container.");
/* Remove all items from the dest container. */
- ao2_t_callback(dest, OBJ_NOLOCK | OBJ_UNLINK | OBJ_NODATA | OBJ_MULTIPLE, NULL,
- NULL, NULL);
+ ao2_callback(dest, OBJ_NOLOCK | OBJ_UNLINK | OBJ_NODATA | OBJ_MULTIPLE, NULL,
+ NULL);
res = -1;
}
if (!(flags & OBJ_NOLOCK)) {
struct hash_bucket_node *node;
int i;
- node = ao2_t_alloc_options(sizeof(*node), hash_ao2_node_destructor, AO2_ALLOC_OPT_LOCK_NOLOCK, NULL);
+ node = ao2_alloc_options(sizeof(*node), hash_ao2_node_destructor,
+ AO2_ALLOC_OPT_LOCK_NOLOCK | AO2_ALLOC_OPT_NO_REF_DEBUG);
if (!node) {
return NULL;
}
break;
case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
SWAP(cur->common.obj, node->common.obj);
- ao2_t_ref(node, -1, NULL);
+ ao2_ref(node, -1);
return AO2_CONTAINER_INSERT_NODE_OBJ_REPLACED;
}
}
break;
case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
SWAP(cur->common.obj, node->common.obj);
- ao2_t_ref(node, -1, NULL);
+ ao2_ref(node, -1);
return AO2_CONTAINER_INSERT_NODE_OBJ_REPLACED;
}
}
}
/* We have the first traversal node */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
return node;
}
}
}
/* We have the first traversal node */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
return node;
}
}
}
/* We have the next traversal node */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
/*
* Dereferencing the prev node may result in our next node
* the container uses RW locks and the container was read
* locked.
*/
- ao2_t_ref(prev, -1, NULL);
+ ao2_ref(prev, -1);
if (node->common.obj) {
return node;
}
}
/* We have the next traversal node */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
/*
* Dereferencing the prev node may result in our next node
* the container uses RW locks and the container was read
* locked.
*/
- ao2_t_ref(prev, -1, NULL);
+ ao2_ref(prev, -1);
if (node->common.obj) {
return node;
}
}
/* No more nodes in the container left to traverse. */
- ao2_t_ref(prev, -1, NULL);
+ ao2_ref(prev, -1);
return NULL;
}
{
struct rbtree_node *node;
- node = ao2_t_alloc_options(sizeof(*node), rb_ao2_node_destructor, AO2_ALLOC_OPT_LOCK_NOLOCK, NULL);
+ node = ao2_alloc_options(sizeof(*node), rb_ao2_node_destructor,
+ AO2_ALLOC_OPT_LOCK_NOLOCK | AO2_ALLOC_OPT_NO_REF_DEBUG);
if (!node) {
return NULL;
}
break;
case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
SWAP(cur->common.obj, node->common.obj);
- ao2_t_ref(node, -1, NULL);
+ ao2_ref(node, -1);
return AO2_CONTAINER_INSERT_NODE_OBJ_REPLACED;
}
}
/* We have the next traversal node */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
/*
* Dereferencing the prev node may result in our next node
* the container uses RW locks and the container was read
* locked.
*/
- ao2_t_ref(prev, -1, NULL);
+ ao2_ref(prev, -1);
if (node->common.obj) {
return node;
}
}
/* No more nodes in the container left to traverse. */
- ao2_t_ref(prev, -1, NULL);
+ ao2_ref(prev, -1);
return NULL;
}
}
/* We have the first traversal node */
- ao2_t_ref(node, +1, NULL);
+ ao2_ref(node, +1);
return node;
}