nihilist/tor
1
0
Fork 0
mirror of https://gitlab.torproject.org/tpo/core/tor.git synced 2024-11-23 20:03:31 +01:00
Code Issues Packages Projects Releases Wiki Activity

whitespace and typo cleanups

Browse Source
This commit is contained in:
Roger Dingledine 2018-02-09 17:05:20 -05:00
parent d95c7c7f52
commit 99666dc6c4
4 changed files with 7 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/common/address_set.c
View File

@ -34,7 +34,7 @@
* independent siphashes rather than messing around with bit-shifts. The
* approach here is probably more sound, and we should prefer it if&when we
* unify the implementations.
**/
*/
struct address_set_t {
/** siphash keys to make N_HASHES independent hashes for each address. */
@ -63,7 +63,7 @@ address_set_new(int max_addresses_guess)
}
/**
* Release all storage associated with <b>set</b>
* Release all storage associated with <b>set</b>.
*/
void
address_set_free(address_set_t *set)
@ -107,7 +107,7 @@ address_set_add_ipv4h(address_set_t *set, uint32_t addr)
}
/**
* Return true if <b>addr</b> if a member of <b>set</b>. (And probably,
* Return true if <b>addr</b> is a member of <b>set</b>. (And probably,
* return false if <b>addr</b> is not a member of set.)
*/
int

2
src/common/address_set.h
View File

@ -2,7 +2,7 @@
/* See LICENSE for licensing information */
/**
* \file addressset.h
* \file address_set.h
* \brief Types to handle sets of addresses.
*
* This module was first written on a semi-emergency basis to improve the

2
src/or/hs_circuit.c
View File

@ -722,7 +722,7 @@ hs_circ_retry_service_rendezvous_point(origin_circuit_t *circ)
* circuit to the same rendezvous point at the same time. */
circ->hs_service_side_rend_circ_has_been_relaunched = 1;
/* Legacy service don't have a hidden service ident. */
/* Legacy services don't have a hidden service ident. */
if (circ->hs_ident) {
retry_service_rendezvous_point(circ);
} else {

11
src/or/replaycache.c
View File

@ -26,7 +26,6 @@
/** Free the replaycache r and all of its entries.
*/
void
replaycache_free_(replaycache_t *r)
{
@ -44,7 +43,6 @@ replaycache_free_(replaycache_t *r)
* for entries to age out and interval is the time after which the cache
* should be scrubbed for old entries.
*/
replaycache_t *
replaycache_new(time_t horizon, time_t interval)
{
@ -72,9 +70,8 @@ replaycache_new(time_t horizon, time_t interval)
return r;
}
/** See documentation for replaycache_add_and_test()
/** See documentation for replaycache_add_and_test().
*/
STATIC int
replaycache_add_and_test_internal(
time_t present, replaycache_t *r, const void *data, size_t len,
@ -136,9 +133,8 @@ replaycache_add_and_test_internal(
return rv;
}
/** See documentation for replaycache_scrub_if_needed()
/** See documentation for replaycache_scrub_if_needed().
*/
STATIC void
replaycache_scrub_if_needed_internal(time_t present, replaycache_t *r)
{
@ -186,7 +182,6 @@ replaycache_scrub_if_needed_internal(time_t present, replaycache_t *r)
* and the function will return 1 if it was already seen within the cache's
* horizon, or 0 otherwise.
*/
int
replaycache_add_and_test(replaycache_t *r, const void *data, size_t len)
{
@ -196,7 +191,6 @@ replaycache_add_and_test(replaycache_t *r, const void *data, size_t len)
/** Like replaycache_add_and_test(), but if it's a hit also return the time
* elapsed since this digest was last seen.
*/
int
replaycache_add_test_and_elapsed(
replaycache_t *r, const void *data, size_t len, time_t *elapsed)
@ -207,7 +201,6 @@ replaycache_add_test_and_elapsed(
/** Scrub aged entries out of r if sufficiently long has elapsed since r was
* last scrubbed.
*/
void
replaycache_scrub_if_needed(replaycache_t *r)
{