Home
last modified time | relevance | path

Searched refs:counts (Results 1 - 25 of 171) sorted by relevance

1234567

/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DPerStageTests.cpp45 PerStage<int> counts; in TEST() local
46 counts[SingleShaderStage::Vertex] = 0; in TEST()
47 counts[SingleShaderStage::Fragment] = 0; in TEST()
48 counts[SingleShaderStage::Compute] = 0; in TEST()
51 counts[stage]++; in TEST()
54 ASSERT_EQ(counts[wgpu::ShaderStage::Vertex], 1); in TEST()
55 ASSERT_EQ(counts[wgpu::ShaderStage::Fragment], 1); in TEST()
56 ASSERT_EQ(counts[wgpu::ShaderStage::Compute], 1); in TEST()
61 PerStage<int> counts; in TEST() local
62 counts[SingleShaderStag in TEST()
77 PerStage<int> counts; TEST() local
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/
H A DPeriod.java32 final int[] counts; field in Period
168 for (int i = 0; i < counts.length; ++i) { in isSet()
169 if (counts[i] != 0) { in isSet()
182 return counts[unit.ordinal] > 0; in isSet()
193 if (counts[ord] == 0) { in getCount()
196 return (counts[ord] - 1)/1000f; in getCount()
257 * the same counts, both extend into the future or both into the
269 for (int i = 0; i < counts.length; ++i) { in equals()
270 if (counts[i] != rhs.counts[ in equals()
305 Period(int timeLimit, boolean inFuture, int[] counts) Period() argument
[all...]
H A DBasicPeriodFormatter.java44 return format(period.timeLimit, period.inFuture, period.counts); in format()
57 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
59 for (int i = 0; i < counts.length; ++i) { in format()
60 if (counts[i] > 0) { in format()
70 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
71 if ((mask & m) != 0 && counts[i] == 1) { in format()
94 counts[sx] += (counts[mx]-1)/1000; in format()
103 counts[sx] = 1; in format()
105 counts[s in format()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/duration/
H A DPeriod.java34 final int[] counts; field in Period
170 for (int i = 0; i < counts.length; ++i) { in isSet()
171 if (counts[i] != 0) { in isSet()
184 return counts[unit.ordinal] > 0; in isSet()
195 if (counts[ord] == 0) { in getCount()
198 return (counts[ord] - 1)/1000f; in getCount()
259 * the same counts, both extend into the future or both into the
271 for (int i = 0; i < counts.length; ++i) { in equals()
272 if (counts[i] != rhs.counts[ in equals()
307 Period(int timeLimit, boolean inFuture, int[] counts) Period() argument
[all...]
H A DBasicPeriodFormatter.java45 return format(period.timeLimit, period.inFuture, period.counts); in format()
58 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
60 for (int i = 0; i < counts.length; ++i) { in format()
61 if (counts[i] > 0) { in format()
71 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
72 if ((mask & m) != 0 && counts[i] == 1) { in format()
95 counts[sx] += (counts[mx]-1)/1000; in format()
104 counts[sx] = 1; in format()
106 counts[s in format()
[all...]
/third_party/skia/src/sksl/analysis/
H A DSkSLProgramUsage.cpp45 ProgramUsage::VariableCounts& counts = fUsage->fVariableCounts[&vd.var()]; variable
46 counts.fDeclared += fDelta;
47 SkASSERT(counts.fDeclared >= 0);
49 // The initial-value expression, when present, counts as a write.
50 counts.fWrite += fDelta;
63 ProgramUsage::VariableCounts& counts = fUsage->fVariableCounts[ref.variable()]; variable
66 counts.fRead += fDelta;
69 counts.fWrite += fDelta;
73 counts.fRead += fDelta;
74 counts
109 const VariableCounts* counts = fVariableCounts.find(&v); get() local
116 VariableCounts counts = this->get(v); isDead() local
[all...]
/third_party/node/deps/npm/node_modules/@colors/colors/lib/custom/
H A Dzalgo.js59 var counts;
76 counts = {'up': 0, 'down': 0, 'mid': 0};
79 counts.up = randomNumber(8);
80 counts.mid = randomNumber(2);
81 counts.down = randomNumber(8);
84 counts.up = randomNumber(16) + 3;
85 counts.mid = randomNumber(4) + 1;
86 counts.down = randomNumber(64) + 3;
89 counts.up = randomNumber(8) + 1;
90 counts
[all...]
/third_party/skia/src/sksl/transform/
H A DSkSLEliminateDeadLocalVariables.cpp37 ProgramUsage::VariableCounts* counts = fUsage->fVariableCounts.find(var); in EliminateDeadLocalVariables() local
38 SkASSERT(counts); in EliminateDeadLocalVariables()
39 SkASSERT(counts->fDeclared); in EliminateDeadLocalVariables()
40 if (CanEliminate(var, *counts)) { in EliminateDeadLocalVariables()
60 static bool CanEliminate(const Variable* var, const ProgramUsage::VariableCounts& counts) { in EliminateDeadLocalVariables() argument
61 if (!counts.fDeclared || counts.fRead || var->storage() != VariableStorage::kLocal) { in EliminateDeadLocalVariables()
65 SkASSERT(counts.fWrite >= 1); in EliminateDeadLocalVariables()
66 return counts.fWrite == 1; in EliminateDeadLocalVariables()
68 return counts in EliminateDeadLocalVariables()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dvp9prob.c59 unsigned *e = s->td[0].counts.eob[i][j][k][l][m]; in ff_vp9_adapt_probs()
60 unsigned *c = s->td[0].counts.coef[i][j][k][l][m]; in ff_vp9_adapt_probs()
80 adapt_prob(&p->skip[i], s->td[0].counts.skip[i][0], in ff_vp9_adapt_probs()
81 s->td[0].counts.skip[i][1], 20, 128); in ff_vp9_adapt_probs()
85 adapt_prob(&p->intra[i], s->td[0].counts.intra[i][0], in ff_vp9_adapt_probs()
86 s->td[0].counts.intra[i][1], 20, 128); in ff_vp9_adapt_probs()
91 adapt_prob(&p->comp[i], s->td[0].counts.comp[i][0], in ff_vp9_adapt_probs()
92 s->td[0].counts.comp[i][1], 20, 128); in ff_vp9_adapt_probs()
98 adapt_prob(&p->comp_ref[i], s->td[0].counts.comp_ref[i][0], in ff_vp9_adapt_probs()
99 s->td[0].counts in ff_vp9_adapt_probs()
[all...]
H A Dvp9mvs.c243 td->counts.mv_comp[idx].sign[sign]++; in read_mv_component()
244 td->counts.mv_comp[idx].classes[c]++; in read_mv_component()
251 td->counts.mv_comp[idx].bits[m][bit]++; in read_mv_component()
257 td->counts.mv_comp[idx].fp[bit]++; in read_mv_component()
260 td->counts.mv_comp[idx].hp[bit]++; in read_mv_component()
266 td->counts.mv_comp[idx].hp[1]++; in read_mv_component()
271 td->counts.mv_comp[idx].class0[n]++; in read_mv_component()
274 td->counts.mv_comp[idx].class0_fp[n][bit]++; in read_mv_component()
278 td->counts.mv_comp[idx].class0_hp[bit]++; in read_mv_component()
284 td->counts in read_mv_component()
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dentropy_encode.c67 especially when population counts are longer than 2**tree_limit, but
244 void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts, in BrotliOptimizeHuffmanCountsForRle() argument
254 if (counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
261 while (length != 0 && counts[length - 1] == 0) { in BrotliOptimizeHuffmanCountsForRle()
267 /* Now counts[0..length - 1] does not have trailing zeros. */ in BrotliOptimizeHuffmanCountsForRle()
272 if (counts[i] != 0) { in BrotliOptimizeHuffmanCountsForRle()
274 if (smallest_nonzero > counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
275 smallest_nonzero = counts[i]; in BrotliOptimizeHuffmanCountsForRle()
287 if (counts[i - 1] != 0 && counts[ in BrotliOptimizeHuffmanCountsForRle()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dentropy_encode.c67 especially when population counts are longer than 2**tree_limit, but
244 void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts, in BrotliOptimizeHuffmanCountsForRle() argument
254 if (counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
261 while (length != 0 && counts[length - 1] == 0) { in BrotliOptimizeHuffmanCountsForRle()
267 /* Now counts[0..length - 1] does not have trailing zeros. */ in BrotliOptimizeHuffmanCountsForRle()
272 if (counts[i] != 0) { in BrotliOptimizeHuffmanCountsForRle()
274 if (smallest_nonzero > counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
275 smallest_nonzero = counts[i]; in BrotliOptimizeHuffmanCountsForRle()
287 if (counts[i - 1] != 0 && counts[ in BrotliOptimizeHuffmanCountsForRle()
[all...]
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dhuffman_encode_utils.c29 // Change the population counts in a way that the consequent
32 uint32_t* const counts) { in OptimizeHuffmanForRle()
39 if (counts[length - 1] != 0) { in OptimizeHuffmanForRle()
40 // Now counts[0..length - 1] does not have trailing zeros. in OptimizeHuffmanForRle()
44 // 2) Let's mark all population counts that already can be encoded in OptimizeHuffmanForRle()
50 uint32_t symbol = counts[0]; in OptimizeHuffmanForRle()
53 if (i == length || counts[i] != symbol) { in OptimizeHuffmanForRle()
63 symbol = counts[i]; in OptimizeHuffmanForRle()
70 // 3) Let's replace those population counts that lead to more rle codes. in OptimizeHuffmanForRle()
73 uint32_t limit = counts[ in OptimizeHuffmanForRle()
31 OptimizeHuffmanForRle(int length, uint8_t* const good_for_rle, uint32_t* const counts) OptimizeHuffmanForRle() argument
[all...]
/third_party/skia/docs/examples/
H A Dcount_verbs.cpp14 static void count_verbs(const SkPath& path, int counts[6]) { in REG_FIDDLE() argument
17 counts[i] = 0; in REG_FIDDLE()
26 counts[(unsigned)verb]++; in REG_FIDDLE()
34 int counts[6]; in REG_FIDDLE() local
35 count_verbs(path, counts); in REG_FIDDLE()
43 canvas->drawString(SkStringPrintf("%-5s %3d", verbs[i], counts[i]), pt.fX, pt.fY, font, in REG_FIDDLE()
/third_party/vk-gl-cts/modules/gles2/stress/
H A Des2sVertexArrayTests.cpp74 int counts[] = {1, 256}; in init() local
80 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
102 spec.drawCount = counts[countNdx]; in init()
140 // Test strides with different input types, component counts and storage, Usage(?) in init()
143 int counts[] = {1, 256}; in init() local
152 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
172 spec.drawCount = counts[countNdx]; in init()
210 // Test strides with different input types, component counts and storage, Usage(?) in init()
212 int counts[] = {5, 256}; in init() local
221 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd in init()
283 int counts[] = {1, 256}; init() local
[all...]
/third_party/python/Lib/
H A Dtrace.py33 trace.py -c -f counts --ignore-dir '$prefix' spam.py eggs
155 def __init__(self, counts=None, calledfuncs=None, infile=None,
157 self.counts = counts
158 if self.counts is None:
159 self.counts = {}
160 self.counter = self.counts.copy() # map (filename, lineno) to count
172 # Try to merge existing counts file.
175 counts, calledfuncs, callers = pickle.load(f)
176 self.update(self.__class__(counts, calledfunc
[all...]
/third_party/cJSON/tests/unity/auto/
H A Dstylize_as_junit.rb91 result_output[:counts][:total] = tests
92 result_output[:counts][:failed] = failures
93 result_output[:counts][:ignored] = ignored
94 result_output[:counts][:passed] = (result_output[:counts][:total] - result_output[:counts][:failed] - result_output[:counts][:ignored])
110 write_suite_header(result_output[:counts], f)
170 counts: { total: 0, passed: 0, failed: 0, ignored: 0 },
183 def write_suite_header(counts, strea
[all...]
/third_party/unity/auto/
H A Dstylize_as_junit.rb91 result_output[:counts][:total] = tests
92 result_output[:counts][:failed] = failures
93 result_output[:counts][:ignored] = ignored
94 result_output[:counts][:passed] = (result_output[:counts][:total] - result_output[:counts][:failed] - result_output[:counts][:ignored])
110 write_suite_header(result_output[:counts], f)
167 counts: { total: 0, passed: 0, failed: 0, ignored: 0 },
180 def write_suite_header(counts, strea
[all...]
/third_party/vk-gl-cts/modules/gles3/stress/
H A Des3sVertexArrayTests.cpp76 int counts[] = {1, 256}; in init() local
82 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
88 const std::string name = "stride" + typeToString(stride) + "_" + Array::inputTypeToString(inputTypes[inputTypeNdx]) + "_quads" + typeToString(counts[countNdx]); in init()
103 spec.drawCount = counts[countNdx]; in init()
174 int counts[] = {1, 256}; in init() local
181 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
190 std::string name = Array::storageToString(storages[storageNdx]) + "_stride" + typeToString(stride) + "_components" + typeToString(componentCount) + "_quads" + typeToString(counts[countNdx]); in init()
208 spec.drawCount = counts[countNdx]; in init()
278 int counts[] = {5, 256}; in init() local
285 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd in init()
382 int counts[] = {1, 256}; init() local
[all...]
/third_party/node/deps/v8/src/diagnostics/
H A Dbasic-block-profiler.cc82 ByteArray counts(js_heap_data.counts()); in CopyFromJSHeap()
83 for (int i = 0; i < counts.length() / kBlockCountSlotSize; ++i) { in CopyFromJSHeap()
84 counts_.push_back(counts.get_uint32(i)); in CopyFromJSHeap()
111 Handle<ByteArray> counts = isolate->factory()->NewByteArray( in CopyToJSHeap() local
114 counts->set_uint32(i, counts_[i]); in CopyToJSHeap()
121 block_ids, counts, name, schedule, code, hash_, AllocationType::kOld); in CopyToJSHeap()
132 Handle<ByteArray> counts( in ResetCounts()
133 OnHeapBasicBlockProfilerData::cast(list->Get(i)).counts(), isolate); in ResetCounts()
134 for (int j = 0; j < counts in ResetCounts()
[all...]
/third_party/skia/tools/
H A Dblob_cache_sim.cpp21 std::unordered_map<uint64_t, uint32_t> counts; in main() local
49 auto lookup = counts.find(blobKey); in main()
50 if (lookup == counts.end()) { in main()
52 std::tie(lookup, ok) = counts.insert({blobKey, 0}); in main()
60 << " unique: " << counts.size() in main()
62 << " ratio: " << (float)total/counts.size() << "\n"; in main()
/third_party/skia/third_party/externals/swiftshader/third_party/astc-encoder/Source/
H A Dastc_partition_tables.cpp245 int counts[4]; in generate_one_partition_table() local
247 counts[i] = 0; in generate_one_partition_table()
252 counts[partition]++; in generate_one_partition_table()
255 if (counts[0] == 0) in generate_one_partition_table()
257 else if (counts[1] == 0) in generate_one_partition_table()
259 else if (counts[2] == 0) in generate_one_partition_table()
261 else if (counts[3] == 0) in generate_one_partition_table()
/third_party/vk-gl-cts/modules/gles2/functional/
H A Des2fVertexArrayTest.cpp73 int counts[] = {1, 256}; in init() local
79 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
101 spec.drawCount = counts[countNdx]; in init()
139 // Test strides with different input types, component counts and storage, Usage(?) in init()
142 int counts[] = {1, 256}; in init() local
151 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
171 spec.drawCount = counts[countNdx]; in init()
209 // Test strides with different input types, component counts and storage, Usage(?) in init()
211 int counts[] = {5, 256}; in init() local
220 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd in init()
282 int counts[] = {1, 256}; init() local
350 int counts[] = {1, 256}; init() local
413 int counts[] = {1, 256}; init() local
[all...]
/third_party/astc-encoder/Source/
H A Dastcenc_partition_tables.cpp290 int counts[BLOCK_MAX_PARTITIONS] { 0 }; in generate_one_partition_info_entry()
298 pi.texels_of_partition[part][counts[part]++] = static_cast<uint8_t>(texel_idx++); in generate_one_partition_info_entry()
307 int ptex_count = counts[i]; in generate_one_partition_info_entry()
316 if (counts[0] == 0) in generate_one_partition_info_entry()
320 else if (counts[1] == 0) in generate_one_partition_info_entry()
324 else if (counts[2] == 0) in generate_one_partition_info_entry()
328 else if (counts[3] == 0) in generate_one_partition_info_entry()
357 pi.partition_texel_count[i] = static_cast<uint8_t>(counts[i]); in generate_one_partition_info_entry()
/third_party/python/Lib/test/
H A Dtest_decorators.py41 def countcalls(counts):
45 counts[func_name] = 0
47 counts[func_name] += 1
150 counts = {}
153 @countcalls(counts)
158 self.assertEqual(counts, dict(double=0))
163 self.assertEqual(counts['double'], 1)
165 self.assertEqual(counts['double'], 1)
167 self.assertEqual(counts['double'], 2)
172 self.assertEqual(counts['doubl
[all...]

Completed in 12 milliseconds

1234567