Searched refs:list (Results 51 - 75 of 1833) sorted by relevance

1234567891011>>

/drivers/gpu/drm/
H A Ddrm_hashtab.c168 struct hlist_node *list; local
170 list = drm_ht_find_key_rcu(ht, key);
171 if (!list)
174 *item = hlist_entry(list, struct drm_hash_item, head);
181 struct hlist_node *list; local
183 list = drm_ht_find_key(ht, key);
184 if (list) {
185 hlist_del_init_rcu(list);
/drivers/gpu/drm/nouveau/nvif/
H A 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
128 INIT_LIST_HEAD(struct list_head *list) argument
219 list_move_tail(struct list_head *list, struct list_head *head) argument
[all...]
/drivers/infiniband/core/
H A Dnetlink.c15 * copyright notice, this list of conditions and the following
19 * copyright notice, this list of conditions and the following
42 struct list_head list; member in struct:ibnl_client
68 list_for_each_entry(cur, &client_list, list) {
77 list_add_tail(&nl_client->list, &client_list);
90 list_for_each_entry_safe(cur, next, &client_list, list) {
92 list_del(&(cur->list));
148 list_for_each_entry(client, &client_list, list) {
164 pr_info("Index %d wasn't found in client list\n", index);
209 list_for_each_entry_safe(cur, next, &client_list, list) {
[all...]
/drivers/md/
H A Ddm-round-robin.c25 struct list_head list; member in struct:path_info
34 list_for_each_entry_safe(pi, next, paths, list) {
35 list_del(&pi->list);
142 list_add_tail(&pi->list, &s->valid_paths);
152 list_move(&pi->list, &s->invalid_paths);
160 list_move(&pi->list, &s->valid_paths);
172 pi = list_entry(s->valid_paths.next, struct path_info, list);
173 list_move_tail(&pi->list, &s->valid_paths);
/drivers/staging/gdm72xx/
H A Dgdm_sdio.h23 struct list_head list; member in struct:sdio_tx
43 struct list_head list; member in struct:sdio_rx
H A Dgdm_sdio.c90 t = list_entry(tx->free_list.prev, struct sdio_tx, list);
91 list_del(&t->list);
101 list_add_tail(&t->list, &tx->free_list);
112 r = list_entry(rx->free_list.prev, struct sdio_rx, list);
113 list_del(&r->list);
121 list_add_tail(&r->list, &rx->free_list);
133 list_for_each_entry_safe(t, t_next, &tx->free_list, list) {
134 list_del(&t->list);
138 list_for_each_entry_safe(t, t_next, &tx->sdu_list, list) {
139 list_del(&t->list);
[all...]
/drivers/acpi/
H A Dacpi_platform.c89 struct list_head *list; local
92 list = &acpi_parent->physical_node_list;
93 if (!list_empty(list)) {
94 entry = list_first_entry(list,
/drivers/regulator/
H A Dinternal.h26 struct list_head list; member in struct:regulator
/drivers/thunderbolt/
H A Dtunnel_pci.h18 struct list_head list; member in struct:tb_pci_tunnel
/drivers/xen/xen-pciback/
H A Dconf_space_quirks.h12 #include <linux/list.h>
/drivers/platform/goldfish/
H A Dpdev_bus.c42 struct list_head list; member in struct:pdev_bus_dev
64 list_for_each_entry_safe(pos, n, &pdev_bus_removed_devices, list) {
65 list_del(&pos->list);
69 list_for_each_entry_safe(pos, n, &pdev_bus_new_devices, list) {
70 list_del(&pos->list);
75 list_add_tail(&pos->list, &pdev_bus_registered_devices);
86 list_for_each_entry_safe(pos, n, &pdev_bus_new_devices, list) {
88 list_del(&pos->list);
93 list_for_each_entry_safe(pos, n, &pdev_bus_registered_devices, list) {
95 list_del(&pos->list);
[all...]
/drivers/s390/char/
H A Dsclp_con.c57 list_del(&buffer->list);
64 struct sclp_buffer, list);
85 list_add_tail(&sclp_conbuf->list, &sclp_con_outqueue);
92 list);
138 struct list_head *list; local
144 list = sclp_con_outqueue.next;
147 list = list->next;
148 if (list == &sclp_con_outqueue)
150 list_del(list);
[all...]
/drivers/usb/usbip/
H A Dstub.h23 #include <linux/list.h>
51 * Any of these list operations should be locked by priv_lock.
68 struct list_head list; member in struct:stub_priv
77 struct list_head list; member in struct:stub_unlink
H A Dvhci.h15 #include <linux/list.h>
58 struct list_head list; member in struct:vhci_priv
68 struct list_head list; member in struct:vhci_unlink
/drivers/hid/
H A Dhid-debug.c632 struct list_head *list; local
638 list = report_enum->report_list.next;
639 while (list != &report_enum->report_list) {
640 report = (struct hid_report *) list;
652 list = list->next;
662 struct hid_debug_list *list; local
666 list_for_each_entry(list, &hdev->debug_list, node) {
668 list->hid_debug_buf[(list
1080 struct hid_debug_list *list; local
1108 struct hid_debug_list *list = file->private_data; local
1180 struct hid_debug_list *list = file->private_data; local
1192 struct hid_debug_list *list = file->private_data; local
[all...]
/drivers/crypto/qat/qat_common/
H A Dadf_init.c26 notice, this list of conditions and the following disclaimer.
28 notice, this list of conditions and the following disclaimer in
48 #include <linux/list.h>
61 list_add(&service->list, &service_table);
86 list_del(&service->list);
157 service = list_entry(list_itr, struct service_hndl, list);
168 service = list_entry(list_itr, struct service_hndl, list);
188 service = list_entry(list_itr, struct service_hndl, list);
199 service = list_entry(list_itr, struct service_hndl, list);
252 service = list_entry(list_itr, struct service_hndl, list);
[all...]
/drivers/net/ethernet/intel/fm10k/
H A Dfm10k_ptp.c44 struct sk_buff_head *list = &interface->ts_tx_skb_queue; local
47 skb_queue_walk(list, skb) {
57 struct sk_buff_head *list = &interface->ts_tx_skb_queue; local
70 spin_lock_irqsave(&list->lock, flags);
73 * if none are present then insert skb in tail of list
77 __skb_queue_tail(list, clone);
79 spin_unlock_irqrestore(&list->lock, flags);
81 /* if list is already has one then we just free the clone */
92 struct sk_buff_head *list = &interface->ts_tx_skb_queue; local
96 spin_lock_irqsave(&list
116 struct sk_buff_head *list = &interface->ts_tx_skb_queue; local
[all...]
/drivers/net/wireless/iwlwifi/
H A Diwl-notif-wait.c41 * notice, this list of conditions and the following disclaimer.
43 * notice, this list of conditions and the following disclaimer in
87 list_for_each_entry(w, &notif_wait->notif_waits, list) {
128 list_for_each_entry(wait_entry, &notif_wait->notif_waits, list)
155 list_add(&wait_entry->list, &notif_wait->notif_waits);
171 list_del(&wait_entry->list);
188 list_del(&wait_entry->list);
/drivers/s390/scsi/
H A Dzfcp_reqlist.h17 * struct zfcp_reqlist - Container for request list (reqlist)
18 * @lock: Spinlock for protecting the hash list
19 * @list: Array of hashbuckets, each is a list of requests in this bucket
55 * zfcp_reqlist_isempty - Check whether the request list empty
58 * Returns: 1 if list is empty, 0 if not
89 list_for_each_entry(req, &rl->buckets[i], list)
137 list_del(&req->list);
162 list_add_tail(&req->list, &rl->buckets[i]);
167 * zfcp_reqlist_move - Move all entries from reqlist to simple list
171 zfcp_reqlist_move(struct zfcp_reqlist *rl, struct list_head *list) argument
[all...]
/drivers/media/platform/exynos4-is/
H A Dfimc-lite.h98 * @list: list head for the buffers queue
104 struct list_head list; member in struct:flite_buffer
200 list_add_tail(&buf->list, &dev->active_buf_q);
207 struct flite_buffer, list);
208 list_del(&buf->list);
215 list_add_tail(&buf->list, &dev->pending_buf_q);
222 struct flite_buffer, list);
223 list_del(&buf->list);
/drivers/gpu/host1x/
H A Dintr.c29 /* Wait list management */
53 list_for_each_entry_reverse(pos, queue, list)
55 list_add(&waiter->list, &pos->list);
59 list_add(&waiter->list, queue);
73 list_for_each_entry_safe(waiter, next, head, list) {
83 struct host1x_waitlist, list);
92 list_del(&waiter->list);
95 list_move_tail(&waiter->list, dest);
104 list_first_entry(head, struct host1x_waitlist, list)
[all...]
/drivers/media/platform/ti-vpe/
H A Dvpdma.c380 * create a descriptor list, the user of this list will append configuration,
381 * control and data descriptors to this list, this list will be submitted to
382 * VPDMA. VPDMA's list parser will go through each descriptor and perform the
385 int vpdma_create_desc_list(struct vpdma_desc_list *list, size_t size, int type) argument
389 r = vpdma_alloc_desc_buf(&list->buf, size);
393 list->next = list->buf.addr;
395 list
404 vpdma_reset_desc_list(struct vpdma_desc_list *list) argument
413 vpdma_free_desc_list(struct vpdma_desc_list *list) argument
428 vpdma_submit_descs(struct vpdma_data *vpdma, struct vpdma_desc_list *list) argument
480 vpdma_add_cfd_block(struct vpdma_desc_list *list, int client, struct vpdma_buf *blk, u32 dest_offset) argument
507 vpdma_add_cfd_adb(struct vpdma_desc_list *list, int client, struct vpdma_buf *adb) argument
548 vpdma_add_sync_on_channel_ctd(struct vpdma_desc_list *list, enum vpdma_channel chan) argument
626 vpdma_add_out_dtd(struct vpdma_desc_list *list, int width, const struct v4l2_rect *c_rect, const struct vpdma_data_format *fmt, dma_addr_t dma_addr, enum vpdma_channel chan, u32 flags) argument
697 vpdma_add_in_dtd(struct vpdma_desc_list *list, int width, const struct v4l2_rect *c_rect, const struct vpdma_data_format *fmt, dma_addr_t dma_addr, enum vpdma_channel chan, int field, u32 flags, int frame_width, int frame_height, int start_h, int start_v) argument
[all...]
/drivers/firmware/
H A Dmemmap.c32 * hierarchical, it's ok to organise them in a linked list. No parent
43 struct list_head list; /* entry for the linked list */ member in struct:firmware_map_entry
118 list_add(&entry->list, &map_entries_bootmem);
157 INIT_LIST_HEAD(&entry->list);
161 list_add_tail(&entry->list, &map_entries);
176 list_del(&entry->list);
212 * firmware_map_find_entry_in_list() - Search memmap entry in a given list.
216 * @list: In which to find the entry.
219 * given list
225 firmware_map_find_entry_in_list(u64 start, u64 end, const char *type, struct list_head *list) argument
[all...]
/drivers/isdn/capi/
H A Dcapilib.c17 struct list_head list; member in struct:capilib_ncci
98 list_add_tail(&np->list, head);
110 np = list_entry(l, struct capilib_ncci, list);
116 list_del(&np->list);
131 np = list_entry(l, struct capilib_ncci, list);
135 list_del(&np->list);
148 np = list_entry(l, struct capilib_ncci, list);
150 list_del(&np->list);
163 np = list_entry(l, struct capilib_ncci, list);
186 np = list_entry(l, struct capilib_ncci, list);
[all...]
/drivers/scsi/arm/
H A Dqueue.c13 * not updating internal linked list properly
15 * 30-Aug-2000 RMK Use Linux list handling and spinlocks
23 #include <linux/list.h>
31 struct list_head list; member in struct:queue_entry
69 * host-available list head, and we wouldn't
78 list_add(&q->list, &queue->free);
120 q = list_entry(l, QE_t, list);
142 * Move the entry from the "used" list onto the "free" list
145 q = list_entry(ent, QE_t, list);
[all...]

Completed in 745 milliseconds

1234567891011>>