/external/oprofile/libutil++/ |
H A D | child_reader.h | 97 ssize_t end2; member in class:child_reader
|
/external/webkit/Source/WebCore/bindings/js/ |
H A D | JSDOMGlobalObject.cpp | 61 JSDOMConstructorMap::iterator end2 = constructors().end(); local 62 for (JSDOMConstructorMap::iterator it2 = constructors().begin(); it2 != end2; ++it2)
|
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_suppressions.cc | 99 const char *end2 = end; local 100 while (line != end2 && (end2[-1] == ' ' || end2[-1] == '\t')) 101 end2--; 127 s->templ = (char*)internal_alloc(MBlockSuppression, end2 - line + 1); 128 internal_memcpy(s->templ, line, end2 - line); 129 s->templ[end2 - line] = 0;
|
/external/oprofile/libpp/ |
H A D | 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)
|
/external/chromium/chrome/browser/sync/engine/ |
H A D | syncer.h | 147 Iterator2 begin2, Iterator2 end2) { 150 while (i1 != end1 && i2 != end2) { 146 SortedCollectionsIntersect(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, Iterator2 end2) argument
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_posix.cc | 141 uptr start2, uptr end2) { 143 CHECK(start2 <= end2); 144 return (end1 < start2) || (end2 < start1); 140 IntervalsAreSeparate(uptr start1, uptr end1, uptr start2, uptr end2) argument
|
/external/chromium/base/ |
H A D | 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/oprofile/pp/ |
H A D | opreport.cpp | 553 list<inverted_profile>::iterator const end2 = iprofiles2.end(); member in class:__anon10835::list 555 for (; it2 != end2; ++it2)
|
/external/webkit/Source/WebCore/loader/cache/ |
H A D | CachedResource.cpp | 442 HashCountedSet<CachedResourceClient*>::iterator end2 = m_clients.end(); local 443 for (HashCountedSet<CachedResourceClient*>::iterator it = m_clients.begin(); it != end2; ++it) {
|
/external/wpa_supplicant_8/hostapd/src/wps/ |
H A D | httpread.c | 115 int end2 = 0; local 124 end2 = !isgraph(c2); 125 if (end1 || end2 || c1 != c2) 128 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 40 int end2 = 0; local 49 end2 = !(isalnum(c2) || c2 == '_' || c2 == '-'); 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 | 115 int end2 = 0; local 124 end2 = !isgraph(c2); 125 if (end1 || end2 || c1 != c2) 128 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 40 int end2 = 0; local 49 end2 = !(isalnum(c2) || c2 == '_' || c2 == '-'); 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 | 115 int end2 = 0; local 124 end2 = !isgraph(c2); 125 if (end1 || end2 || c1 != c2) 128 return end1 && end2; /* reached end of both words? */
|
H A D | wps_upnp_ssdp.c | 40 int end2 = 0; local 49 end2 = !(isalnum(c2) || c2 == '_' || c2 == '-'); 50 if (end1 || end2 || c1 != c2) 53 return end1 && end2; /* reached end of both words? */
|
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | logging.cc | 384 const char* end2 = ::strrchr(file, '\\'); local 385 if (!end1 && !end2) 388 return (end1 > end2) ? end1 + 1 : end2 + 1;
|
/external/icu4c/test/cintltst/ |
H A D | ncnvtst.c | 1901 UChar32 start, end, start2, end2, notStart, notEnd; member in struct:NameRange 2054 (nameRanges[i].start2>=0 && !uset_containsRange(set, nameRanges[i].start2, nameRanges[i].end2))
|
/external/llvm/lib/Support/ |
H A D | regcomp.c | 484 * Giving end1 as OUT essentially eliminates the end1/end2 check. 495 int end2) /* second terminating character */ 506 while (MORE() && !SEETWO(end1, end2)) { 493 p_bre(struct parse *p, int end1, int end2) argument
|
/external/valgrind/main/coregrind/m_debuginfo/ |
H A D | storage.c | 1345 Addr sta1, sta2, end1, end2, toc1, toc2; local 1456 end2 = sta2 + di->symtab[i+1].size - 1; 1467 if (end1 > end2) { 1468 sta1 = end2 + 1; 1469 SWAP(Addr,sta1,sta2); SWAP(Addr,end1,end2); SWAP(Addr,toc1,toc2); 1473 if (end1 < end2) { 1476 /* end1 == end2. Identical addr ranges. We'll eventually wind 1489 di->symtab[i+1].size = end2 - sta2 + 1;
|
/external/valgrind/main/memcheck/ |
H A D | mc_leakcheck.c | 1402 Addr end2 = ch2->data + ch2->szB - 1; local 1410 //} else if (start1 == start2 && end1 == end2) { 1413 } else if (start1 >= start2 && end1 <= end2 && isCustom1 && !isCustom2) { 1421 } else if (start2 >= start1 && end2 <= end1 && isCustom2 && !isCustom1) { 1431 start1, end1, start2, end2);
|
/external/opencv/cvaux/include/ |
H A D | cvvidsurv.hpp | 1204 int end1,end2; member in struct:CvTracksTimePos
|
/external/valgrind/main/coregrind/m_aspacemgr/ |
H A D | aspacemgr-linux.c | 2782 Addr end2 = end1; local 2785 if (extra > 0) end2 += extra; 2790 aspacem_assert(VG_IS_PAGE_ALIGNED(end2+1)); 2793 endI = find_nsegment_idx( end2 ); 2807 aspacem_assert(end2 <= nsegments[startI].end);
|
/external/libxml2/ |
H A D | parser.c | 2610 * @end2: an end marker xmlChar, 0 if none 2624 int what, xmlChar end, xmlChar end2, xmlChar end3) { 2662 (c != end2) && (c != end3)) { 2790 * @end2: an end marker xmlChar, 0 if none 2804 xmlChar end, xmlChar end2, xmlChar end3) { 2807 end, end2, end3)); 2623 xmlStringLenDecodeEntities(xmlParserCtxtPtr ctxt, const xmlChar *str, int len, int what, xmlChar end, xmlChar end2, xmlChar end3) argument 2803 xmlStringDecodeEntities(xmlParserCtxtPtr ctxt, const xmlChar *str, int what, xmlChar end, xmlChar end2, xmlChar end3) argument
|
/external/v8/src/ |
H A D | profile-generator.cc | 515 Address start2 = locator.key(), end2 = start2 + locator.value().size; local 516 if (start2 < end && start < end2) to_delete.Add(start2);
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.text_3.5.0.v20100601-1300.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |