Lines Matching defs:chain
487 if (gDvmJit.pJitEntryTable[i].u.info.chain != gDvmJit.jitTableSize)
568 * Walk the bucket chain to find an exact match for our PC and trace/method
571 while ((gDvmJit.pJitEntryTable[idx].u.info.chain != chainEndMarker) &&
575 idx = gDvmJit.pJitEntryTable[idx].u.info.chain;
582 * slot in the chain. Possibly continue the chain walk in case
592 * to have to find a free slot and chain it.
597 while (gDvmJit.pJitEntryTable[idx].u.info.chain != chainEndMarker) {
606 idx = gDvmJit.pJitEntryTable[idx].u.info.chain;
609 * active chain whose last member contains a valid dPC */
626 * be trying to update a chain field, the other fields
632 newValue.info.chain = idx;
1011 while (gDvmJit.pJitEntryTable[idx].u.info.chain != chainEndMarker) {
1012 idx = gDvmJit.pJitEntryTable[idx].u.info.chain;
1045 while (gDvmJit.pJitEntryTable[idx].u.info.chain != chainEndMarker) {
1046 idx = gDvmJit.pJitEntryTable[idx].u.info.chain;
1328 /* Make sure requested size is compatible with chain field width */
1329 tempEntry.u.info.chain = size;
1330 if (tempEntry.u.info.chain != size) {
1340 pNewTable[i].u.info.chain = size; /* Initialize chain termination */
1358 u2 chain;
1362 /* We need to preserve the new chain field, but copy the rest */
1363 chain = p->u.info.chain;
1365 p->u.info.chain = chain;
1402 jitEntry[i].u.info.chain = size; /* Initialize chain termination */