1*5113495bSYour Name /*
2*5113495bSYour Name * Copyright (c) 2019 The Linux Foundation. All rights reserved.
3*5113495bSYour Name * Copyright (c) 2022-2023 Qualcomm Innovation Center, Inc. All rights reserved.
4*5113495bSYour Name *
5*5113495bSYour Name * Permission to use, copy, modify, and/or distribute this software for
6*5113495bSYour Name * any purpose with or without fee is hereby granted, provided that the
7*5113495bSYour Name * above copyright notice and this permission notice appear in all
8*5113495bSYour Name * copies.
9*5113495bSYour Name *
10*5113495bSYour Name * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
11*5113495bSYour Name * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
12*5113495bSYour Name * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
13*5113495bSYour Name * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
14*5113495bSYour Name * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
15*5113495bSYour Name * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
16*5113495bSYour Name * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
17*5113495bSYour Name * PERFORMANCE OF THIS SOFTWARE.
18*5113495bSYour Name */
19*5113495bSYour Name
20*5113495bSYour Name /**
21*5113495bSYour Name * DOC: qld
22*5113495bSYour Name * QLD: main file of QCA Live Dump (QLD)
23*5113495bSYour Name */
24*5113495bSYour Name
25*5113495bSYour Name #include "qld_priv.h"
26*5113495bSYour Name #include "qld_api.h"
27*5113495bSYour Name #include "qdf_module.h"
28*5113495bSYour Name
29*5113495bSYour Name /* Handle for qld structure */
30*5113495bSYour Name static struct qld_list_handle *qld_handle;
31*5113495bSYour Name
is_qld_enable(void)32*5113495bSYour Name bool is_qld_enable(void)
33*5113495bSYour Name {
34*5113495bSYour Name if (!qld_handle)
35*5113495bSYour Name return false;
36*5113495bSYour Name
37*5113495bSYour Name return true;
38*5113495bSYour Name }
39*5113495bSYour Name
40*5113495bSYour Name qdf_export_symbol(is_qld_enable);
41*5113495bSYour Name
qld_list_init(uint32_t max_list)42*5113495bSYour Name int qld_list_init(uint32_t max_list)
43*5113495bSYour Name {
44*5113495bSYour Name if (!max_list)
45*5113495bSYour Name return -EINVAL;
46*5113495bSYour Name
47*5113495bSYour Name qld_handle = qdf_mem_malloc(sizeof(*qld_handle));
48*5113495bSYour Name
49*5113495bSYour Name if (!qld_handle)
50*5113495bSYour Name return -ENOMEM;
51*5113495bSYour Name
52*5113495bSYour Name qdf_spinlock_create(&qld_handle->qld_lock);
53*5113495bSYour Name qld_handle->qld_max_list = max_list;
54*5113495bSYour Name qdf_list_create(&qld_handle->qld_list, qld_handle->qld_max_list);
55*5113495bSYour Name qld_debug("LIST init with max size of %u", qld_handle->qld_max_list);
56*5113495bSYour Name return 0;
57*5113495bSYour Name }
58*5113495bSYour Name
59*5113495bSYour Name qdf_export_symbol(qld_list_init);
60*5113495bSYour Name
qld_list_deinit(void)61*5113495bSYour Name int qld_list_deinit(void)
62*5113495bSYour Name {
63*5113495bSYour Name if (!qld_handle) {
64*5113495bSYour Name qld_err("Handle NULL");
65*5113495bSYour Name return -EINVAL;
66*5113495bSYour Name }
67*5113495bSYour Name /* Delete the list */
68*5113495bSYour Name qld_list_delete();
69*5113495bSYour Name qdf_list_destroy(&qld_handle->qld_list);
70*5113495bSYour Name qdf_spinlock_destroy(&qld_handle->qld_lock);
71*5113495bSYour Name qdf_mem_free(qld_handle);
72*5113495bSYour Name qld_handle = NULL;
73*5113495bSYour Name qld_debug("LIST De-initialized");
74*5113495bSYour Name return 0;
75*5113495bSYour Name }
76*5113495bSYour Name
77*5113495bSYour Name qdf_export_symbol(qld_list_deinit);
78*5113495bSYour Name
qld_list_delete(void)79*5113495bSYour Name int qld_list_delete(void)
80*5113495bSYour Name {
81*5113495bSYour Name struct qld_node *qld;
82*5113495bSYour Name qdf_list_node_t *node = NULL;
83*5113495bSYour Name qdf_list_t *list;
84*5113495bSYour Name
85*5113495bSYour Name if (!qld_handle) {
86*5113495bSYour Name qld_err("Handle NULL");
87*5113495bSYour Name return -EINVAL;
88*5113495bSYour Name }
89*5113495bSYour Name list = &qld_handle->qld_list;
90*5113495bSYour Name qdf_spinlock_acquire(&qld_handle->qld_lock);
91*5113495bSYour Name /* Check and remove the elements of list */
92*5113495bSYour Name while (qdf_list_remove_front(list, &node) == QDF_STATUS_SUCCESS) {
93*5113495bSYour Name qld = qdf_container_of(node, struct qld_node, node);
94*5113495bSYour Name qdf_mem_free(qld);
95*5113495bSYour Name }
96*5113495bSYour Name qdf_spinlock_release(&qld_handle->qld_lock);
97*5113495bSYour Name qld_debug("LIST Emptied");
98*5113495bSYour Name return 0;
99*5113495bSYour Name }
100*5113495bSYour Name
101*5113495bSYour Name qdf_export_symbol(qld_list_delete);
102*5113495bSYour Name
qld_register(void * addr,size_t size,char * name)103*5113495bSYour Name int qld_register(void *addr, size_t size, char *name)
104*5113495bSYour Name {
105*5113495bSYour Name struct qld_node *qld;
106*5113495bSYour Name uint32_t list_count = 0;
107*5113495bSYour Name
108*5113495bSYour Name if (!qld_handle || !addr) {
109*5113495bSYour Name qld_debug("Handle or address is NULL");
110*5113495bSYour Name return -EINVAL;
111*5113495bSYour Name }
112*5113495bSYour Name
113*5113495bSYour Name if ((qld_get_list_count(&list_count) != 0)) {
114*5113495bSYour Name qdf_err("QLD: Invalid list count");
115*5113495bSYour Name return -EINVAL;
116*5113495bSYour Name }
117*5113495bSYour Name if (list_count >= qld_handle->qld_max_list) {
118*5113495bSYour Name qld_err("List full,reg failed.Increase list size");
119*5113495bSYour Name return -EINVAL;
120*5113495bSYour Name }
121*5113495bSYour Name /* Check if data is already registered */
122*5113495bSYour Name qdf_spinlock_acquire(&qld_handle->qld_lock);
123*5113495bSYour Name qdf_list_for_each(&qld_handle->qld_list, qld, node) {
124*5113495bSYour Name if (qld->entry.addr == (uintptr_t)addr) {
125*5113495bSYour Name qld_err("%s already registered", qld->entry.name);
126*5113495bSYour Name qdf_spinlock_release(&qld_handle->qld_lock);
127*5113495bSYour Name return -EINVAL;
128*5113495bSYour Name }
129*5113495bSYour Name }
130*5113495bSYour Name qdf_spinlock_release(&qld_handle->qld_lock);
131*5113495bSYour Name qld = qdf_mem_malloc(sizeof(*qld));
132*5113495bSYour Name if (!qld)
133*5113495bSYour Name return -ENOMEM;
134*5113495bSYour Name
135*5113495bSYour Name qld_debug("Insert addr=%pK size=%zu name=%s", (void *)addr, size, name);
136*5113495bSYour Name qdf_spinlock_acquire(&qld_handle->qld_lock);
137*5113495bSYour Name qld->entry.addr = (uintptr_t)addr;
138*5113495bSYour Name qld->entry.size = size;
139*5113495bSYour Name qdf_snprintf(qld->entry.name, sizeof(qld->entry.name), "%s", name);
140*5113495bSYour Name qdf_list_insert_front(&qld_handle->qld_list, &qld->node);
141*5113495bSYour Name qdf_spinlock_release(&qld_handle->qld_lock);
142*5113495bSYour Name return 0;
143*5113495bSYour Name }
144*5113495bSYour Name
145*5113495bSYour Name qdf_export_symbol(qld_register);
146*5113495bSYour Name
qld_unregister(void * addr)147*5113495bSYour Name int qld_unregister(void *addr)
148*5113495bSYour Name {
149*5113495bSYour Name struct qld_node *qld = NULL;
150*5113495bSYour Name struct qld_node *cur_entry;
151*5113495bSYour Name
152*5113495bSYour Name if (!qld_handle || !addr) {
153*5113495bSYour Name qld_err("Handle or address is NULL");
154*5113495bSYour Name return -EINVAL;
155*5113495bSYour Name }
156*5113495bSYour Name qdf_spinlock_acquire(&qld_handle->qld_lock);
157*5113495bSYour Name qdf_list_for_each(&qld_handle->qld_list, cur_entry, node) {
158*5113495bSYour Name if (cur_entry->entry.addr == (uintptr_t)addr) {
159*5113495bSYour Name qld = cur_entry;
160*5113495bSYour Name break;
161*5113495bSYour Name }
162*5113495bSYour Name }
163*5113495bSYour Name
164*5113495bSYour Name if (qld) {
165*5113495bSYour Name qdf_list_remove_node(&qld_handle->qld_list, &qld->node);
166*5113495bSYour Name qld_debug("Delete name=%s, size=%zu", qld->entry.name,
167*5113495bSYour Name qld->entry.size);
168*5113495bSYour Name qdf_mem_free(qld);
169*5113495bSYour Name }
170*5113495bSYour Name qdf_spinlock_release(&qld_handle->qld_lock);
171*5113495bSYour Name return 0;
172*5113495bSYour Name }
173*5113495bSYour Name
174*5113495bSYour Name qdf_export_symbol(qld_unregister);
175*5113495bSYour Name
qld_iterate_list(qld_iter_func gen_table,void * qld_req)176*5113495bSYour Name int qld_iterate_list(qld_iter_func gen_table, void *qld_req)
177*5113495bSYour Name {
178*5113495bSYour Name struct qld_node *qld = NULL;
179*5113495bSYour Name
180*5113495bSYour Name if (!qld_handle)
181*5113495bSYour Name return -EINVAL;
182*5113495bSYour Name
183*5113495bSYour Name if (!qld_req || !gen_table) {
184*5113495bSYour Name qld_err("req buffer or func is NULL %s", __func__);
185*5113495bSYour Name return -EINVAL;
186*5113495bSYour Name }
187*5113495bSYour Name qdf_spinlock_acquire(&qld_handle->qld_lock);
188*5113495bSYour Name qdf_list_for_each(&qld_handle->qld_list, qld, node) {
189*5113495bSYour Name (gen_table)(qld_req, &qld->entry);
190*5113495bSYour Name }
191*5113495bSYour Name qdf_spinlock_release(&qld_handle->qld_lock);
192*5113495bSYour Name return 0;
193*5113495bSYour Name }
194*5113495bSYour Name
195*5113495bSYour Name qdf_export_symbol(qld_iterate_list);
196*5113495bSYour Name
qld_get_list_count(uint32_t * list_count)197*5113495bSYour Name int qld_get_list_count(uint32_t *list_count)
198*5113495bSYour Name {
199*5113495bSYour Name if (!qld_handle) {
200*5113495bSYour Name qld_err("Handle NULL");
201*5113495bSYour Name return -EINVAL;
202*5113495bSYour Name }
203*5113495bSYour Name *list_count = qld_handle->qld_list.count;
204*5113495bSYour Name return 0;
205*5113495bSYour Name }
206*5113495bSYour Name
207*5113495bSYour Name qdf_export_symbol(qld_get_list_count);
208