Skip to content

Replace linear IP blocklist scan with indexed trie lookup #322

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Mishenevd wants to merge 1 commit into
base: main
Choose a base branch
from
+4 −11
Open

Replace linear IP blocklist scan with indexed trie lookup #322

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 4 additions & 11 deletions agent_api/src/main/java/dev/aikido/agent_api/helpers/net/IPList.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,15 +2,13 @@

import inet.ipaddr.IPAddress;
import inet.ipaddr.IPAddressString;

import java.util.HashSet;
import java.util.Set;
import inet.ipaddr.format.util.DualIPv4v6Tries;

public class IPList {
private Set<IPAddress> ipAddresses;
private final DualIPv4v6Tries ipAddresses;

public IPList() {
this.ipAddresses = new HashSet<>();
this.ipAddresses = new DualIPv4v6Tries();
}

public void add(String ipOrCIDR) {
Expand Down Expand Up @@ -56,12 +54,7 @@ public boolean matches(String ip) {
}

private boolean containsAddress(IPAddress ipAddress) {
for (IPAddress subnet : ipAddresses) {
if (subnet.contains(ipAddress)) {
return true;
}
}
return false;
return ipAddresses.elementContains(ipAddress);
}
public int length() {
return ipAddresses.size();
Expand Down
Loading