forked from mirrors/gecko-dev
e368dc9c85
This patch was generated by a script. Here's the source of the script for
future reference:
function convert() {
echo "Converting $1 to $2..."
find . ! -wholename "*nsprpub*" \
! -wholename "*security/nss*" \
! -wholename "*/.hg*" \
! -wholename "obj-ff-dbg*" \
! -name nsXPCOMCID.h \
! -name prtypes.h \
-type f \
\( -iname "*.cpp" \
-o -iname "*.h" \
-o -iname "*.c" \
-o -iname "*.cc" \
-o -iname "*.idl" \
-o -iname "*.ipdl" \
-o -iname "*.ipdlh" \
-o -iname "*.mm" \) | \
xargs -n 1 sed -i -e "s/\b$1\b/$2/g"
}
convert PRInt8 int8_t
convert PRUint8 uint8_t
convert PRInt16 int16_t
convert PRUint16 uint16_t
convert PRInt32 int32_t
convert PRUint32 uint32_t
convert PRInt64 int64_t
convert PRUint64 uint64_t
convert PRIntn int
convert PRUintn unsigned
convert PRSize size_t
convert PROffset32 int32_t
convert PROffset64 int64_t
convert PRPtrdiff ptrdiff_t
convert PRFloat64 double
98 lines
2.8 KiB
C++
98 lines
2.8 KiB
C++
//* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
#ifndef Classifier_h__
|
|
#define Classifier_h__
|
|
|
|
#include "Entries.h"
|
|
#include "HashStore.h"
|
|
#include "ProtocolParser.h"
|
|
#include "LookupCache.h"
|
|
#include "nsCOMPtr.h"
|
|
#include "nsString.h"
|
|
#include "nsIFile.h"
|
|
#include "nsICryptoHash.h"
|
|
#include "nsDataHashtable.h"
|
|
|
|
namespace mozilla {
|
|
namespace safebrowsing {
|
|
|
|
/**
|
|
* Maintains the stores and LookupCaches for the url classifier.
|
|
*/
|
|
class Classifier {
|
|
public:
|
|
Classifier();
|
|
~Classifier();
|
|
|
|
nsresult Open(nsIFile& aCacheDirectory);
|
|
nsresult Close();
|
|
nsresult Reset();
|
|
|
|
/**
|
|
* Get the list of active tables and their chunks in a format
|
|
* suitable for an update request.
|
|
*/
|
|
void TableRequest(nsACString& aResult);
|
|
|
|
/*
|
|
* Get all tables that we know about.
|
|
*/
|
|
nsresult ActiveTables(nsTArray<nsCString>& aTables);
|
|
|
|
/**
|
|
* Check a URL against the database.
|
|
*/
|
|
nsresult Check(const nsACString& aSpec, LookupResultArray& aResults);
|
|
|
|
/**
|
|
* Apply the table updates in the array. Takes ownership of
|
|
* the updates in the array and clears it. Wacky!
|
|
*/
|
|
nsresult ApplyUpdates(nsTArray<TableUpdate*>* aUpdates);
|
|
/**
|
|
* Failed update. Spoil the entries so we don't block hosts
|
|
* unnecessarily
|
|
*/
|
|
nsresult MarkSpoiled(nsTArray<nsCString>& aTables);
|
|
nsresult CacheCompletions(const CacheResultArray& aResults);
|
|
uint32_t GetHashKey(void) { return mHashKey; };
|
|
void SetFreshTime(uint32_t aTime) { mFreshTime = aTime; };
|
|
void SetPerClientRandomize(bool aRandomize) { mPerClientRandomize = aRandomize; };
|
|
/*
|
|
* Get a bunch of extra prefixes to query for completion
|
|
* and mask the real entry being requested
|
|
*/
|
|
nsresult ReadNoiseEntries(const Prefix& aPrefix,
|
|
const nsACString& aTableName,
|
|
int32_t aCount,
|
|
PrefixArray* aNoiseEntries);
|
|
private:
|
|
void DropStores();
|
|
nsresult RegenActiveTables();
|
|
nsresult ScanStoreDir(nsTArray<nsCString>& aTables);
|
|
|
|
nsresult ApplyTableUpdates(nsTArray<TableUpdate*>* aUpdates,
|
|
const nsACString& aTable);
|
|
|
|
LookupCache *GetLookupCache(const nsACString& aTable);
|
|
nsresult InitKey();
|
|
|
|
nsCOMPtr<nsICryptoHash> mCryptoHash;
|
|
nsCOMPtr<nsIFile> mStoreDirectory;
|
|
nsTArray<HashStore*> mHashStores;
|
|
nsTArray<LookupCache*> mLookupCaches;
|
|
nsTArray<nsCString> mActiveTablesCache;
|
|
uint32_t mHashKey;
|
|
// Stores the last time a given table was updated (seconds).
|
|
nsDataHashtable<nsCStringHashKey, int64_t> mTableFreshness;
|
|
uint32_t mFreshTime;
|
|
bool mPerClientRandomize;
|
|
};
|
|
|
|
}
|
|
}
|
|
|
|
#endif
|