MirrorHub/construct
0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-12-27 07:54:05 +01:00
Code Issues Releases Wiki Activity

ircd::openssl: Move genrsa_cb to genprime_cb for abstractive reuse.

Browse source
This commit is contained in:
Jason Volk 2018-08-28 12:53:34 -07:00
parent 8340f005da
commit 0dcaedabff
1 changed files with 46 additions and 45 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

91
ircd/openssl.cc
View file

@ -30,6 +30,8 @@ namespace ircd::openssl
class function, class function,
class... args> class... args>
static int call(function&& f, args&&... a); static int call(function&& f, args&&... a);
static int genprime_cb(const int, const int, BN_GENCB *const);
} }
/////////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////////////////////
@ -756,11 +758,6 @@ ircd::openssl::genrsa(const string_view &skfile,
}); });
} }
namespace ircd::openssl
{
static int genrsa_cb(const int, const int, BN_GENCB *const);
}
RSA & RSA &
ircd::openssl::genrsa(RSA &out, ircd::openssl::genrsa(RSA &out,
const uint &bits, const uint &bits,
@ -768,7 +765,7 @@ ircd::openssl::genrsa(RSA &out,
{ {
BN_GENCB gencb{0}; BN_GENCB gencb{0};
void *const arg{nullptr}; // privdata passed to cb void *const arg{nullptr}; // privdata passed to cb
BN_GENCB_set(&gencb, &ircd::openssl::genrsa_cb, arg); BN_GENCB_set(&gencb, &ircd::openssl::genprime_cb, arg);
bignum e{exp}; bignum e{exp};
call(::RSA_generate_key_ex, &out, bits, e, &gencb); call(::RSA_generate_key_ex, &out, bits, e, &gencb);
@ -776,45 +773,6 @@ ircd::openssl::genrsa(RSA &out,
return out; return out;
} }
// This callback can be used to integrate generating with ircd::ctx
// or ctx::offload/thread or some status update. For now we just eat
// the milliseconds of prime generation on main.
// return false causes call(RSA_generate_key_ex) to throw
int
ircd::openssl::genrsa_cb(const int stat,
const int ith,
BN_GENCB *const ctx)
{
assert(ctx != nullptr);
auto &arg{ctx->arg};
switch(stat)
{
case 0: // generating i-th potential prime
return true;
case 1: // testing i-th potential prime
return true;
case 2: // found i-th potential prime but rejected for RSA
return true;
case 3: switch(ith) // found for RSA...
{
case 0: // found P
return true;
case 1: // found Q
return true;
default:
return false;
}
default:
return false;
}
}
ircd::string_view ircd::string_view
ircd::openssl::print(const mutable_buffer &buf, ircd::openssl::print(const mutable_buffer &buf,
const RSA &rsa, const RSA &rsa,
@ -1772,6 +1730,49 @@ ircd::openssl::locking::reflect(const int &mode)
return "?????"; return "?????";
} }
//
// internal util
//
// This callback can be used to integrate generating with ircd::ctx
// or ctx::offload/thread or some status update. For now we just eat
// the milliseconds of prime generation on main.
// return false causes call(RSA_generate_key_ex) to throw
int
ircd::openssl::genprime_cb(const int stat,
const int ith,
BN_GENCB *const ctx)
{
assert(ctx != nullptr);
auto &arg{ctx->arg};
switch(stat)
{
case 0: // generating i-th potential prime
return true;
case 1: // testing i-th potential prime
return true;
case 2: // found i-th potential prime but rejected for RSA
return true;
case 3: switch(ith) // found for RSA...
{
case 0: // found P
return true;
case 1: // found Q
return true;
default:
return false;
}
default:
return false;
}
}
// //
// call() // call()
// //