/external/compiler-rt/test/asan/TestCases/ |
H A D | coverage-caller-callee-total-count.cc | 27 uintptr_t total = __sanitizer_get_total_unique_caller_callee_pairs(); local 29 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total); 31 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total); 33 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total); 37 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total); 39 total [all...] |
/external/mesa3d/src/compiler/glsl/tests/ |
H A D | warnings-test | 6 total=0 13 total=$((total+1)) 24 echo "$pass/$total tests returned correct results" 27 if [[ $pass == $total ]]; then
|
H A D | optimization-test | 9 total=0 24 total=$((total+1)) 35 echo "$pass/$total tests returned correct results" 38 if [[ $pass == $total ]]; then
|
/external/guava/guava-tests/benchmark/com/google/common/base/ |
H A D | StopwatchBenchmark.java | 33 long total = 0; 37 total += s.elapsed(TimeUnit.NANOSECONDS); 39 return total; 43 long total = 0; 47 total += (System.nanoTime() - start); 49 return total;
|
H A D | SplitterBenchmark.java | 45 int total = 0; 48 total += Iterables.size(CHAR_SPLITTER.split(input)); 53 int total = 0; 56 total += Iterables.size(STRING_SPLITTER.split(input));
|
/external/squashfs-tools/squashfs-tools/ |
H A D | read_file.c | 59 int total = 0; local 64 if(total + (MAX_LINE + 1) > size) { 70 err = fgets(line + total, MAX_LINE + 1, fd); 74 len = strlen(line + total); 75 total += len; 77 if(len == MAX_LINE && line[total - 1] != '\n') { 89 if(len && line[total - 1] == '\n') { 90 line[-- total] = '\0'; 100 if(len == 0 || line[total - 1] != '\\' || (len >= 2 && 101 strcmp(line + total [all...] |
/external/tensorflow/tensorflow/core/util/ |
H A D | work_sharder.cc | 23 void Shard(int max_parallelism, thread::ThreadPool* workers, int64 total, argument 25 CHECK_GE(total, 0); 26 if (total == 0) { 31 work(0, total); 35 workers->ParallelFor(total, cost_per_unit, work); 39 // We shard [0, total) into "num_shards" shards. 42 // If total * cost_per_unit is small, it is not worth shard too 48 total * cost_per_unit / kMinCostPerShard)); 50 // Each shard contains up to "block_size" units. [0, total) is sharded 56 const int64 block_size = (total [all...] |
H A D | work_sharder_test.cc | 30 void RunSharding(int64 num_workers, int64 total, int64 cost_per_unit, argument 35 std::vector<bool> work(total, false); 36 Shard(num_workers, threads, total, cost_per_unit, 40 EXPECT_LE(limit, total); 49 EXPECT_EQ(num_done_work, total); 50 LOG(INFO) << num_workers << " " << total << " " << cost_per_unit << " " 57 for (auto total : {0, 1, 7, 10, 64, 100, 256, 1000, 9999}) { 59 RunSharding(workers, total, cost_per_unit, &threads); 81 const int64 total = 1LL << 30; local 85 Shard(arg - 1, &threads, total, [all...] |
H A D | work_sharder.h | 26 // Shards the "total" unit of work assuming each unit of work having 28 // total - 1. Each shard contains 1 or more units of work and the 29 // total cost of each shard is roughly the same. The calling thread and the 46 // REQUIRES: total >= 0 48 void Shard(int max_parallelism, thread::ThreadPool* workers, int64 total,
|
/external/oauth/core/src/main/java/net/oauth/client/ |
H A D | ExcerptInputStream.java | 22 int total = 0; 24 while ((read = read(excerpt, total, LIMIT - total)) != -1 && ((total += read) < LIMIT)); 25 if (total == LIMIT) { 27 System.arraycopy(ELLIPSIS, 0, excerpt, total, ELLIPSIS.length); 29 byte[] tmp = new byte[total]; 30 System.arraycopy(excerpt, 0, tmp, 0, total);
|
/external/caliper/caliper/src/main/java/com/google/caliper/runner/ |
H A D | NanoTimeGranularityTester.java | 36 long total = 0L; 47 total += second - first; 48 total += third - second; 49 total += fourth - third; 50 total += fifth - fourth; 51 total += sixth - fifth; 52 total += seventh - sixth; 53 total += eighth - seventh; 54 total += ninth - eighth; 56 return ShortDuration.of(LongMath.divide(total, TRIAL [all...] |
/external/tensorflow/tensorflow/compiler/aot/ |
H A D | runtime.cc | 65 size_t total = 0; local 68 total += align_to(sizes[i], kAlign); 71 return total; 76 const size_t total = aligned_buffer_bytes(sizes, n); local 78 if (total > 0) { 79 contiguous = aligned_malloc(total, kAlign); 83 TF_ANNOTATE_MEMORY_IS_INITIALIZED(contiguous, total);
|
/external/libchrome/base/trace_event/ |
H A D | memory_dump_scheduler_unittest.cc | 42 bool ShouldTriggerDump(uint64_t total) { argument 43 return mds_->ShouldTriggerDump(total); 53 uint64_t total = (2 + (i / (2 * num_samples_tracked_))) * 1024 * 1204; local 54 bool did_trigger = ShouldTriggerDump(total); 70 // system's total memory. 71 uint64_t total = static_cast<uint64_t>(i + 1) * 1024 * 1024 * 1024; local 72 bool did_trigger = ShouldTriggerDump(total); 84 uint64_t total = (2 + (i / (2 * num_samples_tracked_))) * 1024 * 1204; local 87 bool did_trigger = ShouldTriggerDump(total); 94 total [all...] |
/external/python/cpython2/Tools/scripts/ |
H A D | dutree.py | 8 total, d = None, {} 18 total, d = store(size, comps, total, d) 20 display(total, d) 25 def store(size, comps, total, d): 32 return total, d 34 def display(total, d): 35 show(total, d, '') 37 def show(total, d, prefix): 45 ## if sum < total [all...] |
/external/python/cpython3/Tools/scripts/ |
H A D | dutree.py | 8 total, d = None, {} 18 total, d = store(size, comps, total, d) 20 display(total, d) 25 def store(size, comps, total, d): 32 return total, d 34 def display(total, d): 35 show(total, d, '') 37 def show(total, d, prefix): 45 ## if sum < total [all...] |
/external/compiler-rt/test/asan/TestCases/Posix/ |
H A D | mmap_limit_mb.cc | 28 for (long total = total_mb << 20; total > 0; total -= allocation_size)
|
/external/valgrind/exp-bbv/tests/amd64-linux/ |
H A D | million.S | 3 # total is 2 + 1 + 499997*2 + 3 7 xor %rcx,%rcx # not needed, pads total to 1M 8 xor %rax,%rax # not needed, pads total to 1M
|
/external/dng_sdk/source/ |
H A D | dng_xy_coord.cpp | 30 real64 total = X + Y + Z; local 32 if (total > 0.0) 35 return dng_xy_coord (X / total, 36 Y / total);
|
/external/lzma/CPP/7zip/Archive/Common/ |
H A D | MultiStream.h | 35 UInt64 total = 0;
local 39 s.GlobalOffset = total;
40 total += Streams[i].Size;
43 _totalLength = total;
|
/external/lzma/CPP/7zip/ |
H A D | IProgress.h | 11 STDMETHOD(SetTotal)(UInt64 total) x; \
|
/external/libunwind_llvm/test/ |
H A D | libunwind_02.pass.cpp | 36 int total = test(50); local 37 assert(total == 1275);
|
/external/apache-http/src/org/apache/http/impl/io/ |
H A D | ContentLengthOutputStream.java | 67 private long total = 0; field in class:ContentLengthOutputStream 113 if (this.total < this.contentLength) { 114 long max = this.contentLength - this.total; 119 this.total += len; 131 if (this.total < this.contentLength) { 133 this.total++;
|
/external/e2fsprogs/contrib/ |
H A D | make-sparse.c | 29 int got, total = 0; local 37 return total ? total : -1; 41 return total; 46 total += got; 49 return total;
|
/external/libffi/testsuite/libffi.call/ |
H A D | float_va.c | 21 double total=0.0; local 25 total+=(double)x; 26 total+=y; 34 total+=arg; 39 printf(" total: %.1f\n", total); 41 return total; 59 /* { dg-output "0: 2.0 : total: 2.0" } */ 74 /* { dg-output "\n0: 2.0 : total: 2.0" } */ 81 /* { dg-output "\n2: 2.0 : 0:3.0 1:4.0 total [all...] |
/external/python/cpython2/Modules/_ctypes/libffi/testsuite/libffi.call/ |
H A D | float_va.c | 21 double total=0.0; local 25 total+=(double)x; 26 total+=y; 34 total+=arg; 39 printf(" total: %.1f\n", total); 41 return total; 59 /* { dg-output "0: 2.0 : total: 2.0" } */ 74 /* { dg-output "\n0: 2.0 : total: 2.0" } */ 81 /* { dg-output "\n2: 2.0 : 0:3.0 1:4.0 total [all...] |