-
Notifications
You must be signed in to change notification settings - Fork 907
/
idmapset_linux.go
1129 lines (922 loc) · 24.6 KB
/
idmapset_linux.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
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
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//go:build linux && cgo
package idmap
import (
"bufio"
"encoding/json"
"fmt"
"os"
"os/user"
"path"
"path/filepath"
"reflect"
"sort"
"strconv"
"strings"
"sync/atomic"
"syscall"
"github.com/canonical/lxd/shared"
"github.com/canonical/lxd/shared/logger"
)
const VFS3FscapsUnsupported int32 = 0
const VFS3FscapsSupported int32 = 1
const VFS3FscapsUnknown int32 = -1
var VFS3Fscaps int32 = VFS3FscapsUnknown
var ErrNoUserMap = fmt.Errorf("No map found for user")
type IdRange struct {
Isuid bool
Isgid bool
Startid int64
Endid int64
}
func (i *IdRange) Contains(id int64) bool {
return id >= i.Startid && id <= i.Endid
}
func (e *IdmapEntry) ToLxcString() []string {
if e.Isuid && e.Isgid {
return []string{
fmt.Sprintf("u %d %d %d", e.Nsid, e.Hostid, e.Maprange),
fmt.Sprintf("g %d %d %d", e.Nsid, e.Hostid, e.Maprange),
}
}
if e.Isuid {
return []string{fmt.Sprintf("u %d %d %d", e.Nsid, e.Hostid, e.Maprange)}
}
return []string{fmt.Sprintf("g %d %d %d", e.Nsid, e.Hostid, e.Maprange)}
}
func is_between(x, low, high int64) bool {
return x >= low && x < high
}
func (e *IdmapEntry) HostidsIntersect(i IdmapEntry) bool {
if (e.Isuid && i.Isuid) || (e.Isgid && i.Isgid) {
switch {
case is_between(e.Hostid, i.Hostid, i.Hostid+i.Maprange):
return true
case is_between(i.Hostid, e.Hostid, e.Hostid+e.Maprange):
return true
case is_between(e.Hostid+e.Maprange, i.Hostid, i.Hostid+i.Maprange):
return true
case is_between(i.Hostid+i.Maprange, e.Hostid, e.Hostid+e.Maprange):
return true
}
}
return false
}
func (e *IdmapEntry) Intersects(i IdmapEntry) bool {
if (e.Isuid && i.Isuid) || (e.Isgid && i.Isgid) {
switch {
case is_between(e.Hostid, i.Hostid, i.Hostid+i.Maprange-1):
return true
case is_between(i.Hostid, e.Hostid, e.Hostid+e.Maprange-1):
return true
case is_between(e.Hostid+e.Maprange-1, i.Hostid, i.Hostid+i.Maprange-1):
return true
case is_between(i.Hostid+i.Maprange-1, e.Hostid, e.Hostid+e.Maprange-1):
return true
case is_between(e.Nsid, i.Nsid, i.Nsid+i.Maprange-1):
return true
case is_between(i.Nsid, e.Nsid, e.Nsid+e.Maprange-1):
return true
case is_between(e.Nsid+e.Maprange-1, i.Nsid, i.Nsid+i.Maprange-1):
return true
case is_between(i.Nsid+i.Maprange-1, e.Nsid, e.Nsid+e.Maprange-1):
return true
}
}
return false
}
// HostIDsCoveredBy returns whether or not the entry is covered by the supplied host UID and GID ID maps.
// If e.Isuid is true then host IDs must be covered by an entry in allowedHostUIDs, and if e.Isgid is true then
// host IDs must be covered by an entry in allowedHostGIDs.
func (e *IdmapEntry) HostIDsCoveredBy(allowedHostUIDs []IdmapEntry, allowedHostGIDs []IdmapEntry) bool {
if !e.Isuid && !e.Isgid {
return false // This is an invalid idmap entry.
}
isUIDAllowed := false
if e.Isuid {
for _, allowedIDMap := range allowedHostUIDs {
if !allowedIDMap.Isuid {
continue
}
if e.Hostid >= allowedIDMap.Hostid && (e.Hostid+e.Maprange) <= (allowedIDMap.Hostid+allowedIDMap.Maprange) {
isUIDAllowed = true
break
}
}
}
isGIDAllowed := false
if e.Isgid {
for _, allowedIDMap := range allowedHostGIDs {
if !allowedIDMap.Isgid {
continue
}
if e.Hostid >= allowedIDMap.Hostid && (e.Hostid+e.Maprange) <= (allowedIDMap.Hostid+allowedIDMap.Maprange) {
isGIDAllowed = true
break
}
}
}
return e.Isuid == isUIDAllowed && e.Isgid == isGIDAllowed
}
func (e *IdmapEntry) Usable() error {
kernelIdmap, err := CurrentIdmapSet()
if err != nil {
return err
}
kernelRanges, err := kernelIdmap.ValidRanges()
if err != nil {
return err
}
// Validate the uid map
if e.Isuid {
valid := false
for _, kernelRange := range kernelRanges {
if !kernelRange.Isuid {
continue
}
if kernelRange.Contains(e.Hostid) && kernelRange.Contains(e.Hostid+e.Maprange-1) {
valid = true
break
}
}
if !valid {
return fmt.Errorf("The '%s' map can't work in the current user namespace", e.ToLxcString())
}
}
// Validate the gid map
if e.Isgid {
valid := false
for _, kernelRange := range kernelRanges {
if !kernelRange.Isgid {
continue
}
if kernelRange.Contains(e.Hostid) && kernelRange.Contains(e.Hostid+e.Maprange-1) {
valid = true
break
}
}
if !valid {
return fmt.Errorf("The '%s' map can't work in the current user namespace", e.ToLxcString())
}
}
return nil
}
func (e *IdmapEntry) parse(s string) error {
split := strings.Split(s, ":")
var err error
if len(split) != 4 {
return fmt.Errorf("Bad idmap: %q", s)
}
switch split[0] {
case "u":
e.Isuid = true
case "g":
e.Isgid = true
case "b":
e.Isuid = true
e.Isgid = true
default:
return fmt.Errorf("Bad idmap type in %q", s)
}
nsid, err := strconv.ParseUint(split[1], 10, 32)
if err != nil {
return err
}
e.Nsid = int64(nsid)
hostid, err := strconv.ParseUint(split[2], 10, 32)
if err != nil {
return err
}
e.Hostid = int64(hostid)
maprange, err := strconv.ParseUint(split[3], 10, 32)
if err != nil {
return err
}
e.Maprange = int64(maprange)
// wraparound
if e.Hostid+e.Maprange < e.Hostid || e.Nsid+e.Maprange < e.Nsid {
return fmt.Errorf("Bad mapping: id wraparound")
}
return nil
}
/*
* Shift a uid from the host into the container
* I.e. 0 -> 1000 -> 101000.
*/
func (e *IdmapEntry) shift_into_ns(id int64) (int64, error) {
if id < e.Nsid || id >= e.Nsid+e.Maprange {
// this mapping doesn't apply
return 0, fmt.Errorf("ID mapping doesn't apply")
}
return id - e.Nsid + e.Hostid, nil
}
/*
* Shift a uid from the container back to the host
* I.e. 101000 -> 1000.
*/
func (e *IdmapEntry) shift_from_ns(id int64) (int64, error) {
if id < e.Hostid || id >= e.Hostid+e.Maprange {
// this mapping doesn't apply
return 0, fmt.Errorf("ID mapping doesn't apply")
}
return id - e.Hostid + e.Nsid, nil
}
type ByHostid []*IdmapEntry
func (s ByHostid) Len() int {
return len(s)
}
func (s ByHostid) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s ByHostid) Less(i, j int) bool {
return s[i].Hostid < s[j].Hostid
}
/* taken from http://blog.golang.org/slices (which is under BSD licence). */
func Extend(slice []IdmapEntry, element IdmapEntry) []IdmapEntry {
n := len(slice)
if n == cap(slice) {
// Slice is full; must grow.
// We double its size and add 1, so if the size is zero we still grow.
newSlice := make([]IdmapEntry, len(slice), 2*len(slice)+1)
copy(newSlice, slice)
slice = newSlice
}
slice = slice[0 : n+1]
slice[n] = element
return slice
}
func (m *IdmapSet) Equals(other *IdmapSet) bool {
// Get comparable maps
expandSortIdmap := func(input *IdmapSet) IdmapSet {
if input == nil {
input = &IdmapSet{}
}
newEntries := []IdmapEntry{}
for _, entry := range input.Idmap {
if entry.Isuid && entry.Isgid {
newEntries = append(newEntries, IdmapEntry{true, false, entry.Hostid, entry.Nsid, entry.Maprange})
newEntries = append(newEntries, IdmapEntry{false, true, entry.Hostid, entry.Nsid, entry.Maprange})
} else {
newEntries = append(newEntries, entry)
}
}
output := IdmapSet{Idmap: newEntries}
sort.Sort(output)
return output
}
// Actually compare
return reflect.DeepEqual(expandSortIdmap(m), expandSortIdmap(other))
}
func (m IdmapSet) Len() int {
return len(m.Idmap)
}
func (m IdmapSet) Swap(i, j int) {
m.Idmap[i], m.Idmap[j] = m.Idmap[j], m.Idmap[i]
}
func (m IdmapSet) Less(i, j int) bool {
if m.Idmap[i].Isuid != m.Idmap[j].Isuid {
return m.Idmap[i].Isuid
}
if m.Idmap[i].Isgid != m.Idmap[j].Isgid {
return m.Idmap[i].Isgid
}
return m.Idmap[i].Nsid < m.Idmap[j].Nsid
}
func (m IdmapSet) Intersects(i IdmapEntry) bool {
for _, e := range m.Idmap {
if i.Intersects(e) {
return true
}
}
return false
}
func (m IdmapSet) HostidsIntersect(i IdmapEntry) bool {
for _, e := range m.Idmap {
if i.HostidsIntersect(e) {
return true
}
}
return false
}
func (m IdmapSet) Usable() error {
for _, e := range m.Idmap {
err := e.Usable()
if err != nil {
return err
}
}
return nil
}
func (m IdmapSet) ValidRanges() ([]*IdRange, error) {
ranges := []*IdRange{}
// Sort the map
idmap := IdmapSet{}
err := shared.DeepCopy(&m, &idmap)
if err != nil {
return nil, err
}
sort.Sort(idmap)
for _, mapEntry := range idmap.Idmap {
var entry *IdRange
for _, idEntry := range ranges {
if mapEntry.Isuid != idEntry.Isuid || mapEntry.Isgid != idEntry.Isgid {
continue
}
if idEntry.Endid+1 == mapEntry.Nsid {
entry = idEntry
break
}
}
if entry != nil {
entry.Endid = entry.Endid + mapEntry.Maprange
continue
}
ranges = append(ranges, &IdRange{
Isuid: mapEntry.Isuid,
Isgid: mapEntry.Isgid,
Startid: mapEntry.Nsid,
Endid: mapEntry.Nsid + mapEntry.Maprange - 1,
})
}
return ranges, nil
}
var ErrHostIdIsSubId = fmt.Errorf("Host id is in the range of subids")
/* AddSafe adds an entry to the idmap set, breaking apart any ranges that the
* new idmap intersects with in the process.
*/
func (m *IdmapSet) AddSafe(i IdmapEntry) error {
/*
* doAddSafe() can't properly handle mappings that
* both UID and GID, because in this case the "i" idmapping
* will be inserted twice which may result to a further bugs and issues.
* Simplest solution is to split a "both" mapping into two separate ones
* one for UIDs and another one for GIDs.
*/
newUidIdmapEntry := i
newUidIdmapEntry.Isgid = false
err := m.doAddSafe(newUidIdmapEntry)
if err != nil {
return err
}
newGidIdmapEntry := i
newGidIdmapEntry.Isuid = false
err = m.doAddSafe(newGidIdmapEntry)
if err != nil {
return err
}
return nil
}
func (m *IdmapSet) doAddSafe(i IdmapEntry) error {
result := []IdmapEntry{}
added := false
if !i.Isuid && !i.Isgid {
return nil
}
for _, e := range m.Idmap {
if !e.Intersects(i) {
result = append(result, e)
continue
}
if e.HostidsIntersect(i) {
return ErrHostIdIsSubId
}
added = true
lower := IdmapEntry{
Isuid: e.Isuid,
Isgid: e.Isgid,
Hostid: e.Hostid,
Nsid: e.Nsid,
Maprange: i.Nsid - e.Nsid,
}
upper := IdmapEntry{
Isuid: e.Isuid,
Isgid: e.Isgid,
Hostid: e.Hostid + lower.Maprange + i.Maprange,
Nsid: i.Nsid + i.Maprange,
Maprange: e.Maprange - i.Maprange - lower.Maprange,
}
if lower.Maprange > 0 {
result = append(result, lower)
}
result = append(result, i)
if upper.Maprange > 0 {
result = append(result, upper)
}
}
if !added {
result = append(result, i)
}
m.Idmap = result
return nil
}
func (m IdmapSet) ToLxcString() []string {
var lines []string
for _, e := range m.Idmap {
for _, l := range e.ToLxcString() {
if !shared.ValueInSlice(l, lines) {
lines = append(lines, l)
}
}
}
return lines
}
func (m IdmapSet) ToUidMappings() []syscall.SysProcIDMap {
mapping := []syscall.SysProcIDMap{}
for _, e := range m.Idmap {
if !e.Isuid {
continue
}
mapping = append(mapping, syscall.SysProcIDMap{
ContainerID: int(e.Nsid),
HostID: int(e.Hostid),
Size: int(e.Maprange),
})
}
return mapping
}
func (m IdmapSet) ToGidMappings() []syscall.SysProcIDMap {
mapping := []syscall.SysProcIDMap{}
for _, e := range m.Idmap {
if !e.Isgid {
continue
}
mapping = append(mapping, syscall.SysProcIDMap{
ContainerID: int(e.Nsid),
HostID: int(e.Hostid),
Size: int(e.Maprange),
})
}
return mapping
}
func (m IdmapSet) Append(s string) (IdmapSet, error) {
e := IdmapEntry{}
err := e.parse(s)
if err != nil {
return m, err
}
if m.Intersects(e) {
return m, fmt.Errorf("Conflicting id mapping")
}
m.Idmap = Extend(m.Idmap, e)
return m, nil
}
func (m IdmapSet) doShiftIntoNs(uid int64, gid int64, how string) (int64, int64) {
u := int64(-1)
g := int64(-1)
for _, e := range m.Idmap {
var err error
var tmpu, tmpg int64
if e.Isuid && u == -1 {
switch how {
case "in":
tmpu, err = e.shift_into_ns(uid)
case "out":
tmpu, err = e.shift_from_ns(uid)
}
if err == nil {
u = tmpu
}
}
if e.Isgid && g == -1 {
switch how {
case "in":
tmpg, err = e.shift_into_ns(gid)
case "out":
tmpg, err = e.shift_from_ns(gid)
}
if err == nil {
g = tmpg
}
}
}
return u, g
}
func (m IdmapSet) ShiftIntoNs(uid int64, gid int64) (int64, int64) {
return m.doShiftIntoNs(uid, gid, "in")
}
func (m IdmapSet) ShiftFromNs(uid int64, gid int64) (int64, int64) {
return m.doShiftIntoNs(uid, gid, "out")
}
func (set *IdmapSet) doUidshiftIntoContainer(dir string, testmode bool, how string, skipper func(dir string, absPath string, fi os.FileInfo) bool) error {
if how == "in" && atomic.LoadInt32(&VFS3Fscaps) == VFS3FscapsUnknown {
if SupportsVFS3Fscaps(dir) {
atomic.StoreInt32(&VFS3Fscaps, VFS3FscapsSupported)
} else {
atomic.StoreInt32(&VFS3Fscaps, VFS3FscapsUnsupported)
}
}
// Expand any symlink before the final path component
tmp := filepath.Dir(dir)
tmp, err := filepath.EvalSymlinks(tmp)
if err != nil {
return fmt.Errorf("Failed expanding symlinks of %q: %w", tmp, err)
}
dir = filepath.Join(tmp, filepath.Base(dir))
dir = strings.TrimRight(dir, "/")
hardLinks := []uint64{}
convert := func(path string, fi os.FileInfo, err error) (e error) {
if err != nil {
return err
}
if skipper != nil && skipper(dir, path, fi) {
return filepath.SkipDir
}
intUID, intGID, _, _, inode, nlink, err := shared.GetFileStat(path)
if err != nil {
return err
}
if nlink >= 2 {
for _, linkInode := range hardLinks {
// File was already shifted through hardlink
if linkInode == inode {
return nil
}
}
hardLinks = append(hardLinks, inode)
}
uid := int64(intUID)
gid := int64(intGID)
caps := []byte{}
var newuid, newgid int64
switch how {
case "in":
newuid, newgid = set.ShiftIntoNs(uid, gid)
case "out":
newuid, newgid = set.ShiftFromNs(uid, gid)
}
if testmode {
fmt.Printf("I would shift %q to %d %d\n", path, newuid, newgid)
} else {
// Dump capabilities
if fi.Mode()&os.ModeSymlink == 0 {
caps, err = GetCaps(path)
if err != nil {
return err
}
}
// Shift owner
err = ShiftOwner(dir, path, int(newuid), int(newgid))
if err != nil {
return err
}
if fi.Mode()&os.ModeSymlink == 0 {
// Shift POSIX ACLs
err = ShiftACL(path, func(uid int64, gid int64) (int64, int64) { return set.doShiftIntoNs(uid, gid, how) })
if err != nil {
return err
}
// Shift capabilities
if len(caps) != 0 {
rootUID := int64(0)
if how == "in" {
rootUID, _ = set.ShiftIntoNs(0, 0)
}
if how != "in" || atomic.LoadInt32(&VFS3Fscaps) == VFS3FscapsSupported {
err = SetCaps(path, caps, rootUID)
if err != nil {
logger.Warnf("Unable to set file capabilities on %q: %v", path, err)
}
}
}
}
}
return nil
}
if !shared.PathExists(dir) {
return fmt.Errorf("No such file or directory: %q", dir)
}
return filepath.Walk(dir, convert)
}
func (set *IdmapSet) UidshiftIntoContainer(dir string, testmode bool) error {
return set.doUidshiftIntoContainer(dir, testmode, "in", nil)
}
func (set *IdmapSet) UidshiftFromContainer(dir string, testmode bool) error {
return set.doUidshiftIntoContainer(dir, testmode, "out", nil)
}
func (set *IdmapSet) ShiftRootfs(p string, skipper func(dir string, absPath string, fi os.FileInfo) bool) error {
return set.doUidshiftIntoContainer(p, false, "in", skipper)
}
func (set *IdmapSet) UnshiftRootfs(p string, skipper func(dir string, absPath string, fi os.FileInfo) bool) error {
return set.doUidshiftIntoContainer(p, false, "out", skipper)
}
func (set *IdmapSet) ShiftFile(p string) error {
return set.ShiftRootfs(p, nil)
}
/*
* get a uid or gid mapping from /etc/subxid.
*/
func getFromShadow(fname string, username string) ([][]int64, error) {
entries := [][]int64{}
f, err := os.Open(fname)
if err != nil {
return nil, err
}
defer func() { _ = f.Close() }()
scanner := bufio.NewScanner(f)
for scanner.Scan() {
// Skip comments
s := strings.Split(scanner.Text(), "#")
if len(s[0]) == 0 {
continue
}
// Validate format
s = strings.Split(s[0], ":")
if len(s) < 3 {
return nil, fmt.Errorf("Unexpected values in %q: %q", fname, s)
}
if strings.EqualFold(s[0], username) {
// Get range start
entryStart, err := strconv.ParseUint(s[1], 10, 32)
if err != nil {
continue
}
// Get range size
entrySize, err := strconv.ParseUint(s[2], 10, 32)
if err != nil {
continue
}
entries = append(entries, []int64{int64(entryStart), int64(entrySize)})
}
}
if len(entries) == 0 {
return nil, ErrNoUserMap
}
return entries, nil
}
/*
* get a uid or gid mapping from /proc/self/{g,u}id_map.
*/
func getFromProc(fname string) ([][]int64, error) {
entries := [][]int64{}
f, err := os.Open(fname)
if err != nil {
return nil, err
}
defer func() { _ = f.Close() }()
scanner := bufio.NewScanner(f)
for scanner.Scan() {
// Skip comments
s := strings.Split(scanner.Text(), "#")
if len(s[0]) == 0 {
continue
}
// Validate format
s = strings.Fields(s[0])
if len(s) < 3 {
return nil, fmt.Errorf("Unexpected values in %q: %q", fname, s)
}
// Get range start
entryStart, err := strconv.ParseUint(s[0], 10, 32)
if err != nil {
continue
}
// Get range size
entryHost, err := strconv.ParseUint(s[1], 10, 32)
if err != nil {
continue
}
// Get range size
entrySize, err := strconv.ParseUint(s[2], 10, 32)
if err != nil {
continue
}
entries = append(entries, []int64{int64(entryStart), int64(entryHost), int64(entrySize)})
}
if len(entries) == 0 {
return nil, fmt.Errorf("Namespace doesn't have any map set")
}
return entries, nil
}
/*
* Create a new default idmap.
*/
func DefaultIdmapSet(rootfs string, username string) (*IdmapSet, error) {
idmapset := new(IdmapSet)
if username == "" {
currentUser, err := user.Current()
if err != nil {
return nil, err
}
username = currentUser.Username
}
// Check if shadow's uidmap tools are installed
subuidPath := path.Join(rootfs, "/etc/subuid")
subgidPath := path.Join(rootfs, "/etc/subgid")
if shared.PathExists(subuidPath) && shared.PathExists(subgidPath) {
// Parse the shadow uidmap
entries, err := getFromShadow(subuidPath, username)
if err != nil {
if username == "root" && err == ErrNoUserMap {
// No root map available, figure out a default map
return kernelDefaultMap()
}
return nil, err
}
for _, entry := range entries {
// Check that it's big enough to be useful
if int(entry[1]) < 65536 {
continue
}
e := IdmapEntry{Isuid: true, Nsid: 0, Hostid: entry[0], Maprange: entry[1]}
idmapset.Idmap = Extend(idmapset.Idmap, e)
// NOTE: Remove once LXD can deal with multiple shadow maps
break
}
// Parse the shadow gidmap
entries, err = getFromShadow(subgidPath, username)
if err != nil {
if username == "root" && err == ErrNoUserMap {
// No root map available, figure out a default map
return kernelDefaultMap()
}
return nil, err
}
for _, entry := range entries {
// Check that it's big enough to be useful
if int(entry[1]) < 65536 {
continue
}
e := IdmapEntry{Isgid: true, Nsid: 0, Hostid: entry[0], Maprange: entry[1]}
idmapset.Idmap = Extend(idmapset.Idmap, e)
// NOTE: Remove once LXD can deal with multiple shadow maps
break
}
return idmapset, nil
}
// No shadow available, figure out a default map
return kernelDefaultMap()
}
func kernelDefaultMap() (*IdmapSet, error) {
idmapset := new(IdmapSet)
kernelMap, err := CurrentIdmapSet()
if err != nil {
// Hardcoded fallback map
e := IdmapEntry{Isuid: true, Isgid: false, Nsid: 0, Hostid: 1000000, Maprange: 1000000000}
idmapset.Idmap = Extend(idmapset.Idmap, e)
e = IdmapEntry{Isuid: false, Isgid: true, Nsid: 0, Hostid: 1000000, Maprange: 1000000000}
idmapset.Idmap = Extend(idmapset.Idmap, e)
return idmapset, nil
}
// Look for mapped ranges
kernelRanges, err := kernelMap.ValidRanges()
if err != nil {
return nil, err
}
// Special case for when we have the full kernel range
fullKernelRanges := []*IdRange{
{true, false, int64(0), int64(4294967294)},
{false, true, int64(0), int64(4294967294)}}
if reflect.DeepEqual(kernelRanges, fullKernelRanges) {
// Hardcoded fallback map
e := IdmapEntry{Isuid: true, Isgid: false, Nsid: 0, Hostid: 1000000, Maprange: 1000000000}
idmapset.Idmap = Extend(idmapset.Idmap, e)
e = IdmapEntry{Isuid: false, Isgid: true, Nsid: 0, Hostid: 1000000, Maprange: 1000000000}
idmapset.Idmap = Extend(idmapset.Idmap, e)
return idmapset, nil
}
// Find a suitable uid range
for _, entry := range kernelRanges {
// We only care about uids right now
if !entry.Isuid {
continue
}
// We want a map that's separate from the system's own POSIX allocation
if entry.Endid < 100000 {
continue
}
// Don't use the first 65536 ids
if entry.Startid < 100000 {
entry.Startid = 100000
}
// Check if we have enough ids
if entry.Endid-entry.Startid < 65536 {
continue
}
// Add the map
e := IdmapEntry{Isuid: true, Isgid: false, Nsid: 0, Hostid: entry.Startid, Maprange: entry.Endid - entry.Startid + 1}
idmapset.Idmap = Extend(idmapset.Idmap, e)
// NOTE: Remove once LXD can deal with multiple shadow maps
break
}
// Find a suitable gid range
for _, entry := range kernelRanges {
// We only care about gids right now
if !entry.Isgid {
continue
}
// We want a map that's separate from the system's own POSIX allocation
if entry.Endid < 100000 {
continue
}
// Don't use the first 65536 ids
if entry.Startid < 100000 {
entry.Startid = 100000
}