HomeSort by relevance Sort by last modified time
    Searched defs:end (Results 226 - 250 of 4466) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /dalvik/libdex/
DexOptData.cpp 28 * pointer into the given memory range (from start inclusive to end
31 static bool isValidPointer(const void* ptr, const void* start, const void* end)
33 return (ptr >= start) && (ptr < end) && (((uintptr_t) ptr & 7) == 0);
40 const u1* end = (const u1*) pOptHeader + local
45 return (u4) adler32(adler, start, end - start);
70 ALOGE("Unaligned opt data area end");
83 /* Process chunks until we see the end marker. */
  /external/bison/examples/calc++/
location.hh 56 , end (e)
63 , end (p)
72 , end (f, l, c)
83 end = begin;
92 begin = end;
98 end += count;
104 end.lines (count);
112 /// End of the located region.
113 position end; member in class:yy::location
117 inline const location operator+ (const location& begin, const location& end)
    [all...]
stack.hh 100 inline const_iterator end () const { return seq_.rend (); } function in class:yy::stack
  /external/bison/src/
Sbitset.c 38 Sbitset end; local
41 for (ptr = result, end = result + Sbitset__nbytes (nbits); ptr < end; ++ptr)
location.h 87 boundary end; member in struct:__anon4730
119 res = boundary_cmp (a.end, b.end);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/style/
X500NameTokenizer.java 43 int end = index + 1; local
49 while (end != value.length())
51 char c = value.charAt(end);
83 end++;
86 index = end;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
X509NameTokenizer.java 44 int end = index + 1; local
50 while (end != value.length())
52 char c = value.charAt(end);
91 // END android-added
95 end++;
98 index = end;
  /external/ceres-solver/internal/ceres/
split.cc 57 const char* end = p + full.size(); local
58 while (p != end) {
62 while (++p != end && *p != c) {
81 const char* end = p + full.size(); local
82 while (p != end) {
87 while (++p != end && *p != c) {
  /external/clang/include/clang/Rewrite/Core/
RewriteBuffer.h 36 iterator end() const { return Buffer.end(); } function in class:clang::RewriteBuffer
45 Initialize(Input.begin(), Input.end());
115 } // end namespace clang
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_persistent_allocator.h 38 uptr end = atomic_load(&region_end, memory_order_acquire); local
39 if (cmp == 0 || cmp + size > end) return 0;
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_procmaps_test.cc 27 uptr start, end; local
28 bool res = GetCodeRangeForFile("[vdso]", &start, &end);
31 EXPECT_LT(start, end);
  /external/compiler-rt/test/asan/TestCases/
contiguous_container.cc 13 char *end = beg + capacity; local
22 __sanitizer_annotate_contiguous_container(beg, end, old_mid, mid);
28 assert(__sanitizer_verify_contiguous_container(beg, mid, end));
30 assert(!__sanitizer_verify_contiguous_container(beg, mid - 1, end));
31 if (mid != end)
32 assert(!__sanitizer_verify_contiguous_container(beg, mid + 1, end));
36 __sanitizer_annotate_contiguous_container(beg, end, mid, end);
gc-test.cc 24 void *beg, *end; local
26 __asan_addr_is_in_fake_stack(fake_stack, &var[0], &beg, &end);
29 assert((char*)end > (char*)&var[0]);
37 assert(end == end1);
  /external/compiler-rt/test/builtins/Unit/
clear_cache_test.c 16 void __clear_cache(void* start, void* end)
18 if (!FlushInstructionCache(GetCurrentProcess(), start, end-start))
23 extern void __clear_cache(void* start, void* end);
60 char* end = (char*)((uintptr_t)(&execution_buffer[128+4096]) & (-4095)); local
68 if (mprotect(start, end-start, PROT_READ|PROT_WRITE|PROT_EXEC) != 0)
  /external/compiler-rt/test/msan/
chained_origin_limits.cc 70 static char *buf, *cur, *end; variable
79 end = buf + 1000;
90 memmove(buf, p + 1, end - p - 1);
97 size_t copy_sz = end - cur;
  /external/deqp/framework/common/
tcuRandomValueIterator.hpp 62 static RandomValueIterator end (void) { return RandomValueIterator<T>(0, 0); } function in class:tcu::RandomValueIterator
  /external/e2fsprogs/e2fsck/
prof_err.c 70 struct et_list *et, **end; local
72 for (end = list, et = *list; et; end = &et->next, et = et->next)
84 *end = et;
  /external/e2fsprogs/lib/et/
com_right.c 91 struct et_list *et, **end; local
95 for (end = list, et = *list; et; end = &et->next, et = et->next)
107 *end = et;
  /external/e2fsprogs/lib/et/test_cases/
continuation.c 40 struct et_list *et, **end; local
42 for (end = list, et = *list; et; end = &et->next, et = et->next)
54 *end = et;
heimdal.c 121 struct et_list *et, **end; local
123 for (end = list, et = *list; et; end = &et->next, et = et->next)
135 *end = et;
heimdal2.c 107 struct et_list *et, **end; local
109 for (end = list, et = *list; et; end = &et->next, et = et->next)
121 *end = et;
heimdal3.c 41 struct et_list *et, **end; local
43 for (end = list, et = *list; et; end = &et->next, et = et->next)
55 *end = et;
imap_err.c 69 struct et_list *et, **end; local
71 for (end = list, et = *list; et; end = &et->next, et = et->next)
83 *end = et;
simple.c 61 struct et_list *et, **end; local
63 for (end = list, et = *list; et; end = &et->next, et = et->next)
75 *end = et;
  /external/e2fsprogs/lib/ext2fs/
dirblock.c 9 * %End-Header%
26 char *p, *end; local
36 end = (char *) buf + fs->blocksize;
37 while (p < end-8) {
79 char *p, *end; local
89 end = buf + fs->blocksize;
90 while (p < end) {

Completed in 475 milliseconds

1 2 3 4 5 6 7 8 91011>>