More comment realignment

 *

 * Building on top of the field operations we have the operations on the

 * elliptic curve group itself. Points on the curve are represented in Jacobian

 * coordinates */

 * coordinates

 */

/*-

 * point_double calculates 2*(x_in, y_in, z_in)

 *   http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b

 *

 * Outputs can equal corresponding inputs, i.e., x_out == x_in is allowed.

 * while x_out == y_in is not (maybe this works, but it's not tested). */

 * while x_out == y_in is not (maybe this works, but it's not tested).

 */

static void

point_double(felem x_out, felem y_out, felem z_out,

             const felem x_in, const felem y_in, const felem z_in)

 * This function includes a branch for checking whether the two input points

 * are equal, (while not equal to the point at infinity). This case never

 * happens during single point multiplication, so there is no timing leak for

 * ECDH or ECDSA signing. */

 * ECDH or ECDSA signing.

 */

static void point_add(felem x3, felem y3, felem z3,

                      const felem x1, const felem y1, const felem z1,

                      const int mixed, const smallfelem x2,

     *   2 * in[x] * in[y]

     * However, rather than do the doubling on the 128 bit result, we

     * double one of the inputs to the multiplication by reading from

	 * |inx2| */

     * |inx2|

     */

    out[0] = ((uint128_t) in[0]) * in[0];

    out[1] = ((uint128_t) in[0]) * inx2[1];

         *

         * With SHA-1 (the largest hash speced for SSLv3) the hash size

         * goes up 4, but npad goes down by 8, resulting in a smaller

                 * total size. */

         * total size.

         */

        unsigned char header[75];

        unsigned j = 0;

        memcpy(header + j, mac_sec, md_size);