// SPDX-License-Identifier: GPL-2.0-only/* Copyright (c) 2017 The Linux Foundation. All rights reserved. */ #include <linux/kref.h>#include <linux/uaccess.h> #include "msm_gpu.h" void msm_submitqueue_destroy(struct kref *kref){	struct msm_gpu_submitqueue *queue = container_of(kref,		struct msm_gpu_submitqueue, ref); 	kfree(queue);} struct msm_gpu_submitqueue *msm_submitqueue_get(struct msm_file_private *ctx,		u32 id){	struct msm_gpu_submitqueue *entry; 	if (!ctx)		return NULL; 	read_lock(&ctx->queuelock); 	list_for_each_entry(entry, &ctx->submitqueues, node) {		if (entry->id == id) {			kref_get(&entry->ref);			read_unlock(&ctx->queuelock); 			return entry;		}	} 	read_unlock(&ctx->queuelock);	return NULL;} void msm_submitqueue_close(struct msm_file_private *ctx){	struct msm_gpu_submitqueue *entry, *tmp; 	if (!ctx)		return; 	/*	 * No lock needed in close and there won't	 * be any more user ioctls coming our way	 */	list_for_each_entry_safe(entry, tmp, &ctx->submitqueues, node)		msm_submitqueue_put(entry);} int msm_submitqueue_create(struct drm_device *drm, struct msm_file_private *ctx,		u32 prio, u32 flags, u32 *id){	struct msm_drm_private *priv = drm->dev_private;	struct msm_gpu_submitqueue *queue; 	if (!ctx)		return -ENODEV; 	queue = kzalloc(sizeof(*queue), GFP_KERNEL); 	if (!queue)		return -ENOMEM; 	kref_init(&queue->ref);	queue->flags = flags; 	if (priv->gpu) {		if (prio >= priv->gpu->nr_rings)			return -EINVAL; 		queue->prio = prio;	} 	write_lock(&ctx->queuelock); 	queue->id = ctx->queueid++; 	if (id)		*id = queue->id; 	list_add_tail(&queue->node, &ctx->submitqueues); 	write_unlock(&ctx->queuelock); 	return 0;} int msm_submitqueue_init(struct drm_device *drm, struct msm_file_private *ctx){	struct msm_drm_private *priv = drm->dev_private;	int default_prio; 	if (!ctx)		return 0; 	/*	 * Select priority 2 as the "default priority" unless nr_rings is less	 * than 2 and then pick the lowest pirority	 */	default_prio = priv->gpu ?		clamp_t(uint32_t, 2, 0, priv->gpu->nr_rings - 1) : 0; 	INIT_LIST_HEAD(&ctx->submitqueues); 	rwlock_init(&ctx->queuelock); 	return msm_submitqueue_create(drm, ctx, default_prio, 0, NULL);} static int msm_submitqueue_query_faults(struct msm_gpu_submitqueue *queue,		struct drm_msm_submitqueue_query *args){	size_t size = min_t(size_t, args->len, sizeof(queue->faults));	int ret; 	/* If a zero length was passed in, return the data size we expect */	if (!args->len) {		args->len = sizeof(queue->faults);		return 0;	} 	/* Set the length to the actual size of the data */	args->len = size; 	ret = copy_to_user(u64_to_user_ptr(args->data), &queue->faults, size); 	return ret ? -EFAULT : 0;} int msm_submitqueue_query(struct drm_device *drm, struct msm_file_private *ctx,		struct drm_msm_submitqueue_query *args){	struct msm_gpu_submitqueue *queue;	int ret = -EINVAL; 	if (args->pad)		return -EINVAL; 	queue = msm_submitqueue_get(ctx, args->id);	if (!queue)		return -ENOENT; 	if (args->param == MSM_SUBMITQUEUE_PARAM_FAULTS)		ret = msm_submitqueue_query_faults(queue, args); 	msm_submitqueue_put(queue); 	return ret;} int msm_submitqueue_remove(struct msm_file_private *ctx, u32 id){	struct msm_gpu_submitqueue *entry; 	if (!ctx)		return 0; 	/*	 * id 0 is the "default" queue and can't be destroyed	 * by the user	 */	if (!id)		return -ENOENT; 	write_lock(&ctx->queuelock); 	list_for_each_entry(entry, &ctx->submitqueues, node) {		if (entry->id == id) {			list_del(&entry->node);			write_unlock(&ctx->queuelock); 			msm_submitqueue_put(entry);			return 0;		}	} 	write_unlock(&ctx->queuelock);	return -ENOENT;}