| OLD | NEW |
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 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 "chrome/browser/history/in_memory_history_backend.h" | 5 #include "chrome/browser/history/in_memory_history_backend.h" |
| 6 | 6 |
| 7 #include <set> | 7 #include <set> |
| 8 #include <vector> | 8 #include <vector> |
| 9 | 9 |
| 10 #include "base/command_line.h" | 10 #include "base/command_line.h" |
| 11 #include "base/time.h" | 11 #include "base/time.h" |
| 12 #include "base/utf_string_conversions.h" | 12 #include "base/utf_string_conversions.h" |
| 13 #include "chrome/browser/browser_process.h" | 13 #include "chrome/browser/browser_process.h" |
| 14 #include "chrome/browser/history/history_notifications.h" | 14 #include "chrome/browser/history/history_notifications.h" |
| 15 #include "chrome/browser/history/in_memory_database.h" | 15 #include "chrome/browser/history/in_memory_database.h" |
| 16 #include "chrome/browser/history/in_memory_url_index.h" | |
| 17 #include "chrome/browser/history/url_database.h" | 16 #include "chrome/browser/history/url_database.h" |
| 18 #include "chrome/browser/profiles/profile.h" | 17 #include "chrome/browser/profiles/profile.h" |
| 19 #include "chrome/common/chrome_notification_types.h" | 18 #include "chrome/common/chrome_notification_types.h" |
| 20 #include "chrome/common/chrome_switches.h" | |
| 21 #include "content/public/browser/notification_details.h" | 19 #include "content/public/browser/notification_details.h" |
| 22 #include "content/public/browser/notification_source.h" | 20 #include "content/public/browser/notification_source.h" |
| 23 | 21 |
| 24 namespace history { | 22 namespace history { |
| 25 | 23 |
| 26 InMemoryHistoryBackend::InMemoryHistoryBackend() | 24 InMemoryHistoryBackend::InMemoryHistoryBackend() |
| 27 : profile_(NULL) { | 25 : profile_(NULL) { |
| 28 } | 26 } |
| 29 | 27 |
| 30 InMemoryHistoryBackend::~InMemoryHistoryBackend() { | 28 InMemoryHistoryBackend::~InMemoryHistoryBackend() {} |
| 31 if (index_.get()) | |
| 32 index_->ShutDown(); | |
| 33 } | |
| 34 | 29 |
| 35 bool InMemoryHistoryBackend::Init(const FilePath& history_filename, | 30 bool InMemoryHistoryBackend::Init(const FilePath& history_filename, |
| 36 const FilePath& history_dir, | 31 const FilePath& history_dir, |
| 37 URLDatabase* db, | 32 URLDatabase* db, |
| 38 const std::string& languages) { | 33 const std::string& languages) { |
| 39 db_.reset(new InMemoryDatabase); | 34 db_.reset(new InMemoryDatabase); |
| 40 bool success = db_->InitFromDisk(history_filename); | 35 return db_->InitFromDisk(history_filename); |
| 41 if (!CommandLine::ForCurrentProcess()->HasSwitch( | |
| 42 switches::kDisableHistoryQuickProvider)) { | |
| 43 index_.reset(new InMemoryURLIndex(history_dir)); | |
| 44 index_->Init(db, languages); | |
| 45 } | |
| 46 return success; | |
| 47 } | 36 } |
| 48 | 37 |
| 49 void InMemoryHistoryBackend::AttachToHistoryService(Profile* profile) { | 38 void InMemoryHistoryBackend::AttachToHistoryService(Profile* profile) { |
| 50 if (!db_.get()) { | 39 if (!db_.get()) { |
| 51 NOTREACHED(); | 40 NOTREACHED(); |
| 52 return; | 41 return; |
| 53 } | 42 } |
| 54 | 43 |
| 55 profile_ = profile; | 44 profile_ = profile; |
| 56 | 45 |
| (...skipping 67 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 124 // IDs in the main database. This sucks. Instead of Add and Remove, we should | 113 // IDs in the main database. This sucks. Instead of Add and Remove, we should |
| 125 // have Sync(), which would take the ID if it's given and add it. | 114 // have Sync(), which would take the ID if it's given and add it. |
| 126 std::vector<history::URLRow>::const_iterator i; | 115 std::vector<history::URLRow>::const_iterator i; |
| 127 for (i = details.changed_urls.begin(); | 116 for (i = details.changed_urls.begin(); |
| 128 i != details.changed_urls.end(); i++) { | 117 i != details.changed_urls.end(); i++) { |
| 129 URLID id = db_->GetRowForURL(i->url(), NULL); | 118 URLID id = db_->GetRowForURL(i->url(), NULL); |
| 130 if (id) | 119 if (id) |
| 131 db_->UpdateURLRow(id, *i); | 120 db_->UpdateURLRow(id, *i); |
| 132 else | 121 else |
| 133 id = db_->AddURL(*i); | 122 id = db_->AddURL(*i); |
| 134 if (index_.get()) | |
| 135 index_->UpdateURL(id, *i); | |
| 136 } | 123 } |
| 137 } | 124 } |
| 138 | 125 |
| 139 void InMemoryHistoryBackend::OnURLsDeleted(const URLsDeletedDetails& details) { | 126 void InMemoryHistoryBackend::OnURLsDeleted(const URLsDeletedDetails& details) { |
| 140 DCHECK(db_.get()); | 127 DCHECK(db_.get()); |
| 141 | 128 |
| 142 if (details.all_history) { | 129 if (details.all_history) { |
| 143 // When all history is deleted, the individual URLs won't be listed. Just | 130 // When all history is deleted, the individual URLs won't be listed. Just |
| 144 // create a new database to quickly clear everything out. | 131 // create a new database to quickly clear everything out. |
| 145 db_.reset(new InMemoryDatabase); | 132 db_.reset(new InMemoryDatabase); |
| 146 if (!db_->InitFromScratch()) | 133 if (!db_->InitFromScratch()) |
| 147 db_.reset(); | 134 db_.reset(); |
| 148 if (index_.get()) | |
| 149 index_->ReloadFromHistory(db_.get()); | |
| 150 return; | 135 return; |
| 151 } | 136 } |
| 152 | 137 |
| 153 // Delete all matching URLs in our database. | 138 // Delete all matching URLs in our database. |
| 154 for (std::set<GURL>::const_iterator i = details.urls.begin(); | 139 for (std::vector<URLRow>::const_iterator row = details.rows.begin(); |
| 155 i != details.urls.end(); ++i) { | 140 row != details.rows.end(); ++row) { |
| 156 URLID id = db_->GetRowForURL(*i, NULL); | 141 // We typically won't have most of them since we only have a subset of |
| 157 if (id) { | 142 // history, so ignore errors. |
| 158 // We typically won't have most of them since we only have a subset of | 143 db_->DeleteURLRow(row->id()); |
| 159 // history, so ignore errors. | |
| 160 db_->DeleteURLRow(id); | |
| 161 if (index_.get()) | |
| 162 index_->DeleteURL(id); | |
| 163 } | |
| 164 } | 144 } |
| 165 } | 145 } |
| 166 | 146 |
| 167 void InMemoryHistoryBackend::OnKeywordSearchTermUpdated( | 147 void InMemoryHistoryBackend::OnKeywordSearchTermUpdated( |
| 168 const KeywordSearchTermDetails& details) { | 148 const KeywordSearchTermDetails& details) { |
| 169 // The url won't exist for new search terms (as the user hasn't typed it), so | 149 // The url won't exist for new search terms (as the user hasn't typed it), so |
| 170 // we force it to be added. If we end up adding a URL it won't be | 150 // we force it to be added. If we end up adding a URL it won't be |
| 171 // autocompleted as the typed count is 0. | 151 // autocompleted as the typed count is 0. |
| 172 URLRow url_row; | 152 URLRow url_row; |
| 173 URLID url_id; | 153 URLID url_id; |
| (...skipping 15 matching lines...) Expand all Loading... |
| 189 | 169 |
| 190 bool InMemoryHistoryBackend::HasKeyword(const GURL& url) { | 170 bool InMemoryHistoryBackend::HasKeyword(const GURL& url) { |
| 191 URLID id = db_->GetRowForURL(url, NULL); | 171 URLID id = db_->GetRowForURL(url, NULL); |
| 192 if (!id) | 172 if (!id) |
| 193 return false; | 173 return false; |
| 194 | 174 |
| 195 return db_->GetKeywordSearchTermRow(id, NULL); | 175 return db_->GetKeywordSearchTermRow(id, NULL); |
| 196 } | 176 } |
| 197 | 177 |
| 198 } // namespace history | 178 } // namespace history |
| OLD | NEW |