mirrors/arti.git - mirror of https://gitlab.torproject.org/tpo/core/arti

	Commit message (Collapse)	Author	Age	Files	Lines
*	Merge branch 'clippy-allow' into 'main'	Ian Jackson	2023-07-11	1	-0/+1
\|\ \| \| \| \| \| \| \| \|	clippy: Allow some of our existing code patterns See merge request tpo/core/arti!1396
\| *	Run maint/add_warning to actually apply new lint allows	Ian Jackson	2023-07-10	1	-0/+1
\| \|
* \|	rng ranges: Use gen_range_checked().expect() in obvious cases (fmt)	Ian Jackson	2023-07-10	1	-1/+2
\| \|
* \|	rng ranges: Use gen_range_checked().expect() in obvious cases	Ian Jackson	2023-07-10	1	-1/+3
\|/ \| \| \|	In each of these, it is locally obvious that the range is nonempty.
*	random_idx_where: Ensure uniform distribution of choice	Jim Newsome	2023-06-23	1	-22/+32
\| \| \| \| \|	Previously, this was more likely to select elements that occurred after other elements that didn't satisfy the predicate.
*	Add more tests for random_idx_where	Jim Newsome	2023-06-23	1	-0/+10
\|
*	tor-circmgr: Test random_idx_where with empty slice	Ian Jackson	2023-06-23	1	-0/+7
\| \| \| \| \|	I have verified that this test fails, as expected, when applied without the corresponding bugfix.
*	tor-circmgr: random_idx_where: Don't panic on empty range	Ian Jackson	2023-06-23	1	-0/+3
\| \| \| \|	Fixes #918.
*	Typo fixes	gabi-250	2023-06-20	1	-2/+2
\|
*	circmgr: Use a slightly nicer way to pick a circuit from our pool.	Nick Mathewson	2023-06-16	1	-13/+58
\| \| \| \| \| \| \| \|	This algorithm only looks at circuits until it finds one that satisfies our needs. To get a random circuit, it just randomizes the starting point within the pool. This optimization may help if we let circuit pools grow large.
*	circmgr: Make hspool size dynamic	Nick Mathewson	2023-06-16	1	-9/+98
\| \| \| \| \| \| \| \| \| \| \| \| \| \|	Previously we'd always try to keep 8 circuits ready. That doesn't make sense if we are super-busy. Instead, if we run out of circuits, we double the amount that we try to keep ready, and if we never go under 80% of our target number, we half the number we try to keep ready. We limit the rate of change here, to make sure that we aren't flapping too much or shrinking too aggressively. This algorithm is still a mite arbitrary, and will need tuning in the future.
*	circmgr::hspool: Move the Mutex into an intermediary Inner struct	Nick Mathewson	2023-06-16	1	-11/+11
\| \| \| \|	This will be helpful as we complexify the pool behavior a bit.
*	Refactor ClientCirc APIs to use Arc<ClientCirc>.	Nick Mathewson	2023-05-16	1	-6/+6
\| \| \| \| \| \| \| \| \| \| \| \|	Now ClientCirc is no longer `Clone`, and the things that need it to be `Clone` instead return and use an Arc<ClientCirc> We're doing this so that ClientCirc can participate in the RPC system, and so that its semantics are more obvious. Closes #846. Thanks to the type system, this was a much simpler refactoring than I had feared it would be.
*	circmgr: Add an actual pool to HsCircPool.	Nick Mathewson	2023-03-22	1	-0/+52
	We now have support for a pool of pre-build circuits that we can use for HS-related purposes, and we take circuits from this pool as needed. Nothing populates or cleans the circuit pool yet.