@@ -590,12 +590,12 @@ static void remove_free_block(control_t* control, block_header_t* block, int fl,
590
590
/* If the new head is null, clear the bitmap. */
591
591
if (next == & control -> block_null )
592
592
{
593
- control -> sl_bitmap [fl ] &= ~(1 << sl );
593
+ control -> sl_bitmap [fl ] &= ~(1U << sl );
594
594
595
595
/* If the second bitmap is now empty, clear the fl bitmap. */
596
596
if (!control -> sl_bitmap [fl ])
597
597
{
598
- control -> fl_bitmap &= ~(1 << fl );
598
+ control -> fl_bitmap &= ~(1U << fl );
599
599
}
600
600
}
601
601
}
@@ -618,8 +618,8 @@ static void insert_free_block(control_t* control, block_header_t* block, int fl,
618
618
** and second-level bitmaps appropriately.
619
619
*/
620
620
control -> blocks [fl ][sl ] = block ;
621
- control -> fl_bitmap |= (1 << fl );
622
- control -> sl_bitmap [fl ] |= (1 << sl );
621
+ control -> fl_bitmap |= (1U << fl );
622
+ control -> sl_bitmap [fl ] |= (1U << sl );
623
623
}
624
624
625
625
/* Remove a given block from the free list. */
@@ -853,9 +853,9 @@ int tlsf_check(tlsf_t tlsf)
853
853
{
854
854
for (j = 0 ; j < SL_INDEX_COUNT ; ++ j )
855
855
{
856
- const int fl_map = control -> fl_bitmap & (1 << i );
856
+ const int fl_map = control -> fl_bitmap & (1U << i );
857
857
const int sl_list = control -> sl_bitmap [i ];
858
- const int sl_map = sl_list & (1 << j );
858
+ const int sl_map = sl_list & (1U << j );
859
859
const block_header_t * block = control -> blocks [i ][j ];
860
860
861
861
/* Check that first- and second-level lists agree. */
0 commit comments