HomeSort by relevance Sort by last modified time
    Searched refs:end1 (Results 1 - 25 of 61) sorted by null

1 2 3

  /bionic/libc/arch-mips/string/
memcmp.c 33 const unsigned char* end1 = p1 + n; local
38 if (d || p1 >= end1) break;
41 if (d || p1 >= end1) break;
44 if (d || p1 >= end1) break;
47 if (d || p1 >= end1) break;
  /external/speex/libspeex/
buffer.c 71 int end1; local
79 end1 = end;
80 if (end1 > st->size)
81 end1 = st->size;
82 SPEEX_COPY(st->data + st->write_ptr, data, end1 - st->write_ptr);
86 SPEEX_COPY(st->data, data+end1 - st->write_ptr, end);
105 int end1; local
111 end1 = end;
112 if (end1 > st->size)
113 end1 = st->size
134 int end, end1; local
    [all...]
  /external/webrtc/webrtc/system_wrappers/source/
logging.cc 37 const char* end1 = ::strrchr(file, '/'); local
39 if (!end1 && !end2)
42 return (end1 > end2) ? end1 + 1 : end2 + 1;
  /external/compiler-rt/test/asan/TestCases/Posix/
gc-test.cc 31 void *beg1, *end1; local
34 __asan_addr_is_in_fake_stack(fake_stack, ptr, &beg1, &end1);
37 assert(end == end1);
  /external/opencv3/modules/core/include/opencv2/core/cuda/
warp.hpp 95 static __device__ __forceinline__ OutIt transform(InIt1 beg1, InIt1 end1, InIt2 beg2, OutIt out, BinOp op)
101 for(; t1 < end1; t1 += STRIDE, t2 += STRIDE, out += STRIDE)
block.hpp 120 static __device__ __forceinline__ void transfrom(InIt1 beg1, InIt1 end1, InIt2 beg2, OutIt out, BinOp op)
127 for(; t1 < end1; t1 += STRIDE, t2 += STRIDE, o += STRIDE)
  /external/opencv3/modules/cudev/include/opencv2/cudev/block/
block.hpp 118 __device__ __forceinline__ static void blockTransfrom(InIt1 beg1, InIt1 end1, InIt2 beg2, OutIt out, const BinOp& op)
125 for(; t1 < end1; t1 += STRIDE, t2 += STRIDE, o += STRIDE)
  /external/opencv3/modules/cudev/include/opencv2/cudev/warp/
warp.hpp 102 __device__ __forceinline__ OutIt warpTransform(InIt1 beg1, InIt1 end1, InIt2 beg2, OutIt out, const BinOp& op)
108 for(; t1 < end1; t1 += WARP_SIZE, t2 += WARP_SIZE, out += WARP_SIZE)
  /external/libchrome/base/files/
file_util.cc 107 std::string::size_type end1 = line1.find_last_not_of("\r\n"); local
108 if (end1 == std::string::npos)
110 else if (end1 + 1 < line1.length())
111 line1.erase(end1 + 1);
  /external/webrtc/webrtc/modules/desktop_capture/
desktop_region.cc 181 Rows::const_iterator end1 = region1.rows_.end(); local
184 if (it1 == end1 || it2 == end2)
187 while (it1 != end1 && it2 != end2) {
191 std::swap(end1, end2);
230 RowSpanSet::const_iterator end1 = set1.end(); local
233 assert(it1 != end1 && it2 != end2);
239 std::swap(end1, end2);
260 } while (it1 != end1 && it2 != end2);
  /libcore/dalvik/src/test/java/dalvik/system/profiler/
SamplingProfilerTest.java 140 ThreadEvent end1 = ThreadEvent.end(threadId); local
141 hprofData.addThreadEvent(end1);
142 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
151 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_posix.cc 240 static inline bool IntervalsAreSeparate(uptr start1, uptr end1,
242 CHECK(start1 <= end1);
244 return (end1 < start2) || (end2 < start1);
  /external/skia/src/pathops/
SkOpSpan.h 111 SkOpPtT* end1 = s1->fT < e1->fT ? e1 : s1; local
114 : between(s2->fT, end1->fT, e2->fT) ? end1 : nullptr;
116 SkASSERT(start1->fT >= end2->fT || start2->fT >= end1->fT);
SkPathOpsCubic.cpp 156 int end1 = hullOrder[0]; local
159 endPt[0] = &fPts[end1];
168 int oddManMask = other_two(end1, end2);
169 int oddMan = end1 ^ oddManMask;
195 end1 = end2;
  /external/webrtc/webrtc/base/
logging.cc 53 const char* end1 = ::strrchr(file, '/'); local
55 if (!end1 && !end2)
58 return (end1 > end2) ? end1 + 1 : end2 + 1;
  /external/expat/lib/
xmltok.h 237 #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \
238 (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2))
  /external/clang/test/OpenMP/
for_loop_messages.cpp 552 Iter1 begin1, end1; local
557 for (Iter1 I = begin1; I < end1; ++I)
563 for (Iter1 I = begin1; I >= end1; ++I)
571 for (Iter1 I; I < end1; ++I) {
for_simd_loop_messages.cpp 533 Iter1 begin1, end1; local
538 for (Iter1 I = begin1; I < end1; ++I)
544 for (Iter1 I = begin1; I >= end1; ++I)
552 for (Iter1 I; I < end1; ++I) {
parallel_for_loop_messages.cpp 458 Iter1 begin1, end1; local
462 for (Iter1 I = begin1; I < end1; ++I)
467 for (Iter1 I = begin1; I >= end1; ++I)
474 for (Iter1 I; I < end1; ++I) {
parallel_for_simd_loop_messages.cpp 459 Iter1 begin1, end1; local
463 for (Iter1 I = begin1; I < end1; ++I)
468 for (Iter1 I = begin1; I >= end1; ++I)
475 for (Iter1 I; I < end1; ++I) {
simd_loop_messages.cpp 446 Iter1 begin1, end1; local
450 for (Iter1 I = begin1; I < end1; ++I)
455 for (Iter1 I = begin1; I >= end1; ++I)
463 for (Iter1 I; I < end1; ++I) {
taskloop_loop_messages.cpp 553 Iter1 begin1, end1; local
558 for (Iter1 I = begin1; I < end1; ++I)
564 for (Iter1 I = begin1; I >= end1; ++I)
572 for (Iter1 I; I < end1; ++I) {
  /external/wpa_supplicant_8/src/wps/
httpread.c 102 int end1 = 0; local
111 end1 = !isgraph(c1);
113 if (end1 || end2 || c1 != c2)
116 return end1 && end2; /* reached end of both words? */
wps_upnp_ssdp.c 42 int end1 = 0; local
51 end1 = !(isalnum(c1) || c1 == '_' || c1 == '-');
53 if (end1 || end2 || c1 != c2)
56 return end1 && end2; /* reached end of both words? */
  /external/llvm/lib/Transforms/Utils/
FlattenCFG.cpp 329 BasicBlock::iterator end1 = Block1->getTerminator()->getIterator(); local
334 if (iter1 == end1) {

Completed in 2001 milliseconds

1 2 3