diff --git a/bigint.go b/bigint.go
index ab89ebc..c2b6e64 100644
--- a/bigint.go
+++ b/bigint.go
@@ -214,11 +214,20 @@ func (z *BigInt) innerAsUint() (val uint, neg bool, ok bool) {
 		// The value is not stored inline.
 		return 0, false, false
 	}
-	for i := 1; i < len(z._inline); i++ {
-		if z._inline[i] != 0 {
+	if inlineWords == 2 {
+		// Manually unrolled loop for current inlineWords setting.
+		if z._inline[1] != 0 {
 			// The value can not fit in a uint.
 			return 0, false, false
 		}
+	} else {
+		// Fallback for other values of inlineWords.
+		for i := 1; i < len(z._inline); i++ {
+			if z._inline[i] != 0 {
+				// The value can not fit in a uint.
+				return 0, false, false
+			}
+		}
 	}
 
 	val = uint(z._inline[0])
@@ -235,8 +244,14 @@ func (z *BigInt) innerAsUint() (val uint, neg bool, ok bool) {
 func (z *BigInt) updateInnerFromUint(val uint, neg bool) {
 	// Set the inline value, making sure to clear out all other words.
 	z._inline[0] = big.Word(val)
-	for i := 1; i < len(z._inline); i++ {
-		z._inline[i] = 0
+	if inlineWords == 2 {
+		// Manually unrolled loop for current inlineWords setting.
+		z._inline[1] = 0
+	} else {
+		// Fallback for other values of inlineWords.
+		for i := 1; i < len(z._inline); i++ {
+			z._inline[i] = 0
+		}
 	}
 
 	// Set or unset the negative sentinel.
diff --git a/context.go b/context.go
index 4b3a96c..e84d330 100644
--- a/context.go
+++ b/context.go
@@ -79,6 +79,7 @@ func (c *Context) WithPrecision(p uint32) *Context {
 }
 
 // goError converts flags into an error based on c.Traps.
+//gcassert:inline
 func (c *Context) goError(flags Condition) (Condition, error) {
 	return flags.GoError(c.Traps)
 }
@@ -88,25 +89,31 @@ func (c *Context) etiny() int32 {
 	return c.MinExponent - int32(c.Precision) + 1
 }
 
-// setIfNaN sets d to the first NaNSignaling, or otherwise first NaN, of
-// vals. d' is unchanged if vals contains no NaNs. True is returned if d
-// was set to a NaN.
-func (c *Context) setIfNaN(d *Decimal, vals ...*Decimal) (bool, Condition, error) {
+// shouldSetAsNaN determines whether setAsNaN should be called, given
+// the provided values, where x is required and y is optional. It is
+// split from setAsNaN to permit inlining of this function.
+//gcassert:inline
+func (c *Context) shouldSetAsNaN(x, y *Decimal) bool {
+	return x.Form == NaNSignaling || x.Form == NaN ||
+		(y != nil && (y.Form == NaNSignaling || y.Form == NaN))
+}
+
+// setAsNaN sets d to the first NaNSignaling, or otherwise first NaN, of
+// x and y. x is required, y is optional. Expects one of the two inputs
+// to be NaN.
+func (c *Context) setAsNaN(d *Decimal, x, y *Decimal) (Condition, error) {
 	var nan *Decimal
-Loop:
-	for _, v := range vals {
-		switch v.Form {
-		case NaNSignaling:
-			nan = v
-			break Loop
-		case NaN:
-			if nan == nil {
-				nan = v
-			}
-		}
-	}
-	if nan == nil {
-		return false, 0, nil
+	// Per the method contract, NaNSignaling takes precedence over NaN.
+	if x.Form == NaNSignaling {
+		nan = x
+	} else if y != nil && y.Form == NaNSignaling {
+		nan = y
+	} else if x.Form == NaN {
+		nan = x
+	} else if y != nil && y.Form == NaN {
+		nan = y
+	} else {
+		return 0, errors.Errorf("no NaN value found; was shouldSetAsNaN called?")
 	}
 	d.Set(nan)
 	var res Condition
@@ -115,12 +122,12 @@ Loop:
 		d.Form = NaN
 	}
 	_, err := c.goError(res)
-	return true, res, err
+	return res, err
 }
 
 func (c *Context) add(d, x, y *Decimal, subtract bool) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x, y); set {
-		return res, err
+	if c.shouldSetAsNaN(x, y) {
+		return c.setAsNaN(d, x, y)
 	}
 	xn := x.Negative
 	yn := y.Negative != subtract
@@ -156,7 +163,8 @@ func (c *Context) add(d, x, y *Decimal, subtract bool) (Condition, error) {
 	}
 	d.Exponent = s
 	d.Form = Finite
-	return c.Round(d, d)
+	res := c.round(d, d)
+	return c.goError(res)
 }
 
 // Add sets d to the sum x+y.
@@ -171,26 +179,28 @@ func (c *Context) Sub(d, x, y *Decimal) (Condition, error) {
 
 // Abs sets d to |x| (the absolute value of x).
 func (c *Context) Abs(d, x *Decimal) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
-		return res, err
+	if c.shouldSetAsNaN(x, nil) {
+		return c.setAsNaN(d, x, nil)
 	}
 	d.Abs(x)
-	return c.Round(d, d)
+	res := c.round(d, d)
+	return c.goError(res)
 }
 
 // Neg sets d to -x.
 func (c *Context) Neg(d, x *Decimal) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
-		return res, err
+	if c.shouldSetAsNaN(x, nil) {
+		return c.setAsNaN(d, x, nil)
 	}
 	d.Neg(x)
-	return c.Round(d, d)
+	res := c.round(d, d)
+	return c.goError(res)
 }
 
 // Mul sets d to the product x*y.
 func (c *Context) Mul(d, x, y *Decimal) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x, y); set {
-		return res, err
+	if c.shouldSetAsNaN(x, y) {
+		return c.setAsNaN(d, x, y)
 	}
 	// The sign of the result is the exclusive or of the signs of the operands.
 	neg := x.Negative != y.Negative
@@ -207,15 +217,17 @@ func (c *Context) Mul(d, x, y *Decimal) (Condition, error) {
 	d.Coeff.Mul(&x.Coeff, &y.Coeff)
 	d.Negative = neg
 	d.Form = Finite
-	res := d.setExponent(c, 0, int64(x.Exponent), int64(y.Exponent))
+	res := d.setExponent(c, unknownNumDigits, 0, int64(x.Exponent), int64(y.Exponent))
 	res |= c.round(d, d)
 	return c.goError(res)
 }
 
 func (c *Context) quoSpecials(d, x, y *Decimal, canClamp bool) (bool, Condition, error) {
-	if set, res, err := c.setIfNaN(d, x, y); set {
+	if c.shouldSetAsNaN(x, y) {
+		res, err := c.setAsNaN(d, x, y)
 		return true, res, err
 	}
+
 	// The sign of the result is the exclusive or of the signs of the operands.
 	neg := x.Negative != y.Negative
 	if xi, yi := x.Form == Infinite, y.Form == Infinite; xi || yi {
@@ -360,7 +372,7 @@ func (c *Context) Quo(d, x, y *Decimal) (Condition, error) {
 	// The exponent of the result is computed by subtracting the sum of the
 	// original exponent of the divisor and the value of adjust at the end of
 	// the coefficient calculation from the original exponent of the dividend.
-	res |= quo.setExponent(c, res, int64(x.Exponent), int64(-y.Exponent), -adjust, diff)
+	res |= quo.setExponent(c, unknownNumDigits, res, int64(x.Exponent), int64(-y.Exponent), -adjust, diff)
 	quo.Negative = neg
 	d.Set(&quo)
 	return c.goError(res)
@@ -396,8 +408,8 @@ func (c *Context) QuoInteger(d, x, y *Decimal) (Condition, error) {
 // Rem sets d to the remainder part of the quotient x/y. If
 // the integer part cannot fit in d.Precision digits, an error is returned.
 func (c *Context) Rem(d, x, y *Decimal) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x, y); set {
-		return res, err
+	if c.shouldSetAsNaN(x, y) {
+		return c.setAsNaN(d, x, y)
 	}
 
 	if x.Form != Finite {
@@ -439,8 +451,9 @@ func (c *Context) Rem(d, x, y *Decimal) (Condition, error) {
 }
 
 func (c *Context) rootSpecials(d, x *Decimal, factor int32) (bool, Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
-		return set, res, err
+	if c.shouldSetAsNaN(x, nil) {
+		res, err := c.setAsNaN(d, x, nil)
+		return true, res, err
 	}
 	if x.Form == Infinite {
 		if x.Negative {
@@ -552,7 +565,8 @@ func (c *Context) Sqrt(d, x *Decimal) (Condition, error) {
 	nc.Precision = c.Precision
 	nc.Rounding = RoundHalfEven
 	d.Reduce(d) // Remove trailing zeros.
-	return nc.Round(d, d)
+	res := nc.round(d, d)
+	return nc.goError(res)
 }
 
 // Cbrt sets d to the cube root of x.
@@ -631,7 +645,8 @@ func (c *Context) Cbrt(d, x *Decimal) (Condition, error) {
 	}
 
 	z0.Set(x)
-	res, err := c.Round(d, &z)
+	res := c.round(d, &z)
+	res, err := c.goError(res)
 	d.Negative = neg
 
 	// Set z = d^3 to check for exactness.
@@ -650,8 +665,9 @@ func (c *Context) Cbrt(d, x *Decimal) (Condition, error) {
 }
 
 func (c *Context) logSpecials(d, x *Decimal) (bool, Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
-		return set, res, err
+	if c.shouldSetAsNaN(x, nil) {
+		res, err := c.setAsNaN(d, x, nil)
+		return true, res, err
 	}
 	if x.Sign() < 0 {
 		d.Set(decimalNaN)
@@ -873,8 +889,8 @@ func (c *Context) Exp(d, x *Decimal) (Condition, error) {
 	// See: Variable Precision Exponential Function, T. E. Hull and A. Abrham, ACM
 	// Transactions on Mathematical Software, Vol 12 #2, pp79-91, ACM, June 1986.
 
-	if set, res, err := c.setIfNaN(d, x); set {
-		return res, err
+	if c.shouldSetAsNaN(x, nil) {
+		return c.setAsNaN(d, x, nil)
 	}
 	if x.Form == Infinite {
 		if x.Negative {
@@ -1037,8 +1053,8 @@ func (c *Context) integerPower(d, x *Decimal, y *BigInt) (Condition, error) {
 
 // Pow sets d = x**y.
 func (c *Context) Pow(d, x, y *Decimal) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x, y); set {
-		return res, err
+	if c.shouldSetAsNaN(x, y) {
+		return c.setAsNaN(d, x, y)
 	}
 
 	var integ, frac Decimal
@@ -1145,8 +1161,8 @@ func (c *Context) Pow(d, x, y *Decimal) (Condition, error) {
 // Quantize adjusts and rounds x as necessary so it is represented with
 // exponent exp and stores the result in d.
 func (c *Context) Quantize(d, x *Decimal, exp int32) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
-		return res, err
+	if c.shouldSetAsNaN(x, nil) {
+		return c.setAsNaN(d, x, nil)
 	}
 	if x.Form == Infinite || exp < c.etiny() {
 		d.Set(decimalNaN)
@@ -1219,8 +1235,9 @@ func (c *Context) toIntegral(d, x *Decimal) Condition {
 }
 
 func (c *Context) toIntegralSpecials(d, x *Decimal) (bool, Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
-		return set, res, err
+	if c.shouldSetAsNaN(x, nil) {
+		res, err := c.setAsNaN(d, x, nil)
+		return true, res, err
 	}
 	if x.Form != Finite {
 		d.Set(x)
@@ -1272,13 +1289,15 @@ func (c *Context) Floor(d, x *Decimal) (Condition, error) {
 // Reduce sets d to x with all trailing zeros removed and returns the number
 // of zeros removed.
 func (c *Context) Reduce(d, x *Decimal) (int, Condition, error) {
-	if set, res, err := c.setIfNaN(d, x); set {
+	if c.shouldSetAsNaN(x, nil) {
+		res, err := c.setAsNaN(d, x, nil)
 		return 0, res, err
 	}
 	neg := x.Negative
 	_, n := d.Reduce(x)
 	d.Negative = neg
-	res, err := c.Round(d, d)
+	res := c.round(d, d)
+	res, err := c.goError(res)
 	return n, res, err
 }
 
diff --git a/decimal.go b/decimal.go
index 443ccc6..03c8a88 100644
--- a/decimal.go
+++ b/decimal.go
@@ -160,7 +160,7 @@ func (d *Decimal) setString(c *Context, s string) (Condition, error) {
 	}
 	// No parse errors, can now flag as finite.
 	d.Form = Finite
-	return c.goError(d.setExponent(c, 0, exps...))
+	return c.goError(d.setExponent(c, unknownNumDigits, 0, exps...))
 }
 
 // NewFromString creates a new decimal from s. It has no restrictions on
@@ -197,14 +197,21 @@ func (c *Context) SetString(d *Decimal, s string) (*Decimal, Condition, error) {
 }
 
 // Set sets d's fields to the values of x and returns d.
+//gcassert:inline
 func (d *Decimal) Set(x *Decimal) *Decimal {
 	if d == x {
 		return d
 	}
+	return d.setSlow(x)
+}
+
+// setSlow is split from Set to allow the aliasing fast-path to be
+// inlined in callers.
+func (d *Decimal) setSlow(x *Decimal) *Decimal {
+	d.Form = x.Form
 	d.Negative = x.Negative
-	d.Coeff.Set(&x.Coeff)
 	d.Exponent = x.Exponent
-	d.Form = x.Form
+	d.Coeff.Set(&x.Coeff)
 	return d
 }
 
@@ -276,14 +283,18 @@ func (d *Decimal) Float64() (float64, error) {
 
 const (
 	errExponentOutOfRangeStr = "exponent out of range"
+
+	unknownNumDigits = int64(-1)
 )
 
 // setExponent sets d's Exponent to the sum of xs. Each value and the sum
 // of xs must fit within an int32. An error occurs if the sum is outside of
-// the MaxExponent or MinExponent range. res is any Condition previously set
-// for this operation, which can cause Underflow to be set if, for example,
-// Inexact is already set.
-func (d *Decimal) setExponent(c *Context, res Condition, xs ...int64) Condition {
+// the MaxExponent or MinExponent range. nd is the number of digits in d, as
+// computed by NumDigits. Callers can pass unknownNumDigits to indicate that
+// they have not yet computed this digit count, in which case setExponent will
+// do so. res is any Condition previously set for this operation, which can
+// cause Underflow to be set if, for example, Inexact is already set.
+func (d *Decimal) setExponent(c *Context, nd int64, res Condition, xs ...int64) Condition {
 	var sum int64
 	for _, x := range xs {
 		if x > MaxExponent {
@@ -296,7 +307,9 @@ func (d *Decimal) setExponent(c *Context, res Condition, xs ...int64) Condition
 	}
 	r := int32(sum)
 
-	nd := d.NumDigits()
+	if nd == unknownNumDigits {
+		nd = d.NumDigits()
+	}
 	// adj is the adjusted exponent: exponent + clength - 1
 	adj := sum + nd - 1
 	// Make sure it is less than the system limits.
@@ -486,8 +499,8 @@ func (d *Decimal) cmpOrder() int {
 // This comparison respects the normal rules of special values (like NaN),
 // and does not compare them.
 func (c *Context) Cmp(d, x, y *Decimal) (Condition, error) {
-	if set, res, err := c.setIfNaN(d, x, y); set {
-		return res, err
+	if c.shouldSetAsNaN(x, y) {
+		return c.setAsNaN(d, x, y)
 	}
 	v := x.Cmp(y)
 	d.SetInt64(int64(v))
diff --git a/round.go b/round.go
index 4cea210..92998c5 100644
--- a/round.go
+++ b/round.go
@@ -24,7 +24,7 @@ func (c *Context) Round(d, x *Decimal) (Condition, error) {
 func (c *Context) round(d, x *Decimal) Condition {
 	if c.Precision == 0 {
 		d.Set(x)
-		return d.setExponent(c, 0, int64(d.Exponent))
+		return d.setExponent(c, unknownNumDigits, 0, int64(d.Exponent))
 	}
 	res := c.Rounding.Round(c, d, x)
 	return res
@@ -74,7 +74,7 @@ func (r Rounder) Round(c *Context, d, x *Decimal) Condition {
 		// Subnormal is defined before rounding.
 		res |= Subnormal
 		// setExponent here to prevent double-rounded subnormals.
-		res |= d.setExponent(c, res, int64(d.Exponent))
+		res |= d.setExponent(c, nd, res, int64(d.Exponent))
 		return res
 	}
 
@@ -100,10 +100,12 @@ func (r Rounder) Round(c *Context, d, x *Decimal) Condition {
 			}
 		}
 		d.Coeff.Set(&y)
+		// The coefficient changed, so recompute num digits in setExponent.
+		nd = unknownNumDigits
 	} else {
 		diff = 0
 	}
-	res |= d.setExponent(c, res, int64(d.Exponent), diff)
+	res |= d.setExponent(c, nd, res, int64(d.Exponent), diff)
 	return res
 }