Home
last modified time | relevance | path

Searched refs:counts (Results 1 – 25 of 512) sorted by relevance

12345678910>>...21

/external/strace/
Dcount.c46 #define counts (countv[current_personality]) macro
56 if (!counts) in count_syscall()
58 counts = calloc(nsyscalls, sizeof(*counts)); in count_syscall()
59 if (!counts) in count_syscall()
67 counts[tcp->scno].calls++; in count_syscall()
69 counts[tcp->scno].errors++; in count_syscall()
102 tv_add(&counts[tcp->scno].time, &counts[tcp->scno].time, tv); in count_syscall()
110 return -tv_cmp(&counts[*((int *) a)].time, in time_cmp()
111 &counts[*((int *) b)].time); in time_cmp()
124 int m = counts[*((int *) a)].calls; in count_cmp()
[all …]
/external/smack/src/org/xbill/DNS/
DHeader.java19 private int [] counts; field in Header
28 counts = new int[4]; in init()
57 for (int i = 0; i < counts.length; i++) in Header()
58 counts[i] = in.readU16(); in Header()
74 for (int i = 0; i < counts.length; i++) in toWire()
75 out.writeU16(counts[i]); in toWire()
212 counts[field] = value; in setCount()
217 if (counts[field] == 0xFFFF) in incCount()
220 counts[field]++; in incCount()
225 if (counts[field] == 0) in decCount()
[all …]
/external/webp/src/utils/
Dhuffman_encode.c29 static int OptimizeHuffmanForRle(int length, int* const counts) { in OptimizeHuffmanForRle() argument
37 if (counts[length - 1] != 0) { in OptimizeHuffmanForRle()
52 int symbol = counts[0]; in OptimizeHuffmanForRle()
55 if (i == length || counts[i] != symbol) { in OptimizeHuffmanForRle()
65 symbol = counts[i]; in OptimizeHuffmanForRle()
75 int limit = counts[0]; in OptimizeHuffmanForRle()
80 !ValuesShouldBeCollapsedToStrideAverage(counts[i], limit)) { in OptimizeHuffmanForRle()
95 counts[i - k - 1] = count; in OptimizeHuffmanForRle()
103 limit = (counts[i] + counts[i + 1] + in OptimizeHuffmanForRle()
104 counts[i + 2] + counts[i + 3] + 2) / 4; in OptimizeHuffmanForRle()
[all …]
/external/stlport/test/eh/
Dtest_algo.cpp107 unsigned counts[SortClass::kRange]; in operator ()() local
108 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 ); in operator ()()
110 counts[ q->value() ]++; in operator ()()
125 counts[ p->value() ]--; in operator ()()
130 EH_ASSERT( counts[j] == 0 ); in operator ()()
153 unsigned counts[SortClass::kRange]; in assert_sorted_version() local
154 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 ); in assert_sorted_version()
156 counts[ q->value() ]++; in assert_sorted_version()
167 counts[ p->value() ]--; in assert_sorted_version()
172 EH_ASSERT( counts[j] == 0 ); in assert_sorted_version()
/external/oprofile/libpp/
Dformat_output.cpp305 out << f.sample.counts[f.pclass]; in format_nr_samples()
315 f.counts.cumulated_samples[f.pclass] += f.sample.counts[f.pclass]; in format_nr_cumulated_samples()
316 out << f.counts.cumulated_samples[f.pclass]; in format_nr_cumulated_samples()
325 return get_percent(f.sample.counts[f.pclass], f.counts.total[f.pclass]); in format_percent()
333 f.counts.cumulated_percent[f.pclass] += f.sample.counts[f.pclass]; in format_cumulated_percent()
335 return get_percent(f.counts.cumulated_percent[f.pclass], in format_cumulated_percent()
336 f.counts.total[f.pclass]); in format_cumulated_percent()
342 return get_percent(f.sample.counts[f.pclass], in format_percent_details()
343 f.counts.total[f.pclass]); in format_percent_details()
349 f.counts.cumulated_percent_details[f.pclass] += f.sample.counts[f.pclass]; in format_cumulated_percent_details()
[all …]
Dsample_container.cpp25 count_array_t add_counts(count_array_t const & counts, in add_counts() argument
28 count_array_t temp(counts); in add_counts()
29 temp += s->counts; in add_counts()
73 it->second.counts += sample.counts; in insert()
Ddiff_container.cpp66 symbol.diffs.fill(sym.sample.counts.size(), -INFINITY); in symbol_old()
77 symbol.diffs.fill(sym.sample.counts.size(), INFINITY); in symbol_new()
90 size_t size = sym2.sample.counts.size(); in symbol_diff()
94 percent1 = op_ratio(sym1.sample.counts[i], total1[i]); in symbol_diff()
95 percent2 = op_ratio(sym2.sample.counts[i], total2[i]); in symbol_diff()
Dcallgraph_container.cpp77 return lhs.sample.counts[0] < rhs.sample.counts[0]; in compare_arc_count()
84 return rhs.sample.counts[0] < lhs.sample.counts[0]; in compare_arc_count_reverse()
228 sym.sample.counts = self->sample.counts; in finish_sym()
312 sym.total_callee_count += self.sample.counts; in process_children()
323 while (cit != cend && op_ratio(cit->sample.counts[0], in process_children()
333 while (cit != cend && op_ratio(cit->sample.counts[0], in process_children()
354 if (op_ratio(sym.sample.counts[0], total[0]) < threshold) in process()
366 csym.sample.counts = cit->second; in process()
375 csym.sample.counts = cit->second; in process()
Dsymbol_sort.cpp48 if (lhs.sample.counts[0] < rhs.sample.counts[0]) in compare_by()
50 if (lhs.sample.counts[0] > rhs.sample.counts[0]) in compare_by()
Dsymbol.cpp35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi) in has_sample_counts() argument
38 if (counts[i] != 0) in has_sample_counts()
Dprofile_container.cpp95 symb_entry.sample.counts[pclass] = count; in add()
145 sample.counts[pclass] = it.count(); in add_samples()
180 op_ratio(it->sample.counts[0], total_count[0]); in select_symbols()
220 count_array_t counts = samples_count(*it); in select_filename() local
222 double const ratio = op_ratio(counts[0], total_count[0]); in select_filename()
/external/oprofile/pp/
Dopreport.cpp44 count_array_t counts; member
49 ? counts[0] < rhs.counts[0] : rhs.counts[0] < counts[0]; in operator <()
68 counts[pclass] += count; in add_files()
88 count_array_t counts; member
99 ? counts[0] < rhs.counts[0] : rhs.counts[0] < counts[0]; in operator <()
132 counts[pclass] += app_count; in add_profile()
142 counts[pclass] += lib_count; in add_profile()
299 if (summ.counts.zero()) in output_deps()
306 ? summaries.total_counts[i] : app.counts[i]; in output_deps()
308 output_count(tot_count, summ.counts[i]); in output_deps()
[all …]
Dopannotate.cpp189 string str = count_str(sample->counts, samples->samples_count()); in asm_list_annotation()
231 prev_sample->counts += sample->counts; in asm_list_annotation()
232 str = count_str(prev_sample->counts, samples->samples_count()); in asm_list_annotation()
234 str = count_str(sample->counts, samples->samples_count()); in asm_list_annotation()
265 string annot = count_str(symbol->sample.counts, in symbol_annotation()
272 str += count_str(symbol->sample.counts, samples->samples_count()); in symbol_annotation()
524 count_array_t counts = samples->samples_count(filename, linenr); in source_line_annotation() local
525 if (!counts.zero()) { in source_line_annotation()
526 str += count_str(counts, samples->samples_count()); in source_line_annotation()
547 count_array_t counts; in source_symbol_annotation() local
[all …]
/external/e2fsprogs/tests/f_resize_inode/
Dexpect23 Pass 4: Checking reference counts
36 Pass 4: Checking reference counts
51 Pass 4: Checking reference counts
64 Pass 4: Checking reference counts
79 Pass 4: Checking reference counts
92 Pass 4: Checking reference counts
107 Pass 4: Checking reference counts
119 Pass 4: Checking reference counts
132 Pass 4: Checking reference counts
165 Pass 4: Checking reference counts
/external/chromium/net/socket_stream/
Dsocket_stream_metrics_unittest.cc54 EXPECT_EQ(1, sample.counts(SocketStreamMetrics::PROTOCOL_UNKNOWN)); in TEST()
55 EXPECT_EQ(2, sample.counts(SocketStreamMetrics::PROTOCOL_WEBSOCKET)); in TEST()
56 EXPECT_EQ(3, sample.counts(SocketStreamMetrics::PROTOCOL_WEBSOCKET_SECURE)); in TEST()
87 EXPECT_EQ(1, sample.counts(SocketStreamMetrics::ALL_CONNECTIONS)); in TEST()
88 EXPECT_EQ(2, sample.counts(SocketStreamMetrics::TUNNEL_CONNECTION)); in TEST()
89 EXPECT_EQ(3, sample.counts(SocketStreamMetrics::SOCKS_CONNECTION)); in TEST()
90 EXPECT_EQ(4, sample.counts(SocketStreamMetrics::SSL_CONNECTION)); in TEST()
/external/llvm/test/Analysis/Profiling/
Dprofiling-tool-chain.ll103 ; PROF: ;;; Out-edge counts: [2.000000e+00 -> bb10]
111 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb1] [3.000000e+00 -> bb8]
118 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb6]
127 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb3]
134 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb5]
150 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb6]
159 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb2] [3.000000e+00 -> bb7]
165 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb9]
172 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb9]
181 ; PROF: ;;; Out-edge counts: [6.000000e+00 -> bb10]
[all …]
/external/llvm/test/Analysis/ScalarEvolution/
Dtrip-count9.ll11 ; CHECK: Determining loop execution counts for: @foo
27 ; CHECK: Determining loop execution counts for: @step2
43 ; CHECK: Determining loop execution counts for: @start1
59 ; CHECK: Determining loop execution counts for: @start1_step2
75 ; CHECK: Determining loop execution counts for: @startx
91 ; CHECK: Determining loop execution counts for: @startx_step2
107 ; CHECK: Determining loop execution counts for: @nsw
126 ; CHECK: Determining loop execution counts for: @nsw_step2
142 ; CHECK: Determining loop execution counts for: @nsw_start1
158 ; CHECK: Determining loop execution counts for: @nsw_start1_step2
[all …]
Dtrip-count10.ll3 ; Trip counts with trivial exit conditions.
5 ; CHECK: Determining loop execution counts for: @a
9 ; CHECK: Determining loop execution counts for: @b
13 ; CHECK: Determining loop execution counts for: @c
17 ; CHECK: Determining loop execution counts for: @d
78 ; Trip counts for non-polynomial iterations. It's theoretically possible
83 ; CHECK: Determining loop execution counts for: @nonpolynomial
111 ; CHECK: Determining loop execution counts for: @constant_phi_operands
DSolveQuadraticEquation.ll33 ; CHECK: Determining loop execution counts for: @test1
63 ; CHECK: Determining loop execution counts for: @test2
82 ; CHECK: Determining loop execution counts for: @test3
103 ; CHECK: Determining loop execution counts for: @test4
/external/chromium/chrome/browser/
Dchrome_browser_application_mac_unittest.mm74 EXPECT_EQ(4, sample.counts(0));
75 EXPECT_EQ(1, sample.counts(1));
76 EXPECT_EQ(3, sample.counts(2));
77 EXPECT_EQ(2, sample.counts(3));
81 EXPECT_EQ(4, sample.counts(kUnknownNSException));
/external/linux-tools-perf/util/
Devsel.c86 evsel->counts = zalloc((sizeof(*evsel->counts) + in perf_evsel__alloc_counts()
88 return evsel->counts != NULL ? 0 : -ENOMEM; in perf_evsel__alloc_counts()
141 if (evsel->counts == NULL && perf_evsel__alloc_counts(evsel, cpu + 1) < 0) in __perf_evsel__read_on_cpu()
155 evsel->counts->cpu[cpu] = count; in __perf_evsel__read_on_cpu()
164 struct perf_counts_values *aggr = &evsel->counts->aggr, count; in __perf_evsel__read()
185 evsel->counts->scaled = 0; in __perf_evsel__read()
188 evsel->counts->scaled = -1; in __perf_evsel__read()
194 evsel->counts->scaled = 1; in __perf_evsel__read()
/external/valgrind/main/cachegrind/
Dcg_merge.c212 ULong* counts; member
271 static Counts* new_Counts ( Int n_counts, /*COPIED*/ULong* counts ) in new_Counts() argument
279 cts->counts = malloc(n_counts * sizeof(ULong)); in new_Counts()
280 if (cts->counts == NULL) in new_Counts()
285 cts->counts[i] = counts[i]; in new_Counts()
298 cts->counts = malloc(n_counts * sizeof(ULong)); in new_Counts_Zeroed()
299 if (cts->counts == NULL) in new_Counts_Zeroed()
304 cts->counts[i] = 0; in new_Counts_Zeroed()
317 if (cts->counts) in ddel_Counts()
318 free(cts->counts); in ddel_Counts()
[all …]
/external/valgrind/main/memcheck/tests/
Daddressable.stderr.exp9 For counts of detected and suppressed errors, rerun with: -v
38 For counts of detected and suppressed errors, rerun with: -v
47 For counts of detected and suppressed errors, rerun with: -v
61 For counts of detected and suppressed errors, rerun with: -v
80 For counts of detected and suppressed errors, rerun with: -v
90 For counts of detected and suppressed errors, rerun with: -v
Dsh-mem-random.stdout.exp648 counts 1/2/4/8/F4/F8: 300249 300934 299432 299394 0 299991
16 counts 1/2/4/8/F4/F8: 300037 299522 300323 299732 0 300386
/external/webkit/Source/WebKit/mac/History/
DWebHistoryItemPrivate.h64 - (size_t)_getDailyVisitCounts:(const int**)counts;
65 - (size_t)_getWeeklyVisitCounts:(const int**)counts;

12345678910>>...21