subr_rman.c revision 162224
1139804Simp/*- 240711Swollman * Copyright 1998 Massachusetts Institute of Technology 340711Swollman * 440711Swollman * Permission to use, copy, modify, and distribute this software and 540711Swollman * its documentation for any purpose and without fee is hereby 640711Swollman * granted, provided that both the above copyright notice and this 740711Swollman * permission notice appear in all copies, that both the above 840711Swollman * copyright notice and this permission notice appear in all 940711Swollman * supporting documentation, and that the name of M.I.T. not be used 1040711Swollman * in advertising or publicity pertaining to distribution of the 1140711Swollman * software without specific, written prior permission. M.I.T. makes 1240711Swollman * no representations about the suitability of this software for any 1340711Swollman * purpose. It is provided "as is" without express or implied 1440711Swollman * warranty. 15152543Syongari * 1640711Swollman * THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''. M.I.T. DISCLAIMS 1740711Swollman * ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE, 1840711Swollman * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 1940711Swollman * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT 2040711Swollman * SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2140711Swollman * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2240711Swollman * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF 2340711Swollman * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 2440711Swollman * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 2540711Swollman * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 2640711Swollman * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2740711Swollman * SUCH DAMAGE. 2840711Swollman */ 2940711Swollman 3040711Swollman/* 3140711Swollman * The kernel resource manager. This code is responsible for keeping track 3240711Swollman * of hardware resources which are apportioned out to various drivers. 3340711Swollman * It does not actually assign those resources, and it is not expected 3440711Swollman * that end-device drivers will call into this code directly. Rather, 3540711Swollman * the code which implements the buses that those devices are attached to, 3640711Swollman * and the code which manages CPU resources, will call this code, and the 3740711Swollman * end-device drivers will make upcalls to that code to actually perform 3840711Swollman * the allocation. 3940711Swollman * 4040711Swollman * There are two sorts of resources managed by this code. The first is 4140711Swollman * the more familiar array (RMAN_ARRAY) type; resources in this class 4240711Swollman * consist of a sequence of individually-allocatable objects which have 4340711Swollman * been numbered in some well-defined order. Most of the resources 4440711Swollman * are of this type, as it is the most familiar. The second type is 4540711Swollman * called a gauge (RMAN_GAUGE), and models fungible resources (i.e., 4640711Swollman * resources in which each instance is indistinguishable from every 4740711Swollman * other instance). The principal anticipated application of gauges 4840711Swollman * is in the context of power consumption, where a bus may have a specific 4940711Swollman * power budget which all attached devices share. RMAN_GAUGE is not 5040711Swollman * implemented yet. 5140711Swollman * 5240711Swollman * For array resources, we make one simplifying assumption: two clients 5340711Swollman * sharing the same resource must use the same range of indices. That 5440711Swollman * is to say, sharing of overlapping-but-not-identical regions is not 5540711Swollman * permitted. 5640711Swollman */ 5740711Swollman 58116182Sobrien#include <sys/cdefs.h> 59116182Sobrien__FBSDID("$FreeBSD: head/sys/kern/subr_rman.c 162224 2006-09-11 19:31:52Z jhb $"); 60116182Sobrien 6140711Swollman#include <sys/param.h> 6240711Swollman#include <sys/systm.h> 6341304Sbde#include <sys/kernel.h> 6440711Swollman#include <sys/lock.h> 6540711Swollman#include <sys/malloc.h> 6671576Sjasone#include <sys/mutex.h> 6745720Speter#include <sys/bus.h> /* XXX debugging */ 6845720Speter#include <machine/bus.h> 6940711Swollman#include <sys/rman.h> 70102962Siwasaki#include <sys/sysctl.h> 7140711Swollman 72151037Sphk/* 73151037Sphk * We use a linked list rather than a bitmap because we need to be able to 74151037Sphk * represent potentially huge objects (like all of a processor's physical 75151037Sphk * address space). That is also why the indices are defined to have type 76151037Sphk * `unsigned long' -- that being the largest integral type in ISO C (1990). 77151037Sphk * The 1999 version of C allows `long long'; we may need to switch to that 78151037Sphk * at some point in the future, particularly if we want to support 36-bit 79151037Sphk * addresses on IA32 hardware. 80151037Sphk */ 81151037Sphkstruct resource_i { 82151037Sphk struct resource r_r; 83151037Sphk TAILQ_ENTRY(resource_i) r_link; 84151037Sphk LIST_ENTRY(resource_i) r_sharelink; 85151037Sphk LIST_HEAD(, resource_i) *r_sharehead; 86151037Sphk u_long r_start; /* index of the first entry in this resource */ 87151037Sphk u_long r_end; /* index of the last entry (inclusive) */ 88151037Sphk u_int r_flags; 89151037Sphk void *r_virtual; /* virtual address of this resource */ 90151037Sphk struct device *r_dev; /* device which has allocated this resource */ 91151037Sphk struct rman *r_rm; /* resource manager from whence this came */ 92151037Sphk int r_rid; /* optional rid for this resource. */ 93151037Sphk}; 94151037Sphk 95102962Siwasakiint rman_debug = 0; 96102962SiwasakiTUNABLE_INT("debug.rman_debug", &rman_debug); 97102962SiwasakiSYSCTL_INT(_debug, OID_AUTO, rman_debug, CTLFLAG_RW, 98102962Siwasaki &rman_debug, 0, "rman debug"); 9959910Spaul 100102962Siwasaki#define DPRINTF(params) if (rman_debug) printf params 101102962Siwasaki 10245569Seivindstatic MALLOC_DEFINE(M_RMAN, "rman", "Resource manager"); 10340711Swollman 10440711Swollmanstruct rman_head rman_head; 10571576Sjasonestatic struct mtx rman_mtx; /* mutex to protect rman_head */ 106150523Sphkstatic int int_rman_activate_resource(struct rman *rm, struct resource_i *r, 107150523Sphk struct resource_i **whohas); 108150523Sphkstatic int int_rman_deactivate_resource(struct resource_i *r); 109150523Sphkstatic int int_rman_release_resource(struct rman *rm, struct resource_i *r); 11040711Swollman 111150523Sphkstatic __inline struct resource_i * 112150523Sphkint_alloc_resource(int malloc_flag) 113150523Sphk{ 114150523Sphk struct resource_i *r; 115150523Sphk 116150523Sphk r = malloc(sizeof *r, M_RMAN, malloc_flag | M_ZERO); 117150523Sphk if (r != NULL) { 118150523Sphk r->r_r.__r_i = r; 119150523Sphk } 120150523Sphk return (r); 121150523Sphk} 122150523Sphk 12340711Swollmanint 12440711Swollmanrman_init(struct rman *rm) 12540711Swollman{ 126152543Syongari static int once = 0; 12740711Swollman 12840711Swollman if (once == 0) { 12940711Swollman once = 1; 13040711Swollman TAILQ_INIT(&rman_head); 13193818Sjhb mtx_init(&rman_mtx, "rman head", NULL, MTX_DEF); 13240711Swollman } 13340711Swollman 13440711Swollman if (rm->rm_type == RMAN_UNINIT) 13540711Swollman panic("rman_init"); 13640711Swollman if (rm->rm_type == RMAN_GAUGE) 13740711Swollman panic("implement RMAN_GAUGE"); 13840711Swollman 13968727Smckusick TAILQ_INIT(&rm->rm_list); 14084781Sjhb rm->rm_mtx = malloc(sizeof *rm->rm_mtx, M_RMAN, M_NOWAIT | M_ZERO); 141152543Syongari if (rm->rm_mtx == NULL) 14240711Swollman return ENOMEM; 14393818Sjhb mtx_init(rm->rm_mtx, "rman", NULL, MTX_DEF); 14440711Swollman 14572200Sbmilekic mtx_lock(&rman_mtx); 14640711Swollman TAILQ_INSERT_TAIL(&rman_head, rm, rm_link); 14772200Sbmilekic mtx_unlock(&rman_mtx); 14840711Swollman return 0; 14940711Swollman} 15040711Swollman 15140711Swollman/* 15240711Swollman * NB: this interface is not robust against programming errors which 15340711Swollman * add multiple copies of the same region. 15440711Swollman */ 15540711Swollmanint 15640711Swollmanrman_manage_region(struct rman *rm, u_long start, u_long end) 15740711Swollman{ 158162224Sjhb struct resource_i *r, *s, *t; 15940711Swollman 160134040Snjl DPRINTF(("rman_manage_region: <%s> request: start %#lx, end %#lx\n", 161134021Snjl rm->rm_descr, start, end)); 162150523Sphk r = int_alloc_resource(M_NOWAIT); 163152543Syongari if (r == NULL) 16440711Swollman return ENOMEM; 16540711Swollman r->r_start = start; 16640711Swollman r->r_end = end; 16740711Swollman r->r_rm = rm; 16840711Swollman 16972200Sbmilekic mtx_lock(rm->rm_mtx); 170162224Sjhb 171162224Sjhb /* Skip entries before us. */ 172152543Syongari for (s = TAILQ_FIRST(&rm->rm_list); 173162224Sjhb s && s->r_end + 1 < r->r_start; 17468727Smckusick s = TAILQ_NEXT(s, r_link)) 17540711Swollman ; 17640711Swollman 177162224Sjhb /* If we ran off the end of the list, insert at the tail. */ 17868727Smckusick if (s == NULL) { 17968727Smckusick TAILQ_INSERT_TAIL(&rm->rm_list, r, r_link); 18040711Swollman } else { 181162224Sjhb /* Check for any overlap with the current region. */ 182162224Sjhb if (r->r_start <= s->r_end && r->r_end >= s->r_start) 183162224Sjhb return EBUSY; 184162224Sjhb 185162224Sjhb /* Check for any overlap with the next region. */ 186162224Sjhb t = TAILQ_NEXT(s, r_link); 187162224Sjhb if (t && r->r_start <= t->r_end && r->r_end >= t->r_start) 188162224Sjhb return EBUSY; 189162224Sjhb 190162224Sjhb /* 191162224Sjhb * See if this region can be merged with the next region. If 192162224Sjhb * not, clear the pointer. 193162224Sjhb */ 194162224Sjhb if (t && (r->r_end + 1 != t->r_start || t->r_flags != 0)) 195162224Sjhb t = NULL; 196162224Sjhb 197162224Sjhb /* See if we can merge with the current region. */ 198162224Sjhb if (s->r_end + 1 == r->r_start && s->r_flags == 0) { 199162224Sjhb /* Can we merge all 3 regions? */ 200162224Sjhb if (t != NULL) { 201162224Sjhb s->r_end = t->r_end; 202162224Sjhb TAILQ_REMOVE(&rm->rm_list, t, r_link); 203162224Sjhb free(r, M_RMAN); 204162224Sjhb free(t, M_RMAN); 205162224Sjhb } else { 206162224Sjhb s->r_end = r->r_end; 207162224Sjhb free(r, M_RMAN); 208162224Sjhb } 209162224Sjhb } else { 210162224Sjhb /* Can we merge with just the next region? */ 211162224Sjhb if (t != NULL) { 212162224Sjhb t->r_start = r->r_start; 213162224Sjhb free(r, M_RMAN); 214162224Sjhb } else 215162224Sjhb TAILQ_INSERT_BEFORE(s, r, r_link); 216162224Sjhb } 21740711Swollman } 21840711Swollman 21972200Sbmilekic mtx_unlock(rm->rm_mtx); 22040711Swollman return 0; 22140711Swollman} 22240711Swollman 22340711Swollmanint 224159536Simprman_init_from_resource(struct rman *rm, struct resource *r) 225159536Simp{ 226159536Simp int rv; 227159536Simp 228159536Simp if ((rv = rman_init(rm)) != 0) 229159536Simp return (rv); 230159536Simp return (rman_manage_region(rm, r->__r_i->r_start, r->__r_i->r_end)); 231159536Simp} 232159536Simp 233159536Simpint 23440711Swollmanrman_fini(struct rman *rm) 23540711Swollman{ 236150523Sphk struct resource_i *r; 23740711Swollman 23872200Sbmilekic mtx_lock(rm->rm_mtx); 23968727Smckusick TAILQ_FOREACH(r, &rm->rm_list, r_link) { 24045720Speter if (r->r_flags & RF_ALLOCATED) { 24172200Sbmilekic mtx_unlock(rm->rm_mtx); 24240711Swollman return EBUSY; 24345720Speter } 24440711Swollman } 24540711Swollman 24640711Swollman /* 24740711Swollman * There really should only be one of these if we are in this 24840711Swollman * state and the code is working properly, but it can't hurt. 24940711Swollman */ 25068727Smckusick while (!TAILQ_EMPTY(&rm->rm_list)) { 25168727Smckusick r = TAILQ_FIRST(&rm->rm_list); 25268727Smckusick TAILQ_REMOVE(&rm->rm_list, r, r_link); 25340711Swollman free(r, M_RMAN); 25440711Swollman } 25572200Sbmilekic mtx_unlock(rm->rm_mtx); 25672200Sbmilekic mtx_lock(&rman_mtx); 25740711Swollman TAILQ_REMOVE(&rman_head, rm, rm_link); 25872200Sbmilekic mtx_unlock(&rman_mtx); 25971576Sjasone mtx_destroy(rm->rm_mtx); 26071576Sjasone free(rm->rm_mtx, M_RMAN); 26140711Swollman 26240711Swollman return 0; 26340711Swollman} 26440711Swollman 26540711Swollmanstruct resource * 26688372Stmmrman_reserve_resource_bound(struct rman *rm, u_long start, u_long end, 26788372Stmm u_long count, u_long bound, u_int flags, 26888372Stmm struct device *dev) 26940711Swollman{ 27040711Swollman u_int want_activate; 271150523Sphk struct resource_i *r, *s, *rv; 27288372Stmm u_long rstart, rend, amask, bmask; 27340711Swollman 274152543Syongari rv = NULL; 27540711Swollman 276160958Sjb DPRINTF(("rman_reserve_resource_bound: <%s> request: [%#lx, %#lx], " 277160958Sjb "length %#lx, flags %u, device %s\n", rm->rm_descr, start, end, 278160958Sjb count, flags, 279160958Sjb dev == NULL ? "<null>" : device_get_nameunit(dev))); 28040711Swollman want_activate = (flags & RF_ACTIVE); 28140711Swollman flags &= ~RF_ACTIVE; 28240711Swollman 28372200Sbmilekic mtx_lock(rm->rm_mtx); 28440711Swollman 285152543Syongari for (r = TAILQ_FIRST(&rm->rm_list); 28668727Smckusick r && r->r_end < start; 28768727Smckusick r = TAILQ_NEXT(r, r_link)) 28840711Swollman ; 28940711Swollman 29068727Smckusick if (r == NULL) { 29159910Spaul DPRINTF(("could not find a region\n")); 29240711Swollman goto out; 29340711Swollman } 29440711Swollman 29588372Stmm amask = (1ul << RF_ALIGNMENT(flags)) - 1; 29688372Stmm /* If bound is 0, bmask will also be 0 */ 29788372Stmm bmask = ~(bound - 1); 29840711Swollman /* 29940711Swollman * First try to find an acceptable totally-unshared region. 30040711Swollman */ 30168727Smckusick for (s = r; s; s = TAILQ_NEXT(s, r_link)) { 30259910Spaul DPRINTF(("considering [%#lx, %#lx]\n", s->r_start, s->r_end)); 303143665Simp if (s->r_start + count - 1 > end) { 304143665Simp DPRINTF(("s->r_start (%#lx) + count - 1> end (%#lx)\n", 305143665Simp s->r_start, end)); 30640711Swollman break; 30740711Swollman } 30840711Swollman if (s->r_flags & RF_ALLOCATED) { 30959910Spaul DPRINTF(("region is allocated\n")); 31040711Swollman continue; 31140711Swollman } 31288372Stmm rstart = ulmax(s->r_start, start); 31388372Stmm /* 31488372Stmm * Try to find a region by adjusting to boundary and alignment 31588372Stmm * until both conditions are satisfied. This is not an optimal 31688372Stmm * algorithm, but in most cases it isn't really bad, either. 31788372Stmm */ 31888372Stmm do { 31988372Stmm rstart = (rstart + amask) & ~amask; 320109646Stmm if (((rstart ^ (rstart + count - 1)) & bmask) != 0) 32188372Stmm rstart += bound - (rstart & ~bmask); 32288372Stmm } while ((rstart & amask) != 0 && rstart < end && 32388372Stmm rstart < s->r_end); 324128172Simp rend = ulmin(s->r_end, ulmax(rstart + count - 1, end)); 325102572Siwasaki if (rstart > rend) { 326102572Siwasaki DPRINTF(("adjusted start exceeds end\n")); 327102572Siwasaki continue; 328102572Siwasaki } 32959910Spaul DPRINTF(("truncated region: [%#lx, %#lx]; size %#lx (requested %#lx)\n", 33059910Spaul rstart, rend, (rend - rstart + 1), count)); 33140711Swollman 33240711Swollman if ((rend - rstart + 1) >= count) { 33359910Spaul DPRINTF(("candidate region: [%#lx, %#lx], size %#lx\n", 334143664Simp rstart, rend, (rend - rstart + 1))); 33540711Swollman if ((s->r_end - s->r_start + 1) == count) { 33659910Spaul DPRINTF(("candidate region is entire chunk\n")); 33740711Swollman rv = s; 33848235Sdfr rv->r_flags |= RF_ALLOCATED | flags; 33940711Swollman rv->r_dev = dev; 34040711Swollman goto out; 34140711Swollman } 34240711Swollman 34340711Swollman /* 34440711Swollman * If s->r_start < rstart and 34540711Swollman * s->r_end > rstart + count - 1, then 34640711Swollman * we need to split the region into three pieces 34740711Swollman * (the middle one will get returned to the user). 34840711Swollman * Otherwise, we are allocating at either the 34940711Swollman * beginning or the end of s, so we only need to 35040711Swollman * split it in two. The first case requires 35140711Swollman * two new allocations; the second requires but one. 35240711Swollman */ 353150523Sphk rv = int_alloc_resource(M_NOWAIT); 354152543Syongari if (rv == NULL) 35540711Swollman goto out; 35640711Swollman rv->r_start = rstart; 35740711Swollman rv->r_end = rstart + count - 1; 35840711Swollman rv->r_flags = flags | RF_ALLOCATED; 35940711Swollman rv->r_dev = dev; 36045720Speter rv->r_rm = rm; 361152543Syongari 36240711Swollman if (s->r_start < rv->r_start && s->r_end > rv->r_end) { 36359910Spaul DPRINTF(("splitting region in three parts: " 36440711Swollman "[%#lx, %#lx]; [%#lx, %#lx]; [%#lx, %#lx]\n", 36540711Swollman s->r_start, rv->r_start - 1, 36640711Swollman rv->r_start, rv->r_end, 36759910Spaul rv->r_end + 1, s->r_end)); 36840711Swollman /* 36940711Swollman * We are allocating in the middle. 37040711Swollman */ 371150523Sphk r = int_alloc_resource(M_NOWAIT); 372152543Syongari if (r == NULL) { 37340711Swollman free(rv, M_RMAN); 374152543Syongari rv = NULL; 37540711Swollman goto out; 37640711Swollman } 37740711Swollman r->r_start = rv->r_end + 1; 37840711Swollman r->r_end = s->r_end; 37940711Swollman r->r_flags = s->r_flags; 38045720Speter r->r_rm = rm; 38140711Swollman s->r_end = rv->r_start - 1; 38268727Smckusick TAILQ_INSERT_AFTER(&rm->rm_list, s, rv, 38340711Swollman r_link); 38468727Smckusick TAILQ_INSERT_AFTER(&rm->rm_list, rv, r, 38540711Swollman r_link); 38640711Swollman } else if (s->r_start == rv->r_start) { 38759910Spaul DPRINTF(("allocating from the beginning\n")); 38840711Swollman /* 38940711Swollman * We are allocating at the beginning. 39040711Swollman */ 39140711Swollman s->r_start = rv->r_end + 1; 39268727Smckusick TAILQ_INSERT_BEFORE(s, rv, r_link); 39340711Swollman } else { 39459910Spaul DPRINTF(("allocating at the end\n")); 39540711Swollman /* 39640711Swollman * We are allocating at the end. 39740711Swollman */ 39840711Swollman s->r_end = rv->r_start - 1; 39968727Smckusick TAILQ_INSERT_AFTER(&rm->rm_list, s, rv, 40040711Swollman r_link); 40140711Swollman } 40240711Swollman goto out; 40340711Swollman } 40440711Swollman } 40540711Swollman 40640711Swollman /* 40740711Swollman * Now find an acceptable shared region, if the client's requirements 40840711Swollman * allow sharing. By our implementation restriction, a candidate 40940711Swollman * region must match exactly by both size and sharing type in order 41040711Swollman * to be considered compatible with the client's request. (The 41140711Swollman * former restriction could probably be lifted without too much 41240711Swollman * additional work, but this does not seem warranted.) 41340711Swollman */ 41459910Spaul DPRINTF(("no unshared regions found\n")); 41540711Swollman if ((flags & (RF_SHAREABLE | RF_TIMESHARE)) == 0) 41640711Swollman goto out; 41740711Swollman 41868727Smckusick for (s = r; s; s = TAILQ_NEXT(s, r_link)) { 41940711Swollman if (s->r_start > end) 42040711Swollman break; 42140711Swollman if ((s->r_flags & flags) != flags) 42240711Swollman continue; 42388372Stmm rstart = ulmax(s->r_start, start); 424128172Simp rend = ulmin(s->r_end, ulmax(start + count - 1, end)); 42540711Swollman if (s->r_start >= start && s->r_end <= end 42688372Stmm && (s->r_end - s->r_start + 1) == count && 42788372Stmm (s->r_start & amask) == 0 && 42888372Stmm ((s->r_start ^ s->r_end) & bmask) == 0) { 429150523Sphk rv = int_alloc_resource(M_NOWAIT); 430152543Syongari if (rv == NULL) 43140711Swollman goto out; 43240711Swollman rv->r_start = s->r_start; 43340711Swollman rv->r_end = s->r_end; 434152543Syongari rv->r_flags = s->r_flags & 43540711Swollman (RF_ALLOCATED | RF_SHAREABLE | RF_TIMESHARE); 43640711Swollman rv->r_dev = dev; 43740711Swollman rv->r_rm = rm; 438152543Syongari if (s->r_sharehead == NULL) { 43940711Swollman s->r_sharehead = malloc(sizeof *s->r_sharehead, 44069781Sdwmalone M_RMAN, M_NOWAIT | M_ZERO); 441152543Syongari if (s->r_sharehead == NULL) { 44240711Swollman free(rv, M_RMAN); 443152543Syongari rv = NULL; 44440711Swollman goto out; 44540711Swollman } 44640711Swollman LIST_INIT(s->r_sharehead); 447152543Syongari LIST_INSERT_HEAD(s->r_sharehead, s, 44840711Swollman r_sharelink); 44945106Sdfr s->r_flags |= RF_FIRSTSHARE; 45040711Swollman } 45140711Swollman rv->r_sharehead = s->r_sharehead; 45240711Swollman LIST_INSERT_HEAD(s->r_sharehead, rv, r_sharelink); 45340711Swollman goto out; 45440711Swollman } 45540711Swollman } 45640711Swollman 45740711Swollman /* 45840711Swollman * We couldn't find anything. 45940711Swollman */ 46040711Swollmanout: 46140711Swollman /* 46240711Swollman * If the user specified RF_ACTIVE in the initial flags, 46340711Swollman * which is reflected in `want_activate', we attempt to atomically 46440711Swollman * activate the resource. If this fails, we release the resource 46540711Swollman * and indicate overall failure. (This behavior probably doesn't 46640711Swollman * make sense for RF_TIMESHARE-type resources.) 46740711Swollman */ 46840711Swollman if (rv && want_activate) { 469150523Sphk struct resource_i *whohas; 47040711Swollman if (int_rman_activate_resource(rm, rv, &whohas)) { 47140711Swollman int_rman_release_resource(rm, rv); 472152543Syongari rv = NULL; 47340711Swollman } 47440711Swollman } 475152543Syongari 47672200Sbmilekic mtx_unlock(rm->rm_mtx); 477152543Syongari return (rv == NULL ? NULL : &rv->r_r); 47840711Swollman} 47940711Swollman 48088372Stmmstruct resource * 48188372Stmmrman_reserve_resource(struct rman *rm, u_long start, u_long end, u_long count, 48288372Stmm u_int flags, struct device *dev) 48388372Stmm{ 48488372Stmm 48588372Stmm return (rman_reserve_resource_bound(rm, start, end, count, 0, flags, 48688372Stmm dev)); 48788372Stmm} 48888372Stmm 48940711Swollmanstatic int 490150523Sphkint_rman_activate_resource(struct rman *rm, struct resource_i *r, 491150523Sphk struct resource_i **whohas) 49240711Swollman{ 493150523Sphk struct resource_i *s; 49440711Swollman int ok; 49540711Swollman 49640711Swollman /* 49740711Swollman * If we are not timesharing, then there is nothing much to do. 49840711Swollman * If we already have the resource, then there is nothing at all to do. 49940711Swollman * If we are not on a sharing list with anybody else, then there is 50040711Swollman * little to do. 50140711Swollman */ 50240711Swollman if ((r->r_flags & RF_TIMESHARE) == 0 50340711Swollman || (r->r_flags & RF_ACTIVE) != 0 504152543Syongari || r->r_sharehead == NULL) { 50540711Swollman r->r_flags |= RF_ACTIVE; 50640711Swollman return 0; 50740711Swollman } 50840711Swollman 50940711Swollman ok = 1; 51053225Sphk for (s = LIST_FIRST(r->r_sharehead); s && ok; 51153225Sphk s = LIST_NEXT(s, r_sharelink)) { 51240711Swollman if ((s->r_flags & RF_ACTIVE) != 0) { 51340711Swollman ok = 0; 51440711Swollman *whohas = s; 51540711Swollman } 51640711Swollman } 51740711Swollman if (ok) { 51840711Swollman r->r_flags |= RF_ACTIVE; 51940711Swollman return 0; 52040711Swollman } 52140711Swollman return EBUSY; 52240711Swollman} 52340711Swollman 52440711Swollmanint 525150523Sphkrman_activate_resource(struct resource *re) 52640711Swollman{ 52740711Swollman int rv; 528150523Sphk struct resource_i *r, *whohas; 52940711Swollman struct rman *rm; 53040711Swollman 531150523Sphk r = re->__r_i; 53240711Swollman rm = r->r_rm; 53372200Sbmilekic mtx_lock(rm->rm_mtx); 53440711Swollman rv = int_rman_activate_resource(rm, r, &whohas); 53572200Sbmilekic mtx_unlock(rm->rm_mtx); 53640711Swollman return rv; 53740711Swollman} 53840711Swollman 53940711Swollmanint 540150523Sphkrman_await_resource(struct resource *re, int pri, int timo) 54140711Swollman{ 54285519Sjhb int rv; 543150523Sphk struct resource_i *r, *whohas; 54440711Swollman struct rman *rm; 54540711Swollman 546150523Sphk r = re->__r_i; 54740711Swollman rm = r->r_rm; 54885519Sjhb mtx_lock(rm->rm_mtx); 54940711Swollman for (;;) { 55040711Swollman rv = int_rman_activate_resource(rm, r, &whohas); 55140711Swollman if (rv != EBUSY) 55271576Sjasone return (rv); /* returns with mutex held */ 55340711Swollman 554152543Syongari if (r->r_sharehead == NULL) 55540711Swollman panic("rman_await_resource"); 55640711Swollman whohas->r_flags |= RF_WANTED; 55785519Sjhb rv = msleep(r->r_sharehead, rm->rm_mtx, pri, "rmwait", timo); 55840711Swollman if (rv) { 55985519Sjhb mtx_unlock(rm->rm_mtx); 56085519Sjhb return (rv); 56140711Swollman } 56240711Swollman } 56340711Swollman} 56440711Swollman 56545720Speterstatic int 566150523Sphkint_rman_deactivate_resource(struct resource_i *r) 56740711Swollman{ 56840711Swollman 56940711Swollman r->r_flags &= ~RF_ACTIVE; 57040711Swollman if (r->r_flags & RF_WANTED) { 57140711Swollman r->r_flags &= ~RF_WANTED; 57240711Swollman wakeup(r->r_sharehead); 57340711Swollman } 57445720Speter return 0; 57545720Speter} 57645720Speter 57745720Speterint 57845720Speterrman_deactivate_resource(struct resource *r) 57945720Speter{ 58045720Speter struct rman *rm; 58145720Speter 582150523Sphk rm = r->__r_i->r_rm; 58372200Sbmilekic mtx_lock(rm->rm_mtx); 584150523Sphk int_rman_deactivate_resource(r->__r_i); 58572200Sbmilekic mtx_unlock(rm->rm_mtx); 58640711Swollman return 0; 58740711Swollman} 58840711Swollman 58940711Swollmanstatic int 590150523Sphkint_rman_release_resource(struct rman *rm, struct resource_i *r) 59140711Swollman{ 592150523Sphk struct resource_i *s, *t; 59340711Swollman 59440711Swollman if (r->r_flags & RF_ACTIVE) 59545720Speter int_rman_deactivate_resource(r); 59640711Swollman 59740711Swollman /* 59840711Swollman * Check for a sharing list first. If there is one, then we don't 59940711Swollman * have to think as hard. 60040711Swollman */ 60140711Swollman if (r->r_sharehead) { 60240711Swollman /* 60340711Swollman * If a sharing list exists, then we know there are at 60440711Swollman * least two sharers. 60540711Swollman * 60640711Swollman * If we are in the main circleq, appoint someone else. 60740711Swollman */ 60840711Swollman LIST_REMOVE(r, r_sharelink); 60953225Sphk s = LIST_FIRST(r->r_sharehead); 61040711Swollman if (r->r_flags & RF_FIRSTSHARE) { 61140711Swollman s->r_flags |= RF_FIRSTSHARE; 61268727Smckusick TAILQ_INSERT_BEFORE(r, s, r_link); 61368727Smckusick TAILQ_REMOVE(&rm->rm_list, r, r_link); 61440711Swollman } 61540711Swollman 61640711Swollman /* 61740711Swollman * Make sure that the sharing list goes away completely 61840711Swollman * if the resource is no longer being shared at all. 61940711Swollman */ 620152543Syongari if (LIST_NEXT(s, r_sharelink) == NULL) { 62140711Swollman free(s->r_sharehead, M_RMAN); 622152543Syongari s->r_sharehead = NULL; 62340711Swollman s->r_flags &= ~RF_FIRSTSHARE; 62440711Swollman } 62540711Swollman goto out; 62640711Swollman } 62740711Swollman 62840711Swollman /* 62940711Swollman * Look at the adjacent resources in the list and see if our 630133177Sjhb * segment can be merged with any of them. If either of the 631133177Sjhb * resources is allocated or is not exactly adjacent then they 632133177Sjhb * cannot be merged with our segment. 63340711Swollman */ 63468727Smckusick s = TAILQ_PREV(r, resource_head, r_link); 635133177Sjhb if (s != NULL && ((s->r_flags & RF_ALLOCATED) != 0 || 636133177Sjhb s->r_end + 1 != r->r_start)) 637133177Sjhb s = NULL; 63868727Smckusick t = TAILQ_NEXT(r, r_link); 639133177Sjhb if (t != NULL && ((t->r_flags & RF_ALLOCATED) != 0 || 640133177Sjhb r->r_end + 1 != t->r_start)) 641133177Sjhb t = NULL; 64240711Swollman 643133177Sjhb if (s != NULL && t != NULL) { 64440711Swollman /* 64540711Swollman * Merge all three segments. 64640711Swollman */ 64740711Swollman s->r_end = t->r_end; 64868727Smckusick TAILQ_REMOVE(&rm->rm_list, r, r_link); 64968727Smckusick TAILQ_REMOVE(&rm->rm_list, t, r_link); 65040711Swollman free(t, M_RMAN); 651133177Sjhb } else if (s != NULL) { 65240711Swollman /* 65340711Swollman * Merge previous segment with ours. 65440711Swollman */ 65540711Swollman s->r_end = r->r_end; 65668727Smckusick TAILQ_REMOVE(&rm->rm_list, r, r_link); 657133177Sjhb } else if (t != NULL) { 65840711Swollman /* 65940711Swollman * Merge next segment with ours. 66040711Swollman */ 66140711Swollman t->r_start = r->r_start; 66268727Smckusick TAILQ_REMOVE(&rm->rm_list, r, r_link); 66340711Swollman } else { 66440711Swollman /* 66540711Swollman * At this point, we know there is nothing we 66640711Swollman * can potentially merge with, because on each 66740711Swollman * side, there is either nothing there or what is 66840711Swollman * there is still allocated. In that case, we don't 66940711Swollman * want to remove r from the list; we simply want to 67040711Swollman * change it to an unallocated region and return 67140711Swollman * without freeing anything. 67240711Swollman */ 67340711Swollman r->r_flags &= ~RF_ALLOCATED; 67440711Swollman return 0; 67540711Swollman } 67640711Swollman 67740711Swollmanout: 67840711Swollman free(r, M_RMAN); 67940711Swollman return 0; 68040711Swollman} 68140711Swollman 68240711Swollmanint 683150523Sphkrman_release_resource(struct resource *re) 68440711Swollman{ 68540711Swollman int rv; 686150523Sphk struct resource_i *r; 687150523Sphk struct rman *rm; 68840711Swollman 689150523Sphk r = re->__r_i; 690150523Sphk rm = r->r_rm; 69172200Sbmilekic mtx_lock(rm->rm_mtx); 69240711Swollman rv = int_rman_release_resource(rm, r); 69372200Sbmilekic mtx_unlock(rm->rm_mtx); 69440711Swollman return (rv); 69540711Swollman} 69667261Simp 69767261Simpuint32_t 69867261Simprman_make_alignment_flags(uint32_t size) 69967261Simp{ 70067261Simp int i; 70167261Simp 70267425Simp /* 70367425Simp * Find the hightest bit set, and add one if more than one bit 70467425Simp * set. We're effectively computing the ceil(log2(size)) here. 70567425Simp */ 70688372Stmm for (i = 31; i > 0; i--) 70767425Simp if ((1 << i) & size) 70867425Simp break; 70967425Simp if (~(1 << i) & size) 71067425Simp i++; 71167261Simp 71267261Simp return(RF_ALIGNMENT_LOG2(i)); 71367425Simp} 714107296Simp 715107296Simpu_long 716107296Simprman_get_start(struct resource *r) 717107296Simp{ 718150523Sphk return (r->__r_i->r_start); 719107296Simp} 720107296Simp 721107296Simpu_long 722107296Simprman_get_end(struct resource *r) 723107296Simp{ 724150523Sphk return (r->__r_i->r_end); 725107296Simp} 726107296Simp 727107296Simpu_long 728107296Simprman_get_size(struct resource *r) 729107296Simp{ 730150523Sphk return (r->__r_i->r_end - r->__r_i->r_start + 1); 731107296Simp} 732107296Simp 733107296Simpu_int 734107296Simprman_get_flags(struct resource *r) 735107296Simp{ 736150523Sphk return (r->__r_i->r_flags); 737107296Simp} 738107296Simp 739107296Simpvoid 740107296Simprman_set_virtual(struct resource *r, void *v) 741107296Simp{ 742150523Sphk r->__r_i->r_virtual = v; 743107296Simp} 744107296Simp 745107296Simpvoid * 746107296Simprman_get_virtual(struct resource *r) 747107296Simp{ 748150523Sphk return (r->__r_i->r_virtual); 749107296Simp} 750107296Simp 751107296Simpvoid 752107296Simprman_set_bustag(struct resource *r, bus_space_tag_t t) 753107296Simp{ 754107296Simp r->r_bustag = t; 755107296Simp} 756107296Simp 757107296Simpbus_space_tag_t 758107296Simprman_get_bustag(struct resource *r) 759107296Simp{ 760107296Simp return (r->r_bustag); 761107296Simp} 762107296Simp 763107296Simpvoid 764107296Simprman_set_bushandle(struct resource *r, bus_space_handle_t h) 765107296Simp{ 766107296Simp r->r_bushandle = h; 767107296Simp} 768107296Simp 769107296Simpbus_space_handle_t 770107296Simprman_get_bushandle(struct resource *r) 771107296Simp{ 772107296Simp return (r->r_bushandle); 773107296Simp} 774107296Simp 775107296Simpvoid 776107296Simprman_set_rid(struct resource *r, int rid) 777107296Simp{ 778150523Sphk r->__r_i->r_rid = rid; 779107296Simp} 780107296Simp 781131414Simpvoid 782131414Simprman_set_start(struct resource *r, u_long start) 783131414Simp{ 784150523Sphk r->__r_i->r_start = start; 785131414Simp} 786131414Simp 787131414Simpvoid 788131414Simprman_set_end(struct resource *r, u_long end) 789131414Simp{ 790150523Sphk r->__r_i->r_end = end; 791131414Simp} 792131414Simp 793107296Simpint 794107296Simprman_get_rid(struct resource *r) 795107296Simp{ 796150523Sphk return (r->__r_i->r_rid); 797107296Simp} 798110753Simp 799110753Simpstruct device * 800110753Simprman_get_device(struct resource *r) 801110753Simp{ 802150523Sphk return (r->__r_i->r_dev); 803110753Simp} 804144071Sphk 805144932Simpvoid 806144932Simprman_set_device(struct resource *r, struct device *dev) 807144932Simp{ 808150523Sphk r->__r_i->r_dev = dev; 809144932Simp} 810144932Simp 811150547Sphkint 812150547Sphkrman_is_region_manager(struct resource *r, struct rman *rm) 813150547Sphk{ 814150547Sphk 815150547Sphk return (r->__r_i->r_rm == rm); 816150547Sphk} 817150547Sphk 818144071Sphk/* 819144071Sphk * Sysctl interface for scanning the resource lists. 820144071Sphk * 821144071Sphk * We take two input parameters; the index into the list of resource 822144071Sphk * managers, and the resource offset into the list. 823144071Sphk */ 824144071Sphkstatic int 825144071Sphksysctl_rman(SYSCTL_HANDLER_ARGS) 826144071Sphk{ 827144071Sphk int *name = (int *)arg1; 828144071Sphk u_int namelen = arg2; 829144071Sphk int rman_idx, res_idx; 830144071Sphk struct rman *rm; 831150523Sphk struct resource_i *res; 832144071Sphk struct u_rman urm; 833144071Sphk struct u_resource ures; 834144071Sphk int error; 835144071Sphk 836144071Sphk if (namelen != 3) 837144071Sphk return (EINVAL); 838144071Sphk 839144071Sphk if (bus_data_generation_check(name[0])) 840144071Sphk return (EINVAL); 841144071Sphk rman_idx = name[1]; 842144071Sphk res_idx = name[2]; 843144071Sphk 844144071Sphk /* 845144071Sphk * Find the indexed resource manager 846144071Sphk */ 847152543Syongari mtx_lock(&rman_mtx); 848144071Sphk TAILQ_FOREACH(rm, &rman_head, rm_link) { 849144071Sphk if (rman_idx-- == 0) 850144071Sphk break; 851144071Sphk } 852152543Syongari mtx_unlock(&rman_mtx); 853144071Sphk if (rm == NULL) 854144071Sphk return (ENOENT); 855144071Sphk 856144071Sphk /* 857144071Sphk * If the resource index is -1, we want details on the 858144071Sphk * resource manager. 859144071Sphk */ 860144071Sphk if (res_idx == -1) { 861145953Scperciva bzero(&urm, sizeof(urm)); 862144071Sphk urm.rm_handle = (uintptr_t)rm; 863144071Sphk strlcpy(urm.rm_descr, rm->rm_descr, RM_TEXTLEN); 864144071Sphk urm.rm_start = rm->rm_start; 865144071Sphk urm.rm_size = rm->rm_end - rm->rm_start + 1; 866144071Sphk urm.rm_type = rm->rm_type; 867144071Sphk 868144071Sphk error = SYSCTL_OUT(req, &urm, sizeof(urm)); 869144071Sphk return (error); 870144071Sphk } 871144071Sphk 872144071Sphk /* 873144071Sphk * Find the indexed resource and return it. 874144071Sphk */ 875152543Syongari mtx_lock(rm->rm_mtx); 876144071Sphk TAILQ_FOREACH(res, &rm->rm_list, r_link) { 877144071Sphk if (res_idx-- == 0) { 878145953Scperciva bzero(&ures, sizeof(ures)); 879144071Sphk ures.r_handle = (uintptr_t)res; 880144071Sphk ures.r_parent = (uintptr_t)res->r_rm; 881144071Sphk ures.r_device = (uintptr_t)res->r_dev; 882144071Sphk if (res->r_dev != NULL) { 883144071Sphk if (device_get_name(res->r_dev) != NULL) { 884144071Sphk snprintf(ures.r_devname, RM_TEXTLEN, 885144071Sphk "%s%d", 886144071Sphk device_get_name(res->r_dev), 887144071Sphk device_get_unit(res->r_dev)); 888144071Sphk } else { 889144071Sphk strlcpy(ures.r_devname, "nomatch", 890144071Sphk RM_TEXTLEN); 891144071Sphk } 892144071Sphk } else { 893144071Sphk ures.r_devname[0] = '\0'; 894144071Sphk } 895144071Sphk ures.r_start = res->r_start; 896144071Sphk ures.r_size = res->r_end - res->r_start + 1; 897144071Sphk ures.r_flags = res->r_flags; 898144071Sphk 899152543Syongari mtx_unlock(rm->rm_mtx); 900144071Sphk error = SYSCTL_OUT(req, &ures, sizeof(ures)); 901144071Sphk return (error); 902144071Sphk } 903144071Sphk } 904152543Syongari mtx_unlock(rm->rm_mtx); 905144071Sphk return (ENOENT); 906144071Sphk} 907144071Sphk 908144071SphkSYSCTL_NODE(_hw_bus, OID_AUTO, rman, CTLFLAG_RD, sysctl_rman, 909144071Sphk "kernel resource manager"); 910