mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-16 01:04:08 +08:00
Merge branch 'pci/resource'
- Coalesce host bridge apertures so we can allocate large BARs that cross contiguous apertures (Kai-Heng Feng) * pci/resource: PCI: Coalesce host bridge contiguous apertures
This commit is contained in:
commit
131e4f76c9
@ -19,6 +19,7 @@
|
||||
#include <linux/hypervisor.h>
|
||||
#include <linux/irqdomain.h>
|
||||
#include <linux/pm_runtime.h>
|
||||
#include <linux/list_sort.h>
|
||||
#include "pci.h"
|
||||
|
||||
#define CARDBUS_LATENCY_TIMER 176 /* secondary latency timer */
|
||||
@ -874,14 +875,31 @@ static void pci_set_bus_msi_domain(struct pci_bus *bus)
|
||||
dev_set_msi_domain(&bus->dev, d);
|
||||
}
|
||||
|
||||
static int res_cmp(void *priv, const struct list_head *a,
|
||||
const struct list_head *b)
|
||||
{
|
||||
struct resource_entry *entry1, *entry2;
|
||||
|
||||
entry1 = container_of(a, struct resource_entry, node);
|
||||
entry2 = container_of(b, struct resource_entry, node);
|
||||
|
||||
if (entry1->res->flags != entry2->res->flags)
|
||||
return entry1->res->flags > entry2->res->flags;
|
||||
|
||||
if (entry1->offset != entry2->offset)
|
||||
return entry1->offset > entry2->offset;
|
||||
|
||||
return entry1->res->start > entry2->res->start;
|
||||
}
|
||||
|
||||
static int pci_register_host_bridge(struct pci_host_bridge *bridge)
|
||||
{
|
||||
struct device *parent = bridge->dev.parent;
|
||||
struct resource_entry *window, *n;
|
||||
struct resource_entry *window, *next, *n;
|
||||
struct pci_bus *bus, *b;
|
||||
resource_size_t offset;
|
||||
resource_size_t offset, next_offset;
|
||||
LIST_HEAD(resources);
|
||||
struct resource *res;
|
||||
struct resource *res, *next_res;
|
||||
char addr[64], *fmt;
|
||||
const char *name;
|
||||
int err;
|
||||
@ -960,11 +978,35 @@ static int pci_register_host_bridge(struct pci_host_bridge *bridge)
|
||||
if (nr_node_ids > 1 && pcibus_to_node(bus) == NUMA_NO_NODE)
|
||||
dev_warn(&bus->dev, "Unknown NUMA node; performance will be reduced\n");
|
||||
|
||||
/* Add initial resources to the bus */
|
||||
/* Sort and coalesce contiguous windows */
|
||||
list_sort(NULL, &resources, res_cmp);
|
||||
resource_list_for_each_entry_safe(window, n, &resources) {
|
||||
list_move_tail(&window->node, &bridge->windows);
|
||||
if (list_is_last(&window->node, &resources))
|
||||
break;
|
||||
|
||||
next = list_next_entry(window, node);
|
||||
offset = window->offset;
|
||||
res = window->res;
|
||||
next_offset = next->offset;
|
||||
next_res = next->res;
|
||||
|
||||
if (res->flags != next_res->flags || offset != next_offset)
|
||||
continue;
|
||||
|
||||
if (res->end + 1 == next_res->start) {
|
||||
next_res->start = res->start;
|
||||
res->flags = res->start = res->end = 0;
|
||||
}
|
||||
}
|
||||
|
||||
/* Add initial resources to the bus */
|
||||
resource_list_for_each_entry_safe(window, n, &resources) {
|
||||
offset = window->offset;
|
||||
res = window->res;
|
||||
if (!res->end)
|
||||
continue;
|
||||
|
||||
list_move_tail(&window->node, &bridge->windows);
|
||||
|
||||
if (res->flags & IORESOURCE_BUS)
|
||||
pci_bus_insert_busn_res(bus, bus->number, res->end);
|
||||
|
Loading…
Reference in New Issue
Block a user