blob: be310e3ca878fce24370d3b4a2b9347acfb05181 [file] [log] [blame]
/*
*
* Copyright (C) 2009 Mindspeed Technologies, Inc.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef __LIST_H
#define __LIST_H
#include <assert.h>
struct list_head {
struct list_head *prev;
struct list_head *next;
};
static inline void list_head_init(struct list_head *head)
{
head->prev = head;
head->next = head;
}
static inline void list_add(struct list_head *head, struct list_head *entry)
{
assert((!entry->next) && (!entry->prev));
entry->next = head->next;
entry->next->prev = entry;
head->next = entry;
entry->prev = head;
}
static inline void list_del(struct list_head *entry)
{
entry->prev->next = entry->next;
entry->next->prev = entry->prev;
entry->prev = NULL;
entry->next = NULL;
}
#define list_empty(head) ((head)->next == (head))
#define offset_of(type, member) ((unsigned long)&(((type *)0)->member))
#define container_of(entry, type, member) ((type *)((unsigned char *)(entry) - offset_of(type, member)))
#define list_first(head) ((head)->next)
#define list_last(head) ((head)->prev)
#define list_next(entry) ((entry)->next)
#endif