Home
last modified time | relevance | path

Searched refs:list (Results 801 - 825 of 16190) sorted by relevance

1...<<31323334353637383940>>...648

/kernel/linux/linux-6.6/drivers/char/agp/
H A Disoch.c6 #include <linux/list.h>
17 struct list_head list; member
25 struct agp_3_5_dev *cur, *n = list_entry(new, struct agp_3_5_dev, list); in agp_3_5_dev_list_insert()
29 cur = list_entry(pos, struct agp_3_5_dev, list); in agp_3_5_dev_list_insert()
36 static void agp_3_5_dev_list_sort(struct agp_3_5_dev *list, unsigned int ndevs) in agp_3_5_dev_list_sort() argument
40 struct list_head *pos, *tmp, *head = &list->list, *start = head->next; in agp_3_5_dev_list_sort()
46 cur = list_entry(pos, struct agp_3_5_dev, list); in agp_3_5_dev_list_sort()
81 struct list_head *head = &dev_list->list, *pos; in agp_3_5_isochronous_node_enable()
102 * Sort the device list b in agp_3_5_isochronous_node_enable()
[all...]
/kernel/linux/linux-6.6/sound/soc/sof/
H A Dsof-client.c11 #include <linux/list.h>
27 * @list: item in SOF core client event list
33 struct list_head list; member
40 * @list: item in SOF core client event list
45 struct list_head list; member
247 /* add to list of SOF client devices */ in sof_client_dev_register()
249 list_add(&cdev->list, &sdev->ipc_client_list); in sof_client_dev_register()
274 list_for_each_entry(cdev, &sdev->ipc_client_list, list) { in sof_client_dev_unregister()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dh264_mb_template.c75 int list; in hl_decode_mb() local
76 for (list = 0; list < sl->list_count; list++) { in hl_decode_mb()
77 if (!USES_LIST(mb_type, list)) in hl_decode_mb()
80 int8_t *ref = &sl->ref_cache[list][scan8[0]]; in hl_decode_mb()
84 int ref = sl->ref_cache[list][scan8[i]]; in hl_decode_mb()
86 fill_rectangle(&sl->ref_cache[list][scan8[i]], 2, 2, in hl_decode_mb()
285 int list; in hl_decode_mb_444() local
286 for (list in hl_decode_mb_444()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DMessagePatternUtil.java83 * @return the list of MessageContentsNode nodes that this message contains
87 return list; in getContents()
95 return list.toString(); in toString()
102 if (node instanceof TextNode && !list.isEmpty()) { in addContentsNode()
104 MessageContentsNode lastNode = list.get(list.size() - 1); in addContentsNode()
111 list.add(node); in addContentsNode()
114 list = Collections.unmodifiableList(list); in freeze()
118 private volatile List<MessageContentsNode> list field in MessagePatternUtil.MessageNode
396 private volatile List<VariantNode> list = new ArrayList<VariantNode>(); global() field in MessagePatternUtil.ComplexArgStyleNode
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DMessagePatternUtil.java82 * @return the list of MessageContentsNode nodes that this message contains
85 return list; in getContents()
92 return list.toString(); in toString()
99 if (node instanceof TextNode && !list.isEmpty()) { in addContentsNode()
101 MessageContentsNode lastNode = list.get(list.size() - 1); in addContentsNode()
108 list.add(node); in addContentsNode()
111 list = Collections.unmodifiableList(list); in freeze()
115 private volatile List<MessageContentsNode> list field in MessagePatternUtil.MessageNode
373 private volatile List<VariantNode> list = new ArrayList<VariantNode>(); global() field in MessagePatternUtil.ComplexArgStyleNode
[all...]
/third_party/node/lib/internal/
H A Dtimers.js13 // linked list implementation, since timers depend on it extensively. It can be
57 // is possible in the JavaScript layer. Any one list of timers is able to be
61 // Removal from an object-property linked list is also virtually constant-time
64 // always be at the beginning of the list for reasons stated above. Any timers
71 // Timeout lists and the object map lookup of a specific list by the duration of
72 // timers within (or creation of a new list). However, these operations combined
149 // individual IDs to determine which list was created first.
156 // - value = linked list
201 // Make sure the linked list only shows the minimal necessary information.
246 this._idleNext = this; // Create the list wit
[all...]
H A Durl.js271 // Append (innerSequence[0], innerSequence[1]) to querys list.
338 const list = this[searchParams];
340 for (let i = 0; i < list.length; i += 2)
343 `${innerInspect(list[i])} => ${innerInspect(list[i + 1])}`);
390 const list = this[searchParams];
395 for (let i = 0; i < list.length;) {
396 if (list[i] === name && list[i + 1] === value) {
397 list
[all...]
/third_party/node/deps/openssl/openssl/crypto/ts/
H A Dts_conf.c316 STACK_OF(CONF_VALUE) *list = NULL; in TS_CONF_set_policies()
320 if (policies && (list = X509V3_parse_list(policies)) == NULL) { in TS_CONF_set_policies()
324 for (i = 0; i < sk_CONF_VALUE_num(list); ++i) { in TS_CONF_set_policies()
325 CONF_VALUE *val = sk_CONF_VALUE_value(list, i); in TS_CONF_set_policies()
340 sk_CONF_VALUE_pop_free(list, X509V3_conf_free); in TS_CONF_set_policies()
348 STACK_OF(CONF_VALUE) *list = NULL; in TS_CONF_set_digests()
355 if ((list = X509V3_parse_list(digests)) == NULL) { in TS_CONF_set_digests()
359 if (sk_CONF_VALUE_num(list) == 0) { in TS_CONF_set_digests()
363 for (i = 0; i < sk_CONF_VALUE_num(list); ++i) { in TS_CONF_set_digests()
364 CONF_VALUE *val = sk_CONF_VALUE_value(list, in TS_CONF_set_digests()
[all...]
/third_party/openssl/crypto/ts/
H A Dts_conf.c316 STACK_OF(CONF_VALUE) *list = NULL; in TS_CONF_set_policies()
320 if (policies && (list = X509V3_parse_list(policies)) == NULL) { in TS_CONF_set_policies()
324 for (i = 0; i < sk_CONF_VALUE_num(list); ++i) { in TS_CONF_set_policies()
325 CONF_VALUE *val = sk_CONF_VALUE_value(list, i); in TS_CONF_set_policies()
340 sk_CONF_VALUE_pop_free(list, X509V3_conf_free); in TS_CONF_set_policies()
348 STACK_OF(CONF_VALUE) *list = NULL; in TS_CONF_set_digests()
355 if ((list = X509V3_parse_list(digests)) == NULL) { in TS_CONF_set_digests()
359 if (sk_CONF_VALUE_num(list) == 0) { in TS_CONF_set_digests()
363 for (i = 0; i < sk_CONF_VALUE_num(list); ++i) { in TS_CONF_set_digests()
364 CONF_VALUE *val = sk_CONF_VALUE_value(list, in TS_CONF_set_digests()
[all...]
/foundation/resourceschedule/device_standby/services/common/src/
H A Dbackground_task_helper.cpp36 std::vector<std::shared_ptr<ContinuousTaskCallbackInfo>> &list) in GetContinuousTaskApps()
39 if (BackgroundTaskMgrHelper::GetContinuousTaskApps(list) != OHOS::ERR_OK) { in GetContinuousTaskApps()
47 bool WEAK_FUNC BackgroundTaskHelper::GetTransientTaskApps(std::vector<std::shared_ptr<TransientTaskAppInfo>> &list) in GetTransientTaskApps() argument
50 if (BackgroundTaskMgrHelper::GetTransientTaskApps(list) != OHOS::ERR_OK) { in GetTransientTaskApps()
35 GetContinuousTaskApps( std::vector<std::shared_ptr<ContinuousTaskCallbackInfo>> &list) GetContinuousTaskApps() argument
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/test/mock/
H A Ddb_change_data_mock.h32 const std::list<DBEntry> &GetEntriesInserted() const override;
33 const std::list<DBEntry> &GetEntriesUpdated() const override;
34 const std::list<DBEntry> &GetEntriesDeleted() const override;
40 std::list<DBEntry> entries_[BUTT];
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/storage/src/kv/
H A Dkvdb_commit_notify_filterable_data.h31 const std::list<Entry> GetInsertedEntries(int &errCode) const override;
34 const std::list<Entry> GetUpdatedEntries(int &errCode) const override;
37 const std::list<Entry> GetDeletedEntries(int &errCode) const override;
40 const std::list<KvDBConflictEntry> GetCommitConflicts(int &errCode) const override;
/third_party/NuttX/fs/vfs/
H A Dfs_getfilep.c15 * notice, this list of conditions and the following disclaimer.
17 * notice, this list of conditions and the following disclaimer in
75 struct filelist *list; in fs_getfilep_normal() local
90 * thread-specific file list. in fs_getfilep_normal()
93 list = sched_getfiles(); in fs_getfilep_normal()
95 /* The file list can be NULL under two cases: (1) One is an obscure in fs_getfilep_normal()
102 if (list == NULL) in fs_getfilep_normal()
107 /* And return the file pointer from the list */ in fs_getfilep_normal()
109 *filep = &list->fl_files[fd]; in fs_getfilep_normal()
/third_party/node/test/fixtures/source-map/
H A Dtabs.js4 var cubes, list, math, num, number, opposite, race, square;
21 list = [1, 2, 3, 4, 5];
46 for (i = 0, len = list.length; i < len; i++) {
47 num = list[i];
/third_party/node/benchmark/misc/
H A Dfreelist.js16 const list = new FreeList('test', poolSize, Object);
22 used.push(list.alloc());
30 list.free(used[j]);
35 list.alloc();
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dinstruction_list.cpp21 std::vector<std::unique_ptr<Instruction>>&& list) { in InsertBefore()
22 Instruction* first_node = list.front().get(); in InsertBefore()
23 for (auto& i : list) { in InsertBefore()
26 list.clear(); in InsertBefore()
20 InsertBefore( std::vector<std::unique_ptr<Instruction>>&& list) InsertBefore() argument
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dinstruction_list.cpp21 std::vector<std::unique_ptr<Instruction>>&& list) { in InsertBefore()
22 Instruction* first_node = list.front().get(); in InsertBefore()
23 for (auto& i : list) { in InsertBefore()
26 list.clear(); in InsertBefore()
20 InsertBefore( std::vector<std::unique_ptr<Instruction>>&& list) InsertBefore() argument
/third_party/spirv-tools/source/opt/
H A Dinstruction_list.cpp21 std::vector<std::unique_ptr<Instruction>>&& list) { in InsertBefore()
22 Instruction* first_node = list.front().get(); in InsertBefore()
23 for (auto& i : list) { in InsertBefore()
26 list.clear(); in InsertBefore()
20 InsertBefore( std::vector<std::unique_ptr<Instruction>>&& list) InsertBefore() argument
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dscheduler.c102 * is the "ready list," which consists of "input nodes" (nodes that produce a
106 * stores. Each input node on the ready list represents a live value register
145 * refer to a register load. This removes it from the list of ready and
152 * ready list, keeping only the nodes that could be successfully scheduled, so
180 * able to schedule the first node on the ready list.
184 /* This is the list of ready and partially-ready nodes. A partially-ready
219 /* For each physical register, a linked list of loads associated with it in
380 /* Get the number of slots required for a node on the ready list.
399 list_for_each_entry(gpir_node, node, &ctx->ready_list, list) { in verify_ready_list()
429 * the ready list, bu in schedule_insert_ready_list()
[all...]
/kernel/linux/linux-5.10/drivers/iommu/
H A Dioasid.c42 * @list: registered custom allocators
50 struct list_head list; member
112 list_add_tail(&ops->list, &ia_data->slist); in ioasid_alloc_allocator()
154 * the later registered allocators in a list in case the first one gets in ioasid_register_allocator()
162 list_add_tail(&ia_data->list, &allocators_list); in ioasid_register_allocator()
171 list_for_each_entry(pallocator, &allocators_list, list) { in ioasid_register_allocator()
182 list_add_tail(&ops->list, &pallocator->slist); in ioasid_register_allocator()
186 list_add_tail(&ia_data->list, &allocators_list); in ioasid_register_allocator()
202 * Remove an allocator from the list, activate the next allocator in
217 list_for_each_entry(pallocator, &allocators_list, list) { in ioasid_unregister_allocator()
[all...]
/kernel/linux/linux-5.10/sound/soc/intel/common/
H A Dsst-ipc.c10 #include <linux/list.h>
38 list); in msg_get_empty()
39 list_del(&msg->list); in msg_get_empty()
60 list_del(&msg->list); in tx_wait_done()
73 list_add_tail(&msg->list, &ipc->empty_list); in tx_wait_done()
105 list_add_tail(&msg->list, &ipc->tx_list); in ipc_tx_message()
136 list_add(&ipc->msg[i].list, &ipc->empty_list); in msg_empty_list_init()
170 msg = list_first_entry(&ipc->tx_list, struct ipc_message, list); in ipc_tx_msgs()
171 list_move(&msg->list, &ipc->rx_list); in ipc_tx_msgs()
230 dev_err(ipc->dev, "error: rx list empt in sst_ipc_reply_find_msg()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/sun4i/
H A Dsun4i_drv.c241 static void sun4i_drv_traverse_endpoints(struct endpoint_list *list, in sun4i_drv_traverse_endpoints() argument
295 kfifo_put(&list->fifo, remote); in sun4i_drv_traverse_endpoints()
300 struct endpoint_list *list, in sun4i_drv_add_endpoints()
310 * child, but without adding it to the component list. in sun4i_drv_add_endpoints()
311 * Otherwise, we obviously want to add it to the list. in sun4i_drv_add_endpoints()
327 * component list. in sun4i_drv_add_endpoints()
340 sun4i_drv_traverse_endpoints(list, node, 1); in sun4i_drv_add_endpoints()
344 sun4i_drv_traverse_endpoints(list, node, 3); in sun4i_drv_add_endpoints()
345 sun4i_drv_traverse_endpoints(list, node, 5); in sun4i_drv_add_endpoints()
376 struct endpoint_list list; in sun4i_drv_probe() local
299 sun4i_drv_add_endpoints(struct device *dev, struct endpoint_list *list, struct component_match **match, struct device_node *node) sun4i_drv_add_endpoints() argument
[all...]
/kernel/linux/linux-5.10/drivers/staging/most/i2c/
H A Di2c.c24 * list_first_mbo - get the first mbo from a list
25 * @ptr: the list head to take the mbo from.
28 list_first_entry(ptr, struct mbo, list)
40 struct list_head list; member
117 * list if it is an "read" request
132 list_add_tail(&mbo->list, &dev->rx.list); in enqueue()
161 * If channel direction is RX, complete the buffers in list with
177 while (!list_empty(&dev->rx.list)) { in poison_channel()
178 mbo = list_first_mbo(&dev->rx.list); in poison_channel()
[all...]
/kernel/linux/linux-5.10/drivers/staging/media/imx/
H A Dimx-media-dev-common.c42 list_for_each_entry(sd, &imxmd->v4l2_dev.subdevs, list) { in imx_media_create_csi2_links()
51 list_for_each_entry(sd, &imxmd->v4l2_dev.subdevs, list) { in imx_media_create_csi2_links()
63 * adds given video device to given imx-media source pad vdev list.
85 v4l2_warn(&imxmd->v4l2_dev, "%s:%u has no vdev list!\n", in imx_media_add_vdev_to_pad()
95 list_for_each_entry(pad_vdev, pad_vdev_list, list) { in imx_media_add_vdev_to_pad()
109 list_add_tail(&pad_vdev->list, pad_vdev_list); in imx_media_add_vdev_to_pad()
118 list_for_each_entry(link, &entity->links, list) { in imx_media_add_vdev_to_pad()
133 * for each pad, to hold the list of video devices reachable from that
143 list_for_each_entry(sd, &imxmd->v4l2_dev.subdevs, list) { in imx_media_alloc_pad_vdev_lists()
172 list_for_each_entry(vdev, &imxmd->vdev_list, list) { in imx_media_create_pad_vdev_lists()
[all...]
/kernel/linux/linux-6.6/include/drm/
H A Ddrm_gpuva_mgr.h28 #include <linux/list.h>
226 * @list: the &list_head to track GPU VA mappings
228 struct list_head list; member
255 if (va && !list_is_last(&va->rb.entry, &va->mgr->rb.list)) in __drm_gpuva_next()
315 list_for_each_entry(va__, &(mgr__)->rb.list, rb.entry)
328 list_for_each_entry_safe(va__, next__, &(mgr__)->rb.list, rb.entry)
519 * struct drm_gpuva_ops - wraps a list of &drm_gpuva_op
523 * @list: the &list_head
525 struct list_head list; member
533 * This iterator walks over all ops within a given list o
[all...]

Completed in 15 milliseconds

1...<<31323334353637383940>>...648