Home
last modified time | relevance | path

Searched refs:list (Results 401 - 425 of 14041) sorted by relevance

1...<<11121314151617181920>>...562

/kernel/linux/linux-5.10/arch/um/drivers/
H A Dport_kern.c8 #include <linux/list.h>
19 struct list_head list; member
37 struct list_head list; member
60 list_del(&conn->list); in pipe_interrupt()
63 list_add(&conn->list, &conn->port->connections); in pipe_interrupt()
96 { .list = LIST_HEAD_INIT(conn->list), in port_accept()
113 list_add(&conn->list, &port->pending); in port_accept()
136 port = list_entry(ele, struct port_list, list); in port_work_proc()
167 port = list_entry(ele, struct port_list, list); in port_data()
[all...]
/kernel/linux/linux-6.6/arch/um/drivers/
H A Dport_kern.c8 #include <linux/list.h>
19 struct list_head list; member
37 struct list_head list; member
60 list_del(&conn->list); in pipe_interrupt()
63 list_add(&conn->list, &conn->port->connections); in pipe_interrupt()
96 { .list = LIST_HEAD_INIT(conn->list), in port_accept()
113 list_add(&conn->list, &port->pending); in port_accept()
136 port = list_entry(ele, struct port_list, list); in port_work_proc()
167 port = list_entry(ele, struct port_list, list); in port_data()
[all...]
/kernel/linux/linux-5.10/drivers/pinctrl/
H A Ddevicetree.c18 * @node: list node for struct pinctrl's @dt_maps field
203 const __be32 *list; in pinctrl_dt_to_map() local
236 list = prop->value; in pinctrl_dt_to_map()
237 size /= sizeof(*list); in pinctrl_dt_to_map()
252 phandle = be32_to_cpup(list++); in pinctrl_dt_to_map()
308 * pinctrl_get_list_and_count - Gets the list and it's cell size and number
310 * @list_name: property that contains the list
311 * @list: pointer for the list found
315 * Typically np is a single pinctrl entry containing the list
317 pinctrl_get_list_and_count(const struct device_node *np, const char *list_name, const __be32 **list, int *cells_size, int *nr_elements) pinctrl_get_list_and_count() argument
354 const __be32 *list; pinctrl_count_index_with_args() local
377 pinctrl_copy_args(const struct device_node *np, const __be32 *list, int index, int nr_cells, int nr_elem, struct of_phandle_args *out_args) pinctrl_copy_args() argument
414 const __be32 *list; pinctrl_parse_index_with_args() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Dparman.c10 * notice, this list of conditions and the following disclaimer.
12 * notice, this list of conditions and the following disclaimer in the
39 #include <linux/list.h>
96 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()
[all...]
H A Dirq_poll.c24 * Add this irq_poll structure to the pending poll list and trigger the
37 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()
102 * entries to the tail of this list, and only ->poll() in irq_poll_softirq()
103 * calls can remove this head entry from the list. in irq_poll_softirq()
105 iop = list_entry(list->next, struct irq_poll, list); in irq_poll_softirq()
122 * move the instance around on the list a in irq_poll_softirq()
[all...]
/kernel/linux/linux-6.6/drivers/pinctrl/
H A Ddevicetree.c18 * @node: list node for struct pinctrl's @dt_maps field
203 const __be32 *list; in pinctrl_dt_to_map() local
234 list = prop->value; in pinctrl_dt_to_map()
235 size /= sizeof(*list); in pinctrl_dt_to_map()
250 phandle = be32_to_cpup(list++); in pinctrl_dt_to_map()
306 * pinctrl_get_list_and_count - Gets the list and it's cell size and number
308 * @list_name: property that contains the list
309 * @list: pointer for the list found
313 * Typically np is a single pinctrl entry containing the list
315 pinctrl_get_list_and_count(const struct device_node *np, const char *list_name, const __be32 **list, int *cells_size, int *nr_elements) pinctrl_get_list_and_count() argument
352 const __be32 *list; pinctrl_count_index_with_args() local
375 pinctrl_copy_args(const struct device_node *np, const __be32 *list, int index, int nr_cells, int nr_elem, struct of_phandle_args *out_args) pinctrl_copy_args() argument
412 const __be32 *list; pinctrl_parse_index_with_args() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dparman.c10 * notice, this list of conditions and the following disclaimer.
12 * notice, this list of conditions and the following disclaimer in the
39 #include <linux/list.h>
95 typeof(struct parman_item), list); in parman_prio_first_item()
106 typeof(struct parman_item), list); in parman_prio_last_item()
117 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) { in parman_lsort_new_index_find()
143 list_move_tail(&item->list, &prio->item_list); in parman_prio_shift_down()
158 list_move(&item->list, &prio->item_list); in parman_prio_shift_up()
171 list_del(&item->list); in parman_prio_item_remove()
176 list_del(&last_item->list); in parman_prio_item_remove()
[all...]
H A Dirq_poll.c24 * Add this irq_poll structure to the pending poll list and trigger the
37 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()
102 * entries to the tail of this list, and only ->poll() in irq_poll_softirq()
103 * calls can remove this head entry from the list. in irq_poll_softirq()
105 iop = list_entry(list->next, struct irq_poll, list); in irq_poll_softirq()
122 * move the instance around on the list a in irq_poll_softirq()
[all...]
/third_party/libdrm/amdgpu/
H A Damdgpu_vamgr.c58 list_add(&n->list, &mgr->va_holes); in amdgpu_vamgr_init()
65 LIST_FOR_EACH_ENTRY_SAFE(hole, tmp, &mgr->va_holes, list) { in amdgpu_vamgr_deinit()
66 list_del(&hole->list); in amdgpu_vamgr_deinit()
83 list_add(&n->list, &hole->list); in amdgpu_vamgr_subtract_hole()
93 list_del(&hole->list); in amdgpu_vamgr_subtract_hole()
118 LIST_FOR_EACH_ENTRY_SAFE_REV(hole, n, &mgr->va_holes, list) { in amdgpu_vamgr_find_va()
139 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &mgr->va_holes, list) { in amdgpu_vamgr_find_va()
178 hole = container_of(&mgr->va_holes, hole, list); in amdgpu_vamgr_free_va()
179 LIST_FOR_EACH_ENTRY(next, &mgr->va_holes, list) { in amdgpu_vamgr_free_va()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.c45 #include "util/list.h"
52 struct list_head list; member
83 /** Head of list, sorted from Least-recently used to Most-recently used */
113 list_inithead(&cache->lru.list); in util_cache_create()
180 list_del(&entry->list); in util_cache_entry_destroy()
208 entry = list_last_entry(&cache->lru.list, struct util_cache_entry, list); in util_cache_set()
211 util_cache_entry_destroy(cache, list_last_entry(&cache->lru.list, struct util_cache_entry, list)); in util_cache_set()
223 list_add(&cache->lru.list, in util_cache_set()
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dpmus.c2 #include <linux/list.h>
23 * this list, perf interprets it as a heterogeneous platform.
27 * other_pmus: All other PMUs which are not part of core_pmus list. It doesn't
68 list_for_each_entry_safe(pmu, tmp, &core_pmus, list) { in perf_pmus__destroy()
69 list_del(&pmu->list); in perf_pmus__destroy()
73 list_for_each_entry_safe(pmu, tmp, &other_pmus, list) { in perf_pmus__destroy()
74 list_del(&pmu->list); in perf_pmus__destroy()
86 list_for_each_entry(pmu, &core_pmus, list) { in pmu_find()
91 list_for_each_entry(pmu, &other_pmus, list) { in pmu_find()
107 * Once PMU is loaded it stays in the list, in perf_pmus__find()
[all...]
/third_party/alsa-lib/src/topology/
H A Delem.c256 list_add_tail(&ref->list, &elem->ref_list); in tplg_ref_add()
273 list_add_tail(&ref->list, &elem->ref_list); in tplg_ref_add_elem()
283 ref = list_entry(pos, struct tplg_ref, list); in tplg_ref_free_list()
284 list_del(&ref->list); in tplg_ref_free_list()
303 list_del(&elem->list); in tplg_elem_free()
326 elem = list_entry(pos, struct tplg_elem, list); in tplg_elem_free_list()
342 elem = list_entry(pos, struct tplg_elem, list); in tplg_elem_lookup()
361 struct list_head *pos, *list; in tplg_elem_type_lookup() local
376 list = (struct list_head *)((void *)tplg + tptr->loff); in tplg_elem_type_lookup()
379 list_for_each(pos, list) { in tplg_elem_type_lookup()
387 tplg_elem_insert(struct tplg_elem *elem_p, struct list_head *list) tplg_elem_insert() argument
409 struct list_head *list; tplg_elem_new_common() local
486 struct list_head list; global() member
[all...]
/third_party/ntfs-3g/ntfsprogs/
H A Dntfsls.c10 * This utility will list a directory's files.
52 #include "list.h"
64 struct ntfs_list_head list; member
79 struct ntfs_list_head list; member
83 /* The list of sub-dirs is like a "horizontal" tree. The root of
84 * the tree is opts.path, but it is not part of the list because
85 * that's not necessary. The rules of the list are (in order of
95 * then the list will be:
99 * into the list.
152 * usage - Print a list o
[all...]
/third_party/skia/tests/
H A DSkTBlockListTest.cpp43 static size_t ScratchBlockSize(SkTBlockList<C, N>& list) { in ScratchBlockSize() argument
44 return (size_t) list.fAllocator->scratchBlockSize(); in ScratchBlockSize()
48 static size_t TotalSize(SkTBlockList<C, N>& list) { in TotalSize() argument
49 return list.fAllocator->totalSize(); in TotalSize()
201 // SkTBlockList guarantees the moved list is empty, but clang-tidy doesn't know about it; in run_concat_test()
251 SkTBlockList<C, N> list(kItemsPerBlock); in run_reserve_test()
252 size_t initialSize = TBlockListTestAccess::TotalSize(list); in run_reserve_test()
255 list.push_back(C(i)); in run_reserve_test()
257 REPORTER_ASSERT(reporter, initialSize == TBlockListTestAccess::TotalSize(list)); in run_reserve_test()
260 list in run_reserve_test()
[all...]
/third_party/python/Lib/test/
H A Dtest_tuple.py50 self.assertEqual(list(u), [1, 2])
59 self.assertEqual(list(u), [1, 2])
69 self.assertEqual(list(u), [1, 2])
102 self.assertEqual(list(tuple(f())), list(range(1000)))
171 hashes = list(map(hash, xs))
195 tryone("range(100) by 3", list(product(range(100), repeat=3)),
201 cands = list(range(-10, -1)) + list(range(9))
206 tryone("-10 .. 8 by 4", list(produc
[all...]
/kernel/linux/linux-5.10/security/tomoyo/
H A Ddomain.c40 struct list_head *list = param->list; in tomoyo_update_policy() local
44 list_for_each_entry_rcu(entry, list, list, in tomoyo_update_policy()
57 list_add_tail_rcu(&entry->list, list); in tomoyo_update_policy()
105 struct list_head * const list = param->list; in tomoyo_update_domain() local
123 list_for_each_entry_rcu(entry, list, list, in tomoyo_update_domain()
167 const struct list_head *list = &domain->acl_info_list; tomoyo_check_acl() local
297 tomoyo_scan_transition(const struct list_head *list, const struct tomoyo_path_info *domainname, const struct tomoyo_path_info *program, const char *last_name, const enum tomoyo_transition_type type) tomoyo_scan_transition() argument
352 const struct list_head * const list = tomoyo_transition_type() local
737 struct list_head *list = tomoyo_find_next_domain() local
[all...]
/kernel/linux/linux-5.10/drivers/xen/xenbus/
H A Dxenbus_dev_frontend.c69 * An element of a list of outstanding transactions, for which we're
73 struct list_head list; member
82 struct list_head list; member
148 rb = list_entry(u->read_buffers.next, struct read_buffer, list); in xenbus_file_read()
166 list_del(&rb->list); in xenbus_file_read()
171 struct read_buffer, list); in xenbus_file_read()
185 * multiple queued buffers on a temporary local list, and then add it
186 * to the appropriate list under lock once all the buffers have een
207 list_add_tail(&rb->list, queue); in queue_reply()
212 * Free all the read_buffer s on a list
215 queue_cleanup(struct list_head *list) queue_cleanup() argument
227 struct list_head list; global() member
[all...]
/kernel/linux/linux-6.6/drivers/xen/xenbus/
H A Dxenbus_dev_frontend.c69 * An element of a list of outstanding transactions, for which we're
73 struct list_head list; member
82 struct list_head list; member
148 rb = list_entry(u->read_buffers.next, struct read_buffer, list); in xenbus_file_read()
166 list_del(&rb->list); in xenbus_file_read()
171 struct read_buffer, list); in xenbus_file_read()
185 * multiple queued buffers on a temporary local list, and then add it
186 * to the appropriate list under lock once all the buffers have een
207 list_add_tail(&rb->list, queue); in queue_reply()
212 * Free all the read_buffer s on a list
215 queue_cleanup(struct list_head *list) queue_cleanup() argument
227 struct list_head list; global() member
[all...]
/kernel/linux/linux-6.6/security/tomoyo/
H A Ddomain.c40 struct list_head *list = param->list; in tomoyo_update_policy() local
44 list_for_each_entry_rcu(entry, list, list, in tomoyo_update_policy()
57 list_add_tail_rcu(&entry->list, list); in tomoyo_update_policy()
105 struct list_head * const list = param->list; in tomoyo_update_domain() local
123 list_for_each_entry_rcu(entry, list, list, in tomoyo_update_domain()
167 const struct list_head *list = &domain->acl_info_list; tomoyo_check_acl() local
297 tomoyo_scan_transition(const struct list_head *list, const struct tomoyo_path_info *domainname, const struct tomoyo_path_info *program, const char *last_name, const enum tomoyo_transition_type type) tomoyo_scan_transition() argument
352 const struct list_head * const list = tomoyo_transition_type() local
735 struct list_head *list = tomoyo_find_next_domain() local
[all...]
/kernel/linux/linux-5.10/drivers/usb/gadget/function/
H A Df_printer.c25 #include <linux/list.h>
267 list_del_init(&req->list); /* Remode from Active List */ in rx_complete()
274 list_add_tail(&req->list, &dev->rx_buffers); in rx_complete()
277 list_add(&req->list, &dev->rx_reqs); in rx_complete()
285 list_add(&req->list, &dev->rx_reqs); in rx_complete()
291 list_add(&req->list, &dev->rx_reqs); in rx_complete()
300 list_add(&req->list, &dev->rx_reqs); in rx_complete()
324 /* Take the request struct off the active list and put it on the in tx_complete()
325 * free list. in tx_complete()
327 list_del_init(&req->list); in tx_complete()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/netfilter/
H A Dnft_nat.sh86 ip netns exec $ns nft list counter inet filter $counter 1>&2
94 cnt=$(ip netns exec $ns nft list counter inet filter ns0in | grep -q "packets 1 bytes 84")
99 cnt=$(ip netns exec $ns nft list counter inet filter ns0out | grep -q "packets 1 bytes 84")
106 cnt=$(ip netns exec $ns nft list counter inet filter ns0in6 | grep -q "$expect")
111 cnt=$(ip netns exec $ns nft list counter inet filter ns0out6 | grep -q "$expect")
125 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0in | grep -q "packets 0 bytes 0")
131 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0in6 | grep -q "packets 0 bytes 0")
137 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0out | grep -q "packets 0 bytes 0")
142 cnt=$(ip netns exec "$ns0" nft list counter inet filter ns0out6 | grep -q "packets 0 bytes 0")
150 cnt=$(ip netns exec "$ns0" nft list counte
[all...]
/kernel/linux/linux-6.6/drivers/usb/gadget/function/
H A Df_printer.c25 #include <linux/list.h>
272 list_del_init(&req->list); /* Remode from Active List */ in rx_complete()
279 list_add_tail(&req->list, &dev->rx_buffers); in rx_complete()
282 list_add(&req->list, &dev->rx_reqs); in rx_complete()
290 list_add(&req->list, &dev->rx_reqs); in rx_complete()
296 list_add(&req->list, &dev->rx_reqs); in rx_complete()
305 list_add(&req->list, &dev->rx_reqs); in rx_complete()
329 /* Take the request struct off the active list and put it on the in tx_complete()
330 * free list. in tx_complete()
332 list_del_init(&req->list); in tx_complete()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Drhashtable.h10 * Rewritten with rehash code from br_multicast plus single list
37 * of the right list.
465 * This hash chain list-traversal primitive allows for the looped code to
466 * remove the loop cursor from the list.
484 * This hash chain list-traversal primitive may safely run concurrently with
500 * This hash chain list-traversal primitive may safely run concurrently with
519 * This hash chain list-traversal primitive may safely run concurrently with
537 * This hash chain list-traversal primitive may safely run concurrently with
547 * rhl_for_each_rcu - iterate over rcu hash table list
549 * @list
734 struct rhlist_head *list; __rhashtable_insert_fast() local
781 struct rhlist_head *list; __rhashtable_insert_fast() local
848 rhltable_insert_key( struct rhltable *hlt, const void *key, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert_key() argument
871 rhltable_insert( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert() argument
1005 struct rhlist_head *list; __rhashtable_remove_fast_one() local
1130 rhltable_remove( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_remove() argument
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Drhashtable.h10 * Rewritten with rehash code from br_multicast plus single list
37 * of the right list.
473 * This hash chain list-traversal primitive allows for the looped code to
474 * remove the loop cursor from the list.
492 * This hash chain list-traversal primitive may safely run concurrently with
508 * This hash chain list-traversal primitive may safely run concurrently with
527 * This hash chain list-traversal primitive may safely run concurrently with
545 * This hash chain list-traversal primitive may safely run concurrently with
555 * rhl_for_each_rcu - iterate over rcu hash table list
557 * @list
743 struct rhlist_head *list; __rhashtable_insert_fast() local
790 struct rhlist_head *list; __rhashtable_insert_fast() local
857 rhltable_insert_key( struct rhltable *hlt, const void *key, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert_key() argument
880 rhltable_insert( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_insert() argument
1015 struct rhlist_head *list; __rhashtable_remove_fast_one() local
1140 rhltable_remove( struct rhltable *hlt, struct rhlist_head *list, const struct rhashtable_params params) rhltable_remove() argument
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/
H A Dintel_gt_buffer_pool.c49 struct list_head *list = &pool->cache_list[n]; in pool_free_older_than() local
51 if (list_empty(list)) in pool_free_older_than()
58 list_for_each_prev(pos, list) { in pool_free_older_than()
74 if (!list_is_last(pos, list)) in pool_free_older_than()
75 __list_del_many(pos, list); in pool_free_older_than()
80 active |= !list_empty(list); in pool_free_older_than()
129 struct list_head *list = bucket_for_size(pool, node->obj->base.size); in pool_retire() local
139 list_add_rcu(&node->link, list); in pool_retire()
181 struct list_head *list; in intel_gt_get_buffer_pool() local
185 list in intel_gt_get_buffer_pool()
[all...]

Completed in 20 milliseconds

1...<<11121314151617181920>>...562