diff --git a/src/lib/libc/stdlib/qsort.3 b/src/lib/libc/stdlib/qsort.3
index 4481a96e..36eaed87 100644
--- a/src/lib/libc/stdlib/qsort.3
+++ b/src/lib/libc/stdlib/qsort.3
@@ -29,9 +29,9 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: qsort.3,v 1.17 2013/07/17 05:42:11 schwarze Exp $
+.\"	$OpenBSD: qsort.3,v 1.18 2015/01/29 01:46:31 schwarze Exp $
 .\"
-.Dd $Mdocdate: July 17 2013 $
+.Dd $Mdocdate: January 29 2015 $
 .Dt QSORT 3
 .Os
 .Sh NAME
@@ -147,14 +147,7 @@ The
 .Fn qsort
 function returns no value.
 .Pp
-Upon successful completion,
-.Fn heapsort
-and
-.Fn mergesort
-return 0.
-Otherwise, they return \-1 and the global variable
-.Va errno
-is set to indicate the error.
+.Rv -std heapsort mergesort
 .Sh ERRORS
 The
 .Fn heapsort
diff --git a/src/lib/libc/stdlib/radixsort.3 b/src/lib/libc/stdlib/radixsort.3
index e62f7602..e706b798 100644
--- a/src/lib/libc/stdlib/radixsort.3
+++ b/src/lib/libc/stdlib/radixsort.3
@@ -25,9 +25,9 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: radixsort.3,v 1.12 2013/06/05 03:39:23 tedu Exp $
+.\"	$OpenBSD: radixsort.3,v 1.13 2015/01/29 01:46:31 schwarze Exp $
 .\"
-.Dd $Mdocdate: June 5 2013 $
+.Dd $Mdocdate: January 29 2015 $
 .Dt RADIXSORT 3
 .Os
 .Sh NAME
@@ -78,8 +78,7 @@ If
 is
 .Dv NULL ,
 the contents of the array are sorted in ascending order according to the
-.Tn ASCII
-order of the byte strings they reference and
+ASCII order of the byte strings they reference and
 .Fa endbyte
 has a sorting weight of 0.
 .Pp
@@ -101,10 +100,7 @@ These functions are variants of most-significant-byte radix sorting; in
 particular, see D.E. Knuth's Algorithm R and section 5.2.5, exercise 10.
 They take linear time relative to the number of bytes in the strings.
 .Sh RETURN VALUES
-Upon successful completion 0 is returned.
-Otherwise, \-1 is returned and the global variable
-.Va errno
-is set to indicate the error.
+.Rv -std
 .Sh ERRORS
 .Bl -tag -width Er
 .It Bq Er EINVAL