2N/A/*
2N/A * CDDL HEADER START
2N/A *
2N/A * The contents of this file are subject to the terms of the
2N/A * Common Development and Distribution License, Version 1.0 only
2N/A * (the "License"). You may not use this file except in compliance
2N/A * with the License.
2N/A *
2N/A * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
2N/A * or http://www.opensolaris.org/os/licensing.
2N/A * See the License for the specific language governing permissions
2N/A * and limitations under the License.
2N/A *
2N/A * When distributing Covered Code, include this CDDL HEADER in each
2N/A * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
2N/A * If applicable, add the following below this CDDL HEADER, with the
2N/A * fields enclosed by brackets "[]" replaced with your own identifying
2N/A * information: Portions Copyright [yyyy] [name of copyright owner]
2N/A *
2N/A * CDDL HEADER END
2N/A */
2N/A/*
2N/A * Copyright (c) 2002-2003, Network Appliance, Inc. All rights reserved.
2N/A */
2N/A
2N/A/*
2N/A * Copyright 2004 Sun Microsystems, Inc. All rights reserved.
2N/A * Use is subject to license terms.
2N/A */
2N/A
2N/A#pragma ident "%Z%%M% %I% %E% SMI"
2N/A
2N/A/*
2N/A *
2N/A * MODULE: dat_sr.c
2N/A *
2N/A * PURPOSE: static registry implementation
2N/A *
2N/A * $Id: dat_sr.c,v 1.12 2003/08/20 14:28:40 hobie16 Exp $
2N/A */
2N/A
2N/A
2N/A#include "dat_sr.h"
2N/A
2N/A#include "dat_dictionary.h"
2N/A#include "udat_sr_parser.h"
2N/A
2N/A
2N/A/*
2N/A *
2N/A * Global Variables
2N/A *
2N/A */
2N/A
2N/Astatic DAT_OS_LOCK g_sr_lock;
2N/Astatic DAT_DICTIONARY *g_sr_dictionary = NULL;
2N/A
2N/A
2N/A/*
2N/A *
2N/A * External Functions
2N/A *
2N/A */
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_init
2N/A */
2N/A
2N/ADAT_RETURN
2N/Adat_sr_init(void)
2N/A{
2N/A DAT_RETURN status;
2N/A
2N/A status = dat_os_lock_init(&g_sr_lock);
2N/A if (DAT_SUCCESS != status) {
2N/A return (status);
2N/A }
2N/A
2N/A status = dat_dictionary_create(&g_sr_dictionary);
2N/A if (DAT_SUCCESS != status) {
2N/A return (status);
2N/A }
2N/A
2N/A /*
2N/A * Since DAT allows providers to be loaded by either the static
2N/A * registry or explicitly through OS dependent methods, do not
2N/A * return an error if no providers are loaded via the static registry.
2N/A */
2N/A
2N/A (void) dat_sr_load();
2N/A
2N/A return (DAT_SUCCESS);
2N/A}
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_fini
2N/A */
2N/A
2N/Aextern DAT_RETURN
2N/Adat_sr_fini(void)
2N/A{
2N/A DAT_RETURN status;
2N/A
2N/A status = dat_os_lock_destroy(&g_sr_lock);
2N/A if (DAT_SUCCESS != status) {
2N/A return (status);
2N/A }
2N/A
2N/A status = dat_dictionary_destroy(g_sr_dictionary);
2N/A if (DAT_SUCCESS != status) {
2N/A return (status);
2N/A }
2N/A
2N/A return (DAT_SUCCESS);
2N/A}
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_insert
2N/A */
2N/A
2N/Aextern DAT_RETURN
2N/Adat_sr_insert(
2N/A IN const DAT_PROVIDER_INFO *info,
2N/A IN DAT_SR_ENTRY *entry)
2N/A{
2N/A DAT_RETURN status;
2N/A DAT_SR_ENTRY *data;
2N/A DAT_OS_SIZE lib_path_size;
2N/A DAT_OS_SIZE lib_path_len;
2N/A DAT_OS_SIZE ia_params_size;
2N/A DAT_OS_SIZE ia_params_len;
2N/A DAT_DICTIONARY_ENTRY dict_entry;
2N/A
2N/A if (NULL == (data = dat_os_alloc(sizeof (DAT_SR_ENTRY)))) {
2N/A status = DAT_ERROR(DAT_INSUFFICIENT_RESOURCES,
2N/A DAT_RESOURCE_MEMORY);
2N/A goto bail;
2N/A }
2N/A
2N/A lib_path_len = strlen(entry->lib_path);
2N/A lib_path_size = (lib_path_len + 1) * sizeof (char);
2N/A
2N/A if (NULL == (data->lib_path = dat_os_alloc(lib_path_size))) {
2N/A status = DAT_ERROR(DAT_INSUFFICIENT_RESOURCES,
2N/A DAT_RESOURCE_MEMORY);
2N/A goto bail;
2N/A }
2N/A
2N/A (void) dat_os_strncpy(data->lib_path, entry->lib_path, lib_path_len);
2N/A data->lib_path[lib_path_len] = '\0';
2N/A
2N/A ia_params_len = strlen(entry->ia_params);
2N/A ia_params_size = (ia_params_len + 1) * sizeof (char);
2N/A
2N/A if (NULL == (data->ia_params = dat_os_alloc(ia_params_size))) {
2N/A status = DAT_ERROR(DAT_INSUFFICIENT_RESOURCES,
2N/A DAT_RESOURCE_MEMORY);
2N/A goto bail;
2N/A }
2N/A
2N/A (void) dat_os_strncpy(data->ia_params, entry->ia_params, ia_params_len);
2N/A data->ia_params[ia_params_len] = '\0';
2N/A
2N/A data->info = entry->info;
2N/A data->lib_handle = entry->lib_handle;
2N/A data->ref_count = entry->ref_count;
2N/A
2N/A dict_entry = NULL;
2N/A status = dat_dictionary_entry_create(&dict_entry);
2N/A if (DAT_SUCCESS != status) {
2N/A goto bail;
2N/A }
2N/A
2N/A dat_os_lock(&g_sr_lock);
2N/A
2N/A status = dat_dictionary_insert(g_sr_dictionary,
2N/A dict_entry,
2N/A info,
2N/A (DAT_DICTIONARY_DATA *)data);
2N/A dat_os_unlock(&g_sr_lock);
2N/A
2N/Abail:
2N/A if (DAT_SUCCESS != status) {
2N/A if (NULL != data) {
2N/A if (NULL != data->lib_path) {
2N/A dat_os_free(data->lib_path, lib_path_size);
2N/A }
2N/A
2N/A if (NULL != data->ia_params) {
2N/A dat_os_free(data->ia_params, ia_params_size);
2N/A }
2N/A
2N/A dat_os_free(data, sizeof (DAT_SR_ENTRY));
2N/A }
2N/A
2N/A if (NULL != dict_entry) {
2N/A (void) dat_dictionary_entry_destroy(dict_entry);
2N/A }
2N/A }
2N/A
2N/A return (status);
2N/A}
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_size
2N/A */
2N/A
2N/Aextern DAT_RETURN
2N/Adat_sr_size(
2N/A OUT DAT_COUNT *size)
2N/A{
2N/A return (dat_dictionary_size(g_sr_dictionary, size));
2N/A}
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_list
2N/A */
2N/A
2N/Aextern DAT_RETURN
2N/Adat_sr_list(
2N/A IN DAT_COUNT max_to_return,
2N/A OUT DAT_COUNT *entries_returned,
2N/A OUT DAT_PROVIDER_INFO * (dat_provider_list[]))
2N/A{
2N/A DAT_SR_ENTRY **array;
2N/A DAT_COUNT array_size;
2N/A DAT_COUNT i;
2N/A DAT_RETURN status;
2N/A
2N/A array = NULL;
2N/A status = DAT_SUCCESS;
2N/A
2N/A /*
2N/A * The dictionary size may increase between the call to
2N/A * dat_dictionary_size() and dat_dictionary_enumerate().
2N/A * Therefore we loop until a successful enumeration is made.
2N/A */
2N/A *entries_returned = 0;
2N/A for (;;) {
2N/A status = dat_dictionary_size(g_sr_dictionary, &array_size);
2N/A if (DAT_SUCCESS != status) {
2N/A goto bail;
2N/A }
2N/A
2N/A if (array_size == 0) {
2N/A status = DAT_SUCCESS;
2N/A goto bail;
2N/A }
2N/A
2N/A array = dat_os_alloc(array_size * sizeof (DAT_SR_ENTRY *));
2N/A if (array == NULL) {
2N/A status = DAT_ERROR(DAT_INSUFFICIENT_RESOURCES,
2N/A DAT_RESOURCE_MEMORY);
2N/A goto bail;
2N/A }
2N/A
2N/A dat_os_lock(&g_sr_lock);
2N/A
2N/A status = dat_dictionary_enumerate(g_sr_dictionary,
2N/A (DAT_DICTIONARY_DATA *) array,
2N/A array_size);
2N/A
2N/A dat_os_unlock(&g_sr_lock);
2N/A
2N/A if (DAT_SUCCESS == status) {
2N/A break;
2N/A } else {
2N/A dat_os_free(array,
2N/A array_size * sizeof (DAT_SR_ENTRY *));
2N/A array = NULL;
2N/A continue;
2N/A }
2N/A }
2N/A
2N/A for (i = 0; (i < max_to_return) && (i < array_size); i++) {
2N/A if (NULL == dat_provider_list[i]) {
2N/A status = DAT_ERROR(DAT_INVALID_PARAMETER,
2N/A DAT_INVALID_ARG3);
2N/A goto bail;
2N/A }
2N/A
2N/A *dat_provider_list[i] = array[i]->info;
2N/A }
2N/A
2N/A *entries_returned = i;
2N/A
2N/Abail:
2N/A if (NULL != array) {
2N/A dat_os_free(array, array_size * sizeof (DAT_SR_ENTRY *));
2N/A }
2N/A
2N/A return (status);
2N/A}
2N/A
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_provider_open
2N/A */
2N/A
2N/Aextern DAT_RETURN
2N/Adat_sr_provider_open(
2N/A IN const DAT_PROVIDER_INFO *info)
2N/A{
2N/A DAT_RETURN status;
2N/A DAT_SR_ENTRY *data;
2N/A
2N/A dat_os_lock(&g_sr_lock);
2N/A
2N/A status = dat_dictionary_search(g_sr_dictionary,
2N/A info,
2N/A (DAT_DICTIONARY_DATA *) &data);
2N/A
2N/A if (DAT_SUCCESS == status) {
2N/A if (0 == data->ref_count) {
2N/A status = dat_os_library_load(data->lib_path,
2N/A &data->lib_handle);
2N/A if (status == DAT_SUCCESS) {
2N/A data->ref_count++;
2N/A } else {
2N/A dat_os_dbg_print(DAT_OS_DBG_TYPE_SR,
2N/A "DAT Registry: static registry unable to "
2N/A "load library %s\n", data->lib_path);
2N/A goto bail;
2N/A }
2N/A data->init_func = (DAT_PROVIDER_INIT_FUNC)
2N/A dat_os_library_sym(data->lib_handle,
2N/A DAT_PROVIDER_INIT_FUNC_STR);
2N/A data->fini_func = (DAT_PROVIDER_FINI_FUNC)
2N/A dat_os_library_sym(data->lib_handle,
2N/A DAT_PROVIDER_FINI_FUNC_STR);
2N/A
2N/A if (NULL != data->init_func) {
2N/A (*data->init_func)(&data->info,
2N/A data->ia_params);
2N/A }
2N/A } else {
2N/A data->ref_count++;
2N/A }
2N/A }
2N/A
2N/Abail:
2N/A dat_os_unlock(&g_sr_lock);
2N/A
2N/A return (status);
2N/A}
2N/A
2N/A
2N/A/*
2N/A * Function: dat_sr_provider_close
2N/A */
2N/A
2N/Aextern DAT_RETURN
2N/Adat_sr_provider_close(
2N/A IN const DAT_PROVIDER_INFO *info)
2N/A{
2N/A DAT_RETURN status;
2N/A DAT_SR_ENTRY *data;
2N/A
2N/A dat_os_lock(&g_sr_lock);
2N/A
2N/A status = dat_dictionary_search(g_sr_dictionary,
2N/A info,
2N/A (DAT_DICTIONARY_DATA *)&data);
2N/A
2N/A if (DAT_SUCCESS == status) {
2N/A if (1 == data->ref_count) {
2N/A if (NULL != data->fini_func) {
2N/A (*data->fini_func)(&data->info);
2N/A }
2N/A
2N/A status = dat_os_library_unload(data->lib_handle);
2N/A if (status == DAT_SUCCESS) {
2N/A data->ref_count--;
2N/A }
2N/A } else {
2N/A data->ref_count--;
2N/A }
2N/A }
2N/A
2N/A dat_os_unlock(&g_sr_lock);
2N/A
2N/A return (status);
2N/A}