Searched defs:bit (Results 1 - 4 of 4) sorted by relevance

/dalvik/vm/
H A DBitVector.cpp18 * Implementation of an expandable bit vector.
29 * Allocate a bit vector with enough space to hold at least the specified
37 assert(sizeof(bv->storage[0]) == 4); /* assuming 32-bit units */
62 * "Allocate" the first-available bit in the bitmap.
70 unsigned int word, bit; local
78 bit = ffs(~(pBits->storage[word])) -1;
79 assert(bit < 32);
80 pBits->storage[word] |= 1 << bit;
81 return (word << 5) | bit;
100 * Mark the specified bit a
[all...]
/dalvik/vm/alloc/TEST/HeapBitmapTest/
H A Dmain.c211 unsigned long bit; local
219 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb, HEAP_BASE);
220 assert(bit == 0);
239 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb, HEAP_BASE);
240 assert(bit != 0);
259 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb,
261 assert(bit == 0);
280 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb,
282 assert(bit != 0);
/dalvik/vm/analysis/
H A DRegisterMap.cpp158 ALOGI("Register Map bit difference stats:");
366 * Given a line of registers, output a bit vector that indicates whether
371 * in the low bit of the first byte.
382 val |= 0x80; /* set hi bit */
539 ALOGE("GLITCH: addr %d reg %d: bit=%d reg=%d(%d)",
562 * Advance "ptr" to ensure 32-bit alignment.
768 /* a bit late */
1102 Each entry consists of an address and a bit vector. Adjacent entries are
1107 bit vectors. However, the register values at a given address do not
1118 change the bit vecto
1315 int prev, cur, bit; local
[all...]
/dalvik/libdex/
H A DDexSwapVerify.cpp257 * Set the given bit in pDefinedClassBits, returning its former value.
261 u4 bit = 1 << (typeIdx & 0x1f); local
263 bool result = (*element & bit) != 0;
265 *element |= bit;
342 * one-bit-on integer, suitable for use in an int-sized bit set.
401 u4 usedBits = 0; // Bit set: one bit per section
448 u4 bit = mapTypeToBitMask(item->type); local
450 if (bit == 0) {
454 if ((usedBits & bit) !
[all...]

Completed in 3116 milliseconds