refactor: reduce needs on cs_main in network processing - #6990
refactor: reduce needs on cs_main in network processing#6990PastaPastaPasta wants to merge 2 commits into
Conversation
|
Important Review skippedReview was skipped as selected files did not have any reviewable changes. 💤 Files selected but had no reviewable changes (1)
You can disable this status message by setting the ✨ Finishing touches🧪 Generate unit tests (beta)
Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. Comment |
✅ No Merge Conflicts DetectedThis PR currently has no conflicts with other open PRs. |
7030342 to
3a8b312
Compare
|
This pull request has conflicts, please rebase. |
12f5253 to
96ff7be
Compare
| //! Length of current-streak of unconnecting headers announcements | ||
| int nUnconnectingHeaders{0}; | ||
| int nUnconnectingHeaders GUARDED_BY(m_mutex){0}; |
There was a problem hiding this comment.
can it be atomic?
also fSyncStarted; nBlocksInFlight, fPreferredDownload, fPreferHeaders', fPreferHeadersCmpressed?
There was a problem hiding this comment.
Maybe, but need to be more careful that full operation is atomic. I figured just using a mutex currently would be simplier
|
This pull request has conflicts, please rebase. |
|
✅ Final review complete — no blockers (commit 96ff7be) |
thepastaclaw
left a comment
There was a problem hiding this comment.
Code Review
I did not validate a concrete correctness regression in src/net_processing.cpp on this SHA, but this is still a large concurrency-sensitive refactor of peer-state and object-request locking with no added regression coverage. The main reviewable concern is merge risk from behavioral drift in lifecycle/accounting paths that now depend on the new per-node and object-request mutexes.
Reviewed commit: 96ff7be
🟡 1 suggestion(s)
🤖 Prompt for all review comments with AI agents
These findings are from an automated code review. Verify each finding against the current code and only fix it if needed.
In `src/net_processing.cpp`:
- [SUGGESTION] lines 439-589: This lock-splitting refactor still lacks targeted regression coverage
This patch moves `CNodeState` off `cs_main`, introduces `shared_ptr`-managed node-state lifetime plus a per-node mutex, and splits object-request coordination onto `g_object_request_mutex`, but it adds no unit or functional tests. Because the touched code governs header sync state, in-flight block/object accounting, eviction, and disconnect cleanup, the main merge risk here is silent behavioral drift rather than an obvious compile failure. Adding at least one focused regression test around disconnect cleanup / request bookkeeping (or a deterministic unit test for the moved counters and request/erase flow) would make this refactor materially safer to merge.
| @@ -568,17 +572,22 @@ struct CNodeState { | |||
| std::chrono::microseconds m_check_expiry_timer{0}; | |||
| }; | |||
|
|
|||
| ObjectDownloadState m_object_download; | |||
| ObjectDownloadState m_object_download GUARDED_BY(m_mutex); | |||
|
|
|||
| //! Whether this peer is an inbound connection | |||
| const bool m_is_inbound; | |||
|
|
|||
| //! A rolling bloom filter of all announced tx CInvs to this peer. | |||
| CRollingBloomFilter m_recently_announced_invs = CRollingBloomFilter{INVENTORY_MAX_RECENT_RELAY, 0.000001}; | |||
| CRollingBloomFilter m_recently_announced_invs GUARDED_BY(m_mutex){INVENTORY_MAX_RECENT_RELAY, 0.000001}; | |||
|
|
|||
| CNodeState(bool is_inbound) : m_is_inbound(is_inbound) {} | |||
| }; | |||
|
|
|||
| // Keeps track of the time (in microseconds) when transactions were requested last time | |||
| unordered_limitedmap<uint256, std::chrono::microseconds, StaticSaltedHasher> g_already_asked_for(MAX_INV_SZ, MAX_INV_SZ * 2); | |||
| unordered_limitedmap<uint256, std::chrono::microseconds, StaticSaltedHasher> g_erased_object_requests(MAX_INV_SZ, MAX_INV_SZ * 2); | |||
| Mutex g_object_request_mutex; | |||
There was a problem hiding this comment.
🟡 Suggestion: This lock-splitting refactor still lacks targeted regression coverage
This patch moves CNodeState off cs_main, introduces shared_ptr-managed node-state lifetime plus a per-node mutex, and splits object-request coordination onto g_object_request_mutex, but it adds no unit or functional tests. Because the touched code governs header sync state, in-flight block/object accounting, eviction, and disconnect cleanup, the main merge risk here is silent behavioral drift rather than an obvious compile failure. Adding at least one focused regression test around disconnect cleanup / request bookkeeping (or a deterministic unit test for the moved counters and request/erase flow) would make this refactor materially safer to merge.
source: ['codex-general', 'coordinator-manual']
🤖 Fix this with AI agents
These findings are from an automated code review. Verify each finding against the current code and only fix it if needed.
In `src/net_processing.cpp`:
- [SUGGESTION] lines 439-589: This lock-splitting refactor still lacks targeted regression coverage
This patch moves `CNodeState` off `cs_main`, introduces `shared_ptr`-managed node-state lifetime plus a per-node mutex, and splits object-request coordination onto `g_object_request_mutex`, but it adds no unit or functional tests. Because the touched code governs header sync state, in-flight block/object accounting, eviction, and disconnect cleanup, the main merge risk here is silent behavioral drift rather than an obvious compile failure. Adding at least one focused regression test around disconnect cleanup / request bookkeeping (or a deterministic unit test for the moved counters and request/erase flow) would make this refactor materially safer to merge.
|
Closing at the author’s request. The lock-contention objective remains relevant, but #5943 replaced much of the object-request machinery this patch refactors. A replacement will be scoped from profiling current develop and will include comparative performance measurements and targeted safety validation. 🤖 Posted autonomously by Codex on behalf of pasta. |
7882982 perf(net): isolate object request scheduling from cs_main (pasta) Pull request description: ## Issue being fixed or feature implemented Large object-inventory workloads hold `cs_main` while the request tracker selects candidates, advances its time state, and handles NOTFOUND responses. This stalls unrelated chainstate readers such as `getblockcount`. Release-build stack sampling identified `TxRequestTracker::GetRequestable` and request-state transitions in `SendMessages` as substantial work inside the critical section. Supersedes #6990. The object downloader was replaced by #5943, so this change works with the current tracker. ## What was done? Give the existing object request tracker its own mutex. Selection and tracker-only completion/cleanup run without `cs_main`; block scheduling, availability checks, and per-peer response authorization remain protected by `cs_main`. When both locks are needed, acquire `cs_main` first. All tracker access sites and compiler lock annotations are updated. In `SendMessages` the getdata loop takes `cs_main` once to partition the requestable set by `AlreadyHave`, then takes the tracker mutex once to apply `RequestedTx`/`ForgetTxHash` for the batch, rather than acquiring both locks per inventory. `GetRequestedObjectCount` only reads the tracker, so it no longer requires `cs_main`. `SyncManager::RequestGovernanceObjectVotes` reads it without pinning `cs_main` while waiting on the tracker mutex. Add native `InventoryBatch100` / `InventoryBatch50000` benchmarks, an accounting test, and a regression test proving NOTFOUND can complete while another thread holds `cs_main`. ## How Has This Been Tested? ### Performance Earlier revision (per-inventory locking): [isolated comparison run](https://github.com/PastaPastaPasta/dash/actions/runs/34279569867) on an Ubuntu 24.04 GitHub-hosted runner, Clang `-O2 -g -DDEBUG_LOCKCONTENTION`, baseline `c652c314a24c59599d987da3779fe1c610dc4851`. Three alternating baseline/candidate pairs per workload, eight rounds each. Medians: | Workload | RPC p99, ms | Worst RPC, ms | Total RPC wait for `cs_main`, ms | Completion, s | | --- | ---: | ---: | ---: | ---: | | 50,000 entries, 1 peer | 0.403 → 0.382 | 107.25 → 76.94 | 1375.58 → 567.00 (**−59%**) | 21.67 → 21.63 | | 100 entries, 4 peers | 0.316 → 0.327 | 1.65 → 1.37 | 3.19 → 0.58 | 2.320 → 2.319 | | 5,000 governance votes, 4 peers | 8.83 → 5.82 (**−34%**) | 21.85 → 11.33 | 355.84 → 204.55 (**−43%**) | 3.09 → 3.58 (+16%) | The +16% governance completion regression in that revision came from taking `cs_main` and the tracker mutex once per inventory in the getdata loop. The current revision batches both locks. The Python driver used for those measurements is not included in this PR; it lived at `contrib/devtools/benchmark_inventory.py` in the earlier revision if anyone wants to reproduce. Native benchmark on the current revision, debug build, Apple M4 Max, per-inventory INV → scheduling → NOTFOUND: | Benchmark | Per-inventory locking | Batched locking | | --- | ---: | ---: | | InventoryBatch100 | 3,814 ns | 2,147 ns | | InventoryBatch50000 | 6,025 ns | 2,986 ns | Debug builds inflate lock cost, so the absolute numbers are not representative of release; the relative improvement is from removing per-inventory lock acquisition. ### Correctness Local validation on Apple M4 Max, macOS 15, debug build with prebuilt depends: - Build passes with no new thread-safety warnings. - `net_tests,txrequest_tests,governance_inv_tests,denialofservice_tests` pass. - `notfound_does_not_wait_for_chainstate` fails on the baseline at its completion assertion and passes on this implementation. - Functional: `p2p_tx_download`, `p2p_invalid_messages`, `p2p_blocksonly`, `feature_sporks`, `p2p_instantsend`, `feature_governance_objects`, `feature_governance`, `p2p_compactblocks`, `p2p_sendheaders`, `feature_llmq_chainlocks`, `p2p_net_deadlock` (both transports) pass. - Whitespace, file, assertion, include, and circular-dependency lints pass; `clang-format-diff` reports no changes. Safety review: `NodesSnapshot` keeps the current node alive during message processing, so `State(pto->GetId())` is valid across the released-and-reacquired `cs_main` in `SendMessages`. Selection returns copied inventories; no `CNodeState` or chain-index reference escapes its lock. `RequestedTx` already tolerates an announcement that was completed or forgotten by another thread between selection and request (the superfluous-call branch in `txrequest.cpp`), which is the only new interleaving the split introduces. The `linux64_tsan-test` failure on the previous push was `feature_protx_version.py` hitting a data race on the static `ep2_curve_get_s3()::s3` buffer inside vendored relic, reached from two DKG phase-handler threads calling `CActiveMasternodeManager::Sign`. That race is in `src/dashbls`, not touched here, and develop's TSAN job passes intermittently on the same code. ## Breaking Changes None. ## Checklist: - [x] I have performed a self-review of my own code - [x] I have commented my code, particularly in hard-to-understand areas - [x] I have added or updated relevant unit/integration/functional/e2e tests - [x] I have made corresponding changes to the documentation - [ ] I have assigned this pull request to a milestone This pull request was created by Codex. Top commit has no ACKs. Tree-SHA512: fe39eb5f3a89dc3d6e125a1a51562402ba0314b8c37fdc3280f73960d698c514e5a2a2093897017f82825d1b1c08a4b579b6024680d0047352731eeb6fda48ec
Issue being fixed or feature implemented
see: #6953 (comment) -- based on that collected data; the cs_main contention in network processing is ~17% of cs_main contention. If we exclude the islock cs_main (resolved (or mostly resolved don't recall) in that PR) the percentage grows to 30%; if we can minimize contention here, it will benefit our overall cs_main contention data.
What was done?
convert CConman to a structure that is more in line with peerman; namely, objects protect their own internal data, and the vector stores shared pointers, so that we take a shared_ptr from the vector, and then can use it as we desire without lifetime concerns.
Be aware, I would like to upstream these changes, so that we don't have to maintain them long term, however there's no guarantee that will be viable.
How Has This Been Tested?
Deployed testing was minimal; after 6953 is merged; I'd like to deploy this version to some testnet nodes and analyze contention.
Breaking Changes
None
Checklist:
Go over all the following points, and put an
xin all the boxes that apply.