lru::LruCache< Key, Value >::ListEntry< T > Class Template Reference

Inheritance diagram for lru::LruCache< Key, Value >::ListEntry< T >:

Public Member Functions
	ListEntry ()
	ListEntry (const ListEntry< T > &other)
virtual	~ListEntry ()
virtual bool	IsListHead () const =0
bool	IsLonely () const

Public Attributes
ListEntry< T > *	next
ListEntry< T > *	prev

Protected Member Functions
void	InsertAsSuccessor (ListEntryContent< T > *entry)
void	InsertAsPredecessor (ListEntryContent< T > *entry)
virtual void	RemoveFromList ()=0

Private Member Functions
ListEntry< T > &	operator= (const ListEntry< T > &other)

Friends
class	LruCache

Detailed Description

template<class Key, class Value>
template<class T>
class lru::LruCache< Key, Value >::ListEntry< T >

Internal LRU list entry, to maintain the doubly linked list. The list keeps track of the least recently used keys in the cache.

Definition at line 109 of file lru.h.

Constructor & Destructor Documentation

template<class Key, class Value>

template<class T>

lru::LruCache< Key, Value >::ListEntry< T >::ListEntry ( )

inline

Create a new list entry as lonely, both next and prev pointing to this.

Definition at line 299 of file lru.h.

template<class Key, class Value>

template<class T>

lru::LruCache< Key, Value >::ListEntry< T >::ListEntry ( const ListEntry< T > &  other )

inline

Definition at line 304 of file lru.h.

template<class Key, class Value>

template<class T>

virtual lru::LruCache< Key, Value >::ListEntry< T >::~ListEntry ( )

inlinevirtual

Definition at line 309 of file lru.h.

Member Function Documentation

template<class Key, class Value>

template<class T>

void lru::LruCache< Key, Value >::ListEntry< T >::InsertAsPredecessor ( ListEntryContent< T > *  entry )

inlineprotected

Insert a given ListEntry in front of this one

Parameters

entry

the ListEntry to insert in front of this one

Definition at line 348 of file lru.h.

Referenced by lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::MoveToBack(), and lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::PushBack().

Here is the caller graph for this function:

template<class Key, class Value>

template<class T>

void lru::LruCache< Key, Value >::ListEntry< T >::InsertAsSuccessor ( ListEntryContent< T > *  entry )

inlineprotected

Insert a given ListEntry after this one.

Parameters

entry

the ListEntry to insert after this one

Definition at line 331 of file lru.h.

template<class Key, class Value>

template<class T>

virtual bool lru::LruCache< Key, Value >::ListEntry< T >::IsListHead ( ) const

pure virtual

Checks if the ListEntry is the list head

Returns

true if ListEntry is list head otherwise false

Implemented in lru::LruCache< Key, Value >::ListEntryHead< T >, lru::LruCache< Key, Value >::ListEntryHead< ComparableHash >, lru::LruCache< Key, Value >::ListEntryHead< shash::Md5 >, lru::LruCache< Key, Value >::ListEntryHead< Key >, lru::LruCache< Key, Value >::ListEntryHead< shash::Any >, lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >, lru::LruCache< Key, Value >::ListEntryContent< T >, and lru::LruCache< Key, Value >::ListEntryContent< Key >.

Referenced by lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::clear(), lru::LruCache< shash::Any, MemoryBuffer >::FilterDelete(), lru::LruCache< shash::Any, MemoryBuffer >::FilterGet(), lru::LruCache< shash::Any, MemoryBuffer >::FilterNext(), and lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::Pop().

Here is the caller graph for this function:

template<class Key, class Value>

template<class T>

bool lru::LruCache< Key, Value >::ListEntry< T >::IsLonely ( ) const

inline

A lonely ListEntry has no connection to other elements.

Returns

true if ListEntry is lonely otherwise false

Definition at line 321 of file lru.h.

Referenced by lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::InsertAsPredecessor(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::InsertAsSuccessor(), lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::IsEmpty(), and lru::LruCache< Key, Value >::ListEntryContent< Key >::RemoveFromList().

Here is the caller graph for this function:

template<class Key, class Value>

template<class T>

ListEntry<T>& lru::LruCache< Key, Value >::ListEntry< T >::operator= ( const ListEntry< T > &  other )

private

template<class Key, class Value>

template<class T>

virtual void lru::LruCache< Key, Value >::ListEntry< T >::RemoveFromList ( )

protectedpure virtual

Remove this element from it's list. The function connects this->next with this->prev leaving the list in a consistent state. The ListEntry itself is lonely afterwards, but not deleted.

Implemented in lru::LruCache< Key, Value >::ListEntryHead< T >, lru::LruCache< Key, Value >::ListEntryHead< ComparableHash >, lru::LruCache< Key, Value >::ListEntryHead< shash::Md5 >, lru::LruCache< Key, Value >::ListEntryHead< Key >, lru::LruCache< Key, Value >::ListEntryHead< shash::Any >, lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >, lru::LruCache< Key, Value >::ListEntryContent< T >, and lru::LruCache< Key, Value >::ListEntryContent< Key >.

Referenced by lru::LruCache< shash::Any, MemoryBuffer >::FilterDelete(), and lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::Pop().

Here is the caller graph for this function:

Friends And Related Function Documentation

template<class Key, class Value>

template<class T>

friend class LruCache

friend

Definition at line 294 of file lru.h.

Member Data Documentation

template<class Key, class Value>

template<class T>

ListEntry<T>* lru::LruCache< Key, Value >::ListEntry< T >::next

Pointer to next element in the list.

Definition at line 323 of file lru.h.

Referenced by lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::clear(), lru::LruCache< shash::Any, MemoryBuffer >::FilterNext(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::InsertAsPredecessor(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::InsertAsSuccessor(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::IsLonely(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::ListEntry(), lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::PopFront(), and lru::LruCache< Key, Value >::ListEntryContent< Key >::RemoveFromList().

template<class Key, class Value>

template<class T>

ListEntry<T>* lru::LruCache< Key, Value >::ListEntry< T >::prev

Pointer to previous element in the list.

Definition at line 324 of file lru.h.

Referenced by lru::LruCache< Key, Value >::ListEntryHead< fuse_ino_t >::clear(), lru::LruCache< shash::Any, MemoryBuffer >::FilterDelete(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::InsertAsPredecessor(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::InsertAsSuccessor(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::IsLonely(), lru::LruCache< Key, Value >::ListEntry< fuse_ino_t >::ListEntry(), and lru::LruCache< Key, Value >::ListEntryContent< Key >::RemoveFromList().

---

The documentation for this class was generated from the following file:

• /home/sftnight/jenkins/workspace/CvmfsDoxygen/label/docker-x86_64/cvmfs/cvmfs/lru.h