| /kernel/linux/linux-5.10/tools/perf/util/ |
| D | parse-events.y | 31 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/ |
| D | los_list.h | 8 * 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/ |
| D | list-test.c | 3 * 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/ |
| D | shell_list.h | 8 * 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-6.6/drivers/clk/rockchip/ |
| D | clk.c | 408 struct rockchip_pll_clock *list, in rockchip_clk_register_plls() argument
414 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
415 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
416 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
417 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
418 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
419 list->mode_shift, list->rate_table, in rockchip_clk_register_plls()
420 list->flags, list->pll_flags); in rockchip_clk_register_plls()
423 list->name); in rockchip_clk_register_plls()
427 rockchip_clk_add_lookup(ctx, clk, list->id); in rockchip_clk_register_plls()
[all …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | list.h | 12 * 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 WRITE_ONCE(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 …]
|
| D | rculist.h | 8 * 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-6.6/lib/ |
| D | list-test.c | 3 * KUnit test for the Kernel Linked-list structures.
10 #include <linux/list.h>
15 struct list_head list; member
20 /* Test the different ways of initialising a list. */ in list_test_list_init()
50 LIST_HEAD(list); in list_test_list_add()
52 list_add(&a, &list); in list_test_list_add()
53 list_add(&b, &list); in list_test_list_add()
55 /* should be [list] -> b -> a */ in list_test_list_add()
56 KUNIT_EXPECT_PTR_EQ(test, list.next, &b); in list_test_list_add()
57 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_add()
[all …]
|
| /kernel/linux/linux-5.10/tools/include/linux/ |
| D | list.h | 11 * 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-6.6/include/linux/ |
| D | list.h | 14 * Circular doubly linked list implementation.
30 * @list: list_head structure to be initialized.
32 * Initializes the list_head to point to itself. If it is a list header,
33 * the result is an empty list.
35 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
38 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD()
50 * Performs the full set of list corruption checks before __list_add().
51 * On list corruption reports a warning, and returns false.
58 * Performs list corruption checks before __list_add(). Returns false if a
[all …]
|
| D | rculist.h | 8 * RCU-protected list version
10 #include <linux/list.h>
15 * @list: list to be initialized
18 * cleanup tasks, when readers have no access to the list being initialized.
19 * However, if the list being initialized is visible to readers, you
22 static inline void INIT_LIST_HEAD_RCU(struct list_head *list) in INIT_LIST_HEAD_RCU() argument
24 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
25 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
32 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) argument
35 * list_tail_rcu - returns the prev pointer of the head of the list
[all …]
|
| /kernel/linux/linux-5.10/drivers/clk/rockchip/ |
| D | clk.c | 417 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/liteos_m/utils/ |
| D | los_list.h | 8 * 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-6.6/tools/include/linux/ |
| D | list.h | 11 * 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-6.6/tools/firewire/ |
| D | list.h | 2 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/tools/firewire/ |
| D | list.h | 2 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-6.6/drivers/clk/samsung/ |
| D | clk.c | 106 /* register a list of aliases */
108 const struct samsung_clock_alias *list, in samsung_clk_register_alias() argument
114 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_alias()
115 if (!list->id) { in samsung_clk_register_alias()
121 clk_hw = ctx->clk_data.hws[list->id]; in samsung_clk_register_alias()
124 list->id); in samsung_clk_register_alias()
128 ret = clk_hw_register_clkdev(clk_hw, list->alias, in samsung_clk_register_alias()
129 list->dev_name); in samsung_clk_register_alias()
132 __func__, list->alias); in samsung_clk_register_alias()
136 /* register a list of fixed clocks */
[all …]
|
| /kernel/linux/linux-5.10/drivers/clk/samsung/ |
| D | clk.c | 95 /* 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-6.6/tools/perf/util/ |
| D | parse-events.y | 35 struct list_head *list; in alloc_list() local
37 list = malloc(sizeof(*list)); in alloc_list()
38 if (!list) in alloc_list()
41 INIT_LIST_HEAD(list); in alloc_list()
42 return list; in alloc_list()
139 parse_events_update_lists($1, &parse_state->list);
145 struct list_head *list = $1; variable
149 parse_events_update_lists(group, list);
150 $$ = list;
155 struct list_head *list = $1; variable
[all …]
|
| /kernel/linux/linux-6.6/io_uring/ |
| D | slist.h | 15 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL) argument
17 #define INIT_WQ_LIST(list) do { \ argument
18 (list)->first = NULL; \
23 struct io_wq_work_list *list) in wq_list_add_after() argument
30 list->last = node; in wq_list_add_after()
34 struct io_wq_work_list *list) in wq_list_add_tail() argument
37 if (!list->first) { in wq_list_add_tail()
38 list->last = node; in wq_list_add_tail()
39 WRITE_ONCE(list->first, node); in wq_list_add_tail()
41 list->last->next = node; in wq_list_add_tail()
[all …]
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/include/nvif/ |
| D | list.h | 26 /* 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-6.6/drivers/clk/x86/ |
| D | clk-cgu.c | 26 const struct lgm_clk_branch *list) in lgm_clk_register_fixed() argument
29 if (list->div_flags & CLOCK_FLAG_VAL_INIT) in lgm_clk_register_fixed()
30 lgm_set_clk_val(ctx->membase, list->div_off, list->div_shift, in lgm_clk_register_fixed()
31 list->div_width, list->div_val); in lgm_clk_register_fixed()
33 return clk_hw_register_fixed_rate(NULL, list->name, in lgm_clk_register_fixed()
34 list->parent_data[0].name, in lgm_clk_register_fixed()
35 list->flags, list->mux_flags); in lgm_clk_register_fixed()
82 const struct lgm_clk_branch *list) in lgm_clk_register_mux() argument
84 unsigned long cflags = list->mux_flags; in lgm_clk_register_mux()
86 u8 shift = list->mux_shift; in lgm_clk_register_mux()
[all …]
|
| /kernel/linux/linux-5.10/drivers/clk/x86/ |
| D | clk-cgu.c | 26 const struct lgm_clk_branch *list) in lgm_clk_register_fixed() argument
29 if (list->div_flags & CLOCK_FLAG_VAL_INIT) in lgm_clk_register_fixed()
30 lgm_set_clk_val(ctx->membase, list->div_off, list->div_shift, in lgm_clk_register_fixed()
31 list->div_width, list->div_val); in lgm_clk_register_fixed()
33 return clk_hw_register_fixed_rate(NULL, list->name, in lgm_clk_register_fixed()
34 list->parent_data[0].name, in lgm_clk_register_fixed()
35 list->flags, list->mux_flags); in lgm_clk_register_fixed()
82 const struct lgm_clk_branch *list) in lgm_clk_register_mux() argument
84 unsigned long cflags = list->mux_flags; in lgm_clk_register_mux()
86 u8 shift = list->mux_shift; in lgm_clk_register_mux()
[all …]
|
| /kernel/linux/linux-5.10/drivers/net/wireless/quantenna/qtnfmac/ |
| D | util.c | 7 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-6.6/drivers/net/wireless/quantenna/qtnfmac/ |
| D | util.c | 7 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 …]
|