|
@@ -1412,7 +1412,7 @@ static struct irq_chip its_irq_chip = {
|
|
|
* This gives us (((1UL << id_bits) - 8192) >> 5) possible allocations.
|
|
|
*/
|
|
|
#define IRQS_PER_CHUNK_SHIFT 5
|
|
|
-#define IRQS_PER_CHUNK (1 << IRQS_PER_CHUNK_SHIFT)
|
|
|
+#define IRQS_PER_CHUNK (1UL << IRQS_PER_CHUNK_SHIFT)
|
|
|
#define ITS_MAX_LPI_NRBITS 16 /* 64K LPIs */
|
|
|
|
|
|
static unsigned long *lpi_bitmap;
|
|
@@ -2119,11 +2119,10 @@ static struct its_device *its_create_device(struct its_node *its, u32 dev_id,
|
|
|
|
|
|
dev = kzalloc(sizeof(*dev), GFP_KERNEL);
|
|
|
/*
|
|
|
- * At least one bit of EventID is being used, hence a minimum
|
|
|
- * of two entries. No, the architecture doesn't let you
|
|
|
- * express an ITT with a single entry.
|
|
|
+ * We allocate at least one chunk worth of LPIs bet device,
|
|
|
+ * and thus that many ITEs. The device may require less though.
|
|
|
*/
|
|
|
- nr_ites = max(2UL, roundup_pow_of_two(nvecs));
|
|
|
+ nr_ites = max(IRQS_PER_CHUNK, roundup_pow_of_two(nvecs));
|
|
|
sz = nr_ites * its->ite_size;
|
|
|
sz = max(sz, ITS_ITT_ALIGN) + ITS_ITT_ALIGN - 1;
|
|
|
itt = kzalloc(sz, GFP_KERNEL);
|
|
@@ -2495,7 +2494,7 @@ static int its_vpe_set_affinity(struct irq_data *d,
|
|
|
|
|
|
static void its_vpe_schedule(struct its_vpe *vpe)
|
|
|
{
|
|
|
- void * __iomem vlpi_base = gic_data_rdist_vlpi_base();
|
|
|
+ void __iomem *vlpi_base = gic_data_rdist_vlpi_base();
|
|
|
u64 val;
|
|
|
|
|
|
/* Schedule the VPE */
|
|
@@ -2527,7 +2526,7 @@ static void its_vpe_schedule(struct its_vpe *vpe)
|
|
|
|
|
|
static void its_vpe_deschedule(struct its_vpe *vpe)
|
|
|
{
|
|
|
- void * __iomem vlpi_base = gic_data_rdist_vlpi_base();
|
|
|
+ void __iomem *vlpi_base = gic_data_rdist_vlpi_base();
|
|
|
u32 count = 1000000; /* 1s! */
|
|
|
bool clean;
|
|
|
u64 val;
|