tag | line | file | source code |
list | 220 | drivers/char/consolemap.c | con_set_unimap(ushort ct, struct unipair *list){ |
list | 228 | drivers/char/consolemap.c | u = get_fs_word(&list->unicode); |
list | 241 | drivers/char/consolemap.c | hashtable[i].fontpos = get_fs_word(&list->fontpos); |
list | 242 | drivers/char/consolemap.c | list++; |
list | 249 | drivers/char/consolemap.c | con_get_unimap(ushort ct, ushort *uct, struct unipair *list){ |
list | 257 | drivers/char/consolemap.c | put_fs_word(hashtable[i].unicode, &list->unicode); |
list | 258 | drivers/char/consolemap.c | put_fs_word(hashtable[i].fontpos, &list->fontpos); |
list | 259 | drivers/char/consolemap.c | list++; |
list | 69 | drivers/char/vt.c | extern int con_set_unimap(ushort ct, struct unipair *list); |
list | 70 | drivers/char/vt.c | extern int con_get_unimap(ushort ct, ushort *uct, struct unipair *list); |
list | 864 | drivers/char/vt.c | struct unipair *list; |
list | 872 | drivers/char/vt.c | list = (struct unipair *) get_fs_long(&ud->entries); |
list | 873 | drivers/char/vt.c | i = verify_area(VERIFY_READ, (void *) list, |
list | 878 | drivers/char/vt.c | return con_set_unimap(ct, list); |
list | 884 | drivers/char/vt.c | struct unipair *list; |
list | 890 | drivers/char/vt.c | list = (struct unipair *) get_fs_long(&ud->entries); |
list | 892 | drivers/char/vt.c | i = verify_area(VERIFY_WRITE, (void *) list, |
list | 897 | 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 | 106 | include/linux/skbuff.h | extern void skb_queue_head_init(struct sk_buff_head *list); |
list | 107 | include/linux/skbuff.h | extern void skb_queue_head(struct sk_buff_head *list,struct sk_buff *buf); |
list | 108 | include/linux/skbuff.h | extern void skb_queue_tail(struct sk_buff_head *list,struct sk_buff *buf); |
list | 109 | include/linux/skbuff.h | extern struct sk_buff * skb_dequeue(struct sk_buff_head *list); |
list | 113 | include/linux/skbuff.h | extern struct sk_buff * skb_peek_copy(struct sk_buff_head *list); |
list | 129 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 130 | include/linux/skbuff.h | return (list->next != list)? list->next : NULL; |
list | 141 | include/linux/skbuff.h | extern __inline__ void skb_queue_head_init(struct sk_buff_head *list) |
list | 143 | include/linux/skbuff.h | list->prev = (struct sk_buff *)list; |
list | 144 | include/linux/skbuff.h | list->next = (struct sk_buff *)list; |
list | 154 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 158 | include/linux/skbuff.h | newsk->next = list->next; |
list | 159 | include/linux/skbuff.h | newsk->prev = list; |
list | 172 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 177 | include/linux/skbuff.h | newsk->next = list; |
list | 178 | include/linux/skbuff.h | newsk->prev = list->prev; |
list | 195 | include/linux/skbuff.h | struct sk_buff *list = (struct sk_buff *)list_; |
list | 200 | include/linux/skbuff.h | result = list->next; |
list | 201 | include/linux/skbuff.h | if (result == list) { |
list | 206 | include/linux/skbuff.h | result->next->prev = list; |
list | 207 | 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 | 773 | mm/swap.c | unsigned long list = 0; |
list | 784 | mm/swap.c | *(unsigned long *) result = list; |
list | 785 | mm/swap.c | list = result; |
list | 787 | mm/swap.c | while (list) { |
list | 788 | mm/swap.c | unsigned long tmp = list; |
list | 789 | mm/swap.c | list = *(unsigned long *) list; |
list | 154 | net/inet/skbuff.c | void skb_queue_head_init(struct sk_buff_head *list) |
list | 156 | net/inet/skbuff.c | list->prev = (struct sk_buff *)list; |
list | 157 | net/inet/skbuff.c | list->next = (struct sk_buff *)list; |
list | 158 | net/inet/skbuff.c | list->magic_debug_cookie = SK_HEAD_SKB; |
list | 168 | net/inet/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 174 | net/inet/skbuff.c | IS_SKB_HEAD(list); |
list | 178 | net/inet/skbuff.c | newsk->next = list->next; |
list | 179 | net/inet/skbuff.c | newsk->prev = list; |
list | 193 | net/inet/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 201 | net/inet/skbuff.c | IS_SKB_HEAD(list); |
list | 203 | net/inet/skbuff.c | newsk->next = list; |
list | 204 | net/inet/skbuff.c | newsk->prev = list->prev; |
list | 221 | net/inet/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 226 | net/inet/skbuff.c | IS_SKB_HEAD(list); |
list | 228 | net/inet/skbuff.c | result = list->next; |
list | 229 | net/inet/skbuff.c | if (result == list) { |
list | 234 | net/inet/skbuff.c | result->next->prev = list; |
list | 235 | net/inet/skbuff.c | list->next = result->next; |