gecko-dev/docshell/base/BaseHistory.h
Simon Giesecke ad01a10a3b Bug 1634281 - Use nsTHashMap instead of nsDataHashtable. r=xpcom-reviewers,necko-reviewers,jgilbert,nika,valentin
Note that this patch only transforms the use of the nsDataHashtable type alias
to a directly equivalent use of nsTHashMap. It does not change the specification
of the hash key type to make use of the key class deduction that nsTHashMap
allows for in some cases. That can be done in a separate step, but requires more
attention.

Differential Revision: https://phabricator.services.mozilla.com/D106008
2021-03-10 10:47:47 +00:00

81 lines
2.7 KiB
C++

/* 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 mozilla_BaseHistory_h
#define mozilla_BaseHistory_h
#include "IHistory.h"
#include "mozilla/dom/ContentParent.h"
/* A base class for history implementations that implement link coloring. */
namespace mozilla {
class BaseHistory : public IHistory {
public:
void RegisterVisitedCallback(nsIURI*, dom::Link*) final;
void UnregisterVisitedCallback(nsIURI*, dom::Link*) final;
void NotifyVisited(nsIURI*, VisitedStatus) final;
// Some URIs like data-uris are never going to be stored in history, so we can
// avoid doing IPC roundtrips for them or what not.
static bool CanStore(nsIURI*);
protected:
void NotifyVisitedInThisProcess(nsIURI*, VisitedStatus);
void NotifyVisitedFromParent(nsIURI*, VisitedStatus);
static constexpr const size_t kTrackedUrisInitialSize = 64;
BaseHistory();
~BaseHistory();
using ObserverArray = nsTObserverArray<dom::Link*>;
struct ObservingLinks {
ObserverArray mLinks;
VisitedStatus mStatus = VisitedStatus::Unknown;
size_t SizeOfExcludingThis(MallocSizeOf aMallocSizeOf) const {
return mLinks.ShallowSizeOfExcludingThis(aMallocSizeOf);
}
};
using PendingVisitedQueries = nsTHashtable<nsURIHashKey>;
using PendingVisitedResults = nsTArray<mozilla::dom::VisitedQueryResult>;
// Starts all the queries in the pending queries list, potentially at the same
// time.
virtual void StartPendingVisitedQueries(const PendingVisitedQueries&) = 0;
private:
void ScheduleVisitedQuery(nsIURI*);
// Cancels a visited query, if it is at all possible, because we know we won't
// use the results anymore.
void CancelVisitedQueryIfPossible(nsIURI*);
void SendPendingVisitedResultsToChildProcesses();
protected:
// A map from URI to links that depend on that URI, and whether that URI is
// known-to-be-visited-or-unvisited already.
nsTHashMap<nsURIHashKey, ObservingLinks> mTrackedURIs;
private:
// The set of pending URIs that we haven't queried yet but need to.
PendingVisitedQueries mPendingQueries;
// The set of pending query results that we still haven't dispatched to child
// processes.
PendingVisitedResults mPendingResults;
// Whether we've successfully scheduled a runnable to call
// StartPendingVisitedQueries already.
bool mStartPendingVisitedQueriesScheduled = false;
// Whether we've successfully scheduled a runnable to call
// SendPendingVisitedResultsToChildProcesses already.
bool mStartPendingResultsScheduled = false;
};
} // namespace mozilla
#endif