xref: /linux/drivers/pci/setup-res.c (revision f3d9478b2ce468c3115b02ecae7e975990697f15)
1 /*
2  *	drivers/pci/setup-res.c
3  *
4  * Extruded from code written by
5  *      Dave Rusling (david.rusling@reo.mts.dec.com)
6  *      David Mosberger (davidm@cs.arizona.edu)
7  *	David Miller (davem@redhat.com)
8  *
9  * Support routines for initializing a PCI subsystem.
10  */
11 
12 /* fixed for multiple pci buses, 1999 Andrea Arcangeli <andrea@suse.de> */
13 
14 /*
15  * Nov 2000, Ivan Kokshaysky <ink@jurassic.park.msu.ru>
16  *	     Resource sorting
17  */
18 
19 #include <linux/init.h>
20 #include <linux/kernel.h>
21 #include <linux/pci.h>
22 #include <linux/errno.h>
23 #include <linux/ioport.h>
24 #include <linux/cache.h>
25 #include <linux/slab.h>
26 #include "pci.h"
27 
28 
29 void
30 pci_update_resource(struct pci_dev *dev, struct resource *res, int resno)
31 {
32 	struct pci_bus_region region;
33 	u32 new, check, mask;
34 	int reg;
35 
36 	/* Ignore resources for unimplemented BARs and unused resource slots
37 	   for 64 bit BARs. */
38 	if (!res->flags)
39 		return;
40 
41 	pcibios_resource_to_bus(dev, &region, res);
42 
43 	pr_debug("  got res [%lx:%lx] bus [%lx:%lx] flags %lx for "
44 		 "BAR %d of %s\n", res->start, res->end,
45 		 region.start, region.end, res->flags, resno, pci_name(dev));
46 
47 	new = region.start | (res->flags & PCI_REGION_FLAG_MASK);
48 	if (res->flags & IORESOURCE_IO)
49 		mask = (u32)PCI_BASE_ADDRESS_IO_MASK;
50 	else
51 		mask = (u32)PCI_BASE_ADDRESS_MEM_MASK;
52 
53 	if (resno < 6) {
54 		reg = PCI_BASE_ADDRESS_0 + 4 * resno;
55 	} else if (resno == PCI_ROM_RESOURCE) {
56 		if (!(res->flags & IORESOURCE_ROM_ENABLE))
57 			return;
58 		new |= PCI_ROM_ADDRESS_ENABLE;
59 		reg = dev->rom_base_reg;
60 	} else {
61 		/* Hmm, non-standard resource. */
62 
63 		return;		/* kill uninitialised var warning */
64 	}
65 
66 	pci_write_config_dword(dev, reg, new);
67 	pci_read_config_dword(dev, reg, &check);
68 
69 	if ((new ^ check) & mask) {
70 		printk(KERN_ERR "PCI: Error while updating region "
71 		       "%s/%d (%08x != %08x)\n", pci_name(dev), resno,
72 		       new, check);
73 	}
74 
75 	if ((new & (PCI_BASE_ADDRESS_SPACE|PCI_BASE_ADDRESS_MEM_TYPE_MASK)) ==
76 	    (PCI_BASE_ADDRESS_SPACE_MEMORY|PCI_BASE_ADDRESS_MEM_TYPE_64)) {
77 		new = region.start >> 16 >> 16;
78 		pci_write_config_dword(dev, reg + 4, new);
79 		pci_read_config_dword(dev, reg + 4, &check);
80 		if (check != new) {
81 			printk(KERN_ERR "PCI: Error updating region "
82 			       "%s/%d (high %08x != %08x)\n",
83 			       pci_name(dev), resno, new, check);
84 		}
85 	}
86 	res->flags &= ~IORESOURCE_UNSET;
87 	pr_debug("PCI: moved device %s resource %d (%lx) to %x\n",
88 		pci_name(dev), resno, res->flags,
89 		new & ~PCI_REGION_FLAG_MASK);
90 }
91 
92 int __devinit
93 pci_claim_resource(struct pci_dev *dev, int resource)
94 {
95 	struct resource *res = &dev->resource[resource];
96 	struct resource *root = NULL;
97 	char *dtype = resource < PCI_BRIDGE_RESOURCES ? "device" : "bridge";
98 	int err;
99 
100 	root = pcibios_select_root(dev, res);
101 
102 	err = -EINVAL;
103 	if (root != NULL)
104 		err = insert_resource(root, res);
105 
106 	if (err) {
107 		printk(KERN_ERR "PCI: %s region %d of %s %s [%lx:%lx]\n",
108 		       root ? "Address space collision on" :
109 			      "No parent found for",
110 		       resource, dtype, pci_name(dev), res->start, res->end);
111 	}
112 
113 	return err;
114 }
115 EXPORT_SYMBOL_GPL(pci_claim_resource);
116 
117 int pci_assign_resource(struct pci_dev *dev, int resno)
118 {
119 	struct pci_bus *bus = dev->bus;
120 	struct resource *res = dev->resource + resno;
121 	unsigned long size, min, align;
122 	int ret;
123 
124 	size = res->end - res->start + 1;
125 	min = (res->flags & IORESOURCE_IO) ? PCIBIOS_MIN_IO : PCIBIOS_MIN_MEM;
126 	/* The bridge resources are special, as their
127 	   size != alignment. Sizing routines return
128 	   required alignment in the "start" field. */
129 	align = (resno < PCI_BRIDGE_RESOURCES) ? size : res->start;
130 
131 	/* First, try exact prefetching match.. */
132 	ret = pci_bus_alloc_resource(bus, res, size, align, min,
133 				     IORESOURCE_PREFETCH,
134 				     pcibios_align_resource, dev);
135 
136 	if (ret < 0 && (res->flags & IORESOURCE_PREFETCH)) {
137 		/*
138 		 * That failed.
139 		 *
140 		 * But a prefetching area can handle a non-prefetching
141 		 * window (it will just not perform as well).
142 		 */
143 		ret = pci_bus_alloc_resource(bus, res, size, align, min, 0,
144 					     pcibios_align_resource, dev);
145 	}
146 
147 	if (ret) {
148 		printk(KERN_ERR "PCI: Failed to allocate %s resource #%d:%lx@%lx for %s\n",
149 		       res->flags & IORESOURCE_IO ? "I/O" : "mem",
150 		       resno, size, res->start, pci_name(dev));
151 	} else if (resno < PCI_BRIDGE_RESOURCES) {
152 		pci_update_resource(dev, res, resno);
153 	}
154 
155 	return ret;
156 }
157 
158 /* Sort resources by alignment */
159 void __devinit
160 pdev_sort_resources(struct pci_dev *dev, struct resource_list *head)
161 {
162 	int i;
163 
164 	for (i = 0; i < PCI_NUM_RESOURCES; i++) {
165 		struct resource *r;
166 		struct resource_list *list, *tmp;
167 		unsigned long r_align;
168 
169 		r = &dev->resource[i];
170 		r_align = r->end - r->start;
171 
172 		if (!(r->flags) || r->parent)
173 			continue;
174 		if (!r_align) {
175 			printk(KERN_WARNING "PCI: Ignore bogus resource %d "
176 					    "[%lx:%lx] of %s\n",
177 					    i, r->start, r->end, pci_name(dev));
178 			continue;
179 		}
180 		r_align = (i < PCI_BRIDGE_RESOURCES) ? r_align + 1 : r->start;
181 		for (list = head; ; list = list->next) {
182 			unsigned long align = 0;
183 			struct resource_list *ln = list->next;
184 			int idx;
185 
186 			if (ln) {
187 				idx = ln->res - &ln->dev->resource[0];
188 				align = (idx < PCI_BRIDGE_RESOURCES) ?
189 					ln->res->end - ln->res->start + 1 :
190 					ln->res->start;
191 			}
192 			if (r_align > align) {
193 				tmp = kmalloc(sizeof(*tmp), GFP_KERNEL);
194 				if (!tmp)
195 					panic("pdev_sort_resources(): "
196 					      "kmalloc() failed!\n");
197 				tmp->next = ln;
198 				tmp->res = r;
199 				tmp->dev = dev;
200 				list->next = tmp;
201 				break;
202 			}
203 		}
204 	}
205 }
206