OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:MemEntryImpl
(Results
1 - 14
of
14
) sorted by null
/external/chromium/net/disk_cache/
mem_rankings.h
15
class
MemEntryImpl
;
24
void Insert(
MemEntryImpl
* node);
27
void Remove(
MemEntryImpl
* node);
30
void UpdateRank(
MemEntryImpl
* node);
33
MemEntryImpl
* GetNext(
MemEntryImpl
* node);
34
MemEntryImpl
* GetPrev(
MemEntryImpl
* node);
37
MemEntryImpl
* head_;
38
MemEntryImpl
* tail_
[
all
...]
mem_rankings.cc
16
void MemRankings::Insert(
MemEntryImpl
* node) {
28
void MemRankings::Remove(
MemEntryImpl
* node) {
29
MemEntryImpl
* prev = node->prev();
30
MemEntryImpl
* next = node->next();
48
void MemRankings::UpdateRank(
MemEntryImpl
* node) {
53
MemEntryImpl
* MemRankings::GetNext(
MemEntryImpl
* node) {
60
MemEntryImpl
* MemRankings::GetPrev(
MemEntryImpl
* node) {
mem_entry_impl.h
47
class
MemEntryImpl
: public Entry {
54
explicit
MemEntryImpl
(MemBackendImpl* backend);
66
MemEntryImpl
* next() const {
70
MemEntryImpl
* prev() const {
74
void set_next(
MemEntryImpl
* next) {
78
void set_prev(
MemEntryImpl
* prev) {
117
typedef base::hash_map<int,
MemEntryImpl
*> EntryMap;
123
~
MemEntryImpl
();
146
// Performs the initialization of a
MemEntryImpl
as a child entry.
149
bool InitChildEntry(
MemEntryImpl
* parent, int child_id, net::NetLog* net_log)
[
all
...]
mem_backend_impl.h
22
class
MemEntryImpl
;
45
void InternalDoomEntry(
MemEntryImpl
* entry);
48
void UpdateRank(
MemEntryImpl
* node);
56
// Insert an
MemEntryImpl
into the ranking list. This method is only called
57
// from
MemEntryImpl
to insert child entries. The reference can be removed
59
void InsertIntoRankingList(
MemEntryImpl
* entry);
62
//
MemEntryImpl
to remove a child entry from the ranking list.
63
void RemoveFromRankingList(
MemEntryImpl
* entry);
85
typedef base::hash_map<std::string,
MemEntryImpl
*> EntryMap;
mem_entry_impl.cc
48
MemEntryImpl
::
MemEntryImpl
(MemBackendImpl* backend) {
63
bool
MemEntryImpl
::CreateEntry(const std::string& key, net::NetLog* net_log) {
78
void
MemEntryImpl
::InternalDoom() {
104
void
MemEntryImpl
::Open() {
114
bool
MemEntryImpl
::InUse() {
127
void
MemEntryImpl
::Doom() {
140
void
MemEntryImpl
::Close() {
149
std::string
MemEntryImpl
::GetKey() const {
155
Time
MemEntryImpl
::GetLastUsed() const
[
all
...]
mem_backend_impl.cc
93
void MemBackendImpl::InternalDoomEntry(
MemEntryImpl
* entry) {
95
DCHECK(entry->type() ==
MemEntryImpl
::kParentEntry);
107
void MemBackendImpl::UpdateRank(
MemEntryImpl
* node) {
122
void MemBackendImpl::InsertIntoRankingList(
MemEntryImpl
* entry) {
126
void MemBackendImpl::RemoveFromRankingList(
MemEntryImpl
* entry) {
210
MemEntryImpl
* cache_entry = new
MemEntryImpl
(this);
245
MemEntryImpl
* next = rankings_.GetNext(NULL);
251
MemEntryImpl
* node = next;
277
MemEntryImpl
* current = reinterpret_cast<MemEntryImpl*>(*iter)
[
all
...]
entry_unittest.cc
[
all
...]
/external/chromium_org/net/disk_cache/
mem_rankings.h
14
class
MemEntryImpl
;
23
void Insert(
MemEntryImpl
* node);
26
void Remove(
MemEntryImpl
* node);
29
void UpdateRank(
MemEntryImpl
* node);
32
MemEntryImpl
* GetNext(
MemEntryImpl
* node);
33
MemEntryImpl
* GetPrev(
MemEntryImpl
* node);
36
MemEntryImpl
* head_;
37
MemEntryImpl
* tail_
[
all
...]
mem_rankings.cc
16
void MemRankings::Insert(
MemEntryImpl
* node) {
28
void MemRankings::Remove(
MemEntryImpl
* node) {
29
MemEntryImpl
* prev = node->prev();
30
MemEntryImpl
* next = node->next();
48
void MemRankings::UpdateRank(
MemEntryImpl
* node) {
53
MemEntryImpl
* MemRankings::GetNext(
MemEntryImpl
* node) {
60
MemEntryImpl
* MemRankings::GetPrev(
MemEntryImpl
* node) {
mem_entry_impl.h
46
class
MemEntryImpl
: public Entry {
53
explicit
MemEntryImpl
(MemBackendImpl* backend);
65
MemEntryImpl
* next() const {
69
MemEntryImpl
* prev() const {
73
void set_next(
MemEntryImpl
* next) {
77
void set_prev(
MemEntryImpl
* prev) {
116
typedef base::hash_map<int,
MemEntryImpl
*> EntryMap;
122
virtual ~
MemEntryImpl
();
145
// Performs the initialization of a
MemEntryImpl
as a child entry.
148
bool InitChildEntry(
MemEntryImpl
* parent, int child_id, net::NetLog* net_log)
[
all
...]
mem_entry_impl.cc
46
// Returns NetLog parameters for the creation of a child
MemEntryImpl
. Separate
49
const disk_cache::
MemEntryImpl
* parent,
62
MemEntryImpl
::
MemEntryImpl
(MemBackendImpl* backend) {
77
bool
MemEntryImpl
::CreateEntry(const std::string& key, net::NetLog* net_log) {
95
void
MemEntryImpl
::InternalDoom() {
121
void
MemEntryImpl
::Open() {
131
bool
MemEntryImpl
::InUse() {
144
void
MemEntryImpl
::Doom() {
157
void
MemEntryImpl
::Close()
[
all
...]
mem_backend_impl.cc
90
void MemBackendImpl::InternalDoomEntry(
MemEntryImpl
* entry) {
92
DCHECK(entry->type() ==
MemEntryImpl
::kParentEntry);
104
void MemBackendImpl::UpdateRank(
MemEntryImpl
* node) {
119
void MemBackendImpl::InsertIntoRankingList(
MemEntryImpl
* entry) {
123
void MemBackendImpl::RemoveFromRankingList(
MemEntryImpl
* entry) {
218
MemEntryImpl
* cache_entry = new
MemEntryImpl
(this);
253
MemEntryImpl
* node = rankings_.GetNext(NULL);
259
MemEntryImpl
* last_valid = NULL;
291
MemEntryImpl
* current = reinterpret_cast<MemEntryImpl*>(*iter)
[
all
...]
mem_backend_impl.h
21
class
MemEntryImpl
;
44
void InternalDoomEntry(
MemEntryImpl
* entry);
47
void UpdateRank(
MemEntryImpl
* node);
55
// Insert an
MemEntryImpl
into the ranking list. This method is only called
56
// from
MemEntryImpl
to insert child entries. The reference can be removed
58
void InsertIntoRankingList(
MemEntryImpl
* entry);
61
//
MemEntryImpl
to remove a child entry from the ranking list.
62
void RemoveFromRankingList(
MemEntryImpl
* entry);
87
typedef base::hash_map<std::string,
MemEntryImpl
*> EntryMap;
entry_unittest.cc
[
all
...]
Completed in 2831 milliseconds