顺序栈的进栈、出栈操作

/*****************************************************
copyright (C), 2014-2015, Lighting Studio. Co.,     Ltd. 
File name：
Author：Jerey_Jobs    Version:0.1    Date: 
Description：顺序栈
Funcion List: 
*****************************************************/

#include <stdio.h>
#include <stdlib.h>

#define MAX 10

struct stack_data
{
    int stack[MAX];
    int top;
};

typedef struct stack_data Stack;

enum return_result {FULL_OK,FULL_NO,EMPTY_OK,EMPTY_NO,PUSH_OK,PUSH_NO,POP_NO = 0xefffffff};

void create_stack(Stack ** stack)
{
    *stack = (Stack *)malloc(sizeof(Stack));
    if((*stack)==NULL)
    {
        printf("malloc error!\n");
        exit(-1);
    }
}

void init_stack(Stack ** stack)
{
    (*stack)->top = -1;
}

int is_full(Stack ** stack)
{
    if((*stack)->top == MAX)
    {
        return FULL_OK;
    }
    else
    {
        return FULL_NO;
    }
}

int push_stack(Stack ** stack,int num)
{
    if(is_full(stack) == FULL_OK)
    {
        printf("the stack is full!\n");
        return PUSH_NO;
    }
    ((*stack)->top)++;
    ((*stack)->stack[(*stack)->top])=num;
    return PUSH_OK;
}

int is_empty(Stack ** stack)
{
    if((*stack)->top == -1)
    {
        return EMPTY_OK;
    }
    else
    {
        return EMPTY_NO;
    }
}

int pop_stack(Stack ** stack)
{
    if(is_empty(stack) == EMPTY_OK)
    {
        printf("the stack is empty!\n");
        return POP_NO;
    }
    return ((*stack)->stack[((*stack)->top)--]);
    ((*stack)->top)--;
}

int main()
{
    Stack *stack;
    int i;
    int ret;

    create_stack(&stack);

    init_stack(&stack);

    for(i = 0; i < 10; i++)
    {
        if((push_stack(&stack, i + 1))== PUSH_OK)
        {
            printf("push ok!\n");
        }
    }

    for(i = 0; i < MAX; i++)
    {
        ret = pop_stack(&stack);
        if(ret == POP_NO)
        {
            break;
        }
        printf("stack[%d]=%d\n",i,ret);
    }

    return 0;
}