/*
* Created on 05-Jul-2004
* Created by Paul Gardner
* Copyright (C) 2004, 2005, 2006 Aelitis, All Rights Reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* AELITIS, SAS au capital de 46,603.30 euros
* 8 Allee Lenotre, La Grille Royale, 78600 Le Mesnil le Roi, France.
*
*/
package org.gudy.azureus2.core3.ipfilter.impl;
/**
* @author parg
*
*/
import java.util.*;
import java.net.InetAddress;
import java.net.UnknownHostException;
import org.gudy.azureus2.core3.ipfilter.IpFilterManagerFactory;
import org.gudy.azureus2.core3.ipfilter.IpRange;
import org.gudy.azureus2.core3.logging.*;
import org.gudy.azureus2.core3.util.*;
import org.gudy.azureus2.core3.tracker.protocol.PRHelpers;
public class
IPAddressRangeManager
{
private static final LogIDs LOGID = LogIDs.CORE;
protected ArrayList entries = new ArrayList();
protected long total_span;
protected boolean rebuild_required;
protected long last_rebuild_time;
protected IpRange[] mergedRanges = new IpRange[0];
protected AEMonitor this_mon = new AEMonitor( "IPAddressRangeManager" );
public void
addRange(IpRange range)
{
try{
this_mon.enter();
// checking for existing (either by entries.contains, or by
// rebuilding and searching ips) is slow. Skip check, merge will take
// care of it
entries.add( range);
rebuild_required = true;
}finally{
this_mon.exit();
}
}
public void removeRange(IpRange range) {
try{
this_mon.enter();
entries.remove( range );
rebuild_required = true;
}finally{
this_mon.exit();
}
}
public Object
isInRange(
String ip )
{
try{
this_mon.enter();
long address_long = addressToInt( ip );
if ( address_long < 0 ){
address_long += 0x100000000L;
}
Object res = isInRange( address_long );
// LGLogger.log( "IPAddressRangeManager: checking '" + ip + "' against " + entries.size() + "/" + merged_entries.length + " -> " + res );
return( res );
}finally{
this_mon.exit();
}
}
public Object
isInRange(
InetAddress ip )
{
try{
this_mon.enter();
long address_long = addressToInt( ip );
if ( address_long < 0 ){
address_long += 0x100000000L;
}
Object res = isInRange( address_long );
// LGLogger.log( "IPAddressRangeManager: checking '" + ip + "' against " + entries.size() + "/" + merged_entries.length + " -> " + res );
return( res );
}finally{
this_mon.exit();
}
}
public boolean
isInRange(
IpRange range,
String address )
{
try {
this_mon.enter();
long address_long = PRHelpers.addressToInt(address);
if (address_long < 0) {
address_long += 0x100000000L;
}
return address_long >= range.getStartIpLong()
&& address_long <= range.getStartIpLong();
} catch (UnknownHostException e) {
return (false);
} finally {
this_mon.exit();
}
}
protected Object
isInRange(
long address_long )
{
try{
this_mon.enter();
checkRebuild();
if ( mergedRanges.length == 0 ){
return( null );
}
// assisted binary chop
int bottom = 0;
int top = mergedRanges.length-1;
int current = -1;
while( top >= 0 && bottom < mergedRanges.length && bottom <= top){
current = (bottom+top)/2;
IpRange e = mergedRanges[current];
long this_start = e.getStartIpLong();
long this_end = e.getMergedEndLong();
if ( address_long == this_start ){
break;
}else if ( address_long > this_start ){
if ( address_long <= this_end ){
break;
}
// lies to the right of this entry
bottom = current + 1;
}else if ( address_long == this_end ){
break;
}else{
// < this_end
if ( address_long >= this_start ){
break;
}
top = current - 1;
}
}
if ( top >= 0 && bottom < mergedRanges.length && bottom <= top ){
IpRange e = mergedRanges[current];
if ( address_long <= e.getEndIpLong()){
return( e );
}
IpRange[] merged = e.getMergedEntries();
if ( merged == null ){
Debug.out( "IPAddressRangeManager: inconsistent merged details - no entries" );
return( null );
}
for (int i=0;i<merged.length;i++){
IpRange me = merged[i];
if ( me.getStartIpLong() <= address_long && me.getEndIpLong() >= address_long ){
return( me );
}
}
Debug.out( "IPAddressRangeManager: inconsistent merged details - entry not found" );
}
return( null );
}finally{
this_mon.exit();
}
}
protected int
addressToInt(
String address )
{
try{
return( PRHelpers.addressToInt( address ));
}catch( UnknownHostException e ){
return( UnresolvableHostManager.getPseudoAddress( address ));
}
}
protected int
addressToInt(
InetAddress address )
{
return( PRHelpers.addressToInt( address ));
}
protected void
checkRebuild()
{
try{
this_mon.enter();
if ( rebuild_required ){
// with substantial numbers of filters (e.g. 80,000) rebuilding
// is a slow process. Therefore prevent frequent rebuilds at the
// cost of delaying the effect of the change
long now = SystemTime.getCurrentTime();
long secs_since_last_build = (now - last_rebuild_time)/1000;
// allow one second per 2000 entries
if ( secs_since_last_build > entries.size()/2000 ){
last_rebuild_time = now;
rebuild_required = false;
rebuild();
}
}
}finally{
this_mon.exit();
}
}
protected void
rebuild()
{
if (Logger.isEnabled())
Logger.log(new LogEvent(LOGID, "IPAddressRangeManager: rebuilding "
+ entries.size() + " entries starts"));
IpRange[] ents = new IpRange[entries.size()];
entries.toArray(ents);
for (int i=0;i<ents.length;i++){
ents[i].resetMergeInfo();
}
// sort based on start address
Arrays.sort(
ents,
new Comparator()
{
public int
compare(
Object o1,
Object o2 )
{
IpRange e1 = (IpRange)o1;
IpRange e2 = (IpRange)o2;
long diff = e1.getStartIpLong() - e2.getStartIpLong();
if (diff == 0) {
diff = e2.getEndIpLong() - e1.getEndIpLong();
}
return signum(diff);
}
public boolean
equals(Object obj)
{
return( false );
}
});
// now merge overlapping ranges
List me = new ArrayList( ents.length );
for (int i=0;i<ents.length;i++){
IpRange entry = ents[i];
if ( entry.getMerged()){
continue;
}
me.add( entry );
int pos = i+1;
while( pos < ents.length ){
long end_pos = entry.getMergedEndLong();
IpRange e2 = ents[pos++];
if (!e2.getMerged()){
if ( end_pos >= e2.getStartIpLong()){
e2.setMerged();
if ( e2.getEndIpLong() > end_pos ){
entry.setMergedEnd( e2.getEndIpLong() );
entry.addMergedEntry( e2 );
}
}else{
break;
}
}
}
}
/*
for (int i=0;i<ents.length;i++){
entry e = ents[i];
System.out.println( Long.toHexString(e.getStart()) + " - " + Long.toHexString(e.getEnd()) + ": " + e.getMerged() + "/" + Long.toHexString(e.getMergedEnd()));
}
*/
mergedRanges = new IpRange[me.size()];
me.toArray( mergedRanges );
total_span = 0;
for (int i=0;i<mergedRanges.length;i++){
IpRange e = mergedRanges[i];
// span is inclusive
long span = ( e.getMergedEndLong() - e.getStartIpLong()) + 1;
total_span += span;
}
// System.out.println( "non_merged = " + merged_entries.length );
if (Logger.isEnabled())
Logger.log(new LogEvent(LOGID, "IPAddressRangeManager: rebuilding "
+ entries.size() + " entries ends"));
}
/**
* @param diff
* @return
*/
protected int signum(long diff) {
if (diff > 0) {
return 1;
}
if (diff < 0) {
return -1;
}
return 0;
}
protected long
getTotalSpan()
{
checkRebuild();
return( total_span );
}
public static void
main(
String[] args )
{
IPAddressRangeManager manager = new IPAddressRangeManager();
/*
Object[] testBlockIPs1 = {
new String[] { "1", "3.1.1.1", "3.1.1.2" },
new String[] { "2", "3.1.1.1", "3.1.1.3" },
new String[] { "3", "1.1.1.1", "2.2.2.2", "2" },
new String[] { "4", "0.1.1.1", "2.2.2.2", "3" },
new String[] { "5", "1.1.1.1", "1.2.2.2" },
new String[] { "6", "7.7.7.7", "7.7.8.7" },
new String[] { "7", "8.8.8.8", "8.8.8.8" },
//new String[] {"8","0.0.0.0", "255.255.255.255"},
new String[] { "9", "5.5.5.5", "6.6.6.9" },
new String[] { "10", "6.6.6.6", "7.7.0.0" },
new String[] { "11", "254.6.6.6", "254.7.0.0" } };
Object[] testBlockIPs2 = {
new String[] { "1", "0.0.0.1", "60.0.0.0" },
new String[] { "2", "60.0.0.2", "119.255.255.255" },
new String[] { "2a", "60.0.0.2", "119.255.255.255" },
new String[] { "3", "120.0.0.1", "180.0.0.0" },
new String[] { "4", "180.0.0.0", "255.255.255.255" }
};
Object[] testBlockIPs = testBlockIPs2;
for (int i = 0; i < testBlockIPs.length; i++) {
String[] ip = (String[]) testBlockIPs[i];
if (ip == null)
continue;
manager.addRange(new IpRangeImpl(ip[0], ip[1], ip[2], true));
}
System.out.println( "inRange -> " + manager.isInRange( "254.6.6.8" ));
String [] testIPs = { "60.0.0.0", "60.0.0.1", "60.0.0.2", "60.0.0.3",
"119.255.255.254", "119.255.255.255", "120.0.0.0", "120.0.0.1",
"120.0.0.2", "179.255.255.255", "180.0.0.0", "180.0.0.1"
};
for (int i = 0; i < testIPs.length; i++) {
String string = testIPs[i];
System.out.println(string + " InRange? " + manager.isInRange(string));
}
System.out.println( "Total span = " + manager.getTotalSpan());
*/
Random r = new Random();
for (int i=0;i<1000000;i++){
int ip1 = r.nextInt( 0x0fffffff );
int ip2 = ip1 + r.nextInt( 255 );
String start = PRHelpers.intToAddress( ip1 );
String end = PRHelpers.intToAddress( ip2 );
manager.addRange( new IpRangeImpl("test_" + i, start, end, true ));
}
/*
for (int i=0;i<100000;i++){
int start = (int)(Math.random() * 0xfffff000);
int end = start + (int)(Math.random()*5000);
manager.addRange( start, end, new Object());
}
*/
int num = 0;
int hits = 0;
while(true){
if ( num % 1000 == 0 ){
System.out.println( num + "/" + hits );
}
num++;
int ip = r.nextInt();
Object res = manager.isInRange( ip );
if ( res != null ){
hits++;
}
}
}
public ArrayList getEntries() {
return entries;
}
public void clearAllEntries() {
try{
this_mon.enter();
entries.clear();
IpFilterManagerFactory.getSingleton().deleteAllDescriptions();
rebuild_required = true;
}finally{
this_mon.exit();
}
}
}
|
