generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Get rid of remaining C++-style comments which strict C compilers hate.

Browse Source 
(Pointed out by Carlos Amengual).
This commit is contained in:
Ralf S. Engelschall 1999-02-27 12:17:40 +00:00
parent c707fb2741
commit 74d7abc2ab
6 changed files with 20 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
CHANGES
View File

@ -4,6 +4,9 @@
Changes between 0.9.1c and 0.9.2 Changes between 0.9.1c and 0.9.2
*) Get rid of remaining C++-style comments which strict C compilers hate.
[Ralf S. Engelschall, pointed out by Carlos Amengual]
*) Changed BN_RECURSION in bn_mont.c to BN_RECURSION_MONT so it is not *) Changed BN_RECURSION in bn_mont.c to BN_RECURSION_MONT so it is not
compiled in by default: it has problems with large keys. compiled in by default: it has problems with large keys.

2
crypto/bio/bss_sock.c
View File

@ -385,7 +385,7 @@ int i;
err=get_last_sys_error(); err=get_last_sys_error();
#endif #endif
#if defined(WINDOWS) && 0 /* more microsoft stupidity *//* perhaps not? Ben 4/1/99 */ #if defined(WINDOWS) && 0 /* more microsoft stupidity? perhaps not? Ben 4/1/99 */
if ((i == -1) && (err == 0)) if ((i == -1) && (err == 0))
return(1); return(1);
#endif #endif

6
crypto/bn/exp.c
View File

@ -43,12 +43,12 @@ char *argv[];
ms_time_get(start); ms_time_get(start);
for (i=0; i<num; i++) for (i=0; i<num; i++)
{ {
//bn_mull(&r,&a,&b,&ctx); /* bn_mull(&r,&a,&b,&ctx); */
//BN_sqr(&r,&a,&ctx); /* BN_sqr(&r,&a,&ctx); */
BN_mod_exp_mont(&r,&a,&b,&c,&ctx,&mont); BN_mod_exp_mont(&r,&a,&b,&c,&ctx,&mont);
} }
ms_time_get(end); ms_time_get(end);
d=ms_time_diff(start,end)/* *50/33 /**/; d=ms_time_diff(start,end)/* *50/33 */;
printf("%5d bit:%6.2f %6d %6.4f %4d m_set(%5.4f)\n",size, printf("%5d bit:%6.2f %6d %6.4f %4d m_set(%5.4f)\n",size,
d,num,d/num,(int)((d/num)*mod),md/10.0); d,num,d/num,(int)((d/num)*mod),md/10.0);
num/=8; num/=8;

10
crypto/bn/test.c
View File

@ -120,18 +120,18 @@ s0.max=bl.top; s1.max=bh.top;
t3.top=(t2.top > words)?words:t2.top; t3.top=(t2.top > words)?words:t2.top;
t3.neg=t2.neg; t3.neg=t2.neg;
t3.max=t3.top; t3.max=t3.top;
// BN_print_fp(stdout,&s1); printf(" s1\n"); /* BN_print_fp(stdout,&s1); printf(" s1\n"); */
// BN_print_fp(stdout,&t2); printf(" middle value\n"); /* BN_print_fp(stdout,&t2); printf(" middle value\n"); */
// BN_print_fp(stdout,&t3); printf(" low middle value\n"); /* BN_print_fp(stdout,&t3); printf(" low middle value\n"); */
BN_sub(&t1,&s1,&t3); BN_sub(&t1,&s1,&t3);
if (t1.neg) if (t1.neg)
{ {
//printf("neg fixup\n"); //BN_print_fp(stdout,&t1); printf(" before\n"); /*printf("neg fixup\n"); BN_print_fp(stdout,&t1); printf(" before\n"); */
BN_lshift(&t2,BN_value_one(),words*32); BN_lshift(&t2,BN_value_one(),words*32);
BN_add(&t1,&t2,&t1); BN_add(&t1,&t2,&t1);
BN_mask_bits(&t1,words*32); BN_mask_bits(&t1,words*32);
// BN_print_fp(stdout,&t1); printf(" after\n"); /* BN_print_fp(stdout,&t1); printf(" after\n"); */
} }
/* al*bl == high(al*bl)<<words+s0 */ /* al*bl == high(al*bl)<<words+s0 */
BN_lshift(&t1,&t1,words*32); BN_lshift(&t1,&t1,words*32);

2
crypto/comp/comp_err.c
View File

@ -1,4 +1,4 @@
/* lib//_err.c */ /* crypto/comp/comp_err.c */
/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
* All rights reserved. * All rights reserved.
* *

14
crypto/rand/md_rand.c
View File

@ -346,13 +346,13 @@ int num;
* <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>; * <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>;
* the original copyright message is: * the original copyright message is:
* *
// (C) Copyright Microsoft Corp. 1993. All rights reserved. * (C) Copyright Microsoft Corp. 1993. All rights reserved.
// *
// You have a royalty-free right to use, modify, reproduce and * You have a royalty-free right to use, modify, reproduce and
// distribute the Sample Files (and/or any modified version) in * distribute the Sample Files (and/or any modified version) in
// any way you find useful, provided that you agree that * any way you find useful, provided that you agree that
// Microsoft has no warranty obligations or liability for any * Microsoft has no warranty obligations or liability for any
// Sample Application Files which are modified. * Sample Application Files which are modified.
*/ */
/* /*
* I have modified the loading of bytes via RAND_seed() mechanism since * I have modified the loading of bytes via RAND_seed() mechanism since