Home
last modified time | relevance | path

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

12345678910>>...225

/linux/drivers/clk/rockchip/
H A Dclk.c433 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/include/linux/
H A Dlist.h14 * 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 …]
H A Drculist.h8 * 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
37 * Any list traversed with list_bidir_prev_rcu() must never use
[all …]
H A 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/tools/include/linux/
H A 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/tools/firewire/
H A 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/tools/perf/util/
H A Dparse-events.y34 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()
141 list_splice_tail(groups, &parse_state->list);
145 groups: /* A list of groups or events. */
148 /* Merge group into the list of events/groups. */
159 /* Merge event into the list of events/groups. */
177 struct list_head *list = $1; variable
[all …]
/linux/io_uring/
H A Dslist.h15 #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 …]
/linux/rust/kernel/
H A Dlist.rs5 //! 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
42 /// use kernel::list::*;
67 /// // Create a new empty list.
68 /// let mut list = List::new();
[all …]
/linux/scripts/include/
H A Dlist.h30 * 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/x86/
H A Dclk-cgu.c26 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 …]
/linux/drivers/net/wireless/quantenna/qtnfmac/
H A 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/drivers/hid/
H A Dhidraw.c41 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 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/net/core/
H A Ddev_addr_lists.c13 #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 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()
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 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/security/integrity/platform_certs/
H A 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, list.signature_list_size, in parse_efi_signature_list()
[all …]
/linux/net/netlabel/
H A 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/arch/sh/include/mach-kfr2r09/mach/
H A 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/tools/memory-model/scripts/
H A 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' -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/gpu/drm/amd/amdgpu/
H A Damdgpu_bo_list.c42 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()
76 struct amdgpu_bo_list *list; in amdgpu_bo_list_create() local
81 list = kvzalloc(struct_size(list, entries, num_entries), GFP_KERNEL); in amdgpu_bo_list_create()
82 if (!list) in amdgpu_bo_list_create()
85 kref_init(&list->refcount); in amdgpu_bo_list_create()
[all …]
/linux/drivers/usb/core/
H A Dphy.c11 #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/net/netfilter/
H A Dnf_conncount.c21 #include <linux/list.h>
51 struct nf_conncount_list list; member
85 static void conn_free(struct nf_conncount_list *list, in conn_free() argument
88 lockdep_assert_held(&list->list_lock); in conn_free()
90 list->count--; in conn_free()
97 find_or_evict(struct net *net, struct nf_conncount_list *list, in find_or_evict() argument
118 conn_free(list, conn); in find_or_evict()
126 struct nf_conncount_list *list, in __nf_conncount_add() argument
135 if ((u32)jiffies == list->last_gc) in __nf_conncount_add()
139 list_for_each_entry_safe(conn, conn_n, &list->head, node) { in __nf_conncount_add()
[all …]
/linux/drivers/input/
H A Dtouch-overlay.c11 #include <linux/list.h>
16 struct list_head list; member
65 * @list: pointer to the list that will hold the segments
72 int touch_overlay_map(struct list_head *list, struct input_dev *input) in touch_overlay_map() argument
95 list_add_tail(&segment->list, list); in touch_overlay_map()
104 * @list: pointer to the list that holds the segments
108 void touch_overlay_get_touchscreen_abs(struct list_head *list, u16 *x, u16 *y) in touch_overlay_get_touchscreen_abs() argument
113 list_for_each(ptr, list) { in touch_overlay_get_touchscreen_abs()
114 segment = list_entry(ptr, struct touch_overlay_segment, list); in touch_overlay_get_touchscreen_abs()
136 * @list: pointer to the list that holds the segments
[all …]

12345678910>>...225