Searched refs:list (Results 251 - 275 of 5576) sorted by relevance

<<11121314151617181920>>

/linux-master/scripts/dtc/libfdt/
H A Dfdt_ro.c725 const char *list, *end; local
728 list = fdt_getprop(fdt, nodeoffset, property, &length);
729 if (!list)
732 end = list + length;
734 while (list < end) {
735 length = strnlen(list, end - list) + 1;
738 if (list + length > end)
741 list += length;
752 const char *list, *en local
782 const char *list, *end; local
[all...]
/linux-master/net/netfilter/ipvs/
H A Dip_vs_lblcr.c43 #include <linux/list.h>
87 struct list_head list; /* list link */ member in struct:ip_vs_dest_set_elem
95 struct list_head list; /* destination list */ member in struct:ip_vs_dest_set
105 list_for_each_entry(e, &set->list, list) {
118 list_add_rcu(&e->list, &set->list);
138 list_for_each_entry(e, &set->list, lis
259 struct hlist_node list; member in struct:ip_vs_lblcr_entry
[all...]
/linux-master/sound/aoa/core/
H A Dcore.c10 #include <linux/list.h>
67 list_add(&codec->list, &codec_list);
74 list_del(&codec->list);
107 list_for_each_entry(c, &codec_list, list) {
122 list_for_each_entry(c, &codec_list, list) {
/linux-master/net/batman-adv/
H A Dbat_algo.c10 #include <linux/list.h>
46 hlist_for_each_entry(bat_algo_ops_tmp, &batadv_algo_list, list) {
86 INIT_HLIST_NODE(&bat_algo_ops->list);
87 hlist_add_head(&bat_algo_ops->list, &batadv_algo_list);
195 hlist_for_each_entry(bat_algo_ops, &batadv_algo_list, list) {
/linux-master/tools/testing/selftests/timers/
H A Dthreadtest.c26 /* serializes shared list access */
41 void checklist(struct timespec *list, int size) argument
46 /* scan the list */
48 a = &list[i];
49 b = &list[i+1];
61 /* dump the list */
66 printf("%lu:%lu\n", list[j].tv_sec, list[j].tv_nsec);
77 /* The shared thread shares a global list
84 /* protect the list */
[all...]
/linux-master/drivers/net/ethernet/microchip/lan966x/
H A Dlan966x_taprio.c26 /* TAPRIO list states */
56 u32 list)
60 lan_rmw(QSYS_TAS_CFG_CTRL_LIST_NUM_SET(list),
78 u32 list)
86 /* It is required to try multiple times to set the state of list,
116 /* If the list was in operating and now is in terminating or
117 * admin, then is OK to exit but it needs to wait until the list
136 /* If the list was in operating mode, it could be stopped while some
152 u32 i, list, state; local
156 list
55 lan966x_taprio_list_index_state_get(struct lan966x_port *port, u32 list) argument
77 lan966x_taprio_list_shutdown(struct lan966x_port *port, u32 list) argument
177 int list[LAN966X_TAPRIO_ENTRIES_PER_PORT]; local
272 u32 num_free, state, list; local
327 lan966x_taprio_gcl_setup(struct lan966x_port *port, struct tc_taprio_qopt_offload *qopt, int list) argument
[all...]
/linux-master/drivers/media/platform/renesas/
H A Drcar-fcp.c12 #include <linux/list.h>
23 struct list_head list; member in struct:rcar_fcp_device
38 * Search the list of registered FCP instances for the instance corresponding to
50 list_for_each_entry(fcp, &fcp_devices, list) {
139 list_add_tail(&fcp->list, &fcp_devices);
152 list_del(&fcp->list);
/linux-master/kernel/module/
H A Dtracking.c12 #include <linux/list.h>
29 list_for_each_entry_rcu(mod_taint, &unloaded_tainted_modules, list,
43 list_add_rcu(&mod_taint->list, &unloaded_tainted_modules);
57 list) {
93 mod_taint = list_entry(p, struct mod_unload_taint, list);
/linux-master/arch/x86/pci/
H A Dbus_numa.c14 list_for_each_entry(info, &pci_root_infos, list)
54 list_for_each_entry(root_res, &info->resources, list)
90 list_add_tail(&info->list, &pci_root_infos);
111 list_for_each_entry(root_res, &info->resources, list) {
145 list_add_tail(&root_res->list, &info->resources);
/linux-master/fs/btrfs/
H A Dlru_cache.c28 list_for_each_entry(entry, head, list) {
73 struct list_head *prev = entry->list.prev;
78 list_del(&entry->list);
85 * If previous element in the list entry->list is now empty, it
121 list_add_tail(&new_entry->list, head);
128 list_add_tail(&new_entry->list, head);
/linux-master/block/
H A Dholder.c6 struct list_head list; member in struct:bd_holder_disk
18 list_for_each_entry(holder, &disk->slave_bdevs, list)
101 INIT_LIST_HEAD(&holder->list);
111 list_add(&holder->list, &disk->slave_bdevs);
151 list_del_init(&holder->list);
/linux-master/drivers/s390/crypto/
H A Dzcrypt_api.h90 struct list_head list; /* zcrypt ops list. */ member in struct:zcrypt_ops
97 struct list_head list; /* Device list. */ member in struct:zcrypt_card
115 struct list_head list; /* Device list. */ member in struct:zcrypt_queue
136 list_for_each_entry(_zc, &zcrypt_card_list, list)
139 list_for_each_entry(_zq, &(_zc)->zqueues, list)
/linux-master/lib/
H A Drhashtable.c10 * Rewritten with rehash code from br_multicast plus single list
338 list_for_each_entry(walker, &old_tbl->walkers, list)
505 struct rhlist_head *list; local
520 list = container_of(obj, struct rhlist_head, rhead);
523 RCU_INIT_POINTER(list->next, plist);
525 RCU_INIT_POINTER(list->rhead.next, head);
572 struct rhlist_head *list; local
574 list = container_of(obj, struct rhlist_head, rhead);
575 RCU_INIT_POINTER(list->next, NULL);
578 /* bkt is always the head of the list, s
760 struct rhlist_head *list; local
794 struct rhlist_head *list = iter->list; local
865 struct rhlist_head *list = iter->list; local
904 struct rhlist_head *list = iter->list; local
1104 struct rhlist_head *list; local
[all...]
H A Dtest_list_sort.c6 #include <linux/list.h>
13 * The pattern of set bits in the list length determines which cases
23 struct list_head list; member in struct:debug_el
46 /* `priv` is the test pointer so check() can fail the test if the list is invalid. */
51 ela = container_of(a, struct debug_el, list);
52 elb = container_of(b, struct debug_el, list);
79 list_add_tail(&el->list, &head);
89 "list is corrupted");
92 KUNIT_ASSERT_LE_MSG(test, cmp_result, 0, "list is not sorted");
94 el = container_of(cur, struct debug_el, list);
[all...]
H A Dclosure.c64 * closure_wake_up - wake up all closures on a wait list, without memory barrier
68 struct llist_node *list; local
72 list = llist_del_all(&wait_list->list);
74 /* We first reverse the list to preserve FIFO ordering and fairness */
75 reverse = llist_reverse_order(list);
78 llist_for_each_entry_safe(cl, t, reverse, list) {
100 llist_add(&cl->list, &waitlist->list);
/linux-master/sound/soc/sof/
H A Dsof-audio.c35 list_for_each_entry(sroute, &sdev->route_list, list)
155 * widget list and it needs to be set up before the widgets in the pipeline
268 list_for_each_entry(sroute, &sdev->route_list, list)
296 struct snd_soc_dapm_widget_list *list, int dir)
312 for_each_dapm_widgets(list, i, widget) {
317 if (!widget_in_list(list, p->sink))
328 for_each_dapm_widgets(list, i, widget) {
333 if (!widget_in_list(list, p->source))
346 * The above loop handles connections between widgets that belong to the DAPM widget list.
351 list_for_each_entry(sroute, &sdev->route_list, list) {
295 sof_setup_pipeline_connections(struct snd_sof_dev *sdev, struct snd_soc_dapm_widget_list *list, int dir) argument
406 sof_unprepare_widgets_in_path(struct snd_sof_dev *sdev, struct snd_soc_dapm_widget *widget, struct snd_soc_dapm_widget_list *list) argument
442 sof_prepare_widgets_in_path(struct snd_sof_dev *sdev, struct snd_soc_dapm_widget *widget, struct snd_pcm_hw_params *fe_params, struct snd_sof_platform_stream_params *platform_params, struct snd_pcm_hw_params *pipeline_params, int dir, struct snd_soc_dapm_widget_list *list) argument
507 struct snd_soc_dapm_widget_list *list = spcm->stream[dir].list; local
548 struct snd_soc_dapm_widget_list *list = spcm->stream[dir].list; local
612 struct snd_soc_dapm_widget_list *list = spcm->stream[dir].list; local
681 struct snd_soc_dapm_widget_list *list = spcm->stream[dir].list; local
765 struct snd_soc_dapm_widget_list *list = spcm->stream[dir].list; local
[all...]
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/timer/
H A Dbase.c86 /* Move to completed list. We'll drop the lock before
108 struct nvkm_alarm *list; local
111 /* Remove alarm from pending list.
113 * This both protects against the corruption of the list,
120 /* Insert into pending list, ordered earliest to latest. */
122 list_for_each_entry(list, &tmr->alarms, head) {
123 if (list->timestamp > alarm->timestamp)
127 list_add_tail(&alarm->head, &list->head);
130 list = list_first_entry(&tmr->alarms, typeof(*list), hea
[all...]
/linux-master/drivers/platform/x86/dell/
H A Ddell-wmi-descriptor.c11 #include <linux/list.h>
19 struct list_head list; member in struct:descriptor_priv
45 list);
63 list);
81 list);
164 list_add_tail(&priv->list, &wmi_list);
182 list_del(&priv->list);
/linux-master/drivers/crypto/virtio/
H A Dvirtio_crypto_mgr.c8 #include <linux/list.h>
17 /* The table_lock protects the above global list and num_devices */
28 * Function adds virtio crypto device to the global list.
47 list_entry(itr, struct virtio_crypto, list);
55 list_add_tail(&vcrypto_dev->list, &virtio_crypto_table);
79 list_del(&vcrypto_dev->list);
102 list);
192 list_for_each_entry(tmp_dev, virtcrypto_devmgr_get_head(), list) {
211 virtcrypto_devmgr_get_head(), list) {
/linux-master/fs/squashfs/
H A Ddecompressor_multi.c48 struct list_head list; member in struct:decomp_stream
56 list_add(&decomp_strm->list, &stream->strm_list);
94 list_add(&decomp_strm->list, &stream->strm_list);
113 struct decomp_stream, list);
114 list_del(&decomp_strm->list);
137 struct decomp_stream, list);
138 list_del(&decomp_strm->list);
/linux-master/kernel/rcu/
H A Dtiny.c110 struct rcu_head *next, *list; local
113 /* Move the ready-to-invoke callbacks to a local list. */
120 list = rcu_ctrlblk.rcucblist;
128 /* Invoke the callbacks on the local list. */
129 while (list) {
130 next = list->next;
132 debug_rcu_head_unqueue(list);
134 rcu_reclaim_tiny(list);
136 list = next;
/linux-master/drivers/media/platform/samsung/exynos4-is/
H A Dfimc-lite.h95 * @list: list head for the buffers queue
101 struct list_head list; member in struct:flite_buffer
194 list_add_tail(&buf->list, &dev->active_buf_q);
201 struct flite_buffer, list);
202 list_del(&buf->list);
209 list_add_tail(&buf->list, &dev->pending_buf_q);
216 struct flite_buffer, list);
217 list_del(&buf->list);
/linux-master/scripts/kconfig/
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) argument
53 list->next = list;
54 list->prev = list;
60 * This is only for internal list manipulatio
135 list_is_head(const struct list_head *list, const struct list_head *head) argument
[all...]
/linux-master/kernel/
H A Daudit_tree.c19 struct list_head list; member in struct:audit_tree
34 struct list_head list; member in struct:audit_chunk::audit_node
60 * Rules have struct list_head rlist forming a list of rules over
68 * tree.chunks anchors chunk.owners[].list hash_lock
84 * node.index allows to get from node.list to containing chunk.
103 INIT_LIST_HEAD(&tree->list);
202 INIT_LIST_HEAD(&chunk->owners[i].list);
228 struct list_head *list; local
237 list = chunk_hash(chunk->key);
238 list_add_rcu(&chunk->hash, list);
245 struct list_head *list = chunk_hash(key); local
974 struct list_head *list = &context->killed_trees; local
[all...]
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/
H A Duar.c15 * copyright notice, this list of conditions and the following
19 * copyright notice, this list of conditions and the following
85 list_del(&up->list);
169 if (!list_empty(&mdev->priv.bfregs.reg_head.list)) {
170 ret = list_first_entry(&mdev->priv.bfregs.reg_head.list,
171 struct mlx5_uars_page, list);
178 list_add(&ret->list, &mdev->priv.bfregs.reg_head.list);
217 head = &bfregs->wc_head.list;
220 head = &bfregs->reg_head.list;
[all...]

Completed in 193 milliseconds

<<11121314151617181920>>