linux-2.6.33/__list_add() の履歴(No.1)

• 履歴一覧
• 差分 を表示
• 現在との差分 を表示
• ソース を表示
• linux-2.6.33/__list_add() へ行く。
  • 1 (2013-09-26 (木) 14:35:27)

参照元†

• linux-2.6.33/list_add()

説明†

• パス:
  • CONFIG_DEBUG_LIST が無効のとき: linux-2.6.33/include/linux/list.h
  • CONFIG_DEBUG_LIST が有効のとき: linux-2.6.33/lib/list_debug.c

• FIXME: これは何？
  • 説明

引数†

• struct list_head *new
  • linux-2.6.33/list_head struct list_head *prev struct list_head *next

返り値†

• なし

参考†

実装†

CONFIG_DEBUG_LIST が有効のとき（include/linux/list.h）†

/*
 * Insert a new entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
#ifndef CONFIG_DEBUG_LIST

• • linux-2.6.33/CONFIG_DEBUG_LIST

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;
}
#else
extern void __list_add(struct list_head *new,
			      struct list_head *prev,
			      struct list_head *next);
#endif

CONFIG_DEBUG_LIST が無効のとき（lib/list_debug.c）†

/*
 * Insert a new entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */

void __list_add(struct list_head *new,
			      struct list_head *prev,
			      struct list_head *next)
{
	WARN(next->prev != prev,
		"list_add corruption. next->prev should be "
		"prev (%p), but was %p. (next=%p).\n",
		prev, next->prev, next);
	WARN(prev->next != next,
		"list_add corruption. prev->next should be "
		"next (%p), but was %p. (prev=%p).\n",
		next, prev->next, prev);

• • linux-2.6.33/WARN()

	next->prev = new;
	new->next = next;
	new->prev = prev;
	prev->next = new;
}
EXPORT_SYMBOL(__list_add);

• モジュールのライセンスに関係なくシンボルを公開する。
  • linux-2.6.33/EXPORT_SYMBOL()

コメント†