mirror of https://github.com/docker/cli.git
67 lines
1.7 KiB
Go
67 lines
1.7 KiB
Go
|
package loader
|
||
|
|
||
|
// Copyright 2010 The Go Authors. All rights reserved.
|
||
|
// Use of this source code is governed by a BSD-style
|
||
|
// license that can be found in the LICENSE file.
|
||
|
// https://github.com/golang/go/blob/master/LICENSE
|
||
|
|
||
|
// This file contains utilities to check for Windows absolute paths on Linux.
|
||
|
// The code in this file was largely copied from the Golang filepath package
|
||
|
// https://github.com/golang/go/blob/1d0e94b1e13d5e8a323a63cd1cc1ef95290c9c36/src/path/filepath/path_windows.go#L12-L65
|
||
|
|
||
|
func isSlash(c uint8) bool {
|
||
|
return c == '\\' || c == '/'
|
||
|
}
|
||
|
|
||
|
// isAbs reports whether the path is a Windows absolute path.
|
||
|
func isAbs(path string) (b bool) {
|
||
|
l := volumeNameLen(path)
|
||
|
if l == 0 {
|
||
|
return false
|
||
|
}
|
||
|
path = path[l:]
|
||
|
if path == "" {
|
||
|
return false
|
||
|
}
|
||
|
return isSlash(path[0])
|
||
|
}
|
||
|
|
||
|
// volumeNameLen returns length of the leading volume name on Windows.
|
||
|
// It returns 0 elsewhere.
|
||
|
// nolint: gocyclo
|
||
|
func volumeNameLen(path string) int {
|
||
|
if len(path) < 2 {
|
||
|
return 0
|
||
|
}
|
||
|
// with drive letter
|
||
|
c := path[0]
|
||
|
if path[1] == ':' && ('a' <= c && c <= 'z' || 'A' <= c && c <= 'Z') {
|
||
|
return 2
|
||
|
}
|
||
|
// is it UNC? https://msdn.microsoft.com/en-us/library/windows/desktop/aa365247(v=vs.85).aspx
|
||
|
if l := len(path); l >= 5 && isSlash(path[0]) && isSlash(path[1]) &&
|
||
|
!isSlash(path[2]) && path[2] != '.' {
|
||
|
// first, leading `\\` and next shouldn't be `\`. its server name.
|
||
|
for n := 3; n < l-1; n++ {
|
||
|
// second, next '\' shouldn't be repeated.
|
||
|
if isSlash(path[n]) {
|
||
|
n++
|
||
|
// third, following something characters. its share name.
|
||
|
if !isSlash(path[n]) {
|
||
|
if path[n] == '.' {
|
||
|
break
|
||
|
}
|
||
|
for ; n < l; n++ {
|
||
|
if isSlash(path[n]) {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
return n
|
||
|
}
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return 0
|
||
|
}
|