Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright (c) 2011 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 <string> | |
| 6 | |
| 7 #include "base/bind.h" | |
| 8 #include "base/file_path.h" | |
| 9 #include "base/logging.h" | |
| 10 #include "base/stl_util.h" | |
| 11 #include "base/time.h" | |
| 12 #include "base/values.h" | |
| 13 #include "content/browser/download/download_query.h" | |
| 14 #include "content/browser/download/mock_download_item.h" | |
| 15 #include "testing/gmock/include/gmock/gmock.h" | |
| 16 #include "testing/gtest/include/gtest/gtest.h" | |
| 17 | |
| 18 using ::testing::Return; | |
| 19 using ::testing::ReturnRef; | |
| 20 using ::testing::_; | |
| 21 using base::Time; | |
| 22 using base::Value; | |
| 23 typedef DownloadQuery::DownloadVector DownloadVector; | |
| 24 | |
| 25 namespace { | |
| 26 | |
| 27 bool IdNotEqual(int not_id, const DownloadItem& item) { | |
| 28 return item.GetId() != not_id; | |
| 29 } | |
| 30 | |
| 31 bool AlwaysReturn(bool result, const DownloadItem& item) { | |
| 32 return result; | |
| 33 } | |
| 34 | |
| 35 } // anonymous namespace | |
| 36 | |
| 37 class DownloadQueryTest : public testing::Test { | |
| 38 public: | |
| 39 DownloadQueryTest() {} | |
| 40 | |
| 41 virtual ~DownloadQueryTest() {} | |
| 42 | |
| 43 virtual void TearDown() { | |
| 44 STLDeleteElements(&mocks_); | |
| 45 } | |
| 46 | |
| 47 void CreateMocks(int count) { | |
| 48 for (int i = 0; i < count; ++i) { | |
| 49 mocks_.push_back(new MockDownloadItem()); | |
| 50 } | |
| 51 } | |
| 52 | |
| 53 MockDownloadItem& mock(int index) { return *mocks_[index]; } | |
| 54 | |
| 55 DownloadQuery* query() { return &query_; } | |
| 56 | |
| 57 template<typename ValueType> void AddFilter( | |
| 58 DownloadQuery::FilterType name, ValueType value); | |
| 59 | |
| 60 void Search() { | |
| 61 query_.Search(mocks_.begin(), mocks_.end(), &results_); | |
| 62 } | |
| 63 | |
| 64 DownloadVector* results() { return &results_; } | |
| 65 | |
| 66 private: | |
| 67 std::vector<MockDownloadItem*> mocks_; | |
| 68 DownloadQuery query_; | |
| 69 DownloadVector results_; | |
| 70 | |
| 71 DISALLOW_COPY_AND_ASSIGN(DownloadQueryTest); | |
| 72 }; | |
| 73 | |
| 74 template<> void DownloadQueryTest::AddFilter( | |
| 75 DownloadQuery::FilterType name, bool value) { | |
| 76 CHECK(query_.AddFilter(name, Value::CreateBooleanValue(value))); | |
| 77 } | |
| 78 | |
| 79 template<> void DownloadQueryTest::AddFilter( | |
| 80 DownloadQuery::FilterType name, int value) { | |
| 81 CHECK(query_.AddFilter(name, Value::CreateIntegerValue(value))); | |
| 82 } | |
| 83 | |
| 84 template<> void DownloadQueryTest::AddFilter( | |
| 85 DownloadQuery::FilterType name, const char* value) { | |
| 86 CHECK(query_.AddFilter(name, Value::CreateStringValue(value))); | |
| 87 } | |
| 88 | |
| 89 TEST_F(DownloadQueryTest, DownloadQueryEmptyNoItems) { | |
| 90 Search(); | |
| 91 EXPECT_EQ(0U, results()->size()); | |
| 92 } | |
| 93 | |
| 94 TEST_F(DownloadQueryTest, DownloadQueryEmptySomeItems) { | |
| 95 CreateMocks(3); | |
| 96 Search(); | |
| 97 EXPECT_EQ(3U, results()->size()); | |
| 98 } | |
| 99 | |
| 100 TEST_F(DownloadQueryTest, DownloadQueryInvalidFilters) { | |
| 101 EXPECT_FALSE(query()->AddFilter( | |
| 102 DownloadQuery::FILTER_BYTES_RECEIVED, NULL)); | |
| 103 EXPECT_FALSE(query()->AddFilter( | |
| 104 static_cast<DownloadQuery::FilterType>(kint32max), | |
| 105 Value::CreateIntegerValue(0))); | |
| 106 } | |
| 107 | |
| 108 TEST_F(DownloadQueryTest, DownloadQueryLimit) { | |
| 109 CreateMocks(2); | |
| 110 query()->Limit(1); | |
| 111 Search(); | |
| 112 EXPECT_EQ(1U, results()->size()); | |
| 113 } | |
| 114 | |
| 115 #define SWITCH2(_index, _col1, _ret1, _default) \ | |
|
Randy Smith (Not in Mondays)
2011/12/12 18:17:54
nit: A sentence or two of comment documentation?
benjhayden
2011/12/12 19:52:10
Done.
| |
| 116 ((_index == (_col1)) ? _ret1 : _default) | |
| 117 #define SWITCH3(_index, _col1, _ret1, _col2, _ret2, _default) \ | |
| 118 SWITCH2(_index, _col1, _ret1, SWITCH2(_index, _col2, _ret2, _default)) | |
| 119 #define SWITCH4(_index, _col1, _ret1, _col2, _ret2, _col3, _ret3, _default) \ | |
| 120 SWITCH3(_index, _col1, _ret1, _col2, _ret2, \ | |
| 121 SWITCH2(_index, _col3, _ret3, _default)) | |
| 122 | |
| 123 TEST_F(DownloadQueryTest, DownloadQueryAllFilters) { | |
| 124 // Set up mocks such that only mock(0) matches all filters, and every other | |
| 125 // mock fails a different filter (or two for GREATER/LESS filters). | |
| 126 static const size_t kNumItems = 19; | |
| 127 CreateMocks(kNumItems); | |
| 128 FilePath refail_filename("z"); | |
| 129 FilePath fail_filename("fail"); | |
| 130 FilePath match_filename("match"); | |
| 131 GURL refail_url("http://z.com/"); | |
| 132 GURL fail_url("http://example.com/fail"); | |
| 133 GURL match_url("http://example.com/match"); | |
| 134 // Picture a 2D matrix. The rows are MockDownloadItems and the columns are | |
| 135 // methods. Every cell contains a value that matches the filters, except for | |
| 136 // the diagonal. Every item matches all the filters except one filter, which | |
| 137 // it fails, except one item, which matches all the filters without exception. | |
|
Randy Smith (Not in Mondays)
2011/12/12 18:17:54
This comment doesn't match (to me, at least) with
benjhayden
2011/12/12 19:52:10
Done.
| |
| 138 for (size_t i = 0; i < kNumItems; ++i) { | |
| 139 EXPECT_CALL(mock(i), GetId()).WillRepeatedly(Return(i)); | |
| 140 EXPECT_CALL(mock(i), GetReceivedBytes()).WillRepeatedly(Return(SWITCH2(i, | |
| 141 1, 2, | |
| 142 1))); | |
| 143 EXPECT_CALL(mock(i), GetSafetyState()).WillRepeatedly(Return(SWITCH2(i, | |
| 144 2, DownloadItem::DANGEROUS, | |
| 145 DownloadItem::DANGEROUS_BUT_VALIDATED))); | |
| 146 EXPECT_CALL(mock(i), GetFullPath()).WillRepeatedly(ReturnRef(SWITCH3(i, | |
| 147 3, refail_filename, | |
| 148 4, fail_filename, | |
| 149 match_filename))); | |
| 150 EXPECT_CALL(mock(i), GetMimeType()).WillRepeatedly(Return(SWITCH2(i, | |
| 151 5, "image", | |
| 152 "text"))); | |
| 153 EXPECT_CALL(mock(i), IsPaused()).WillRepeatedly(Return(SWITCH2(i, | |
| 154 6, false, | |
| 155 true))); | |
| 156 EXPECT_CALL(mock(i), MatchesQuery(_)).WillRepeatedly(Return(SWITCH2(i, | |
| 157 7, false, | |
| 158 true))); | |
| 159 EXPECT_CALL(mock(i), GetStartTime()).WillRepeatedly(Return(SWITCH4(i, | |
| 160 8, base::Time::FromTimeT(1), | |
| 161 9, base::Time::FromTimeT(4), | |
| 162 10, base::Time::FromTimeT(3), | |
| 163 base::Time::FromTimeT(2)))); | |
| 164 EXPECT_CALL(mock(i), GetTotalBytes()).WillRepeatedly(Return(SWITCH4(i, | |
| 165 11, 1, | |
| 166 12, 4, | |
| 167 13, 3, | |
| 168 2))); | |
| 169 EXPECT_CALL(mock(i), GetOriginalUrl()).WillRepeatedly(ReturnRef(SWITCH3(i, | |
| 170 14, refail_url, | |
| 171 15, fail_url, | |
| 172 match_url))); | |
| 173 EXPECT_CALL(mock(i), GetState()).WillRepeatedly(Return(SWITCH2(i, | |
| 174 17, DownloadItem::CANCELLED, | |
| 175 DownloadItem::IN_PROGRESS))); | |
| 176 EXPECT_CALL(mock(i), GetDangerType()).WillRepeatedly(Return(SWITCH2(i, | |
| 177 18, DownloadStateInfo::DANGEROUS_FILE, | |
| 178 DownloadStateInfo::NOT_DANGEROUS))); | |
| 179 } | |
| 180 for (size_t i = 0; i < kNumItems; ++i) { | |
| 181 switch (i) { | |
| 182 case 0: break; | |
| 183 case 1: AddFilter(DownloadQuery::FILTER_BYTES_RECEIVED, 1); break; | |
| 184 case 2: AddFilter(DownloadQuery::FILTER_DANGER_ACCEPTED, true); | |
| 185 break; | |
| 186 case 3: AddFilter(DownloadQuery::FILTER_FILENAME_REGEX, "a"); break; | |
| 187 case 4: AddFilter(DownloadQuery::FILTER_FILENAME, | |
| 188 match_filename.value().c_str()); break; | |
| 189 case 5: AddFilter(DownloadQuery::FILTER_MIME, "text"); break; | |
| 190 case 6: AddFilter(DownloadQuery::FILTER_PAUSED, true); break; | |
| 191 case 7: AddFilter(DownloadQuery::FILTER_QUERY, ""); break; | |
| 192 case 8: AddFilter(DownloadQuery::FILTER_STARTED_AFTER, 1000); break; | |
| 193 case 9: AddFilter(DownloadQuery::FILTER_STARTED_BEFORE, 4000); | |
| 194 break; | |
| 195 case 10: AddFilter(DownloadQuery::FILTER_START_TIME, 2000); break; | |
| 196 case 11: AddFilter(DownloadQuery::FILTER_TOTAL_BYTES_GREATER, 1); | |
| 197 break; | |
| 198 case 12: AddFilter(DownloadQuery::FILTER_TOTAL_BYTES_LESS, 4); | |
| 199 break; | |
| 200 case 13: AddFilter(DownloadQuery::FILTER_TOTAL_BYTES, 2); break; | |
| 201 case 14: AddFilter(DownloadQuery::FILTER_URL_REGEX, "example"); | |
| 202 break; | |
| 203 case 15: AddFilter(DownloadQuery::FILTER_URL, | |
| 204 match_url.spec().c_str()); break; | |
| 205 case 16: CHECK(query()->AddFilter(base::Bind(&IdNotEqual, 16))); break; | |
| 206 case 17: query()->AddFilter(DownloadItem::IN_PROGRESS); break; | |
| 207 case 18: query()->AddFilter(DownloadStateInfo::NOT_DANGEROUS); break; | |
| 208 default: NOTREACHED(); break; | |
| 209 } | |
| 210 Search(); | |
| 211 ASSERT_EQ(kNumItems - i, results()->size()) | |
| 212 << "Failing filter: " << i; | |
| 213 if (i > 0) { | |
| 214 ASSERT_EQ(0, results()->at(0)->GetId()) | |
| 215 << "Failing filter: " << i; | |
| 216 for (size_t j = 1; j < kNumItems - i; ++j) { | |
| 217 ASSERT_EQ(static_cast<int32>(j + i), results()->at(j)->GetId()) | |
| 218 << "Failing filter: " << i; | |
| 219 } | |
| 220 } | |
| 221 } | |
| 222 } | |
| 223 | |
| 224 TEST_F(DownloadQueryTest, DownloadQuerySortBytesReceived) { | |
| 225 CreateMocks(2); | |
| 226 EXPECT_CALL(mock(0), GetReceivedBytes()).WillRepeatedly(Return(0)); | |
| 227 EXPECT_CALL(mock(1), GetReceivedBytes()).WillRepeatedly(Return(1)); | |
| 228 query()->AddSorter( | |
| 229 DownloadQuery::SORT_BYTES_RECEIVED, DownloadQuery::DESCENDING); | |
| 230 Search(); | |
| 231 EXPECT_EQ(1, results()->at(0)->GetReceivedBytes()); | |
| 232 EXPECT_EQ(0, results()->at(1)->GetReceivedBytes()); | |
| 233 } | |
| 234 | |
| 235 TEST_F(DownloadQueryTest, DownloadQuerySortDanger) { | |
| 236 CreateMocks(2); | |
| 237 EXPECT_CALL(mock(0), GetDangerType()).WillRepeatedly(Return( | |
| 238 DownloadStateInfo::DANGEROUS_FILE)); | |
| 239 EXPECT_CALL(mock(1), GetDangerType()).WillRepeatedly(Return( | |
| 240 DownloadStateInfo::NOT_DANGEROUS)); | |
| 241 query()->AddSorter( | |
| 242 DownloadQuery::SORT_DANGER, DownloadQuery::ASCENDING); | |
| 243 Search(); | |
| 244 EXPECT_EQ(DownloadStateInfo::NOT_DANGEROUS, | |
| 245 results()->at(0)->GetDangerType()); | |
| 246 EXPECT_EQ(DownloadStateInfo::DANGEROUS_FILE, | |
| 247 results()->at(1)->GetDangerType()); | |
| 248 } | |
| 249 | |
| 250 TEST_F(DownloadQueryTest, DownloadQuerySortDangerAccepted) { | |
| 251 CreateMocks(2); | |
| 252 EXPECT_CALL(mock(0), GetSafetyState()).WillRepeatedly(Return( | |
| 253 DownloadItem::DANGEROUS)); | |
| 254 EXPECT_CALL(mock(1), GetSafetyState()).WillRepeatedly(Return( | |
| 255 DownloadItem::DANGEROUS_BUT_VALIDATED)); | |
| 256 query()->AddSorter( | |
| 257 DownloadQuery::SORT_DANGER_ACCEPTED, DownloadQuery::DESCENDING); | |
| 258 Search(); | |
| 259 EXPECT_EQ(DownloadItem::DANGEROUS_BUT_VALIDATED, | |
| 260 results()->at(0)->GetSafetyState()); | |
| 261 EXPECT_EQ(DownloadItem::DANGEROUS, results()->at(1)->GetSafetyState()); | |
| 262 } | |
| 263 | |
| 264 TEST_F(DownloadQueryTest, DownloadQuerySortFilename) { | |
| 265 CreateMocks(2); | |
| 266 FilePath a_filename("a"); | |
| 267 FilePath b_filename("b"); | |
| 268 EXPECT_CALL(mock(0), GetFullPath()).WillRepeatedly(ReturnRef(b_filename)); | |
| 269 EXPECT_CALL(mock(1), GetFullPath()).WillRepeatedly(ReturnRef(a_filename)); | |
| 270 query()->AddSorter( | |
| 271 DownloadQuery::SORT_FILENAME, DownloadQuery::ASCENDING); | |
| 272 Search(); | |
| 273 EXPECT_EQ(a_filename, results()->at(0)->GetFullPath()); | |
| 274 EXPECT_EQ(b_filename, results()->at(1)->GetFullPath()); | |
| 275 } | |
| 276 | |
| 277 TEST_F(DownloadQueryTest, DownloadQuerySortMime) { | |
| 278 CreateMocks(2); | |
| 279 EXPECT_CALL(mock(0), GetMimeType()).WillRepeatedly(Return("a")); | |
| 280 EXPECT_CALL(mock(1), GetMimeType()).WillRepeatedly(Return("b")); | |
| 281 query()->AddSorter( | |
| 282 DownloadQuery::SORT_MIME, DownloadQuery::DESCENDING); | |
| 283 Search(); | |
| 284 EXPECT_EQ("b", results()->at(0)->GetMimeType()); | |
| 285 EXPECT_EQ("a", results()->at(1)->GetMimeType()); | |
| 286 } | |
| 287 | |
| 288 TEST_F(DownloadQueryTest, DownloadQuerySortPaused) { | |
| 289 CreateMocks(2); | |
| 290 EXPECT_CALL(mock(0), IsPaused()).WillRepeatedly(Return(true)); | |
| 291 EXPECT_CALL(mock(1), IsPaused()).WillRepeatedly(Return(false)); | |
| 292 query()->AddSorter( | |
| 293 DownloadQuery::SORT_PAUSED, DownloadQuery::ASCENDING); | |
| 294 Search(); | |
| 295 EXPECT_EQ(false, results()->at(0)->IsPaused()); | |
| 296 EXPECT_EQ(true, results()->at(1)->IsPaused()); | |
| 297 } | |
| 298 | |
| 299 TEST_F(DownloadQueryTest, DownloadQuerySortStartTime) { | |
| 300 CreateMocks(2); | |
| 301 EXPECT_CALL(mock(0), GetStartTime()).WillRepeatedly(Return( | |
| 302 base::Time::FromTimeT(0))); | |
| 303 EXPECT_CALL(mock(1), GetStartTime()).WillRepeatedly(Return( | |
| 304 base::Time::FromTimeT(1))); | |
| 305 query()->AddSorter( | |
| 306 DownloadQuery::SORT_START_TIME, DownloadQuery::DESCENDING); | |
| 307 Search(); | |
| 308 EXPECT_EQ(base::Time::FromTimeT(1), results()->at(0)->GetStartTime()); | |
| 309 EXPECT_EQ(base::Time::FromTimeT(0), results()->at(1)->GetStartTime()); | |
| 310 } | |
| 311 | |
| 312 TEST_F(DownloadQueryTest, DownloadQuerySortState) { | |
| 313 CreateMocks(2); | |
| 314 EXPECT_CALL(mock(0), GetState()).WillRepeatedly(Return( | |
| 315 DownloadItem::IN_PROGRESS)); | |
| 316 EXPECT_CALL(mock(1), GetState()).WillRepeatedly(Return( | |
| 317 DownloadItem::COMPLETE)); | |
| 318 query()->AddSorter( | |
| 319 DownloadQuery::SORT_STATE, DownloadQuery::ASCENDING); | |
| 320 Search(); | |
| 321 EXPECT_EQ(DownloadItem::IN_PROGRESS, results()->at(0)->GetState()); | |
| 322 EXPECT_EQ(DownloadItem::COMPLETE, results()->at(1)->GetState()); | |
| 323 } | |
| 324 | |
| 325 TEST_F(DownloadQueryTest, DownloadQuerySortTotalBytes) { | |
| 326 CreateMocks(2); | |
| 327 EXPECT_CALL(mock(0), GetTotalBytes()).WillRepeatedly(Return(0)); | |
| 328 EXPECT_CALL(mock(1), GetTotalBytes()).WillRepeatedly(Return(1)); | |
| 329 query()->AddSorter( | |
| 330 DownloadQuery::SORT_TOTAL_BYTES, DownloadQuery::DESCENDING); | |
| 331 Search(); | |
| 332 EXPECT_EQ(1, results()->at(0)->GetTotalBytes()); | |
| 333 EXPECT_EQ(0, results()->at(1)->GetTotalBytes()); | |
| 334 } | |
| 335 | |
| 336 TEST_F(DownloadQueryTest, DownloadQuerySortUrl) { | |
| 337 CreateMocks(2); | |
| 338 GURL a_url("http://example.com/a"); | |
| 339 GURL b_url("http://example.com/b"); | |
| 340 EXPECT_CALL(mock(0), GetOriginalUrl()).WillRepeatedly(ReturnRef(b_url)); | |
| 341 EXPECT_CALL(mock(1), GetOriginalUrl()).WillRepeatedly(ReturnRef(a_url)); | |
| 342 query()->AddSorter( | |
| 343 DownloadQuery::SORT_URL, DownloadQuery::ASCENDING); | |
| 344 Search(); | |
| 345 EXPECT_EQ(a_url, results()->at(0)->GetOriginalUrl()); | |
| 346 EXPECT_EQ(b_url, results()->at(1)->GetOriginalUrl()); | |
| 347 } | |
| 348 | |
| 349 TEST_F(DownloadQueryTest, DownloadQuerySortId) { | |
| 350 CreateMocks(2); | |
| 351 EXPECT_CALL(mock(0), GetReceivedBytes()).WillRepeatedly(Return(0)); | |
| 352 EXPECT_CALL(mock(1), GetReceivedBytes()).WillRepeatedly(Return(0)); | |
| 353 EXPECT_CALL(mock(0), GetId()).WillRepeatedly(Return(1)); | |
| 354 EXPECT_CALL(mock(1), GetId()).WillRepeatedly(Return(0)); | |
| 355 query()->AddSorter( | |
| 356 DownloadQuery::SORT_BYTES_RECEIVED, DownloadQuery::DESCENDING); | |
| 357 Search(); | |
| 358 EXPECT_EQ(0, results()->at(0)->GetId()); | |
| 359 EXPECT_EQ(1, results()->at(1)->GetId()); | |
| 360 } | |
| 361 | |
| 362 TEST_F(DownloadQueryTest, DownloadQuerySortDbHandle) { | |
| 363 CreateMocks(2); | |
| 364 EXPECT_CALL(mock(0), GetReceivedBytes()).WillRepeatedly(Return(0)); | |
| 365 EXPECT_CALL(mock(1), GetReceivedBytes()).WillRepeatedly(Return(0)); | |
| 366 EXPECT_CALL(mock(0), GetId()).WillRepeatedly(Return(0)); | |
| 367 EXPECT_CALL(mock(1), GetId()).WillRepeatedly(Return(0)); | |
|
Randy Smith (Not in Mondays)
2011/12/12 18:17:54
Having the same id makes me nervous--we don't diff
benjhayden
2011/12/12 19:52:10
Sorting by id doesn't kick in unless all the sorte
| |
| 368 EXPECT_CALL(mock(0), GetDbHandle()).WillRepeatedly(Return(1)); | |
| 369 EXPECT_CALL(mock(1), GetDbHandle()).WillRepeatedly(Return(0)); | |
| 370 query()->AddSorter( | |
| 371 DownloadQuery::SORT_BYTES_RECEIVED, DownloadQuery::DESCENDING); | |
| 372 Search(); | |
| 373 EXPECT_EQ(0, results()->at(0)->GetDbHandle()); | |
| 374 EXPECT_EQ(1, results()->at(1)->GetDbHandle()); | |
| 375 } | |
| 376 | |
| 377 TEST_F(DownloadQueryTest, DownloadQueryFilterPerformance) { | |
| 378 static const int kNumItems = 10000; | |
| 379 static const int kNumFilters = 1000; | |
| 380 CreateMocks(kNumItems); | |
| 381 for (size_t i = 0; i < (kNumFilters - 1); ++i) { | |
| 382 query()->AddFilter(base::Bind(&AlwaysReturn, true)); | |
| 383 } | |
| 384 query()->AddFilter(base::Bind(&AlwaysReturn, false)); | |
| 385 base::Time start = base::Time::Now(); | |
| 386 Search(); | |
| 387 base::Time end = base::Time::Now(); | |
| 388 double nanos = (end - start).InMillisecondsF() * 1000.0 * 1000.0; | |
| 389 double nanos_per_item = nanos / static_cast<double>(kNumItems); | |
| 390 double nanos_per_item_per_filter = nanos_per_item | |
| 391 / static_cast<double>(kNumFilters); | |
| 392 std::cout << "Search took " << nanos_per_item_per_filter | |
| 393 << " nanoseconds per item per filter.\n"; | |
| 394 } | |
| OLD | NEW |