@@ -221,12 +221,12 @@ static int __must_check allocate_cache_components(struct vdo_page_cache *cache)
221
221
u64 size = cache -> page_count * (u64 ) VDO_BLOCK_SIZE ;
222
222
int result ;
223
223
224
- result = uds_allocate (cache -> page_count , struct page_info , "page infos" ,
224
+ result = vdo_allocate (cache -> page_count , struct page_info , "page infos" ,
225
225
& cache -> infos );
226
226
if (result != UDS_SUCCESS )
227
227
return result ;
228
228
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 );
230
230
if (result != UDS_SUCCESS )
231
231
return result ;
232
232
@@ -1341,7 +1341,7 @@ int vdo_invalidate_page_cache(struct vdo_page_cache *cache)
1341
1341
}
1342
1342
1343
1343
/* 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 ));
1345
1345
return vdo_int_map_create (cache -> page_count , & cache -> page_map );
1346
1346
}
1347
1347
@@ -2346,17 +2346,17 @@ static int make_segment(struct forest *old_forest, block_count_t new_pages,
2346
2346
2347
2347
forest -> segments = index + 1 ;
2348
2348
2349
- result = uds_allocate (forest -> segments , struct boundary ,
2349
+ result = vdo_allocate (forest -> segments , struct boundary ,
2350
2350
"forest boundary array" , & forest -> boundaries );
2351
2351
if (result != VDO_SUCCESS )
2352
2352
return result ;
2353
2353
2354
- result = uds_allocate (forest -> segments , struct tree_page * ,
2354
+ result = vdo_allocate (forest -> segments , struct tree_page * ,
2355
2355
"forest page pointers" , & forest -> pages );
2356
2356
if (result != VDO_SUCCESS )
2357
2357
return result ;
2358
2358
2359
- result = uds_allocate (new_pages , struct tree_page ,
2359
+ result = vdo_allocate (new_pages , struct tree_page ,
2360
2360
"new forest pages" , & forest -> pages [index ]);
2361
2361
if (result != VDO_SUCCESS )
2362
2362
return result ;
@@ -2382,7 +2382,7 @@ static int make_segment(struct forest *old_forest, block_count_t new_pages,
2382
2382
struct block_map_tree * tree = & (forest -> trees [root ]);
2383
2383
height_t height ;
2384
2384
2385
- int result = uds_allocate (forest -> segments ,
2385
+ int result = vdo_allocate (forest -> segments ,
2386
2386
struct block_map_tree_segment ,
2387
2387
"tree root segments" , & tree -> segments );
2388
2388
if (result != VDO_SUCCESS )
@@ -2424,15 +2424,15 @@ static void deforest(struct forest *forest, size_t first_page_segment)
2424
2424
size_t segment ;
2425
2425
2426
2426
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 );
2429
2429
}
2430
2430
2431
2431
for (root = 0 ; root < forest -> map -> root_count ; root ++ )
2432
- uds_free (forest -> trees [root ].segments );
2432
+ vdo_free (forest -> trees [root ].segments );
2433
2433
2434
- uds_free (forest -> boundaries );
2435
- uds_free (forest );
2434
+ vdo_free (forest -> boundaries );
2435
+ vdo_free (forest );
2436
2436
}
2437
2437
2438
2438
/**
@@ -2459,7 +2459,7 @@ static int make_forest(struct block_map *map, block_count_t entries)
2459
2459
return VDO_SUCCESS ;
2460
2460
}
2461
2461
2462
- result = uds_allocate_extended (struct forest , map -> root_count ,
2462
+ result = vdo_allocate_extended (struct forest , map -> root_count ,
2463
2463
struct block_map_tree , __func__ ,
2464
2464
& forest );
2465
2465
if (result != VDO_SUCCESS )
@@ -2485,7 +2485,7 @@ static void replace_forest(struct block_map *map)
2485
2485
if (map -> next_forest != NULL ) {
2486
2486
if (map -> forest != NULL )
2487
2487
deforest (map -> forest , map -> forest -> segments );
2488
- map -> forest = uds_forget (map -> next_forest );
2488
+ map -> forest = vdo_forget (map -> next_forest );
2489
2489
}
2490
2490
2491
2491
map -> entry_count = map -> next_entry_count ;
@@ -2501,11 +2501,11 @@ static void finish_cursor(struct cursor *cursor)
2501
2501
struct cursors * cursors = cursor -> parent ;
2502
2502
struct vdo_completion * completion = cursors -> completion ;
2503
2503
2504
- return_vio_to_pool (cursors -> pool , uds_forget (cursor -> vio ));
2504
+ return_vio_to_pool (cursors -> pool , vdo_forget (cursor -> vio ));
2505
2505
if (-- cursors -> active_roots > 0 )
2506
2506
return ;
2507
2507
2508
- uds_free (cursors );
2508
+ vdo_free (cursors );
2509
2509
2510
2510
vdo_finish_completion (completion );
2511
2511
}
@@ -2681,7 +2681,7 @@ void vdo_traverse_forest(struct block_map *map, vdo_entry_callback_fn callback,
2681
2681
struct cursors * cursors ;
2682
2682
int result ;
2683
2683
2684
- result = uds_allocate_extended (struct cursors , map -> root_count ,
2684
+ result = vdo_allocate_extended (struct cursors , map -> root_count ,
2685
2685
struct cursor , __func__ , & cursors );
2686
2686
if (result != VDO_SUCCESS ) {
2687
2687
vdo_fail_completion (completion , result );
@@ -2729,7 +2729,7 @@ static int __must_check initialize_block_map_zone(struct block_map *map,
2729
2729
zone -> thread_id = vdo -> thread_config .logical_threads [zone_number ];
2730
2730
zone -> block_map = map ;
2731
2731
2732
- result = uds_allocate_extended (struct dirty_lists , maximum_age ,
2732
+ result = vdo_allocate_extended (struct dirty_lists , maximum_age ,
2733
2733
dirty_era_t , __func__ ,
2734
2734
& zone -> dirty_lists );
2735
2735
if (result != VDO_SUCCESS )
@@ -2822,19 +2822,19 @@ static void uninitialize_block_map_zone(struct block_map_zone *zone)
2822
2822
{
2823
2823
struct vdo_page_cache * cache = & zone -> page_cache ;
2824
2824
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 ));
2828
2828
if (cache -> infos != NULL ) {
2829
2829
struct page_info * info ;
2830
2830
2831
2831
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 ));
2833
2833
}
2834
2834
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 ));
2838
2838
}
2839
2839
2840
2840
void vdo_free_block_map (struct block_map * map )
@@ -2849,9 +2849,9 @@ void vdo_free_block_map(struct block_map *map)
2849
2849
2850
2850
vdo_abandon_block_map_growth (map );
2851
2851
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 );
2855
2855
}
2856
2856
2857
2857
/* @journal may be NULL. */
@@ -2871,7 +2871,7 @@ int vdo_decode_block_map(struct block_map_state_2_0 state, block_count_t logical
2871
2871
if (result != UDS_SUCCESS )
2872
2872
return result ;
2873
2873
2874
- result = uds_allocate_extended (struct block_map ,
2874
+ result = vdo_allocate_extended (struct block_map ,
2875
2875
vdo -> thread_config .logical_zone_count ,
2876
2876
struct block_map_zone , __func__ , & map );
2877
2877
if (result != UDS_SUCCESS )
@@ -3053,7 +3053,7 @@ void vdo_grow_block_map(struct block_map *map, struct vdo_completion *parent)
3053
3053
3054
3054
void vdo_abandon_block_map_growth (struct block_map * map )
3055
3055
{
3056
- struct forest * forest = uds_forget (map -> next_forest );
3056
+ struct forest * forest = vdo_forget (map -> next_forest );
3057
3057
3058
3058
if (forest != NULL )
3059
3059
deforest (forest , forest -> segments - 1 );
0 commit comments