forked from canonical/snapd
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbootchain.go
349 lines (317 loc) · 10.2 KB
/
bootchain.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
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
// -*- Mode: Go; indent-tabs-mode: t -*-
/*
* Copyright (C) 2020-2022 Canonical Ltd
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 3 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
package boot
import (
"bytes"
"encoding/json"
"fmt"
"os"
"path/filepath"
"sort"
"github.com/snapcore/snapd/asserts"
"github.com/snapcore/snapd/bootloader"
"github.com/snapcore/snapd/dirs"
"github.com/snapcore/snapd/osutil"
"github.com/snapcore/snapd/secboot"
)
// TODO:UC20 add a doc comment when this is stabilized
type bootChain struct {
BrandID string `json:"brand-id"`
Model string `json:"model"`
Classic bool `json:"classic,omitempty"`
Grade asserts.ModelGrade `json:"grade"`
ModelSignKeyID string `json:"model-sign-key-id"`
AssetChain []bootAsset `json:"asset-chain"`
Kernel string `json:"kernel"`
// KernelRevision is the revision of the kernel snap. It is empty if
// kernel is unasserted, in which case always reseal.
KernelRevision string `json:"kernel-revision"`
KernelCmdlines []string `json:"kernel-cmdlines"`
kernelBootFile bootloader.BootFile
}
func (b *bootChain) modelForSealing() *modelForSealing {
return &modelForSealing{
brandID: b.BrandID,
model: b.Model,
classic: b.Classic,
grade: b.Grade,
modelSignKeyID: b.ModelSignKeyID,
}
}
// TODO:UC20 add a doc comment when this is stabilized
type bootAsset struct {
Role bootloader.Role `json:"role"`
Name string `json:"name"`
Hashes []string `json:"hashes"`
}
func bootAssetLess(b, other *bootAsset) bool {
byRole := b.Role < other.Role
byName := b.Name < other.Name
// sort order: role -> name -> hash list (len -> lexical)
if b.Role != other.Role {
return byRole
}
if b.Name != other.Name {
return byName
}
return stringListsLess(b.Hashes, other.Hashes)
}
func stringListsEqual(sl1, sl2 []string) bool {
if len(sl1) != len(sl2) {
return false
}
for i := range sl1 {
if sl1[i] != sl2[i] {
return false
}
}
return true
}
func stringListsLess(sl1, sl2 []string) bool {
if len(sl1) != len(sl2) {
return len(sl1) < len(sl2)
}
for idx := range sl1 {
if sl1[idx] < sl2[idx] {
return true
}
}
return false
}
func toPredictableBootChain(b *bootChain) *bootChain {
if b == nil {
return nil
}
newB := *b
// AssetChain is sorted list (by boot order) of sorted list (old to new asset).
// So it is already predictable and we can keep it the way it is.
// However we still need to sort kernel KernelCmdlines
if b.KernelCmdlines != nil {
newB.KernelCmdlines = make([]string, len(b.KernelCmdlines))
copy(newB.KernelCmdlines, b.KernelCmdlines)
sort.Strings(newB.KernelCmdlines)
}
return &newB
}
func predictableBootAssetsEqual(b1, b2 []bootAsset) bool {
b1JSON, err := json.Marshal(b1)
if err != nil {
return false
}
b2JSON, err := json.Marshal(b2)
if err != nil {
return false
}
return bytes.Equal(b1JSON, b2JSON)
}
func predictableBootAssetsLess(b1, b2 []bootAsset) bool {
if len(b1) != len(b2) {
return len(b1) < len(b2)
}
for i := range b1 {
if bootAssetLess(&b1[i], &b2[i]) {
return true
}
}
return false
}
type byBootChainOrder []bootChain
func (b byBootChainOrder) Len() int { return len(b) }
func (b byBootChainOrder) Swap(i, j int) { b[i], b[j] = b[j], b[i] }
func (b byBootChainOrder) Less(i, j int) bool {
// sort by model info
if b[i].BrandID != b[j].BrandID {
return b[i].BrandID < b[j].BrandID
}
if b[i].Model != b[j].Model {
return b[i].Model < b[j].Model
}
if b[i].Grade != b[j].Grade {
return b[i].Grade < b[j].Grade
}
if b[i].ModelSignKeyID != b[j].ModelSignKeyID {
return b[i].ModelSignKeyID < b[j].ModelSignKeyID
}
// then boot assets
if !predictableBootAssetsEqual(b[i].AssetChain, b[j].AssetChain) {
return predictableBootAssetsLess(b[i].AssetChain, b[j].AssetChain)
}
// then kernel
if b[i].Kernel != b[j].Kernel {
return b[i].Kernel < b[j].Kernel
}
if b[i].KernelRevision != b[j].KernelRevision {
return b[i].KernelRevision < b[j].KernelRevision
}
// and last kernel command lines
if !stringListsEqual(b[i].KernelCmdlines, b[j].KernelCmdlines) {
return stringListsLess(b[i].KernelCmdlines, b[j].KernelCmdlines)
}
return false
}
type predictableBootChains []bootChain
// hasUnrevisionedKernels returns true if any of the chains have an
// unrevisioned kernel. Revisions will not be set for unasserted
// kernels.
func (pbc predictableBootChains) hasUnrevisionedKernels() bool {
for i := range pbc {
if pbc[i].KernelRevision == "" {
return true
}
}
return false
}
func toPredictableBootChains(chains []bootChain) predictableBootChains {
if chains == nil {
return nil
}
predictableChains := make([]bootChain, len(chains))
for i := range chains {
predictableChains[i] = *toPredictableBootChain(&chains[i])
}
sort.Sort(byBootChainOrder(predictableChains))
return predictableChains
}
type bootChainEquivalence int
const (
bootChainEquivalent bootChainEquivalence = 0
bootChainDifferent bootChainEquivalence = 1
bootChainUnrevisioned bootChainEquivalence = -1
)
// predictableBootChainsEqualForReseal returns bootChainEquivalent
// when boot chains are equivalent for reseal. If the boot chains
// are clearly different it returns bootChainDifferent.
// If it would return bootChainEquivalent but the chains contain
// unrevisioned kernels it will return bootChainUnrevisioned.
func predictableBootChainsEqualForReseal(pb1, pb2 predictableBootChains) bootChainEquivalence {
pb1JSON, err := json.Marshal(pb1)
if err != nil {
return bootChainDifferent
}
pb2JSON, err := json.Marshal(pb2)
if err != nil {
return bootChainDifferent
}
if bytes.Equal(pb1JSON, pb2JSON) {
if pb1.hasUnrevisionedKernels() {
return bootChainUnrevisioned
}
return bootChainEquivalent
}
return bootChainDifferent
}
// bootAssetsToLoadChains generates a list of load chains covering given boot
// assets sequence. At the end of each chain, adds an entry for the kernel boot
// file.
// We do not calculate some boot chains because they are impossible as
// when we update assets we write first the binaries that are used
// later, that is, if updating both shim and grub, the new grub is
// copied first to the disk, so booting from the new shim to the old
// grub is not possible. This is controlled by expectNew, that tells
// us that the previous step in the chain is from a new asset.
func bootAssetsToLoadChains(assets []bootAsset, kernelBootFile bootloader.BootFile, roleToBlName map[bootloader.Role]string, expectNew bool) ([]*secboot.LoadChain, error) {
// kernel is added after all the assets
addKernelBootFile := len(assets) == 0
if addKernelBootFile {
return []*secboot.LoadChain{secboot.NewLoadChain(kernelBootFile)}, nil
}
thisAsset := assets[0]
blName := roleToBlName[thisAsset.Role]
if blName == "" {
return nil, fmt.Errorf("internal error: no bootloader name for boot asset role %q", thisAsset.Role)
}
var chains []*secboot.LoadChain
for i, hash := range thisAsset.Hashes {
// There should be 1 or 2 assets, and their position has a meaning.
// See TrustedAssetsUpdateObserver.observeUpdate
if i == 0 {
// i == 0 means currently installed asset.
// We do not expect this asset to be used as
// we have new assets earlier in the chain
if len(thisAsset.Hashes) == 2 && expectNew {
continue
}
} else if i == 1 {
// i == 1 means new asset
} else {
// If there is a second asset, it is the next asset to be installed
return nil, fmt.Errorf("internal error: did not expect more than 2 hashes for %s", thisAsset.Name)
}
var bf bootloader.BootFile
var next []*secboot.LoadChain
var err error
p := filepath.Join(
dirs.SnapBootAssetsDir,
trustedAssetCacheRelPath(blName, thisAsset.Name, hash))
if !osutil.FileExists(p) {
return nil, fmt.Errorf("file %s not found in boot assets cache", p)
}
bf = bootloader.NewBootFile(
"", // asset comes from the filesystem, not a snap
p,
thisAsset.Role,
)
next, err = bootAssetsToLoadChains(assets[1:], kernelBootFile, roleToBlName, expectNew || i == 1)
if err != nil {
return nil, err
}
chains = append(chains, secboot.NewLoadChain(bf, next...))
}
return chains, nil
}
// predictableBootChainsWrapperForStorage wraps the boot chains so
// that we do not store the arrays directly as JSON and we can add
// other information
type predictableBootChainsWrapperForStorage struct {
ResealCount int `json:"reseal-count"`
BootChains predictableBootChains `json:"boot-chains"`
}
func readBootChains(path string) (pbc predictableBootChains, resealCount int, err error) {
inf, err := os.Open(path)
if err != nil {
if os.IsNotExist(err) {
return nil, 0, nil
}
return nil, 0, fmt.Errorf("cannot open existing boot chains data file: %v", err)
}
defer inf.Close()
var wrapped predictableBootChainsWrapperForStorage
if err := json.NewDecoder(inf).Decode(&wrapped); err != nil {
return nil, 0, fmt.Errorf("cannot read boot chains data: %v", err)
}
return wrapped.BootChains, wrapped.ResealCount, nil
}
func writeBootChains(pbc predictableBootChains, path string, resealCount int) error {
if err := os.MkdirAll(filepath.Dir(path), 0755); err != nil {
return fmt.Errorf("cannot create device fde state directory: %v", err)
}
outf, err := osutil.NewAtomicFile(path, 0600, 0, osutil.NoChown, osutil.NoChown)
if err != nil {
return fmt.Errorf("cannot create a temporary boot chains file: %v", err)
}
// becomes noop when the file is committed
defer outf.Cancel()
wrapped := predictableBootChainsWrapperForStorage{
ResealCount: resealCount,
BootChains: pbc,
}
if err := json.NewEncoder(outf).Encode(wrapped); err != nil {
return fmt.Errorf("cannot write boot chains data: %v", err)
}
return outf.Commit()
}