tag | line | file | source code |
list | 241 | drivers/block/triton.c | const char **list; |
list | 251 | drivers/block/triton.c | list = good_dma_drives; |
list | 252 | drivers/block/triton.c | while (*list) { |
list | 253 | drivers/block/triton.c | if (!strcmp(*list++,id->model)) { |
list | 371 | drivers/char/consolemap.c | con_set_unimap(ushort ct, struct unipair *list) |
list | 377 | drivers/char/consolemap.c | if ( (err1 = con_insert_unipair(get_user(&list->unicode), |
list | 378 | drivers/char/consolemap.c | get_user(&list->fontpos))) != 0 ) |
list | 380 | drivers/char/consolemap.c | list++; |
list | 414 | drivers/char/consolemap.c | con_get_unimap(ushort ct, ushort *uct, struct unipair *list){ |
list | 430 | drivers/char/consolemap.c | &list->unicode); |
list | 431 | drivers/char/consolemap.c | put_user((u_short) *p2, &list->fontpos); |
list | 432 | drivers/char/consolemap.c | list++; |
list | 56 | drivers/char/ftape/ftape-bsm.c | static byte list[BAD_SECTOR_MAP_SIZE]; |
list | 57 | drivers/char/ftape/ftape-bsm.c | unsigned long *src_ptr = (unsigned long *) list; |
list | 63 | drivers/char/ftape/ftape-bsm.c | memcpy(list, bad_sector_map, sizeof(list)); |
list | 65 | drivers/char/ftape/ftape-bsm.c | while ((byte *) src_ptr - list < sizeof(list)) { |
list | 75 | drivers/char/vt.c | extern int con_set_unimap(ushort ct, struct unipair *list); |
list | 76 | drivers/char/vt.c | extern int con_get_unimap(ushort ct, ushort *uct, struct unipair *list); |
list | 1088 | drivers/char/vt.c | struct unipair *list; |
list | 1096 | drivers/char/vt.c | list = get_user(&ud->entries); |
list | 1097 | drivers/char/vt.c | i = verify_area(VERIFY_READ, (void *) list, |
list | 1102 | drivers/char/vt.c | return con_set_unimap(ct, list); |
list | 1108 | drivers/char/vt.c | struct unipair *list; |
list | 1114 | drivers/char/vt.c | list = get_user(&ud->entries); |
list | 1116 | drivers/char/vt.c | i = verify_area(VERIFY_WRITE, (void *) list, |
list | 1121 | drivers/char/vt.c | return con_get_unimap(ct, &(ud->entry_ct), list); |
list | 6094 | drivers/scsi/53c7,8xx.c | Scsi_Cmnd *list = NULL, *tmp; |
list | 6105 | drivers/scsi/53c7,8xx.c | c->cmd->SCp.buffer = (struct scatterlist *) list; |
list | 6106 | drivers/scsi/53c7,8xx.c | list = c->cmd; |
list | 6129 | drivers/scsi/53c7,8xx.c | tmp->SCp.buffer = (struct scatterlist *) list; |
list | 6130 | drivers/scsi/53c7,8xx.c | list = tmp; |
list | 6136 | drivers/scsi/53c7,8xx.c | return 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 | 50 | include/linux/skbuff.h | struct sk_buff_head * list; /* List we are on */ |
list | 138 | include/linux/skbuff.h | extern void skb_queue_head_init(struct sk_buff_head *list); |
list | 139 | include/linux/skbuff.h | extern void skb_queue_head(struct sk_buff_head *list,struct sk_buff *buf); |
list | 140 | include/linux/skbuff.h | extern void skb_queue_tail(struct sk_buff_head *list,struct sk_buff *buf); |
list | 141 | include/linux/skbuff.h | extern struct sk_buff * skb_dequeue(struct sk_buff_head *list); |
list | 145 | include/linux/skbuff.h | extern __u32 skb_queue_len(struct sk_buff_head *list); |
list | 146 | include/linux/skbuff.h | extern struct sk_buff * skb_peek_copy(struct sk_buff_head *list); |
list | 164 | include/linux/skbuff.h | extern __inline__ int skb_queue_empty(struct sk_buff_head *list) |
list | 166 | include/linux/skbuff.h | return (list->next == (struct sk_buff *) list); |
list | 177 | include/linux/skbuff.h | struct sk_buff *list = ((struct sk_buff *)list_)->next; |
list | 178 | include/linux/skbuff.h | if (list == (struct sk_buff *)list_) |
list | 179 | include/linux/skbuff.h | list = NULL; |
list | 180 | include/linux/skbuff.h | return list; |
list | 200 | include/linux/skbuff.h | extern __inline__ void skb_queue_head_init(struct sk_buff_head *list) |
list | 202 | include/linux/skbuff.h | list->prev = (struct sk_buff *)list; |
list | 203 | include/linux/skbuff.h | list->next = (struct sk_buff *)list; |
list | 204 | include/linux/skbuff.h | list->qlen = 0; |
list | 214 | include/linux/skbuff.h | extern __inline__ void __skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk) |
list | 218 | include/linux/skbuff.h | newsk->list = list; |
list | 219 | include/linux/skbuff.h | list->qlen++; |
list | 220 | include/linux/skbuff.h | prev = (struct sk_buff *)list; |
list | 228 | include/linux/skbuff.h | extern __inline__ void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk) |
list | 234 | include/linux/skbuff.h | __skb_queue_head(list, newsk); |
list | 242 | include/linux/skbuff.h | extern __inline__ void __skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk) |
list | 246 | include/linux/skbuff.h | newsk->list = list; |
list | 247 | include/linux/skbuff.h | list->qlen++; |
list | 248 | include/linux/skbuff.h | next = (struct sk_buff *)list; |
list | 256 | include/linux/skbuff.h | extern __inline__ void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk) |
list | 262 | include/linux/skbuff.h | __skb_queue_tail(list, newsk); |
list | 270 | include/linux/skbuff.h | extern __inline__ struct sk_buff *__skb_dequeue(struct sk_buff_head *list) |
list | 274 | include/linux/skbuff.h | prev = (struct sk_buff *) list; |
list | 280 | include/linux/skbuff.h | list->qlen--; |
list | 285 | include/linux/skbuff.h | result->list = NULL; |
list | 290 | include/linux/skbuff.h | extern __inline__ struct sk_buff *skb_dequeue(struct sk_buff_head *list) |
list | 297 | include/linux/skbuff.h | result = __skb_dequeue(list); |
list | 307 | include/linux/skbuff.h | struct sk_buff_head * list) |
list | 315 | include/linux/skbuff.h | newsk->list = list; |
list | 316 | include/linux/skbuff.h | list->qlen++; |
list | 325 | include/linux/skbuff.h | __skb_insert(old, newsk, old->list); |
list | 334 | include/linux/skbuff.h | struct sk_buff_head * list) |
list | 342 | include/linux/skbuff.h | newsk->list = list; |
list | 343 | include/linux/skbuff.h | list->qlen++; |
list | 352 | include/linux/skbuff.h | __skb_append(old, newsk, old->list); |
list | 360 | include/linux/skbuff.h | extern __inline__ void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list) |
list | 364 | include/linux/skbuff.h | list->qlen--; |
list | 369 | include/linux/skbuff.h | skb->list = NULL; |
list | 387 | include/linux/skbuff.h | if(skb->list) |
list | 388 | include/linux/skbuff.h | __skb_unlink(skb, skb->list); |
list | 138 | include/linux/tqueue.h | _INLINE_ void run_task_queue(task_queue *list) |
list | 142 | include/linux/tqueue.h | p = xchg(list,&tq_last); |
list | 39 | mm/page_alloc.c | struct page list; |
list | 100 | mm/page_alloc.c | remove_mem_queue(&free_area[order].list, list(map_nr ^ (1+~mask))); |
list | 106 | mm/page_alloc.c | add_mem_queue(&free_area[order].list, list(map_nr)); |
list | 163 | mm/page_alloc.c | do { struct page *prev = &area->list, *ret; \ |
list | 164 | mm/page_alloc.c | while (&area->list != (ret = prev->next)) { \ |
list | 184 | mm/page_alloc.c | add_mem_queue(&area->list, map); \ |
list | 241 | mm/page_alloc.c | for (tmp = free_area[order].list.next ; tmp != &free_area[order].list ; tmp = tmp->next) { |
list | 291 | mm/page_alloc.c | init_mem_queue(&free_area[i].list); |
list | 407 | net/appletalk/aarp.c | static struct aarp_entry *aarp_find_entry(struct aarp_entry *list, struct device *dev, struct at_addr *sat) |
list | 412 | net/appletalk/aarp.c | while(list) |
list | 414 | net/appletalk/aarp.c | if(list->target_addr.s_net==sat->s_net && |
list | 415 | net/appletalk/aarp.c | list->target_addr.s_node==sat->s_node && list->dev==dev) |
list | 417 | net/appletalk/aarp.c | list=list->next; |
list | 420 | net/appletalk/aarp.c | return list; |
list | 600 | net/appletalk/aarp.c | static void aarp_resolved(struct aarp_entry **list, struct aarp_entry *a, int hash) |
list | 603 | net/appletalk/aarp.c | while(*list!=NULL) |
list | 605 | net/appletalk/aarp.c | if(*list==a) |
list | 608 | net/appletalk/aarp.c | *list=a->next; |
list | 632 | net/appletalk/aarp.c | list=&((*list)->next); |
list | 341 | net/core/dev.c | struct sk_buff_head *list; |
list | 394 | net/core/dev.c | list = dev->buffs + pri; |
list | 399 | net/core/dev.c | if (skb_queue_len(list)) { |
list | 401 | net/core/dev.c | if (skb_queue_len(list) > dev->tx_queue_len) { |
list | 407 | net/core/dev.c | __skb_queue_tail(list, skb); |
list | 408 | net/core/dev.c | skb = __skb_dequeue(list); |
list | 451 | net/core/dev.c | __skb_queue_head(list,skb); |
list | 191 | net/core/skbuff.c | void skb_queue_head_init(struct sk_buff_head *list) |
list | 193 | net/core/skbuff.c | list->prev = (struct sk_buff *)list; |
list | 194 | net/core/skbuff.c | list->next = (struct sk_buff *)list; |
list | 195 | net/core/skbuff.c | list->qlen = 0; |
list | 196 | net/core/skbuff.c | list->magic_debug_cookie = SK_HEAD_SKB; |
list | 206 | net/core/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 212 | net/core/skbuff.c | IS_SKB_HEAD(list); |
list | 216 | net/core/skbuff.c | newsk->next = list->next; |
list | 217 | net/core/skbuff.c | newsk->prev = list; |
list | 221 | net/core/skbuff.c | newsk->list = list_; |
list | 233 | net/core/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 241 | net/core/skbuff.c | IS_SKB_HEAD(list); |
list | 243 | net/core/skbuff.c | newsk->next = list; |
list | 244 | net/core/skbuff.c | newsk->prev = list->prev; |
list | 249 | net/core/skbuff.c | newsk->list = list_; |
list | 264 | net/core/skbuff.c | struct sk_buff *list = (struct sk_buff *)list_; |
list | 269 | net/core/skbuff.c | IS_SKB_HEAD(list); |
list | 271 | net/core/skbuff.c | result = list->next; |
list | 272 | net/core/skbuff.c | if (result == list) { |
list | 277 | net/core/skbuff.c | result->next->prev = list; |
list | 278 | net/core/skbuff.c | list->next = result->next; |
list | 283 | net/core/skbuff.c | result->list = NULL; |
list | 312 | net/core/skbuff.c | newsk->list = old->list; |
list | 313 | net/core/skbuff.c | newsk->list->qlen++; |
list | 340 | net/core/skbuff.c | newsk->list = old->list; |
list | 341 | net/core/skbuff.c | newsk->list->qlen++; |
list | 361 | net/core/skbuff.c | if(skb->list) |
list | 363 | net/core/skbuff.c | skb->list->qlen--; |
list | 368 | net/core/skbuff.c | skb->list = NULL; |
list | 477 | net/core/skbuff.c | if (skb->list) |
list | 568 | net/core/skbuff.c | skb->list = NULL; |
list | 650 | net/core/skbuff.c | n->list = NULL; |
list | 692 | net/core/skbuff.c | n->list=NULL; |
list | 1208 | net/ipv4/tcp_input.c | struct sk_buff_head * list = &sk->receive_queue; |
list | 1216 | net/ipv4/tcp_input.c | next = list->prev; |
list | 1217 | net/ipv4/tcp_input.c | while (next != (struct sk_buff *) list) { |
list | 1226 | net/ipv4/tcp_input.c | __skb_append(next, skb, list); |
list | 1240 | net/ipv4/tcp_input.c | while (next != (struct sk_buff *) list) { |
list | 122 | scripts/lxdialog/checklist.c | WINDOW *dialog, *list; |
list | 175 | scripts/lxdialog/checklist.c | list = subwin (dialog, list_height, list_width, y+box_y+1, x+box_x+1); |
list | 177 | scripts/lxdialog/checklist.c | keypad (list, TRUE); |
list | 193 | scripts/lxdialog/checklist.c | print_item (list, items[i * 3 + 1], status[i], i, i == choice); |
list | 195 | scripts/lxdialog/checklist.c | wnoutrefresh (list); |
list | 219 | scripts/lxdialog/checklist.c | print_item (list, items[scroll * 3 + 1], |
list | 221 | scripts/lxdialog/checklist.c | scrollok (list, TRUE); |
list | 222 | scripts/lxdialog/checklist.c | wscrl (list, -1); |
list | 223 | scripts/lxdialog/checklist.c | scrollok (list, FALSE); |
list | 226 | scripts/lxdialog/checklist.c | print_item (list, items[scroll * 3 + 1], |
list | 228 | scripts/lxdialog/checklist.c | wnoutrefresh (list); |
list | 245 | scripts/lxdialog/checklist.c | print_item (list, items[(scroll + max_choice - 1) * 3 + 1], |
list | 248 | scripts/lxdialog/checklist.c | scrollok (list, TRUE); |
list | 249 | scripts/lxdialog/checklist.c | scroll (list); |
list | 250 | scripts/lxdialog/checklist.c | scrollok (list, FALSE); |
list | 253 | scripts/lxdialog/checklist.c | print_item (list, items[(scroll + max_choice - 1) * 3 + 1], |
list | 256 | scripts/lxdialog/checklist.c | wnoutrefresh (list); |
list | 269 | scripts/lxdialog/checklist.c | print_item (list, items[(scroll + choice) * 3 + 1], |
list | 273 | scripts/lxdialog/checklist.c | print_item (list, items[(scroll + choice) * 3 + 1], |
list | 275 | scripts/lxdialog/checklist.c | wnoutrefresh (list); |
list | 303 | scripts/lxdialog/checklist.c | wmove (list, choice, check_x); |
list | 304 | scripts/lxdialog/checklist.c | wattrset (list, check_selected_attr); |
list | 305 | scripts/lxdialog/checklist.c | wprintw (list, "[%c]", status[scroll + choice] ? 'X' : ' '); |
list | 312 | scripts/lxdialog/checklist.c | print_item (list, items[(scroll + i) * 3 + 1], |
list | 316 | scripts/lxdialog/checklist.c | wnoutrefresh (list); |
list | 53 | scripts/tkparse.c | struct condition *list; |
list | 69 | scripts/tkparse.c | list = last = NULL; |
list | 83 | scripts/tkparse.c | list = last = cpnt; |
list | 164 | scripts/tkparse.c | return list; |