OLD | NEW |
1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include <algorithm> | 5 #include <algorithm> |
6 #include <string> | 6 #include <string> |
7 #include <vector> | 7 #include <vector> |
8 | 8 |
9 #include "base/logging.h" | 9 #include "base/logging.h" |
10 #include "base/scoped_ptr.h" | 10 #include "base/scoped_ptr.h" |
(...skipping 314 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
325 output_block_size, filter.get(), &output); | 325 output_block_size, filter.get(), &output); |
326 EXPECT_FALSE(status); // Couldn't decode. | 326 EXPECT_FALSE(status); // Couldn't decode. |
327 EXPECT_TRUE(output == ""); // No output written. | 327 EXPECT_TRUE(output == ""); // No output written. |
328 } | 328 } |
329 | 329 |
330 | 330 |
331 // Test that filters can be cascaded (chained) so that the output of one filter | 331 // Test that filters can be cascaded (chained) so that the output of one filter |
332 // is processed by the next one. This is most critical for SDCH, which is | 332 // is processed by the next one. This is most critical for SDCH, which is |
333 // routinely followed by gzip (during encoding). The filter we'll test for will | 333 // routinely followed by gzip (during encoding). The filter we'll test for will |
334 // do the gzip decoding first, and then decode the SDCH content. | 334 // do the gzip decoding first, and then decode the SDCH content. |
335 TEST_F(SdchFilterTest, FilterChaining) { | 335 // TODO(jar): Enable test which fails in net_unittests.exe |
| 336 TEST_F(SdchFilterTest, DISABLED_FilterChaining) { |
336 const std::string kSampleDomain = "sdchtest.com"; | 337 const std::string kSampleDomain = "sdchtest.com"; |
337 | 338 |
338 // Construct a valid SDCH dictionary from a VCDIFF dictionary. | 339 // Construct a valid SDCH dictionary from a VCDIFF dictionary. |
339 std::string dictionary("Domain: "); | 340 std::string dictionary("Domain: "); |
340 dictionary.append(kSampleDomain); | 341 dictionary.append(kSampleDomain); |
341 dictionary.append("\n\n"); | 342 dictionary.append("\n\n"); |
342 dictionary.append(test_vcdiff_dictionary_); | 343 dictionary.append(test_vcdiff_dictionary_); |
343 std::string client_hash; | 344 std::string client_hash; |
344 std::string server_hash; | 345 std::string server_hash; |
345 SdchManager::GenerateHash(dictionary, &client_hash, &server_hash); | 346 SdchManager::GenerateHash(dictionary, &client_hash, &server_hash); |
(...skipping 86 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
432 feed_block_size = 1; | 433 feed_block_size = 1; |
433 output_block_size = 1; | 434 output_block_size = 1; |
434 output.clear(); | 435 output.clear(); |
435 status = FilterTestData(compressed, feed_block_size, output_block_size, | 436 status = FilterTestData(compressed, feed_block_size, output_block_size, |
436 filter.get(), &output); | 437 filter.get(), &output); |
437 EXPECT_TRUE(status); | 438 EXPECT_TRUE(status); |
438 EXPECT_TRUE(output == expanded_); | 439 EXPECT_TRUE(output == expanded_); |
439 } | 440 } |
440 | 441 |
441 }; // namespace anonymous | 442 }; // namespace anonymous |
OLD | NEW |