2007-04-22 21:08:13 +02:00
|
|
|
/*
|
2008-01-18 11:35:56 +01:00
|
|
|
* This file is part of the coreboot project.
|
2007-04-22 21:08:13 +02:00
|
|
|
*
|
|
|
|
* It was originally based on the Linux kernel (arch/i386/kernel/pci-pc.c).
|
|
|
|
*
|
|
|
|
* Modifications are:
|
|
|
|
* Copyright (C) 2003 Eric Biederman <ebiederm@xmission.com>
|
|
|
|
* Copyright (C) 2003-2004 Linux Networx
|
|
|
|
* (Written by Eric Biederman <ebiederman@lnxi.com> for Linux Networx)
|
|
|
|
* Copyright (C) 2003 Ronald G. Minnich <rminnich@gmail.com>
|
|
|
|
* Copyright (C) 2004-2005 Li-Ta Lo <ollie@lanl.gov>
|
|
|
|
* Copyright (C) 2005-2006 Tyan
|
|
|
|
* (Written by Yinghai Lu <yhlu@tyan.com> for Tyan)
|
|
|
|
* Copyright (C) 2005-2006 Stefan Reinauer <stepan@openbios.org>
|
2009-07-02 20:56:24 +02:00
|
|
|
* Copyright (C) 2009 Myles Watson <mylesgw@gmail.com>
|
2007-04-22 21:08:13 +02:00
|
|
|
*/
|
|
|
|
|
2003-04-22 21:02:15 +02:00
|
|
|
/*
|
|
|
|
* (c) 1999--2000 Martin Mares <mj@suse.cz>
|
|
|
|
*/
|
2009-05-12 00:24:53 +02:00
|
|
|
/* lots of mods by ron minnich (rminnich@lanl.gov), with
|
2003-04-22 21:02:15 +02:00
|
|
|
* the final architecture guidance from Tom Merritt (tjm@codegen.com)
|
2009-05-12 00:24:53 +02:00
|
|
|
* In particular, we changed from the one-pass original version to
|
|
|
|
* Tom's recommended multiple-pass version. I wasn't sure about doing
|
2003-04-22 21:02:15 +02:00
|
|
|
* it with multiple passes, until I actually started doing it and saw
|
|
|
|
* the wisdom of Tom's recommendations ...
|
|
|
|
*
|
|
|
|
* Lots of cleanups by Eric Biederman to handle bridges, and to
|
|
|
|
* handle resource allocation for non-pci devices.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <console/console.h>
|
|
|
|
#include <bitops.h>
|
|
|
|
#include <arch/io.h>
|
2003-04-24 08:25:08 +02:00
|
|
|
#include <device/device.h>
|
|
|
|
#include <device/pci.h>
|
2004-05-14 19:20:29 +02:00
|
|
|
#include <device/pci_ids.h>
|
2003-09-02 05:36:25 +02:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2004-10-14 23:25:53 +02:00
|
|
|
#include <smp/spinlock.h>
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/** Linked list of ALL devices */
|
2004-03-11 16:01:31 +01:00
|
|
|
struct device *all_devices = &dev_root;
|
2004-03-23 22:28:05 +01:00
|
|
|
/** Pointer to the last device */
|
2004-10-16 08:20:29 +02:00
|
|
|
extern struct device **last_dev_p;
|
2010-05-21 16:33:48 +02:00
|
|
|
/** Linked list of free resources */
|
|
|
|
struct resource *free_resources = NULL;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/**
|
|
|
|
* @brief Allocate a new device structure.
|
2009-05-12 00:24:53 +02:00
|
|
|
*
|
2004-05-10 18:05:16 +02:00
|
|
|
* Allocte a new device structure and attached it to the device tree as a
|
|
|
|
* child of the parent bus.
|
2004-03-23 22:28:05 +01:00
|
|
|
*
|
|
|
|
* @param parent parent bus the newly created device attached to.
|
|
|
|
* @param path path to the device to be created.
|
|
|
|
*
|
|
|
|
* @return pointer to the newly created device structure.
|
|
|
|
*
|
|
|
|
* @see device_path
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
2009-11-12 17:38:03 +01:00
|
|
|
|
|
|
|
DECLARE_SPIN_LOCK(dev_lock)
|
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
device_t alloc_dev(struct bus *parent, struct device_path *path)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
2003-09-02 05:36:25 +02:00
|
|
|
device_t dev, child;
|
2004-03-23 22:28:05 +01:00
|
|
|
|
2009-05-12 00:24:53 +02:00
|
|
|
spin_lock(&dev_lock);
|
2004-12-03 23:39:34 +01:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Find the last child of our parent. */
|
|
|
|
for (child = parent->children; child && child->sibling; /* */ ) {
|
2003-09-02 05:36:25 +02:00
|
|
|
child = child->sibling;
|
|
|
|
}
|
2004-12-03 23:39:34 +01:00
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
dev = malloc(sizeof(*dev));
|
2009-07-02 20:56:24 +02:00
|
|
|
if (dev == 0)
|
2003-09-02 05:36:25 +02:00
|
|
|
die("DEV: out of memory.\n");
|
2009-07-02 20:56:24 +02:00
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
memset(dev, 0, sizeof(*dev));
|
|
|
|
memcpy(&dev->path, path, sizeof(*path));
|
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* By default devices are enabled. */
|
2004-10-14 23:25:53 +02:00
|
|
|
dev->enabled = 1;
|
2003-09-02 05:36:25 +02:00
|
|
|
|
2004-10-14 22:54:17 +02:00
|
|
|
/* Add the new device to the list of children of the bus. */
|
2003-09-02 05:36:25 +02:00
|
|
|
dev->bus = parent;
|
|
|
|
if (child) {
|
|
|
|
child->sibling = dev;
|
|
|
|
} else {
|
|
|
|
parent->children = dev;
|
|
|
|
}
|
2004-03-23 22:28:05 +01:00
|
|
|
|
2004-10-14 23:25:53 +02:00
|
|
|
/* Append a new device to the global device list.
|
|
|
|
* The list is used to find devices once everything is set up.
|
|
|
|
*/
|
|
|
|
*last_dev_p = dev;
|
|
|
|
last_dev_p = &dev->next;
|
|
|
|
|
|
|
|
spin_unlock(&dev_lock);
|
2003-09-02 05:36:25 +02:00
|
|
|
return dev;
|
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/**
|
2009-05-12 00:24:53 +02:00
|
|
|
* @brief round a number up to an alignment.
|
2003-04-22 21:02:15 +02:00
|
|
|
* @param val the starting value
|
|
|
|
* @param roundup Alignment as a power of two
|
|
|
|
* @returns rounded up number
|
|
|
|
*/
|
2004-10-15 00:52:15 +02:00
|
|
|
static resource_t round(resource_t val, unsigned long pow)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
2004-10-15 00:52:15 +02:00
|
|
|
resource_t mask;
|
|
|
|
mask = (1ULL << pow) - 1ULL;
|
|
|
|
val += mask;
|
|
|
|
val &= ~mask;
|
2003-04-22 21:02:15 +02:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Read the resources on all devices of a given bus.
|
|
|
|
* @param bus bus to read the resources on.
|
|
|
|
*/
|
2003-09-02 05:36:25 +02:00
|
|
|
static void read_resources(struct bus *bus)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
|
|
|
struct device *curdev;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s %s bus %x link: %d\n", dev_path(bus->dev), __func__,
|
2010-06-10 00:41:35 +02:00
|
|
|
bus->secondary, bus->link_num);
|
2004-10-15 00:52:15 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Walk through all devices and find which resources they need. */
|
|
|
|
for (curdev = bus->children; curdev; curdev = curdev->sibling) {
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus *link;
|
2004-10-15 00:52:15 +02:00
|
|
|
if (!curdev->enabled) {
|
2003-04-22 21:02:15 +02:00
|
|
|
continue;
|
|
|
|
}
|
2003-09-02 05:36:25 +02:00
|
|
|
if (!curdev->ops || !curdev->ops->read_resources) {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, "%s missing read_resources\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(curdev));
|
2003-09-02 05:36:25 +02:00
|
|
|
continue;
|
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
curdev->ops->read_resources(curdev);
|
2009-07-02 20:56:24 +02:00
|
|
|
|
|
|
|
/* Read in the resources behind the current device's links. */
|
2010-06-10 00:41:35 +02:00
|
|
|
for (link = curdev->link_list; link; link = link->next)
|
|
|
|
read_resources(link);
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s read_resources bus %d link: %d done\n",
|
2010-06-10 00:41:35 +02:00
|
|
|
dev_path(bus->dev), bus->secondary, bus->link_num);
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
struct pick_largest_state {
|
|
|
|
struct resource *last;
|
2009-07-02 20:56:24 +02:00
|
|
|
struct device *result_dev;
|
2003-09-02 05:36:25 +02:00
|
|
|
struct resource *result;
|
|
|
|
int seen_last;
|
|
|
|
};
|
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
static void pick_largest_resource(void *gp, struct device *dev,
|
|
|
|
struct resource *resource)
|
2003-09-02 05:36:25 +02:00
|
|
|
{
|
2004-10-30 10:05:41 +02:00
|
|
|
struct pick_largest_state *state = gp;
|
2003-09-02 05:36:25 +02:00
|
|
|
struct resource *last;
|
2009-07-02 20:56:24 +02:00
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
last = state->last;
|
2009-07-02 20:56:24 +02:00
|
|
|
|
|
|
|
/* Be certain to pick the successor to last. */
|
2003-09-02 05:36:25 +02:00
|
|
|
if (resource == last) {
|
|
|
|
state->seen_last = 1;
|
|
|
|
return;
|
|
|
|
}
|
2009-05-12 00:24:53 +02:00
|
|
|
if (resource->flags & IORESOURCE_FIXED)
|
|
|
|
return; // Skip it.
|
|
|
|
if (last && ((last->align < resource->align) ||
|
|
|
|
((last->align == resource->align) &&
|
|
|
|
(last->size < resource->size)) ||
|
|
|
|
((last->align == resource->align) &&
|
|
|
|
(last->size == resource->size) && (!state->seen_last)))) {
|
2003-09-02 05:36:25 +02:00
|
|
|
return;
|
|
|
|
}
|
2009-05-12 00:24:53 +02:00
|
|
|
if (!state->result ||
|
|
|
|
(state->result->align < resource->align) ||
|
|
|
|
((state->result->align == resource->align) &&
|
2009-07-02 20:56:24 +02:00
|
|
|
(state->result->size < resource->size))) {
|
2003-09-02 05:36:25 +02:00
|
|
|
state->result_dev = dev;
|
|
|
|
state->result = resource;
|
2009-05-12 00:24:53 +02:00
|
|
|
}
|
2003-09-02 05:36:25 +02:00
|
|
|
}
|
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
static struct device *largest_resource(struct bus *bus,
|
|
|
|
struct resource **result_res,
|
|
|
|
unsigned long type_mask,
|
|
|
|
unsigned long type)
|
2003-09-02 05:36:25 +02:00
|
|
|
{
|
|
|
|
struct pick_largest_state state;
|
|
|
|
|
|
|
|
state.last = *result_res;
|
2009-07-02 20:56:24 +02:00
|
|
|
state.result_dev = NULL;
|
|
|
|
state.result = NULL;
|
2003-09-02 05:36:25 +02:00
|
|
|
state.seen_last = 0;
|
|
|
|
|
2009-05-12 00:24:53 +02:00
|
|
|
search_bus_resources(bus, type_mask, type, pick_largest_resource,
|
|
|
|
&state);
|
2003-09-02 05:36:25 +02:00
|
|
|
|
|
|
|
*result_res = state.result;
|
|
|
|
return state.result_dev;
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Compute allocate resources is the guts of the resource allocator.
|
2009-05-12 00:24:53 +02:00
|
|
|
*
|
2003-04-22 21:02:15 +02:00
|
|
|
* The problem.
|
2009-07-02 20:56:24 +02:00
|
|
|
* - Allocate resource locations for every device.
|
2003-04-22 21:02:15 +02:00
|
|
|
* - Don't overlap, and follow the rules of bridges.
|
|
|
|
* - Don't overlap with resources in fixed locations.
|
|
|
|
* - Be efficient so we don't have ugly strategies.
|
|
|
|
*
|
|
|
|
* The strategy.
|
|
|
|
* - Devices that have fixed addresses are the minority so don't
|
2009-07-02 20:56:24 +02:00
|
|
|
* worry about them too much. Instead only use part of the address
|
|
|
|
* space for devices with programmable addresses. This easily handles
|
2003-04-22 21:02:15 +02:00
|
|
|
* everything except bridges.
|
|
|
|
*
|
2009-07-02 20:56:24 +02:00
|
|
|
* - PCI devices are required to have their sizes and their alignments
|
|
|
|
* equal. In this case an optimal solution to the packing problem
|
|
|
|
* exists. Allocate all devices from highest alignment to least
|
|
|
|
* alignment or vice versa. Use this.
|
2003-04-22 21:02:15 +02:00
|
|
|
*
|
2009-07-02 20:56:24 +02:00
|
|
|
* - So we can handle more than PCI run two allocation passes on bridges. The
|
|
|
|
* first to see how large the resources are behind the bridge, and what
|
|
|
|
* their alignment requirements are. The second to assign a safe address to
|
|
|
|
* the devices behind the bridge. This allows us to treat a bridge as just
|
|
|
|
* a device with a couple of resources, and not need to special case it in
|
|
|
|
* the allocator. Also this allows handling of other types of bridges.
|
2003-04-22 21:02:15 +02:00
|
|
|
*
|
|
|
|
*/
|
2009-10-13 22:00:09 +02:00
|
|
|
static void compute_resources(struct bus *bus, struct resource *bridge,
|
2009-07-02 20:56:24 +02:00
|
|
|
unsigned long type_mask, unsigned long type)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
|
|
|
struct device *dev;
|
|
|
|
struct resource *resource;
|
2004-10-14 23:25:53 +02:00
|
|
|
resource_t base;
|
2009-07-02 20:56:24 +02:00
|
|
|
base = round(bridge->base, bridge->align);
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s %s_%s: base: %llx size: %llx align: %d gran: %d limit: %llx\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(bus->dev), __func__,
|
|
|
|
(type & IORESOURCE_IO) ? "io" : (type & IORESOURCE_PREFETCH) ?
|
|
|
|
"prefmem" : "mem",
|
|
|
|
base, bridge->size, bridge->align, bridge->gran, bridge->limit);
|
2003-09-30 04:16:47 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* For each child which is a bridge, compute_resource_needs. */
|
|
|
|
for (dev = bus->children; dev; dev = dev->sibling) {
|
|
|
|
struct resource *child_bridge;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
if (!dev->link_list)
|
2009-07-02 20:56:24 +02:00
|
|
|
continue;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Find the resources with matching type flags. */
|
2010-05-21 16:33:48 +02:00
|
|
|
for (child_bridge = dev->resource_list; child_bridge;
|
|
|
|
child_bridge = child_bridge->next) {
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus* link;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!(child_bridge->flags & IORESOURCE_BRIDGE) ||
|
|
|
|
(child_bridge->flags & type_mask) != type)
|
|
|
|
continue;
|
2005-07-08 04:49:49 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Split prefetchable memory if combined. Many domains
|
|
|
|
* use the same address space for prefetchable memory
|
|
|
|
* and non-prefetchable memory. Bridges below them
|
|
|
|
* need it separated. Add the PREFETCH flag to the
|
|
|
|
* type_mask and type.
|
|
|
|
*/
|
2010-06-10 00:41:35 +02:00
|
|
|
link = dev->link_list;
|
|
|
|
while (link && link->link_num !=
|
|
|
|
IOINDEX_LINK(child_bridge->index))
|
|
|
|
link = link->next;
|
|
|
|
if (link == NULL)
|
|
|
|
printk(BIOS_ERR, "link %ld not found on %s\n",
|
|
|
|
IOINDEX_LINK(child_bridge->index),
|
|
|
|
dev_path(dev));
|
|
|
|
compute_resources(link, child_bridge,
|
2009-07-02 20:56:24 +02:00
|
|
|
type_mask | IORESOURCE_PREFETCH,
|
|
|
|
type | (child_bridge->flags &
|
|
|
|
IORESOURCE_PREFETCH));
|
2008-04-25 04:02:33 +02:00
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Remember we haven't found anything yet. */
|
|
|
|
resource = NULL;
|
|
|
|
|
|
|
|
/* Walk through all the resources on the current bus and compute the
|
|
|
|
* amount of address space taken by them. Take granularity and
|
|
|
|
* alignment into account.
|
|
|
|
*/
|
|
|
|
while ((dev = largest_resource(bus, &resource, type_mask, type))) {
|
2008-04-25 04:02:33 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Size 0 resources can be skipped. */
|
|
|
|
if (!resource->size) {
|
2003-09-02 05:36:25 +02:00
|
|
|
continue;
|
|
|
|
}
|
2005-07-08 04:49:49 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Propagate the resource alignment to the bridge resource. */
|
|
|
|
if (resource->align > bridge->align) {
|
|
|
|
bridge->align = resource->align;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Propagate the resource limit to the bridge register. */
|
2004-10-21 12:44:08 +02:00
|
|
|
if (bridge->limit > resource->limit) {
|
|
|
|
bridge->limit = resource->limit;
|
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
|
|
|
|
/* Warn if it looks like APICs aren't declared. */
|
|
|
|
if ((resource->limit == 0xffffffff) &&
|
|
|
|
(resource->flags & IORESOURCE_ASSIGNED)) {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, "Resource limit looks wrong! (no APIC?)\n");
|
|
|
|
printk(BIOS_ERR, "%s %02lx limit %08Lx\n", dev_path(dev),
|
2009-07-02 20:56:24 +02:00
|
|
|
resource->index, resource->limit);
|
2004-10-21 12:44:08 +02:00
|
|
|
}
|
2008-08-01 14:28:38 +02:00
|
|
|
|
2003-04-22 21:02:15 +02:00
|
|
|
if (resource->flags & IORESOURCE_IO) {
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Don't allow potential aliases over the legacy PCI
|
|
|
|
* expansion card addresses. The legacy PCI decodes
|
|
|
|
* only 10 bits, uses 0x100 - 0x3ff. Therefore, only
|
|
|
|
* 0x00 - 0xff can be used out of each 0x400 block of
|
|
|
|
* I/O space.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
2003-08-04 21:54:48 +02:00
|
|
|
if ((base & 0x300) != 0) {
|
2003-04-22 21:02:15 +02:00
|
|
|
base = (base & ~0x3ff) + 0x400;
|
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Don't allow allocations in the VGA I/O range.
|
2003-04-22 21:02:15 +02:00
|
|
|
* PCI has special cases for that.
|
|
|
|
*/
|
|
|
|
else if ((base >= 0x3b0) && (base <= 0x3df)) {
|
|
|
|
base = 0x3e0;
|
|
|
|
}
|
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Base must be aligned. */
|
|
|
|
base = round(base, resource->align);
|
|
|
|
resource->base = base;
|
|
|
|
base += resource->size;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s %02lx * [0x%llx - 0x%llx] %s\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(dev), resource->index,
|
|
|
|
resource->base,
|
|
|
|
resource->base + resource->size - 1,
|
|
|
|
(resource->flags & IORESOURCE_IO) ? "io" :
|
|
|
|
(resource->flags & IORESOURCE_PREFETCH) ?
|
|
|
|
"prefmem" : "mem");
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
/* A pci bridge resource does not need to be a power
|
|
|
|
* of two size, but it does have a minimum granularity.
|
|
|
|
* Round the size up to that minimum granularity so we
|
|
|
|
* know not to place something else at an address postitively
|
|
|
|
* decoded by the bridge.
|
|
|
|
*/
|
2009-07-02 20:56:24 +02:00
|
|
|
bridge->size = round(base, bridge->gran) -
|
|
|
|
round(bridge->base, bridge->align);
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s %s_%s: base: %llx size: %llx align: %d gran: %d limit: %llx done\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(bus->dev), __func__,
|
|
|
|
(bridge->flags & IORESOURCE_IO) ? "io" :
|
|
|
|
(bridge->flags & IORESOURCE_PREFETCH) ? "prefmem" : "mem",
|
|
|
|
base, bridge->size, bridge->align, bridge->gran, bridge->limit);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This function is the second part of the resource allocator.
|
|
|
|
*
|
|
|
|
* The problem.
|
|
|
|
* - Allocate resource locations for every device.
|
|
|
|
* - Don't overlap, and follow the rules of bridges.
|
|
|
|
* - Don't overlap with resources in fixed locations.
|
|
|
|
* - Be efficient so we don't have ugly strategies.
|
|
|
|
*
|
|
|
|
* The strategy.
|
|
|
|
* - Devices that have fixed addresses are the minority so don't
|
|
|
|
* worry about them too much. Instead only use part of the address
|
|
|
|
* space for devices with programmable addresses. This easily handles
|
|
|
|
* everything except bridges.
|
|
|
|
*
|
|
|
|
* - PCI devices are required to have their sizes and their alignments
|
|
|
|
* equal. In this case an optimal solution to the packing problem
|
|
|
|
* exists. Allocate all devices from highest alignment to least
|
|
|
|
* alignment or vice versa. Use this.
|
|
|
|
*
|
|
|
|
* - So we can handle more than PCI run two allocation passes on bridges. The
|
|
|
|
* first to see how large the resources are behind the bridge, and what
|
|
|
|
* their alignment requirements are. The second to assign a safe address to
|
|
|
|
* the devices behind the bridge. This allows us to treat a bridge as just
|
|
|
|
* a device with a couple of resources, and not need to special case it in
|
|
|
|
* the allocator. Also this allows handling of other types of bridges.
|
|
|
|
*
|
|
|
|
* - This function assigns the resources a value.
|
|
|
|
*
|
|
|
|
* @param bus The bus we are traversing.
|
|
|
|
* @param bridge The bridge resource which must contain the bus' resources.
|
|
|
|
* @param type_mask This value gets anded with the resource type.
|
|
|
|
* @param type This value must match the result of the and.
|
|
|
|
*/
|
2009-10-13 22:00:09 +02:00
|
|
|
static void allocate_resources(struct bus *bus, struct resource *bridge,
|
2009-07-02 20:56:24 +02:00
|
|
|
unsigned long type_mask, unsigned long type)
|
|
|
|
{
|
|
|
|
struct device *dev;
|
|
|
|
struct resource *resource;
|
|
|
|
resource_t base;
|
|
|
|
base = bridge->base;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s %s_%s: base:%llx size:%llx align:%d gran:%d limit:%llx\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(bus->dev), __func__,
|
|
|
|
(type & IORESOURCE_IO) ? "io" : (type & IORESOURCE_PREFETCH) ?
|
|
|
|
"prefmem" : "mem",
|
|
|
|
base, bridge->size, bridge->align, bridge->gran, bridge->limit);
|
|
|
|
|
|
|
|
/* Remember we haven't found anything yet. */
|
|
|
|
resource = NULL;
|
|
|
|
|
|
|
|
/* Walk through all the resources on the current bus and allocate them
|
|
|
|
* address space.
|
|
|
|
*/
|
|
|
|
while ((dev = largest_resource(bus, &resource, type_mask, type))) {
|
|
|
|
|
|
|
|
/* Propagate the bridge limit to the resource register. */
|
|
|
|
if (resource->limit > bridge->limit) {
|
|
|
|
resource->limit = bridge->limit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Size 0 resources can be skipped. */
|
|
|
|
if (!resource->size) {
|
|
|
|
/* Set the base to limit so it doesn't confuse tolm. */
|
|
|
|
resource->base = resource->limit;
|
|
|
|
resource->flags |= IORESOURCE_ASSIGNED;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (resource->flags & IORESOURCE_IO) {
|
|
|
|
/* Don't allow potential aliases over the legacy PCI
|
|
|
|
* expansion card addresses. The legacy PCI decodes
|
|
|
|
* only 10 bits, uses 0x100 - 0x3ff. Therefore, only
|
|
|
|
* 0x00 - 0xff can be used out of each 0x400 block of
|
|
|
|
* I/O space.
|
|
|
|
*/
|
|
|
|
if ((base & 0x300) != 0) {
|
|
|
|
base = (base & ~0x3ff) + 0x400;
|
|
|
|
}
|
|
|
|
/* Don't allow allocations in the VGA I/O range.
|
|
|
|
* PCI has special cases for that.
|
|
|
|
*/
|
|
|
|
else if ((base >= 0x3b0) && (base <= 0x3df)) {
|
|
|
|
base = 0x3e0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((round(base, resource->align) + resource->size - 1) <=
|
|
|
|
resource->limit) {
|
|
|
|
/* Base must be aligned. */
|
|
|
|
base = round(base, resource->align);
|
|
|
|
resource->base = base;
|
|
|
|
resource->flags |= IORESOURCE_ASSIGNED;
|
|
|
|
resource->flags &= ~IORESOURCE_STORED;
|
|
|
|
base += resource->size;
|
|
|
|
} else {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, "!! Resource didn't fit !!\n");
|
|
|
|
printk(BIOS_ERR, " aligned base %llx size %llx limit %llx\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
round(base, resource->align), resource->size,
|
|
|
|
resource->limit);
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, " %llx needs to be <= %llx (limit)\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
(round(base, resource->align) +
|
|
|
|
resource->size) - 1, resource->limit);
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, " %s%s %02lx * [0x%llx - 0x%llx] %s\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
(resource->
|
|
|
|
flags & IORESOURCE_ASSIGNED) ? "Assigned: " :
|
|
|
|
"", dev_path(dev), resource->index,
|
|
|
|
resource->base,
|
|
|
|
resource->base + resource->size - 1,
|
|
|
|
(resource->
|
|
|
|
flags & IORESOURCE_IO) ? "io" : (resource->
|
|
|
|
flags &
|
|
|
|
IORESOURCE_PREFETCH)
|
|
|
|
? "prefmem" : "mem");
|
|
|
|
}
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s%s %02lx * [0x%llx - 0x%llx] %s\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
(resource->flags & IORESOURCE_ASSIGNED) ? "Assigned: "
|
|
|
|
: "",
|
|
|
|
dev_path(dev), resource->index, resource->base,
|
|
|
|
resource->size ? resource->base + resource->size - 1 :
|
|
|
|
resource->base,
|
|
|
|
(resource->flags & IORESOURCE_IO) ? "io" :
|
|
|
|
(resource->flags & IORESOURCE_PREFETCH) ? "prefmem" :
|
|
|
|
"mem");
|
|
|
|
}
|
|
|
|
/* A PCI bridge resource does not need to be a power of two size, but
|
|
|
|
* it does have a minimum granularity. Round the size up to that
|
|
|
|
* minimum granularity so we know not to place something else at an
|
|
|
|
* address positively decoded by the bridge.
|
|
|
|
*/
|
|
|
|
|
|
|
|
bridge->flags |= IORESOURCE_ASSIGNED;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s %s_%s: next_base: %llx size: %llx align: %d gran: %d done\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(bus->dev), __func__,
|
|
|
|
(type & IORESOURCE_IO) ? "io" : (type & IORESOURCE_PREFETCH) ?
|
|
|
|
"prefmem" : "mem",
|
|
|
|
base, bridge->size, bridge->align, bridge->gran);
|
|
|
|
|
|
|
|
/* For each child which is a bridge, allocate_resources. */
|
|
|
|
for (dev = bus->children; dev; dev = dev->sibling) {
|
|
|
|
struct resource *child_bridge;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
if (!dev->link_list)
|
2009-07-02 20:56:24 +02:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Find the resources with matching type flags. */
|
2010-05-21 16:33:48 +02:00
|
|
|
for (child_bridge = dev->resource_list; child_bridge;
|
|
|
|
child_bridge = child_bridge->next) {
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus* link;
|
2009-07-02 20:56:24 +02:00
|
|
|
|
|
|
|
if (!(child_bridge->flags & IORESOURCE_BRIDGE) ||
|
|
|
|
(child_bridge->flags & type_mask) != type)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Split prefetchable memory if combined. Many domains
|
|
|
|
* use the same address space for prefetchable memory
|
|
|
|
* and non-prefetchable memory. Bridges below them
|
|
|
|
* need it separated. Add the PREFETCH flag to the
|
|
|
|
* type_mask and type.
|
|
|
|
*/
|
2010-06-10 00:41:35 +02:00
|
|
|
link = dev->link_list;
|
|
|
|
while (link && link->link_num !=
|
|
|
|
IOINDEX_LINK(child_bridge->index))
|
|
|
|
link = link->next;
|
|
|
|
if (link == NULL)
|
|
|
|
printk(BIOS_ERR, "link %ld not found on %s\n",
|
|
|
|
IOINDEX_LINK(child_bridge->index),
|
|
|
|
dev_path(dev));
|
|
|
|
allocate_resources(link, child_bridge,
|
2009-07-02 20:56:24 +02:00
|
|
|
type_mask | IORESOURCE_PREFETCH,
|
|
|
|
type | (child_bridge->flags &
|
|
|
|
IORESOURCE_PREFETCH));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#if CONFIG_PCI_64BIT_PREF_MEM == 1
|
|
|
|
#define MEM_MASK (IORESOURCE_PREFETCH | IORESOURCE_MEM)
|
|
|
|
#else
|
|
|
|
#define MEM_MASK (IORESOURCE_MEM)
|
|
|
|
#endif
|
|
|
|
#define IO_MASK (IORESOURCE_IO)
|
|
|
|
#define PREF_TYPE (IORESOURCE_PREFETCH | IORESOURCE_MEM)
|
|
|
|
#define MEM_TYPE (IORESOURCE_MEM)
|
|
|
|
#define IO_TYPE (IORESOURCE_IO)
|
|
|
|
|
|
|
|
struct constraints {
|
|
|
|
struct resource pref, io, mem;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void constrain_resources(struct device *dev, struct constraints* limits)
|
|
|
|
{
|
|
|
|
struct device *child;
|
|
|
|
struct resource *res;
|
|
|
|
struct resource *lim;
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus *link;
|
2009-07-02 20:56:24 +02:00
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s: %s\n", __func__, dev_path(dev));
|
2009-07-02 20:56:24 +02:00
|
|
|
|
|
|
|
/* Constrain limits based on the fixed resources of this device. */
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = dev->resource_list; res; res = res->next) {
|
2009-08-28 14:48:02 +02:00
|
|
|
if (!(res->flags & IORESOURCE_FIXED))
|
|
|
|
continue;
|
2009-08-19 21:12:39 +02:00
|
|
|
if (!res->size) {
|
|
|
|
/* It makes no sense to have 0-sized, fixed resources.*/
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, "skipping %s@%lx fixed resource, size=0!\n",
|
2009-08-19 21:12:39 +02:00
|
|
|
dev_path(dev), res->index);
|
2009-08-19 19:29:41 +02:00
|
|
|
continue;
|
2009-08-19 21:12:39 +02:00
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
|
|
|
|
/* PREFETCH, MEM, or I/O - skip any others. */
|
|
|
|
if ((res->flags & MEM_MASK) == PREF_TYPE)
|
|
|
|
lim = &limits->pref;
|
|
|
|
else if ((res->flags & MEM_MASK) == MEM_TYPE)
|
|
|
|
lim = &limits->mem;
|
|
|
|
else if ((res->flags & IO_MASK) == IO_TYPE)
|
|
|
|
lim = &limits->io;
|
|
|
|
else
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Is it already outside the limits? */
|
2009-10-28 15:57:14 +01:00
|
|
|
if (((res->base + res->size -1) < lim->base) || (res->base > lim->limit))
|
2009-07-02 20:56:24 +02:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Choose to be above or below fixed resources. This
|
|
|
|
* check is signed so that "negative" amounts of space
|
|
|
|
* are handled correctly.
|
|
|
|
*/
|
|
|
|
if ((signed long long)(lim->limit - (res->base + res->size -1)) >
|
|
|
|
(signed long long)(res->base - lim->base))
|
|
|
|
lim->base = res->base + res->size;
|
|
|
|
else
|
|
|
|
lim->limit = res->base -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Descend into every enabled child and look for fixed resources. */
|
2010-06-10 00:41:35 +02:00
|
|
|
for (link = dev->link_list; link; link = link->next)
|
|
|
|
for (child = link->children; child;
|
2009-07-02 20:56:24 +02:00
|
|
|
child = child->sibling)
|
|
|
|
if (child->enabled)
|
|
|
|
constrain_resources(child, limits);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void avoid_fixed_resources(struct device *dev)
|
|
|
|
{
|
|
|
|
struct constraints limits;
|
|
|
|
struct resource *res;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s: %s\n", __func__, dev_path(dev));
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Initialize constraints to maximum size. */
|
|
|
|
|
|
|
|
limits.pref.base = 0;
|
|
|
|
limits.pref.limit = 0xffffffffffffffffULL;
|
|
|
|
limits.io.base = 0;
|
|
|
|
limits.io.limit = 0xffffffffffffffffULL;
|
|
|
|
limits.mem.base = 0;
|
|
|
|
limits.mem.limit = 0xffffffffffffffffULL;
|
|
|
|
|
|
|
|
/* Constrain the limits to dev's initial resources. */
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = dev->resource_list; res; res = res->next) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if ((res->flags & IORESOURCE_FIXED))
|
|
|
|
continue;
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s:@%s %02lx limit %08Lx\n", __func__,
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(dev), res->index, res->limit);
|
|
|
|
if ((res->flags & MEM_MASK) == PREF_TYPE &&
|
|
|
|
(res->limit < limits.pref.limit))
|
|
|
|
limits.pref.limit = res->limit;
|
|
|
|
if ((res->flags & MEM_MASK) == MEM_TYPE &&
|
|
|
|
(res->limit < limits.mem.limit))
|
|
|
|
limits.mem.limit = res->limit;
|
|
|
|
if ((res->flags & IO_MASK) == IO_TYPE &&
|
|
|
|
(res->limit < limits.io.limit))
|
|
|
|
limits.io.limit = res->limit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Look through the tree for fixed resources and update the limits. */
|
|
|
|
constrain_resources(dev, &limits);
|
|
|
|
|
|
|
|
/* Update dev's resources with new limits. */
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = dev->resource_list; res; res = res->next) {
|
2009-07-02 20:56:24 +02:00
|
|
|
struct resource *lim;
|
|
|
|
|
|
|
|
if ((res->flags & IORESOURCE_FIXED))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* PREFETCH, MEM, or I/O - skip any others. */
|
|
|
|
if ((res->flags & MEM_MASK) == PREF_TYPE)
|
|
|
|
lim = &limits.pref;
|
|
|
|
else if ((res->flags & MEM_MASK) == MEM_TYPE)
|
|
|
|
lim = &limits.mem;
|
|
|
|
else if ((res->flags & IO_MASK) == IO_TYPE)
|
|
|
|
lim = &limits.io;
|
|
|
|
else
|
|
|
|
continue;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s2: %s@%02lx limit %08Lx\n", __func__,
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(dev), res->index, res->limit);
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "\tlim->base %08Lx lim->limit %08Lx\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
lim->base, lim->limit);
|
|
|
|
|
|
|
|
/* Is the resource outside the limits? */
|
|
|
|
if (lim->base > res->base)
|
|
|
|
res->base = lim->base;
|
|
|
|
if (res->limit > lim->limit)
|
|
|
|
res->limit = lim->limit;
|
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
2005-07-06 19:16:09 +02:00
|
|
|
|
2009-09-17 18:54:46 +02:00
|
|
|
#if CONFIG_VGA_BRIDGE_SETUP == 1
|
2005-01-17 22:37:12 +01:00
|
|
|
device_t vga_pri = 0;
|
2009-07-02 21:02:33 +02:00
|
|
|
static void set_vga_bridge_bits(void)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
2009-10-27 22:49:33 +01:00
|
|
|
/*
|
|
|
|
* FIXME: Modify set_vga_bridge so it is less PCI centric!
|
|
|
|
* This function knows too much about PCI stuff, it should be just
|
|
|
|
* an iterator/visitor.
|
|
|
|
*/
|
2004-03-23 22:28:05 +01:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* FIXME: Handle the VGA palette snooping. */
|
2005-12-02 22:52:30 +01:00
|
|
|
struct device *dev, *vga, *vga_onboard, *vga_first, *vga_last;
|
2004-10-14 22:54:17 +02:00
|
|
|
struct bus *bus;
|
|
|
|
bus = 0;
|
|
|
|
vga = 0;
|
2005-01-17 22:37:12 +01:00
|
|
|
vga_onboard = 0;
|
2005-12-02 22:52:30 +01:00
|
|
|
vga_first = 0;
|
|
|
|
vga_last = 0;
|
2009-07-02 20:56:24 +02:00
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
|
|
|
if (!dev->enabled)
|
|
|
|
continue;
|
2004-05-14 19:20:29 +02:00
|
|
|
if (((dev->class >> 16) == PCI_BASE_CLASS_DISPLAY) &&
|
2009-07-02 20:56:24 +02:00
|
|
|
((dev->class >> 8) != PCI_CLASS_DISPLAY_OTHER)) {
|
|
|
|
if (!vga_first) {
|
|
|
|
if (dev->on_mainboard) {
|
|
|
|
vga_onboard = dev;
|
|
|
|
} else {
|
|
|
|
vga_first = dev;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (dev->on_mainboard) {
|
|
|
|
vga_onboard = dev;
|
|
|
|
} else {
|
|
|
|
vga_last = dev;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* It isn't safe to enable other VGA cards. */
|
2005-01-17 22:37:12 +01:00
|
|
|
dev->command &= ~(PCI_COMMAND_MEMORY | PCI_COMMAND_IO);
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
}
|
2009-05-12 00:24:53 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
vga = vga_last;
|
2005-12-02 22:52:30 +01:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!vga) {
|
|
|
|
vga = vga_first;
|
|
|
|
}
|
2006-05-18 18:54:30 +02:00
|
|
|
#if CONFIG_CONSOLE_VGA_ONBOARD_AT_FIRST == 1
|
2009-07-02 20:56:24 +02:00
|
|
|
if (vga_onboard) // Will use on board VGA as pri.
|
2005-12-02 22:52:30 +01:00
|
|
|
#else
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!vga) // Will use last add on adapter as pri.
|
2005-12-02 22:52:30 +01:00
|
|
|
#endif
|
2009-07-02 20:56:24 +02:00
|
|
|
{
|
|
|
|
vga = vga_onboard;
|
|
|
|
}
|
2009-05-12 00:24:53 +02:00
|
|
|
|
2005-07-06 19:16:09 +02:00
|
|
|
if (vga) {
|
2009-07-02 20:56:24 +02:00
|
|
|
/* VGA is first add on card or the only onboard VGA. */
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_DEBUG, "Setting up VGA for %s\n", dev_path(vga));
|
2009-07-02 20:56:24 +02:00
|
|
|
/* All legacy VGA cards have MEM & I/O space registers. */
|
2005-01-17 22:37:12 +01:00
|
|
|
vga->command |= (PCI_COMMAND_MEMORY | PCI_COMMAND_IO);
|
|
|
|
vga_pri = vga;
|
2003-04-22 21:02:15 +02:00
|
|
|
bus = vga->bus;
|
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Now walk up the bridges setting the VGA enable. */
|
|
|
|
while (bus) {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_DEBUG, "Setting PCI_BRIDGE_CTL_VGA for bridge %s\n",
|
2005-01-11 23:48:54 +01:00
|
|
|
dev_path(bus->dev));
|
2004-01-08 22:15:49 +01:00
|
|
|
bus->bridge_ctrl |= PCI_BRIDGE_CTL_VGA;
|
2009-07-02 20:56:24 +02:00
|
|
|
bus = (bus == bus->dev->bus) ? 0 : bus->dev->bus;
|
2009-05-12 00:24:53 +02:00
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
2005-12-02 22:52:30 +01:00
|
|
|
|
2005-01-14 23:04:49 +01:00
|
|
|
#endif
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2004-11-25 18:37:19 +01:00
|
|
|
/**
|
|
|
|
* @brief Assign the computed resources to the devices on the bus.
|
|
|
|
*
|
2003-04-22 21:02:15 +02:00
|
|
|
* @param bus Pointer to the structure for this bus
|
2004-11-25 18:37:19 +01:00
|
|
|
*
|
|
|
|
* Use the device specific set_resources method to store the computed
|
|
|
|
* resources to hardware. For bridge devices, the set_resources() method
|
|
|
|
* has to recurse into every down stream buses.
|
|
|
|
*
|
|
|
|
* Mutual recursion:
|
|
|
|
* assign_resources() -> device_operation::set_resources()
|
|
|
|
* device_operation::set_resources() -> assign_resources()
|
|
|
|
*/
|
2003-09-02 05:36:25 +02:00
|
|
|
void assign_resources(struct bus *bus)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
|
|
|
struct device *curdev;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s assign_resources, bus %d link: %d\n",
|
2010-06-10 00:41:35 +02:00
|
|
|
dev_path(bus->dev), bus->secondary, bus->link_num);
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
for (curdev = bus->children; curdev; curdev = curdev->sibling) {
|
2010-05-21 16:33:48 +02:00
|
|
|
if (!curdev->enabled || !curdev->resource_list) {
|
2004-10-14 23:25:53 +02:00
|
|
|
continue;
|
|
|
|
}
|
2003-09-02 05:36:25 +02:00
|
|
|
if (!curdev->ops || !curdev->ops->set_resources) {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, "%s missing set_resources\n",
|
2009-07-02 20:56:24 +02:00
|
|
|
dev_path(curdev));
|
2003-09-02 05:36:25 +02:00
|
|
|
continue;
|
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
curdev->ops->set_resources(curdev);
|
|
|
|
}
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "%s assign_resources, bus %d link: %d\n",
|
2010-06-10 00:41:35 +02:00
|
|
|
dev_path(bus->dev), bus->secondary, bus->link_num);
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2004-04-26 19:51:20 +02:00
|
|
|
/**
|
2010-06-17 18:16:56 +02:00
|
|
|
* @brief Enable the resources for devices on a link
|
2004-04-26 19:51:20 +02:00
|
|
|
*
|
2010-06-17 18:16:56 +02:00
|
|
|
* @param link the link whose devices' resources are to be enabled
|
2004-04-26 19:51:20 +02:00
|
|
|
*
|
|
|
|
* Enable resources of the device by calling the device specific
|
|
|
|
* enable_resources() method.
|
|
|
|
*
|
|
|
|
* The parent's resources should be enabled first to avoid having enabling
|
|
|
|
* order problem. This is done by calling the parent's enable_resources()
|
2010-06-17 18:16:56 +02:00
|
|
|
* method before its childrens' enable_resources() methods.
|
2004-05-10 18:05:16 +02:00
|
|
|
*
|
2004-04-26 19:51:20 +02:00
|
|
|
*/
|
2010-06-17 18:16:56 +02:00
|
|
|
static void enable_resources(struct bus *link)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
2010-06-17 18:16:56 +02:00
|
|
|
struct device *dev;
|
|
|
|
struct bus *c_link;
|
|
|
|
|
|
|
|
for (dev = link->children; dev; dev = dev->sibling) {
|
|
|
|
if (dev->enabled && dev->ops && dev->ops->enable_resources) {
|
|
|
|
dev->ops->enable_resources(dev);
|
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
2010-06-17 18:16:56 +02:00
|
|
|
|
|
|
|
for (dev = link->children; dev; dev = dev->sibling) {
|
|
|
|
for (c_link = dev->link_list; c_link; c_link = c_link->next) {
|
|
|
|
enable_resources(c_link);
|
|
|
|
}
|
2003-10-11 08:20:25 +02:00
|
|
|
}
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2009-05-12 00:24:53 +02:00
|
|
|
/**
|
2005-07-08 04:49:49 +02:00
|
|
|
* @brief Reset all of the devices a bus
|
|
|
|
*
|
|
|
|
* Reset all of the devices on a bus and clear the bus's reset_needed flag.
|
|
|
|
*
|
|
|
|
* @param bus pointer to the bus structure
|
|
|
|
*
|
|
|
|
* @return 1 if the bus was successfully reset, 0 otherwise.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
int reset_bus(struct bus *bus)
|
|
|
|
{
|
2009-07-02 20:56:24 +02:00
|
|
|
if (bus && bus->dev && bus->dev->ops && bus->dev->ops->reset_bus) {
|
2005-07-08 04:49:49 +02:00
|
|
|
bus->dev->ops->reset_bus(bus);
|
|
|
|
bus->reset_needed = 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-05-12 00:24:53 +02:00
|
|
|
/**
|
2005-07-08 04:49:49 +02:00
|
|
|
* @brief Scan for devices on a bus.
|
|
|
|
*
|
2009-07-02 20:56:24 +02:00
|
|
|
* If there are bridges on the bus, recursively scan the buses behind the
|
|
|
|
* bridges. If the setting up and tuning of the bus causes a reset to be
|
|
|
|
* required, reset the bus and scan it again.
|
2005-07-08 04:49:49 +02:00
|
|
|
*
|
2009-07-02 20:56:24 +02:00
|
|
|
* @param busdev Pointer to the bus device.
|
|
|
|
* @param max Current bus number.
|
|
|
|
* @return The maximum bus number found, after scanning all subordinate buses.
|
2005-07-08 04:49:49 +02:00
|
|
|
*/
|
2009-07-02 20:56:24 +02:00
|
|
|
unsigned int scan_bus(struct device *busdev, unsigned int max)
|
2005-07-08 04:49:49 +02:00
|
|
|
{
|
|
|
|
unsigned int new_max;
|
|
|
|
int do_scan_bus;
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!busdev || !busdev->enabled || !busdev->ops ||
|
|
|
|
!busdev->ops->scan_bus) {
|
2005-07-08 04:49:49 +02:00
|
|
|
return max;
|
|
|
|
}
|
2009-07-02 20:56:24 +02:00
|
|
|
|
2005-07-08 04:49:49 +02:00
|
|
|
do_scan_bus = 1;
|
2009-07-02 20:56:24 +02:00
|
|
|
while (do_scan_bus) {
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus *link;
|
2009-07-02 20:56:24 +02:00
|
|
|
new_max = busdev->ops->scan_bus(busdev, max);
|
2005-07-08 04:49:49 +02:00
|
|
|
do_scan_bus = 0;
|
2010-06-10 00:41:35 +02:00
|
|
|
for (link = busdev->link_list; link; link = link->next) {
|
|
|
|
if (link->reset_needed) {
|
|
|
|
if (reset_bus(link)) {
|
2005-07-08 04:49:49 +02:00
|
|
|
do_scan_bus = 1;
|
|
|
|
} else {
|
2009-07-02 20:56:24 +02:00
|
|
|
busdev->bus->reset_needed = 1;
|
2005-07-08 04:49:49 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return new_max;
|
|
|
|
}
|
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/**
|
2004-11-25 18:37:19 +01:00
|
|
|
* @brief Determine the existence of devices and extend the device tree.
|
|
|
|
*
|
|
|
|
* Most of the devices in the system are listed in the mainboard Config.lb
|
|
|
|
* file. The device structures for these devices are generated at compile
|
|
|
|
* time by the config tool and are organized into the device tree. This
|
|
|
|
* function determines if the devices created at compile time actually exist
|
|
|
|
* in the physical system.
|
|
|
|
*
|
|
|
|
* For devices in the physical system but not listed in the Config.lb file,
|
|
|
|
* the device structures have to be created at run time and attached to the
|
2004-03-23 22:28:05 +01:00
|
|
|
* device tree.
|
|
|
|
*
|
2004-11-25 18:37:19 +01:00
|
|
|
* This function starts from the root device 'dev_root', scan the buses in
|
|
|
|
* the system recursively, modify the device tree according to the result of
|
|
|
|
* the probe.
|
2004-03-23 22:28:05 +01:00
|
|
|
*
|
2004-04-26 19:51:20 +02:00
|
|
|
* This function has no idea how to scan and probe buses and devices at all.
|
|
|
|
* It depends on the bus/device specific scan_bus() method to do it. The
|
2004-11-25 18:37:19 +01:00
|
|
|
* scan_bus() method also has to create the device structure and attach
|
2009-05-12 00:24:53 +02:00
|
|
|
* it to the device tree.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
|
|
|
void dev_enumerate(void)
|
|
|
|
{
|
|
|
|
struct device *root;
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Enumerating buses...\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
root = &dev_root;
|
2009-05-12 15:43:34 +02:00
|
|
|
|
2009-10-26 17:47:05 +01:00
|
|
|
show_all_devs(BIOS_SPEW, "Before Device Enumeration.");
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_SPEW, "Compare with tree...\n");
|
2009-10-26 17:47:05 +01:00
|
|
|
show_devs_tree(root, BIOS_SPEW, 0, 0);
|
2009-05-12 15:43:34 +02:00
|
|
|
|
2004-10-16 08:20:29 +02:00
|
|
|
if (root->chip_ops && root->chip_ops->enable_dev) {
|
|
|
|
root->chip_ops->enable_dev(root);
|
|
|
|
}
|
2004-10-14 22:54:17 +02:00
|
|
|
if (!root->ops || !root->ops->scan_bus) {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_ERR, "dev_root missing scan_bus operation");
|
2004-10-14 22:54:17 +02:00
|
|
|
return;
|
|
|
|
}
|
2009-07-18 19:58:44 +02:00
|
|
|
scan_bus(root, 0);
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "done\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/**
|
|
|
|
* @brief Configure devices on the devices tree.
|
2009-05-12 00:24:53 +02:00
|
|
|
*
|
2004-11-25 18:37:19 +01:00
|
|
|
* Starting at the root of the device tree, travel it recursively in two
|
|
|
|
* passes. In the first pass, we compute and allocate resources (ranges)
|
|
|
|
* requried by each device. In the second pass, the resources ranges are
|
|
|
|
* relocated to their final position and stored to the hardware.
|
2004-04-26 19:51:20 +02:00
|
|
|
*
|
2009-07-02 20:56:24 +02:00
|
|
|
* I/O resources grow upward. MEM resources grow downward.
|
2004-04-26 19:51:20 +02:00
|
|
|
*
|
|
|
|
* Since the assignment is hierarchical we set the values into the dev_root
|
2009-05-12 00:24:53 +02:00
|
|
|
* struct.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
|
|
|
void dev_configure(void)
|
|
|
|
{
|
2009-07-02 20:56:24 +02:00
|
|
|
struct resource *res;
|
2004-10-14 22:54:17 +02:00
|
|
|
struct device *root;
|
2009-07-02 20:56:24 +02:00
|
|
|
struct device *child;
|
2004-03-23 22:28:05 +01:00
|
|
|
|
2009-09-17 18:54:46 +02:00
|
|
|
#if CONFIG_VGA_BRIDGE_SETUP == 1
|
2009-07-02 21:02:33 +02:00
|
|
|
set_vga_bridge_bits();
|
|
|
|
#endif
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Allocating resources...\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2004-10-14 22:54:17 +02:00
|
|
|
root = &dev_root;
|
2009-05-12 15:43:34 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Each domain should create resources which contain the entire address
|
|
|
|
* space for IO, MEM, and PREFMEM resources in the domain. The
|
|
|
|
* allocation of device resources will be done from this address space.
|
|
|
|
*/
|
2009-05-12 15:43:34 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Read the resources for the entire tree. */
|
2004-11-25 18:37:19 +01:00
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Reading resources...\n");
|
2010-06-10 00:41:35 +02:00
|
|
|
read_resources(root->link_list);
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Done reading resources.\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2009-10-26 17:47:05 +01:00
|
|
|
print_resource_tree(root, BIOS_SPEW, "After reading.");
|
2009-05-12 15:43:34 +02:00
|
|
|
|
2009-07-02 20:56:24 +02:00
|
|
|
/* Compute resources for all domains. */
|
2010-06-10 00:41:35 +02:00
|
|
|
for (child = root->link_list->children; child; child = child->sibling) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!(child->path.type == DEVICE_PATH_PCI_DOMAIN))
|
|
|
|
continue;
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = child->resource_list; res; res = res->next) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if (res->flags & IORESOURCE_FIXED)
|
|
|
|
continue;
|
|
|
|
if (res->flags & IORESOURCE_PREFETCH) {
|
2010-06-10 00:41:35 +02:00
|
|
|
compute_resources(child->link_list,
|
2009-07-02 20:56:24 +02:00
|
|
|
res, MEM_MASK, PREF_TYPE);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (res->flags & IORESOURCE_MEM) {
|
2010-06-10 00:41:35 +02:00
|
|
|
compute_resources(child->link_list,
|
2009-07-02 20:56:24 +02:00
|
|
|
res, MEM_MASK, MEM_TYPE);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (res->flags & IORESOURCE_IO) {
|
2010-06-10 00:41:35 +02:00
|
|
|
compute_resources(child->link_list,
|
2009-07-02 20:56:24 +02:00
|
|
|
res, IO_MASK, IO_TYPE);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* For all domains. */
|
2010-06-10 00:41:35 +02:00
|
|
|
for (child = root->link_list->children; child; child=child->sibling)
|
2009-07-02 20:56:24 +02:00
|
|
|
if (child->path.type == DEVICE_PATH_PCI_DOMAIN)
|
|
|
|
avoid_fixed_resources(child);
|
|
|
|
|
|
|
|
/* Now we need to adjust the resources. MEM resources need to start at
|
|
|
|
* the highest address managable.
|
2004-10-14 22:54:17 +02:00
|
|
|
*/
|
2010-06-10 00:41:35 +02:00
|
|
|
for (child = root->link_list->children; child; child = child->sibling) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if (child->path.type != DEVICE_PATH_PCI_DOMAIN)
|
|
|
|
continue;
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = child->resource_list; res; res = res->next) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!(res->flags & IORESOURCE_MEM) ||
|
|
|
|
res->flags & IORESOURCE_FIXED)
|
|
|
|
continue;
|
|
|
|
res->base = resource_max(res);
|
|
|
|
}
|
|
|
|
}
|
2004-03-11 16:01:31 +01:00
|
|
|
|
2004-10-14 22:54:17 +02:00
|
|
|
/* Store the computed resource allocations into device registers ... */
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Setting resources...\n");
|
2010-06-10 00:41:35 +02:00
|
|
|
for (child = root->link_list->children; child; child = child->sibling) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if (!(child->path.type == DEVICE_PATH_PCI_DOMAIN))
|
|
|
|
continue;
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = child->resource_list; res; res = res->next) {
|
2009-07-02 20:56:24 +02:00
|
|
|
if (res->flags & IORESOURCE_FIXED)
|
|
|
|
continue;
|
|
|
|
if (res->flags & IORESOURCE_PREFETCH) {
|
2010-06-10 00:41:35 +02:00
|
|
|
allocate_resources(child->link_list,
|
2009-07-02 20:56:24 +02:00
|
|
|
res, MEM_MASK, PREF_TYPE);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (res->flags & IORESOURCE_MEM) {
|
2010-06-10 00:41:35 +02:00
|
|
|
allocate_resources(child->link_list,
|
2009-07-02 20:56:24 +02:00
|
|
|
res, MEM_MASK, MEM_TYPE);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (res->flags & IORESOURCE_IO) {
|
2010-06-10 00:41:35 +02:00
|
|
|
allocate_resources(child->link_list,
|
2009-07-02 20:56:24 +02:00
|
|
|
res, IO_MASK, IO_TYPE);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-06-10 00:41:35 +02:00
|
|
|
assign_resources(root->link_list);
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Done setting resources.\n");
|
2009-10-26 17:47:05 +01:00
|
|
|
print_resource_tree(root, BIOS_SPEW, "After assigning values.");
|
2004-10-14 23:25:53 +02:00
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Done allocating resources.\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/**
|
|
|
|
* @brief Enable devices on the device tree.
|
|
|
|
*
|
|
|
|
* Starting at the root, walk the tree and enable all devices/bridges by
|
|
|
|
* calling the device's enable_resources() method.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
|
|
|
void dev_enable(void)
|
|
|
|
{
|
2010-06-17 18:16:56 +02:00
|
|
|
struct bus *link;
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Enabling resources...\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
|
|
|
|
/* now enable everything. */
|
2010-06-17 18:16:56 +02:00
|
|
|
for (link = dev_root.link_list; link; link = link->next)
|
|
|
|
enable_resources(link);
|
2004-03-23 22:28:05 +01:00
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "done.\n");
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2004-03-23 22:28:05 +01:00
|
|
|
/**
|
2010-06-17 18:16:56 +02:00
|
|
|
* @brief Initialize a specific device
|
|
|
|
*
|
|
|
|
* @param dev the device to be initialized
|
|
|
|
*
|
|
|
|
* The parent should be initialized first to avoid having an ordering
|
|
|
|
* problem. This is done by calling the parent's init()
|
|
|
|
* method before its childrens' init() methods.
|
2004-03-23 22:28:05 +01:00
|
|
|
*
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
2010-06-17 18:16:56 +02:00
|
|
|
static void init_dev(struct device *dev)
|
|
|
|
{
|
|
|
|
if (!dev->enabled) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!dev->initialized && dev->ops && dev->ops->init) {
|
|
|
|
if (dev->path.type == DEVICE_PATH_I2C) {
|
|
|
|
printk(BIOS_DEBUG, "smbus: %s[%d]->",
|
|
|
|
dev_path(dev->bus->dev), dev->bus->link_num);
|
|
|
|
}
|
|
|
|
|
|
|
|
printk(BIOS_DEBUG, "%s init\n", dev_path(dev));
|
|
|
|
dev->initialized = 1;
|
|
|
|
dev->ops->init(dev);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void init_link(struct bus *link)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
|
|
|
struct device *dev;
|
2010-06-17 18:16:56 +02:00
|
|
|
struct bus *c_link;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2010-06-17 18:16:56 +02:00
|
|
|
for (dev = link->children; dev; dev = dev->sibling) {
|
|
|
|
init_dev(dev);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (dev = link->children; dev; dev = dev->sibling) {
|
|
|
|
for (c_link = dev->link_list; c_link; c_link = c_link->next) {
|
|
|
|
init_link(c_link);
|
2005-07-08 04:49:49 +02:00
|
|
|
}
|
|
|
|
}
|
2010-06-17 18:16:56 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Initialize all devices in the global device tree.
|
|
|
|
*
|
|
|
|
* Starting at the root device, call the device's init() method to do device-
|
|
|
|
* specific setup, then call each child's init() method.
|
|
|
|
*/
|
|
|
|
void dev_initialize(void)
|
|
|
|
{
|
|
|
|
struct bus *link;
|
|
|
|
|
|
|
|
printk(BIOS_INFO, "Initializing devices...\n");
|
|
|
|
|
2010-08-16 18:25:23 +02:00
|
|
|
/* First call the mainboard init. */
|
|
|
|
init_dev(&dev_root);
|
|
|
|
|
2010-06-17 18:16:56 +02:00
|
|
|
/* now initialize everything. */
|
|
|
|
for (link = dev_root.link_list; link; link = link->next)
|
|
|
|
init_link(link);
|
|
|
|
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_INFO, "Devices initialized\n");
|
2009-10-26 17:47:05 +01:00
|
|
|
show_all_devs(BIOS_SPEW, "After init.");
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|