File: AdiosFilePool.cpp

package info (click to toggle)
adios2 2.11.0%2Bdfsg1-5
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 39,984 kB
  • sloc: ansic: 250,306; cpp: 189,875; yacc: 18,929; f90: 15,117; python: 8,047; perl: 7,126; sh: 3,049; lisp: 1,106; xml: 1,011; lex: 948; makefile: 598
file content (86 lines) | stat: -rw-r--r-- 2,263 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include "AdiosFilePool.h"

namespace adios2
{

AnonADIOSFile *ADIOSFilePool::GetFree(std::string Filename, bool RowMajorArrays)
{
    std::lock_guard<std::mutex> guard(pool_mutex);
    std::string index = Filename + "/" + std::to_string((int)RowMajorArrays);
    auto res = map.find(index);

    SubPool *subpool;
    if (res != map.end())
    {
        subpool = res->second.get();
    }
    else
    {
        std::unique_ptr<SubPool> tmp(new SubPool());
        subpool = tmp.get();
        map.insert(std::make_pair(index, std::move(tmp)));
    }
    return subpool->GetFree(Filename, RowMajorArrays);
}

void ADIOSFilePool::Return(AnonADIOSFile *Entry)
{
    std::lock_guard<std::mutex> guard(pool_mutex);
    std::string index = Entry->m_FileName + "/" + std::to_string((int)Entry->m_RowMajorArrays);
    auto res = map.find(index);
    auto subpool = res->second.get();
    subpool->Return(Entry);
}

AnonADIOSFile *ADIOSFilePool::SubPool::GetFree(std::string Filename, bool RowMajorArrays)
{
    for (size_t i = 0; i < m_busy.size(); i++)
    {
        if (!m_busy[i])
        {
            m_busy[i] = true;
            in_use_count++;
            return m_list[i].get();
        }
    }
    // no free files
    m_list.push_back(std::unique_ptr<AnonADIOSFile>(new AnonADIOSFile(Filename, RowMajorArrays)));
    m_busy.push_back(true);
    in_use_count++;
    return m_list[m_list.size() - 1].get();
}
void ADIOSFilePool::SubPool::Return(adios2::AnonADIOSFile *to_free)
{
    last_used = std::chrono::steady_clock::now();
    for (size_t i = 0; i < m_busy.size(); i++)
    {
        if (to_free == m_list[i].get())
        {
            m_busy[i] = false;
            in_use_count--;
            return;
        }
    }
    std::cerr << "Return FAILED " << std::endl;
}

ADIOSFilePool::ADIOSFilePool() {}

void ADIOSFilePool::FlushUnused()
{
    for (auto it = map.cbegin(), next_it = it; it != map.cend(); it = next_it)
    {
        ++next_it;
        auto subpool = it->second.get();
        bool should_delete = (subpool->in_use_count == 0);

        if (should_delete)
        {
            std::cout << "Releasing subpool" << std::endl;
            map.erase(it);
        }
    }
}

ADIOSFilePool::~ADIOSFilePool() {}
} // end of namespace adios2