While counting his newborn rabbits, Fibonacci came up with a numerical sequence.
斐波那契提出了一个数字序列计数新生兔子。
2
You can translate the resulting mask back into a single index by counting the leading zeroes, and then subtracting that from 31. A possible assembly language instruction sequence to do this would be
计算前导零，然后从 31 中减去前导零数量，就可以将产生的掩码转换为索引。
3
Besides counting up loading cycles, it still needs to record loading sequence effects by dividing loading history into phases and putting them in cases as loading history is treated.