From 4fbe71e892ba2004aacc84bc224920ef06456057 Mon Sep 17 00:00:00 2001 From: "Arnaud G. GIBERT" Date: Sun, 21 Apr 2024 23:49:52 +0200 Subject: [PATCH] - fix function header size, - fix public API extern declaration. --- include/node.h | 580 ++++++++-------- lib/libnode.c | 1752 ++++++++++++++++++++++++------------------------ lib/libnode.h | 274 ++++---- 3 files changed, 1305 insertions(+), 1301 deletions(-) diff --git a/include/node.h b/include/node.h index 8a9b3ce..dc9b3d3 100644 --- a/include/node.h +++ b/include/node.h @@ -770,7 +770,7 @@ typedef int NDT_Recursive_Offset; -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ # if defined( _WIN32) && !defined( LIBNODE_STATIC) # ifndef _LIBNODE_C_ @@ -779,133 +779,137 @@ typedef int NDT_Recursive_Offset; # define NDD_DLL_API __declspec( dllexport) # endif # else -# define NDD_DLL_API +# ifndef _LIBNODE_C_ +# define NDD_DLL_API +# else +# define NDD_DLL_API extern +# endif # endif -/*------------------------------------------------------------------------------*/ -/* Library initialisation */ -/*------------------------------------------------------------------------------*/ -/* (I) Debug_Mode: Open library in debug mode */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library initialisation */ +/*----------------------------------------------------------------------------*/ +/* (I) Debug_Mode: Open library in debug mode */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Library_Open_I ( int); NDD_DLL_API NDT_Status ND_Library_Open_C ( int); -/*------------------------------------------------------------------------------*/ -/* Library deinitialisation */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library deinitialisation */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Library_Close_I( void); NDD_DLL_API NDT_Status ND_Library_Close_C( void); -/*------------------------------------------------------------------------------*/ -/* Library Standard Error output setup */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: StdErr output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library Standard Error output setup */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: StdErr output stream */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Library_StdErr_Set_I( FILE *); NDD_DLL_API NDT_Status ND_Library_StdErr_Set_C( FILE *); -/*------------------------------------------------------------------------------*/ -/* Create a new data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Root_Ptr_Ptr: Pointer adress of the new sata structure */ -/* (I) Index_Nb: Number of index */ -/* (I) Index_Type_Ptr: Array of Index type (List, tree, ...) */ -/* (I) Manager_Name: Manager function name */ -/* (I) Manager_Ptr: Manager function pointer */ -/* (I) Allocator_Name: Value allocator function name */ -/* (I) Allocator_Ptr: Value allocator function pointer */ -/* (I) Deallocator_Name: Value deallocator function name */ -/* (I) Deallocator_Ptr: Value deallocator function pointer */ -/* (I) Own_Value: Flag indicating if the structure is the node owner */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Create a new data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Root_Ptr_Ptr: Pointer adress of the new sata structure */ +/* (I) Index_Nb: Number of index */ +/* (I) Index_Type_Ptr: Array of Index type (List, tree, ...) */ +/* (I) Manager_Name: Manager function name */ +/* (I) Manager_Ptr: Manager function pointer */ +/* (I) Allocator_Name: Value allocator function name */ +/* (I) Allocator_Ptr: Value allocator function pointer */ +/* (I) Deallocator_Name: Value deallocator function name */ +/* (I) Deallocator_Ptr: Value deallocator function pointer */ +/* (I) Own_Value: Flag indicating if the structure is the node owner */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Open_I( NDT_Root **, NDT_Index_Nb, NDT_Index_Type *, NDT_Manager_Name, NDT_Manager *, NDT_Allocator_Name, NDT_Allocator *, NDT_Deallocator_Name, NDT_Deallocator *, short, void *); NDD_DLL_API NDT_Status ND_DataStruct_Open_C( NDT_Root **, NDT_Index_Nb, NDT_Index_Type *, NDT_Manager_Name, NDT_Manager *, NDT_Allocator_Name, NDT_Allocator *, NDT_Deallocator_Name, NDT_Deallocator *, short, void *); -/*------------------------------------------------------------------------------*/ -/* Destroy a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destroy a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Close_I( NDT_Root *); NDD_DLL_API NDT_Status ND_DataStruct_Close_C( NDT_Root *); -/*------------------------------------------------------------------------------*/ -/* Destroy all data of a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destroy all data of a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Flush_I( NDT_Root *); NDD_DLL_API NDT_Status ND_DataStruct_Flush_C( NDT_Root *); -/*------------------------------------------------------------------------------*/ -/* Check & repare a datat structure: */ -/* - Check & fix node links */ -/* - Update data structure statistics */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ -/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ -/* (I) Out: Output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Check & repare a datat structure: */ +/* - Check & fix node links */ +/* - Update data structure statistics */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ +/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ +/* (I) Out: Output stream */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Check_I( NDT_Root *, int *, int *, FILE *); NDD_DLL_API NDT_Status ND_DataStruct_Check_C( NDT_Root *, int *, int *, FILE *); -/*------------------------------------------------------------------------------*/ -/* Convert a data structure indexe types */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Type_Ptr: Array of index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Convert a data structure indexe types */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Type_Ptr: Array of index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Convert_I( NDT_Root *, NDT_Index_Type *); NDD_DLL_API NDT_Status ND_DataStruct_Convert_C( NDT_Root *, NDT_Index_Type *); -/*------------------------------------------------------------------------------*/ -/* Reorganise a data structure indexes: */ -/* - Sort a non-sorted list */ -/* - Rebalance a non auto-balanced tree */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Reorganise a data structure indexes: */ +/* - Sort a non-sorted list */ +/* - Rebalance a non auto-balanced tree */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Reorg_I( NDT_Root *); NDD_DLL_API NDT_Status ND_DataStruct_Reorg_C( NDT_Root *); -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Traverse_VI( NDT_Root *, NDT_Command, va_list *); NDD_DLL_API NDT_Status ND_DataStruct_Traverse_VC( NDT_Root *, NDT_Command, va_list *); @@ -914,55 +918,55 @@ NDD_DLL_API NDT_Status ND_DataStruct_Traverse_C( NDT_Root *, NDT_Command, ... -/*------------------------------------------------------------------------------*/ -/* Print data structure information */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print data structure information */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Info_Print_I( FILE *, NDT_Root *, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset); NDD_DLL_API NDT_Status ND_DataStruct_Info_Print_C( FILE *, NDT_Root *, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset); -/*------------------------------------------------------------------------------*/ -/* Add a new value to a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new value to a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Value_Add_I( NDT_Root *, void *); NDD_DLL_API NDT_Status ND_DataStruct_Value_Add_C( NDT_Root *, void *); -/*------------------------------------------------------------------------------*/ -/* Remove the first matching value from a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove the first matching value from a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Value_Remove_I( NDT_Root *, void *); NDD_DLL_API NDT_Status ND_DataStruct_Value_Remove_C( NDT_Root *, void *); -/*------------------------------------------------------------------------------*/ -/* Print all the data structure values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Value_Print_VI( FILE *, NDT_Root *, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset, va_list *); NDD_DLL_API NDT_Status ND_DataStruct_Value_Print_I( FILE *, NDT_Root *, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset, ...); @@ -970,14 +974,14 @@ NDD_DLL_API NDT_Status ND_DataStruct_Value_Print_C( FILE *, NDT_Root *, NDT_ -/*------------------------------------------------------------------------------*/ -/* Find a value in a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address found */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a value in a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address found */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_DataStruct_Value_Find_VI( void **, NDT_Root *, void *, va_list *); NDD_DLL_API NDT_Status ND_DataStruct_Value_Find_VC( void **, NDT_Root *, void *, va_list *); @@ -986,95 +990,95 @@ NDD_DLL_API NDT_Status ND_DataStruct_Value_Find_C( void **, NDT_Root *, void -/*------------------------------------------------------------------------------*/ -/* Create a new index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Index_Type: Index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Create a new index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Index_Type: Index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Open_I( NDT_Root *, NDT_Index_Id, NDT_Index_Type); NDD_DLL_API NDT_Status ND_Index_Open_C( NDT_Root *, NDT_Index_Id, NDT_Index_Type); -/*------------------------------------------------------------------------------*/ -/* Remove an Index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove an Index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Close_I( NDT_Root *, NDT_Index_Id); NDD_DLL_API NDT_Status ND_Index_Close_C( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Remove an Index (Private API ?) */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove an Index (Private API ?) */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Flush_I( NDT_Root *, NDT_Index_Id); NDD_DLL_API NDT_Status ND_Index_Flush_C( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Check & repare a data structure index: */ -/* - Check & fix node links */ -/* - Update data structure statistics */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ -/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ -/* (I) Out: Output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Check & repare a data structure index: */ +/* - Check & fix node links */ +/* - Update data structure statistics */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ +/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ +/* (I) Out: Output stream */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Check_I( NDT_Root *, NDT_Index_Id, int *, int *, FILE *); NDD_DLL_API NDT_Status ND_Index_Check_C( NDT_Root *, NDT_Index_Id, int *, int *, FILE *); -/*------------------------------------------------------------------------------*/ -/* Convert a data structure index to another type */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Index_Type: Index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Convert a data structure index to another type */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Index_Type: Index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Convert_I ( NDT_Root *, NDT_Index_Id, NDT_Index_Type); NDD_DLL_API NDT_Status ND_Index_Convert_C ( NDT_Root *, NDT_Index_Id, NDT_Index_Type); -/*------------------------------------------------------------------------------*/ -/* Reorganise a data structure index: */ -/* - Sort a non-sorted list */ -/* - Rebalance a non auto-balanced tree */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Reorganise a data structure index: */ +/* - Sort a non-sorted list */ +/* - Rebalance a non auto-balanced tree */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Reorg_I( NDT_Root *, NDT_Index_Id); NDD_DLL_API NDT_Status ND_Index_Reorg_C( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure index & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure index & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Traverse_VI( NDT_Root *, NDT_Index_Id, NDT_Command, va_list *); NDD_DLL_API NDT_Status ND_Index_Traverse_VC( NDT_Root *, NDT_Index_Id, NDT_Command, va_list *); @@ -1083,59 +1087,59 @@ NDD_DLL_API NDT_Status ND_Index_Traverse_C( NDT_Root *, NDT_Index_Id, NDT_Com -/*------------------------------------------------------------------------------*/ -/* Print data structure index information */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print data structure index information */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Info_Print_I( FILE *, NDT_Root *, NDT_Index_Id, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset); NDD_DLL_API NDT_Status ND_Index_Info_Print_C( FILE *, NDT_Root *, NDT_Index_Id, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset); -/*------------------------------------------------------------------------------*/ -/* Add a new value to a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new value to a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Value_Add_I( NDT_Root *, NDT_Index_Id, void *); NDD_DLL_API NDT_Status ND_Index_Value_Add_C( NDT_Root *, NDT_Index_Id, void *); -/*------------------------------------------------------------------------------*/ -/* Remove the first matching value from a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove the first matching value from a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Value_Remove_I( NDT_Root *, NDT_Index_Id, void *); NDD_DLL_API NDT_Status ND_Index_Value_Remove_C( NDT_Root *, NDT_Index_Id, void *); -/*------------------------------------------------------------------------------*/ -/* Print all the data structure index values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure index values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Value_Print_VI( FILE *, NDT_Root *, NDT_Index_Id, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset, va_list *); NDD_DLL_API NDT_Status ND_Index_Value_Print_I( FILE *, NDT_Root *, NDT_Index_Id, NDT_Recursive_Mode, NDT_Recursive_Depth, NDT_Recursive_Offset, ...); @@ -1143,89 +1147,89 @@ NDD_DLL_API NDT_Status ND_Index_Value_Print_C( FILE *, NDT_Root *, NDT_Index -/*------------------------------------------------------------------------------*/ -/* Add a new node to a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new node to a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_Add_I( NDT_Root *, NDT_Index_Id, NDT_Node *); NDD_DLL_API NDT_Status ND_Index_Node_Add_C( NDT_Root *, NDT_Index_Id, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Remove a node from a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove a node from a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_Remove_I( NDT_Node *); NDD_DLL_API NDT_Status ND_Index_Node_Remove_C( NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Get the first node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the first node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_First_Get_I( NDT_Node **, NDT_Root *, NDT_Index_Id); NDD_DLL_API NDT_Status ND_Index_Node_First_Get_C( NDT_Node **, NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Get the last node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the last node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_Last_Get_I( NDT_Node **, NDT_Root *, NDT_Index_Id); NDD_DLL_API NDT_Status ND_Index_Node_Last_Get_C( NDT_Node **, NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Get the next node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the next node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_Next_Get_I( NDT_Node **, NDT_Node *); NDD_DLL_API NDT_Status ND_Index_Node_Next_Get_C( NDT_Node **, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Get the previous node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the previous node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_Previous_Get_I( NDT_Node **, NDT_Node *); NDD_DLL_API NDT_Status ND_Index_Node_Previous_Get_C( NDT_Node **, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Find a node from a value in a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a node from a value in a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Index_Node_Find_VI( NDT_Node **, NDT_Root *, NDT_Index_Id, void *, va_list *); NDD_DLL_API NDT_Status ND_Index_Node_Find_VC( NDT_Node **, NDT_Root *, NDT_Index_Id, void *, va_list *); @@ -1234,52 +1238,52 @@ NDD_DLL_API NDT_Status ND_Index_Node_Find_C( NDT_Node **, NDT_Root *, NDT_In -/*------------------------------------------------------------------------------*/ -/* Get the root node of a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Root_Ptr_Ptr: Data structure pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the root node of a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Root_Ptr_Ptr: Data structure pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Node_Root_Get_I( NDT_Root **, NDT_Node *); NDD_DLL_API NDT_Status ND_Node_Root_Get_C( NDT_Root **, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Allocate a new value */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Allocate a new value */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Value_Alloc_I( void **, NDT_Root *, ...); NDD_DLL_API NDT_Status ND_Value_Alloc_C( void **, NDT_Root *, ...); -/*------------------------------------------------------------------------------*/ -/* Deallocate a value */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Deallocate a value */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Value_Free_I( NDT_Root *, void *); NDD_DLL_API NDT_Status ND_Value_Free_C( NDT_Root *, void *); -/*------------------------------------------------------------------------------*/ -/* Execute a manager command */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a manager command */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Manager_Exec_VI( NDT_Root *, NDT_Index_Id, NDT_Node *, NDT_Command, va_list *); NDD_DLL_API NDT_Status ND_Manager_Exec_VC( NDT_Root *, NDT_Index_Id, NDT_Node *, NDT_Command, va_list *); @@ -1288,28 +1292,28 @@ NDD_DLL_API NDT_Status ND_Manager_Exec_C( NDT_Root *, NDT_Index_Id, NDT_Node -/*------------------------------------------------------------------------------*/ -/* Execute an allocator function */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address */ -/* (I) Allocator_Name: Value allocator function name */ -/* (I) Allocator_Ptr: Value allocator function pointer */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute an allocator function */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address */ +/* (I) Allocator_Name: Value allocator function name */ +/* (I) Allocator_Ptr: Value allocator function pointer */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Allocator_Exec_I( void **, size_t, NDT_Allocator_Name, NDT_Allocator *, void *); NDD_DLL_API NDT_Status ND_Allocator_Exec_C( void **, size_t, NDT_Allocator_Name, NDT_Allocator *, void *); -/*------------------------------------------------------------------------------*/ -/* Execute a deallocator function */ -/*------------------------------------------------------------------------------*/ -/* (I) Value_Ptr: Value pointer */ -/* (I) Allocator_Name: Value deallocator function name */ -/* (I) Allocator_Ptr: Value deallocator function pointer */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a deallocator function */ +/*----------------------------------------------------------------------------*/ +/* (I) Value_Ptr: Value pointer */ +/* (I) Allocator_Name: Value deallocator function name */ +/* (I) Allocator_Ptr: Value deallocator function pointer */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDD_DLL_API NDT_Status ND_Deallocator_Exec_I( void *, NDT_Deallocator_Name, NDT_Deallocator *, void *); NDD_DLL_API NDT_Status ND_Deallocator_Exec_C( void *, NDT_Deallocator_Name, NDT_Deallocator *, void *); diff --git a/lib/libnode.c b/lib/libnode.c index 6ef7508..a904679 100644 --- a/lib/libnode.c +++ b/lib/libnode.c @@ -385,9 +385,9 @@ NDT_Status ND_Default_Manager( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT -/*------------------------------------------------------------------------------*/ -/* OpenStruct Manager */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* OpenStruct Manager */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_OpenStruct_Manager( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr, NDT_Command Command, va_list *Args_Ptr) { @@ -651,21 +651,21 @@ NDT_Status ND_OpenStruct_Manager( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* FONCTIONS PUBLIQUES */ -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* FONCTIONS PUBLIQUES */ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* Library initialisation */ -/*------------------------------------------------------------------------------*/ -/* (I) Debug_Mode: Open library in debug mode */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library initialisation */ +/*----------------------------------------------------------------------------*/ +/* (I) Debug_Mode: Open library in debug mode */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Library_Open_I( int Debug_Mode) { @@ -703,11 +703,11 @@ NDT_Status ND_Library_Open_I( int Debug_Mode) -/*------------------------------------------------------------------------------*/ -/* Library initialisation */ -/*------------------------------------------------------------------------------*/ -/* (I) Debug_Mode: Open library in debug mode */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library initialisation */ +/*----------------------------------------------------------------------------*/ +/* (I) Debug_Mode: Open library in debug mode */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Library_Open_C( int Debug_Mode) { @@ -740,9 +740,9 @@ NDT_Status ND_Library_Open_C( int Debug_Mode) -/*------------------------------------------------------------------------------*/ -/* Library deinitialisation */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library deinitialisation */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Library_Close_I( void) { @@ -788,9 +788,9 @@ NDT_Status ND_Library_Close_I( void) -/*------------------------------------------------------------------------------*/ -/* Library deinitialisation */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library deinitialisation */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Library_Close_C( void) { @@ -828,11 +828,11 @@ NDT_Status ND_Library_Close_C( void) -/*------------------------------------------------------------------------------*/ -/* Library Standard Error output setup */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: StdErr output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library Standard Error output setup */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: StdErr output stream */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Library_StdErr_Set_I( FILE *Out) { @@ -845,11 +845,11 @@ NDT_Status ND_Library_StdErr_Set_I( FILE *Out) -/*------------------------------------------------------------------------------*/ -/* Library Standard Error output setup */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: StdErr output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Library Standard Error output setup */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: StdErr output stream */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Library_StdErr_Set_C( FILE *Out) { @@ -862,13 +862,13 @@ NDT_Status ND_Library_StdErr_Set_C( FILE *Out) -/*------------------------------------------------------------------------------*/ -/* Create a new index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Index_Type: Index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Create a new index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Index_Type: Index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Open_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Index_Type Type) { @@ -921,13 +921,13 @@ NDT_Status ND_Index_Open_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_In -/*------------------------------------------------------------------------------*/ -/* Create a new index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Index_Type: Index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Create a new index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Index_Type: Index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Open_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Index_Type Type) { @@ -955,21 +955,21 @@ NDT_Status ND_Index_Open_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_I -/*------------------------------------------------------------------------------*/ -/* Create a new data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Root_Ptr_Ptr: Pointer adress of the new sata structure */ -/* (I) Index_Nb: Number of index */ -/* (I) Index_Type_Ptr: Array of Index type (List, tree, ...) */ -/* (I) Manager_Name: Manager function name */ -/* (I) Manager_Ptr: Manager function pointer */ -/* (I) Allocator_Name: Value allocator function name */ -/* (I) Allocator_Ptr: Value allocator function pointer */ -/* (I) Deallocator_Name: Value deallocator function name */ -/* (I) Deallocator_Ptr: Value deallocator function pointer */ -/* (I) Own_Value: Flag indicating if the structure is the node owner */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Create a new data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Root_Ptr_Ptr: Pointer adress of the new sata structure */ +/* (I) Index_Nb: Number of index */ +/* (I) Index_Type_Ptr: Array of Index type (List, tree, ...) */ +/* (I) Manager_Name: Manager function name */ +/* (I) Manager_Ptr: Manager function pointer */ +/* (I) Allocator_Name: Value allocator function name */ +/* (I) Allocator_Ptr: Value allocator function pointer */ +/* (I) Deallocator_Name: Value deallocator function name */ +/* (I) Deallocator_Ptr: Value deallocator function pointer */ +/* (I) Own_Value: Flag indicating if the structure is the node owner */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Open_I( NDT_Root **Root_Ptr_Ptr, NDT_Index_Nb Index_Nb, NDT_Index_Type *Type_Ptr, NDT_Manager_Name Manager_Name, NDT_Manager *Manager_Ptr, NDT_Allocator_Name Allocator_Name, NDT_Allocator *Allocator_Ptr, NDT_Deallocator_Name Deallocator_Name, NDT_Deallocator *Deallocator_Ptr, short Own_Value, void *Data) @@ -1056,21 +1056,21 @@ NDT_Status ND_DataStruct_Open_I( NDT_Root **Root_Ptr_Ptr, NDT_Index_Nb Index_N -/*------------------------------------------------------------------------------*/ -/* Create a new data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Root_Ptr_Ptr: Pointer adress of the new sata structure */ -/* (I) Index_Nb: Number of index */ -/* (I) Index_Type_Ptr: Array of Index type (List, tree, ...) */ -/* (I) Manager_Name: Manager function name */ -/* (I) Manager_Ptr: Manager function pointer */ -/* (I) Allocator_Name: Value allocator function name */ -/* (I) Allocator_Ptr: Value allocator function pointer */ -/* (I) Deallocator_Name: Value deallocator function name */ -/* (I) Deallocator_Ptr: Value deallocator function pointer */ -/* (I) Own_Value: Flag indicating if the structure is the node owner */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Create a new data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Root_Ptr_Ptr: Pointer adress of the new sata structure */ +/* (I) Index_Nb: Number of index */ +/* (I) Index_Type_Ptr: Array of Index type (List, tree, ...) */ +/* (I) Manager_Name: Manager function name */ +/* (I) Manager_Ptr: Manager function pointer */ +/* (I) Allocator_Name: Value allocator function name */ +/* (I) Allocator_Ptr: Value allocator function pointer */ +/* (I) Deallocator_Name: Value deallocator function name */ +/* (I) Deallocator_Ptr: Value deallocator function pointer */ +/* (I) Own_Value: Flag indicating if the structure is the node owner */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Open_C( NDT_Root **Root_Ptr_Ptr, NDT_Index_Nb Index_Nb, NDT_Index_Type *Type_Ptr, NDT_Manager_Name Manager_Name, NDT_Manager *Manager_Ptr, NDT_Allocator_Name Allocator_Name, NDT_Allocator *Allocator_Ptr, NDT_Deallocator_Name Deallocator_Name, NDT_Deallocator *Deallocator_Ptr, short Own_Value, void *Data_Ptr) @@ -1102,12 +1102,12 @@ NDT_Status ND_DataStruct_Open_C( NDT_Root **Root_Ptr_Ptr, NDT_Index_Nb Index_ -/*------------------------------------------------------------------------------*/ -/* Remove an Index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove an Index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Close_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -1135,12 +1135,12 @@ NDT_Status ND_Index_Close_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Remove an Index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove an Index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Close_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -1161,11 +1161,11 @@ NDT_Status ND_Index_Close_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Destroy a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destroy a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Close_I( NDT_Root *Root_Ptr) { @@ -1182,11 +1182,11 @@ NDT_Status ND_DataStruct_Close_I( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Destroy a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destroy a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Close_C( NDT_Root *Root_Ptr) { @@ -1218,12 +1218,12 @@ NDT_Status ND_DataStruct_Close_C( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Remove an Index (Private API ?) */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove an Index (Private API ?) */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Flush_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -1265,12 +1265,12 @@ NDT_Status ND_Index_Flush_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Remove an Index (Private API ?) */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove an Index (Private API ?) */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Flush_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -1284,11 +1284,11 @@ NDT_Status ND_Index_Flush_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Destroy all data of a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destroy all data of a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Flush_I( NDT_Root *Root_Ptr) { @@ -1309,11 +1309,11 @@ NDT_Status ND_DataStruct_Flush_I( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Destroy all data of a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destroy all data of a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Flush_C( NDT_Root *Root_Ptr) { @@ -1327,17 +1327,17 @@ NDT_Status ND_DataStruct_Flush_C( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Check & repare a data structure index: */ -/* - Check & fix node links */ -/* - Update data structure statistics */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ -/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ -/* (I) Out: Output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Check & repare a data structure index: */ +/* - Check & fix node links */ +/* - Update data structure statistics */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ +/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ +/* (I) Out: Output stream */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Check_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Detected_Nb_Ptr, int *Corrected_Nb_Ptr, FILE *Out) { @@ -1382,17 +1382,17 @@ NDT_Status ND_Index_Check_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int -/*------------------------------------------------------------------------------*/ -/* Check & repare a data structure index: */ -/* - Check & fix node links */ -/* - Update data structure statistics */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ -/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ -/* (I) Out: Output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Check & repare a data structure index: */ +/* - Check & fix node links */ +/* - Update data structure statistics */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ +/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ +/* (I) Out: Output stream */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Check_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -1407,16 +1407,16 @@ NDT_Status ND_Index_Check_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int -/*------------------------------------------------------------------------------*/ -/* Check & repare a datat structure: */ -/* - Check & fix node links */ -/* - Update data structure statistics */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ -/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ -/* (I) Out: Output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Check & repare a datat structure: */ +/* - Check & fix node links */ +/* - Update data structure statistics */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ +/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ +/* (I) Out: Output stream */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Check_I( NDT_Root *Root_Ptr, int *Error_Detected_Nb_Ptr, int *Error_Corrected_Nb_Ptr, FILE *Out) { @@ -1441,16 +1441,16 @@ NDT_Status ND_DataStruct_Check_I( NDT_Root *Root_Ptr, int *Error_Detected_Nb_ -/*------------------------------------------------------------------------------*/ -/* Check & repare a datat structure: */ -/* - Check & fix node links */ -/* - Update data structure statistics */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ -/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ -/* (I) Out: Output stream */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Check & repare a datat structure: */ +/* - Check & fix node links */ +/* - Update data structure statistics */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (O) Error_Dectected_Nb_Ptr: Number of error detected pointer */ +/* (O) Error_Corrected_Nb_Ptr: Number of error corected pointer */ +/* (I) Out: Output stream */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Check_C( NDT_Root *Root_Ptr, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -1465,13 +1465,13 @@ NDT_Status ND_DataStruct_Check_C( NDT_Root *Root_Ptr, int *Nb_Detected_Ptr, in -/*------------------------------------------------------------------------------*/ -/* Convert a data structure index to another type */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Index_Type: Index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Convert a data structure index to another type */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Index_Type: Index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Convert_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Index_Type Target_Type) { @@ -1571,13 +1571,13 @@ NDT_Status ND_Index_Convert_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT -/*------------------------------------------------------------------------------*/ -/* Convert a data structure index to another type */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Index_Type: Index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Convert a data structure index to another type */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Index_Type: Index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Convert_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Index_Type Target_Type) { @@ -1591,12 +1591,12 @@ NDT_Status ND_Index_Convert_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT -/*------------------------------------------------------------------------------*/ -/* Convert a data structure indexe types */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Type_Ptr: Array of index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Convert a data structure indexe types */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Type_Ptr: Array of index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Convert_I( NDT_Root *Root_Ptr, NDT_Index_Type *Index_Type_Ptr) { @@ -1617,12 +1617,12 @@ NDT_Status ND_DataStruct_Convert_I( NDT_Root *Root_Ptr, NDT_Index_Type *Index -/*------------------------------------------------------------------------------*/ -/* Convert a data structure indexe types */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Type_Ptr: Array of index type (List, tree, ...) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Convert a data structure indexe types */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Type_Ptr: Array of index type (List, tree, ...) */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Convert_C( NDT_Root *Root_Ptr, NDT_Index_Type *Index_Type_Ptr) { @@ -1637,14 +1637,14 @@ NDT_Status ND_DataStruct_Convert_C( NDT_Root *Root_Ptr, NDT_Index_Type *Index -/*------------------------------------------------------------------------------*/ -/* Reorganise a data structure index: */ -/* - Sort a non-sorted list */ -/* - Rebalance a non auto-balanced tree */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Reorganise a data structure index: */ +/* - Sort a non-sorted list */ +/* - Rebalance a non auto-balanced tree */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Reorg_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -1688,14 +1688,14 @@ NDT_Status ND_Index_Reorg_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Reorganise a data structure index: */ -/* - Sort a non-sorted list */ -/* - Rebalance a non auto-balanced tree */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Reorganise a data structure index: */ +/* - Sort a non-sorted list */ +/* - Rebalance a non auto-balanced tree */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Reorg_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -1709,13 +1709,13 @@ NDT_Status ND_Index_Reorg_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Reorganise a data structure indexes: */ -/* - Sort a non-sorted list */ -/* - Rebalance a non auto-balanced tree */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Reorganise a data structure indexes: */ +/* - Sort a non-sorted list */ +/* - Rebalance a non auto-balanced tree */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Reorg_I( NDT_Root *Root_Ptr) { @@ -1736,13 +1736,13 @@ NDT_Status ND_DataStruct_Reorg_I( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Reorganise a data structure indexes: */ -/* - Sort a non-sorted list */ -/* - Rebalance a non auto-balanced tree */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Reorganise a data structure indexes: */ +/* - Sort a non-sorted list */ +/* - Rebalance a non auto-balanced tree */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Reorg_C( NDT_Root *Root_Ptr) { @@ -1756,14 +1756,14 @@ NDT_Status ND_DataStruct_Reorg_C( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure index & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure index & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Traverse_VI( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Command Command, va_list *Args_Ptr) { @@ -1815,14 +1815,14 @@ NDT_Status ND_Index_Traverse_VI( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, ND -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure index & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure index & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Traverse_VC( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Command Command, va_list *Args_Ptr) { @@ -1836,14 +1836,14 @@ NDT_Status ND_Index_Traverse_VC( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, N -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure index & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure index & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Traverse_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Command Command, ...) { @@ -1902,14 +1902,14 @@ NDT_Status ND_Index_Traverse_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure index & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure index & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Traverse_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Command Command, ...) { @@ -1933,13 +1933,13 @@ NDT_Status ND_Index_Traverse_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, ND -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Traverse_VI( NDT_Root *Root_Ptr, NDT_Command Command, va_list *Args_Ptr) { @@ -1958,13 +1958,13 @@ NDT_Status ND_DataStruct_Traverse_VI( NDT_Root *Root_Ptr, NDT_Command Command, -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Traverse_VC( NDT_Root *Root_Ptr, NDT_Command Command, va_list *Args_Ptr) { @@ -1978,13 +1978,13 @@ NDT_Status ND_DataStruct_Traverse_VC( NDT_Root *Root_Ptr, NDT_Command Command -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Traverse_I( NDT_Root *Root_Ptr, NDT_Command Command, ...) { @@ -2010,13 +2010,13 @@ NDT_Status ND_DataStruct_Traverse_I( NDT_Root *Root_Ptr, NDT_Command Command, -/*------------------------------------------------------------------------------*/ -/* Traverse a data structure & execute a command on each node */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Traverse a data structure & execute a command on each node */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Traverse_C( NDT_Root *Root_Ptr, NDT_Command Command, ...) { @@ -2040,16 +2040,16 @@ NDT_Status ND_DataStruct_Traverse_C( NDT_Root *Root_Ptr, NDT_Command Command, -/*------------------------------------------------------------------------------*/ -/* Print data structure index information */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print data structure index information */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Info_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset) { @@ -2095,16 +2095,16 @@ NDT_Status ND_Index_Info_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id -/*------------------------------------------------------------------------------*/ -/* Print data structure index information */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print data structure index information */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Info_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset) { @@ -2119,15 +2119,15 @@ NDT_Status ND_Index_Info_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id -/*------------------------------------------------------------------------------*/ -/* Print data structure information */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print data structure information */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Info_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset) { @@ -2179,15 +2179,15 @@ NDT_Status ND_DataStruct_Info_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Recu -/*------------------------------------------------------------------------------*/ -/* Print data structure information */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print data structure information */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Info_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset) { @@ -2202,13 +2202,13 @@ NDT_Status ND_DataStruct_Info_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Rec -/*------------------------------------------------------------------------------*/ -/* Add a new value to a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new value to a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Add_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr) { @@ -2239,13 +2239,13 @@ NDT_Status ND_Index_Value_Add_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, v -/*------------------------------------------------------------------------------*/ -/* Add a new value to a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new value to a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Add_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr) { @@ -2260,12 +2260,12 @@ NDT_Status ND_Index_Value_Add_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, v -/*------------------------------------------------------------------------------*/ -/* Add a new value to a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new value to a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Add_I( NDT_Root *Root_Ptr, void *Value_Ptr) { @@ -2289,12 +2289,12 @@ NDT_Status ND_DataStruct_Value_Add_I( NDT_Root *Root_Ptr, void *Value_Ptr) -/*------------------------------------------------------------------------------*/ -/* Add a new value to a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new value to a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Add_C( NDT_Root *Root_Ptr, void *Value_Ptr) { @@ -2309,13 +2309,13 @@ NDT_Status ND_DataStruct_Value_Add_C( NDT_Root *Root_Ptr, void *Value_Ptr) -/*------------------------------------------------------------------------------*/ -/* Remove the first matching value from a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove the first matching value from a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Remove_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr) { @@ -2351,13 +2351,13 @@ NDT_Status ND_Index_Value_Remove_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id -/*------------------------------------------------------------------------------*/ -/* Remove the first matching value from a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove the first matching value from a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Remove_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr) { @@ -2372,12 +2372,12 @@ NDT_Status ND_Index_Value_Remove_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id -/*------------------------------------------------------------------------------*/ -/* Remove the first matching value from a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove the first matching value from a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Remove_I( NDT_Root *Root_Ptr, void *Value_Ptr) { @@ -2401,12 +2401,12 @@ NDT_Status ND_DataStruct_Value_Remove_I( NDT_Root *Root_Ptr, void *Value_Ptr) -/*------------------------------------------------------------------------------*/ -/* Remove the first matching value from a data structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove the first matching value from a data structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Remove_C( NDT_Root *Root_Ptr, void *Value_Ptr) { @@ -2421,17 +2421,17 @@ NDT_Status ND_DataStruct_Value_Remove_C( NDT_Root *Root_Ptr, void *Value_Ptr) -/*------------------------------------------------------------------------------*/ -/* Print all the data structure index values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure index values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Print_VI( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset, va_list *Args_Ptr) { @@ -2447,17 +2447,17 @@ NDT_Status ND_Index_Value_Print_VI( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_I -/*------------------------------------------------------------------------------*/ -/* Print all the data structure index values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure index values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset, ...) { @@ -2478,17 +2478,17 @@ NDT_Status ND_Index_Value_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id -/*------------------------------------------------------------------------------*/ -/* Print all the data structure index values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure index values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Value_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset, ...) { @@ -2513,16 +2513,16 @@ NDT_Status ND_Index_Value_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Index_I -/*------------------------------------------------------------------------------*/ -/* Print all the data structure values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Print_VI( FILE *Out, NDT_Root *Root_Ptr, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset, va_list *User_Args_Ptr) { @@ -2537,16 +2537,16 @@ NDT_Status ND_DataStruct_Value_Print_VI( FILE *Out, NDT_Root *Root_Ptr, NDT_Re -/*------------------------------------------------------------------------------*/ -/* Print all the data structure values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset, ...) { @@ -2567,16 +2567,16 @@ NDT_Status ND_DataStruct_Value_Print_I( FILE *Out, NDT_Root *Root_Ptr, NDT_Rec -/*------------------------------------------------------------------------------*/ -/* Print all the data structure values */ -/*------------------------------------------------------------------------------*/ -/* (I) Stream: Output stream */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Recursive_Mode: Child or Parent */ -/* (I) Recursive_Depth: Curent recursion depth */ -/* (I) Recursive_Offset: Curent print out offset */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Print all the data structure values */ +/*----------------------------------------------------------------------------*/ +/* (I) Stream: Output stream */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Recursive_Mode: Child or Parent */ +/* (I) Recursive_Depth: Curent recursion depth */ +/* (I) Recursive_Offset: Curent print out offset */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Recursive_Mode Recursive_Mode, NDT_Recursive_Depth Recursive_Depth, NDT_Recursive_Offset Recursive_Offset, ...) { @@ -2602,13 +2602,13 @@ NDT_Status ND_DataStruct_Value_Print_C( FILE *Out, NDT_Root *Root_Ptr, NDT_Re -/*------------------------------------------------------------------------------*/ -/* Add a new node to a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new node to a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Add_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr ) { @@ -2628,13 +2628,13 @@ NDT_Status ND_Index_Node_Add_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, ND -/*------------------------------------------------------------------------------*/ -/* Add a new node to a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Add a new node to a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Add_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr) { @@ -2649,11 +2649,11 @@ NDT_Status ND_Index_Node_Add_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, ND -/*------------------------------------------------------------------------------*/ -/* Remove a node from a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove a node from a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Remove_I( NDT_Node *Node_Ptr) { @@ -2695,7 +2695,7 @@ NDT_Status ND_Index_Node_Remove_I( NDT_Node *Node_Ptr) On sauve le fils gauche du noeud à supprimer dans un pointeur de sauvegarde pour pouvoir le récupérer au cas où la procédure serait interrompue (recovery). - */ + */ root_ptr->Index_Tab[index_id].Save = Left_Node_Ptr; @@ -2753,11 +2753,11 @@ NDT_Status ND_Index_Node_Remove_I( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Remove a node from a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Remove a node from a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Remove_C( NDT_Node *Node_Ptr) { @@ -2771,13 +2771,13 @@ NDT_Status ND_Index_Node_Remove_C( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Get the first node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the first node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_First_Get_I( NDT_Node **First_Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -2796,13 +2796,13 @@ NDT_Status ND_Index_Node_First_Get_I( NDT_Node **First_Node_Ptr_Ptr, NDT_Root -/*------------------------------------------------------------------------------*/ -/* Get the first node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the first node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_First_Get_C( NDT_Node **First_Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -2816,13 +2816,13 @@ NDT_Status ND_Index_Node_First_Get_C( NDT_Node **First_Node_Ptr_Ptr, NDT_Root -/*------------------------------------------------------------------------------*/ -/* Get the last node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the last node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Last_Get_I ( NDT_Node **Last_Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -2841,12 +2841,12 @@ NDT_Status ND_Index_Node_Last_Get_I ( NDT_Node **Last_Node_Ptr_Ptr, NDT_Root * -/*------------------------------------------------------------------------------*/ -/* Récupération du dernier noeud d'une structure */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine dont on cherche le dernier noeud */ -/* (O) Last_Node : adresse du pointeur sur le premier noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Récupération du dernier noeud d'une structure */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine dont on cherche le dernier noeud */ +/* (O) Last_Node : adresse du pointeur sur le premier noeud */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Last_Get_C( NDT_Node **Last_Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -2860,12 +2860,12 @@ NDT_Status ND_Index_Node_Last_Get_C( NDT_Node **Last_Node_Ptr_Ptr, NDT_Root * -/*------------------------------------------------------------------------------*/ -/* Get the next node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the next node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Next_Get_I ( NDT_Node **Next_Node_Ptr_Ptr, NDT_Node *Node_Ptr) { @@ -2894,12 +2894,12 @@ NDT_Status ND_Index_Node_Next_Get_I ( NDT_Node **Next_Node_Ptr_Ptr, NDT_Node * -/*------------------------------------------------------------------------------*/ -/* Get the next node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the next node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Next_Get_C( NDT_Node **Next_Node_Ptr_Ptr, NDT_Node *Node_Ptr) { @@ -2913,12 +2913,12 @@ NDT_Status ND_Index_Node_Next_Get_C( NDT_Node **Next_Node_Ptr_Ptr, NDT_Node * -/*------------------------------------------------------------------------------*/ -/* Get the previous node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the previous node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Previous_Get_I( NDT_Node **Prev_Node_Ptr_Ptr, NDT_Node *Node_Ptr) { @@ -2945,12 +2945,12 @@ NDT_Status ND_Index_Node_Previous_Get_I( NDT_Node **Prev_Node_Ptr_Ptr, NDT_Nod -/*------------------------------------------------------------------------------*/ -/* Get the previous node of a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the previous node of a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Previous_Get_C( NDT_Node **Prev_Node_Ptr_Ptr, NDT_Node *Node_Ptr) { @@ -2964,15 +2964,15 @@ NDT_Status ND_Index_Node_Previous_Get_C( NDT_Node **Prev_Node_Ptr_Ptr, NDT_Nod -/*------------------------------------------------------------------------------*/ -/* Find a node from a value in a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a node from a value in a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Find_VI( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr, va_list *Args_Ptr) { @@ -2998,15 +2998,15 @@ NDT_Status ND_Index_Node_Find_VI( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr -/*------------------------------------------------------------------------------*/ -/* Find a node from a value in a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a node from a value in a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Find_VC( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr, va_list *Args_Ptr) { @@ -3027,15 +3027,15 @@ NDT_Status ND_Index_Node_Find_VC( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr -/*------------------------------------------------------------------------------*/ -/* Find a node from a value in a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a node from a value in a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Find_I( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr, ...) { @@ -3070,15 +3070,15 @@ NDT_Status ND_Index_Node_Find_I( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr, -/*------------------------------------------------------------------------------*/ -/* Find a node from a value in a data structure index */ -/*------------------------------------------------------------------------------*/ -/* (O) Node_Ptr_Ptr: Node pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a node from a value in a data structure index */ +/*----------------------------------------------------------------------------*/ +/* (O) Node_Ptr_Ptr: Node pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Node_Find_C( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr, ...) { @@ -3103,14 +3103,14 @@ NDT_Status ND_Index_Node_Find_C( NDT_Node **Node_Ptr_Ptr, NDT_Root *Root_Ptr, -/*------------------------------------------------------------------------------*/ -/* Find a value in a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address found */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a value in a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address found */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Find_VI( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, void *Ref_Value_Ptr, va_list *Args_Ptr) { @@ -3142,14 +3142,14 @@ NDT_Status ND_DataStruct_Value_Find_VI( void **Value_Ptr_Ptr, NDT_Root *Root_ -/*------------------------------------------------------------------------------*/ -/* Find a value in a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address found */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a value in a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address found */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Find_VC( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, void *Ref_Value_Ptr, va_list *Args_Ptr) { @@ -3169,14 +3169,14 @@ NDT_Status ND_DataStruct_Value_Find_VC( void **Value_Ptr_Ptr, NDT_Root *Root_ -/*------------------------------------------------------------------------------*/ -/* Find a value in a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address found */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a value in a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address found */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Find_I( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, void *Ref_Value_Ptr, ...) { @@ -3213,14 +3213,14 @@ NDT_Status ND_DataStruct_Value_Find_I( void **Value_Ptr_Ptr, NDT_Root *Root_P -/*------------------------------------------------------------------------------*/ -/* Find a value in a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address found */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Ref_Value_Ptr: Reference value pointer to search */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Find a value in a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address found */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Ref_Value_Ptr: Reference value pointer to search */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_DataStruct_Value_Find_C( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, void *Ref_Value_Ptr, ...) { @@ -3245,12 +3245,12 @@ NDT_Status ND_DataStruct_Value_Find_C( void **Value_Ptr_Ptr, NDT_Root *Root_P -/*------------------------------------------------------------------------------*/ -/* Get the root node of a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Root_Ptr_Ptr: Data structure pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the root node of a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Root_Ptr_Ptr: Data structure pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Root_Get_I( NDT_Root **Root_Ptr_Ptr, NDT_Node *Node_Ptr) { @@ -3263,12 +3263,12 @@ NDT_Status ND_Node_Root_Get_I( NDT_Root **Root_Ptr_Ptr, NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Get the root node of a data structure */ -/*------------------------------------------------------------------------------*/ -/* (O) Root_Ptr_Ptr: Data structure pointer address */ -/* (I) Node_Ptr: Node pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Get the root node of a data structure */ +/*----------------------------------------------------------------------------*/ +/* (O) Root_Ptr_Ptr: Data structure pointer address */ +/* (I) Node_Ptr: Node pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Root_Get_C( NDT_Root **Root_Ptr_Ptr, NDT_Node *Node_Ptr ) { @@ -3282,13 +3282,13 @@ NDT_Status ND_Node_Root_Get_C( NDT_Root **Root_Ptr_Ptr, NDT_Node *Node_Ptr ) -/*------------------------------------------------------------------------------*/ -/* Allocate a new value */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Allocate a new value */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Value_Alloc_I( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, ...) { @@ -3313,13 +3313,13 @@ NDT_Status ND_Value_Alloc_I( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, ...) -/*------------------------------------------------------------------------------*/ -/* Allocate a new value */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address */ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Allocate a new value */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address */ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Value_Alloc_C( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, ...) { @@ -3347,12 +3347,12 @@ NDT_Status ND_Value_Alloc_C( void **Value_Ptr_Ptr, NDT_Root *Root_Ptr, ...) -/*------------------------------------------------------------------------------*/ -/* Deallocate a value */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Deallocate a value */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Value_Free_I( NDT_Root *Root_Ptr, void *Value_Ptr) { @@ -3363,12 +3363,12 @@ NDT_Status ND_Value_Free_I( NDT_Root *Root_Ptr, void *Value_Ptr) -/*------------------------------------------------------------------------------*/ -/* Deallocate a value */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Value_Ptr: Value pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Deallocate a value */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Value_Ptr: Value pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Value_Free_C( NDT_Root *Root_Ptr, void *Value_Ptr) { @@ -3385,15 +3385,15 @@ NDT_Status ND_Value_Free_C( NDT_Root *Root_Ptr, void *Value_Ptr) -/*------------------------------------------------------------------------------*/ -/* Execute a manager command */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a manager command */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Manager_Exec_VI( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr, NDT_Command Command, va_list *Args_Ptr) { @@ -3423,15 +3423,15 @@ NDT_Status ND_Manager_Exec_VI( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT -/*------------------------------------------------------------------------------*/ -/* Execute a manager command */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a manager command */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Manager_Exec_VC( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr, NDT_Command Command, va_list *Args_Ptr) { @@ -3457,15 +3457,15 @@ NDT_Status ND_Manager_Exec_VC( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT -/*------------------------------------------------------------------------------*/ -/* Execute a manager command */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a manager command */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Manager_Exec_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr, NDT_Command Command, ...) { @@ -3501,15 +3501,15 @@ NDT_Status ND_Manager_Exec_I( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_ -/*------------------------------------------------------------------------------*/ -/* Execute a manager command */ -/*------------------------------------------------------------------------------*/ -/* (I) Root_Ptr: Data structure pointer */ -/* (I) Index_Id: Id of the index */ -/* (I) Node_Ptr: Node pointer */ -/* (I) Command: Manager command */ -/* (I) ...: User args */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a manager command */ +/*----------------------------------------------------------------------------*/ +/* (I) Root_Ptr: Data structure pointer */ +/* (I) Index_Id: Id of the index */ +/* (I) Node_Ptr: Node pointer */ +/* (I) Command: Manager command */ +/* (I) ...: User args */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Manager_Exec_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr, NDT_Command Command, ...) { @@ -3540,14 +3540,14 @@ NDT_Status ND_Manager_Exec_C( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_ -/*------------------------------------------------------------------------------*/ -/* Execute an allocator function */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address */ -/* (I) Allocator_Name: Value allocator function name */ -/* (I) Allocator_Ptr: Value allocator function pointer */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute an allocator function */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address */ +/* (I) Allocator_Name: Value allocator function name */ +/* (I) Allocator_Ptr: Value allocator function pointer */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Allocator_Exec_I( void **Ptr_Ptr, size_t Size, NDT_Allocator_Name Allocator_Name, NDT_Allocator *Allocator_Ptr, void *Data_Ptr) { @@ -3575,14 +3575,14 @@ NDT_Status ND_Allocator_Exec_I( void **Ptr_Ptr, size_t Size, NDT_Allocator_Na -/*------------------------------------------------------------------------------*/ -/* Execute an allocator function */ -/*------------------------------------------------------------------------------*/ -/* (O) Value_Ptr_Ptr: Value pointer address */ -/* (I) Allocator_Name: Value allocator function name */ -/* (I) Allocator_Ptr: Value allocator function pointer */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute an allocator function */ +/*----------------------------------------------------------------------------*/ +/* (O) Value_Ptr_Ptr: Value pointer address */ +/* (I) Allocator_Name: Value allocator function name */ +/* (I) Allocator_Ptr: Value allocator function pointer */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Allocator_Exec_C( void **Ptr_Ptr, size_t Size, NDT_Allocator_Name Allocator_Name, NDT_Allocator *Allocator_Ptr, void *Data_Ptr) { @@ -3602,14 +3602,14 @@ NDT_Status ND_Allocator_Exec_C( void **Ptr_Ptr, size_t Size, NDT_Allocator_Na -/*------------------------------------------------------------------------------*/ -/* Execute a deallocator function */ -/*------------------------------------------------------------------------------*/ -/* (I) Value_Ptr: Value pointer */ -/* (I) Allocator_Name: Value deallocator function name */ -/* (I) Allocator_Ptr: Value deallocator function pointer */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a deallocator function */ +/*----------------------------------------------------------------------------*/ +/* (I) Value_Ptr: Value pointer */ +/* (I) Allocator_Name: Value deallocator function name */ +/* (I) Allocator_Ptr: Value deallocator function pointer */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Deallocator_Exec_I( void *Ptr, NDT_Deallocator_Name Deallocator_Name, NDT_Deallocator *Deallocator_Ptr, void *Data_Ptr) { @@ -3637,14 +3637,14 @@ NDT_Status ND_Deallocator_Exec_I( void *Ptr, NDT_Deallocator_Name Deallocator_ -/*------------------------------------------------------------------------------*/ -/* Execute a deallocator function */ -/*------------------------------------------------------------------------------*/ -/* (I) Value_Ptr: Value pointer */ -/* (I) Allocator_Name: Value deallocator function name */ -/* (I) Allocator_Ptr: Value deallocator function pointer */ -/* (I) Data_Ptr: User pointer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Execute a deallocator function */ +/*----------------------------------------------------------------------------*/ +/* (I) Value_Ptr: Value pointer */ +/* (I) Allocator_Name: Value deallocator function name */ +/* (I) Allocator_Ptr: Value deallocator function pointer */ +/* (I) Data_Ptr: User pointer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Deallocator_Exec_C( void *Ptr, NDT_Deallocator_Name Deallocator_Name, NDT_Deallocator *Deallocator_Ptr, void *Data_Ptr) { @@ -3666,15 +3666,15 @@ NDT_Status ND_Deallocator_Exec_C( void *Ptr, NDT_Deallocator_Name Deallocator_ -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* PRIVATE FUNCTIONS */ -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* PRIVATE FUNCTIONS */ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* Symbol Lookup */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Symbol Lookup */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Symbol_Find( void **Ptr_Ptr, const char *Symbol_Name) { @@ -3733,12 +3733,12 @@ NDT_Status ND_Symbol_Find( void **Ptr_Ptr, const char *Symbol_Name) -/*------------------------------------------------------------------------------*/ -/* Allocation d'un noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la structure */ -/* (O) Node : adresse du pointeur sur le nouveau noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Allocation d'un noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la structure */ +/* (O) Node : adresse du pointeur sur le nouveau noeud */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Alloc( NDT_Root *Root_Ptr, NDT_Node **Node_Ptr_Ptr ) { @@ -3762,12 +3762,12 @@ NDT_Status ND_Node_Alloc( NDT_Root *Root_Ptr, NDT_Node **Node_Ptr_Ptr ) -/*------------------------------------------------------------------------------*/ -/* Désallocation d'un noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Root: pointeur sur la racine de la structure */ -/* (I) Node : pointeur sur le noeud à détruire */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Désallocation d'un noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Root: pointeur sur la racine de la structure */ +/* (I) Node : pointeur sur le noeud à détruire */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Free( NDT_Root *Root_Ptr, NDT_Node *Node_Ptr) { return( ND_Deallocator_Exec_I( Node_Ptr, Root_Ptr->Deallocator_Name, Root_Ptr->Deallocator_Ptr, Root_Ptr->User_Ptr)); @@ -3777,16 +3777,16 @@ NDT_Status ND_Node_Free( NDT_Root *Root_Ptr, NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Création d'une nouvelle structure de données */ -/*------------------------------------------------------------------------------*/ -/* (O) Root: adresse d'un pointeur sur la racine de la nouvelle structure */ -/* (I) Type: type de la structure.de données (liste ou arbre binaire) */ -/* (I) Allocator: pointeur vers la fonction d'allocation */ -/* (I) Deallocator: pointeur vers la fonction de désallocation */ -/* (I) Data : pointeur de données utiles à l'allocateur */ -/* (I) Own_Value : indique si la structure est propriétaire de ses valeurs */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Création d'une nouvelle structure de données */ +/*----------------------------------------------------------------------------*/ +/* (O) Root: adresse d'un pointeur sur la racine de la nouvelle structure */ +/* (I) Type: type de la structure.de données (liste ou arbre binaire) */ +/* (I) Allocator: pointeur vers la fonction d'allocation */ +/* (I) Deallocator: pointeur vers la fonction de désallocation */ +/* (I) Data : pointeur de données utiles à l'allocateur */ +/* (I) Own_Value : indique si la structure est propriétaire de ses valeurs */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Clear( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -3810,15 +3810,15 @@ NDT_Status ND_Index_Clear( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Allocation d'une racine de structure de données */ -/*------------------------------------------------------------------------------*/ -/* (O) New_Root: adresse du pointeur sur la nouvelle racine */ -/* (I) Type: type de la structure de données */ -/* (I) Allocator: pointeur vers la fonction d'allocation */ -/* (I) Deallocator: pointeur vers la fonction de désallocation */ -/* (I) Data : pointeur de données utiles à l'allocateur */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Allocation d'une racine de structure de données */ +/*----------------------------------------------------------------------------*/ +/* (O) New_Root: adresse du pointeur sur la nouvelle racine */ +/* (I) Type: type de la structure de données */ +/* (I) Allocator: pointeur vers la fonction d'allocation */ +/* (I) Deallocator: pointeur vers la fonction de désallocation */ +/* (I) Data : pointeur de données utiles à l'allocateur */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Root_Alloc( NDT_Root **Root_Ptr_Ptr, NDT_Index_Nb Index_Nb, NDT_Index_Type *Type_Ptr, char *Manager_Name, NDT_Manager *Manager_Ptr, char *Allocator_Name, NDT_Allocator *Allocator_Ptr, char *Deallocator_Name, NDT_Deallocator *Deallocator_Ptr, short Own_Value, void *Data_Ptr) { @@ -3874,11 +3874,11 @@ NDT_Status ND_Node_Root_Alloc( NDT_Root **Root_Ptr_Ptr, NDT_Index_Nb Index_Nb, -/*------------------------------------------------------------------------------*/ -/* Désallocation de la racine d'une structure de donnée */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine à détruire */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Désallocation de la racine d'une structure de donnée */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine à détruire */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Root_Free( NDT_Root *Root_Ptr) { return( ND_Deallocator_Exec_I( Root_Ptr, Root_Ptr->Deallocator_Name, Root_Ptr->Deallocator_Ptr, Root_Ptr->User_Ptr)); @@ -3888,12 +3888,12 @@ NDT_Status ND_Node_Root_Free( NDT_Root *Root_Ptr) -/*------------------------------------------------------------------------------*/ -/* Ajout d'un noeud à une liste chaînée */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste */ -/* (I) New_Node : pointeur sur le noeud à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'un noeud à une liste chaînée */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste */ +/* (I) New_Node : pointeur sur le noeud à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Node_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *New_Node_Ptr) { @@ -3914,7 +3914,7 @@ NDT_Status ND_List_Node_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_N - FIFO : un noeud sera inséré APRES un noeud de même valeur (par défaut) - FILO : un noeud sera inséré AVANT un noeud de même valeur - */ + */ if( ND_INDEX_SUBTYPE_LIFO_IS( Root_Ptr, Index_Id)) { @@ -4050,12 +4050,12 @@ NDT_Status ND_List_Node_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_N -/*------------------------------------------------------------------------------*/ -/* Ajout d'une nouvelle valeur à une liste */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste */ -/* (I) Value : pointeur sur la valeur à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'une nouvelle valeur à une liste */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste */ +/* (I) Value : pointeur sur la valeur à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Value_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr) { @@ -4085,12 +4085,12 @@ NDT_Status ND_List_Value_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void -/*------------------------------------------------------------------------------*/ -/* Ajout d'un noeud à un arbre binaire */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'arbre */ -/* (I) Value : pointeur sur la valeur à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'un noeud à un arbre binaire */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'arbre */ +/* (I) Value : pointeur sur la valeur à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_Value_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr) { @@ -4120,13 +4120,13 @@ NDT_Status ND_Tree_Value_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void -/*------------------------------------------------------------------------------*/ -/* Recherche une valeur dans une liste et retourne le noeud correspondant */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste */ -/* (I) Value : pointeur sur la valeur à rechercher */ -/* (I) Data : pointeur de données */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Recherche une valeur dans une liste et retourne le noeud correspondant */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste */ +/* (I) Value : pointeur sur la valeur à rechercher */ +/* (I) Data : pointeur de données */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_List_Node_Find( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr, va_list *User_Args_Ptr) { @@ -4183,15 +4183,15 @@ NDT_Node *ND_List_Node_Find( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void -/*------------------------------------------------------------------------------*/ -/* Recherche un noeud dans un arbre et retourne le pointeur sur le noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'abre */ -/* (I) Value : pointeur sur la valeur à rechercher */ -/* (I) Data : pointeur de données */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Recherche un noeud dans un arbre et retourne le pointeur sur le noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'abre */ +/* (I) Value : pointeur sur la valeur à rechercher */ +/* (I) Data : pointeur de données */ +/*----------------------------------------------------------------------------*/ -/*------------------------------ Recursive Kernel ------------------------------*/ +/*------------------------------ Recursive Kernel ----------------------------*/ NDT_Node *ND_Tree_Node_Recursive_Find( NDT_Node *Node_Ptr, void *Value_Ptr, va_list *User_Args_Ptr) { @@ -4217,7 +4217,7 @@ NDT_Node *ND_Tree_Node_Recursive_Find( NDT_Node *Node_Ptr, void *Value_Ptr, v -/*-------------------------------- main body ---------------------------------*/ +/*-------------------------------- main body -------------------------------*/ NDT_Node *ND_Tree_Node_Find( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void *Value_Ptr, va_list *User_Args_Ptr) { @@ -4228,11 +4228,11 @@ NDT_Node *ND_Tree_Node_Find( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, void -/*------------------------------------------------------------------------------*/ -/* Recherche du premier noeud parent situé après */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Recherche du premier noeud parent situé après */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_Tree_Parent_Next_Recursive_Get( NDT_Node *Node_Ptr) { @@ -4247,11 +4247,11 @@ NDT_Node *ND_Tree_Parent_Next_Recursive_Get( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Recherche du premier noeud parent situé avant */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Recherche du premier noeud parent situé avant */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_Tree_Parent_Previous_Recursive_Get( NDT_Node *Node_Ptr) { @@ -4266,11 +4266,11 @@ NDT_Node *ND_Tree_Parent_Previous_Recursive_Get( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Supprime le noeud d'une liste */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud à supprimer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Supprime le noeud d'une liste */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud à supprimer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Node_Remove( NDT_Node *Node_Ptr) { @@ -4294,13 +4294,13 @@ NDT_Status ND_List_Node_Remove( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Conversion d'un arbre en liste chaînée */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine du la structure à convertir */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Conversion d'un arbre en liste chaînée */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine du la structure à convertir */ +/*----------------------------------------------------------------------------*/ -/*------------------------------- Recursive Kernel -----------------------------*/ +/*------------------------------- Recursive Kernel ---------------------------*/ NDT_Status ND_List_Recursive_Make( NDT_Node *Node_Ptr, NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -4320,7 +4320,7 @@ NDT_Status ND_List_Recursive_Make( NDT_Node *Node_Ptr, NDT_Root *Root_Ptr, ND -/*--------------------------------- main body --------------------------------*/ +/*--------------------------------- main body ------------------------------*/ NDT_Status ND_List_Make( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -4345,14 +4345,14 @@ NDT_Status ND_List_Make( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Conversion d'une structure en arbre binaire */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine du la structure à convertir */ -/* (I) Type : type du futur arbre */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Conversion d'une structure en arbre binaire */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine du la structure à convertir */ +/* (I) Type : type du futur arbre */ +/*----------------------------------------------------------------------------*/ -/*------------------------------- Recursive Kernel -----------------------------*/ +/*------------------------------- Recursive Kernel ---------------------------*/ NDT_Node *ND_Tree_Recursive_Make( long Depth, long Node_Number, NDT_Node *Node_Ptr ) { @@ -4414,7 +4414,7 @@ NDT_Node *ND_Tree_Recursive_Make( long Depth, long Node_Number, NDT_Node *No /* Si le noeud courant est une feuille, on met éventuellement à jour les longueurs minimale et maximale des branches de l'arbre - */ + */ if( Depth > middle_node_ptr->Root->Index_Tab[middle_node_ptr->Index].Max_Depth) { @@ -4432,7 +4432,7 @@ NDT_Node *ND_Tree_Recursive_Make( long Depth, long Node_Number, NDT_Node *No -/*--------------------------------- main body --------------------------------*/ +/*--------------------------------- main body ------------------------------*/ NDT_Status ND_Tree_Make( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id ) { @@ -4468,11 +4468,11 @@ NDT_Status ND_Tree_Make( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id ) -/*----------------------------------------------------------------------------*/ -/* Equilibrage d'un arbre binaire */ -/*----------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'arbre */ -/*----------------------------------------------------------------------------*/ +/*--------------------------------------------------------------------------*/ +/* Equilibrage d'un arbre binaire */ +/*--------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'arbre */ +/*--------------------------------------------------------------------------*/ NDT_Status ND_Tree_Equalize( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -4504,11 +4504,11 @@ NDT_Status ND_Tree_Equalize( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*----------------------------------------------------------------------------*/ -/* Retourne la profondeur de la plus grande branche à partir d'un noeud */ -/*----------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud */ -/*----------------------------------------------------------------------------*/ +/*--------------------------------------------------------------------------*/ +/* Retourne la profondeur de la plus grande branche à partir d'un noeud */ +/*--------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud */ +/*--------------------------------------------------------------------------*/ long ND_Tree_MaxDepth_Get( NDT_Node *Node_Ptr) { @@ -4524,11 +4524,11 @@ long ND_Tree_MaxDepth_Get( NDT_Node *Node_Ptr) return( NDD_MAX( Max_Left, Max_Right) + 1 ); } -/*----------------------------------------------------------------------------*/ -/* Retourne la profondeur de la plus petite branche à partir d'un noeud */ -/*----------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud */ -/*----------------------------------------------------------------------------*/ +/*--------------------------------------------------------------------------*/ +/* Retourne la profondeur de la plus petite branche à partir d'un noeud */ +/*--------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud */ +/*--------------------------------------------------------------------------*/ long ND_Tree_MinDepth_Get( NDT_Node *Node_Ptr) { @@ -4548,14 +4548,14 @@ long ND_Tree_MinDepth_Get( NDT_Node *Node_Ptr) -/*----------------------------------------------------------------------------*/ -/* Ajoute un noeud à un arbre */ -/*----------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'arbre */ -/* (I) Node : pointeur sur le noeud à ajouter */ -/*----------------------------------------------------------------------------*/ +/*--------------------------------------------------------------------------*/ +/* Ajoute un noeud à un arbre */ +/*--------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'arbre */ +/* (I) Node : pointeur sur le noeud à ajouter */ +/*--------------------------------------------------------------------------*/ -/*------------------------------ Recursive Kernel ----------------------------*/ +/*------------------------------ Recursive Kernel --------------------------*/ void ND_Tree_Node_Recursive_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Parent_Node, NDT_Node **Node_Ptr_Ptr, long Depth, NDT_Node *New_Node_Ptr ) { @@ -4596,7 +4596,7 @@ void ND_Tree_Node_Recursive_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, N -/*-------------------------------- main body ---------------------------------*/ +/*-------------------------------- main body -------------------------------*/ NDT_Status ND_Tree_Node_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_Node *Node_Ptr) { @@ -4612,12 +4612,12 @@ NDT_Status ND_Tree_Node_Add( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, NDT_N -/*------------------------------------------------------------------------------*/ -/* Ajoute tous les noeud d'une liste à un arbre */ -/*------------------------------------------------------------------------------*/ -/* (I) Tree_Root : pointeur sur la racine de l'arbre */ -/* (I) List_Root : pointeur sur la racine de la liste */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajoute tous les noeud d'une liste à un arbre */ +/*----------------------------------------------------------------------------*/ +/* (I) Tree_Root : pointeur sur la racine de l'arbre */ +/* (I) List_Root : pointeur sur la racine de la liste */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_List_Add( NDT_Root *Tree_Root_Ptr, NDT_Index_Id Tree_Index_Id, NDT_Root *List_Root_Ptr, NDT_Index_Id List_Index_Id) { @@ -4641,13 +4641,13 @@ NDT_Status ND_Tree_List_Add( NDT_Root *Tree_Root_Ptr, NDT_Index_Id Tree_Index -/*------------------------------------------------------------------------------*/ -/* Affiche toutes les informations d'une structure de données */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la structure */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Affiche toutes les informations d'une structure de données */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la structure */ +/*----------------------------------------------------------------------------*/ -/*------------------------------- Recursive Kernel -----------------------------*/ +/*------------------------------- Recursive Kernel ---------------------------*/ void ND_Tree_Recursive_Print( NDT_Node *Node_Ptr, long Depth, FILE *Out) { @@ -4692,9 +4692,9 @@ fprintf( Out, "]\n"); -/*------------------------------------------------------------------------------*/ -/* Function de comparaison de noeuds (pour le quick sort) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Function de comparaison de noeuds (pour le quick sort) */ +/*----------------------------------------------------------------------------*/ int ND_Node_Compare( void **Node1_Ptr_Ptr, void **Node2_Ptr_Ptr) { @@ -4722,11 +4722,11 @@ int ND_Node_Compare( void **Node1_Ptr_Ptr, void **Node2_Ptr_Ptr) -/*----------------------------------------------------------------------------*/ -/* Ordonne une liste chaînée : */ -/*----------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste à trier */ -/*----------------------------------------------------------------------------*/ +/*--------------------------------------------------------------------------*/ +/* Ordonne une liste chaînée : */ +/*--------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste à trier */ +/*--------------------------------------------------------------------------*/ NDT_Status ND_List_Sort( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) { @@ -4781,11 +4781,11 @@ NDT_Status ND_List_Sort( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id) -/*------------------------------------------------------------------------------*/ -/* Récupère le premier noeud dans un sous-arbre */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud racine du sous-arbre */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Récupère le premier noeud dans un sous-arbre */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud racine du sous-arbre */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_Tree_Node_First_Recursive_Get( NDT_Node *Node_Ptr) { @@ -4800,11 +4800,11 @@ NDT_Node *ND_Tree_Node_First_Recursive_Get( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Récupère le dernier noeud dans un sous-arbre */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud racine du sous-arbre */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Récupère le dernier noeud dans un sous-arbre */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud racine du sous-arbre */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_Tree_Node_Last_Recursive_Get( NDT_Node *Node_Ptr) { @@ -4819,9 +4819,9 @@ NDT_Node *ND_Tree_Node_Last_Recursive_Get( NDT_Node *Node_Ptr) -/*------------------------------------------------------------------------------*/ -/* Redéfinition de la fonction malloc() avec retour de type NDT_Status */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Redéfinition de la fonction malloc() avec retour de type NDT_Status */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Default_Allocator( void **Ptr_Ptr, size_t Size, void *Data_Ptr) { @@ -4837,9 +4837,9 @@ NDT_Status ND_Default_Allocator( void **Ptr_Ptr, size_t Size, void *Data_Ptr -/*------------------------------------------------------------------------------*/ -/* Redéfinition de la fonction free() avec retour de type NDT_Status */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Redéfinition de la fonction free() avec retour de type NDT_Status */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Default_Deallocator( void *Ptr, void *Data_Ptr) { @@ -4854,9 +4854,9 @@ NDT_Status ND_Default_Deallocator( void *Ptr, void *Data_Ptr) -/*------------------------------------------------------------------------------*/ -/* Function de vérification d'une liste : */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Function de vérification d'une liste : */ +/*----------------------------------------------------------------------------*/ void ND_List_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -4873,9 +4873,9 @@ void ND_List_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detect -/*------------------------------------------------------------------------------*/ -/* Function de vérification et correction des liens entre noeuds d'une liste */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Function de vérification et correction des liens entre noeuds d'une liste */ +/*----------------------------------------------------------------------------*/ void ND_List_Link_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -4887,7 +4887,7 @@ void ND_List_Link_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_D /* On commence à vérifier si l'on trouve le même nombre de noeuds en parcourant la liste de droite à gauche, puis de gauche à droite - */ + */ node_ptr = Root_Ptr->Index_Tab[Index_Id].Head; @@ -5007,9 +5007,9 @@ void ND_List_Link_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_D -/*------------------------------------------------------------------------------*/ -/* Function de vérification des valeurs des noeuds d'une liste */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Function de vérification des valeurs des noeuds d'une liste */ +/*----------------------------------------------------------------------------*/ void ND_Value_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detected, int *Nb_Corrected, FILE *Out) { @@ -5054,9 +5054,9 @@ void ND_Value_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Dete -/*------------------------------------------------------------------------------*/ -/* Function de vérification d'un arbre : */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Function de vérification d'un arbre : */ +/*----------------------------------------------------------------------------*/ void ND_Tree_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -5078,9 +5078,9 @@ void ND_Tree_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detec -/*------------------------------------------------------------------------------*/ -/* Function de vérification et correction des liens entre noeuds d'un arbre */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Function de vérification et correction des liens entre noeuds d'un arbre */ +/*----------------------------------------------------------------------------*/ void ND_Tree_Link_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -5104,7 +5104,7 @@ void ND_Tree_Link_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_ /* On vérifie si le lien 'Save' contient un noeud (cela signifie que la procédure ND_Node_Remove n'a pas été jusqu'à son terme). - */ + */ if( Root_Ptr->Index_Tab[Index_Id].Save) { @@ -5129,7 +5129,7 @@ void ND_Tree_Link_Check( NDT_Root *Root_Ptr, NDT_Index_Id Index_Id, int *Nb_ -/*------------------------------ Recursive Kernel ------------------------------*/ +/*------------------------------ Recursive Kernel ----------------------------*/ void ND_Tree_Link_Recursive_Check( NDT_Node *Node_Ptr, int *Nb_Detected_Ptr, int *Nb_Corrected_Ptr, FILE *Out) { @@ -5192,9 +5192,9 @@ void ND_Tree_Link_Recursive_Check( NDT_Node *Node_Ptr, int *Nb_Detected_Ptr, -/*------------------------------------------------------------------------------*/ -/* Target address access try */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Target address access try */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Address_Check( void *Address) { @@ -5313,9 +5313,9 @@ NDT_Status ND_Address_Check( void *Address) -/*------------------------------------------------------------------------------*/ -/* Trap d'un signal */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Trap d'un signal */ +/*----------------------------------------------------------------------------*/ void ND_Signal_Trap( int Sig_Num) { diff --git a/lib/libnode.h b/lib/libnode.h index e81e712..ff1f9c6 100644 --- a/lib/libnode.h +++ b/lib/libnode.h @@ -129,185 +129,185 @@ NDT_Base NDG_Base = -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* Fonctions et procédures privées de la librairie (moyen niveau) */ -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Fonctions et procédures privées de la librairie (moyen niveau) */ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* Manager par défaut */ -/*------------------------------------------------------------------------------*/ -/* (I) va_list Arguments : Liste d'arguments contextuels */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Manager par défaut */ +/*----------------------------------------------------------------------------*/ +/* (I) va_list Arguments : Liste d'arguments contextuels */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Default_Manager( NDT_Root *, NDT_Index_Id, NDT_Node *, NDT_Command, va_list *); -/*------------------------------------------------------------------------------*/ -/* OpenStruct Manager */ -/*------------------------------------------------------------------------------*/ -/* (I) va_list Arguments : Liste d'arguments contextuels */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* OpenStruct Manager */ +/*----------------------------------------------------------------------------*/ +/* (I) va_list Arguments : Liste d'arguments contextuels */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_OpenStruct_Manager( NDT_Root *, NDT_Index_Id, NDT_Node *, NDT_Command, va_list *); -/*------------------------------------------------------------------------------*/ -/* Redéfinition de la fonction malloc() avec retour de type NDT_Status */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Redéfinition de la fonction malloc() avec retour de type NDT_Status */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Default_Allocator( void **, size_t, void *); -/*------------------------------------------------------------------------------*/ -/* Redéfinition de la fonction free() avec retour de type NDT_Status */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Redéfinition de la fonction free() avec retour de type NDT_Status */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Default_Deallocator( void *, void *); -/*------------------------------------------------------------------------------*/ -/* Création d'un noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : adresse de la racine pour laquelle on crée un noeud */ -/* (O) New_Node : adresse du pointeur sur le nouveau noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Création d'un noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : adresse de la racine pour laquelle on crée un noeud */ +/* (O) New_Node : adresse du pointeur sur le nouveau noeud */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Alloc( NDT_Root * Root, NDT_Node ** New_Node); -/*------------------------------------------------------------------------------*/ -/* Destruction d'un noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : adresse de la racine dans laquelle on détruit un noeud */ -/* (I) Node : pointeur sur le noeud à détruire */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destruction d'un noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : adresse de la racine dans laquelle on détruit un noeud */ +/* (I) Node : pointeur sur le noeud à détruire */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Free( NDT_Root *, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Création d'une nouvelle structure de données */ -/*------------------------------------------------------------------------------*/ -/* (O) Root: adresse d'un pointeur sur la racine de la nouvelle structure */ -/* (I) Type: type de la structure.de données (liste ou arbre binaire) */ -/* (I) Allocator: pointeur vers la fonction d'allocation */ -/* (I) Deallocator: pointeur vers la fonction de désallocation */ -/* (I) Data : pointeur de données utiles à l'allocateur */ -/* (I) Own_Value : indique si la structure est propriétaire de ses valeurs */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Création d'une nouvelle structure de données */ +/*----------------------------------------------------------------------------*/ +/* (O) Root: adresse d'un pointeur sur la racine de la nouvelle structure */ +/* (I) Type: type de la structure.de données (liste ou arbre binaire) */ +/* (I) Allocator: pointeur vers la fonction d'allocation */ +/* (I) Deallocator: pointeur vers la fonction de désallocation */ +/* (I) Data : pointeur de données utiles à l'allocateur */ +/* (I) Own_Value : indique si la structure est propriétaire de ses valeurs */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Index_Clear( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Création de la racine d'une structure de données quelconque */ -/*------------------------------------------------------------------------------*/ -/* (O) New_Root : adresse du pointeur sur la nouvelle racine */ -/* (I) Type : type de la structure de données */ -/* (I) Allocater : pointeur vers la fonction d'allocation */ -/* (I) Deallocater : pointeur vers la fonction de désallocation */ -/* (I) Data : pointeur de données utiles à l'allocateur */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Création de la racine d'une structure de données quelconque */ +/*----------------------------------------------------------------------------*/ +/* (O) New_Root : adresse du pointeur sur la nouvelle racine */ +/* (I) Type : type de la structure de données */ +/* (I) Allocater : pointeur vers la fonction d'allocation */ +/* (I) Deallocater : pointeur vers la fonction de désallocation */ +/* (I) Data : pointeur de données utiles à l'allocateur */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Root_Alloc( NDT_Root **, NDT_Index_Nb, NDT_Index_Type[], char *, NDT_Manager *, char *, NDT_Allocator *, char *, NDT_Deallocator *, short, void *); -/*------------------------------------------------------------------------------*/ -/* Destruction d'une racine */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine à détruire */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Destruction d'une racine */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine à détruire */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Node_Root_Free( NDT_Root *); -/*------------------------------------------------------------------------------*/ -/* Ajout d'un noeud à une liste chaînée */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste */ -/* (I) New_Node : pointeur sur le noeud à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'un noeud à une liste chaînée */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste */ +/* (I) New_Node : pointeur sur le noeud à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Node_Add( NDT_Root *, NDT_Index_Id, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Ajout d'une nouvelle valeur à une liste */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste */ -/* (I) Value : pointeur sur la valeur à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'une nouvelle valeur à une liste */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste */ +/* (I) Value : pointeur sur la valeur à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Value_Add( NDT_Root *, NDT_Index_Id, void *); -/*------------------------------------------------------------------------------*/ -/* Ajout d'un noeud à un arbre binaire */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'arbre */ -/* (I) Value : pointeur sur la valeur à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'un noeud à un arbre binaire */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'arbre */ +/* (I) Value : pointeur sur la valeur à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_Value_Add( NDT_Root *, NDT_Index_Id, void *); -/*------------------------------------------------------------------------------*/ -/* Supprime le noeud d'une liste */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud à supprimer */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Supprime le noeud d'une liste */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud à supprimer */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Node_Remove( NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Conversion d'une structure en liste chaînée */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine du la structure à convertir */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Conversion d'une structure en liste chaînée */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine du la structure à convertir */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Make( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Recherche une valeur dans une liste et retourne le noeud correspondant */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Recherche une valeur dans une liste et retourne le noeud correspondant */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_List_Node_Find( NDT_Root *, NDT_Index_Id, void *, va_list *); -/*------------------------------------------------------------------------------*/ -/* Recherche un noeud dans un arbre et retourne le pointeur sur le noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Recherche un noeud dans un arbre et retourne le pointeur sur le noeud */ +/*----------------------------------------------------------------------------*/ NDT_Node *ND_Tree_Node_Find( NDT_Root *, NDT_Index_Id, void *, va_list *); -/*------------------------------------------------------------------------------*/ -/* Conversion d'une structure en arbre binaire */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine du la structure à convertir */ -/* (I) Type : type du futur arbre */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Conversion d'une structure en arbre binaire */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine du la structure à convertir */ +/* (I) Type : type du futur arbre */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_Make( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Equilibrage d'un arbre */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'arbre */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Equilibrage d'un arbre */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'arbre */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_Equalize( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Retourne la profondeur de la plus grande branche à partir d'un noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Retourne la profondeur de la plus grande branche à partir d'un noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud */ +/*----------------------------------------------------------------------------*/ long ND_Tree_MaxDepth_Get( NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Retourne la profondeur de la plus petite branche à partir d'un noeud */ -/*------------------------------------------------------------------------------*/ -/* (I) Node : pointeur sur le noeud */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Retourne la profondeur de la plus petite branche à partir d'un noeud */ +/*----------------------------------------------------------------------------*/ +/* (I) Node : pointeur sur le noeud */ +/*----------------------------------------------------------------------------*/ long ND_Tree_MinDepth_Get( NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Ajout d'un noeud à un arbre binaire */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de l'arbre */ -/* (I) Node : pointeur sur le noeud à ajouter */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajout d'un noeud à un arbre binaire */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de l'arbre */ +/* (I) Node : pointeur sur le noeud à ajouter */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_Node_Add( NDT_Root *, NDT_Index_Id, NDT_Node *); -/*------------------------------------------------------------------------------*/ -/* Ajoute tous les noeud d'une liste à un arbre */ -/*------------------------------------------------------------------------------*/ -/* (I) Tree_Root : pointeur sur la racine de l'arbre */ -/* (I) List_Root : pointeur sur la racine de la liste */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ajoute tous les noeud d'une liste à un arbre */ +/*----------------------------------------------------------------------------*/ +/* (I) Tree_Root : pointeur sur la racine de l'arbre */ +/* (I) List_Root : pointeur sur la racine de la liste */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_Tree_List_Add( NDT_Root *, NDT_Index_Id, NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/* Fonction de comparaison de noeuds (pour le quick sort) */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Fonction de comparaison de noeuds (pour le quick sort) */ +/*----------------------------------------------------------------------------*/ int ND_Node_Compare( void **, void **); -/*------------------------------------------------------------------------------*/ -/* Ordonne une liste chaînée selon l'algorithme du tri à bulle */ -/*------------------------------------------------------------------------------*/ -/* (I) Root : pointeur sur la racine de la liste à trier */ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* Ordonne une liste chaînée selon l'algorithme du tri à bulle */ +/*----------------------------------------------------------------------------*/ +/* (I) Root : pointeur sur la racine de la liste à trier */ +/*----------------------------------------------------------------------------*/ NDT_Status ND_List_Sort( NDT_Root *, NDT_Index_Id); @@ -315,11 +315,11 @@ NDT_Status ND_List_Sort( NDT_Root *, NDT_Index_Id); -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ -/* PRIVATE FUNCTIONS */ -/*------------------------------------------------------------------------------*/ -/*------------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ +/* PRIVATE FUNCTIONS */ +/*----------------------------------------------------------------------------*/ +/*----------------------------------------------------------------------------*/ void ND_List_Check( NDT_Root *, NDT_Index_Id, int *, int *, FILE *);