Age | Commit message (Collapse) | Author |
|
Trivial Conflicts in
src/common/crypto.c
src/or/main.h
src/or/or.h
|
|
About 860 doxygen-less things remain in 0.2.2
|
|
|
|
Conflicts:
src/common/test.h
src/or/test.c
|
|
|
|
The node_t type is meant to serve two key functions:
1) Abstracting difference between routerinfo_t and microdesc_t
so that clients can use microdesc_t instead of routerinfo_t.
2) Being a central place to hold mutable state about nodes
formerly held in routerstatus_t and routerinfo_t.
This patch implements a nodelist type that holds a node for every
router that we would consider using.
|
|
This should make us conflict less with system files named "log.h".
Yes, we shouldn't have been conflicting with those anyway, but some
people's compilers act very oddly.
The actual change was done with one "git mv", by editing
Makefile.am, and running
find . -name '*.[ch]' | xargs perl -i -pe 'if (/^#include.*\Wlog.h/) {s/log.h/torlog.h/; }'
|
|
Conflicts:
src/common/test.h
src/or/test.c
|
|
|
|
|
|
This changes the pqueue API by requiring an additional int in every
structure that we store in a pqueue to hold the index of that structure
within the heap.
|
|
Some *_free functions threw asserts when passed NULL. Now all of them
accept NULL as input and perform no action when called that way.
This gains us consistence for our free functions, and allows some
code simplifications where an explicit null check is no longer necessary.
|
|
One was a simple buffer overrun; the other was a high-speed pointer
collision. Both were introduced by my microdescs branch.
|
|
|
|
|
|
|
|
|
|
parsing mismatches on different platforms.
svn:r18189
|
|
The subversion $Id$ fields made every commit force a rebuild of
whatever file got committed. They were not actually useful for
telling the version of Tor files in the wild.
svn:r17867
|
|
svn:r17785
|
|
documentation: Don't introduce two parameters called n when you're calling an algorithm O(n).
svn:r17783
|
|
svn:r17734
|
|
comments so that they will get recognized as doxygen.
svn:r17729
|
|
needlessly prissy; it was hinting at the wrongly pure smartlist_bsearch_idx.
svn:r17396
|
|
svn:r17357
|
|
identity fingerprints, so it's easier to paste them in.
Suggested by Lucky Green.
svn:r17021
|
|
svn:r16782
|
|
it does work for tas after all.
svn:r16724
|
|
Reported by Tas.
svn:r16713
|
|
The optimist calls the glass half full. The pessimist calls it half empty. The engineer says it is twice as large as it needs to be. In this case, the engineer says that the default smartlist size is twice as large as it needs to be and wouldn't it be nice to save half a megabyte with a one-line patch?
svn:r14341
|
|
When we remove old routers, use Bloom filters rather than a digestmap-based set in order to tell which ones we absolutely need to keep. This will save us roughly a kazillion little short-lived allocations for hash table entries.
svn:r14318
|
|
Remove redundant check from container.c that gcc 4.2 didnt like
svn:r13668
|
|
Fix a spelling error and clean up a recent veracode-induced integer overflow check. Both spotted by Chris Palmer.
svn:r13639
|
|
Add a few asserts to catch possible errors found by veracode.
svn:r13598
|
|
Chris Palmer notes that almost nobody is using smartlist_set_capacity(). Chris Palmer is right. Remove this basically pointless function.
svn:r13596
|
|
Add some checks in torgzip.c to make sure we never overflow size_t there. Also make sure we do not realloc(list,0) in container.c. Backport candidate.
svn:r13587
|
|
svn:r13412
|
|
svn:r13403
|
|
Remove some dead code.
svn:r13053
|
|
svn:r12786
|
|
Mess with the formula for the Guard flag again. Now it requires that you be in the most familiar 7/8 of nodes, and have above median wfu for that 7/8th. See spec for details. Also, log thresholds better.
svn:r12440
|
|
Add a smartlist_bsearch_idx function that gives more useful output than regular bsearch for the value-not-found case.
svn:r12360
|
|
Change meaning of "freefn" argument to smartlist_uniq so that we can remove duplicates from a list without freeing them.
svn:r12053
|
|
Fix example use of hash table iterators
svn:r11991
|
|
From little acorns: redo our string and digest hashing code to be faster, since this stuff may be critical-path.
svn:r11700
|
|
Unify all of the divergent median/nth-percentile code in container.[ch]
svn:r11457
|
|
Split over-optimized digestmap_set code into a generic part and a digestmap-specific part.
svn:r11012
|
|
Add missing code documentation in src/common
svn:r10991
|
|
Sun CC likes to give warnings for the do { } while(0) construction for making statement-like macros. Define STMT_BEGIN/STMT_END macros that do the right thing, and use them everywhere.
svn:r10645
|
|
Build with fewer compiler warnings on Sun. (This and previous Sun patches are thanks to the tremendously handy services of unix-center.net.)
svn:r10644
|