hath: Hath manipulates network blocks in CIDR notation.
|Versions||0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.1.0, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.3.0, 0.4.1, 0.4.2|
|Dependencies||base (==4.6.*), bytestring (==0.10.*), cmdargs (==0.10.*), dns (==1.*), HUnit (==1.2.*), MissingH (==1.2.*), parallel‑io (==0.3.*), QuickCheck (==2.6.*), split (==0.2.*), test‑framework (==0.8.*), test‑framework‑hunit (==0.3.*), test‑framework‑quickcheck2 (==0.3.*) [details]|
|Maintainer||Michael Orlitzky <email@example.com>|
|Source repo||head: git clone http://michael.orlitzky.com/git/hath.git -b master|
|Uploaded||by MichaelOrlitzky at Mon Oct 14 19:34:38 UTC 2013|
|Downloads||4739 total (43 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by rule of succession]|
|Status||Docs uploaded by user [build log]
All reported builds failed [all 1 reports]
Hackage Matrix CI
Hath is a Haskell program for working with network blocks in CIDR notation. When dealing with blocks of network addresses, there are a few things that one usually wants to do with them:
Create a regular expression matching the CIDR block(s). This is because grep will throw up if you feed it CIDR.
Combine small blocks into larger ones. For example, if you have two consecutive /24s, they might combine into a larger /23.
View the result of block combination in a useful way.
Find their associated PTR records.
Hath has several modes to perform these functions:
- This computes a (Perl-compatible) regular expression matching the input CIDR blocks. It's the default mode of operation.
- This combines small blocks into larger ones where possible, and eliminates redundant blocks. The output should be equivalent to the input, though.
- Shows only the blocks that would be removed by reduce; that is, it shows the ones that would get combined into larger blocks or are simply redundant.
- Shows what would change if you used reduce. Uses diff-like notation.
- List the IP addresses contained within the given CIDRs.
- Perform reverse DNS (PTR) lookups on the IP addresses contained within the given CIDRs.
Compute a (Perl-compatible) regular expression matching the input CIDR blocks. It's the default mode of operation.
$ hath <<< "10.0.0.0/29 10.0.0.8/29" ((10).(0).(0).(0|1|2|3|4|5|6|7|8|9|10|11|12|13|14|15))
Combine two /24s into a /23:
$ hath reduced <<< "10.0.0.0/24 10.0.1.0/24" 10.0.0.0/23
List the addresses in 192.168.0.240/29:
$ hath listed <<< "192.168.0.240/29" 192.168.0.240 192.168.0.241 192.168.0.242 192.168.0.243 192.168.0.244 192.168.0.245 192.168.0.246 192.168.0.247
Perform PTR lookups on all of 220.127.116.11/30:
$ hath reversed <<< "18.104.22.168/30" 22.214.171.124: a.root-servers.net. 126.96.36.199: 188.8.131.52: rs.internic.net. 184.108.40.206:
The DNS lookups are usually the bottleneck for this mode, but we can perform them in parallel. Simply pass the number of threads to the GHC runtime on the command line; for example, the following will perform 25 lookups in parallel:
$ hath reversed +RTS -N25 <<< "220.127.116.11/24" 18.104.22.168: a.root-servers.net. 22.214.171.124: 126.96.36.199: rs.internic.net. ...
The command-line syntax and complete set of options are documented in the man page.
For package maintainers and hackage trustees