aboutsummaryrefslogtreecommitdiff
path: root/ethosu/vela/test/test_hillclimb_allocation.py
diff options
context:
space:
mode:
authorTim Hall <tim.hall@arm.com>2022-05-19 12:36:58 +0100
committertim.hall <tim.hall@arm.com>2022-05-19 15:56:19 +0000
commitcda4fcb0fd3e9766a161cf3e5aa7c3283e7f7c9e (patch)
tree2ca560bcf290bf88ab7a0058098df794486ab528 /ethosu/vela/test/test_hillclimb_allocation.py
parent8bc7a652607a771e234fda6b05275542ff0fc072 (diff)
downloadethos-u-vela-cda4fcb0fd3e9766a161cf3e5aa7c3283e7f7c9e.tar.gz
MLBEDSW-6563: networks failing with memory area exceeded in vela3.4.0.rc2
- For allocations that have a hard memory limit the Hill Climb allocator should be given more attempts to find a solution that would fit - The fix is to use a memory limit when there is a hard constraint, and a minimum iteration count, reset on every improvement, when there is a soft constraint - Added maximum number iterations CLI option Signed-off-by: Tim Hall <tim.hall@arm.com> Change-Id: I19ff53a0b68412de280263626778a3102cbe52fa
Diffstat (limited to 'ethosu/vela/test/test_hillclimb_allocation.py')
-rw-r--r--ethosu/vela/test/test_hillclimb_allocation.py4
1 files changed, 2 insertions, 2 deletions
diff --git a/ethosu/vela/test/test_hillclimb_allocation.py b/ethosu/vela/test/test_hillclimb_allocation.py
index 8a56c3f2..03aec2bc 100644
--- a/ethosu/vela/test/test_hillclimb_allocation.py
+++ b/ethosu/vela/test/test_hillclimb_allocation.py
@@ -54,10 +54,10 @@ def live_range(start_time, end_time, size):
def test_allocate(lrs, expected_size):
"""Tests the search allocator"""
lr_list = [live_range(start, end, size) for start, end, size in lrs]
- res = allocate_live_ranges(lr_list)
+ res = allocate_live_ranges(lr_list, None, 1 << 32)
assert len(res) == len(lrs)
assert max(addr + lr[2] for addr, lr in zip(res, lrs)) == expected_size
def test_allocate_empty_input():
- assert [] == allocate_live_ranges([])
+ assert [] == allocate_live_ranges([], 0, 0)