C++ 将一个数值调整问上限的为某个POT的倍数值 - ROUND_UP_TO_POT_NUM

本文链接：https://blog.csdn.net/linjf520/article/details/106166501

讲的是 C++ 内存分配管理的，挺不错。

其中看到一个：ROUND_UP 函数，看到算法我能在脑海里想象到一部分数值的二进制的过程，但是还是用之前自己学习C++写的一个：BitSet 来查看数值计算过程，发现挺有趣的过程。

下面的 "BitSet.h" 就是上面提到的 BitSet

/* a.cpp - jave.lin */
#include <iostream>
#include "BitSet.h"

// 不成功的数值，因为不是POT
// #define __ALIGN 5

// 可成功的数值，因为是POT
// #define __ALIGN 2
// #define __ALIGN 8
#define __ALIGN 16
// #define __ALIGN 32

// 上调到8的倍数
static size_t ROUND_UP(size_t bytes) {
    return (((bytes) + __ALIGN-1) & (~(__ALIGN - 1)));
}

template<typename T>
static std::string getBSStr(T value) {
    std::string ret;
    BS::__getStrFormat(value, ret);
    return ret;
}

int main() {
    
    std::cout << " ### testing round up to " << __ALIGN << " ###\n";

    const size_t size = 4;
    int nums[size] = {5, 6, 798, 0};

    BS::BitSet_32 bs;

    for (size_t i = 0; i < size; i++) {
        bs.value = nums[i];
        std::cout << "Proc : " << nums[i] << "->" << ROUND_UP(nums[i]) << "\n";
        std::cout << bs                                                             << " = bs : "                                       << nums[i] << "\n";
        std::cout << getBSStr<BS::BitSet_32::valueType>( __ALIGN - 1 )              << " = (__ALGIN - 1) : "                            << __ALIGN - 1 << "\n";
        std::cout << getBSStr<BS::BitSet_32::valueType>( bs.value + __ALIGN - 1 )   << " = bs + (__ALGIN - 1) : "                       << bs.value + __ALIGN - 1 << "\n";
        std::cout << getBSStr<BS::BitSet_32::valueType>( (~(__ALIGN - 1)) )         << " = ~(__ALGIN - 1) : "                           << (~(__ALIGN - 1)) << "\n";
        std::cout << getBSStr<BS::BitSet_32::valueType>( ROUND_UP(nums[i]) )        << " = (bs + (__ALGIN - 1)) & (~(__ALGIN - 1)) : "  << ROUND_UP(nums[i]) << "\n";
    }

    return 0;
}

输出：

 ### testing round up to 16 ###
Proc : 5->16
00000000,00000000,00000000,00000101 = bs : 5
00000000,00000000,00000000,00001111 = (__ALGIN - 1) : 15
00000000,00000000,00000000,00010100 = bs + (__ALGIN - 1) : 20
11111111,11111111,11111111,11110000 = ~(__ALGIN - 1) : -16
00000000,00000000,00000000,00010000 = (bs + (__ALGIN - 1)) & (~(__ALGIN - 1)) : 16
Proc : 6->16
00000000,00000000,00000000,00000110 = bs : 6
00000000,00000000,00000000,00001111 = (__ALGIN - 1) : 15
00000000,00000000,00000000,00010101 = bs + (__ALGIN - 1) : 21
11111111,11111111,11111111,11110000 = ~(__ALGIN - 1) : -16
00000000,00000000,00000000,00010000 = (bs + (__ALGIN - 1)) & (~(__ALGIN - 1)) : 16
Proc : 798->800
00000000,00000000,00000011,00011110 = bs : 798
00000000,00000000,00000000,00001111 = (__ALGIN - 1) : 15
00000000,00000000,00000011,00101101 = bs + (__ALGIN - 1) : 813
11111111,11111111,11111111,11110000 = ~(__ALGIN - 1) : -16
00000000,00000000,00000011,00100000 = (bs + (__ALGIN - 1)) & (~(__ALGIN - 1)) : 800
Proc : 0->0
00000000,00000000,00000000,00000000 = bs : 0
00000000,00000000,00000000,00001111 = (__ALGIN - 1) : 15
00000000,00000000,00000000,00001111 = bs + (__ALGIN - 1) : 15
11111111,11111111,11111111,11110000 = ~(__ALGIN - 1) : -16
00000000,00000000,00000000,00000000 = (bs + (__ALGIN - 1)) & (~(__ALGIN - 1)) : 0