5 files changed, 14 insertions, 14 deletions
diff --git a/doc/libs6/accessrules.html b/doc/libs6/accessrules.html
index 20d3f2c..4cdca6c 100644
--- a/doc/libs6/accessrules.html
+++ b/doc/libs6/accessrules.html
@@ -66,7 +66,7 @@ Namely:
 </p>
 
 <p>
-<code>s6_accessrules_result_t f (char const *key, unsigned int keylen, void *handle, s6_accessrules_params_t *params) </code>
+<code>s6_accessrules_result_t f (char const *key, size_t keylen, void *handle, s6_accessrules_params_t *params) </code>
 </p>
 
 <p>
@@ -123,9 +123,8 @@ is not S6_ACCESSRULES_NOTFOUND. If no match can be found in the whole list,
  <li>
 <a name="uidgid" />
  <tt>s6_accessrules_keycheck_uidgid</tt> interprets <em>key</em> as a
-<a href="http://skarnet.org/software/skalibs/libstddjb/">diuint</a>, i.e. a
-structure containing two unsigned ints. The first one is interpreted as an
-uid <em>u</em>, the second one as a gid <em>g</em>. The function first looks
+pointer to a structure containing an uid <em>u</em> and a gid <em>g</em>.
+The function first looks
 for a <tt>uid/<em>u</em></tt> match; if it cannot find one, it looks for a
 <tt>gid/<em>g</em></tt> match. If it cannot find one either, it checks
 <tt>uid/default</tt> and returns the result. </li>
diff --git a/doc/libs6/ftrigr.html b/doc/libs6/ftrigr.html
index b16081f..889e389 100644
--- a/doc/libs6/ftrigr.html
+++ b/doc/libs6/ftrigr.html
@@ -44,8 +44,8 @@ simply ignoring pids you don't know.
 </p>
 
 <p>
- If your (badly programmed) application has trouble handling unknown
-children, consider using a ftrigrd service.
+ If your application has trouble handling unknown
+children, consider using a ftrigrd service. (And fix your application!)
 </p>
 
 <h3> A programming example </h3>
@@ -240,14 +240,14 @@ which something happened.
 
 <p>
  When <tt>ftrigr_update</tt> returns,
-<tt>genalloc_s(uint16, &amp;a-&gt;list)</tt> points to an array of
-<tt>genalloc_len(uint16, &amp;a-&gt;list)</tt> 16-bit unsigned
+<tt>genalloc_s(uint16_t, &amp;a-&gt;list)</tt> points to an array of
+<tt>genalloc_len(uint16_t, &amp;a-&gt;list)</tt> 16-bit unsigned
 integers. Those integers are ids waiting to be passed to
 <tt>ftrigr_check</tt>.
 </p>
 
 <pre>
-int ftrigr_check (ftrigr_t *a, uint16 id, char *what)
+int ftrigr_check (ftrigr_t *a, uint16_t id, char *what)
 </pre>
 
 <p>
diff --git a/doc/libs6/ftrigw.html b/doc/libs6/ftrigw.html
index d494d72..1089ed7 100644
--- a/doc/libs6/ftrigw.html
+++ b/doc/libs6/ftrigw.html
@@ -41,7 +41,7 @@ exact function prototypes.
 
 <pre>
 char const *path = "/var/lib/myservice/fifodir" ;
-int gid = -1 ;
+gid_t gid = -1 ;
 int forceperms = 0 ;
 int r = ftrigw_fifodir_make(path, gid, forceperms) ;
 </pre>
diff --git a/doc/libs6/s6lock.html b/doc/libs6/s6lock.html
index cffe3f8..268b4c0 100644
--- a/doc/libs6/s6lock.html
+++ b/doc/libs6/s6lock.html
@@ -193,14 +193,14 @@ which something happened.
 
 <p>
  When <tt>s6lock_update</tt> returns,
-<tt>genalloc_s(uint16, &amp;a-&gt;list)</tt> points to an array of
-<tt>genalloc_len(uint16, &amp;a-&gt;list)</tt> 16-bit unsigned
+<tt>genalloc_s(uint16_t, &amp;a-&gt;list)</tt> points to an array of
+<tt>genalloc_len(uint16_t, &amp;a-&gt;list)</tt> 16-bit unsigned
 integers. Those integers are ids waiting to be passed to
 <tt>s6lock_check</tt>.
 </p>
 
 <pre>
-int s6lock_check (s6lock_t *a, uint16 id, char *what)
+int s6lock_check (s6lock_t *a, uint16_t id, char *what)
 </pre>
 
 <p>
diff --git a/doc/libs6/s6lockd-helper.html b/doc/libs6/s6lockd-helper.html
index 281c7e8..7a7d80a 100644
--- a/doc/libs6/s6lockd-helper.html
+++ b/doc/libs6/s6lockd-helper.html
@@ -43,7 +43,8 @@ threads) to implement timed lock acquisition. This can lead to a lot of
 s6lockd-helper processes, but this is not a problem:
   <ul>
    <li> Processes are not a scarce resource. Today's schedulers work in O(1),
-i.e. a sleeping process takes no scheduling time at all. </li>
+or in O(a function of the number of runnable processes), which means that a
+sleeping process takes no scheduling time at all </li>
    <li> s6lockd-helper is extremely tiny. Every instance should use up at
 most one or two pages of non-sharable memory. </li>
   </ul> </li>