| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | SwitchLoweringUtils.cpp | 20 uint64_t SwitchCG::getJumpTableRange(const CaseClusterVector &Clusters, in getJumpTableRange() argument
23 const APInt &LowCase = Clusters[First].Low->getValue(); in getJumpTableRange()
24 const APInt &HighCase = Clusters[Last].High->getValue(); in getJumpTableRange()
43 void SwitchCG::SwitchLowering::findJumpTables(CaseClusterVector &Clusters, in findJumpTables() argument
49 // Clusters must be non-empty, sorted, and only contain Range clusters. in findJumpTables()
50 assert(!Clusters.empty()); in findJumpTables()
51 for (CaseCluster &C : Clusters) in findJumpTables()
53 for (unsigned i = 1, e = Clusters.size(); i < e; ++i) in findJumpTables()
54 assert(Clusters[i - 1].High->getValue().slt(Clusters[i].Low->getValue())); in findJumpTables()
65 const int64_t N = Clusters.size(); in findJumpTables()
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/CodeGen/ |
| D | SwitchLoweringUtils.cpp | 23 uint64_t SwitchCG::getJumpTableRange(const CaseClusterVector &Clusters, in getJumpTableRange() argument
26 const APInt &LowCase = Clusters[First].Low->getValue(); in getJumpTableRange()
27 const APInt &HighCase = Clusters[Last].High->getValue(); in getJumpTableRange()
46 void SwitchCG::SwitchLowering::findJumpTables(CaseClusterVector &Clusters, in findJumpTables() argument
52 // Clusters must be non-empty, sorted, and only contain Range clusters. in findJumpTables()
53 assert(!Clusters.empty()); in findJumpTables()
54 for (CaseCluster &C : Clusters) in findJumpTables()
56 for (unsigned i = 1, e = Clusters.size(); i < e; ++i) in findJumpTables()
57 assert(Clusters[i - 1].High->getValue().slt(Clusters[i].Low->getValue())); in findJumpTables()
68 const int64_t N = Clusters.size(); in findJumpTables()
[all …]
|
| /external/harfbuzz_ng/src/wasm/graphite/ |
| D | shape.cc | 112 cluster_t *clusters = (cluster_t *) malloc (length * sizeof (cluster_t)); in shape() local
114 if (!clusters || !gids) in shape()
116 free (clusters); in shape()
121 memset (clusters, 0, sizeof (clusters[0]) * length); in shape()
123 clusters[0].cluster = contents.info[0].cluster; in shape()
134 clusters[0].advance = gr_seg_advance_X(seg) * xscale - curradv; in shape()
137 clusters[0].advance = 0; in shape()
144 while (clusters[ci].base_char > before && ci) in shape()
146 clusters[ci-1].num_chars += clusters[ci].num_chars; in shape()
147 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; in shape()
[all …]
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | mark_for_compilation_pass_test.cc | 75 VLOG(2) << "Clusters:"; in GetClusters()
130 auto clusters = GetClusters(*graph); in TEST() local
131 EXPECT_EQ(4, clusters.size()); in TEST()
132 EXPECT_EQ(clusters["B"], clusters["C"]); in TEST()
133 EXPECT_EQ(clusters["E"], clusters["F"]); in TEST()
134 EXPECT_NE(clusters["B"], clusters["E"]); in TEST()
135 EXPECT_TRUE(clusters.find("A") == clusters.cend()); in TEST()
136 EXPECT_TRUE(clusters.find("D") == clusters.cend()); in TEST()
154 auto clusters = GetClusters(*graph); in TEST() local
156 EXPECT_TRUE(clusters.empty()); in TEST()
[all …]
|
| /external/skia/modules/skparagraph/tests/ |
| D | SkShaperJSONWriter.cpp | 43 std::vector<uint32_t>& clusters) { in is_one_to_one() argument
47 if (clusters[clusterIndex] >= lastUtf8Index) { in is_one_to_one()
50 size_t utf8ClusterSize = lastUtf8Index - clusters[clusterIndex]; in is_one_to_one()
51 if (SkUTF::CountUTF8(&utf8[clusters[clusterIndex]], utf8ClusterSize) != 1) { in is_one_to_one()
54 lastUtf8Index = clusters[clusterIndex]; in is_one_to_one()
58 if (clusters.front() <= clusters.back()) { in is_one_to_one()
59 // left-to-right clusters in is_one_to_one()
60 size_t clusterCursor = clusters.size(); in is_one_to_one()
65 // right-to-left clusters in is_one_to_one()
67 while (clusterCursor < clusters.size()) { in is_one_to_one()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/stat/clustering/ |
| D | KMeansPlusPlusClusterer.java | 64 /** Selected strategy for empty clusters. */
69 * The default strategy for handling empty clusters that may appear during
80 * @param emptyStrategy strategy to use for handling empty clusters that
93 * @param k the number of clusters to split the data into
97 * @return a list of clusters containing the points
99 * of clusters is larger than the number of data points
107 // at first, we have not found any clusters list yet in cluster()
114 // compute a clusters list in cluster()
115 List<Cluster<T>> clusters = cluster(points, k, maxIterationsPerTrial); in cluster() local
119 for (final Cluster<T> cluster : clusters) { in cluster()
[all …]
|
| /external/mtools/ |
| D | fat_size_calculation.tex | 28 figure out fat size and number of clusters. Due to the way that
30 have a FAT that is larger than need to be to accommodate the clusters
47 Number of clusters on the disk\\
91 The space taken up by all clusters together, plus the space taken by
92 descriptors for clusters 0 and 1 ($2*nfats*fatNybls$) should be less
97 area). Thus, an {\em upper bound} for the number of clusters is as
138 or equal} to what would be needed for the data area of the clusters
139 (including fractional clusters), which is good, as we may have under
140 no circumstances {\em more} clusters in the data area than in the FAT.
142 size on a {\em fractional} number of clusters, rather than a rounded
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/ml/clustering/ |
| D | KMeansPlusPlusClusterer.java | 61 /** The number of clusters. */
70 /** Selected strategy for empty clusters. */
75 * The default strategy for handling empty clusters that may appear during
80 * @param k the number of clusters to split the data into
88 * The default strategy for handling empty clusters that may appear during
93 * @param k the number of clusters to split the data into
103 * The default strategy for handling empty clusters that may appear during
106 * @param k the number of clusters to split the data into
117 * The default strategy for handling empty clusters that may appear during
120 * @param k the number of clusters to split the data into
[all …]
|
| D | FuzzyKMeansClusterer.java | 53 * <li>k: the number of clusters
54 … <li>fuzziness: determines the level of cluster fuzziness, larger values lead to fuzzier clusters
73 /** The number of clusters. */
94 /** The list of clusters resulting from the last call to {@link #cluster(Collection)}. */
95 private List<CentroidCluster<T>> clusters; field in FuzzyKMeansClusterer
102 * @param k the number of clusters to split the data into
113 * @param k the number of clusters to split the data into
129 * @param k the number of clusters to split the data into
156 this.clusters = null; in FuzzyKMeansClusterer()
160 * Return the number of clusters this instance will use.
[all …]
|
| /external/cpuinfo/src/arm/linux/ |
| D | midr.c | 24 /* Description of core clusters configuration in a chipset (identified by series
33 /* Number of heterogenous clusters in the CPU package */
34 uint8_t clusters; member
92 .clusters = 1,
110 .clusters = 2,
128 .clusters = 2,
146 .clusters = 2,
163 .clusters = 2,
181 .clusters = 2,
199 .clusters = 2,
[all …]
|
| D | clusters.c | 22 * Assigns logical processors to clusters of cores using heuristic based on the
23 * typical configuration of clusters for 5, 6, 8, and 10 cores:
24 * - 5 cores (ARM32 Android only): 2 clusters of 4+1 cores
25 * - 6 cores: 2 clusters of 4+2 cores
26 * - 8 cores: 2 clusters of 4+4 cores
27 * - 10 cores: 3 clusters of 4+4+2 cores
30 * clusters. Its purpose is to detect clusters of cores when OS-provided
36 * - Exynos 8890 has 8 cores in 4+4 clusters, but only the first cluster of 4
43 * Heuristic assignment of processors to the above pre-defined clusters fails if
46 * - Any of the OS-reported processor clusters is different than the
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| D | KMeansPlusPlusClusterer.java | 58 /** Selected strategy for empty clusters. */
63 * The default strategy for handling empty clusters that may appear during
74 * @param emptyStrategy strategy to use for handling empty clusters that
87 * @param k the number of clusters to split the data into
90 * @return a list of clusters containing the points
94 // create the initial clusters in cluster()
95 List<Cluster<T>> clusters = chooseInitialCenters(points, k, random); in cluster() local
96 assignPointsToClusters(clusters, points); in cluster()
103 for (final Cluster<T> cluster : clusters) { in cluster()
108 newCenter = getPointFromLargestVarianceCluster(clusters); in cluster()
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | hb-graphite2.cc | 321 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); in _hb_graphite2_shape()
326 hb_memset (clusters, 0, sizeof (clusters[0]) * buffer->len); in _hb_graphite2_shape()
329 clusters[0].cluster = buffer->info[0].cluster; in _hb_graphite2_shape()
338 clusters[0].advance = gr_seg_advance_X(seg) * xscale - curradv; in _hb_graphite2_shape()
341 clusters[0].advance = 0; in _hb_graphite2_shape()
348 while (clusters[ci].base_char > before && ci) in _hb_graphite2_shape()
350 clusters[ci-1].num_chars += clusters[ci].num_chars; in _hb_graphite2_shape()
351 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; in _hb_graphite2_shape()
352 clusters[ci-1].advance += clusters[ci].advance; in _hb_graphite2_shape()
356 …if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char +… in _hb_graphite2_shape()
[all …]
|
| /external/googleapis/google/cloud/securitycenter/settings/v1beta1/ |
| D | securitycenter_settings_service.proto | 43 // folders, projects, and clusters.
76 get: "/settings/v1beta1/{name=projects/*/locations/*/clusters/*/settings}"
79 get: "/settings/v1beta1/{name=projects/*/regions/*/clusters/*/settings}"
82 get: "/settings/v1beta1/{name=projects/*/zones/*/clusters/*/settings}"
102 patch: "/settings/v1beta1/{settings.name=projects/*/locations/*/clusters/*/settings}"
106 patch: "/settings/v1beta1/{settings.name=projects/*/regions/*/clusters/*/settings}"
110 patch: "/settings/v1beta1/{settings.name=projects/*/zones/*/clusters/*/settings}"
140 post: "/settings/v1beta1/{name=projects/*/locations/*/clusters/*/settings}:reset"
144 post: "/settings/v1beta1/{name=projects/*/regions/*/clusters/*/settings}:reset"
148 post: "/settings/v1beta1/{name=projects/*/zones/*/clusters/*/settings}:reset"
[all …]
|
| /external/google-cloud-java/java-securitycenter-settings/proto-google-cloud-securitycenter-settings-v1beta1/src/main/proto/google/cloud/securitycenter/settings/v1beta1/ |
| D | securitycenter_settings_service.proto | 43 // folders, projects, and clusters.
76 get: "/settings/v1beta1/{name=projects/*/locations/*/clusters/*/settings}"
79 get: "/settings/v1beta1/{name=projects/*/regions/*/clusters/*/settings}"
82 get: "/settings/v1beta1/{name=projects/*/zones/*/clusters/*/settings}"
102 patch: "/settings/v1beta1/{settings.name=projects/*/locations/*/clusters/*/settings}"
106 patch: "/settings/v1beta1/{settings.name=projects/*/regions/*/clusters/*/settings}"
110 patch: "/settings/v1beta1/{settings.name=projects/*/zones/*/clusters/*/settings}"
140 post: "/settings/v1beta1/{name=projects/*/locations/*/clusters/*/settings}:reset"
144 post: "/settings/v1beta1/{name=projects/*/regions/*/clusters/*/settings}:reset"
148 post: "/settings/v1beta1/{name=projects/*/zones/*/clusters/*/settings}:reset"
[all …]
|
| /external/webrtc/rtc_tools/frame_analyzer/ |
| D | video_quality_analysis.cc | 81 std::vector<Cluster> clusters; in CalculateFrameClusters() local
84 if (!clusters.empty() && clusters.back().index == index) { in CalculateFrameClusters()
86 ++clusters.back().number_of_repeated_frames; in CalculateFrameClusters()
89 clusters.push_back({index, /* number_of_repeated_frames= */ 1}); in CalculateFrameClusters()
93 return clusters; in CalculateFrameClusters()
96 int GetMaxRepeatedFrames(const std::vector<Cluster>& clusters) { in GetMaxRepeatedFrames() argument
98 for (const Cluster& cluster : clusters) { in GetMaxRepeatedFrames()
105 int GetMaxSkippedFrames(const std::vector<Cluster>& clusters) { in GetMaxSkippedFrames() argument
107 for (size_t i = 1; i < clusters.size(); ++i) { in GetMaxSkippedFrames()
108 const size_t skipped_frames = clusters[i].index - clusters[i - 1].index - 1; in GetMaxSkippedFrames()
[all …]
|
| /external/google-cloud-java/java-container/proto-google-cloud-container-v1beta1/src/main/java/com/google/container/v1beta1/ |
| D | ListClustersResponseOrBuilder.java | 30 * A list of clusters in the project in the specified zone, or
34 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
41 * A list of clusters in the project in the specified zone, or
45 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
52 * A list of clusters in the project in the specified zone, or
56 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
63 * A list of clusters in the project in the specified zone, or
67 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
75 * A list of clusters in the project in the specified zone, or
79 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
[all …]
|
| D | ListClustersResponse.java | 79 * A list of clusters in the project in the specified zone, or
83 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
93 * A list of clusters in the project in the specified zone, or
97 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
108 * A list of clusters in the project in the specified zone, or
112 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
122 * A list of clusters in the project in the specified zone, or
126 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
136 * A list of clusters in the project in the specified zone, or
140 * <code>repeated .google.container.v1beta1.Cluster clusters = 1;</code>
[all …]
|
| /external/google-cloud-java/java-container/proto-google-cloud-container-v1/src/main/java/com/google/container/v1/ |
| D | ListClustersResponseOrBuilder.java | 30 * A list of clusters in the project in the specified zone, or
34 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
41 * A list of clusters in the project in the specified zone, or
45 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
52 * A list of clusters in the project in the specified zone, or
56 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
63 * A list of clusters in the project in the specified zone, or
67 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
74 * A list of clusters in the project in the specified zone, or
78 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
[all …]
|
| D | ListClustersResponse.java | 79 * A list of clusters in the project in the specified zone, or
83 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
93 * A list of clusters in the project in the specified zone, or
97 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
108 * A list of clusters in the project in the specified zone, or
112 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
122 * A list of clusters in the project in the specified zone, or
126 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
136 * A list of clusters in the project in the specified zone, or
140 * <code>repeated .google.container.v1.Cluster clusters = 1;</code>
[all …]
|
| /external/grpc-grpc/tools/distrib/python/xds_protos/envoy/extensions/clusters/aggregate/v3/ |
| D | cluster_pb2.py | 3 # source: envoy/extensions/clusters/aggregate/v3/cluster.proto
19 …clusters/aggregate/v3/cluster.proto\x12&envoy.extensions.clusters.aggregate.v3\x1a\x1dudpa/annotat…
23 _builder.BuildTopDescriptorsAndMessages(DESCRIPTOR, 'envoy.extensions.clusters.aggregate.v3.cluster…
26 …roxy.envoy.extensions.clusters.aggregate.v3B\014ClusterProtoP\001ZYgithub.com/envoyproxy/go-contro…
27 _CLUSTERCONFIG.fields_by_name['clusters']._options = None
28 _CLUSTERCONFIG.fields_by_name['clusters']._serialized_options = b'\372B\005\222\001\002\010\001'
|
| /external/harfbuzz_ng/test/shape/data/aots/tests/ |
| D | gpos3.tests | 1 #../fonts/gpos3_font1.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+001…
2 ../fonts/gpos3_font1.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+0011…
3 #../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+001…
4 #../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+001…
5 #../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+001…
6 #../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+001…
7 ../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+0011…
8 ../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+0011…
9 ../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+0011…
10 ../fonts/gpos3_font3.otf;--features="test" --single-par --no-clusters --no-glyph-names --ned;U+0011…
[all …]
|
| D | gsub_chaining2_simple.tests | 1 ../fonts/gsub_chaining2_simple_f1.otf;--features="test" --single-par --no-clusters --no-glyph-names…
2 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
3 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
4 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
5 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
6 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
7 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
8 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
9 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
10 ../fonts/gsub_chaining2_simple_f2.otf;--features="test" --single-par --no-clusters --no-glyph-names…
[all …]
|
| /external/google-cloud-java/java-dataproc/proto-google-cloud-dataproc-v1/src/main/java/com/google/cloud/dataproc/v1/ |
| D | ListClustersResponseOrBuilder.java | 17 // source: google/cloud/dataproc/v1/clusters.proto
30 * Output only. The clusters in the project.
34 …* repeated .google.cloud.dataproc.v1.Cluster clusters = 1 [(.google.api.field_behavior) = OUTPUT_O…
42 * Output only. The clusters in the project.
46 …* repeated .google.cloud.dataproc.v1.Cluster clusters = 1 [(.google.api.field_behavior) = OUTPUT_O…
54 * Output only. The clusters in the project.
58 …* repeated .google.cloud.dataproc.v1.Cluster clusters = 1 [(.google.api.field_behavior) = OUTPUT_O…
66 * Output only. The clusters in the project.
70 …* repeated .google.cloud.dataproc.v1.Cluster clusters = 1 [(.google.api.field_behavior) = OUTPUT_O…
79 * Output only. The clusters in the project.
[all …]
|
| /external/brotli/c/enc/ |
| D | cluster_inc.h | 73 uint32_t* clusters,
90 FN(BrotliCompareAndPushToQueue)(out, cluster_size, clusters[idx1],
91 clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);
117 if (clusters[i] == best_idx2) {
118 memmove(&clusters[i], &clusters[i + 1],
119 (num_clusters - i - 1) * sizeof(clusters[0]));
149 FN(BrotliCompareAndPushToQueue)(out, cluster_size, best_idx1, clusters[i],
169 When called, clusters[0..num_clusters) contains the unique values from
173 size_t in_size, const uint32_t* clusters, size_t num_clusters,
183 FN(BrotliHistogramBitCostDistance)(&in[i], &out[clusters[j]]);
[all …]
|