Searched refs:tries (Results 1 – 14 of 14) sorted by relevance
131 const DexTry* tries = dexGetTries(pCode); in dexFindCatchHandler() local132 u4 start = tries[0].startAddr; in dexFindCatchHandler()138 u4 end = start + tries[0].insnCount; in dexFindCatchHandler()144 offset = tries[0].handlerOff; in dexFindCatchHandler()
1747 DexTry* tries = (DexTry*) dexGetTries(code); in swapTriesAndCatches() local1752 CHECK_LIST_SIZE(tries, count, sizeOfItem); in swapTriesAndCatches()1757 SWAP_FIELD4(tries->startAddr); in swapTriesAndCatches()1758 SWAP_FIELD2(tries->insnCount); in swapTriesAndCatches()1759 SWAP_FIELD2(tries->handlerOff); in swapTriesAndCatches()1761 if (tries->startAddr < lastEnd) { in swapTriesAndCatches()1766 if (tries->startAddr >= code->insnsSize) { in swapTriesAndCatches()1767 ALOGE("Invalid start_addr: %#x", tries->startAddr); in swapTriesAndCatches()1772 if (tries->handlerOff == handlerOffs[i]) { in swapTriesAndCatches()1778 ALOGE("Bogus handler offset: %#x", tries->handlerOff); in swapTriesAndCatches()[all …]
3 The first test tries to create the truly minimal dex file by using the7 The second test tries to convert a minimal classfile and ensures that
19 tries:32 tries:47 tries:
1 This test tries to merge dex files it finds in the android tree at random, 2 by 2.
17 tries:35 tries:54 tries:73 tries:93 tries:
16 tries:44 tries:
20 tries:43 tries:77 tries:117 tries:153 tries:188 tries:216 tries:241 tries:276 tries:
44 tries:71 tries:98 tries:
15 tries:
17 tries:
23 tries:74 tries:97 tries:144 tries:
32 tries:66 tries:116 tries:
824 Code.Try[] tries = code.getTries(); in transformCode() local826 codeOut.writeUnsignedShort(tries.length); in transformCode()841 if (tries.length > 0) { in transformCode()852 codeOut.skip(tries.length * SizeOf.TRY_ITEM); in transformCode()854 transformTries(triesSection, tries, offsets); in transformCode()872 private void transformTries(Dex.Section out, Code.Try[] tries, in transformTries() argument874 for (Code.Try tryItem : tries) { in transformTries()