rjw | 1f88458 | 2022-01-06 17:20:42 +0800 | [diff] [blame^] | 1 | /* |
| 2 | * AMD Cryptographic Coprocessor (CCP) driver |
| 3 | * |
| 4 | * Copyright (C) 2013,2017 Advanced Micro Devices, Inc. |
| 5 | * |
| 6 | * Author: Tom Lendacky <thomas.lendacky@amd.com> |
| 7 | * Author: Gary R Hook <gary.hook@amd.com> |
| 8 | * |
| 9 | * This program is free software; you can redistribute it and/or modify |
| 10 | * it under the terms of the GNU General Public License version 2 as |
| 11 | * published by the Free Software Foundation. |
| 12 | */ |
| 13 | |
| 14 | #include <linux/kernel.h> |
| 15 | #include <linux/kthread.h> |
| 16 | #include <linux/sched.h> |
| 17 | #include <linux/interrupt.h> |
| 18 | #include <linux/spinlock.h> |
| 19 | #include <linux/spinlock_types.h> |
| 20 | #include <linux/types.h> |
| 21 | #include <linux/mutex.h> |
| 22 | #include <linux/delay.h> |
| 23 | #include <linux/hw_random.h> |
| 24 | #include <linux/cpu.h> |
| 25 | #ifdef CONFIG_X86 |
| 26 | #include <asm/cpu_device_id.h> |
| 27 | #endif |
| 28 | #include <linux/ccp.h> |
| 29 | |
| 30 | #include "ccp-dev.h" |
| 31 | |
| 32 | struct ccp_tasklet_data { |
| 33 | struct completion completion; |
| 34 | struct ccp_cmd *cmd; |
| 35 | }; |
| 36 | |
| 37 | /* Human-readable error strings */ |
| 38 | #define CCP_MAX_ERROR_CODE 64 |
| 39 | static char *ccp_error_codes[] = { |
| 40 | "", |
| 41 | "ILLEGAL_ENGINE", |
| 42 | "ILLEGAL_KEY_ID", |
| 43 | "ILLEGAL_FUNCTION_TYPE", |
| 44 | "ILLEGAL_FUNCTION_MODE", |
| 45 | "ILLEGAL_FUNCTION_ENCRYPT", |
| 46 | "ILLEGAL_FUNCTION_SIZE", |
| 47 | "Zlib_MISSING_INIT_EOM", |
| 48 | "ILLEGAL_FUNCTION_RSVD", |
| 49 | "ILLEGAL_BUFFER_LENGTH", |
| 50 | "VLSB_FAULT", |
| 51 | "ILLEGAL_MEM_ADDR", |
| 52 | "ILLEGAL_MEM_SEL", |
| 53 | "ILLEGAL_CONTEXT_ID", |
| 54 | "ILLEGAL_KEY_ADDR", |
| 55 | "0xF Reserved", |
| 56 | "Zlib_ILLEGAL_MULTI_QUEUE", |
| 57 | "Zlib_ILLEGAL_JOBID_CHANGE", |
| 58 | "CMD_TIMEOUT", |
| 59 | "IDMA0_AXI_SLVERR", |
| 60 | "IDMA0_AXI_DECERR", |
| 61 | "0x15 Reserved", |
| 62 | "IDMA1_AXI_SLAVE_FAULT", |
| 63 | "IDMA1_AIXI_DECERR", |
| 64 | "0x18 Reserved", |
| 65 | "ZLIBVHB_AXI_SLVERR", |
| 66 | "ZLIBVHB_AXI_DECERR", |
| 67 | "0x1B Reserved", |
| 68 | "ZLIB_UNEXPECTED_EOM", |
| 69 | "ZLIB_EXTRA_DATA", |
| 70 | "ZLIB_BTYPE", |
| 71 | "ZLIB_UNDEFINED_SYMBOL", |
| 72 | "ZLIB_UNDEFINED_DISTANCE_S", |
| 73 | "ZLIB_CODE_LENGTH_SYMBOL", |
| 74 | "ZLIB _VHB_ILLEGAL_FETCH", |
| 75 | "ZLIB_UNCOMPRESSED_LEN", |
| 76 | "ZLIB_LIMIT_REACHED", |
| 77 | "ZLIB_CHECKSUM_MISMATCH0", |
| 78 | "ODMA0_AXI_SLVERR", |
| 79 | "ODMA0_AXI_DECERR", |
| 80 | "0x28 Reserved", |
| 81 | "ODMA1_AXI_SLVERR", |
| 82 | "ODMA1_AXI_DECERR", |
| 83 | }; |
| 84 | |
| 85 | void ccp_log_error(struct ccp_device *d, unsigned int e) |
| 86 | { |
| 87 | if (WARN_ON(e >= CCP_MAX_ERROR_CODE)) |
| 88 | return; |
| 89 | |
| 90 | if (e < ARRAY_SIZE(ccp_error_codes)) |
| 91 | dev_err(d->dev, "CCP error %d: %s\n", e, ccp_error_codes[e]); |
| 92 | else |
| 93 | dev_err(d->dev, "CCP error %d: Unknown Error\n", e); |
| 94 | } |
| 95 | |
| 96 | /* List of CCPs, CCP count, read-write access lock, and access functions |
| 97 | * |
| 98 | * Lock structure: get ccp_unit_lock for reading whenever we need to |
| 99 | * examine the CCP list. While holding it for reading we can acquire |
| 100 | * the RR lock to update the round-robin next-CCP pointer. The unit lock |
| 101 | * must be acquired before the RR lock. |
| 102 | * |
| 103 | * If the unit-lock is acquired for writing, we have total control over |
| 104 | * the list, so there's no value in getting the RR lock. |
| 105 | */ |
| 106 | static DEFINE_RWLOCK(ccp_unit_lock); |
| 107 | static LIST_HEAD(ccp_units); |
| 108 | |
| 109 | /* Round-robin counter */ |
| 110 | static DEFINE_SPINLOCK(ccp_rr_lock); |
| 111 | static struct ccp_device *ccp_rr; |
| 112 | |
| 113 | /** |
| 114 | * ccp_add_device - add a CCP device to the list |
| 115 | * |
| 116 | * @ccp: ccp_device struct pointer |
| 117 | * |
| 118 | * Put this CCP on the unit list, which makes it available |
| 119 | * for use. |
| 120 | * |
| 121 | * Returns zero if a CCP device is present, -ENODEV otherwise. |
| 122 | */ |
| 123 | void ccp_add_device(struct ccp_device *ccp) |
| 124 | { |
| 125 | unsigned long flags; |
| 126 | |
| 127 | write_lock_irqsave(&ccp_unit_lock, flags); |
| 128 | list_add_tail(&ccp->entry, &ccp_units); |
| 129 | if (!ccp_rr) |
| 130 | /* We already have the list lock (we're first) so this |
| 131 | * pointer can't change on us. Set its initial value. |
| 132 | */ |
| 133 | ccp_rr = ccp; |
| 134 | write_unlock_irqrestore(&ccp_unit_lock, flags); |
| 135 | } |
| 136 | |
| 137 | /** |
| 138 | * ccp_del_device - remove a CCP device from the list |
| 139 | * |
| 140 | * @ccp: ccp_device struct pointer |
| 141 | * |
| 142 | * Remove this unit from the list of devices. If the next device |
| 143 | * up for use is this one, adjust the pointer. If this is the last |
| 144 | * device, NULL the pointer. |
| 145 | */ |
| 146 | void ccp_del_device(struct ccp_device *ccp) |
| 147 | { |
| 148 | unsigned long flags; |
| 149 | |
| 150 | write_lock_irqsave(&ccp_unit_lock, flags); |
| 151 | if (ccp_rr == ccp) { |
| 152 | /* ccp_unit_lock is read/write; any read access |
| 153 | * will be suspended while we make changes to the |
| 154 | * list and RR pointer. |
| 155 | */ |
| 156 | if (list_is_last(&ccp_rr->entry, &ccp_units)) |
| 157 | ccp_rr = list_first_entry(&ccp_units, struct ccp_device, |
| 158 | entry); |
| 159 | else |
| 160 | ccp_rr = list_next_entry(ccp_rr, entry); |
| 161 | } |
| 162 | list_del(&ccp->entry); |
| 163 | if (list_empty(&ccp_units)) |
| 164 | ccp_rr = NULL; |
| 165 | write_unlock_irqrestore(&ccp_unit_lock, flags); |
| 166 | } |
| 167 | |
| 168 | |
| 169 | |
| 170 | int ccp_register_rng(struct ccp_device *ccp) |
| 171 | { |
| 172 | int ret = 0; |
| 173 | |
| 174 | dev_dbg(ccp->dev, "Registering RNG...\n"); |
| 175 | /* Register an RNG */ |
| 176 | ccp->hwrng.name = ccp->rngname; |
| 177 | ccp->hwrng.read = ccp_trng_read; |
| 178 | ret = hwrng_register(&ccp->hwrng); |
| 179 | if (ret) |
| 180 | dev_err(ccp->dev, "error registering hwrng (%d)\n", ret); |
| 181 | |
| 182 | return ret; |
| 183 | } |
| 184 | |
| 185 | void ccp_unregister_rng(struct ccp_device *ccp) |
| 186 | { |
| 187 | if (ccp->hwrng.name) |
| 188 | hwrng_unregister(&ccp->hwrng); |
| 189 | } |
| 190 | |
| 191 | static struct ccp_device *ccp_get_device(void) |
| 192 | { |
| 193 | unsigned long flags; |
| 194 | struct ccp_device *dp = NULL; |
| 195 | |
| 196 | /* We round-robin through the unit list. |
| 197 | * The (ccp_rr) pointer refers to the next unit to use. |
| 198 | */ |
| 199 | read_lock_irqsave(&ccp_unit_lock, flags); |
| 200 | if (!list_empty(&ccp_units)) { |
| 201 | spin_lock(&ccp_rr_lock); |
| 202 | dp = ccp_rr; |
| 203 | if (list_is_last(&ccp_rr->entry, &ccp_units)) |
| 204 | ccp_rr = list_first_entry(&ccp_units, struct ccp_device, |
| 205 | entry); |
| 206 | else |
| 207 | ccp_rr = list_next_entry(ccp_rr, entry); |
| 208 | spin_unlock(&ccp_rr_lock); |
| 209 | } |
| 210 | read_unlock_irqrestore(&ccp_unit_lock, flags); |
| 211 | |
| 212 | return dp; |
| 213 | } |
| 214 | |
| 215 | /** |
| 216 | * ccp_present - check if a CCP device is present |
| 217 | * |
| 218 | * Returns zero if a CCP device is present, -ENODEV otherwise. |
| 219 | */ |
| 220 | int ccp_present(void) |
| 221 | { |
| 222 | unsigned long flags; |
| 223 | int ret; |
| 224 | |
| 225 | read_lock_irqsave(&ccp_unit_lock, flags); |
| 226 | ret = list_empty(&ccp_units); |
| 227 | read_unlock_irqrestore(&ccp_unit_lock, flags); |
| 228 | |
| 229 | return ret ? -ENODEV : 0; |
| 230 | } |
| 231 | EXPORT_SYMBOL_GPL(ccp_present); |
| 232 | |
| 233 | /** |
| 234 | * ccp_version - get the version of the CCP device |
| 235 | * |
| 236 | * Returns the version from the first unit on the list; |
| 237 | * otherwise a zero if no CCP device is present |
| 238 | */ |
| 239 | unsigned int ccp_version(void) |
| 240 | { |
| 241 | struct ccp_device *dp; |
| 242 | unsigned long flags; |
| 243 | int ret = 0; |
| 244 | |
| 245 | read_lock_irqsave(&ccp_unit_lock, flags); |
| 246 | if (!list_empty(&ccp_units)) { |
| 247 | dp = list_first_entry(&ccp_units, struct ccp_device, entry); |
| 248 | ret = dp->vdata->version; |
| 249 | } |
| 250 | read_unlock_irqrestore(&ccp_unit_lock, flags); |
| 251 | |
| 252 | return ret; |
| 253 | } |
| 254 | EXPORT_SYMBOL_GPL(ccp_version); |
| 255 | |
| 256 | /** |
| 257 | * ccp_enqueue_cmd - queue an operation for processing by the CCP |
| 258 | * |
| 259 | * @cmd: ccp_cmd struct to be processed |
| 260 | * |
| 261 | * Queue a cmd to be processed by the CCP. If queueing the cmd |
| 262 | * would exceed the defined length of the cmd queue the cmd will |
| 263 | * only be queued if the CCP_CMD_MAY_BACKLOG flag is set and will |
| 264 | * result in a return code of -EBUSY. |
| 265 | * |
| 266 | * The callback routine specified in the ccp_cmd struct will be |
| 267 | * called to notify the caller of completion (if the cmd was not |
| 268 | * backlogged) or advancement out of the backlog. If the cmd has |
| 269 | * advanced out of the backlog the "err" value of the callback |
| 270 | * will be -EINPROGRESS. Any other "err" value during callback is |
| 271 | * the result of the operation. |
| 272 | * |
| 273 | * The cmd has been successfully queued if: |
| 274 | * the return code is -EINPROGRESS or |
| 275 | * the return code is -EBUSY and CCP_CMD_MAY_BACKLOG flag is set |
| 276 | */ |
| 277 | int ccp_enqueue_cmd(struct ccp_cmd *cmd) |
| 278 | { |
| 279 | struct ccp_device *ccp; |
| 280 | unsigned long flags; |
| 281 | unsigned int i; |
| 282 | int ret; |
| 283 | |
| 284 | /* Some commands might need to be sent to a specific device */ |
| 285 | ccp = cmd->ccp ? cmd->ccp : ccp_get_device(); |
| 286 | |
| 287 | if (!ccp) |
| 288 | return -ENODEV; |
| 289 | |
| 290 | /* Caller must supply a callback routine */ |
| 291 | if (!cmd->callback) |
| 292 | return -EINVAL; |
| 293 | |
| 294 | cmd->ccp = ccp; |
| 295 | |
| 296 | spin_lock_irqsave(&ccp->cmd_lock, flags); |
| 297 | |
| 298 | i = ccp->cmd_q_count; |
| 299 | |
| 300 | if (ccp->cmd_count >= MAX_CMD_QLEN) { |
| 301 | ret = -EBUSY; |
| 302 | if (cmd->flags & CCP_CMD_MAY_BACKLOG) |
| 303 | list_add_tail(&cmd->entry, &ccp->backlog); |
| 304 | } else { |
| 305 | ret = -EINPROGRESS; |
| 306 | ccp->cmd_count++; |
| 307 | list_add_tail(&cmd->entry, &ccp->cmd); |
| 308 | |
| 309 | /* Find an idle queue */ |
| 310 | if (!ccp->suspending) { |
| 311 | for (i = 0; i < ccp->cmd_q_count; i++) { |
| 312 | if (ccp->cmd_q[i].active) |
| 313 | continue; |
| 314 | |
| 315 | break; |
| 316 | } |
| 317 | } |
| 318 | } |
| 319 | |
| 320 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 321 | |
| 322 | /* If we found an idle queue, wake it up */ |
| 323 | if (i < ccp->cmd_q_count) |
| 324 | wake_up_process(ccp->cmd_q[i].kthread); |
| 325 | |
| 326 | return ret; |
| 327 | } |
| 328 | EXPORT_SYMBOL_GPL(ccp_enqueue_cmd); |
| 329 | |
| 330 | static void ccp_do_cmd_backlog(struct work_struct *work) |
| 331 | { |
| 332 | struct ccp_cmd *cmd = container_of(work, struct ccp_cmd, work); |
| 333 | struct ccp_device *ccp = cmd->ccp; |
| 334 | unsigned long flags; |
| 335 | unsigned int i; |
| 336 | |
| 337 | cmd->callback(cmd->data, -EINPROGRESS); |
| 338 | |
| 339 | spin_lock_irqsave(&ccp->cmd_lock, flags); |
| 340 | |
| 341 | ccp->cmd_count++; |
| 342 | list_add_tail(&cmd->entry, &ccp->cmd); |
| 343 | |
| 344 | /* Find an idle queue */ |
| 345 | for (i = 0; i < ccp->cmd_q_count; i++) { |
| 346 | if (ccp->cmd_q[i].active) |
| 347 | continue; |
| 348 | |
| 349 | break; |
| 350 | } |
| 351 | |
| 352 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 353 | |
| 354 | /* If we found an idle queue, wake it up */ |
| 355 | if (i < ccp->cmd_q_count) |
| 356 | wake_up_process(ccp->cmd_q[i].kthread); |
| 357 | } |
| 358 | |
| 359 | static struct ccp_cmd *ccp_dequeue_cmd(struct ccp_cmd_queue *cmd_q) |
| 360 | { |
| 361 | struct ccp_device *ccp = cmd_q->ccp; |
| 362 | struct ccp_cmd *cmd = NULL; |
| 363 | struct ccp_cmd *backlog = NULL; |
| 364 | unsigned long flags; |
| 365 | |
| 366 | spin_lock_irqsave(&ccp->cmd_lock, flags); |
| 367 | |
| 368 | cmd_q->active = 0; |
| 369 | |
| 370 | if (ccp->suspending) { |
| 371 | cmd_q->suspended = 1; |
| 372 | |
| 373 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 374 | wake_up_interruptible(&ccp->suspend_queue); |
| 375 | |
| 376 | return NULL; |
| 377 | } |
| 378 | |
| 379 | if (ccp->cmd_count) { |
| 380 | cmd_q->active = 1; |
| 381 | |
| 382 | cmd = list_first_entry(&ccp->cmd, struct ccp_cmd, entry); |
| 383 | list_del(&cmd->entry); |
| 384 | |
| 385 | ccp->cmd_count--; |
| 386 | } |
| 387 | |
| 388 | if (!list_empty(&ccp->backlog)) { |
| 389 | backlog = list_first_entry(&ccp->backlog, struct ccp_cmd, |
| 390 | entry); |
| 391 | list_del(&backlog->entry); |
| 392 | } |
| 393 | |
| 394 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 395 | |
| 396 | if (backlog) { |
| 397 | INIT_WORK(&backlog->work, ccp_do_cmd_backlog); |
| 398 | schedule_work(&backlog->work); |
| 399 | } |
| 400 | |
| 401 | return cmd; |
| 402 | } |
| 403 | |
| 404 | static void ccp_do_cmd_complete(unsigned long data) |
| 405 | { |
| 406 | struct ccp_tasklet_data *tdata = (struct ccp_tasklet_data *)data; |
| 407 | struct ccp_cmd *cmd = tdata->cmd; |
| 408 | |
| 409 | cmd->callback(cmd->data, cmd->ret); |
| 410 | |
| 411 | complete(&tdata->completion); |
| 412 | } |
| 413 | |
| 414 | /** |
| 415 | * ccp_cmd_queue_thread - create a kernel thread to manage a CCP queue |
| 416 | * |
| 417 | * @data: thread-specific data |
| 418 | */ |
| 419 | int ccp_cmd_queue_thread(void *data) |
| 420 | { |
| 421 | struct ccp_cmd_queue *cmd_q = (struct ccp_cmd_queue *)data; |
| 422 | struct ccp_cmd *cmd; |
| 423 | struct ccp_tasklet_data tdata; |
| 424 | struct tasklet_struct tasklet; |
| 425 | |
| 426 | tasklet_init(&tasklet, ccp_do_cmd_complete, (unsigned long)&tdata); |
| 427 | |
| 428 | set_current_state(TASK_INTERRUPTIBLE); |
| 429 | while (!kthread_should_stop()) { |
| 430 | schedule(); |
| 431 | |
| 432 | set_current_state(TASK_INTERRUPTIBLE); |
| 433 | |
| 434 | cmd = ccp_dequeue_cmd(cmd_q); |
| 435 | if (!cmd) |
| 436 | continue; |
| 437 | |
| 438 | __set_current_state(TASK_RUNNING); |
| 439 | |
| 440 | /* Execute the command */ |
| 441 | cmd->ret = ccp_run_cmd(cmd_q, cmd); |
| 442 | |
| 443 | /* Schedule the completion callback */ |
| 444 | tdata.cmd = cmd; |
| 445 | init_completion(&tdata.completion); |
| 446 | tasklet_schedule(&tasklet); |
| 447 | wait_for_completion(&tdata.completion); |
| 448 | } |
| 449 | |
| 450 | __set_current_state(TASK_RUNNING); |
| 451 | |
| 452 | return 0; |
| 453 | } |
| 454 | |
| 455 | /** |
| 456 | * ccp_alloc_struct - allocate and initialize the ccp_device struct |
| 457 | * |
| 458 | * @dev: device struct of the CCP |
| 459 | */ |
| 460 | struct ccp_device *ccp_alloc_struct(struct sp_device *sp) |
| 461 | { |
| 462 | struct device *dev = sp->dev; |
| 463 | struct ccp_device *ccp; |
| 464 | |
| 465 | ccp = devm_kzalloc(dev, sizeof(*ccp), GFP_KERNEL); |
| 466 | if (!ccp) |
| 467 | return NULL; |
| 468 | ccp->dev = dev; |
| 469 | ccp->sp = sp; |
| 470 | ccp->axcache = sp->axcache; |
| 471 | |
| 472 | INIT_LIST_HEAD(&ccp->cmd); |
| 473 | INIT_LIST_HEAD(&ccp->backlog); |
| 474 | |
| 475 | spin_lock_init(&ccp->cmd_lock); |
| 476 | mutex_init(&ccp->req_mutex); |
| 477 | mutex_init(&ccp->sb_mutex); |
| 478 | ccp->sb_count = KSB_COUNT; |
| 479 | ccp->sb_start = 0; |
| 480 | |
| 481 | /* Initialize the wait queues */ |
| 482 | init_waitqueue_head(&ccp->sb_queue); |
| 483 | init_waitqueue_head(&ccp->suspend_queue); |
| 484 | |
| 485 | snprintf(ccp->name, MAX_CCP_NAME_LEN, "ccp-%u", sp->ord); |
| 486 | snprintf(ccp->rngname, MAX_CCP_NAME_LEN, "ccp-%u-rng", sp->ord); |
| 487 | |
| 488 | return ccp; |
| 489 | } |
| 490 | |
| 491 | int ccp_trng_read(struct hwrng *rng, void *data, size_t max, bool wait) |
| 492 | { |
| 493 | struct ccp_device *ccp = container_of(rng, struct ccp_device, hwrng); |
| 494 | u32 trng_value; |
| 495 | int len = min_t(int, sizeof(trng_value), max); |
| 496 | |
| 497 | /* Locking is provided by the caller so we can update device |
| 498 | * hwrng-related fields safely |
| 499 | */ |
| 500 | trng_value = ioread32(ccp->io_regs + TRNG_OUT_REG); |
| 501 | if (!trng_value) { |
| 502 | /* Zero is returned if not data is available or if a |
| 503 | * bad-entropy error is present. Assume an error if |
| 504 | * we exceed TRNG_RETRIES reads of zero. |
| 505 | */ |
| 506 | if (ccp->hwrng_retries++ > TRNG_RETRIES) |
| 507 | return -EIO; |
| 508 | |
| 509 | return 0; |
| 510 | } |
| 511 | |
| 512 | /* Reset the counter and save the rng value */ |
| 513 | ccp->hwrng_retries = 0; |
| 514 | memcpy(data, &trng_value, len); |
| 515 | |
| 516 | return len; |
| 517 | } |
| 518 | |
| 519 | #ifdef CONFIG_PM |
| 520 | bool ccp_queues_suspended(struct ccp_device *ccp) |
| 521 | { |
| 522 | unsigned int suspended = 0; |
| 523 | unsigned long flags; |
| 524 | unsigned int i; |
| 525 | |
| 526 | spin_lock_irqsave(&ccp->cmd_lock, flags); |
| 527 | |
| 528 | for (i = 0; i < ccp->cmd_q_count; i++) |
| 529 | if (ccp->cmd_q[i].suspended) |
| 530 | suspended++; |
| 531 | |
| 532 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 533 | |
| 534 | return ccp->cmd_q_count == suspended; |
| 535 | } |
| 536 | |
| 537 | int ccp_dev_suspend(struct sp_device *sp, pm_message_t state) |
| 538 | { |
| 539 | struct ccp_device *ccp = sp->ccp_data; |
| 540 | unsigned long flags; |
| 541 | unsigned int i; |
| 542 | |
| 543 | /* If there's no device there's nothing to do */ |
| 544 | if (!ccp) |
| 545 | return 0; |
| 546 | |
| 547 | spin_lock_irqsave(&ccp->cmd_lock, flags); |
| 548 | |
| 549 | ccp->suspending = 1; |
| 550 | |
| 551 | /* Wake all the queue kthreads to prepare for suspend */ |
| 552 | for (i = 0; i < ccp->cmd_q_count; i++) |
| 553 | wake_up_process(ccp->cmd_q[i].kthread); |
| 554 | |
| 555 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 556 | |
| 557 | /* Wait for all queue kthreads to say they're done */ |
| 558 | while (!ccp_queues_suspended(ccp)) |
| 559 | wait_event_interruptible(ccp->suspend_queue, |
| 560 | ccp_queues_suspended(ccp)); |
| 561 | |
| 562 | return 0; |
| 563 | } |
| 564 | |
| 565 | int ccp_dev_resume(struct sp_device *sp) |
| 566 | { |
| 567 | struct ccp_device *ccp = sp->ccp_data; |
| 568 | unsigned long flags; |
| 569 | unsigned int i; |
| 570 | |
| 571 | /* If there's no device there's nothing to do */ |
| 572 | if (!ccp) |
| 573 | return 0; |
| 574 | |
| 575 | spin_lock_irqsave(&ccp->cmd_lock, flags); |
| 576 | |
| 577 | ccp->suspending = 0; |
| 578 | |
| 579 | /* Wake up all the kthreads */ |
| 580 | for (i = 0; i < ccp->cmd_q_count; i++) { |
| 581 | ccp->cmd_q[i].suspended = 0; |
| 582 | wake_up_process(ccp->cmd_q[i].kthread); |
| 583 | } |
| 584 | |
| 585 | spin_unlock_irqrestore(&ccp->cmd_lock, flags); |
| 586 | |
| 587 | return 0; |
| 588 | } |
| 589 | #endif |
| 590 | |
| 591 | int ccp_dev_init(struct sp_device *sp) |
| 592 | { |
| 593 | struct device *dev = sp->dev; |
| 594 | struct ccp_device *ccp; |
| 595 | int ret; |
| 596 | |
| 597 | ret = -ENOMEM; |
| 598 | ccp = ccp_alloc_struct(sp); |
| 599 | if (!ccp) |
| 600 | goto e_err; |
| 601 | sp->ccp_data = ccp; |
| 602 | |
| 603 | ccp->vdata = (struct ccp_vdata *)sp->dev_vdata->ccp_vdata; |
| 604 | if (!ccp->vdata || !ccp->vdata->version) { |
| 605 | ret = -ENODEV; |
| 606 | dev_err(dev, "missing driver data\n"); |
| 607 | goto e_err; |
| 608 | } |
| 609 | |
| 610 | ccp->use_tasklet = sp->use_tasklet; |
| 611 | |
| 612 | ccp->io_regs = sp->io_map + ccp->vdata->offset; |
| 613 | if (ccp->vdata->setup) |
| 614 | ccp->vdata->setup(ccp); |
| 615 | |
| 616 | ret = ccp->vdata->perform->init(ccp); |
| 617 | if (ret) |
| 618 | goto e_err; |
| 619 | |
| 620 | dev_notice(dev, "ccp enabled\n"); |
| 621 | |
| 622 | return 0; |
| 623 | |
| 624 | e_err: |
| 625 | sp->ccp_data = NULL; |
| 626 | |
| 627 | dev_notice(dev, "ccp initialization failed\n"); |
| 628 | |
| 629 | return ret; |
| 630 | } |
| 631 | |
| 632 | void ccp_dev_destroy(struct sp_device *sp) |
| 633 | { |
| 634 | struct ccp_device *ccp = sp->ccp_data; |
| 635 | |
| 636 | if (!ccp) |
| 637 | return; |
| 638 | |
| 639 | ccp->vdata->perform->destroy(ccp); |
| 640 | } |