1 /* 2 * pci_dn.c 3 * 4 * Copyright (C) 2001 Todd Inglett, IBM Corporation 5 * 6 * PCI manipulation via device_nodes. 7 * 8 * This program is free software; you can redistribute it and/or modify 9 * it under the terms of the GNU General Public License as published by 10 * the Free Software Foundation; either version 2 of the License, or 11 * (at your option) any later version. 12 * 13 * This program is distributed in the hope that it will be useful, 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * GNU General Public License for more details. 17 * 18 * You should have received a copy of the GNU General Public License 19 * along with this program; if not, write to the Free Software 20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 21 */ 22 #include <linux/kernel.h> 23 #include <linux/pci.h> 24 #include <linux/string.h> 25 #include <linux/export.h> 26 #include <linux/init.h> 27 #include <linux/gfp.h> 28 29 #include <asm/io.h> 30 #include <asm/prom.h> 31 #include <asm/pci-bridge.h> 32 #include <asm/ppc-pci.h> 33 #include <asm/firmware.h> 34 35 /* 36 * Traverse_func that inits the PCI fields of the device node. 37 * NOTE: this *must* be done before read/write config to the device. 38 */ 39 void * __devinit update_dn_pci_info(struct device_node *dn, void *data) 40 { 41 struct pci_controller *phb = data; 42 const int *type = 43 of_get_property(dn, "ibm,pci-config-space-type", NULL); 44 const u32 *regs; 45 struct pci_dn *pdn; 46 47 pdn = zalloc_maybe_bootmem(sizeof(*pdn), GFP_KERNEL); 48 if (pdn == NULL) 49 return NULL; 50 dn->data = pdn; 51 pdn->node = dn; 52 pdn->phb = phb; 53 regs = of_get_property(dn, "reg", NULL); 54 if (regs) { 55 /* First register entry is addr (00BBSS00) */ 56 pdn->busno = (regs[0] >> 16) & 0xff; 57 pdn->devfn = (regs[0] >> 8) & 0xff; 58 } 59 60 pdn->pci_ext_config_space = (type && *type == 1); 61 return NULL; 62 } 63 64 /* 65 * Traverse a device tree stopping each PCI device in the tree. 66 * This is done depth first. As each node is processed, a "pre" 67 * function is called and the children are processed recursively. 68 * 69 * The "pre" func returns a value. If non-zero is returned from 70 * the "pre" func, the traversal stops and this value is returned. 71 * This return value is useful when using traverse as a method of 72 * finding a device. 73 * 74 * NOTE: we do not run the func for devices that do not appear to 75 * be PCI except for the start node which we assume (this is good 76 * because the start node is often a phb which may be missing PCI 77 * properties). 78 * We use the class-code as an indicator. If we run into 79 * one of these nodes we also assume its siblings are non-pci for 80 * performance. 81 */ 82 void *traverse_pci_devices(struct device_node *start, traverse_func pre, 83 void *data) 84 { 85 struct device_node *dn, *nextdn; 86 void *ret; 87 88 /* We started with a phb, iterate all childs */ 89 for (dn = start->child; dn; dn = nextdn) { 90 const u32 *classp; 91 u32 class; 92 93 nextdn = NULL; 94 classp = of_get_property(dn, "class-code", NULL); 95 class = classp ? *classp : 0; 96 97 if (pre && ((ret = pre(dn, data)) != NULL)) 98 return ret; 99 100 /* If we are a PCI bridge, go down */ 101 if (dn->child && ((class >> 8) == PCI_CLASS_BRIDGE_PCI || 102 (class >> 8) == PCI_CLASS_BRIDGE_CARDBUS)) 103 /* Depth first...do children */ 104 nextdn = dn->child; 105 else if (dn->sibling) 106 /* ok, try next sibling instead. */ 107 nextdn = dn->sibling; 108 if (!nextdn) { 109 /* Walk up to next valid sibling. */ 110 do { 111 dn = dn->parent; 112 if (dn == start) 113 return NULL; 114 } while (dn->sibling == NULL); 115 nextdn = dn->sibling; 116 } 117 } 118 return NULL; 119 } 120 121 /** 122 * pci_devs_phb_init_dynamic - setup pci devices under this PHB 123 * phb: pci-to-host bridge (top-level bridge connecting to cpu) 124 * 125 * This routine is called both during boot, (before the memory 126 * subsystem is set up, before kmalloc is valid) and during the 127 * dynamic lpar operation of adding a PHB to a running system. 128 */ 129 void __devinit pci_devs_phb_init_dynamic(struct pci_controller *phb) 130 { 131 struct device_node *dn = phb->dn; 132 struct pci_dn *pdn; 133 134 /* PHB nodes themselves must not match */ 135 update_dn_pci_info(dn, phb); 136 pdn = dn->data; 137 if (pdn) { 138 pdn->devfn = pdn->busno = -1; 139 pdn->phb = phb; 140 } 141 142 /* Update dn->phb ptrs for new phb and children devices */ 143 traverse_pci_devices(dn, update_dn_pci_info, phb); 144 } 145 146 /** 147 * pci_devs_phb_init - Initialize phbs and pci devs under them. 148 * 149 * This routine walks over all phb's (pci-host bridges) on the 150 * system, and sets up assorted pci-related structures 151 * (including pci info in the device node structs) for each 152 * pci device found underneath. This routine runs once, 153 * early in the boot sequence. 154 */ 155 void __init pci_devs_phb_init(void) 156 { 157 struct pci_controller *phb, *tmp; 158 159 /* This must be done first so the device nodes have valid pci info! */ 160 list_for_each_entry_safe(phb, tmp, &hose_list, list_node) 161 pci_devs_phb_init_dynamic(phb); 162 } 163