caedadcc6fa9b2a1ff1115774e3e61a9bff52f5c
The old max memory search algorithm is using Binary Search algorithm to find last successful memory allocation. But each successful memory allocation takes times. Since the unsuccessful memory allocation returns very quick. Changing the search algorithm to find first successful memory allocation starting from MAX, each testing step with granularity interval will speed up this test. Change-Id: Idada3c6f750c94f3bb223f4f3bff4e4ebd3e98f7 Signed-off-by: James Zhu <James.Zhu@amd.com>
توضیحات
No description provided
Languages
C++
67.5%
C
20.6%
Python
6.6%
CMake
3.4%
Shell
0.6%
دیگر
1.1%