Searched refs:limit (Results 1 - 12 of 12) sorted by relevance

/dalvik/libdex/
H A DLeb128.cpp28 * any but the low-order four bits set. Additionally, if the limit is
29 * passed as non-NULL and bytes would need to be read past the limit,
32 int readAndVerifyUnsignedLeb128(const u1** pStream, const u1* limit, argument
37 if (((limit != NULL) && (*pStream > limit))
50 * any but the low-order four bits set. Additionally, if the limit is
51 * passed as non-NULL and bytes would need to be read past the limit,
54 int readAndVerifySignedLeb128(const u1** pStream, const u1* limit, argument
59 if (((limit != NULL) && (*pStream > limit))
[all...]
H A DLeb128.h109 * any but the low-order four bits set. Additionally, if the limit is
110 * passed as non-NULL and bytes would need to be read past the limit,
113 int readAndVerifyUnsignedLeb128(const u1** pStream, const u1* limit,
121 * any but the low-order four bits set. Additionally, if the limit is
122 * passed as non-NULL and bytes would need to be read past the limit,
125 int readAndVerifySignedLeb128(const u1** pStream, const u1* limit, bool* okay);
/dalvik/vm/alloc/
H A DMarkSweep.h25 const Object **limit; member in struct:GcMarkStack
H A DMarkSweep.cpp71 assert(stack->limit > stack->top);
84 assert(stack->limit > stack->top);
498 * and limit. Returns NULL if no marked objects are in that region.
500 static Object *nextGrayObject(const u1 *base, const u1 *limit, argument
505 assert(base < limit);
506 assert(limit - base <= GC_CARD_SIZE);
507 for (ptr = base; ptr < limit; ptr += HB_OBJECT_ALIGNMENT) {
530 const u1 *limit = ptr + GC_CARD_SIZE;
531 while (ptr < limit) {
532 Object *obj = nextGrayObject(ptr, limit, markBit
[all...]
H A DHeapSource.cpp92 char *limit; member in struct:Heap
116 * the user to limit the heap growth below the maximum size. This
136 * when the heap size is below the maximum size or growth limit.
142 * when the heap size is below the maximum size or growth limit.
193 * Returns true iff a soft limit is in effect for the active heap.
197 /* softLimit will be either SIZE_MAX or the limit for the
252 if ((const char *)ptr >= heap->base && (const char *)ptr < heap->limit) {
341 assert(new_brk <= heap->limit);
373 hs->heaps[0].limit = hs->heapBase + maximumSize;
415 heap.limit
[all...]
H A DCopying.cpp194 * Base and limit blocks. Basically the shifted start address of
210 /* Exclusive limit of free space in the current block. */
796 u1 *base, *limit; local
803 limit = heapSource->blockBase + heapSource->maximumSize;
804 assert(addr < limit);
/dalvik/dx/src/com/android/dx/cf/code/
H A DExecutionStack.java82 int limit = stackPtr - 1;
84 for (int i = 0; i <= limit; i++) {
85 String idx = (i == limit) ? "top0" : Hex.u2(limit - i);
/dalvik/dx/src/com/android/dx/io/
H A DDexBuffer.java208 int limit = fourByteAlign(length + maxByteCount);
209 Section result = new Section(name, length, limit);
210 length = limit;
308 private final int limit; field in class:DexBuffer.Section
311 private Section(String name, int position, int limit) { argument
314 this.limit = limit;
581 if (position + size > limit) {
582 throw new DexException("Section limit " + limit
[all...]
/dalvik/tests/070-nio-buffer/src/
H A DMain.java161 char[] outBuf = new char[directBuf.limit() * 2];
162 for (int i = 0; i < directBuf.limit(); i++) {
/dalvik/dexgen/src/com/android/dexgen/rop/type/
H A DType.java371 int limit = (length - 1); // Skip the final ';'.
372 for (int i = 1; i < limit; i++) {
/dalvik/dx/src/com/android/dx/rop/type/
H A DType.java343 int limit = (length - 1); // Skip the final ';'.
344 for (int i = 1; i < limit; i++) {
/dalvik/vm/compiler/
H A DUtility.cpp219 int limit = (methodStats->dalvikSize >> 2) * 3;
222 if (methodStats->compiledDalvikSize >= limit) {

Completed in 392 milliseconds