test_autotvm_space.py 3.31 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements.  See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership.  The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License.  You may obtain a copy of the License at
#
#   http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing,
# software distributed under the License is distributed on an
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied.  See the License for the
# specific language governing permissions and limitations
# under the License.
17 18 19
"""Test space definition primitives"""

import tvm
20
from tvm import te
21
from tvm.autotvm.task.space import ConfigSpace, FallbackConfigEntity
22 23

def gemm_func(cfg, N):
24 25
    A = te.placeholder((N, N), name='A')
    B = te.placeholder((N, N), name='B')
26

27 28
    k = te.reduce_axis((0, N), name='k')
    C = te.compute((N, N), lambda i, j: te.sum(A[i, k] * B[k, j], axis=[k]), name='C')
29

30
    s = te.create_schedule([C.op])
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45

    y, x = s[C].op.axis

    cfg.define_split('tile_y', cfg.axis(y), num_outputs=2)
    cfg.define_split('tile_x', cfg.axis(x), num_outputs=2)

    return s, [A, B, C]

def test_split():
    cfg = ConfigSpace()

    gemm_func(cfg, 128)
    assert len(cfg) == 64
    assert len(cfg.space_map['tile_y']) == 8

46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
    # test policy
    cfg = ConfigSpace()
    cfg.define_split('tile_x', cfg.axis(256), policy='factors', num_outputs=3)
    assert len(cfg.space_map['tile_x']) == 45

    cfg.define_split('tile_y', cfg.axis(256), policy='power2', num_outputs=3)
    assert len(cfg.space_map['tile_y']) == 45

    cfg.define_split('tile_z', cfg.axis(256), policy='verbose', num_outputs=3)
    assert len(cfg.space_map['tile_z']) == 45

    cfg.define_split('tile_a', cfg.axis(224), policy='factors', num_outputs=3)
    assert len(cfg.space_map['tile_a']) == 63

    cfg.define_split('tile_b', cfg.axis(224), policy='power2', num_outputs=3)
    assert len(cfg.space_map['tile_b']) == 36

    cfg.define_split('tile_c', cfg.axis(224), policy='verbose', num_outputs=3)
    assert len(cfg.space_map['tile_c']) == 84

66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
    # Count the number of non-negative integer solutions of a + b + c + d = n
    def count4(n):
        cnt = 0
        for a in range(0, n + 1):
            for b in range(0, n - a + 1):
                cnt += n - a - b + 1
        return cnt

    # test overflow
    n = 25
    cfg = ConfigSpace()
    cfg.define_split('x', cfg.axis(2**n), policy='factors', num_outputs=4)
    # count4(25) is 3276.
    assert len(cfg.space_map['x']) == count4(n)

81 82 83 84 85 86 87 88 89 90 91
    # test fallback
    cfg = FallbackConfigEntity()
    cfg.define_split('tile_n', cfg.axis(128), num_outputs=3)
    cfg.fallback_split('tile_n', [-1, 8, 4])
    assert cfg['tile_n'].size == [4, 8, 4]

    cfg = FallbackConfigEntity()
    cfg.define_split('tile_n', cfg.axis(49), num_outputs=3)
    cfg.fallback_split('tile_n', [-1, 8, 4])
    assert cfg['tile_n'].size == [7, 7, 1]

92 93 94 95 96 97 98 99 100
    cfg = FallbackConfigEntity()
    cfg.define_split('tile_n', cfg.axis(49), num_outputs=3)
    try:
        cfg.fallback_split('tile_n', [-1, 1, 0])
        assert False
    except RuntimeError:
        pass


101 102
if __name__ == '__main__':
    test_split()