Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/kernel/resource.c | |
3 | * | |
4 | * Copyright (C) 1999 Linus Torvalds | |
5 | * Copyright (C) 1999 Martin Mares <mj@ucw.cz> | |
6 | * | |
7 | * Arbitrary resource management. | |
8 | */ | |
9 | ||
65fed8f6 OP |
10 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
11 | ||
9984de1a | 12 | #include <linux/export.h> |
1da177e4 LT |
13 | #include <linux/errno.h> |
14 | #include <linux/ioport.h> | |
15 | #include <linux/init.h> | |
16 | #include <linux/slab.h> | |
17 | #include <linux/spinlock.h> | |
18 | #include <linux/fs.h> | |
19 | #include <linux/proc_fs.h> | |
8b6d043b | 20 | #include <linux/sched.h> |
1da177e4 | 21 | #include <linux/seq_file.h> |
9ac7849e | 22 | #include <linux/device.h> |
d68612b2 | 23 | #include <linux/pfn.h> |
ebff7d8f | 24 | #include <linux/mm.h> |
90e97820 | 25 | #include <linux/resource_ext.h> |
1da177e4 LT |
26 | #include <asm/io.h> |
27 | ||
28 | ||
29 | struct resource ioport_resource = { | |
30 | .name = "PCI IO", | |
6550e07f | 31 | .start = 0, |
1da177e4 LT |
32 | .end = IO_SPACE_LIMIT, |
33 | .flags = IORESOURCE_IO, | |
34 | }; | |
1da177e4 LT |
35 | EXPORT_SYMBOL(ioport_resource); |
36 | ||
37 | struct resource iomem_resource = { | |
38 | .name = "PCI mem", | |
6550e07f GKH |
39 | .start = 0, |
40 | .end = -1, | |
1da177e4 LT |
41 | .flags = IORESOURCE_MEM, |
42 | }; | |
1da177e4 LT |
43 | EXPORT_SYMBOL(iomem_resource); |
44 | ||
23c570a6 RP |
45 | /* constraints to be met while allocating resources */ |
46 | struct resource_constraint { | |
47 | resource_size_t min, max, align; | |
48 | resource_size_t (*alignf)(void *, const struct resource *, | |
49 | resource_size_t, resource_size_t); | |
50 | void *alignf_data; | |
51 | }; | |
52 | ||
1da177e4 LT |
53 | static DEFINE_RWLOCK(resource_lock); |
54 | ||
ebff7d8f YI |
55 | /* |
56 | * For memory hotplug, there is no way to free resource entries allocated | |
57 | * by boot mem after the system is up. So for reusing the resource entry | |
58 | * we need to remember the resource. | |
59 | */ | |
60 | static struct resource *bootmem_resource_free; | |
61 | static DEFINE_SPINLOCK(bootmem_resource_lock); | |
62 | ||
8c86e70a | 63 | static struct resource *next_resource(struct resource *p, bool sibling_only) |
1da177e4 | 64 | { |
8c86e70a VG |
65 | /* Caller wants to traverse through siblings only */ |
66 | if (sibling_only) | |
67 | return p->sibling; | |
68 | ||
1da177e4 LT |
69 | if (p->child) |
70 | return p->child; | |
71 | while (!p->sibling && p->parent) | |
72 | p = p->parent; | |
73 | return p->sibling; | |
74 | } | |
75 | ||
8c86e70a VG |
76 | static void *r_next(struct seq_file *m, void *v, loff_t *pos) |
77 | { | |
78 | struct resource *p = v; | |
79 | (*pos)++; | |
80 | return (void *)next_resource(p, false); | |
81 | } | |
82 | ||
13eb8375 IM |
83 | #ifdef CONFIG_PROC_FS |
84 | ||
85 | enum { MAX_IORES_LEVEL = 5 }; | |
86 | ||
1da177e4 LT |
87 | static void *r_start(struct seq_file *m, loff_t *pos) |
88 | __acquires(resource_lock) | |
89 | { | |
90 | struct resource *p = m->private; | |
91 | loff_t l = 0; | |
92 | read_lock(&resource_lock); | |
93 | for (p = p->child; p && l < *pos; p = r_next(m, p, &l)) | |
94 | ; | |
95 | return p; | |
96 | } | |
97 | ||
98 | static void r_stop(struct seq_file *m, void *v) | |
99 | __releases(resource_lock) | |
100 | { | |
101 | read_unlock(&resource_lock); | |
102 | } | |
103 | ||
104 | static int r_show(struct seq_file *m, void *v) | |
105 | { | |
106 | struct resource *root = m->private; | |
107 | struct resource *r = v, *p; | |
51d7b120 | 108 | unsigned long long start, end; |
1da177e4 LT |
109 | int width = root->end < 0x10000 ? 4 : 8; |
110 | int depth; | |
111 | ||
112 | for (depth = 0, p = r; depth < MAX_IORES_LEVEL; depth++, p = p->parent) | |
113 | if (p->parent == root) | |
114 | break; | |
51d7b120 LT |
115 | |
116 | if (file_ns_capable(m->file, &init_user_ns, CAP_SYS_ADMIN)) { | |
117 | start = r->start; | |
118 | end = r->end; | |
119 | } else { | |
120 | start = end = 0; | |
121 | } | |
122 | ||
685143ac | 123 | seq_printf(m, "%*s%0*llx-%0*llx : %s\n", |
1da177e4 | 124 | depth * 2, "", |
51d7b120 LT |
125 | width, start, |
126 | width, end, | |
1da177e4 LT |
127 | r->name ? r->name : "<BAD>"); |
128 | return 0; | |
129 | } | |
130 | ||
15ad7cdc | 131 | static const struct seq_operations resource_op = { |
1da177e4 LT |
132 | .start = r_start, |
133 | .next = r_next, | |
134 | .stop = r_stop, | |
135 | .show = r_show, | |
136 | }; | |
137 | ||
138 | static int ioports_open(struct inode *inode, struct file *file) | |
139 | { | |
140 | int res = seq_open(file, &resource_op); | |
141 | if (!res) { | |
142 | struct seq_file *m = file->private_data; | |
143 | m->private = &ioport_resource; | |
144 | } | |
145 | return res; | |
146 | } | |
147 | ||
148 | static int iomem_open(struct inode *inode, struct file *file) | |
149 | { | |
150 | int res = seq_open(file, &resource_op); | |
151 | if (!res) { | |
152 | struct seq_file *m = file->private_data; | |
153 | m->private = &iomem_resource; | |
154 | } | |
155 | return res; | |
156 | } | |
157 | ||
15ad7cdc | 158 | static const struct file_operations proc_ioports_operations = { |
1da177e4 LT |
159 | .open = ioports_open, |
160 | .read = seq_read, | |
161 | .llseek = seq_lseek, | |
162 | .release = seq_release, | |
163 | }; | |
164 | ||
15ad7cdc | 165 | static const struct file_operations proc_iomem_operations = { |
1da177e4 LT |
166 | .open = iomem_open, |
167 | .read = seq_read, | |
168 | .llseek = seq_lseek, | |
169 | .release = seq_release, | |
170 | }; | |
171 | ||
172 | static int __init ioresources_init(void) | |
173 | { | |
c33fff0a DL |
174 | proc_create("ioports", 0, NULL, &proc_ioports_operations); |
175 | proc_create("iomem", 0, NULL, &proc_iomem_operations); | |
1da177e4 LT |
176 | return 0; |
177 | } | |
178 | __initcall(ioresources_init); | |
179 | ||
180 | #endif /* CONFIG_PROC_FS */ | |
181 | ||
ebff7d8f YI |
182 | static void free_resource(struct resource *res) |
183 | { | |
184 | if (!res) | |
185 | return; | |
186 | ||
187 | if (!PageSlab(virt_to_head_page(res))) { | |
188 | spin_lock(&bootmem_resource_lock); | |
189 | res->sibling = bootmem_resource_free; | |
190 | bootmem_resource_free = res; | |
191 | spin_unlock(&bootmem_resource_lock); | |
192 | } else { | |
193 | kfree(res); | |
194 | } | |
195 | } | |
196 | ||
197 | static struct resource *alloc_resource(gfp_t flags) | |
198 | { | |
199 | struct resource *res = NULL; | |
200 | ||
201 | spin_lock(&bootmem_resource_lock); | |
202 | if (bootmem_resource_free) { | |
203 | res = bootmem_resource_free; | |
204 | bootmem_resource_free = res->sibling; | |
205 | } | |
206 | spin_unlock(&bootmem_resource_lock); | |
207 | ||
208 | if (res) | |
209 | memset(res, 0, sizeof(struct resource)); | |
210 | else | |
211 | res = kzalloc(sizeof(struct resource), flags); | |
212 | ||
213 | return res; | |
214 | } | |
215 | ||
1da177e4 LT |
216 | /* Return the conflict entry if you can't request it */ |
217 | static struct resource * __request_resource(struct resource *root, struct resource *new) | |
218 | { | |
d75fc8bb GKH |
219 | resource_size_t start = new->start; |
220 | resource_size_t end = new->end; | |
1da177e4 LT |
221 | struct resource *tmp, **p; |
222 | ||
223 | if (end < start) | |
224 | return root; | |
225 | if (start < root->start) | |
226 | return root; | |
227 | if (end > root->end) | |
228 | return root; | |
229 | p = &root->child; | |
230 | for (;;) { | |
231 | tmp = *p; | |
232 | if (!tmp || tmp->start > end) { | |
233 | new->sibling = tmp; | |
234 | *p = new; | |
235 | new->parent = root; | |
236 | return NULL; | |
237 | } | |
238 | p = &tmp->sibling; | |
239 | if (tmp->end < start) | |
240 | continue; | |
241 | return tmp; | |
242 | } | |
243 | } | |
244 | ||
ff3cc952 | 245 | static int __release_resource(struct resource *old, bool release_child) |
1da177e4 | 246 | { |
ff3cc952 | 247 | struct resource *tmp, **p, *chd; |
1da177e4 LT |
248 | |
249 | p = &old->parent->child; | |
250 | for (;;) { | |
251 | tmp = *p; | |
252 | if (!tmp) | |
253 | break; | |
254 | if (tmp == old) { | |
ff3cc952 TK |
255 | if (release_child || !(tmp->child)) { |
256 | *p = tmp->sibling; | |
257 | } else { | |
258 | for (chd = tmp->child;; chd = chd->sibling) { | |
259 | chd->parent = tmp->parent; | |
260 | if (!(chd->sibling)) | |
261 | break; | |
262 | } | |
263 | *p = tmp->child; | |
264 | chd->sibling = tmp->sibling; | |
265 | } | |
1da177e4 LT |
266 | old->parent = NULL; |
267 | return 0; | |
268 | } | |
269 | p = &tmp->sibling; | |
270 | } | |
271 | return -EINVAL; | |
272 | } | |
273 | ||
5eeec0ec YL |
274 | static void __release_child_resources(struct resource *r) |
275 | { | |
276 | struct resource *tmp, *p; | |
277 | resource_size_t size; | |
278 | ||
279 | p = r->child; | |
280 | r->child = NULL; | |
281 | while (p) { | |
282 | tmp = p; | |
283 | p = p->sibling; | |
284 | ||
285 | tmp->parent = NULL; | |
286 | tmp->sibling = NULL; | |
287 | __release_child_resources(tmp); | |
288 | ||
289 | printk(KERN_DEBUG "release child resource %pR\n", tmp); | |
290 | /* need to restore size, and keep flags */ | |
291 | size = resource_size(tmp); | |
292 | tmp->start = 0; | |
293 | tmp->end = size - 1; | |
294 | } | |
295 | } | |
296 | ||
297 | void release_child_resources(struct resource *r) | |
298 | { | |
299 | write_lock(&resource_lock); | |
300 | __release_child_resources(r); | |
301 | write_unlock(&resource_lock); | |
302 | } | |
303 | ||
e1ca66d1 | 304 | /** |
66f1207b | 305 | * request_resource_conflict - request and reserve an I/O or memory resource |
e1ca66d1 RD |
306 | * @root: root resource descriptor |
307 | * @new: resource descriptor desired by caller | |
308 | * | |
66f1207b | 309 | * Returns 0 for success, conflict resource on error. |
e1ca66d1 | 310 | */ |
66f1207b | 311 | struct resource *request_resource_conflict(struct resource *root, struct resource *new) |
1da177e4 LT |
312 | { |
313 | struct resource *conflict; | |
314 | ||
315 | write_lock(&resource_lock); | |
316 | conflict = __request_resource(root, new); | |
317 | write_unlock(&resource_lock); | |
66f1207b BH |
318 | return conflict; |
319 | } | |
320 | ||
321 | /** | |
322 | * request_resource - request and reserve an I/O or memory resource | |
323 | * @root: root resource descriptor | |
324 | * @new: resource descriptor desired by caller | |
325 | * | |
326 | * Returns 0 for success, negative error code on error. | |
327 | */ | |
328 | int request_resource(struct resource *root, struct resource *new) | |
329 | { | |
330 | struct resource *conflict; | |
331 | ||
332 | conflict = request_resource_conflict(root, new); | |
1da177e4 LT |
333 | return conflict ? -EBUSY : 0; |
334 | } | |
335 | ||
336 | EXPORT_SYMBOL(request_resource); | |
337 | ||
e1ca66d1 RD |
338 | /** |
339 | * release_resource - release a previously reserved resource | |
340 | * @old: resource pointer | |
341 | */ | |
1da177e4 LT |
342 | int release_resource(struct resource *old) |
343 | { | |
344 | int retval; | |
345 | ||
346 | write_lock(&resource_lock); | |
ff3cc952 | 347 | retval = __release_resource(old, true); |
1da177e4 LT |
348 | write_unlock(&resource_lock); |
349 | return retval; | |
350 | } | |
351 | ||
352 | EXPORT_SYMBOL(release_resource); | |
353 | ||
2842f114 | 354 | /* |
3f33647c TK |
355 | * Finds the lowest iomem resource existing within [res->start.res->end). |
356 | * The caller must specify res->start, res->end, res->flags, and optionally | |
a8fc4253 | 357 | * desc. If found, returns 0, res is overwritten, if not found, returns -1. |
3f33647c TK |
358 | * This function walks the whole tree and not just first level children until |
359 | * and unless first_level_children_only is true. | |
2842f114 | 360 | */ |
3f33647c | 361 | static int find_next_iomem_res(struct resource *res, unsigned long desc, |
a8fc4253 | 362 | bool first_level_children_only) |
2842f114 KH |
363 | { |
364 | resource_size_t start, end; | |
365 | struct resource *p; | |
8c86e70a | 366 | bool sibling_only = false; |
2842f114 KH |
367 | |
368 | BUG_ON(!res); | |
369 | ||
370 | start = res->start; | |
371 | end = res->end; | |
58c1b5b0 | 372 | BUG_ON(start >= end); |
2842f114 | 373 | |
800df627 | 374 | if (first_level_children_only) |
8c86e70a | 375 | sibling_only = true; |
8c86e70a | 376 | |
800df627 VG |
377 | read_lock(&resource_lock); |
378 | ||
379 | for (p = iomem_resource.child; p; p = next_resource(p, sibling_only)) { | |
a3650d53 | 380 | if ((p->flags & res->flags) != res->flags) |
2842f114 | 381 | continue; |
3f33647c TK |
382 | if ((desc != IORES_DESC_NONE) && (desc != p->desc)) |
383 | continue; | |
2842f114 KH |
384 | if (p->start > end) { |
385 | p = NULL; | |
386 | break; | |
387 | } | |
58c1b5b0 | 388 | if ((p->end >= start) && (p->start < end)) |
2842f114 KH |
389 | break; |
390 | } | |
8c86e70a | 391 | |
2842f114 KH |
392 | read_unlock(&resource_lock); |
393 | if (!p) | |
394 | return -1; | |
395 | /* copy data */ | |
0f04ab5e KH |
396 | if (res->start < p->start) |
397 | res->start = p->start; | |
398 | if (res->end > p->end) | |
399 | res->end = p->end; | |
2842f114 KH |
400 | return 0; |
401 | } | |
908eedc6 | 402 | |
4ac2aed8 TL |
403 | static int __walk_iomem_res_desc(struct resource *res, unsigned long desc, |
404 | bool first_level_children_only, | |
405 | void *arg, int (*func)(u64, u64, void *)) | |
406 | { | |
407 | u64 orig_end = res->end; | |
408 | int ret = -1; | |
409 | ||
410 | while ((res->start < res->end) && | |
411 | !find_next_iomem_res(res, desc, first_level_children_only)) { | |
412 | ret = (*func)(res->start, res->end, arg); | |
413 | if (ret) | |
414 | break; | |
415 | ||
416 | res->start = res->end + 1; | |
417 | res->end = orig_end; | |
418 | } | |
419 | ||
420 | return ret; | |
421 | } | |
422 | ||
8c86e70a VG |
423 | /* |
424 | * Walks through iomem resources and calls func() with matching resource | |
425 | * ranges. This walks through whole tree and not just first level children. | |
426 | * All the memory ranges which overlap start,end and also match flags and | |
3f33647c TK |
427 | * desc are valid candidates. |
428 | * | |
429 | * @desc: I/O resource descriptor. Use IORES_DESC_NONE to skip @desc check. | |
430 | * @flags: I/O resource flags | |
431 | * @start: start addr | |
432 | * @end: end addr | |
433 | * | |
434 | * NOTE: For a new descriptor search, define a new IORES_DESC in | |
435 | * <linux/ioport.h> and set it in 'desc' of a target resource entry. | |
436 | */ | |
437 | int walk_iomem_res_desc(unsigned long desc, unsigned long flags, u64 start, | |
438 | u64 end, void *arg, int (*func)(u64, u64, void *)) | |
439 | { | |
440 | struct resource res; | |
3f33647c TK |
441 | |
442 | res.start = start; | |
443 | res.end = end; | |
444 | res.flags = flags; | |
3f33647c | 445 | |
4ac2aed8 | 446 | return __walk_iomem_res_desc(&res, desc, false, arg, func); |
3f33647c TK |
447 | } |
448 | ||
8c86e70a | 449 | /* |
bd7e6cb3 TK |
450 | * This function calls the @func callback against all memory ranges of type |
451 | * System RAM which are marked as IORESOURCE_SYSTEM_RAM and IORESOUCE_BUSY. | |
452 | * Now, this function is only for System RAM, it deals with full ranges and | |
453 | * not PFNs. If resources are not PFN-aligned, dealing with PFNs can truncate | |
454 | * ranges. | |
8c86e70a VG |
455 | */ |
456 | int walk_system_ram_res(u64 start, u64 end, void *arg, | |
457 | int (*func)(u64, u64, void *)) | |
458 | { | |
459 | struct resource res; | |
8c86e70a VG |
460 | |
461 | res.start = start; | |
462 | res.end = end; | |
bd7e6cb3 | 463 | res.flags = IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY; |
4ac2aed8 TL |
464 | |
465 | return __walk_iomem_res_desc(&res, IORES_DESC_NONE, true, | |
466 | arg, func); | |
8c86e70a VG |
467 | } |
468 | ||
469 | #if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) | |
470 | ||
908eedc6 | 471 | /* |
bd7e6cb3 TK |
472 | * This function calls the @func callback against all memory ranges of type |
473 | * System RAM which are marked as IORESOURCE_SYSTEM_RAM and IORESOUCE_BUSY. | |
474 | * It is to be used only for System RAM. | |
908eedc6 KH |
475 | */ |
476 | int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_pages, | |
477 | void *arg, int (*func)(unsigned long, unsigned long, void *)) | |
75884fb1 KH |
478 | { |
479 | struct resource res; | |
37b99dd5 | 480 | unsigned long pfn, end_pfn; |
75884fb1 KH |
481 | u64 orig_end; |
482 | int ret = -1; | |
908eedc6 | 483 | |
75884fb1 KH |
484 | res.start = (u64) start_pfn << PAGE_SHIFT; |
485 | res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; | |
bd7e6cb3 | 486 | res.flags = IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY; |
75884fb1 | 487 | orig_end = res.end; |
908eedc6 | 488 | while ((res.start < res.end) && |
a8fc4253 | 489 | (find_next_iomem_res(&res, IORES_DESC_NONE, true) >= 0)) { |
37b99dd5 WF |
490 | pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; |
491 | end_pfn = (res.end + 1) >> PAGE_SHIFT; | |
492 | if (end_pfn > pfn) | |
f4149660 | 493 | ret = (*func)(pfn, end_pfn - pfn, arg); |
75884fb1 KH |
494 | if (ret) |
495 | break; | |
496 | res.start = res.end + 1; | |
497 | res.end = orig_end; | |
498 | } | |
499 | return ret; | |
500 | } | |
501 | ||
2842f114 KH |
502 | #endif |
503 | ||
61ef2489 WF |
504 | static int __is_ram(unsigned long pfn, unsigned long nr_pages, void *arg) |
505 | { | |
506 | return 1; | |
507 | } | |
4ac2aed8 | 508 | |
61ef2489 WF |
509 | /* |
510 | * This generic page_is_ram() returns true if specified address is | |
bd7e6cb3 | 511 | * registered as System RAM in iomem_resource list. |
61ef2489 | 512 | */ |
e5273007 | 513 | int __weak page_is_ram(unsigned long pfn) |
61ef2489 WF |
514 | { |
515 | return walk_system_ram_range(pfn, 1, NULL, __is_ram) == 1; | |
516 | } | |
c5a13032 | 517 | EXPORT_SYMBOL_GPL(page_is_ram); |
61ef2489 | 518 | |
124fe20d DW |
519 | /** |
520 | * region_intersects() - determine intersection of region with known resources | |
521 | * @start: region start address | |
522 | * @size: size of region | |
1c29f25b TK |
523 | * @flags: flags of resource (in iomem_resource) |
524 | * @desc: descriptor of resource (in iomem_resource) or IORES_DESC_NONE | |
67cf13ce | 525 | * |
124fe20d | 526 | * Check if the specified region partially overlaps or fully eclipses a |
1c29f25b TK |
527 | * resource identified by @flags and @desc (optional with IORES_DESC_NONE). |
528 | * Return REGION_DISJOINT if the region does not overlap @flags/@desc, | |
529 | * return REGION_MIXED if the region overlaps @flags/@desc and another | |
530 | * resource, and return REGION_INTERSECTS if the region overlaps @flags/@desc | |
531 | * and no other defined resource. Note that REGION_INTERSECTS is also | |
532 | * returned in the case when the specified region overlaps RAM and undefined | |
533 | * memory holes. | |
124fe20d DW |
534 | * |
535 | * region_intersect() is used by memory remapping functions to ensure | |
536 | * the user is not remapping RAM and is a vast speed up over walking | |
537 | * through the resource table page by page. | |
67cf13ce | 538 | */ |
1c29f25b TK |
539 | int region_intersects(resource_size_t start, size_t size, unsigned long flags, |
540 | unsigned long desc) | |
67cf13ce | 541 | { |
124fe20d DW |
542 | resource_size_t end = start + size - 1; |
543 | int type = 0; int other = 0; | |
544 | struct resource *p; | |
67cf13ce MT |
545 | |
546 | read_lock(&resource_lock); | |
547 | for (p = iomem_resource.child; p ; p = p->sibling) { | |
1c29f25b TK |
548 | bool is_type = (((p->flags & flags) == flags) && |
549 | ((desc == IORES_DESC_NONE) || | |
550 | (desc == p->desc))); | |
124fe20d DW |
551 | |
552 | if (start >= p->start && start <= p->end) | |
553 | is_type ? type++ : other++; | |
554 | if (end >= p->start && end <= p->end) | |
555 | is_type ? type++ : other++; | |
556 | if (p->start >= start && p->end <= end) | |
557 | is_type ? type++ : other++; | |
67cf13ce MT |
558 | } |
559 | read_unlock(&resource_lock); | |
124fe20d DW |
560 | |
561 | if (other == 0) | |
562 | return type ? REGION_INTERSECTS : REGION_DISJOINT; | |
563 | ||
564 | if (type) | |
565 | return REGION_MIXED; | |
566 | ||
567 | return REGION_DISJOINT; | |
67cf13ce | 568 | } |
1c29f25b | 569 | EXPORT_SYMBOL_GPL(region_intersects); |
67cf13ce | 570 | |
fcb11918 BH |
571 | void __weak arch_remove_reservations(struct resource *avail) |
572 | { | |
573 | } | |
574 | ||
a9cea017 BH |
575 | static resource_size_t simple_align_resource(void *data, |
576 | const struct resource *avail, | |
577 | resource_size_t size, | |
578 | resource_size_t align) | |
579 | { | |
580 | return avail->start; | |
581 | } | |
582 | ||
5d6b1fa3 BH |
583 | static void resource_clip(struct resource *res, resource_size_t min, |
584 | resource_size_t max) | |
585 | { | |
586 | if (res->start < min) | |
587 | res->start = min; | |
588 | if (res->end > max) | |
589 | res->end = max; | |
590 | } | |
591 | ||
1da177e4 | 592 | /* |
23c570a6 RP |
593 | * Find empty slot in the resource tree with the given range and |
594 | * alignment constraints | |
1da177e4 | 595 | */ |
23c570a6 RP |
596 | static int __find_resource(struct resource *root, struct resource *old, |
597 | struct resource *new, | |
598 | resource_size_t size, | |
599 | struct resource_constraint *constraint) | |
1da177e4 LT |
600 | { |
601 | struct resource *this = root->child; | |
a1862e31 | 602 | struct resource tmp = *new, avail, alloc; |
1da177e4 | 603 | |
0e2c8b8f | 604 | tmp.start = root->start; |
1da177e4 | 605 | /* |
c0f5ac54 BH |
606 | * Skip past an allocated resource that starts at 0, since the assignment |
607 | * of this->start - 1 to tmp->end below would cause an underflow. | |
1da177e4 | 608 | */ |
23c570a6 RP |
609 | if (this && this->start == root->start) { |
610 | tmp.start = (this == old) ? old->start : this->end + 1; | |
1da177e4 LT |
611 | this = this->sibling; |
612 | } | |
c0f5ac54 | 613 | for(;;) { |
1da177e4 | 614 | if (this) |
23c570a6 | 615 | tmp.end = (this == old) ? this->end : this->start - 1; |
1da177e4 | 616 | else |
0e2c8b8f | 617 | tmp.end = root->end; |
5d6b1fa3 | 618 | |
47ea91b4 RP |
619 | if (tmp.end < tmp.start) |
620 | goto next; | |
621 | ||
23c570a6 | 622 | resource_clip(&tmp, constraint->min, constraint->max); |
fcb11918 | 623 | arch_remove_reservations(&tmp); |
a9cea017 | 624 | |
a1862e31 | 625 | /* Check for overflow after ALIGN() */ |
23c570a6 | 626 | avail.start = ALIGN(tmp.start, constraint->align); |
a1862e31 | 627 | avail.end = tmp.end; |
5edb93b8 | 628 | avail.flags = new->flags & ~IORESOURCE_UNSET; |
a1862e31 | 629 | if (avail.start >= tmp.start) { |
5edb93b8 | 630 | alloc.flags = avail.flags; |
23c570a6 RP |
631 | alloc.start = constraint->alignf(constraint->alignf_data, &avail, |
632 | size, constraint->align); | |
a1862e31 BH |
633 | alloc.end = alloc.start + size - 1; |
634 | if (resource_contains(&avail, &alloc)) { | |
635 | new->start = alloc.start; | |
636 | new->end = alloc.end; | |
637 | return 0; | |
638 | } | |
1da177e4 | 639 | } |
47ea91b4 RP |
640 | |
641 | next: if (!this || this->end == root->end) | |
1da177e4 | 642 | break; |
47ea91b4 | 643 | |
23c570a6 RP |
644 | if (this != old) |
645 | tmp.start = this->end + 1; | |
1da177e4 LT |
646 | this = this->sibling; |
647 | } | |
648 | return -EBUSY; | |
649 | } | |
650 | ||
23c570a6 RP |
651 | /* |
652 | * Find empty slot in the resource tree given range and alignment. | |
653 | */ | |
654 | static int find_resource(struct resource *root, struct resource *new, | |
655 | resource_size_t size, | |
656 | struct resource_constraint *constraint) | |
657 | { | |
658 | return __find_resource(root, NULL, new, size, constraint); | |
659 | } | |
660 | ||
e1ca66d1 | 661 | /** |
23c570a6 RP |
662 | * reallocate_resource - allocate a slot in the resource tree given range & alignment. |
663 | * The resource will be relocated if the new size cannot be reallocated in the | |
664 | * current location. | |
665 | * | |
666 | * @root: root resource descriptor | |
667 | * @old: resource descriptor desired by caller | |
668 | * @newsize: new size of the resource descriptor | |
669 | * @constraint: the size and alignment constraints to be met. | |
670 | */ | |
28ab49ff | 671 | static int reallocate_resource(struct resource *root, struct resource *old, |
23c570a6 RP |
672 | resource_size_t newsize, |
673 | struct resource_constraint *constraint) | |
674 | { | |
675 | int err=0; | |
676 | struct resource new = *old; | |
677 | struct resource *conflict; | |
678 | ||
679 | write_lock(&resource_lock); | |
680 | ||
681 | if ((err = __find_resource(root, old, &new, newsize, constraint))) | |
682 | goto out; | |
683 | ||
684 | if (resource_contains(&new, old)) { | |
685 | old->start = new.start; | |
686 | old->end = new.end; | |
687 | goto out; | |
688 | } | |
689 | ||
690 | if (old->child) { | |
691 | err = -EBUSY; | |
692 | goto out; | |
693 | } | |
694 | ||
695 | if (resource_contains(old, &new)) { | |
696 | old->start = new.start; | |
697 | old->end = new.end; | |
698 | } else { | |
ff3cc952 | 699 | __release_resource(old, true); |
23c570a6 RP |
700 | *old = new; |
701 | conflict = __request_resource(root, old); | |
702 | BUG_ON(conflict); | |
703 | } | |
704 | out: | |
705 | write_unlock(&resource_lock); | |
706 | return err; | |
707 | } | |
708 | ||
709 | ||
710 | /** | |
711 | * allocate_resource - allocate empty slot in the resource tree given range & alignment. | |
712 | * The resource will be reallocated with a new size if it was already allocated | |
e1ca66d1 RD |
713 | * @root: root resource descriptor |
714 | * @new: resource descriptor desired by caller | |
715 | * @size: requested resource region size | |
ee5e5683 WY |
716 | * @min: minimum boundary to allocate |
717 | * @max: maximum boundary to allocate | |
e1ca66d1 RD |
718 | * @align: alignment requested, in bytes |
719 | * @alignf: alignment function, optional, called if not NULL | |
720 | * @alignf_data: arbitrary data to pass to the @alignf function | |
1da177e4 LT |
721 | */ |
722 | int allocate_resource(struct resource *root, struct resource *new, | |
d75fc8bb GKH |
723 | resource_size_t size, resource_size_t min, |
724 | resource_size_t max, resource_size_t align, | |
b26b2d49 | 725 | resource_size_t (*alignf)(void *, |
3b7a17fc | 726 | const struct resource *, |
b26b2d49 DB |
727 | resource_size_t, |
728 | resource_size_t), | |
1da177e4 LT |
729 | void *alignf_data) |
730 | { | |
731 | int err; | |
23c570a6 | 732 | struct resource_constraint constraint; |
1da177e4 | 733 | |
a9cea017 BH |
734 | if (!alignf) |
735 | alignf = simple_align_resource; | |
736 | ||
23c570a6 RP |
737 | constraint.min = min; |
738 | constraint.max = max; | |
739 | constraint.align = align; | |
740 | constraint.alignf = alignf; | |
741 | constraint.alignf_data = alignf_data; | |
742 | ||
743 | if ( new->parent ) { | |
744 | /* resource is already allocated, try reallocating with | |
745 | the new constraints */ | |
746 | return reallocate_resource(root, new, size, &constraint); | |
747 | } | |
748 | ||
1da177e4 | 749 | write_lock(&resource_lock); |
23c570a6 | 750 | err = find_resource(root, new, size, &constraint); |
1da177e4 LT |
751 | if (err >= 0 && __request_resource(root, new)) |
752 | err = -EBUSY; | |
753 | write_unlock(&resource_lock); | |
754 | return err; | |
755 | } | |
756 | ||
757 | EXPORT_SYMBOL(allocate_resource); | |
758 | ||
1c388919 GU |
759 | /** |
760 | * lookup_resource - find an existing resource by a resource start address | |
761 | * @root: root resource descriptor | |
762 | * @start: resource start address | |
763 | * | |
764 | * Returns a pointer to the resource if found, NULL otherwise | |
765 | */ | |
766 | struct resource *lookup_resource(struct resource *root, resource_size_t start) | |
767 | { | |
768 | struct resource *res; | |
769 | ||
770 | read_lock(&resource_lock); | |
771 | for (res = root->child; res; res = res->sibling) { | |
772 | if (res->start == start) | |
773 | break; | |
774 | } | |
775 | read_unlock(&resource_lock); | |
776 | ||
777 | return res; | |
778 | } | |
779 | ||
bef69ea0 LT |
780 | /* |
781 | * Insert a resource into the resource tree. If successful, return NULL, | |
782 | * otherwise return the conflicting resource (compare to __request_resource()) | |
1da177e4 | 783 | */ |
bef69ea0 | 784 | static struct resource * __insert_resource(struct resource *parent, struct resource *new) |
1da177e4 | 785 | { |
1da177e4 LT |
786 | struct resource *first, *next; |
787 | ||
d33b6fba | 788 | for (;; parent = first) { |
d33b6fba MW |
789 | first = __request_resource(parent, new); |
790 | if (!first) | |
bef69ea0 | 791 | return first; |
d33b6fba | 792 | |
d33b6fba | 793 | if (first == parent) |
bef69ea0 | 794 | return first; |
5de1cb2d HS |
795 | if (WARN_ON(first == new)) /* duplicated insertion */ |
796 | return first; | |
d33b6fba MW |
797 | |
798 | if ((first->start > new->start) || (first->end < new->end)) | |
799 | break; | |
800 | if ((first->start == new->start) && (first->end == new->end)) | |
801 | break; | |
1da177e4 LT |
802 | } |
803 | ||
804 | for (next = first; ; next = next->sibling) { | |
805 | /* Partial overlap? Bad, and unfixable */ | |
806 | if (next->start < new->start || next->end > new->end) | |
bef69ea0 | 807 | return next; |
1da177e4 LT |
808 | if (!next->sibling) |
809 | break; | |
810 | if (next->sibling->start > new->end) | |
811 | break; | |
812 | } | |
813 | ||
1da177e4 LT |
814 | new->parent = parent; |
815 | new->sibling = next->sibling; | |
816 | new->child = first; | |
817 | ||
818 | next->sibling = NULL; | |
819 | for (next = first; next; next = next->sibling) | |
820 | next->parent = new; | |
821 | ||
822 | if (parent->child == first) { | |
823 | parent->child = new; | |
824 | } else { | |
825 | next = parent->child; | |
826 | while (next->sibling != first) | |
827 | next = next->sibling; | |
828 | next->sibling = new; | |
829 | } | |
bef69ea0 LT |
830 | return NULL; |
831 | } | |
1da177e4 | 832 | |
bef69ea0 | 833 | /** |
66f1207b | 834 | * insert_resource_conflict - Inserts resource in the resource tree |
bef69ea0 LT |
835 | * @parent: parent of the new resource |
836 | * @new: new resource to insert | |
837 | * | |
66f1207b | 838 | * Returns 0 on success, conflict resource if the resource can't be inserted. |
bef69ea0 | 839 | * |
66f1207b | 840 | * This function is equivalent to request_resource_conflict when no conflict |
bef69ea0 LT |
841 | * happens. If a conflict happens, and the conflicting resources |
842 | * entirely fit within the range of the new resource, then the new | |
843 | * resource is inserted and the conflicting resources become children of | |
844 | * the new resource. | |
ff3cc952 TK |
845 | * |
846 | * This function is intended for producers of resources, such as FW modules | |
847 | * and bus drivers. | |
bef69ea0 | 848 | */ |
66f1207b | 849 | struct resource *insert_resource_conflict(struct resource *parent, struct resource *new) |
bef69ea0 LT |
850 | { |
851 | struct resource *conflict; | |
852 | ||
853 | write_lock(&resource_lock); | |
854 | conflict = __insert_resource(parent, new); | |
855 | write_unlock(&resource_lock); | |
66f1207b BH |
856 | return conflict; |
857 | } | |
858 | ||
859 | /** | |
860 | * insert_resource - Inserts a resource in the resource tree | |
861 | * @parent: parent of the new resource | |
862 | * @new: new resource to insert | |
863 | * | |
864 | * Returns 0 on success, -EBUSY if the resource can't be inserted. | |
ff3cc952 TK |
865 | * |
866 | * This function is intended for producers of resources, such as FW modules | |
867 | * and bus drivers. | |
66f1207b BH |
868 | */ |
869 | int insert_resource(struct resource *parent, struct resource *new) | |
870 | { | |
871 | struct resource *conflict; | |
872 | ||
873 | conflict = insert_resource_conflict(parent, new); | |
bef69ea0 LT |
874 | return conflict ? -EBUSY : 0; |
875 | } | |
8095d0f2 | 876 | EXPORT_SYMBOL_GPL(insert_resource); |
bef69ea0 LT |
877 | |
878 | /** | |
879 | * insert_resource_expand_to_fit - Insert a resource into the resource tree | |
6781f4ae | 880 | * @root: root resource descriptor |
bef69ea0 LT |
881 | * @new: new resource to insert |
882 | * | |
883 | * Insert a resource into the resource tree, possibly expanding it in order | |
884 | * to make it encompass any conflicting resources. | |
885 | */ | |
886 | void insert_resource_expand_to_fit(struct resource *root, struct resource *new) | |
887 | { | |
888 | if (new->parent) | |
889 | return; | |
890 | ||
891 | write_lock(&resource_lock); | |
892 | for (;;) { | |
893 | struct resource *conflict; | |
894 | ||
895 | conflict = __insert_resource(root, new); | |
896 | if (!conflict) | |
897 | break; | |
898 | if (conflict == root) | |
899 | break; | |
900 | ||
901 | /* Ok, expand resource to cover the conflict, then try again .. */ | |
902 | if (conflict->start < new->start) | |
903 | new->start = conflict->start; | |
904 | if (conflict->end > new->end) | |
905 | new->end = conflict->end; | |
906 | ||
907 | printk("Expanded resource %s due to conflict with %s\n", new->name, conflict->name); | |
908 | } | |
1da177e4 | 909 | write_unlock(&resource_lock); |
1da177e4 LT |
910 | } |
911 | ||
ff3cc952 TK |
912 | /** |
913 | * remove_resource - Remove a resource in the resource tree | |
914 | * @old: resource to remove | |
915 | * | |
916 | * Returns 0 on success, -EINVAL if the resource is not valid. | |
917 | * | |
918 | * This function removes a resource previously inserted by insert_resource() | |
919 | * or insert_resource_conflict(), and moves the children (if any) up to | |
920 | * where they were before. insert_resource() and insert_resource_conflict() | |
921 | * insert a new resource, and move any conflicting resources down to the | |
922 | * children of the new resource. | |
923 | * | |
924 | * insert_resource(), insert_resource_conflict() and remove_resource() are | |
925 | * intended for producers of resources, such as FW modules and bus drivers. | |
926 | */ | |
927 | int remove_resource(struct resource *old) | |
928 | { | |
929 | int retval; | |
930 | ||
931 | write_lock(&resource_lock); | |
932 | retval = __release_resource(old, false); | |
933 | write_unlock(&resource_lock); | |
934 | return retval; | |
935 | } | |
8095d0f2 | 936 | EXPORT_SYMBOL_GPL(remove_resource); |
ff3cc952 | 937 | |
ae8e3a91 TK |
938 | static int __adjust_resource(struct resource *res, resource_size_t start, |
939 | resource_size_t size) | |
1da177e4 LT |
940 | { |
941 | struct resource *tmp, *parent = res->parent; | |
d75fc8bb | 942 | resource_size_t end = start + size - 1; |
1da177e4 LT |
943 | int result = -EBUSY; |
944 | ||
82ec90ea YL |
945 | if (!parent) |
946 | goto skip; | |
947 | ||
1da177e4 LT |
948 | if ((start < parent->start) || (end > parent->end)) |
949 | goto out; | |
950 | ||
1da177e4 LT |
951 | if (res->sibling && (res->sibling->start <= end)) |
952 | goto out; | |
953 | ||
954 | tmp = parent->child; | |
955 | if (tmp != res) { | |
956 | while (tmp->sibling != res) | |
957 | tmp = tmp->sibling; | |
958 | if (start <= tmp->end) | |
959 | goto out; | |
960 | } | |
961 | ||
82ec90ea YL |
962 | skip: |
963 | for (tmp = res->child; tmp; tmp = tmp->sibling) | |
964 | if ((tmp->start < start) || (tmp->end > end)) | |
965 | goto out; | |
966 | ||
1da177e4 LT |
967 | res->start = start; |
968 | res->end = end; | |
969 | result = 0; | |
970 | ||
971 | out: | |
ae8e3a91 TK |
972 | return result; |
973 | } | |
974 | ||
975 | /** | |
976 | * adjust_resource - modify a resource's start and size | |
977 | * @res: resource to modify | |
978 | * @start: new start value | |
979 | * @size: new size | |
980 | * | |
981 | * Given an existing resource, change its start and size to match the | |
982 | * arguments. Returns 0 on success, -EBUSY if it can't fit. | |
983 | * Existing children of the resource are assumed to be immutable. | |
984 | */ | |
985 | int adjust_resource(struct resource *res, resource_size_t start, | |
986 | resource_size_t size) | |
987 | { | |
988 | int result; | |
989 | ||
990 | write_lock(&resource_lock); | |
991 | result = __adjust_resource(res, start, size); | |
1da177e4 LT |
992 | write_unlock(&resource_lock); |
993 | return result; | |
994 | } | |
24105748 | 995 | EXPORT_SYMBOL(adjust_resource); |
1da177e4 | 996 | |
268364a0 YL |
997 | static void __init __reserve_region_with_split(struct resource *root, |
998 | resource_size_t start, resource_size_t end, | |
999 | const char *name) | |
1000 | { | |
1001 | struct resource *parent = root; | |
1002 | struct resource *conflict; | |
ebff7d8f | 1003 | struct resource *res = alloc_resource(GFP_ATOMIC); |
4965f566 | 1004 | struct resource *next_res = NULL; |
268364a0 YL |
1005 | |
1006 | if (!res) | |
1007 | return; | |
1008 | ||
1009 | res->name = name; | |
1010 | res->start = start; | |
1011 | res->end = end; | |
1012 | res->flags = IORESOURCE_BUSY; | |
43ee493b | 1013 | res->desc = IORES_DESC_NONE; |
268364a0 | 1014 | |
4965f566 | 1015 | while (1) { |
268364a0 | 1016 | |
4965f566 M |
1017 | conflict = __request_resource(parent, res); |
1018 | if (!conflict) { | |
1019 | if (!next_res) | |
1020 | break; | |
1021 | res = next_res; | |
1022 | next_res = NULL; | |
1023 | continue; | |
1024 | } | |
268364a0 | 1025 | |
4965f566 M |
1026 | /* conflict covered whole area */ |
1027 | if (conflict->start <= res->start && | |
1028 | conflict->end >= res->end) { | |
ebff7d8f | 1029 | free_resource(res); |
4965f566 M |
1030 | WARN_ON(next_res); |
1031 | break; | |
1032 | } | |
1033 | ||
1034 | /* failed, split and try again */ | |
1035 | if (conflict->start > res->start) { | |
1036 | end = res->end; | |
1037 | res->end = conflict->start - 1; | |
1038 | if (conflict->end < end) { | |
ebff7d8f | 1039 | next_res = alloc_resource(GFP_ATOMIC); |
4965f566 | 1040 | if (!next_res) { |
ebff7d8f | 1041 | free_resource(res); |
4965f566 M |
1042 | break; |
1043 | } | |
1044 | next_res->name = name; | |
1045 | next_res->start = conflict->end + 1; | |
1046 | next_res->end = end; | |
1047 | next_res->flags = IORESOURCE_BUSY; | |
43ee493b | 1048 | next_res->desc = IORES_DESC_NONE; |
4965f566 M |
1049 | } |
1050 | } else { | |
1051 | res->start = conflict->end + 1; | |
1052 | } | |
1053 | } | |
268364a0 YL |
1054 | |
1055 | } | |
1056 | ||
bea92112 | 1057 | void __init reserve_region_with_split(struct resource *root, |
268364a0 YL |
1058 | resource_size_t start, resource_size_t end, |
1059 | const char *name) | |
1060 | { | |
65fed8f6 OP |
1061 | int abort = 0; |
1062 | ||
268364a0 | 1063 | write_lock(&resource_lock); |
65fed8f6 OP |
1064 | if (root->start > start || root->end < end) { |
1065 | pr_err("requested range [0x%llx-0x%llx] not in root %pr\n", | |
1066 | (unsigned long long)start, (unsigned long long)end, | |
1067 | root); | |
1068 | if (start > root->end || end < root->start) | |
1069 | abort = 1; | |
1070 | else { | |
1071 | if (end > root->end) | |
1072 | end = root->end; | |
1073 | if (start < root->start) | |
1074 | start = root->start; | |
1075 | pr_err("fixing request to [0x%llx-0x%llx]\n", | |
1076 | (unsigned long long)start, | |
1077 | (unsigned long long)end); | |
1078 | } | |
1079 | dump_stack(); | |
1080 | } | |
1081 | if (!abort) | |
1082 | __reserve_region_with_split(root, start, end, name); | |
268364a0 YL |
1083 | write_unlock(&resource_lock); |
1084 | } | |
1085 | ||
88452565 IK |
1086 | /** |
1087 | * resource_alignment - calculate resource's alignment | |
1088 | * @res: resource pointer | |
1089 | * | |
1090 | * Returns alignment on success, 0 (invalid alignment) on failure. | |
1091 | */ | |
1092 | resource_size_t resource_alignment(struct resource *res) | |
1093 | { | |
1094 | switch (res->flags & (IORESOURCE_SIZEALIGN | IORESOURCE_STARTALIGN)) { | |
1095 | case IORESOURCE_SIZEALIGN: | |
1a4e564b | 1096 | return resource_size(res); |
88452565 IK |
1097 | case IORESOURCE_STARTALIGN: |
1098 | return res->start; | |
1099 | default: | |
1100 | return 0; | |
1101 | } | |
1102 | } | |
1103 | ||
1da177e4 LT |
1104 | /* |
1105 | * This is compatibility stuff for IO resources. | |
1106 | * | |
1107 | * Note how this, unlike the above, knows about | |
1108 | * the IO flag meanings (busy etc). | |
1109 | * | |
e1ca66d1 | 1110 | * request_region creates a new busy region. |
1da177e4 | 1111 | * |
e1ca66d1 RD |
1112 | * release_region releases a matching busy region. |
1113 | */ | |
1114 | ||
8b6d043b AC |
1115 | static DECLARE_WAIT_QUEUE_HEAD(muxed_resource_wait); |
1116 | ||
e1ca66d1 RD |
1117 | /** |
1118 | * __request_region - create a new busy resource region | |
1119 | * @parent: parent resource descriptor | |
1120 | * @start: resource start address | |
1121 | * @n: resource region size | |
1122 | * @name: reserving caller's ID string | |
6ae301e8 | 1123 | * @flags: IO resource flags |
1da177e4 | 1124 | */ |
d75fc8bb GKH |
1125 | struct resource * __request_region(struct resource *parent, |
1126 | resource_size_t start, resource_size_t n, | |
e8de1481 | 1127 | const char *name, int flags) |
1da177e4 | 1128 | { |
8b6d043b | 1129 | DECLARE_WAITQUEUE(wait, current); |
ebff7d8f | 1130 | struct resource *res = alloc_resource(GFP_KERNEL); |
1da177e4 | 1131 | |
c26ec88e BH |
1132 | if (!res) |
1133 | return NULL; | |
1134 | ||
1135 | res->name = name; | |
1136 | res->start = start; | |
1137 | res->end = start + n - 1; | |
c26ec88e BH |
1138 | |
1139 | write_lock(&resource_lock); | |
1140 | ||
1141 | for (;;) { | |
1142 | struct resource *conflict; | |
1143 | ||
4e0d8f7e TK |
1144 | res->flags = resource_type(parent) | resource_ext_type(parent); |
1145 | res->flags |= IORESOURCE_BUSY | flags; | |
1146 | res->desc = parent->desc; | |
1147 | ||
c26ec88e BH |
1148 | conflict = __request_resource(parent, res); |
1149 | if (!conflict) | |
1da177e4 | 1150 | break; |
c26ec88e | 1151 | if (conflict != parent) { |
59ceeaaf SG |
1152 | if (!(conflict->flags & IORESOURCE_BUSY)) { |
1153 | parent = conflict; | |
c26ec88e | 1154 | continue; |
59ceeaaf | 1155 | } |
1da177e4 | 1156 | } |
8b6d043b AC |
1157 | if (conflict->flags & flags & IORESOURCE_MUXED) { |
1158 | add_wait_queue(&muxed_resource_wait, &wait); | |
1159 | write_unlock(&resource_lock); | |
1160 | set_current_state(TASK_UNINTERRUPTIBLE); | |
1161 | schedule(); | |
1162 | remove_wait_queue(&muxed_resource_wait, &wait); | |
1163 | write_lock(&resource_lock); | |
1164 | continue; | |
1165 | } | |
c26ec88e | 1166 | /* Uhhuh, that didn't work out.. */ |
ebff7d8f | 1167 | free_resource(res); |
c26ec88e BH |
1168 | res = NULL; |
1169 | break; | |
1da177e4 | 1170 | } |
c26ec88e | 1171 | write_unlock(&resource_lock); |
1da177e4 LT |
1172 | return res; |
1173 | } | |
1da177e4 LT |
1174 | EXPORT_SYMBOL(__request_region); |
1175 | ||
e1ca66d1 RD |
1176 | /** |
1177 | * __release_region - release a previously reserved resource region | |
1178 | * @parent: parent resource descriptor | |
1179 | * @start: resource start address | |
1180 | * @n: resource region size | |
1181 | * | |
1182 | * The described resource region must match a currently busy region. | |
1183 | */ | |
d75fc8bb GKH |
1184 | void __release_region(struct resource *parent, resource_size_t start, |
1185 | resource_size_t n) | |
1da177e4 LT |
1186 | { |
1187 | struct resource **p; | |
d75fc8bb | 1188 | resource_size_t end; |
1da177e4 LT |
1189 | |
1190 | p = &parent->child; | |
1191 | end = start + n - 1; | |
1192 | ||
1193 | write_lock(&resource_lock); | |
1194 | ||
1195 | for (;;) { | |
1196 | struct resource *res = *p; | |
1197 | ||
1198 | if (!res) | |
1199 | break; | |
1200 | if (res->start <= start && res->end >= end) { | |
1201 | if (!(res->flags & IORESOURCE_BUSY)) { | |
1202 | p = &res->child; | |
1203 | continue; | |
1204 | } | |
1205 | if (res->start != start || res->end != end) | |
1206 | break; | |
1207 | *p = res->sibling; | |
1208 | write_unlock(&resource_lock); | |
8b6d043b AC |
1209 | if (res->flags & IORESOURCE_MUXED) |
1210 | wake_up(&muxed_resource_wait); | |
ebff7d8f | 1211 | free_resource(res); |
1da177e4 LT |
1212 | return; |
1213 | } | |
1214 | p = &res->sibling; | |
1215 | } | |
1216 | ||
1217 | write_unlock(&resource_lock); | |
1218 | ||
685143ac GKH |
1219 | printk(KERN_WARNING "Trying to free nonexistent resource " |
1220 | "<%016llx-%016llx>\n", (unsigned long long)start, | |
1221 | (unsigned long long)end); | |
1da177e4 | 1222 | } |
1da177e4 LT |
1223 | EXPORT_SYMBOL(__release_region); |
1224 | ||
825f787b TK |
1225 | #ifdef CONFIG_MEMORY_HOTREMOVE |
1226 | /** | |
1227 | * release_mem_region_adjustable - release a previously reserved memory region | |
1228 | * @parent: parent resource descriptor | |
1229 | * @start: resource start address | |
1230 | * @size: resource region size | |
1231 | * | |
1232 | * This interface is intended for memory hot-delete. The requested region | |
1233 | * is released from a currently busy memory resource. The requested region | |
1234 | * must either match exactly or fit into a single busy resource entry. In | |
1235 | * the latter case, the remaining resource is adjusted accordingly. | |
1236 | * Existing children of the busy memory resource must be immutable in the | |
1237 | * request. | |
1238 | * | |
1239 | * Note: | |
1240 | * - Additional release conditions, such as overlapping region, can be | |
1241 | * supported after they are confirmed as valid cases. | |
1242 | * - When a busy memory resource gets split into two entries, the code | |
1243 | * assumes that all children remain in the lower address entry for | |
1244 | * simplicity. Enhance this logic when necessary. | |
1245 | */ | |
1246 | int release_mem_region_adjustable(struct resource *parent, | |
1247 | resource_size_t start, resource_size_t size) | |
1248 | { | |
1249 | struct resource **p; | |
1250 | struct resource *res; | |
1251 | struct resource *new_res; | |
1252 | resource_size_t end; | |
1253 | int ret = -EINVAL; | |
1254 | ||
1255 | end = start + size - 1; | |
1256 | if ((start < parent->start) || (end > parent->end)) | |
1257 | return ret; | |
1258 | ||
ebff7d8f YI |
1259 | /* The alloc_resource() result gets checked later */ |
1260 | new_res = alloc_resource(GFP_KERNEL); | |
825f787b TK |
1261 | |
1262 | p = &parent->child; | |
1263 | write_lock(&resource_lock); | |
1264 | ||
1265 | while ((res = *p)) { | |
1266 | if (res->start >= end) | |
1267 | break; | |
1268 | ||
1269 | /* look for the next resource if it does not fit into */ | |
1270 | if (res->start > start || res->end < end) { | |
1271 | p = &res->sibling; | |
1272 | continue; | |
1273 | } | |
1274 | ||
1275 | if (!(res->flags & IORESOURCE_MEM)) | |
1276 | break; | |
1277 | ||
1278 | if (!(res->flags & IORESOURCE_BUSY)) { | |
1279 | p = &res->child; | |
1280 | continue; | |
1281 | } | |
1282 | ||
1283 | /* found the target resource; let's adjust accordingly */ | |
1284 | if (res->start == start && res->end == end) { | |
1285 | /* free the whole entry */ | |
1286 | *p = res->sibling; | |
ebff7d8f | 1287 | free_resource(res); |
825f787b TK |
1288 | ret = 0; |
1289 | } else if (res->start == start && res->end != end) { | |
1290 | /* adjust the start */ | |
1291 | ret = __adjust_resource(res, end + 1, | |
1292 | res->end - end); | |
1293 | } else if (res->start != start && res->end == end) { | |
1294 | /* adjust the end */ | |
1295 | ret = __adjust_resource(res, res->start, | |
1296 | start - res->start); | |
1297 | } else { | |
1298 | /* split into two entries */ | |
1299 | if (!new_res) { | |
1300 | ret = -ENOMEM; | |
1301 | break; | |
1302 | } | |
1303 | new_res->name = res->name; | |
1304 | new_res->start = end + 1; | |
1305 | new_res->end = res->end; | |
1306 | new_res->flags = res->flags; | |
43ee493b | 1307 | new_res->desc = res->desc; |
825f787b TK |
1308 | new_res->parent = res->parent; |
1309 | new_res->sibling = res->sibling; | |
1310 | new_res->child = NULL; | |
1311 | ||
1312 | ret = __adjust_resource(res, res->start, | |
1313 | start - res->start); | |
1314 | if (ret) | |
1315 | break; | |
1316 | res->sibling = new_res; | |
1317 | new_res = NULL; | |
1318 | } | |
1319 | ||
1320 | break; | |
1321 | } | |
1322 | ||
1323 | write_unlock(&resource_lock); | |
ebff7d8f | 1324 | free_resource(new_res); |
825f787b TK |
1325 | return ret; |
1326 | } | |
1327 | #endif /* CONFIG_MEMORY_HOTREMOVE */ | |
1328 | ||
9ac7849e TH |
1329 | /* |
1330 | * Managed region resource | |
1331 | */ | |
8d38821c TR |
1332 | static void devm_resource_release(struct device *dev, void *ptr) |
1333 | { | |
1334 | struct resource **r = ptr; | |
1335 | ||
1336 | release_resource(*r); | |
1337 | } | |
1338 | ||
1339 | /** | |
1340 | * devm_request_resource() - request and reserve an I/O or memory resource | |
1341 | * @dev: device for which to request the resource | |
1342 | * @root: root of the resource tree from which to request the resource | |
1343 | * @new: descriptor of the resource to request | |
1344 | * | |
1345 | * This is a device-managed version of request_resource(). There is usually | |
1346 | * no need to release resources requested by this function explicitly since | |
1347 | * that will be taken care of when the device is unbound from its driver. | |
1348 | * If for some reason the resource needs to be released explicitly, because | |
1349 | * of ordering issues for example, drivers must call devm_release_resource() | |
1350 | * rather than the regular release_resource(). | |
1351 | * | |
1352 | * When a conflict is detected between any existing resources and the newly | |
1353 | * requested resource, an error message will be printed. | |
1354 | * | |
1355 | * Returns 0 on success or a negative error code on failure. | |
1356 | */ | |
1357 | int devm_request_resource(struct device *dev, struct resource *root, | |
1358 | struct resource *new) | |
1359 | { | |
1360 | struct resource *conflict, **ptr; | |
1361 | ||
1362 | ptr = devres_alloc(devm_resource_release, sizeof(*ptr), GFP_KERNEL); | |
1363 | if (!ptr) | |
1364 | return -ENOMEM; | |
1365 | ||
1366 | *ptr = new; | |
1367 | ||
1368 | conflict = request_resource_conflict(root, new); | |
1369 | if (conflict) { | |
1370 | dev_err(dev, "resource collision: %pR conflicts with %s %pR\n", | |
1371 | new, conflict->name, conflict); | |
1372 | devres_free(ptr); | |
1373 | return -EBUSY; | |
1374 | } | |
1375 | ||
1376 | devres_add(dev, ptr); | |
1377 | return 0; | |
1378 | } | |
1379 | EXPORT_SYMBOL(devm_request_resource); | |
1380 | ||
1381 | static int devm_resource_match(struct device *dev, void *res, void *data) | |
1382 | { | |
1383 | struct resource **ptr = res; | |
1384 | ||
1385 | return *ptr == data; | |
1386 | } | |
1387 | ||
1388 | /** | |
1389 | * devm_release_resource() - release a previously requested resource | |
1390 | * @dev: device for which to release the resource | |
1391 | * @new: descriptor of the resource to release | |
1392 | * | |
1393 | * Releases a resource previously requested using devm_request_resource(). | |
1394 | */ | |
1395 | void devm_release_resource(struct device *dev, struct resource *new) | |
1396 | { | |
1397 | WARN_ON(devres_release(dev, devm_resource_release, devm_resource_match, | |
1398 | new)); | |
1399 | } | |
1400 | EXPORT_SYMBOL(devm_release_resource); | |
1401 | ||
9ac7849e TH |
1402 | struct region_devres { |
1403 | struct resource *parent; | |
1404 | resource_size_t start; | |
1405 | resource_size_t n; | |
1406 | }; | |
1407 | ||
1408 | static void devm_region_release(struct device *dev, void *res) | |
1409 | { | |
1410 | struct region_devres *this = res; | |
1411 | ||
1412 | __release_region(this->parent, this->start, this->n); | |
1413 | } | |
1414 | ||
1415 | static int devm_region_match(struct device *dev, void *res, void *match_data) | |
1416 | { | |
1417 | struct region_devres *this = res, *match = match_data; | |
1418 | ||
1419 | return this->parent == match->parent && | |
1420 | this->start == match->start && this->n == match->n; | |
1421 | } | |
1422 | ||
1423 | struct resource * __devm_request_region(struct device *dev, | |
1424 | struct resource *parent, resource_size_t start, | |
1425 | resource_size_t n, const char *name) | |
1426 | { | |
1427 | struct region_devres *dr = NULL; | |
1428 | struct resource *res; | |
1429 | ||
1430 | dr = devres_alloc(devm_region_release, sizeof(struct region_devres), | |
1431 | GFP_KERNEL); | |
1432 | if (!dr) | |
1433 | return NULL; | |
1434 | ||
1435 | dr->parent = parent; | |
1436 | dr->start = start; | |
1437 | dr->n = n; | |
1438 | ||
e8de1481 | 1439 | res = __request_region(parent, start, n, name, 0); |
9ac7849e TH |
1440 | if (res) |
1441 | devres_add(dev, dr); | |
1442 | else | |
1443 | devres_free(dr); | |
1444 | ||
1445 | return res; | |
1446 | } | |
1447 | EXPORT_SYMBOL(__devm_request_region); | |
1448 | ||
1449 | void __devm_release_region(struct device *dev, struct resource *parent, | |
1450 | resource_size_t start, resource_size_t n) | |
1451 | { | |
1452 | struct region_devres match_data = { parent, start, n }; | |
1453 | ||
1454 | __release_region(parent, start, n); | |
1455 | WARN_ON(devres_destroy(dev, devm_region_release, devm_region_match, | |
1456 | &match_data)); | |
1457 | } | |
1458 | EXPORT_SYMBOL(__devm_release_region); | |
1459 | ||
1da177e4 LT |
1460 | /* |
1461 | * Called from init/main.c to reserve IO ports. | |
1462 | */ | |
1463 | #define MAXRESERVE 4 | |
1464 | static int __init reserve_setup(char *str) | |
1465 | { | |
1466 | static int reserved; | |
1467 | static struct resource reserve[MAXRESERVE]; | |
1468 | ||
1469 | for (;;) { | |
8bc1ad7d | 1470 | unsigned int io_start, io_num; |
1da177e4 LT |
1471 | int x = reserved; |
1472 | ||
1473 | if (get_option (&str, &io_start) != 2) | |
1474 | break; | |
1475 | if (get_option (&str, &io_num) == 0) | |
1476 | break; | |
1477 | if (x < MAXRESERVE) { | |
1478 | struct resource *res = reserve + x; | |
1479 | res->name = "reserved"; | |
1480 | res->start = io_start; | |
1481 | res->end = io_start + io_num - 1; | |
1482 | res->flags = IORESOURCE_BUSY; | |
43ee493b | 1483 | res->desc = IORES_DESC_NONE; |
1da177e4 LT |
1484 | res->child = NULL; |
1485 | if (request_resource(res->start >= 0x10000 ? &iomem_resource : &ioport_resource, res) == 0) | |
1486 | reserved = x+1; | |
1487 | } | |
1488 | } | |
1489 | return 1; | |
1490 | } | |
1491 | ||
1492 | __setup("reserve=", reserve_setup); | |
379daf62 SS |
1493 | |
1494 | /* | |
1495 | * Check if the requested addr and size spans more than any slot in the | |
1496 | * iomem resource tree. | |
1497 | */ | |
1498 | int iomem_map_sanity_check(resource_size_t addr, unsigned long size) | |
1499 | { | |
1500 | struct resource *p = &iomem_resource; | |
1501 | int err = 0; | |
1502 | loff_t l; | |
1503 | ||
1504 | read_lock(&resource_lock); | |
1505 | for (p = p->child; p ; p = r_next(NULL, p, &l)) { | |
1506 | /* | |
1507 | * We can probably skip the resources without | |
1508 | * IORESOURCE_IO attribute? | |
1509 | */ | |
1510 | if (p->start >= addr + size) | |
1511 | continue; | |
1512 | if (p->end < addr) | |
1513 | continue; | |
d68612b2 SS |
1514 | if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && |
1515 | PFN_DOWN(p->end) >= PFN_DOWN(addr + size - 1)) | |
379daf62 | 1516 | continue; |
3ac52669 AV |
1517 | /* |
1518 | * if a resource is "BUSY", it's not a hardware resource | |
1519 | * but a driver mapping of such a resource; we don't want | |
1520 | * to warn for those; some drivers legitimately map only | |
1521 | * partial hardware resources. (example: vesafb) | |
1522 | */ | |
1523 | if (p->flags & IORESOURCE_BUSY) | |
1524 | continue; | |
1525 | ||
e4c72966 | 1526 | printk(KERN_WARNING "resource sanity check: requesting [mem %#010llx-%#010llx], which spans more than %s %pR\n", |
13eb8375 IM |
1527 | (unsigned long long)addr, |
1528 | (unsigned long long)(addr + size - 1), | |
e4c72966 | 1529 | p->name, p); |
379daf62 SS |
1530 | err = -1; |
1531 | break; | |
1532 | } | |
1533 | read_unlock(&resource_lock); | |
1534 | ||
1535 | return err; | |
1536 | } | |
e8de1481 AV |
1537 | |
1538 | #ifdef CONFIG_STRICT_DEVMEM | |
1539 | static int strict_iomem_checks = 1; | |
1540 | #else | |
1541 | static int strict_iomem_checks; | |
1542 | #endif | |
1543 | ||
1544 | /* | |
1545 | * check if an address is reserved in the iomem resource tree | |
1546 | * returns 1 if reserved, 0 if not reserved. | |
1547 | */ | |
1548 | int iomem_is_exclusive(u64 addr) | |
1549 | { | |
1550 | struct resource *p = &iomem_resource; | |
1551 | int err = 0; | |
1552 | loff_t l; | |
1553 | int size = PAGE_SIZE; | |
1554 | ||
1555 | if (!strict_iomem_checks) | |
1556 | return 0; | |
1557 | ||
1558 | addr = addr & PAGE_MASK; | |
1559 | ||
1560 | read_lock(&resource_lock); | |
1561 | for (p = p->child; p ; p = r_next(NULL, p, &l)) { | |
1562 | /* | |
1563 | * We can probably skip the resources without | |
1564 | * IORESOURCE_IO attribute? | |
1565 | */ | |
1566 | if (p->start >= addr + size) | |
1567 | break; | |
1568 | if (p->end < addr) | |
1569 | continue; | |
90a545e9 DW |
1570 | /* |
1571 | * A resource is exclusive if IORESOURCE_EXCLUSIVE is set | |
1572 | * or CONFIG_IO_STRICT_DEVMEM is enabled and the | |
1573 | * resource is busy. | |
1574 | */ | |
1575 | if ((p->flags & IORESOURCE_BUSY) == 0) | |
1576 | continue; | |
1577 | if (IS_ENABLED(CONFIG_IO_STRICT_DEVMEM) | |
1578 | || p->flags & IORESOURCE_EXCLUSIVE) { | |
e8de1481 AV |
1579 | err = 1; |
1580 | break; | |
1581 | } | |
1582 | } | |
1583 | read_unlock(&resource_lock); | |
1584 | ||
1585 | return err; | |
1586 | } | |
1587 | ||
90e97820 JL |
1588 | struct resource_entry *resource_list_create_entry(struct resource *res, |
1589 | size_t extra_size) | |
1590 | { | |
1591 | struct resource_entry *entry; | |
1592 | ||
1593 | entry = kzalloc(sizeof(*entry) + extra_size, GFP_KERNEL); | |
1594 | if (entry) { | |
1595 | INIT_LIST_HEAD(&entry->node); | |
1596 | entry->res = res ? res : &entry->__res; | |
1597 | } | |
1598 | ||
1599 | return entry; | |
1600 | } | |
1601 | EXPORT_SYMBOL(resource_list_create_entry); | |
1602 | ||
1603 | void resource_list_free(struct list_head *head) | |
1604 | { | |
1605 | struct resource_entry *entry, *tmp; | |
1606 | ||
1607 | list_for_each_entry_safe(entry, tmp, head, node) | |
1608 | resource_list_destroy_entry(entry); | |
1609 | } | |
1610 | EXPORT_SYMBOL(resource_list_free); | |
1611 | ||
e8de1481 AV |
1612 | static int __init strict_iomem(char *str) |
1613 | { | |
1614 | if (strstr(str, "relaxed")) | |
1615 | strict_iomem_checks = 0; | |
1616 | if (strstr(str, "strict")) | |
1617 | strict_iomem_checks = 1; | |
1618 | return 1; | |
1619 | } | |
1620 | ||
1621 | __setup("iomem=", strict_iomem); |