Borislav Petkov writes:
> On Mon, Oct 26, 2015 at 11:20:35AM +0800, Huang, Ying wrote:
>> In ghes_estatus_caches[], for caches with same contents, the cache with
>> biggest (newest) cache->time_in should be the first. So if we found one
>> cache with too small (old) cache->time_in, we can say th
On Mon, Oct 26, 2015 at 11:20:35AM +0800, Huang, Ying wrote:
> In ghes_estatus_caches[], for caches with same contents, the cache with
> biggest (newest) cache->time_in should be the first. So if we found one
> cache with too small (old) cache->time_in, we can say there are no cache
> with same co
Hi, Tony,
"Luck, Tony" writes:
>> ping?
>
> I'm not actually sure that the code is wrong. As you say it is a pretty
> strange loop.
>
> We seem to want to look at a bunch of conditions, and use "continue" to ignore
> bits until we find one that we like the look of. Perhaps as soon as we do,
>
> ping?
I'm not actually sure that the code is wrong. As you say it is a pretty
strange loop.
We seem to want to look at a bunch of conditions, and use "continue" to ignore
bits until we find one that we like the look of. Perhaps as soon as we do, we
want
to believe it to get our return value
ping?
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
5 matches
Mail list logo