mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
02e07b974c
r=dietrich
685 lines
25 KiB
C++
685 lines
25 KiB
C++
/* vim: sw=2 ts=2 et lcs=trail\:.,tab\:>~ :
|
|
* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is Places code.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* the Mozilla Foundation.
|
|
* Portions created by the Initial Developer are Copyright (C) 2009
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
* Shawn Wilsher <me@shawnwilsher.com> (Original Author)
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
#include "mozilla/storage.h"
|
|
#include "nsString.h"
|
|
#include "nsUnicharUtils.h"
|
|
#include "nsWhitespaceTokenizer.h"
|
|
#include "nsEscape.h"
|
|
#include "mozIPlacesAutoComplete.h"
|
|
#include "SQLFunctions.h"
|
|
#include "nsMathUtils.h"
|
|
#include "nsUTF8Utils.h"
|
|
#include "nsINavHistoryService.h"
|
|
#include "nsPrintfCString.h"
|
|
#include "nsNavHistory.h"
|
|
#if defined(XP_OS2)
|
|
#include "nsIRandomGenerator.h"
|
|
#endif
|
|
using namespace mozilla::storage;
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
//// Anonymous Helpers
|
|
|
|
namespace {
|
|
|
|
typedef nsACString::const_char_iterator const_char_iterator;
|
|
|
|
/**
|
|
* Get a pointer to the word boundary after aStart if aStart points to an
|
|
* ASCII letter (i.e. [a-zA-Z]). Otherwise, return aNext, which we assume
|
|
* points to the next character in the UTF-8 sequence.
|
|
*
|
|
* We define a word boundary as anything that's not [a-z] -- this lets us
|
|
* match CamelCase words.
|
|
*
|
|
* @param aStart the beginning of the UTF-8 sequence
|
|
* @param aNext the next character in the sequence
|
|
* @param aEnd the first byte which is not part of the sequence
|
|
*
|
|
* @return a pointer to the next word boundary after aStart
|
|
*/
|
|
static
|
|
NS_ALWAYS_INLINE const_char_iterator
|
|
nextWordBoundary(const_char_iterator const aStart,
|
|
const_char_iterator const aNext,
|
|
const_char_iterator const aEnd) {
|
|
|
|
const_char_iterator cur = aStart;
|
|
if (('a' <= *cur && *cur <= 'z') ||
|
|
('A' <= *cur && *cur <= 'Z')) {
|
|
|
|
// Since we'll halt as soon as we see a non-ASCII letter, we can do a
|
|
// simple byte-by-byte comparison here and avoid the overhead of a
|
|
// UTF8CharEnumerator.
|
|
do {
|
|
cur++;
|
|
} while (cur < aEnd && 'a' <= *cur && *cur <= 'z');
|
|
}
|
|
else {
|
|
cur = aNext;
|
|
}
|
|
|
|
return cur;
|
|
}
|
|
|
|
enum FindInStringBehavior {
|
|
eFindOnBoundary,
|
|
eFindAnywhere
|
|
};
|
|
|
|
/**
|
|
* findAnywhere and findOnBoundary do almost the same thing, so it's natural
|
|
* to implement them in terms of a single function. They're both
|
|
* performance-critical functions, however, and checking aBehavior makes them
|
|
* a bit slower. Our solution is to define findInString as NS_ALWAYS_INLINE
|
|
* and rely on the compiler to optimize out the aBehavior check.
|
|
*
|
|
* @param aToken
|
|
* The token we're searching for
|
|
* @param aSourceString
|
|
* The string in which we're searching
|
|
* @param aBehavior
|
|
* eFindOnBoundary if we should only consider matchines which occur on
|
|
* word boundaries, or eFindAnywhere if we should consider matches
|
|
* which appear anywhere.
|
|
*
|
|
* @return true if aToken was found in aSourceString, false otherwise.
|
|
*/
|
|
static
|
|
NS_ALWAYS_INLINE bool
|
|
findInString(const nsDependentCSubstring &aToken,
|
|
const nsACString &aSourceString,
|
|
FindInStringBehavior aBehavior)
|
|
{
|
|
// CaseInsensitiveUTF8CharsEqual assumes that there's at least one byte in
|
|
// the both strings, so don't pass an empty token here.
|
|
NS_PRECONDITION(!aToken.IsEmpty(), "Don't search for an empty token!");
|
|
|
|
// We cannot match anything if there is nothing to search.
|
|
if (aSourceString.IsEmpty()) {
|
|
return false;
|
|
}
|
|
|
|
const_char_iterator tokenStart(aToken.BeginReading()),
|
|
tokenEnd(aToken.EndReading()),
|
|
sourceStart(aSourceString.BeginReading()),
|
|
sourceEnd(aSourceString.EndReading());
|
|
|
|
do {
|
|
// We are on a word boundary (if aBehavior == eFindOnBoundary). See if
|
|
// aToken matches sourceStart.
|
|
|
|
// Check whether the first character in the token matches the character
|
|
// at sourceStart. At the same time, get a pointer to the next character
|
|
// in both the token and the source.
|
|
const_char_iterator sourceNext, tokenCur;
|
|
PRBool error;
|
|
if (CaseInsensitiveUTF8CharsEqual(sourceStart, tokenStart,
|
|
sourceEnd, tokenEnd,
|
|
&sourceNext, &tokenCur, &error)) {
|
|
|
|
// We don't need to check |error| here -- if
|
|
// CaseInsensitiveUTF8CharCompare encounters an error, it'll also
|
|
// return false and we'll catch the error outside the if.
|
|
|
|
const_char_iterator sourceCur = sourceNext;
|
|
while (true) {
|
|
if (tokenCur >= tokenEnd) {
|
|
// We matched the whole token!
|
|
return true;
|
|
}
|
|
|
|
if (sourceCur >= sourceEnd) {
|
|
// We ran into the end of source while matching a token. This
|
|
// means we'll never find the token we're looking for.
|
|
return false;
|
|
}
|
|
|
|
if (!CaseInsensitiveUTF8CharsEqual(sourceCur, tokenCur,
|
|
sourceEnd, tokenEnd,
|
|
&sourceCur, &tokenCur, &error)) {
|
|
// sourceCur doesn't match tokenCur (or there's an error), so break
|
|
// out of this loop.
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
// If something went wrong above, get out of here!
|
|
if (NS_UNLIKELY(error)) {
|
|
return false;
|
|
}
|
|
|
|
// We didn't match the token. If we're searching for matches on word
|
|
// boundaries, skip to the next word boundary. Otherwise, advance
|
|
// forward one character, using the sourceNext pointer we saved earlier.
|
|
|
|
if (aBehavior == eFindOnBoundary) {
|
|
sourceStart = nextWordBoundary(sourceStart, sourceNext, sourceEnd);
|
|
}
|
|
else {
|
|
sourceStart = sourceNext;
|
|
}
|
|
|
|
} while (sourceStart < sourceEnd);
|
|
|
|
return false;
|
|
}
|
|
|
|
} // End anonymous namespace
|
|
|
|
namespace mozilla {
|
|
namespace places {
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
//// AutoComplete Matching Function
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//// MatchAutoCompleteFunction
|
|
|
|
/* static */
|
|
nsresult
|
|
MatchAutoCompleteFunction::create(mozIStorageConnection *aDBConn)
|
|
{
|
|
nsRefPtr<MatchAutoCompleteFunction> function =
|
|
new MatchAutoCompleteFunction();
|
|
|
|
nsresult rv = aDBConn->CreateFunction(
|
|
NS_LITERAL_CSTRING("autocomplete_match"), kArgIndexLength, function
|
|
);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
/* static */
|
|
void
|
|
MatchAutoCompleteFunction::fixupURISpec(const nsCString &aURISpec,
|
|
PRInt32 aMatchBehavior,
|
|
nsCString &_fixedSpec)
|
|
{
|
|
nsCString unescapedSpec;
|
|
(void)NS_UnescapeURL(aURISpec, esc_SkipControl | esc_AlwaysCopy,
|
|
unescapedSpec);
|
|
|
|
// If this unescaped string is valid UTF-8, we'll use it. Otherwise,
|
|
// we will simply use our original string.
|
|
NS_ASSERTION(_fixedSpec.IsEmpty(),
|
|
"Passing a non-empty string as an out parameter!");
|
|
if (IsUTF8(unescapedSpec))
|
|
_fixedSpec.Assign(unescapedSpec);
|
|
else
|
|
_fixedSpec.Assign(aURISpec);
|
|
|
|
if (aMatchBehavior == mozIPlacesAutoComplete::MATCH_ANYWHERE_UNMODIFIED)
|
|
return;
|
|
|
|
if (StringBeginsWith(_fixedSpec, NS_LITERAL_CSTRING("http://")))
|
|
_fixedSpec.Cut(0, 7);
|
|
else if (StringBeginsWith(_fixedSpec, NS_LITERAL_CSTRING("https://")))
|
|
_fixedSpec.Cut(0, 8);
|
|
else if (StringBeginsWith(_fixedSpec, NS_LITERAL_CSTRING("ftp://")))
|
|
_fixedSpec.Cut(0, 6);
|
|
|
|
if (StringBeginsWith(_fixedSpec, NS_LITERAL_CSTRING("www.")))
|
|
_fixedSpec.Cut(0, 4);
|
|
}
|
|
|
|
/* static */
|
|
bool
|
|
MatchAutoCompleteFunction::findAnywhere(const nsDependentCSubstring &aToken,
|
|
const nsACString &aSourceString)
|
|
{
|
|
// We can't use FindInReadable here; it works only for ASCII.
|
|
|
|
return findInString(aToken, aSourceString, eFindAnywhere);
|
|
}
|
|
|
|
/* static */
|
|
bool
|
|
MatchAutoCompleteFunction::findOnBoundary(const nsDependentCSubstring &aToken,
|
|
const nsACString &aSourceString)
|
|
{
|
|
return findInString(aToken, aSourceString, eFindOnBoundary);
|
|
}
|
|
|
|
/* static */
|
|
bool
|
|
MatchAutoCompleteFunction::findBeginning(const nsDependentCSubstring &aToken,
|
|
const nsACString &aSourceString)
|
|
{
|
|
NS_PRECONDITION(!aToken.IsEmpty(), "Don't search for an empty token!");
|
|
|
|
// We can't use StringBeginsWith here, unfortunately. Although it will
|
|
// happily take a case-insensitive UTF8 comparator, it eventually calls
|
|
// nsACString::Equals, which checks that the two strings contain the same
|
|
// number of bytes before calling the comparator. Two characters may be
|
|
// case-insensitively equal while taking up different numbers of bytes, so
|
|
// this is not what we want.
|
|
|
|
const_char_iterator tokenStart(aToken.BeginReading()),
|
|
tokenEnd(aToken.EndReading()),
|
|
sourceStart(aSourceString.BeginReading()),
|
|
sourceEnd(aSourceString.EndReading());
|
|
|
|
PRBool dummy;
|
|
while (sourceStart < sourceEnd &&
|
|
CaseInsensitiveUTF8CharsEqual(sourceStart, tokenStart,
|
|
sourceEnd, tokenEnd,
|
|
&sourceStart, &tokenStart, &dummy)) {
|
|
|
|
// We found the token!
|
|
if (tokenStart >= tokenEnd) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
// We don't need to check CaseInsensitiveUTF8CharsEqual's error condition
|
|
// (stored in |dummy|), since the function will return false if it
|
|
// encounters an error.
|
|
|
|
return false;
|
|
}
|
|
|
|
/* static */
|
|
MatchAutoCompleteFunction::searchFunctionPtr
|
|
MatchAutoCompleteFunction::getSearchFunction(PRInt32 aBehavior)
|
|
{
|
|
switch (aBehavior) {
|
|
case mozIPlacesAutoComplete::MATCH_ANYWHERE:
|
|
case mozIPlacesAutoComplete::MATCH_ANYWHERE_UNMODIFIED:
|
|
return findAnywhere;
|
|
case mozIPlacesAutoComplete::MATCH_BEGINNING:
|
|
return findBeginning;
|
|
case mozIPlacesAutoComplete::MATCH_BOUNDARY:
|
|
default:
|
|
return findOnBoundary;
|
|
};
|
|
}
|
|
|
|
NS_IMPL_THREADSAFE_ISUPPORTS1(
|
|
MatchAutoCompleteFunction,
|
|
mozIStorageFunction
|
|
)
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//// mozIStorageFunction
|
|
|
|
NS_IMETHODIMP
|
|
MatchAutoCompleteFunction::OnFunctionCall(mozIStorageValueArray *aArguments,
|
|
nsIVariant **_result)
|
|
{
|
|
// Macro to make the code a bit cleaner and easier to read. Operates on
|
|
// searchBehavior.
|
|
PRInt32 searchBehavior = aArguments->AsInt32(kArgIndexSearchBehavior);
|
|
#define HAS_BEHAVIOR(aBitName) \
|
|
(searchBehavior & mozIPlacesAutoComplete::BEHAVIOR_##aBitName)
|
|
|
|
nsCAutoString searchString;
|
|
(void)aArguments->GetUTF8String(kArgSearchString, searchString);
|
|
nsCString url;
|
|
(void)aArguments->GetUTF8String(kArgIndexURL, url);
|
|
|
|
PRInt32 matchBehavior = aArguments->AsInt32(kArgIndexMatchBehavior);
|
|
|
|
// We only want to filter javascript: URLs if we are not supposed to search
|
|
// for them, and the search does not start with "javascript:".
|
|
if (matchBehavior != mozIPlacesAutoComplete::MATCH_ANYWHERE_UNMODIFIED &&
|
|
!HAS_BEHAVIOR(JAVASCRIPT) &&
|
|
!StringBeginsWith(searchString, NS_LITERAL_CSTRING("javascript:")) &&
|
|
StringBeginsWith(url, NS_LITERAL_CSTRING("javascript:"))) {
|
|
NS_ADDREF(*_result = new IntegerVariant(0));
|
|
return NS_OK;
|
|
}
|
|
|
|
PRInt32 visitCount = aArguments->AsInt32(kArgIndexVisitCount);
|
|
bool typed = aArguments->AsInt32(kArgIndexTyped) ? true : false;
|
|
bool bookmark = aArguments->AsInt32(kArgIndexBookmark) ? true : false;
|
|
nsCAutoString tags;
|
|
(void)aArguments->GetUTF8String(kArgIndexTags, tags);
|
|
PRInt32 openPageCount = aArguments->AsInt32(kArgIndexOpenPageCount);
|
|
|
|
// Make sure we match all the filter requirements. If a given restriction
|
|
// is active, make sure the corresponding condition is not true.
|
|
bool matches = !(
|
|
(HAS_BEHAVIOR(HISTORY) && visitCount == 0) ||
|
|
(HAS_BEHAVIOR(TYPED) && !typed) ||
|
|
(HAS_BEHAVIOR(BOOKMARK) && !bookmark) ||
|
|
(HAS_BEHAVIOR(TAG) && tags.IsVoid()) ||
|
|
(HAS_BEHAVIOR(OPENPAGE) && openPageCount == 0)
|
|
);
|
|
if (!matches) {
|
|
NS_ADDREF(*_result = new IntegerVariant(0));
|
|
return NS_OK;
|
|
}
|
|
|
|
// Obtain our search function.
|
|
searchFunctionPtr searchFunction = getSearchFunction(matchBehavior);
|
|
|
|
// Clean up our URI spec and prepare it for searching.
|
|
nsCString fixedURI;
|
|
fixupURISpec(url, matchBehavior, fixedURI);
|
|
|
|
nsCAutoString title;
|
|
(void)aArguments->GetUTF8String(kArgIndexTitle, title);
|
|
|
|
// Determine if every token matches either the bookmark title, tags, page
|
|
// title, or page URL.
|
|
nsCWhitespaceTokenizer tokenizer(searchString);
|
|
while (matches && tokenizer.hasMoreTokens()) {
|
|
const nsDependentCSubstring &token = tokenizer.nextToken();
|
|
|
|
if (HAS_BEHAVIOR(TITLE) && HAS_BEHAVIOR(URL)) {
|
|
matches = (searchFunction(token, title) || searchFunction(token, tags)) &&
|
|
searchFunction(token, fixedURI);
|
|
}
|
|
else if (HAS_BEHAVIOR(TITLE)) {
|
|
matches = searchFunction(token, title) || searchFunction(token, tags);
|
|
}
|
|
else if (HAS_BEHAVIOR(URL)) {
|
|
matches = searchFunction(token, fixedURI);
|
|
}
|
|
else {
|
|
matches = searchFunction(token, title) ||
|
|
searchFunction(token, tags) ||
|
|
searchFunction(token, fixedURI);
|
|
}
|
|
}
|
|
|
|
NS_ADDREF(*_result = new IntegerVariant(matches ? 1 : 0));
|
|
return NS_OK;
|
|
#undef HAS_BEHAVIOR
|
|
}
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
//// Frecency Calculation Function
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//// CalculateFrecencyFunction
|
|
|
|
/* static */
|
|
nsresult
|
|
CalculateFrecencyFunction::create(mozIStorageConnection *aDBConn)
|
|
{
|
|
nsCOMPtr<CalculateFrecencyFunction> function =
|
|
new CalculateFrecencyFunction();
|
|
|
|
nsresult rv = aDBConn->CreateFunction(
|
|
NS_LITERAL_CSTRING("calculate_frecency"), 1, function
|
|
);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMPL_THREADSAFE_ISUPPORTS1(
|
|
CalculateFrecencyFunction,
|
|
mozIStorageFunction
|
|
)
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//// mozIStorageFunction
|
|
|
|
NS_IMETHODIMP
|
|
CalculateFrecencyFunction::OnFunctionCall(mozIStorageValueArray *aArguments,
|
|
nsIVariant **_result)
|
|
{
|
|
// Fetch arguments. Use default values if they were omitted.
|
|
PRUint32 numEntries;
|
|
nsresult rv = aArguments->GetNumEntries(&numEntries);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
NS_ASSERTION(numEntries > 0, "unexpected number of arguments");
|
|
|
|
PRInt64 pageId = aArguments->AsInt64(0);
|
|
PRInt32 typed = numEntries > 1 ? aArguments->AsInt32(1) : 0;
|
|
PRInt32 fullVisitCount = numEntries > 2 ? aArguments->AsInt32(2) : 0;
|
|
PRInt64 bookmarkId = numEntries > 3 ? aArguments->AsInt64(3) : 0;
|
|
PRInt32 visitCount = 0;
|
|
PRInt32 hidden = 0;
|
|
PRInt32 isQuery = 0;
|
|
float pointsForSampledVisits = 0.0;
|
|
|
|
// This is a const version of the history object for thread-safety.
|
|
const nsNavHistory* history = nsNavHistory::GetConstHistoryService();
|
|
NS_ENSURE_TRUE(history, NS_ERROR_OUT_OF_MEMORY);
|
|
|
|
if (pageId > 0) {
|
|
// The page is already in the database, and we can fetch current
|
|
// params from the database.
|
|
nsCOMPtr<mozIStorageStatement> getPageInfo =
|
|
history->GetStatementByStoragePool(
|
|
"SELECT typed, hidden, visit_count, "
|
|
"(SELECT count(*) FROM moz_historyvisits WHERE place_id = :page_id), "
|
|
"EXISTS ( "
|
|
"SELECT 1 FROM moz_bookmarks "
|
|
"WHERE fk = :page_id "
|
|
"AND NOT EXISTS( "
|
|
"SELECT 1 "
|
|
"FROM moz_items_annos a "
|
|
"JOIN moz_anno_attributes n ON a.anno_attribute_id = n.id "
|
|
"WHERE n.name = :anno_name "
|
|
"AND a.item_id = parent "
|
|
") "
|
|
"), "
|
|
"(url > 'place:' AND url < 'place;') "
|
|
"FROM moz_places "
|
|
"WHERE id = :page_id ");
|
|
NS_ENSURE_STATE(getPageInfo);
|
|
mozStorageStatementScoper infoScoper(getPageInfo);
|
|
|
|
rv = getPageInfo->BindInt64ByName(NS_LITERAL_CSTRING("page_id"), pageId);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
rv = getPageInfo->BindUTF8StringByName(NS_LITERAL_CSTRING("anno_name"),
|
|
NS_LITERAL_CSTRING("livemark/feedURI"));
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
PRBool hasResult;
|
|
rv = getPageInfo->ExecuteStep(&hasResult);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
NS_ENSURE_TRUE(hasResult, NS_ERROR_UNEXPECTED);
|
|
rv = getPageInfo->GetInt32(0, &typed);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
rv = getPageInfo->GetInt32(1, &hidden);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
rv = getPageInfo->GetInt32(2, &visitCount);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
rv = getPageInfo->GetInt32(3, &fullVisitCount);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
rv = getPageInfo->GetInt64(4, &bookmarkId);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
rv = getPageInfo->GetInt32(5, &isQuery);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
// NOTE: This is not limited to visits with "visit_type NOT IN (0,4,7,8)"
|
|
// because otherwise it would not return any visit for those transitions
|
|
// causing an incorrect frecency, see CalculateFrecencyInternal().
|
|
// In case of a temporary or permanent redirect, calculate the frecency
|
|
// as if the original page was visited.
|
|
nsCAutoString visitsForFrecencySQL(NS_LITERAL_CSTRING(
|
|
"/* do not warn (bug 659740 - SQLite may ignore index if few visits exist) */"
|
|
"SELECT "
|
|
"ROUND((strftime('%s','now','localtime','utc') - v.visit_date/1000000)/86400), "
|
|
"IFNULL(r.visit_type, v.visit_type), "
|
|
"v.visit_date "
|
|
"FROM moz_historyvisits v "
|
|
"LEFT JOIN moz_historyvisits r ON r.id = v.from_visit AND v.visit_type BETWEEN "
|
|
) + nsPrintfCString("%d AND %d ", nsINavHistoryService::TRANSITION_REDIRECT_PERMANENT,
|
|
nsINavHistoryService::TRANSITION_REDIRECT_TEMPORARY) +
|
|
NS_LITERAL_CSTRING("WHERE v.place_id = :page_id "
|
|
"ORDER BY v.visit_date DESC ")
|
|
);
|
|
|
|
// Get a sample of the last visits to the page, to calculate its weight.
|
|
nsCOMPtr<mozIStorageStatement> getVisits =
|
|
history->GetStatementByStoragePool(visitsForFrecencySQL);
|
|
NS_ENSURE_STATE(getVisits);
|
|
mozStorageStatementScoper visitsScoper(getVisits);
|
|
|
|
rv = getVisits->BindInt64ByName(NS_LITERAL_CSTRING("page_id"), pageId);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
// Fetch only a limited number of recent visits.
|
|
PRInt32 numSampledVisits = 0;
|
|
for (PRInt32 maxVisits = history->GetNumVisitsForFrecency();
|
|
numSampledVisits < maxVisits &&
|
|
NS_SUCCEEDED(getVisits->ExecuteStep(&hasResult)) && hasResult;
|
|
numSampledVisits++) {
|
|
PRInt32 visitType;
|
|
rv = getVisits->GetInt32(1, &visitType);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
PRInt32 bonus = history->GetFrecencyTransitionBonus(visitType, true);
|
|
|
|
// Always add the bookmark visit bonus.
|
|
if (bookmarkId) {
|
|
bonus += history->GetFrecencyTransitionBonus(nsINavHistoryService::TRANSITION_BOOKMARK, true);
|
|
}
|
|
|
|
// If bonus was zero, we can skip the work to determine the weight.
|
|
if (bonus) {
|
|
PRInt32 ageInDays = getVisits->AsInt32(0);
|
|
PRInt32 weight = history->GetFrecencyAgedWeight(ageInDays);
|
|
pointsForSampledVisits += (float)(weight * (bonus / 100.0));
|
|
}
|
|
}
|
|
|
|
// If we found some visits for this page, use the calculated weight.
|
|
if (numSampledVisits) {
|
|
// fix for bug #412219
|
|
if (!pointsForSampledVisits) {
|
|
// For URIs with zero points in the sampled recent visits
|
|
// but "browsing" type visits outside the sampling range, set
|
|
// frecency to -visit_count, so they're still shown in autocomplete.
|
|
NS_ADDREF(*_result = new IntegerVariant(-visitCount));
|
|
}
|
|
else {
|
|
// Estimate frecency using the last few visits.
|
|
// Use NS_ceilf() so that we don't round down to 0, which
|
|
// would cause us to completely ignore the place during autocomplete.
|
|
NS_ADDREF(*_result = new IntegerVariant((PRInt32) NS_ceilf(fullVisitCount * NS_ceilf(pointsForSampledVisits) / numSampledVisits)));
|
|
}
|
|
|
|
return NS_OK;
|
|
}
|
|
}
|
|
|
|
// This page is unknown or has no visits. It could have just been added, so
|
|
// use passed in or default values.
|
|
|
|
// The code below works well for guessing the frecency on import, and we'll
|
|
// correct later once we have visits.
|
|
// TODO: What if we don't have visits and we never visit? We could end up
|
|
// with a really high value that keeps coming up in ac results? Should we
|
|
// only do this on import? Have to figure it out.
|
|
PRInt32 bonus = 0;
|
|
|
|
// Make it so something bookmarked and typed will have a higher frecency
|
|
// than something just typed or just bookmarked.
|
|
if (bookmarkId && !isQuery) {
|
|
bonus += history->GetFrecencyTransitionBonus(nsINavHistoryService::TRANSITION_BOOKMARK, false);;
|
|
// For unvisited bookmarks, produce a non-zero frecency, so that they show
|
|
// up in URL bar autocomplete.
|
|
fullVisitCount = 1;
|
|
}
|
|
|
|
if (typed) {
|
|
bonus += history->GetFrecencyTransitionBonus(nsINavHistoryService::TRANSITION_TYPED, false);
|
|
}
|
|
|
|
// Assume "now" as our ageInDays, so use the first bucket.
|
|
pointsForSampledVisits = history->GetFrecencyBucketWeight(1) * (bonus / (float)100.0);
|
|
|
|
// use NS_ceilf() so that we don't round down to 0, which
|
|
// would cause us to completely ignore the place during autocomplete
|
|
NS_ADDREF(*_result = new IntegerVariant((PRInt32) NS_ceilf(fullVisitCount * NS_ceilf(pointsForSampledVisits))));
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
//// GUID Creation Function
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//// GenerateGUIDFunction
|
|
|
|
/* static */
|
|
nsresult
|
|
GenerateGUIDFunction::create(mozIStorageConnection *aDBConn)
|
|
{
|
|
#if defined(XP_OS2)
|
|
// We need this service to be initialized on the main thread because it is
|
|
// not threadsafe. We are about to use it asynchronously, so initialize it
|
|
// now.
|
|
nsCOMPtr<nsIRandomGenerator> rg =
|
|
do_GetService("@mozilla.org/security/random-generator;1");
|
|
NS_ENSURE_STATE(rg);
|
|
#endif
|
|
|
|
nsCOMPtr<GenerateGUIDFunction> function = new GenerateGUIDFunction();
|
|
nsresult rv = aDBConn->CreateFunction(
|
|
NS_LITERAL_CSTRING("generate_guid"), 0, function
|
|
);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMPL_THREADSAFE_ISUPPORTS1(
|
|
GenerateGUIDFunction,
|
|
mozIStorageFunction
|
|
)
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//// mozIStorageFunction
|
|
|
|
NS_IMETHODIMP
|
|
GenerateGUIDFunction::OnFunctionCall(mozIStorageValueArray *aArguments,
|
|
nsIVariant **_result)
|
|
{
|
|
nsCAutoString guid;
|
|
nsresult rv = GenerateGUID(guid);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
NS_ADDREF(*_result = new UTF8TextVariant(guid));
|
|
return NS_OK;
|
|
}
|
|
|
|
} // namespace places
|
|
} // namespace mozilla
|