forked from keybase/client
/
identify_state.go
151 lines (129 loc) · 3.59 KB
/
identify_state.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
148
149
150
151
// Copyright 2015 Keybase, Inc. All rights reserved. Use of
// this source code is governed by the included BSD license.
package libkb
import keybase1 "github.com/keybase/client/go/protocol"
type IdentifyState struct {
res *IdentifyOutcome
u *User
track *TrackLookup
}
func NewIdentifyState(res *IdentifyOutcome, u *User) IdentifyState {
if res == nil {
res = NewIdentifyOutcomeWithUsername(u.GetName())
}
return IdentifyState{res: res, u: u}
}
func (s *IdentifyState) SetTrackLookup(t *TrackChainLink) {
s.track = NewTrackLookup(t)
if s.res != nil {
s.res.TrackUsed = s.track
}
}
func (s *IdentifyState) TrackLookup() *TrackLookup {
return s.track
}
func (s *IdentifyState) HasPreviousTrack() bool {
return s.track != nil
}
func (s *IdentifyState) Result() *IdentifyOutcome {
return s.res
}
func (s *IdentifyState) computeRevokedProofs() {
if s.track == nil {
return
}
found := s.res.TrackSet()
tracked := s.track.set
// These are the proofs that we previously tracked that we
// didn't observe in the current profile
diff := (*tracked).Subtract(*found)
for _, e := range diff {
// If the proofs in the difference are for GOOD proofs,
// the we have a problem. Mark the proof as "REVOKED"
if e.GetProofState() == keybase1.ProofState_OK {
s.res.Revoked = append(s.res.Revoked, TrackDiffRevoked{e})
}
}
}
func (s *IdentifyState) initResultList() {
idt := s.u.IDTable()
if idt == nil {
return
}
activeProofs := idt.remoteProofLinks.Active()
s.res.ProofChecks = make([]*LinkCheckResult, len(activeProofs))
for i, p := range activeProofs {
s.res.ProofChecks[i] = &LinkCheckResult{link: p, trackedProofState: keybase1.ProofState_NONE, position: i}
}
}
func (s *IdentifyState) computeTrackDiffs() {
if s.track == nil {
return
}
G.Log.Debug("| with tracking %v", s.track.set)
for _, c := range s.res.ProofChecks {
c.diff = c.link.ComputeTrackDiff(s.track)
c.trackedProofState = s.track.GetProofState(c.link.ToIDString())
}
}
func (s *IdentifyState) Precompute(dhook func(keybase1.IdentifyKey)) {
s.computeKeyDiffs(dhook)
s.initResultList()
s.computeTrackDiffs()
s.computeRevokedProofs()
}
func (s *IdentifyState) computeKeyDiffs(dhook func(keybase1.IdentifyKey)) {
mapify := func(v []keybase1.KID) map[keybase1.KID]bool {
ret := make(map[keybase1.KID]bool)
for _, k := range v {
ret[k] = true
}
return ret
}
display := func(kid keybase1.KID, diff TrackDiff) {
k := keybase1.IdentifyKey{
TrackDiff: ExportTrackDiff(diff),
}
k.KID = kid
fp := s.u.GetKeyFamily().kid2pgp[kid]
k.PGPFingerprint = fp[:]
dhook(k)
}
// first check the eldest key
observedEldest := s.u.GetEldestKID()
if s.track != nil {
trackedEldest := s.track.GetEldestKID()
if observedEldest.NotEqual(trackedEldest) {
diff := TrackDiffNewEldest{tracked: trackedEldest, observed: observedEldest}
s.res.KeyDiffs = append(s.res.KeyDiffs, diff)
display(observedEldest, diff)
}
}
found := s.u.GetActivePGPKIDs(true)
foundMap := mapify(found)
var tracked []keybase1.KID
if s.track != nil {
for _, trackedKey := range s.track.GetTrackedKeys() {
tracked = append(tracked, trackedKey.KID)
}
}
trackedMap := mapify(tracked)
for _, kid := range found {
var diff TrackDiff
if s.track != nil && !trackedMap[kid] {
diff = TrackDiffNew{}
s.res.KeyDiffs = append(s.res.KeyDiffs, diff)
} else if s.track != nil {
diff = TrackDiffNone{}
}
display(kid, diff)
}
for _, kid := range tracked {
if !foundMap[kid] {
fp := s.u.GetKeyFamily().kid2pgp[kid]
diff := TrackDiffRevoked{fp}
s.res.KeyDiffs = append(s.res.KeyDiffs, diff)
display(kid, diff)
}
}
}