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
|
// Copyright 2019 The gVisor Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package ext
import (
"io"
"sync/atomic"
"gvisor.dev/gvisor/pkg/binary"
"gvisor.dev/gvisor/pkg/sentry/fs/ext/disklayout"
"gvisor.dev/gvisor/pkg/syserror"
)
// inode represents an ext inode.
type inode struct {
// refs is a reference count. refs is accessed using atomic memory operations.
refs int64
// diskInode gives us access to the inode struct on disk. Immutable.
diskInode disklayout.Inode
// root is the root extent node. This lives in the 60 byte diskInode.Blocks().
// Immutable.
root disklayout.ExtentNode
}
// incRef increments the inode ref count.
func (in *inode) incRef() {
atomic.AddInt64(&in.refs, 1)
}
// tryIncRef tries to increment the ref count. Returns true if successful.
func (in *inode) tryIncRef() bool {
for {
refs := atomic.LoadInt64(&in.refs)
if refs == 0 {
return false
}
if atomic.CompareAndSwapInt64(&in.refs, refs, refs+1) {
return true
}
}
}
// decRef decrements the inode ref count.
func (in *inode) decRef() {
if refs := atomic.AddInt64(&in.refs, -1); refs < 0 {
panic("ext.inode.decRef() called without holding a reference")
}
}
// buildExtTree builds the extent tree by reading it from disk by doing
// running a simple DFS. It first reads the root node from the inode struct in
// memory. Then it recursively builds the rest of the tree by reading it off
// disk.
//
// Preconditions:
// - Must have mutual exclusion on device fd.
// - Inode flag InExtents must be set.
func (in *inode) buildExtTree(dev io.ReadSeeker, blkSize uint64) error {
rootNodeData := in.diskInode.Data()
var rootHeader disklayout.ExtentHeader
binary.Unmarshal(rootNodeData[:disklayout.ExtentStructsSize], binary.LittleEndian, &rootHeader)
// Root node can not have more than 4 entries: 60 bytes = 1 header + 4 entries.
if rootHeader.NumEntries > 4 {
// read(2) specifies that EINVAL should be returned if the file is unsuitable
// for reading.
return syserror.EINVAL
}
rootEntries := make([]disklayout.ExtentEntryPair, rootHeader.NumEntries)
for i, off := uint16(0), disklayout.ExtentStructsSize; i < rootHeader.NumEntries; i, off = i+1, off+disklayout.ExtentStructsSize {
var curEntry disklayout.ExtentEntry
if rootHeader.Height == 0 {
// Leaf node.
curEntry = &disklayout.Extent{}
} else {
// Internal node.
curEntry = &disklayout.ExtentIdx{}
}
binary.Unmarshal(rootNodeData[off:off+disklayout.ExtentStructsSize], binary.LittleEndian, curEntry)
rootEntries[i].Entry = curEntry
}
// If this node is internal, perform DFS.
if rootHeader.Height > 0 {
for i := uint16(0); i < rootHeader.NumEntries; i++ {
var err error
if rootEntries[i].Node, err = buildExtTreeFromDisk(dev, rootEntries[i].Entry, blkSize); err != nil {
return err
}
}
}
in.root = disklayout.ExtentNode{rootHeader, rootEntries}
return nil
}
// buildExtTreeFromDisk reads the extent tree nodes from disk and recursively
// builds the tree. Performs a simple DFS. It returns the ExtentNode pointed to
// by the ExtentEntry.
//
// Preconditions: Must have mutual exclusion on device fd.
func buildExtTreeFromDisk(dev io.ReadSeeker, entry disklayout.ExtentEntry, blkSize uint64) (*disklayout.ExtentNode, error) {
var header disklayout.ExtentHeader
off := entry.PhysicalBlock() * blkSize
if err := readFromDisk(dev, int64(off), &header); err != nil {
return nil, err
}
entries := make([]disklayout.ExtentEntryPair, header.NumEntries)
for i, off := uint16(0), off+disklayout.ExtentStructsSize; i < header.NumEntries; i, off = i+1, off+disklayout.ExtentStructsSize {
var curEntry disklayout.ExtentEntry
if header.Height == 0 {
// Leaf node.
curEntry = &disklayout.Extent{}
} else {
// Internal node.
curEntry = &disklayout.ExtentIdx{}
}
if err := readFromDisk(dev, int64(off), curEntry); err != nil {
return nil, err
}
entries[i].Entry = curEntry
}
// If this node is internal, perform DFS.
if header.Height > 0 {
for i := uint16(0); i < header.NumEntries; i++ {
var err error
entries[i].Node, err = buildExtTreeFromDisk(dev, entries[i].Entry, blkSize)
if err != nil {
return nil, err
}
}
}
return &disklayout.ExtentNode{header, entries}, nil
}
|
