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
|
|
|
*
|
|
|
|
* Copyright (C) 2003-2004 Linux Networx
|
|
|
|
* (Written by Eric Biederman <ebiederman@lnxi.com> for Linux Networx)
|
|
|
|
* Copyright (C) 2003 Greg Watson <jarrah@users.sourceforge.net>
|
|
|
|
* Copyright (C) 2004 Li-Ta Lo <ollie@lanl.gov>
|
|
|
|
* Copyright (C) 2005-2006 Tyan
|
|
|
|
* (Written by Yinghai Lu <yhlu@tyan.com> for Tyan)
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; version 2 of the License.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
2013-02-23 18:37:27 +01:00
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
2007-04-22 21:08:13 +02:00
|
|
|
*/
|
|
|
|
|
2003-04-22 21:02:15 +02:00
|
|
|
#include <console/console.h>
|
2003-04-24 08:25:08 +02:00
|
|
|
#include <device/device.h>
|
2003-09-02 05:36:25 +02:00
|
|
|
#include <device/path.h>
|
|
|
|
#include <device/pci.h>
|
2004-10-30 10:05:41 +02:00
|
|
|
#include <device/resource.h>
|
2003-09-02 05:36:25 +02:00
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* See if a device structure exists for path.
|
2004-03-23 22:28:05 +01:00
|
|
|
*
|
2010-10-17 21:01:48 +02:00
|
|
|
* @param parent The bus to find the device on.
|
|
|
|
* @param path The relative path from the bus to the appropriate device.
|
|
|
|
* @return Pointer to a device structure for the device on bus at path
|
|
|
|
* or 0/NULL if no device is found.
|
2003-09-02 05:36:25 +02:00
|
|
|
*/
|
2004-10-14 23:25:53 +02:00
|
|
|
device_t find_dev_path(struct bus *parent, struct device_path *path)
|
2003-09-02 05:36:25 +02:00
|
|
|
{
|
|
|
|
device_t child;
|
2010-06-10 00:41:35 +02:00
|
|
|
for (child = parent->children; child; child = child->sibling) {
|
2010-11-05 00:23:47 +01:00
|
|
|
if (path_eq(path, &child->path))
|
2004-10-14 23:25:53 +02:00
|
|
|
break;
|
2003-09-02 05:36:25 +02:00
|
|
|
}
|
2004-10-14 23:25:53 +02:00
|
|
|
return child;
|
|
|
|
}
|
|
|
|
|
2003-04-22 21:02:15 +02:00
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Given a PCI bus and a devfn number, find the device structure.
|
2004-12-27 05:25:41 +01:00
|
|
|
*
|
2010-10-17 21:01:48 +02:00
|
|
|
* @param bus The bus number.
|
|
|
|
* @param devfn A device/function number.
|
|
|
|
* @return Pointer to the device structure (if found), 0 otherwise.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
|
|
|
struct device *dev_find_slot(unsigned int bus, unsigned int devfn)
|
|
|
|
{
|
2003-10-11 08:20:25 +02:00
|
|
|
struct device *dev, *result;
|
2003-04-22 21:02:15 +02:00
|
|
|
|
2003-10-11 08:20:25 +02:00
|
|
|
result = 0;
|
2003-09-02 05:36:25 +02:00
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
2004-03-11 16:01:31 +01:00
|
|
|
if ((dev->path.type == DEVICE_PATH_PCI) &&
|
2010-11-05 00:23:47 +01:00
|
|
|
(dev->bus->secondary == bus) &&
|
|
|
|
(dev->path.pci.devfn == devfn)) {
|
2003-10-11 08:20:25 +02:00
|
|
|
result = dev;
|
2003-04-22 21:02:15 +02:00
|
|
|
break;
|
2003-09-02 05:36:25 +02:00
|
|
|
}
|
|
|
|
}
|
2003-10-11 08:20:25 +02:00
|
|
|
return result;
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
|
2005-07-06 19:13:46 +02:00
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Given an SMBus bus and a device number, find the device structure.
|
2005-07-06 19:13:46 +02:00
|
|
|
*
|
2010-10-17 21:01:48 +02:00
|
|
|
* @param bus The bus number.
|
|
|
|
* @param addr A device number.
|
|
|
|
* @return Pointer to the device structure (if found), 0 otherwise.
|
2005-07-06 19:13:46 +02:00
|
|
|
*/
|
|
|
|
struct device *dev_find_slot_on_smbus(unsigned int bus, unsigned int addr)
|
|
|
|
{
|
2010-11-05 00:23:47 +01:00
|
|
|
struct device *dev, *result;
|
2010-04-27 08:56:47 +02:00
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
result = 0;
|
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
|
|
|
if ((dev->path.type == DEVICE_PATH_I2C) &&
|
|
|
|
(dev->bus->secondary == bus) &&
|
|
|
|
(dev->path.i2c.device == addr)) {
|
|
|
|
result = dev;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
2010-04-27 08:56:47 +02:00
|
|
|
}
|
2005-07-06 19:13:46 +02:00
|
|
|
|
2014-02-04 14:34:11 +01:00
|
|
|
/**
|
|
|
|
* Given a PnP port and a device number, find the device structure.
|
|
|
|
*
|
|
|
|
* @param port The I/O port.
|
|
|
|
* @param device Logical device number.
|
|
|
|
* @return Pointer to the device structure (if found), 0 otherwise.
|
|
|
|
*/
|
|
|
|
struct device *dev_find_slot_pnp(u16 port, u8 device)
|
|
|
|
{
|
|
|
|
struct device *dev;
|
|
|
|
|
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
|
|
|
if ((dev->path.type == DEVICE_PATH_PNP) &&
|
|
|
|
(dev->path.pnp.port == port) &&
|
|
|
|
(dev->path.pnp.device == device)) {
|
|
|
|
return dev;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-07-18 19:41:36 +02:00
|
|
|
/**
|
|
|
|
* Given a Local APIC ID, find the device structure.
|
|
|
|
*
|
|
|
|
* @param apic_id The Local APIC ID number.
|
|
|
|
* @return Pointer to the device structure (if found), 0 otherwise.
|
|
|
|
*/
|
|
|
|
device_t dev_find_lapic(unsigned apic_id)
|
|
|
|
{
|
|
|
|
device_t dev, result = NULL;
|
|
|
|
|
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
|
|
|
if (dev->path.type == DEVICE_PATH_APIC &&
|
|
|
|
dev->path.apic.apic_id == apic_id) {
|
|
|
|
result = dev;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2010-10-17 21:01:48 +02:00
|
|
|
/**
|
|
|
|
* Find a device of a given vendor and type.
|
|
|
|
*
|
|
|
|
* @param vendor A PCI vendor ID (e.g. 0x8086 for Intel).
|
|
|
|
* @param device A PCI device ID.
|
2010-11-05 00:23:47 +01:00
|
|
|
* @param from Pointer to the device structure, used as a starting point in
|
|
|
|
* the linked list of all_devices, which can be 0 to start at the
|
|
|
|
* head of the list (i.e. all_devices).
|
2010-10-17 21:01:48 +02:00
|
|
|
* @return Pointer to the device struct.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
2010-11-05 00:23:47 +01:00
|
|
|
struct device *dev_find_device(u16 vendor, u16 device, struct device *from)
|
2003-04-22 21:02:15 +02:00
|
|
|
{
|
|
|
|
if (!from)
|
|
|
|
from = all_devices;
|
|
|
|
else
|
|
|
|
from = from->next;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
while (from && (from->vendor != vendor || from->device != device))
|
2003-04-22 21:02:15 +02:00
|
|
|
from = from->next;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2003-04-22 21:02:15 +02:00
|
|
|
return from;
|
|
|
|
}
|
|
|
|
|
2010-10-17 21:01:48 +02:00
|
|
|
/**
|
|
|
|
* Find a device of a given class.
|
|
|
|
*
|
|
|
|
* @param class Class of the device.
|
2010-11-05 00:23:47 +01:00
|
|
|
* @param from Pointer to the device structure, used as a starting point in
|
|
|
|
* the linked list of all_devices, which can be 0 to start at the
|
|
|
|
* head of the list (i.e. all_devices).
|
2010-10-17 21:01:48 +02:00
|
|
|
* @return Pointer to the device struct.
|
2003-04-22 21:02:15 +02:00
|
|
|
*/
|
|
|
|
struct device *dev_find_class(unsigned int class, struct device *from)
|
|
|
|
{
|
|
|
|
if (!from)
|
|
|
|
from = all_devices;
|
|
|
|
else
|
|
|
|
from = from->next;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2003-12-17 18:39:53 +01:00
|
|
|
while (from && (from->class & 0xffffff00) != class)
|
2003-04-22 21:02:15 +02:00
|
|
|
from = from->next;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2003-04-22 21:02:15 +02:00
|
|
|
return from;
|
|
|
|
}
|
|
|
|
|
2013-06-10 18:59:17 +02:00
|
|
|
/**
|
|
|
|
* Encode the device path into 3 bytes for logging to CMOS.
|
|
|
|
*
|
|
|
|
* @param dev The device path to encode.
|
|
|
|
* @return Device path encoded into lower 3 bytes of dword.
|
|
|
|
*/
|
|
|
|
u32 dev_path_encode(device_t dev)
|
|
|
|
{
|
|
|
|
u32 ret;
|
|
|
|
|
|
|
|
if (!dev)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Store the device type in 3rd byte. */
|
|
|
|
ret = dev->path.type << 16;
|
|
|
|
|
|
|
|
/* Encode the device specific path in the low word. */
|
|
|
|
switch (dev->path.type) {
|
|
|
|
case DEVICE_PATH_ROOT:
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_PCI:
|
|
|
|
ret |= dev->bus->secondary << 8 | dev->path.pci.devfn;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_PNP:
|
|
|
|
ret |= dev->path.pnp.port << 8 | dev->path.pnp.device;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_I2C:
|
|
|
|
ret |= dev->bus->secondary << 8 | dev->path.pnp.device;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_APIC:
|
|
|
|
ret |= dev->path.apic.apic_id;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_DOMAIN:
|
|
|
|
ret |= dev->path.domain.domain;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_CPU_CLUSTER:
|
|
|
|
ret |= dev->path.cpu_cluster.cluster;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_CPU:
|
|
|
|
ret |= dev->path.cpu.id;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_CPU_BUS:
|
|
|
|
ret |= dev->path.cpu_bus.id;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_IOAPIC:
|
|
|
|
ret |= dev->path.ioapic.ioapic_id;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_NONE:
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2010-10-17 21:01:48 +02:00
|
|
|
/*
|
|
|
|
* Warning: This function uses a static buffer. Don't call it more than once
|
|
|
|
* from the same print statement!
|
|
|
|
*/
|
2003-09-02 05:36:25 +02:00
|
|
|
const char *dev_path(device_t dev)
|
|
|
|
{
|
|
|
|
static char buffer[DEVICE_PATH_MAX];
|
2010-10-17 21:01:48 +02:00
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
buffer[0] = '\0';
|
|
|
|
if (!dev) {
|
|
|
|
memcpy(buffer, "<null>", 7);
|
2010-11-05 00:23:47 +01:00
|
|
|
} else {
|
2003-09-02 05:36:25 +02:00
|
|
|
switch(dev->path.type) {
|
2003-10-11 08:20:25 +02:00
|
|
|
case DEVICE_PATH_ROOT:
|
|
|
|
memcpy(buffer, "Root Device", 12);
|
|
|
|
break;
|
2003-09-02 05:36:25 +02:00
|
|
|
case DEVICE_PATH_PCI:
|
2009-06-30 17:17:49 +02:00
|
|
|
#if CONFIG_PCI_BUS_SEGN_BITS
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer),
|
|
|
|
"PCI: %04x:%02x:%02x.%01x",
|
|
|
|
dev->bus->secondary >> 8,
|
|
|
|
dev->bus->secondary & 0xff,
|
|
|
|
PCI_SLOT(dev->path.pci.devfn),
|
|
|
|
PCI_FUNC(dev->path.pci.devfn));
|
2006-10-05 00:56:21 +02:00
|
|
|
#else
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer),
|
|
|
|
"PCI: %02x:%02x.%01x",
|
|
|
|
dev->bus->secondary,
|
|
|
|
PCI_SLOT(dev->path.pci.devfn),
|
|
|
|
PCI_FUNC(dev->path.pci.devfn));
|
2006-10-05 00:56:21 +02:00
|
|
|
#endif
|
2003-09-02 05:36:25 +02:00
|
|
|
break;
|
|
|
|
case DEVICE_PATH_PNP:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "PNP: %04x.%01x",
|
|
|
|
dev->path.pnp.port, dev->path.pnp.device);
|
2003-09-02 05:36:25 +02:00
|
|
|
break;
|
|
|
|
case DEVICE_PATH_I2C:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "I2C: %02x:%02x",
|
|
|
|
dev->bus->secondary,
|
|
|
|
dev->path.i2c.device);
|
2003-09-02 05:36:25 +02:00
|
|
|
break;
|
2004-10-14 23:25:53 +02:00
|
|
|
case DEVICE_PATH_APIC:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "APIC: %02x",
|
|
|
|
dev->path.apic.apic_id);
|
2004-10-14 23:25:53 +02:00
|
|
|
break;
|
2012-06-21 22:19:48 +02:00
|
|
|
case DEVICE_PATH_IOAPIC:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "IOAPIC: %02x",
|
|
|
|
dev->path.ioapic.ioapic_id);
|
2012-06-21 22:19:48 +02:00
|
|
|
break;
|
2013-02-12 23:17:15 +01:00
|
|
|
case DEVICE_PATH_DOMAIN:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "DOMAIN: %04x",
|
2013-02-12 23:17:15 +01:00
|
|
|
dev->path.domain.domain);
|
2004-10-16 08:20:29 +02:00
|
|
|
break;
|
2013-02-13 00:20:54 +01:00
|
|
|
case DEVICE_PATH_CPU_CLUSTER:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "CPU_CLUSTER: %01x",
|
2013-02-13 00:20:54 +01:00
|
|
|
dev->path.cpu_cluster.cluster);
|
2004-10-16 08:20:29 +02:00
|
|
|
break;
|
2004-11-18 23:38:08 +01:00
|
|
|
case DEVICE_PATH_CPU:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer),
|
|
|
|
"CPU: %02x", dev->path.cpu.id);
|
2004-11-18 23:38:08 +01:00
|
|
|
break;
|
|
|
|
case DEVICE_PATH_CPU_BUS:
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer),
|
|
|
|
"CPU_BUS: %02x", dev->path.cpu_bus.id);
|
2004-11-18 23:38:08 +01:00
|
|
|
break;
|
2003-09-02 05:36:25 +02:00
|
|
|
default:
|
2010-11-05 00:23:47 +01:00
|
|
|
printk(BIOS_ERR, "Unknown device path type: %d\n",
|
|
|
|
dev->path.type);
|
2003-09-02 05:36:25 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
|
2012-10-07 14:57:15 +02:00
|
|
|
const char *dev_name(device_t dev)
|
|
|
|
{
|
2012-10-10 22:14:28 +02:00
|
|
|
if (dev->name)
|
|
|
|
return dev->name;
|
|
|
|
else if (dev->chip_ops && dev->chip_ops->name)
|
2012-10-07 14:57:15 +02:00
|
|
|
return dev->chip_ops->name;
|
|
|
|
else
|
|
|
|
return "unknown";
|
|
|
|
}
|
|
|
|
|
2005-07-08 04:49:49 +02:00
|
|
|
const char *bus_path(struct bus *bus)
|
|
|
|
{
|
|
|
|
static char buffer[BUS_PATH_MAX];
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer),
|
|
|
|
"%s,%d", dev_path(bus->dev), bus->link_num);
|
2005-07-08 04:49:49 +02:00
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
int path_eq(struct device_path *path1, struct device_path *path2)
|
|
|
|
{
|
|
|
|
int equal = 0;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
if (path1->type != path2->type)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
switch (path1->type) {
|
|
|
|
case DEVICE_PATH_NONE:
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_ROOT:
|
|
|
|
equal = 1;
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_PCI:
|
|
|
|
equal = (path1->pci.devfn == path2->pci.devfn);
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_PNP:
|
|
|
|
equal = (path1->pnp.port == path2->pnp.port) &&
|
|
|
|
(path1->pnp.device == path2->pnp.device);
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_I2C:
|
|
|
|
equal = (path1->i2c.device == path2->i2c.device);
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_APIC:
|
|
|
|
equal = (path1->apic.apic_id == path2->apic.apic_id);
|
|
|
|
break;
|
2013-02-12 23:17:15 +01:00
|
|
|
case DEVICE_PATH_DOMAIN:
|
|
|
|
equal = (path1->domain.domain == path2->domain.domain);
|
2010-11-05 00:23:47 +01:00
|
|
|
break;
|
2013-02-13 00:20:54 +01:00
|
|
|
case DEVICE_PATH_CPU_CLUSTER:
|
|
|
|
equal = (path1->cpu_cluster.cluster
|
|
|
|
== path2->cpu_cluster.cluster);
|
2010-11-05 00:23:47 +01:00
|
|
|
break;
|
|
|
|
case DEVICE_PATH_CPU:
|
|
|
|
equal = (path1->cpu.id == path2->cpu.id);
|
|
|
|
break;
|
|
|
|
case DEVICE_PATH_CPU_BUS:
|
|
|
|
equal = (path1->cpu_bus.id == path2->cpu_bus.id);
|
|
|
|
break;
|
|
|
|
default:
|
2013-07-09 00:24:19 +02:00
|
|
|
printk(BIOS_ERR, "Unknown device type: %d\n", path1->type);
|
2010-11-05 00:23:47 +01:00
|
|
|
break;
|
2003-09-02 05:36:25 +02:00
|
|
|
}
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2003-09-02 05:36:25 +02:00
|
|
|
return equal;
|
|
|
|
}
|
2004-03-11 16:01:31 +01:00
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
/**
|
|
|
|
* Allocate 64 more resources to the free list.
|
2010-10-17 21:01:48 +02:00
|
|
|
*
|
|
|
|
* @return TODO.
|
2010-05-21 16:33:48 +02:00
|
|
|
*/
|
|
|
|
static int allocate_more_resources(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct resource *new_res_list;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
new_res_list = malloc(64 * sizeof(*new_res_list));
|
|
|
|
|
|
|
|
if (new_res_list == NULL)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
memset(new_res_list, 0, 64 * sizeof(*new_res_list));
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
for (i = 0; i < 64 - 1; i++)
|
2010-05-21 16:33:48 +02:00
|
|
|
new_res_list[i].next = &new_res_list[i+1];
|
|
|
|
|
|
|
|
free_resources = new_res_list;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Remove resource res from the device's list and add it to the free list.
|
2010-10-17 21:01:48 +02:00
|
|
|
*
|
|
|
|
* @param dev TODO
|
|
|
|
* @param res TODO
|
|
|
|
* @param prev TODO
|
|
|
|
* @return TODO.
|
2010-05-21 16:33:48 +02:00
|
|
|
*/
|
2010-10-17 21:01:48 +02:00
|
|
|
static void free_resource(device_t dev, struct resource *res,
|
|
|
|
struct resource *prev)
|
2010-05-21 16:33:48 +02:00
|
|
|
{
|
|
|
|
if (prev)
|
|
|
|
prev->next = res->next;
|
|
|
|
else
|
|
|
|
dev->resource_list = res->next;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
res->next = free_resources;
|
|
|
|
free_resources = res;
|
|
|
|
}
|
|
|
|
|
2004-03-11 16:01:31 +01:00
|
|
|
/**
|
|
|
|
* See if we have unused but allocated resource structures.
|
2010-11-05 00:23:47 +01:00
|
|
|
*
|
2004-03-11 16:01:31 +01:00
|
|
|
* If so remove the allocation.
|
2010-10-17 21:01:48 +02:00
|
|
|
*
|
|
|
|
* @param dev The device to find the resource on.
|
2004-03-11 16:01:31 +01:00
|
|
|
*/
|
|
|
|
void compact_resources(device_t dev)
|
|
|
|
{
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *res, *next, *prev = NULL;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2004-03-11 16:01:31 +01:00
|
|
|
/* Move all of the free resources to the end */
|
2010-06-10 00:41:35 +02:00
|
|
|
for (res = dev->resource_list; res; res = next) {
|
2010-05-21 16:33:48 +02:00
|
|
|
next = res->next;
|
|
|
|
if (!res->flags)
|
|
|
|
free_resource(dev, res, prev);
|
|
|
|
else
|
|
|
|
prev = res;
|
2004-03-11 16:01:31 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* See if a resource structure already exists for a given index.
|
|
|
|
*
|
|
|
|
* @param dev The device to find the resource on.
|
|
|
|
* @param index The index of the resource on the device.
|
|
|
|
* @return The resource, if it already exists.
|
2004-03-11 16:01:31 +01:00
|
|
|
*/
|
2004-10-14 23:25:53 +02:00
|
|
|
struct resource *probe_resource(device_t dev, unsigned index)
|
2004-03-11 16:01:31 +01:00
|
|
|
{
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *res;
|
2010-10-17 21:01:48 +02:00
|
|
|
|
2004-03-11 16:01:31 +01:00
|
|
|
/* See if there is a resource with the appropriate index */
|
2010-06-10 00:41:35 +02:00
|
|
|
for (res = dev->resource_list; res; res = res->next) {
|
2010-05-21 16:33:48 +02:00
|
|
|
if (res->index == index)
|
2004-03-11 16:01:31 +01:00
|
|
|
break;
|
|
|
|
}
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
return res;
|
2004-10-14 23:25:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* See if a resource structure already exists for a given index and if not
|
|
|
|
* allocate one.
|
|
|
|
*
|
|
|
|
* Then initialize the initialize the resource to default values.
|
|
|
|
*
|
|
|
|
* @param dev The device to find the resource on.
|
|
|
|
* @param index The index of the resource on the device.
|
|
|
|
* @return TODO.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
|
|
|
struct resource *new_resource(device_t dev, unsigned index)
|
|
|
|
{
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *resource, *tail;
|
2004-10-14 23:25:53 +02:00
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
/* First move all of the free resources to the end. */
|
2004-10-14 23:25:53 +02:00
|
|
|
compact_resources(dev);
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
/* See if there is a resource with the appropriate index. */
|
2004-10-14 23:25:53 +02:00
|
|
|
resource = probe_resource(dev, index);
|
2004-03-11 16:01:31 +01:00
|
|
|
if (!resource) {
|
2010-05-21 16:33:48 +02:00
|
|
|
if (free_resources == NULL && !allocate_more_resources())
|
|
|
|
die("Couldn't allocate more resources.");
|
|
|
|
|
|
|
|
resource = free_resources;
|
|
|
|
free_resources = free_resources->next;
|
2004-03-11 16:01:31 +01:00
|
|
|
memset(resource, 0, sizeof(*resource));
|
2010-05-21 16:33:48 +02:00
|
|
|
resource->next = NULL;
|
|
|
|
tail = dev->resource_list;
|
|
|
|
if (tail) {
|
|
|
|
while (tail->next) tail = tail->next;
|
|
|
|
tail->next = resource;
|
2010-11-05 00:23:47 +01:00
|
|
|
} else {
|
2010-05-21 16:33:48 +02:00
|
|
|
dev->resource_list = resource;
|
2010-11-05 00:23:47 +01:00
|
|
|
}
|
2004-03-11 16:01:31 +01:00
|
|
|
}
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
/* Initialize the resource values. */
|
2004-03-11 16:01:31 +01:00
|
|
|
if (!(resource->flags & IORESOURCE_FIXED)) {
|
|
|
|
resource->flags = 0;
|
|
|
|
resource->base = 0;
|
|
|
|
}
|
|
|
|
resource->size = 0;
|
|
|
|
resource->limit = 0;
|
|
|
|
resource->index = index;
|
|
|
|
resource->align = 0;
|
|
|
|
resource->gran = 0;
|
|
|
|
|
|
|
|
return resource;
|
|
|
|
}
|
|
|
|
|
2004-10-14 23:25:53 +02:00
|
|
|
/**
|
|
|
|
* Return an existing resource structure for a given index.
|
2010-10-17 21:01:48 +02:00
|
|
|
*
|
|
|
|
* @param dev The device to find the resource on.
|
|
|
|
* @param index The index of the resource on the device.
|
|
|
|
* return TODO.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
|
|
|
struct resource *find_resource(device_t dev, unsigned index)
|
|
|
|
{
|
|
|
|
struct resource *resource;
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
/* See if there is a resource with the appropriate index. */
|
2004-10-14 23:25:53 +02:00
|
|
|
resource = probe_resource(dev, index);
|
|
|
|
if (!resource) {
|
2010-03-22 12:42:32 +01:00
|
|
|
printk(BIOS_EMERG, "%s missing resource: %02x\n",
|
2010-11-05 00:23:47 +01:00
|
|
|
dev_path(dev), index);
|
2004-10-14 23:25:53 +02:00
|
|
|
die("");
|
|
|
|
}
|
|
|
|
return resource;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Round a number up to the next multiple of gran.
|
|
|
|
*
|
|
|
|
* @param val The starting value.
|
|
|
|
* @param gran Granularity we are aligning the number to.
|
|
|
|
* @return The aligned value.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
|
|
|
static resource_t align_up(resource_t val, unsigned long gran)
|
|
|
|
{
|
|
|
|
resource_t mask;
|
|
|
|
mask = (1ULL << gran) - 1ULL;
|
|
|
|
val += mask;
|
|
|
|
val &= ~mask;
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Round a number up to the previous multiple of gran.
|
|
|
|
*
|
|
|
|
* @param val The starting value.
|
|
|
|
* @param gran Granularity we are aligning the number to.
|
|
|
|
* @return The aligned value.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
|
|
|
static resource_t align_down(resource_t val, unsigned long gran)
|
|
|
|
{
|
|
|
|
resource_t mask;
|
|
|
|
mask = (1ULL << gran) - 1ULL;
|
|
|
|
val &= ~mask;
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Compute the maximum address that is part of a resource.
|
|
|
|
*
|
|
|
|
* @param resource The resource whose limit is desired.
|
|
|
|
* @return The end.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
|
|
|
resource_t resource_end(struct resource *resource)
|
|
|
|
{
|
|
|
|
resource_t base, end;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
/* Get the base address. */
|
2004-10-14 23:25:53 +02:00
|
|
|
base = resource->base;
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
/*
|
|
|
|
* For a non bridge resource granularity and alignment are the same.
|
2004-10-14 23:25:53 +02:00
|
|
|
* For a bridge resource align is the largest needed alignment below
|
2010-11-05 00:23:47 +01:00
|
|
|
* the bridge. While the granularity is simply how many low bits of
|
|
|
|
* the address cannot be set.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
2010-04-27 08:56:47 +02:00
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
/* Get the end (rounded up). */
|
2004-10-14 23:25:53 +02:00
|
|
|
end = base + align_up(resource->size, resource->gran) - 1;
|
|
|
|
|
|
|
|
return end;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Compute the maximum legal value for resource->base.
|
|
|
|
*
|
|
|
|
* @param resource The resource whose maximum is desired.
|
|
|
|
* @return The maximum.
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
|
|
|
resource_t resource_max(struct resource *resource)
|
|
|
|
{
|
|
|
|
resource_t max;
|
|
|
|
|
|
|
|
max = align_down(resource->limit - resource->size + 1, resource->align);
|
|
|
|
|
|
|
|
return max;
|
|
|
|
}
|
|
|
|
|
2005-07-08 04:49:49 +02:00
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Return the resource type of a resource.
|
|
|
|
*
|
|
|
|
* @param resource The resource type to decode.
|
|
|
|
* @return TODO.
|
2005-07-08 04:49:49 +02:00
|
|
|
*/
|
|
|
|
const char *resource_type(struct resource *resource)
|
|
|
|
{
|
|
|
|
static char buffer[RESOURCE_TYPE_MAX];
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buffer, sizeof (buffer), "%s%s%s%s",
|
|
|
|
((resource->flags & IORESOURCE_READONLY) ? "ro" : ""),
|
|
|
|
((resource->flags & IORESOURCE_PREFETCH) ? "pref" : ""),
|
|
|
|
((resource->flags == 0) ? "unused" :
|
|
|
|
(resource->flags & IORESOURCE_IO) ? "io" :
|
|
|
|
(resource->flags & IORESOURCE_DRQ) ? "drq" :
|
|
|
|
(resource->flags & IORESOURCE_IRQ) ? "irq" :
|
|
|
|
(resource->flags & IORESOURCE_MEM) ? "mem" : "??????"),
|
|
|
|
((resource->flags & IORESOURCE_PCI64) ? "64" : ""));
|
2005-07-08 04:49:49 +02:00
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
|
2004-10-14 23:25:53 +02:00
|
|
|
/**
|
2010-10-17 21:01:48 +02:00
|
|
|
* Print the resource that was just stored.
|
|
|
|
*
|
2013-07-09 00:24:19 +02:00
|
|
|
* @param dev The device the stored resource lives on.
|
2010-10-17 21:01:48 +02:00
|
|
|
* @param resource The resource that was just stored.
|
|
|
|
* @param comment TODO
|
2004-10-14 23:25:53 +02:00
|
|
|
*/
|
2010-10-17 21:01:48 +02:00
|
|
|
void report_resource_stored(device_t dev, struct resource *resource,
|
|
|
|
const char *comment)
|
2004-10-14 23:25:53 +02:00
|
|
|
{
|
2010-11-05 00:23:47 +01:00
|
|
|
char buf[10];
|
|
|
|
unsigned long long base, end;
|
|
|
|
|
|
|
|
if (!(resource->flags & IORESOURCE_STORED))
|
|
|
|
return;
|
|
|
|
|
|
|
|
base = resource->base;
|
|
|
|
end = resource_end(resource);
|
|
|
|
buf[0] = '\0';
|
|
|
|
|
|
|
|
if (resource->flags & IORESOURCE_PCI_BRIDGE) {
|
2009-06-30 17:17:49 +02:00
|
|
|
#if CONFIG_PCI_BUS_SEGN_BITS
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buf, sizeof (buf),
|
|
|
|
"bus %04x:%02x ", dev->bus->secondary >> 8,
|
2010-11-05 00:23:47 +01:00
|
|
|
dev->link_list->secondary & 0xff);
|
2006-10-05 00:56:21 +02:00
|
|
|
#else
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buf, sizeof (buf),
|
|
|
|
"bus %02x ", dev->link_list->secondary);
|
2006-10-05 00:56:21 +02:00
|
|
|
#endif
|
2004-10-14 23:25:53 +02:00
|
|
|
}
|
2012-03-11 19:31:03 +01:00
|
|
|
printk(BIOS_DEBUG, "%s %02lx <- [0x%010llx - 0x%010llx] size 0x%08llx "
|
2010-11-05 00:23:47 +01:00
|
|
|
"gran 0x%02x %s%s%s\n", dev_path(dev), resource->index,
|
|
|
|
base, end, resource->size, resource->gran, buf,
|
|
|
|
resource_type(resource), comment);
|
2004-10-14 23:25:53 +02:00
|
|
|
}
|
2004-10-30 10:05:41 +02:00
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
void search_bus_resources(struct bus *bus, unsigned long type_mask,
|
|
|
|
unsigned long type, resource_search_t search,
|
|
|
|
void *gp)
|
2004-10-30 10:05:41 +02:00
|
|
|
{
|
|
|
|
struct device *curdev;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (curdev = bus->children; curdev; curdev = curdev->sibling) {
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *res;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
/* Ignore disabled devices. */
|
|
|
|
if (!curdev->enabled)
|
|
|
|
continue;
|
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (res = curdev->resource_list; res; res = res->next) {
|
2010-11-05 00:23:47 +01:00
|
|
|
/* If it isn't the right kind of resource ignore it. */
|
|
|
|
if ((res->flags & type_mask) != type)
|
2004-10-30 10:05:41 +02:00
|
|
|
continue;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
/* If it is a subtractive resource recurse. */
|
2010-05-21 16:33:48 +02:00
|
|
|
if (res->flags & IORESOURCE_SUBTRACTIVE) {
|
2004-10-30 10:05:41 +02:00
|
|
|
struct bus * subbus;
|
2010-11-05 00:23:47 +01:00
|
|
|
for (subbus = curdev->link_list; subbus;
|
|
|
|
subbus = subbus->next)
|
|
|
|
if (subbus->link_num
|
|
|
|
== IOINDEX_SUBTRACTIVE_LINK(res->index))
|
2010-06-10 00:41:35 +02:00
|
|
|
break;
|
2011-05-12 00:57:07 +02:00
|
|
|
if (!subbus) /* Why can subbus be NULL? */
|
|
|
|
break;
|
2010-11-05 00:23:47 +01:00
|
|
|
search_bus_resources(subbus, type_mask, type,
|
|
|
|
search, gp);
|
2004-10-30 10:05:41 +02:00
|
|
|
continue;
|
|
|
|
}
|
2010-05-21 16:33:48 +02:00
|
|
|
search(gp, curdev, res);
|
2004-10-30 10:05:41 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
void search_global_resources(unsigned long type_mask, unsigned long type,
|
|
|
|
resource_search_t search, void *gp)
|
2004-10-30 10:05:41 +02:00
|
|
|
{
|
|
|
|
struct device *curdev;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (curdev = all_devices; curdev; curdev = curdev->next) {
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *res;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
/* Ignore disabled devices. */
|
|
|
|
if (!curdev->enabled)
|
|
|
|
continue;
|
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (res = curdev->resource_list; res; res = res->next) {
|
2010-11-05 00:23:47 +01:00
|
|
|
/* If it isn't the right kind of resource ignore it. */
|
|
|
|
if ((res->flags & type_mask) != type)
|
2004-10-30 10:05:41 +02:00
|
|
|
continue;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
|
|
|
/* If it is a subtractive resource ignore it. */
|
|
|
|
if (res->flags & IORESOURCE_SUBTRACTIVE)
|
2004-10-30 10:05:41 +02:00
|
|
|
continue;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
search(gp, curdev, res);
|
2004-10-30 10:05:41 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-07-08 04:49:49 +02:00
|
|
|
|
|
|
|
void dev_set_enabled(device_t dev, int enable)
|
|
|
|
{
|
2010-11-05 00:23:47 +01:00
|
|
|
if (dev->enabled == enable)
|
2005-07-08 04:49:49 +02:00
|
|
|
return;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2005-07-08 04:49:49 +02:00
|
|
|
dev->enabled = enable;
|
|
|
|
if (dev->ops && dev->ops->enable) {
|
|
|
|
dev->ops->enable(dev);
|
2010-11-05 00:23:47 +01:00
|
|
|
} else if (dev->chip_ops && dev->chip_ops->enable_dev) {
|
2005-07-08 04:49:49 +02:00
|
|
|
dev->chip_ops->enable_dev(dev);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void disable_children(struct bus *bus)
|
|
|
|
{
|
|
|
|
device_t child;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (child = bus->children; child; child = child->sibling) {
|
|
|
|
struct bus *link;
|
2010-11-05 00:23:47 +01:00
|
|
|
for (link = child->link_list; link; link = link->next)
|
2010-06-10 00:41:35 +02:00
|
|
|
disable_children(link);
|
2005-07-08 04:49:49 +02:00
|
|
|
dev_set_enabled(child, 0);
|
|
|
|
}
|
|
|
|
}
|
2009-05-12 00:45:35 +02:00
|
|
|
|
2009-10-27 15:29:29 +01:00
|
|
|
static void resource_tree(struct device *root, int debug_level, int depth)
|
2009-05-12 00:45:35 +02:00
|
|
|
{
|
2010-06-10 00:41:35 +02:00
|
|
|
int i = 0;
|
2009-05-12 00:45:35 +02:00
|
|
|
struct device *child;
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus *link;
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *res;
|
2009-05-12 00:45:35 +02:00
|
|
|
char indent[30]; /* If your tree has more levels, it's wrong. */
|
|
|
|
|
|
|
|
for (i = 0; i < depth + 1 && i < 29; i++)
|
|
|
|
indent[i] = ' ';
|
|
|
|
indent[i] = '\0';
|
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
do_printk(BIOS_DEBUG, "%s%s", indent, dev_path(root));
|
|
|
|
if (root->link_list && root->link_list->children)
|
|
|
|
do_printk(BIOS_DEBUG, " child on link 0 %s",
|
|
|
|
dev_path(root->link_list->children));
|
|
|
|
do_printk(BIOS_DEBUG, "\n");
|
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
for (res = root->resource_list; res; res = res->next) {
|
2010-11-05 00:23:47 +01:00
|
|
|
do_printk(debug_level, "%s%s resource base %llx size %llx "
|
|
|
|
"align %d gran %d limit %llx flags %lx index %lx\n",
|
|
|
|
indent, dev_path(root), res->base, res->size,
|
|
|
|
res->align, res->gran, res->limit, res->flags,
|
|
|
|
res->index);
|
2009-05-12 00:45:35 +02:00
|
|
|
}
|
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (link = root->link_list; link; link = link->next) {
|
|
|
|
for (child = link->children; child; child = child->sibling)
|
2009-05-12 00:45:35 +02:00
|
|
|
resource_tree(child, debug_level, depth + 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
void print_resource_tree(struct device *root, int debug_level, const char *msg)
|
2009-05-12 00:45:35 +02:00
|
|
|
{
|
|
|
|
/* Bail if root is null. */
|
|
|
|
if (!root) {
|
|
|
|
do_printk(debug_level, "%s passed NULL for root!\n", __func__);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Bail if not printing to screen. */
|
|
|
|
if (!do_printk(debug_level, "Show resources in subtree (%s)...%s\n",
|
2010-11-05 00:23:47 +01:00
|
|
|
dev_path(root), msg))
|
2009-05-12 00:45:35 +02:00
|
|
|
return;
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2009-05-12 00:45:35 +02:00
|
|
|
resource_tree(root, debug_level, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void show_devs_tree(struct device *dev, int debug_level, int depth, int linknum)
|
|
|
|
{
|
|
|
|
char depth_str[20] = "";
|
|
|
|
int i;
|
|
|
|
struct device *sibling;
|
2010-06-10 00:41:35 +02:00
|
|
|
struct bus *link;
|
|
|
|
|
2009-05-12 00:45:35 +02:00
|
|
|
for (i = 0; i < depth; i++)
|
|
|
|
depth_str[i] = ' ';
|
|
|
|
depth_str[i] = '\0';
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-05-21 16:33:48 +02:00
|
|
|
do_printk(debug_level, "%s%s: enabled %d\n",
|
|
|
|
depth_str, dev_path(dev), dev->enabled);
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2010-06-10 00:41:35 +02:00
|
|
|
for (link = dev->link_list; link; link = link->next) {
|
|
|
|
for (sibling = link->children; sibling;
|
2009-05-12 00:45:35 +02:00
|
|
|
sibling = sibling->sibling)
|
|
|
|
show_devs_tree(sibling, debug_level, depth + 1, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void show_all_devs_tree(int debug_level, const char *msg)
|
|
|
|
{
|
|
|
|
/* Bail if not printing to screen. */
|
|
|
|
if (!do_printk(debug_level, "Show all devs in tree form...%s\n", msg))
|
|
|
|
return;
|
|
|
|
show_devs_tree(all_devices, debug_level, 0, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void show_devs_subtree(struct device *root, int debug_level, const char *msg)
|
|
|
|
{
|
|
|
|
/* Bail if not printing to screen. */
|
|
|
|
if (!do_printk(debug_level, "Show all devs in subtree %s...%s\n",
|
2010-11-05 00:23:47 +01:00
|
|
|
dev_path(root), msg))
|
2009-05-12 00:45:35 +02:00
|
|
|
return;
|
|
|
|
do_printk(debug_level, "%s\n", msg);
|
|
|
|
show_devs_tree(root, debug_level, 0, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void show_all_devs(int debug_level, const char *msg)
|
|
|
|
{
|
|
|
|
struct device *dev;
|
|
|
|
|
|
|
|
/* Bail if not printing to screen. */
|
|
|
|
if (!do_printk(debug_level, "Show all devs...%s\n", msg))
|
|
|
|
return;
|
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
2010-05-21 16:33:48 +02:00
|
|
|
do_printk(debug_level, "%s: enabled %d\n",
|
|
|
|
dev_path(dev), dev->enabled);
|
2009-05-12 00:45:35 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void show_one_resource(int debug_level, struct device *dev,
|
|
|
|
struct resource *resource, const char *comment)
|
|
|
|
{
|
|
|
|
char buf[10];
|
|
|
|
unsigned long long base, end;
|
|
|
|
base = resource->base;
|
|
|
|
end = resource_end(resource);
|
|
|
|
buf[0] = '\0';
|
2010-11-05 00:23:47 +01:00
|
|
|
|
2009-05-12 00:45:35 +02:00
|
|
|
/*
|
|
|
|
if (resource->flags & IORESOURCE_BRIDGE) {
|
2009-06-30 17:17:49 +02:00
|
|
|
#if CONFIG_PCI_BUS_SEGN_BITS
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buf, sizeof (buf), "bus %04x:%02x ",
|
|
|
|
dev->bus->secondary >> 8,
|
|
|
|
dev->link[0].secondary & 0xff);
|
2009-05-12 00:45:35 +02:00
|
|
|
#else
|
2013-11-26 02:41:26 +01:00
|
|
|
snprintf(buf, sizeof (buf),
|
|
|
|
"bus %02x ", dev->link[0].secondary);
|
2009-05-12 00:45:35 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
do_printk(debug_level, "%s %02lx <- [0x%010llx - 0x%010llx] "
|
2012-03-11 19:31:03 +01:00
|
|
|
"size 0x%08llx gran 0x%02x %s%s%s\n", dev_path(dev),
|
2010-11-05 00:23:47 +01:00
|
|
|
resource->index, base, end, resource->size, resource->gran,
|
|
|
|
buf, resource_type(resource), comment);
|
2009-05-12 00:45:35 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void show_all_devs_resources(int debug_level, const char* msg)
|
|
|
|
{
|
|
|
|
struct device *dev;
|
|
|
|
|
2010-11-05 00:23:47 +01:00
|
|
|
if (!do_printk(debug_level, "Show all devs with resources...%s\n", msg))
|
2009-05-12 00:45:35 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
for (dev = all_devices; dev; dev = dev->next) {
|
2010-05-21 16:33:48 +02:00
|
|
|
struct resource *res;
|
|
|
|
do_printk(debug_level, "%s: enabled %d\n",
|
|
|
|
dev_path(dev), dev->enabled);
|
|
|
|
for (res = dev->resource_list; res; res = res->next)
|
|
|
|
show_one_resource(debug_level, dev, res, "");
|
2009-05-12 00:45:35 +02:00
|
|
|
}
|
|
|
|
}
|
2010-10-11 21:36:13 +02:00
|
|
|
|
2012-07-27 07:37:12 +02:00
|
|
|
void fixed_mem_resource(device_t dev, unsigned long index,
|
|
|
|
unsigned long basek, unsigned long sizek, unsigned long type)
|
2010-10-11 21:36:13 +02:00
|
|
|
{
|
|
|
|
struct resource *resource;
|
|
|
|
|
|
|
|
if (!sizek)
|
|
|
|
return;
|
|
|
|
|
|
|
|
resource = new_resource(dev, index);
|
|
|
|
resource->base = ((resource_t)basek) << 10;
|
|
|
|
resource->size = ((resource_t)sizek) << 10;
|
2012-07-27 07:37:12 +02:00
|
|
|
resource->flags = IORESOURCE_MEM | IORESOURCE_FIXED |
|
|
|
|
IORESOURCE_STORED | IORESOURCE_ASSIGNED;
|
2012-07-10 12:27:26 +02:00
|
|
|
|
2012-07-27 07:37:12 +02:00
|
|
|
resource->flags |= type;
|
2012-07-10 12:27:26 +02:00
|
|
|
}
|
|
|
|
|
2010-10-11 21:36:13 +02:00
|
|
|
void tolm_test(void *gp, struct device *dev, struct resource *new)
|
|
|
|
{
|
|
|
|
struct resource **best_p = gp;
|
|
|
|
struct resource *best;
|
|
|
|
|
|
|
|
best = *best_p;
|
|
|
|
|
|
|
|
if (!best || (best->base > new->base))
|
|
|
|
best = new;
|
|
|
|
|
|
|
|
*best_p = best;
|
|
|
|
}
|
|
|
|
|
|
|
|
u32 find_pci_tolm(struct bus *bus)
|
|
|
|
{
|
|
|
|
struct resource *min = NULL;
|
|
|
|
u32 tolm;
|
|
|
|
|
|
|
|
search_bus_resources(bus, IORESOURCE_MEM, IORESOURCE_MEM,
|
|
|
|
tolm_test, &min);
|
|
|
|
|
|
|
|
tolm = 0xffffffffUL;
|
|
|
|
|
|
|
|
if (min && tolm > min->base)
|
|
|
|
tolm = min->base;
|
|
|
|
|
|
|
|
return tolm;
|
|
|
|
}
|
2012-03-30 22:52:58 +02:00
|
|
|
|
|
|
|
/* Count of enabled CPUs */
|
|
|
|
int dev_count_cpu(void)
|
|
|
|
{
|
|
|
|
device_t cpu;
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
for (cpu = all_devices; cpu; cpu = cpu->next) {
|
|
|
|
if ((cpu->path.type != DEVICE_PATH_APIC) ||
|
2013-02-13 00:20:54 +01:00
|
|
|
(cpu->bus->dev->path.type != DEVICE_PATH_CPU_CLUSTER))
|
2012-03-30 22:52:58 +02:00
|
|
|
continue;
|
|
|
|
if (!cpu->enabled)
|
|
|
|
continue;
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|