/*

 * Tree functions

 *

 * Copyright (C) 2006-2026, Joachim Metz <joachim.metz@gmail.com>

 *

 * Refer to AUTHORS for acknowledgements.

 *

 * This program is free software: you can redistribute it and/or modify

 * it under the terms of the GNU Lesser 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 Lesser General Public License

 * along with this program.  If not, see <https://www.gnu.org/licenses/>.

 */

#include <common.h>

#include <memory.h>

#include <types.h>

#include "libcdata_definitions.h"

#include "libcdata_libcerror.h"

#include "libcdata_libcthreads.h"

#include "libcdata_list.h"

#include "libcdata_tree_node.h"

#include "libcdata_types.h"

/* Creates a tree node

 * Make sure the value node is referencing, is set to NULL

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_initialize(

     libcdata_tree_node_t **node,

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_initialize";

  if( node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  if( *node != NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_VALUE_ALREADY_SET,

     "%s: invalid node value already set.",

     function );

    return( -1 );

  }

  internal_node = memory_allocate_structure(

                   libcdata_internal_tree_node_t );

  if( internal_node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_MEMORY,

     LIBCERROR_MEMORY_ERROR_INSUFFICIENT,

     "%s: unable to create node.",

     function );

    goto on_error;

  }

  if( memory_set(

       internal_node,

       0,

       sizeof( libcdata_internal_tree_node_t ) ) == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_MEMORY,

     LIBCERROR_MEMORY_ERROR_SET_FAILED,

     "%s: unable to clear node.",

     function );

    memory_free(

     internal_node );

    return( -1 );

  }

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_initialize(

       &( internal_node->read_write_lock ),

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_INITIALIZE_FAILED,

     "%s: unable to initialize read/write lock.",

     function );

    goto on_error;

  }

#endif

  *node = (libcdata_tree_node_t *) internal_node;

  return( 1 );

on_error:

  if( internal_node != NULL )

  {

    memory_free(

     internal_node );

  }

  return( -1 );

}

/* Frees a tree node, its sub nodes

 * Uses the value_free_function to free the value

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_free(

     libcdata_tree_node_t **node,

     int (*value_free_function)(

            intptr_t **value,

            libcerror_error_t **error ),

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_free";

  int result                                   = 1;

  if( node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  if( *node != NULL )

  {

    internal_node = (libcdata_internal_tree_node_t *) *node;

    if( ( internal_node->parent_node != NULL )

     || ( internal_node->previous_node != NULL )

     || ( internal_node->next_node != NULL ) )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_VALUE_ALREADY_SET,

       "%s: invalid node - connected to other nodes.",

       function );

      return( -1 );

    }

    *node = NULL;

    if( libcdata_internal_tree_node_free(

         &internal_node,

         value_free_function,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_FINALIZE_FAILED,

       "%s: unable to free node.",

       function );

      result = -1;

    }

  }

  return( result );

}

/* Frees a tree node, its sub nodes

 * Note that this function assumes the node is no longer connected to other nodes

 * Uses the value_free_function to free the value

 * Returns 1 if successful or -1 on error

 */

int libcdata_internal_tree_node_free(

     libcdata_internal_tree_node_t **internal_node,

     int (*value_free_function)(

            intptr_t **value,

            libcerror_error_t **error ),

     libcerror_error_t **error )

{

  static char *function = "libcdata_internal_tree_node_free";

  int result            = 1;

  if( internal_node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  if( *internal_node != NULL )

  {

    if( libcdata_tree_node_empty(

         (libcdata_tree_node_t *) *internal_node,

         value_free_function,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_FINALIZE_FAILED,

       "%s: unable to empty node.",

       function );

      result = -1;

    }

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

    if( libcthreads_read_write_lock_free(

         &( ( *internal_node )->read_write_lock ),

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_FINALIZE_FAILED,

       "%s: unable to free read/write lock.",

       function );

      result = -1;

    }

#endif

    if( ( *internal_node )->value != NULL )

    {

      if( value_free_function != NULL )

      {

        if( value_free_function(

             &( ( *internal_node )->value ),

             error ) != 1 )

        {

          libcerror_error_set(

           error,

           LIBCERROR_ERROR_DOMAIN_RUNTIME,

           LIBCERROR_RUNTIME_ERROR_FINALIZE_FAILED,

           "%s: unable to free value.",

          function );

          result = -1;

        }

        ( *internal_node )->value = NULL;

      }

    }

    memory_free(

     *internal_node );

    *internal_node = NULL;

  }

  return( result );

}

/* Empties a tree node and frees its sub nodes

 * Uses the value_free_function to free the value of the sub nodes

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_empty(

     libcdata_tree_node_t *tree_node,

     int (*value_free_function)(

            intptr_t **value,

            libcerror_error_t **error ),

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  libcdata_tree_node_t *next_node              = NULL;

  libcdata_tree_node_t *parent_node            = NULL;

  libcdata_tree_node_t *previous_node          = NULL;

  libcdata_tree_node_t *sub_node               = NULL;

  static char *function                        = "libcdata_tree_node_empty";

  int number_of_sub_nodes                      = 0;

  int result                                   = 1;

  int sub_node_index                           = 0;

  if( tree_node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid tree node.",

     function );

    return( -1 );

  }

  internal_node = (libcdata_internal_tree_node_t *) tree_node;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_grab_for_write(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to grab read/write lock for writing.",

     function );

    return( -1 );

  }

#endif

  number_of_sub_nodes = internal_node->number_of_sub_nodes;

  sub_node = internal_node->first_sub_node;

  for( sub_node_index = 0;

       sub_node_index < number_of_sub_nodes;

       sub_node_index++ )

  {

    if( libcdata_tree_node_get_nodes(

         sub_node,

         &parent_node,

         &previous_node,

         &next_node,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_GET_FAILED,

       "%s: unable to retrieve nodes of sub node: %d.",

       function,

       sub_node_index );

      goto on_error;

    }

    if( previous_node != NULL )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_VALUE_ALREADY_SET,

       "%s: invalid sub node: %d - previous node is set.",

       function,

       sub_node_index );

      goto on_error;

    }

    internal_node->first_sub_node = next_node;

    if( internal_node->last_sub_node == sub_node )

    {

      internal_node->last_sub_node = next_node;

    }

    internal_node->number_of_sub_nodes -= 1;

    if( next_node != NULL )

    {

      if( libcdata_tree_node_set_previous_node(

           next_node,

           NULL,

           error ) != 1 )

      {

        libcerror_error_set(

         error,

         LIBCERROR_ERROR_DOMAIN_RUNTIME,

         LIBCERROR_RUNTIME_ERROR_SET_FAILED,

         "%s: unable to set previous node of sub node: %d.",

         function,

         sub_node_index + 1 );

        goto on_error;

      }

    }

    if( libcdata_tree_node_set_nodes(

         sub_node,

         NULL,

         NULL,

         NULL,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_SET_FAILED,

       "%s: unable to set nodes of sub node: %d.",

       function,

       sub_node_index );

      goto on_error;

    }

    if( libcdata_internal_tree_node_free(

         (libcdata_internal_tree_node_t **) &sub_node,

         value_free_function,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_FINALIZE_FAILED,

       "%s: unable to free sub node: %d.",

       function,

       sub_node_index );

      result = -1;

    }

    sub_node = next_node;

  }

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_release_for_write(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to release read/write lock for writing.",

     function );

    return( -1 );

  }

#endif

  return( result );

on_error:

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  libcthreads_read_write_lock_release_for_write(

   internal_node->read_write_lock,

   NULL );

#endif

  return( -1 );

}

/* Clones the tree node and its sub nodes

 *

 * The values are cloned using the value_clone_function

 * On error the values are freed using the value_free_function

 *

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_clone(

     libcdata_tree_node_t **destination_node,

     libcdata_tree_node_t *source_node,

     int (*value_free_function)(

            intptr_t **value,

            libcerror_error_t **error ),

     int (*value_clone_function)(

            intptr_t **destination_value,

            intptr_t *source_value,

            libcerror_error_t **error ),

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_destination_node = NULL;

  libcdata_internal_tree_node_t *internal_source_node      = NULL;

  libcdata_tree_node_t *destination_sub_node               = NULL;

  libcdata_tree_node_t *sub_node                           = NULL;

  static char *function                                    = "libcdata_tree_node_clone";

  int sub_node_index                                       = 0;

  if( destination_node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid destination tree node.",

     function );

    return( -1 );

  }

  if( *destination_node != NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_VALUE_ALREADY_SET,

     "%s: invalid destination tree node already set.",

     function );

    return( -1 );

  }

  if( value_free_function == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid value free function.",

     function );

    return( -1 );

  }

  if( value_clone_function == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid value clone function.",

     function );

    return( -1 );

  }

  if( source_node == NULL )

  {

    *destination_node = NULL;

    return( 1 );

  }

  internal_source_node = (libcdata_internal_tree_node_t *) source_node;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_grab_for_read(

       internal_source_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to grab read/write lock for reading.",

     function );

    return( -1 );

  }

#endif

  if( libcdata_tree_node_initialize(

       (libcdata_tree_node_t **) &internal_destination_node,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_INITIALIZE_FAILED,

     "%s: unable to create destination tree node.",

     function );

    goto on_error;

  }

  if( internal_destination_node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_VALUE_MISSING,

     "%s: missing destination tree node.",

     function );

    goto on_error;

  }

  if( value_clone_function(

       &( internal_destination_node->value ),

       internal_source_node->value,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_INITIALIZE_FAILED,

     "%s: unable to create destination tree node value.",

     function );

    goto on_error;

  }

  /* Clone the sub nodes

   */

  sub_node = internal_source_node->first_sub_node;

  for( sub_node_index = 0;

       sub_node_index < internal_source_node->number_of_sub_nodes;

       sub_node_index++ )

  {

    if( sub_node == NULL )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_VALUE_MISSING,

       "%s: corruption detected in source sub node: %d.",

       function,

       sub_node_index );

      goto on_error;

    }

    if( libcdata_tree_node_clone(

         &destination_sub_node,

         sub_node,

         value_free_function,

         value_clone_function,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_COPY_FAILED,

       "%s: unable to create destination sub node: %d.",

       function,

       sub_node_index );

      goto on_error;

    }

    if( libcdata_internal_tree_node_append_node(

         internal_destination_node,

         destination_sub_node,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_APPEND_FAILED,

       "%s: unable to append sub node: %d to destination tree node.",

       function,

       sub_node_index );

      goto on_error;

    }

    destination_sub_node = NULL;

    if( libcdata_tree_node_get_next_node(

         sub_node,

         &sub_node,

         error ) != 1 )

    {

      libcerror_error_set(

       error,

       LIBCERROR_ERROR_DOMAIN_RUNTIME,

       LIBCERROR_RUNTIME_ERROR_GET_FAILED,

       "%s: unable to retrieve next node of sub node: %d.",

       function,

       sub_node_index );

      goto on_error;

    }

  }

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_release_for_read(

       internal_source_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to release read/write lock for reading.",

     function );

    libcdata_internal_tree_node_free(

     (libcdata_internal_tree_node_t **) &destination_sub_node,

     value_free_function,

     NULL );

    return( -1 );

  }

#endif

  *destination_node = (libcdata_tree_node_t *) internal_destination_node;

  return( 1 );

on_error:

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  libcthreads_read_write_lock_release_for_read(

   internal_source_node->read_write_lock,

   NULL );

#endif

  if( destination_sub_node != NULL )

  {

    libcdata_internal_tree_node_free(

     (libcdata_internal_tree_node_t **) &destination_sub_node,

     value_free_function,

     NULL );

  }

  if( internal_destination_node != NULL )

  {

    libcdata_internal_tree_node_free(

     &internal_destination_node,

     value_free_function,

     NULL );

  }

  return( -1 );

}

/* Retrieves the value from the tree node

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_get_value(

     libcdata_tree_node_t *node,

     intptr_t **value,

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_get_value";

  if( node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  internal_node = (libcdata_internal_tree_node_t *) node;

  if( value == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid value.",

     function );

    return( -1 );

  }

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_grab_for_read(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to grab read/write lock for reading.",

     function );

    return( -1 );

  }

#endif

  *value = internal_node->value;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_release_for_read(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to release read/write lock for reading.",

     function );

    return( -1 );

  }

#endif

  return( 1 );

}

/* Sets the value in the tree node

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_set_value(

     libcdata_tree_node_t *node,

     intptr_t *value,

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_set_value";

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  intptr_t *backup_value                       = NULL;

#endif

  if( node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  internal_node = (libcdata_internal_tree_node_t *) node;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_grab_for_write(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to grab read/write lock for writing.",

     function );

    return( -1 );

  }

  backup_value = internal_node->value;

#endif

  internal_node->value = value;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_release_for_write(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to release read/write lock for writing.",

     function );

    goto on_error;

  }

#endif

  return( 1 );

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

on_error:

  internal_node->value = backup_value;

  return( -1 );

#endif

}

/* Retrieves the parent node from the tree node

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_get_parent_node(

     libcdata_tree_node_t *node,

     libcdata_tree_node_t **parent_node,

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_get_parent_node";

  if( node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  internal_node = (libcdata_internal_tree_node_t *) node;

  if( parent_node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid parent node.",

     function );

    return( -1 );

  }

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_grab_for_read(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to grab read/write lock for reading.",

     function );

    return( -1 );

  }

#endif

  *parent_node = internal_node->parent_node;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_release_for_read(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to release read/write lock for reading.",

     function );

    return( -1 );

  }

#endif

  return( 1 );

}

/* Sets the parent node in the tree node

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_set_parent_node(

     libcdata_tree_node_t *node,

     libcdata_tree_node_t *parent_node,

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_set_parent_node";

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  libcdata_tree_node_t *backup_parent_node     = NULL;

#endif

  if( node == NULL )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_ARGUMENTS,

     LIBCERROR_ARGUMENT_ERROR_INVALID_VALUE,

     "%s: invalid node.",

     function );

    return( -1 );

  }

  internal_node = (libcdata_internal_tree_node_t *) node;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_grab_for_write(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to grab read/write lock for writing.",

     function );

    return( -1 );

  }

  backup_parent_node = internal_node->parent_node;

#endif

  internal_node->parent_node = parent_node;

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

  if( libcthreads_read_write_lock_release_for_write(

       internal_node->read_write_lock,

       error ) != 1 )

  {

    libcerror_error_set(

     error,

     LIBCERROR_ERROR_DOMAIN_RUNTIME,

     LIBCERROR_RUNTIME_ERROR_SET_FAILED,

     "%s: unable to release read/write lock for writing.",

     function );

    goto on_error;

  }

#endif

  return( 1 );

#if defined( HAVE_MULTI_THREAD_SUPPORT ) && !defined( HAVE_LOCAL_LIBCDATA )

on_error:

  internal_node->parent_node = backup_parent_node;

  return( -1 );

#endif

}

/* Retrieves the previous node from the tree node

 * Returns 1 if successful or -1 on error

 */

int libcdata_tree_node_get_previous_node(

     libcdata_tree_node_t *node,

     libcdata_tree_node_t **previous_node,

     libcerror_error_t **error )

{

  libcdata_internal_tree_node_t *internal_node = NULL;

  static char *function                        = "libcdata_tree_node_get_previous_node";

  if( node == NULL )

  {

    libcerror_error_set(

     error,