Searched refs:prio_list (Results 1 - 8 of 8) sorted by relevance
/linux-master/include/linux/ |
H A D | plist_types.h | 13 struct list_head prio_list; member in struct:plist_node
|
H A D | plist.h | 27 * - The tier 1 list is the prio_list, different priority nodes. 33 * pl:prio_list (only for plist_node) 45 * The nodes on the prio_list list are sorted by priority to simplify 53 * Addition means: look for the prio_list node in the prio_list 55 * entry of the next prio_list node. If it is the first node of 56 * that priority, add it to the prio_list in the right position and 60 * the prio_list if the node_list list_head is non empty. In case 61 * of removal from the prio_list it must be checked whether other 64 * replace the removed entry on the prio_list [all...] |
/linux-master/lib/ |
H A D | plist.c | 59 plist_check_list(&plist_first(head)->prio_list); 80 WARN_ON(!list_empty(&node->prio_list)); 94 iter = list_entry(iter->prio_list.next, 95 struct plist_node, prio_list); 99 list_add_tail(&node->prio_list, &iter->prio_list); 116 if (!list_empty(&node->prio_list)) { 123 /* add the next plist_node into prio_list */ 124 if (list_empty(&next->prio_list)) 125 list_add(&next->prio_list, [all...] |
H A D | parman.c | 56 struct list_head prio_list; member in struct:parman 117 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) { 196 list_for_each_entry_reverse(prio2, &parman->prio_list, list) { 212 list_for_each_entry_continue(prio, &parman->prio_list, list) 274 INIT_LIST_HEAD(&parman->prio_list); 291 WARN_ON(!list_empty(&parman->prio_list)); 317 list_for_each(pos, &parman->prio_list) {
|
/linux-master/net/sctp/ |
H A D | stream_sched_prio.c | 67 list_for_each_entry(p, &stream->prio_list, prio_sched) { 97 pos = p->next->prio_list.next; 100 p->next = list_entry(pos, struct sctp_stream_out_ext, prio_list); 107 if (!list_empty(&soute->prio_list)) { 117 list_del_init(&soute->prio_list); 138 if (!list_empty(&soute->prio_list)) 146 list_add(&soute->prio_list, prio_head->next->prio_list.prev); 150 list_add(&soute->prio_list, &prio_head->active); 153 list_for_each_entry(prio, &stream->prio_list, prio_sche [all...] |
/linux-master/drivers/bus/ |
H A D | da8xx-mstpri.c | 207 const struct da8xx_mstpri_board_priorities *prio_list; local 223 prio_list = da8xx_mstpri_get_board_prio(); 224 if (!prio_list) { 229 for (i = 0; i < prio_list->numprio; i++) { 230 prio = &prio_list->priorities[i];
|
/linux-master/drivers/net/ethernet/mellanox/mlx4/ |
H A D | alloc.c | 214 struct list_head prio_list; member in struct:mlx4_zone_entry 269 list_for_each_entry(it, &zone_alloc->prios, prio_list) 273 if (&it->prio_list == &zone_alloc->prios || it->priority > priority) 274 list_add_tail(&zone->prio_list, &it->prio_list); 289 if (!list_empty(&entry->prio_list)) { 297 list_add_tail(&next->prio_list, &entry->prio_list); 300 list_del(&entry->prio_list); 309 list_for_each_entry(it, &zone_alloc->prios, prio_list) { [all...] |
/linux-master/include/net/sctp/ |
H A D | structs.h | 1420 struct list_head prio_list; member in struct:sctp_stream_out_ext::__anon2528::__anon2529 1469 struct list_head prio_list; member in struct:sctp_stream::__anon2534::__anon2535
|
Completed in 316 milliseconds