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

1 2 3

  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
equ-expand.asm 2 end1: label
4 line_out equ end1+258 ;length = 1 + 263
5 real_end equ end1+258+264
8 cmp bx,((end1+258+264)-(end1+258))/4
9 cmp bx,(end1+258+264-end1-258)/4
  /bionic/libc/bionic/
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/chromium_org/third_party/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/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/chromium_org/third_party/webrtc/system_wrappers/source/
logging.cc 36 const char* end1 = ::strrchr(file, '/'); local
38 if (!end1 && !end2)
41 return (end1 > end2) ? end1 + 1 : end2 + 1;
  /external/oprofile/libutil++/
child_reader.cpp 30 pos1(0), end1(0),
134 end1 = temp;
136 end1 = 0;
151 bool ret = !(end1 == 0 && end2 == 0);
153 if (end1 == -1)
154 end1 = 0;
172 if (pos1 >= end1) {
179 while (temp_pos < end1 && ok) {
188 if (!ok || !end1)
201 return end1 != 0 || result.length() != 0
    [all...]
child_reader.h 95 ssize_t end1; member in class:child_reader
  /external/compiler-rt/test/asan/TestCases/
gc-test.cc 27 void *beg1, *end1; local
30 __asan_addr_is_in_fake_stack(fake_stack, ptr, &beg1, &end1);
33 assert(end == end1);
  /external/chromium_org/extensions/common/permissions/
base_set_operators.h 126 const_iterator end1 = end(); local
129 while (it1 != end1 && it2 != end2) {
151 const const_iterator end1 = set1.end(); local
154 while (it1 != end1 && it2 != end2) {
169 while (it1 != end1) {
181 const const_iterator end1 = set1.end(); local
184 while (it1 != end1 && it2 != end2) {
205 const const_iterator end1 = set1.end(); local
209 if (it1 == end1) {
217 while (it1 != end1) {
    [all...]
  /external/oprofile/libpp/
diff_container.cpp 128 symbol_container::symbols_t::iterator end1 = pc1.end_symbol(); local
132 while (it1 != end1 && it2 != end2) {
146 for (; it1 != end1; ++it1)
  /external/chromium_org/base/files/
file_util.cc 111 std::string::size_type end1 = line1.find_last_not_of("\r\n"); local
112 if (end1 == std::string::npos)
114 else if (end1 + 1 < line1.length())
115 line1.erase(end1 + 1);
  /external/chromium_org/third_party/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);
  /external/chromium_org/ui/views/widget/
root_view_unittest.cc 212 ui::GestureEvent end1(
214 details = root_view->OnEventFromSource(&end1);
297 ui::GestureEvent end1(
299 details = root_view->OnEventFromSource(&end1);
  /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 221 static inline bool IntervalsAreSeparate(uptr start1, uptr end1,
223 CHECK(start1 <= end1);
225 return (end1 < start2) || (end2 < start1);
  /external/wpa_supplicant_8/src/wps/
httpread.c 112 int end1 = 0; local
121 end1 = !isgraph(c1);
123 if (end1 || end2 || c1 != c2)
126 return end1 && end2; /* reached end of both words? */
  /external/chromium_org/third_party/expat/files/lib/
xmltok.h 231 #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \
232 (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2))
  /external/expat/lib/
xmltok.h 231 #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \
232 (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2))
  /external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticIntersection.cpp 330 double end1 = i.fCoincidentT[0][cIndex + 1]; local
333 xy_at_t(q1, end1, ends1[1].x, ends1[1].y);
348 if (approximately_less_than_zero(start1) || approximately_less_than_zero(end1)) {
350 } else if (approximately_greater_than_one(start1) || approximately_greater_than_one(end1)) {
353 start1 = (start1 + end1) / 2;
  /external/skia/experimental/Intersection/
QuadraticIntersection.cpp 330 double end1 = i.fCoincidentT[0][cIndex + 1]; local
333 xy_at_t(q1, end1, ends1[1].x, ends1[1].y);
348 if (approximately_less_than_zero(start1) || approximately_less_than_zero(end1)) {
350 } else if (approximately_greater_than_one(start1) || approximately_greater_than_one(end1)) {
353 start1 = (start1 + end1) / 2;
  /external/chromium_org/net/disk_cache/blockfile/
rankings.h 180 // Walks a list in the desired direction until the nodes |end1| or |end2| are
183 int CheckListSection(List list, Addr end1, Addr end2, bool forward,
  /external/chromium_org/third_party/webrtc/base/
logging.cc 388 const char* end1 = ::strrchr(file, '/'); local
390 if (!end1 && !end2)
393 return (end1 > end2) ? end1 + 1 : end2 + 1;
  /external/clang/test/OpenMP/
for_loop_messages.cpp 502 Iter1 begin1, end1; local
505 for (Iter1 I = begin1; I < end1; ++I)
511 for (Iter1 I = begin1; I >= end1; ++I)
517 for (Iter1 I; I < end1; ++I) {
parallel_for_loop_messages.cpp 430 Iter1 begin1, end1; local
432 for (Iter1 I = begin1; I < end1; ++I)
437 for (Iter1 I = begin1; I >= end1; ++I)
442 for (Iter1 I; I < end1; ++I) {
simd_loop_messages.cpp 423 Iter1 begin1, end1; local
425 for (Iter1 I = begin1; I < end1; ++I)
430 for (Iter1 I = begin1; I >= end1; ++I)
435 for (Iter1 I; I < end1; ++I) {

Completed in 980 milliseconds

1 2 3