Home
last modified time | relevance | path

Searched full:list (Results 1 – 25 of 8943) sorted by relevance

12345678910>>...358

/kernel/linux/linux-5.10/tools/perf/util/
Dparse-events.y31 struct list_head *list; in alloc_list() local
33 list = malloc(sizeof(*list)); in alloc_list()
34 if (!list) in alloc_list()
37 INIT_LIST_HEAD(list); in alloc_list()
38 return list; in alloc_list()
52 static void inc_group_count(struct list_head *list, in inc_group_count() argument
56 if (!list_is_last(list->next, list)) in inc_group_count()
148 parse_events_update_lists($1, &parse_state->list);
154 struct list_head *list = $1; variable
158 parse_events_update_lists(group, list);
[all …]
/kernel/liteos_a/kernel/include/
Dlos_list.h8 * 1. Redistributions of source code must retain the above copyright notice, this list of
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
33 * @defgroup los_list Doubly linked list
50 * Structure of a node in a doubly linked list.
61 * This API is used to initialize a doubly linked list.
67 * @param list [IN] Node in a doubly linked list.
74 LITE_OS_SEC_ALW_INLINE STATIC INLINE VOID LOS_ListInit(LOS_DL_LIST *list) in LOS_ListInit() argument
76 list->pstNext = list; in LOS_ListInit()
77 list->pstPrev = list; in LOS_ListInit()
93 * @param object [IN] Node in the doubly linked list.
[all …]
/kernel/linux/linux-5.10/lib/
Dlist-test.c3 * KUnit test for the Kernel Linked-list structures.
10 #include <linux/list.h>
14 struct list_head list; member
19 /* Test the different ways of initialising a list. */ in list_test_list_init()
49 LIST_HEAD(list); in list_test_list_add()
51 list_add(&a, &list); in list_test_list_add()
52 list_add(&b, &list); in list_test_list_add()
54 /* should be [list] -> b -> a */ in list_test_list_add()
55 KUNIT_EXPECT_PTR_EQ(test, list.next, &b); in list_test_list_add()
56 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_add()
[all …]
/kernel/liteos_a/apps/shell/include/
Dshell_list.h8 * 1. Redistributions of source code must retain the above copyright notice, this list of
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
48 * Structure of a node in a doubly linked list.
59 * This API is used to initialize a doubly linked list.
65 * @param list [IN] Node in a doubly linked list.
72 static inline void SH_ListInit(SH_List *list) in SH_ListInit() argument
74 list->pstNext = list; in SH_ListInit()
75 list->pstPrev = list; in SH_ListInit()
91 * @param object [IN] Node in the doubly linked list.
113 * @param object [IN] Node in the doubly linked list.
[all …]
/kernel/linux/linux-5.10/include/linux/
Dlist.h12 * Simple doubly linked list implementation.
28 * @list: list_head structure to be initialized.
30 * Initializes the list_head to point to itself. If it is a list header,
31 * the result is an empty list.
33 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
36 list->prev = list; in INIT_LIST_HEAD()
60 * This is only for internal list manipulation where we know
79 * @head: list head to add it after
93 * @head: list head to add it before
[all …]
Drculist.h8 * RCU-protected list version
10 #include <linux/list.h>
16 * and compares it to the address of the list head, but neither dereferences
24 * @list: list to be initialized
27 * cleanup tasks, when readers have no access to the list being initialized.
28 * However, if the list being initialized is visible to readers, you
31 static inline void INIT_LIST_HEAD_RCU(struct list_head *list) in INIT_LIST_HEAD_RCU() argument
33 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
34 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
41 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) argument
[all …]
Dllist.h5 * Lock-less NULL terminated single linked list
16 * needed. This is because llist_del_first depends on list->first->next not
19 * preempted back, the list->first is the same as before causing the cmpxchg in
35 * The list entries deleted via llist_del_all can be traversed with
36 * traversing function such as llist_for_each etc. But the list
37 * entries can not be traversed safely before deleted from the list.
42 * The basic atomic operation of this list is cmpxchg on long. On
44 * list can NOT be used in NMI handlers. So code that uses the list in
66 * init_llist_head - initialize lock-less list head
67 * @head: the head for your lock-less list
[all …]
/kernel/linux/linux-4.19/include/linux/
Dlist.h12 * Simple doubly linked list implementation.
26 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
28 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
29 list->prev = list; in INIT_LIST_HEAD()
53 * This is only for internal list manipulation where we know
72 * @head: list head to add it after
86 * @head: list head to add it before
97 * Delete a list entry by making the prev/next entries
100 * This is only for internal list manipulation where we know
110 * list_del - deletes entry from list.
[all …]
Drculist.h8 * RCU-protected list version
10 #include <linux/list.h>
16 * and compares it to the address of the list head, but neither dereferences
24 * @list: list to be initialized
27 * cleanup tasks, when readers have no access to the list being initialized.
28 * However, if the list being initialized is visible to readers, you
31 static inline void INIT_LIST_HEAD_RCU(struct list_head *list) in INIT_LIST_HEAD_RCU() argument
33 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
34 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
41 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) argument
[all …]
/kernel/linux/linux-4.19/tools/include/linux/
Dlist.h11 * Simple doubly linked list implementation.
25 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
27 list->next = list; in INIT_LIST_HEAD()
28 list->prev = list; in INIT_LIST_HEAD()
34 * This is only for internal list manipulation where we know
56 * @head: list head to add it after
70 * @head: list head to add it before
81 * Delete a list entry by making the prev/next entries
84 * This is only for internal list manipulation where we know
94 * list_del - deletes entry from list.
[all …]
/kernel/linux/linux-5.10/tools/include/linux/
Dlist.h11 * Simple doubly linked list implementation.
25 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
27 list->next = list; in INIT_LIST_HEAD()
28 list->prev = list; in INIT_LIST_HEAD()
34 * This is only for internal list manipulation where we know
56 * @head: list head to add it after
70 * @head: list head to add it before
81 * Delete a list entry by making the prev/next entries
84 * This is only for internal list manipulation where we know
94 * list_del - deletes entry from list.
[all …]
/kernel/linux/linux-4.19/tools/perf/util/
Dparse-events.y13 #include <linux/list.h>
29 #define ALLOC_LIST(list) \ argument
31 list = malloc(sizeof(*list)); \
32 ABORT_ON(!list); \
33 INIT_LIST_HEAD(list); \
36 static void inc_group_count(struct list_head *list, in inc_group_count() argument
40 if (!list_is_last(list->next, list)) in inc_group_count()
122 parse_events_update_lists($1, &parse_state->list);
128 struct list_head *list = $1; variable
131 parse_events_update_lists(group, list);
[all …]
/kernel/linux/linux-5.10/drivers/clk/rockchip/
Dclk.c417 struct rockchip_pll_clock *list, in rockchip_clk_register_plls() argument
423 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
424 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
425 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
426 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
427 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
428 list->mode_shift, list->rate_table, in rockchip_clk_register_plls()
429 list->flags, list->pll_flags); in rockchip_clk_register_plls()
432 list->name); in rockchip_clk_register_plls()
436 rockchip_clk_add_lookup(ctx, clk, list->id); in rockchip_clk_register_plls()
[all …]
/kernel/linux/linux-4.19/drivers/clk/rockchip/
Dclk.c419 struct rockchip_pll_clock *list, in rockchip_clk_register_plls() argument
425 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
426 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
427 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
428 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
429 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
430 list->mode_shift, list->rate_table, in rockchip_clk_register_plls()
431 list->flags, list->pll_flags); in rockchip_clk_register_plls()
434 list->name); in rockchip_clk_register_plls()
438 rockchip_clk_add_lookup(ctx, clk, list->id); in rockchip_clk_register_plls()
[all …]
/kernel/liteos_m/utils/
Dlos_list.h8 * 1. Redistributions of source code must retain the above copyright notice, this list of
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
33 * @defgroup los_list Doubly linked list
50 * Structure of a node in a doubly linked list.
59 * @brief Initialize a doubly linked list.
62 * This API is used to initialize a doubly linked list.
68 * @param list [IN] Node in a doubly linked list.
75 LITE_OS_SEC_ALW_INLINE STATIC_INLINE VOID LOS_ListInit(LOS_DL_LIST *list) in LOS_ListInit() argument
77 list->pstNext = list; in LOS_ListInit()
78 list->pstPrev = list; in LOS_ListInit()
[all …]
/kernel/linux/linux-5.10/tools/firewire/
Dlist.h2 struct list { struct
3 struct list *next, *prev; argument
7 list_init(struct list *list) in list_init() argument
9 list->next = list; in list_init()
10 list->prev = list; in list_init()
14 list_empty(struct list *list) in list_empty() argument
16 return list->next == list; in list_empty()
20 list_insert(struct list *link, struct list *new_link) in list_insert()
29 list_append(struct list *list, struct list *new_link) in list_append() argument
31 list_insert((struct list *)list, new_link); in list_append()
[all …]
/kernel/linux/linux-4.19/tools/firewire/
Dlist.h2 struct list { struct
3 struct list *next, *prev; argument
7 list_init(struct list *list) in list_init() argument
9 list->next = list; in list_init()
10 list->prev = list; in list_init()
14 list_empty(struct list *list) in list_empty() argument
16 return list->next == list; in list_empty()
20 list_insert(struct list *link, struct list *new_link) in list_insert()
29 list_append(struct list *list, struct list *new_link) in list_append() argument
31 list_insert((struct list *)list, new_link); in list_append()
[all …]
/kernel/linux/linux-5.10/drivers/clk/samsung/
Dclk.c95 /* register a list of aliases */
97 const struct samsung_clock_alias *list, in samsung_clk_register_alias() argument
103 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_alias()
104 if (!list->id) { in samsung_clk_register_alias()
110 clk_hw = ctx->clk_data.hws[list->id]; in samsung_clk_register_alias()
113 list->id); in samsung_clk_register_alias()
117 ret = clk_hw_register_clkdev(clk_hw, list->alias, in samsung_clk_register_alias()
118 list->dev_name); in samsung_clk_register_alias()
121 __func__, list->alias); in samsung_clk_register_alias()
125 /* register a list of fixed clocks */
[all …]
/kernel/linux/linux-4.19/drivers/clk/samsung/
Dclk.c98 /* register a list of aliases */
100 const struct samsung_clock_alias *list, in samsung_clk_register_alias() argument
106 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_alias()
107 if (!list->id) { in samsung_clk_register_alias()
113 clk_hw = ctx->clk_data.hws[list->id]; in samsung_clk_register_alias()
116 list->id); in samsung_clk_register_alias()
120 ret = clk_hw_register_clkdev(clk_hw, list->alias, in samsung_clk_register_alias()
121 list->dev_name); in samsung_clk_register_alias()
124 __func__, list->alias); in samsung_clk_register_alias()
128 /* register a list of fixed clocks */
[all …]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/include/nvif/
Dlist.h26 /* Modified by Ben Skeggs <bskeggs@redhat.com> to match kernel list APIs */
32 * @file Classic doubly-link circular list implementation.
33 * For real usage examples of the linked list, see the file test/list.c
36 * We need to keep a list of struct foo in the parent struct bar, i.e. what
45 * We need one list head in bar and a list element in all list_of_foos (both are of
60 * Now we initialize the list head:
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
78 * list again.
80 * Looping through the list requires a 'struct foo' as iterator and the
[all …]
/kernel/linux/linux-4.19/drivers/gpu/drm/nouveau/include/nvif/
Dlist.h26 /* Modified by Ben Skeggs <bskeggs@redhat.com> to match kernel list APIs */
32 * @file Classic doubly-link circular list implementation.
33 * For real usage examples of the linked list, see the file test/list.c
36 * We need to keep a list of struct foo in the parent struct bar, i.e. what
45 * We need one list head in bar and a list element in all list_of_foos (both are of
60 * Now we initialize the list head:
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
78 * list again.
80 * Looping through the list requires a 'struct foo' as iterator and the
[all …]
/kernel/linux/linux-4.19/drivers/net/wireless/quantenna/qtnfmac/
Dutil.c19 void qtnf_sta_list_init(struct qtnf_sta_list *list) in qtnf_sta_list_init() argument
21 if (unlikely(!list)) in qtnf_sta_list_init()
24 INIT_LIST_HEAD(&list->head); in qtnf_sta_list_init()
25 atomic_set(&list->size, 0); in qtnf_sta_list_init()
28 struct qtnf_sta_node *qtnf_sta_list_lookup(struct qtnf_sta_list *list, in qtnf_sta_list_lookup() argument
36 list_for_each_entry(node, &list->head, list) { in qtnf_sta_list_lookup()
44 struct qtnf_sta_node *qtnf_sta_list_lookup_index(struct qtnf_sta_list *list, in qtnf_sta_list_lookup_index() argument
49 if (qtnf_sta_list_size(list) <= index) in qtnf_sta_list_lookup_index()
52 list_for_each_entry(node, &list->head, list) { in qtnf_sta_list_lookup_index()
63 struct qtnf_sta_list *list = &vif->sta_list; in qtnf_sta_list_add() local
[all …]
/kernel/linux/linux-5.10/drivers/net/wireless/quantenna/qtnfmac/
Dutil.c7 void qtnf_sta_list_init(struct qtnf_sta_list *list) in qtnf_sta_list_init() argument
9 if (unlikely(!list)) in qtnf_sta_list_init()
12 INIT_LIST_HEAD(&list->head); in qtnf_sta_list_init()
13 atomic_set(&list->size, 0); in qtnf_sta_list_init()
16 struct qtnf_sta_node *qtnf_sta_list_lookup(struct qtnf_sta_list *list, in qtnf_sta_list_lookup() argument
24 list_for_each_entry(node, &list->head, list) { in qtnf_sta_list_lookup()
32 struct qtnf_sta_node *qtnf_sta_list_lookup_index(struct qtnf_sta_list *list, in qtnf_sta_list_lookup_index() argument
37 if (qtnf_sta_list_size(list) <= index) in qtnf_sta_list_lookup_index()
40 list_for_each_entry(node, &list->head, list) { in qtnf_sta_list_lookup_index()
51 struct qtnf_sta_list *list = &vif->sta_list; in qtnf_sta_list_add() local
[all …]
/kernel/linux/linux-5.10/drivers/net/ethernet/intel/ice/
Dice_fltr.c10 * @h: pointer to the list head to be freed
26 * ice_fltr_add_entry_to_list - allocate and add filter entry to list
28 * @info: filter info struct that gets added to the passed in list
29 * @list: pointer to the list which contains MAC filters entry
33 struct list_head *list) in ice_fltr_add_entry_to_list() argument
44 list_add(&entry->list_entry, list); in ice_fltr_add_entry_to_list()
50 * ice_fltr_add_mac_list - add list of MAC filters
52 * @list: list of filters
55 ice_fltr_add_mac_list(struct ice_vsi *vsi, struct list_head *list) in ice_fltr_add_mac_list() argument
57 return ice_add_mac(&vsi->back->hw, list); in ice_fltr_add_mac_list()
[all …]
/kernel/linux/linux-5.10/arch/sh/include/mach-ecovec24/mach/
Dpartner-jet-setup.txt1 LIST "SPDX-License-Identifier: GPL-2.0"
2 LIST "partner-jet-setup.txt"
3 LIST "(C) Copyright 2009 Renesas Solutions Corp"
4 LIST "Kuninori Morimoto <morimoto.kuninori@renesas.com>"
5 LIST "--------------------------------"
6 LIST "zImage (RAM boot)"
7 LIST "This script can be used to boot the kernel from RAM via JTAG:"
8 LIST "> < partner-jet-setup.txt"
9 LIST "> RD zImage, 0xa8800000"
10 LIST "> G=0xa8800000"
[all …]

12345678910>>...358