@@ -132,10 +132,10 @@ static void node_parse_key_free_list(struct node *node)
132
132
int off ;
133
133
134
134
/* Each bit represents a byte in the key area */
135
- node -> free_key_bmap = malloc ((area_len + 7 ) / 8 );
135
+ node -> free_key_bmap = malloc (DIV_ROUND_UP (area_len , 8 ) );
136
136
if (!node -> free_key_bmap )
137
137
system_error ();
138
- memset (node -> free_key_bmap , 0xFF , (area_len + 7 ) / 8 );
138
+ memset (node -> free_key_bmap , 0xFF , DIV_ROUND_UP (area_len , 8 ) );
139
139
140
140
off = le16_to_cpu (free -> off );
141
141
while (total > 0 ) {
@@ -195,10 +195,10 @@ static void node_parse_val_free_list(struct node *node)
195
195
end_raw = (void * )node -> raw + node -> data + area_len ;
196
196
197
197
/* Each bit represents a byte in the value area */
198
- node -> free_val_bmap = malloc ((area_len + 7 ) / 8 );
198
+ node -> free_val_bmap = malloc (DIV_ROUND_UP (area_len , 8 ) );
199
199
if (!node -> free_val_bmap )
200
200
system_error ();
201
- memset (node -> free_val_bmap , 0xFF , (area_len + 7 ) / 8 );
201
+ memset (node -> free_val_bmap , 0xFF , DIV_ROUND_UP (area_len , 8 ) );
202
202
203
203
off = le16_to_cpu (free -> off );
204
204
while (total > 0 ) {
@@ -261,7 +261,7 @@ static void node_prepare_bitmaps(struct node *node)
261
261
keys_len = node -> free - node -> key ;
262
262
263
263
/* Each bit represents a byte in the key area */
264
- node -> used_key_bmap = calloc (1 , (keys_len + 7 ) / 8 );
264
+ node -> used_key_bmap = calloc (1 , DIV_ROUND_UP (keys_len , 8 ) );
265
265
if (!node -> used_key_bmap )
266
266
system_error ();
267
267
@@ -270,7 +270,7 @@ static void node_prepare_bitmaps(struct node *node)
270
270
(node_is_root (node ) ? sizeof (struct apfs_btree_info ) : 0 );
271
271
272
272
/* Each bit represents a byte in the value area */
273
- node -> used_val_bmap = calloc (1 , (values_len + 7 ) / 8 );
273
+ node -> used_val_bmap = calloc (1 , DIV_ROUND_UP (values_len , 8 ) );
274
274
if (!node -> used_val_bmap )
275
275
system_error ();
276
276
0 commit comments