source: vendor/3.5.8/source3/registry/reg_util.c

/* 
 *  Unix SMB/CIFS implementation.
 *  Virtual Windows Registry Layer (utility functions)
 *  Copyright (C) Gerald Carter                     2002-2005
 *
 *  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/>.
 */

/* Implementation of registry frontend view functions. */

#include "includes.h"

#undef DBGC_CLASS
#define DBGC_CLASS DBGC_REGISTRY

/***********************************************************************
 Utility function for splitting the base path of a registry path off
 by setting base and new_path to the apprapriate offsets withing the
 path.

 WARNING!!  Does modify the original string!
 ***********************************************************************/

bool reg_split_path(char *path, char **base, char **new_path)
{
        char *p;

        *new_path = *base = NULL;

        if (!path) {
                return false;
        }
        *base = path;

        p = strchr(path, '\\');

        if ( p ) {
                *p = '\0';
                *new_path = p+1;
        }

        return true;
}

/***********************************************************************
 Utility function for splitting the base path of a registry path off
 by setting base and new_path to the appropriate offsets withing the
 path.

 WARNING!!  Does modify the original string!
 ***********************************************************************/

bool reg_split_key(char *path, char **base, char **key)
{
        char *p;

        *key = *base = NULL;

        if (!path) {
                return false;
        }

        *base = path;

        p = strrchr(path, '\\');

        if (p) {
                *p = '\0';
                *key = p+1;
        }

        return true;
}

/**
 * The full path to the registry key is used as database key
 * after the \'s are converted to /'s.
 * Leading and trailing '/' and '\' characters are stripped.
 * Key string is also normalized to UPPER case.
 */

char *normalize_reg_path(TALLOC_CTX *ctx, const char *keyname )
{
        char *p;
        char *nkeyname;

        /* skip leading '/' and '\' chars */
        p = (char *)keyname;
        while ((*p == '/') || (*p == '\\')) {
                p++;
        }

        nkeyname = talloc_string_sub(ctx, p, "\\", "/");
        if (nkeyname == NULL) {
                return NULL;
        }

        /* strip trailing '/' chars */
        p = strrchr(nkeyname, '/');
        while ((p != NULL) && (p[1] == '\0')) {
                *p = '\0';
                p = strrchr(nkeyname, '/');
        }

        strupper_m(nkeyname);

        return nkeyname;
}

/**
 * normalize ther registry path in place.
 */
void normalize_dbkey(char *key)
{
        size_t len = strlen(key);
        string_sub(key, "\\", "/", len+1);
        strupper_m(key);
}

/**********************************************************************
 move to next non-delimter character
*********************************************************************/

char *reg_remaining_path(TALLOC_CTX *ctx, const char *key)
{
        char *new_path = NULL;
        char *p = NULL;

        if (!key || !*key) {
                return NULL;
        }

        new_path = talloc_strdup(ctx, key);
        if (!new_path) {
                return NULL;
        }
        /* normalize_reg_path( new_path ); */
        if (!(p = strchr(new_path, '\\')) ) {
                if (!(p = strchr( new_path, '/'))) {
                        p = new_path;
                } else {
                        p++;
                }
        } else {
                p++;
        }

        return p;
}