/*
* The PCI Utilities -- Show Bus Tree
*
- * Copyright (c) 1997--2020 Martin Mares <mj@ucw.cz>
+ * Copyright (c) 1997--2021 Martin Mares <mj@ucw.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#include "lspci.h"
-struct bridge host_bridge = { NULL, NULL, NULL, NULL, 0, ~0, 0, ~0, NULL };
+struct bridge host_bridge = { NULL, NULL, NULL, NULL, NULL, 0, ~0, 0, ~0, NULL };
static struct bus *
find_bus(struct bridge *b, unsigned int domain, unsigned int n)
return bus;
}
+static struct device *
+find_device(struct pci_dev *dd)
+{
+ struct device *d;
+
+ if (!dd)
+ return NULL;
+ for (d=first_dev; d; d=d->next)
+ if (d->dev == dd)
+ break;
+ return d;
+}
+
static struct bus *
new_bus(struct bridge *b, unsigned int domain, unsigned int n)
{
struct bus *bus = xmalloc(sizeof(struct bus));
bus->domain = domain;
bus->number = n;
- bus->sibling = b->first_bus;
+ bus->sibling = NULL;
bus->first_dev = NULL;
bus->last_dev = &bus->first_dev;
bus->parent_bridge = b;
- b->first_bus = bus;
+ if (b->last_bus)
+ b->last_bus->sibling = bus;
+ b->last_bus = bus;
+ if (!b->first_bus)
+ b->first_bus = bus;
return bus;
}
insert_dev(struct device *d, struct bridge *b)
{
struct pci_dev *p = d->dev;
- struct bus *bus;
+ struct device *parent = NULL;
+ struct bus *bus = NULL;
+
+ if (p->known_fields & PCI_FILL_PARENT)
+ parent = find_device(p->parent);
+
+ if (parent && parent->bridge)
+ {
+ bus = parent->bridge->first_bus;
+ if (!bus)
+ bus = new_bus(parent->bridge, p->domain, p->bus);
+ }
- if (! (bus = find_bus(b, p->domain, p->bus)))
+ if (!bus && ! (bus = find_bus(b, p->domain, p->bus)))
{
struct bridge *c;
for (c=b->child; c; c=c->next)
{
struct pci_dev *dd = d->dev;
word class = dd->device_class;
- byte ht = get_conf_byte(d, PCI_HEADER_TYPE) & 0x7f;
+ byte ht = d->no_config_access ? -1 : (get_conf_byte(d, PCI_HEADER_TYPE) & 0x7f);
if ((class >> 8) == PCI_BASE_CLASS_BRIDGE &&
(ht == PCI_HEADER_TYPE_BRIDGE || ht == PCI_HEADER_TYPE_CARDBUS))
{
last_br = &b->chain;
b->next = b->child = NULL;
b->first_bus = NULL;
+ b->last_bus = NULL;
b->br_dev = d;
d->bridge = b;
pacc->debug("Tree: bridge %04x:%02x:%02x.%d: %02x -> %02x-%02x\n",
b->primary, b->secondary, b->subordinate);
}
}
+
+ /* Append additional bridges reported by libpci via d->parent */
+
+ for (d=first_dev; d; d=d->next)
+ {
+ struct device *parent = NULL;
+ if (d->dev->known_fields & PCI_FILL_PARENT)
+ parent = find_device(d->dev->parent);
+ if (!parent || parent->bridge)
+ continue;
+ b = xmalloc(sizeof(struct bridge));
+ b->domain = parent->dev->domain;
+ b->primary = parent->dev->bus;
+ b->secondary = d->dev->bus;
+ /* At this stage subordinate number is unknown, so set it to secondary bus number. */
+ b->subordinate = b->secondary;
+ *last_br = b;
+ last_br = &b->chain;
+ b->next = b->child = NULL;
+ b->first_bus = NULL;
+ b->last_bus = NULL;
+ b->br_dev = parent;
+ parent->bridge = b;
+ pacc->debug("Tree: bridge %04x:%02x:%02x.%d\n", b->domain,
+ parent->dev->bus, parent->dev->dev, parent->dev->func);
+ }
*last_br = NULL;
/* Create a bridge tree */
for (b=&host_bridge; b; b=b->chain)
{
- struct bridge *c, *best;
- best = NULL;
+ struct device *br_dev = b->br_dev;
+ struct bridge *c, *best = NULL;
+ struct device *parent = NULL;
+
+ if (br_dev && (br_dev->dev->known_fields & PCI_FILL_PARENT))
+ parent = find_device(br_dev->dev->parent);
+ if (parent)
+ best = parent->bridge;
+ if (!best)
for (c=&host_bridge; c; c=c->chain)
if (c != b && (c == &host_bridge || b->domain == c->domain) &&
b->primary >= c->secondary && b->primary <= c->subordinate &&
insert_dev(d, &host_bridge);
}
+#define LINE_BUF_SIZE 1024
+
static void
print_it(char *line, char *p)
{
- *p++ = '\n';
*p = 0;
fputs(line, stdout);
+ if (p >= line + LINE_BUF_SIZE - 1)
+ fputs("...", stdout);
+ putchar('\n');
for (p=line; *p; p++)
if (*p == '+' || *p == '|')
*p = '|';
static void show_tree_bridge(struct bridge *, char *, char *);
-#define LINE_BUF_SIZE 1024
-
static char * FORMAT_CHECK(printf, 3, 4)
tree_printf(char *line, char *p, char *fmt, ...)
{
va_list args;
- char *end = line + LINE_BUF_SIZE - 2;
+ int space = line + LINE_BUF_SIZE - 1 - p;
- if (p >= end)
+ if (space <= 0)
return p;
va_start(args, fmt);
- int res = vsnprintf(p, end - p, fmt, args);
+ int res = vsnprintf(p, space, fmt, args);
if (res < 0)
{
- /* Ancient C libraries return -1 on overflow */
- p += strlen(p);
+ /* Ancient C libraries return -1 on overflow and they do not truncate the output properly. */
+ *p = 0;
+ p += space;
+ }
+ else if (res >= space)
+ {
+ /* Ancient C libraries do not truncate the output properly. */
+ *(p+space-1) = 0;
+ p += space;
}
else
p += res;
for (b=&host_bridge; b; b=b->chain)
if (b->br_dev == d)
{
- if (b->secondary == b->subordinate)
+ if (b->secondary == 0)
+ p = tree_printf(line, p, "-");
+ else if (b->secondary == b->subordinate)
p = tree_printf(line, p, "-[%02x]-", b->secondary);
else
p = tree_printf(line, p, "-[%02x-%02x]-", b->secondary, b->subordinate);