1fa9e4066Sahrens /* 2fa9e4066Sahrens * CDDL HEADER START 3fa9e4066Sahrens * 4fa9e4066Sahrens * The contents of this file are subject to the terms of the 5ea8dc4b6Seschrock * Common Development and Distribution License (the "License"). 6ea8dc4b6Seschrock * You may not use this file except in compliance with the License. 7fa9e4066Sahrens * 8fa9e4066Sahrens * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9fa9e4066Sahrens * or http://www.opensolaris.org/os/licensing. 10fa9e4066Sahrens * See the License for the specific language governing permissions 11fa9e4066Sahrens * and limitations under the License. 12fa9e4066Sahrens * 13fa9e4066Sahrens * When distributing Covered Code, include this CDDL HEADER in each 14fa9e4066Sahrens * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15fa9e4066Sahrens * If applicable, add the following below this CDDL HEADER, with the 16fa9e4066Sahrens * fields enclosed by brackets "[]" replaced with your own identifying 17fa9e4066Sahrens * information: Portions Copyright [yyyy] [name of copyright owner] 18fa9e4066Sahrens * 19fa9e4066Sahrens * CDDL HEADER END 20fa9e4066Sahrens */ 21fa9e4066Sahrens /* 22d6e555bdSGeorge Wilson * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 23fa9e4066Sahrens * Use is subject to license terms. 24fa9e4066Sahrens */ 25fb09f5aaSMadhav Suresh /* 26fb09f5aaSMadhav Suresh * Copyright (c) 2012 by Delphix. All rights reserved. 27fb09f5aaSMadhav Suresh */ 28fa9e4066Sahrens 29fa9e4066Sahrens #include <sys/zfs_context.h> 30fa9e4066Sahrens #include <sys/spa.h> 31fa9e4066Sahrens #include <sys/dmu.h> 32ecc2d604Sbonwick #include <sys/zio.h> 33fa9e4066Sahrens #include <sys/space_map.h> 34fa9e4066Sahrens 35*01f55e48SGeorge Wilson static kmem_cache_t *space_seg_cache; 36*01f55e48SGeorge Wilson 37*01f55e48SGeorge Wilson void 38*01f55e48SGeorge Wilson space_map_init(void) 39*01f55e48SGeorge Wilson { 40*01f55e48SGeorge Wilson ASSERT(space_seg_cache == NULL); 41*01f55e48SGeorge Wilson space_seg_cache = kmem_cache_create("space_seg_cache", 42*01f55e48SGeorge Wilson sizeof (space_seg_t), 0, NULL, NULL, NULL, NULL, NULL, 0); 43*01f55e48SGeorge Wilson } 44*01f55e48SGeorge Wilson 45*01f55e48SGeorge Wilson void 46*01f55e48SGeorge Wilson space_map_fini(void) 47*01f55e48SGeorge Wilson { 48*01f55e48SGeorge Wilson kmem_cache_destroy(space_seg_cache); 49*01f55e48SGeorge Wilson space_seg_cache = NULL; 50*01f55e48SGeorge Wilson } 51*01f55e48SGeorge Wilson 52fa9e4066Sahrens /* 53fa9e4066Sahrens * Space map routines. 54fa9e4066Sahrens * NOTE: caller is responsible for all locking. 55fa9e4066Sahrens */ 56fa9e4066Sahrens static int 57fa9e4066Sahrens space_map_seg_compare(const void *x1, const void *x2) 58fa9e4066Sahrens { 59fa9e4066Sahrens const space_seg_t *s1 = x1; 60fa9e4066Sahrens const space_seg_t *s2 = x2; 61fa9e4066Sahrens 62fa9e4066Sahrens if (s1->ss_start < s2->ss_start) { 63fa9e4066Sahrens if (s1->ss_end > s2->ss_start) 64fa9e4066Sahrens return (0); 65fa9e4066Sahrens return (-1); 66fa9e4066Sahrens } 67fa9e4066Sahrens if (s1->ss_start > s2->ss_start) { 68fa9e4066Sahrens if (s1->ss_start < s2->ss_end) 69fa9e4066Sahrens return (0); 70fa9e4066Sahrens return (1); 71fa9e4066Sahrens } 72fa9e4066Sahrens return (0); 73fa9e4066Sahrens } 74fa9e4066Sahrens 75fa9e4066Sahrens void 76ecc2d604Sbonwick space_map_create(space_map_t *sm, uint64_t start, uint64_t size, uint8_t shift, 77fa9e4066Sahrens kmutex_t *lp) 78fa9e4066Sahrens { 79ecc2d604Sbonwick bzero(sm, sizeof (*sm)); 80ecc2d604Sbonwick 81b5e70f97SRicardo M. Correia cv_init(&sm->sm_load_cv, NULL, CV_DEFAULT, NULL); 82b5e70f97SRicardo M. Correia 83fa9e4066Sahrens avl_create(&sm->sm_root, space_map_seg_compare, 84fa9e4066Sahrens sizeof (space_seg_t), offsetof(struct space_seg, ss_node)); 85ecc2d604Sbonwick 86fa9e4066Sahrens sm->sm_start = start; 87fa9e4066Sahrens sm->sm_size = size; 88fa9e4066Sahrens sm->sm_shift = shift; 89fa9e4066Sahrens sm->sm_lock = lp; 90fa9e4066Sahrens } 91fa9e4066Sahrens 92fa9e4066Sahrens void 93fa9e4066Sahrens space_map_destroy(space_map_t *sm) 94fa9e4066Sahrens { 95ecc2d604Sbonwick ASSERT(!sm->sm_loaded && !sm->sm_loading); 96fb09f5aaSMadhav Suresh VERIFY0(sm->sm_space); 97fa9e4066Sahrens avl_destroy(&sm->sm_root); 98b5e70f97SRicardo M. Correia cv_destroy(&sm->sm_load_cv); 99fa9e4066Sahrens } 100fa9e4066Sahrens 101fa9e4066Sahrens void 102fa9e4066Sahrens space_map_add(space_map_t *sm, uint64_t start, uint64_t size) 103fa9e4066Sahrens { 104fa9e4066Sahrens avl_index_t where; 105fa9e4066Sahrens space_seg_t ssearch, *ss_before, *ss_after, *ss; 106fa9e4066Sahrens uint64_t end = start + size; 107fa9e4066Sahrens int merge_before, merge_after; 108fa9e4066Sahrens 109fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 110fa9e4066Sahrens VERIFY(size != 0); 111fa9e4066Sahrens VERIFY3U(start, >=, sm->sm_start); 112ecc2d604Sbonwick VERIFY3U(end, <=, sm->sm_start + sm->sm_size); 113fa9e4066Sahrens VERIFY(sm->sm_space + size <= sm->sm_size); 114fa9e4066Sahrens VERIFY(P2PHASE(start, 1ULL << sm->sm_shift) == 0); 115fa9e4066Sahrens VERIFY(P2PHASE(size, 1ULL << sm->sm_shift) == 0); 116fa9e4066Sahrens 117fa9e4066Sahrens ssearch.ss_start = start; 118fa9e4066Sahrens ssearch.ss_end = end; 119fa9e4066Sahrens ss = avl_find(&sm->sm_root, &ssearch, &where); 120fa9e4066Sahrens 1210125049cSahrens if (ss != NULL && ss->ss_start <= start && ss->ss_end >= end) { 1220125049cSahrens zfs_panic_recover("zfs: allocating allocated segment" 1230125049cSahrens "(offset=%llu size=%llu)\n", 1240125049cSahrens (longlong_t)start, (longlong_t)size); 1250125049cSahrens return; 1260125049cSahrens } 1270125049cSahrens 128fa9e4066Sahrens /* Make sure we don't overlap with either of our neighbors */ 129fa9e4066Sahrens VERIFY(ss == NULL); 130fa9e4066Sahrens 131fa9e4066Sahrens ss_before = avl_nearest(&sm->sm_root, where, AVL_BEFORE); 132fa9e4066Sahrens ss_after = avl_nearest(&sm->sm_root, where, AVL_AFTER); 133fa9e4066Sahrens 134fa9e4066Sahrens merge_before = (ss_before != NULL && ss_before->ss_end == start); 135fa9e4066Sahrens merge_after = (ss_after != NULL && ss_after->ss_start == end); 136fa9e4066Sahrens 137fa9e4066Sahrens if (merge_before && merge_after) { 138fa9e4066Sahrens avl_remove(&sm->sm_root, ss_before); 139d6e555bdSGeorge Wilson if (sm->sm_pp_root) { 140d6e555bdSGeorge Wilson avl_remove(sm->sm_pp_root, ss_before); 141d6e555bdSGeorge Wilson avl_remove(sm->sm_pp_root, ss_after); 142d6e555bdSGeorge Wilson } 143fa9e4066Sahrens ss_after->ss_start = ss_before->ss_start; 144*01f55e48SGeorge Wilson kmem_cache_free(space_seg_cache, ss_before); 145d6e555bdSGeorge Wilson ss = ss_after; 146fa9e4066Sahrens } else if (merge_before) { 147fa9e4066Sahrens ss_before->ss_end = end; 148d6e555bdSGeorge Wilson if (sm->sm_pp_root) 149d6e555bdSGeorge Wilson avl_remove(sm->sm_pp_root, ss_before); 150d6e555bdSGeorge Wilson ss = ss_before; 151fa9e4066Sahrens } else if (merge_after) { 152fa9e4066Sahrens ss_after->ss_start = start; 153d6e555bdSGeorge Wilson if (sm->sm_pp_root) 154d6e555bdSGeorge Wilson avl_remove(sm->sm_pp_root, ss_after); 155d6e555bdSGeorge Wilson ss = ss_after; 156fa9e4066Sahrens } else { 157*01f55e48SGeorge Wilson ss = kmem_cache_alloc(space_seg_cache, KM_SLEEP); 158fa9e4066Sahrens ss->ss_start = start; 159fa9e4066Sahrens ss->ss_end = end; 160fa9e4066Sahrens avl_insert(&sm->sm_root, ss, where); 161fa9e4066Sahrens } 162fa9e4066Sahrens 163d6e555bdSGeorge Wilson if (sm->sm_pp_root) 164d6e555bdSGeorge Wilson avl_add(sm->sm_pp_root, ss); 165d6e555bdSGeorge Wilson 166fa9e4066Sahrens sm->sm_space += size; 167fa9e4066Sahrens } 168fa9e4066Sahrens 169fa9e4066Sahrens void 170fa9e4066Sahrens space_map_remove(space_map_t *sm, uint64_t start, uint64_t size) 171fa9e4066Sahrens { 172fa9e4066Sahrens avl_index_t where; 173fa9e4066Sahrens space_seg_t ssearch, *ss, *newseg; 174fa9e4066Sahrens uint64_t end = start + size; 175fa9e4066Sahrens int left_over, right_over; 176fa9e4066Sahrens 177fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 178fa9e4066Sahrens VERIFY(size != 0); 179fa9e4066Sahrens VERIFY(P2PHASE(start, 1ULL << sm->sm_shift) == 0); 180fa9e4066Sahrens VERIFY(P2PHASE(size, 1ULL << sm->sm_shift) == 0); 181fa9e4066Sahrens 182fa9e4066Sahrens ssearch.ss_start = start; 183fa9e4066Sahrens ssearch.ss_end = end; 184fa9e4066Sahrens ss = avl_find(&sm->sm_root, &ssearch, &where); 185fa9e4066Sahrens 186fa9e4066Sahrens /* Make sure we completely overlap with someone */ 1870125049cSahrens if (ss == NULL) { 1880125049cSahrens zfs_panic_recover("zfs: freeing free segment " 1890125049cSahrens "(offset=%llu size=%llu)", 1900125049cSahrens (longlong_t)start, (longlong_t)size); 1910125049cSahrens return; 1920125049cSahrens } 193fa9e4066Sahrens VERIFY3U(ss->ss_start, <=, start); 194fa9e4066Sahrens VERIFY3U(ss->ss_end, >=, end); 195fa9e4066Sahrens VERIFY(sm->sm_space - size <= sm->sm_size); 196fa9e4066Sahrens 197fa9e4066Sahrens left_over = (ss->ss_start != start); 198fa9e4066Sahrens right_over = (ss->ss_end != end); 199fa9e4066Sahrens 200d6e555bdSGeorge Wilson if (sm->sm_pp_root) 201d6e555bdSGeorge Wilson avl_remove(sm->sm_pp_root, ss); 202d6e555bdSGeorge Wilson 203fa9e4066Sahrens if (left_over && right_over) { 204*01f55e48SGeorge Wilson newseg = kmem_cache_alloc(space_seg_cache, KM_SLEEP); 205fa9e4066Sahrens newseg->ss_start = end; 206fa9e4066Sahrens newseg->ss_end = ss->ss_end; 207fa9e4066Sahrens ss->ss_end = start; 208fa9e4066Sahrens avl_insert_here(&sm->sm_root, newseg, ss, AVL_AFTER); 209d6e555bdSGeorge Wilson if (sm->sm_pp_root) 210d6e555bdSGeorge Wilson avl_add(sm->sm_pp_root, newseg); 211fa9e4066Sahrens } else if (left_over) { 212fa9e4066Sahrens ss->ss_end = start; 213fa9e4066Sahrens } else if (right_over) { 214fa9e4066Sahrens ss->ss_start = end; 215fa9e4066Sahrens } else { 216fa9e4066Sahrens avl_remove(&sm->sm_root, ss); 217*01f55e48SGeorge Wilson kmem_cache_free(space_seg_cache, ss); 218d6e555bdSGeorge Wilson ss = NULL; 219fa9e4066Sahrens } 220fa9e4066Sahrens 221d6e555bdSGeorge Wilson if (sm->sm_pp_root && ss != NULL) 222d6e555bdSGeorge Wilson avl_add(sm->sm_pp_root, ss); 223d6e555bdSGeorge Wilson 224fa9e4066Sahrens sm->sm_space -= size; 225fa9e4066Sahrens } 226fa9e4066Sahrens 2278ad4d6ddSJeff Bonwick boolean_t 228fa9e4066Sahrens space_map_contains(space_map_t *sm, uint64_t start, uint64_t size) 229fa9e4066Sahrens { 230fa9e4066Sahrens avl_index_t where; 231fa9e4066Sahrens space_seg_t ssearch, *ss; 232fa9e4066Sahrens uint64_t end = start + size; 233fa9e4066Sahrens 234fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 235fa9e4066Sahrens VERIFY(size != 0); 236fa9e4066Sahrens VERIFY(P2PHASE(start, 1ULL << sm->sm_shift) == 0); 237fa9e4066Sahrens VERIFY(P2PHASE(size, 1ULL << sm->sm_shift) == 0); 238fa9e4066Sahrens 239fa9e4066Sahrens ssearch.ss_start = start; 240fa9e4066Sahrens ssearch.ss_end = end; 241fa9e4066Sahrens ss = avl_find(&sm->sm_root, &ssearch, &where); 242fa9e4066Sahrens 243fa9e4066Sahrens return (ss != NULL && ss->ss_start <= start && ss->ss_end >= end); 244fa9e4066Sahrens } 245fa9e4066Sahrens 246fa9e4066Sahrens void 247fa9e4066Sahrens space_map_vacate(space_map_t *sm, space_map_func_t *func, space_map_t *mdest) 248fa9e4066Sahrens { 249fa9e4066Sahrens space_seg_t *ss; 250fa9e4066Sahrens void *cookie = NULL; 251fa9e4066Sahrens 252fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 253fa9e4066Sahrens 254fa9e4066Sahrens while ((ss = avl_destroy_nodes(&sm->sm_root, &cookie)) != NULL) { 255fa9e4066Sahrens if (func != NULL) 256fa9e4066Sahrens func(mdest, ss->ss_start, ss->ss_end - ss->ss_start); 257*01f55e48SGeorge Wilson kmem_cache_free(space_seg_cache, ss); 258fa9e4066Sahrens } 259fa9e4066Sahrens sm->sm_space = 0; 260fa9e4066Sahrens } 261fa9e4066Sahrens 262fa9e4066Sahrens void 263ecc2d604Sbonwick space_map_walk(space_map_t *sm, space_map_func_t *func, space_map_t *mdest) 264fa9e4066Sahrens { 265fa9e4066Sahrens space_seg_t *ss; 266fa9e4066Sahrens 267fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 268fa9e4066Sahrens 2698ad4d6ddSJeff Bonwick for (ss = avl_first(&sm->sm_root); ss; ss = AVL_NEXT(&sm->sm_root, ss)) 2708ad4d6ddSJeff Bonwick func(mdest, ss->ss_start, ss->ss_end - ss->ss_start); 271fa9e4066Sahrens } 272fa9e4066Sahrens 273ecc2d604Sbonwick /* 274ecc2d604Sbonwick * Wait for any in-progress space_map_load() to complete. 275ecc2d604Sbonwick */ 276ecc2d604Sbonwick void 277ecc2d604Sbonwick space_map_load_wait(space_map_t *sm) 278ecc2d604Sbonwick { 279ecc2d604Sbonwick ASSERT(MUTEX_HELD(sm->sm_lock)); 280ecc2d604Sbonwick 281b24ab676SJeff Bonwick while (sm->sm_loading) { 282b24ab676SJeff Bonwick ASSERT(!sm->sm_loaded); 283ecc2d604Sbonwick cv_wait(&sm->sm_load_cv, sm->sm_lock); 284b24ab676SJeff Bonwick } 285ecc2d604Sbonwick } 286ecc2d604Sbonwick 287ecc2d604Sbonwick /* 288ecc2d604Sbonwick * Note: space_map_load() will drop sm_lock across dmu_read() calls. 289ecc2d604Sbonwick * The caller must be OK with this. 290ecc2d604Sbonwick */ 291fa9e4066Sahrens int 292ecc2d604Sbonwick space_map_load(space_map_t *sm, space_map_ops_t *ops, uint8_t maptype, 293ecc2d604Sbonwick space_map_obj_t *smo, objset_t *os) 294fa9e4066Sahrens { 295fa9e4066Sahrens uint64_t *entry, *entry_map, *entry_map_end; 2968365e7c9Sbillm uint64_t bufsize, size, offset, end, space; 297fa9e4066Sahrens uint64_t mapstart = sm->sm_start; 2980a4e9518Sgw int error = 0; 299fa9e4066Sahrens 300fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 301468c413aSTim Haley ASSERT(!sm->sm_loaded); 302468c413aSTim Haley ASSERT(!sm->sm_loading); 303ecc2d604Sbonwick 304ecc2d604Sbonwick sm->sm_loading = B_TRUE; 3058365e7c9Sbillm end = smo->smo_objsize; 3068365e7c9Sbillm space = smo->smo_alloc; 307ecc2d604Sbonwick 308ecc2d604Sbonwick ASSERT(sm->sm_ops == NULL); 309fb09f5aaSMadhav Suresh VERIFY0(sm->sm_space); 310fa9e4066Sahrens 311fa9e4066Sahrens if (maptype == SM_FREE) { 312fa9e4066Sahrens space_map_add(sm, sm->sm_start, sm->sm_size); 313fa9e4066Sahrens space = sm->sm_size - space; 314fa9e4066Sahrens } 315fa9e4066Sahrens 316ecc2d604Sbonwick bufsize = 1ULL << SPACE_MAP_BLOCKSHIFT; 317ecc2d604Sbonwick entry_map = zio_buf_alloc(bufsize); 318ecc2d604Sbonwick 319ecc2d604Sbonwick mutex_exit(sm->sm_lock); 320ecc2d604Sbonwick if (end > bufsize) 321ecc2d604Sbonwick dmu_prefetch(os, smo->smo_object, bufsize, end - bufsize); 322ecc2d604Sbonwick mutex_enter(sm->sm_lock); 323ecc2d604Sbonwick 324fa9e4066Sahrens for (offset = 0; offset < end; offset += bufsize) { 325fa9e4066Sahrens size = MIN(end - offset, bufsize); 326fa9e4066Sahrens VERIFY(P2PHASE(size, sizeof (uint64_t)) == 0); 327fa9e4066Sahrens VERIFY(size != 0); 328fa9e4066Sahrens 329fa9e4066Sahrens dprintf("object=%llu offset=%llx size=%llx\n", 330fa9e4066Sahrens smo->smo_object, offset, size); 331ecc2d604Sbonwick 332ecc2d604Sbonwick mutex_exit(sm->sm_lock); 3337bfdf011SNeil Perrin error = dmu_read(os, smo->smo_object, offset, size, entry_map, 3347bfdf011SNeil Perrin DMU_READ_PREFETCH); 335ecc2d604Sbonwick mutex_enter(sm->sm_lock); 3360a4e9518Sgw if (error != 0) 337b8493d5dSvl break; 338fa9e4066Sahrens 339fa9e4066Sahrens entry_map_end = entry_map + (size / sizeof (uint64_t)); 340fa9e4066Sahrens for (entry = entry_map; entry < entry_map_end; entry++) { 341fa9e4066Sahrens uint64_t e = *entry; 342fa9e4066Sahrens 343fa9e4066Sahrens if (SM_DEBUG_DECODE(e)) /* Skip debug entries */ 344fa9e4066Sahrens continue; 345fa9e4066Sahrens 346fa9e4066Sahrens (SM_TYPE_DECODE(e) == maptype ? 347fa9e4066Sahrens space_map_add : space_map_remove)(sm, 348fa9e4066Sahrens (SM_OFFSET_DECODE(e) << sm->sm_shift) + mapstart, 349fa9e4066Sahrens SM_RUN_DECODE(e) << sm->sm_shift); 350fa9e4066Sahrens } 351fa9e4066Sahrens } 352fa9e4066Sahrens 353b8493d5dSvl if (error == 0) { 354b8493d5dSvl VERIFY3U(sm->sm_space, ==, space); 355b8493d5dSvl 356b8493d5dSvl sm->sm_loaded = B_TRUE; 357b8493d5dSvl sm->sm_ops = ops; 358b8493d5dSvl if (ops != NULL) 359b8493d5dSvl ops->smop_load(sm); 360b8493d5dSvl } else { 361b8493d5dSvl space_map_vacate(sm, NULL, NULL); 362b8493d5dSvl } 363b8493d5dSvl 364ecc2d604Sbonwick zio_buf_free(entry_map, bufsize); 365ecc2d604Sbonwick 366ecc2d604Sbonwick sm->sm_loading = B_FALSE; 367ecc2d604Sbonwick 368ecc2d604Sbonwick cv_broadcast(&sm->sm_load_cv); 369ecc2d604Sbonwick 3700a4e9518Sgw return (error); 371fa9e4066Sahrens } 372fa9e4066Sahrens 373fa9e4066Sahrens void 374ecc2d604Sbonwick space_map_unload(space_map_t *sm) 375ecc2d604Sbonwick { 376ecc2d604Sbonwick ASSERT(MUTEX_HELD(sm->sm_lock)); 377ecc2d604Sbonwick 378ecc2d604Sbonwick if (sm->sm_loaded && sm->sm_ops != NULL) 379ecc2d604Sbonwick sm->sm_ops->smop_unload(sm); 380ecc2d604Sbonwick 381ecc2d604Sbonwick sm->sm_loaded = B_FALSE; 382ecc2d604Sbonwick sm->sm_ops = NULL; 383ecc2d604Sbonwick 384ecc2d604Sbonwick space_map_vacate(sm, NULL, NULL); 385ecc2d604Sbonwick } 386ecc2d604Sbonwick 387d6e555bdSGeorge Wilson uint64_t 388d6e555bdSGeorge Wilson space_map_maxsize(space_map_t *sm) 389d6e555bdSGeorge Wilson { 39080eb36f2SGeorge Wilson ASSERT(sm->sm_ops != NULL); 39180eb36f2SGeorge Wilson return (sm->sm_ops->smop_max(sm)); 392d6e555bdSGeorge Wilson } 393d6e555bdSGeorge Wilson 394ecc2d604Sbonwick uint64_t 395ecc2d604Sbonwick space_map_alloc(space_map_t *sm, uint64_t size) 396ecc2d604Sbonwick { 397ecc2d604Sbonwick uint64_t start; 398ecc2d604Sbonwick 399ecc2d604Sbonwick start = sm->sm_ops->smop_alloc(sm, size); 400ecc2d604Sbonwick if (start != -1ULL) 401ecc2d604Sbonwick space_map_remove(sm, start, size); 402ecc2d604Sbonwick return (start); 403ecc2d604Sbonwick } 404ecc2d604Sbonwick 405ecc2d604Sbonwick void 406ecc2d604Sbonwick space_map_claim(space_map_t *sm, uint64_t start, uint64_t size) 407ecc2d604Sbonwick { 408ecc2d604Sbonwick sm->sm_ops->smop_claim(sm, start, size); 409ecc2d604Sbonwick space_map_remove(sm, start, size); 410ecc2d604Sbonwick } 411ecc2d604Sbonwick 412ecc2d604Sbonwick void 413ecc2d604Sbonwick space_map_free(space_map_t *sm, uint64_t start, uint64_t size) 414ecc2d604Sbonwick { 415ecc2d604Sbonwick space_map_add(sm, start, size); 416ecc2d604Sbonwick sm->sm_ops->smop_free(sm, start, size); 417ecc2d604Sbonwick } 418ecc2d604Sbonwick 419ecc2d604Sbonwick /* 420ecc2d604Sbonwick * Note: space_map_sync() will drop sm_lock across dmu_write() calls. 421ecc2d604Sbonwick */ 422ecc2d604Sbonwick void 423ecc2d604Sbonwick space_map_sync(space_map_t *sm, uint8_t maptype, 424ecc2d604Sbonwick space_map_obj_t *smo, objset_t *os, dmu_tx_t *tx) 425fa9e4066Sahrens { 426fa9e4066Sahrens spa_t *spa = dmu_objset_spa(os); 427fa9e4066Sahrens void *cookie = NULL; 428fa9e4066Sahrens space_seg_t *ss; 429*01f55e48SGeorge Wilson uint64_t bufsize, start, size, run_len, delta, sm_space; 430fa9e4066Sahrens uint64_t *entry, *entry_map, *entry_map_end; 431fa9e4066Sahrens 432fa9e4066Sahrens ASSERT(MUTEX_HELD(sm->sm_lock)); 433fa9e4066Sahrens 434fa9e4066Sahrens if (sm->sm_space == 0) 435fa9e4066Sahrens return; 436fa9e4066Sahrens 437fa9e4066Sahrens dprintf("object %4llu, txg %llu, pass %d, %c, count %lu, space %llx\n", 438fa9e4066Sahrens smo->smo_object, dmu_tx_get_txg(tx), spa_sync_pass(spa), 439fa9e4066Sahrens maptype == SM_ALLOC ? 'A' : 'F', avl_numnodes(&sm->sm_root), 440fa9e4066Sahrens sm->sm_space); 441fa9e4066Sahrens 442ecc2d604Sbonwick if (maptype == SM_ALLOC) 443ecc2d604Sbonwick smo->smo_alloc += sm->sm_space; 444ecc2d604Sbonwick else 445ecc2d604Sbonwick smo->smo_alloc -= sm->sm_space; 446ecc2d604Sbonwick 447fa9e4066Sahrens bufsize = (8 + avl_numnodes(&sm->sm_root)) * sizeof (uint64_t); 448ecc2d604Sbonwick bufsize = MIN(bufsize, 1ULL << SPACE_MAP_BLOCKSHIFT); 449ecc2d604Sbonwick entry_map = zio_buf_alloc(bufsize); 450fa9e4066Sahrens entry_map_end = entry_map + (bufsize / sizeof (uint64_t)); 451fa9e4066Sahrens entry = entry_map; 452fa9e4066Sahrens 453fa9e4066Sahrens *entry++ = SM_DEBUG_ENCODE(1) | 454fa9e4066Sahrens SM_DEBUG_ACTION_ENCODE(maptype) | 455fa9e4066Sahrens SM_DEBUG_SYNCPASS_ENCODE(spa_sync_pass(spa)) | 456fa9e4066Sahrens SM_DEBUG_TXG_ENCODE(dmu_tx_get_txg(tx)); 457fa9e4066Sahrens 458*01f55e48SGeorge Wilson delta = 0; 459*01f55e48SGeorge Wilson sm_space = sm->sm_space; 460fa9e4066Sahrens while ((ss = avl_destroy_nodes(&sm->sm_root, &cookie)) != NULL) { 461fa9e4066Sahrens size = ss->ss_end - ss->ss_start; 462fa9e4066Sahrens start = (ss->ss_start - sm->sm_start) >> sm->sm_shift; 463fa9e4066Sahrens 464*01f55e48SGeorge Wilson delta += size; 465fa9e4066Sahrens size >>= sm->sm_shift; 466fa9e4066Sahrens 467fa9e4066Sahrens while (size) { 468fa9e4066Sahrens run_len = MIN(size, SM_RUN_MAX); 469fa9e4066Sahrens 470fa9e4066Sahrens if (entry == entry_map_end) { 471ecc2d604Sbonwick mutex_exit(sm->sm_lock); 472fa9e4066Sahrens dmu_write(os, smo->smo_object, smo->smo_objsize, 473fa9e4066Sahrens bufsize, entry_map, tx); 474ecc2d604Sbonwick mutex_enter(sm->sm_lock); 475fa9e4066Sahrens smo->smo_objsize += bufsize; 476fa9e4066Sahrens entry = entry_map; 477fa9e4066Sahrens } 478fa9e4066Sahrens 479fa9e4066Sahrens *entry++ = SM_OFFSET_ENCODE(start) | 480fa9e4066Sahrens SM_TYPE_ENCODE(maptype) | 481fa9e4066Sahrens SM_RUN_ENCODE(run_len); 482fa9e4066Sahrens 483fa9e4066Sahrens start += run_len; 484fa9e4066Sahrens size -= run_len; 485fa9e4066Sahrens } 486*01f55e48SGeorge Wilson kmem_cache_free(space_seg_cache, ss); 487fa9e4066Sahrens } 488fa9e4066Sahrens 489fa9e4066Sahrens if (entry != entry_map) { 490fa9e4066Sahrens size = (entry - entry_map) * sizeof (uint64_t); 491ecc2d604Sbonwick mutex_exit(sm->sm_lock); 492fa9e4066Sahrens dmu_write(os, smo->smo_object, smo->smo_objsize, 493fa9e4066Sahrens size, entry_map, tx); 494ecc2d604Sbonwick mutex_enter(sm->sm_lock); 495fa9e4066Sahrens smo->smo_objsize += size; 496fa9e4066Sahrens } 497fa9e4066Sahrens 498*01f55e48SGeorge Wilson /* 499*01f55e48SGeorge Wilson * Ensure that the space_map's accounting wasn't changed 500*01f55e48SGeorge Wilson * while we were in the middle of writing it out. 501*01f55e48SGeorge Wilson */ 502*01f55e48SGeorge Wilson VERIFY3U(sm->sm_space, ==, sm_space); 503*01f55e48SGeorge Wilson 504ecc2d604Sbonwick zio_buf_free(entry_map, bufsize); 505fa9e4066Sahrens 506*01f55e48SGeorge Wilson sm->sm_space -= delta; 507fb09f5aaSMadhav Suresh VERIFY0(sm->sm_space); 508fa9e4066Sahrens } 509fa9e4066Sahrens 510fa9e4066Sahrens void 511ecc2d604Sbonwick space_map_truncate(space_map_obj_t *smo, objset_t *os, dmu_tx_t *tx) 512fa9e4066Sahrens { 513ecc2d604Sbonwick VERIFY(dmu_free_range(os, smo->smo_object, 0, -1ULL, tx) == 0); 514fa9e4066Sahrens 515fa9e4066Sahrens smo->smo_objsize = 0; 516ecc2d604Sbonwick smo->smo_alloc = 0; 517fa9e4066Sahrens } 5188ad4d6ddSJeff Bonwick 5198ad4d6ddSJeff Bonwick /* 5208ad4d6ddSJeff Bonwick * Space map reference trees. 5218ad4d6ddSJeff Bonwick * 5228ad4d6ddSJeff Bonwick * A space map is a collection of integers. Every integer is either 5238ad4d6ddSJeff Bonwick * in the map, or it's not. A space map reference tree generalizes 5248ad4d6ddSJeff Bonwick * the idea: it allows its members to have arbitrary reference counts, 5258ad4d6ddSJeff Bonwick * as opposed to the implicit reference count of 0 or 1 in a space map. 5268ad4d6ddSJeff Bonwick * This representation comes in handy when computing the union or 5278ad4d6ddSJeff Bonwick * intersection of multiple space maps. For example, the union of 5288ad4d6ddSJeff Bonwick * N space maps is the subset of the reference tree with refcnt >= 1. 5298ad4d6ddSJeff Bonwick * The intersection of N space maps is the subset with refcnt >= N. 5308ad4d6ddSJeff Bonwick * 5318ad4d6ddSJeff Bonwick * [It's very much like a Fourier transform. Unions and intersections 5328ad4d6ddSJeff Bonwick * are hard to perform in the 'space map domain', so we convert the maps 5338ad4d6ddSJeff Bonwick * into the 'reference count domain', where it's trivial, then invert.] 5348ad4d6ddSJeff Bonwick * 5358ad4d6ddSJeff Bonwick * vdev_dtl_reassess() uses computations of this form to determine 5368ad4d6ddSJeff Bonwick * DTL_MISSING and DTL_OUTAGE for interior vdevs -- e.g. a RAID-Z vdev 5378ad4d6ddSJeff Bonwick * has an outage wherever refcnt >= vdev_nparity + 1, and a mirror vdev 5388ad4d6ddSJeff Bonwick * has an outage wherever refcnt >= vdev_children. 5398ad4d6ddSJeff Bonwick */ 5408ad4d6ddSJeff Bonwick static int 5418ad4d6ddSJeff Bonwick space_map_ref_compare(const void *x1, const void *x2) 5428ad4d6ddSJeff Bonwick { 5438ad4d6ddSJeff Bonwick const space_ref_t *sr1 = x1; 5448ad4d6ddSJeff Bonwick const space_ref_t *sr2 = x2; 5458ad4d6ddSJeff Bonwick 5468ad4d6ddSJeff Bonwick if (sr1->sr_offset < sr2->sr_offset) 5478ad4d6ddSJeff Bonwick return (-1); 5488ad4d6ddSJeff Bonwick if (sr1->sr_offset > sr2->sr_offset) 5498ad4d6ddSJeff Bonwick return (1); 5508ad4d6ddSJeff Bonwick 5518ad4d6ddSJeff Bonwick if (sr1 < sr2) 5528ad4d6ddSJeff Bonwick return (-1); 5538ad4d6ddSJeff Bonwick if (sr1 > sr2) 5548ad4d6ddSJeff Bonwick return (1); 5558ad4d6ddSJeff Bonwick 5568ad4d6ddSJeff Bonwick return (0); 5578ad4d6ddSJeff Bonwick } 5588ad4d6ddSJeff Bonwick 5598ad4d6ddSJeff Bonwick void 5608ad4d6ddSJeff Bonwick space_map_ref_create(avl_tree_t *t) 5618ad4d6ddSJeff Bonwick { 5628ad4d6ddSJeff Bonwick avl_create(t, space_map_ref_compare, 5638ad4d6ddSJeff Bonwick sizeof (space_ref_t), offsetof(space_ref_t, sr_node)); 5648ad4d6ddSJeff Bonwick } 5658ad4d6ddSJeff Bonwick 5668ad4d6ddSJeff Bonwick void 5678ad4d6ddSJeff Bonwick space_map_ref_destroy(avl_tree_t *t) 5688ad4d6ddSJeff Bonwick { 5698ad4d6ddSJeff Bonwick space_ref_t *sr; 5708ad4d6ddSJeff Bonwick void *cookie = NULL; 5718ad4d6ddSJeff Bonwick 5728ad4d6ddSJeff Bonwick while ((sr = avl_destroy_nodes(t, &cookie)) != NULL) 5738ad4d6ddSJeff Bonwick kmem_free(sr, sizeof (*sr)); 5748ad4d6ddSJeff Bonwick 5758ad4d6ddSJeff Bonwick avl_destroy(t); 5768ad4d6ddSJeff Bonwick } 5778ad4d6ddSJeff Bonwick 5788ad4d6ddSJeff Bonwick static void 5798ad4d6ddSJeff Bonwick space_map_ref_add_node(avl_tree_t *t, uint64_t offset, int64_t refcnt) 5808ad4d6ddSJeff Bonwick { 5818ad4d6ddSJeff Bonwick space_ref_t *sr; 5828ad4d6ddSJeff Bonwick 5838ad4d6ddSJeff Bonwick sr = kmem_alloc(sizeof (*sr), KM_SLEEP); 5848ad4d6ddSJeff Bonwick sr->sr_offset = offset; 5858ad4d6ddSJeff Bonwick sr->sr_refcnt = refcnt; 5868ad4d6ddSJeff Bonwick 5878ad4d6ddSJeff Bonwick avl_add(t, sr); 5888ad4d6ddSJeff Bonwick } 5898ad4d6ddSJeff Bonwick 5908ad4d6ddSJeff Bonwick void 5918ad4d6ddSJeff Bonwick space_map_ref_add_seg(avl_tree_t *t, uint64_t start, uint64_t end, 5928ad4d6ddSJeff Bonwick int64_t refcnt) 5938ad4d6ddSJeff Bonwick { 5948ad4d6ddSJeff Bonwick space_map_ref_add_node(t, start, refcnt); 5958ad4d6ddSJeff Bonwick space_map_ref_add_node(t, end, -refcnt); 5968ad4d6ddSJeff Bonwick } 5978ad4d6ddSJeff Bonwick 5988ad4d6ddSJeff Bonwick /* 5998ad4d6ddSJeff Bonwick * Convert (or add) a space map into a reference tree. 6008ad4d6ddSJeff Bonwick */ 6018ad4d6ddSJeff Bonwick void 6028ad4d6ddSJeff Bonwick space_map_ref_add_map(avl_tree_t *t, space_map_t *sm, int64_t refcnt) 6038ad4d6ddSJeff Bonwick { 6048ad4d6ddSJeff Bonwick space_seg_t *ss; 6058ad4d6ddSJeff Bonwick 6068ad4d6ddSJeff Bonwick ASSERT(MUTEX_HELD(sm->sm_lock)); 6078ad4d6ddSJeff Bonwick 6088ad4d6ddSJeff Bonwick for (ss = avl_first(&sm->sm_root); ss; ss = AVL_NEXT(&sm->sm_root, ss)) 6098ad4d6ddSJeff Bonwick space_map_ref_add_seg(t, ss->ss_start, ss->ss_end, refcnt); 6108ad4d6ddSJeff Bonwick } 6118ad4d6ddSJeff Bonwick 6128ad4d6ddSJeff Bonwick /* 6138ad4d6ddSJeff Bonwick * Convert a reference tree into a space map. The space map will contain 6148ad4d6ddSJeff Bonwick * all members of the reference tree for which refcnt >= minref. 6158ad4d6ddSJeff Bonwick */ 6168ad4d6ddSJeff Bonwick void 6178ad4d6ddSJeff Bonwick space_map_ref_generate_map(avl_tree_t *t, space_map_t *sm, int64_t minref) 6188ad4d6ddSJeff Bonwick { 6198ad4d6ddSJeff Bonwick uint64_t start = -1ULL; 6208ad4d6ddSJeff Bonwick int64_t refcnt = 0; 6218ad4d6ddSJeff Bonwick space_ref_t *sr; 6228ad4d6ddSJeff Bonwick 6238ad4d6ddSJeff Bonwick ASSERT(MUTEX_HELD(sm->sm_lock)); 6248ad4d6ddSJeff Bonwick 6258ad4d6ddSJeff Bonwick space_map_vacate(sm, NULL, NULL); 6268ad4d6ddSJeff Bonwick 6278ad4d6ddSJeff Bonwick for (sr = avl_first(t); sr != NULL; sr = AVL_NEXT(t, sr)) { 6288ad4d6ddSJeff Bonwick refcnt += sr->sr_refcnt; 6298ad4d6ddSJeff Bonwick if (refcnt >= minref) { 6308ad4d6ddSJeff Bonwick if (start == -1ULL) { 6318ad4d6ddSJeff Bonwick start = sr->sr_offset; 6328ad4d6ddSJeff Bonwick } 6338ad4d6ddSJeff Bonwick } else { 6348ad4d6ddSJeff Bonwick if (start != -1ULL) { 6358ad4d6ddSJeff Bonwick uint64_t end = sr->sr_offset; 6368ad4d6ddSJeff Bonwick ASSERT(start <= end); 6378ad4d6ddSJeff Bonwick if (end > start) 6388ad4d6ddSJeff Bonwick space_map_add(sm, start, end - start); 6398ad4d6ddSJeff Bonwick start = -1ULL; 6408ad4d6ddSJeff Bonwick } 6418ad4d6ddSJeff Bonwick } 6428ad4d6ddSJeff Bonwick } 6438ad4d6ddSJeff Bonwick ASSERT(refcnt == 0); 6448ad4d6ddSJeff Bonwick ASSERT(start == -1ULL); 6458ad4d6ddSJeff Bonwick } 646