Home
last modified time | relevance | path

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

12345678910>>...254

/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.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 …]
Drculist_nulls.h8 * RCU-protected list version
14 * hlist_nulls_del_init_rcu - deletes entry from hash list with re-initialization
15 * @n: the element to delete from the hash list.
19 * must know if the list entry is still hashed or already unhashed.
22 * that may still be used for walking the hash list and we can only
28 * list-mutation primitive, such as hlist_nulls_add_head_rcu() or
29 * hlist_nulls_del_rcu(), running on this same list. However, it is
30 * perfectly legal to run concurrently with the _rcu list-traversal
42 * hlist_nulls_first_rcu - returns the first element of the hash list.
43 * @head: the head of the list.
[all …]
/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.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 …]
/Linux-v5.10/net/core/
Ddev_addr_lists.c13 #include <linux/list.h>
16 * General list handling functions
19 static int __hw_addr_create_ex(struct netdev_hw_addr_list *list, in __hw_addr_create_ex() argument
39 list_add_tail_rcu(&ha->list, &list->list); in __hw_addr_create_ex()
40 list->count++; in __hw_addr_create_ex()
45 static int __hw_addr_add_ex(struct netdev_hw_addr_list *list, in __hw_addr_add_ex() argument
55 list_for_each_entry(ha, &list->list, list) { in __hw_addr_add_ex()
76 return __hw_addr_create_ex(list, addr, addr_len, addr_type, global, in __hw_addr_add_ex()
80 static int __hw_addr_add(struct netdev_hw_addr_list *list, in __hw_addr_add() argument
84 return __hw_addr_add_ex(list, addr, addr_len, addr_type, false, false, in __hw_addr_add()
[all …]
/Linux-v5.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 …]
/Linux-v5.10/drivers/clk/x86/
Dclk-cgu.c25 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()
31 lgm_set_clk_val(ctx->membase, list->div_off, list->div_shift, in lgm_clk_register_fixed()
32 list->div_width, list->div_val); in lgm_clk_register_fixed()
36 return clk_hw_register_fixed_rate(NULL, list->name, in lgm_clk_register_fixed()
37 list->parent_data[0].name, in lgm_clk_register_fixed()
38 list->flags, list->mux_flags); in lgm_clk_register_fixed()
91 const struct lgm_clk_branch *list) in lgm_clk_register_mux() argument
93 unsigned long flags, cflags = list->mux_flags; in lgm_clk_register_mux()
95 u8 shift = list->mux_shift; in lgm_clk_register_mux()
[all …]
/Linux-v5.10/drivers/media/platform/vsp1/
Dvsp1_dl.c3 * vsp1_dl.c -- R-Car VSP1 Display List
41 * struct vsp1_dl_ext_header - Extended display list header
45 * @pre_ext_dl_plist: start address of pre-extended display list bodies
47 * @post_ext_dl_plist: start address of post-extended display list bodies
79 * struct vsp1_pre_ext_dl_body - Pre Extended Display List Body
80 * @opcode: Extended display list command operation code
93 * struct vsp1_dl_body - Display list body
94 * @list: entry in the display list list of bodies
95 * @free: entry in the pool free body list
105 struct list_head list; member
[all …]
/Linux-v5.10/security/integrity/platform_certs/
Defi_parser.c2 /* EFI signature/key/certificate list parser
15 * parse_efi_signature_list - Parse an EFI signature list for certificates
21 * Parse an EFI signature list looking for elements of interest. A list is
32 * Error EBADMSG is returned if the list doesn't parse correctly and 0 is
33 * returned if the list was parsed correctly. No error can be returned from
49 efi_signature_list_t list; in parse_efi_signature_list() local
52 if (size < sizeof(list)) in parse_efi_signature_list()
55 memcpy(&list, data, sizeof(list)); in parse_efi_signature_list()
56 pr_devel("LIST[%04x] guid=%pUl ls=%x hs=%x ss=%x\n", in parse_efi_signature_list()
58 list.signature_type.b, list.signature_list_size, in parse_efi_signature_list()
[all …]
/Linux-v5.10/arch/sh/include/mach-kfr2r09/mach/
Dpartner-jet-setup.txt1 LIST "SPDX-License-Identifier: GPL-2.0"
2 LIST "partner-jet-setup.txt - 20090729 Magnus Damm"
3 LIST "set up enough of the kfr2r09 hardware to boot the kernel"
5 LIST "zImage (RAM boot)"
6 LIST "This script can be used to boot the kernel from RAM via JTAG:"
7 LIST "> < partner-jet-setup.txt"
8 LIST "> RD zImage, 0xa8800000"
9 LIST "> G=0xa8800000"
11 LIST "romImage (Flash boot)"
12 LIST "Use the following command to burn the zImage to flash via JTAG:"
[all …]
/Linux-v5.10/tools/memory-model/scripts/
Dnewlitmushist.sh11 # See scripts/parseargs.sh for list of arguments.
39 # Create a list of the C-language litmus tests previously run.
42 xargs -r grep -L "^P${LKMM_PROCS}"> $T/list-C-already
44 # Form full list of litmus tests with no more than the specified
46 find litmus -name '*.litmus' -exec grep -l -m 1 "^C " {} \; > $T/list-C-all
47 xargs < $T/list-C-all -r grep -L "^P${LKMM_PROCS}" > $T/list-C-short
49 # Form list of new tests. Note: This does not handle litmus-test deletion!
50 sort $T/list-C-already $T/list-C-short | uniq -u > $T/list-C-new
52 # Form list of litmus tests that have changed since the last run.
53 sed < $T/list-C-short -e 's,^.*$,if test & -nt '"$LKMM_DESTDIR"'/&.out; then echo &; fi,' > $T/list…
[all …]
/Linux-v5.10/drivers/hid/usbhid/
Dhiddev.c62 struct list_head *list; in hiddev_lookup_report() local
79 list = report_enum->report_list.next; in hiddev_lookup_report()
80 report = list_entry(list, struct hid_report, list); in hiddev_lookup_report()
89 list = report->list.next; in hiddev_lookup_report()
90 if (list == &report_enum->report_list) in hiddev_lookup_report()
93 report = list_entry(list, struct hid_report, list); in hiddev_lookup_report()
123 list_for_each_entry(report, &report_enum->report_list, list) { in hiddev_lookup_usage()
144 struct hiddev_list *list; in hiddev_send_event() local
148 list_for_each_entry(list, &hiddev->list, node) { in hiddev_send_event()
150 (list->flags & HIDDEV_FLAG_REPORT) != 0) { in hiddev_send_event()
[all …]
/Linux-v5.10/net/netlabel/
Dnetlabel_addrlist.c5 * This file contains network address list functions used to manage ordered
19 #include <linux/list.h>
32 * Address List Functions
38 * @head: the list head
41 * Searches the IPv4 address list given by @head. If a matching address entry
51 list_for_each_entry_rcu(iter, head, list) in netlbl_af4list_search()
62 * @head: the list head
65 * Searches the IPv4 address list given by @head. If an exact match if found
76 list_for_each_entry_rcu(iter, head, list) in netlbl_af4list_search_exact()
88 * @head: the list head
[all …]
/Linux-v5.10/drivers/gpu/drm/amd/amdgpu/
Damdgpu_bo_list.c41 struct amdgpu_bo_list *list = container_of(rcu, struct amdgpu_bo_list, in amdgpu_bo_list_free_rcu() local
44 kvfree(list); in amdgpu_bo_list_free_rcu()
49 struct amdgpu_bo_list *list = container_of(ref, struct amdgpu_bo_list, in amdgpu_bo_list_free() local
53 amdgpu_bo_list_for_each_entry(e, list) { in amdgpu_bo_list_free()
59 call_rcu(&list->rhead, amdgpu_bo_list_free_rcu); in amdgpu_bo_list_free()
68 struct amdgpu_bo_list *list; in amdgpu_bo_list_create() local
80 list = kvmalloc(size, GFP_KERNEL); in amdgpu_bo_list_create()
81 if (!list) in amdgpu_bo_list_create()
84 kref_init(&list->refcount); in amdgpu_bo_list_create()
85 list->gds_obj = NULL; in amdgpu_bo_list_create()
[all …]
/Linux-v5.10/fs/
Dio-wq.h42 struct io_wq_work_list *list) in wq_list_add_after() argument
49 list->last = node; in wq_list_add_after()
53 struct io_wq_work_list *list) in wq_list_add_tail() argument
55 if (!list->first) { in wq_list_add_tail()
56 list->last = node; in wq_list_add_tail()
57 WRITE_ONCE(list->first, node); in wq_list_add_tail()
59 list->last->next = node; in wq_list_add_tail()
60 list->last = node; in wq_list_add_tail()
64 static inline void wq_list_cut(struct io_wq_work_list *list, in wq_list_cut() argument
68 /* first in the list, if prev==NULL */ in wq_list_cut()
[all …]
/Linux-v5.10/drivers/hid/intel-ish-hid/ishtp/
Dclient-buffers.c37 list_add_tail(&rb->list, &cl->free_rb_list.list); in ishtp_cl_alloc_rx_ring()
80 list_add_tail(&tx_buf->list, &cl->tx_free_list.list); in ishtp_cl_alloc_tx_ring()
104 while (!list_empty(&cl->free_rb_list.list)) { in ishtp_cl_free_rx_ring()
105 rb = list_entry(cl->free_rb_list.list.next, struct ishtp_cl_rb, in ishtp_cl_free_rx_ring()
106 list); in ishtp_cl_free_rx_ring()
107 list_del(&rb->list); in ishtp_cl_free_rx_ring()
114 while (!list_empty(&cl->in_process_list.list)) { in ishtp_cl_free_rx_ring()
115 rb = list_entry(cl->in_process_list.list.next, in ishtp_cl_free_rx_ring()
116 struct ishtp_cl_rb, list); in ishtp_cl_free_rx_ring()
117 list_del(&rb->list); in ishtp_cl_free_rx_ring()
[all …]

12345678910>>...254