HomeSort by relevance Sort by last modified time
    Searched defs:end (Results 151 - 175 of 4210) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/opencensus-java/benchmarks/src/jmh/java/io/opencensus/benchmarks/trace/
StartEndSpanBenchmark.java 63 rootSpan.end();
68 * This benchmark attempts to measure performance of start/end for a non-sampled root {@code
80 span.end();
85 * This benchmark attempts to measure performance of start/end for a root {@code Span} with record
98 span.end();
103 * This benchmark attempts to measure performance of start/end for a sampled root {@code Span}.
110 span.end();
115 * This benchmark attempts to measure performance of start/end for a non-sampled child {@code
127 span.end();
132 * This benchmark attempts to measure performance of start/end for a child {@code Span} wit
    [all...]
  /art/libartbase/base/
bit_vector-inl.h 84 inline BitVector::IndexIterator BitVector::IndexContainer::end() const { function in class:art::BitVector::IndexContainer
  /art/runtime/gc/space/
bump_pointer_space-inl.h 49 uint8_t* end = end_.load(std::memory_order_relaxed); local
50 if (end + num_bytes > growth_end_) {
53 mirror::Object* obj = reinterpret_cast<mirror::Object*>(end);
54 end_.store(end + num_bytes, std::memory_order_relaxed);
bump_pointer_space-walk-inl.h 33 uint8_t* end = End(); local
60 end = main_end;
78 while (pos < end) {
84 CHECK_LE(reinterpret_cast<const uint8_t*>(end_obj), End());
86 // assume its the end. TODO: Have a thread update the header when it flushes the block?
  /art/runtime/mirror/
string-inl.h 61 const MemoryType* end = chars + GetLength(); local
62 while (p < end) {
  /art/test/004-InterfaceTest/src/
Main.java 29 long end = System.currentTimeMillis(); local
30 return (end - start);
40 long end = System.currentTimeMillis(); local
41 return (end - start);
  /art/test/028-array-write/src/
Main.java 27 static public void report(long start, long end) {
32 System.out.println("Finished in " + ((end - start) / 1000000.0)
42 long start, end; local
50 end = System.nanoTime();
52 report(start, end);
56 long start, end; local
68 end = System.nanoTime();
70 report(start, end);
  /art/test/053-wait-some/src/
Main.java 33 long start, end; local
54 end = System.currentTimeMillis();
56 long elapsed = end - start;
  /art/tools/ahat/src/main/com/android/ahat/
Doc.java 56 * contents and the 'end' method to end the table.
69 * contents and the 'end' method to end the table.
84 * end().
94 * End the currently active table or description list.
96 void end(); method in interface:Doc
  /bionic/libc/malloc_debug/
MapData.h 40 MapEntry(uintptr_t start, uintptr_t end, uintptr_t offset, const char* name, size_t name_len, int flags)
41 : start(start), end(end), offset(offset), name(name, name_len), flags(flags) {}
43 explicit MapEntry(uintptr_t pc) : start(pc), end(pc) {}
46 uintptr_t end; member in struct:MapEntry
58 bool operator()(const MapEntry* a, const MapEntry* b) const { return a->end <= b->start; }
  /bionic/tests/
sys_prctl_test.cpp 53 uintptr_t end; local
54 ASSERT_EQ(2, sscanf(lines[i].c_str(), "%" SCNxPTR "-%" SCNxPTR " ", &start, &end))
59 last_end = end;
  /cts/common/device-side/util/src/com/android/compatibility/common/util/
TextUtils.java 34 final Pattern end = Pattern.compile(extractionEndRegex); local
54 if (end.matcher(line).matches()) {
  /cts/common/device-side/util-axt/src/com/android/compatibility/common/util/
TextUtils.java 34 final Pattern end = Pattern.compile(extractionEndRegex); local
54 if (end.matcher(line).matches()) {
  /cts/suite/audio_quality/lib/src/task/
TaskSequential.cpp 57 std::list<TaskGeneric*>::iterator end = getChildren().end(); local
58 for (; i != end; i++) {
95 it = std::find(mAsyncTasks.begin(), mAsyncTasks.end(), task);
96 if (it != mAsyncTasks.end()) { // already queued
106 std::list<TaskAsync*>::iterator end = mAsyncTasks.end(); local
109 for (; i != end; i++) {
  /cts/tests/openglperf2/jni/primitive/
GLPrimitive.cpp 65 // Records the end time.
66 double end = GLUtils::currentTimeMillis(); local
69 double times[] = {start, end};
  /cts/tests/security/src/android/keystore/cts/
CertificateUtils.java 41 Date end = new Date(now + millisPerDay); local
54 end,
  /cts/tests/tests/os/jni/
android_os_cts_NoExecutePermissionTest.cpp 36 uintptr_t end; local
38 int scan = sscanf(line, "%" SCNxPTR "-%" SCNxPTR " %9s ", &start, &end, permissions);
39 if ((scan == 3) && (start <= address) && (address < end)) {
  /cts/tests/tests/os/src/android/os/cts/
SystemClockTest.java 28 long end = SystemClock.currentThreadTimeMillis(); local
29 assertFalse(end - 100 >= start);
37 long end = SystemClock.elapsedRealtime(); local
38 assertTrue(end - 100 >= start);
55 long end = SystemClock.currentThreadTimeMillis(); local
56 assertFalse(end - 100 >= start);
60 end = SystemClock.elapsedRealtime();
61 assertTrue(end - 100 >= start);
65 end = SystemClock.uptimeMillis();
66 assertTrue(end - 100 >= start)
74 long end = SystemClock.uptimeMillis(); local
    [all...]
  /dalvik/dx/tests/131-perf/
ClassGen.java 9 int end = 8024; local
16 end = Integer.parseInt(args[1]);
25 for (int file = start; file <= end; file++) {
34 pw.println(" boolean m" + method + "_" + (file%(end/2)) + "() {"
40 + "() \" + Clazz" + (end-file+1) + ".f1);");
  /dalvik/libdex/
DexCatch.cpp 68 u4 end = start + pTry->insnCount; local
70 if (address >= end) {
83 /* Get the handler offset just past the end of the one just iterated over.
DexOptData.cpp 28 * pointer into the given memory range (from start inclusive to end
31 static bool isValidPointer(const void* ptr, const void* start, const void* end)
33 return (ptr >= start) && (ptr < end) && (((uintptr_t) ptr & 7) == 0);
40 const u1* end = (const u1*) pOptHeader + local
45 return (u4) adler32(adler, start, end - start);
70 ALOGE("Unaligned opt data area end");
83 /* Process chunks until we see the end marker. */
  /development/vndk/tools/header-checker/src/repr/json/
ir_reader.h 102 Iterator end() const { return Iterator(array_, ok_, array_.size()); } function in class:header_checker::repr::JsonArrayRef
  /development/vndk/tools/header-checker/src/utils/
collect_exported_headers.cpp 52 // Default construction - end of directory.
53 llvm::sys::fs::recursive_directory_iterator end; local
54 for ( ; walker != end; walker.increment(ec)) {
string_utils.cpp 33 std::string::size_type end = s.find_last_not_of(" \t\r\n"); local
34 if (end == std::string::npos) {
37 return s.substr(start, end - start + 1);
62 std::string::size_type end = s.find_first_of(delim_chars, pos + 1); local
63 if (end == std::string::npos) {
68 res.push_back(s.substr(pos, end - pos));
69 pos = end + 1;
93 std::transform(value.begin(), value.end(), value.begin(), std::tolower);
  /device/generic/goldfish/ril/
at_tok.c 111 char *end; local
114 l = strtoul(ret, &end, base);
116 l = strtol(ret, &end, base);
120 if (end == ret) {

Completed in 1417 milliseconds

1 2 3 4 5 67 8 91011>>