tag | line | file | source code |
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 | 74 | drivers/char/vt.c | extern int con_set_unimap(ushort ct, struct unipair *list); |
list | 75 | drivers/char/vt.c | extern int con_get_unimap(ushort ct, ushort *uct, struct unipair *list); |
list | 1038 | drivers/char/vt.c | struct unipair *list; |
list | 1046 | drivers/char/vt.c | list = get_user(&ud->entries); |
list | 1047 | drivers/char/vt.c | i = verify_area(VERIFY_READ, (void *) list, |
list | 1052 | drivers/char/vt.c | return con_set_unimap(ct, list); |
list | 1058 | drivers/char/vt.c | struct unipair *list; |
list | 1064 | drivers/char/vt.c | list = get_user(&ud->entries); |
list | 1066 | drivers/char/vt.c | i = verify_area(VERIFY_WRITE, (void *) list, |
list | 1071 | 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 | 109 | include/linux/skbuff.h | extern void skb_queue_head_init(struct sk_buff_head *list); |
list | 110 | include/linux/skbuff.h | extern void skb_queue_head(struct sk_buff_head *list,struct sk_buff *buf); |
list | 111 | include/linux/skbuff.h | extern void skb_queue_tail(struct sk_buff_head *list,struct sk_buff *buf); |
list | 112 | include/linux/skbuff.h | extern struct sk_buff * skb_dequeue(struct sk_buff_head *list); |
list | 116 | include/linux/skbuff.h | extern struct sk_buff * skb_peek_copy(struct sk_buff_head *list); |
list | 132 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 133 | include/linux/skbuff.h | return (list->next != list)? list->next : NULL; |
list | 144 | include/linux/skbuff.h | extern __inline__ void skb_queue_head_init(struct sk_buff_head *list) |
list | 146 | include/linux/skbuff.h | list->prev = (struct sk_buff *)list; |
list | 147 | include/linux/skbuff.h | list->next = (struct sk_buff *)list; |
list | 157 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 161 | include/linux/skbuff.h | newsk->next = list->next; |
list | 162 | include/linux/skbuff.h | newsk->prev = list; |
list | 175 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 180 | include/linux/skbuff.h | newsk->next = list; |
list | 181 | include/linux/skbuff.h | newsk->prev = list->prev; |
list | 200 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 205 | include/linux/skbuff.h | result = list->next; |
list | 206 | include/linux/skbuff.h | if (result == list) |
list | 213 | include/linux/skbuff.h | result->next->prev = list; |
list | 214 | 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_ptr(list,&tq_last); |
list | 403 | net/appletalk/aarp.c | static struct aarp_entry *aarp_find_entry(struct aarp_entry *list, struct device *dev, struct at_addr *sat) |
list | 408 | net/appletalk/aarp.c | while(list) |
list | 410 | net/appletalk/aarp.c | if(list->target_addr.s_net==sat->s_net && |
list | 411 | net/appletalk/aarp.c | list->target_addr.s_node==sat->s_node && list->dev==dev) |
list | 413 | net/appletalk/aarp.c | list=list->next; |
list | 416 | net/appletalk/aarp.c | return list; |
list | 531 | net/appletalk/aarp.c | static void aarp_resolved(struct aarp_entry **list, struct aarp_entry *a, int hash) |
list | 534 | net/appletalk/aarp.c | while(*list!=NULL) |
list | 536 | net/appletalk/aarp.c | if(*list==a) |
list | 539 | net/appletalk/aarp.c | *list=a->next; |
list | 555 | net/appletalk/aarp.c | list=&((*list)->next); |
list | 155 | net/core/skbuff.c | void skb_queue_head_init(struct sk_buff_head *list) |
list | 157 | net/core/skbuff.c | list->prev = (struct sk_buff *)list; |
list | 158 | net/core/skbuff.c | list->next = (struct sk_buff *)list; |
list | 159 | net/core/skbuff.c | list->magic_debug_cookie = SK_HEAD_SKB; |
list | 169 | net/core/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 175 | net/core/skbuff.c | IS_SKB_HEAD(list); |
list | 179 | net/core/skbuff.c | newsk->next = list->next; |
list | 180 | net/core/skbuff.c | newsk->prev = list; |
list | 194 | net/core/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 202 | net/core/skbuff.c | IS_SKB_HEAD(list); |
list | 204 | net/core/skbuff.c | newsk->next = list; |
list | 205 | net/core/skbuff.c | newsk->prev = list->prev; |
list | 222 | net/core/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 227 | net/core/skbuff.c | IS_SKB_HEAD(list); |
list | 229 | net/core/skbuff.c | result = list->next; |
list | 230 | net/core/skbuff.c | if (result == list) { |
list | 235 | net/core/skbuff.c | result->next->prev = list; |
list | 236 | net/core/skbuff.c | list->next = result->next; |