HomeSort by relevance Sort by last modified time
    Searched refs:counts (Results 1 - 25 of 213) sorted by null

1 2 3 4 5 6 7 8 9

  /external/linux-tools-perf/scripts/python/bin/
syscall-counts-report 2 # description: system-wide syscall counts
10 perf script $@ -s "$PERF_EXEC_PATH"/scripts/python/syscall-counts.py $comm
syscall-counts-by-pid-report 2 # description: system-wide syscall counts, by pid
10 perf script $@ -s "$PERF_EXEC_PATH"/scripts/python/syscall-counts-by-pid.py $comm
  /external/strace/
count.c 46 #define counts (countv[current_personality]) macro
56 if (!counts)
58 counts = calloc(nsyscalls, sizeof(*counts));
59 if (!counts)
62 "strace: out of memory for call counts\n");
67 counts[tcp->scno].calls++;
69 counts[tcp->scno].errors++;
102 tv_add(&counts[tcp->scno].time, &counts[tcp->scno].time, tv)
    [all...]
  /external/smack/src/org/xbill/DNS/
Header.java 19 private int [] counts; field in class:Header
28 counts = new int[4];
57 for (int i = 0; i < counts.length; i++)
58 counts[i] = in.readU16();
74 for (int i = 0; i < counts.length; i++)
75 out.writeU16(counts[i]);
212 counts[field] = value;
217 if (counts[field] == 0xFFFF)
220 counts[field]++;
225 if (counts[field] == 0
    [all...]
  /packages/apps/ContactsCommon/src/com/android/contacts/common/list/
ContactsSectionIndexer.java 26 * their respective counts.
39 * @param counts a non-null array of the same size as <code>sections</code>
41 public ContactsSectionIndexer(String[] sections, int[] counts) {
42 if (sections == null || counts == null) {
46 if (sections.length != counts.length) {
48 "The sections and counts arrays must have the same length");
51 // TODO process sections/counts based on current locale and/or specific section titles
54 mPositions = new int[counts.length];
56 for (int i = 0; i < counts.length; i++) {
64 position += counts[i]
    [all...]
  /external/oprofile/libpp/
symbol.cpp 35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi)
38 if (counts[i] != 0)
sample_container.cpp 25 count_array_t add_counts(count_array_t const & counts,
28 count_array_t temp(counts);
29 temp += s->counts;
73 it->second.counts += sample.counts;
format_output.cpp 305 out << f.sample.counts[f.pclass];
315 f.counts.cumulated_samples[f.pclass] += f.sample.counts[f.pclass];
316 out << f.counts.cumulated_samples[f.pclass];
325 return get_percent(f.sample.counts[f.pclass], f.counts.total[f.pclass]);
333 f.counts.cumulated_percent[f.pclass] += f.sample.counts[f.pclass];
335 return get_percent(f.counts.cumulated_percent[f.pclass],
336 f.counts.total[f.pclass])
    [all...]
symbol.h 29 /// for storing sample counts
57 count_array_t counts; member in struct:sample_entry
101 * the sample counts replaced with the relevant arc counts, whilst
142 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi);
  /external/webkit/Source/WebKit/mac/History/
WebHistoryItemPrivate.h 64 - (size_t)_getDailyVisitCounts:(const int**)counts;
65 - (size_t)_getWeeklyVisitCounts:(const int**)counts;
  /external/webp/src/utils/
huffman_encode.c 27 // Change the population counts in a way that the consequent
29 static int OptimizeHuffmanForRle(int length, int* const counts) {
37 if (counts[length - 1] != 0) {
38 // Now counts[0..length - 1] does not have trailing zeros.
42 // 2) Let's mark all population counts that already can be encoded
52 int symbol = counts[0];
55 if (i == length || counts[i] != symbol) {
65 symbol = counts[i];
72 // 3) Let's replace those population counts that lead to more rle codes.
75 int limit = counts[0]
    [all...]
  /external/stlport/test/eh/
test_algo.cpp 105 // Prepare an array of counts of the occurrence of each value in
107 unsigned counts[SortClass::kRange]; local
108 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 );
110 counts[ q->value() ]++;
125 counts[ p->value() ]--;
130 EH_ASSERT( counts[j] == 0 );
151 // Prepare an array of counts of the occurrence of each value in
153 unsigned counts[SortClass::kRange]; local
154 EH_STD::fill_n( counts, (int)SortClass::kRange, 0 );
156 counts[ q->value() ]++
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
Phaser.java 28 * only internal counts; they do not establish any further internal
287 int counts = (int)s; local
288 return (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK);
300 int counts = (int)s; local
301 return (counts == EMPTY) ? 0 :
302 (counts >>> PARTIES_SHIFT) - (counts & UNARRIVED_MASK);
360 int counts = (int)s; local
361 int unarrived = (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK)
406 int counts = (int)s; local
655 int counts = (int)s; local
    [all...]
  /external/valgrind/main/exp-bbv/tests/amd64-linux/
fldcw_check.S 7 # performance counter counts this as one instruction. However,
8 # on Pentium 4 systems it counts as two. Therefore this can
  /external/valgrind/main/exp-bbv/tests/x86/
fldcw_check.S 7 # performance counter counts this as one instruction. However,
8 # on Pentium 4 systems it counts as two. Therefore this can
  /external/valgrind/main/gdbserver_tests/
mcclean_after_fork.stderr.exp 14 For counts of detected and suppressed errors, rerun with: -v
mcmain_pic.stderr.exp 12 For counts of detected and suppressed errors, rerun with: -v
  /external/valgrind/main/memcheck/tests/
accounting.stderr.exp 10 For counts of detected and suppressed errors, rerun with: -v
brk2.stderr.exp 9 For counts of detected and suppressed errors, rerun with: -v
bug287260.stderr.exp 10 For counts of detected and suppressed errors, rerun with: -v
erringfds.stderr.exp 10 For counts of detected and suppressed errors, rerun with: -v
leak-pool-0.stderr.exp 9 For counts of detected and suppressed errors, rerun with: -v
leak-pool-1.stderr.exp 9 For counts of detected and suppressed errors, rerun with: -v
leak-pool-2.stderr.exp 9 For counts of detected and suppressed errors, rerun with: -v
leak-pool-3.stderr.exp 9 For counts of detected and suppressed errors, rerun with: -v

Completed in 851 milliseconds

1 2 3 4 5 6 7 8 9