최신 매크로 분석 container_of

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

struct list_head {
	struct list_head* next, * prev;
};

void __list_add(struct list_head* new,
	struct list_head* prev,
	struct list_head* next)
{
	next->prev = new;
	new->next = next;
	new->prev = prev;
	prev->next = new;
}

void list_add(struct list_head* new,
	struct list_head* head)
{
	__list_add(new, head, head->next);
}

void list_add_tail(struct list_head* new, struct list_head* head)
{
	__list_add(new, head->prev, head);
}

#define offsetof(TYPE, MEMBER)	((size_t)&((TYPE *)0)->MEMBER)

#define container_of(ptr, type, member) ({			\
	const typeof( ((type *)0)->member ) *__mptr = (ptr);	\
	(type *)( (char *)__mptr - offsetof(type,member) );})

//-----------------------------------------

struct inode
{ 
	unsigned long       i_ino;
	struct list_head    i_wb_list;  /* backing dev IO list */
	struct list_head    i_lru;      /* inode LRU list */
	struct list_head    i_sb_list;
};

void display(struct list_head* head)
{
	struct list_head* temp;
	struct inode* p;
	system("clear");
	printf("[head]");
	for (temp = head->next; temp != head; temp = temp->next)
	{
		p = container_of(temp, struct inode, i_lru);
		printf("<->[%lu]", p->i_ino);
	}
	printf("<->[head]\n");
	getchar();
}

int main()
{
	struct list_head head = { &head,&head };
	struct inode inodes[2] = { {1000}, {2000} };
	int i;
	display(&head);
	for (i = 0; i < 2; i++)
	{
		list_add_tail(&inodes[i].i_lru, &head);
		display(&head);
	}
	return 0;
}

.. 쉽지 않군..