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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
|
package de.blinkt.openvpn.core;
import android.text.TextUtils;
import java.math.BigInteger;
import java.net.Inet6Address;
import java.util.*;
public class NetworkSpace {
static class ipAddress implements Comparable<ipAddress> {
private BigInteger netAddress;
public int networkMask;
private boolean included;
private boolean isV4;
@Override
public int compareTo(ipAddress another) {
int comp = getFirstAddress().compareTo(another.getFirstAddress());
if (comp != 0)
return comp;
// bigger mask means smaller address block
if (networkMask > another.networkMask)
return -1;
else if (another.networkMask == networkMask)
return 0;
else
return 1;
}
public ipAddress(CIDRIP ip, boolean include) {
included = include;
netAddress = BigInteger.valueOf(ip.getInt());
networkMask = ip.len;
isV4 = true;
}
public ipAddress(Inet6Address address, int mask, boolean include) {
networkMask = mask;
included = include;
int s = 128;
netAddress = BigInteger.ZERO;
for (byte b : address.getAddress()) {
s -= 16;
netAddress = netAddress.add(BigInteger.valueOf(b).shiftLeft(s));
}
}
public BigInteger getLastAddress() {
return getMaskedAddress(true);
}
public BigInteger getFirstAddress() {
return getMaskedAddress(false);
}
private BigInteger getMaskedAddress(boolean one) {
BigInteger numAddress = netAddress;
int numBits;
if (isV4) {
numBits = 32 - networkMask;
} else {
numBits = 128 - networkMask;
}
for (int i = 0; i < numBits; i++) {
if (one)
numAddress = numAddress.setBit(i);
else
numAddress = numAddress.clearBit(i);
}
return numAddress;
}
@Override
public String toString() {
//String in = included ? "+" : "-";
if (isV4)
return String.format("%s/%d", getIPv4Address(), networkMask);
else
return String.format("%s/%d", getIPv6Address(), networkMask);
}
ipAddress(BigInteger baseAddress, int mask, boolean included, boolean isV4) {
this.netAddress = baseAddress;
this.networkMask = mask;
this.included = included;
this.isV4 = isV4;
}
public ipAddress[] split() {
ipAddress firsthalf = new ipAddress(getFirstAddress(), networkMask + 1, included, isV4);
ipAddress secondhalf = new ipAddress(firsthalf.getLastAddress().add(BigInteger.ONE), networkMask + 1, included, isV4);
assert secondhalf.getLastAddress().equals(getLastAddress());
return new ipAddress[]{firsthalf, secondhalf};
}
String getIPv4Address() {
assert (isV4);
assert (netAddress.longValue() <= 0xffffffffl);
assert (netAddress.longValue() >= 0);
long ip = netAddress.longValue();
return String.format("%d.%d.%d.%d", (ip >> 24) % 256, (ip >> 16) % 256, (ip >> 8) % 256, ip % 256);
}
String getIPv6Address() {
assert (!isV4);
BigInteger r = netAddress;
if (r.longValue() == 0)
return "::";
Vector<String> parts = new Vector<String>();
while (r.compareTo(BigInteger.ZERO) == 1) {
parts.add(0, String.format("%x", r.mod(BigInteger.valueOf(256)).longValue()));
r = r.shiftRight(16);
}
return TextUtils.join(":", parts);
}
public boolean containsNet(ipAddress network) {
return getFirstAddress().compareTo(network.getFirstAddress()) != 1 &&
getLastAddress().compareTo(network.getLastAddress()) != -1;
}
}
TreeSet<ipAddress> ipAddresses = new TreeSet<ipAddress>();
public Collection<ipAddress> getNetworks(boolean included) {
Vector<ipAddress> ips = new Vector<ipAddress>();
for (ipAddress ip : ipAddresses) {
if (ip.included == included)
ips.add(ip);
}
return ips;
}
public void clear() {
ipAddresses.clear();
}
void addIP(CIDRIP cidrIp, boolean include) {
ipAddresses.add(new ipAddress(cidrIp, include));
}
void addIPv6(Inet6Address address, int mask, boolean included) {
ipAddresses.add(new ipAddress(address, mask, included));
}
TreeSet<ipAddress> generateIPList() {
TreeSet<ipAddress> ipsSorted = new TreeSet<ipAddress>(ipAddresses);
Iterator<ipAddress> it = ipsSorted.iterator();
ipAddress currentNet = null;
if (it.hasNext())
currentNet = it.next();
while (it.hasNext()) {
// Check if it and the next of it are compatbile
ipAddress nextNet = it.next();
assert currentNet != null;
if (currentNet.getLastAddress().compareTo(nextNet.getFirstAddress()) == -1) {
// Everything good, no overlapping nothing to do
currentNet = nextNet;
} else {
// This network is smaller or equal to the next but has the same base address
if (currentNet.getFirstAddress().equals(nextNet.getFirstAddress()) && currentNet.networkMask >= nextNet.networkMask) {
if (currentNet.included == nextNet.included) {
ipsSorted.remove(currentNet);
} else {
// our currentnet is included in next and nextnet needs to be split
ipsSorted.remove(nextNet);
ipAddress[] newNets = nextNet.split();
if (newNets[0].getLastAddress().equals(currentNet.getLastAddress())) {
assert (newNets[0].networkMask == currentNet.networkMask);
// Don't add the lower half that would conflict with currentNet
} else {
ipsSorted.add(newNets[0]);
}
ipsSorted.add(newNets[1]);
}
} else {
assert (currentNet.networkMask < nextNet.networkMask);
assert (nextNet.getFirstAddress().compareTo(currentNet.getFirstAddress()) == 1);
// This network is bigger than the next and last ip of current >= next
assert (currentNet.getLastAddress().compareTo(nextNet.getLastAddress()) != -1);
if (currentNet.included == nextNet.included) {
ipsSorted.remove(nextNet);
} else {
ipsSorted.remove(currentNet);
ipAddress[] newNets = currentNet.split();
ipsSorted.add(newNets[0]);
if (newNets[1].networkMask == nextNet.networkMask) {
assert (newNets[1].getFirstAddress().equals(nextNet.getFirstAddress()));
assert (newNets[1].getLastAddress().equals(currentNet.getLastAddress()));
} else {
ipsSorted.add(newNets[1]);
}
}
}
// Reset iterator
it = ipsSorted.iterator();
currentNet = it.next();
}
}
return ipsSorted;
}
Collection<ipAddress> getPositiveIPList() {
TreeSet<ipAddress> ipsSorted = generateIPList();
Vector<ipAddress> ips = new Vector<ipAddress>();
for (ipAddress ia : ipsSorted) {
if (ia.included)
ips.add(ia);
}
return ips;
}
}
|
