Comment on Beating the L1 cache with value speculationparentComments−xfer5y while (node) { value += node->value; next = node->next; So it is the same thing.
Comments