2 This file is provided under a dual BSD/GPLv2 license. When using or
3 redistributing this file, you may do so under either license.
6 Copyright(c) 2014 Intel Corporation.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of version 2 of the GNU General Public License as
9 published by the Free Software Foundation.
11 This program is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 General Public License for more details.
20 Copyright(c) 2014 Intel Corporation.
21 Redistribution and use in source and binary forms, with or without
22 modification, are permitted provided that the following conditions
25 * Redistributions of source code must retain the above copyright
26 notice, this list of conditions and the following disclaimer.
27 * Redistributions in binary form must reproduce the above copyright
28 notice, this list of conditions and the following disclaimer in
29 the documentation and/or other materials provided with the
31 * Neither the name of Intel Corporation nor the names of its
32 contributors may be used to endorse or promote products derived
33 from this software without specific prior written permission.
35 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
36 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
37 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
38 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
39 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
41 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
42 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
43 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
44 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
45 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
47 #include <linux/mutex.h>
48 #include <linux/slab.h>
49 #include <linux/seq_file.h>
50 #include "adf_accel_devices.h"
51 #include "adf_transport_internal.h"
52 #include "adf_transport_access_macros.h"
54 static DEFINE_MUTEX(ring_read_lock);
55 static DEFINE_MUTEX(bank_read_lock);
57 static void *adf_ring_start(struct seq_file *sfile, loff_t *pos)
59 struct adf_etr_ring_data *ring = sfile->private;
61 mutex_lock(&ring_read_lock);
63 return SEQ_START_TOKEN;
65 if (*pos >= (ADF_SIZE_TO_RING_SIZE_IN_BYTES(ring->ring_size) /
66 ADF_MSG_SIZE_TO_BYTES(ring->msg_size)))
69 return ring->base_addr +
70 (ADF_MSG_SIZE_TO_BYTES(ring->msg_size) * (*pos)++);
73 static void *adf_ring_next(struct seq_file *sfile, void *v, loff_t *pos)
75 struct adf_etr_ring_data *ring = sfile->private;
77 if (*pos >= (ADF_SIZE_TO_RING_SIZE_IN_BYTES(ring->ring_size) /
78 ADF_MSG_SIZE_TO_BYTES(ring->msg_size)))
81 return ring->base_addr +
82 (ADF_MSG_SIZE_TO_BYTES(ring->msg_size) * (*pos)++);
85 static int adf_ring_show(struct seq_file *sfile, void *v)
87 struct adf_etr_ring_data *ring = sfile->private;
88 struct adf_etr_bank_data *bank = ring->bank;
90 void __iomem *csr = ring->bank->csr_addr;
93 if (v == SEQ_START_TOKEN) {
94 int head, tail, empty;
96 head = READ_CSR_RING_HEAD(csr, bank->bank_number,
98 tail = READ_CSR_RING_TAIL(csr, bank->bank_number,
100 empty = READ_CSR_E_STAT(csr, bank->bank_number);
102 seq_puts(sfile, "------- Ring configuration -------\n");
103 seq_printf(sfile, "ring num %d, bank num %d\n",
104 ring->ring_number, ring->bank->bank_number);
105 seq_printf(sfile, "head %x, tail %x, empty: %d\n",
106 head, tail, (empty & 1 << ring->ring_number)
107 >> ring->ring_number);
108 seq_printf(sfile, "ring size %d, msg size %d\n",
109 ADF_SIZE_TO_RING_SIZE_IN_BYTES(ring->ring_size),
110 ADF_MSG_SIZE_TO_BYTES(ring->msg_size));
111 seq_puts(sfile, "----------- Ring data ------------\n");
114 seq_printf(sfile, "%p:", msg);
117 for (; i < (ADF_MSG_SIZE_TO_BYTES(ring->msg_size) >> 2); i++) {
118 seq_printf(sfile, " %08X", *(msg + i));
119 if ((ADF_MSG_SIZE_TO_BYTES(ring->msg_size) >> 2) != i + 1 &&
121 seq_printf(sfile, "\n%p:", msg + i + 1);
125 seq_puts(sfile, "\n");
129 static void adf_ring_stop(struct seq_file *sfile, void *v)
131 mutex_unlock(&ring_read_lock);
134 static const struct seq_operations adf_ring_sops = {
135 .start = adf_ring_start,
136 .next = adf_ring_next,
137 .stop = adf_ring_stop,
138 .show = adf_ring_show
141 static int adf_ring_open(struct inode *inode, struct file *file)
143 int ret = seq_open(file, &adf_ring_sops);
146 struct seq_file *seq_f = file->private_data;
148 seq_f->private = inode->i_private;
153 static const struct file_operations adf_ring_debug_fops = {
154 .open = adf_ring_open,
157 .release = seq_release
160 int adf_ring_debugfs_add(struct adf_etr_ring_data *ring, const char *name)
162 struct adf_etr_ring_debug_entry *ring_debug;
165 ring_debug = kzalloc(sizeof(*ring_debug), GFP_KERNEL);
169 strlcpy(ring_debug->ring_name, name, sizeof(ring_debug->ring_name));
170 snprintf(entry_name, sizeof(entry_name), "ring_%02d",
173 ring_debug->debug = debugfs_create_file(entry_name, S_IRUSR,
174 ring->bank->bank_debug_dir,
175 ring, &adf_ring_debug_fops);
176 if (!ring_debug->debug) {
177 pr_err("QAT: Failed to create ring debug entry.\n");
181 ring->ring_debug = ring_debug;
185 void adf_ring_debugfs_rm(struct adf_etr_ring_data *ring)
187 if (ring->ring_debug) {
188 debugfs_remove(ring->ring_debug->debug);
189 kfree(ring->ring_debug);
190 ring->ring_debug = NULL;
194 static void *adf_bank_start(struct seq_file *sfile, loff_t *pos)
196 mutex_lock(&bank_read_lock);
198 return SEQ_START_TOKEN;
200 if (*pos >= ADF_ETR_MAX_RINGS_PER_BANK)
206 static void *adf_bank_next(struct seq_file *sfile, void *v, loff_t *pos)
208 if (++(*pos) >= ADF_ETR_MAX_RINGS_PER_BANK)
214 static int adf_bank_show(struct seq_file *sfile, void *v)
216 struct adf_etr_bank_data *bank = sfile->private;
218 if (v == SEQ_START_TOKEN) {
219 seq_printf(sfile, "------- Bank %d configuration -------\n",
222 int ring_id = *((int *)v) - 1;
223 struct adf_etr_ring_data *ring = &bank->rings[ring_id];
224 void __iomem *csr = bank->csr_addr;
225 int head, tail, empty;
227 if (!(bank->ring_mask & 1 << ring_id))
230 head = READ_CSR_RING_HEAD(csr, bank->bank_number,
232 tail = READ_CSR_RING_TAIL(csr, bank->bank_number,
234 empty = READ_CSR_E_STAT(csr, bank->bank_number);
237 "ring num %02d, head %04x, tail %04x, empty: %d\n",
238 ring->ring_number, head, tail,
239 (empty & 1 << ring->ring_number) >>
245 static void adf_bank_stop(struct seq_file *sfile, void *v)
247 mutex_unlock(&bank_read_lock);
250 static const struct seq_operations adf_bank_sops = {
251 .start = adf_bank_start,
252 .next = adf_bank_next,
253 .stop = adf_bank_stop,
254 .show = adf_bank_show
257 static int adf_bank_open(struct inode *inode, struct file *file)
259 int ret = seq_open(file, &adf_bank_sops);
262 struct seq_file *seq_f = file->private_data;
264 seq_f->private = inode->i_private;
269 static const struct file_operations adf_bank_debug_fops = {
270 .open = adf_bank_open,
273 .release = seq_release
276 int adf_bank_debugfs_add(struct adf_etr_bank_data *bank)
278 struct adf_accel_dev *accel_dev = bank->accel_dev;
279 struct dentry *parent = accel_dev->transport->debug;
282 snprintf(name, sizeof(name), "bank_%02d", bank->bank_number);
283 bank->bank_debug_dir = debugfs_create_dir(name, parent);
284 if (!bank->bank_debug_dir) {
285 pr_err("QAT: Failed to create bank debug dir.\n");
289 bank->bank_debug_cfg = debugfs_create_file("config", S_IRUSR,
290 bank->bank_debug_dir, bank,
291 &adf_bank_debug_fops);
292 if (!bank->bank_debug_cfg) {
293 pr_err("QAT: Failed to create bank debug entry.\n");
294 debugfs_remove(bank->bank_debug_dir);
300 void adf_bank_debugfs_rm(struct adf_etr_bank_data *bank)
302 debugfs_remove(bank->bank_debug_cfg);
303 debugfs_remove(bank->bank_debug_dir);