/external/speex/libspeex/ |
H A D | 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 134 int end, end1; local [all...] |
/external/oprofile/libutil++/ |
H A D | 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 ! [all...] |
H A D | child_reader.h | 95 ssize_t end1; member in class:child_reader
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_posix.cc | 94 static inline bool IntervalsAreSeparate(uptr start1, uptr end1, argument 96 CHECK(start1 <= end1); 98 return (end1 < start2) || (end2 < start1);
|
/external/oprofile/libpp/ |
H A D | 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)
|
H A D | arrange_profiles.cpp | 138 vector<profile_class>::const_iterator end1 = v.end(); local 141 while (it1 != end1) {
|
/external/astl/include/ |
H A D | algorithm | 254 // @param end1 An input iterator. 262 inline bool equal(_InputIterator1 begin1, _InputIterator1 end1, 265 for (; begin1 < end1; ++begin1, ++begin2) 277 // @param end1 An input iterator. 282 inline bool equal(_InputIterator1 begin1, _InputIterator1 end1, 285 for (; begin1 < end1; ++begin1, ++begin2)
|
/external/chromium/chrome/browser/sync/engine/ |
H A D | syncer.h | 146 bool SortedCollectionsIntersect(Iterator1 begin1, Iterator1 end1, argument 150 while (i1 != end1 && i2 != end2) {
|
/external/chromium/base/ |
H A D | file_util.cc | 134 std::string::size_type end1 = line1.find_last_not_of("\r\n"); local 135 if (end1 == std::string::npos) 137 else if (end1 + 1 < line1.length()) 138 line1.erase(end1 + 1);
|
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | logging.cc | 383 const char* end1 = ::strrchr(file, '/'); local 385 if (!end1 && !end2) 388 return (end1 > end2) ? end1 + 1 : end2 + 1;
|
/external/wpa_supplicant_6/wpa_supplicant/src/wps/ |
H A D | httpread.c | 120 int end1 = 0; local 129 end1 = !isgraph(c1); 131 if (end1 || end2 || c1 != c2) 134 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 40 int end1 = 0; local 49 end1 = !(isalnum(c1) || c1 == '_' || c1 == '-'); 51 if (end1 || end2 || c1 != c2) 54 return end1 && end2; /* reached end of both words? */
|
/external/wpa_supplicant_8/hostapd/src/wps/ |
H A D | httpread.c | 114 int end1 = 0; local 123 end1 = !isgraph(c1); 125 if (end1 || end2 || c1 != c2) 128 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 39 int end1 = 0; local 48 end1 = !(isalnum(c1) || c1 == '_' || c1 == '-'); 50 if (end1 || end2 || c1 != c2) 53 return end1 && end2; /* reached end of both words? */
|
/external/wpa_supplicant_8/src/wps/ |
H A D | httpread.c | 114 int end1 = 0; local 123 end1 = !isgraph(c1); 125 if (end1 || end2 || c1 != c2) 128 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 39 int end1 = 0; local 48 end1 = !(isalnum(c1) || c1 == '_' || c1 == '-'); 50 if (end1 || end2 || c1 != c2) 53 return end1 && end2; /* reached end of both words? */
|
/external/wpa_supplicant_8/wpa_supplicant/src/wps/ |
H A D | httpread.c | 114 int end1 = 0; local 123 end1 = !isgraph(c1); 125 if (end1 || end2 || c1 != c2) 128 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 39 int end1 = 0; local 48 end1 = !(isalnum(c1) || c1 == '_' || c1 == '-'); 50 if (end1 || end2 || c1 != c2) 53 return end1 && end2; /* reached end of both words? */
|
/external/expat/lib/ |
H A D | xmltok.h | 231 #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \ 232 (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2))
|
H A D | xmltok_impl.c | 1687 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/quake/quake/src/WinQuake/ |
H A D | sys_linux.cpp | 112 static char end1[] = 126 printf("%s", end1);
|
/external/valgrind/main/memcheck/ |
H A D | mc_leakcheck.c | 1139 Addr end1 = ch1->data + ch1->szB - 1; local 1144 if (end1 < start2) { 1148 //} else if (start1 == start2 && end1 == end2) { 1151 } else if (start1 >= start2 && end1 <= end2 && isCustom1 && !isCustom2) { 1159 } else if (start2 >= start1 && end2 <= end1 && isCustom2 && !isCustom1) { 1169 start1, end1, start2, end2);
|
/external/valgrind/main/coregrind/m_debuginfo/ |
H A D | storage.c | 1335 Addr sta1, sta2, end1, end2, toc1, toc2; local 1431 end1 = sta1 + di->symtab[i].size - 1; 1447 end1 = sta2 - 1; 1450 if (end1 > end2) { 1452 SWAP(Addr,sta1,sta2); SWAP(Addr,end1,end2); SWAP(Addr,toc1,toc2); 1456 if (end1 < end2) { 1457 sta2 = end1 + 1; 1459 /* end1 == end2. Identical addr ranges. We'll eventually wind 1464 di->symtab[i].size = end1 - sta1 + 1;
|
/external/llvm/lib/Support/ |
H A D | regcomp.c | 456 * Giving end1 as OUT essentially eliminates the end1/end2 check. 466 int end1, /* first terminating character */ 478 while (MORE() && !SEETWO(end1, end2)) { 465 p_bre(struct parse *p, int end1, int end2) argument
|
/external/valgrind/main/coregrind/m_aspacemgr/ |
H A D | aspacemgr-linux.c | 2796 Addr end1 = start + length - 1; local 2800 Addr end2 = end1; 2831 seg.end = end1;
|