Skip to content

Commit 0eea6b6

Browse files
author
Mike Snitzer
committed
dm vdo memory-alloc: change from uds_ to vdo_ namespace
Signed-off-by: Mike Snitzer <[email protected]> Signed-off-by: Matthew Sakai <[email protected]>
1 parent 6008d52 commit 0eea6b6

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

44 files changed

+453
-455
lines changed

drivers/md/dm-vdo/action-manager.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -107,7 +107,7 @@ int vdo_make_action_manager(zone_count_t zones,
107107
struct action_manager **manager_ptr)
108108
{
109109
struct action_manager *manager;
110-
int result = uds_allocate(1, struct action_manager, __func__, &manager);
110+
int result = vdo_allocate(1, struct action_manager, __func__, &manager);
111111

112112
if (result != VDO_SUCCESS)
113113
return result;

drivers/md/dm-vdo/admin-state.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -206,7 +206,7 @@ bool vdo_finish_operation(struct admin_state *state, int result)
206206
if (!state->starting) {
207207
vdo_set_admin_state_code(state, state->next_state);
208208
if (state->waiter != NULL)
209-
vdo_launch_completion(uds_forget(state->waiter));
209+
vdo_launch_completion(vdo_forget(state->waiter));
210210
}
211211

212212
return true;

drivers/md/dm-vdo/block-map.c

Lines changed: 30 additions & 30 deletions
Original file line numberDiff line numberDiff line change
@@ -221,12 +221,12 @@ static int __must_check allocate_cache_components(struct vdo_page_cache *cache)
221221
u64 size = cache->page_count * (u64) VDO_BLOCK_SIZE;
222222
int result;
223223

224-
result = uds_allocate(cache->page_count, struct page_info, "page infos",
224+
result = vdo_allocate(cache->page_count, struct page_info, "page infos",
225225
&cache->infos);
226226
if (result != UDS_SUCCESS)
227227
return result;
228228

229-
result = uds_allocate_memory(size, VDO_BLOCK_SIZE, "cache pages", &cache->pages);
229+
result = vdo_allocate_memory(size, VDO_BLOCK_SIZE, "cache pages", &cache->pages);
230230
if (result != UDS_SUCCESS)
231231
return result;
232232

@@ -1341,7 +1341,7 @@ int vdo_invalidate_page_cache(struct vdo_page_cache *cache)
13411341
}
13421342

13431343
/* Reset the page map by re-allocating it. */
1344-
vdo_int_map_free(uds_forget(cache->page_map));
1344+
vdo_int_map_free(vdo_forget(cache->page_map));
13451345
return vdo_int_map_create(cache->page_count, &cache->page_map);
13461346
}
13471347

@@ -2346,17 +2346,17 @@ static int make_segment(struct forest *old_forest, block_count_t new_pages,
23462346

23472347
forest->segments = index + 1;
23482348

2349-
result = uds_allocate(forest->segments, struct boundary,
2349+
result = vdo_allocate(forest->segments, struct boundary,
23502350
"forest boundary array", &forest->boundaries);
23512351
if (result != VDO_SUCCESS)
23522352
return result;
23532353

2354-
result = uds_allocate(forest->segments, struct tree_page *,
2354+
result = vdo_allocate(forest->segments, struct tree_page *,
23552355
"forest page pointers", &forest->pages);
23562356
if (result != VDO_SUCCESS)
23572357
return result;
23582358

2359-
result = uds_allocate(new_pages, struct tree_page,
2359+
result = vdo_allocate(new_pages, struct tree_page,
23602360
"new forest pages", &forest->pages[index]);
23612361
if (result != VDO_SUCCESS)
23622362
return result;
@@ -2382,7 +2382,7 @@ static int make_segment(struct forest *old_forest, block_count_t new_pages,
23822382
struct block_map_tree *tree = &(forest->trees[root]);
23832383
height_t height;
23842384

2385-
int result = uds_allocate(forest->segments,
2385+
int result = vdo_allocate(forest->segments,
23862386
struct block_map_tree_segment,
23872387
"tree root segments", &tree->segments);
23882388
if (result != VDO_SUCCESS)
@@ -2424,15 +2424,15 @@ static void deforest(struct forest *forest, size_t first_page_segment)
24242424
size_t segment;
24252425

24262426
for (segment = first_page_segment; segment < forest->segments; segment++)
2427-
uds_free(forest->pages[segment]);
2428-
uds_free(forest->pages);
2427+
vdo_free(forest->pages[segment]);
2428+
vdo_free(forest->pages);
24292429
}
24302430

24312431
for (root = 0; root < forest->map->root_count; root++)
2432-
uds_free(forest->trees[root].segments);
2432+
vdo_free(forest->trees[root].segments);
24332433

2434-
uds_free(forest->boundaries);
2435-
uds_free(forest);
2434+
vdo_free(forest->boundaries);
2435+
vdo_free(forest);
24362436
}
24372437

24382438
/**
@@ -2459,7 +2459,7 @@ static int make_forest(struct block_map *map, block_count_t entries)
24592459
return VDO_SUCCESS;
24602460
}
24612461

2462-
result = uds_allocate_extended(struct forest, map->root_count,
2462+
result = vdo_allocate_extended(struct forest, map->root_count,
24632463
struct block_map_tree, __func__,
24642464
&forest);
24652465
if (result != VDO_SUCCESS)
@@ -2485,7 +2485,7 @@ static void replace_forest(struct block_map *map)
24852485
if (map->next_forest != NULL) {
24862486
if (map->forest != NULL)
24872487
deforest(map->forest, map->forest->segments);
2488-
map->forest = uds_forget(map->next_forest);
2488+
map->forest = vdo_forget(map->next_forest);
24892489
}
24902490

24912491
map->entry_count = map->next_entry_count;
@@ -2501,11 +2501,11 @@ static void finish_cursor(struct cursor *cursor)
25012501
struct cursors *cursors = cursor->parent;
25022502
struct vdo_completion *completion = cursors->completion;
25032503

2504-
return_vio_to_pool(cursors->pool, uds_forget(cursor->vio));
2504+
return_vio_to_pool(cursors->pool, vdo_forget(cursor->vio));
25052505
if (--cursors->active_roots > 0)
25062506
return;
25072507

2508-
uds_free(cursors);
2508+
vdo_free(cursors);
25092509

25102510
vdo_finish_completion(completion);
25112511
}
@@ -2681,7 +2681,7 @@ void vdo_traverse_forest(struct block_map *map, vdo_entry_callback_fn callback,
26812681
struct cursors *cursors;
26822682
int result;
26832683

2684-
result = uds_allocate_extended(struct cursors, map->root_count,
2684+
result = vdo_allocate_extended(struct cursors, map->root_count,
26852685
struct cursor, __func__, &cursors);
26862686
if (result != VDO_SUCCESS) {
26872687
vdo_fail_completion(completion, result);
@@ -2729,7 +2729,7 @@ static int __must_check initialize_block_map_zone(struct block_map *map,
27292729
zone->thread_id = vdo->thread_config.logical_threads[zone_number];
27302730
zone->block_map = map;
27312731

2732-
result = uds_allocate_extended(struct dirty_lists, maximum_age,
2732+
result = vdo_allocate_extended(struct dirty_lists, maximum_age,
27332733
dirty_era_t, __func__,
27342734
&zone->dirty_lists);
27352735
if (result != VDO_SUCCESS)
@@ -2822,19 +2822,19 @@ static void uninitialize_block_map_zone(struct block_map_zone *zone)
28222822
{
28232823
struct vdo_page_cache *cache = &zone->page_cache;
28242824

2825-
uds_free(uds_forget(zone->dirty_lists));
2826-
free_vio_pool(uds_forget(zone->vio_pool));
2827-
vdo_int_map_free(uds_forget(zone->loading_pages));
2825+
vdo_free(vdo_forget(zone->dirty_lists));
2826+
free_vio_pool(vdo_forget(zone->vio_pool));
2827+
vdo_int_map_free(vdo_forget(zone->loading_pages));
28282828
if (cache->infos != NULL) {
28292829
struct page_info *info;
28302830

28312831
for (info = cache->infos; info < cache->infos + cache->page_count; info++)
2832-
free_vio(uds_forget(info->vio));
2832+
free_vio(vdo_forget(info->vio));
28332833
}
28342834

2835-
vdo_int_map_free(uds_forget(cache->page_map));
2836-
uds_free(uds_forget(cache->infos));
2837-
uds_free(uds_forget(cache->pages));
2835+
vdo_int_map_free(vdo_forget(cache->page_map));
2836+
vdo_free(vdo_forget(cache->infos));
2837+
vdo_free(vdo_forget(cache->pages));
28382838
}
28392839

28402840
void vdo_free_block_map(struct block_map *map)
@@ -2849,9 +2849,9 @@ void vdo_free_block_map(struct block_map *map)
28492849

28502850
vdo_abandon_block_map_growth(map);
28512851
if (map->forest != NULL)
2852-
deforest(uds_forget(map->forest), 0);
2853-
uds_free(uds_forget(map->action_manager));
2854-
uds_free(map);
2852+
deforest(vdo_forget(map->forest), 0);
2853+
vdo_free(vdo_forget(map->action_manager));
2854+
vdo_free(map);
28552855
}
28562856

28572857
/* @journal may be NULL. */
@@ -2871,7 +2871,7 @@ int vdo_decode_block_map(struct block_map_state_2_0 state, block_count_t logical
28712871
if (result != UDS_SUCCESS)
28722872
return result;
28732873

2874-
result = uds_allocate_extended(struct block_map,
2874+
result = vdo_allocate_extended(struct block_map,
28752875
vdo->thread_config.logical_zone_count,
28762876
struct block_map_zone, __func__, &map);
28772877
if (result != UDS_SUCCESS)
@@ -3053,7 +3053,7 @@ void vdo_grow_block_map(struct block_map *map, struct vdo_completion *parent)
30533053

30543054
void vdo_abandon_block_map_growth(struct block_map *map)
30553055
{
3056-
struct forest *forest = uds_forget(map->next_forest);
3056+
struct forest *forest = vdo_forget(map->next_forest);
30573057

30583058
if (forest != NULL)
30593059
deforest(forest, forest->segments - 1);

drivers/md/dm-vdo/data-vio.c

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -789,20 +789,20 @@ static int initialize_data_vio(struct data_vio *data_vio, struct vdo *vdo)
789789
int result;
790790

791791
BUILD_BUG_ON(VDO_BLOCK_SIZE > PAGE_SIZE);
792-
result = uds_allocate_memory(VDO_BLOCK_SIZE, 0, "data_vio data",
792+
result = vdo_allocate_memory(VDO_BLOCK_SIZE, 0, "data_vio data",
793793
&data_vio->vio.data);
794794
if (result != VDO_SUCCESS)
795795
return uds_log_error_strerror(result,
796796
"data_vio data allocation failure");
797797

798-
result = uds_allocate_memory(VDO_BLOCK_SIZE, 0, "compressed block",
798+
result = vdo_allocate_memory(VDO_BLOCK_SIZE, 0, "compressed block",
799799
&data_vio->compression.block);
800800
if (result != VDO_SUCCESS) {
801801
return uds_log_error_strerror(result,
802802
"data_vio compressed block allocation failure");
803803
}
804804

805-
result = uds_allocate_memory(VDO_BLOCK_SIZE, 0, "vio scratch",
805+
result = vdo_allocate_memory(VDO_BLOCK_SIZE, 0, "vio scratch",
806806
&data_vio->scratch_block);
807807
if (result != VDO_SUCCESS)
808808
return uds_log_error_strerror(result,
@@ -825,10 +825,10 @@ static void destroy_data_vio(struct data_vio *data_vio)
825825
if (data_vio == NULL)
826826
return;
827827

828-
vdo_free_bio(uds_forget(data_vio->vio.bio));
829-
uds_free(uds_forget(data_vio->vio.data));
830-
uds_free(uds_forget(data_vio->compression.block));
831-
uds_free(uds_forget(data_vio->scratch_block));
828+
vdo_free_bio(vdo_forget(data_vio->vio.bio));
829+
vdo_free(vdo_forget(data_vio->vio.data));
830+
vdo_free(vdo_forget(data_vio->compression.block));
831+
vdo_free(vdo_forget(data_vio->scratch_block));
832832
}
833833

834834
/**
@@ -845,7 +845,7 @@ int make_data_vio_pool(struct vdo *vdo, data_vio_count_t pool_size,
845845
struct data_vio_pool *pool;
846846
data_vio_count_t i;
847847

848-
result = uds_allocate_extended(struct data_vio_pool, pool_size, struct data_vio,
848+
result = vdo_allocate_extended(struct data_vio_pool, pool_size, struct data_vio,
849849
__func__, &pool);
850850
if (result != UDS_SUCCESS)
851851
return result;
@@ -867,7 +867,7 @@ int make_data_vio_pool(struct vdo *vdo, data_vio_count_t pool_size,
867867

868868
result = uds_make_funnel_queue(&pool->queue);
869869
if (result != UDS_SUCCESS) {
870-
free_data_vio_pool(uds_forget(pool));
870+
free_data_vio_pool(vdo_forget(pool));
871871
return result;
872872
}
873873

@@ -924,8 +924,8 @@ void free_data_vio_pool(struct data_vio_pool *pool)
924924
destroy_data_vio(data_vio);
925925
}
926926

927-
uds_free_funnel_queue(uds_forget(pool->queue));
928-
uds_free(pool);
927+
uds_free_funnel_queue(vdo_forget(pool->queue));
928+
vdo_free(pool);
929929
}
930930

931931
static bool acquire_permit(struct limiter *limiter)
@@ -1431,7 +1431,7 @@ void release_data_vio_allocation_lock(struct data_vio *data_vio, bool reset)
14311431
allocation->pbn = VDO_ZERO_BLOCK;
14321432

14331433
vdo_release_physical_zone_pbn_lock(allocation->zone, locked_pbn,
1434-
uds_forget(allocation->lock));
1434+
vdo_forget(allocation->lock));
14351435
}
14361436

14371437
/**

0 commit comments

Comments
 (0)