mirror of
https://github.com/urbanadventurer/WhatWeb
synced 2026-06-21 14:12:19 +00:00
Andrew Horton
134 lines
4.0 KiB
Ruby
134 lines
4.0 KiB
Ruby
##
|
|
# This file is part of WhatWeb and may be subject to
|
|
# redistribution and commercial restrictions. Please see the WhatWeb
|
|
# web site for more information on licensing and terms of use.
|
|
# https://morningstarsecurity.com/research/whatweb
|
|
##
|
|
Plugin.define do
|
|
name "Country"
|
|
authors [
|
|
"Andrew Horton",
|
|
# v0.2 # display full country names
|
|
# v0.3 # fix crash with ipv6 addresses, update comments, update database
|
|
"Code0x58", # v0.4 # new plugin behaviour
|
|
]
|
|
version "0.4"
|
|
description "Shows the country the IPv4 address belongs to. This uses the GeoIP IP2Country database from http://software77.net/geo-ip/. Instructions on updating the database are in the plugin comments."
|
|
|
|
# Lookup code developed by Matthias Wachter for rubyquiz.com and used with permission.
|
|
# Local IPv4 addresses are represented as ZZ according to an ISO convention.
|
|
|
|
# How to Update Database
|
|
# ----------------------
|
|
# rm plugins/country-ips.dat plugins/IpToCountry.csv
|
|
# wget software77.net/geo-ip/?DL=1 -O plugins/IpToCountry.csv.gz
|
|
# gzip -d plugins/IpToCountry.csv.gz
|
|
# then run whatweb on a URL, it will automatically make the country-ips.dat file
|
|
|
|
|
|
def startup
|
|
# ok, set up rfile. open once.
|
|
whatweb_folder = File.expand_path(File.dirname(__FILE__))
|
|
country_db = whatweb_folder + "/country-ips.dat"
|
|
|
|
if File.exist?(country_db)
|
|
rfile = File.open(country_db, "rb")
|
|
else
|
|
if File.exist?(whatweb_folder + "/IpToCountry.csv")
|
|
# pack that file & do it once
|
|
last_start = nil
|
|
last_end = nil
|
|
last_country = nil
|
|
File.open(whatweb_folder + "/country-ips.dat","wb") do |wfile|
|
|
IO.foreach(whatweb_folder + "/IpToCountry.csv") do |line|
|
|
next if line !~ /^"/
|
|
s, e, _, _, co = line.delete!("\"").split(",")
|
|
s,e = s.to_i, e.to_i
|
|
if !last_start
|
|
# initialize with first entry
|
|
last_start,last_end,last_country = s, e, co
|
|
else
|
|
if s == last_end + 1 and co == last_country
|
|
# squeeze if successive ranges have zero gap
|
|
last_end = e
|
|
else
|
|
# append last entry, remember new one
|
|
wfile << [last_start, last_end, last_country].pack("NNa2")
|
|
last_start, last_end, last_country = s, e, co
|
|
end
|
|
end
|
|
end
|
|
# print last entry
|
|
if last_start
|
|
wfile << [last_start, last_end, last_country].pack("NNa2")
|
|
end
|
|
end
|
|
# open the DB now
|
|
rfile = File.open(country_db, "rb")
|
|
end
|
|
end
|
|
|
|
f = whatweb_folder + "/country-codes.txt"
|
|
ccnames = {}
|
|
File.open(f, "r:UTF-8").readlines.each do |line|
|
|
country, code, _, _ = line.split(",")
|
|
ccnames[code] = country
|
|
end
|
|
|
|
# TODO: load rfile into memory as it is under 1MiB and spares a load of seeks
|
|
@variables = {
|
|
rfile: rfile,
|
|
ccnames: ccnames,
|
|
mutex: Mutex.new, # for access to rfile
|
|
}
|
|
|
|
end
|
|
|
|
passive do
|
|
m = []
|
|
rfile = @variables[:rfile]
|
|
ccnames = @variables[:ccnames]
|
|
mutex = @variables[:mutex]
|
|
|
|
if rfile and @ip and @ip =~ /^([0-9]{1,3}\.){3}[0-9]{1,3}$/
|
|
mutex.synchronize do
|
|
rfile.seek(0, IO::SEEK_END)
|
|
record_max = rfile.pos / 10 - 1
|
|
|
|
# build a 4-char string representation of IP address
|
|
# in network byte order so it can be a string compare below
|
|
ipstr = @ip.split(".").map {|x| x.to_i.chr}.join
|
|
|
|
# low/high water marks initialized
|
|
low, high = 0, record_max
|
|
loop do
|
|
mid = (low + high) / 2 # binary search median
|
|
rfile.seek(10 * mid) # one record is 10 byte, seek to position
|
|
str = rfile.read(8) # for range matching, we need only 8 bytes
|
|
# at comparison, values are big endian, i.e. packed("N")
|
|
if ipstr >= str[0, 4] # is this IP not below the current range?
|
|
if ipstr <= str[4, 4] # is this IP not above the current range?
|
|
#puts # a perfect match, voila!
|
|
cc = rfile.read(2)
|
|
m << {string: ccnames[cc], module: cc}
|
|
break
|
|
else
|
|
low = mid + 1 # binary search: raise lower limit
|
|
end
|
|
else
|
|
high = mid - 1 # binary search: reduce upper limit
|
|
end
|
|
|
|
if low > high # no entries left? nothing found
|
|
#m << {:string=>"No country"}
|
|
break
|
|
end
|
|
|
|
end
|
|
end
|
|
end
|
|
m
|
|
end
|
|
end
|
|
|