2 * The PCI Utilities -- Show Bus Tree
4 * Copyright (c) 1997--2021 Martin Mares <mj@ucw.cz>
6 * Can be freely distributed and used under the terms of the GNU GPL.
15 struct bridge host_bridge = { NULL, NULL, NULL, NULL, NULL, NULL, ~0, ~0, ~0, ~0, NULL };
18 find_bus(struct bridge *b, unsigned int domain, unsigned int n)
22 for (bus=b->first_bus; bus; bus=bus->sibling)
23 if (bus->domain == domain && bus->number == n)
28 static struct device *
29 find_device(struct pci_dev *dd)
35 for (d=first_dev; d; d=d->next)
42 new_bus(struct bridge *b, unsigned int domain, unsigned int n)
44 struct bus *bus = xmalloc(sizeof(struct bus));
48 bus->first_dev = NULL;
49 bus->last_dev = &bus->first_dev;
50 bus->parent_bridge = b;
52 b->last_bus->sibling = bus;
60 insert_dev(struct device *d, struct bridge *b)
62 struct pci_dev *p = d->dev;
63 struct device *parent = NULL;
64 struct bus *bus = NULL;
66 if (p->known_fields & PCI_FILL_PARENT)
67 parent = find_device(p->parent);
69 if (parent && parent->bridge)
71 bus = parent->bridge->first_bus;
73 bus = new_bus(parent->bridge, p->domain, p->bus);
76 if (!bus && b == &host_bridge)
78 for (b=b->child; b; b=b->prev)
79 if (b->domain == (unsigned)p->domain)
85 if (!bus && ! (bus = find_bus(b, p->domain, p->bus)))
88 for (c=b->child; c; c=c->prev)
89 if (c->domain == (unsigned)p->domain && c->secondary <= p->bus && p->bus <= c->subordinate)
94 bus = new_bus(b, p->domain, p->bus);
96 /* Simple insertion at the end _does_ guarantee the correct order as the
97 * original device list was sorted by (domain, bus, devfn) lexicographically
98 * and all devices on the new list have the same bus number.
101 bus->last_dev = &d->bus_next;
110 struct bridge **last_br, *b;
112 last_br = &host_bridge.chain;
114 /* Build list of top level domain bridges */
116 for (d=first_dev; d; d=d->next)
118 for (b=host_bridge.chain; b; b=b->chain)
119 if (b->domain == (unsigned)d->dev->domain)
123 b = xmalloc(sizeof(struct bridge));
124 b->domain = d->dev->domain;
130 b->prev = b->next = b->child = NULL;
135 pacc->debug("Tree: domain %04x\n", b->domain);
138 /* Build list of bridges */
140 for (d=first_dev; d; d=d->next)
142 struct pci_dev *dd = d->dev;
143 word class = dd->device_class;
144 byte ht = d->no_config_access ? -1 : (get_conf_byte(d, PCI_HEADER_TYPE) & 0x7f);
145 if ((class >> 8) == PCI_BASE_CLASS_BRIDGE &&
146 (ht == PCI_HEADER_TYPE_BRIDGE || ht == PCI_HEADER_TYPE_CARDBUS))
148 b = xmalloc(sizeof(struct bridge));
149 b->domain = dd->domain;
150 b->primary = dd->bus;
151 if (ht == PCI_HEADER_TYPE_BRIDGE)
153 b->secondary = get_conf_byte(d, PCI_SECONDARY_BUS);
154 b->subordinate = get_conf_byte(d, PCI_SUBORDINATE_BUS);
158 b->secondary = get_conf_byte(d, PCI_CB_CARD_BUS);
159 b->subordinate = get_conf_byte(d, PCI_CB_SUBORDINATE_BUS);
163 b->prev = b->next = b->child = NULL;
168 pacc->debug("Tree: bridge %04x:%02x:%02x.%d: %02x -> %02x-%02x\n",
169 dd->domain, dd->bus, dd->dev, dd->func,
170 b->primary, b->secondary, b->subordinate);
174 /* Append additional bridges reported by libpci via d->parent */
176 for (d=first_dev; d; d=d->next)
178 struct device *parent = NULL;
179 if (d->dev->known_fields & PCI_FILL_PARENT)
180 parent = find_device(d->dev->parent);
181 if (!parent || parent->bridge)
183 b = xmalloc(sizeof(struct bridge));
184 b->domain = parent->dev->domain;
185 b->primary = parent->dev->bus;
186 b->secondary = d->dev->bus;
187 /* At this stage subordinate number is unknown, so set it to secondary bus number. */
188 b->subordinate = b->secondary;
191 b->prev = b->next = b->child = NULL;
196 pacc->debug("Tree: bridge %04x:%02x:%02x.%d\n", b->domain,
197 parent->dev->bus, parent->dev->dev, parent->dev->func);
201 /* Create a bridge tree */
203 for (b=host_bridge.chain; b; b=b->chain)
205 struct device *br_dev = b->br_dev;
206 struct bridge *c, *best = NULL;
207 struct device *parent = NULL;
209 if (br_dev && (br_dev->dev->known_fields & PCI_FILL_PARENT))
210 parent = find_device(br_dev->dev->parent);
212 best = parent->bridge;
214 for (c=&host_bridge; c; c=c->chain)
215 if (c != b && (c == &host_bridge || b->domain == c->domain) &&
216 b->primary >= c->secondary && b->primary <= c->subordinate &&
217 (!best || best == &host_bridge || best->subordinate - best->primary > c->subordinate - c->primary))
221 b->prev = best->child;
226 /* Insert secondary bus for each bridge */
228 for (b=host_bridge.chain; b; b=b->chain)
229 if (b->br_dev && !find_bus(b, b->domain, b->secondary))
230 new_bus(b, b->domain, b->secondary);
232 /* Create bus structs and link devices */
234 for (d=first_dev; d; d=d->next)
235 insert_dev(d, &host_bridge);
238 #define LINE_BUF_SIZE 1024
241 print_it(char *line, char *p)
245 if (p >= line + LINE_BUF_SIZE - 1)
246 fputs("...", stdout);
248 for (p=line; *p; p++)
249 if (*p == '+' || *p == '|')
255 static void show_tree_bridge(struct pci_filter *filter, struct bridge *, char *, char *);
257 static char * FORMAT_CHECK(printf, 3, 4)
258 tree_printf(char *line, char *p, char *fmt, ...)
261 int space = line + LINE_BUF_SIZE - 1 - p;
267 int res = vsnprintf(p, space, fmt, args);
270 /* Ancient C libraries return -1 on overflow and they do not truncate the output properly. */
274 else if (res >= space)
276 /* Ancient C libraries do not truncate the output properly. */
288 show_tree_dev(struct pci_filter *filter, struct device *d, char *line, char *p)
290 struct pci_dev *q = d->dev;
294 p = tree_printf(line, p, "%02x.%x", q->dev, q->func);
295 for (b=host_bridge.chain; b; b=b->chain)
298 if (b->secondary == 0)
299 p = tree_printf(line, p, "-");
300 else if (b->secondary == b->subordinate)
301 p = tree_printf(line, p, "-[%02x]-", b->secondary);
303 p = tree_printf(line, p, "-[%02x-%02x]-", b->secondary, b->subordinate);
304 show_tree_bridge(filter, b, line, p);
308 p = tree_printf(line, p, " %s",
309 pci_lookup_name(pacc, namebuf, sizeof(namebuf),
310 PCI_LOOKUP_VENDOR | PCI_LOOKUP_DEVICE,
311 q->vendor_id, q->device_id));
315 static struct pci_filter *
316 get_filter_for_child(struct pci_filter *filter, struct device *d)
321 if (pci_filter_match(filter, d->dev))
328 check_bus_filter(struct pci_filter *filter, struct bus *b);
331 check_dev_filter(struct pci_filter *filter, struct device *d)
339 if (pci_filter_match(filter, d->dev))
342 for (br = host_bridge.chain; br; br = br->chain)
345 for (b = br->first_bus; b; b = b->sibling)
346 if (check_bus_filter(filter, b))
355 check_bus_filter(struct pci_filter *filter, struct bus *b)
362 for (d = b->first_dev; d; d = d->bus_next)
363 if (check_dev_filter(filter, d))
370 show_tree_bus(struct pci_filter *filter, struct bus *b, char *line, char *p)
374 else if (!b->first_dev->bus_next)
376 if (check_dev_filter(filter, b->first_dev))
378 p = tree_printf(line, p, "--");
379 show_tree_dev(get_filter_for_child(filter, b->first_dev), b->first_dev, line, p);
387 struct device *d = b->first_dev;
391 if (check_dev_filter(filter, d))
397 for (i = 0, d = b->first_dev; d; d = d->bus_next)
399 if (!check_dev_filter(filter, d))
401 char *p2 = tree_printf(line, p, count == 1 ? "--" : count == i+1 ? "\\-" : "+-");
402 show_tree_dev(get_filter_for_child(filter, d), d, line, p2);
412 show_tree_bridge(struct pci_filter *filter, struct bridge *b, char *line, char *p)
415 if (!b->first_bus->sibling)
417 if (check_bus_filter(filter, b->first_bus))
420 p = tree_printf(line, p, "[%04x:%02x]-", b->first_bus->domain, b->first_bus->number);
421 show_tree_bus(filter, b->first_bus, line, p);
429 struct bus *u = b->first_bus;
434 if (check_bus_filter(filter, u))
440 for (i = 0, u = b->first_bus; u; u = u->sibling)
442 if (!check_bus_filter(filter, u))
444 k = tree_printf(line, p, count == 1 ? "[%04x:%02x]-" : count == i+1 ? "\\-[%04x:%02x]-" : "+-[%04x:%02x]-", u->domain, u->number);
445 show_tree_bus(filter, u, line, k);
455 show_forest(struct pci_filter *filter)
457 char line[LINE_BUF_SIZE];
459 if (host_bridge.child)
461 for (b=host_bridge.child; b->prev; b=b->prev)
464 show_tree_bridge(filter, b, line, line);