Home
last modified time | relevance | path

Searched refs:list (Results 1 – 25 of 975) sorted by relevance

12345678910>>...39

/linux-4.19.296/drivers/clk/samsung/
Dclk.c100 const struct samsung_clock_alias *list, in samsung_clk_register_alias() argument
106 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_alias()
107 if (!list->id) { in samsung_clk_register_alias()
113 clk_hw = ctx->clk_data.hws[list->id]; in samsung_clk_register_alias()
116 list->id); in samsung_clk_register_alias()
120 ret = clk_hw_register_clkdev(clk_hw, list->alias, in samsung_clk_register_alias()
121 list->dev_name); in samsung_clk_register_alias()
124 __func__, list->alias); in samsung_clk_register_alias()
130 const struct samsung_fixed_rate_clock *list, in samsung_clk_register_fixed_rate() argument
136 for (idx = 0; idx < nr_clk; idx++, list++) { in samsung_clk_register_fixed_rate()
[all …]
/linux-4.19.296/drivers/clk/rockchip/
Dclk.c419 struct rockchip_pll_clock *list, in rockchip_clk_register_plls() argument
425 for (idx = 0; idx < nr_pll; idx++, list++) { in rockchip_clk_register_plls()
426 clk = rockchip_clk_register_pll(ctx, list->type, list->name, in rockchip_clk_register_plls()
427 list->parent_names, list->num_parents, in rockchip_clk_register_plls()
428 list->con_offset, grf_lock_offset, in rockchip_clk_register_plls()
429 list->lock_shift, list->mode_offset, in rockchip_clk_register_plls()
430 list->mode_shift, list->rate_table, in rockchip_clk_register_plls()
431 list->flags, list->pll_flags); in rockchip_clk_register_plls()
434 list->name); in rockchip_clk_register_plls()
438 rockchip_clk_add_lookup(ctx, clk, list->id); in rockchip_clk_register_plls()
[all …]
/linux-4.19.296/drivers/hid/
Dhidraw.c49 struct hidraw_list *list = file->private_data; in hidraw_read() local
53 mutex_lock(&list->read_mutex); in hidraw_read()
56 if (list->head == list->tail) { in hidraw_read()
57 add_wait_queue(&list->hidraw->wait, &wait); in hidraw_read()
60 while (list->head == list->tail) { in hidraw_read()
65 if (!list->hidraw->exist) { in hidraw_read()
75 mutex_unlock(&list->read_mutex); in hidraw_read()
77 mutex_lock(&list->read_mutex); in hidraw_read()
82 remove_wait_queue(&list->hidraw->wait, &wait); in hidraw_read()
88 len = list->buffer[list->tail].len > count ? in hidraw_read()
[all …]
Dhid-debug.c636 struct list_head *list; in hid_dump_device() local
642 list = report_enum->report_list.next; in hid_dump_device()
643 while (list != &report_enum->report_list) { in hid_dump_device()
644 report = (struct hid_report *) list; in hid_dump_device()
656 list = list->next; in hid_dump_device()
665 struct hid_debug_list *list; in hid_debug_event() local
669 list_for_each_entry(list, &hdev->debug_list, node) in hid_debug_event()
670 kfifo_in(&list->hid_debug_fifo, buf, strlen(buf)); in hid_debug_event()
1032 list_for_each_entry(report, &hid->report_enum[k].report_list, list) { in hid_dump_input_mapping()
1085 struct hid_debug_list *list; in hid_debug_events_open() local
[all …]
/linux-4.19.296/drivers/hid/usbhid/
Dhiddev.c75 struct list_head *list; in hiddev_lookup_report() local
92 list = report_enum->report_list.next; in hiddev_lookup_report()
93 report = list_entry(list, struct hid_report, list); in hiddev_lookup_report()
102 list = report->list.next; in hiddev_lookup_report()
103 if (list == &report_enum->report_list) in hiddev_lookup_report()
106 report = list_entry(list, struct hid_report, list); in hiddev_lookup_report()
136 list_for_each_entry(report, &report_enum->report_list, list) { in hiddev_lookup_usage()
157 struct hiddev_list *list; in hiddev_send_event() local
161 list_for_each_entry(list, &hiddev->list, node) { in hiddev_send_event()
163 (list->flags & HIDDEV_FLAG_REPORT) != 0) { in hiddev_send_event()
[all …]
/linux-4.19.296/fs/xfs/scrub/
Dbitmap.c37 INIT_LIST_HEAD(&bmr->list); in xfs_bitmap_set()
40 list_add_tail(&bmr->list, &bitmap->list); in xfs_bitmap_set()
54 list_del(&bmr->list); in xfs_bitmap_destroy()
64 INIT_LIST_HEAD(&bitmap->list); in xfs_bitmap_init()
77 ap = container_of(a, struct xfs_bitmap_range, list); in xfs_bitmap_range_cmp()
78 bp = container_of(b, struct xfs_bitmap_range, list); in xfs_bitmap_range_cmp()
117 if (list_empty(&bitmap->list) || list_empty(&sub->list)) in xfs_bitmap_disunion()
119 ASSERT(!list_empty(&sub->list)); in xfs_bitmap_disunion()
121 list_sort(NULL, &bitmap->list, xfs_bitmap_range_cmp); in xfs_bitmap_disunion()
122 list_sort(NULL, &sub->list, xfs_bitmap_range_cmp); in xfs_bitmap_disunion()
[all …]
Dbitmap.h10 struct list_head list; member
16 struct list_head list; member
23 list_for_each_entry_safe((bex), (n), &(bitmap)->list, list)
26 list_for_each_entry_safe((bex), (n), &(bitmap)->list, list) \
/linux-4.19.296/drivers/hid/intel-ish-hid/ishtp/
Dclient-buffers.c46 list_add_tail(&rb->list, &cl->free_rb_list.list); in ishtp_cl_alloc_rx_ring()
87 list_add_tail(&tx_buf->list, &cl->tx_free_list.list); in ishtp_cl_alloc_tx_ring()
110 while (!list_empty(&cl->free_rb_list.list)) { in ishtp_cl_free_rx_ring()
111 rb = list_entry(cl->free_rb_list.list.next, struct ishtp_cl_rb, in ishtp_cl_free_rx_ring()
112 list); in ishtp_cl_free_rx_ring()
113 list_del(&rb->list); in ishtp_cl_free_rx_ring()
120 while (!list_empty(&cl->in_process_list.list)) { in ishtp_cl_free_rx_ring()
121 rb = list_entry(cl->in_process_list.list.next, in ishtp_cl_free_rx_ring()
122 struct ishtp_cl_rb, list); in ishtp_cl_free_rx_ring()
123 list_del(&rb->list); in ishtp_cl_free_rx_ring()
[all …]
Dclient.c38 list_for_each_entry_safe(rb, next, &cl->dev->read_list.list, list) in ishtp_read_list_flush()
40 list_del(&rb->list); in ishtp_read_list_flush()
86 INIT_LIST_HEAD(&cl->free_rb_list.list); in ishtp_cl_init()
87 INIT_LIST_HEAD(&cl->tx_list.list); in ishtp_cl_init()
88 INIT_LIST_HEAD(&cl->tx_free_list.list); in ishtp_cl_init()
89 INIT_LIST_HEAD(&cl->in_process_list.list); in ishtp_cl_init()
468 if (list_empty(&cl->free_rb_list.list)) { in ishtp_cl_read_start()
476 rb = list_entry(cl->free_rb_list.list.next, struct ishtp_cl_rb, list); in ishtp_cl_read_start()
477 list_del_init(&rb->list); in ishtp_cl_read_start()
483 INIT_LIST_HEAD(&rb->list); in ishtp_cl_read_start()
[all …]
/linux-4.19.296/include/linux/
Dlist.h26 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
28 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
29 list->prev = list; in INIT_LIST_HEAD()
168 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
170 __list_del_entry(list); in list_move()
171 list_add(list, head); in list_move()
179 static inline void list_move_tail(struct list_head *list, in list_move_tail() argument
182 __list_del_entry(list); in list_move_tail()
183 list_add_tail(list, head); in list_move_tail()
191 static inline int list_is_last(const struct list_head *list, in list_is_last() argument
[all …]
Drhashtable.h439 #define rhl_for_each_rcu(pos, list) \ argument
440 for (pos = list; pos; pos = rcu_dereference_raw(pos->next))
452 #define rhl_for_each_entry_rcu(tpos, pos, list, member) \ argument
453 for (pos = list; pos && rht_entry(tpos, pos, member); \
613 struct rhlist_head *list; in __rhashtable_insert_fast() local
630 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
633 RCU_INIT_POINTER(list->next, plist); in __rhashtable_insert_fast()
635 RCU_INIT_POINTER(list->rhead.next, head); in __rhashtable_insert_fast()
655 struct rhlist_head *list; in __rhashtable_insert_fast() local
657 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
[all …]
/linux-4.19.296/drivers/isdn/mISDN/
Ddsp_pipeline.c43 struct list_head list; member
48 struct list_head list; member
84 list_del(&entry->list); in mISDN_dsp_dev_release()
100 INIT_LIST_HEAD(&entry->list); in mISDN_dsp_element_register()
113 list_add_tail(&entry->list, &dsp_elements); in mISDN_dsp_element_register()
147 list_for_each_entry_safe(entry, n, &dsp_elements, list) in mISDN_dsp_element_unregister()
183 list_for_each_entry_safe(entry, n, &dsp_elements, list) { in dsp_pipeline_module_exit()
184 list_del(&entry->list); in dsp_pipeline_module_exit()
200 INIT_LIST_HEAD(&pipeline->list); in dsp_pipeline_init()
213 list_for_each_entry_safe(entry, n, &pipeline->list, list) { in _dsp_pipeline_destroy()
[all …]
Dtimerdev.c46 struct list_head list; member
76 struct list_head *list = &dev->pending; in mISDN_close() local
83 while (!list_empty(list)) { in mISDN_close()
84 timer = list_first_entry(list, struct mISDNtimer, list); in mISDN_close()
89 list_del(&timer->list); in mISDN_close()
94 list_for_each_entry_safe(timer, next, &dev->expired, list) { in mISDN_close()
105 struct list_head *list = &dev->expired; in mISDN_read() local
117 while (list_empty(list) && (dev->work == 0)) { in mISDN_read()
122 !list_empty(list))); in mISDN_read()
129 if (!list_empty(list)) { in mISDN_read()
[all …]
/linux-4.19.296/crypto/
Dalgapi.c106 spawn = list_first_entry_or_null(stack, struct crypto_spawn, list); in crypto_more_spawns()
110 n = list_next_entry(spawn, list); in crypto_more_spawns()
112 if (spawn->alg && &n->list != stack && !n->alg) in crypto_more_spawns()
113 n->alg = (n->list.next == stack) ? alg : in crypto_more_spawns()
114 &list_next_entry(n, list)->inst->alg; in crypto_more_spawns()
116 list_move(&spawn->list, secondary_spawns); in crypto_more_spawns()
118 return &n->list == stack ? top : &n->inst->alg.cra_users; in crypto_more_spawns()
122 struct list_head *list) in crypto_remove_instance() argument
130 if (hlist_unhashed(&inst->list)) in crypto_remove_instance()
136 list_move(&inst->alg.cra_list, list); in crypto_remove_instance()
[all …]
/linux-4.19.296/fs/notify/
Dnotification.c82 if (!list_empty(&event->list)) { in fsnotify_destroy_event()
84 WARN_ON(!list_empty(&event->list)); in fsnotify_destroy_event()
103 struct list_head *list = &group->notification_list; in fsnotify_add_event() local
118 if (!list_empty(&group->overflow_event->list)) { in fsnotify_add_event()
126 if (!list_empty(list) && merge) { in fsnotify_add_event()
127 ret = merge(list, event); in fsnotify_add_event()
136 list_add_tail(&event->list, list); in fsnotify_add_event()
157 struct fsnotify_event, list); in fsnotify_remove_first_event()
162 list_del_init(&event->list); in fsnotify_remove_first_event()
177 struct fsnotify_event, list); in fsnotify_peek_first_event()
[all …]
/linux-4.19.296/drivers/misc/mic/scif/
Dscif_rma_list.c31 struct scif_window *prev = list_entry(head, struct scif_window, list); in scif_insert_tcw()
34 INIT_LIST_HEAD(&window->list); in scif_insert_tcw()
37 curr = list_entry(head->prev, struct scif_window, list); in scif_insert_tcw()
39 list_add_tail(&window->list, head); in scif_insert_tcw()
44 curr = list_entry(item, struct scif_window, list); in scif_insert_tcw()
49 list_add(&window->list, &prev->list); in scif_insert_tcw()
63 INIT_LIST_HEAD(&window->list); in scif_insert_window()
65 curr = list_entry(item, struct scif_window, list); in scif_insert_window()
71 list_add(&window->list, head); in scif_insert_window()
73 list_add(&window->list, &prev->list); in scif_insert_window()
[all …]
/linux-4.19.296/include/uapi/linux/
Dtipc_config.h327 static inline void TLV_LIST_INIT(struct tlv_list_desc *list, in TLV_LIST_INIT() argument
330 list->tlv_ptr = (struct tlv_desc *)data; in TLV_LIST_INIT()
331 list->tlv_space = space; in TLV_LIST_INIT()
334 static inline int TLV_LIST_EMPTY(struct tlv_list_desc *list) in TLV_LIST_EMPTY() argument
336 return (list->tlv_space == 0); in TLV_LIST_EMPTY()
339 static inline int TLV_LIST_CHECK(struct tlv_list_desc *list, __u16 exp_type) in TLV_LIST_CHECK() argument
341 return TLV_CHECK(list->tlv_ptr, list->tlv_space, exp_type); in TLV_LIST_CHECK()
344 static inline void *TLV_LIST_DATA(struct tlv_list_desc *list) in TLV_LIST_DATA() argument
346 return TLV_DATA(list->tlv_ptr); in TLV_LIST_DATA()
349 static inline void TLV_LIST_STEP(struct tlv_list_desc *list) in TLV_LIST_STEP() argument
[all …]
/linux-4.19.296/drivers/of/unittest-data/
Dtests-phandle.dtsi42 phandle-list = <&provider1 1>,
49 phandle-list-names = "first", "second", "third";
51 phandle-list-bad-phandle = <12345678 0 0>;
52 phandle-list-bad-args = <&provider2 1 0>,
57 unterminated-string-list = "first", "second", [40 41 42 43];
61 phandle-list = <&provider1 1>,
68 phandle-list-bad-phandle = <12345678 0 0>;
69 phandle-list-bad-args = <&provider2 1 0>,
/linux-4.19.296/drivers/reset/
Dreset-ti-syscon.c173 const __be32 *list; in ti_syscon_reset_probe() local
185 list = of_get_property(np, "ti,reset-bits", &size); in ti_syscon_reset_probe()
186 if (!list || (size / sizeof(*list)) % 7 != 0) { in ti_syscon_reset_probe()
191 nr_controls = (size / sizeof(*list)) / 7; in ti_syscon_reset_probe()
198 controls[i].assert_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
199 controls[i].assert_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
200 controls[i].deassert_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
201 controls[i].deassert_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
202 controls[i].status_offset = be32_to_cpup(list++); in ti_syscon_reset_probe()
203 controls[i].status_bit = be32_to_cpup(list++); in ti_syscon_reset_probe()
[all …]
/linux-4.19.296/drivers/s390/char/
Draw3270.h99 struct list_head list; /* list head for request queueing. */ member
124 return list_empty(&rq->list); in raw3270_request_final()
151 struct list_head list; member
196 struct list_head list; member
210 struct list_head list; member
224 list_for_each_entry(cs, free_list, list) { in alloc_string()
234 list_del(&cs->list); in alloc_string()
236 INIT_LIST_HEAD(&cs->list); in alloc_string()
252 if (list_entry(p, struct string, list) > cs) in free_string()
258 tmp = list_entry(left->next, struct string, list); in free_string()
[all …]
Dsclp_con.c58 list_del(&buffer->list); in sclp_conbuf_callback()
65 struct sclp_buffer, list); in sclp_conbuf_callback()
86 list_add_tail(&sclp_conbuf->list, &sclp_con_outqueue); in sclp_conbuf_emit()
93 list); in sclp_conbuf_emit()
139 struct list_head *list; in sclp_console_drop_buffer() local
145 list = sclp_con_outqueue.next; in sclp_console_drop_buffer()
148 list = list->next; in sclp_console_drop_buffer()
149 if (list == &sclp_con_outqueue) in sclp_console_drop_buffer()
151 list_del(list); in sclp_console_drop_buffer()
152 buffer = list_entry(list, struct sclp_buffer, list); in sclp_console_drop_buffer()
/linux-4.19.296/lib/
Dparman.c96 typeof(struct parman_item), list); in parman_prio_first_item()
107 typeof(struct parman_item), list); in parman_prio_last_item()
118 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) { in parman_lsort_new_index_find()
144 list_move_tail(&item->list, &prio->item_list); in parman_prio_shift_down()
159 list_move(&item->list, &prio->item_list); in parman_prio_shift_up()
172 list_del(&item->list); in parman_prio_item_remove()
177 list_del(&last_item->list); in parman_prio_item_remove()
178 list_replace(&item->list, &last_item->list); in parman_prio_item_remove()
197 list_for_each_entry_reverse(prio2, &parman->prio_list, list) { in parman_lsort_item_add()
203 list_add_tail(&item->list, &prio->item_list); in parman_lsort_item_add()
[all …]
Dirq_poll.c37 list_add_tail(&iop->list, this_cpu_ptr(&blk_cpu_iopoll)); in irq_poll_sched()
53 list_del(&iop->list); in __irq_poll_complete()
80 struct list_head *list = this_cpu_ptr(&blk_cpu_iopoll); in irq_poll_softirq() local
86 while (!list_empty(list)) { in irq_poll_softirq()
105 iop = list_entry(list->next, struct irq_poll, list); in irq_poll_softirq()
128 list_move_tail(&iop->list, list); in irq_poll_softirq()
182 INIT_LIST_HEAD(&iop->list); in irq_poll_init()
Dlist_sort.c110 struct list_head *list; in list_sort() local
118 list = head->next; in list_sort()
120 while (list) { in list_sort()
121 struct list_head *cur = list; in list_sort()
122 list = list->next; in list_sort()
141 list = merge(priv, cmp, part[lev], list); in list_sort()
143 merge_and_restore_back_links(priv, cmp, head, part[max_lev], list); in list_sort()
Drhashtable.c331 list_for_each_entry(walker, &old_tbl->walkers, list) in rhashtable_rehash_table()
495 struct rhlist_head *list; in rhashtable_lookup_one() local
510 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_lookup_one()
513 RCU_INIT_POINTER(list->next, plist); in rhashtable_lookup_one()
515 RCU_INIT_POINTER(list->rhead.next, head); in rhashtable_lookup_one()
564 struct rhlist_head *list; in rhashtable_insert_one() local
566 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_insert_one()
567 RCU_INIT_POINTER(list->next, NULL); in rhashtable_insert_one()
680 list_add(&iter->walker.list, &iter->walker.tbl->walkers); in rhashtable_walk_enter()
695 list_del(&iter->walker.list); in rhashtable_walk_exit()
[all …]

12345678910>>...39