Stack Using Doubly

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int id;
    struct node *next,*prev;
}*start=NULL,*end=NULL,*current;
int co=0,i;
void cre()
{
    struct node *n;
    if(start==NULL)
    {
        printf("\nEnter Value:");
        n=(struct node*)malloc(1*sizeof(struct node));
        n->next=NULL;
        n->prev=NULL;
        scanf("%d",&n->id);
        start=n;
        end=n;
        current=n;
        co++;
    }
    else
    {
        printf("\nEnter Value:");
        n=(struct node*)malloc(1*sizeof(struct node));
        n->next=NULL;
        n->prev=NULL;
        scanf("%d",&n->id);
        current->next=n;
        n->prev=current;
        end=n;
        current=n;
        co++;
    }
}
void del()
{
    if(co==1)
    {
        start=NULL;
        end=NULL;
        co=0;
    }
    if(start==NULL && end==NULL)
    {
        printf("\nStack is Empty.\n");
    }
    else
    {
        struct node *c;
        c=end;
        c=c->prev;
        end=c;
        co--;
    }
}
void dis()
{
    if(start==NULL && end==NULL)
    {
        printf("\nStack is Empty.\n");
    }
    else
    {
        struct node *c;
        c=end;
        while(c!=NULL)
        {
            printf("%d<--",c->id);
            c=c->prev;
        }
        printf("\n Front is %d\n",end->id);
    }
}

int main()
{
    int x;
    printf("Enter the value of Stack\n");
    scanf("%d",&i);
    while(1)
    {
        printf("1.Ins, 2.Del,3.Dis\n");
        scanf("%d",&x);
        switch(x)
        {
        case 1:
            {
                if(co==i)
                {
                    printf("Stack is Full.\n");
                    break;
                }
                else
                {
                    cre();
                    break;
                }
            }
        case 2:
            {
                del();
                break;
            }
        case 3:
            {
                dis();
                break;
            }
        }
    }
}