void dm_log_message(int priority, const char *format, ...) { va_list vl; time_t timep; char tm[48] = {0}; if (priority > log_level) return; if(size_check() == 1){ fprintf(stderr, "log size reach max.\n"); ftruncate(fileno(g_log_fp), 0); } va_start(vl, format); time(&timep); //fprintf(g_log_fp, "%s ", asctime(gmtime(&timep))); snprintf(tm, sizeof(tm) - 1, "%s", asctime(localtime(&timep))); if(tm[0]){ tm[strlen(tm) - 1] = '\0'; } fputs(tm, g_log_fp); fputs(" ", g_log_fp); // if (use_syslog) // vsyslog(log_class[priority], format, vl); // else vfprintf(g_log_fp, format, vl); va_end(vl); fflush(g_log_fp); }
Curve25519_PrivateKey::Curve25519_PrivateKey(const AlgorithmIdentifier&, const secure_vector<byte>& key_bits, RandomNumberGenerator& rng) { BER_Decoder(key_bits) .start_cons(SEQUENCE) .decode(m_public, OCTET_STRING) .decode(m_private, OCTET_STRING) .verify_end() .end_cons(); size_check(m_public.size(), "public key"); size_check(m_private.size(), "private key"); load_check(rng); }
auto make_no_ownership_range( std::size_t const& size, std::size_t const& offset = 0 ) const { size_check( size, offset ); auto p = static_cast<T*>( region_.get_address() ); return boost::iterator_range<T*>( p + offset, p + offset + size ); }
Curve25519_PublicKey::Curve25519_PublicKey(const AlgorithmIdentifier&, const secure_vector<byte>& key_bits) { BER_Decoder(key_bits) .start_cons(SEQUENCE) .decode(m_public, OCTET_STRING) .verify_end() .end_cons(); size_check(m_public.size(), "public key"); }
auto read( std::size_t const& offset = 0 ) const { std::array<T, N> buffer = {{}}; size_check( N, offset ); auto p = static_cast<T*>( region_.get_address() ); std::copy( p + offset, p + offset + N, buffer.data() ); return buffer; }
secure_vector<byte> Curve25519_PrivateKey::agree(const byte w[], size_t w_len) const { size_check(w_len, "public value"); return curve25519(m_private, w); }