mirror of
				https://github.com/asterisk/asterisk.git
				synced 2025-10-31 18:55:19 +00:00 
			
		
		
		
	ASTERISK_REGISTER_FILE no longer has any purpose so this commit removes all traces of it. Previously exported symbols removed: * __ast_register_file * __ast_unregister_file * ast_complete_source_filename This also removes the mtx_prof static variable that was declared when MTX_PROFILE was enabled. This variable was only used in lock.c so it is now initialized in that file only. ASTERISK-26480 #close Change-Id: I1074af07d71f9e159c48ef36631aa432c86f9966
		
			
				
	
	
		
			158 lines
		
	
	
		
			3.7 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			158 lines
		
	
	
		
			3.7 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /*
 | |
|  * Asterisk -- An open source telephony toolkit.
 | |
|  *
 | |
|  * Copyright (C) 2007 - 2008, Digium, Inc.
 | |
|  *
 | |
|  * See http://www.asterisk.org for more information about
 | |
|  * the Asterisk project. Please do not directly contact
 | |
|  * any of the maintainers of this project for assistance;
 | |
|  * the project provides a web site, mailing lists and IRC
 | |
|  * channels for your use.
 | |
|  *
 | |
|  * This program is free software, distributed under the terms of
 | |
|  * the GNU General Public License Version 2. See the LICENSE file
 | |
|  * at the top of the source tree.
 | |
|  */
 | |
| 
 | |
| /*! \file
 | |
|  *
 | |
|  * \brief Asterisk datastore objects
 | |
|  */
 | |
| 
 | |
| /*** MODULEINFO
 | |
| 	<support_level>core</support_level>
 | |
|  ***/
 | |
| 
 | |
| #include "asterisk.h"
 | |
| 
 | |
| #include "asterisk/_private.h"
 | |
| 
 | |
| #include "asterisk/datastore.h"
 | |
| #include "asterisk/utils.h"
 | |
| #include "asterisk/astobj2.h"
 | |
| #include "asterisk/uuid.h"
 | |
| 
 | |
| /*! \brief Number of buckets for datastore container */
 | |
| #define DATASTORE_BUCKETS 53
 | |
| 
 | |
| struct ast_datastore *__ast_datastore_alloc(const struct ast_datastore_info *info, const char *uid,
 | |
| 					    const char *file, int line, const char *function)
 | |
| {
 | |
| 	struct ast_datastore *datastore = NULL;
 | |
| 
 | |
| 	/* Make sure we at least have type so we can identify this */
 | |
| 	if (!info) {
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	if (!(datastore = __ast_calloc(1, sizeof(*datastore), file, line, function))) {
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	datastore->info = info;
 | |
| 
 | |
| 	if (!ast_strlen_zero(uid) && !(datastore->uid = ast_strdup(uid))) {
 | |
| 		ast_free(datastore);
 | |
| 		datastore = NULL;
 | |
| 	}
 | |
| 
 | |
| 	return datastore;
 | |
| }
 | |
| 
 | |
| int ast_datastore_free(struct ast_datastore *datastore)
 | |
| {
 | |
| 	int res = 0;
 | |
| 
 | |
| 	/* Using the destroy function (if present) destroy the data */
 | |
| 	if (datastore->info->destroy != NULL && datastore->data != NULL) {
 | |
| 		datastore->info->destroy(datastore->data);
 | |
| 		datastore->data = NULL;
 | |
| 	}
 | |
| 
 | |
| 	/* Free allocated UID memory */
 | |
| 	if (datastore->uid != NULL) {
 | |
| 		ast_free((void *) datastore->uid);
 | |
| 		datastore->uid = NULL;
 | |
| 	}
 | |
| 
 | |
| 	/* Finally free memory used by ourselves */
 | |
| 	ast_free(datastore);
 | |
| 
 | |
| 	return res;
 | |
| }
 | |
| 
 | |
| AO2_STRING_FIELD_HASH_FN(ast_datastore, uid);
 | |
| AO2_STRING_FIELD_CMP_FN(ast_datastore, uid);
 | |
| 
 | |
| struct ao2_container *ast_datastores_alloc(void)
 | |
| {
 | |
| 	return ao2_container_alloc(DATASTORE_BUCKETS, ast_datastore_hash_fn, ast_datastore_cmp_fn);
 | |
| }
 | |
| 
 | |
| int ast_datastores_add(struct ao2_container *datastores, struct ast_datastore *datastore)
 | |
| {
 | |
| 	ast_assert(datastore != NULL);
 | |
| 	ast_assert(datastore->info != NULL);
 | |
| 	ast_assert(!ast_strlen_zero(datastore->uid));
 | |
| 
 | |
| 	if (!ao2_link(datastores, datastore)) {
 | |
| 		return -1;
 | |
| 	}
 | |
| 
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| void ast_datastores_remove(struct ao2_container *datastores, const char *name)
 | |
| {
 | |
| 	ao2_find(datastores, name, OBJ_SEARCH_KEY | OBJ_UNLINK | OBJ_NODATA);
 | |
| }
 | |
| 
 | |
| struct ast_datastore *ast_datastores_find(struct ao2_container *datastores, const char *name)
 | |
| {
 | |
| 	return ao2_find(datastores, name, OBJ_SEARCH_KEY);
 | |
| }
 | |
| 
 | |
| static void datastore_destroy(void *obj)
 | |
| {
 | |
| 	struct ast_datastore *datastore = obj;
 | |
| 
 | |
| 	/* Using the destroy function (if present) destroy the data */
 | |
| 	if (datastore->info->destroy != NULL && datastore->data != NULL) {
 | |
| 		datastore->info->destroy(datastore->data);
 | |
| 		datastore->data = NULL;
 | |
| 	}
 | |
| 
 | |
| 	ast_free((void *) datastore->uid);
 | |
| 	datastore->uid = NULL;
 | |
| }
 | |
| 
 | |
| struct ast_datastore *ast_datastores_alloc_datastore(const struct ast_datastore_info *info, const char *uid)
 | |
| {
 | |
| 	struct ast_datastore *datastore;
 | |
| 	char uuid_buf[AST_UUID_STR_LEN];
 | |
| 	const char *uid_ptr = uid;
 | |
| 
 | |
| 	if (!info) {
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	datastore = ao2_alloc(sizeof(*datastore), datastore_destroy);
 | |
| 	if (!datastore) {
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	datastore->info = info;
 | |
| 	if (ast_strlen_zero(uid)) {
 | |
| 		/* They didn't provide an ID so we'll provide one ourself */
 | |
| 		uid_ptr = ast_uuid_generate_str(uuid_buf, sizeof(uuid_buf));
 | |
| 	}
 | |
| 
 | |
| 	datastore->uid = ast_strdup(uid_ptr);
 | |
| 	if (!datastore->uid) {
 | |
| 		ao2_ref(datastore, -1);
 | |
| 		return NULL;
 | |
| 	}
 | |
| 
 | |
| 	return datastore;
 | |
| }
 |