Home
last modified time | relevance | path

Searched refs:list (Results 10876 - 10900 of 14195) sorted by relevance

1...<<431432433434435436437438439440>>...568

/third_party/python/Lib/test/
H A Dtest_operator.py300 a = list(range(3))
429 self.assertEqual(list(map(getcount, inventory)), [3, 2, 5, 1])
434 data = list(map(str, range(20)))
H A Dtest_zipimport.py158 # item in a list sorted by name, like
333 mpath = list(mod.__path__)[0].split('path1.zip' + os.sep)[1]
409 mpath = list(mod.__path__)[0].split('path1.zip' + os.sep)[1]
801 list(os.fsencode(TESTMOD)))
H A Dtest_tracemalloc.py45 # _tracemalloc._get_traces() returns a list of (domain, size,
139 # Create a list and "destroy it": put it in the PyListObject free list
143 # Create a list which should reuse the previously created empty list
275 large_sum = sum(list(range(100000)))
408 original_traces = list(snapshot.traces._traces)
445 original_traces = list(snapshot.traces._traces)
/third_party/protobuf/python/google/protobuf/internal/
H A Dpython_message.py10 # notice, this list of conditions and the following disclaimer.
12 # copyright notice, this list of conditions and the following disclaimer
441 raise ValueError('Repeated field default value not empty list: %s' % (
518 # a list if fields are added.
819 value should be included in the list returned by ListFields()."""
1010 unknown_fields = list(self._unknown_fields)
1012 other_unknown_fields = list(other._unknown_fields)
1230 errors: A list which, if provided, will be populated with the field
1247 for field, value in list(self._fields.items()): # dict can change size!
1271 A list o
[all...]
/third_party/python/Objects/
H A Dodictobject.c5 involves using a doubly-linked-list to capture the order. We keep to that
6 strategy, using a lower-level linked-list.
11 For the linked list we use a basic doubly-linked-list. Using a circularly-
12 linked-list does have some benefits, but they don't apply so much here
13 since OrderedDict is focused on the ends of the list (for the most part).
17 macros from BSD's queue.h, and the linux's list.h.
24 linked-list on top of dict is not sufficient here; operations for nodes in
25 the middle of the linked-list implicitly require finding the node first.
26 With a simple linked-list lik
1804 PyObject *list = PySequence_List((PyObject*)&tmp); odictiter_reduce() local
[all...]
/third_party/python/Lib/test/test_email/
H A Dtest_headerregistry.py328 # the mime_registry...and the application is free to extend that list
1254 self.assertEqual([a], list(h.groups[0].addresses))
1255 self.assertEqual([a], list(h.addresses))
1297 examples = list(self.example_params.values())
1298 source = ('dummy list:;, another: (empty);,' +
1300 r'"A \"list\"": ' +
1306 expected = ('dummy list:;, another:;, ' +
1308 r'"A \"list\"": ' +
1317 self.assertEqual(h.groups[0].display_name, 'dummy list')
1319 self.assertEqual(h.groups[6].display_name, 'A "list"')
[all...]
/third_party/python/Mac/BuildScript/
H A Dbuild-installer.py610 for ev in list(os.environ):
1010 args = list(recipe['configure_pre'])
1041 configure_args = configure_args + list(recipe['configure_post'])
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dstr_split_test.cc19 #include <list>
402 TestConversionOperator<std::list<absl::string_view>>(splitter); in TEST()
403 TestConversionOperator<std::list<std::string>>(splitter); in TEST()
/third_party/skia/bench/
H A Dnanobench.cpp168 "If a name does not match any list entry,\n"
169 "it is skipped unless some list entry starts with ~");
609 SkTArray<SkString>* list) { in collect_files()
612 list->push_back(SkString(paths[i])); in collect_files()
617 list->push_back(SkOSPath::Join(paths[i], path.c_str())); in collect_files()
607 collect_files(const CommandLineFlags::StringArray& paths, const char* ext, SkTArray<SkString>* list) collect_files() argument
/third_party/python/Modules/
H A Dsocketmodule.c45 - socket.if_nameindex() -> list of tuples (if_index, if_name)
322 /* IMPORTANT: make sure the list ordered by descending build_number */
3915 /* Make list of (level, type, data) tuples from control messages. */ in sock_recvmsg_guts()
4052 received. The ancdata item is a list of zero or more tuples\n\
4146 written into the buffers. The ancdata item is a list of zero or more\n\
5812 Return the true host name, a list of aliases, and a list of IP addresses,\n\
5909 Return the true host name, a list of aliases, and a list of IP addresses,\n\
5916 known or not useful (like the list o
6814 PyObject *list = PyList_New(0); global() local
[all...]
H A D_testcapimodule.c222 PyObject* list; in test_list_api() local
227 list = PyList_New(NLIST); in test_list_api()
228 if (list == (PyObject*)NULL) in test_list_api()
230 /* list = range(NLIST) */ in test_list_api()
234 Py_DECREF(list); in test_list_api()
237 PyList_SET_ITEM(list, i, anint); in test_list_api()
239 /* list.reverse(), via PyList_Reverse() */ in test_list_api()
240 i = PyList_Reverse(list); /* should not blow up! */ in test_list_api()
242 Py_DECREF(list); in test_list_api()
245 /* Check that list in test_list_api()
6337 settrace_to_record(PyObject *self, PyObject *list) settrace_to_record() argument
6365 settrace_to_error(PyObject *self, PyObject *list) settrace_to_error() argument
7151 PyListObject list; global() member
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/intel/i40e/
H A Di40e_main.c222 if (pile->list[pile->num_entries - 1] & I40E_PILE_VALID_BIT) { in i40e_get_lump()
228 pile->list[pile->num_entries - 1] = id | I40E_PILE_VALID_BIT; in i40e_get_lump()
235 if (pile->list[i] & I40E_PILE_VALID_BIT) { in i40e_get_lump()
242 if (pile->list[i+j] & I40E_PILE_VALID_BIT) in i40e_get_lump()
249 pile->list[i+j] = id | I40E_PILE_VALID_BIT; in i40e_get_lump()
279 i < pile->num_entries && pile->list[i] == valid_id; in i40e_put_lump()
281 pile->list[i] = 0; in i40e_put_lump()
1240 * i40e_find_filter - Search VSI filter list for specific mac/vlan filter
1266 * i40e_find_mac - Find a mac addr in the macvlan filters list
1327 * @tmp_add_list: list o
2225 i40e_aqc_del_filters(struct i40e_vsi *vsi, const char *vsi_name, struct i40e_aqc_remove_macvlan_element_data *list, int num_del, int *retval) i40e_aqc_del_filters() argument
2259 i40e_aqc_add_filters(struct i40e_vsi *vsi, const char *vsi_name, struct i40e_aqc_add_macvlan_element_data *list, struct i40e_new_mac_filter *add_head, int num_add) i40e_aqc_add_filters() argument
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/intel/i40e/
H A Di40e_main.c225 if (pile->list[pile->num_entries - 1] & I40E_PILE_VALID_BIT) { in i40e_get_lump()
231 pile->list[pile->num_entries - 1] = id | I40E_PILE_VALID_BIT; in i40e_get_lump()
238 if (pile->list[i] & I40E_PILE_VALID_BIT) { in i40e_get_lump()
245 if (pile->list[i+j] & I40E_PILE_VALID_BIT) in i40e_get_lump()
252 pile->list[i+j] = id | I40E_PILE_VALID_BIT; in i40e_get_lump()
282 i < pile->num_entries && pile->list[i] == valid_id; in i40e_put_lump()
284 pile->list[i] = 0; in i40e_put_lump()
1259 * i40e_find_filter - Search VSI filter list for specific mac/vlan filter
1285 * i40e_find_mac - Find a mac addr in the macvlan filters list
1346 * @tmp_add_list: list o
2346 i40e_aqc_del_filters(struct i40e_vsi *vsi, const char *vsi_name, struct i40e_aqc_remove_macvlan_element_data *list, int num_del, int *retval) i40e_aqc_del_filters() argument
2380 i40e_aqc_add_filters(struct i40e_vsi *vsi, const char *vsi_name, struct i40e_aqc_add_macvlan_element_data *list, struct i40e_new_mac_filter *add_head, int num_add) i40e_aqc_add_filters() argument
[all...]
/kernel/linux/linux-6.6/drivers/net/wireless/ath/ath10k/
H A Dwmi.c2555 /* Shouldn't happen unless list of advertised channels to in ath10k_wmi_event_mgmt_rx()
3028 list_add_tail(&dst->list, &stats->pdevs); in ath10k_wmi_main_op_pull_fw_stats()
3046 list_add_tail(&dst->list, &stats->peers); in ath10k_wmi_main_op_pull_fw_stats()
3083 list_add_tail(&dst->list, &stats->pdevs); in ath10k_wmi_10x_op_pull_fw_stats()
3104 list_add_tail(&dst->list, &stats->peers); in ath10k_wmi_10x_op_pull_fw_stats()
3145 list_add_tail(&dst->list, &stats->pdevs); in ath10k_wmi_10_2_op_pull_fw_stats()
3181 list_add_tail(&dst->list, &stats->peers); in ath10k_wmi_10_2_op_pull_fw_stats()
3222 list_add_tail(&dst->list, &stats->pdevs); in ath10k_wmi_10_2_4_op_pull_fw_stats()
3267 list_add_tail(&dst->list, &stats->peers); in ath10k_wmi_10_2_4_op_pull_fw_stats()
3314 list_add_tail(&dst->list, in ath10k_wmi_10_4_op_pull_fw_stats()
[all...]
H A Dmac.c496 list_for_each_entry(peer, &ar->peers, list) { in ath10k_clear_vdev_key()
534 list_for_each_entry(peer, &ar->peers, list) { in ath10k_mac_vif_update_wep_key()
741 list_for_each_entry(arvif, &ar->arvifs, list) in ath10k_peer_create()
889 list_del(&peer->list); in ath10k_peer_map_cleanup()
901 list_for_each_entry_safe(peer, tmp, &ar->peers, list) { in ath10k_peer_cleanup()
921 list_for_each_entry_safe(peer, tmp, &ar->peers, list) { in ath10k_peer_cleanup_all()
922 list_del(&peer->list); in ath10k_peer_cleanup_all()
1916 list_for_each_entry(arvif, &ar->arvifs, list) in ath10k_mac_num_vifs_started()
2913 list_for_each_entry(arvif, &ar->arvifs, list) { in ath10k_mac_is_connected()
2973 list_for_each_entry(arvif, &ar->arvifs, list) { in ath10k_mac_txpower_recalc()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dinode.c364 struct list_head list; member
402 list_add_tail(&async_extent->list, &cow->extents); in add_async_extent()
781 struct async_extent, list); in submit_compressed_extents()
782 list_del(&async_extent->list); in submit_compressed_extents()
1356 LIST_HEAD(list); in csum_exist_in_range()
1359 bytenr + num_bytes - 1, &list, 0); in csum_exist_in_range()
1360 if (ret == 0 && list_empty(&list)) in csum_exist_in_range()
1363 while (!list_empty(&list)) { in csum_exist_in_range()
1364 sums = list_entry(list.next, struct btrfs_ordered_sum, list); in csum_exist_in_range()
2239 add_pending_csums(struct btrfs_trans_handle *trans, struct list_head *list) add_pending_csums() argument
9405 struct list_head list; global() member
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dinode.c703 struct list_head list; member
740 list_add_tail(&async_extent->list, &cow->extents); in add_async_extent()
1583 struct async_extent, list); in submit_compressed_extents()
1584 list_del(&async_extent->list); in submit_compressed_extents()
1729 LIST_HEAD(list); in csum_exist_in_range()
1732 &list, 0, nowait); in csum_exist_in_range()
1733 if (ret == 0 && list_empty(&list)) in csum_exist_in_range()
1736 while (!list_empty(&list)) { in csum_exist_in_range()
1737 sums = list_entry(list.next, struct btrfs_ordered_sum, list); in csum_exist_in_range()
2589 add_pending_csums(struct btrfs_trans_handle *trans, struct list_head *list) add_pending_csums() argument
9205 struct list_head list; global() member
[all...]
/kernel/linux/linux-5.10/block/
H A Dblk-merge.c408 * If the driver previously mapped a shorter list, we could see a in blk_next_sg()
755 * If we are allowed to merge, then append bio list in attempt_merge()
1030 * blk_attempt_plug_merge - try to merge with %current's plugged list
1035 * another request associated with @q is found on the plug list
1039 * on %current's plugged list. Returns %true if merge was successful,
1086 * Iterate list of requests and see if we can merge this bio with any
1089 bool blk_bio_list_merge(struct request_queue *q, struct list_head *list, in blk_bio_list_merge() argument
1095 list_for_each_entry_reverse(rq, list, queuelist) { in blk_bio_list_merge()
/kernel/linux/linux-5.10/drivers/acpi/
H A Dbus.c12 #include <linux/list.h>
590 * a valid list of PNP IDs, and if the device is the first (primary) physical
626 * If @dev has an ACPI companion which has ACPI_DT_NAMESPACE_HID in its list of
628 * property to match against the given list of identifiers.
747 list_for_each_entry(hwid, &device->pnp.ids, list) { in __acpi_match_device()
774 * acpi_match_device - Match a struct device against a given list of ACPI IDs
779 * object for that handle and use that object to match against a given list of
/kernel/linux/linux-5.10/drivers/base/
H A Dnode.c30 static ssize_t node_read_cpumap(struct device *dev, bool list, char *buf) in node_read_cpumap() argument
43 n = cpumap_print_to_pagebuf(list, buf, mask); in node_read_cpumap()
71 * @list_node: List element in the node's access list
/kernel/linux/linux-5.10/arch/arm64/kvm/vgic/
H A Dvgic-mmio-v3.c780 * Performs various checks before inserting the rdist region in the list.
782 * (ie. count != 0). The list is sorted by rdist region index.
814 struct vgic_redist_region, list); in vgic_v3_insert_redist_region()
851 list_add_tail(&rdreg->list, rd_regions); in vgic_v3_insert_redist_region()
/kernel/linux/linux-5.10/arch/s390/include/asm/
H A Dkvm_host.h606 struct list_head list; member
765 struct list_head list; member
795 /* facility list requested by guest (in dma page) */
/kernel/linux/linux-5.10/arch/x86/crypto/
H A Dsha512-avx-asm.S23 # copyright notice, this list of conditions and the following
27 # copyright notice, this list of conditions and the following
H A Dsha512-ssse3-asm.S23 # copyright notice, this list of conditions and the following
27 # copyright notice, this list of conditions and the following
/kernel/linux/linux-5.10/arch/arm/probes/kprobes/
H A Dtest-core.c546 struct benchmarks list[] = { in run_benchmarks() local
569 for (b = list; b->fn; ++b) { in run_benchmarks()
672 * coverage_start() builds a coverage_table which contains a list of

Completed in 81 milliseconds

1...<<431432433434435436437438439440>>...568