Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(245)

Side by Side Diff: net/quic/port_suggester.cc

Issue 107803002: Consistently suggest ephemeral port for QUIC client (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Move a paren... save a 64 bit add Created 7 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
(Empty)
1 // Copyright 2013 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
4
5 #include "net/quic/port_suggester.h"
6
7 #include "base/logging.h"
8 #include "net/base/host_port_pair.h"
9
10 namespace net {
11
12 PortSuggester::PortSuggester(const HostPortPair& server,
13 uint64 per_profile_randomness)
14 : call_count_(0),
15 previous_suggestion_(-1) {
16 unsigned char hash_bytes[base::kSHA1Length];
17 base::SHA1HashBytes(
18 reinterpret_cast<const unsigned char*>(server.host().data()),
19 server.host().length(), hash_bytes);
20 memcpy(&seed_, hash_bytes, sizeof(seed_));
21 seed_ ^= per_profile_randomness ^ server.port();
22 }
23
24 int PortSuggester::SuggestPort(int min, int max) {
25 // Sometimes our suggestion can't be used, so we ensure that if additional
26 // calls are made, then each call (probably) provides a new suggestion.
27 if (++call_count_ > 1) {
28 // Evolve the seed.
29 unsigned char hash_bytes[base::kSHA1Length];
30 base::SHA1HashBytes(reinterpret_cast<const unsigned char *>(&seed_),
31 sizeof(seed_), hash_bytes);
32 memcpy(&seed_, hash_bytes, sizeof(seed_));
33 }
34 DCHECK_LE(min, max);
35 DCHECK_GT(min, 0);
36 int range = max - min + 1;
37 // Ports (and hence the extent of the |range|) are generally under 2^16, so
38 // the tiny non-uniformity in the pseudo-random distribution is not
39 // significant.
40 previous_suggestion_ = static_cast<int>(seed_ % range) + min;
Ryan Hamilton 2013/12/07 23:21:55 I'm not sure that I understand the need for previo
jar (doing other things) 2013/12/08 01:38:36 Min and max are not members... so the calculation
Ryan Hamilton 2013/12/08 04:00:29 Oh, right! Of course, that's obvious now that you
41 return previous_suggestion_;
42 }
43
44 } // namespace net
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698