Lines Matching refs:bus

19 static struct bus *
22 struct bus *bus; in find_bus() local
24 for (bus=b->first_bus; bus; bus=bus->sibling) in find_bus()
25 if (bus->domain == domain && bus->number == n) in find_bus()
27 return bus; in find_bus()
43 static struct bus *
46 struct bus *bus = xmalloc(sizeof(struct bus)); in new_bus() local
47 bus->domain = domain; in new_bus()
48 bus->number = n; in new_bus()
49 bus->sibling = NULL; in new_bus()
50 bus->first_dev = NULL; in new_bus()
51 bus->last_dev = &bus->first_dev; in new_bus()
52 bus->parent_bridge = b; in new_bus()
54 b->last_bus->sibling = bus; in new_bus()
55 b->last_bus = bus; in new_bus()
57 b->first_bus = bus; in new_bus()
58 return bus; in new_bus()
66 struct bus *bus = NULL; in insert_dev() local
73 bus = parent->bridge->first_bus; in insert_dev()
74 if (!bus) in insert_dev()
75 bus = new_bus(parent->bridge, p->domain, p->bus); in insert_dev()
78 if (!bus && b == &host_bridge) in insert_dev()
87 if (!bus && ! (bus = find_bus(b, p->domain, p->bus))) in insert_dev()
91 if (c->domain == (unsigned)p->domain && c->secondary <= p->bus && p->bus <= c->subordinate) in insert_dev()
96 bus = new_bus(b, p->domain, p->bus); in insert_dev()
102 *bus->last_dev = d; in insert_dev()
103 bus->last_dev = &d->bus_next; in insert_dev()
105 d->parent_bus = bus; in insert_dev()
152 b->primary = dd->bus; in grow_tree()
171 dd->domain, dd->bus, dd->dev, dd->func, in grow_tree()
187 b->primary = parent->dev->bus; in grow_tree()
188 b->secondary = d->dev->bus; in grow_tree()
199 parent->dev->bus, parent->dev->dev, parent->dev->func); in grow_tree()
330 check_bus_filter(struct pci_filter *filter, struct bus *b);
336 struct bus *b; in check_dev_filter()
357 check_bus_filter(struct pci_filter *filter, struct bus *b) in check_bus_filter()
372 show_tree_bus(struct pci_filter *filter, struct bus *b, char *line, char *p) in show_tree_bus()
431 struct bus *u = b->first_bus; in show_tree_bridge()