1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
/*
* Copyright (C) 2008 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.android.dx.dex.code;
import com.android.dx.util.FixedSizeList;
/**
* Table of catch entries. Each entry includes a range of code
* addresses for which it is valid and an associated {@link
* CatchHandlerList}.
*/
public final class CatchTable extends FixedSizeList
implements Comparable<CatchTable> {
/** {@code non-null;} empty instance */
public static final CatchTable EMPTY = new CatchTable(0);
/**
* Constructs an instance. All indices initially contain {@code null}.
*
* @param size {@code >= 0;} the size of the table
*/
public CatchTable(int size) {
super(size);
}
/**
* Gets the element at the given index. It is an error to call
* this with the index for an element which was never set; if you
* do that, this will throw {@code NullPointerException}.
*
* @param n {@code >= 0, < size();} which index
* @return {@code non-null;} element at that index
*/
public Entry get(int n) {
return (Entry) get0(n);
}
/**
* Sets the entry at the given index.
*
* @param n {@code >= 0, < size();} which index
* @param entry {@code non-null;} the entry to set at {@code n}
*/
public void set(int n, Entry entry) {
set0(n, entry);
}
/** {@inheritDoc} */
public int compareTo(CatchTable other) {
if (this == other) {
// Easy out.
return 0;
}
int thisSize = size();
int otherSize = other.size();
int checkSize = Math.min(thisSize, otherSize);
for (int i = 0; i < checkSize; i++) {
Entry thisEntry = get(i);
Entry otherEntry = other.get(i);
int compare = thisEntry.compareTo(otherEntry);
if (compare != 0) {
return compare;
}
}
if (thisSize < otherSize) {
return -1;
} else if (thisSize > otherSize) {
return 1;
}
return 0;
}
/**
* Entry in a catch list.
*/
public static class Entry implements Comparable<Entry> {
/** {@code >= 0;} start address */
private final int start;
/** {@code > start;} end address (exclusive) */
private final int end;
/** {@code non-null;} list of catch handlers */
private final CatchHandlerList handlers;
/**
* Constructs an instance.
*
* @param start {@code >= 0;} start address
* @param end {@code > start;} end address (exclusive)
* @param handlers {@code non-null;} list of catch handlers
*/
public Entry(int start, int end, CatchHandlerList handlers) {
if (start < 0) {
throw new IllegalArgumentException("start < 0");
}
if (end <= start) {
throw new IllegalArgumentException("end <= start");
}
if (handlers.isMutable()) {
throw new IllegalArgumentException("handlers.isMutable()");
}
this.start = start;
this.end = end;
this.handlers = handlers;
}
/** {@inheritDoc} */
@Override
public int hashCode() {
int hash = (start * 31) + end;
hash = (hash * 31) + handlers.hashCode();
return hash;
}
/** {@inheritDoc} */
@Override
public boolean equals(Object other) {
if (other instanceof Entry) {
return (compareTo((Entry) other) == 0);
}
return false;
}
/** {@inheritDoc} */
public int compareTo(Entry other) {
if (start < other.start) {
return -1;
} else if (start > other.start) {
return 1;
}
if (end < other.end) {
return -1;
} else if (end > other.end) {
return 1;
}
return handlers.compareTo(other.handlers);
}
/**
* Gets the start address.
*
* @return {@code >= 0;} the start address
*/
public int getStart() {
return start;
}
/**
* Gets the end address (exclusive).
*
* @return {@code > start;} the end address (exclusive)
*/
public int getEnd() {
return end;
}
/**
* Gets the handlers.
*
* @return {@code non-null;} the handlers
*/
public CatchHandlerList getHandlers() {
return handlers;
}
}
}
|
