Commit dfd38750 authored by Greg Price's avatar Greg Price Committed by Theodore Ts'o

random: fix typos / spelling errors in comments

Signed-off-by: default avatarGreg Price <price@mit.edu>
Signed-off-by: default avatar"Theodore Ts'o" <tytso@mit.edu>
parent b28a960c
...@@ -305,7 +305,7 @@ static int random_read_wakeup_thresh = 64; ...@@ -305,7 +305,7 @@ static int random_read_wakeup_thresh = 64;
static int random_write_wakeup_thresh = 28 * OUTPUT_POOL_WORDS; static int random_write_wakeup_thresh = 28 * OUTPUT_POOL_WORDS;
/* /*
* The minimum number of seconds between urandom pool resending. We * The minimum number of seconds between urandom pool reseeding. We
* do this to limit the amount of entropy that can be drained from the * do this to limit the amount of entropy that can be drained from the
* input pool even if there are heavy demands on /dev/urandom. * input pool even if there are heavy demands on /dev/urandom.
*/ */
...@@ -322,7 +322,7 @@ static int random_min_urandom_seed = 60; ...@@ -322,7 +322,7 @@ static int random_min_urandom_seed = 60;
* Register. (See M. Matsumoto & Y. Kurita, 1992. Twisted GFSR * Register. (See M. Matsumoto & Y. Kurita, 1992. Twisted GFSR
* generators. ACM Transactions on Modeling and Computer Simulation * generators. ACM Transactions on Modeling and Computer Simulation
* 2(3):179-194. Also see M. Matsumoto & Y. Kurita, 1994. Twisted * 2(3):179-194. Also see M. Matsumoto & Y. Kurita, 1994. Twisted
* GFSR generators II. ACM Transactions on Mdeling and Computer * GFSR generators II. ACM Transactions on Modeling and Computer
* Simulation 4:254-266) * Simulation 4:254-266)
* *
* Thanks to Colin Plumb for suggesting this. * Thanks to Colin Plumb for suggesting this.
...@@ -1036,7 +1036,7 @@ static void extract_buf(struct entropy_store *r, __u8 *out) ...@@ -1036,7 +1036,7 @@ static void extract_buf(struct entropy_store *r, __u8 *out)
sha_transform(hash.w, (__u8 *)(r->pool + i), workspace); sha_transform(hash.w, (__u8 *)(r->pool + i), workspace);
/* /*
* If we have a architectural hardware random number * If we have an architectural hardware random number
* generator, mix that in, too. * generator, mix that in, too.
*/ */
for (i = 0; i < LONGS(20); i++) { for (i = 0; i < LONGS(20); i++) {
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment