|
28 | 28 | #include <asm/cpu_device_id.h>
|
29 | 29 | #include "intel_rdt.h"
|
30 | 30 |
|
| 31 | +#define MSR_IA32_QM_CTR 0x0c8e |
| 32 | +#define MSR_IA32_QM_EVTSEL 0x0c8d |
| 33 | + |
31 | 34 | struct rmid_entry {
|
32 | 35 | u32 rmid;
|
| 36 | + atomic_t busy; |
33 | 37 | struct list_head list;
|
34 | 38 | };
|
35 | 39 |
|
@@ -81,6 +85,215 @@ static inline struct rmid_entry *__rmid_entry(u32 rmid)
|
81 | 85 | return entry;
|
82 | 86 | }
|
83 | 87 |
|
| 88 | +static u64 __rmid_read(u32 rmid, u32 eventid) |
| 89 | +{ |
| 90 | + u64 val; |
| 91 | + |
| 92 | + /* |
| 93 | + * As per the SDM, when IA32_QM_EVTSEL.EvtID (bits 7:0) is configured |
| 94 | + * with a valid event code for supported resource type and the bits |
| 95 | + * IA32_QM_EVTSEL.RMID (bits 41:32) are configured with valid RMID, |
| 96 | + * IA32_QM_CTR.data (bits 61:0) reports the monitored data. |
| 97 | + * IA32_QM_CTR.Error (bit 63) and IA32_QM_CTR.Unavailable (bit 62) |
| 98 | + * are error bits. |
| 99 | + */ |
| 100 | + wrmsr(MSR_IA32_QM_EVTSEL, eventid, rmid); |
| 101 | + rdmsrl(MSR_IA32_QM_CTR, val); |
| 102 | + |
| 103 | + return val; |
| 104 | +} |
| 105 | + |
| 106 | +/* |
| 107 | + * Walk the limbo list looking at any RMIDs that are flagged in the |
| 108 | + * domain rmid_busy_llc bitmap as busy. If the reported LLC occupancy |
| 109 | + * is below the threshold clear the busy bit and decrement the count. |
| 110 | + * If the busy count gets to zero on an RMID we stop looking. |
| 111 | + * This can be called from an IPI. |
| 112 | + * We need an atomic for the busy count because multiple CPUs may check |
| 113 | + * the same RMID at the same time. |
| 114 | + */ |
| 115 | +static bool __check_limbo(struct rdt_domain *d) |
| 116 | +{ |
| 117 | + struct rmid_entry *entry; |
| 118 | + u64 val; |
| 119 | + |
| 120 | + list_for_each_entry(entry, &rmid_limbo_lru, list) { |
| 121 | + if (!test_bit(entry->rmid, d->rmid_busy_llc)) |
| 122 | + continue; |
| 123 | + val = __rmid_read(entry->rmid, QOS_L3_OCCUP_EVENT_ID); |
| 124 | + if (val <= intel_cqm_threshold) { |
| 125 | + clear_bit(entry->rmid, d->rmid_busy_llc); |
| 126 | + if (atomic_dec_and_test(&entry->busy)) |
| 127 | + return true; |
| 128 | + } |
| 129 | + } |
| 130 | + return false; |
| 131 | +} |
| 132 | + |
| 133 | +static void check_limbo(void *arg) |
| 134 | +{ |
| 135 | + struct rdt_domain *d; |
| 136 | + |
| 137 | + d = get_domain_from_cpu(smp_processor_id(), |
| 138 | + &rdt_resources_all[RDT_RESOURCE_L3]); |
| 139 | + |
| 140 | + if (d) |
| 141 | + __check_limbo(d); |
| 142 | +} |
| 143 | + |
| 144 | +static bool has_busy_rmid(struct rdt_resource *r, struct rdt_domain *d) |
| 145 | +{ |
| 146 | + return find_first_bit(d->rmid_busy_llc, r->num_rmid) != r->num_rmid; |
| 147 | +} |
| 148 | + |
| 149 | +/* |
| 150 | + * Scan the limbo list and move all entries that are below the |
| 151 | + * intel_cqm_threshold to the free list. |
| 152 | + * Return "true" if the limbo list is empty, "false" if there are |
| 153 | + * still some RMIDs there. |
| 154 | + */ |
| 155 | +static bool try_freeing_limbo_rmid(void) |
| 156 | +{ |
| 157 | + struct rmid_entry *entry, *tmp; |
| 158 | + struct rdt_resource *r; |
| 159 | + cpumask_var_t cpu_mask; |
| 160 | + struct rdt_domain *d; |
| 161 | + bool ret = true; |
| 162 | + int cpu; |
| 163 | + |
| 164 | + if (list_empty(&rmid_limbo_lru)) |
| 165 | + return ret; |
| 166 | + |
| 167 | + r = &rdt_resources_all[RDT_RESOURCE_L3]; |
| 168 | + |
| 169 | + cpu = get_cpu(); |
| 170 | + |
| 171 | + /* |
| 172 | + * First see if we can free up an RMID by checking busy values |
| 173 | + * on the local package. |
| 174 | + */ |
| 175 | + d = get_domain_from_cpu(cpu, r); |
| 176 | + if (d && has_busy_rmid(r, d) && __check_limbo(d)) { |
| 177 | + list_for_each_entry_safe(entry, tmp, &rmid_limbo_lru, list) { |
| 178 | + if (atomic_read(&entry->busy) == 0) { |
| 179 | + list_del(&entry->list); |
| 180 | + list_add_tail(&entry->list, &rmid_free_lru); |
| 181 | + goto done; |
| 182 | + } |
| 183 | + } |
| 184 | + } |
| 185 | + |
| 186 | + if (!zalloc_cpumask_var(&cpu_mask, GFP_KERNEL)) { |
| 187 | + ret = false; |
| 188 | + goto done; |
| 189 | + } |
| 190 | + |
| 191 | + /* |
| 192 | + * Build a mask of other domains that have busy RMIDs |
| 193 | + */ |
| 194 | + list_for_each_entry(d, &r->domains, list) { |
| 195 | + if (!cpumask_test_cpu(cpu, &d->cpu_mask) && |
| 196 | + has_busy_rmid(r, d)) |
| 197 | + cpumask_set_cpu(cpumask_any(&d->cpu_mask), cpu_mask); |
| 198 | + } |
| 199 | + if (cpumask_empty(cpu_mask)) { |
| 200 | + ret = false; |
| 201 | + goto free_mask; |
| 202 | + } |
| 203 | + |
| 204 | + /* |
| 205 | + * Scan domains with busy RMIDs to check if they still are busy |
| 206 | + */ |
| 207 | + on_each_cpu_mask(cpu_mask, check_limbo, NULL, true); |
| 208 | + |
| 209 | + /* Walk limbo list moving all free RMIDs to the &rmid_free_lru list */ |
| 210 | + list_for_each_entry_safe(entry, tmp, &rmid_limbo_lru, list) { |
| 211 | + if (atomic_read(&entry->busy) != 0) { |
| 212 | + ret = false; |
| 213 | + continue; |
| 214 | + } |
| 215 | + list_del(&entry->list); |
| 216 | + list_add_tail(&entry->list, &rmid_free_lru); |
| 217 | + } |
| 218 | + |
| 219 | +free_mask: |
| 220 | + free_cpumask_var(cpu_mask); |
| 221 | +done: |
| 222 | + put_cpu(); |
| 223 | + return ret; |
| 224 | +} |
| 225 | + |
| 226 | +/* |
| 227 | + * As of now the RMIDs allocation is global. |
| 228 | + * However we keep track of which packages the RMIDs |
| 229 | + * are used to optimize the limbo list management. |
| 230 | + */ |
| 231 | +int alloc_rmid(void) |
| 232 | +{ |
| 233 | + struct rmid_entry *entry; |
| 234 | + bool ret; |
| 235 | + |
| 236 | + lockdep_assert_held(&rdtgroup_mutex); |
| 237 | + |
| 238 | + if (list_empty(&rmid_free_lru)) { |
| 239 | + ret = try_freeing_limbo_rmid(); |
| 240 | + if (list_empty(&rmid_free_lru)) |
| 241 | + return ret ? -ENOSPC : -EBUSY; |
| 242 | + } |
| 243 | + |
| 244 | + entry = list_first_entry(&rmid_free_lru, |
| 245 | + struct rmid_entry, list); |
| 246 | + list_del(&entry->list); |
| 247 | + |
| 248 | + return entry->rmid; |
| 249 | +} |
| 250 | + |
| 251 | +static void add_rmid_to_limbo(struct rmid_entry *entry) |
| 252 | +{ |
| 253 | + struct rdt_resource *r; |
| 254 | + struct rdt_domain *d; |
| 255 | + int cpu, nbusy = 0; |
| 256 | + u64 val; |
| 257 | + |
| 258 | + r = &rdt_resources_all[RDT_RESOURCE_L3]; |
| 259 | + |
| 260 | + cpu = get_cpu(); |
| 261 | + list_for_each_entry(d, &r->domains, list) { |
| 262 | + if (cpumask_test_cpu(cpu, &d->cpu_mask)) { |
| 263 | + val = __rmid_read(entry->rmid, QOS_L3_OCCUP_EVENT_ID); |
| 264 | + if (val <= intel_cqm_threshold) |
| 265 | + continue; |
| 266 | + } |
| 267 | + set_bit(entry->rmid, d->rmid_busy_llc); |
| 268 | + nbusy++; |
| 269 | + } |
| 270 | + put_cpu(); |
| 271 | + |
| 272 | + if (nbusy) { |
| 273 | + atomic_set(&entry->busy, nbusy); |
| 274 | + list_add_tail(&entry->list, &rmid_limbo_lru); |
| 275 | + } else { |
| 276 | + list_add_tail(&entry->list, &rmid_free_lru); |
| 277 | + } |
| 278 | +} |
| 279 | + |
| 280 | +void free_rmid(u32 rmid) |
| 281 | +{ |
| 282 | + struct rmid_entry *entry; |
| 283 | + |
| 284 | + if (!rmid) |
| 285 | + return; |
| 286 | + |
| 287 | + lockdep_assert_held(&rdtgroup_mutex); |
| 288 | + |
| 289 | + entry = __rmid_entry(rmid); |
| 290 | + |
| 291 | + if (is_llc_occupancy_enabled()) |
| 292 | + add_rmid_to_limbo(entry); |
| 293 | + else |
| 294 | + list_add_tail(&entry->list, &rmid_free_lru); |
| 295 | +} |
| 296 | + |
84 | 297 | static int dom_data_init(struct rdt_resource *r)
|
85 | 298 | {
|
86 | 299 | struct rmid_entry *entry = NULL;
|
|
0 commit comments