Searched refs:triesSize (Results 1 - 15 of 15) sorted by relevance

/dalvik/libdex/
H A DDexCatch.cpp27 if (pCode->triesSize == 0) {
41 if (pCode->triesSize == 0) {
52 int dexFindCatchHandlerOffset0(u2 triesSize, const DexTry* pTries, argument
56 int max = triesSize - 1;
H A DDexCatch.h114 int dexFindCatchHandlerOffset0(u2 triesSize, const DexTry* pTries,
122 u2 triesSize = pCode->triesSize; local
126 switch (triesSize) {
148 offset = dexFindCatchHandlerOffset0(triesSize, dexGetTries(pCode),
H A DDexFile.h341 u2 triesSize; member in struct:DexCode
346 /* followed by try_item[triesSize] */
769 return (const u1*) &pTries[pCode->triesSize];
H A DDexFile.cpp503 if (pCode->triesSize != 0) {
H A DDexSwapVerify.cpp1765 u4 count = code->triesSize;
1822 SWAP_FIELD2(item->triesSize);
1854 if (item->triesSize == 0) {
/dalvik/dexgen/src/com/android/dexgen/dex/file/
H A DCatchStructs.java99 public int triesSize() { method in class:CatchStructs
185 return (triesSize() * TRY_ITEM_WRITE_SIZE) +
H A DCodeItem.java240 int triesSz = (catches == null) ? 0 : catches.triesSize();
/dalvik/dx/src/com/android/dx/dex/file/
H A DCatchStructs.java96 public int triesSize() { method in class:CatchStructs
182 return (triesSize() * TRY_ITEM_WRITE_SIZE) +
H A DCodeItem.java231 int triesSz = (catches == null) ? 0 : catches.triesSize();
/dalvik/vm/compiler/codegen/x86/
H A DLower.cpp285 u4 triesSize = pCode->triesSize; local
288 for (i = 0; i < triesSize; i++) {
/dalvik/vm/analysis/
H A DVfyBasicBlock.cpp340 if (pCode->triesSize != 0) {
358 if (tryIndex == pCode->triesSize) {
H A DDexVerify.cpp141 u4 triesSize = pCode->triesSize; local
145 if (triesSize == 0) {
151 for (idx = 0; idx < triesSize; idx++) {
H A DCodeVerify.cpp2926 if (pCode->triesSize != 0) {
/dalvik/dexdump/
H A DDexDump.cpp569 u4 triesSize = pCode->triesSize; local
571 if (triesSize == 0) {
576 printf(" catches : %d\n", triesSize);
581 for (i = 0; i < triesSize; i++) {
/dalvik/vm/compiler/
H A DFrontend.cpp846 int triesSize = pCode->triesSize; local
850 if (triesSize == 0) {
858 for (i = 0; i < triesSize; i++) {

Completed in 155 milliseconds