#include <stdio.h>
#include <stdlib.h>
 
typedef struct node {
	int data;
	struct node *previous, *next;
} m_p;
 
m_p *H = NULL;
 
void func(void){
	int i, nLists = 10;
	H = malloc(sizeof(m_p));
	H->next = NULL;
	H->previous = NULL;
	H->data = -99;
	m_p *p = H;
	for(i = 0; i < nLists; i++){
		m_p *n = malloc(sizeof(m_p));
		n->next = NULL;
		n->previous = p;
		n->data = i;
		p->next = n;
 
		p = p->next;
	}
 
	m_p *x = H;
	while(x != NULL){
		printf("%d ", x->data);
		x = x->next;
	}
}
 
int main(void){
	func();
	//Need free list
}

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCnR5cGVkZWYgc3RydWN0IG5vZGUgewoJaW50IGRhdGE7CglzdHJ1Y3Qgbm9kZSAqcHJldmlvdXMsICpuZXh0Owp9IG1fcDsKCm1fcCAqSCA9IE5VTEw7Cgp2b2lkIGZ1bmModm9pZCl7CglpbnQgaSwgbkxpc3RzID0gMTA7CglIID0gbWFsbG9jKHNpemVvZihtX3ApKTsKCUgtPm5leHQgPSBOVUxMOwoJSC0+cHJldmlvdXMgPSBOVUxMOwoJSC0+ZGF0YSA9IC05OTsKCW1fcCAqcCA9IEg7Cglmb3IoaSA9IDA7IGkgPCBuTGlzdHM7IGkrKyl7CgkJbV9wICpuID0gbWFsbG9jKHNpemVvZihtX3ApKTsKCQluLT5uZXh0ID0gTlVMTDsKCQluLT5wcmV2aW91cyA9IHA7CgkJbi0+ZGF0YSA9IGk7CgkJcC0+bmV4dCA9IG47CgoJCXAgPSBwLT5uZXh0OwoJfQoKCW1fcCAqeCA9IEg7Cgl3aGlsZSh4ICE9IE5VTEwpewoJCXByaW50ZigiJWQgIiwgeC0+ZGF0YSk7CgkJeCA9IHgtPm5leHQ7Cgl9Cn0KCmludCBtYWluKHZvaWQpewoJZnVuYygpOwoJLy9OZWVkIGZyZWUgbGlzdAp9