Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 1 | # Copyright (C) 2020 Arm Limited or its affiliates. All rights reserved. |
| 2 | # |
| 3 | # SPDX-License-Identifier: Apache-2.0 |
| 4 | # |
| 5 | # Licensed under the Apache License, Version 2.0 (the License); you may |
| 6 | # not use this file except in compliance with the License. |
| 7 | # You may obtain a copy of the License at |
| 8 | # |
| 9 | # www.apache.org/licenses/LICENSE-2.0 |
| 10 | # |
| 11 | # Unless required by applicable law or agreed to in writing, software |
| 12 | # distributed under the License is distributed on an AS IS BASIS, WITHOUT |
| 13 | # WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 14 | # See the License for the specific language governing permissions and |
| 15 | # limitations under the License. |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 16 | # Description: |
| 17 | # Wrapping function to do tensor address allocation. That is, assigning addresses to tensors based on what has been |
| 18 | # worked out from the allowable overlaps that are calculated by the live range analysis. |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 19 | import math |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 20 | |
Diego Russo | ea6111a | 2020-04-14 18:41:58 +0100 | [diff] [blame] | 21 | import numpy as np |
| 22 | |
| 23 | from . import live_range |
| 24 | from . import numeric_util |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 25 | from .greedy_allocation import allocate_live_ranges as greedy_allocate_live_ranges |
Diego Russo | e8a1045 | 2020-04-21 17:39:10 +0100 | [diff] [blame] | 26 | from .nn_graph import TensorAllocator |
| 27 | from .tensor import MemArea |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 28 | from .tensor import MemType |
Louis Verhaard | 0b8268a | 2020-08-05 16:11:29 +0200 | [diff] [blame^] | 29 | from .tensor import TensorPurpose |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 30 | |
| 31 | |
Louis Verhaard | 3c07c97 | 2020-05-07 08:12:58 +0200 | [diff] [blame] | 32 | def linear_allocate_live_ranges(live_ranges, alloc_granularity=16): |
| 33 | # Allocates using increasing addresses. Duplicate constant tensors will be allocated to the same address |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 34 | total_sz = 0 |
| 35 | allocated_tensors = [] |
| 36 | |
Louis Verhaard | 3c07c97 | 2020-05-07 08:12:58 +0200 | [diff] [blame] | 37 | # just assign increasing addresses, except for duplicates |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 38 | for tens, lr in live_ranges.ranges.items(): |
| 39 | if tens in allocated_tensors: |
| 40 | continue |
| 41 | |
Louis Verhaard | 3c07c97 | 2020-05-07 08:12:58 +0200 | [diff] [blame] | 42 | address = total_sz |
| 43 | if tens.weight_compression_config is not None: |
| 44 | for allocated_tens in allocated_tensors: |
| 45 | if allocated_tens.weight_compression_config == tens.weight_compression_config: |
| 46 | address = allocated_tens.address |
| 47 | break |
Louis Verhaard | 0b8268a | 2020-08-05 16:11:29 +0200 | [diff] [blame^] | 48 | if tens.purpose == TensorPurpose.LUT: |
| 49 | for allocated_tens in allocated_tensors: |
| 50 | if allocated_tens.equivalent(tens): |
| 51 | address = allocated_tens.address |
| 52 | break |
Louis Verhaard | 3c07c97 | 2020-05-07 08:12:58 +0200 | [diff] [blame] | 53 | lr.set_address(address) |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 54 | allocated_tensors += lr.tensors |
Louis Verhaard | 3c07c97 | 2020-05-07 08:12:58 +0200 | [diff] [blame] | 55 | if address == total_sz: |
| 56 | total_sz += numeric_util.round_up(int(math.ceil(lr.size)), alloc_granularity) |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 57 | |
| 58 | return total_sz |
| 59 | |
| 60 | |
| 61 | def mark_sram_used_for_cascaded_passes(sg, lrs): |
| 62 | end_pos = max(ps.time for ps in sg.cascaded_passes) + 2 |
| 63 | mem_usage = np.zeros(end_pos, dtype=np.int64) |
| 64 | |
| 65 | for tens, rng in lrs.ranges.items(): |
| 66 | storage_size = tens.storage_size() |
| 67 | mem_usage[rng.start_time : rng.end_time] += storage_size |
| 68 | |
| 69 | for cps in sg.cascaded_passes: |
| 70 | sram_used = max(mem_usage[cps.time], mem_usage[cps.time + 1]) |
| 71 | cps.sram_used = sram_used |
| 72 | for ps in cps.passes: |
| 73 | ps.sram_used = sram_used |
| 74 | |
| 75 | |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 76 | def print_allocation(lrs, mem_area, mem_type_set, sg, verbose_allocation, show_minimum_possible_allocation): |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 77 | if verbose_allocation: |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 78 | if mem_type_set == set((MemType.Permanent_NPU,)) or mem_type_set == set((MemType.Permanent_CPU,)): |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 79 | print("allocation for", mem_area, "- constant tensors in", sg.placement.name, "subgraph(s)") |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 80 | else: |
| 81 | print("allocation for", mem_area, "- non-constant tensors in Cpu and Npu subgraphs") |
| 82 | |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 83 | for start_time, start, end, name, end_time in sorted( |
| 84 | ( |
| 85 | lr.start_time, |
| 86 | tens.address, |
| 87 | tens.address + int(math.ceil(tens.storage_size())), |
| 88 | tens.name + " " + str(tens.purpose), |
| 89 | lr.end_time, |
| 90 | ) |
| 91 | for tens, lr in lrs.ranges.items() |
| 92 | ): |
| 93 | name = name.replace("\x00", "") |
| 94 | print("%9d: %#12x - %#12x: %3d - %3d %s" % ((end - start), start, end, start_time, end_time, name)) |
| 95 | print() |
| 96 | |
| 97 | if show_minimum_possible_allocation and mem_area == MemArea.Sram: |
| 98 | min_possible_allocation = max(cps.sram_used for cps in sg.cascaded_passes) |
| 99 | print( |
| 100 | "Min possible allocation %d bytes / %.1f KB / %.1f MB" |
| 101 | % (min_possible_allocation, min_possible_allocation / 1024, min_possible_allocation / 1024 / 1024) |
| 102 | ) |
| 103 | |
| 104 | |
| 105 | def allocate_tensors( |
| 106 | nng, |
| 107 | sg, |
| 108 | arch, |
| 109 | mem_area, |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 110 | mem_type_set, |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 111 | use_ifm_ofm_overlap=True, |
| 112 | tensor_allocator=TensorAllocator.Greedy, |
| 113 | verbose_allocation=False, |
| 114 | show_minimum_possible_allocation=False, |
| 115 | lr_graph=None, |
| 116 | ): |
| 117 | ignore_subgraph_input_output_tensors = False |
| 118 | lrs = live_range.extract_live_ranges_from_cascaded_passes( |
| 119 | sg, |
| 120 | mem_area, |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 121 | mem_type_set, |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 122 | mark_output_tensors_overlapping_with_input_tensors=False, |
| 123 | use_ifm_ofm_overlap=use_ifm_ofm_overlap, |
| 124 | ignore_subgraph_input_output_tensors=ignore_subgraph_input_output_tensors, |
| 125 | lr_graph=lr_graph, |
| 126 | ) |
| 127 | |
| 128 | if lrs.ranges: |
| 129 | tens_alloc = tensor_allocator |
| 130 | if tens_alloc == TensorAllocator.Greedy: |
| 131 | total_sz = greedy_allocate_live_ranges(sg, arch, lrs, mem_area, verbose_allocation) |
| 132 | elif tens_alloc == TensorAllocator.LinearAlloc: |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 133 | total_sz = linear_allocate_live_ranges(lrs, 16) |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 134 | else: |
| 135 | assert 0 |
| 136 | |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 137 | if sg.memory_used.get(mem_area, 0) == 0: |
| 138 | sg.memory_used[mem_area] = total_sz |
| 139 | else: |
| 140 | sg.memory_used[mem_area] += total_sz |
| 141 | |
| 142 | # Keep track of how much should be used for scratch or permanent storage for NPU |
| 143 | for mem_type in mem_type_set: |
| 144 | if sg.memory_used_per_type.get(mem_type, 0) == 0: |
| 145 | sg.memory_used_per_type[mem_type] = total_sz |
| 146 | else: |
| 147 | sg.memory_used_per_type[mem_type] += total_sz |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 148 | |
| 149 | nng.total_size[mem_area] = nng.total_size.get(mem_area, 0) + sum(tens.storage_size() for tens in lrs.ranges) |
| 150 | nng.total_elements[mem_area] = nng.total_elements.get(mem_area, 0) + sum(tens.elements() for tens in lrs.ranges) |
| 151 | |
Patrik Gustavsson | eca2e95 | 2020-05-27 09:15:11 +0200 | [diff] [blame] | 152 | print_allocation(lrs, mem_area, mem_type_set, sg, verbose_allocation, show_minimum_possible_allocation) |
Tim Hall | 79d07d2 | 2020-04-27 18:20:16 +0100 | [diff] [blame] | 153 | |
| 154 | if mem_area == MemArea.Sram: |
| 155 | # Mark Sram usage for all subgraphs |
| 156 | for sg_ in nng.subgraphs: |
| 157 | mark_sram_used_for_cascaded_passes(sg_, lrs) |
| 158 | |
| 159 | if sg == nng.get_root_subgraph(): |
| 160 | nng.memory_used = sg.memory_used |
| 161 | for mem_area in nng.total_elements.keys(): |
| 162 | try: |
| 163 | nng.bits_per_element[mem_area] = nng.total_size[mem_area] * 8 / nng.total_elements[mem_area] |
| 164 | except ZeroDivisionError: |
| 165 | nng.bits_per_element[mem_area] = 0.0 |