[Base][Core][Example][Lib][ML] Add Memory, MemoryPool, Cache, PageSto…

…re, Page to support swapping of ObjLists

issue #256
Modify base/disk_store, base/serialization, core/config, core/objlist, core/objlist_data. Add default constructor to objects.

base/CMakeLists.txt

@@ -24,7 +24,8 @@ file(GLOB base-src-files
     disk_store.cpp
     serialization.cpp
     session_local.cpp
-    thread_support.cpp)
+    thread_support.cpp
+    memory.cpp)
 husky_cache_variable(base-src-files ${base-src-files})
 
 add_library(base-objs OBJECT ${base-src-files})

base/disk_store.cpp

@@ -40,9 +40,23 @@ BinStream DiskStore::read() {
 
 // TODO(legend): Will use `pwrite` or other asio functions instead.
 bool DiskStore::write(BinStream&& bs) {
-    if (bs.get_buffer_vector().empty())
+    //    if (bs.get_buffer_vector().empty())
+    //        return false;
+
+    std::ofstream file;
+    file.open(path_, std::ofstream::out | std::ofstream::binary);
+    if (!file)
         return false;
 
+    std::copy(bs.get_buffer_vector().begin(), bs.get_buffer_vector().end(), std::ostreambuf_iterator<char>(file));
+    file.close();
+    return true;
+}
+
+bool DiskStore::write(BinStream& bs) {
+    //    if (bs.get_buffer_vector().empty())
+    //        return false;
+
     std::ofstream file;
     file.open(path_, std::ofstream::out | std::ofstream::binary);
     if (!file)

base/disk_store.hpp

@@ -30,6 +30,7 @@ class DiskStore {
 
     BinStream read();
     bool write(BinStream&& bs);
+    bool write(BinStream& bs);
 
    private:
     std::string path_;

base/memory.cpp

@@ -0,0 +1,22 @@
+// Copyright 2016 Husky Team
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+// http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+#include "base/memory.hpp"
+
+namespace husky {
+namespace base {
+
+struct sysinfo Memory::mem_info;
+}
+}

base/memory.hpp

@@ -0,0 +1,43 @@
+// Copyright 2016 Husky Team
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+// http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+#pragma once
+
+#include "sys/sysinfo.h"
+#include "sys/types.h"
+
+namespace husky {
+namespace base {
+class Memory {
+   public:
+    static int64_t total_phys_mem() {
+        sysinfo(&mem_info);
+        int64_t total_phys_mem = mem_info.totalram;
+        total_phys_mem *= mem_info.mem_unit;
+        return total_phys_mem;
+    }
+
+    static int64_t total_virtual_mem() {
+        sysinfo(&mem_info);
+        int64_t total_vir_mem = mem_info.totalram;
+        total_vir_mem += mem_info.totalswap;
+        total_vir_mem *= mem_info.mem_unit;
+        return total_vir_mem;
+    }
+
+   private:
+    static struct sysinfo mem_info;
+};
+}  // namespace base
+}  // namespace husky

base/serialization.cpp

@@ -71,6 +71,21 @@ void BinStream::resize(size_t size) {
 
 void BinStream::seek(size_t pos) { front_ = pos; }
 
+BinStream BinStream::sub_stream(size_t s_pos, size_t len) {
+    int size = buffer_.size();
+    auto it_start = buffer_.begin() + front_ + s_pos;
+    if (front_ + s_pos > size) {
+        std::vector<char> v;
+        return BinStream(std::move(v));
+    }
+    auto it_end = it_start + len;
+    if (front_ + s_pos + len > size) {
+        it_end = buffer_.end();
+    }
+    std::vector<char> v(it_start, it_end);
+    return BinStream(std::move(v));
+}
+
 void BinStream::push_back_bytes(const char* src, size_t sz) {
     buffer_.insert(buffer_.end(), (const char*) src, (const char*) src + sz);
 }

base/serialization.hpp

@@ -49,6 +49,7 @@ class BinStream {
     void purge();
     void resize(size_t size);
     void seek(size_t pos);
+    BinStream sub_stream(size_t s_pos, size_t len);
 
     void append(const BinStream& m);
     void push_back_bytes(const char* src, size_t sz);
@@ -145,8 +146,9 @@ BinStream& operator>>(BinStream& stream, std::vector<OutputT>& v) {
     stream >> len;
     v.clear();
     v.resize(len);
-    for (int i = 0; i < v.size(); ++i)
+    for (int i = 0; i < v.size(); ++i) {
         stream >> v[i];
+    }
     return stream;
 }
 

core/CMakeLists.txt

@@ -20,6 +20,7 @@ add_subdirectory(channel)
 file(GLOB core-src-files
     accessor.cpp
     accessor_store.cpp
+    balance.cpp
     combiner.cpp
     config.cpp
     context.cpp
@@ -28,12 +29,14 @@ file(GLOB core-src-files
     job_runner.cpp
     mailbox.cpp
     memory_checker.cpp
+    memory_pool.cpp
     network.cpp
     objlist.cpp
     objlist_store.cpp
+    page.cpp
+    page_store.cpp
     shuffle_combiner_store.cpp
-    worker_info.cpp
-    balance.cpp)
+    worker_info.cpp)
 husky_cache_variable(core-src-files ${core-src-files})
 
 add_library(core-objs OBJECT ${core-src-files})

core/attrlist_unittest.cpp

@@ -28,7 +28,13 @@ class TestAttrList : public testing::Test {
     ~TestAttrList() {}
 
    protected:
-    void SetUp() {}
+    void SetUp() {
+        Config config;
+        config.set_param("maximum_thread_memory", "134217728");
+        config.set_param("page_size", "2097152");
+        Context::set_config(std::move(config));
+        Context::set_local_tid(0);
+    }
     void TearDown() {}
 };
 

core/cache.hpp

@@ -0,0 +1,149 @@
+// Copyright 2016 Husky Team
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+// http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+#pragma once
+
+#include <list>
+#include <unordered_map>
+#include <utility>
+
+#include "boost/optional.hpp"
+
+namespace husky {
+
+template <typename KeyT, typename ValT>
+class ICache {
+   public:
+    explicit ICache(size_t size) { size_ = size; }
+
+    size_t get_max_size() { return size_; }
+
+   protected:
+    size_t size_;
+};
+
+template <typename KeyT, typename ValT>
+class LRUCache : public ICache<KeyT, ValT> {
+   public:
+    using ListIterator = typename std::list<std::pair<KeyT, ValT>>::iterator;
+
+    explicit LRUCache(size_t size) : ICache<KeyT, ValT>(size) {}
+
+    ~LRUCache() = default;
+
+    template <typename KeyU, typename ValU>
+    void put(KeyU&& key, ValU&& val) {
+        auto it_cache = cache_map_.find(key);
+        cache_list_.push_front(std::make_pair(key, val));
+        if (it_cache != cache_map_.end()) {
+            cache_list_.erase(it_cache->second);
+            cache_map_.erase(it_cache);
+        }
+        cache_map_[key] = cache_list_.begin();
+
+        if (cache_map_.size() > this->size_) {
+            del();
+        }
+    }
+
+    boost::optional<std::pair<KeyT, ValT>> del() {
+        if (cache_map_.size() == 0) {
+            return boost::none;
+        }
+        auto last = cache_list_.end();
+        last--;
+        KeyT key = last->first;
+        ValT objlist = last->second;
+        cache_map_.erase(key);
+        cache_list_.pop_back();
+        return *last;
+    }
+
+    boost::optional<std::pair<KeyT, ValT>> poll() {
+        if (cache_map_.size() == 0) {
+            return boost::none;
+        }
+        return cache_list_.back();
+    }
+
+    size_t get_size() { return cache_map_.size(); }
+
+    template <typename KeyU>
+    bool exists(KeyU&& key) {
+        return cache_map_.find(std::forward<KeyU>(key)) != cache_map_.end();
+    }
+
+   private:
+    std::unordered_map<KeyT, ListIterator> cache_map_;
+    std::list<std::pair<KeyT, ValT>> cache_list_;
+};
+
+template <typename KeyT, typename ValT>
+class FIFOCache : public ICache<KeyT, ValT> {
+   public:
+    using ListIterator = typename std::list<std::pair<KeyT, ValT>>::iterator;
+
+    explicit FIFOCache(size_t size) : ICache<KeyT, ValT>(size) {}
+
+    ~FIFOCache() = default;
+
+    template <typename KeyU, typename ValU>
+    void put(KeyU&& key, ValU&& val) {
+        auto it_cache = cache_map_.find(key);
+        if (it_cache != cache_map_.end() && it_cache->second->second != val) {
+            cache_list_.erase(it_cache->second);
+            cache_map_.erase(it_cache);
+        } else if (it_cache != cache_map_.end() && it_cache->second->second == val) {
+            return;
+        }
+        cache_list_.push_front(std::make_pair(key, val));
+        cache_map_[key] = cache_list_.begin();
+
+        if (cache_map_.size() > this->size_) {
+            del();
+        }
+    }
+
+    boost::optional<std::pair<KeyT, ValT>> del() {
+        if (cache_map_.size() == 0) {
+            return boost::none;
+        }
+        auto last = cache_list_.end();
+        last--;
+        KeyT key = last->first;
+        ValT objlist = last->second;
+        cache_map_.erase(key);
+        cache_list_.pop_back();
+        return *last;
+    }
+
+    boost::optional<std::pair<KeyT, ValT>> poll() {
+        if (cache_map_.size() == 0) {
+            return boost::none;
+        }
+        return cache_list_.back();
+    }
+
+    template <typename KeyU>
+    bool exists(KeyU&& key) {
+        return cache_map_.find(key) != cache_map_.end();
+    }
+
+    size_t get_size() { return cache_map_.size(); }
+
+   private:
+    std::unordered_map<KeyT, ListIterator> cache_map_;
+    std::list<std::pair<KeyT, ValT>> cache_list_;
+};
+}  // namespace husky