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

  /dalvik/vm/
ReferenceTable.h 32 * If "allocEntries" is not equal to "maxEntries", the table may expand when
43 int allocEntries; /* #of entries we have space for */
79 return dvmReferenceTableEntries(pRef) == (size_t)pRef->allocEntries;
ReferenceTable.c 38 pRef->allocEntries = initialCount;
51 pRef->allocEntries = pRef->maxEntries = -1;
62 assert(pRef->allocEntries <= pRef->maxEntries);
64 if (pRef->nextEntry == pRef->table + pRef->allocEntries) {
74 newSize = pRef->allocEntries * 2;
77 assert(newSize > pRef->allocEntries);
82 pRef->allocEntries, newSize, sizeof(Object*));
85 LOGVV("Growing %p from %d to %d\n", pRef, pRef->allocEntries, newSize);
90 pRef->allocEntries = newSize;
IndirectRefTable.h 118 * If "allocEntries" is not equal to "maxEntries", the table may expand
193 int allocEntries; /* #of entries we have space for */
309 return dvmIndirectRefTableEntries(pRef) == (size_t)pRef->allocEntries;
335 if (topIndex == pRef->allocEntries) {
IndirectRefTable.c 45 pRef->allocEntries = initialCount;
59 pRef->allocEntries = pRef->maxEntries = -1;
151 assert(pRef->allocEntries <= pRef->maxEntries);
154 if (topIndex == pRef->allocEntries) {
164 newSize = pRef->allocEntries * 2;
167 assert(newSize > pRef->allocEntries);
172 pRef->allocEntries, newSize, pRef->maxEntries);
176 pRef, pRef->allocEntries, newSize, pRef->maxEntries);
180 pRef->allocEntries = newSize;
275 assert(pRef->allocEntries <= pRef->maxEntries)
    [all...]

Completed in 51 milliseconds