--- nono/fpe/fpu_sqrt.c	2026/04/29 17:04:28	1.1.1.1
+++ nono/fpe/fpu_sqrt.c	2026/04/29 17:05:23	1.1.1.2
@@ -1,4 +1,4 @@
-/*	$NetBSD: fpu_sqrt.c,v 1.8 2013/03/26 11:30:21 isaki Exp $ */
+/*	$NetBSD: fpu_sqrt.c,v 1.9 2022/05/24 20:00:49 andvar Exp $ */
 
 /*
  * Copyright (c) 1992, 1993
@@ -119,7 +119,7 @@
  * zero bit at the top of x.  Doing so means that q is not going to acquire
  * a 1 bit in the first trip around the loop (since x0 < 2^NBITS).  If the
  * final value in x is not needed, or can be off by a factor of 2, this is
- * equivalant to moving the `x *= 2' step to the bottom of the loop:
+ * equivalent to moving the `x *= 2' step to the bottom of the loop:
  *
  *	for k = NBITS-1 to 0 step -1 do if ... fi; x *= 2; done
  *