| /linux/drivers/clk/rockchip/ |
| H A D | clk.c | 433 struct rockchip_pll_clock *list, in rockchip_clk_register_plls() argument
439 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
440 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
441 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
442 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
443 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
444 list->mode_shift, list->rate_table, in rockchip_clk_register_plls()
445 list->flags, list->pll_flags); in rockchip_clk_register_plls()
448 list->name); in rockchip_clk_register_plls()
452 rockchip_clk_set_lookup(ctx, clk, list->id); in rockchip_clk_register_plls()
[all …]
|
| /linux/lib/tests/ |
| H A 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 …]
|
| /linux/tools/include/linux/ |
| H A 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 …]
|
| /linux/tools/firewire/ |
| H A 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 …]
|
| /linux/rust/kernel/ |
| H A D | list.rs | 5 //! A linked list implementation.
25 /// A linked list.
27 /// All elements in this linked list will be [`ListArc`] references to the value. Since a value can
33 /// * If the list is empty, then `first` is null. Otherwise, `first` points at the `ListLinks`
34 /// field of the first element in the list.
35 /// * All prev/next pointers in `ListLinks` fields of items in the list are valid and form a cycle.
36 /// * For every item in the list, the list owns the associated [`ListArc`] reference and has
44 /// use kernel::list::*;
69 /// // Create a new empty list.
70 /// let mut list = List::new();
[all …]
|
| /linux/io_uring/ |
| H A D | slist.h | 13 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL)
15 #define INIT_WQ_LIST(list) do { \ argument
16 (list)->first = NULL; \
21 struct io_wq_work_list *list) in wq_list_add_after()
28 list->last = node; in wq_list_add_after()
32 struct io_wq_work_list *list)
35 if (!list->first) { in wq_list_add_tail()
36 list->last = node; in wq_list_add_tail()
37 WRITE_ONCE(list in wq_list_add_tail()
17 INIT_WQ_LIST(list) global() argument
23 wq_list_add_after(struct io_wq_work_node * node,struct io_wq_work_node * pos,struct io_wq_work_list * list) wq_list_add_after() argument
34 wq_list_add_tail(struct io_wq_work_node * node,struct io_wq_work_list * list) wq_list_add_tail() argument
47 wq_list_add_head(struct io_wq_work_node * node,struct io_wq_work_list * list) wq_list_add_head() argument
55 wq_list_cut(struct io_wq_work_list * list,struct io_wq_work_node * last,struct io_wq_work_node * prev) wq_list_cut() argument
70 __wq_list_splice(struct io_wq_work_list * list,struct io_wq_work_node * to) __wq_list_splice() argument
78 wq_list_splice(struct io_wq_work_list * list,struct io_wq_work_node * to) wq_list_splice() argument
95 wq_list_del(struct io_wq_work_list * list,struct io_wq_work_node * node,struct io_wq_work_node * prev) wq_list_del() argument
[all...] |
| /linux/tools/perf/util/ |
| H A D | parse-events.y | 34 struct list_head *list; in alloc_list() local
36 list = malloc(sizeof(*list)); in alloc_list()
37 if (!list) in alloc_list()
40 INIT_LIST_HEAD(list); in alloc_list()
41 return list; in alloc_list()
129 list_splice_tail(groups, &parse_state->list);
133 groups: /* A list of groups or events. */
136 /* Merge group into the list of events/groups. */
147 /* Merge event into the list of events/groups. */
165 struct list_head *list = $1; variable
[all …]
|
| /linux/scripts/include/ |
| H A D | list.h | 30 * Circular doubly linked list implementation.
46 * @list: list_head structure to be initialized.
48 * Initializes the list_head to point to itself. If it is a list header,
49 * the result is an empty list.
51 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
53 list->next = list; in INIT_LIST_HEAD()
54 list->prev = list; in INIT_LIST_HEAD()
60 * This is only for internal list manipulation where we know
76 * @head: list head to add it after
89 * @head: list head to add it before
[all …]
|
| /linux/drivers/clk/samsung/ |
| H A D | clk.c | 118 /* register a list of aliases */
120 const struct samsung_clock_alias *list, in samsung_clk_register_alias() argument
126 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_alias()
127 if (!list->id) { in samsung_clk_register_alias()
133 clk_hw = ctx->clk_data.hws[list->id]; in samsung_clk_register_alias()
136 list->id); in samsung_clk_register_alias()
140 ret = clk_hw_register_clkdev(clk_hw, list->alias, in samsung_clk_register_alias()
141 list->dev_name); in samsung_clk_register_alias()
144 __func__, list->alias); in samsung_clk_register_alias()
148 /* register a list of fixed clocks */
[all …]
|
| /linux/drivers/media/platform/renesas/vsp1/ |
| H A D | vsp1_dl.c | 3 * vsp1_dl.c -- R-Car VSP1 Display List
42 * struct vsp1_dl_ext_header - Extended display list header
46 * @pre_ext_dl_plist: start address of pre-extended display list bodies
48 * @post_ext_dl_plist: start address of post-extended display list bodies
80 * struct vsp1_pre_ext_dl_body - Pre Extended Display List Body
81 * @opcode: Extended display list command operation code
94 * struct vsp1_dl_body - Display list body
95 * @list: entry in the display list list of bodies
96 * @free: entry in the pool free body list
106 struct list_head list; member
[all …]
|
| /linux/drivers/net/wireless/quantenna/qtnfmac/ |
| H A 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 …]
|
| /linux/drivers/hid/ |
| H A D | hidraw.c | 41 static inline bool hidraw_is_revoked(struct hidraw_list *list) in hidraw_is_revoked() argument
43 return list->revoked; in hidraw_is_revoked()
48 struct hidraw_list *list = file->private_data; in hidraw_read() local
52 if (hidraw_is_revoked(list)) in hidraw_read()
55 mutex_lock(&list->read_mutex); in hidraw_read()
58 if (list->head == list->tail) { in hidraw_read()
59 add_wait_queue(&list->hidraw->wait, &wait); in hidraw_read()
62 while (list->head == list->tail) { in hidraw_read()
67 if (!list->hidraw->exist) { in hidraw_read()
77 mutex_unlock(&list->read_mutex); in hidraw_read()
[all …]
|
| /linux/arch/sh/include/mach-ecovec24/mach/ |
| H A D | partner-jet-setup.txt | 1 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/net/core/ |
| H A D | dev_addr_lists.c | 13 #include <linux/list.h>
18 * General list handling functions
21 static int __hw_addr_insert(struct netdev_hw_addr_list *list, in __hw_addr_insert() argument
24 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_insert()
45 rb_insert_color(&new->node, &list->tree); in __hw_addr_insert()
73 static int __hw_addr_add_ex(struct netdev_hw_addr_list *list, in __hw_addr_add_ex() argument
78 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_add_ex()
123 rb_insert_color(&ha->node, &list->tree); in __hw_addr_add_ex()
125 list_add_tail_rcu(&ha->list, &list->list); in __hw_addr_add_ex()
126 list->count++; in __hw_addr_add_ex()
[all …]
|
| /linux/drivers/net/ethernet/intel/ice/ |
| H A D | ice_fltr.c | 10 * @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()
144 * ice_fltr_add_mac_list - add list of MAC filters
146 * @list: list of filters
148 int ice_fltr_add_mac_list(struct ice_vsi *vsi, struct list_head *list) in ice_fltr_add_mac_list() argument
150 return ice_add_mac(&vsi->back->hw, list); in ice_fltr_add_mac_list()
[all …]
|
| /linux/drivers/hid/usbhid/ |
| H A D | hiddev.c | 62 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/net/netfilter/ |
| H A D | nf_conncount.c | 21 #include <linux/list.h>
52 struct nf_conncount_list list; member
86 static void conn_free(struct nf_conncount_list *list, in conn_free() argument
89 lockdep_assert_held(&list->list_lock); in conn_free()
91 list->count--; in conn_free()
98 find_or_evict(struct net *net, struct nf_conncount_list *list, in find_or_evict() argument
119 conn_free(list, conn); in find_or_evict()
166 struct nf_conncount_list *list) in __nf_conncount_add() argument
196 if ((u32)jiffies == list->last_gc && in __nf_conncount_add()
197 (list->count - list->last_gc_count) < CONNCOUNT_GC_MAX_COLLECT) in __nf_conncount_add()
[all …]
|
| /linux/security/integrity/platform_certs/ |
| H A D | efi_parser.c | 2 /* 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, list.signature_list_size, in parse_efi_signature_list()
[all …]
|
| /linux/net/netlabel/ |
| H A D | netlabel_addrlist.c | 5 * 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 …]
|
| H A D | netlabel_addrlist.h | 5 * This file contains network address list functions used to manage ordered
22 #include <linux/list.h>
27 * struct netlbl_af4list - NetLabel IPv4 address list
31 * @list: list structure, used internally
38 struct list_head list; member
42 * struct netlbl_af6list - NetLabel IPv6 address list
46 * @list: list structure, used internally
53 struct list_head list; member
56 #define __af4list_entry(ptr) container_of(ptr, struct netlbl_af4list, list)
84 &iter->list != (head); \
[all …]
|
| /linux/arch/sh/include/mach-kfr2r09/mach/ |
| H A D | partner-jet-setup.txt | 1 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/tools/memory-model/scripts/ |
| H A D | newlitmushist.sh | 11 # 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' -print | mselect7 -arch 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/drivers/usb/core/ |
| H A D | phy.c | 11 #include <linux/list.h>
19 struct list_head list; member
24 struct list_head *list) in usb_phy_roothub_add_phy_by_name() argument
37 INIT_LIST_HEAD(&roothub_entry->list); in usb_phy_roothub_add_phy_by_name()
41 list_add_tail(&roothub_entry->list, list); in usb_phy_roothub_add_phy_by_name()
47 struct list_head *list) in usb_phy_roothub_add_phy() argument
64 INIT_LIST_HEAD(&roothub_entry->list); in usb_phy_roothub_add_phy()
68 list_add_tail(&roothub_entry->list, list); in usb_phy_roothub_add_phy()
90 INIT_LIST_HEAD(&phy_roothub->list); in usb_phy_roothub_alloc()
92 if (!usb_phy_roothub_add_phy_by_name(dev, "usb2-phy", &phy_roothub->list)) in usb_phy_roothub_alloc()
[all …]
|
| /linux/drivers/gpu/drm/amd/amdgpu/ |
| H A D | amdgpu_bo_list.c | 42 struct amdgpu_bo_list *list = container_of(rcu, struct amdgpu_bo_list, in amdgpu_bo_list_free_rcu() local
44 mutex_destroy(&list->bo_list_mutex); in amdgpu_bo_list_free_rcu()
45 kvfree(list); in amdgpu_bo_list_free_rcu()
50 struct amdgpu_bo_list *list = container_of(ref, struct amdgpu_bo_list, in amdgpu_bo_list_free() local
54 amdgpu_bo_list_for_each_entry(e, list) in amdgpu_bo_list_free()
56 call_rcu(&list->rhead, amdgpu_bo_list_free_rcu); in amdgpu_bo_list_free()
74 struct amdgpu_bo_list *list; in amdgpu_bo_list_create() local
79 list = kvzalloc_flex(*list, entries, num_entries); in amdgpu_bo_list_create()
80 if (!list) in amdgpu_bo_list_create()
83 kref_init(&list->refcount); in amdgpu_bo_list_create()
[all …]
|
| /linux/drivers/hid/intel-ish-hid/ishtp/ |
| H A D | client-buffers.c | 37 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 …]
|