HomeSort by relevance Sort by last modified time
    Searched refs:b_end (Results 1 - 4 of 4) sorted by null

  /external/valgrind/main/drd/
drd_bitmap.c 140 Addr b_end; local
162 b_end = make_address(bm2->addr + 1, 0);
164 b_end = a2;
166 tl_assert(a1 <= b_start && b_start < b_end && b_end && b_end <= a2);
167 tl_assert(address_msb(b_start) == address_msb(b_end - 1));
168 tl_assert(address_lsb(b_start) <= address_lsb(b_end - 1));
170 if (address_lsb(b_start) == 0 && address_lsb(b_end) == 0)
181 for (b0 = address_lsb(b_start); b0 <= address_lsb(b_end - 1); b0++
237 Addr b_end; local
351 Addr b_end; local
404 Addr b_end; local
459 Addr b_end; local
792 Addr b_end; local
    [all...]
  /external/chromium/googleurl/src/
url_util.h 203 // The versions of this function that don't take a b_end assume that the b
211 const char* b_end);
url_util.cc 489 const char* b_end) {
490 while (a_begin != a_end && b_begin != b_end &&
495 return a_begin == a_end && b_begin == b_end;
  /system/core/adb/
sysdeps_win32.c 811 * region B which is (0, b_end) with b_end <= a_start
813 * an empty buffer has: a_start = a_end = b_end = 0
817 * then you start writing at b_end
819 * the buffer is full when b_end == a_start && a_end == BUFFER_SIZE
821 * there is room when b_end < a_start || a_end < BUFER_SIZE
824 * we do: a_start = 0, a_end = b_end, b_end = 0, and keep going on..
863 int b_end; member in struct:BipBufferRec_
882 buffer->b_end = 0
    [all...]

Completed in 246 milliseconds