| /kernel/linux/linux-5.10/lib/ |
| H A D | plist.c | 59 plist_check_list(&plist_first(head)->prio_list); in plist_check_head()
80 WARN_ON(!list_empty(&node->prio_list)); in plist_add()
94 iter = list_entry(iter->prio_list.next, in plist_add()
95 struct plist_node, prio_list); in plist_add()
99 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
116 if (!list_empty(&node->prio_list)) { in plist_del()
123 /* add the next plist_node into prio_list */ in plist_del()
124 if (list_empty(&next->prio_list)) in plist_del()
125 list_add(&next->prio_list, in plist_del()
[all...] |
| H A D | parman.c | 56 struct list_head prio_list; member
118 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) { in parman_lsort_new_index_find()
197 list_for_each_entry_reverse(prio2, &parman->prio_list, list) { in parman_lsort_item_add()
213 list_for_each_entry_continue(prio, &parman->prio_list, list) in parman_lsort_item_remove()
275 INIT_LIST_HEAD(&parman->prio_list); in parman_create()
292 WARN_ON(!list_empty(&parman->prio_list)); in parman_destroy()
318 list_for_each(pos, &parman->prio_list) { in parman_prio_init()
|
| /kernel/linux/linux-6.6/lib/ |
| H A D | plist.c | 59 plist_check_list(&plist_first(head)->prio_list); in plist_check_head()
80 WARN_ON(!list_empty(&node->prio_list)); in plist_add()
94 iter = list_entry(iter->prio_list.next, in plist_add()
95 struct plist_node, prio_list); in plist_add()
99 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
116 if (!list_empty(&node->prio_list)) { in plist_del()
123 /* add the next plist_node into prio_list */ in plist_del()
124 if (list_empty(&next->prio_list)) in plist_del()
125 list_add(&next->prio_list, in plist_del()
[all...] |
| H A D | parman.c | 56 struct list_head prio_list; member
117 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) { in parman_lsort_new_index_find()
196 list_for_each_entry_reverse(prio2, &parman->prio_list, list) { in parman_lsort_item_add()
212 list_for_each_entry_continue(prio, &parman->prio_list, list) in parman_lsort_item_remove()
274 INIT_LIST_HEAD(&parman->prio_list); in parman_create()
291 WARN_ON(!list_empty(&parman->prio_list)); in parman_destroy()
317 list_for_each(pos, &parman->prio_list) { in parman_prio_init()
|
| /kernel/linux/linux-5.10/net/sctp/ |
| H A D | stream_sched_prio.c | 67 list_for_each_entry(p, &stream->prio_list, prio_sched) { in sctp_sched_prio_get_head()
97 pos = p->next->prio_list.next; in sctp_sched_prio_next_stream()
100 p->next = list_entry(pos, struct sctp_stream_out_ext, prio_list); in sctp_sched_prio_next_stream()
107 if (!list_empty(&soute->prio_list)) { in sctp_sched_prio_unsched()
117 list_del_init(&soute->prio_list); in sctp_sched_prio_unsched()
138 if (!list_empty(&soute->prio_list)) in sctp_sched_prio_sched()
146 list_add(&soute->prio_list, prio_head->next->prio_list.prev); in sctp_sched_prio_sched()
150 list_add(&soute->prio_list, &prio_head->active); in sctp_sched_prio_sched()
153 list_for_each_entry(prio, &stream->prio_list, prio_sche in sctp_sched_prio_sched()
[all...] |
| /kernel/linux/linux-6.6/net/sctp/ |
| H A D | stream_sched_prio.c | 67 list_for_each_entry(p, &stream->prio_list, prio_sched) { in sctp_sched_prio_get_head()
97 pos = p->next->prio_list.next; in sctp_sched_prio_next_stream()
100 p->next = list_entry(pos, struct sctp_stream_out_ext, prio_list); in sctp_sched_prio_next_stream()
107 if (!list_empty(&soute->prio_list)) { in sctp_sched_prio_unsched()
117 list_del_init(&soute->prio_list); in sctp_sched_prio_unsched()
138 if (!list_empty(&soute->prio_list)) in sctp_sched_prio_sched()
146 list_add(&soute->prio_list, prio_head->next->prio_list.prev); in sctp_sched_prio_sched()
150 list_add(&soute->prio_list, &prio_head->active); in sctp_sched_prio_sched()
153 list_for_each_entry(prio, &stream->prio_list, prio_sche in sctp_sched_prio_sched()
[all...] |
| /kernel/linux/linux-5.10/drivers/bus/ |
| H A D | da8xx-mstpri.c | 207 const struct da8xx_mstpri_board_priorities *prio_list; in da8xx_mstpri_probe() local
223 prio_list = da8xx_mstpri_get_board_prio(); in da8xx_mstpri_probe()
224 if (!prio_list) { in da8xx_mstpri_probe()
229 for (i = 0; i < prio_list->numprio; i++) { in da8xx_mstpri_probe()
230 prio = &prio_list->priorities[i]; in da8xx_mstpri_probe()
|
| /kernel/linux/linux-6.6/drivers/bus/ |
| H A D | da8xx-mstpri.c | 207 const struct da8xx_mstpri_board_priorities *prio_list; in da8xx_mstpri_probe() local
223 prio_list = da8xx_mstpri_get_board_prio(); in da8xx_mstpri_probe()
224 if (!prio_list) { in da8xx_mstpri_probe()
229 for (i = 0; i < prio_list->numprio; i++) { in da8xx_mstpri_probe()
230 prio = &prio_list->priorities[i]; in da8xx_mstpri_probe()
|
| /kernel/linux/linux-5.10/include/linux/ |
| 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
85 struct list_head prio_list; global() member
[all...] |
| /kernel/linux/linux-6.6/include/linux/ |
| 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
88 struct list_head prio_list; global() member
[all...] |
| /kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx4/ |
| H A D | alloc.c | 214 struct list_head prio_list; member
269 list_for_each_entry(it, &zone_alloc->prios, prio_list) in mlx4_zone_add_one()
273 if (&it->prio_list == &zone_alloc->prios || it->priority > priority) in mlx4_zone_add_one()
274 list_add_tail(&zone->prio_list, &it->prio_list); in mlx4_zone_add_one()
289 if (!list_empty(&entry->prio_list)) { in __mlx4_zone_remove_one_entry()
297 list_add_tail(&next->prio_list, &entry->prio_list); in __mlx4_zone_remove_one_entry()
300 list_del(&entry->prio_list); in __mlx4_zone_remove_one_entry()
309 list_for_each_entry(it, &zone_alloc->prios, prio_list) { in __mlx4_zone_remove_one_entry()
[all...] |
| /kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx4/ |
| H A D | alloc.c | 214 struct list_head prio_list; member
269 list_for_each_entry(it, &zone_alloc->prios, prio_list) in mlx4_zone_add_one()
273 if (&it->prio_list == &zone_alloc->prios || it->priority > priority) in mlx4_zone_add_one()
274 list_add_tail(&zone->prio_list, &it->prio_list); in mlx4_zone_add_one()
289 if (!list_empty(&entry->prio_list)) { in __mlx4_zone_remove_one_entry()
297 list_add_tail(&next->prio_list, &entry->prio_list); in __mlx4_zone_remove_one_entry()
300 list_del(&entry->prio_list); in __mlx4_zone_remove_one_entry()
309 list_for_each_entry(it, &zone_alloc->prios, prio_list) { in __mlx4_zone_remove_one_entry()
[all...] |
| /kernel/linux/linux-5.10/include/net/sctp/ |
| H A D | structs.h | 1407 struct list_head prio_list; member
1451 struct list_head prio_list; member
|
| /kernel/linux/linux-6.6/include/net/sctp/ |
| H A D | structs.h | 1423 struct list_head prio_list; member
1472 struct list_head prio_list; member
|