지나간 삶

#include <stdio.h>
#include <time.h>
#include <windows.h>
struct task_struct
{
    int pid;
    struct task_struct *pidhash_next;
    struct task_struct **pidhash_pprev;
};

#define PIDHASH_SZ  16
#define pid_hashfn(x)   ((((x) >> 8) ^ (x)) & (PIDHASH_SZ - 1))

struct task_struct *pidhash[PIDHASH_SZ];


void hash_pid(struct task_struct *p)
{
    struct task_struct **htable = &pidhash[pid_hashfn(p->pid)]; if((p->pidhash_next = *htable) != NULL)
        (*htable)->pidhash_pprev = &p->pidhash_next;
    *htable = p;
    p->pidhash_pprev = htable;
}

void unhash_pid(struct task_struct *p)
{
    if(p->pidhash_next)
        p->pidhash_next->pidhash_pprev = p->pidhash_pprev;
    *p->pidhash_pprev = p->pidhash_next;
}


struct task_struct *find_task_by_pid(int pid)
{
    struct task_struct *p, **htable = &pidhash[pid_hashfn(pid)];

    for(p = *htable; p && p->pid != pid; p = p->pidhash_next)
        ;

    return p;
}

void display()
{
    int i;
    struct task_struct *p;

    system("cls");                                          
    for(i =0 ; i < PIDHASH_SZ; i++ )
    {
        printf("[%2d]", i);
        for(p = pidhash[i]; p; p = p->pidhash_next)
            printf("<->[%4d]", p->pid);
        printf("\n");
    }
}

int main()
{

    int temp,i;
    struct task_struct *task;
    srand((unsigned int)time(0));
    display();
    for(i=0; i<30; i++ )
    {
        getchar();
        while( temp = rand())
        {
            if( !find_task_by_pid( temp ))
                break;
        }
        task = (struct task_struct*)malloc(sizeof(struct task_struct));
        task->pid = temp;
        hash_pid( task);
        display();
    }
}

#include <stdio.h>

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

typedef struct
{
    int count;
    int pid;
    struct list_head list;
} TASK;

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);
}

#define  list_entry( temp, type, list ) \
    ((type *)( (char*)temp - (unsigned long)(&((type *)0)->list)))

#define list_for_each(pos, head) \
    for (pos = (head)->next; pos != (head); pos = pos->next )

#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)

int main()
{
    struct list_head *temp;
    LIST_HEAD(head);

    TASK  t1 = { 1, 1000, 0, 0 };
    TASK  t2 = { 2, 2000, 0, 0 };
    TASK *p;

    list_add ( &t1.list, &head );
    list_add ( &t2.list, &head );

    printf("[head]");
    list_for_each( temp, &head )
    {
        p = list_entry( temp, TASK, list );
        printf("->[%4d, %4d]",p->count, p->pid);
    }
    printf("\n");
    return 0;
}