/external/oprofile/libpp/ |
H A D | symbol.cpp | 35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi) argument 38 if (counts[i] != 0)
|
H A D | sample_container.cpp | 25 count_array_t add_counts(count_array_t const & counts, argument 28 count_array_t temp(counts); 29 temp += s->counts; 73 it->second.counts += sample.counts;
|
H A D | 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);
|
H A D | format_output.h | 90 counts(c), extra(extra), diff(d) {} 94 counts_t & counts; member in struct:format_output::formatter::field_datum 155 /// total counts 156 counts_t counts; member in class:format_output::formatter
|
H A D | profile_container.cpp | 95 symb_entry.sample.counts[pclass] = count; 145 sample.counts[pclass] = it.count(); 180 op_ratio(it->sample.counts[0], total_count[0]); 220 count_array_t counts = samples_count(*it); local 222 double const ratio = op_ratio(counts[0], total_count[0]);
|
H A D | xml_utils.cpp | 346 get_counts_string(count_array_t const & counts, size_t begin, size_t end) argument 351 // if no cpu separation then return a simple count, omit zero counts 353 size_t count = counts[begin]; 361 size_t count = counts[p]; 425 void add_to_summary(count_array_t const & counts); 540 void module_info::add_to_summary(count_array_t const & counts) argument 543 summary[pclass] += counts[pclass]; 640 add_to_summary((*it)->sample.counts); 666 // propagate this symbols counts to the module 667 my_modules[nr_modules-1].add_to_summary((*it)->sample.counts); [all...] |
/external/stlport/test/eh/ |
H A D | 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[ [all...] |
/external/guava/guava-tests/test/com/google/common/util/concurrent/ |
H A D | AtomicDoubleArrayTest.java | 289 volatile long counts; field in class:AtomicDoubleArrayTest.Counter 300 ++counts; 327 assertEquals(c1.counts + c2.counts, SIZE * COUNTDOWN);
|
/external/linux-tools-perf/util/ |
H A D | evsel.h | 62 struct perf_counts *counts; member in struct:perf_evsel
|
/external/strace/ |
H A D | 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[tc [all...] |
/external/chromium/chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/ |
H A D | openid.php | 338 $counts = array(); variable 345 if (empty($counts[$alias])) $counts[$alias] = 0; 346 $counts[$alias] += 1; 353 foreach ($counts as $alias => $count) {
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ImmutableMultiset.java | 459 final int[] counts; field in class:ImmutableMultiset.SerializedForm 464 counts = new int[distinct]; 468 counts[i] = entry.getCount(); 477 multiset.add(elements[i], counts[i]);
|
H A D | ImmutableSortedMultiset.java | 576 int[] counts; field in class:ImmutableSortedMultiset.SerializedForm 582 counts = new int[n]; 586 counts[i] = entry.getCount(); 596 builder.addCopies(elements[i], counts[i]);
|
/external/jdiff/src/jdiff/ |
H A D | DiffMyers.java | 523 @return the array of equivalence class counts. 562 @param counts The count of each equivalence number for the other file. 567 private byte[] discardable(final int[] counts) { argument 584 nmatch = counts[equivs[i]];
|
/external/opencv/cvaux/src/ |
H A D | cvcalibfilter.cpp | 269 int* counts = (int*)cvAlloc( n * sizeof(counts[0])); local 276 counts[i] = etalonPointCount; 284 cvCalibrateCamera( framesAccepted, counts, 320 icvStereoCalibration( framesAccepted, counts, 336 cvFree( &counts );
|
/external/oprofile/pp/ |
H A D | opreport.cpp | 44 count_array_t counts; member in struct:__anon9996::summary 49 ? counts[0] < rhs.counts[0] : rhs.counts[0] < counts[0]; 68 counts[pclass] += count; 88 count_array_t counts; member in struct:__anon9996::app_summary 99 ? counts[0] < rhs.counts[0] : rhs.counts[ [all...] |
H A D | opannotate.cpp | 189 string str = count_str(sample->counts, samples->samples_count()); 231 prev_sample->counts += sample->counts; 232 str = count_str(prev_sample->counts, samples->samples_count()); 234 str = count_str(sample->counts, samples->samples_count()); 265 string annot = count_str(symbol->sample.counts, 272 str += count_str(symbol->sample.counts, samples->samples_count()); 522 count_array_t counts = samples->samples_count(filename, linenr); local 523 if (!counts.zero()) { 524 str += count_str(counts, sample 545 count_array_t counts; local [all...] |
/external/webp/src/utils/ |
H A D | huffman_encode.c | 27 // Change the population counts in a way that the consequent 29 static int OptimizeHuffmanForRle(int length, int* const counts) { argument 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[ [all...] |
/external/chromium/base/metrics/ |
H A D | histogram.h | 338 Count counts(size_t i) const { return counts_[i]; } function in class:base::Histogram::SampleSet 365 // count to the sum of the counts in all buckets, and detect problems. Note 429 // Check to see if bucket ranges, counts and tallies in the snapshot are
|
/external/speex/libspeex/ |
H A D | jitter.c | 84 int filled; /**< Number of entries occupied in "timing" and "counts"*/ 87 spx_int16_t counts[MAX_TIMINGS]; /**< Order the packets were put in (will be used for short-term estimate) */ member in struct:TimingBuffer 124 SPEEX_MOVE(&tb->counts[pos+1], &tb->counts[pos], move_size); 128 tb->counts[pos] = tb->curr_count;
|
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
H A D | atom.c | 214 int counts[HASH_TABLE_MAX_COLLISIONS + 1]; member in struct:HashTable_Rec 236 htable->counts[ii] = 0; 450 atable->htable.counts[count]++; 694 sprintf(str, " %d", atable->htable.counts[ii]);
|
/external/webkit/Source/WebKit/win/ |
H A D | WebHistoryItem.cpp | 165 // Daily and weekly counts < 0 are errors in the data read from disk, so reset to 0. 491 HRESULT STDMETHODCALLTYPE WebHistoryItem::getDailyVisitCounts(int* number, int** counts) argument 493 if (!number || !counts) { 498 *counts = const_cast<int*>(m_historyItem->dailyVisitCounts().data()); 503 HRESULT STDMETHODCALLTYPE WebHistoryItem::getWeeklyVisitCounts(int* number, int** counts) argument 505 if (!number || !counts) { 510 *counts = const_cast<int*>(m_historyItem->weeklyVisitCounts().data());
|
/external/valgrind/main/coregrind/m_scheduler/ |
H A D | scheduler.c | 133 /* Sanity checking counts. */ 168 /* For showing SB counts, if the user asks to see them. */ 1202 static Int counts[EmWarn_NUMBER]; local 1211 counts[q] = 0; 1219 : counts[ew]++ < 3;
|
/external/opencv/ml/src/ |
H A D | ml_inner_functions.cpp | 1891 CvMat* counts = 0; local 1907 CV_CALL( counts = cvCreateMat( 1, nclusters + 1, CV_32SC1 ) ); 1908 CV_CALL( cvSetZero( counts )); 1913 counts->data.i[labels->data.i[i] + 1]++; 1915 CV_ASSERT((int)cvSum(counts).val[0] == nsamples); 1922 if( counts->data.i[j+1] ) // j-th class is not empty 1931 if( counts->data.i[label+1] == 0 || 1932 (counts->data.i[label+1] <= 1 && label != -1) ) 1943 counts->data.i[labels->data.i[maxprob_loc] + 1]--; 1945 counts [all...] |
H A D | mlboost.cpp | 498 double* counts = (double*)cvStackAlloc( (mi+1)*sizeof(counts[0]) ) + 1; local 504 sum[i] = counts[i] = 0; 512 double nc = counts[idx] + w; 514 counts[idx] = nc; 520 R += counts[i]; 522 sum[i] /= counts[i]; 531 sum[i] *= counts[i]; 536 double ni = counts[idx];
|