| Commit message (Collapse) | Author | Age |
|---|
| |\
| |
| |
| |
| |
| | |
Conflicts:
src/or/router.c
src/test/test_dir.c
|
| | |
| |
| |
| | |
(rather than router->address)
|
| |\ \
| | |
| | |
| | |
| | | |
Conflicts:
src/or/circuitbuild.c
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Right now this accounts for about 1% of circuits over all, but if you
pick a guard that's running 0.2.3, it will be about 6% of the circuits
running through that guard.
Making sure that every circuit has at least one ntor link means that
we're getting plausibly good forward secrecy on every circuit.
This implements ticket 9777,
|
| |\ \ \
| | | |
| | | |
| | | |
| | | | |
Conflicts:
src/or/or.h
|
| | |/ /
| | |
| | |
| | |
| | | |
This makes FastFirstHopPK an AUTOBOOL; makes the default "auto"; and
makes the behavior of "auto" be "look at the consensus."
|
| | | |
| | |
| | |
| | | |
That was the tricky part
|
| | | |
| | |
| | |
| | | |
Does not compile yet. This is the "no code changed" diff.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
The old code had logic to use a shorter path length if we didn't
have enough nodes. But we don't support 2-node networks anwyay.
Fix for #9926. I'm not calling this a bugfix on any particular
version, since a 2-node network would fail to work for you for a lot
of other reasons too, and it's not clear to me when that began, or if
2-node networks would ever have worked.
|
| | | |
| | |
| | |
| | | |
(These have proved invaluable for other global accessors.)
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | |
| | | |
Change the global circ_times to a static variable and use
accessor functions throughout the code, instead of
accessing it directly.
|
| | | | |
|
| | | | |
|
| |/ / |
|
| | |
| |
| |
| |
| |
| | |
We need to subtract both the current built circuits *and* the attempted
circuits from the attempt count during scaling, since *both* have already been
counted there.
|
| | | |
|
| | |
| |
| |
| |
| | |
Just in case more issues remain with scaling, it would be nice to pin-point
them as such.
|
| | |
| |
| |
| | |
We didn't see this in normal usage anyway.
|
| | |
| |
| |
| | |
Should silence two path bias Bug messages seen on relays at startup.
|
| | |
| |
| |
| |
| |
| |
| |
| |
| | |
It seems that some versions of clang that would prefer the
-Wswitch-enum compiler flag to warn about switch statements with
missing enum values, even if those switch statements have a
default.
Fixes bug 8598; bugfix on 0.2.4.10-alpha.
|
| | | |
|
| |\ \ |
|
| | | |
| | |
| | |
| | |
| | |
| | | |
The new name is circuit_mark_all_dirty_circs_as_unusable.
This resolves an XXX024
|
| |\ \ \ |
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
In addition to rejecting them post-hoc, avoid picking them in the
first place. This makes us less likely to decide that we can't add
guards at all.
|
| | |/ /
|/| |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Now that circid_t is 4 bytes long, the default integer promotions will
leave it alone when sizeof(int) == 4, which will leave us formatting an
unsigned as an int. That's technically undefined behavior.
Fixes bug 8447 on bfffc1f0fc7616a25c32da2eb759dade4651659e. Bug not
in any released Tor.
|
| | | |
| | |
| | |
| | |
| | | |
This should prevent crashes on further recurrence of 8065, and help
diagnose such if they occur
|
| |\ \ \
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Conflicts:
src/or/channel.h
src/or/connection_or.c
src/or/cpuworker.c
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Implements proposal 214.
Needs testing.
|
| |\ \ \ \
| |_|/ /
|/| | | |
|
| | | | |
| | | |
| | | |
| | | |
| | | | |
We shouldn't be calling choose_random_entry() for directory
conncetions; that's what choose_random_dirguard() is for.
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Now we can specify to skip bridges that wouldn't be able to answer the
type of dir fetch we're launching.
It's still the responsibility of the rest of the code to prevent us from
launching a given dir fetch if we have no bridges that could handle it.
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Now as we move into a future where most bridges can handle microdescs
we will generally find ourselves using them, rather than holding back
just because one of our bridges doesn't use them.
|
| | |_|/
|/| |
| | |
| | |
| | | |
Coverity is worried about this (CID 980653). It hasn't happened in
testing, but we might as well make sure it can't happen.
|
| | | | |
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | | |
I think we want both sets of messages to appear independently to help us know
what needs tuning.
|
| | | |
| | |
| | |
| | | |
I noticed bad wifi networks can have low use success rates.
|
| |/ /
| |
| |
| |
| |
| |
| | |
These seem to have gotten conflicted out of existence while mike was
working on path bias stuff.
Thanks to sysrqb for collecting these in a handy patch.
|
| | | |
|
| | |
| |
| |
| |
| | |
This informational counter is probably now redundant, but might as well keep
it consistent I guess.
|
| | | |
|
| | |
| |
| |
| |
| |
| | |
Also document it better.
Mention this refactoring in the comments for the path state machine.
|
| | | |
|
| | |
| |
| |
| |
| | |
Also, deprecate the torrc options for the scaling values. It's unlikely anyone
but developers will ever tweak them, even if we provided a single ratio value.
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|