Searched refs:values (Results 1 - 17 of 17) sorted by relevance

/fuchsia/zircon/third_party/ulib/musl/src/conf/
H A Dfpathconf.c6 static const short values[] = {[_PC_LINK_MAX] = _POSIX_LINK_MAX, local
27 if (name < 0 || (size_t)name >= sizeof(values) / sizeof(values[0])) {
31 return values[name];
H A Dsysconf.c26 static const short values[] = { local
169 if (name < 0 || (size_t)name >= sizeof(values) / sizeof(values[0]) || !values[name]) {
172 } else if (values[name] >= -1) {
173 return values[name];
176 switch ((unsigned char)values[name]) {
213 return values[name];
/fuchsia/zircon/system/ulib/perftest/
H A Dresults.cpp17 double Mean(const fbl::Vector<double>& values) { argument
18 double sum = fbl::accumulate(values.begin(), values.end(), 0.0);
19 return sum / static_cast<double>(values.size());
22 double Min(const fbl::Vector<double>& values) { argument
23 return *fbl::min_element(values.begin(), values.end());
26 double Max(const fbl::Vector<double>& values) { argument
27 return *fbl::max_element(values.begin(), values
30 StdDev(const fbl::Vector<double>& values, double mean) argument
52 Median(const fbl::Vector<double>& values) argument
[all...]
H A Drunner.cpp244 results->values.reserve(run_count_);
/fuchsia/zircon/system/uapp/rng-trials/
H A Drng-trials.c16 uint64_t values[BINS] = { 0 }; local
29 values[byte % BINS]++;
33 printf("bin %u: %" PRIu64 "\n", i, values[i]);
/fuchsia/zircon/system/utest/fbl/
H A Dalgorithm_tests.cpp146 int values[] = { 1, 3, 7, -2, 5, 7 }; local
147 constexpr size_t count = fbl::count_of(values);
148 int* first = values;
149 int* last = values + count;
150 EXPECT_EQ(fbl::max_element(first, last), values + 2); local
167 int values[] = { 1, 3, 7, -2, 5, 7 }; local
168 constexpr size_t count = fbl::count_of(values);
169 int* first = values;
170 int* last = values + count;
171 EXPECT_EQ(fbl::max_element(first, last, max_compare), values local
184 int values[] = { 1, 3, -7, -2, 5, -7 }; local
188 EXPECT_EQ(fbl::min_element(first, last), values + 2); local
205 int values[] = { 1, 3, -7, -2, 5, -7 }; local
209 EXPECT_EQ(fbl::min_element(first, last, min_compare), values + 2); local
230 int values[count] = { 1, 3, 5, 7 }; local
275 int values[count] = { 1, 3, 5, 7 }; local
398 int values[] = { 9, 11, 8, 12 }; local
420 int values[] = { 9, 11, 8, 12 }; local
[all...]
/fuchsia/zircon/system/ulib/perftest/include/perftest/
H A Dresults.h37 // sequence of values, which are typically the times taken by each run of
47 values.push_back(value);
58 fbl::Vector<double> values; member in struct:perftest::TestCaseResults
/fuchsia/zircon/kernel/lib/counters/
H A Dcounters.cpp84 uint64_t values[SMP_MAX_CPUS]; local
88 values[ix] = percpu[ix].counters[counter_index];
89 sum += values[ix];
99 if (values[ix] > 0)
100 printf("[%zu:%lu]", ix, values[ix]);
/fuchsia/zircon/system/utest/int-types/
H A Drules.mk12 # comparing the values of -1 and 0. This leads to complaints about
/fuchsia/zircon/third_party/tools/android/
H A Dmkbootimg85 def __call__(self, parser, namespace, values, option_string=None):
86 if len(values) > self.maxlen:
88 format(self.maxlen, len(values)))
89 setattr(namespace, self.dest, values)
/fuchsia/zircon/system/utest/perftest/
H A Dresults-test.cpp39 const char* expected = R"JSON([{"label":"ExampleNullSyscall","test_suite":"results_test","unit":"nanoseconds","values":[101.000000,102.000000,103.000000,104.000000,105.000000]}])JSON";
62 // There is an even number of values, so the median is interpolated.
67 // There is an odd number of values, so the median is not interpolated.
H A Drunner-test.cpp45 // Sanity-check time values.
47 for (auto time_taken : test_case->values) {
49 // Check for unreasonably large values, which suggest that we
73 // The output should have time values for the number of runs we requested.
75 EXPECT_EQ(test_case->values.size(), kRunCount);
168 EXPECT_EQ(test_case.values.size(), kRunCount);
/fuchsia/zircon/third_party/ulib/jemalloc/include/jemalloc/internal/
H A Dsmoothstep.sh12 # <bfp> must be in [0..62]; reasonable values are roughly [10..30].
69 * to 1 in 0 <= x <= 1. The table is stored as integer fixed point values so
/fuchsia/zircon/third_party/ulib/uboringssl/crypto/err/
H A Derr.c449 // err_string_cmp is a compare function for searching error values with
465 // |values| and |string_data|. It returns the string or NULL if not found.
467 const uint32_t *values,
470 // |values| points to data in err_data.h, which is generated by
471 // err_data_generate.go. It's an array of uint32_t values. Each value has the
476 // The |lib| value is a library identifier: one of the |ERR_LIB_*| values.
487 const uint32_t *result = bsearch(&search_key, values, num_values,
466 err_string_lookup(uint32_t lib, uint32_t key, const uint32_t *values, size_t num_values, const char *string_data) argument
/fuchsia/zircon/system/utest/cobalt-client/
H A Dhistogram_test.cpp252 const EventBuffer<fidl::VectorView<HistogramBucket>>& values,
407 // Verify that the data stored through public API, matches the expected values.
413 // Sanity-Check that the internal representation also matches the expected values.
/fuchsia/zircon/system/utest/fbl/include/fbl/tests/intrusive_containers/
H A Dsequence_container_test_environment.h569 bool BidirectionalEquals(const ContainerType& sequence, const size_t* values, size_t size) { argument
579 // Iterate forwards and verify values.
580 const size_t* val_iter = values;
586 // Iterate backwards and verify values.
851 // element values have already been replaced).
872 // Make sure that the object are in order and have the values we expect.
948 // element values have already been replaced).
972 // Make sure that the object are in order and have the values we expect.
1031 // Make sure that the object are in order and have the values we expect.
1087 // Make sure that the object are in order and have the values w
[all...]
/fuchsia/zircon/third_party/ulib/jemalloc/bin/
H A Djeprof.in2561 foreach my $symlist (values(%{$symbols})) {
2576 foreach my $symlist (values(%{$symbols})) {
3411 # $SYMBOL_PAGE for all PC values found in profile. Otherwise, the raw symbols
3817 # $result->{pcs} Hash of all PC values seen, key is hex address
3962 # Do some sanity checking on these header values.
4332 my @values = ($cycles, $count, $cycles / $count);
4333 AddEntries($profile, $pcs, FixCallerAddresses($stack), $values[$index]);
4408 # Aggressively search the lib_prefix values for the given library
4657 # 0..max_pc_value_seen, so that we assume pc values not found in one
4828 # Extract symbols for all PC values foun
[all...]

Completed in 148 milliseconds