mirror of
https://github.com/emmansun/gmsm.git
synced 2025-04-24 03:06:18 +08:00
40 lines
1.4 KiB
Go
40 lines
1.4 KiB
Go
![]() |
package cipher
|
||
|
|
||
|
import "unsafe"
|
||
|
|
||
|
// AnyOverlap reports whether x and y share memory at any (not necessarily
|
||
|
// corresponding) index. The memory beyond the slice length is ignored.
|
||
|
func AnyOverlap(x, y []byte) bool {
|
||
|
return len(x) > 0 && len(y) > 0 &&
|
||
|
uintptr(unsafe.Pointer(&x[0])) <= uintptr(unsafe.Pointer(&y[len(y)-1])) &&
|
||
|
uintptr(unsafe.Pointer(&y[0])) <= uintptr(unsafe.Pointer(&x[len(x)-1]))
|
||
|
}
|
||
|
|
||
|
// InexactOverlap reports whether x and y share memory at any non-corresponding
|
||
|
// index. The memory beyond the slice length is ignored. Note that x and y can
|
||
|
// have different lengths and still not have any inexact overlap.
|
||
|
//
|
||
|
// InexactOverlap can be used to implement the requirements of the crypto/cipher
|
||
|
// AEAD, Block, BlockMode and Stream interfaces.
|
||
|
func InexactOverlap(x, y []byte) bool {
|
||
|
if len(x) == 0 || len(y) == 0 || &x[0] == &y[0] {
|
||
|
return false
|
||
|
}
|
||
|
return AnyOverlap(x, y)
|
||
|
}
|
||
|
|
||
|
// SliceForAppend takes a slice and a requested number of bytes. It returns a
|
||
|
// slice with the contents of the given slice followed by that many bytes and a
|
||
|
// second slice that aliases into it and contains only the extra bytes. If the
|
||
|
// original slice has sufficient capacity then no allocation is performed.
|
||
|
func SliceForAppend(in []byte, n int) (head, tail []byte) {
|
||
|
if total := len(in) + n; cap(in) >= total {
|
||
|
head = in[:total]
|
||
|
} else {
|
||
|
head = make([]byte, total)
|
||
|
copy(head, in)
|
||
|
}
|
||
|
tail = head[len(in):]
|
||
|
return
|
||
|
}
|