|
|
|
@@ -207,6 +207,11 @@ static bool require_its_list_vmovp(struct its_vm *vm, struct its_node *its)
|
|
|
|
|
return (gic_rdists->has_rvpeid || vm->vlpi_count[its->list_nr]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static bool rdists_support_shareable(void)
|
|
|
|
|
{
|
|
|
|
|
return !(gic_rdists->flags & RDIST_FLAGS_FORCE_NON_SHAREABLE);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static u16 get_its_list(struct its_vm *vm)
|
|
|
|
|
{
|
|
|
|
|
struct its_node *its;
|
|
|
|
@@ -2710,10 +2715,12 @@ static u64 inherit_vpe_l1_table_from_its(void)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_4_1_ADDR, addr >> 12);
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_SHAREABILITY_MASK,
|
|
|
|
|
FIELD_GET(GITS_BASER_SHAREABILITY_MASK, baser));
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_INNER_CACHEABILITY_MASK,
|
|
|
|
|
FIELD_GET(GITS_BASER_INNER_CACHEABILITY_MASK, baser));
|
|
|
|
|
if (rdists_support_shareable()) {
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_SHAREABILITY_MASK,
|
|
|
|
|
FIELD_GET(GITS_BASER_SHAREABILITY_MASK, baser));
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_INNER_CACHEABILITY_MASK,
|
|
|
|
|
FIELD_GET(GITS_BASER_INNER_CACHEABILITY_MASK, baser));
|
|
|
|
|
}
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_4_1_SIZE, GITS_BASER_NR_PAGES(baser) - 1);
|
|
|
|
|
|
|
|
|
|
return val;
|
|
|
|
@@ -2936,8 +2943,10 @@ static int allocate_vpe_l1_table(void)
|
|
|
|
|
WARN_ON(!IS_ALIGNED(pa, psz));
|
|
|
|
|
|
|
|
|
|
val |= FIELD_PREP(GICR_VPROPBASER_4_1_ADDR, pa >> 12);
|
|
|
|
|
val |= GICR_VPROPBASER_RaWb;
|
|
|
|
|
val |= GICR_VPROPBASER_InnerShareable;
|
|
|
|
|
if (rdists_support_shareable()) {
|
|
|
|
|
val |= GICR_VPROPBASER_RaWb;
|
|
|
|
|
val |= GICR_VPROPBASER_InnerShareable;
|
|
|
|
|
}
|
|
|
|
|
val |= GICR_VPROPBASER_4_1_Z;
|
|
|
|
|
val |= GICR_VPROPBASER_4_1_VALID;
|
|
|
|
|
|
|
|
|
@@ -3126,7 +3135,7 @@ static void its_cpu_init_lpis(void)
|
|
|
|
|
gicr_write_propbaser(val, rbase + GICR_PROPBASER);
|
|
|
|
|
tmp = gicr_read_propbaser(rbase + GICR_PROPBASER);
|
|
|
|
|
|
|
|
|
|
if (gic_rdists->flags & RDIST_FLAGS_FORCE_NON_SHAREABLE)
|
|
|
|
|
if (!rdists_support_shareable())
|
|
|
|
|
tmp &= ~GICR_PROPBASER_SHAREABILITY_MASK;
|
|
|
|
|
|
|
|
|
|
if ((tmp ^ val) & GICR_PROPBASER_SHAREABILITY_MASK) {
|
|
|
|
@@ -3153,7 +3162,7 @@ static void its_cpu_init_lpis(void)
|
|
|
|
|
gicr_write_pendbaser(val, rbase + GICR_PENDBASER);
|
|
|
|
|
tmp = gicr_read_pendbaser(rbase + GICR_PENDBASER);
|
|
|
|
|
|
|
|
|
|
if (gic_rdists->flags & RDIST_FLAGS_FORCE_NON_SHAREABLE)
|
|
|
|
|
if (!rdists_support_shareable())
|
|
|
|
|
tmp &= ~GICR_PENDBASER_SHAREABILITY_MASK;
|
|
|
|
|
|
|
|
|
|
if (!(tmp & GICR_PENDBASER_SHAREABILITY_MASK)) {
|
|
|
|
@@ -3817,8 +3826,9 @@ static int its_vpe_set_affinity(struct irq_data *d,
|
|
|
|
|
bool force)
|
|
|
|
|
{
|
|
|
|
|
struct its_vpe *vpe = irq_data_get_irq_chip_data(d);
|
|
|
|
|
int from, cpu = cpumask_first(mask_val);
|
|
|
|
|
struct cpumask common, *table_mask;
|
|
|
|
|
unsigned long flags;
|
|
|
|
|
int from, cpu;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Changing affinity is mega expensive, so let's be as lazy as
|
|
|
|
@@ -3834,19 +3844,22 @@ static int its_vpe_set_affinity(struct irq_data *d,
|
|
|
|
|
* taken on any vLPI handling path that evaluates vpe->col_idx.
|
|
|
|
|
*/
|
|
|
|
|
from = vpe_to_cpuid_lock(vpe, &flags);
|
|
|
|
|
table_mask = gic_data_rdist_cpu(from)->vpe_table_mask;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If we are offered another CPU in the same GICv4.1 ITS
|
|
|
|
|
* affinity, pick this one. Otherwise, any CPU will do.
|
|
|
|
|
*/
|
|
|
|
|
if (table_mask && cpumask_and(&common, mask_val, table_mask))
|
|
|
|
|
cpu = cpumask_test_cpu(from, &common) ? from : cpumask_first(&common);
|
|
|
|
|
else
|
|
|
|
|
cpu = cpumask_first(mask_val);
|
|
|
|
|
|
|
|
|
|
if (from == cpu)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
vpe->col_idx = cpu;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* GICv4.1 allows us to skip VMOVP if moving to a cpu whose RD
|
|
|
|
|
* is sharing its VPE table with the current one.
|
|
|
|
|
*/
|
|
|
|
|
if (gic_data_rdist_cpu(cpu)->vpe_table_mask &&
|
|
|
|
|
cpumask_test_cpu(from, gic_data_rdist_cpu(cpu)->vpe_table_mask))
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
its_send_vmovp(vpe);
|
|
|
|
|
its_vpe_db_proxy_move(vpe, from, cpu);
|
|
|
|
|
|
|
|
|
@@ -3880,14 +3893,18 @@ static void its_vpe_schedule(struct its_vpe *vpe)
|
|
|
|
|
val = virt_to_phys(page_address(vpe->its_vm->vprop_page)) &
|
|
|
|
|
GENMASK_ULL(51, 12);
|
|
|
|
|
val |= (LPI_NRBITS - 1) & GICR_VPROPBASER_IDBITS_MASK;
|
|
|
|
|
val |= GICR_VPROPBASER_RaWb;
|
|
|
|
|
val |= GICR_VPROPBASER_InnerShareable;
|
|
|
|
|
if (rdists_support_shareable()) {
|
|
|
|
|
val |= GICR_VPROPBASER_RaWb;
|
|
|
|
|
val |= GICR_VPROPBASER_InnerShareable;
|
|
|
|
|
}
|
|
|
|
|
gicr_write_vpropbaser(val, vlpi_base + GICR_VPROPBASER);
|
|
|
|
|
|
|
|
|
|
val = virt_to_phys(page_address(vpe->vpt_page)) &
|
|
|
|
|
GENMASK_ULL(51, 16);
|
|
|
|
|
val |= GICR_VPENDBASER_RaWaWb;
|
|
|
|
|
val |= GICR_VPENDBASER_InnerShareable;
|
|
|
|
|
if (rdists_support_shareable()) {
|
|
|
|
|
val |= GICR_VPENDBASER_RaWaWb;
|
|
|
|
|
val |= GICR_VPENDBASER_InnerShareable;
|
|
|
|
|
}
|
|
|
|
|
/*
|
|
|
|
|
* There is no good way of finding out if the pending table is
|
|
|
|
|
* empty as we can race against the doorbell interrupt very
|
|
|
|
@@ -5078,6 +5095,8 @@ static int __init its_probe_one(struct its_node *its)
|
|
|
|
|
u32 ctlr;
|
|
|
|
|
int err;
|
|
|
|
|
|
|
|
|
|
its_enable_quirks(its);
|
|
|
|
|
|
|
|
|
|
if (is_v4(its)) {
|
|
|
|
|
if (!(its->typer & GITS_TYPER_VMOVP)) {
|
|
|
|
|
err = its_compute_its_list_map(its);
|
|
|
|
@@ -5429,7 +5448,6 @@ static int __init its_of_probe(struct device_node *node)
|
|
|
|
|
if (!its)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
|
|
its_enable_quirks(its);
|
|
|
|
|
err = its_probe_one(its);
|
|
|
|
|
if (err) {
|
|
|
|
|
its_node_destroy(its);
|
|
|
|
|