Написать программу копирования одного стека в другой

#ifndef STACK_H
#define STACK_H
 
typedef struct TStack* STACK_HANDLE;
 
enum
{
  stack_no_error,
  stack_error_mem_alloc,
  stack_error_invalid_handle,
  stack_error_invalid_argument,
  stack_error_empty_stack
};
 
int StackCreate(STACK_HANDLE* stackHandle, const size_t stackElementSize);
void StackDelete(STACK_HANDLE* stackHandle);
int IsStackEmpty(STACK_HANDLE stackHandle);
int StackPush(STACK_HANDLE stackHandle, const void* const elementAddress);
int StackPop(STACK_HANDLE stackHandle, void* const elementAddress);
int StackCopy(STACK_HANDLE destinationStackHandle, STACK_HANDLE sourceStackHandle);
 
#endif

#include <stdlib.h>
#include <string.h>
 
#include "stack.h"
 
#define STACK_DEFAULT_ALLOC_LENGTH 100
 
/* stack data structure */
struct TStack
{
  void* elements;         /* data array where each element is of size 'elementSize' */
  size_t elementSize;     /* size of each element that stack contains */
  size_t stackLength;     /* length of the stack, items count */
  size_t allocatedLength; /* number of allocated elements for stack */
};
 
/*
  Creates stack by given pointer to stack handle.
  Allocates memory for structure and default-sized array for elements of given size.
 
  hStackPtr -- pointer to STACK_HANDLE, must not be NULL;
  stackElementSize -- size of each element that will be stored in stack in the process,
    must be greater than zero;
 
  Return value:
    on success returns 'stack_no_error', or:
     - 'stack_error_invalid_argument' : if 'hStackPtr' is NULL or 'stackElementSize' is zero
     - 'stack_error_mem_alloc' : if function could not allocate memory for anything
*/
int StackCreate(STACK_HANDLE* hStackPtr, const size_t stackElementSize)
{
  int errorCode = stack_no_error;
 
  do
  {
    if ((hStackPtr == NULL) || (stackElementSize == 0))
    {
      errorCode = stack_error_invalid_argument;
      break;
    }
 
    (*hStackPtr) = malloc(sizeof(**hStackPtr));
 
    if ((*hStackPtr) == NULL)
    {
      errorCode = stack_error_mem_alloc;
      break;
    }
 
    (*hStackPtr)->elements = malloc(STACK_DEFAULT_ALLOC_LENGTH * stackElementSize);
 
    if ((*hStackPtr)->elements == NULL)
    {
      errorCode = stack_error_mem_alloc;      
      StackDelete(hStackPtr);
      break;
    }
    else
    {
      (*hStackPtr)->allocatedLength = STACK_DEFAULT_ALLOC_LENGTH;
      (*hStackPtr)->elementSize = stackElementSize;
      (*hStackPtr)->stackLength = 0;
    }
  }
  while (0);
 
  return errorCode;
}
 
/*
  Deallocates memory for given 'hStackPtr', destroying stack.
  Handle can be reused normally by calling 'StackCreate'.
*/
void StackDelete(STACK_HANDLE* hStackPtr)
{
  if ((hStackPtr != NULL) && ((*hStackPtr) != NULL))
  {
    free((*hStackPtr)->elements);
    free(*hStackPtr);
    (*hStackPtr) = NULL;
  }
}
 
/*
  Checks if given stack by handle is empty (contains zero elements)
*/
int IsStackEmpty(STACK_HANDLE hStack)
{
  if (hStack != NULL)
  {
    return (hStack->stackLength == 0);
  }
 
  return 0;
}
 
/*
  Pushes item to stack.
 
  hStack -- stack handle, must be valid
  elementAddress -- address of item / element to be pushed to stack, must not be NULL
 
  if actual size of provided element at adress 'elementAddress' does not match
  the size of which stack was originally created with, the behaviour is undefined.
 
  Return value:
    on success returns 'stack_no_error', or:
     - 'stack_error_invalid_handle' : if an invalid handle was supplied
     - 'stack_error_invalid_argument' : if 'elementAddress' is NULL
     - 'stack_error_mem_alloc' : if function could not allocate memory for anything
*/
int StackPush(STACK_HANDLE hStack, const void* const elementAddress)
{
  int errorCode = stack_no_error;
  
  void* tempPtr = NULL;
 
  do
  {
    if (hStack == NULL)
    {
      errorCode = stack_error_invalid_handle;
      break;
    }
 
    if (elementAddress == NULL)
    {
      errorCode = stack_error_invalid_argument;
      break;
    }
 
    if (hStack->allocatedLength == hStack->stackLength)
    {
      /* resizing stack to hold twice as many elements */
      hStack->allocatedLength = hStack->allocatedLength * 2;
      tempPtr = realloc(hStack->elements, hStack->allocatedLength * hStack->elementSize);
 
      if (tempPtr == NULL)
      {
        errorCode = stack_error_mem_alloc;
        break;
      }
 
      hStack->elements = tempPtr;
      tempPtr = NULL;
    }
    
    /* calculating address to save data */
    tempPtr = (char*)hStack->elements + hStack->stackLength * hStack->elementSize;
    
    /* copying data */
    memcpy(tempPtr, elementAddress, hStack->elementSize);
    hStack->stackLength++;
  }
  while (0);
 
  return errorCode;
}
 
/*
  Pops item from stack.
 
  hStack -- stack handle, must be valid
  elementAddress -- address of item / element to store value popped from stack, must not be NULL
 
  if actual size of provided element at adress 'elementAddress' does not match
  the size of which stack was originally created with, the behaviour is undefined.
 
  Return value:
    on success returns 'stack_no_error', or:
     - 'stack_error_invalid_handle' : if an invalid handle was supplied
     - 'stack_error_invalid_argument' : if 'elementAddress' is NULL
     - 'stack_error_mem_alloc' : if function could not allocate memory for anything
     - 'stack_error_empty_stack' : if stack is empty
*/
int StackPop(STACK_HANDLE hStack, void* const elementAddress)
{
  int errorCode = stack_no_error;
 
  const void* sourceAddress = NULL;
 
  if (hStack == NULL)
  {
    errorCode = stack_error_invalid_handle;
  }
  else if (elementAddress == NULL)
  {
    errorCode = stack_error_invalid_argument;
  }
  else if (IsStackEmpty(hStack))
  {
    errorCode = stack_error_empty_stack;
  }
  else
  {
    hStack->stackLength--;
 
    sourceAddress = (const char*)hStack->elements + hStack->stackLength * hStack->elementSize;
 
    memcpy(elementAddress, sourceAddress, hStack->elementSize);
  }
 
  return errorCode;
}
 
/*
  Makes a full copy of the stack.
  Both handles must be valid.
 
  Return value:
    on success returns 'stack_no_error', or:
     - 'stack_error_invalid_handle' : if an invalid handle was supplied
     - 'stack_error_invalid_argument' : if 'elementAddress' is NULL
     - 'stack_error_mem_alloc' : if function could not allocate memory for anything
     - 'stack_error_empty_stack' : if source stack is empty
*/
int StackCopy(STACK_HANDLE hDestinationStack, STACK_HANDLE hSourceStack)
{
  int errorCode = stack_no_error;
 
  void* tempPtr = NULL;
 
  do
  {
    if ((hDestinationStack == NULL) || (hSourceStack == NULL))
    {
      errorCode = stack_error_invalid_handle;
      break;
    }
 
    if ((hDestinationStack->elementSize != hSourceStack->elementSize) ||
        !IsStackEmpty(hDestinationStack))
    {
      errorCode = stack_error_invalid_argument;
      break;
    }
 
    if (IsStackEmpty(hSourceStack))
    {
      errorCode = stack_error_empty_stack;
      break;
    }
 
    if (hDestinationStack->allocatedLength != hSourceStack->allocatedLength)
    {
      /* changing size of dest to match source */
      tempPtr = realloc(hDestinationStack->elements, hSourceStack->stackLength * hSourceStack->elementSize);
      if (tempPtr == NULL)
      {
        errorCode = stack_error_mem_alloc;
        break;
      }
 
      hDestinationStack->elements = tempPtr;
      tempPtr = NULL;
    }
 
    hDestinationStack->allocatedLength = hSourceStack->allocatedLength;
    hDestinationStack->stackLength = hSourceStack->stackLength;
    memcpy(hDestinationStack->elements, hSourceStack->elements, hSourceStack->stackLength * hSourceStack->elementSize);
  }
  while (0);
 
  return errorCode;
}

#include <stdio.h>
 
#include "stack.h"
 
int main(void)
{
  STACK_HANDLE stack1;
  STACK_HANDLE stack2;
 
  int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
 
  int i = 0;
 
  StackCreate(&stack1, sizeof(int));
  StackCreate(&stack2, sizeof(int));  
  
  for (i = 0; i < sizeof(a) / sizeof(*a); i++) StackPush(stack1, &a[i]);
  
  StackCopy(stack2, stack1);
 
  for (i = 0; i < sizeof(a) / sizeof(*a); i++) StackPop(stack2, &a[i]);
 
  for (i = 0; i < sizeof(a) / sizeof(*a); i++) printf("%d ", a[i]);
  
  StackDelete(&stack1);
  StackDelete(&stack2);
 
  return 0;
}