How to split a linked-list into two lists

I'm writing a code to split a circular linked-list to two linked lists with equal number of codes, following is my code:

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

typedef struct node *ptr;
struct node {
    int element;
    ptr prev;
    ptr next;
};
typedef ptr list;
typedef ptr position;

int main() {
    list L=malloc(sizeof(struct node));
    list first=malloc(sizeof(struct node));
    list second=malloc(sizeof(struct node));
    splitlist(L,first,second);
    return 0;
}

void splitlist(list L, list first,list second) {
    position p,temp;
    p=malloc(sizeof(struct node));
    temp=malloc(sizeof(struct node));
    p=L;
    int count=0;

    while ((p)->next != L) {
        count++;
    }

    int c=count;
    while (c!=(count/2)-1) {
        p=(p)->next;
       temp=(p)->next;
    }

    first=L;
    (p)->next=NULL;
    second=temp;

    c=count;
    while (c!=(count/2)-1) {
       temp=(temp)->next;
    }
    (temp)->next=NULL;
}

When compiling my code it gives no errors but I'm not sure if it's working properly.