IT4Change/gradido
3
0
Fork 0
mirror of https://github.com/IT4Change/gradido.git synced 2025-12-13 07:45:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

add random test data to db

Browse Source
This commit is contained in:
einhornimmond 2021-04-21 17:50:06 +02:00
parent fd6febabd3
commit dad397ec76
2 changed files with 32 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
login_server/src/cpp/Crypto/Passphrase.cpp
View File

@ -354,7 +354,7 @@ const Mnemonic* Passphrase::detectMnemonic(const std::string& passphrase, const
user_public_key_hex = DataTypeConverter::pubkeyToHex(keyPair->getPublicKey());
//printf("user public key hex: %s\n", user_public_key_hex.data());
}
std::string last_word_not_found = "";
std::string last_words_not_found[ServerConfig::Mnemonic_Types::MNEMONIC_MAX];
for (int i = 0; i < ServerConfig::Mnemonic_Types::MNEMONIC_MAX; i++) {
Mnemonic& m = ServerConfig::g_Mnemonic_WordLists[i];
bool existAll = true;
@ -363,7 +363,7 @@ const Mnemonic* Passphrase::detectMnemonic(const std::string& passphrase, const
if (!m.isWordExist(*it)) {
existAll = false;
//printf("couldn't find word: %s\n", (*it).data());
last_word_not_found = (*it);
last_words_not_found[i] = (*it);
// leave inner for-loop
break;
}
@ -374,10 +374,14 @@ const Mnemonic* Passphrase::detectMnemonic(const std::string& passphrase, const
test_passphrase->createWordIndices();
auto key_pair = KeyPairEd25519::create(test_passphrase);
if (key_pair) {
std::string current_key_pair = DataTypeConverter::pubkeyToHex(key_pair->getPublicKey());
//printf("public key hex to compare: %s\n", current_key_pair.data());
if (*key_pair != *keyPair) {
#ifdef _TEST_BUILD // additional infos for debugging if error occure in test
printf("public key mismatch\n");
std::string generated_key_pair_hex = DataTypeConverter::pubkeyToHex(key_pair->getPublicKey());
std::string parameter_key_pair_hex = DataTypeConverter::pubkeyToHex(keyPair->getPublicKey());
printf("parameter: %s, generated: %s\n", parameter_key_pair_hex.data(), generated_key_pair_hex.data());
#endif
delete key_pair;
continue;
}
@ -388,7 +392,8 @@ const Mnemonic* Passphrase::detectMnemonic(const std::string& passphrase, const
}
return &ServerConfig::g_Mnemonic_WordLists[i];
}
//printf("last word not found: %s in %s\n", last_words_not_found[i].data(), ServerConfig::mnemonicTypeToString((ServerConfig::Mnemonic_Types)i));
}
printf("last word not found: %s\n", last_word_not_found.data());
return nullptr;
}

22
login_server/src/cpp/test/main.cpp
View File

@ -98,7 +98,29 @@ int load() {
}
std::stringstream ss;
ss << "INSERT INTO `hedera_ids` (`id`, `shardNum`, `realmNum`, `num`) VALUES "
<< "(1, 0, 0, 37281), "
<< "(2, 0, 0, 21212), "
<< "(3, 0, 0, 212);";
runMysql(ss.str());
ss.str(std::string());
ss << "INSERT INTO `crypto_keys` (`id`, `private_key`, `public_key`, `crypto_key_type_id`) VALUES "
<< "(1, 0x263f1da712c3b47286b463c2de3784f364f2534d2c34722a3b483c3f3e36476857564f564d476c32d3e342f5ef2763cd23e23a2b429bab62e352f46ba273e2f2, 0xfe5237c2d1ab1361b33163f15634e261c1d217ae32b327cbd88db8ebffedb271, 3), "
<< "(2, 0x721f3e73e3263f1da712c3b47286b463c2de3784f364f2534d2c34722a3b483c3f3e36476857564f564d476c32d3e342f5ef2763cd23e23a2b429bab62e352f46ba273e2f2ef3264fe2452da62bc2739, 0xe3f253d1a2deb25362d2e374baf37bc1d3ef3781cfe1e127f3cd0abcdf372ea6, 1); ";
runMysql(ss.str());
ss.str(std::string());
ss << "INSERT INTO `hedera_accounts` (`id`, `user_id`, `account_hedera_id`, `account_key_id`, `balance`, `network_type`, `updated`) VALUES "
<< "(1, 1, 1, 1, 1000000000000, 1, '2019-09-03 11:13:52'), "
<< "(2, 1, 2, 2, 4312881211, 0, '2019-09-03 11:13:56'); ";
runMysql(ss.str());
ss.str(std::string());
ss << "INSERT INTO `hedera_topics` (`id`, `topic_hedera_id`, `name`, `auto_renew_account_hedera_id`, `auto_renew_period`, `group_id`, `admin_key_id`, `submit_key_id`, `current_timeout`, `sequence_number`, `updated`) VALUES "
<< "(1, 3, 'gdd_test_topic', 1, 0, 1, NULL, NULL, '1999-12-31 23:00:00', 0, '2020-09-14 18:29:04'); ";
runMysql(ss.str());
ss.str(std::string());
fillTests();
for (std::list<Test*>::iterator it = gTests.begin(); it != gTests.end(); it++)