HomeSort by relevance Sort by last modified time
    Searched refs:UpdateHash (Results 1 - 12 of 12) sorted by null

  /external/chromium_org/content/browser/download/
base_file_unittest.cc 90 void UpdateHash(const char* data, size_t length) {
262 UpdateHash(kTestData1, kTestDataLength1);
324 UpdateHash(kTestData1, kTestDataLength1);
346 UpdateHash(kTestData1, kTestDataLength1);
347 UpdateHash(kTestData2, kTestDataLength2);
348 UpdateHash(kTestData3, kTestDataLength3);
374 UpdateHash(kTestData1, kTestDataLength1);
375 UpdateHash(kTestData2, kTestDataLength2);
376 UpdateHash(kTestData3, kTestDataLength3);
  /external/chromium_org/third_party/libjingle/source/talk/p2p/base/
turnport.h 122 UpdateHash();
149 void UpdateHash();
turnport.cc 584 void TurnPort::UpdateHash() {
    [all...]
  /external/chromium/sdch/open-vcdiff/src/
rolling_hash.h 108 // instance of this type to use UpdateHash(), but Hash() does not depend on
128 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1]
134 // The larger the window, the more advantage comes from using UpdateHash()
137 // while the time to execute UpdateHash() remains constant. Empirical tests
139 uint32_t UpdateHash(uint32_t old_hash,
220 // In fact, that is precisely what happens in UpdateHash, above.
rolling_hash_test.cc 122 running_hash = hasher.UpdateHash(running_hash,
146 // UpdateHash() calculates the hash value incrementally.
147 running_hash = hasher.UpdateHash(running_hash,
vcdiffengine.cc 207 // candidate_pos has jumped ahead by bytes_encoded bytes, so UpdateHash
226 hash_value = hasher.UpdateHash(hash_value,
  /external/chromium_org/sdch/open-vcdiff/src/
rolling_hash.h 107 // instance of this type to use UpdateHash(), but Hash() does not depend on
127 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1]
133 // The larger the window, the more advantage comes from using UpdateHash()
136 // while the time to execute UpdateHash() remains constant. Empirical tests
138 uint32_t UpdateHash(uint32_t old_hash,
216 // In fact, that is precisely what happens in UpdateHash, above.
rolling_hash_test.cc 122 running_hash = hasher.UpdateHash(running_hash,
146 // UpdateHash() calculates the hash value incrementally.
147 running_hash = hasher.UpdateHash(running_hash,
vcdiffengine.cc 204 // candidate_pos has jumped ahead by bytes_encoded bytes, so UpdateHash
223 hash_value = hasher.UpdateHash(hash_value,
  /external/open-vcdiff/src/
rolling_hash.h 107 // instance of this type to use UpdateHash(), but Hash() does not depend on
127 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1]
133 // The larger the window, the more advantage comes from using UpdateHash()
136 // while the time to execute UpdateHash() remains constant. Empirical tests
138 uint32_t UpdateHash(uint32_t old_hash,
216 // In fact, that is precisely what happens in UpdateHash, above.
rolling_hash_test.cc 122 running_hash = hasher.UpdateHash(running_hash,
146 // UpdateHash() calculates the hash value incrementally.
147 running_hash = hasher.UpdateHash(running_hash,
vcdiffengine.cc 204 // candidate_pos has jumped ahead by bytes_encoded bytes, so UpdateHash
223 hash_value = hasher.UpdateHash(hash_value,

Completed in 522 milliseconds