tag	line	file	source code
list	210	drivers/block/triton.c	const char **list;
list	226	drivers/block/triton.c	list = good_dma_drives;
list	227	drivers/block/triton.c	while (*list) {
list	228	drivers/block/triton.c	if (!strcmp(*list++,id->model)) {
list	326	drivers/char/consolemap.c	con_set_unimap(ushort ct, struct unipair *list){
list	334	drivers/char/consolemap.c	u = get_user(&list->unicode);
list	347	drivers/char/consolemap.c	hashtable[i].fontpos = get_user(&list->fontpos);
list	348	drivers/char/consolemap.c	list++;
list	359	drivers/char/consolemap.c	con_get_unimap(ushort ct, ushort *uct, struct unipair *list){
list	367	drivers/char/consolemap.c	put_user(hashtable[i].unicode, &list->unicode);
list	368	drivers/char/consolemap.c	put_user(hashtable[i].fontpos, &list->fontpos);
list	369	drivers/char/consolemap.c	list++;
list	72	drivers/char/vt.c	extern int con_set_unimap(ushort ct, struct unipair *list);
list	73	drivers/char/vt.c	extern int con_get_unimap(ushort ct, ushort *uct, struct unipair *list);
list	1036	drivers/char/vt.c	struct unipair *list;
list	1044	drivers/char/vt.c	list = get_user(&ud->entries);
list	1045	drivers/char/vt.c	i = verify_area(VERIFY_READ, (void *) list,
list	1050	drivers/char/vt.c	return con_set_unimap(ct, list);
list	1056	drivers/char/vt.c	struct unipair *list;
list	1062	drivers/char/vt.c	list = get_user(&ud->entries);
list	1064	drivers/char/vt.c	i = verify_area(VERIFY_WRITE, (void *) list,
list	1069	drivers/char/vt.c	return con_get_unimap(ct, &(ud->entry_ct), list);
list	29	include/linux/notifier.h	extern __inline__ int notifier_chain_register(struct notifier_block **list, struct notifier_block *n)
list	31	include/linux/notifier.h	while(*list)
list	33	include/linux/notifier.h	if(n->priority > (*list)->priority)
list	35	include/linux/notifier.h	list= &((*list)->next);
list	37	include/linux/notifier.h	n->next = *list;
list	38	include/linux/notifier.h	*list=n;
list	118	include/linux/skbuff.h	extern void      skb_queue_head_init(struct sk_buff_head *list);
list	119	include/linux/skbuff.h	extern void      skb_queue_head(struct sk_buff_head *list,struct sk_buff *buf);
list	120	include/linux/skbuff.h	extern void      skb_queue_tail(struct sk_buff_head *list,struct sk_buff *buf);
list	121	include/linux/skbuff.h	extern struct sk_buff *    skb_dequeue(struct sk_buff_head *list);
list	125	include/linux/skbuff.h	extern struct sk_buff *    skb_peek_copy(struct sk_buff_head *list);
list	150	include/linux/skbuff.h	struct sk_buff *list = (struct sk_buff *)list_;
list	151	include/linux/skbuff.h	return (list->next != list)? list->next : NULL;
list	162	include/linux/skbuff.h	extern __inline__ void skb_queue_head_init(struct sk_buff_head *list)
list	164	include/linux/skbuff.h	list->prev = (struct sk_buff *)list;
list	165	include/linux/skbuff.h	list->next = (struct sk_buff *)list;
list	175	include/linux/skbuff.h	struct sk_buff *list = (struct sk_buff *)list_;
list	179	include/linux/skbuff.h	newsk->next = list->next;
list	180	include/linux/skbuff.h	newsk->prev = list;
list	193	include/linux/skbuff.h	struct sk_buff *list = (struct sk_buff *)list_;
list	198	include/linux/skbuff.h	newsk->next = list;
list	199	include/linux/skbuff.h	newsk->prev = list->prev;
list	218	include/linux/skbuff.h	struct sk_buff *list = (struct sk_buff *)list_;
list	223	include/linux/skbuff.h	result = list->next;
list	224	include/linux/skbuff.h	if (result == list)
list	231	include/linux/skbuff.h	result->next->prev = list;
list	232	include/linux/skbuff.h	list->next = result->next;
list	138	include/linux/tqueue.h	_INLINE_ void run_task_queue(task_queue *list)
list	146	include/linux/tqueue.h	p = xchg(list,&tq_last);
list	408	net/appletalk/aarp.c	static struct aarp_entry *aarp_find_entry(struct aarp_entry *list, struct device *dev, struct at_addr *sat)
list	413	net/appletalk/aarp.c	while(list)
list	415	net/appletalk/aarp.c	if(list->target_addr.s_net==sat->s_net &&
list	416	net/appletalk/aarp.c	list->target_addr.s_node==sat->s_node && list->dev==dev)
list	418	net/appletalk/aarp.c	list=list->next;
list	421	net/appletalk/aarp.c	return list;
list	536	net/appletalk/aarp.c	static void aarp_resolved(struct aarp_entry **list, struct aarp_entry *a, int hash)
list	539	net/appletalk/aarp.c	while(*list!=NULL)
list	541	net/appletalk/aarp.c	if(*list==a)
list	544	net/appletalk/aarp.c	*list=a->next;
list	560	net/appletalk/aarp.c	list=&((*list)->next);
list	183	net/core/skbuff.c	void skb_queue_head_init(struct sk_buff_head *list)
list	185	net/core/skbuff.c	list->prev = (struct sk_buff *)list;
list	186	net/core/skbuff.c	list->next = (struct sk_buff *)list;
list	187	net/core/skbuff.c	list->magic_debug_cookie = SK_HEAD_SKB;
list	197	net/core/skbuff.c	struct sk_buff *list = (struct sk_buff *)list_;
list	203	net/core/skbuff.c	IS_SKB_HEAD(list);
list	207	net/core/skbuff.c	newsk->next = list->next;
list	208	net/core/skbuff.c	newsk->prev = list;
list	222	net/core/skbuff.c	struct sk_buff *list = (struct sk_buff *)list_;
list	230	net/core/skbuff.c	IS_SKB_HEAD(list);
list	232	net/core/skbuff.c	newsk->next = list;
list	233	net/core/skbuff.c	newsk->prev = list->prev;
list	250	net/core/skbuff.c	struct sk_buff *list = (struct sk_buff *)list_;
list	255	net/core/skbuff.c	IS_SKB_HEAD(list);
list	257	net/core/skbuff.c	result = list->next;
list	258	net/core/skbuff.c	if (result == list) {
list	263	net/core/skbuff.c	result->next->prev = list;
list	264	net/core/skbuff.c	list->next = result->next;