Home
last modified time | relevance | path

Searched refs:list (Results 1701 - 1725 of 16343) sorted by relevance

1...<<61626364656667686970>>...654

/kernel/linux/linux-6.6/drivers/thunderbolt/
H A Dtb.c107 list_for_each_entry(tunnel, &tcm->tunnel_list, list) { in tb_attach_bandwidth_group()
193 list_add_tail(&port->list, &tcm->dp_resources); in tb_add_dp_resources()
209 list_for_each_entry_safe(port, tmp, &tcm->dp_resources, list) { in tb_remove_dp_resources()
212 list_del_init(&port->list); in tb_remove_dp_resources()
222 list_for_each_entry(p, &tcm->dp_resources, list) { in tb_discover_dp_resource()
229 list_add_tail(&port->list, &tcm->dp_resources); in tb_discover_dp_resource()
237 list_for_each_entry(tunnel, &tcm->tunnel_list, list) { in tb_discover_dp_resources()
271 list_for_each_entry(tunnel, &tcm->tunnel_list, list) { in tb_enable_clx()
385 struct list_head *list, in tb_switch_discover_tunnels()
413 list_add_tail(&tunnel->list, lis in tb_switch_discover_tunnels()
384 tb_switch_discover_tunnels(struct tb_switch *sw, struct list_head *list, bool alloc_hopids) tb_switch_discover_tunnels() argument
[all...]
/kernel/linux/linux-6.6/kernel/trace/
H A Dring_buffer.c26 #include <linux/list.h>
65 * The ring buffer is made up of a list of pages. A separate list of pages is
321 * Note, the buffer_page list must be first. The buffer pages
325 * add flags in the list struct pointers, to make the ring buffer
329 struct list_head list; /* list of buffer pages */ member
725 static struct list_head *rb_list_head(struct list_head *list);
747 next = rb_list_head(page->list.next); in verify_event()
748 page = list_entry(next, struct buffer_page, list); in verify_event()
1270 rb_list_head(struct list_head *list) rb_list_head() argument
1286 rb_is_head_page(struct buffer_page *page, struct list_head *list) rb_is_head_page() argument
1307 struct list_head *list = page->list.prev; rb_is_reader_page() local
1315 rb_set_list_to_head(struct list_head *list) rb_set_list_to_head() argument
1341 rb_list_head_clear(struct list_head *list) rb_list_head_clear() argument
1368 struct list_head *list; rb_head_page_set() local
1425 struct list_head *list; rb_set_head_page() local
[all...]
/foundation/communication/ipc/services/dbinder/c/src/
H A Ddbinder_service.c39 UTILS_DL_LIST list; member
55 UTILS_DL_LIST list; member
111 UTILS_DL_LIST_FOR_EACH_ENTRY(node, &g_binderList.remoteBinderObjects, RemoteBinderObjects, list) in GetRegisterService()
125 UtilsListAdd(&g_binderList.remoteBinderObjects, &binderObject->list); in AddRegisterService()
149 UTILS_DL_LIST_FOR_EACH_ENTRY(node, &g_stubRegistedList.dBinderStubs, DBinderServiceStub, list) in QueryDBinderStub()
164 UtilsListAdd(&g_stubRegistedList.dBinderStubs, &stub->list); in AddDBinderStub()
275 UtilsListAdd(&g_threadLockInfoList.threadLocks, &threadLockInfo->list); in AttachThreadLockInfo()
283 UtilsListDelete(&threadLockInfo->list); in DetachThreadLockInfo()
391 UtilsListAdd(&g_sessionInfoList.sessionInfos, &sessionInfo->list); in AttachSessionObject()
399 UtilsListDelete(&sessionInfo->list); in DetachSessionObject()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx4/
H A Dalloc.c16 * copyright notice, this list of conditions and the following
20 * copyright notice, this list of conditions and the following
213 struct list_head list; member
275 list_add_tail(&zone->list, &it->list); in mlx4_zone_add_one()
290 /* Check if we need to add an alternative node to the prio list */ in __mlx4_zone_remove_one_entry()
291 if (!list_is_last(&entry->list, &zone_alloc->entries)) { in __mlx4_zone_remove_one_entry()
292 struct mlx4_zone_entry *next = list_first_entry(&entry->list, in __mlx4_zone_remove_one_entry()
294 list); in __mlx4_zone_remove_one_entry()
303 list_del(&entry->list); in __mlx4_zone_remove_one_entry()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlxsw/
H A Dspectrum_nve.c7 #include <linux/list.h>
63 struct list_head list; member
284 list_add_tail(&mc_record->list, &mc_list->records_list); in mlxsw_sp_nve_mc_record_create()
298 list_del(&mc_record->list); in mlxsw_sp_nve_mc_record_destroy()
312 list_for_each_entry_reverse(mc_record, &mc_list->records_list, list) { in mlxsw_sp_nve_mc_record_get()
363 if (!list_is_last(&mc_record->list, &mc_list->records_list)) { in mlxsw_sp_nve_mc_record_refresh()
366 next_record = list_next_entry(mc_record, list); in mlxsw_sp_nve_mc_record_refresh()
398 struct mlxsw_sp_nve_mc_record, list); in mlxsw_sp_nve_mc_record_is_first()
453 err = mlxsw_sp_nve_mc_record_refresh(list_prev_entry(mc_record, list)); in mlxsw_sp_nve_mc_record_ip_add()
487 * points to it. Remove deleted record from the list t in mlxsw_sp_nve_mc_record_entry_del()
[all...]
/kernel/linux/linux-5.10/net/tipc/
H A Dmonitor.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
67 * @hash: position in hashed lookup list
68 * @list: position in linked list, in circular ascending order by 'addr'
69 * @applied: number of reported domain members applied on this monitor list
79 struct list_head list; member
138 return list_last_entry(&peer->list, struct tipc_peer, list); in peer_prev()
143 return list_first_entry(&peer->list, struc in peer_nxt()
[all...]
/kernel/linux/linux-5.10/fs/jffs2/
H A Dnodemgmt.c247 jffs2_dbg(1, "%s(): Erase block at 0x%08x has already been placed in a list\n", in jffs2_close_nextblock()
261 list_add_tail(&jeb->list, &c->very_dirty_list); in jffs2_close_nextblock()
266 list_add_tail(&jeb->list, &c->dirty_list); in jffs2_close_nextblock()
272 list_add_tail(&jeb->list, &c->clean_list); in jffs2_close_nextblock()
284 /* Take the next block off the 'free' list */ in jffs2_find_nextblock()
292 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); in jffs2_find_nextblock()
293 list_move_tail(&ejeb->list, &c->erase_pending_list); in jffs2_find_nextblock()
336 c->nextblock = list_entry(next, struct jffs2_eraseblock, list); in jffs2_find_nextblock()
489 * jffs2_add_physical_node_ref - add a physical node reference to the list
544 list_add_tail(&jeb->list, in jffs2_add_physical_node_ref()
[all...]
/kernel/linux/linux-5.10/fs/f2fs/
H A Dextent_cache.c247 INIT_LIST_HEAD(&en->list); in __attach_extent_node()
279 f2fs_bug_on(sbi, list_empty(&en->list)); in __release_extent_node()
280 list_del_init(&en->list); in __release_extent_node()
302 INIT_LIST_HEAD(&et->list); in __grab_extent_tree()
307 list_del_init(&et->list); in __grab_extent_tree()
394 list_add_tail(&en->list, &sbi->extent_list); in __f2fs_init_extent_tree()
444 if (!list_empty(&en->list)) { in f2fs_lookup_extent_tree()
445 list_move_tail(&en->list, &sbi->extent_list); in f2fs_lookup_extent_tree()
487 if (!list_empty(&en->list)) { in __try_merge_extent_node()
488 list_move_tail(&en->list, in __try_merge_extent_node()
[all...]
/kernel/linux/linux-6.6/fs/jffs2/
H A Dnodemgmt.c247 jffs2_dbg(1, "%s(): Erase block at 0x%08x has already been placed in a list\n", in jffs2_close_nextblock()
261 list_add_tail(&jeb->list, &c->very_dirty_list); in jffs2_close_nextblock()
266 list_add_tail(&jeb->list, &c->dirty_list); in jffs2_close_nextblock()
272 list_add_tail(&jeb->list, &c->clean_list); in jffs2_close_nextblock()
284 /* Take the next block off the 'free' list */ in jffs2_find_nextblock()
292 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); in jffs2_find_nextblock()
293 list_move_tail(&ejeb->list, &c->erase_pending_list); in jffs2_find_nextblock()
336 c->nextblock = list_entry(next, struct jffs2_eraseblock, list); in jffs2_find_nextblock()
489 * jffs2_add_physical_node_ref - add a physical node reference to the list
544 list_add_tail(&jeb->list, in jffs2_add_physical_node_ref()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx4/
H A Dalloc.c16 * copyright notice, this list of conditions and the following
20 * copyright notice, this list of conditions and the following
213 struct list_head list; member
275 list_add_tail(&zone->list, &it->list); in mlx4_zone_add_one()
290 /* Check if we need to add an alternative node to the prio list */ in __mlx4_zone_remove_one_entry()
291 if (!list_is_last(&entry->list, &zone_alloc->entries)) { in __mlx4_zone_remove_one_entry()
292 struct mlx4_zone_entry *next = list_first_entry(&entry->list, in __mlx4_zone_remove_one_entry()
294 list); in __mlx4_zone_remove_one_entry()
303 list_del(&entry->list); in __mlx4_zone_remove_one_entry()
[all...]
/kernel/linux/linux-6.6/net/tipc/
H A Dmonitor.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
67 * @hash: position in hashed lookup list
68 * @list: position in linked list, in circular ascending order by 'addr'
69 * @applied: number of reported domain members applied on this monitor list
79 struct list_head list; member
168 return list_last_entry(&peer->list, struct tipc_peer, list); in peer_prev()
173 return list_first_entry(&peer->list, struc in peer_nxt()
[all...]
/third_party/ffmpeg/libavfilter/
H A Dformats.c151 * references of a and b to point to the combined list and free the old
152 * lists as needed. The combined list usually contains the intersection of
426 #define ADD_FORMAT(f, fmt, unref_fn, type, list, nb) \
434 fmts = av_realloc_array((*f)->list, (*f)->nb + 1, \
435 sizeof(*(*f)->list)); \
441 (*f)->list = fmts; \
442 ASSIGN_FMT(f, fmt, list, nb); \
445 #define ASSIGN_FMT(f, fmt, list, nb) \
447 (*f)->list[(*f)->nb++] = fmt; \
457 #define ASSIGN_FMT(f, fmt, list, n
[all...]
H A Dqsvvpp.c311 static void clear_unused_frames(QSVFrame *list) in clear_unused_frames() argument
313 while (list) { in clear_unused_frames()
314 /* list->queued==1 means the frame is not cached in VPP in clear_unused_frames()
316 if ((list->queued == 1) && !list->surface.Data.Locked) { in clear_unused_frames()
317 av_frame_free(&list->frame); in clear_unused_frames()
318 list->queued = 0; in clear_unused_frames()
320 list = list->next; in clear_unused_frames()
324 static void clear_frame_list(QSVFrame **list) in clear_frame_list() argument
336 get_free_frame(QSVFrame **list) get_free_frame() argument
[all...]
/third_party/selinux/libsepol/src/
H A Dconditional.c170 /* Find a conditional (the needle) within a list of existing ones (the
192 cond_node_t *cond_node_search(policydb_t * p, cond_node_t * list, in cond_node_search() argument
196 cond_node_t *result = cond_node_find(p, cn, list, &was_created); in cond_node_search()
198 /* add conditional node to policy list */ in cond_node_search()
306 * list appropriately. If the result of the expression is undefined
382 /* free the "not" node in the list */ in cond_normalize_expr()
463 void cond_av_list_destroy(cond_av_list_t * list) in cond_av_list_destroy() argument
466 for (cur = list; cur != NULL; cur = next) { in cond_av_list_destroy()
498 void cond_list_destroy(cond_list_t * list) in cond_list_destroy() argument
502 if (list in cond_list_destroy()
625 cond_av_list_t *other = data->other, *list, *cur; cond_insertf() local
821 cond_read_list(policydb_t * p, cond_list_t ** list, void *fp) cond_read_list() argument
[all...]
/foundation/communication/netmanager_base/frameworks/cj/connection/src/
H A Dnet_connection_ffi.cpp283 auto list = httpProxy.GetExclusionList(); in CJ_GetGlobalHttpProxy() local
284 chttpProxy.exclusionListSize = static_cast<int64_t>(list.size()); in CJ_GetGlobalHttpProxy()
285 chttpProxy.exclusionList = MallocCStringList(list); in CJ_GetGlobalHttpProxy()
297 auto list = httpProxy.GetExclusionList(); in CJ_GetDefaultHttpProxy() local
298 chttpProxy.exclusionListSize = static_cast<int64_t>(list.size()); in CJ_GetDefaultHttpProxy()
299 chttpProxy.exclusionList = MallocCStringList(list); in CJ_GetDefaultHttpProxy()
308 std::list<std::string> exclusionList; in CJ_SetGlobalHttpProxy()
330 std::list<sptr<NetHandle>> netList; in CJ_GetAllNets()
478 char **MallocCStringList(std::list<std::string> &list) in MallocCStringList() argument
[all...]
/kernel/linux/linux-5.10/drivers/acpi/
H A Dresource.c229 * primary side. Non-bridge devices must list 0 for all Address in acpi_decode_space()
622 * @list: The head of the resource list to free.
624 void acpi_dev_free_resource_list(struct list_head *list) in acpi_dev_free_resource_list() argument
626 resource_list_free(list); in acpi_dev_free_resource_list()
631 struct list_head *list; member
650 resource_list_add_tail(rentry, c->list); in acpi_dev_new_resource_entry()
695 struct list_head *list, in __acpi_dev_get_resources()
702 if (!adev || !adev->handle || !list_empty(list)) in __acpi_dev_get_resources()
708 c.list in __acpi_dev_get_resources()
694 __acpi_dev_get_resources(struct acpi_device *adev, struct list_head *list, int (*preproc)(struct acpi_resource *, void *), void *preproc_data, char *method) __acpi_dev_get_resources() argument
747 acpi_dev_get_resources(struct acpi_device *adev, struct list_head *list, int (*preproc)(struct acpi_resource *, void *), void *preproc_data) acpi_dev_get_resources() argument
784 acpi_dev_get_dma_resources(struct acpi_device *adev, struct list_head *list) acpi_dev_get_dma_resources() argument
[all...]
/kernel/linux/linux-5.10/drivers/lightnvm/
H A Dpblk-gc.c47 list_for_each_entry_safe(gc_rq, tgc_rq, &w_list, list) { in pblk_gc_write()
49 list_del(&gc_rq->list); in pblk_gc_write()
82 list_add_tail(&line->list, move_list); in pblk_put_line_back()
117 list_add_tail(&gc_rq->list, &gc->w_list); in pblk_gc_line_ws()
354 line = list_first_entry(&gc->r_list, struct pblk_line, list); in pblk_gc_read()
355 list_del(&line->list); in pblk_gc_read()
364 list_add_tail(&line->list, &gc->r_list); in pblk_gc_read()
377 victim = list_first_entry(group_list, struct pblk_line, list); in pblk_gc_get_victim_line()
379 list_for_each_entry(line, group_list, list) { in pblk_gc_get_victim_line()
421 struct pblk_line, list); in pblk_gc_free_full_lines()
[all...]
/kernel/linux/linux-5.10/drivers/misc/ti-st/
H A Dst_core.c34 /* list now has the channel id as index itself */ in add_channel_to_table()
35 st_gdata->list[new_proto->chnl_id] = new_proto; in add_channel_to_table()
43 /* st_gdata->list[proto->chnl_id] = NULL; */ in remove_channel_from_table()
112 if (likely(st_gdata->list[chnl_id]->recv != NULL)) { in st_send_frame()
114 (st_gdata->list[chnl_id]->recv in st_send_frame()
115 (st_gdata->list[chnl_id]->priv_data, st_gdata->rx_skb) in st_send_frame()
141 st_gdata->list[i]->reg_complete_cb != NULL)) { in st_reg_complete()
142 st_gdata->list[i]->reg_complete_cb in st_reg_complete()
143 (st_gdata->list[i]->priv_data, err); in st_reg_complete()
282 proto = st_gdata->list[st_gdat in st_int_recv()
[all...]
/kernel/linux/linux-5.10/sound/core/seq/
H A Dseq_ports.c24 NOTE: the current implementation of the port structure as a linked list is
27 structure, which means we have to traverse the list. A direct access table
35 2) replace the linked list of ports by a array of pointers which is
52 list_for_each_entry(port, &client->ports_list_head, list) { in snd_seq_port_use_ptr()
76 list_for_each_entry(port, &client->ports_list_head, list) { in snd_seq_port_query_nearest()
145 list_for_each_entry(p, &client->ports_list_head, list) { in snd_seq_create_port()
152 list_add_tail(&new_port->list, &p->list); in snd_seq_create_port()
204 * remove all subscribers on the list
205 * this is called from port_delete, for each src and dest list
524 struct list_head *list; __delete_and_unsubscribe_port() local
[all...]
/kernel/linux/linux-5.10/drivers/xen/xenbus/
H A Dxenbus_xs.c90 * watch_events_waitq for work to do (queued on watch_events list). When it
91 * wakes up it acquires the xenwatch_mutex before reading the list and
241 list_add_tail(&req->list, &xb_write_list); in xs_send()
690 list_for_each_entry(i, &watches, list) in find_watch()
713 list_add_tail(&event->list, &watch_events); in xs_watch_msg()
778 list_add(&watch->list, &watches); in register_xenbus_watch()
785 list_del(&watch->list); in register_xenbus_watch()
807 list_del(&watch->list); in unregister_xenbus_watch()
824 list_for_each_entry_safe(event, tmp, &watch_events, list) { in unregister_xenbus_watch()
827 list_del(&event->list); in unregister_xenbus_watch()
[all...]
/kernel/linux/linux-6.6/drivers/misc/ti-st/
H A Dst_core.c32 /* list now has the channel id as index itself */ in add_channel_to_table()
33 st_gdata->list[new_proto->chnl_id] = new_proto; in add_channel_to_table()
41 /* st_gdata->list[proto->chnl_id] = NULL; */ in remove_channel_from_table()
109 if (likely(st_gdata->list[chnl_id]->recv != NULL)) { in st_send_frame()
111 (st_gdata->list[chnl_id]->recv in st_send_frame()
112 (st_gdata->list[chnl_id]->priv_data, st_gdata->rx_skb) in st_send_frame()
138 st_gdata->list[i]->reg_complete_cb != NULL)) { in st_reg_complete()
139 st_gdata->list[i]->reg_complete_cb in st_reg_complete()
140 (st_gdata->list[i]->priv_data, err); in st_reg_complete()
275 proto = st_gdata->list[st_gdat in st_int_recv()
[all...]
/kernel/linux/linux-6.6/drivers/xen/xenbus/
H A Dxenbus_xs.c90 * watch_events_waitq for work to do (queued on watch_events list). When it
91 * wakes up it acquires the xenwatch_mutex before reading the list and
241 list_add_tail(&req->list, &xb_write_list); in xs_send()
690 list_for_each_entry(i, &watches, list) in find_watch()
713 list_add_tail(&event->list, &watch_events); in xs_watch_msg()
778 list_add(&watch->list, &watches); in register_xenbus_watch()
785 list_del(&watch->list); in register_xenbus_watch()
807 list_del(&watch->list); in unregister_xenbus_watch()
824 list_for_each_entry_safe(event, tmp, &watch_events, list) { in unregister_xenbus_watch()
827 list_del(&event->list); in unregister_xenbus_watch()
[all...]
/kernel/linux/linux-6.6/arch/x86/kernel/cpu/resctrl/
H A Dmonitor.c30 struct list_head list; member
34 * @rmid_free_lru - A least recently used list of free RMIDs
281 * RMID and move it to the free list when the counter reaches 0. in __check_limbo()
301 list_add_tail(&entry->list, &rmid_free_lru); in __check_limbo()
316 * are used to optimize the limbo list management.
328 struct rmid_entry, list); in alloc_rmid()
329 list_del(&entry->list); in alloc_rmid()
343 list_for_each_entry(d, &r->domains, list) { in add_rmid_to_limbo()
366 list_add_tail(&entry->list, &rmid_free_lru); in add_rmid_to_limbo()
383 list_add_tail(&entry->list, in free_rmid()
[all...]
/kernel/linux/linux-6.6/drivers/iommu/amd/
H A Damd_iommu_types.h14 #include <linux/list.h>
490 list_for_each_entry((pci_seg), &amd_iommu_pci_seg_list, list)
492 list_for_each_entry_safe((pci_seg), (next), &amd_iommu_pci_seg_list, list)
497 list_for_each_entry((iommu), &amd_iommu_list, list)
499 list_for_each_entry_safe((iommu), (next), &amd_iommu_list, list)
575 struct list_head list; member
632 * A list of required unity mappings we find in ACPI. It is not locked
644 struct list_head list; member
786 struct list_head list; member
796 struct list_head list; member
809 struct list_head list; /* For domain->dev_list */ global() member
861 struct list_head list; global() member
[all...]
/kernel/linux/linux-6.6/sound/core/seq/
H A Dseq_ports.c24 NOTE: the current implementation of the port structure as a linked list is
27 structure, which means we have to traverse the list. A direct access table
35 2) replace the linked list of ports by a array of pointers which is
52 list_for_each_entry(port, &client->ports_list_head, list) { in snd_seq_port_use_ptr()
77 list_for_each_entry(port, &client->ports_list_head, list) { in snd_seq_port_query_nearest()
150 list_for_each_entry(p, &client->ports_list_head, list) { in snd_seq_create_port()
162 list_add_tail(&new_port->list, &p->list); in snd_seq_create_port()
216 * remove all subscribers on the list
217 * this is called from port_delete, for each src and dest list
554 struct list_head *list; __delete_and_unsubscribe_port() local
[all...]

Completed in 32 milliseconds

1...<<61626364656667686970>>...654