81 	struct qld_node *qld;  in qld_list_delete()  local
93 		qld = qdf_container_of(node, struct qld_node, node);  in qld_list_delete()
94 		qdf_mem_free(qld);  in qld_list_delete()
105 	struct qld_node *qld;  in qld_register()  local
123 	qdf_list_for_each(&qld_handle->qld_list, qld, node) {  in qld_register()
124 		if (qld->entry.addr == (uintptr_t)addr) {  in qld_register()
125 			qld_err("%s already registered", qld->entry.name);  in qld_register()
131 	qld = qdf_mem_malloc(sizeof(*qld));  in qld_register()
132 	if (!qld)  in qld_register()
137 	qld->entry.addr =  (uintptr_t)addr;  in qld_register()
138 	qld->entry.size = size;  in qld_register()
139 	qdf_snprintf(qld->entry.name, sizeof(qld->entry.name), "%s", name);  in qld_register()
140 	qdf_list_insert_front(&qld_handle->qld_list, &qld->node);  in qld_register()
149 	struct qld_node *qld  = NULL;  in qld_unregister()  local
159 			qld = cur_entry;  in qld_unregister()
164 	if (qld) {  in qld_unregister()
165 		qdf_list_remove_node(&qld_handle->qld_list, &qld->node);  in qld_unregister()
166 		qld_debug("Delete name=%s, size=%zu", qld->entry.name,  in qld_unregister()
167 			  qld->entry.size);  in qld_unregister()
168 		qdf_mem_free(qld);  in qld_unregister()
178 	struct qld_node *qld  = NULL;  in qld_iterate_list()  local
188 	qdf_list_for_each(&qld_handle->qld_list, qld, node) {  in qld_iterate_list()
189 		(gen_table)(qld_req, &qld->entry);  in qld_iterate_list()