// if I know that in_x will never be bigger than Max
template <unsigned Max>
void foo(unsigned in_x)
{
unsigned cap = Max;
// I can tell the compiler this loop will never run more than log(Max) times
for (; cap != 0 && in_x != 0; cap >>= 1, in_x >>= 1)
{
}
}
如上面的代码所示,我的猜测是,如果我只是写
for(; in_x!= 0; in_x&gt;&gt; = 1)
编译器不会展开循环,因为它无法确定最大可能的in_x。
我想知道我是对还是错,如果有更好的方法可以解决这些问题。
或许问题可以概括为好像可以编写一些代码来告诉编译器一些运行时值的范围,并且这些代码不一定被编译成运行时二进制文件。
真的,与编译器XD战斗
// with MSC
// if no __forceinline here, unrolling is ok, but the function will not be inlined
// if I add __forceinline here, lol, the entire loop is unrolled (or should I say the tree is expanded)...
// compiler freezes when Max is something like 1024
template <int Max>
__forceinline void find(int **in_a, int in_size, int in_key)
{
if (in_size == 0)
{
return;
}
if (Max == 0)
{
return;
}
{
int m = in_size / 2;
if ((*in_a)[m] >= in_key)
{
find<Max / 2>(in_a, m, in_key);
}
else
{
*in_a = *in_a + m + 1;
find<Max - Max / 2 - 1>(in_a, in_size - (m + 1), in_key);
}
}
}
答案 0 :(得分:3)
实现此类行为的正确方法是使用TMP自行展开循环。 即便如此,您仍将依赖编译器协作进行大规模内联(不授予)。看看下面的代码,看它是否有帮助:
template <unsigned char MaxRec>
inline void foo(unsigned in_x)
{
if (MaxRec == 0) // will be eliminated at compile time
return; // tells the compiler to stop the pseudo recursion
if (in_x == 0) {
// TODO : end recursion;
return;
};
// TODO: Process for iteration rec
// Note: NOT recursion, the compiler would not be able to inline
foo<MaxRec-1>(in_x >> 1);
}
// Usage:
foo<5>(in_x); // doubt the compiler will inline 32 times, but you can try.