intel.com>; Jeff Fan <vanjeff_...@hotmail.com>
>> Cc: Kinney, Michael D <michael.d.kin...@intel.com>; edk2-devel@lists.01.org;
>> Yao, Jiewen <jiewen@intel.com>; Dong, Eric <eric.d...@intel.com>; Ard
>> Biesheuvel <ard.biesheu...@linaro.org>
ichael D <michael.d.kin...@intel.com>; edk2-devel@lists.01.org;
> Yao, Jiewen <jiewen@intel.com>; Dong, Eric <eric.d...@intel.com>; Ard
> Biesheuvel <ard.biesheu...@linaro.org>
> Subject: Re: [edk2] [PATCH 3/4] UefiCpuPkg/MtrrLib: Update algorithm to
> calcula
aszlo Ersek <ler...@redhat.com>
>> Cc: Kinney, Michael D <michael.d.kin...@intel.com>; edk2-
>> de...@lists.01.org; Yao, Jiewen <jiewen@intel.com>; Dong, Eric
>> <eric.d...@intel.com>; Ard Biesheuvel <ard.biesheu...@linaro.org>
>> Subject: R
.com>; edk2-
> de...@lists.01.org; Yao, Jiewen <jiewen@intel.com>; Dong, Eric
> <eric.d...@intel.com>; Ard Biesheuvel <ard.biesheu...@linaro.org>
> Subject: Re: [edk2] [PATCH 3/4] UefiCpuPkg/MtrrLib: Update algorithm to
> calculate optimal settings
>
>
On 2017-11-08 19:04:35, Ni, Ruiyu wrote:
> Jordan, Laszlo,
>
> I didn't realize that a platform may have less than 4-page stack
> before memory is ready. If I was aware of that, I would change the
> default scratch buffer size to 2 page, which should be enough too.
This does not sound much
com>
> Cc: Dong, Eric <eric.d...@intel.com>; Ard Biesheuvel
> <ard.biesheu...@linaro.org>; edk2-devel@lists.01.org; Yao, Jiewen
> <jiewen@intel.com>; Kinney, Michael D <michael.d.kin...@intel.com>
> Subject: Re: [edk2] [PATCH 3/4] UefiCpuPkg/MtrrLib: Update algori
On 2017-11-08 17:36:01, Laszlo Ersek wrote:
> Hi Ray,
>
> On 10/12/17 10:48, Ruiyu Ni wrote:
> > The new algorithm converts the problem calculating optimal
> > MTRR settings (using least MTRR registers) to the problem finding
> > the shortest path in a graph.
> > The memory required in extreme
Hi Ray,
On 10/12/17 10:48, Ruiyu Ni wrote:
> The new algorithm converts the problem calculating optimal
> MTRR settings (using least MTRR registers) to the problem finding
> the shortest path in a graph.
> The memory required in extreme but rare case can be up to 256KB,
> so using local stack
The new algorithm converts the problem calculating optimal
MTRR settings (using least MTRR registers) to the problem finding
the shortest path in a graph.
The memory required in extreme but rare case can be up to 256KB,
so using local stack buffer is impossible considering current
DxeIpl only
9 matches
Mail list logo
