summaryrefslogtreecommitdiff
path: root/src/lib/libssl
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libssl')
-rw-r--r--src/lib/libssl/src/crypto/asn1/x_name.c4
-rw-r--r--src/lib/libssl/src/crypto/bn/asm/ia64.S2
-rw-r--r--src/lib/libssl/src/crypto/whrlpool/wp_dgst.c4
3 files changed, 5 insertions, 5 deletions
diff --git a/src/lib/libssl/src/crypto/asn1/x_name.c b/src/lib/libssl/src/crypto/asn1/x_name.c
index 98993c84fc..7c77ceea3b 100644
--- a/src/lib/libssl/src/crypto/asn1/x_name.c
+++ b/src/lib/libssl/src/crypto/asn1/x_name.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: x_name.c,v 1.19 2014/07/11 08:44:47 jsing Exp $ */ 1/* $OpenBSD: x_name.c,v 1.20 2014/07/12 11:25:25 miod Exp $ */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved. 3 * All rights reserved.
4 * 4 *
@@ -335,7 +335,7 @@ x509_name_ex_print(BIO *out, ASN1_VALUE **pval, int indent, const char *fname,
335 * In future we could also normalize the UTF8 too. 335 * In future we could also normalize the UTF8 too.
336 * 336 *
337 * By doing this comparison of Name structures can be rapidly 337 * By doing this comparison of Name structures can be rapidly
338 * perfomed by just using memcmp() of the canonical encoding. 338 * performed by just using memcmp() of the canonical encoding.
339 * By omitting the leading SEQUENCE name constraints of type 339 * By omitting the leading SEQUENCE name constraints of type
340 * dirName can also be checked with a simple memcmp(). 340 * dirName can also be checked with a simple memcmp().
341 */ 341 */
diff --git a/src/lib/libssl/src/crypto/bn/asm/ia64.S b/src/lib/libssl/src/crypto/bn/asm/ia64.S
index 951abc53ea..7c4fbd3118 100644
--- a/src/lib/libssl/src/crypto/bn/asm/ia64.S
+++ b/src/lib/libssl/src/crypto/bn/asm/ia64.S
@@ -493,7 +493,7 @@ bn_sqr_words:
493// possible to compress the epilogue (I'm getting tired to write this 493// possible to compress the epilogue (I'm getting tired to write this
494// comment over and over) and get down to 2*n+16 at the cost of 494// comment over and over) and get down to 2*n+16 at the cost of
495// scalability. The decision will very likely be reconsidered after the 495// scalability. The decision will very likely be reconsidered after the
496// benchmark program is profiled. I.e. if perfomance gain on Itanium 496// benchmark program is profiled. I.e. if performance gain on Itanium
497// will appear larger than loss on "wider" IA-64, then the loop should 497// will appear larger than loss on "wider" IA-64, then the loop should
498// be explicitely split and the epilogue compressed. 498// be explicitely split and the epilogue compressed.
499.L_bn_sqr_words_ctop: 499.L_bn_sqr_words_ctop:
diff --git a/src/lib/libssl/src/crypto/whrlpool/wp_dgst.c b/src/lib/libssl/src/crypto/whrlpool/wp_dgst.c
index 35454758d6..663f2ef5de 100644
--- a/src/lib/libssl/src/crypto/whrlpool/wp_dgst.c
+++ b/src/lib/libssl/src/crypto/whrlpool/wp_dgst.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: wp_dgst.c,v 1.3 2014/06/12 15:49:31 deraadt Exp $ */ 1/* $OpenBSD: wp_dgst.c,v 1.4 2014/07/12 11:25:25 miod Exp $ */
2/** 2/**
3 * The Whirlpool hashing function. 3 * The Whirlpool hashing function.
4 * 4 *
@@ -49,7 +49,7 @@
49 * 49 *
50 * Unlike authors' reference implementation, block processing 50 * Unlike authors' reference implementation, block processing
51 * routine whirlpool_block is designed to operate on multi-block 51 * routine whirlpool_block is designed to operate on multi-block
52 * input. This is done for perfomance. 52 * input. This is done for performance.
53 */ 53 */
54 54
55#include "wp_locl.h" 55#include "wp_locl.h"