powerpc/PCI: Use list_for_each_entry() for bus traversal
Replace list_for_each() + pci_bus_b() with list_for_each_entry(). Signed-off-by: Yijing Wang <wangyijing@huawei.com> Signed-off-by: Bjorn Helgaas <bhelgaas@google.com>
This commit is contained in:
		
					parent
					
						
							
								59c1ad3b82
							
						
					
				
			
			
				commit
				
					
						3bc955987f
					
				
			
		
					 2 changed files with 4 additions and 6 deletions
				
			
		| 
						 | 
				
			
			@ -208,7 +208,6 @@ long sys_pciconfig_iobase(long which, unsigned long in_bus,
 | 
			
		|||
			  unsigned long in_devfn)
 | 
			
		||||
{
 | 
			
		||||
	struct pci_controller* hose;
 | 
			
		||||
	struct list_head *ln;
 | 
			
		||||
	struct pci_bus *bus = NULL;
 | 
			
		||||
	struct device_node *hose_node;
 | 
			
		||||
 | 
			
		||||
| 
						 | 
				
			
			@ -230,8 +229,7 @@ long sys_pciconfig_iobase(long which, unsigned long in_bus,
 | 
			
		|||
	 * used on pre-domains setup. We return the first match
 | 
			
		||||
	 */
 | 
			
		||||
 | 
			
		||||
	for (ln = pci_root_buses.next; ln != &pci_root_buses; ln = ln->next) {
 | 
			
		||||
		bus = pci_bus_b(ln);
 | 
			
		||||
	list_for_each_entry(bus, &pci_root_buses, node) {
 | 
			
		||||
		if (in_bus >= bus->number && in_bus <= bus->busn_res.end)
 | 
			
		||||
			break;
 | 
			
		||||
		bus = NULL;
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
| 
						 | 
				
			
			@ -37,15 +37,15 @@ find_bus_among_children(struct pci_bus *bus,
 | 
			
		|||
                        struct device_node *dn)
 | 
			
		||||
{
 | 
			
		||||
	struct pci_bus *child = NULL;
 | 
			
		||||
	struct list_head *tmp;
 | 
			
		||||
	struct pci_bus *tmp;
 | 
			
		||||
	struct device_node *busdn;
 | 
			
		||||
 | 
			
		||||
	busdn = pci_bus_to_OF_node(bus);
 | 
			
		||||
	if (busdn == dn)
 | 
			
		||||
		return bus;
 | 
			
		||||
 | 
			
		||||
	list_for_each(tmp, &bus->children) {
 | 
			
		||||
		child = find_bus_among_children(pci_bus_b(tmp), dn);
 | 
			
		||||
	list_for_each_entry(tmp, &bus->children, node) {
 | 
			
		||||
		child = find_bus_among_children(tmp, dn);
 | 
			
		||||
		if (child)
 | 
			
		||||
			break;
 | 
			
		||||
	};
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue