Well, that's classic algorithm for checking loop in a list, as well as
other one we know, in order to decrease time complexity of these algorithms,
their implementations are a little more complex.
But IMO, the issue we are trying to fix is really a corner case, and the
performance in that path is
Sorry, I saw the related code entirely, please ignore these replies.
On 2018/2/3 18:45, Gao Xiang wrote:
On 2018/2/3 18:35, Gao Xiang wrote:
Hi Chao and YunLei,
On 2018/2/3 17:44, Chao Yu wrote:
There is no checksum in node block now, so bit-transition from hardware
can make
On 2018/2/3 18:35, Gao Xiang wrote:
Hi Chao and YunLei,
On 2018/2/3 17:44, Chao Yu wrote:
There is no checksum in node block now, so bit-transition from hardware
can make node_footer.next_blkaddr being corrupted w/o any detection,
result in node chain becoming looped one.
For this
Hi Chao and YunLei,
On 2018/2/3 17:44, Chao Yu wrote:
There is no checksum in node block now, so bit-transition from hardware
can make node_footer.next_blkaddr being corrupted w/o any detection,
result in node chain becoming looped one.
For this condition, during recovery, in order to avoid
