irq.c 8.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
/*
 * Copyright 2014 IBM Corp.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 */

#include <linux/interrupt.h>
#include <linux/workqueue.h>
#include <linux/sched.h>
#include <linux/wait.h>
#include <linux/slab.h>
#include <linux/pid.h>
#include <asm/cputable.h>
17
#include <misc/cxl-base.h>
18 19

#include "cxl.h"
I
Ian Munsie 已提交
20
#include "trace.h"
21 22 23 24 25 26 27 28 29

static irqreturn_t schedule_cxl_fault(struct cxl_context *ctx, u64 dsisr, u64 dar)
{
	ctx->dsisr = dsisr;
	ctx->dar = dar;
	schedule_work(&ctx->fault_work);
	return IRQ_HANDLED;
}

30
irqreturn_t cxl_irq(int irq, void *data, struct cxl_irq_info *irq_info)
31 32 33 34
{
	struct cxl_context *ctx = data;
	u64 dsisr, dar;

35 36
	dsisr = irq_info->dsisr;
	dar = irq_info->dar;
37

I
Ian Munsie 已提交
38 39
	trace_cxl_psl_irq(ctx, irq, dsisr, dar);

40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
	pr_devel("CXL interrupt %i for afu pe: %i DSISR: %#llx DAR: %#llx\n", irq, ctx->pe, dsisr, dar);

	if (dsisr & CXL_PSL_DSISR_An_DS) {
		/*
		 * We don't inherently need to sleep to handle this, but we do
		 * need to get a ref to the task's mm, which we can't do from
		 * irq context without the potential for a deadlock since it
		 * takes the task_lock. An alternate option would be to keep a
		 * reference to the task's mm the entire time it has cxl open,
		 * but to do that we need to solve the issue where we hold a
		 * ref to the mm, but the mm can hold a ref to the fd after an
		 * mmap preventing anything from being cleaned up.
		 */
		pr_devel("Scheduling segment miss handling for later pe: %i\n", ctx->pe);
		return schedule_cxl_fault(ctx, dsisr, dar);
	}

	if (dsisr & CXL_PSL_DSISR_An_M)
		pr_devel("CXL interrupt: PTE not found\n");
	if (dsisr & CXL_PSL_DSISR_An_P)
		pr_devel("CXL interrupt: Storage protection violation\n");
	if (dsisr & CXL_PSL_DSISR_An_A)
		pr_devel("CXL interrupt: AFU lock access to write through or cache inhibited storage\n");
	if (dsisr & CXL_PSL_DSISR_An_S)
		pr_devel("CXL interrupt: Access was afu_wr or afu_zero\n");
	if (dsisr & CXL_PSL_DSISR_An_K)
		pr_devel("CXL interrupt: Access not permitted by virtual page class key protection\n");

	if (dsisr & CXL_PSL_DSISR_An_DM) {
		/*
		 * In some cases we might be able to handle the fault
		 * immediately if hash_page would succeed, but we still need
		 * the task's mm, which as above we can't get without a lock
		 */
		pr_devel("Scheduling page fault handling for later pe: %i\n", ctx->pe);
		return schedule_cxl_fault(ctx, dsisr, dar);
	}
	if (dsisr & CXL_PSL_DSISR_An_ST)
		WARN(1, "CXL interrupt: Segment Table PTE not found\n");
	if (dsisr & CXL_PSL_DSISR_An_UR)
		pr_devel("CXL interrupt: AURP PTE not found\n");
	if (dsisr & CXL_PSL_DSISR_An_PE)
82 83
		return cxl_ops->handle_psl_slice_error(ctx, dsisr,
						irq_info->errstat);
84
	if (dsisr & CXL_PSL_DSISR_An_AE) {
85
		pr_devel("CXL interrupt: AFU Error 0x%016llx\n", irq_info->afu_err);
86 87 88 89 90 91 92 93 94 95

		if (ctx->pending_afu_err) {
			/*
			 * This shouldn't happen - the PSL treats these errors
			 * as fatal and will have reset the AFU, so there's not
			 * much point buffering multiple AFU errors.
			 * OTOH if we DO ever see a storm of these come in it's
			 * probably best that we log them somewhere:
			 */
			dev_err_ratelimited(&ctx->afu->dev, "CXL AFU Error "
96
					    "undelivered to pe %i: 0x%016llx\n",
97
					    ctx->pe, irq_info->afu_err);
98 99
		} else {
			spin_lock(&ctx->lock);
100
			ctx->afu_err = irq_info->afu_err;
101 102 103 104 105 106
			ctx->pending_afu_err = 1;
			spin_unlock(&ctx->lock);

			wake_up_all(&ctx->wq);
		}

107
		cxl_ops->ack_irq(ctx, CXL_PSL_TFC_An_A, 0);
108
		return IRQ_HANDLED;
109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
	}
	if (dsisr & CXL_PSL_DSISR_An_OC)
		pr_devel("CXL interrupt: OS Context Warning\n");

	WARN(1, "Unhandled CXL PSL IRQ\n");
	return IRQ_HANDLED;
}

static irqreturn_t cxl_irq_afu(int irq, void *data)
{
	struct cxl_context *ctx = data;
	irq_hw_number_t hwirq = irqd_to_hwirq(irq_get_irq_data(irq));
	int irq_off, afu_irq = 1;
	__u16 range;
	int r;

	for (r = 1; r < CXL_IRQ_RANGES; r++) {
		irq_off = hwirq - ctx->irqs.offset[r];
		range = ctx->irqs.range[r];
		if (irq_off >= 0 && irq_off < range) {
			afu_irq += irq_off;
			break;
		}
		afu_irq += range;
	}
	if (unlikely(r >= CXL_IRQ_RANGES)) {
		WARN(1, "Recieved AFU IRQ out of range for pe %i (virq %i hwirq %lx)\n",
		     ctx->pe, irq, hwirq);
		return IRQ_HANDLED;
	}

I
Ian Munsie 已提交
140
	trace_cxl_afu_irq(ctx, afu_irq, irq, hwirq);
141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
	pr_devel("Received AFU interrupt %i for pe: %i (virq %i hwirq %lx)\n",
	       afu_irq, ctx->pe, irq, hwirq);

	if (unlikely(!ctx->irq_bitmap)) {
		WARN(1, "Recieved AFU IRQ for context with no IRQ bitmap\n");
		return IRQ_HANDLED;
	}
	spin_lock(&ctx->lock);
	set_bit(afu_irq - 1, ctx->irq_bitmap);
	ctx->pending_irq = true;
	spin_unlock(&ctx->lock);

	wake_up_all(&ctx->wq);

	return IRQ_HANDLED;
}

unsigned int cxl_map_irq(struct cxl *adapter, irq_hw_number_t hwirq,
159
			 irq_handler_t handler, void *cookie, const char *name)
160 161 162 163 164 165 166 167 168 169 170
{
	unsigned int virq;
	int result;

	/* IRQ Domain? */
	virq = irq_create_mapping(NULL, hwirq);
	if (!virq) {
		dev_warn(&adapter->dev, "cxl_map_irq: irq_create_mapping failed\n");
		return 0;
	}

171 172
	if (cxl_ops->setup_irq)
		cxl_ops->setup_irq(adapter, hwirq, virq);
173 174 175

	pr_devel("hwirq %#lx mapped to virq %u\n", hwirq, virq);

176
	result = request_irq(virq, handler, 0, name, cookie);
177 178 179 180 181 182 183 184 185 186 187 188 189 190
	if (result) {
		dev_warn(&adapter->dev, "cxl_map_irq: request_irq failed: %i\n", result);
		return 0;
	}

	return virq;
}

void cxl_unmap_irq(unsigned int virq, void *cookie)
{
	free_irq(virq, cookie);
	irq_dispose_mapping(virq);
}

191 192 193 194 195 196
int cxl_register_one_irq(struct cxl *adapter,
			irq_handler_t handler,
			void *cookie,
			irq_hw_number_t *dest_hwirq,
			unsigned int *dest_virq,
			const char *name)
197 198 199
{
	int hwirq, virq;

200
	if ((hwirq = cxl_ops->alloc_one_irq(adapter)) < 0)
201 202
		return hwirq;

203
	if (!(virq = cxl_map_irq(adapter, hwirq, handler, cookie, name)))
204 205 206 207 208 209 210 211
		goto err;

	*dest_hwirq = hwirq;
	*dest_virq = virq;

	return 0;

err:
212
	cxl_ops->release_one_irq(adapter, hwirq);
213 214 215
	return -ENOMEM;
}

216
void afu_irq_name_free(struct cxl_context *ctx)
217 218 219 220 221 222 223 224
{
	struct cxl_irq_name *irq_name, *tmp;

	list_for_each_entry_safe(irq_name, tmp, &ctx->irq_names, list) {
		kfree(irq_name->name);
		list_del(&irq_name->list);
		kfree(irq_name);
	}
225 226
}

227
int afu_allocate_irqs(struct cxl_context *ctx, u32 count)
228
{
229 230
	int rc, r, i, j = 1;
	struct cxl_irq_name *irq_name;
231

232 233 234
	/* Initialize the list head to hold irq names */
	INIT_LIST_HEAD(&ctx->irq_names);

235 236
	if ((rc = cxl_ops->alloc_irq_ranges(&ctx->irqs, ctx->afu->adapter,
							count)))
237 238 239 240 241 242 243 244 245 246
		return rc;

	/* Multiplexed PSL Interrupt */
	ctx->irqs.offset[0] = ctx->afu->psl_hwirq;
	ctx->irqs.range[0] = 1;

	ctx->irq_count = count;
	ctx->irq_bitmap = kcalloc(BITS_TO_LONGS(count),
				  sizeof(*ctx->irq_bitmap), GFP_KERNEL);
	if (!ctx->irq_bitmap)
247
		goto out;
248 249 250 251 252 253

	/*
	 * Allocate names first.  If any fail, bail out before allocating
	 * actual hardware IRQs.
	 */
	for (r = 1; r < CXL_IRQ_RANGES; r++) {
254
		for (i = 0; i < ctx->irqs.range[r]; i++) {
255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270
			irq_name = kmalloc(sizeof(struct cxl_irq_name),
					   GFP_KERNEL);
			if (!irq_name)
				goto out;
			irq_name->name = kasprintf(GFP_KERNEL, "cxl-%s-pe%i-%i",
						   dev_name(&ctx->afu->dev),
						   ctx->pe, j);
			if (!irq_name->name) {
				kfree(irq_name);
				goto out;
			}
			/* Add to tail so next look get the correct order */
			list_add_tail(&irq_name->list, &ctx->irq_names);
			j++;
		}
	}
271 272 273
	return 0;

out:
274
	cxl_ops->release_irq_ranges(&ctx->irqs, ctx->afu->adapter);
275 276 277 278
	afu_irq_name_free(ctx);
	return -ENOMEM;
}

279
static void afu_register_hwirqs(struct cxl_context *ctx)
280 281 282 283
{
	irq_hw_number_t hwirq;
	struct cxl_irq_name *irq_name;
	int r,i;
284 285 286

	/* We've allocated all memory now, so let's do the irq allocations */
	irq_name = list_first_entry(&ctx->irq_names, struct cxl_irq_name, list);
287 288 289 290
	for (r = 1; r < CXL_IRQ_RANGES; r++) {
		hwirq = ctx->irqs.offset[r];
		for (i = 0; i < ctx->irqs.range[r]; hwirq++, i++) {
			cxl_map_irq(ctx->afu->adapter, hwirq,
291 292
				    cxl_irq_afu, ctx, irq_name->name);
			irq_name = list_next_entry(irq_name, list);
293 294
		}
	}
295
}
296

297 298 299
int afu_register_irqs(struct cxl_context *ctx, u32 count)
{
	int rc;
300

301 302 303 304 305 306
	rc = afu_allocate_irqs(ctx, count);
	if (rc)
		return rc;

	afu_register_hwirqs(ctx);
	return 0;
307
}
308

309
void afu_release_irqs(struct cxl_context *ctx, void *cookie)
310 311 312 313 314 315 316 317 318 319
{
	irq_hw_number_t hwirq;
	unsigned int virq;
	int r, i;

	for (r = 1; r < CXL_IRQ_RANGES; r++) {
		hwirq = ctx->irqs.offset[r];
		for (i = 0; i < ctx->irqs.range[r]; hwirq++, i++) {
			virq = irq_find_mapping(NULL, hwirq);
			if (virq)
320
				cxl_unmap_irq(virq, cookie);
321 322 323
		}
	}

324
	afu_irq_name_free(ctx);
325
	cxl_ops->release_irq_ranges(&ctx->irqs, ctx->afu->adapter);
326 327

	ctx->irq_count = 0;
328
}