2 * Copyright (c) 2017 ARM Limited.
4 * SPDX-License-Identifier: MIT
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to
8 * deal in the Software without restriction, including without limitation the
9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10 * sell copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
24 #include "arm_compute/runtime/BlobLifetimeManager.h"
26 #include "arm_compute/core/Error.h"
27 #include "arm_compute/runtime/BlobMemoryPool.h"
28 #include "arm_compute/runtime/IAllocator.h"
29 #include "arm_compute/runtime/IMemoryGroup.h"
30 #include "support/ToolchainSupport.h"
37 using namespace arm_compute;
39 BlobLifetimeManager::BlobLifetimeManager()
44 std::unique_ptr<IMemoryPool> BlobLifetimeManager::create_pool(IAllocator *allocator)
46 ARM_COMPUTE_ERROR_ON(allocator == nullptr);
47 return support::cpp14::make_unique<BlobMemoryPool>(allocator, _blobs);
50 MappingType BlobLifetimeManager::mapping_type() const
52 return MappingType::BLOBS;
55 void BlobLifetimeManager::update_blobs_and_mappings()
57 ARM_COMPUTE_ERROR_ON(!are_all_finalized());
58 ARM_COMPUTE_ERROR_ON(_active_group == nullptr);
60 // Sort active group requirements in descending order.
61 std::sort(std::begin(_active_elements), std::end(_active_elements), [](const Element & a, const Element & b)
63 return a.size > b.size;
65 std::vector<size_t> group_sizes;
66 std::transform(std::begin(_active_elements), std::end(_active_elements), std::back_inserter(group_sizes), [](const Element & e)
72 size_t max_size = std::max(_blobs.size(), group_sizes.size());
73 _blobs.resize(max_size, 0);
74 group_sizes.resize(max_size, 0);
75 std::transform(std::begin(_blobs), std::end(_blobs), std::begin(group_sizes), std::begin(_blobs), [](size_t lhs, size_t rhs)
77 return std::max(lhs, rhs);
80 // Calculate group mappings
81 auto &group_mappings = _active_group->mappings();
83 for(auto &e : _active_elements)
85 group_mappings[e.handle] = blob_idx++;