| /external/compiler-rt/test/asan/TestCases/ |
| coverage-caller-callee-total-count.cc | 26 uintptr_t total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(0); local
28 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total);
30 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total);
32 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total);
36 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total);
38 total = CheckNewTotalUniqueCoverageIsLargerAndReturnIt(total)
[all...] |
| mmap_limit_mb.cc | 26 for (long total = total_mb << 20; total > 0; total -= allocation_size)
|
| /external/mesa3d/src/glsl/tests/ |
| optimization-test | 3 total=0
10 total=$((total+1))
21 echo "$pass/$total tests returned correct results"
24 if [[ $pass == $total ]]; then
|
| /system/core/liblog/ |
| uio.c | 24 int total = 0; local
33 if (total == 0)
34 total = -1;
40 total += ret;
46 return total;
51 int total = 0; local
60 if (total == 0)
61 total = -1;
67 total += ret;
73 return total;
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/base/ |
| StopwatchBenchmark.java | 33 long total = 0; local
37 total += s.elapsed(TimeUnit.NANOSECONDS);
39 return total;
43 long total = 0; local
47 total += (System.nanoTime() - start);
49 return total;
|
| SplitterBenchmark.java | 45 int total = 0; local
48 total += Iterables.size(CHAR_SPLITTER.split(input));
53 int total = 0; local
56 total += Iterables.size(STRING_SPLITTER.split(input));
|
| /external/squashfs-tools/squashfs-tools/ |
| 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 - 2, "\\\\") == 0)
[all...] |
| /external/oauth/core/src/main/java/net/oauth/client/ |
| ExcerptInputStream.java | 22 int total = 0; local
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/linux-tools-perf/src/tools/perf/ui/ |
| progress.c | 5 u64 total __maybe_unused,
17 void ui_progress__update(u64 curr, u64 total, const char *title)
19 return progress_fns->update(curr, total, title);
|
| progress.h | 15 void ui_progress__update(u64 curr, u64 total, const char *title);
|
| /bionic/libc/stdio/ |
| fread.c | 57 size_t total = desired_total; local
62 if (total == 0) {
82 while (total > 0) {
86 size_t buffered_bytes = MIN((size_t) fp->_r, total);
91 total -= buffered_bytes;
96 if (total == 0) {
104 if (total > (size_t) fp->_bf._size) {
126 while (total > 0) {
127 ssize_t bytes_read = (*fp->_read)(fp->_cookie, dst, total);
133 total -= bytes_read
[all...] |
| /libcore/support/src/test/java/tests/support/ |
| ThrowingReader.java | 30 private int total = 0; field in class:ThrowingReader
41 total++;
49 if (total < throwAt) {
50 count = Math.min(count, (throwAt - total));
54 total += returned;
59 if (total == throwAt) {
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| times_test.cpp | 32 int total = accumulate(input, input + 4, 1, multiplies<int>()); local
33 CPPUNIT_ASSERT(total==70);
|
| /ndk/tests/device/test-stlport/unit/ |
| times_test.cpp | 32 int total = accumulate(input, input + 4, 1, multiplies<int>()); local
33 CPPUNIT_ASSERT(total==70);
|
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| SeparatedFolderListAdapter.java | 58 // total together all sections, plus one for each section header
59 int total = 0; local
61 total += adapter.getCount();
63 return total;
68 // assume that headers count as one, then total all sections
69 int total = 0; local
71 total += adapter.getViewTypeCount();
72 return total == 0 ? 1 : total;
|
| /art/test/478-checker-inliner-nested-loop/src/ |
| Main.java | 44 int total = 0; local
47 total += Inline(x, y);
50 return total;
|
| /external/linux-tools-perf/src/tools/perf/ui/tui/ |
| progress.c | 7 static void tui_progress__update(u64 curr, u64 total, const char *title)
17 if (total == 0)
28 bar = ((SLtt_Screen_Cols - 2) * curr) / total;
|
| /external/skia/src/views/animated/ |
| SkScrollBarView.cpp | 53 void SkScrollBarView::setTotal(unsigned total)
55 if ((int)total < 0)
56 total = 0;
58 if (fTotalLength != total)
60 fTotalLength = total;
70 if (dom.findS32(node, "total", &value))
122 int total = fTotalLength; local
127 if (total <= 0 || shown <= 0 || shown >= total) // no bar to show
129 total = 1; // avoid divide-by-zero. should be done by skin/scrip
[all...] |
| /external/valgrind/exp-bbv/tests/amd64-linux/ |
| 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/lzma/CPP/7zip/Archive/Common/ |
| MultiStream.h | 30 UInt64 total = 0;
local
34 s.GlobalOffset = total;
35 total += Streams[i].Size;
38 _totalLength = total;
|
| /external/lzma/CPP/7zip/ |
| IProgress.h | 12 STDMETHOD(SetTotal)(UInt64 total) x; \
28 STDMETHOD(SetTotal)(const UInt64 *total) PURE;
|
| /ndk/tests/device/issue35933-lambda/jni/ |
| issue35933-lambda.cpp | 5 static int total = 0; variable
9 total += n;
14 std::cout << message << ": " << total << std::endl;
31 display("total");
45 return total != -231;
|
| /external/apache-http/src/org/apache/http/impl/io/ |
| ContentLengthOutputStream.java | 66 /** Total bytes written */
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/ |
| make-sparse.c | 25 int got, total = 0; local
33 return total ? total : -1;
37 return total;
42 total += got;
45 return total;
|
| /external/valgrind/drd/tests/ |
| omp_prime.c | 38 int total = 0; local
89 DRD_TRACE_VAR(total);
96 primes[total] = i;
97 total++;
103 n, total);
104 for (i = 0; i < total; i++)
|
