全部

1·The outer loop decrements a loop counter variable each time through the loop.

每循环一次，外部循环都使循环计数器变量递减一次。

2·More importantly, -O3 also avoids keeping the loop counter in memory, even with the original source.

更重要的是， -O3 也避免了在内存中保留循环计数器，即使使用原始源。

3·Normally, variables are best named by their use (like firstName or title), but as this variable is essentially a loop counter, using single letters is also fine.

变量一般最好根据用途命名（如 firstName 或r title），不过由于这个变量基本上是一个循环计数器，也可使用单个字母。

4·You then use register 127 as your loop counter and register 126 as your base pointer, and perform convert_to_upper on each value until you get to the end of the buffer.

然后再将寄存器127用作循环计数器，将寄存器126用作基指针，并在每个值上执行convert _ to_upper，直到到达缓冲区的底部为止。

5·Of course, you can run loops backward instead of forward, or increment the loop counter by something other than 1, or even eliminate the loop counter completely as you do in a while statement.

当然，也可以反向而不是正向运行循环，或者使用1之外的循环计数器增量，甚至像while语句那样完全取消循环计数器。

6·The examples so far -- counter and stack -- are very simple nonblocking algorithms and are easy to follow once you grasp the pattern of using CAS in a loop.

目前为止的示例（计数器和堆栈）都是非常简单的非阻塞算法，一旦掌握了在循环中使用 CAS，就可以容易地模仿它们。

7·By default, this counter starts at 1 and is incremented each time the loop is taken.

默认情况下，这个计数器从1开始，每执行一次循环递增一次。

8·And, if this process is applied repeatedly, the entire loop can be collapsed into a single synchronized block with a single counter=10000000 operation.

而且，如果重复应用这个过程，整个循环将缩水成一个单独的同步块，这个同步块中只有一个 counter=10000000 操作。

9·I have just declared some variable types that I clearly know, and I used the cleanest Pyrex counter loop.

我只声明了早已知道的一些变量类型，并使用最干净的Pyrex counter循环。

10·Look at the program counter register once in a while and try to detect that code simply burns a CPU in a tight loop.

看一下程序计数器偶尔登记并试图发现代码只是燃烧一个CPU的循环。