summaryrefslogtreecommitdiffhomepage
path: root/pkg/usermem
diff options
context:
space:
mode:
authorgVisor bot <gvisor-bot@google.com>2021-01-12 01:07:50 +0000
committergVisor bot <gvisor-bot@google.com>2021-01-12 01:07:50 +0000
commit3f46e58c75a67dbab7422b1f2063cb633c135838 (patch)
tree96a5e37860d0b26edd2d92866f6727f4f7ada92f /pkg/usermem
parentf125ec225a7f250d8be708aee6e045ed67279ee2 (diff)
parente06c2b1264f5800730b93eff5c9913fd870025b9 (diff)
Merge release-20201216.0-85-ge06c2b126 (automated)
Diffstat (limited to 'pkg/usermem')
-rw-r--r--pkg/usermem/addr_range.go14
1 files changed, 14 insertions, 0 deletions
diff --git a/pkg/usermem/addr_range.go b/pkg/usermem/addr_range.go
index 152ed1434..6e030127b 100644
--- a/pkg/usermem/addr_range.go
+++ b/pkg/usermem/addr_range.go
@@ -13,27 +13,37 @@ type AddrRange struct {
// WellFormed returns true if r.Start <= r.End. All other methods on a Range
// require that the Range is well-formed.
+//
+//go:nosplit
func (r AddrRange) WellFormed() bool {
return r.Start <= r.End
}
// Length returns the length of the range.
+//
+//go:nosplit
func (r AddrRange) Length() Addr {
return r.End - r.Start
}
// Contains returns true if r contains x.
+//
+//go:nosplit
func (r AddrRange) Contains(x Addr) bool {
return r.Start <= x && x < r.End
}
// Overlaps returns true if r and r2 overlap.
+//
+//go:nosplit
func (r AddrRange) Overlaps(r2 AddrRange) bool {
return r.Start < r2.End && r2.Start < r.End
}
// IsSupersetOf returns true if r is a superset of r2; that is, the range r2 is
// contained within r.
+//
+//go:nosplit
func (r AddrRange) IsSupersetOf(r2 AddrRange) bool {
return r.Start <= r2.Start && r.End >= r2.End
}
@@ -41,6 +51,8 @@ func (r AddrRange) IsSupersetOf(r2 AddrRange) bool {
// Intersect returns a range consisting of the intersection between r and r2.
// If r and r2 do not overlap, Intersect returns a range with unspecified
// bounds, but for which Length() == 0.
+//
+//go:nosplit
func (r AddrRange) Intersect(r2 AddrRange) AddrRange {
if r.Start < r2.Start {
r.Start = r2.Start
@@ -57,6 +69,8 @@ func (r AddrRange) Intersect(r2 AddrRange) AddrRange {
// CanSplitAt returns true if it is legal to split a segment spanning the range
// r at x; that is, splitting at x would produce two ranges, both of which have
// non-zero length.
+//
+//go:nosplit
func (r AddrRange) CanSplitAt(x Addr) bool {
return r.Contains(x) && r.Start < x
}