Searched defs:end1 (Results 1 - 25 of 28) sorted by relevance

12

/external/compiler-rt/test/asan/TestCases/
H A Dgc-test.cc31 void *beg1, *end1; local
34 __asan_addr_is_in_fake_stack(fake_stack, ptr, &beg1, &end1);
37 assert(end == end1);
/external/speex/libspeex/
H A Dbuffer.c71 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
134 int end, end1; local
[all...]
/external/clang/test/OpenMP/
H A Dfor_loop_messages.cpp537 Iter1 begin1, end1; local
542 for (Iter1 I = begin1; I < end1; ++I)
548 for (Iter1 I = begin1; I >= end1; ++I)
556 for (Iter1 I; I < end1; ++I) {
H A Dfor_simd_loop_messages.cpp536 Iter1 begin1, end1; local
541 for (Iter1 I = begin1; I < end1; ++I)
547 for (Iter1 I = begin1; I >= end1; ++I)
555 for (Iter1 I; I < end1; ++I) {
H A Dparallel_for_loop_messages.cpp462 Iter1 begin1, end1; local
466 for (Iter1 I = begin1; I < end1; ++I)
471 for (Iter1 I = begin1; I >= end1; ++I)
478 for (Iter1 I; I < end1; ++I) {
H A Dparallel_for_simd_loop_messages.cpp462 Iter1 begin1, end1; local
466 for (Iter1 I = begin1; I < end1; ++I)
471 for (Iter1 I = begin1; I >= end1; ++I)
478 for (Iter1 I; I < end1; ++I) {
H A Dsimd_loop_messages.cpp449 Iter1 begin1, end1; local
453 for (Iter1 I = begin1; I < end1; ++I)
458 for (Iter1 I = begin1; I >= end1; ++I)
466 for (Iter1 I; I < end1; ++I) {
/external/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp330 BasicBlock::iterator end1 = Block1->getTerminator(); local
335 if (iter1 == end1) {
/external/expat/lib/
H A Dxmltok_impl.c1687 const char *end1, const char *ptr2)
1690 if (ptr1 == end1)
1695 return ptr1 == end1;
1686 nameMatchesAscii(const ENCODING *enc, const char *ptr1, const char *end1, const char *ptr2) argument
/external/wpa_supplicant_8/hostapd/src/wps/
H A Dhttpread.c102 int end1 = 0; local
111 end1 = !isgraph(c1);
113 if (end1 || end2 || c1 != c2)
116 return end1 && end2; /* reached end of both words? */
H A Dwps_upnp_ssdp.c42 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/wpa_supplicant_8/src/wps/
H A Dhttpread.c102 int end1 = 0; local
111 end1 = !isgraph(c1);
113 if (end1 || end2 || c1 != c2)
116 return end1 && end2; /* reached end of both words? */
H A Dwps_upnp_ssdp.c42 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/wpa_supplicant_8/wpa_supplicant/src/wps/
H A Dhttpread.c102 int end1 = 0; local
111 end1 = !isgraph(c1);
113 if (end1 || end2 || c1 != c2)
116 return end1 && end2; /* reached end of both words? */
H A Dwps_upnp_ssdp.c42 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/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_posix.cc279 static inline bool IntervalsAreSeparate(uptr start1, uptr end1, argument
281 CHECK(start1 <= end1);
283 return (end1 < start2) || (end2 < start1);
/external/skia/src/pathops/
H A DSkPathOpsCubic.cpp156 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;
H A DSkPathOpsTSect.h2033 const SkDPoint& end1 = sect1->fCurve[TCurve::kPointLast]; local
2035 double t = tail1->closestBoundedT(end1);
2036 if (sect2->fCurve.ptAtT(t).approximatelyEqual(end1)) {
2037 intersections->insert(1, t, end1);
/external/toybox/toys/pending/
H A Ddiff.c516 start1, end1, start2, end2; local
605 end1 = (start1 == 1) ? -1 : start1;
610 if (end1 != -1) printf(",%ld ", ptr2->prev-ptr1->suff + 1);
/external/llvm/lib/Support/
H A Dregcomp.c492 * Giving end1 as OUT essentially eliminates the end1/end2 check.
502 int end1, /* first terminating character */
514 while (MORE() && !SEETWO(end1, end2)) {
501 p_bre(struct parse *p, int end1, int end2) argument
/external/opencv/cvaux/include/
H A Dcvvidsurv.hpp1204 int end1,end2; member in struct:CvTracksTimePos
/external/valgrind/coregrind/m_aspacemgr/
H A Daspacemgr-linux.c2724 Addr end1 = start + length - 1; local
2728 Addr end2 = end1;
2759 seg.end = end1;
/external/valgrind/coregrind/m_debuginfo/
H A Dstorage.c1633 Addr sta1, sta2, end1, end2, toc1, toc2; local
1778 end1 = sta1 + di->symtab[i].size - 1;
1796 end1 = sta2 - 1;
1799 if (end1 > end2) {
1801 SWAP(Addr,sta1,sta2); SWAP(Addr,end1,end2); SWAP(Addr,toc1,toc2);
1805 if (end1 < end2) {
1806 sta2 = end1 + 1;
1808 /* end1 == end2. Identical addr ranges. We'll eventually wind
1813 di->symtab[i].size = end1 - sta1 + 1;
/external/valgrind/memcheck/
H A Dmc_leakcheck.c1744 Addr end1 = ch1->data + ch1->szB - 1; local
1749 if (end1 < start2) {
1753 //} else if (start1 == start2 && end1 == end2) {
1756 } else if (start1 >= start2 && end1 <= end2 && isCustom1 && !isCustom2) {
1764 } else if (start2 >= start1 && end2 <= end1 && isCustom2 && !isCustom1) {
1774 start1, end1, start2, end2);
/external/opencv/cvaux/src/
H A Dcvepilines.cpp1854 CvPoint2D64d start1,end1; local
1858 &start1,&end1,&res);
1866 &start1,&end1,&res);

Completed in 566 milliseconds

12