A cast is needed or Borland C will complain.

[openssl.git] / crypto / rand / rand_win.c

diff --git a/crypto/rand/rand_win.c b/crypto/rand/rand_win.c
index 1f8ee6e758fad70223b5e531bf65d07aff5bc354..cb8e17634f87f2ef163b4af049a80d4cbbfc9033 100644 (file)
--- a/crypto/rand/rand_win.c
+++ b/crypto/rand/rand_win.c
@@ -236,7 +236,7 @@ int RAND_poll(void)
                if (cursor)
                        {
                        /* cursor position */
-                       cursor(buf);
+                       cursor((PCURSORINFO)buf);
                        RAND_add(buf, sizeof(buf), 0);
                        }
 
@@ -254,7 +254,7 @@ int RAND_poll(void)
         *
         * This seeding method was proposed in Peter Gutmann, Software
         * Generation of Practically Strong Random Numbers,
-        * http://www.somewhere.nzhttp://www.cs.auckland.ac.nz/~pgut001/pubs/random2.pdf
+        * http://www.cs.auckland.ac.nz/~pgut001/pubs/random2.pdf
         * (The assignment of entropy estimates below is arbitrary, but based
         * on Peter's analysis the full poll appears to be safe. Additional
         * interactive seeding is encouraged.)