Loading...
1/*
2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17 */
18#include "xfs.h"
19#include <linux/proc_fs.h>
20
21DEFINE_PER_CPU(struct xfsstats, xfsstats);
22
23static int xfs_stat_proc_show(struct seq_file *m, void *v)
24{
25 int c, i, j, val;
26 __uint64_t xs_xstrat_bytes = 0;
27 __uint64_t xs_write_bytes = 0;
28 __uint64_t xs_read_bytes = 0;
29
30 static const struct xstats_entry {
31 char *desc;
32 int endpoint;
33 } xstats[] = {
34 { "extent_alloc", XFSSTAT_END_EXTENT_ALLOC },
35 { "abt", XFSSTAT_END_ALLOC_BTREE },
36 { "blk_map", XFSSTAT_END_BLOCK_MAPPING },
37 { "bmbt", XFSSTAT_END_BLOCK_MAP_BTREE },
38 { "dir", XFSSTAT_END_DIRECTORY_OPS },
39 { "trans", XFSSTAT_END_TRANSACTIONS },
40 { "ig", XFSSTAT_END_INODE_OPS },
41 { "log", XFSSTAT_END_LOG_OPS },
42 { "push_ail", XFSSTAT_END_TAIL_PUSHING },
43 { "xstrat", XFSSTAT_END_WRITE_CONVERT },
44 { "rw", XFSSTAT_END_READ_WRITE_OPS },
45 { "attr", XFSSTAT_END_ATTRIBUTE_OPS },
46 { "icluster", XFSSTAT_END_INODE_CLUSTER },
47 { "vnodes", XFSSTAT_END_VNODE_OPS },
48 { "buf", XFSSTAT_END_BUF },
49 { "abtb2", XFSSTAT_END_ABTB_V2 },
50 { "abtc2", XFSSTAT_END_ABTC_V2 },
51 { "bmbt2", XFSSTAT_END_BMBT_V2 },
52 { "ibt2", XFSSTAT_END_IBT_V2 },
53 };
54
55 /* Loop over all stats groups */
56 for (i=j = 0; i < ARRAY_SIZE(xstats); i++) {
57 seq_printf(m, "%s", xstats[i].desc);
58 /* inner loop does each group */
59 while (j < xstats[i].endpoint) {
60 val = 0;
61 /* sum over all cpus */
62 for_each_possible_cpu(c)
63 val += *(((__u32*)&per_cpu(xfsstats, c) + j));
64 seq_printf(m, " %u", val);
65 j++;
66 }
67 seq_putc(m, '\n');
68 }
69 /* extra precision counters */
70 for_each_possible_cpu(i) {
71 xs_xstrat_bytes += per_cpu(xfsstats, i).xs_xstrat_bytes;
72 xs_write_bytes += per_cpu(xfsstats, i).xs_write_bytes;
73 xs_read_bytes += per_cpu(xfsstats, i).xs_read_bytes;
74 }
75
76 seq_printf(m, "xpc %Lu %Lu %Lu\n",
77 xs_xstrat_bytes, xs_write_bytes, xs_read_bytes);
78 seq_printf(m, "debug %u\n",
79#if defined(DEBUG)
80 1);
81#else
82 0);
83#endif
84 return 0;
85}
86
87static int xfs_stat_proc_open(struct inode *inode, struct file *file)
88{
89 return single_open(file, xfs_stat_proc_show, NULL);
90}
91
92static const struct file_operations xfs_stat_proc_fops = {
93 .owner = THIS_MODULE,
94 .open = xfs_stat_proc_open,
95 .read = seq_read,
96 .llseek = seq_lseek,
97 .release = single_release,
98};
99
100int
101xfs_init_procfs(void)
102{
103 if (!proc_mkdir("fs/xfs", NULL))
104 goto out;
105
106 if (!proc_create("fs/xfs/stat", 0, NULL,
107 &xfs_stat_proc_fops))
108 goto out_remove_entry;
109 return 0;
110
111 out_remove_entry:
112 remove_proc_entry("fs/xfs", NULL);
113 out:
114 return -ENOMEM;
115}
116
117void
118xfs_cleanup_procfs(void)
119{
120 remove_proc_entry("fs/xfs/stat", NULL);
121 remove_proc_entry("fs/xfs", NULL);
122}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7
8struct xstats xfsstats;
9
10static int counter_val(struct xfsstats __percpu *stats, int idx)
11{
12 int val = 0, cpu;
13
14 for_each_possible_cpu(cpu)
15 val += *(((__u32 *)per_cpu_ptr(stats, cpu) + idx));
16 return val;
17}
18
19int xfs_stats_format(struct xfsstats __percpu *stats, char *buf)
20{
21 int i, j;
22 int len = 0;
23 uint64_t xs_xstrat_bytes = 0;
24 uint64_t xs_write_bytes = 0;
25 uint64_t xs_read_bytes = 0;
26
27 static const struct xstats_entry {
28 char *desc;
29 int endpoint;
30 } xstats[] = {
31 { "extent_alloc", xfsstats_offset(xs_abt_lookup) },
32 { "abt", xfsstats_offset(xs_blk_mapr) },
33 { "blk_map", xfsstats_offset(xs_bmbt_lookup) },
34 { "bmbt", xfsstats_offset(xs_dir_lookup) },
35 { "dir", xfsstats_offset(xs_trans_sync) },
36 { "trans", xfsstats_offset(xs_ig_attempts) },
37 { "ig", xfsstats_offset(xs_log_writes) },
38 { "log", xfsstats_offset(xs_try_logspace)},
39 { "push_ail", xfsstats_offset(xs_xstrat_quick)},
40 { "xstrat", xfsstats_offset(xs_write_calls) },
41 { "rw", xfsstats_offset(xs_attr_get) },
42 { "attr", xfsstats_offset(xs_iflush_count)},
43 { "icluster", xfsstats_offset(vn_active) },
44 { "vnodes", xfsstats_offset(xb_get) },
45 { "buf", xfsstats_offset(xs_abtb_2) },
46 { "abtb2", xfsstats_offset(xs_abtc_2) },
47 { "abtc2", xfsstats_offset(xs_bmbt_2) },
48 { "bmbt2", xfsstats_offset(xs_ibt_2) },
49 { "ibt2", xfsstats_offset(xs_fibt_2) },
50 { "fibt2", xfsstats_offset(xs_rmap_2) },
51 { "rmapbt", xfsstats_offset(xs_refcbt_2) },
52 { "refcntbt", xfsstats_offset(xs_qm_dqreclaims)},
53 /* we print both series of quota information together */
54 { "qm", xfsstats_offset(xs_xstrat_bytes)},
55 };
56
57 /* Loop over all stats groups */
58
59 for (i = j = 0; i < ARRAY_SIZE(xstats); i++) {
60 len += snprintf(buf + len, PATH_MAX - len, "%s",
61 xstats[i].desc);
62 /* inner loop does each group */
63 for (; j < xstats[i].endpoint; j++)
64 len += snprintf(buf + len, PATH_MAX - len, " %u",
65 counter_val(stats, j));
66 len += snprintf(buf + len, PATH_MAX - len, "\n");
67 }
68 /* extra precision counters */
69 for_each_possible_cpu(i) {
70 xs_xstrat_bytes += per_cpu_ptr(stats, i)->s.xs_xstrat_bytes;
71 xs_write_bytes += per_cpu_ptr(stats, i)->s.xs_write_bytes;
72 xs_read_bytes += per_cpu_ptr(stats, i)->s.xs_read_bytes;
73 }
74
75 len += snprintf(buf + len, PATH_MAX-len, "xpc %Lu %Lu %Lu\n",
76 xs_xstrat_bytes, xs_write_bytes, xs_read_bytes);
77 len += snprintf(buf + len, PATH_MAX-len, "debug %u\n",
78#if defined(DEBUG)
79 1);
80#else
81 0);
82#endif
83
84 return len;
85}
86
87void xfs_stats_clearall(struct xfsstats __percpu *stats)
88{
89 int c;
90 uint32_t vn_active;
91
92 xfs_notice(NULL, "Clearing xfsstats");
93 for_each_possible_cpu(c) {
94 preempt_disable();
95 /* save vn_active, it's a universal truth! */
96 vn_active = per_cpu_ptr(stats, c)->s.vn_active;
97 memset(per_cpu_ptr(stats, c), 0, sizeof(*stats));
98 per_cpu_ptr(stats, c)->s.vn_active = vn_active;
99 preempt_enable();
100 }
101}
102
103#ifdef CONFIG_PROC_FS
104/* legacy quota interfaces */
105#ifdef CONFIG_XFS_QUOTA
106
107#define XFSSTAT_START_XQMSTAT xfsstats_offset(xs_qm_dqreclaims)
108#define XFSSTAT_END_XQMSTAT xfsstats_offset(xs_qm_dquot)
109
110static int xqm_proc_show(struct seq_file *m, void *v)
111{
112 /* maximum; incore; ratio free to inuse; freelist */
113 seq_printf(m, "%d\t%d\t%d\t%u\n",
114 0, counter_val(xfsstats.xs_stats, XFSSTAT_END_XQMSTAT),
115 0, counter_val(xfsstats.xs_stats, XFSSTAT_END_XQMSTAT + 1));
116 return 0;
117}
118
119/* legacy quota stats interface no 2 */
120static int xqmstat_proc_show(struct seq_file *m, void *v)
121{
122 int j;
123
124 seq_printf(m, "qm");
125 for (j = XFSSTAT_START_XQMSTAT; j < XFSSTAT_END_XQMSTAT; j++)
126 seq_printf(m, " %u", counter_val(xfsstats.xs_stats, j));
127 seq_putc(m, '\n');
128 return 0;
129}
130#endif /* CONFIG_XFS_QUOTA */
131
132int
133xfs_init_procfs(void)
134{
135 if (!proc_mkdir("fs/xfs", NULL))
136 return -ENOMEM;
137
138 if (!proc_symlink("fs/xfs/stat", NULL,
139 "/sys/fs/xfs/stats/stats"))
140 goto out;
141
142#ifdef CONFIG_XFS_QUOTA
143 if (!proc_create_single("fs/xfs/xqmstat", 0, NULL, xqmstat_proc_show))
144 goto out;
145 if (!proc_create_single("fs/xfs/xqm", 0, NULL, xqm_proc_show))
146 goto out;
147#endif
148 return 0;
149
150out:
151 remove_proc_subtree("fs/xfs", NULL);
152 return -ENOMEM;
153}
154
155void
156xfs_cleanup_procfs(void)
157{
158 remove_proc_subtree("fs/xfs", NULL);
159}
160#endif /* CONFIG_PROC_FS */