Searched refs:size (Results 76 - 100 of 864) sorted by last modified time

1234567891011>>

/dalvik/tools/dexdeps/src/com/android/dexdeps/
H A DClassRef.java46 return mFieldRefs.toArray(new FieldRef[mFieldRefs.size()]);
60 return mMethodRefs.toArray(new MethodRef[mMethodRefs.size()]);
H A DDexData.java204 int size = readInt(); // #of entries in list
205 protoId.types = new int[size];
207 for (int j = 0; j < size; j++) {
/dalvik/tools/dmtracedump/
H A DTraceDump.c85 "div { font-family: courier; font-size: 13 }\n"
3262 int findMatch(MethodEntry** methods, int size, MethodEntry* matchThis) argument
3266 for (i = 0 ; i < size ; i++) {
/dalvik/tools/hprof-conv/
H A DHprofConv.c160 * Ensure that the buffer can hold at least "size" additional bytes.
162 static int ebEnsureCapacity(ExpandBuf* pBuf, int size) argument
164 assert(size > 0);
166 if (pBuf->curLen + size > pBuf->maxLen) {
167 int newSize = pBuf->curLen + size + 128; /* oversize slightly */
170 fprintf(stderr, "ERROR: realloc failed on size=%d\n", newSize);
178 assert(pBuf->curLen + size <= pBuf->maxLen);
306 * Get the size, in bytes, of one of the "basic types".
600 * (4b) identifier size, always 4
/dalvik/vm/
H A DAllocTracker.c41 * Changing the window size is easy, changing the max stack depth is harder
42 * because we go from an array of fixed-size structs to variable-sized data.
54 u4 size; /* total size requested */ member in struct:AllocRecord
187 void dvmDoTrackAllocation(ClassObject* clazz, int size) argument
206 pRec->size = size;
237 (4b) total allocation size
257 The chief reason for using a string table here is to keep the size of
369 * The size o
446 size_t size = 0; local
[all...]
H A DAllocTracker.h47 void dvmDoTrackAllocation(ClassObject* clazz, int size);
H A DDebugger.c2656 bool dvmDbgConfigureStep(ObjectId threadId, enum JdwpStepSize size, argument
2685 if (!dvmAddSingleStep(thread, size, depth))
H A DDebugger.h65 enum JdwpStepSize size; member in struct:StepControl
282 bool dvmDbgConfigureStep(ObjectId threadId, enum JdwpStepSize size,
H A DDvm.mk31 # Optional features. These may impact the size or performance of the VM.
H A DHash.c34 * Compute the capacity needed for a table to hold "size" elements.
36 size_t dvmHashSize(size_t size) { argument
37 return (size * LOAD_DENOM) / LOAD_NUMER +1;
125 * size of the table beyond its comfy limit.
H A DHash.h85 * table size may be adjusted upward.) If you know exactly how many
93 * Compute the capacity needed for a table to hold "size" elements. Use
98 size_t dvmHashSize(size_t size);
129 * Get total size of hash table (for memory usage calculations).
H A DIndirectRefTable.c348 * This is a qsort() callback. We sort Object* by class, allocation size,
386 static void logObject(Object* obj, int size, int identical, int equiv) argument
395 obj->clazz->descriptor, size, equiv +1);
398 obj->clazz->descriptor, size);
424 int size; local
432 size = dvmObjectSizeInHeap(refs[i]);
438 clazz->descriptor, size);
441 (refs[i] == NULL) ? "-" : ref->clazz->descriptor, size);
476 size = dvmObjectSizeInHeap(refs[i-1]);
482 (int) dvmObjectSizeInHeap(refs[i]) == size)
[all...]
H A DLinearAlloc.c254 * Allocate "size" bytes of storage, associated with a particular class
257 * It's okay for size to be zero.
265 void* dvmLinearAlloc(Object* classLoader, size_t size) argument
272 return calloc(1, size);
275 LOGVV("--- LinearAlloc(%p, %d)\n", classLoader, size);
278 * What we'd like to do is just determine the new end-of-alloc size
295 * add the size of data they want, add another header's worth so we
298 * chunk header size off so we're back to the header pointer.
301 * old=12 size=3 new=((12+(4*2)+3+7) & ~7)-4 = 24-4 --> 20
302 * old=12 size
[all...]
H A DLinearAlloc.h60 void* dvmLinearAlloc(Object* classLoader, size_t size);
H A DMisc.c350 * the same size and attribute.
673 size_t strlcpy(char *dst, const char *src, size_t size) { argument
677 if (srcLength > (size - 1)) {
678 copyLength = size - 1;
681 if (size != 0) {
H A DMisc.h140 int storageSize; /* current size, in 32-bit words */
279 * code size slightly, but also bad, because the native stack trace we
287 size_t strlcpy(char *dst, const char *src, size_t size);
H A DReferenceTable.c154 * This is a qsort() callback. We sort Object* by class, allocation size,
184 static void logObject(Object* obj, int size, int identical, int equiv) argument
197 descriptor, size, equiv +1);
199 LOGW("%5d of %s %dB\n", identical + equiv +1, descriptor, size);
229 int size; local
235 size = (refs[i] == NULL) ? 0 : dvmObjectSizeInHeap(refs[i]);
241 clazz->descriptor, size);
244 LOGW("%5d: %p cls=(raw) (%d bytes)\n", i, ref, size);
247 (refs[i] == NULL) ? "-" : ref->clazz->descriptor, size);
267 size
[all...]
H A DThread.c1027 * The JNI local ref table *must* be fixed-size because we keep pointers
1348 * Pass in a stack size of 0 to get the default.
2459 size_t size; local
2463 size = backtrace(array, NUM_FRAMES);
2464 strings = backtrace_symbols(array, size);
2466 LOGW("Obtained %zd stack frames.\n", size);
2468 for (i = 0; i < size; i++)
/dalvik/vm/alloc/
H A DAlloc.c191 * We use the size actually allocated, rather than obj->clazz->objectSize,
197 int size; local
214 size = dvmObjectSizeInHeap(obj);
216 copy = dvmMalloc(size, flags);
221 dvmTrackAllocation(obj->clazz, size);
224 memcpy(copy, obj, size);
227 //LOGV("CloneObject: %p->%p %s (%d)\n", obj, copy, obj->clazz->name, size);
H A DAlloc.h45 void* dvmMalloc(size_t size, int flags);
173 * If set is true, sets the new minimum heap size to size; always
174 * returns the current (or previous) size. If size is zero,
177 size_t dvmMinimumHeapSize(size_t size, bool set);
H A DHeap.c274 /* Used for a heap size change hysteresis to avoid collecting
279 /* Whenever the effective heap size may have changed,
289 /* See if the heap size has changed enough that we should care
341 static DvmHeapChunk *tryMalloc(size_t size) argument
349 if (size >= gDvm.heapSizeMax) {
351 "someone's allocating a huge buffer\n", size, size);
361 // Maybe we skip the GC if the size is large and we did one recently
366 hc = dvmHeapSourceAlloc(size + sizeof(DvmHeapChunk));
376 hc = dvmHeapSourceAlloc(size
502 dvmMalloc(size_t size, int flags) argument
[all...]
H A DHeapSource.c71 How do we manage the size trade-offs?
106 /* The largest size that this heap is allowed to grow to.
126 /* Requested minimum heap size, or zero if there is no minimum.
130 /* The starting heap size.
138 /* The desired max size of the heap source as a whole.
203 //TODO: include size of bitmaps? If so, don't use bitsLen, listen to .max
296 * than the starting size.
298 LOGV_HEAP("Creating VM heap of size %u\n", startSize);
303 /* Don't let the heap grow past the starting size without
311 LOGE_HEAP("Can't create VM heap of size (
1122 dvmMinimumHeapSize(size_t size, bool set) argument
[all...]
H A DMarkSweep.c88 size_t size; local
96 size = dvmHeapSourceGetIdealFootprint() * sizeof(Object*) /
98 size = ALIGN_UP_TO_PAGE_SIZE(size);
99 fd = ashmem_create_region("dalvik-heap-markstack", size);
102 size, strerror(errno));
105 limit = (const Object **)mmap(NULL, size, PROT_READ | PROT_WRITE,
111 size, strerror(err));
117 stack->base = (const Object **)((uintptr_t)limit + size);
/dalvik/vm/analysis/
H A DCodeVerify.c388 int size = offsetof(UninitInstanceMap, map) + local
390 uninitMap = calloc(1, size);
3168 * - (N/A) operand stack is always the same size
3854 /* make sure "size" register is valid type */
4008 LOG_VFY("VFY: array-data size mismatch (%d vs %d)\n",
H A DDexOptimize.c173 * We have the correct file open and locked. If the file size is zero,
578 * In theory the file could change size and bits could shift around.
598 * for ways to reduce the size of the resolved-constant table.
1073 * The chunk header fields are always in "native" byte order. If "size"
1076 static bool writeChunk(int fd, u4 type, const void* data, size_t size) argument
1083 u4 size; member in struct:__anon64::__anon65
1089 LOGV("Writing chunk, type=%.4s size=%d\n", (char*) &type, size);
1092 header.ts.size = (u4) size;
[all...]

Completed in 296 milliseconds

1234567891011>>