1
0
mirror of https://github.com/samba-team/samba.git synced 2024-12-23 17:34:34 +03:00
samba-mirror/source3/lib/adt_tree.c

430 lines
10 KiB
C
Raw Normal View History

/*
* Unix SMB/CIFS implementation.
* Generic Abstract Data Types
* Copyright (C) Gerald Carter 2002.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#include "includes.h"
#include "adt_tree.h"
/**************************************************************************
*************************************************************************/
static bool trim_tree_keypath( char *path, char **base, char **new_path )
{
char *p;
2010-02-07 17:01:57 +03:00
*new_path = *base = NULL;
2010-02-07 17:01:57 +03:00
if ( !path )
return False;
2010-02-07 17:01:57 +03:00
*base = path;
2010-02-07 17:01:57 +03:00
p = strchr( path, '/' );
2010-02-07 17:01:57 +03:00
if ( p ) {
*p = '\0';
*new_path = p+1;
}
2010-02-07 17:01:57 +03:00
return True;
}
/**************************************************************************
Initialize the tree's root. The cmp_fn is a callback function used
for comparision of two children
*************************************************************************/
SORTED_TREE* pathtree_init( void *data_p, int (cmp_fn)(void*, void*) )
{
SORTED_TREE *tree = NULL;
2010-02-07 17:01:57 +03:00
if ( !(tree = TALLOC_ZERO_P(NULL, SORTED_TREE)) )
return NULL;
2010-02-07 17:01:57 +03:00
tree->compare = cmp_fn;
2010-02-07 17:01:57 +03:00
if ( !(tree->root = TALLOC_ZERO_P(tree, TREE_NODE)) ) {
TALLOC_FREE( tree );
return NULL;
}
2010-02-07 17:01:57 +03:00
tree->root->data_p = data_p;
2010-02-07 17:01:57 +03:00
return tree;
}
/**************************************************************************
Find the next child given a key string
*************************************************************************/
static TREE_NODE* pathtree_birth_child( TREE_NODE *node, char* key )
{
TREE_NODE *infant = NULL;
TREE_NODE **siblings;
int i;
2010-02-07 17:01:57 +03:00
if ( !(infant = TALLOC_ZERO_P( node, TREE_NODE)) )
return NULL;
2010-02-07 17:01:57 +03:00
infant->key = talloc_strdup( infant, key );
infant->parent = node;
2010-02-07 17:01:57 +03:00
siblings = TALLOC_REALLOC_ARRAY( node, node->children, TREE_NODE *, node->num_children+1 );
2010-02-07 17:01:57 +03:00
if ( siblings )
node->children = siblings;
2010-02-07 17:01:57 +03:00
node->num_children++;
2010-02-07 17:01:57 +03:00
/* first child */
2010-02-07 17:01:57 +03:00
if ( node->num_children == 1 ) {
DEBUG(11,("pathtree_birth_child: First child of node [%s]! [%s]\n",
node->key ? node->key : "NULL", infant->key ));
node->children[0] = infant;
}
else
{
/*
* multiple siblings .... (at least 2 children)
*
* work from the end of the list forward
* The last child is not set at this point
* Insert the new infanct in ascending order
* from left to right
*/
2010-02-07 17:01:57 +03:00
for ( i = node->num_children-1; i>=1; i-- )
{
DEBUG(11,("pathtree_birth_child: Looking for crib; infant -> [%s], child -> [%s]\n",
infant->key, node->children[i-1]->key));
2010-02-07 17:01:57 +03:00
/* the strings should never match assuming that we
have called pathtree_find_child() first */
2010-02-07 17:01:57 +03:00
if ( StrCaseCmp( infant->key, node->children[i-1]->key ) > 0 ) {
DEBUG(11,("pathtree_birth_child: storing infant in i == [%d]\n",
i));
node->children[i] = infant;
break;
}
2010-02-07 17:01:57 +03:00
/* bump everything towards the end on slot */
2010-02-07 17:01:57 +03:00
node->children[i] = node->children[i-1];
}
DEBUG(11,("pathtree_birth_child: Exiting loop (i == [%d])\n", i ));
2010-02-07 17:01:57 +03:00
/* if we haven't found the correct slot yet, the child
will be first in the list */
2010-02-07 17:01:57 +03:00
if ( i == 0 )
node->children[0] = infant;
}
return infant;
}
/**************************************************************************
Find the next child given a key string
*************************************************************************/
static TREE_NODE* pathtree_find_child( TREE_NODE *node, char* key )
{
TREE_NODE *next = NULL;
int i, result;
2010-02-07 17:01:57 +03:00
if ( !node ) {
DEBUG(0,("pathtree_find_child: NULL node passed into function!\n"));
return NULL;
}
2010-02-07 17:01:57 +03:00
if ( !key ) {
DEBUG(0,("pathtree_find_child: NULL key string passed into function!\n"));
return NULL;
}
2010-02-07 17:01:57 +03:00
for ( i=0; i<node->num_children; i++ )
{
DEBUG(11,("pathtree_find_child: child key => [%s]\n",
node->children[i]->key));
2010-02-07 17:01:57 +03:00
result = StrCaseCmp( node->children[i]->key, key );
2010-02-07 17:01:57 +03:00
if ( result == 0 )
next = node->children[i];
2010-02-07 17:01:57 +03:00
/* if result > 0 then we've gone to far because
the list of children is sorted by key name
If result == 0, then we have a match */
2010-02-07 17:01:57 +03:00
if ( result > 0 )
break;
}
DEBUG(11,("pathtree_find_child: %s [%s]\n",
next ? "Found" : "Did not find", key ));
2010-02-07 17:01:57 +03:00
return next;
}
/**************************************************************************
Add a new node into the tree given a key path and a blob of data
*************************************************************************/
WERROR pathtree_add( SORTED_TREE *tree, const char *path, void *data_p )
{
char *str, *base, *path2;
TREE_NODE *current, *next;
WERROR ret = WERR_OK;
2010-02-07 17:01:57 +03:00
DEBUG(8,("pathtree_add: Enter\n"));
2010-02-07 17:01:57 +03:00
if ( !path || *path != '/' ) {
DEBUG(0,("pathtree_add: Attempt to add a node with a bad path [%s]\n",
path ? path : "NULL" ));
return WERR_INVALID_PARAM;
}
2010-02-07 17:01:57 +03:00
if ( !tree ) {
DEBUG(0,("pathtree_add: Attempt to add a node to an uninitialized tree!\n"));
return WERR_INVALID_PARAM;
}
2010-02-07 17:01:57 +03:00
/* move past the first '/' */
2010-02-07 17:01:57 +03:00
path++;
path2 = SMB_STRDUP( path );
if ( !path2 ) {
DEBUG(0,("pathtree_add: strdup() failed on string [%s]!?!?!\n", path));
return WERR_NOMEM;
}
2010-02-07 17:01:57 +03:00
/*
* this works sort of like a 'mkdir -p' call, possibly
* creating an entire path to the new node at once
* The path should be of the form /<key1>/<key2>/...
*/
2010-02-07 17:01:57 +03:00
base = path2;
str = path2;
current = tree->root;
2010-02-07 17:01:57 +03:00
do {
/* break off the remaining part of the path */
2010-02-07 17:01:57 +03:00
str = strchr( str, '/' );
if ( str )
*str = '\0';
2010-02-07 17:01:57 +03:00
/* iterate to the next child--birth it if necessary */
2010-02-07 17:01:57 +03:00
next = pathtree_find_child( current, base );
if ( !next ) {
next = pathtree_birth_child( current, base );
if ( !next ) {
DEBUG(0,("pathtree_add: Failed to create new child!\n"));
ret = WERR_NOMEM;
goto done;
}
}
current = next;
2010-02-07 17:01:57 +03:00
/* setup the next part of the path */
2010-02-07 17:01:57 +03:00
base = str;
if ( base ) {
*base = '/';
base++;
str = base;
}
2010-02-07 17:01:57 +03:00
} while ( base != NULL );
2010-02-07 17:01:57 +03:00
current->data_p = data_p;
2010-02-07 17:01:57 +03:00
DEBUG(10,("pathtree_add: Successfully added node [%s] to tree\n",
path ));
DEBUG(8,("pathtree_add: Exit\n"));
done:
SAFE_FREE( path2 );
return ret;
}
/**************************************************************************
Recursive routine to print out all children of a TREE_NODE
*************************************************************************/
static void pathtree_print_children(TALLOC_CTX *ctx,
TREE_NODE *node,
int debug,
const char *path )
{
int i;
int num_children;
char *path2 = NULL;
if ( !node )
return;
if ( node->key )
DEBUG(debug,("%s: [%s] (%s)\n", path ? path : "NULL", node->key,
node->data_p ? "data" : "NULL" ));
if ( path ) {
path2 = talloc_strdup(ctx, path);
if (!path2) {
return;
}
}
path2 = talloc_asprintf(ctx,
"%s%s/",
path ? path : "",
node->key ? node->key : "NULL");
if (!path2) {
return;
}
num_children = node->num_children;
for ( i=0; i<num_children; i++ ) {
pathtree_print_children(ctx, node->children[i], debug, path2 );
}
}
/**************************************************************************
Dump the kys for a tree to the log file
*************************************************************************/
void pathtree_print_keys( SORTED_TREE *tree, int debug )
{
int i;
int num_children = tree->root->num_children;
if ( tree->root->key )
DEBUG(debug,("ROOT/: [%s] (%s)\n", tree->root->key,
tree->root->data_p ? "data" : "NULL" ));
for ( i=0; i<num_children; i++ ) {
TALLOC_CTX *ctx = talloc_stackframe();
pathtree_print_children(ctx, tree->root->children[i], debug,
tree->root->key ? tree->root->key : "ROOT/" );
TALLOC_FREE(ctx);
}
}
/**************************************************************************
return the data_p for for the node in tree matching the key string
The key string is the full path. We must break it apart and walk
the tree
*************************************************************************/
void* pathtree_find( SORTED_TREE *tree, char *key )
{
char *keystr, *base = NULL, *str = NULL, *p;
TREE_NODE *current;
void *result = NULL;
2010-02-07 17:01:57 +03:00
DEBUG(10,("pathtree_find: Enter [%s]\n", key ? key : "NULL" ));
/* sanity checks first */
2010-02-07 17:01:57 +03:00
if ( !key ) {
DEBUG(0,("pathtree_find: Attempt to search tree using NULL search string!\n"));
return NULL;
}
2010-02-07 17:01:57 +03:00
if ( !tree ) {
DEBUG(0,("pathtree_find: Attempt to search an uninitialized tree using string [%s]!\n",
key ? key : "NULL" ));
return NULL;
}
2010-02-07 17:01:57 +03:00
if ( !tree->root )
return NULL;
2010-02-07 17:01:57 +03:00
/* make a copy to play with */
2010-02-07 17:01:57 +03:00
if ( *key == '/' )
keystr = SMB_STRDUP( key+1 );
else
keystr = SMB_STRDUP( key );
2010-02-07 17:01:57 +03:00
if ( !keystr ) {
DEBUG(0,("pathtree_find: strdup() failed on string [%s]!?!?!\n", key));
return NULL;
}
/* start breaking the path apart */
2010-02-07 17:01:57 +03:00
p = keystr;
current = tree->root;
2010-02-07 17:01:57 +03:00
if ( tree->root->data_p )
result = tree->root->data_p;
2010-02-07 17:01:57 +03:00
do
{
/* break off the remaining part of the path */
trim_tree_keypath( p, &base, &str );
2010-02-07 17:01:57 +03:00
DEBUG(11,("pathtree_find: [loop] base => [%s], new_path => [%s]\n",
base ? base : "",
str ? str : ""));
/* iterate to the next child */
2010-02-07 17:01:57 +03:00
current = pathtree_find_child( current, base );
2010-02-07 17:01:57 +03:00
/*
* the idea is that the data_p for a parent should
* be inherited by all children, but allow it to be
* overridden farther down
*/
2010-02-07 17:01:57 +03:00
if ( current && current->data_p )
result = current->data_p;
/* reset the path pointer 'p' to the remaining part of the key string */
p = str;
2010-02-07 17:01:57 +03:00
} while ( str && current );
2010-02-07 17:01:57 +03:00
/* result should be the data_p from the lowest match node in the tree */
if ( result )
DEBUG(11,("pathtree_find: Found data_p!\n"));
2010-02-07 17:01:57 +03:00
SAFE_FREE( keystr );
2010-02-07 17:01:57 +03:00
DEBUG(10,("pathtree_find: Exit\n"));
2010-02-07 17:01:57 +03:00
return result;
}