-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathshort-domain-finder.go
147 lines (118 loc) · 3.16 KB
/
short-domain-finder.go
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
package main
import (
"errors"
"flag"
"fmt"
"github.com/likexian/whois"
"os"
"regexp"
"strings"
)
const (
UNREGISTERED_DOMAIN_REGEX = "^No match|^NOT FOUND|^Not fo|AVAILABLE|^No Data Fou|has not been regi|No entri|^Invalid query or domain name not known in"
LEN_ALPHABET = 26
)
func whoisDomainLookup(domain string) (string, error) {
if domain == "" {
return "", errors.New("No domain provided to whoisDomainLookup function")
}
result, err := whois.Whois(domain)
if err != nil {
return "", err
}
return result, nil
}
// check if the domain's whois page matches a "NOT REGISTERED" or equivalent
func isDomainAvailable(domain string) bool {
whoisResult, err := whoisDomainLookup(domain)
if err != nil {
fmt.Fprintln(os.Stderr, err)
return false
}
isAvailable, err := regexp.MatchString(UNREGISTERED_DOMAIN_REGEX, whoisResult)
if err != nil {
fmt.Fprintln(os.Stderr, err)
return false
}
return isAvailable
}
func getAlphabet() []byte {
p := make([]byte, LEN_ALPHABET)
for i := range p {
p[i] = 'a' + byte(i)
}
return p
}
func getPermutations(b byte, alphabet []byte) []string {
r := make([]string, len(alphabet))
for i, v := range alphabet {
r[i] = strings.Join([]string{string(b), string(v)}, "")
}
return r
}
func outputer(resultChan chan string, completed chan bool) {
for {
domain, ok := <-resultChan
if !ok {
completed <- true
return
}
fmt.Println(domain)
}
}
func worker(workerChan, resultChan chan string, completed chan bool) {
for {
domain, ok := <-workerChan
if !ok {
completed <- true
return
}
isAvailable := isDomainAvailable(domain)
if isAvailable {
resultChan <- domain
}
}
}
func dispatcher(workerChan chan string, exts []string, maxLen int) {
alphabet := getAlphabet()
var recurse func(domain string, depth int)
recurse = func(domain string, depth int) {
if depth == 0 {
return
}
for _, l := range alphabet {
for _, ext := range exts {
newDomain := strings.Join([]string{domain, string(l)}, "")
workerChan <- strings.Join([]string{newDomain, ext}, ".")
recurse(newDomain, depth-1)
}
}
}
recurse("", maxLen)
// close the workerChan so the worker can know it's final job
close(workerChan)
}
func main() {
extsFlag := flag.String("exts", "tk,ml,cf", "List of domain extensions (ie. .com, .io)") // ga, gq is not supported for now...
lenFlag := flag.Int("len", 3, "Maximum length of domain name")
sepFlag := flag.String("sep", ",", "Char used to separate the list of domain extensions")
workersFlag := flag.Int("workers", 10, "Number of worker to query whois in parallel. Too many may overwhelm the service and get you blocked")
flag.Parse()
exts := strings.Split(*extsFlag, *sepFlag)
maxLen := *lenFlag
numOfWorkers := *workersFlag
workerChan := make(chan string, 3*numOfWorkers)
resultChan := make(chan string, 3*numOfWorkers)
completed := make(chan bool, 10)
go dispatcher(workerChan, exts, maxLen)
go outputer(resultChan, completed)
for i := 0; i < numOfWorkers; i++ {
go worker(workerChan, resultChan, completed)
}
for i := 0; i < numOfWorkers; i++ {
<-completed
}
close(resultChan)
// wait until outputerService finishes
<-completed
}