0d435959e0
This commit reworks the Viper pointer boundary tests in order to make them more accurate and easier to extend. The tests are now easier to reason about in their output, using easier to read values, and bit thresholds are now more configurable. If a new conditional code sequence is introduced, adding a new bit threshold is just a matter of adding a value into a tuple at the beginning of the relevant test file. Load tests have also been made more accurate, with better function templates to test register-indexed operations. Signed-off-by: Alessandro Gatti <a.gatti@frob.it>
39 lines
1,015 B
Python
39 lines
1,015 B
Python
# Test boundary conditions for various architectures
|
|
|
|
GET_TEMPLATE = """
|
|
@micropython.viper
|
|
def get{off}(src: ptr32) -> uint:
|
|
return uint(src[{off}])
|
|
print(hex(get{off}(buffer)))
|
|
"""
|
|
|
|
|
|
BIT_THRESHOLDS = (5, 8, 11, 12)
|
|
SIZE = 4
|
|
|
|
|
|
@micropython.viper
|
|
def get_index(src: ptr32, i: int) -> int:
|
|
return src[i]
|
|
|
|
|
|
def data(start, len):
|
|
output = bytearray(len)
|
|
for idx in range(len):
|
|
output[idx] = (start + idx) & 0xFF
|
|
return output
|
|
|
|
|
|
buffer = bytearray((((1 << max(BIT_THRESHOLDS)) + 1) // 1024) * 1024)
|
|
val = 0
|
|
for bit in BIT_THRESHOLDS:
|
|
print("---", bit)
|
|
pre, idx, post = (((1 << bit) - (2 * SIZE)), ((1 << bit) - (1 * SIZE)), (1 << bit))
|
|
buffer[pre:post] = data(val, 3 * SIZE)
|
|
val = val + (3 * SIZE)
|
|
|
|
pre, idx, post = pre // SIZE, idx // SIZE, post // SIZE
|
|
print(hex(get_index(buffer, pre)), hex(get_index(buffer, idx)), hex(get_index(buffer, post)))
|
|
exec(GET_TEMPLATE.format(off=pre))
|
|
exec(GET_TEMPLATE.format(off=idx))
|
|
exec(GET_TEMPLATE.format(off=post))
|