/bionic/libc/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;
|
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
algobase.h | 55 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, 57 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2); } 63 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, 65 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); } 71 mismatch_switch(InputIterator1 begin1, InputIterator1 end1, 74 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); } 80 mismatch_switch(RandomAccessIterator1 begin1, RandomAccessIterator1 end1, 87 __gnu_parallel::find_template(begin1, end1, begin2, pred, 93 return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); 99 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2 [all...] |
find_selectors.h | 65 * @param end1 End iterator of first sequence. 73 RandomAccessIterator1 end1, 75 { return std::make_pair(find_if(begin1, end1, pred, 98 * @param end1 End iterator of first sequence. 106 RandomAccessIterator1 end1, 110 RandomAccessIterator1 spot = adjacent_find(begin1, end1 + 1, 112 if (spot == (end1 + 1)) 113 spot = end1; 136 * @param end1 End iterator of first sequence. 144 RandomAccessIterator1 end1, [all...] |
merge.h | 46 * @param end1 End iterator of first sequence. 58 RandomAccessIterator1 end1, 64 while (begin1 != end1 && begin2 != end2 && max_length > 0) 74 if (begin1 != end1) 95 * @param end1 End iterator of first sequence. 107 RandomAccessIterator1 end1, 123 while (begin1 != end1 && begin2 != end2 && max_length > 0) 143 if (begin1 != end1) 163 * @param end1 End iterator of first sequence. 174 merge_advance(RandomAccessIterator1& begin1, RandomAccessIterator1 end1, [all...] |
search.h | 73 * @param end1 End iterator of first sequence. 82 search_template(_RandomAccessIterator1 begin1, _RandomAccessIterator1 end1, 89 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2)); 95 return end1; 98 difference_type input_length = (end1 - begin1) - pattern_length; 101 difference_type result = (end1 - begin1); 106 return end1;
|
find.h | 48 * @param end1 End iterator of first sequence. 60 find_template(RandomAccessIterator1 begin1, RandomAccessIterator1 end1, 66 return find_template(begin1, end1, begin2, pred, selector, 69 return find_template(begin1, end1, begin2, pred, selector, 72 return find_template(begin1, end1, begin2, pred, selector, 85 * @param end1 End iterator of first sequence. 98 RandomAccessIterator1 end1, 104 _GLIBCXX_CALL(end1 - begin1) 110 difference_type length = end1 - begin1; 167 * @param end1 End iterator of first sequence [all...] |
set_operations.h | 354 parallel_set_operation(InputIterator begin1, InputIterator end1, 358 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2)) 364 if (begin1 == end1) 368 return op.second_empty(begin1, end1, result); 370 const difference_type size = (end1 - begin1) + (end2 - begin2); 373 { std::make_pair(begin1, end1), std::make_pair(begin2, end2) } ; 381 std::min(end1 - begin1, end2 - begin2)); 456 block_begin.first, end1, block_begin.second, end2, r); 477 parallel_set_union(InputIterator begin1, InputIterator end1, 481 return parallel_set_operation(begin1, end1, begin2, end2, result [all...] |
algo.h | 213 find_first_of(InputIterator begin1, InputIterator end1, 216 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2); } 222 find_first_of(InputIterator begin1, InputIterator end1, 225 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2, comp); } 231 find_first_of_switch(InputIterator begin1, InputIterator end1, 234 { return find_first_of(begin1, end1, begin2, end2, 242 RandomAccessIterator end1, 248 find_template(begin1, end1, begin1, comp, 258 find_first_of_switch(InputIterator begin1, InputIterator end1, 261 { return find_first_of(begin1, end1, begin2, end2, comp, [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/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/icu4c/tools/genprops/misc/ |
ucdmerge.c | 55 char *end1, *end2; local 63 end1=endOfData(l1); 67 length=end1-l1;
|
/external/icu4c/tools/genprops/ |
ucdmerge.c | 55 char *end1, *end2; local 63 end1=endOfData(l1); 67 length=end1-l1;
|
/external/chromium/chrome/browser/sync/engine/ |
syncer.h | 146 bool SortedCollectionsIntersect(Iterator1 begin1, Iterator1 end1, 150 while (i1 != end1 && i2 != end2) {
|
/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/astl/include/ |
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)
|
/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/chromium/base/ |
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/ |
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/ |
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? */
|
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/src/wps/ |
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? */
|
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/ |
xmltok.h | 231 #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \ 232 (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2))
|
/external/quake/quake/src/WinQuake/ |
sys_linux.cpp | 112 static char end1[] = 126 printf("%s", end1);
|