1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2013-2015, 2024 The FreeBSD Foundation 5 * 6 * This software was developed by Konstantin Belousov <kib@FreeBSD.org> 7 * under sponsorship from the FreeBSD Foundation. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 * SUCH DAMAGE. 29 */ 30 31 #ifndef __X86_IOMMU_X86_IOMMU_H 32 #define __X86_IOMMU_X86_IOMMU_H 33 34 /* Both Intel and AMD are not too crazy to have different sizes. */ 35 typedef struct iommu_pte { 36 uint64_t pte; 37 } iommu_pte_t; 38 39 #define IOMMU_PAGE_SIZE PAGE_SIZE 40 #define IOMMU_PAGE_MASK (IOMMU_PAGE_SIZE - 1) 41 #define IOMMU_PAGE_SHIFT PAGE_SHIFT 42 #define IOMMU_NPTEPG (IOMMU_PAGE_SIZE / sizeof(iommu_pte_t)) 43 #define IOMMU_NPTEPGSHIFT 9 44 #define IOMMU_PTEMASK (IOMMU_NPTEPG - 1) 45 46 struct sf_buf; 47 struct vm_object; 48 49 struct vm_page *iommu_pgalloc(struct vm_object *obj, vm_pindex_t idx, 50 int flags); 51 void iommu_pgfree(struct vm_object *obj, vm_pindex_t idx, int flags); 52 void *iommu_map_pgtbl(struct vm_object *obj, vm_pindex_t idx, int flags, 53 struct sf_buf **sf); 54 void iommu_unmap_pgtbl(struct sf_buf *sf); 55 56 extern iommu_haddr_t iommu_high; 57 extern int iommu_tbl_pagecnt; 58 59 SYSCTL_DECL(_hw_iommu); 60 SYSCTL_DECL(_hw_iommu_dmar); 61 62 struct x86_unit_common; 63 64 struct x86_iommu { 65 struct x86_unit_common *(*get_x86_common)(struct 66 iommu_unit *iommu); 67 void (*qi_ensure)(struct iommu_unit *unit, int descr_count); 68 void (*qi_emit_wait_descr)(struct iommu_unit *unit, uint32_t seq, 69 bool, bool, bool); 70 void (*qi_advance_tail)(struct iommu_unit *unit); 71 void (*qi_invalidate_emit)(struct iommu_domain *idomain, 72 iommu_gaddr_t base, iommu_gaddr_t size, struct iommu_qi_genseq * 73 pseq, bool emit_wait); 74 void (*domain_unload_entry)(struct iommu_map_entry *entry, bool free, 75 bool cansleep); 76 void (*domain_unload)(struct iommu_domain *iodom, 77 struct iommu_map_entries_tailq *entries, bool cansleep); 78 struct iommu_ctx *(*get_ctx)(struct iommu_unit *iommu, 79 device_t dev, uint16_t rid, bool id_mapped, bool rmrr_init); 80 void (*free_ctx_locked)(struct iommu_unit *iommu, 81 struct iommu_ctx *context); 82 void (*free_ctx)(struct iommu_ctx *context); 83 struct iommu_unit *(*find)(device_t dev, bool verbose); 84 int (*alloc_msi_intr)(device_t src, u_int *cookies, u_int count); 85 int (*map_msi_intr)(device_t src, u_int cpu, u_int vector, 86 u_int cookie, uint64_t *addr, uint32_t *data); 87 int (*unmap_msi_intr)(device_t src, u_int cookie); 88 int (*map_ioapic_intr)(u_int ioapic_id, u_int cpu, u_int vector, 89 bool edge, bool activehi, int irq, u_int *cookie, uint32_t *hi, 90 uint32_t *lo); 91 int (*unmap_ioapic_intr)(u_int ioapic_id, u_int *cookie); 92 }; 93 void set_x86_iommu(struct x86_iommu *); 94 struct x86_iommu *get_x86_iommu(void); 95 96 struct x86_unit_common { 97 uint32_t qi_buf_maxsz; 98 uint32_t qi_cmd_sz; 99 100 char *inv_queue; 101 vm_size_t inv_queue_size; 102 uint32_t inv_queue_avail; 103 uint32_t inv_queue_tail; 104 105 /* 106 * Hw writes there on completion of wait descriptor 107 * processing. Intel writes 4 bytes, while AMD does the 108 * 8-bytes write. Due to little-endian, and use of 4-byte 109 * sequence numbers, the difference does not matter for us. 110 */ 111 volatile uint64_t inv_waitd_seq_hw; 112 113 uint64_t inv_waitd_seq_hw_phys; 114 uint32_t inv_waitd_seq; /* next sequence number to use for wait descr */ 115 u_int inv_waitd_gen; /* seq number generation AKA seq overflows */ 116 u_int inv_seq_waiters; /* count of waiters for seq */ 117 u_int inv_queue_full; /* informational counter */ 118 119 /* 120 * Delayed freeing of map entries queue processing: 121 * 122 * tlb_flush_head and tlb_flush_tail are used to implement a FIFO 123 * queue that supports concurrent dequeues and enqueues. However, 124 * there can only be a single dequeuer (accessing tlb_flush_head) and 125 * a single enqueuer (accessing tlb_flush_tail) at a time. Since the 126 * unit's qi_task is the only dequeuer, it can access tlb_flush_head 127 * without any locking. In contrast, there may be multiple enqueuers, 128 * so the enqueuers acquire the iommu unit lock to serialize their 129 * accesses to tlb_flush_tail. 130 * 131 * In this FIFO queue implementation, the key to enabling concurrent 132 * dequeues and enqueues is that the dequeuer never needs to access 133 * tlb_flush_tail and the enqueuer never needs to access 134 * tlb_flush_head. In particular, tlb_flush_head and tlb_flush_tail 135 * are never NULL, so neither a dequeuer nor an enqueuer ever needs to 136 * update both. Instead, tlb_flush_head always points to a "zombie" 137 * struct, which previously held the last dequeued item. Thus, the 138 * zombie's next field actually points to the struct holding the first 139 * item in the queue. When an item is dequeued, the current zombie is 140 * finally freed, and the struct that held the just dequeued item 141 * becomes the new zombie. When the queue is empty, tlb_flush_tail 142 * also points to the zombie. 143 */ 144 struct iommu_map_entry *tlb_flush_head; 145 struct iommu_map_entry *tlb_flush_tail; 146 struct task qi_task; 147 struct taskqueue *qi_taskqueue; 148 }; 149 150 void iommu_qi_emit_wait_seq(struct iommu_unit *unit, struct iommu_qi_genseq * 151 pseq, bool emit_wait); 152 void iommu_qi_wait_for_seq(struct iommu_unit *unit, const struct 153 iommu_qi_genseq *gseq, bool nowait); 154 void iommu_qi_drain_tlb_flush(struct iommu_unit *unit); 155 void iommu_qi_invalidate_locked(struct iommu_domain *domain, 156 struct iommu_map_entry *entry, bool emit_wait); 157 void iommu_qi_invalidate_sync(struct iommu_domain *domain, iommu_gaddr_t base, 158 iommu_gaddr_t size, bool cansleep); 159 void iommu_qi_common_init(struct iommu_unit *unit, task_fn_t taskfunc); 160 void iommu_qi_common_fini(struct iommu_unit *unit, void (*disable_qi)( 161 struct iommu_unit *)); 162 163 #endif 164