Loading arch/x86/xen/irq.c +1 −1 Original line number Diff line number Diff line Loading @@ -126,7 +126,7 @@ static const struct pv_irq_ops xen_irq_ops __initdata = { #endif }; void __init xen_init_irq_ops() void __init xen_init_irq_ops(void) { pv_irq_ops = xen_irq_ops; x86_init.irqs.intr_init = xen_init_IRQ; Loading arch/x86/xen/p2m.c +19 −1 Original line number Diff line number Diff line Loading @@ -237,6 +237,24 @@ void __init xen_build_dynamic_phys_to_machine(void) p2m_top[topidx] = mid; } /* * As long as the mfn_list has enough entries to completely * fill a p2m page, pointing into the array is ok. But if * not the entries beyond the last pfn will be undefined. * And guessing that the 'what-ever-there-is' does not take it * too kindly when changing it to invalid markers, a new page * is allocated, initialized and filled with the valid part. */ if (unlikely(pfn + P2M_PER_PAGE > max_pfn)) { unsigned long p2midx; unsigned long *p2m = extend_brk(PAGE_SIZE, PAGE_SIZE); p2m_init(p2m); for (p2midx = 0; pfn + p2midx < max_pfn; p2midx++) { p2m[p2midx] = mfn_list[pfn + p2midx]; } p2m_top[topidx][mididx] = p2m; } else p2m_top[topidx][mididx] = &mfn_list[pfn]; } Loading Loading
arch/x86/xen/irq.c +1 −1 Original line number Diff line number Diff line Loading @@ -126,7 +126,7 @@ static const struct pv_irq_ops xen_irq_ops __initdata = { #endif }; void __init xen_init_irq_ops() void __init xen_init_irq_ops(void) { pv_irq_ops = xen_irq_ops; x86_init.irqs.intr_init = xen_init_IRQ; Loading
arch/x86/xen/p2m.c +19 −1 Original line number Diff line number Diff line Loading @@ -237,6 +237,24 @@ void __init xen_build_dynamic_phys_to_machine(void) p2m_top[topidx] = mid; } /* * As long as the mfn_list has enough entries to completely * fill a p2m page, pointing into the array is ok. But if * not the entries beyond the last pfn will be undefined. * And guessing that the 'what-ever-there-is' does not take it * too kindly when changing it to invalid markers, a new page * is allocated, initialized and filled with the valid part. */ if (unlikely(pfn + P2M_PER_PAGE > max_pfn)) { unsigned long p2midx; unsigned long *p2m = extend_brk(PAGE_SIZE, PAGE_SIZE); p2m_init(p2m); for (p2midx = 0; pfn + p2midx < max_pfn; p2midx++) { p2m[p2midx] = mfn_list[pfn + p2midx]; } p2m_top[topidx][mididx] = p2m; } else p2m_top[topidx][mididx] = &mfn_list[pfn]; } Loading