libmp: initial attempt at constant time code, faster reductions for special primes...

[plan9front.git] / sys / man / 2 / pool

diff --git a/sys/man/2/pool b/sys/man/2/pool
index 544fcf56503ddc1902904378031db3d200ddd9a9..a44b57d4dd92b36556a3f959e88dda5de6f9a265 100644 (file)
--- a/sys/man/2/pool
+++ b/sys/man/2/pool
@@ -133,10 +133,10 @@ structure itself provides much of the setup interface.
 typedef struct Pool Pool;
 struct Pool {
        char*   name;
-       ulong   maxsize;        /* of entire Pool */
-       ulong   cursize;        /* of Pool */
-       ulong   curfree;        /* total free bytes in Pool */
-       ulong   curalloc;       /* total allocated bytes in Pool */
+       uintptr maxsize;        /* of entire Pool */
+       uintptr cursize;        /* of Pool */
+       uintptr curfree;        /* total free bytes in Pool */
+       uintptr curalloc;       /* total allocated bytes in Pool */
        ulong   minarena;       /* smallest size of new arena */
        ulong   quantum;        /* allocated blocks should be multiple of */
        ulong   minblock;       /* smallest newly allocated block */
@@ -165,7 +165,7 @@ enum {  /* flags */
 };
 .EE
 .PP
-The pool obtains arenas of memory to manage by calling the the given
+The pool obtains arenas of memory to manage by calling the given
 .B alloc
 routine.
 The total number of requested bytes will not exceed