#include #include #include #include #include #include #include #include #include #include #include static const char skiplist_subdirs[] = "0123456789abcdef"; static const std::string RC_FILE_EXT = ".signed"; bool llarp_nodedb::Remove(const llarp::RouterID &pk) { llarp::util::Lock lock(&access); auto itr = entries.find(pk); if(itr == entries.end()) return false; entries.erase(itr); fs::remove(fs::path(getRCFilePath(pk))); return true; } void llarp_nodedb::Clear() { llarp::util::Lock lock(&access); entries.clear(); } bool llarp_nodedb::Get(const llarp::RouterID &pk, llarp::RouterContact &result) { llarp::util::Lock l(&access); auto itr = entries.find(pk); if(itr == entries.end()) return false; result = itr->second; return true; } // kill rcs from disk async struct AsyncKillRCJobs { std::set< std::string > files; static void Work(void *u) { static_cast< AsyncKillRCJobs * >(u)->Kill(); } void Kill() { for(const auto &file : files) fs::remove(file); delete this; } }; void llarp_nodedb::RemoveIf( std::function< bool(const llarp::RouterContact &rc) > filter) { AsyncKillRCJobs *job = new AsyncKillRCJobs(); { llarp::util::Lock l(&access); auto itr = entries.begin(); while(itr != entries.end()) { if(filter(itr->second)) { job->files.insert(getRCFilePath(itr->second.pubkey)); itr = entries.erase(itr); } else ++itr; } } llarp_threadpool_queue_job(disk, {job, AsyncKillRCJobs::Work}); } bool llarp_nodedb::Has(const llarp::RouterID &pk) { llarp::util::Lock lock(&access); return entries.find(pk) != entries.end(); } /// skiplist directory is hex encoded first nibble /// skiplist filename is .snode.signed std::string llarp_nodedb::getRCFilePath(const llarp::RouterID &pubkey) const { char ftmp[68] = {0}; const char *hexname = llarp::HexEncode< llarp::AlignedBuffer< 32 >, decltype(ftmp) >(pubkey, ftmp); std::string hexString(hexname); std::string skiplistDir; llarp::RouterID r(pubkey); std::string fname = r.ToString(); skiplistDir += hexString[0]; fname += RC_FILE_EXT; fs::path filepath = nodePath / skiplistDir / fname; return filepath.string(); } struct async_insert_rc { llarp_nodedb *nodedb; llarp::RouterContact rc; async_insert_rc(llarp_nodedb *n, const llarp::RouterContact &r) : nodedb(n), rc(r) { } }; static void handle_async_insert_rc(void *u) { async_insert_rc *job = static_cast< async_insert_rc * >(u); job->nodedb->Insert(job->rc); delete job; } void llarp_nodedb::InsertAsync(llarp::RouterContact rc) { async_insert_rc *ctx = new async_insert_rc(this, rc); llarp_threadpool_queue_job(disk, {ctx, &handle_async_insert_rc}); } /// insert and write to disk bool llarp_nodedb::Insert(const llarp::RouterContact &rc) { std::array< byte_t, MAX_RC_SIZE > tmp; llarp_buffer_t buf(tmp); { llarp::util::Lock lock(&access); auto itr = entries.find(rc.pubkey.as_array()); if(itr != entries.end()) entries.erase(itr); entries.emplace(rc.pubkey.as_array(), rc); } if(!rc.BEncode(&buf)) return false; buf.sz = buf.cur - buf.base; auto filepath = getRCFilePath(rc.pubkey); llarp::LogDebug("saving RC.pubkey ", filepath); std::ofstream ofs( filepath, std::ofstream::out | std::ofstream::binary | std::ofstream::trunc); ofs.write((char *)buf.base, buf.sz); ofs.close(); if(!ofs) { llarp::LogError("Failed to write: ", filepath); return false; } llarp::LogDebug("saved RC.pubkey: ", filepath); return true; } ssize_t llarp_nodedb::Load(const fs::path &path) { std::error_code ec; if(!fs::exists(path, ec)) { return -1; } ssize_t loaded = 0; for(const char &ch : skiplist_subdirs) { if(!ch) continue; std::string p; p += ch; fs::path sub = path / p; ssize_t l = loadSubdir(sub); if(l > 0) loaded += l; } return loaded; } ssize_t llarp_nodedb::loadSubdir(const fs::path &dir) { ssize_t sz = 0; llarp::util::IterDir(dir, [&](const fs::path &f) -> bool { if(fs::is_regular_file(f) && loadfile(f)) sz++; return true; }); return sz; } bool llarp_nodedb::loadfile(const fs::path &fpath) { if(fpath.extension() != RC_FILE_EXT) return false; llarp::RouterContact rc; if(!rc.Read(fpath.string().c_str())) { llarp::LogError("failed to read file ", fpath); return false; } if(!rc.Verify(crypto, llarp::time_now_ms())) { llarp::LogError(fpath, " contains invalid RC"); return false; } { llarp::util::Lock lock(&access); entries.emplace(rc.pubkey.as_array(), rc); } return true; } void llarp_nodedb::visit(std::function< bool(const llarp::RouterContact &) > visit) { llarp::util::Lock lock(&access); auto itr = entries.begin(); while(itr != entries.end()) { if(!visit(itr->second)) return; ++itr; } } bool llarp_nodedb::iterate(llarp_nodedb_iter &i) { i.index = 0; llarp::util::Lock lock(&access); auto itr = entries.begin(); while(itr != entries.end()) { i.rc = &itr->second; i.visit(&i); // advance i.index++; itr++; } return true; } /* bool llarp_nodedb::Save() { auto itr = entries.begin(); while(itr != entries.end()) { llarp::pubkey pk = itr->first; llarp_rc *rc= itr->second; itr++; // advance } return true; } */ // call request hook void logic_threadworker_callback(void *user) { llarp_async_verify_rc *verify_request = static_cast< llarp_async_verify_rc * >(user); if(verify_request->hook) verify_request->hook(verify_request); } // write it to disk void disk_threadworker_setRC(void *user) { llarp_async_verify_rc *verify_request = static_cast< llarp_async_verify_rc * >(user); verify_request->valid = verify_request->nodedb->Insert(verify_request->rc); if(verify_request->logic) verify_request->logic->queue_job( {verify_request, &logic_threadworker_callback}); } // we run the crypto verify in the crypto threadpool worker void crypto_threadworker_verifyrc(void *user) { llarp_async_verify_rc *verify_request = static_cast< llarp_async_verify_rc * >(user); llarp::RouterContact rc = verify_request->rc; verify_request->valid = rc.Verify(verify_request->nodedb->crypto, llarp::time_now_ms()); // if it's valid we need to set it if(verify_request->valid && rc.IsPublicRouter()) { llarp::LogDebug("RC is valid, saving to disk"); llarp_threadpool_queue_job(verify_request->diskworker, {verify_request, &disk_threadworker_setRC}); } else { // callback to logic thread verify_request->logic->queue_job( {verify_request, &logic_threadworker_callback}); } } void nodedb_inform_load_rc(void *user) { llarp_async_load_rc *job = static_cast< llarp_async_load_rc * >(user); job->hook(job); } void nodedb_async_load_rc(void *user) { llarp_async_load_rc *job = static_cast< llarp_async_load_rc * >(user); auto fpath = job->nodedb->getRCFilePath(job->pubkey); job->loaded = job->nodedb->loadfile(fpath); if(job->loaded) { job->nodedb->Get(job->pubkey, job->result); } job->logic->queue_job({job, &nodedb_inform_load_rc}); } bool llarp_nodedb::ensure_dir(const char *dir) { fs::path path(dir); std::error_code ec; if(!fs::exists(dir, ec)) fs::create_directory(path, ec); if(ec) return false; if(!fs::is_directory(path)) return false; for(const char &ch : skiplist_subdirs) { // this seems to be a problem on all targets // perhaps cpp17::fs is just as screwed-up // attempting to create a folder with no name if(!ch) return true; std::string p; p += ch; fs::path sub = path / p; fs::create_directory(sub, ec); if(ec) return false; } return true; } void llarp_nodedb::set_dir(const char *dir) { nodePath = dir; } ssize_t llarp_nodedb::load_dir(const char *dir) { std::error_code ec; if(!fs::exists(dir, ec)) { return -1; } set_dir(dir); return Load(dir); } int llarp_nodedb::iterate_all(struct llarp_nodedb_iter i) { iterate(i); return num_loaded(); } /// maybe rename to verify_and_set void llarp_nodedb_async_verify(struct llarp_async_verify_rc *job) { // switch to crypto threadpool and continue with // crypto_threadworker_verifyrc llarp_threadpool_queue_job(job->cryptoworker, {job, &crypto_threadworker_verifyrc}); } // disabled for now /* void llarp_nodedb_async_load_rc(struct llarp_async_load_rc *job) { // call in the disk io thread so we don't bog down the others llarp_threadpool_queue_job(job->diskworker, {job, &nodedb_async_load_rc}); } */ size_t llarp_nodedb::num_loaded() const { absl::ReaderMutexLock l(&access); return entries.size(); } bool llarp_nodedb::select_random_exit(llarp::RouterContact &result) { llarp::util::Lock lock(&access); const auto sz = entries.size(); auto itr = entries.begin(); if(sz < 3) return false; auto idx = llarp::randint() % sz; if(idx) std::advance(itr, idx - 1); while(itr != entries.end()) { if(itr->second.IsExit()) { result = itr->second; return true; } ++itr; } // wrap around itr = entries.begin(); while(idx--) { if(itr->second.IsExit()) { result = itr->second; return true; } ++itr; } return false; } bool llarp_nodedb::select_random_hop(const llarp::RouterContact &prev, llarp::RouterContact &result, size_t N) { llarp::util::Lock lock(&access); /// checking for "guard" status for N = 0 is done by caller inside of /// pathbuilder's scope size_t sz = entries.size(); if(sz < 3) return false; if(!N) return false; llarp_time_t now = llarp::time_now_ms(); auto itr = entries.begin(); size_t pos = llarp::randint() % sz; std::advance(itr, pos); auto start = itr; while(itr == entries.end()) { if(prev.pubkey != itr->second.pubkey) { if(itr->second.addrs.size() && !itr->second.IsExpired(now)) { result = itr->second; return true; } } itr++; } itr = entries.begin(); while(itr != start) { if(prev.pubkey != itr->second.pubkey) { if(itr->second.addrs.size() && !itr->second.IsExpired(now)) { result = itr->second; return true; } } ++itr; } return false; } bool llarp_nodedb::select_random_hop_excluding( llarp::RouterContact &result, const std::set< llarp::RouterID > &exclude) { llarp::util::Lock lock(&access); /// checking for "guard" status for N = 0 is done by caller inside of /// pathbuilder's scope const size_t sz = entries.size(); if(sz < 3) { return false; } llarp_time_t now = llarp::time_now_ms(); auto itr = entries.begin(); size_t pos = llarp::randint() % sz; std::advance(itr, pos); auto start = itr; while(itr == entries.end()) { if(exclude.count(itr->first) == 0) { if(itr->second.addrs.size() && !itr->second.IsExpired(now)) { result = itr->second; return true; } } itr++; } itr = entries.begin(); while(itr != start) { if(exclude.count(itr->first) == 0) { if(itr->second.addrs.size() && !itr->second.IsExpired(now)) { result = itr->second; return true; } } ++itr; } return false; }