| /kernel/linux/linux-5.10/drivers/mtd/ |
| H A D | mtd_blkdevs.c | 11 #include <linux/list.h>
38 list_del(&dev->list); in blktrans_dev_release()
351 list_for_each_entry(d, &tr->devs, list) { in add_mtd_blktrans_dev()
357 list_add_tail(&new->list, &d->list); in add_mtd_blktrans_dev()
366 list_add_tail(&new->list, &d->list); in add_mtd_blktrans_dev()
385 list_add_tail(&new->list, &tr->devs); in add_mtd_blktrans_dev()
471 list_del(&new->list); in add_mtd_blktrans_dev()
520 list_for_each_entry(tr, &blktrans_majors, list) in blktrans_notify_remove()
[all...] |
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | zstd.c | 49 struct list_head list; member
89 static inline struct workspace *list_to_workspace(struct list_head *list) in list_to_workspace() argument
91 return container_of(list, struct workspace, list); in list_to_workspace()
129 list_del(&victim->list); in zstd_reclaim_timer_fn()
130 zstd_free_workspace(&victim->list); in zstd_reclaim_timer_fn()
205 struct workspace, list); in zstd_cleanup_workspace_manager()
206 list_del(&workspace->list); in zstd_cleanup_workspace_manager()
208 zstd_free_workspace(&workspace->list); in zstd_cleanup_workspace_manager()
325 list_add(&workspace->list, in zstd_put_workspace()
[all...] |
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | commit.c | 489 * @list: list
498 struct list_head list; member
561 struct list_head list; in dbg_check_old_index() local
568 INIT_LIST_HEAD(&list); in dbg_check_old_index()
593 /* Keep the index nodes on our path in a linked list */ in dbg_check_old_index()
594 list_add_tail(&i->list, &list); in dbg_check_old_index()
657 /* Drop the bottom of the list */ in dbg_check_old_index()
658 list_del(&i->list); in dbg_check_old_index()
[all...] |
| H A D | gc.c | 116 sa = list_entry(a, struct ubifs_scan_node, list); in data_nodes_cmp()
117 sb = list_entry(b, struct ubifs_scan_node, list); in data_nodes_cmp()
160 sa = list_entry(a, struct ubifs_scan_node, list); in nondata_nodes_cmp()
161 sb = list_entry(b, struct ubifs_scan_node, list); in nondata_nodes_cmp()
208 * This function sorts the list of inodes to garbage collect. First of all, it
237 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
250 list_del(&snod->list); in sort_nodes()
266 /* The node is obsolete, remove it from the list */ in sort_nodes()
267 list_del(&snod->list); in sort_nodes()
276 list_move_tail(&snod->list, nondat in sort_nodes()
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | zstd.c | 49 struct list_head list; member
89 static inline struct workspace *list_to_workspace(struct list_head *list) in list_to_workspace() argument
91 return container_of(list, struct workspace, list); in list_to_workspace()
133 list_del(&victim->list); in zstd_reclaim_timer_fn()
134 zstd_free_workspace(&victim->list); in zstd_reclaim_timer_fn()
209 struct workspace, list); in zstd_cleanup_workspace_manager()
210 list_del(&workspace->list); in zstd_cleanup_workspace_manager()
212 zstd_free_workspace(&workspace->list); in zstd_cleanup_workspace_manager()
329 list_add(&workspace->list, in zstd_put_workspace()
[all...] |
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | commit.c | 489 * @list: list
498 struct list_head list; member
561 struct list_head list; in dbg_check_old_index() local
568 INIT_LIST_HEAD(&list); in dbg_check_old_index()
593 /* Keep the index nodes on our path in a linked list */ in dbg_check_old_index()
594 list_add_tail(&i->list, &list); in dbg_check_old_index()
657 /* Drop the bottom of the list */ in dbg_check_old_index()
658 list_del(&i->list); in dbg_check_old_index()
[all...] |
| H A D | gc.c | 116 sa = list_entry(a, struct ubifs_scan_node, list); in data_nodes_cmp()
117 sb = list_entry(b, struct ubifs_scan_node, list); in data_nodes_cmp()
160 sa = list_entry(a, struct ubifs_scan_node, list); in nondata_nodes_cmp()
161 sb = list_entry(b, struct ubifs_scan_node, list); in nondata_nodes_cmp()
208 * This function sorts the list of inodes to garbage collect. First of all, it
237 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
250 list_del(&snod->list); in sort_nodes()
266 /* The node is obsolete, remove it from the list */ in sort_nodes()
267 list_del(&snod->list); in sort_nodes()
276 list_move_tail(&snod->list, nondat in sort_nodes()
[all...] |
| /kernel/linux/linux-6.6/io_uring/ |
| H A D | timeout.c | 21 struct list_head list; member
81 list_add(&timeout->list, ctx->timeout_list.prev); in io_timeout_complete()
104 list_del_init(&timeout->list);
119 list_for_each_entry_safe(timeout, tmp, &ctx->timeout_list, list) { in io_flush_timeouts()
229 list_del(&timeout->list);
246 list_del_init(&timeout->list); in io_timeout_fn()
268 list_for_each_entry(timeout, &ctx->timeout_list, list) {
283 list_del_init(&timeout->list);
341 * We don't expect the list to be empty, that will only happen if we in io_link_timeout_fn()
349 list_del(&timeout->list); in io_link_timeout_fn()
[all...] |
| /kernel/linux/linux-6.6/arch/x86/pci/ |
| H A D | mmconfig-shared.c | 41 list_del(&cfg->list); in pci_mmconfig_remove()
50 list_for_each_entry_safe(cfg, tmp, &pci_mmcfg_list, list) in free_all_mmcfg()
58 /* keep list sorted by segment and starting bus number */ in list_add_sorted()
59 list_for_each_entry_rcu(cfg, &pci_mmcfg_list, list, pci_mmcfg_lock_held()) { in list_add_sorted()
63 list_add_tail_rcu(&new->list, &cfg->list); in list_add_sorted()
67 list_add_tail_rcu(&new->list, &pci_mmcfg_list); in list_add_sorted()
123 list_for_each_entry_rcu(cfg, &pci_mmcfg_list, list, pci_mmcfg_lock_held()) in pci_mmconfig_lookup()
330 list_for_each_entry(cfg, &pci_mmcfg_list, list) { in pci_mmcfg_check_end_bus_number()
334 /* Don't access the list hea in pci_mmcfg_check_end_bus_number()
[all...] |
| /kernel/liteos_a/fs/vfs/operation/ |
| H A D | vfs_other.c | 8 * 1. Redistributions of source code must retain the above copyright notice, this list of
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
330 struct dirent **list = NULL; in scandir_get_file_list() local
341 list = (struct dirent **)malloc(listSize * sizeof(struct dirent *)); in scandir_get_file_list()
342 if (list == NULL) { in scandir_get_file_list()
359 err = memcpy_s(newList, listSize * sizeof(struct dirent *), list, n * sizeof(struct dirent *)); in scandir_get_file_list()
364 free(list); in scandir_get_file_list()
365 list = newList; in scandir_get_file_list()
374 list[n] = p; in scandir_get_file_list()
381 free(list[ in scandir_get_file_list()
396 struct dirent **list = NULL; scandir() local
[all...] |
| /kernel/linux/linux-6.6/net/core/ |
| H A D | flow_offload.c | 294 list_for_each_entry(block_cb, &block->cb_list, list) { in flow_block_cb_lookup()
383 struct list_head list; member
411 struct list_head list; member
422 list_for_each_entry(cur, &flow_indir_dev_list, list) { in existing_qdiscs_register()
437 list_for_each_entry(indr_dev, &flow_block_indr_dev_list, list) { in flow_indr_dev_register()
452 list_add(&indr_dev->list, &flow_block_indr_dev_list); in flow_indr_dev_register()
468 list_for_each_entry_safe(this, next, &flow_block_indr_list, indr.list) { in __flow_block_indr_cleanup()
471 list_move(&this->indr.list, cleanup_list); in __flow_block_indr_cleanup()
479 list_for_each_entry_safe(this, next, cleanup_list, indr.list) { in flow_block_indr_notify()
480 list_del(&this->indr.list); in flow_block_indr_notify()
[all...] |
| /kernel/linux/linux-6.6/tools/power/pm-graph/ |
| H A D | sleepgraph.py | 565 list = []
570 list.append(i)
572 return list
591 def setFtraceFilterFunctions(self, list):
594 for i in list:
700 # remove all failed ones from the list
981 # get a list of target devices from the ftrace file
1053 def commonPrefix(self, list):
1054 if len(list) < 2:
1056 prefix = list[
[all...] |
| /kernel/linux/linux-5.10/mm/ |
| H A D | slab.c | 86 * Each node has its own list of partial, free and full slabs.
177 * - reduce the number of linked list operations
212 int node, struct list_head *list);
213 static void slabs_destroy(struct kmem_cache *cachep, struct list_head *list);
218 void **list);
221 void **list);
556 LIST_HEAD(list); in cache_free_pfmemalloc()
562 free_block(cachep, &objp, 1, page_node, &list); in cache_free_pfmemalloc()
565 slabs_destroy(cachep, &list); in cache_free_pfmemalloc()
696 struct list_head *list) in __drain_alien_cache()
694 __drain_alien_cache(struct kmem_cache *cachep, struct array_cache *ac, int node, struct list_head *list) __drain_alien_cache() argument
1164 init_list(struct kmem_cache *cachep, struct kmem_cache_node *list, int nodeid) init_list() argument
1639 slabs_destroy(struct kmem_cache *cachep, struct list_head *list) slabs_destroy() argument
2128 drain_array_locked(struct kmem_cache *cachep, struct array_cache *ac, int node, bool free_all, struct list_head *list) drain_array_locked() argument
2375 unsigned int *list; global() member
2642 void *list = NULL; cache_grow_end() local
2742 fixup_objfreelist_debug(struct kmem_cache *cachep, void **list) fixup_objfreelist_debug() argument
2757 fixup_slab_list(struct kmem_cache *cachep, struct kmem_cache_node *n, struct page *page, void **list) fixup_slab_list() argument
2850 void *list = NULL; cache_alloc_pfmemalloc() local
2903 void *list = NULL; cache_alloc_refill() local
3168 void *list = NULL; ____cache_alloc_node() local
3321 free_block(struct kmem_cache *cachep, void **objpp, int nr_objects, int node, struct list_head *list) free_block() argument
[all...] |
| /kernel/linux/linux-6.6/mm/ |
| H A D | slab.c | 86 * Each node has its own list of partial, free and full slabs.
178 * - reduce the number of linked list operations
213 int node, struct list_head *list);
214 static void slabs_destroy(struct kmem_cache *cachep, struct list_head *list);
219 void **list);
222 void **list);
556 LIST_HEAD(list); in cache_free_pfmemalloc()
562 free_block(cachep, &objp, 1, slab_node, &list); in cache_free_pfmemalloc()
565 slabs_destroy(cachep, &list); in cache_free_pfmemalloc()
681 struct list_head *list) in __drain_alien_cache()
679 __drain_alien_cache(struct kmem_cache *cachep, struct array_cache *ac, int node, struct list_head *list) __drain_alien_cache() argument
1149 init_list(struct kmem_cache *cachep, struct kmem_cache_node *list, int nodeid) init_list() argument
1622 slabs_destroy(struct kmem_cache *cachep, struct list_head *list) slabs_destroy() argument
2108 drain_array_locked(struct kmem_cache *cachep, struct array_cache *ac, int node, bool free_all, struct list_head *list) drain_array_locked() argument
2356 unsigned int *list; global() member
2602 void *list = NULL; cache_grow_end() local
2702 fixup_objfreelist_debug(struct kmem_cache *cachep, void **list) fixup_objfreelist_debug() argument
2717 fixup_slab_list(struct kmem_cache *cachep, struct kmem_cache_node *n, struct slab *slab, void **list) fixup_slab_list() argument
2810 void *list = NULL; cache_alloc_pfmemalloc() local
2863 void *list = NULL; cache_alloc_refill() local
3123 void *list = NULL; ____cache_alloc_node() local
3254 free_block(struct kmem_cache *cachep, void **objpp, int nr_objects, int node, struct list_head *list) free_block() argument
[all...] |
| /foundation/arkui/ace_engine/frameworks/core/components_ng/base/ |
| H A D | ui_node.h | 20 #include <list>
91 std::list<RefPtr<UINode>>::iterator RemoveChild(const RefPtr<UINode>& child, bool allowTransition = false);
104 void GetCurrentChildrenFocusHub(std::list<RefPtr<FocusHub>>& focusNodes);
106 void GetFocusChildren(std::list<RefPtr<FrameNode>>& children) const;
140 virtual const std::list<RefPtr<UINode>>& GetChildren(bool notDetach = false) const in GetChildren()
161 void GenerateOneDepthVisibleFrame(std::list<RefPtr<FrameNode>>& visibleList);
162 void GenerateOneDepthVisibleFrameWithTransition(std::list<RefPtr<FrameNode>>& visibleList);
164 std::list<RefPtr<FrameNode>>& visibleList, OffsetF& offset);
165 void GenerateOneDepthAllFrame(std::list<RefPtr<FrameNode>>& visibleList);
341 virtual void Build(std::shared_ptr<std::list<ExtraInf in OnWindowHide()
[all...] |
| /kernel/linux/linux-5.10/security/apparmor/ |
| H A D | policy.c | 101 * __add_profile - add a profiles to list and label tree
102 * @list: list to add it to (NOT NULL)
107 * Requires: namespace lock be held, or list not be shared
109 static void __add_profile(struct list_head *list, struct aa_profile *profile) in __add_profile() argument
113 AA_BUG(!list); in __add_profile()
118 list_add_rcu(&profile->base.list, list); in __add_profile()
119 /* get list reference */ in __add_profile()
127 * __list_remove_profile - remove a profile from the list i
[all...] |
| /kernel/linux/linux-6.6/drivers/net/wireless/mediatek/mt76/ |
| H A D | tx.c | 40 mt76_tx_status_lock(struct mt76_dev *dev, struct sk_buff_head *list)
43 __skb_queue_head_init(list); variable
49 mt76_tx_status_unlock(struct mt76_dev *dev, struct sk_buff_head *list)
58 while ((skb = __skb_dequeue(list)) != NULL) {
90 struct sk_buff_head *list) in __mt76_tx_status_skb_done()
109 __skb_queue_tail(list, skb); in __mt76_tx_status_skb_done()
114 struct sk_buff_head *list) in mt76_tx_status_skb_done()
116 __mt76_tx_status_skb_done(dev, skb, MT_TX_CB_TXS_DONE, list); in mt76_tx_status_skb_done()
159 if (list_empty(&wcid->list)) in mt76_tx_status_skb_add()
160 list_add_tail(&wcid->list, in mt76_tx_status_skb_add()
89 __mt76_tx_status_skb_done(struct mt76_dev *dev, struct sk_buff *skb, u8 flags, struct sk_buff_head *list) __mt76_tx_status_skb_done() argument
113 mt76_tx_status_skb_done(struct mt76_dev *dev, struct sk_buff *skb, struct sk_buff_head *list) mt76_tx_status_skb_done() argument
170 mt76_tx_status_skb_get(struct mt76_dev *dev, struct mt76_wcid *wcid, int pktid, struct sk_buff_head *list) mt76_tx_status_skb_get() argument
215 struct sk_buff_head list; mt76_tx_status_check() local
249 struct sk_buff_head list; __mt76_tx_complete_skb() local
[all...] |
| /third_party/skia/modules/skplaintexteditor/src/ |
| H A D | editor.cpp | 256 // returns smallest i such that list[i] > value. value > list[i-1]
257 // Use a binary search since list is monotonic
259 static size_t find_first_larger(const std::vector<T>& list, T value) { in find_first_larger() argument
260 return (size_t)(std::upper_bound(list.begin(), list.end(), value) - list.begin()); in find_first_larger()
327 const std::vector<size_t>& list = fLines[pos.fParagraphIndex].fLineEndOffsets; in move() local
328 size_t f = find_first_larger(list, pos.fTextByteIndex); in move()
329 pos.fTextByteIndex = f > 0 ? list[ in move()
334 const std::vector<size_t>& list = fLines[pos.fParagraphIndex].fLineEndOffsets; move() local
347 const std::vector<size_t>& list = fLines[pos.fParagraphIndex].fLineEndOffsets; move() local
374 const std::vector<size_t>& list = fLines[pos.fParagraphIndex].fLineEndOffsets; move() local
[all...] |
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | skbuff.h | 614 * @next: Next buffer in list
615 * @prev: Previous buffer in list
620 * @list: queue head
658 * @tcp_tsorted_anchor: list structure for TCP (tp->tsorted_sent_queue)
733 struct list_head list; member
1519 __list_del_entry(&skb->list); in skb_list_del_init()
1525 * @list: queue head
1529 static inline int skb_queue_empty(const struct sk_buff_head *list) in skb_queue_empty() argument
1531 return list->next == (const struct sk_buff *) list; in skb_queue_empty()
1541 skb_queue_empty_lockless(const struct sk_buff_head *list) skb_queue_empty_lockless() argument
1554 skb_queue_is_last(const struct sk_buff_head *list, const struct sk_buff *skb) skb_queue_is_last() argument
1567 skb_queue_is_first(const struct sk_buff_head *list, const struct sk_buff *skb) skb_queue_is_first() argument
1581 skb_queue_next(const struct sk_buff_head *list, const struct sk_buff *skb) skb_queue_next() argument
1599 skb_queue_prev(const struct sk_buff_head *list, const struct sk_buff *skb) skb_queue_prev() argument
1875 __skb_queue_head_init(struct sk_buff_head *list) __skb_queue_head_init() argument
1889 skb_queue_head_init(struct sk_buff_head *list) skb_queue_head_init() argument
1895 skb_queue_head_init_class(struct sk_buff_head *list, struct lock_class_key *class) skb_queue_head_init_class() argument
1908 __skb_insert(struct sk_buff *newsk, struct sk_buff *prev, struct sk_buff *next, struct sk_buff_head *list) __skb_insert() argument
1922 __skb_queue_splice(const struct sk_buff_head *list, struct sk_buff *prev, struct sk_buff *next) __skb_queue_splice() argument
1941 skb_queue_splice(const struct sk_buff_head *list, struct sk_buff_head *head) skb_queue_splice() argument
1957 skb_queue_splice_init(struct sk_buff_head *list, struct sk_buff_head *head) skb_queue_splice_init() argument
1972 skb_queue_splice_tail(const struct sk_buff_head *list, struct sk_buff_head *head) skb_queue_splice_tail() argument
1989 skb_queue_splice_tail_init(struct sk_buff_head *list, struct sk_buff_head *head) skb_queue_splice_tail_init() argument
2010 __skb_queue_after(struct sk_buff_head *list, struct sk_buff *prev, struct sk_buff *newsk) __skb_queue_after() argument
2020 __skb_queue_before(struct sk_buff_head *list, struct sk_buff *next, struct sk_buff *newsk) __skb_queue_before() argument
2037 __skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk) __skb_queue_head() argument
2054 __skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk) __skb_queue_tail() argument
2066 __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list) __skb_unlink() argument
2086 __skb_dequeue(struct sk_buff_head *list) __skb_dequeue() argument
2103 __skb_dequeue_tail(struct sk_buff_head *list) __skb_dequeue_tail() argument
2811 __skb_queue_purge(struct sk_buff_head *list) __skb_queue_purge() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/crypto/intel/qat/qat_common/ |
| H A D | qat_algs_send.h | 6 #include <linux/list.h>
10 struct list_head list; member
11 spinlock_t lock; /* protects backlog list */
18 struct list_head list; member
|
| /third_party/ltp/testcases/kernel/syscalls/setgroups/ |
| H A D | setgroups01.c | 21 static GID_T list[NGROUPS]; variable
25 TST_EXP_POSITIVE(SETGROUPS(1, list), "setgroups()"); in verify_setgroups()
30 len = GETGROUPS(NGROUPS, list); in setup()
|
| /kernel/linux/linux-5.10/fs/overlayfs/ |
| H A D | readdir.c | 43 struct list_head *list; member
190 list_add_tail(&p->l_node, rdd->list); in ovl_cache_entry_add_rb()
217 void ovl_cache_free(struct list_head *list) in ovl_cache_free() argument
222 list_for_each_entry_safe(p, n, list, l_node) in ovl_cache_free()
225 INIT_LIST_HEAD(list); in ovl_cache_free()
343 static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list, in ovl_dir_read_merged() argument
351 .list = list, in ovl_dir_read_merged()
370 list_add(&rdd.middle, rdd.list); in ovl_dir_read_merged()
543 list_add_tail(&p->l_node, rdd->list); in ovl_fill_plain()
548 ovl_dir_read_impure(struct path *path, struct list_head *list, struct rb_root *root) ovl_dir_read_impure() argument
960 ovl_check_empty_dir(struct dentry *dentry, struct list_head *list) ovl_check_empty_dir() argument
1003 ovl_cleanup_whiteouts(struct dentry *upper, struct list_head *list) ovl_cleanup_whiteouts() argument
[all...] |
| /kernel/linux/linux-5.10/net/core/ |
| H A D | fib_rules.c | 11 #include <linux/list.h>
76 /* The lock is not required here, the list in unreacheable in fib_default_rule_add()
78 list_add_tail(&r->list, &ops->rules_list); in fib_default_rule_add()
91 rule = list_entry(pos->next, struct fib_rule, list); in fib_default_rule_pref()
109 list_for_each_entry_rcu(ops, &net->rules_ops, list) { in lookup_rules_ops()
151 list_for_each_entry(o, &net->rules_ops, list) in __fib_rules_register()
155 list_add_tail_rcu(&ops->list, &net->rules_ops); in __fib_rules_register()
190 list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) { in fib_rules_cleanup_ops()
191 list_del_rcu(&rule->list); in fib_rules_cleanup_ops()
203 list_del_rcu(&ops->list); in fib_rules_unregister()
[all...] |
| /kernel/linux/linux-6.6/fs/overlayfs/ |
| H A D | readdir.c | 43 struct list_head *list; member
190 list_add_tail(&p->l_node, rdd->list); in ovl_cache_entry_add_rb()
217 void ovl_cache_free(struct list_head *list) in ovl_cache_free() argument
222 list_for_each_entry_safe(p, n, list, l_node) in ovl_cache_free()
225 INIT_LIST_HEAD(list); in ovl_cache_free()
343 static int ovl_dir_read_merged(struct dentry *dentry, struct list_head *list, in ovl_dir_read_merged() argument
351 .list = list, in ovl_dir_read_merged()
370 list_add(&rdd.middle, rdd.list); in ovl_dir_read_merged()
547 list_add_tail(&p->l_node, rdd->list); in ovl_fill_plain()
552 ovl_dir_read_impure(const struct path *path, struct list_head *list, struct rb_root *root) ovl_dir_read_impure() argument
967 ovl_check_empty_dir(struct dentry *dentry, struct list_head *list) ovl_check_empty_dir() argument
1010 ovl_cleanup_whiteouts(struct ovl_fs *ofs, struct dentry *upper, struct list_head *list) ovl_cleanup_whiteouts() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/media/mc/ |
| H A D | mc-entity.c | 12 #include <linux/list.h>
155 list_add_tail(&gobj->list, &mdev->entities); in media_gobj_create()
158 list_add_tail(&gobj->list, &mdev->pads); in media_gobj_create()
161 list_add_tail(&gobj->list, &mdev->links); in media_gobj_create()
164 list_add_tail(&gobj->list, &mdev->interfaces); in media_gobj_create()
183 /* Remove the object from mdev list */ in media_gobj_destroy()
184 list_del(&gobj->list); in media_gobj_destroy()
352 link = list_entry(link_top(graph), typeof(*link), list); in media_graph_walk_iter()
419 * traversal, with a list of links to be visited to continue the traversal.
568 list_for_each_entry(ppad, &pipe->pads, list) { in media_pipeline_add_pad()
[all...] |