| /third_party/typescript/tests/baselines/reference/ |
| H A D | topLevelAwait.1(module=esnext,target=es2015).js | 78 for await (const item of arr) {
79 item;
95 const item = _c;
96 item;
|
| H A D | topLevelAwait.1(module=esnext,target=es2017).js | 78 for await (const item of arr) {
79 item;
95 const item = _c;
96 item;
|
| H A D | topLevelAwait.1(module=system,target=es2015).js | 78 for await (const item of arr) {
79 item;
100 const item = _c;
101 item;
|
| H A D | topLevelAwait.1(module=system,target=es2017).js | 78 for await (const item of arr) {
79 item;
100 const item = _c;
101 item;
|
| H A D | importTypeGenericTypes.js | 29 item: Bar.I<T>;
39 item: {a: string, b: number, c: object, data: T};
101 item: Bar.I<T>;
113 item: {
|
| /third_party/python/Lib/test/test_tomllib/ |
| H A D | burntsushi.py | 63 return [normalize(item) for item in obj]
79 return [normalize(item) for item in value]
|
| /third_party/rust/crates/syn/src/ |
| H A D | tt.rs | 25 Some(item) => item, in eq()
62 for item in g.stream() { in hash()
63 TokenTreeHelper(&item).hash(h); in hash()
|
| /third_party/vk-gl-cts/framework/delibs/decpp/ |
| H A D | deSTLUtil.hpp | 40 //! Test whether `item` is a member of `container`. The type `C` must be an
44 inline bool contains (const C& container, const typename C::key_type& item) in contains() argument
46 const typename C::const_iterator it = container.find(item); in contains()
51 inline bool contains (const I& begin, const I& end, const K& item) in contains() argument
53 const I it = std::find(begin, end, item); in contains()
|
| /kernel/linux/common_modules/tzdriver/ion/ |
| H A D | dynamic_ion_mem.c | 190 struct dynamic_mem_item *item = NULL;
in find_memitem_by_configid_locked() local
191 list_for_each_entry(item, &g_dynamic_mem_list.list, head) {
in find_memitem_by_configid_locked()
192 if (item->configid == configid)
in find_memitem_by_configid_locked()
193 return item;
in find_memitem_by_configid_locked()
200 struct dynamic_mem_item *item = NULL;
in find_memitem_by_uuid_locked() local
201 list_for_each_entry(item, &g_dynamic_mem_list.list, head) {
in find_memitem_by_uuid_locked()
202 if (!memcmp(&item->uuid, uuid, sizeof(*uuid)))
in find_memitem_by_uuid_locked()
203 return item;
in find_memitem_by_uuid_locked()
280 tloge("alloc mem item failed\n");
in alloc_dyn_mem_item()
317 tloge("alloc dyn mem item faile in trans_configid2memid()
411 struct dynamic_mem_item *item = NULL; kill_ion_by_cafd() local
[all...] |
| /third_party/gn/src/gn/ |
| H A D | commands.cc | 20 #include "gn/item.h"
115 const Item* item = setup->builder().GetItem(label); in ResolveStringFromCommandLineInput() local
116 if (item) { in ResolveStringFromCommandLineInput()
117 if (const Config* as_config = item->AsConfig()) in ResolveStringFromCommandLineInput()
119 else if (const Target* as_target = item->AsTarget()) in ResolveStringFromCommandLineInput()
121 else if (const Toolchain* as_toolchain = item->AsToolchain()) in ResolveStringFromCommandLineInput()
124 // Not an item, assume this must be a file. in ResolveStringFromCommandLineInput()
205 // Returns the file path of the BUILD.gn file generating this item.
206 base::FilePath BuildFileForItem(const Item* item) { in BuildFileForItem() argument
208 // this Item. This may not exist if the item i in BuildFileForItem()
570 const Item* item = setup->builder().GetItem(label); ResolveTargetFromCommandLineString() local
[all...] |
| H A D | substitution_writer.cc | 254 for (const auto& item : list.list())
255 output->push_back(ApplyPatternToSource(target, settings, item, source));
265 for (const auto& item : list.list())
267 ApplyPatternToSourceAsString(target, settings, item, source));
277 for (const auto& item : list.list())
279 ApplyPatternToSourceAsOutputFile(target, settings, item, source));
425 for (const auto& item : list.list())
426 output->push_back(ApplyPatternToTargetAsOutputFile(target, tool, item));
497 for (const auto& item : list.list())
498 output->push_back(ApplyPatternToCompilerAsOutputFile(target, source, item));
[all...] |
| /kernel/linux/linux-5.10/net/sunrpc/ |
| H A D | cache.c | 40 static bool cache_defer_req(struct cache_req *req, struct cache_head *item);
41 static void cache_revisit_request(struct cache_head *item);
285 * It checks the currency of a cache item and will (later)
292 * upcall completed but item is still invalid (implying that
293 * the cache item has been replaced with a newer one).
574 #define DFR_HASH(item) ((((long)item)>>4 ^ (((long)item)>>13)) % DFR_HASHSIZE)
592 static void __hash_deferred_req(struct cache_deferred_req *dreq, struct cache_head *item) in __hash_deferred_req() argument
594 int hash = DFR_HASH(item); in __hash_deferred_req()
600 setup_deferral(struct cache_deferred_req *dreq, struct cache_head *item, int count_me) setup_deferral() argument
632 cache_wait_req(struct cache_req *req, struct cache_head *item) cache_wait_req() argument
692 cache_defer_req(struct cache_req *req, struct cache_head *item) cache_defer_req() argument
715 cache_revisit_request(struct cache_head *item) cache_revisit_request() argument
789 struct cache_head *item; global() member
[all...] |
| /kernel/linux/linux-5.10/fs/ocfs2/cluster/ |
| H A D | heartbeat.c | 1489 static struct o2hb_region *to_o2hb_region(struct config_item *item) in to_o2hb_region() argument
1491 return item ? container_of(item, struct o2hb_region, hr_item) : NULL; in to_o2hb_region()
1497 static void o2hb_region_release(struct config_item *item) in o2hb_region_release() argument
1501 struct o2hb_region *reg = to_o2hb_region(item); in o2hb_region_release()
1561 static ssize_t o2hb_region_block_bytes_show(struct config_item *item, in o2hb_region_block_bytes_show() argument
1564 return sprintf(page, "%u\n", to_o2hb_region(item)->hr_block_bytes); in o2hb_region_block_bytes_show()
1567 static ssize_t o2hb_region_block_bytes_store(struct config_item *item, in o2hb_region_block_bytes_store() argument
1571 struct o2hb_region *reg = to_o2hb_region(item); in o2hb_region_block_bytes_store()
1590 static ssize_t o2hb_region_start_block_show(struct config_item *item, in o2hb_region_start_block_show() argument
1596 o2hb_region_start_block_store(struct config_item *item, const char *page, size_t count) o2hb_region_start_block_store() argument
1616 o2hb_region_blocks_show(struct config_item *item, char *page) o2hb_region_blocks_show() argument
1621 o2hb_region_blocks_store(struct config_item *item, const char *page, size_t count) o2hb_region_blocks_store() argument
1644 o2hb_region_dev_show(struct config_item *item, char *page) o2hb_region_dev_show() argument
1759 o2hb_region_dev_store(struct config_item *item, const char *page, size_t count) o2hb_region_dev_store() argument
1917 o2hb_region_pid_show(struct config_item *item, char *page) o2hb_region_pid_show() argument
2071 o2hb_heartbeat_group_drop_item(struct config_group *group, struct config_item *item) o2hb_heartbeat_group_drop_item() argument
2134 o2hb_heartbeat_group_dead_threshold_show(struct config_item *item, char *page) o2hb_heartbeat_group_dead_threshold_show() argument
2140 o2hb_heartbeat_group_dead_threshold_store(struct config_item *item, const char *page, size_t count) o2hb_heartbeat_group_dead_threshold_store() argument
2156 o2hb_heartbeat_group_mode_show(struct config_item *item, char *page) o2hb_heartbeat_group_mode_show() argument
2163 o2hb_heartbeat_group_mode_store(struct config_item *item, const char *page, size_t count) o2hb_heartbeat_group_mode_store() argument
[all...] |
| /kernel/linux/linux-6.6/fs/ocfs2/cluster/ |
| H A D | heartbeat.c | 1478 static struct o2hb_region *to_o2hb_region(struct config_item *item) in to_o2hb_region() argument
1480 return item ? container_of(item, struct o2hb_region, hr_item) : NULL; in to_o2hb_region()
1486 static void o2hb_region_release(struct config_item *item) in o2hb_region_release() argument
1490 struct o2hb_region *reg = to_o2hb_region(item); in o2hb_region_release()
1550 static ssize_t o2hb_region_block_bytes_show(struct config_item *item, in o2hb_region_block_bytes_show() argument
1553 return sprintf(page, "%u\n", to_o2hb_region(item)->hr_block_bytes); in o2hb_region_block_bytes_show()
1556 static ssize_t o2hb_region_block_bytes_store(struct config_item *item, in o2hb_region_block_bytes_store() argument
1560 struct o2hb_region *reg = to_o2hb_region(item); in o2hb_region_block_bytes_store()
1579 static ssize_t o2hb_region_start_block_show(struct config_item *item, in o2hb_region_start_block_show() argument
1585 o2hb_region_start_block_store(struct config_item *item, const char *page, size_t count) o2hb_region_start_block_store() argument
1606 o2hb_region_blocks_show(struct config_item *item, char *page) o2hb_region_blocks_show() argument
1611 o2hb_region_blocks_store(struct config_item *item, const char *page, size_t count) o2hb_region_blocks_store() argument
1634 o2hb_region_dev_show(struct config_item *item, char *page) o2hb_region_dev_show() argument
1749 o2hb_region_dev_store(struct config_item *item, const char *page, size_t count) o2hb_region_dev_store() argument
1906 o2hb_region_pid_show(struct config_item *item, char *page) o2hb_region_pid_show() argument
2060 o2hb_heartbeat_group_drop_item(struct config_group *group, struct config_item *item) o2hb_heartbeat_group_drop_item() argument
2123 o2hb_heartbeat_group_dead_threshold_show(struct config_item *item, char *page) o2hb_heartbeat_group_dead_threshold_show() argument
2129 o2hb_heartbeat_group_dead_threshold_store(struct config_item *item, const char *page, size_t count) o2hb_heartbeat_group_dead_threshold_store() argument
2145 o2hb_heartbeat_group_mode_show(struct config_item *item, char *page) o2hb_heartbeat_group_mode_show() argument
2152 o2hb_heartbeat_group_mode_store(struct config_item *item, const char *page, size_t count) o2hb_heartbeat_group_mode_store() argument
[all...] |
| /kernel/linux/linux-6.6/net/sunrpc/ |
| H A D | cache.c | 42 static bool cache_defer_req(struct cache_req *req, struct cache_head *item);
43 static void cache_revisit_request(struct cache_head *item);
287 * It checks the currency of a cache item and will (later)
294 * upcall completed but item is still invalid (implying that
295 * the cache item has been replaced with a newer one).
576 #define DFR_HASH(item) ((((long)item)>>4 ^ (((long)item)>>13)) % DFR_HASHSIZE)
594 static void __hash_deferred_req(struct cache_deferred_req *dreq, struct cache_head *item) in __hash_deferred_req() argument
596 int hash = DFR_HASH(item); in __hash_deferred_req()
602 setup_deferral(struct cache_deferred_req *dreq, struct cache_head *item, int count_me) setup_deferral() argument
634 cache_wait_req(struct cache_req *req, struct cache_head *item) cache_wait_req() argument
707 cache_defer_req(struct cache_req *req, struct cache_head *item) cache_defer_req() argument
731 cache_revisit_request(struct cache_head *item) cache_revisit_request() argument
804 struct cache_head *item; global() member
[all...] |
| /kernel/linux/linux-5.10/block/partitions/ |
| H A D | ldm.c | 540 struct list_head *item; in ldm_get_disk_objid() local
544 list_for_each (item, &ldb->v_disk) { in ldm_get_disk_objid()
545 struct vblk *v = list_entry (item, struct vblk, list); in ldm_get_disk_objid()
573 struct list_head *item; in ldm_create_data_partitions() local
590 list_for_each (item, &ldb->v_part) { in ldm_create_data_partitions()
591 vb = list_entry (item, struct vblk, list); in ldm_create_data_partitions()
1168 struct list_head *item; in ldm_ldmdb_add() local
1201 list_for_each (item, &ldb->v_part) { in ldm_ldmdb_add()
1202 struct vblk *v = list_entry (item, struct vblk, list); in ldm_ldmdb_add()
1230 struct list_head *item; in ldm_frag_add() local
1299 struct list_head *item, *tmp; ldm_frag_free() local
1321 struct list_head *item; ldm_frag_commit() local
1414 struct list_head *item, *tmp; ldm_free_vblks() local
[all...] |
| /kernel/linux/linux-5.10/drivers/input/rmi4/ |
| H A D | rmi_driver.c | 644 struct rmi_register_desc_item *item = &rdesc->registers[i]; in rmi_read_register_desc() local
662 item->reg = reg; in rmi_read_register_desc()
663 item->reg_size = reg_size; in rmi_read_register_desc()
670 bitmap_set(item->subpacket_map, in rmi_read_register_desc()
676 item->num_subpackets = bitmap_weight(item->subpacket_map, in rmi_read_register_desc()
681 item->reg, item->reg_size, item->num_subpackets); in rmi_read_register_desc()
695 const struct rmi_register_desc_item *item; in rmi_get_register_desc_item() local
709 const struct rmi_register_desc_item *item; rmi_register_desc_calc_size() local
724 const struct rmi_register_desc_item *item; rmi_register_desc_calc_reg_offset() local
737 rmi_register_desc_has_subpacket(const struct rmi_register_desc_item *item, u8 subpacket) rmi_register_desc_has_subpacket() argument
[all...] |
| /kernel/linux/linux-5.10/lib/ |
| H A D | radix-tree.c | 37 * to build the branch to its corresponding item, it also has to build the
41 * The worst case is a zero height tree with just a single item at index 0,
42 * and then inserting an item at index ULONG_MAX. This requires 2 new branches
513 * find the item. However if this was a bottom-level node, in radix_tree_shrink()
515 * to callers dereferencing it. If item corresponding to in radix_tree_shrink()
587 * Create, if necessary, and return the node and slot for an item
590 * Until there is more than one item in the tree, no nodes are
680 void __rcu **slot, void *item, bool replace) in insert_entries()
684 rcu_assign_pointer(*slot, item); in insert_entries()
687 if (xa_is_value(item)) in insert_entries()
679 insert_entries(struct radix_tree_node *node, void __rcu **slot, void *item, bool replace) insert_entries() argument
701 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_insert() argument
821 replace_slot(void __rcu **slot, void *item, struct radix_tree_node *node, int count, int values) replace_slot() argument
848 calculate_count(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item, void *old) calculate_count() argument
873 __radix_tree_replace(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item) __radix_tree_replace() argument
912 radix_tree_replace_slot(struct radix_tree_root *root, void __rcu **slot, void *item) radix_tree_replace_slot() argument
928 radix_tree_iter_replace(struct radix_tree_root *root, const struct radix_tree_iter *iter, void __rcu **slot, void *item) radix_tree_iter_replace() argument
1410 radix_tree_delete_item(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_delete_item() argument
[all...] |
| /kernel/linux/linux-6.6/block/partitions/ |
| H A D | ldm.c | 540 struct list_head *item; in ldm_get_disk_objid() local
544 list_for_each (item, &ldb->v_disk) { in ldm_get_disk_objid()
545 struct vblk *v = list_entry (item, struct vblk, list); in ldm_get_disk_objid()
573 struct list_head *item; in ldm_create_data_partitions() local
590 list_for_each (item, &ldb->v_part) { in ldm_create_data_partitions()
591 vb = list_entry (item, struct vblk, list); in ldm_create_data_partitions()
1159 struct list_head *item; in ldm_ldmdb_add() local
1192 list_for_each (item, &ldb->v_part) { in ldm_ldmdb_add()
1193 struct vblk *v = list_entry (item, struct vblk, list); in ldm_ldmdb_add()
1221 struct list_head *item; in ldm_frag_add() local
1290 struct list_head *item, *tmp; ldm_frag_free() local
1312 struct list_head *item; ldm_frag_commit() local
1405 struct list_head *item, *tmp; ldm_free_vblks() local
[all...] |
| /kernel/linux/linux-6.6/drivers/input/rmi4/ |
| H A D | rmi_driver.c | 644 struct rmi_register_desc_item *item = &rdesc->registers[i]; in rmi_read_register_desc() local
662 item->reg = reg; in rmi_read_register_desc()
663 item->reg_size = reg_size; in rmi_read_register_desc()
670 bitmap_set(item->subpacket_map, in rmi_read_register_desc()
676 item->num_subpackets = bitmap_weight(item->subpacket_map, in rmi_read_register_desc()
681 item->reg, item->reg_size, item->num_subpackets); in rmi_read_register_desc()
695 const struct rmi_register_desc_item *item; in rmi_get_register_desc_item() local
709 const struct rmi_register_desc_item *item; rmi_register_desc_calc_size() local
724 const struct rmi_register_desc_item *item; rmi_register_desc_calc_reg_offset() local
737 rmi_register_desc_has_subpacket(const struct rmi_register_desc_item *item, u8 subpacket) rmi_register_desc_has_subpacket() argument
[all...] |
| /kernel/linux/linux-6.6/lib/ |
| H A D | radix-tree.c | 39 * to build the branch to its corresponding item, it also has to build the
43 * The worst case is a zero height tree with just a single item at index 0,
44 * and then inserting an item at index ULONG_MAX. This requires 2 new branches
515 * find the item. However if this was a bottom-level node, in radix_tree_shrink()
517 * to callers dereferencing it. If item corresponding to in radix_tree_shrink()
589 * Create, if necessary, and return the node and slot for an item
592 * Until there is more than one item in the tree, no nodes are
682 void __rcu **slot, void *item) in insert_entries()
686 rcu_assign_pointer(*slot, item); in insert_entries()
689 if (xa_is_value(item)) in insert_entries()
681 insert_entries(struct radix_tree_node *node, void __rcu **slot, void *item) insert_entries() argument
703 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_insert() argument
823 replace_slot(void __rcu **slot, void *item, struct radix_tree_node *node, int count, int values) replace_slot() argument
850 calculate_count(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item, void *old) calculate_count() argument
875 __radix_tree_replace(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item) __radix_tree_replace() argument
914 radix_tree_replace_slot(struct radix_tree_root *root, void __rcu **slot, void *item) radix_tree_replace_slot() argument
931 radix_tree_iter_replace(struct radix_tree_root *root, const struct radix_tree_iter *iter, void __rcu **slot, void *item) radix_tree_iter_replace() argument
1413 radix_tree_delete_item(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_delete_item() argument
[all...] |
| /third_party/libwebsockets/lib/misc/ |
| H A D | lecp.c | 402 st->opcode = ctx->item.opcode = c & LWS_CBOR_MAJTYP_MASK; in lecp_parse()
421 ctx->item.u.i64 = (int64_t)sm; in lecp_parse()
429 ctx->item.u.i64 = (-1ll) - (int64_t)sm; in lecp_parse()
435 ctx->item.u.u64 = 0; in lecp_parse()
437 ex(ctx, (uint8_t *)&ctx->item.u.u64, o); in lecp_parse()
470 ctx->item.u.u64 = (uint64_t)sm; in lecp_parse()
601 ctx->item.u.u64 = st->tag = (uint64_t)sm; in lecp_parse()
640 ex(ctx, &ctx->item.u.hf, 2); in lecp_parse()
645 ex(ctx, &ctx->item.u.f, 4); in lecp_parse()
650 ex(ctx, &ctx->item in lecp_parse()
[all...] |
| /third_party/ntfs-3g/libntfs-3g/ |
| H A D | inode.c | 418 int ntfs_inode_nidata_hash(const struct CACHED_GENERIC *item) in ntfs_inode_nidata_hash() argument
420 return (((const struct CACHED_NIDATA*)item)->inum in ntfs_inode_nidata_hash()
443 struct CACHED_NIDATA item; in ntfs_inode_invalidate() local
445 item.inum = MREF(mref); in ntfs_inode_invalidate()
446 item.ni = (ntfs_inode*)NULL; in ntfs_inode_invalidate()
447 item.pathname = (const char*)NULL; in ntfs_inode_invalidate()
448 item.varsize = 0; in ntfs_inode_invalidate()
450 GENERIC(&item),idata_cache_compare,CACHE_FREE); in ntfs_inode_invalidate()
469 struct CACHED_NIDATA item; in ntfs_inode_open() local
473 item in ntfs_inode_open()
511 struct CACHED_NIDATA item; ntfs_inode_close() local
[all...] |
| /kernel/linux/linux-5.10/drivers/target/loopback/ |
| H A D | tcm_loop.c | 671 struct config_item *item, char *page) in tcm_loop_tpg_attrib_fabric_prot_type_show()
673 struct se_portal_group *se_tpg = attrib_to_tpg(item); in tcm_loop_tpg_attrib_fabric_prot_type_show()
681 struct config_item *item, const char *page, size_t count) in tcm_loop_tpg_attrib_fabric_prot_type_store()
683 struct se_portal_group *se_tpg = attrib_to_tpg(item); in tcm_loop_tpg_attrib_fabric_prot_type_store()
786 static ssize_t tcm_loop_tpg_nexus_show(struct config_item *item, char *page) in tcm_loop_tpg_nexus_show() argument
788 struct se_portal_group *se_tpg = to_tpg(item); in tcm_loop_tpg_nexus_show()
804 static ssize_t tcm_loop_tpg_nexus_store(struct config_item *item, in tcm_loop_tpg_nexus_store() argument
807 struct se_portal_group *se_tpg = to_tpg(item); in tcm_loop_tpg_nexus_store()
879 static ssize_t tcm_loop_tpg_transport_status_show(struct config_item *item, in tcm_loop_tpg_transport_status_show() argument
882 struct se_portal_group *se_tpg = to_tpg(item); in tcm_loop_tpg_transport_status_show()
670 tcm_loop_tpg_attrib_fabric_prot_type_show( struct config_item *item, char *page) tcm_loop_tpg_attrib_fabric_prot_type_show() argument
680 tcm_loop_tpg_attrib_fabric_prot_type_store( struct config_item *item, const char *page, size_t count) tcm_loop_tpg_attrib_fabric_prot_type_store() argument
905 tcm_loop_tpg_transport_status_store(struct config_item *item, const char *page, size_t count) tcm_loop_tpg_transport_status_store() argument
928 tcm_loop_tpg_address_show(struct config_item *item, char *page) tcm_loop_tpg_address_show() argument
1106 tcm_loop_wwn_version_show(struct config_item *item, char *page) tcm_loop_wwn_version_show() argument
[all...] |
| /kernel/linux/linux-5.10/drivers/staging/wlan-ng/ |
| H A D | prism2mgmt.c | 388 struct hfa384x_hscan_result_sub *item = NULL; in prism2mgmt_scan_results() local
417 item = &hw->scanresults->info.hscanresult.result[req->bssindex.data]; in prism2mgmt_scan_results()
421 req->signal.data = le16_to_cpu(item->sl); in prism2mgmt_scan_results()
422 req->noise.data = le16_to_cpu(item->anl); in prism2mgmt_scan_results()
427 memcpy(req->bssid.data.data, item->bssid, WLAN_BSSID_LEN); in prism2mgmt_scan_results()
431 req->ssid.data.len = le16_to_cpu(item->ssid.len); in prism2mgmt_scan_results()
433 memcpy(req->ssid.data.data, item->ssid.data, req->ssid.data.len); in prism2mgmt_scan_results()
437 if (item->supprates[count] == 0) in prism2mgmt_scan_results()
443 item->supprates[(N) - 1])) { \ in prism2mgmt_scan_results()
444 req->basicrate ## N .data = item in prism2mgmt_scan_results()
[all...] |