1a8c879a7SAndy Grover /*
2a8c879a7SAndy Grover * Copyright (c) 2006 Oracle. All rights reserved.
3a8c879a7SAndy Grover *
4a8c879a7SAndy Grover * This software is available to you under a choice of one of two
5a8c879a7SAndy Grover * licenses. You may choose to be licensed under the terms of the GNU
6a8c879a7SAndy Grover * General Public License (GPL) Version 2, available from the file
7a8c879a7SAndy Grover * COPYING in the main directory of this source tree, or the
8a8c879a7SAndy Grover * OpenIB.org BSD license below:
9a8c879a7SAndy Grover *
10a8c879a7SAndy Grover * Redistribution and use in source and binary forms, with or
11a8c879a7SAndy Grover * without modification, are permitted provided that the following
12a8c879a7SAndy Grover * conditions are met:
13a8c879a7SAndy Grover *
14a8c879a7SAndy Grover * - Redistributions of source code must retain the above
15a8c879a7SAndy Grover * copyright notice, this list of conditions and the following
16a8c879a7SAndy Grover * disclaimer.
17a8c879a7SAndy Grover *
18a8c879a7SAndy Grover * - Redistributions in binary form must reproduce the above
19a8c879a7SAndy Grover * copyright notice, this list of conditions and the following
20a8c879a7SAndy Grover * disclaimer in the documentation and/or other materials
21a8c879a7SAndy Grover * provided with the distribution.
22a8c879a7SAndy Grover *
23a8c879a7SAndy Grover * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24a8c879a7SAndy Grover * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25a8c879a7SAndy Grover * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26a8c879a7SAndy Grover * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27a8c879a7SAndy Grover * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28a8c879a7SAndy Grover * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29a8c879a7SAndy Grover * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30a8c879a7SAndy Grover * SOFTWARE.
31a8c879a7SAndy Grover *
32a8c879a7SAndy Grover */
33a8c879a7SAndy Grover #include <linux/percpu.h>
34a8c879a7SAndy Grover #include <linux/seq_file.h>
355a0e3ad6STejun Heo #include <linux/slab.h>
36a8c879a7SAndy Grover #include <linux/proc_fs.h>
37bc3b2d7fSPaul Gortmaker #include <linux/export.h>
38a8c879a7SAndy Grover
39a8c879a7SAndy Grover #include "rds.h"
40a8c879a7SAndy Grover
41a8c879a7SAndy Grover /*
42a8c879a7SAndy Grover * This file implements a getsockopt() call which copies a set of fixed
43a8c879a7SAndy Grover * sized structs into a user-specified buffer as a means of providing
44a8c879a7SAndy Grover * read-only information about RDS.
45a8c879a7SAndy Grover *
46a8c879a7SAndy Grover * For a given information source there are a given number of fixed sized
47a8c879a7SAndy Grover * structs at a given time. The structs are only copied if the user-specified
48a8c879a7SAndy Grover * buffer is big enough. The destination pages that make up the buffer
49a8c879a7SAndy Grover * are pinned for the duration of the copy.
50a8c879a7SAndy Grover *
51a8c879a7SAndy Grover * This gives us the following benefits:
52a8c879a7SAndy Grover *
53a8c879a7SAndy Grover * - simple implementation, no copy "position" across multiple calls
54a8c879a7SAndy Grover * - consistent snapshot of an info source
55a8c879a7SAndy Grover * - atomic copy works well with whatever locking info source has
56a8c879a7SAndy Grover * - one portable tool to get rds info across implementations
57a8c879a7SAndy Grover * - long-lived tool can get info without allocating
58a8c879a7SAndy Grover *
59a8c879a7SAndy Grover * at the following costs:
60a8c879a7SAndy Grover *
61a8c879a7SAndy Grover * - info source copy must be pinned, may be "large"
62a8c879a7SAndy Grover */
63a8c879a7SAndy Grover
64a8c879a7SAndy Grover struct rds_info_iterator {
65a8c879a7SAndy Grover struct page **pages;
66a8c879a7SAndy Grover void *addr;
67a8c879a7SAndy Grover unsigned long offset;
68a8c879a7SAndy Grover };
69a8c879a7SAndy Grover
70a8c879a7SAndy Grover static DEFINE_SPINLOCK(rds_info_lock);
71a8c879a7SAndy Grover static rds_info_func rds_info_funcs[RDS_INFO_LAST - RDS_INFO_FIRST + 1];
72a8c879a7SAndy Grover
rds_info_register_func(int optname,rds_info_func func)73a8c879a7SAndy Grover void rds_info_register_func(int optname, rds_info_func func)
74a8c879a7SAndy Grover {
75a8c879a7SAndy Grover int offset = optname - RDS_INFO_FIRST;
76a8c879a7SAndy Grover
77a8c879a7SAndy Grover BUG_ON(optname < RDS_INFO_FIRST || optname > RDS_INFO_LAST);
78a8c879a7SAndy Grover
79a8c879a7SAndy Grover spin_lock(&rds_info_lock);
808690bfa1SAndy Grover BUG_ON(rds_info_funcs[offset]);
81a8c879a7SAndy Grover rds_info_funcs[offset] = func;
82a8c879a7SAndy Grover spin_unlock(&rds_info_lock);
83a8c879a7SAndy Grover }
84616b757aSAndy Grover EXPORT_SYMBOL_GPL(rds_info_register_func);
85a8c879a7SAndy Grover
rds_info_deregister_func(int optname,rds_info_func func)86a8c879a7SAndy Grover void rds_info_deregister_func(int optname, rds_info_func func)
87a8c879a7SAndy Grover {
88a8c879a7SAndy Grover int offset = optname - RDS_INFO_FIRST;
89a8c879a7SAndy Grover
90a8c879a7SAndy Grover BUG_ON(optname < RDS_INFO_FIRST || optname > RDS_INFO_LAST);
91a8c879a7SAndy Grover
92a8c879a7SAndy Grover spin_lock(&rds_info_lock);
93a8c879a7SAndy Grover BUG_ON(rds_info_funcs[offset] != func);
94a8c879a7SAndy Grover rds_info_funcs[offset] = NULL;
95a8c879a7SAndy Grover spin_unlock(&rds_info_lock);
96a8c879a7SAndy Grover }
97616b757aSAndy Grover EXPORT_SYMBOL_GPL(rds_info_deregister_func);
98a8c879a7SAndy Grover
99a8c879a7SAndy Grover /*
100a8c879a7SAndy Grover * Typically we hold an atomic kmap across multiple rds_info_copy() calls
101a8c879a7SAndy Grover * because the kmap is so expensive. This must be called before using blocking
102a8c879a7SAndy Grover * operations while holding the mapping and as the iterator is torn down.
103a8c879a7SAndy Grover */
rds_info_iter_unmap(struct rds_info_iterator * iter)104a8c879a7SAndy Grover void rds_info_iter_unmap(struct rds_info_iterator *iter)
105a8c879a7SAndy Grover {
1068690bfa1SAndy Grover if (iter->addr) {
1076114eab5SCong Wang kunmap_atomic(iter->addr);
108a8c879a7SAndy Grover iter->addr = NULL;
109a8c879a7SAndy Grover }
110a8c879a7SAndy Grover }
111a8c879a7SAndy Grover
112a8c879a7SAndy Grover /*
113a8c879a7SAndy Grover * get_user_pages() called flush_dcache_page() on the pages for us.
114a8c879a7SAndy Grover */
rds_info_copy(struct rds_info_iterator * iter,void * data,unsigned long bytes)115a8c879a7SAndy Grover void rds_info_copy(struct rds_info_iterator *iter, void *data,
116a8c879a7SAndy Grover unsigned long bytes)
117a8c879a7SAndy Grover {
118a8c879a7SAndy Grover unsigned long this;
119a8c879a7SAndy Grover
120a8c879a7SAndy Grover while (bytes) {
1218690bfa1SAndy Grover if (!iter->addr)
1226114eab5SCong Wang iter->addr = kmap_atomic(*iter->pages);
123a8c879a7SAndy Grover
124a8c879a7SAndy Grover this = min(bytes, PAGE_SIZE - iter->offset);
125a8c879a7SAndy Grover
126a8c879a7SAndy Grover rdsdebug("page %p addr %p offset %lu this %lu data %p "
127a8c879a7SAndy Grover "bytes %lu\n", *iter->pages, iter->addr,
128a8c879a7SAndy Grover iter->offset, this, data, bytes);
129a8c879a7SAndy Grover
130a8c879a7SAndy Grover memcpy(iter->addr + iter->offset, data, this);
131a8c879a7SAndy Grover
132a8c879a7SAndy Grover data += this;
133a8c879a7SAndy Grover bytes -= this;
134a8c879a7SAndy Grover iter->offset += this;
135a8c879a7SAndy Grover
136a8c879a7SAndy Grover if (iter->offset == PAGE_SIZE) {
1376114eab5SCong Wang kunmap_atomic(iter->addr);
138a8c879a7SAndy Grover iter->addr = NULL;
139a8c879a7SAndy Grover iter->offset = 0;
140a8c879a7SAndy Grover iter->pages++;
141a8c879a7SAndy Grover }
142a8c879a7SAndy Grover }
143a8c879a7SAndy Grover }
144616b757aSAndy Grover EXPORT_SYMBOL_GPL(rds_info_copy);
145a8c879a7SAndy Grover
146a8c879a7SAndy Grover /*
147a8c879a7SAndy Grover * @optval points to the userspace buffer that the information snapshot
148a8c879a7SAndy Grover * will be copied into.
149a8c879a7SAndy Grover *
150a8c879a7SAndy Grover * @optlen on input is the size of the buffer in userspace. @optlen
151a8c879a7SAndy Grover * on output is the size of the requested snapshot in bytes.
152a8c879a7SAndy Grover *
153a8c879a7SAndy Grover * This function returns -errno if there is a failure, particularly -ENOSPC
154a8c879a7SAndy Grover * if the given userspace buffer was not large enough to fit the snapshot.
155a8c879a7SAndy Grover * On success it returns the positive number of bytes of each array element
156a8c879a7SAndy Grover * in the snapshot.
157a8c879a7SAndy Grover */
rds_info_getsockopt(struct socket * sock,int optname,char __user * optval,int __user * optlen)158a8c879a7SAndy Grover int rds_info_getsockopt(struct socket *sock, int optname, char __user *optval,
159a8c879a7SAndy Grover int __user *optlen)
160a8c879a7SAndy Grover {
161a8c879a7SAndy Grover struct rds_info_iterator iter;
162a8c879a7SAndy Grover struct rds_info_lengths lens;
163a8c879a7SAndy Grover unsigned long nr_pages = 0;
164a8c879a7SAndy Grover unsigned long start;
165a8c879a7SAndy Grover rds_info_func func;
166a8c879a7SAndy Grover struct page **pages = NULL;
167a8c879a7SAndy Grover int ret;
168a8c879a7SAndy Grover int len;
169a8c879a7SAndy Grover int total;
170a8c879a7SAndy Grover
171a8c879a7SAndy Grover if (get_user(len, optlen)) {
172a8c879a7SAndy Grover ret = -EFAULT;
173a8c879a7SAndy Grover goto out;
174a8c879a7SAndy Grover }
175a8c879a7SAndy Grover
176a8c879a7SAndy Grover /* check for all kinds of wrapping and the like */
177a8c879a7SAndy Grover start = (unsigned long)optval;
178468b732bSDan Carpenter if (len < 0 || len > INT_MAX - PAGE_SIZE + 1 || start + len < start) {
179a8c879a7SAndy Grover ret = -EINVAL;
180a8c879a7SAndy Grover goto out;
181a8c879a7SAndy Grover }
182a8c879a7SAndy Grover
183a8c879a7SAndy Grover /* a 0 len call is just trying to probe its length */
184a8c879a7SAndy Grover if (len == 0)
185a8c879a7SAndy Grover goto call_func;
186a8c879a7SAndy Grover
187a8c879a7SAndy Grover nr_pages = (PAGE_ALIGN(start + len) - (start & PAGE_MASK))
188a8c879a7SAndy Grover >> PAGE_SHIFT;
189a8c879a7SAndy Grover
1906da2ec56SKees Cook pages = kmalloc_array(nr_pages, sizeof(struct page *), GFP_KERNEL);
1918690bfa1SAndy Grover if (!pages) {
192a8c879a7SAndy Grover ret = -ENOMEM;
193a8c879a7SAndy Grover goto out;
194a8c879a7SAndy Grover }
195dbfe7d74SJohn Hubbard ret = pin_user_pages_fast(start, nr_pages, FOLL_WRITE, pages);
196a8c879a7SAndy Grover if (ret != nr_pages) {
197a8c879a7SAndy Grover if (ret > 0)
198a8c879a7SAndy Grover nr_pages = ret;
199a8c879a7SAndy Grover else
200a8c879a7SAndy Grover nr_pages = 0;
201a8c879a7SAndy Grover ret = -EAGAIN; /* XXX ? */
202a8c879a7SAndy Grover goto out;
203a8c879a7SAndy Grover }
204a8c879a7SAndy Grover
205a8c879a7SAndy Grover rdsdebug("len %d nr_pages %lu\n", len, nr_pages);
206a8c879a7SAndy Grover
207a8c879a7SAndy Grover call_func:
208a8c879a7SAndy Grover func = rds_info_funcs[optname - RDS_INFO_FIRST];
2098690bfa1SAndy Grover if (!func) {
210a8c879a7SAndy Grover ret = -ENOPROTOOPT;
211a8c879a7SAndy Grover goto out;
212a8c879a7SAndy Grover }
213a8c879a7SAndy Grover
214a8c879a7SAndy Grover iter.pages = pages;
215a8c879a7SAndy Grover iter.addr = NULL;
216a8c879a7SAndy Grover iter.offset = start & (PAGE_SIZE - 1);
217a8c879a7SAndy Grover
218a8c879a7SAndy Grover func(sock, len, &iter, &lens);
219a8c879a7SAndy Grover BUG_ON(lens.each == 0);
220a8c879a7SAndy Grover
221a8c879a7SAndy Grover total = lens.nr * lens.each;
222a8c879a7SAndy Grover
223a8c879a7SAndy Grover rds_info_iter_unmap(&iter);
224a8c879a7SAndy Grover
225a8c879a7SAndy Grover if (total > len) {
226a8c879a7SAndy Grover len = total;
227a8c879a7SAndy Grover ret = -ENOSPC;
228a8c879a7SAndy Grover } else {
229a8c879a7SAndy Grover len = total;
230a8c879a7SAndy Grover ret = lens.each;
231a8c879a7SAndy Grover }
232a8c879a7SAndy Grover
233a8c879a7SAndy Grover if (put_user(len, optlen))
234a8c879a7SAndy Grover ret = -EFAULT;
235a8c879a7SAndy Grover
236a8c879a7SAndy Grover out:
237*f78cdbd7SJohn Hubbard if (pages)
238dbfe7d74SJohn Hubbard unpin_user_pages(pages, nr_pages);
239a8c879a7SAndy Grover kfree(pages);
240a8c879a7SAndy Grover
241a8c879a7SAndy Grover return ret;
242a8c879a7SAndy Grover }
243