This repository was archived by the owner on Sep 2, 2025. It is now read-only.
forked from zaccone/spf
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathparser.go
More file actions
940 lines (815 loc) · 24.1 KB
/
parser.go
File metadata and controls
940 lines (815 loc) · 24.1 KB
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
package spf
import (
"fmt"
"net"
"strconv"
"strings"
"sync"
"time"
"github.com/redsift/spf/v2/spferr"
)
func matchingResult(qualifier tokenType) (Result, error) {
switch qualifier {
case qPlus:
return Pass, nil
case qMinus:
return Fail, nil
case qQuestionMark:
return Neutral, nil
case qTilde:
return Softfail, nil
default:
return internalError, NewSpfError(spferr.KindValidation, fmt.Errorf("invalid qualifier"), nil)
}
}
// SpfError represents errors created from parsing or validation, it holds reference to faulty token
// as well as error describing fault
type SpfError struct {
kind spferr.Kind
token *token
err error
}
func NewSpfError(k spferr.Kind, e error, t *token) error {
return SpfError{kind: k, token: t, err: e}
}
func (e SpfError) Error() string {
var (
p strings.Builder
cause = error(e)
)
for {
var (
t *token
next bool
)
t, cause, next = Unwrap(cause)
if !next {
break
}
if p.Len() > 0 {
p.WriteByte(' ')
}
p.WriteString(t.String())
}
m := strings.Builder{}
m.WriteString(cause.Error())
if p.Len() > 0 {
m.WriteByte(' ')
m.WriteByte('[')
m.WriteString(strings.TrimSuffix(p.String(), " "))
m.WriteByte(']')
}
return m.String()
}
func wrap(t *token, err error) error {
// try to grab the original error kind
if st, ok := err.(SpfError); ok {
return NewSpfError(st.Kind(), st, t)
} else {
return NewSpfError(spferr.KindSyntax, err, t)
}
}
func Unwrap(e error) (*token, error, bool) {
se, ok := e.(SpfError)
if ok {
return se.token, se.err, true
}
return nil, e, false
}
func Cause(e error) (string, error) {
var t, lastToken *token
for next := true; next; t, e, next = Unwrap(e) {
if t != nil {
lastToken = t
}
}
return lastToken.String(), e
}
func (e SpfError) Unwrap() error {
return e.err
}
func (e SpfError) Cause() error {
return e.err
}
func (e SpfError) TokenString() string {
return e.token.String()
}
func (e SpfError) Kind() spferr.Kind {
return e.kind
}
// parser represents parsing structure. It keeps all arguments provided by top
// level CheckHost method as well as tokenized terms from TXT RR. One should
// call parser.Parse() for a proper SPF evaluation.
type parser struct {
sender string
domain string
heloDomain string
ip net.IP
query string
resolver Resolver
listener Listener
ignoreMatches bool
options []Option
visited *stringsStack
evaluatedOn time.Time
receivingFQDN string
stopAtError func(error) bool
partialMacros bool
fireFirstMatchOnce *sync.Once
}
// newParser creates new Parser objects and returns its reference.
// It accepts CheckHost() parameters as well as SPF query (fetched from TXT RR
// during initial DNS lookup.
func newParser(opts ...Option) *parser {
return newParserWithVisited(newStringsStack(), new(sync.Once), opts...)
}
// newParserWithVisited creates new Parser objects with prepopulated map of visited domains and returns its reference.
// It accepts CheckHost() parameters as well as SPF query (fetched from TXT RR
// during initial DNS lookup.
func newParserWithVisited(visited *stringsStack, fireFirstMatchOnce *sync.Once, opts ...Option) *parser {
p := &parser{
// mechanisms: make([]*token, 0, 10),
resolver: NewLimitedResolver(&DNSResolver{}, 10, 10, 2),
options: opts,
visited: visited,
receivingFQDN: "unknown",
evaluatedOn: time.Now().UTC(),
fireFirstMatchOnce: fireFirstMatchOnce,
}
for _, opt := range opts {
opt(p)
}
return p
}
// checkHostWithResolver does checking with custom Resolver.
// Note, that DNS lookup limits need to be enforced by provided Resolver.
//
// The function returns result of verification, explanations as result of "exp=",
// and error as the reason for the encountered problem.
func (p *parser) checkHost(ip net.IP, domain, sender string) (r Result, expl string, spf string, err error) {
var u unused
var extras *ResponseExtras
p.fireCheckHost(ip, domain, sender)
defer func() {
p.fireCheckHostResult(r, expl, extras, err)
for _, t := range u.mechanisms {
p.fireUnusedDirective(t)
}
// Is inspect mode tokens are handled as is; no sorting applied
// and thus u.mechanisms have redirect, if it is in the tree and has not been met
if !p.ignoreMatches {
p.fireUnusedDirective(u.redirect)
}
}()
/*
* As per RFC 7208 Section 4.3:
* If the <domain> is malformed (e.g., label longer than 63
* characters, zero-length label not at the end, etc.) or is not
* a multi-label
* domain name, [...], check_host() immediately returns None
*/
if !isDomainName(domain) {
return None, "", "", newInvalidDomainError(domain)
}
if p.visited.has(NormalizeFQDN(domain)) {
return Permerror, "", "", NewSpfError(spferr.KindValidation, ErrLoopDetected, nil)
}
var txts []string
txts, extras, err = p.resolver.LookupTXTStrict(NormalizeFQDN(domain))
p.fireLookupExtras(nil, domain, extras)
// If the resultant record set includes no records, check_host()
// produces the "none" result. If the resultant record set includes
// more than one record, check_host() produces the "permerror" result.
candidates, policies := FilterSPFCandidates(txts)
p.fireTXT(candidates, policies)
switch err {
case nil:
// continue
case ErrDNSLimitExceeded:
return Permerror, "", "", NewSpfError(spferr.KindDNS, err, nil)
case ErrDNSPermerror:
return None, "", "", NewSpfError(spferr.KindDNS, err, nil)
default:
return Temperror, "", "", NewSpfError(spferr.KindDNS, err, nil)
}
if len(policies) == 0 {
return None, "", "", NewSpfError(spferr.KindValidation,
&PolicyDeploymentError{Err: ErrSPFNotFound, Domain: domain}, nil)
}
if len(policies) > 1 {
return Permerror, "", "", NewSpfError(spferr.KindValidation,
&PolicyDeploymentError{Err: ErrTooManySPFRecords, Domain: domain, Policies: policies}, nil)
}
spf = policies[0]
r, expl, u, err = newParserWithVisited(p.visited, p.fireFirstMatchOnce, p.options...).with(spf, sender, domain, ip).check()
return
}
func (p *parser) with(query, sender, domain string, ip net.IP) *parser {
p.query = query
p.sender = sender
p.domain = domain
p.ip = ip
return p
}
type unused struct {
mechanisms []*token
redirect *token
}
func (p *parser) observe(tokens []*token) (Result, string, unused, error) {
mechanisms, _, _, _, err := sortTokens(tokens)
if err != nil {
return Permerror, "", unused{mechanisms, nil}, err
}
var (
token *token
i int
result = Neutral
)
for i, token = range tokens {
match := false
switch token.mechanism {
case tVersion:
match, result, err = p.parseVersion(token)
case tAll:
match, result, err = p.parseAll(token)
case tA:
match, result, _, err = p.parseA(token)
case tIP4:
match, result, err = p.parseIP4(token)
case tIP6:
match, result, err = p.parseIP6(token)
case tMX:
match, result, _, err = p.parseMX(token)
case tInclude:
match, result, err = p.parseInclude(token)
case tExists:
match, result, _, err = p.parseExists(token)
case tPTR:
match, result, _, err = p.parsePtr(token)
case tRedirect:
result, _ = p.handleRedirect(token)
case tExp:
exp, _ := p.handleExplanation(token)
p.fireDirective(token, exp)
default:
p.fireDirective(token, "")
}
// Store the first match result if not already set
if match {
p.fireFirstMatch(result, err)
}
p.fireNonMatch(token, result, err)
// in walker-mode we want to count number of errors and check the counter against some threshold
if p.stopAtError != nil && p.stopAtError(err) {
return unreliableResult, "", unused{tokens[i+1:], nil}, ErrTooManyErrors
}
// all expected errors should be thrown with match=true
// others are being registered by listener
}
return unreliableResult, "", unused{}, ErrUnreliableResult
}
func (p *parser) evaluate(tokens []*token) (Result, string, unused, error) {
mechanisms, redirect, explanation, _, err := sortTokens(tokens)
if err != nil {
return Permerror, "", unused{mechanisms, redirect}, err
}
var (
token *token
i int
all bool
result = Neutral
)
for i, token = range mechanisms {
var (
match bool
extras *ResponseExtras
)
switch token.mechanism {
case tVersion:
match, result, err = p.parseVersion(token)
case tAll:
all = true
match, result, err = p.parseAll(token)
case tA:
match, result, extras, err = p.parseA(token)
case tIP4:
match, result, err = p.parseIP4(token)
case tIP6:
match, result, err = p.parseIP6(token)
case tMX:
match, result, extras, err = p.parseMX(token)
case tInclude:
match, result, err = p.parseInclude(token)
case tExists:
match, result, extras, err = p.parseExists(token)
case tPTR:
match, result, extras, err = p.parsePtr(token)
default:
p.fireDirective(token, "")
}
if match {
var s string
if result == Fail && explanation != nil {
s, err = p.handleExplanation(explanation)
}
p.fireMatch(token, result, s, extras, err)
return result, s, unused{mechanisms[i+1:], redirect}, err
}
p.fireNonMatch(token, result, err)
// all expected errors should be thrown with match=true
// others are being registered by listener
}
if !all {
result, err = p.handleRedirect(redirect)
}
return result, "", unused{}, err
}
// check aggregates all steps required for SPF evaluation.
// After lexing and tokenizing step it sorts tokens (and returns Permerror if
// there is any syntax error) and starts evaluating
// each token (from left to right). Once a token matches parse stops and
// returns matched result.
func (p *parser) check() (Result, string, unused, error) {
p.visited.push(p.domain)
defer p.visited.pop()
p.fireSPFRecord(p.query)
tokens := lex(p.query)
if p.ignoreMatches {
return p.observe(tokens)
}
return p.evaluate(tokens)
}
func (p *parser) fireCheckHost(ip net.IP, domain, sender string) {
if p.listener == nil {
return
}
p.listener.CheckHost(ip, domain, sender)
}
func (p *parser) fireCheckHostResult(r Result, explanation string, extras *ResponseExtras, e error) {
if p.listener == nil {
return
}
p.listener.CheckHostResult(r, explanation, extras, e)
}
func (p *parser) fireSPFRecord(s string) {
if p.listener == nil {
return
}
p.listener.SPFRecord(s)
}
func (p *parser) fireDirective(t *token, effectiveValue string) {
if p.listener == nil {
return
}
p.listener.Directive(false, t.qualifier.String(), t.mechanism.String(), t.key, t.value, effectiveValue)
}
func (p *parser) fireMatchingIP(t *token, fqdn string, ipn net.IPNet, host string, ip net.IP) {
if p.listener == nil {
return
}
p.listener.MatchingIP(t.qualifier.String(), t.mechanism.String(), t.value, fqdn, ipn, host, ip)
}
func (p *parser) fireUnusedDirective(t *token) {
if p.listener == nil || t == nil {
return
}
p.listener.Directive(true, t.qualifier.String(), t.mechanism.String(), t.key, t.value, "")
}
func (p *parser) fireNonMatch(t *token, r Result, e error) {
if p.listener == nil {
return
}
p.listener.NonMatch(t.qualifier.String(), t.mechanism.String(), t.value, r, e)
}
func (p *parser) fireMatch(t *token, r Result, explanation string, extras *ResponseExtras, e error) {
if p.listener == nil {
return
}
p.listener.Match(t.qualifier.String(), t.mechanism.String(), t.value, r, explanation, extras, e)
}
func (p *parser) fireLookupExtras(t *token, fqdn string, extras *ResponseExtras) {
if p.listener == nil {
return
}
if t == nil {
p.listener.LookupExtras("", "", "", fqdn, extras)
return
}
p.listener.LookupExtras(t.qualifier.String(), t.mechanism.String(), t.value, fqdn, extras)
}
func (p *parser) fireTXT(candidates, policies []string) {
if p.listener == nil {
return
}
p.listener.TXT(candidates, policies)
}
func (p *parser) fireFirstMatch(r Result, e error) {
if p.listener == nil || p.fireFirstMatchOnce == nil {
return
}
p.fireFirstMatchOnce.Do(func() {
p.listener.FirstMatch(r, e)
})
}
func sortTokens(tokens []*token) (mechanisms []*token, redirect, explanation *token, unknownModifiers []*token, err error) {
mechanisms = make([]*token, 0, len(tokens))
for _, token := range tokens {
if token.isErr() {
err = NewSpfError(spferr.KindSyntax, ErrSyntaxError, token)
return
}
if token.mechanism.isMechanism() {
mechanisms = append(mechanisms, token)
continue
}
if token.mechanism == tRedirect {
if redirect != nil {
err = ErrTooManyRedirects
return
}
redirect = token
}
if token.mechanism == tExp {
if explanation != nil {
err = ErrTooManyExps
return
}
explanation = token
continue
}
if token.mechanism == tUnknownModifier {
unknownModifiers = append(unknownModifiers, token)
}
}
return
}
// For several mechanisms, the <domain-spec> is optional. If it is not
// provided, the <domain> from the check_host() arguments is used.
func domainSpec(s, def string) string {
if s == "" {
return def
}
if s[0] == '/' { // special case for (mx|a) dual-cidr-length
return def + s
}
return s
}
func (p *parser) parseVersion(t *token) (bool, Result, error) {
p.fireDirective(t, "")
if t.value == "spf1" {
return false, None, nil
}
return true, Permerror, NewSpfError(spferr.KindSyntax, fmt.Errorf("invalid version: %v", t.value), t)
}
func (p *parser) parseAll(t *token) (bool, Result, error) {
p.fireDirective(t, "")
result, err := matchingResult(t.qualifier)
if err != nil {
return true, Permerror, NewSpfError(spferr.KindSyntax, err, t)
}
return true, result, nil
}
func (p *parser) parseIP4(t *token) (bool, Result, error) {
p.fireDirective(t, t.value)
result, _ := matchingResult(t.qualifier)
if ip, ipnet, err := net.ParseCIDR(t.value); err == nil {
if ip.To4() == nil {
return true, Permerror, NewSpfError(spferr.KindSyntax, ErrNotIPv4, t)
}
return ipnet.Contains(p.ip), result, nil
}
ip := net.ParseIP(t.value).To4()
if ip == nil {
return true, Permerror, NewSpfError(spferr.KindSyntax, ErrNotIPv4, t)
}
return ip.Equal(p.ip), result, nil
}
func (p *parser) parseIP6(t *token) (bool, Result, error) {
p.fireDirective(t, t.value)
result, _ := matchingResult(t.qualifier)
if ip, ipnet, err := net.ParseCIDR(t.value); err == nil {
if ip.To16() == nil {
return true, Permerror, NewSpfError(spferr.KindSyntax, ErrNotIPv6, t)
}
return ipnet.Contains(p.ip), result, nil
}
ip := net.ParseIP(t.value)
if ip.To4() != nil || ip.To16() == nil {
return true, Permerror, NewSpfError(spferr.KindSyntax, ErrNotIPv6, t)
}
return ip.Equal(p.ip), result, nil
}
func (p *parser) parseA(t *token) (bool, Result, *ResponseExtras, error) {
fqdn, ip4Mask, ip6Mask, err := splitDomainDualCIDR(domainSpec(t.value, p.domain))
if err == nil {
fqdn, _, err = parseMacro(p, fqdn, false)
}
if err == nil {
fqdn, err = truncateFQDN(fqdn)
}
if err == nil && !isDomainName(fqdn) {
err = newInvalidDomainError(fqdn)
}
fqdn = NormalizeFQDN(fqdn)
p.fireDirective(t, fqdn)
if err != nil {
return true, Permerror, nil, NewSpfError(spferr.KindSyntax, err, t)
}
result, _ := matchingResult(t.qualifier)
found, extras, err := p.resolver.MatchIP(fqdn, func(ip net.IP, host string) (bool, error) {
n := net.IPNet{
IP: ip,
}
switch len(ip) {
case net.IPv4len:
n.Mask = ip4Mask
case net.IPv6len:
n.Mask = ip6Mask
}
p.fireMatchingIP(t, fqdn, n, host, p.ip)
return n.Contains(p.ip), nil
})
p.fireLookupExtras(t, fqdn, extras)
if err != nil {
return found, result, nil, NewSpfError(spferr.KindDNS, err, nil)
}
return found, result, extras, err
}
func (p *parser) parseMX(t *token) (bool, Result, *ResponseExtras, error) {
fqdn, ip4Mask, ip6Mask, err := splitDomainDualCIDR(domainSpec(t.value, p.domain))
if err == nil {
fqdn, _, err = parseMacro(p, fqdn, false)
}
if err == nil {
fqdn, err = truncateFQDN(fqdn)
}
if err == nil && !isDomainName(fqdn) {
err = newInvalidDomainError(fqdn)
}
fqdn = NormalizeFQDN(fqdn)
p.fireDirective(t, fqdn)
if err != nil {
return true, Permerror, nil, NewSpfError(spferr.KindSyntax, err, t)
}
result, _ := matchingResult(t.qualifier)
found, extras, err := p.resolver.MatchMX(fqdn, func(ip net.IP, host string) (bool, error) {
n := net.IPNet{
IP: ip,
}
switch len(ip) {
case net.IPv4len:
n.Mask = ip4Mask
case net.IPv6len:
n.Mask = ip6Mask
}
p.fireMatchingIP(t, fqdn, n, host, p.ip)
return n.Contains(p.ip), nil
})
p.fireLookupExtras(t, fqdn, extras)
if err != nil {
return true, Permerror, nil, NewSpfError(spferr.KindDNS, err, t)
}
return found, result, extras, err
}
func (p *parser) parseInclude(t *token) (bool, Result, error) {
domain, missingMacros, err := parseMacro(p, t.value, false)
if err == nil {
domain, err = truncateFQDN(domain)
}
if err == nil && !isDomainName(domain) {
err = newInvalidDomainError(domain)
}
if len(missingMacros) > 0 {
err = newMissingMacrosError(domain, missingMacros)
}
domain = NormalizeFQDN(domain)
p.fireDirective(t, domain)
if err != nil {
return true, Permerror, NewSpfError(spferr.KindSyntax, err, t)
}
if domain == "" {
return true, Permerror, NewSpfError(spferr.KindSyntax, ErrEmptyDomain, t)
}
theirResult, _, _, err := p.checkHost(p.ip, domain, p.sender)
/* Adhere to following result table:
* +---------------------------------+---------------------------------+
| A recursive check_host() result | Causes the "include" mechanism |
| of: | to: |
+---------------------------------+---------------------------------+
| pass | match |
| | |
| fail | not match |
| | |
| softfail | not match |
| | |
| neutral | not match |
| | |
| temperror | return temperror |
| | |
| permerror | return permerror |
| | |
| none | return permerror |
+---------------------------------+---------------------------------+
*/if err != nil {
err = wrap(t, err)
}
switch theirResult {
case Pass:
ourResult, _ := matchingResult(t.qualifier)
return true, ourResult, err
case Fail, Softfail, Neutral:
return false, None, err
case Temperror:
return true, Temperror, err
case None, Permerror:
return true, Permerror, err
case unreliableResult: // ignoreMatches enabled
return true, Permerror, ErrUnreliableResult
default: // this should actually never happen; but better error than panic
return true, Permerror, fmt.Errorf("internal error: unknown result %s for %s", theirResult, t)
}
}
func (p *parser) parseExists(t *token) (bool, Result, *ResponseExtras, error) {
resolvedDomain, missingMacros, err := parseMacroToken(p, t)
if err == nil {
resolvedDomain, err = truncateFQDN(resolvedDomain)
}
if err == nil && !isDomainName(resolvedDomain) {
err = newInvalidDomainError(resolvedDomain)
}
if len(missingMacros) > 0 {
err = newMissingMacrosError(resolvedDomain, missingMacros)
}
resolvedDomain = NormalizeFQDN(resolvedDomain)
p.fireDirective(t, resolvedDomain)
if err != nil {
return true, Permerror, nil, NewSpfError(spferr.KindSyntax, err, t)
}
if resolvedDomain == "" {
return true, Permerror, nil, NewSpfError(spferr.KindSyntax, ErrEmptyDomain, t)
}
result, _ := matchingResult(t.qualifier)
found, extras, err := p.resolver.Exists(resolvedDomain)
p.fireLookupExtras(t, resolvedDomain, extras)
switch err {
case nil:
return found, result, extras, nil
case ErrDNSPermerror:
return false, result, nil, nil
default:
return false, Temperror, nil, NewSpfError(spferr.KindDNS, err, nil) // was true 8-|
}
}
// https://www.rfc-editor.org/rfc/rfc7208#section-5.5
func (p *parser) parsePtr(t *token) (bool, Result, *ResponseExtras, error) {
fqdn := domainSpec(t.value, p.domain)
fqdn, _, err := parseMacro(p, fqdn, false)
if err == nil {
fqdn, err = truncateFQDN(fqdn)
}
if err == nil && !isDomainName(fqdn) {
err = newInvalidDomainError(fqdn)
}
fqdn = NormalizeFQDN(fqdn)
p.fireDirective(t, fqdn)
if err != nil {
return true, Permerror, nil, NewSpfError(spferr.KindSyntax, err, t)
}
ptrs, extras, err := p.resolver.LookupPTR(p.ip.String())
p.fireLookupExtras(t, fqdn, extras)
switch err {
case nil:
// continue
case ErrDNSLimitExceeded:
return false, Permerror, extras, NewSpfError(spferr.KindDNS, err, nil)
case ErrDNSPermerror:
return false, None, extras, NewSpfError(spferr.KindDNS, err, nil)
default:
return false, Temperror, extras, NewSpfError(spferr.KindDNS, err, nil)
}
result, _ := matchingResult(t.qualifier)
for _, ptrDomain := range ptrs {
found, _, err := p.resolver.MatchIP(ptrDomain, func(ip net.IP, host string) (bool, error) {
if ip.Equal(p.ip) {
// Check if the PTR domain matches the target name or is a subdomain of the target name
if strings.HasSuffix(ptrDomain, fqdn) || fqdn == ptrDomain {
return true, nil // Match found
}
}
return false, nil
})
if err != nil {
continue
}
if found {
return true, result, nil, nil
}
}
return false, Fail, nil, nil
}
func (p *parser) handleRedirect(t *token) (Result, error) {
if t == nil {
return Neutral, nil
}
var (
err error
result Result
)
domain, _, err := parseMacro(p, t.value, false)
if err == nil {
domain, err = truncateFQDN(domain)
}
if err == nil && !isDomainName(domain) {
err = newInvalidDomainError(domain)
}
redirectDomain := NormalizeFQDN(domain)
p.fireDirective(t, redirectDomain)
if err != nil {
return Permerror, NewSpfError(spferr.KindSyntax, err, t)
}
if result, _, _, err = p.checkHost(p.ip, redirectDomain, p.sender); err != nil {
// TODO(zaccone): confirm result value
result = Permerror
} else if result == None || result == Permerror {
// See RFC7208, section 6.1
//
// if no SPF record is found, or if the <target-name> is malformed, the
// result is a "permerror" rather than "none".
result = Permerror
}
return result, err
}
func (p *parser) handleExplanation(t *token) (string, error) {
domain, _, err := parseMacroToken(p, t)
if err != nil {
return "", NewSpfError(spferr.KindSyntax, err, t)
}
if domain == "" {
return "", NewSpfError(spferr.KindSyntax, ErrEmptyDomain, t)
}
domain, err = truncateFQDN(domain)
if err != nil {
return "", NewSpfError(spferr.KindSyntax, err, t)
}
if !isDomainName(domain) {
return "", NewSpfError(spferr.KindSyntax, newInvalidDomainError(domain), t)
}
txts, _, err := p.resolver.LookupTXT(NormalizeFQDN(domain))
if err != nil {
return "", NewSpfError(spferr.KindDNS, err, t)
}
// RFC 7208, section 6.2 specifies that result strings should be
// concatenated with no spaces.
// TODO URL escaping MUST be performed for characters
// not in the "unreserved" set, which is defined in [RFC3986].
// https://tools.ietf.org/html/rfc7208#section-7.3
// looks like we need to do it after truncating
exp, _, err := parseMacro(p, strings.Join(txts, ""), true)
if err != nil {
return "", NewSpfError(spferr.KindSyntax, err, t)
}
return exp, nil
}
func parseCIDRMask(s string, bits int) (net.IPMask, error) {
if s == "" {
return net.CIDRMask(bits, bits), nil
}
var (
l int
err error
)
if l, err = strconv.Atoi(s); err != nil {
return nil, ErrInvalidCIDRLength
}
mask := net.CIDRMask(l, bits)
if mask == nil {
return nil, ErrInvalidCIDRLength
}
return mask, nil
}
func splitDomainDualCIDR(domain string) (string, net.IPMask, net.IPMask, error) {
var (
ip4Mask net.IPMask
ip6Mask net.IPMask
ip4Len string
ip6Len string
err error
)
parts := strings.SplitN(domain, "/", 3)
domain = parts[0]
if len(parts) > 1 {
ip4Len = parts[1]
}
if len(parts) > 2 {
ip6Len = parts[2]
}
ip4Mask, err = parseCIDRMask(ip4Len, 8*net.IPv4len)
if err != nil {
return "", nil, nil, err
}
ip6Mask, err = parseCIDRMask(ip6Len, 8*net.IPv6len)
if err != nil {
return "", nil, nil, err
}
return domain, ip4Mask, ip6Mask, nil
}