]> git.proxmox.com Git - ceph.git/blame - ceph/src/common/mempool.cc
update sources to v12.1.0
[ceph.git] / ceph / src / common / mempool.cc
CommitLineData
7c673cae
FG
1// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2// vim: ts=8 sw=2 smarttab
3/*
4 * Ceph - scalable distributed file system
5 *
6 * Copyright (C) 2016 Allen Samuels <allen.samuels@sandisk.com>
7 *
8 * This is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License version 2.1, as published by the Free Software
11 * Foundation. See file COPYING.
12 *
13 */
14
15#include "include/mempool.h"
16#include "include/demangle.h"
17
18
19// default to debug_mode off
20bool mempool::debug_mode = false;
21
22// --------------------------------------------------------------
23
24mempool::pool_t& mempool::get_pool(mempool::pool_index_t ix)
25{
26 // We rely on this array being initialized before any invocation of
27 // this function, even if it is called by ctors in other compilation
28 // units that are being initialized before this compilation unit.
29 static mempool::pool_t table[num_pools];
30 return table[ix];
31}
32
33const char *mempool::get_pool_name(mempool::pool_index_t ix) {
34#define P(x) #x,
35 static const char *names[num_pools] = {
36 DEFINE_MEMORY_POOLS_HELPER(P)
37 };
38#undef P
39 return names[ix];
40}
41
42void mempool::dump(ceph::Formatter *f)
43{
31f18b77 44 stats_t total;
7c673cae
FG
45 for (size_t i = 0; i < num_pools; ++i) {
46 const pool_t &pool = mempool::get_pool((pool_index_t)i);
47 f->open_object_section(get_pool_name((pool_index_t)i));
31f18b77 48 pool.dump(f, &total);
7c673cae
FG
49 f->close_section();
50 }
31f18b77 51 f->dump_object("total", total);
7c673cae
FG
52}
53
54void mempool::set_debug_mode(bool d)
55{
56 debug_mode = d;
57}
58
59// --------------------------------------------------------------
60// pool_t
61
62size_t mempool::pool_t::allocated_bytes() const
63{
64 ssize_t result = 0;
65 for (size_t i = 0; i < num_shards; ++i) {
66 result += shard[i].bytes;
67 }
68 assert(result >= 0);
69 return (size_t) result;
70}
71
72size_t mempool::pool_t::allocated_items() const
73{
74 ssize_t result = 0;
75 for (size_t i = 0; i < num_shards; ++i) {
76 result += shard[i].items;
77 }
78 assert(result >= 0);
79 return (size_t) result;
80}
81
31f18b77
FG
82void mempool::pool_t::adjust_count(ssize_t items, ssize_t bytes)
83{
84 shard_t *shard = pick_a_shard();
85 shard->items += items;
86 shard->bytes += bytes;
87}
88
7c673cae
FG
89void mempool::pool_t::get_stats(
90 stats_t *total,
91 std::map<std::string, stats_t> *by_type) const
92{
93 for (size_t i = 0; i < num_shards; ++i) {
94 total->items += shard[i].items;
95 total->bytes += shard[i].bytes;
96 }
97 if (debug_mode) {
98 std::unique_lock<std::mutex> shard_lock(lock);
99 for (auto &p : type_map) {
100 std::string n = ceph_demangle(p.second.type_name);
101 stats_t &s = (*by_type)[n];
102 s.bytes = p.second.items * p.second.item_size;
103 s.items = p.second.items;
104 }
105 }
106}
107
31f18b77 108void mempool::pool_t::dump(ceph::Formatter *f, stats_t *ptotal) const
7c673cae
FG
109{
110 stats_t total;
111 std::map<std::string, stats_t> by_type;
112 get_stats(&total, &by_type);
31f18b77
FG
113 if (ptotal) {
114 *ptotal += total;
115 }
116 total.dump(f);
7c673cae 117 if (!by_type.empty()) {
31f18b77 118 f->open_object_section("by_type");
7c673cae
FG
119 for (auto &i : by_type) {
120 f->open_object_section(i.first.c_str());
121 i.second.dump(f);
122 f->close_section();
123 }
31f18b77 124 f->close_section();
7c673cae
FG
125 }
126}