HomeSort by relevance Sort by last modified time
    Searched full:end2 (Results 1 - 25 of 78) sorted by null

1 2 3 4

  /external/oprofile/libutil++/
child_reader.cpp 31 pos2(0), end2(0),
140 if (end2 >= sz_buf2) {
145 ssize_t temp = read(fd2, buf2 + end2, sz_buf2 - end2);
147 end2 += temp;
151 bool ret = !(end1 == 0 && end2 == 0);
155 if (end2 == -1)
156 end2 = 0;
171 int temp = end2;
194 if (ok && temp != end2)
    [all...]
child_reader.h 97 ssize_t end2; member in class:child_reader
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
algobase.h 163 InputIterator2 begin2, InputIterator2 end2,
166 begin2, end2); }
173 InputIterator2 begin2, InputIterator2 end2,
176 begin2, end2, pred); }
183 InputIterator2 begin2, InputIterator2 end2,
186 begin2, end2, pred); }
196 RandomAccessIterator2 end2, Predicate pred,
212 if ((end1 - begin1) < (end2 - begin2))
227 pair_type mm = mismatch_switch(begin2, end2, begin1,
232 return (mm.first != end2) && bool(pred(*mm.second, *mm.first))
    [all...]
merge.h 48 * @param end2 End iterator of second sequence.
60 RandomAccessIterator2 end2, OutputIterator target,
64 while (begin1 != end1 && begin2 != end2 && max_length > 0)
97 * @param end2 End iterator of second sequence.
109 RandomAccessIterator2 end2,
123 while (begin1 != end1 && begin2 != end2 && max_length > 0)
165 * @param end2 End iterator of second sequence.
175 RandomAccessIterator2& begin2, RandomAccessIterator2 end2,
181 return merge_advance_movc(begin1, end1, begin2, end2, target,
190 * @param end2 End iterator of second sequence
    [all...]
algo.h 214 ForwardIterator begin2, ForwardIterator end2,
216 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2); }
223 ForwardIterator begin2, ForwardIterator end2,
225 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2, comp); }
232 ForwardIterator begin2, ForwardIterator end2,
234 { return find_first_of(begin1, end1, begin2, end2,
243 ForwardIterator begin2, ForwardIterator end2,
250 <ForwardIterator>(begin2, end2)).first;
259 ForwardIterator begin2, ForwardIterator end2,
261 { return find_first_of(begin1, end1, begin2, end2, comp,
    [all...]
set_operations.h 355 InputIterator begin2, InputIterator end2,
358 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2))
365 return op.first_empty(begin2, end2, result);
367 if (begin2 == end2)
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));
408 if (offset[ 0 ] != begin1 && offset[ 1 ] != end2
456 block_begin.first, end1, block_begin.second, end2, r);
478 InputIterator begin2, InputIterator end2,
    [all...]
search.h 75 * @param end2 End iterator of second sequence.
83 _RandomAccessIterator2 begin2, _RandomAccessIterator2 end2,
89 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2));
91 difference_type pattern_length = end2 - begin2;
  /external/icu4c/tools/genprops/misc/
ucdmerge.c 55 char *end1, *end2; local
64 end2=endOfData(l2);
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
  /external/icu4c/tools/genprops/
ucdmerge.c 55 char *end1, *end2; local
64 end2=endOfData(l2);
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
  /external/oprofile/libpp/
diff_container.cpp 130 symbol_container::symbols_t::iterator end2 = pc2.end_symbol(); local
132 while (it1 != end1 && it2 != end2) {
149 for (; it2 != end2; ++it2)
  /dalvik/dx/tests/032-bb-live-code/
blort.j 35 end2:
41 .catch java/lang/RuntimeException from start to end2 using handler2
54 end2:
60 .catch java/lang/RuntimeException from start to end2 using handler2
  /external/webkit/Source/WebCore/bindings/js/
JSDOMGlobalObject.cpp 61 JSDOMConstructorMap::iterator end2 = constructors().end(); local
62 for (JSDOMConstructorMap::iterator it2 = constructors().begin(); it2 != end2; ++it2)
  /libcore/dalvik/src/test/java/dalvik/system/profiler/
SamplingProfilerTest.java 134 ThreadEvent end2 = ThreadEvent.end(threadId+1); local
135 hprofData.addThreadEvent(end2);
136 assertEquals(Arrays.asList(start1, end2), hprofData.getThreadHistory());
142 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
151 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
  /external/chromium/base/
file_util.cc 140 std::string::size_type end2 = line2.find_last_not_of("\r\n"); local
141 if (end2 == std::string::npos)
143 else if (end2 + 1 < line2.length())
144 line2.erase(end2 + 1);
  /external/chromium/chrome/browser/sync/engine/
syncer.h 147 Iterator2 begin2, Iterator2 end2) {
150 while (i1 != end1 && i2 != end2) {
  /external/chromium/third_party/libjingle/source/talk/base/
logging.cc 384 const char* end2 = ::strrchr(file, '\\'); local
385 if (!end1 && !end2)
388 return (end1 > end2) ? end1 + 1 : end2 + 1;
  /external/collada/src/modules/STLDatabase/
daeSTLDatabase.cpp 474 vector< daeElement* >::iterator end2 = vec.end(); local
475 while( i != end2 )
632 vector< daeElement* >::iterator end2 = vec.end(); local
633 while( i != end2 )
  /frameworks/base/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/
armVCM4P10_InterpolateLuma_DiagCopy_unsafe_s.s 169 End2
  /frameworks/base/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p10/src/
armVCM4P10_InterpolateLuma_DiagCopy_unsafe_s.s 169 End2
  /external/chromium/chrome/browser/ui/cocoa/
about_window_controller.mm 695 NSRange* end2 = &end_oss;
702 end2 = &end_chr;
722 end2->location -
725 sub_str = [license substringWithRange:NSMakeRange(NSMaxRange(*end2),
727 NSMaxRange(*end2))];
  /external/libxml2/include/libxml/
parserInternals.h 493 xmlChar end2,
501 xmlChar end2,
591 xmlChar end2,
  /external/quake/quake/src/QW/progs/
files.dat 168 2 progs/end2.mdl
214 2 end2.bin
  /external/wpa_supplicant_6/wpa_supplicant/src/wps/
httpread.c 121 int end2 = 0; local
130 end2 = !isgraph(c2);
131 if (end1 || end2 || c1 != c2)
134 return end1 && end2; /* reached end of both words? */
wps_upnp_ssdp.c 41 int end2 = 0; local
50 end2 = !(isalnum(c2) || c2 == '_' || c2 == '-');
51 if (end1 || end2 || c1 != c2)
54 return end1 && end2; /* reached end of both words? */
  /external/wpa_supplicant_8/src/wps/
httpread.c 121 int end2 = 0; local
130 end2 = !isgraph(c2);
131 if (end1 || end2 || c1 != c2)
134 return end1 && end2; /* reached end of both words? */

Completed in 469 milliseconds

1 2 3 4