/third_party/python/Modules/_sre/ |
H A D | sre.c | 794 Return a list of all non-overlapping matches of pattern in string. 803 PyObject* list; in _sre_SRE_Pattern_findall_impl() local 810 list = PyList_New(0); in _sre_SRE_Pattern_findall_impl() 811 if (!list) { in _sre_SRE_Pattern_findall_impl() 865 status = PyList_Append(list, item); in _sre_SRE_Pattern_findall_impl() 875 return list; in _sre_SRE_Pattern_findall_impl() 878 Py_DECREF(list); in _sre_SRE_Pattern_findall_impl() 961 PyObject* list; in _sre_SRE_Pattern_split_impl() local 973 list = PyList_New(0); in _sre_SRE_Pattern_split_impl() 974 if (!list) { in _sre_SRE_Pattern_split_impl() 1058 PyObject* list; pattern_subx() local [all...] |
/kernel/linux/linux-6.6/drivers/scsi/qla2xxx/ |
H A D | qla_gs.c | 278 * @list: switch info entries to populate 285 qla2x00_gid_pt(scsi_qla_host_t *vha, sw_info_t *list) in qla2x00_gid_pt() argument 300 return qla2x00_sns_gid_pt(vha, list); in qla2x00_gid_pt() 334 /* Set port IDs in switch info list. */ in qla2x00_gid_pt() 337 list[i].d_id = be_to_port_id(gid_data->port_id); in qla2x00_gid_pt() 338 memset(list[i].fabric_port_name, 0, WWN_SIZE); in qla2x00_gid_pt() 339 list[i].fp_speed = PORT_SPEED_UNKNOWN; in qla2x00_gid_pt() 343 list[i].d_id.b.rsvd_1 = gid_data->control_byte; in qla2x00_gid_pt() 364 * @list: switch info entries to populate 369 qla2x00_gpn_id(scsi_qla_host_t *vha, sw_info_t *list) in qla2x00_gpn_id() argument 437 qla2x00_gnn_id(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_gnn_id() argument 1069 qla2x00_sns_gid_pt(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_sns_gid_pt() argument 1140 qla2x00_sns_gpn_id(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_sns_gpn_id() argument 1196 qla2x00_sns_gnn_id(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_sns_gnn_id() argument 2528 qla2x00_gfpn_id(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_gfpn_id() argument 2636 qla2x00_gpsc(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_gpsc() argument 2726 qla2x00_gff_id(scsi_qla_host_t *vha, sw_info_t *list) qla2x00_gff_id() argument [all...] |
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/list/ |
H A D | list_pattern.cpp | 16 #include "core/components_ng/pattern/list/list_pattern.h" 24 #include "core/components_ng/pattern/list/list_height_offset_calculator.h" 25 #include "core/components_ng/pattern/list/list_item_group_pattern.h" 26 #include "core/components_ng/pattern/list/list_item_pattern.h" 27 #include "core/components_ng/pattern/list/list_lanes_layout_algorithm.h" 28 #include "core/components_ng/pattern/list/list_layout_algorithm.h" 29 #include "core/components_ng/pattern/list/list_layout_property.h" 628 auto list = weak.Upgrade(); in SetChainAnimationToPosMap() 629 CHECK_NULL_RETURN(list, 0.0f); in SetChainAnimationToPosMap() 630 return list in SetChainAnimationToPosMap() [all...] |
/kernel/linux/linux-5.10/net/batman-adv/ |
H A D | translation-table.c | 26 #include <linux/list.h> 80 * @node: the list element pointer of the first TT entry 377 if (!hlist_unhashed(&vlan->list)) { in batadv_tt_global_size_mod() 378 hlist_del_init_rcu(&vlan->list); in batadv_tt_global_size_mod() 485 list) { in batadv_tt_local_event() 510 list_del(&entry->list); in batadv_tt_local_event() 517 /* track the change in the OGMinterval list */ in batadv_tt_local_event() 518 list_add_tail(&tt_change_node->list, &bat_priv->tt.changes_list); in batadv_tt_local_event() 566 hlist_for_each_entry_rcu(vlan, &bat_priv->softif_vlan_list, list) { in batadv_tt_local_table_transmit_size() 769 hlist_for_each_entry_rcu(orig_entry, head, list) { in batadv_tt_local_add() [all...] |
/kernel/linux/linux-6.6/fs/btrfs/ |
H A D | relocation.c | 144 /* list of reloc trees */ 146 /* list of subvolume trees that get relocated */ 202 struct btrfs_backref_edge, list[LOWER]); in walk_up_backref() 224 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref() 228 edge = list_entry(edge->list[LOWER].next, in walk_down_backref() 229 struct btrfs_backref_edge, list[LOWER]); in walk_down_backref() 273 struct btrfs_backref_node, list); in update_backref_cache() 279 struct btrfs_backref_node, list); in update_backref_cache() 280 list_del_init(&node->list); in update_backref_cache() 286 * some nodes can be left in the pending list i in update_backref_cache() 1987 free_reloc_roots(struct list_head *list) free_reloc_roots() argument [all...] |
/third_party/python/Lib/test/ |
H A D | test_descr.py | 52 for name, expr in list(self.binops.items()): 68 for name, expr in list(self.unops.items()): 178 # Testing list operations... 202 for i in list(d.keys()): 234 for name, expr in list(self.unops.items()): 352 for k, v in list(d.items()): 363 for i in list(d.keys()): 387 self.assertEqual(list(a.items()), []) 390 self.assertEqual(list(a.items()), [('foo', 'bar')]) 424 for k, v in list(k [all...] |
/kernel/linux/linux-6.6/include/net/ |
H A D | sock.h | 40 #include <linux/list.h> 771 or a list and the lookup is made under lock preventing hash table 822 static inline void __sk_add_node(struct sock *sk, struct hlist_head *list) in __sk_add_node() argument 824 hlist_add_head(&sk->sk_node, list); in __sk_add_node() 827 static inline void sk_add_node(struct sock *sk, struct hlist_head *list) in sk_add_node() argument 830 __sk_add_node(sk, list); in sk_add_node() 833 static inline void sk_add_node_rcu(struct sock *sk, struct hlist_head *list) in sk_add_node_rcu() argument 838 hlist_add_tail_rcu(&sk->sk_node, list); in sk_add_node_rcu() 840 hlist_add_head_rcu(&sk->sk_node, list); in sk_add_node_rcu() 843 static inline void sk_add_node_tail_rcu(struct sock *sk, struct hlist_head *list) in sk_add_node_tail_rcu() argument 849 __sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list) __sk_nulls_add_node_rcu() argument 854 __sk_nulls_add_node_tail_rcu(struct sock *sk, struct hlist_nulls_head *list) __sk_nulls_add_node_tail_rcu() argument 859 sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list) sk_nulls_add_node_rcu() argument 870 sk_add_bind_node(struct sock *sk, struct hlist_head *list) sk_add_bind_node() argument 881 sk_add_bind2_node(struct sock *sk, struct hlist_head *list) sk_add_bind2_node() argument [all...] |
/kernel/linux/linux-6.6/drivers/iommu/ |
H A D | iommu.c | 69 struct list_head list; member 76 list_for_each_entry(pos, &(group)->devices, list) 272 list_add_tail(&iommu->list, &iommu_device_list); in iommu_device_register() 291 list_del(&iommu->list); in iommu_device_unregister() 324 list_add_tail(&iommu->list, &iommu_device_list); in iommu_device_register_bus() 519 * The gdev must be in the list before calling in __iommu_probe_device() 522 list_add_tail(&gdev->list, &group->devices); in __iommu_probe_device() 537 * to the caller by providing a de-duplicated list of groups in __iommu_probe_device() 551 list_del(&gdev->list); in __iommu_probe_device() 613 list_del(&device->list); in __iommu_group_remove_device() 2756 iommu_get_resv_regions(struct device *dev, struct list_head *list) iommu_get_resv_regions() argument 2772 iommu_put_resv_regions(struct device *dev, struct list_head *list) iommu_put_resv_regions() argument [all...] |
/foundation/multimedia/av_codec/test/unittest/demuxer_test/ |
H A D | demuxer_uri_unit_test.cpp | 21 #include <list> 43 list<SeekMode> seekModes = {SeekMode::SEEK_NEXT_SYNC, SeekMode::SEEK_PREVIOUS_SYNC, 585 list<int64_t> toPtsList = {0, 2000, 1920, 2160, 2200, 2440, 2600, 2700, 4080, 4100}; // ms in HWTEST_F() 622 list<int64_t> toPtsList = {-100, 1000000}; // ms in HWTEST_F() 672 list<int64_t> toPtsList = {0, 3000, 2040, 1880, 1960, 2400, 2720, 2830, 4040, 4100}; // ms in HWTEST_F() 709 list<int64_t> toPtsList = {0, 1000, 1017, 1500, 1700, 1940, 3983, 1983, 3990}; // ms in HWTEST_F() 746 list<int64_t> toPtsList = {0, 3480, 3640, 3320, 3000, 3100, 4120, 5520}; // ms in HWTEST_F() 777 list<int64_t> toPtsList = {0, 10240, 10230, 10220, 30000, 30010}; // ms in HWTEST_F() 808 list<int64_t> toPtsList = {0, 3072, 4031, 4035, 29952, 29953}; // ms in HWTEST_F() 839 list<int64_ in HWTEST_F() [all...] |
/foundation/communication/dsoftbus/core/bus_center/lnn/lane_hub/lane_manager/src/ |
H A D | lnn_lane_link.c | 174 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in GetValidLaneResource() 295 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in DetectDisableWifiDirectApply() 337 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in DetectEnableWifiDirectApply() 387 ListAdd(&g_laneResource.list, &resourceItem->node); in CreateNewLaneResource() 539 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in ProcessVapInfo() 575 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in DelLaneResourceByLaneId() 595 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in ClearLaneResourceByLaneId() 645 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in FindLaneResourceByLinkType() 700 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResource, node) { in FindLaneResourceByLaneId() 728 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneResource.list, LaneResourc in UpdateLaneResourceLaneId() [all...] |
/kernel/linux/linux-5.10/net/mac80211/ |
H A D | chan.c | 55 list_for_each_entry(ctx, &local->chanctx_list, list) in ieee80211_num_chanctx() 177 list_for_each_entry(ctx, &local->chanctx_list, list) { in ieee80211_find_reservation_chanctx() 230 list_for_each_entry_rcu(sta, &sdata->local->sta_list, list) { in ieee80211_get_max_required_bw() 250 list_for_each_entry_rcu(sdata, &local->interfaces, list) { in ieee80211_get_chanctx_max_required_bw() 379 list_for_each_entry(ctx, &local->chanctx_list, list) { in ieee80211_find_chanctx() 412 list_for_each_entry_rcu(sdata, &local->interfaces, list) { in ieee80211_is_radar_required() 435 list_for_each_entry_rcu(sdata, &local->interfaces, list) { in ieee80211_chanctx_radar_required() 528 list_add_rcu(&ctx->list, &local->chanctx_list); in ieee80211_new_chanctx() 574 list_del_rcu(&ctx->list); in ieee80211_free_chanctx() 590 list_for_each_entry_rcu(sdata, &local->interfaces, list) { in ieee80211_recalc_chanctx_chantype() [all...] |
/kernel/linux/linux-5.10/drivers/rapidio/ |
H A D | rio_cm.c | 146 struct list_head list; member 1238 list_for_each_entry(cm, &cm_dev_list, list) { in riocm_ch_bind() 1498 LIST_HEAD(list); in riocm_cdev_release() 1511 list_add(&ch->ch_node, &list); in riocm_cdev_release() 1516 if (!list_empty(&list)) { in riocm_cdev_release() 1517 list_for_each_entry_safe(ch, _c, &list, ch_node) { in riocm_cdev_release() 1543 list_for_each_entry(cm, &cm_dev_list, list) { in cm_ep_get_list_size() 1558 * cm_ep_get_list() - Returns list of attached endpoints 1579 list_for_each_entry(cm, &cm_dev_list, list) in cm_ep_get_list() 1614 * cm_mport_get_list() - Returns list o [all...] |
/kernel/linux/linux-6.6/fs/dlm/ |
H A D | lowcomms.c | 70 uint32_t nodeid; /* So we know who we are in the list */ 89 struct hlist_node list; member 126 struct list_head list; member 146 struct list_head list; member 155 struct list_head list; member 257 list); in con_next_wq() 271 hlist_for_each_entry_rcu(con, &connection_hash[r], list) { in __find_con() 325 hlist_add_head_rcu(&con->list, &connection_hash[r]); in nodeid2con() 426 hlist_for_each_entry_rcu(con, &connection_hash[i], list) { in addr_to_nodeid() 699 list_for_each_entry_safe(msg, tmp, &e->msgs, list) { in free_entry() 860 struct list_head list; global() member [all...] |
/kernel/linux/linux-6.6/drivers/rapidio/ |
H A D | rio_cm.c | 146 struct list_head list; member 1238 list_for_each_entry(cm, &cm_dev_list, list) { in riocm_ch_bind() 1498 LIST_HEAD(list); in riocm_cdev_release() 1511 list_add(&ch->ch_node, &list); in riocm_cdev_release() 1516 if (!list_empty(&list)) { in riocm_cdev_release() 1517 list_for_each_entry_safe(ch, _c, &list, ch_node) { in riocm_cdev_release() 1543 list_for_each_entry(cm, &cm_dev_list, list) { in cm_ep_get_list_size() 1558 * cm_ep_get_list() - Returns list of attached endpoints 1579 list_for_each_entry(cm, &cm_dev_list, list) in cm_ep_get_list() 1614 * cm_mport_get_list() - Returns list o [all...] |
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
H A D | PluralRulesTest.java | 332 List list = new ArrayList(50); in getTargetStrings() 341 while (list.size() <= val) { in getTargetStrings() 342 list.add(null); in getTargetStrings() 344 if (list.get(val) != null) { in getTargetStrings() 345 fail("test data error, key: " + list.get(val) + " already set for: " + val); in getTargetStrings() 347 list.set(val, key); in getTargetStrings() 351 String[] result = (String[]) list.toArray(new String[list.size()]); in getTargetStrings() 730 assertEquals("locales are unique in list", locales.length, localeSet.size()); in testAvailableULocales() 849 Collection<Double> list in TestGetSamples() [all...] |
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx5/core/ |
H A D | fs_core.c | 15 * copyright notice, this list of conditions and the following 19 * copyright notice, this list of conditions and the following 287 INIT_LIST_HEAD(&node->list); in tree_init_node() 362 list_del_init(&node->list); in tree_put_node() 655 list_add_tail(&fte->node.list, &fg->node.children); in insert_fte() 737 /* initialize refcnt, add to parent list */ in alloc_insert_flow_group() 748 /* Add node to group list */ in alloc_insert_flow_group() 749 list_add(&fg->node.list, prev); in alloc_insert_flow_group() 795 ((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list)) in find_closest_ft_recursive() 1725 struct list_head list; global() member 1746 struct rhlist_head *tmp, *list; build_match_list() local [all...] |
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/ |
H A D | fs_core.c | 15 * copyright notice, this list of conditions and the following 19 * copyright notice, this list of conditions and the following 377 INIT_LIST_HEAD(&node->list); in tree_init_node() 452 list_del_init(&node->list); in tree_put_node() 764 list_add_tail(&fte->node.list, &fg->node.children); in insert_fte() 846 /* initialize refcnt, add to parent list */ in alloc_insert_flow_group() 857 /* Add node to group list */ in alloc_insert_flow_group() 858 list_add(&fg->node.list, prev); in alloc_insert_flow_group() 903 ((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list)) in find_closest_ft_recursive() 1859 struct list_head list; global() member 1881 struct rhlist_head *tmp, *list; build_match_list() local [all...] |
/kernel/linux/linux-6.6/net/batman-adv/ |
H A D | translation-table.c | 26 #include <linux/list.h> 79 * @node: the list element pointer of the first TT entry 376 if (!hlist_unhashed(&vlan->list)) { in batadv_tt_global_size_mod() 377 hlist_del_init_rcu(&vlan->list); in batadv_tt_global_size_mod() 484 list) { in batadv_tt_local_event() 509 list_del(&entry->list); in batadv_tt_local_event() 516 /* track the change in the OGMinterval list */ in batadv_tt_local_event() 517 list_add_tail(&tt_change_node->list, &bat_priv->tt.changes_list); in batadv_tt_local_event() 565 hlist_for_each_entry_rcu(vlan, &bat_priv->softif_vlan_list, list) { in batadv_tt_local_table_transmit_size() 768 hlist_for_each_entry_rcu(orig_entry, head, list) { in batadv_tt_local_add() [all...] |
/kernel/linux/linux-5.10/net/core/ |
H A D | skbuff.c | 27 * with respect to whatever list is being frobbed (e.g. via lock_sock() 591 struct sk_buff *list; in skb_clone_fraglist() local 593 skb_walk_frags(skb, list) in skb_clone_fraglist() 594 skb_get(list); in skb_clone_fraglist() 886 /* record skb to CPU local list */ in _kfree_skb_defer() 1022 * alloc_skb_for_msg() - allocate sk_buff to wrap frag list forming a msg 2108 /* If we need update frag list, we are in troubles. in __pskb_pull_tail() 2116 struct sk_buff *list = skb_shinfo(skb)->frag_list; in __pskb_pull_tail() local 2121 if (list->len <= eat) { in __pskb_pull_tail() 2123 eat -= list in __pskb_pull_tail() 3066 skb_dequeue(struct sk_buff_head *list) skb_dequeue() argument 3086 skb_dequeue_tail(struct sk_buff_head *list) skb_dequeue_tail() argument 3106 skb_queue_purge(struct sk_buff_head *list) skb_queue_purge() argument 3151 skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk) skb_queue_head() argument 3172 skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk) skb_queue_tail() argument 3192 skb_unlink(struct sk_buff *skb, struct sk_buff_head *list) skb_unlink() argument 3212 skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list) skb_append() argument 6034 struct sk_buff *list = shinfo->frag_list; pskb_carve_frag_list() local [all...] |
/base/hiviewdfx/hiview/plugins/faultlogger/common/ |
H A D | faultlog_info.h | 18 #include <list> 38 std::list<std::string> additionalLogs;
|
/base/hiviewdfx/hidumper/frameworks/native/src/common/ |
H A D | dumper_parameter.cpp | 59 void DumperParameter::SetExecutorConfigList(std::vector<std::shared_ptr<DumpCfg>> &list) in SetExecutorConfigList() argument 61 list_ = list; in SetExecutorConfigList()
|
/base/hiviewdfx/hiview/plugins/reliability/leak_detectors/native_leak/ |
H A D | native_leak_config.cpp | 44 bool NativeLeakConfig::GetThresholdList(unordered_map<string, uint64_t> &list) in GetThresholdList() argument 67 list.insert(make_pair(matches[ITEM_NAME].str(), stoull(matches[ITEM_VALUE]))); in GetThresholdList()
|
/base/hiviewdfx/hiview/adapter/plugins/eventservice/service/idl/src/ |
H A D | compliant_event_checker.cpp | 18 #include <list> 31 std::unordered_map<std::string, std::list<std::string>> COMPLIANT_EVENT_CONFIGS {
|
/base/request/request/frameworks/js/napi/include/ |
H A D | listener_list.h | 19 #include <list> 45 std::list<std::pair<bool, napi_ref>> allCb_;
|
/base/security/access_token/frameworks/inner_api/privacy/test/unittest/app_manager_client/ |
H A D | app_manager_access_proxy.cpp | 28 int32_t AppManagerAccessProxy::GetForegroundApplications(std::vector<AppStateData>& list) in GetForegroundApplications() argument 51 list.emplace_back(*info); in GetForegroundApplications()
|