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
|
//go:build linux
// Copyright (C) 2024 SUSE LLC. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package securejoin
import (
"errors"
"fmt"
"os"
"path/filepath"
"runtime"
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
"golang.org/x/sys/unix"
)
type mkdirAllFunc func(t *testing.T, root, unsafePath string, mode FileMode) error
var mkdirAll_MkdirAll mkdirAllFunc = func(t *testing.T, root, unsafePath string, mode FileMode) error {
// We can't check expectedPath here.
return MkdirAll(root, unsafePath, mode)
}
var mkdirAll_MkdirAllHandle mkdirAllFunc = func(t *testing.T, root, unsafePath string, mode FileMode) error {
// Same logic as MkdirAll.
rootDir, err := os.OpenFile(root, unix.O_PATH|unix.O_DIRECTORY|unix.O_CLOEXEC, 0)
if err != nil {
return err
}
defer rootDir.Close()
handle, err := MkdirAllHandle(rootDir, unsafePath, mode)
if err != nil {
return err
}
defer handle.Close()
// We can use SecureJoin here because we aren't being attacked in this
// particular test. Obviously this check is bogus for actual programs.
expectedPath, err := SecureJoin(root, unsafePath)
require.NoError(t, err)
// Now double-check that the handle is correct.
gotPath, err := procSelfFdReadlink(handle)
require.NoError(t, err, "get real path of returned handle")
assert.Equal(t, expectedPath, gotPath, "wrong final path from MkdirAllHandle")
// Also check that the f.Name() is correct while we're at it (this is
// not always guaranteed but it's better to try at least).
assert.Equal(t, expectedPath, handle.Name(), "handle from MkdirAllHandle has the wrong .Name()")
return nil
}
func checkMkdirAll(t *testing.T, mkdirAll mkdirAllFunc, root, unsafePath string, mode, expectedMode FileMode, expectedErr error) {
rootDir, err := os.OpenFile(root, unix.O_PATH|unix.O_DIRECTORY|unix.O_CLOEXEC, 0)
require.NoError(t, err)
defer rootDir.Close()
// Before trying to make the tree, figure out what components don't exist
// yet so we can check them later.
handle, remainingPath, err := partialLookupInRoot(rootDir, unsafePath)
handleName := "<nil>"
if handle != nil {
handleName = handle.Name()
defer handle.Close()
}
defer func() {
if t.Failed() {
t.Logf("partialLookupInRoot(%s, %s) -> (<%s>, %s, %v)", root, unsafePath, handleName, remainingPath, err)
}
}()
// Actually make the tree.
err = mkdirAll(t, root, unsafePath, mode)
assert.ErrorIsf(t, err, expectedErr, "MkdirAll(%q, %q)", root, unsafePath)
remainingPath = filepath.Join("/", remainingPath)
for remainingPath != filepath.Dir(remainingPath) {
stat, err := fstatatFile(handle, "./"+remainingPath, unix.AT_SYMLINK_NOFOLLOW)
if expectedErr == nil {
// Check that the new components have the right mode.
if assert.NoErrorf(t, err, "unexpected error when checking new directory %q", remainingPath) {
assert.Equalf(t, uint32(unix.S_IFDIR|expectedMode), stat.Mode, "new directory %q has the wrong mode", remainingPath)
}
} else {
// Check that none of the components are directories (i.e. make
// sure that the MkdirAll was a no-op).
if err == nil {
assert.NotEqualf(t, uint32(unix.S_IFDIR), stat.Mode&unix.S_IFMT, "failed MkdirAll created a new directory at %q", remainingPath)
}
}
// Jump up a level.
remainingPath = filepath.Dir(remainingPath)
}
}
func testMkdirAll_Basic(t *testing.T, mkdirAll mkdirAllFunc) {
// We create a new tree for each test, but the template is the same.
tree := []string{
"dir a",
"dir b/c/d/e/f",
"file b/c/file",
"symlink e /b/c/d/e",
"symlink b-file b/c/file",
// Dangling symlinks.
"symlink a-fake1 a/fake",
"symlink a-fake2 a/fake/foo/bar/..",
"symlink a-fake3 a/fake/../../b",
// Test non-lexical symlinks.
"dir target",
"dir link1",
"symlink link1/target_abs /target",
"symlink link1/target_rel ../target",
"dir link2",
"symlink link2/link1_abs /link1",
"symlink link2/link1_rel ../link1",
"dir link3",
"symlink link3/target_abs /link2/link1_rel/target_rel",
"symlink link3/target_rel ../link2/link1_rel/target_rel",
"symlink link3/deep_dangling1 ../link2/link1_rel/target_rel/nonexist",
"symlink link3/deep_dangling2 ../link2/link1_rel/target_rel/nonexist",
// Symlink loop.
"dir loop",
"symlink loop/link ../loop/link",
// S_ISGID directory.
"dir sgid-self ::2755",
"dir sgid-sticky-self ::3755",
}
withWithoutOpenat2(t, true, func(t *testing.T) {
for name, test := range map[string]struct {
unsafePath string
expectedErr error
expectedModeBits FileMode
}{
"existing": {unsafePath: "a"},
"basic": {unsafePath: "a/b/c/d/e/f/g/h/i/j"},
"dotdot-in-nonexisting": {unsafePath: "a/b/c/d/e/f/g/h/i/j/k/../lmnop", expectedErr: unix.ENOENT},
"dotdot-in-existing": {unsafePath: "b/c/../c/./d/e/f/g/h"},
"dotdot-after-symlink": {unsafePath: "e/../dd/ee/ff"},
// Check that trying to create under a file fails.
"nondir-trailing": {unsafePath: "b/c/file", expectedErr: unix.ENOTDIR},
"nondir-dotdot": {unsafePath: "b/c/file/../d", expectedErr: unix.ENOTDIR},
"nondir-subdir": {unsafePath: "b/c/file/subdir", expectedErr: unix.ENOTDIR},
"nondir-symlink-trailing": {unsafePath: "b-file", expectedErr: unix.ENOTDIR},
"nondir-symlink-dotdot": {unsafePath: "b-file/../d", expectedErr: unix.ENOTDIR},
"nondir-symlink-subdir": {unsafePath: "b-file/subdir", expectedErr: unix.ENOTDIR},
// Dangling symlinks are not followed.
"dangling1-trailing": {unsafePath: "a-fake1", expectedErr: unix.EEXIST},
"dangling1-basic": {unsafePath: "a-fake1/foo", expectedErr: unix.EEXIST},
"dangling1-dotdot": {unsafePath: "a-fake1/../bar/baz", expectedErr: unix.ENOENT},
"dangling2-trailing": {unsafePath: "a-fake2", expectedErr: unix.EEXIST},
"dangling2-basic": {unsafePath: "a-fake2/foo", expectedErr: unix.EEXIST},
"dangling2-dotdot": {unsafePath: "a-fake2/../bar/baz", expectedErr: unix.ENOENT},
"dangling3-trailing": {unsafePath: "a-fake3", expectedErr: unix.EEXIST},
"dangling3-basic": {unsafePath: "a-fake3/foo", expectedErr: unix.EEXIST},
"dangling3-dotdot": {unsafePath: "a-fake3/../bar/baz", expectedErr: unix.ENOENT},
// Non-lexical symlinks should work.
"nonlexical-basic": {unsafePath: "target/foo"},
"nonlexical-level1-abs": {unsafePath: "link1/target_abs/foo"},
"nonlexical-level1-rel": {unsafePath: "link1/target_rel/foo"},
"nonlexical-level2-abs-abs": {unsafePath: "link2/link1_abs/target_abs/foo"},
"nonlexical-level2-abs-rel": {unsafePath: "link2/link1_abs/target_rel/foo"},
"nonlexical-level2-abs-open": {unsafePath: "link2/link1_abs/../target/foo"},
"nonlexical-level2-rel-abs": {unsafePath: "link2/link1_rel/target_abs/foo"},
"nonlexical-level2-rel-rel": {unsafePath: "link2/link1_rel/target_rel/foo"},
"nonlexical-level2-rel-open": {unsafePath: "link2/link1_rel/../target/foo"},
"nonlexical-level3-abs": {unsafePath: "link3/target_abs/foo"},
"nonlexical-level3-rel": {unsafePath: "link3/target_rel/foo"},
// But really tricky dangling symlinks should fail.
"dangling-tricky1-trailing": {unsafePath: "link3/deep_dangling1", expectedErr: unix.EEXIST},
"dangling-tricky1-basic": {unsafePath: "link3/deep_dangling1/foo", expectedErr: unix.EEXIST},
"dangling-tricky1-dotdot": {unsafePath: "link3/deep_dangling1/../bar", expectedErr: unix.ENOENT},
"dangling-tricky2-trailing": {unsafePath: "link3/deep_dangling2", expectedErr: unix.EEXIST},
"dangling-tricky2-basic": {unsafePath: "link3/deep_dangling2/foo", expectedErr: unix.EEXIST},
"dangling-tricky2-dotdot": {unsafePath: "link3/deep_dangling2/../bar", expectedErr: unix.ENOENT},
// And trying to mkdir inside a loop should fail.
"loop-trailing": {unsafePath: "loop/link", expectedErr: unix.ELOOP},
"loop-basic": {unsafePath: "loop/link/foo", expectedErr: unix.ELOOP},
"loop-dotdot": {unsafePath: "loop/link/../foo", expectedErr: unix.ELOOP},
// Make sure the S_ISGID handling is correct.
"sgid-dir-ownedbyus": {unsafePath: "sgid-self/foo/bar/baz", expectedModeBits: unix.S_ISGID},
"sgid-sticky-dir-ownedbyus": {unsafePath: "sgid-sticky-self/foo/bar/baz", expectedModeBits: unix.S_ISGID},
} {
test := test // copy iterator
t.Run(name, func(t *testing.T) {
root := createTree(t, tree...)
const mode = 0o711
checkMkdirAll(t, mkdirAll, root, test.unsafePath, mode, test.expectedModeBits|mode, test.expectedErr)
})
}
})
}
func TestMkdirAll_Basic(t *testing.T) {
testMkdirAll_Basic(t, mkdirAll_MkdirAll)
}
func TestMkdirAllHandle_Basic(t *testing.T) {
testMkdirAll_Basic(t, mkdirAll_MkdirAllHandle)
}
func testMkdirAll_AsRoot(t *testing.T, mkdirAll mkdirAllFunc) {
requireRoot(t) // chown
// We create a new tree for each test, but the template is the same.
tree := []string{
// S_ISGID directories.
"dir sgid-self ::2755",
"dir sgid-other 1000:1000:2755",
"dir sgid-sticky-self ::3755",
"dir sgid-sticky-other 1000:1000:3755",
}
withWithoutOpenat2(t, true, func(t *testing.T) {
for name, test := range map[string]struct {
unsafePath string
expectedErr error
expectedModeBits FileMode
}{
// Make sure the S_ISGID handling is correct.
"sgid-dir-ownedbyus": {unsafePath: "sgid-self/foo/bar/baz", expectedModeBits: unix.S_ISGID},
"sgid-dir-ownedbyother": {unsafePath: "sgid-other/foo/bar/baz", expectedModeBits: unix.S_ISGID},
"sgid-sticky-dir-ownedbyus": {unsafePath: "sgid-sticky-self/foo/bar/baz", expectedModeBits: unix.S_ISGID},
"sgid-sticky-dir-ownedbyother": {unsafePath: "sgid-sticky-other/foo/bar/baz", expectedModeBits: unix.S_ISGID},
} {
test := test // copy iterator
t.Run(name, func(t *testing.T) {
root := createTree(t, tree...)
const mode = 0o711
checkMkdirAll(t, mkdirAll, root, test.unsafePath, mode, test.expectedModeBits|mode, test.expectedErr)
})
}
})
}
func TestMkdirAll_AsRoot(t *testing.T) {
testMkdirAll_AsRoot(t, mkdirAll_MkdirAll)
}
func TestMkdirAllHandle_AsRoot(t *testing.T) {
testMkdirAll_AsRoot(t, mkdirAll_MkdirAllHandle)
}
func testMkdirAll_InvalidMode(t *testing.T, mkdirAll mkdirAllFunc) {
for _, test := range []struct {
mode FileMode
expectedErr error
}{
// os.FileMode bits are invalid.
{FileMode(os.ModeDir | 0o777), errInvalidMode},
{FileMode(os.ModeSticky | 0o777), errInvalidMode},
{FileMode(os.ModeIrregular | 0o777), errInvalidMode},
// unix.S_IFMT bits are also invalid.
{unix.S_IFDIR | 0o777, errInvalidMode},
{unix.S_IFREG | 0o777, errInvalidMode},
{unix.S_IFIFO | 0o777, errInvalidMode},
// suid/sgid bits are silently ignored by mkdirat and so we return an
// error explicitly.
{unix.S_ISUID | 0o777, errInvalidMode},
{unix.S_ISGID | 0o777, errInvalidMode},
{unix.S_ISUID | unix.S_ISGID | unix.S_ISVTX | 0o777, errInvalidMode},
// Proper sticky bit should work.
{unix.S_ISVTX | 0o777, nil},
// Regular mode bits.
{0o777, nil},
{0o711, nil},
} {
root := t.TempDir()
err := mkdirAll(t, root, "a/b/c", test.mode)
assert.ErrorIsf(t, err, test.expectedErr, "mkdirall 0o%.3o", test.mode)
}
}
func TestMkdirAll_InvalidMode(t *testing.T) {
testMkdirAll_InvalidMode(t, mkdirAll_MkdirAll)
}
func TestMkdirAllHandle_InvalidMode(t *testing.T) {
testMkdirAll_InvalidMode(t, mkdirAll_MkdirAllHandle)
}
type racingMkdirMeta struct {
passOkCount, passErrCount, failCount int
passErrCounts map[error]int
}
func newRacingMkdirMeta() *racingMkdirMeta {
return &racingMkdirMeta{
passErrCounts: map[error]int{},
}
}
func (m *racingMkdirMeta) checkMkdirAllHandle_Racing(t *testing.T, root, unsafePath string, mode FileMode, allowedErrs []error) {
rootDir, err := os.OpenFile(root, unix.O_PATH|unix.O_DIRECTORY|unix.O_CLOEXEC, 0)
require.NoError(t, err, "open root")
defer rootDir.Close()
handle, err := MkdirAllHandle(rootDir, unsafePath, mode)
if err != nil {
for _, allowedErr := range allowedErrs {
if errors.Is(err, allowedErr) {
m.passErrCounts[allowedErr]++
m.passErrCount++
return
}
}
assert.NoError(t, err)
m.failCount++
return
}
defer handle.Close()
// It's possible for an attacker to have swapped the final directory, but
// this is okay because MkdirAll will use pre-existing directories anyway.
// So there's no need to check the returned handle.
// TODO: Does it make sense to even try to check the handle path?
m.passOkCount++
}
func TestMkdirAllHandle_RacingRename(t *testing.T) {
withWithoutOpenat2(t, false, func(t *testing.T) {
treeSpec := []string{
"dir target/a/b/c",
"dir swapdir-empty-ok ::0711",
"dir swapdir-empty-badmode ::0777",
"dir swapdir-nonempty1 ::0711",
"file swapdir-nonempty1/aaa",
"dir swapdir-nonempty2 ::0711",
"dir swapdir-nonempty2/f ::0711",
"file swapfile foobar ::0711",
}
type test struct {
name string
pathA, pathB string
unsafePath string
allowedErrs []error
}
tests := []test{
{"good", "target/a/b/c/d/e", "swapdir-empty-ok", "target/a/b/c/d/e/f/g/h/i/j/k", nil},
{"trailing", "target/a/b/c/d/e", "swapdir-empty-badmode", "target/a/b/c/d/e", nil},
{"partial", "target/a/b/c/d/e", "swapdir-empty-badmode", "target/a/b/c/d/e/f/g/h/i/j/k", nil},
{"trailing", "target/a/b/c/d/e", "swapdir-nonempty1", "target/a/b/c/d/e", nil},
{"partial", "target/a/b/c/d/e", "swapdir-nonempty1", "target/a/b/c/d/e/f/g/h/i/j/k", nil},
{"trailing", "target/a/b/c/d/e", "swapdir-nonempty2", "target/a/b/c/d/e", nil},
{"partial", "target/a/b/c/d/e", "swapdir-nonempty2", "target/a/b/c/d/e/f/g/h/i/j/k", []error{unix.EEXIST}},
{"trailing", "target/a/b/c/d/e", "swapfile", "target/a/b/c/d/e", []error{unix.ENOTDIR}},
{"partial", "target/a/b/c/d/e", "swapfile", "target/a/b/c/d/e/f/g/h/i/j/k", []error{unix.ENOTDIR}},
}
if unix.Geteuid() == 0 {
// Add some wrong-uid cases if we are root.
treeSpec = append(treeSpec,
"dir swapdir-empty-badowner1 123:0:0711",
"dir swapdir-empty-badowner2 0:456:0711",
"dir swapdir-empty-badowner3 111:222:0711",
)
tests = append(tests, []test{
{"trailing", "target/a/b/c/d/e", "swapdir-empty-badowner1", "target/a/b/c/d/e", nil},
{"partial", "target/a/b/c/d/e", "swapdir-empty-badowner1", "target/a/b/c/d/e/f/g/h/i/j/k", nil},
{"trailing", "target/a/b/c/d/e", "swapdir-empty-badowner2", "target/a/b/c/d/e", nil},
{"partial", "target/a/b/c/d/e", "swapdir-empty-badowner2", "target/a/b/c/d/e/f/g/h/i/j/k", nil},
{"trailing", "target/a/b/c/d/e", "swapdir-empty-badowner3", "target/a/b/c/d/e", nil},
{"partial", "target/a/b/c/d/e", "swapdir-empty-badowner3", "target/a/b/c/d/e/f/g/h/i/j/k", nil},
}...)
}
for _, test := range tests {
test := test // copy iterator
t.Run(fmt.Sprintf("%s-%s", test.pathB, test.name), func(t *testing.T) {
rootCh := make(chan string)
defer close(rootCh)
go func(rootCh <-chan string) {
var root string
for {
select {
case newRoot, ok := <-rootCh:
if !ok {
return
}
root = newRoot
default:
if root != "" {
pathA := filepath.Join(root, test.pathA)
pathB := filepath.Join(root, test.pathB)
_ = unix.Renameat2(unix.AT_FDCWD, pathA, unix.AT_FDCWD, pathB, unix.RENAME_EXCHANGE)
}
}
}
}(rootCh)
// Do several runs to try to catch bugs.
const testRuns = 2000
m := newRacingMkdirMeta()
for i := 0; i < testRuns; i++ {
root := createTree(t, treeSpec...)
rootCh <- root
runtime.Gosched() // give the thread some time to do a rename
m.checkMkdirAllHandle_Racing(t, root, test.unsafePath, 0o711, test.allowedErrs)
rootCh <- ""
// Clean up the root after each run so we don't exhaust all
// space in the tmpfs.
_ = os.RemoveAll(root)
}
pct := func(count int) string {
return fmt.Sprintf("%d(%.3f%%)", count, 100.0*float64(count)/float64(testRuns))
}
// Output some stats.
t.Logf("after %d runs: passOk=%s passErr=%s fail=%s",
testRuns, pct(m.passOkCount), pct(m.passErrCount), pct(m.failCount))
if len(m.passErrCounts) > 0 {
t.Logf(" passErr breakdown:")
for err, count := range m.passErrCounts {
t.Logf(" %3.d: %v", count, err)
}
}
})
}
})
}
func TestMkdirAllHandle_RacingDelete(t *testing.T) {
withWithoutOpenat2(t, false, func(t *testing.T) {
treeSpec := []string{
"dir target/a/b/c",
}
for _, test := range []struct {
name string
rmPath string
unsafePath string
allowedErrs []error
}{
{"rm-top", "target", "target/a/b/c/d/e/f/g/h/i/j/k", []error{errInvalidDirectory, unix.ENOENT}},
{"rm-existing", "target/a/b/c", "target/a/b/c/d/e/f/g/h/i/j/k", []error{errInvalidDirectory, unix.ENOENT}},
{"rm-nonexisting", "target/a/b/c/d/e", "target/a/b/c/d/e/f/g/h/i/j/k", []error{errInvalidDirectory, unix.ENOENT}},
} {
test := test // copy iterator
t.Run(test.rmPath, func(t *testing.T) {
rootCh := make(chan string)
defer close(rootCh)
go func(rootCh <-chan string) {
var root string
for {
select {
case newRoot, ok := <-rootCh:
if !ok {
return
}
root = newRoot
default:
if root != "" {
_ = os.RemoveAll(filepath.Join(root, test.rmPath))
}
}
}
}(rootCh)
// Do several runs to try to catch bugs.
const testRuns = 2000
m := newRacingMkdirMeta()
for i := 0; i < testRuns; i++ {
root := createTree(t, treeSpec...)
rootCh <- root
m.checkMkdirAllHandle_Racing(t, root, test.unsafePath, 0o711, test.allowedErrs)
rootCh <- ""
// Clean up the root after each run so we don't exhaust all
// space in the tmpfs.
_ = os.RemoveAll(root + "/..")
}
pct := func(count int) string {
return fmt.Sprintf("%d(%.3f%%)", count, 100.0*float64(count)/float64(testRuns))
}
// Output some stats.
t.Logf("after %d runs: passOk=%s passErr=%s fail=%s",
testRuns, pct(m.passOkCount), pct(m.passErrCount), pct(m.failCount))
if len(m.passErrCounts) > 0 {
t.Logf(" passErr breakdown:")
for err, count := range m.passErrCounts {
t.Logf(" %3.d: %v", count, err)
}
}
})
}
})
}
|