Lines Matching defs:entry
225 * since we don't count method entry as a GC point.
545 /* rawMap now points to the address field of the next entry */
723 * We want an entry for every class, loaded or not.
923 * Find the appropriate entry. Many maps are very small, some are very
1102 Each entry consists of an address and a bit vector. Adjacent entries are
1109 We therefore cannot omit an entry.
1112 entry in the register map, we must conservatively scan the registers in
1120 Each entry advances the address value by at least 1 (measured in 16-bit
1219 // for each entry
1239 The most common situation is an entry whose address has changed by 2-4
1496 * a value longer than a single entry can possibly expand to, we need
1497 * only check for overflow at the end of each entry. The worst case
1542 for (int entry = 1; entry < numEntries; entry++) {
1554 ALOGI(" addr=0x%04x ent=%d (aw=%d)", addr, entry, addrWidth);
1764 int entry;
1765 for (entry = 1; entry < numEntries; entry++) {