www/apache
1
0
Fork 0
mirror of https://github.com/apache/httpd.git synced 2025-08-05 16:55:50 +03:00
Code Activity

Remove all of the ldap modules. These have been moved to their own

Browse Source 
repository, httpd-ldap, and they now form their own sub-project of the
httpd project.


git-svn-id: https://svn.apache.org/repos/asf/httpd/httpd/trunk@91508 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Ryan Bloom
2001-10-16 21:32:41 +00:00
parent fd71dd3052
commit 74f34a272e
8 changed files with 3 additions and 2503 deletions
Download Patch File Download Diff File Expand all files Collapse all files

309
modules/ldap/util_ldap_cache.c
View File

@@ -1,309 +0,0 @@
/* ====================================================================
* The Apache Software License, Version 1.1
*
* Copyright (c) 2000-2001 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Apache" and "Apache Software Foundation" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact apache@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* nor may "Apache" appear in their name, without prior written
* permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation. For more
* information on the Apache Software Foundation, please see
* <http://www.apache.org/>.
*/
/*
* util_ldap_cache.c: LDAP cache things
*
* Original code from auth_ldap module for Apache v1.3:
* Copyright 1998, 1999 Enbridge Pipelines Inc.
* Copyright 1999-2001 Dave Carrigan
*/
#include <apr_ldap.h>
#include "util_ldap.h"
#include "util_ldap_cache.h"
#ifdef APU_HAS_LDAP
/* ------------------------------------------------------------------ */
unsigned long util_ldap_url_node_hash(void *n)
{
util_url_node_t *node = (util_url_node_t *)n;
return util_ald_hash_string(1, node->url);
}
int util_ldap_url_node_compare(void *a, void *b)
{
util_url_node_t *na = (util_url_node_t *)a;
util_url_node_t *nb = (util_url_node_t *)b;
return(strcmp(na->url, nb->url) == 0);
}
void *util_ldap_url_node_copy(void *c)
{
util_url_node_t *n = (util_url_node_t *)c;
util_url_node_t *node = (util_url_node_t *)util_ald_alloc(sizeof(util_url_node_t));
if (node) {
if (!(node->url = util_ald_strdup(n->url))) {
util_ald_free(node->url);
return NULL;
}
node->search_cache = n->search_cache;
node->compare_cache = n->compare_cache;
node->dn_compare_cache = n->dn_compare_cache;
return node;
}
else {
return NULL;
}
}
void util_ldap_url_node_free(void *n)
{
util_url_node_t *node = (util_url_node_t *)n;
util_ald_free(node->url);
util_ald_destroy_cache(node->search_cache);
util_ald_destroy_cache(node->compare_cache);
util_ald_destroy_cache(node->dn_compare_cache);
util_ald_free(node);
}
/* ------------------------------------------------------------------ */
/* Cache functions for search nodes */
unsigned long util_ldap_search_node_hash(void *n)
{
util_search_node_t *node = (util_search_node_t *)n;
return util_ald_hash_string(1, ((util_search_node_t *)(node))->username);
}
int util_ldap_search_node_compare(void *a, void *b)
{
return(strcmp(((util_search_node_t *)a)->username,
((util_search_node_t *)b)->username) == 0);
}
void *util_ldap_search_node_copy(void *c)
{
util_search_node_t *node = (util_search_node_t *)c;
util_search_node_t *newnode = util_ald_alloc(sizeof(util_search_node_t));
/* safety check */
if (newnode) {
/* copy vals */
if (node->vals) {
int k = 0;
int i = 0;
while (node->vals[k++]);
if (!(newnode->vals = util_ald_alloc(sizeof(char *) * (k+1)))) {
util_ldap_search_node_free(newnode);
return NULL;
}
while (node->vals[i]) {
if (!(newnode->vals[i] = util_ald_strdup(node->vals[i]))) {
util_ldap_search_node_free(newnode);
return NULL;
}
i++;
}
}
else {
newnode->vals = NULL;
}
if (!(newnode->username = util_ald_strdup(node->username)) ||
!(newnode->dn = util_ald_strdup(node->dn)) ||
!(newnode->bindpw = util_ald_strdup(node->bindpw)) ) {
util_ldap_search_node_free(newnode);
return NULL;
}
newnode->lastbind = node->lastbind;
}
return (void *)newnode;
}
void util_ldap_search_node_free(void *n)
{
int i = 0;
util_search_node_t *node = (util_search_node_t *)n;
if (node->vals) {
while (node->vals[i]) {
util_ald_free(node->vals[i++]);
}
util_ald_free(node->vals);
}
util_ald_free(node->username);
util_ald_free(node->dn);
util_ald_free(node->bindpw);
util_ald_free(node);
}
/* ------------------------------------------------------------------ */
unsigned long util_ldap_compare_node_hash(void *n)
{
util_compare_node_t *node = (util_compare_node_t *)n;
return util_ald_hash_string(3, node->dn, node->attrib, node->value);
}
int util_ldap_compare_node_compare(void *a, void *b)
{
util_compare_node_t *na = (util_compare_node_t *)a;
util_compare_node_t *nb = (util_compare_node_t *)b;
return (strcmp(na->dn, nb->dn) == 0 &&
strcmp(na->attrib, nb->attrib) == 0 &&
strcmp(na->value, nb->value) == 0);
}
void *util_ldap_compare_node_copy(void *c)
{
util_compare_node_t *n = (util_compare_node_t *)c;
util_compare_node_t *node = (util_compare_node_t *)util_ald_alloc(sizeof(util_compare_node_t));
if (node) {
if (!(node->dn = util_ald_strdup(n->dn)) ||
!(node->attrib = util_ald_strdup(n->attrib)) ||
!(node->value = util_ald_strdup(n->value))) {
util_ldap_compare_node_free(node);
return NULL;
}
node->lastcompare = n->lastcompare;
node->result = n->result;
return node;
}
else {
return NULL;
}
}
void util_ldap_compare_node_free(void *n)
{
util_compare_node_t *node = (util_compare_node_t *)n;
util_ald_free(node->dn);
util_ald_free(node->attrib);
util_ald_free(node->value);
util_ald_free(node);
}
/* ------------------------------------------------------------------ */
unsigned long util_ldap_dn_compare_node_hash(void *n)
{
return util_ald_hash_string(1, ((util_dn_compare_node_t *)n)->reqdn);
}
int util_ldap_dn_compare_node_compare(void *a, void *b)
{
return (strcmp(((util_dn_compare_node_t *)a)->reqdn,
((util_dn_compare_node_t *)b)->reqdn) == 0);
}
void *util_ldap_dn_compare_node_copy(void *c)
{
util_dn_compare_node_t *n = (util_dn_compare_node_t *)c;
util_dn_compare_node_t *node = (util_dn_compare_node_t *)util_ald_alloc(sizeof(util_dn_compare_node_t));
if (node) {
if (!(node->reqdn = util_ald_strdup(n->reqdn)) ||
!(node->dn = util_ald_strdup(n->dn))) {
util_ldap_dn_compare_node_free(node);
return NULL;
}
return node;
}
else {
return NULL;
}
}
void util_ldap_dn_compare_node_free(void *n)
{
util_dn_compare_node_t *node = (util_dn_compare_node_t *)n;
util_ald_free(node->reqdn);
util_ald_free(node->dn);
util_ald_free(node);
}
/* ------------------------------------------------------------------ */
apr_status_t util_ldap_cache_child_kill(void *data);
apr_status_t util_ldap_cache_module_kill(void *data);
apr_status_t util_ldap_cache_module_kill(void *data)
{
#if APR_HAS_SHARED_MEMORY
if (util_ldap_shm != NULL) {
apr_status_t result = apr_shm_destroy(util_ldap_shm);
util_ldap_shm = NULL;
return result;
}
#endif
return APR_SUCCESS;
}
apr_status_t util_ldap_cache_init(apr_pool_t *pool, apr_size_t reqsize)
{
apr_status_t result = APR_SUCCESS;
apr_pool_cleanup_register(pool, NULL, util_ldap_cache_module_kill, apr_pool_cleanup_null);
#if APR_HAS_SHARED_MEMORY
result = apr_shm_init(&util_ldap_shm, reqsize, "/tmp/ldap_cache", pool);
#endif
util_ldap_cache = util_ald_create_cache(50,
util_ldap_url_node_hash,
util_ldap_url_node_compare,
util_ldap_url_node_copy,
util_ldap_url_node_free);
return result;
}
#endif /* APU_HAS_LDAP */