remove ceph code

[stor4nfv.git] / src / ceph / src / common / lru_map.h

diff --git a/src/ceph/src/common/lru_map.h b/src/ceph/src/common/lru_map.h
deleted file mode 100644 (file)
index 35722fc..0000000
--- a/src/ceph/src/common/lru_map.h
+++ /dev/null
@@ -1,132 +0,0 @@
-#ifndef CEPH_LRU_MAP_H
-#define CEPH_LRU_MAP_H
-
-#include "common/Mutex.h"
-
-template <class K, class V>
-class lru_map {
-  struct entry {
-    V value;
-    typename std::list<K>::iterator lru_iter;
-  };
-
-  std::map<K, entry> entries;
-  std::list<K> entries_lru;
-
-  Mutex lock;
-
-  size_t max;
-
-public:
-  class UpdateContext {
-    public:
-      virtual ~UpdateContext() {}
-
-      /* update should return true if object is updated */
-      virtual bool update(V *v) = 0;
-  };
-
-  bool _find(const K& key, V *value, UpdateContext *ctx);
-  void _add(const K& key, V& value);
-
-public:
-  lru_map(int _max) : lock("lru_map"), max(_max) {}
-  virtual ~lru_map() {}
-
-  bool find(const K& key, V& value);
-
-  /*
-   * find_and_update()
-   *
-   * - will return true if object is found
-   * - if ctx is set will return true if object is found and updated
-   */
-  bool find_and_update(const K& key, V *value, UpdateContext *ctx);
-  void add(const K& key, V& value);
-  void erase(const K& key);
-};
-
-template <class K, class V>
-bool lru_map<K, V>::_find(const K& key, V *value, UpdateContext *ctx)
-{
-  typename std::map<K, entry>::iterator iter = entries.find(key);
-  if (iter == entries.end()) {
-    return false;
-  }
-
-  entry& e = iter->second;
-  entries_lru.erase(e.lru_iter);
-
-  bool r = true;
-
-  if (ctx)
-    r = ctx->update(&e.value);
-
-  if (value)
-    *value = e.value;
-
-  entries_lru.push_front(key);
-  e.lru_iter = entries_lru.begin();
-
-  return r;
-}
-
-template <class K, class V>
-bool lru_map<K, V>::find(const K& key, V& value)
-{
-  Mutex::Locker l(lock);
-  return _find(key, &value, NULL);
-}
-
-template <class K, class V>
-bool lru_map<K, V>::find_and_update(const K& key, V *value, UpdateContext *ctx)
-{
-  Mutex::Locker l(lock);
-  return _find(key, value, ctx);
-}
-
-template <class K, class V>
-void lru_map<K, V>::_add(const K& key, V& value)
-{
-  typename std::map<K, entry>::iterator iter = entries.find(key);
-  if (iter != entries.end()) {
-    entry& e = iter->second;
-    entries_lru.erase(e.lru_iter);
-  }
-
-  entries_lru.push_front(key);
-  entry& e = entries[key];
-  e.value = value;
-  e.lru_iter = entries_lru.begin();
-
-  while (entries.size() > max) {
-    typename std::list<K>::reverse_iterator riter = entries_lru.rbegin();
-    iter = entries.find(*riter);
-    // assert(iter != entries.end());
-    entries.erase(iter);
-    entries_lru.pop_back();
-  }
-}
-
-
-template <class K, class V>
-void lru_map<K, V>::add(const K& key, V& value)
-{
-  Mutex::Locker l(lock);
-  _add(key, value);
-}
-
-template <class K, class V>
-void lru_map<K, V>::erase(const K& key)
-{
-  Mutex::Locker l(lock);
-  typename std::map<K, entry>::iterator iter = entries.find(key);
-  if (iter == entries.end())
-    return;
-
-  entry& e = iter->second;
-  entries_lru.erase(e.lru_iter);
-  entries.erase(iter);
-}
-
-#endif