sys/dev/disk/nvme/nvme.c
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 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 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 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 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 | /* * Copyright (c) 2016-2018 The DragonFly Project. All rights reserved. * * This code is derived from software contributed to The DragonFly Project * by Matthew Dillon <dillon@backplane.com> * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * 3. Neither the name of The DragonFly Project nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific, prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /* * Most low-level chip related functions (other than attachment) reside in * this module. Most functions assume that the caller is already holding * appropriate locks to prevent SMP collisions. */ #include "nvme.h" MALLOC_DEFINE(M_NVME, "NVMe Driver", "NVME"); /* * DMA mapping callbacks. */ static void nvme_dmamem_saveseg(void *info, bus_dma_segment_t *segs, int nsegs, int error) { KKASSERT(error == 0); KKASSERT(nsegs == 1); *(bus_addr_t *)info = segs->ds_addr; } /* * Low-level chip enable/disable. */ int nvme_enable(nvme_softc_t *sc, int enable) { uint32_t reg; int error = 0; int base_ticks; reg = nvme_read(sc, NVME_REG_CONFIG); if (enable == 0 && (reg & NVME_CONFIG_EN)) { /* * Disable the chip so we can program it. */ reg &= ~NVME_CONFIG_EN; nvme_write(sc, NVME_REG_CONFIG, reg); } else if (enable && (reg & NVME_CONFIG_EN) == 0) { /* * Enable the chip once programmed. */ reg |= NVME_CONFIG_EN; nvme_write(sc, NVME_REG_CONFIG, reg); } error = ENXIO; base_ticks = ticks; while ((int)(ticks - base_ticks) < sc->entimo) { reg = nvme_read(sc, NVME_REG_STATUS); if (enable == 0 && (reg & NVME_STATUS_RDY) == 0) { error = 0; break; } if (enable && (reg & NVME_STATUS_RDY)) { error = 0; break; } nvme_os_sleep(50); /* 50ms poll */ } /* * Interrupt masking (only applicable when MSI-X not used, 3.1.3 and * 3.1.4 state that these registers should not be accessed with MSI-X) */ if (error == 0 && sc->nirqs == 1) { if (enable) { nvme_write(sc, NVME_REG_INTSET, ~1); nvme_write(sc, NVME_REG_INTCLR, 1); } else { nvme_write(sc, NVME_REG_INTSET, ~1); } } if (error) { device_printf(sc->dev, "Cannot %s device\n", (enable ? "enable" : "disable")); } else { #if 0 kprintf("gratuitous 15 second sleep\n"); nvme_os_sleep(15000); kprintf("gratuitous 15 second sleep done\n"); #endif } return error; } /* * Allocate submission and completion queues. If qid is 0 we are allocating * the ADMIN queues, otherwise we are allocating I/O queues. */ int nvme_alloc_subqueue(nvme_softc_t *sc, uint16_t qid) { nvme_subqueue_t *queue = &sc->subqueues[qid]; int error = 0; /* * For now implement the maximum queue size negotiated in the * attach. */ lockinit(&queue->lk, "nvqlk", 0, 0); queue->sc = sc; queue->nqe = sc->maxqe; queue->qid = qid; queue->subq_doorbell_reg = NVME_REG_SUBQ_BELL(qid, sc->dstrd4); /* * dma memory for the submission queue */ if (error == 0) { error = bus_dmamem_alloc(sc->sque_tag, (void **)&queue->ksubq, BUS_DMA_ZERO, &queue->sque_map); } if (error == 0) { error = bus_dmamap_load(sc->sque_tag, queue->sque_map, queue->ksubq, bus_dma_tag_getmaxsize(sc->sque_tag), nvme_dmamem_saveseg, &queue->psubq, 0); } /* * dma memory for enough PRPs to map MAXPHYS bytes of memory per * request. A MAXPHYS buffer which begins partially straddling * a page boundary can still be accomodated because we have an * additional PRP entry in cmd.head. */ if (error == 0) { error = bus_dmamem_alloc(sc->prps_tag, (void **)&queue->kprps, BUS_DMA_ZERO, &queue->prps_map); } if (error == 0) { error = bus_dmamap_load(sc->prps_tag, queue->prps_map, queue->kprps, bus_dma_tag_getmaxsize(sc->prps_tag), nvme_dmamem_saveseg, &queue->pprps, 0); } /* * dma memory for admin data */ if (qid == 0 && error == 0) { error = bus_dmamem_alloc(sc->adm_tag, (void **)&queue->kdatapgs, BUS_DMA_ZERO, &queue->adm_map); } if (qid == 0 && error == 0) { error = bus_dmamap_load(sc->adm_tag, queue->adm_map, queue->kdatapgs, bus_dma_tag_getmaxsize(sc->adm_tag), nvme_dmamem_saveseg, &queue->pdatapgs, 0); } /* * Driver request structures */ if (error == 0) { nvme_request_t *req; uint32_t i; queue->reqary = kmalloc(sizeof(nvme_request_t) * queue->nqe, M_NVME, M_WAITOK | M_ZERO); for (i = 0; i < queue->nqe; ++i) { req = &queue->reqary[i]; if (i == 0) { /* * Set aside one request for dump operation */ queue->dump_req = req; } else { /* * The rest go through the normal list */ req->next_avail = queue->first_avail; queue->first_avail = req; } req->subq = queue; req->comq = &sc->comqueues[queue->comqid]; req->cmd_id = i; if (qid == 0) { req->info = &queue->kdatapgs[i]; req->pinfo = queue->pdatapgs + i * sizeof(nvme_admin_data_t); } } } /* * Error handling */ if (error) nvme_free_subqueue(sc, qid); return error; } int nvme_alloc_comqueue(nvme_softc_t *sc, uint16_t qid) { nvme_comqueue_t *queue = &sc->comqueues[qid]; int error = 0; /* * For now implement the maximum queue size negotiated in the * attach. */ lockinit(&queue->lk, "nvqlk", 0, 0); queue->sc = sc; queue->qid = qid; queue->phase = NVME_COMQ_STATUS_PHASE; queue->comq_doorbell_reg = NVME_REG_COMQ_BELL(qid, sc->dstrd4); if (error == 0) { error = bus_dmamem_alloc(sc->cque_tag, (void **)&queue->kcomq, BUS_DMA_ZERO, &queue->cque_map); } if (error == 0) { error = bus_dmamap_load(sc->cque_tag, queue->cque_map, queue->kcomq, bus_dma_tag_getmaxsize(sc->cque_tag), nvme_dmamem_saveseg, &queue->pcomq, 0); } /* * Set nqe last. The comq polling loop tests this field and we * do not want it to spuriously assume that the comq is initialized * until it actually is. */ if (error == 0) queue->nqe = sc->maxqe; if (error) nvme_free_comqueue(sc, qid); return error; } void nvme_free_subqueue(nvme_softc_t *sc, uint16_t qid) { nvme_subqueue_t *queue = &sc->subqueues[qid]; queue->first_avail = NULL; if (queue->reqary) { kfree(queue->reqary, M_NVME); queue->reqary = NULL; } if (queue->ksubq) { bus_dmamem_free(sc->sque_tag, queue->ksubq, queue->sque_map); bus_dmamap_unload(sc->sque_tag, queue->sque_map); bus_dmamap_destroy(sc->sque_tag, queue->sque_map); } if (queue->kprps) { bus_dmamem_free(sc->prps_tag, queue->kprps, queue->prps_map); bus_dmamap_unload(sc->prps_tag, queue->prps_map); bus_dmamap_destroy(sc->prps_tag, queue->prps_map); } if (queue->kdatapgs) { bus_dmamem_free(sc->adm_tag, queue->kdatapgs, queue->adm_map); bus_dmamap_unload(sc->adm_tag, queue->adm_map); bus_dmamap_destroy(sc->adm_tag, queue->adm_map); } bzero(queue, sizeof(*queue)); } void nvme_free_comqueue(nvme_softc_t *sc, uint16_t qid) { nvme_comqueue_t *queue = &sc->comqueues[qid]; /* * Clear this field first so poll loops ignore the comq. */ queue->nqe = 0; if (queue->kcomq) { bus_dmamem_free(sc->cque_tag, queue->kcomq, queue->cque_map); bus_dmamap_unload(sc->cque_tag, queue->cque_map); bus_dmamap_destroy(sc->cque_tag, queue->cque_map); } bzero(queue, sizeof(*queue)); } /* * ADMIN AND I/O REQUEST HANDLING */ /* * Obtain a request and handle DMA mapping the supplied kernel buffer. * Fields in cmd.head will be initialized and remaining fields will be zero'd. * Caller is responsible for filling in remaining fields as appropriate. * * Caller must hold the queue lock. */ nvme_request_t * nvme_get_admin_request(nvme_softc_t *sc, uint8_t opcode) { nvme_request_t *req; req = nvme_get_request(&sc->subqueues[0], opcode, NULL, 0); req->cmd.head.prp1 = req->pinfo; req->callback = NULL; return req; } /* * ADMIN AND I/O REQUEST HANDLING */ static __inline void _nvme_fill_request(nvme_subqueue_t *queue, uint8_t opcode, char *kva, size_t bytes, nvme_request_t *req) { /* * Fill-in basic fields and do the DMA mapping. */ req->next_avail = NULL; KKASSERT(req->state == NVME_REQ_AVAIL); req->state = NVME_REQ_ALLOCATED; req->callback = NULL; req->waiting = 0; req->cmd.head.opcode = opcode; req->cmd.head.flags = NVME_SUBQFLG_PRP | NVME_SUBQFLG_NORM; req->cmd.head.cid = req->cmd_id; req->cmd.head.nsid = 0; req->cmd.head.mptr = 0; req->cmd.head.prp1 = 0; req->cmd.head.prp2 = 0; req->cmd.dw10 = 0; req->cmd.dw11 = 0; req->cmd.dw12 = 0; req->cmd.dw13 = 0; req->cmd.dw14 = 0; req->cmd.dw15 = 0; if (kva) { size_t count = 0; size_t idx = 0; vm_paddr_t paddr; vm_paddr_t pprptab; uint64_t *kprptab; KKASSERT(bytes >= 0 && bytes <= MAXPHYS); kprptab = queue->kprps + (MAXPHYS / PAGE_SIZE) * req->cmd_id; pprptab = queue->pprps + (MAXPHYS / PAGE_SIZE) * req->cmd_id * sizeof(uint64_t); while (count < bytes) { paddr = vtophys(kva + count); if (idx == 0) { KKASSERT((paddr & 3) == 0); req->cmd.head.prp1 = paddr; count += (((intptr_t)kva + PAGE_SIZE) & ~(intptr_t)PAGE_MASK) - (intptr_t)kva; } else if (idx == 1 && count + PAGE_SIZE >= bytes) { KKASSERT((paddr & PAGE_MASK) == 0); req->cmd.head.prp2 = paddr; count += PAGE_SIZE; } else { KKASSERT((paddr & PAGE_MASK) == 0); /* if (idx == 1) -- not needed, just repeat */ req->cmd.head.prp2 = pprptab; /* repeat */ kprptab[idx - 1] = paddr; count += PAGE_SIZE; } ++idx; } } } /* * Obtain a request and handle DMA mapping the supplied kernel buffer. * Fields in cmd.head will be initialized and remaining fields will be zero'd. * Caller is responsible for filling in remaining fields as appropriate. * * May return NULL if no requests are available or if there is no room in * the submission queue to handle it (should only be possible on an I/O queue, * admin queue operations are managed). * * Caller should NOT hold the queue lock. */ nvme_request_t * nvme_get_request(nvme_subqueue_t *queue, uint8_t opcode, char *kva, size_t bytes) { nvme_request_t *req; nvme_request_t *next; /* * No easy lockless way to pull a new request off. We have to check * for a number of conditions and there may be multiple threads * making this call simultaneously, which complicates matters even * more. */ lockmgr(&queue->lk, LK_EXCLUSIVE); /* * Make sure the submission queue has room to accomodate the * request. Requests can be completed out of order so the * submission ring could still be full even though we have * requests available. */ if ((queue->subq_tail + queue->unsubmitted + 1) % queue->nqe == queue->subq_head) { lockmgr(&queue->lk, LK_RELEASE); KKASSERT(queue->qid != 0); atomic_swap_int(&queue->signal_requeue, 1); return NULL; } /* * Pop the next available request off of the first_avail linked * list. An atomic op must be used here because nvme_put_request() * returns requests to the list without holding queue->lk. */ for (;;) { req = queue->first_avail; cpu_ccfence(); if (req == NULL) { lockmgr(&queue->lk, LK_RELEASE); KKASSERT(queue->qid != 0); atomic_swap_int(&queue->signal_requeue, 1); return NULL; } next = req->next_avail; if (atomic_cmpset_ptr(&queue->first_avail, req, next)) break; } /* * We have to keep track of unsubmitted requests in order to be * able to properly check whether the ring is full or not (check * is done at the top of this procedure, above). */ ++queue->unsubmitted; lockmgr(&queue->lk, LK_RELEASE); _nvme_fill_request(queue, opcode, kva, bytes, req); return req; } /* * dump path only, cannot block. Allow the lock to fail and bump * queue->unsubmitted anyway. */ nvme_request_t * nvme_get_dump_request(nvme_subqueue_t *queue, uint8_t opcode, char *kva, size_t bytes) { nvme_request_t *req; int error; error = lockmgr(&queue->lk, LK_EXCLUSIVE | LK_NOWAIT); req = queue->dump_req; ++queue->unsubmitted; if (error == 0) lockmgr(&queue->lk, LK_RELEASE); _nvme_fill_request(queue, opcode, kva, bytes, req); return req; } /* * Submit request for execution. This will doorbell the subq. * * Caller must hold the queue lock. */ void nvme_submit_request(nvme_request_t *req) { nvme_subqueue_t *queue = req->subq; nvme_allcmd_t *cmd; cmd = &queue->ksubq[queue->subq_tail]; --queue->unsubmitted; if (++queue->subq_tail == queue->nqe) queue->subq_tail = 0; KKASSERT(queue->subq_tail != queue->subq_head); *cmd = req->cmd; cpu_sfence(); /* needed? */ req->state = NVME_REQ_SUBMITTED; nvme_write(queue->sc, queue->subq_doorbell_reg, queue->subq_tail); } /* * Wait for a request to complete. * * Caller does not need to hold the queue lock. If it does, or if it * holds some other lock, it should pass it in so it can be released across * sleeps, else pass NULL. */ int nvme_wait_request(nvme_request_t *req) { struct lock *lk; int code; req->waiting = 1; if (req->state != NVME_REQ_COMPLETED) { lk = &req->comq->lk; cpu_lfence(); lockmgr(lk, LK_EXCLUSIVE); while (req->state == NVME_REQ_SUBMITTED) { nvme_poll_completions(req->comq, lk); if (req->state != NVME_REQ_SUBMITTED) break; lksleep(req, lk, 0, "nvwait", hz); } lockmgr(lk, LK_RELEASE); KKASSERT(req->state == NVME_REQ_COMPLETED); } cpu_lfence(); code = NVME_COMQ_STATUS_CODE_GET(req->res.tail.status); return code; } /* * dump path only, we cannot block, and the lock is allowed * to fail. But still try to play nice with interrupt threads. */ int nvme_poll_request(nvme_request_t *req) { struct lock *lk; int code; int didlock = 500; /* 500uS max */ req->waiting = 1; if (req->state != NVME_REQ_COMPLETED) { lk = &req->comq->lk; cpu_lfence(); while (lockmgr(lk, LK_EXCLUSIVE | LK_NOWAIT) != 0) { if (--didlock == 0) break; tsc_delay(1000); /* 1uS */ } while (req->state == NVME_REQ_SUBMITTED) { nvme_poll_completions(req->comq, lk); if (req->state != NVME_REQ_SUBMITTED) break; lwkt_switch(); } if (didlock) lockmgr(lk, LK_RELEASE); KKASSERT(req->state == NVME_REQ_COMPLETED); } cpu_lfence(); code = NVME_COMQ_STATUS_CODE_GET(req->res.tail.status); return code; } /* * Put request away, making it available for reuse. If this is an admin * request its auxillary data page is also being released for reuse. * * Caller does NOT have to hold the queue lock. */ void nvme_put_request(nvme_request_t *req) { nvme_subqueue_t *queue = req->subq; nvme_request_t *next; /* * Insert on head for best cache reuse. */ KKASSERT(req->state == NVME_REQ_COMPLETED); req->state = NVME_REQ_AVAIL; for (;;) { next = queue->first_avail; cpu_ccfence(); req->next_avail = next; if (atomic_cmpset_ptr(&queue->first_avail, next, req)) break; } /* * If BIOs were deferred due to lack of request space signal the * admin thread to requeue them. This is a bit messy and normally * should not happen due to the large number of queue entries nvme * usually has. Let it race for now (admin has a 1hz tick). */ if (atomic_swap_int(&queue->signal_requeue, 0)) { atomic_set_int(&queue->sc->admin_signal, ADMIN_SIG_REQUEUE); wakeup(&queue->sc->admin_signal); } } /* * dump path only. */ void nvme_put_dump_request(nvme_request_t *req) { KKASSERT(req->state == NVME_REQ_COMPLETED); req->state = NVME_REQ_AVAIL; } /* * Poll for completions on queue, copy the 16-byte hw result entry * into the request and poke the doorbell to update the controller's * understanding of comq_head. * * If lk is non-NULL it will be passed to the callback which typically * releases it temporarily when calling biodone() or doing other complex * work on the result. * * Caller must usually hold comq->lk. */ void nvme_poll_completions(nvme_comqueue_t *comq, struct lock *lk) { nvme_softc_t *sc = comq->sc; nvme_request_t *req; nvme_subqueue_t *subq; nvme_allres_t *res; #if 0 int didwork = 0; #endif KKASSERT(comq->comq_tail < comq->nqe); cpu_lfence(); /* needed prior to first phase test */ for (;;) { /* * WARNING! LOCK MAY HAVE BEEN TEMPORARILY LOST DURING LOOP. */ res = &comq->kcomq[comq->comq_tail]; if ((res->tail.status ^ comq->phase) & NVME_COMQ_STATUS_PHASE) break; /* * Process result on completion queue. * * Bump comq_tail, flip the phase detect when we roll-over. * doorbell every 1/4 queue and at the end of the loop. */ if (++comq->comq_tail == comq->nqe) { comq->comq_tail = 0; comq->phase ^= NVME_COMQ_STATUS_PHASE; } /* * WARNING! I imploded the chip by reusing a command id * before it was discarded in the completion queue * via the doorbell, so for now we always write * the doorbell before marking the request as * COMPLETED (it can be reused instantly upon * being marked). */ #if 0 if (++didwork == (comq->nqe >> 2)) { didwork = 0; nvme_write(comq->sc, comq->comq_doorbell_reg, comq->comq_tail); } #endif cpu_lfence(); /* needed prior to content check */ /* * Locate the request and related submission queue. The * request could be on a different queue. A submission * queue can have only one completion queue, so we can * update subq_head without locking the submission queue. */ subq = &sc->subqueues[res->tail.subq_id]; subq->subq_head = res->tail.subq_head_ptr; req = &subq->reqary[res->tail.cmd_id]; /* * Copy the fields and wakeup anyone waiting on req. * The response field in the completion queue can be reused * once we doorbell which is why we make a copy. */ KKASSERT(req->state == NVME_REQ_SUBMITTED && req->comq == comq); req->res = *res; nvme_write(comq->sc, comq->comq_doorbell_reg, comq->comq_tail); cpu_sfence(); req->state = NVME_REQ_COMPLETED; if (req->callback) { req->callback(req, lk); } else if (req->waiting) { wakeup(req); } } #if 0 if (didwork) nvme_write(comq->sc, comq->comq_doorbell_reg, comq->comq_tail); #endif } /* * Core interrupt handler (called from dedicated interrupt thread, possibly * preempts other threads). * * NOTE: For pin-based level interrupts, the chipset interrupt is cleared * automatically once all the head doorbells are updated. However, * most chipsets assume MSI-X will be used and MAY NOT IMPLEMENT * pin-based interrupts properly. I found the BPX card, for example, * is unable to clear a pin-based interrupt. */ void nvme_intr(void *arg) { nvme_comqueue_t *comq = arg; nvme_softc_t *sc; int i; int skip; /* * Process all completion queues associated with this vector. The * interrupt is masked in the APIC. Do NOT mess with the NVMe * masking registers because (1) We don't need to and it wastes time, * and (2) We aren't supposed to touch them if using MSI-X anyway. */ sc = comq->sc; if (sc->nirqs == 1) skip = 1; else skip = sc->nirqs - 1; for (i = comq->qid; i <= sc->niocomqs; i += skip) { if (comq->nqe) { lockmgr(&comq->lk, LK_EXCLUSIVE); nvme_poll_completions(comq, &comq->lk); lockmgr(&comq->lk, LK_RELEASE); } comq += skip; } } /* * ADMIN HELPER COMMAND ROLLUP FUNCTIONS */ /* * Issue command to create a submission queue. */ int nvme_create_subqueue(nvme_softc_t *sc, uint16_t qid) { nvme_request_t *req; nvme_subqueue_t *subq = &sc->subqueues[qid]; int status; req = nvme_get_admin_request(sc, NVME_OP_CREATE_SUBQ); req->cmd.head.prp1 = subq->psubq; req->cmd.crsub.subq_id = qid; req->cmd.crsub.subq_size = subq->nqe - 1; /* 0's based value */ req->cmd.crsub.flags = NVME_CREATESUB_PC | NVME_CREATESUB_PRI_URG; req->cmd.crsub.comq_id = subq->comqid; nvme_submit_request(req); status = nvme_wait_request(req); nvme_put_request(req); return status; } /* * Issue command to create a completion queue. */ int nvme_create_comqueue(nvme_softc_t *sc, uint16_t qid) { nvme_request_t *req; nvme_comqueue_t *comq = &sc->comqueues[qid]; int status; int error; uint16_t ivect; error = 0; if (sc->nirqs > 1) { ivect = 1 + (qid - 1) % (sc->nirqs - 1); if (qid && ivect == qid) { error = bus_setup_intr(sc->dev, sc->irq[ivect], INTR_MPSAFE | INTR_HIFREQ, nvme_intr, &sc->comqueues[ivect], &sc->irq_handle[ivect], NULL); } } else { ivect = 0; } if (error) return error; req = nvme_get_admin_request(sc, NVME_OP_CREATE_COMQ); req->cmd.head.prp1 = comq->pcomq; req->cmd.crcom.comq_id = qid; req->cmd.crcom.comq_size = comq->nqe - 1; /* 0's based value */ req->cmd.crcom.ivect = ivect; req->cmd.crcom.flags = NVME_CREATECOM_PC | NVME_CREATECOM_IEN; nvme_submit_request(req); status = nvme_wait_request(req); nvme_put_request(req); /* * Ooops, create failed, undo the irq setup */ if (sc->nirqs > 1 && status) { ivect = 1 + (qid - 1) % (sc->nirqs - 1); if (qid && ivect == qid) { bus_teardown_intr(sc->dev, sc->irq[ivect], sc->irq_handle[ivect]); sc->irq_handle[ivect] = NULL; } } return status; } /* * Issue command to delete a submission queue. */ int nvme_delete_subqueue(nvme_softc_t *sc, uint16_t qid) { nvme_request_t *req; /*nvme_subqueue_t *subq = &sc->subqueues[qid];*/ int status; req = nvme_get_admin_request(sc, NVME_OP_DELETE_SUBQ); req->cmd.head.prp1 = 0; req->cmd.delete.qid = qid; nvme_submit_request(req); status = nvme_wait_request(req); nvme_put_request(req); return status; } /* * Issue command to delete a completion queue. */ int nvme_delete_comqueue(nvme_softc_t *sc, uint16_t qid) { nvme_request_t *req; nvme_comqueue_t *comq = &sc->comqueues[qid]; int status; uint16_t ivect; if (comq->sc == NULL) return 0; req = nvme_get_admin_request(sc, NVME_OP_DELETE_COMQ); req->cmd.head.prp1 = 0; req->cmd.delete.qid = qid; nvme_submit_request(req); status = nvme_wait_request(req); nvme_put_request(req); if (qid && sc->nirqs > 1) { ivect = 1 + (qid - 1) % (sc->nirqs - 1); if (ivect == qid && sc->irq_handle[ivect]) { bus_teardown_intr(sc->dev, sc->irq[ivect], sc->irq_handle[ivect]); sc->irq_handle[ivect] = NULL; } } return status; } /* * Issue friendly shutdown to controller. */ int nvme_issue_shutdown(nvme_softc_t *sc, int dopoll) { uint32_t reg; int base_ticks; int error; /* * Put us in shutdown */ reg = nvme_read(sc, NVME_REG_CONFIG); reg &= ~NVME_CONFIG_SHUT_MASK; reg |= NVME_CONFIG_SHUT_NORM; nvme_write(sc, NVME_REG_CONFIG, reg); /* * Wait up to 10 seconds for acknowlegement */ error = ENXIO; base_ticks = ticks; while ((int)(ticks - base_ticks) < 10 * 20) { reg = nvme_read(sc, NVME_REG_STATUS); if ((reg & NVME_STATUS_SHUT_MASK) & NVME_STATUS_SHUT_DONE) { error = 0; break; } if (dopoll == 0) nvme_os_sleep(50); /* 50ms poll */ } if (error) device_printf(sc->dev, "Unable to shutdown chip nicely\n"); else device_printf(sc->dev, "Normal chip shutdown succeeded\n"); return error; } /* * Make space-padded string serial and model numbers more readable. */ size_t string_cleanup(char *str, int domiddle) { size_t i; size_t j; int atbeg = 1; for (i = j = 0; str[i]; ++i) { if ((str[i] == ' ' || str[i] == '\r') && (atbeg || domiddle)) { continue; } else { atbeg = 0; } str[j] = str[i]; ++j; } while (domiddle == 0 && j > 0 && (str[j-1] == ' ' || str[j-1] == '\r')) --j; str[j] = 0; if (domiddle == 0) { for (j = 0; str[j]; ++j) { if (str[j] == ' ') str[j] = '_'; } } return j; } |