f8d9fa9e80
This upgrades all of libgo other than the runtime package to the Go 1.4 release. In Go 1.4 much of the runtime was rewritten into Go. Merging that code will take more time and will not change the API, so I'm putting it off for now. There are a few runtime changes anyhow, to accomodate other packages that rely on minor modifications to the runtime support. The compiler changes slightly to add a one-bit flag to each type descriptor kind that is stored directly in an interface, which for gccgo is currently only pointer types. Another one-bit flag (gcprog) is reserved because it is used by the gc compiler, but gccgo does not currently use it. There is another error check in the compiler since I ran across it during testing. gotools/: * Makefile.am (go_cmd_go_files): Sort entries. Add generate.go. * Makefile.in: Rebuild. From-SVN: r219627
55 lines
1.1 KiB
Go
55 lines
1.1 KiB
Go
// Copyright 2011 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.
|
|
|
|
package os
|
|
|
|
func isExist(err error) bool {
|
|
switch pe := err.(type) {
|
|
case nil:
|
|
return false
|
|
case *PathError:
|
|
err = pe.Err
|
|
case *LinkError:
|
|
err = pe.Err
|
|
}
|
|
return contains(err.Error(), " exists")
|
|
}
|
|
|
|
func isNotExist(err error) bool {
|
|
switch pe := err.(type) {
|
|
case nil:
|
|
return false
|
|
case *PathError:
|
|
err = pe.Err
|
|
case *LinkError:
|
|
err = pe.Err
|
|
}
|
|
return contains(err.Error(), "does not exist") || contains(err.Error(), "not found") ||
|
|
contains(err.Error(), "has been removed") || contains(err.Error(), "no parent")
|
|
}
|
|
|
|
func isPermission(err error) bool {
|
|
switch pe := err.(type) {
|
|
case nil:
|
|
return false
|
|
case *PathError:
|
|
err = pe.Err
|
|
case *LinkError:
|
|
err = pe.Err
|
|
}
|
|
return contains(err.Error(), "permission denied")
|
|
}
|
|
|
|
// contains is a local version of strings.Contains. It knows len(sep) > 1.
|
|
func contains(s, sep string) bool {
|
|
n := len(sep)
|
|
c := sep[0]
|
|
for i := 0; i+n <= len(s); i++ {
|
|
if s[i] == c && s[i:i+n] == sep {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|