⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 list.h

📁 SkyEye是一个可以运行嵌入式操作系统的硬件仿真工具
💻 H
字号:
/* This program is free software; you can redistribute it and/or modifyit under the terms of the GNU General Public License as published bythe Free Software Foundation; either version 2, 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 ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See theGNU General Public License for more details.You should have received a copy of the GNU General Public License alongwith 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_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)#define list_for_each_safe(pos, n, head) \	for (pos = (head)->next, n = pos->next; pos != (head); \		pos = n, n = pos->next)#define list_entry(ptr, type, member) \	((type *)((char *)(ptr)-(unsigned int)(&((type *)0)->member)))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__ voidlist_add_tail (struct list_head *new, struct list_head *head){	__list_add (new, head->prev, head);}static __inline__ void__list_del (struct list_head *prev, struct list_head *next){	next->prev = prev;	prev->next = next;}static __inline__ voidlist_del_init (struct list_head *entry){	__list_del (entry->prev, entry->next);	INIT_LIST_HEAD (entry);}static __inline__ intlist_empty (struct list_head *head){	return head->next == head;}#endif //_LIST_H_

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -