| /kernel/linux/linux-6.6/drivers/s390/char/ |
| H A D | sclp_con.c | 57 list_del(&buffer->list); in sclp_conbuf_callback()
64 struct sclp_buffer, list); in sclp_conbuf_callback()
85 list_add_tail(&sclp_conbuf->list, &sclp_con_outqueue); in sclp_conbuf_emit()
92 list); in sclp_conbuf_emit()
137 struct list_head *list; in sclp_console_drop_buffer() local
143 list = sclp_con_outqueue.next; in sclp_console_drop_buffer()
146 list = list->next; in sclp_console_drop_buffer()
147 if (list == &sclp_con_outqueue) in sclp_console_drop_buffer()
149 list_del(list); in sclp_console_drop_buffer()
[all...] |
| /kernel/linux/linux-5.10/arch/powerpc/lib/ |
| H A D | rheap.c | 4 * to place their list. We cannot do that because the memory we manage may
69 /* and fixup list pointers */ in grow()
74 fixup(blks, blke, delta, &blk->list); in grow()
90 /* add all new blocks to the free list */ in grow()
93 list_add(&blk->list, &info->empty_list); in grow()
133 blk = list_entry(info->empty_list.next, rh_block_t, list); in get_slot()
134 list_del_init(&blk->list); in get_slot()
147 list_add(&blk->list, &info->empty_list); in release_slot()
173 blk = list_entry(l, rh_block_t, list); in attach_free_block()
199 /* No coalescing; list inser in attach_free_block()
[all...] |
| /kernel/linux/linux-6.6/arch/powerpc/lib/ |
| H A D | rheap.c | 4 * to place their list. We cannot do that because the memory we manage may
69 /* and fixup list pointers */ in grow()
74 fixup(blks, blke, delta, &blk->list); in grow()
90 /* add all new blocks to the free list */ in grow()
93 list_add(&blk->list, &info->empty_list); in grow()
133 blk = list_entry(info->empty_list.next, rh_block_t, list); in get_slot()
134 list_del_init(&blk->list); in get_slot()
147 list_add(&blk->list, &info->empty_list); in release_slot()
173 blk = list_entry(l, rh_block_t, list); in attach_free_block()
199 /* No coalescing; list inser in attach_free_block()
[all...] |
| /kernel/linux/linux-5.10/drivers/isdn/mISDN/ |
| H A D | timerdev.c | 37 struct list_head list; member
67 struct list_head *list = &dev->pending; in mISDN_close() local
74 while (!list_empty(list)) { in mISDN_close()
75 timer = list_first_entry(list, struct mISDNtimer, list); in mISDN_close()
80 list_del(&timer->list); in mISDN_close()
85 list_for_each_entry_safe(timer, next, &dev->expired, list) { in mISDN_close()
96 struct list_head *list = &dev->expired; in mISDN_read() local
108 while (list_empty(list) && (dev->work == 0)) { in mISDN_read()
113 !list_empty(list))); in mISDN_read()
[all...] |
| /kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlxsw/ |
| H A D | spectrum_matchall.c | 18 list_for_each_entry(mall_entry, &block->mall.list, list) in mlxsw_sp_mall_entry_find()
162 if (list_empty(&block->mall.list)) in mlxsw_sp_mall_prio_update()
166 list_for_each_entry(mall_entry, &block->mall.list, list) { in mlxsw_sp_mall_prio_update()
267 list_for_each_entry(binding, &block->binding_list, list) { in mlxsw_sp_mall_replace()
279 list_add_tail(&mall_entry->list, &block->mall.list); in mlxsw_sp_mall_replace()
285 list) in mlxsw_sp_mall_replace()
304 list_del(&mall_entry->list); in mlxsw_sp_mall_destroy()
[all...] |
| /kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/lib/ |
| H A D | devcom.c | 5 #include <linux/list.h>
11 /* protect device list */
13 /* protect component list */
20 struct list_head list; member
37 struct list_head list; member
47 list_for_each_entry(iter, &devcom_dev_list, list) in devcom_dev_exists()
86 list_add_tail(&devc->list, &devcom_dev_list); in mlx5_devcom_register_device()
98 list_del(&devc->list); in mlx5_devcom_dev_release()
156 list_add_tail(&devcom->list, &comp->comp_dev_list_head); in devcom_alloc_comp_dev()
168 list_del(&devcom->list); in devcom_free_comp_dev()
[all...] |
| /kernel/linux/linux-6.6/drivers/isdn/mISDN/ |
| H A D | timerdev.c | 37 struct list_head list; member
67 struct list_head *list = &dev->pending; in mISDN_close() local
74 while (!list_empty(list)) { in mISDN_close()
75 timer = list_first_entry(list, struct mISDNtimer, list); in mISDN_close()
80 list_del(&timer->list); in mISDN_close()
85 list_for_each_entry_safe(timer, next, &dev->expired, list) { in mISDN_close()
96 struct list_head *list = &dev->expired; in mISDN_read() local
108 while (list_empty(list) && (dev->work == 0)) { in mISDN_read()
113 !list_empty(list))); in mISDN_read()
[all...] |
| /kernel/liteos_a/testsuites/unittest/security/reugid/smoke/ |
| H A D | reugid_test_001.cpp | 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
38 static int Child1(int *list, int listSize) in Child1() argument
79 ICUNIT_ASSERT_EQUAL(getList[i], list[i], getList[i]); in Child1()
100 int list[500]; in Child() local
130 list[0] = 1000; // 1000: preset value of list[0] in Child()
131 list[1] = 2000; // 2000: preset value of list[1] in Child()
132 list[ in Child()
[all...] |
| /kernel/linux/linux-5.10/crypto/ |
| H A D | algapi.c | 14 #include <linux/list.h>
93 * This function adds a spawn to the list secondary_spawns which
108 spawn = list_first_entry_or_null(stack, struct crypto_spawn, list); in crypto_more_spawns()
112 n = list_prev_entry(spawn, list); in crypto_more_spawns()
113 list_move(&spawn->list, secondary_spawns); in crypto_more_spawns()
115 if (list_is_last(&n->list, stack)) in crypto_more_spawns()
118 n = list_next_entry(n, list); in crypto_more_spawns()
126 struct list_head *list) in crypto_remove_instance()
138 list_move(&inst->alg.cra_list, list); in crypto_remove_instance()
139 hlist_del(&inst->list); in crypto_remove_instance()
125 crypto_remove_instance(struct crypto_instance *inst, struct list_head *list) crypto_remove_instance() argument
151 crypto_remove_spawns(struct crypto_alg *alg, struct list_head *list, struct crypto_alg *nalg) crypto_remove_spawns() argument
393 crypto_remove_final(struct list_head *list) crypto_remove_final() argument
447 crypto_remove_alg(struct crypto_alg *alg, struct list_head *list) crypto_remove_alg() argument
555 struct hlist_head *list; crypto_unregister_template() local
[all...] |
| /kernel/linux/linux-6.6/fs/notify/ |
| H A D | notification.c | 24 #include <linux/list.h>
60 * from the list by a different CPU than the one freeing the event. in fsnotify_destroy_event()
62 if (!list_empty(&event->list)) { in fsnotify_destroy_event()
64 WARN_ON(!list_empty(&event->list)); in fsnotify_destroy_event()
89 struct list_head *list = &group->notification_list; in fsnotify_insert_event() local
104 if (!list_empty(&group->overflow_event->list)) { in fsnotify_insert_event()
112 if (!list_empty(list) && merge) { in fsnotify_insert_event()
122 list_add_tail(&event->list, list); in fsnotify_insert_event()
137 * We need to init list hea in fsnotify_remove_queued_event()
[all...] |
| /kernel/linux/linux-5.10/arch/sh/kernel/ |
| H A D | unwinder.c | 13 #include <linux/list.h>
33 .list = {
43 * "unwinder_list" is a linked-list of all available unwinders, sorted
52 .next = &stack_reader.list,
53 .prev = &stack_reader.list,
73 best = list_entry(unwinder_list.next, struct unwinder, list); in select_unwinder()
90 o = list_entry(tmp, struct unwinder, list); in unwinder_enqueue()
97 list_add(&ops->list, entry); in unwinder_enqueue()
106 * Install the new stack unwinder on the unwinder list, which is sorted
154 list_del(&curr_unwinder->list); in unwind_stack()
[all...] |
| /kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/ |
| H A D | amdgpu_csa.c | 70 struct list_head list; in amdgpu_map_static_csa() local
75 INIT_LIST_HEAD(&list); in amdgpu_map_static_csa()
80 list_add(&csa_tv.head, &list); in amdgpu_map_static_csa()
81 amdgpu_vm_get_pd_bo(vm, &list, &pd); in amdgpu_map_static_csa()
83 r = ttm_eu_reserve_buffers(&ticket, &list, true, NULL); in amdgpu_map_static_csa()
91 ttm_eu_backoff_reservation(&ticket, &list); in amdgpu_map_static_csa()
103 ttm_eu_backoff_reservation(&ticket, &list); in amdgpu_map_static_csa()
107 ttm_eu_backoff_reservation(&ticket, &list); in amdgpu_map_static_csa()
|
| /kernel/linux/linux-6.6/arch/sh/kernel/ |
| H A D | unwinder.c | 13 #include <linux/list.h>
33 .list = {
43 * "unwinder_list" is a linked-list of all available unwinders, sorted
52 .next = &stack_reader.list,
53 .prev = &stack_reader.list,
73 best = list_entry(unwinder_list.next, struct unwinder, list); in select_unwinder()
90 o = list_entry(tmp, struct unwinder, list); in unwinder_enqueue()
97 list_add(&ops->list, entry); in unwinder_enqueue()
106 * Install the new stack unwinder on the unwinder list, which is sorted
154 list_del(&curr_unwinder->list); in unwind_stack()
[all...] |
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | resource_ext.h | 9 #include <linux/list.h>
20 * Common resource list management data structure and interfaces to support
63 #define resource_list_for_each_entry(entry, list) \
64 list_for_each_entry((entry), (list), node)
66 #define resource_list_for_each_entry_safe(entry, tmp, list) \
67 list_for_each_entry_safe((entry), (tmp), (list), node)
70 resource_list_first_type(struct list_head *list, unsigned long type) in resource_list_first_type() argument
74 resource_list_for_each_entry(entry, list) { in resource_list_first_type()
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | resource_ext.h | 9 #include <linux/list.h>
20 * Common resource list management data structure and interfaces to support
63 #define resource_list_for_each_entry(entry, list) \
64 list_for_each_entry((entry), (list), node)
66 #define resource_list_for_each_entry_safe(entry, tmp, list) \
67 list_for_each_entry_safe((entry), (tmp), (list), node)
70 resource_list_first_type(struct list_head *list, unsigned long type) in resource_list_first_type() argument
74 resource_list_for_each_entry(entry, list) { in resource_list_first_type()
|
| /kernel/linux/linux-6.6/io_uring/ |
| H A D | alloc_cache.h | 18 wq_stack_add_head(&entry->node, &cache->list); in io_alloc_cache_put()
28 return !cache->list.next; in io_alloc_cache_empty()
33 if (cache->list.next) { in io_alloc_cache_get()
36 entry = container_of(cache->list.next, struct io_cache_entry, node); in io_alloc_cache_get()
38 cache->list.next = cache->list.next->next; in io_alloc_cache_get()
49 cache->list.next = NULL; in io_alloc_cache_init()
|
| /applications/standard/app_samples/code/SuperFeature/DistributedAppDev/DistributeCalc/entry/src/main/js/MainAbility/common/ |
| H A D | RemoteDeviceModel.js | 53 let list = new Array()
56 list[i] = device
59 this.deviceList = list
60 logger.debug(TAG, `ready, device list = ${JSON.stringify(device)}`)
69 logger.debug(TAG, `offline, device list= ${JSON.stringify(this.deviceList)}`)
76 logger.debug(TAG, `online, device list= ${JSON.stringify(this.deviceList)}`)
86 let list = []
89 list[j] = device
92 this.deviceList = list
94 logger.info(TAG, `offline, updated device list
[all...] |
| /kernel/linux/linux-6.6/net/netfilter/ |
| H A D | nft_connlimit.c | 17 struct nf_conncount_list *list; member
46 if (nf_conncount_add(nft_net(pkt), priv->list, tuple_ptr, zone)) { in nft_connlimit_do_eval()
51 count = priv->list->count; in nft_connlimit_do_eval()
80 priv->list = kmalloc(sizeof(*priv->list), GFP_KERNEL_ACCOUNT); in nft_connlimit_do_init()
81 if (!priv->list) in nft_connlimit_do_init()
84 nf_conncount_list_init(priv->list); in nft_connlimit_do_init()
94 kfree(priv->list); in nft_connlimit_do_init()
103 nf_conncount_cache_free(priv->list); in nft_connlimit_do_destroy()
104 kfree(priv->list); in nft_connlimit_do_destroy()
[all...] |
| /kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx4/ |
| H A D | intf.c | 16 * copyright notice, this list of conditions and the following
20 * copyright notice, this list of conditions and the following
42 struct list_head list; member
65 list_add_tail(&dev_ctx->list, &priv->ctx_list); in mlx4_add_device()
78 list_for_each_entry(dev_ctx, &priv->ctx_list, list) in mlx4_remove_device()
81 list_del(&dev_ctx->list); in mlx4_remove_device()
99 list_add_tail(&intf->list, &intf_list); in mlx4_register_interface()
124 list_del(&intf->list); in mlx4_unregister_interface()
159 list_for_each_entry_safe(dev_ctx, temp_dev_ctx, &priv->ctx_list, list) { in mlx4_do_bond()
162 list_del(&dev_ctx->list); in mlx4_do_bond()
[all...] |
| /kernel/linux/linux-5.10/drivers/s390/char/ |
| H A D | raw3270.h | 99 struct list_head list; /* list head for request queueing. */ member
123 return list_empty(&rq->list); in raw3270_request_final()
150 struct list_head list; member
195 struct list_head list; member
209 struct list_head list; member
223 list_for_each_entry(cs, free_list, list) { in alloc_string()
233 list_del(&cs->list); in alloc_string()
235 INIT_LIST_HEAD(&cs->list); in alloc_string()
248 /* Find out the left neighbour in free memory list in free_string()
[all...] |
| /kernel/linux/linux-5.10/drivers/soc/ti/ |
| H A D | knav_qmss.h | 133 struct list_head list; member
145 struct list_head list; member
190 * @list: instance in the device's region list
191 * @pools: list of descriptor pools in the region
202 struct list_head list; member
217 * @list: list head
218 * @region_inst: instance in the region's pool list
230 struct list_head list; member
286 struct list_head list; global() member
335 struct list_head list; global() member
[all...] |
| /kernel/linux/linux-5.10/sound/pci/ctxfi/ |
| H A D | ctvmem.c | 44 entry = list_entry(pos, struct ct_vm_block, list); in get_vm_block()
52 /* Move the vm node from unused list to used list directly */ in get_vm_block()
53 list_move(&entry->list, &vm->used); in get_vm_block()
65 list_add(&block->list, &vm->used); in get_vm_block()
83 list_del(&block->list); in put_vm_block()
87 entry = list_entry(pos, struct ct_vm_block, list); in put_vm_block()
92 list_add_tail(&block->list, &vm->unused); in put_vm_block()
100 __list_add(&block->list, pos->prev, pos); in put_vm_block()
105 pos = &entry->list; in put_vm_block()
[all...] |
| /kernel/linux/linux-6.6/drivers/soc/ti/ |
| H A D | knav_qmss.h | 133 struct list_head list; member
145 struct list_head list; member
190 * @list: instance in the device's region list
191 * @pools: list of descriptor pools in the region
202 struct list_head list; member
217 * @list: list head
218 * @region_inst: instance in the region's pool list
230 struct list_head list; member
286 struct list_head list; global() member
335 struct list_head list; global() member
[all...] |
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | parse-events.h | 8 #include <linux/list.h>
87 /** @list: The term list the term is a part of. */
88 struct list_head list; member
144 /* The list parsed events are placed on. */
145 struct list_head list; member
187 int parse_events__modifier_event(struct list_head *list, char *str, bool add);
188 int parse_events__modifier_group(struct list_head *list, char *event_mod);
189 int parse_events_name(struct list_head *list, const char *name);
190 int parse_events_add_tracepoint(struct list_head *list, in
[all...] |
| /kernel/linux/linux-6.6/sound/pci/ctxfi/ |
| H A D | ctvmem.c | 44 entry = list_entry(pos, struct ct_vm_block, list); in get_vm_block()
52 /* Move the vm node from unused list to used list directly */ in get_vm_block()
53 list_move(&entry->list, &vm->used); in get_vm_block()
65 list_add(&block->list, &vm->used); in get_vm_block()
83 list_del(&block->list); in put_vm_block()
87 entry = list_entry(pos, struct ct_vm_block, list); in put_vm_block()
92 list_add_tail(&block->list, &vm->unused); in put_vm_block()
100 __list_add(&block->list, pos->prev, pos); in put_vm_block()
105 pos = &entry->list; in put_vm_block()
[all...] |