'); }
'); }
www.elayer.co.kr 자료실의 2번 자료를 보시오
#include <stdio.h>
#define Function list_entry
#define list_entry(ptr, type, member) \
((type *)((char *)(ptr) - (unsigned long)(&((type *)0)->member)))
typedef struct _sData
{
char str[12];
int num[3];
char index;
short int snum[3];
} sData;
void main()
{
sData *pm, m = {"Arminia", {100, 200, 300}, 'A', {10, 20, 30}};
printf("&m : [%x]\n", &m);
printf("[%x]\t[%x]\n[%x]\t[%x]\n\n", &m.str, &m.num, &m.index, &m.snum);
pm = Function(&m.index, sData, index);
printf("[%s]\t[%d]\t[%d]\n\n", pm->str, pm->num[2], pm->snum[1]);
printf("&m : [%x]\n", Function(&m.str, sData, str));
printf("&m : [%x]\n", Function(&m.num, sData, num));
printf("&m : [%x]\n", Function(&m.index, sData, index));
printf("&m : [%x]\n\n", Function(&m.snum, sData, snum));
}
공유받은 코드 :
list.c
#define __KERNEL__
#define prefetch(x) 1
#define inline
#include <stdio.h>
#include <stdlib.h>
#include "list.h"
struct t_struct
{
struct list_head list ;
int val ;
} ;
#define T_SIZE (sizeof(struct t_struct))
struct t_struct *gg ;
void init_t(void)
{
if((gg=malloc(T_SIZE)) == NULL)
printf("[ Error ]\n") ;
INIT_LIST_HEAD(&gg->list) ;
}
void print_all(void)
{
struct list_head *temp ;
printf("------------\n") ;
list_for_each(temp, &gg->list) {
struct t_struct *k = list_entry(temp, struct t_struct, list) ;
printf("[ K = %d ]\n", k->val) ;
}
}
#define typeof(x) struct t_struct
void print_all2(void)
{
struct t_struct *temp ;
printf("------------\n") ;
list_for_each_entry(temp, &gg->list, list) {
printf("[ K = %d ]\n", temp->val) ;
}
}
void main()
{
struct t_struct *a, *b ;
if((a = malloc(T_SIZE)) == NULL)
printf("[ Error ]\n") ;
if((b = malloc(T_SIZE)) == NULL)
printf("[ Error ]\n") ;
init_t() ;
a->val = 111 ; b->val = 222 ;
print_all() ;
if(list_empty(&gg->list))
printf("[ Empty ]\n") ;
list_add(&a->list, &gg->list) ;
print_all() ;
list_add(&b->list, &gg->list) ;
print_all() ;
list_del(&b->list) ;
print_all() ;
free(a) ;
free(b) ;
free(gg) ;
}
list.h
#ifndef _LINUX_LIST_H
#define _LINUX_LIST_H
#if defined(__KERNEL__) || defined(_LVM_H_INCLUDE)
// #include <linux/prefetch.h>
/*
* Simple doubly linked list implementation.
*
* Some of the internal functions ("__xxx") are useful when
* manipulating whole lists rather than single entries, as
* sometimes we already know the next/prev entries and we can
* generate better code by using them directly rather than
* using the generic single-entry routines.
*/
struct list_head
{
struct list_head *next, *prev;
};
#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)
#define INIT_LIST_HEAD(ptr) do { \
(ptr)->next = (ptr); (ptr)->prev = (ptr); \
} while (0)
/*
* Insert a new entry between two known consecutive entries.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static inline 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;
}
static inline void list_add(struct list_head *new, struct list_head *head)
{
__list_add(new, head, head->next);
}
/*
* list_add_tail - add a new entry
* @new: new entry to be added
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
__list_add(new, head->prev, head);
}
/*
* Delete a list entry by making the prev/next entries
* point to each other.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static inline void __list_del(struct list_head *prev, struct list_head *next)
{
next->prev = prev;
prev->next = next;
}
/**
* list_del - deletes entry from list.
* @entry: the element to delete from the list.
* Note: list_empty on entry does not return true after this, the entry is in an undefined state.
*/
static inline void list_del(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
entry->next = (void *) 0;
entry->prev = (void *) 0;
}
/**
* list_del_init - deletes entry from list and reinitialize it.
* @entry: the element to delete from the list.
*/
static inline void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
INIT_LIST_HEAD(entry);
}
/**
* list_move - delete from one list and add as another's head
* @list: the entry to move
* @head: the head that will precede our entry
*/
static inline void list_move(struct list_head *list, struct list_head *head)
{
__list_del(list->prev, list->next);
list_add(list, head);
}
/**
* list_move_tail - delete from one list and add as another's tail
* @list: the entry to move
* @head: the head that will follow our entry
*/
static inline void list_move_tail(struct list_head *list,
struct list_head *head)
{
__list_del(list->prev, list->next);
list_add_tail(list, head);
}
/**
* list_empty - tests whether a list is empty
* @head: the list to test.
*/
static inline int list_empty(struct list_head *head)
{
return head->next == head;
}
static inline void __list_splice(struct list_head *list,
struct list_head *head)
{
struct list_head *first = list->next;
struct list_head *last = list->prev;
struct list_head *at = head->next;
first->prev = head;
head->next = first;
last->next = at;
at->prev = last;
}
/**
* list_splice - join two lists
* @list: the new list to add.
* @head: the place to add it in the first list.
*/
static inline void list_splice(struct list_head *list, struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head);
}
/**
* list_splice_init - join two lists and reinitialise the emptied list.
* @list: the new list to add.
* @head: the place to add it in the first list.
*
* The list at @list is reinitialised
*/
static inline void list_splice_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head);
INIT_LIST_HEAD(list);
}
}
/**
* list_entry - get the struct for this entry
* @ptr: the &struct list_head pointer.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*/
#define list_entry(ptr, type, member) \
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
/**
* list_for_each - iterate over a list
* @pos: the &struct list_head to use as a loop counter.
* @head: the head for your list.
*/
#define list_for_each(pos, head) \
for (pos = (head)->next, prefetch(pos->next); pos != (head); \
pos = pos->next, prefetch(pos->next))
/**
* list_for_each_prev - iterate over a list backwards
* @pos: the &struct list_head to use as a loop counter.
* @head: the head for your list.
*/
#define list_for_each_prev(pos, head) \
for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
pos = pos->prev, prefetch(pos->prev))
/**
* list_for_each_safe
* iterate over a list safe against removal of list entry
* @pos: the &struct list_head to use as a loop counter.
* @n: another &struct list_head to use as temporary storage
* @head: the head for your list.
*/
#define list_for_each_safe(pos, n, head) \
for (pos = (head)->next, n = pos->next; pos != (head); \
pos = n, n = pos->next)
/**
* list_for_each_entry
* iterate over list of given type
* @pos: the type * to use as a loop counter.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry(pos, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member), \
prefetch(pos->member.next); \
&pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member), \
prefetch(pos->member.next))
#endif /* __KERNEL__ || _LVM_H_INCLUDE */
#endif
'Tech & IT > 프로그래밍' 카테고리의 다른 글
| 관리자 권한으로 실행되는 프로그램 만들기 (0) | 2010.01.12 |
|---|---|
| HAL 뼈대가 Test 코드 및 예제 (0) | 2009.12.11 |
| Deassembly 로 asm코드 확인하는 방법 (0) | 2009.12.10 |
| operator = 을 재구현할 때 참조형 반환타입을 선언할 후 있는 이유 (0) | 2009.12.10 |
| C++과 C가 섞여있을 경우 C 함수를 위해 extern "C" 사용 (0) | 2009.12.10 |