Home
last modified time | relevance | path

Searched refs:nb_clusters (Results 1 – 25 of 63) sorted by relevance

123

/dports/emulators/qemu-powernv/qemu-powernv-3.0.50/block/
H A Dqcow2-cluster.c1149 nb_clusters = in handle_copied()
1153 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1305 nb_clusters = in handle_alloc()
1309 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1322 nb_clusters = 1; in handle_alloc()
1324 nb_clusters = count_cow_clusters(s, nb_clusters, l2_slice, l2_index); in handle_alloc()
1419 .nb_clusters = nb_clusters, in handle_alloc()
1665 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1722 return nb_clusters; in discard_in_l2_slice()
1786 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c960 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
968 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
970 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1027 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1028 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1035 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
1944 if (cluster >= *nb_clusters) { in check_refblocks()
2475 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2476 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2485 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu-utils/qemu-4.2.1/block/
H A Dqcow2-cluster.c1166 nb_clusters = in handle_copied()
1170 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1329 nb_clusters = in handle_alloc()
1333 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1337 nb_clusters = MIN(nb_clusters, INT_MAX >> s->cluster_bits); in handle_alloc()
1346 nb_clusters = count_cow_clusters(bs, nb_clusters, l2_slice, l2_index); in handle_alloc()
1432 .nb_clusters = nb_clusters, in handle_alloc()
1611 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1668 return nb_clusters; in discard_in_l2_slice()
1732 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c969 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
977 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
979 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1036 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1037 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1044 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2006 if (cluster >= *nb_clusters) { in check_refblocks()
2544 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2545 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2554 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu42/qemu-4.2.1/block/
H A Dqcow2-cluster.c1166 nb_clusters = in handle_copied()
1170 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1329 nb_clusters = in handle_alloc()
1333 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1337 nb_clusters = MIN(nb_clusters, INT_MAX >> s->cluster_bits); in handle_alloc()
1346 nb_clusters = count_cow_clusters(bs, nb_clusters, l2_slice, l2_index); in handle_alloc()
1432 .nb_clusters = nb_clusters, in handle_alloc()
1611 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1668 return nb_clusters; in discard_in_l2_slice()
1732 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c969 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
977 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
979 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1036 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1037 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1044 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2006 if (cluster >= *nb_clusters) { in check_refblocks()
2544 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2545 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2554 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu-guest-agent/qemu-5.0.1/block/
H A Dqcow2-cluster.c1177 nb_clusters = in handle_copied()
1181 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1340 nb_clusters = in handle_alloc()
1344 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1348 nb_clusters = MIN(nb_clusters, INT_MAX >> s->cluster_bits); in handle_alloc()
1357 nb_clusters = count_cow_clusters(bs, nb_clusters, l2_slice, l2_index); in handle_alloc()
1443 .nb_clusters = nb_clusters, in handle_alloc()
1622 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1679 return nb_clusters; in discard_in_l2_slice()
1743 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c969 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
977 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
979 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1036 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1037 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1044 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2006 if (cluster >= *nb_clusters) { in check_refblocks()
2544 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2545 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2554 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu-cheri/qemu-0a323821042c36e21ea80e58b9545dfc3b0cb8ef/block/
H A Dqcow2-cluster.c1177 nb_clusters = in handle_copied()
1181 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1340 nb_clusters = in handle_alloc()
1344 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1348 nb_clusters = MIN(nb_clusters, INT_MAX >> s->cluster_bits); in handle_alloc()
1357 nb_clusters = count_cow_clusters(bs, nb_clusters, l2_slice, l2_index); in handle_alloc()
1443 .nb_clusters = nb_clusters, in handle_alloc()
1622 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1679 return nb_clusters; in discard_in_l2_slice()
1743 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c969 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
977 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
979 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1036 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1037 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1044 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2006 if (cluster >= *nb_clusters) { in check_refblocks()
2544 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2545 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2554 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu60/qemu-6.0.0/block/
H A Dqcow2-cluster.c1291 .nb_clusters = nb_clusters, in calculate_l2_meta()
1479 nb_clusters = in handle_copied()
1483 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1485 nb_clusters = MIN(nb_clusters, BDRV_REQUEST_MAX_BYTES >> s->cluster_bits); in handle_copied()
1642 nb_clusters = in handle_alloc()
1646 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1656 nb_clusters = count_single_write_clusters(bs, nb_clusters, in handle_alloc()
1877 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1928 return nb_clusters; in discard_in_l2_slice()
1991 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c970 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
978 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
980 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1037 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1038 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1045 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2016 if (cluster >= *nb_clusters) { in check_refblocks()
2555 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2556 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2565 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu5/qemu-5.2.0/block/
H A Dqcow2-cluster.c1291 .nb_clusters = nb_clusters, in calculate_l2_meta()
1479 nb_clusters = in handle_copied()
1483 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1485 nb_clusters = MIN(nb_clusters, BDRV_REQUEST_MAX_BYTES >> s->cluster_bits); in handle_copied()
1642 nb_clusters = in handle_alloc()
1646 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1656 nb_clusters = count_single_write_clusters(bs, nb_clusters, in handle_alloc()
1877 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1928 return nb_clusters; in discard_in_l2_slice()
1991 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c970 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
978 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
980 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1037 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1038 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1045 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2016 if (cluster >= *nb_clusters) { in check_refblocks()
2555 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2556 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2565 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/emulators/qemu-devel/qemu-de8ed1055c2ce18c95f597eb10df360dcb534f99/block/
H A Dqcow2-cluster.c1290 .nb_clusters = nb_clusters, in calculate_l2_meta()
1496 nb_clusters = in handle_copied()
1500 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1502 nb_clusters = MIN(nb_clusters, BDRV_REQUEST_MAX_BYTES >> s->cluster_bits); in handle_copied()
1659 nb_clusters = in handle_alloc()
1663 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1673 nb_clusters = count_single_write_clusters(bs, nb_clusters, in handle_alloc()
1894 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1945 return nb_clusters; in discard_in_l2_slice()
2008 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c970 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
978 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
980 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1037 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1038 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1045 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2112 if (cluster >= *nb_clusters) { in check_refblocks()
2651 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2652 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2661 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_community_leiden.c29 igraph_integer_t nb_clusters; in main() local
43 igraph_community_leiden(&graph, NULL, NULL, 0.05, 0.01, 0, &membership, &nb_clusters, &quality); in main()
45 …_PRId " clusters using CPM (resolution parameter 0.05), quality is %.4f.\n", nb_clusters, quality); in main()
51 igraph_community_leiden(&graph, NULL, NULL, 0.05, 0.01, 1, &membership, &nb_clusters, &quality); in main()
63 …h, NULL, &degree, 1.0 / (2 * igraph_ecount(&graph)), 0.01, 0, &membership, &nb_clusters, &quality); in main()
65 …eiden found %" IGRAPH_PRId " clusters using modularity, quality is %.4f.\n", nb_clusters, quality); in main()
/dports/emulators/qemu/qemu-6.2.0/block/
H A Dqcow2-cluster.c1303 .nb_clusters = nb_clusters, in calculate_l2_meta()
1509 nb_clusters = in handle_copied()
1513 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_copied()
1515 nb_clusters = MIN(nb_clusters, BDRV_REQUEST_MAX_BYTES >> s->cluster_bits); in handle_copied()
1672 nb_clusters = in handle_alloc()
1676 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in handle_alloc()
1686 nb_clusters = count_single_write_clusters(bs, nb_clusters, in handle_alloc()
1907 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in discard_in_l2_slice()
1958 return nb_clusters; in discard_in_l2_slice()
2021 nb_clusters = MIN(nb_clusters, s->l2_slice_size - l2_index); in zero_in_l2_slice()
[all …]
H A Dqcow2-refcount.c970 uint64_t i, nb_clusters, refcount; in alloc_clusters_noref() local
978 nb_clusters = size_to_clusters(s, size); in alloc_clusters_noref()
980 for(i = 0; i < nb_clusters; i++) { in alloc_clusters_noref()
1037 assert(nb_clusters >= 0); in qcow2_alloc_clusters_at()
1038 if (nb_clusters == 0) { in qcow2_alloc_clusters_at()
1045 for(i = 0; i < nb_clusters; i++) { in qcow2_alloc_clusters_at()
2112 if (cluster >= *nb_clusters) { in check_refblocks()
2651 nb_clusters = size_to_clusters(s, size); in qcow2_check_refcounts()
2652 if (nb_clusters > INT_MAX) { in qcow2_check_refcounts()
2661 &nb_clusters); in qcow2_check_refcounts()
[all …]
/dports/science/py-dipy/dipy-1.4.1/dipy/segment/tests/
H A Dtest_clustering.py349 nb_clusters = 11
362 nb_clusters = 11
389 nb_clusters = 11
423 nb_clusters = 11
437 nb_clusters = 11
448 nb_clusters = 11
461 nb_clusters = 11
471 for i in range(nb_clusters+1, 2*nb_clusters+1)]
534 nb_clusters = 4
635 nb_clusters = 11
[all …]
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Dcommunity_leiden.c31 igraph_integer_t nb_clusters = igraph_vcount(graph); in run_leiden_CPM() local
37 …den(graph, edge_weights, NULL, resolution_parameter, 0.01, 0, &membership, &nb_clusters, &quality); in run_leiden_CPM()
39 …" clusters using CPM (resolution parameter=%.2f), quality is %.4f.\n", nb_clusters, resolution_par… in run_leiden_CPM()
51 igraph_integer_t nb_clusters = igraph_vcount(graph); in run_leiden_modularity() local
67 …_leiden(graph, edge_weights, &degree, 1.0 / (2 * m), 0.01, 0, &membership, &nb_clusters, &quality); in run_leiden_modularity()
70 … printf("Leiden found %" IGRAPH_PRId " clusters using modularity, quality is nan.\n", nb_clusters); in run_leiden_modularity()
72 …eiden found %" IGRAPH_PRId " clusters using modularity, quality is %.4f.\n", nb_clusters, quality); in run_leiden_modularity()
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dcluster_point_set.h184 std::size_t nb_clusters = 0; in cluster_point_set() local
207 put (cluster_map, *current, Cluster_index_t(nb_clusters)); in cluster_point_set()
211 return (nb_clusters + 1); in cluster_point_set()
219 ++ nb_clusters; in cluster_point_set()
252 return nb_clusters; in cluster_point_set()
259 return nb_clusters; in cluster_point_set()
/dports/math/cgal/CGAL-5.3/demo/Polyhedron/Plugins/Point_set/
H A DPoint_set_clustering_plugin.cpp143 std::size_t nb_clusters = *functor.result; in on_actionCluster_triggered() local
152 new_items.reserve (nb_clusters); in on_actionCluster_triggered()
153 for (std::size_t i = 0; i < nb_clusters; ++ i) in on_actionCluster_triggered()
168 std::vector<std::size_t> cluster_size (nb_clusters, 0); in on_actionCluster_triggered()
227 std::cerr << "Number of clusters = " << nb_clusters << " (" in on_actionCluster_triggered()
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dleiden.c57 igraph_integer_t *nb_clusters, in igraph_i_community_leiden_fastmovenodes() argument
198 IGRAPH_CHECK(igraph_reindex_membership(membership, NULL, nb_clusters)); in igraph_i_community_leiden_fastmovenodes()
719 igraph_vector_t *membership, igraph_integer_t *nb_clusters, igraph_real_t *quality) { in igraph_i_community_leiden() argument
782 IGRAPH_CHECK(igraph_reindex_membership(i_membership, NULL, nb_clusters)); in igraph_i_community_leiden()
784 if (*nb_clusters > n) { in igraph_i_community_leiden()
799 nb_clusters, in igraph_i_community_leiden()
805 continue_clustering = (*nb_clusters < igraph_vcount(i_graph)); in igraph_i_community_leiden()
824 for (c = 0; c < *nb_clusters; c++) { in igraph_i_community_leiden()
840 nb_refined_clusters = *nb_clusters; in igraph_i_community_leiden()
989 … igraph_vector_t *membership, igraph_integer_t *nb_clusters, igraph_real_t *quality) { in igraph_community_leiden() argument
[all …]
/dports/math/R-cran-igraph/igraph/src/
H A Dcommunity_leiden.c54 igraph_integer_t *nb_clusters, in igraph_i_community_leiden_fastmovenodes() argument
195 IGRAPH_CHECK(igraph_reindex_membership(membership, NULL, nb_clusters)); in igraph_i_community_leiden_fastmovenodes()
715 … igraph_vector_t *membership, igraph_integer_t *nb_clusters, igraph_real_t *quality) { in igraph_i_community_leiden() argument
778 IGRAPH_CHECK(igraph_reindex_membership(i_membership, NULL, nb_clusters)); in igraph_i_community_leiden()
780 if (*nb_clusters > n) { in igraph_i_community_leiden()
795 nb_clusters, in igraph_i_community_leiden()
801 continue_clustering = (*nb_clusters < igraph_vcount(i_graph)); in igraph_i_community_leiden()
820 for (c = 0; c < *nb_clusters; c++) { in igraph_i_community_leiden()
836 nb_refined_clusters = *nb_clusters; in igraph_i_community_leiden()
985 … igraph_vector_t *membership, igraph_integer_t *nb_clusters, igraph_real_t *quality) { in igraph_community_leiden() argument
[all …]

123