| 1 | /* |
| 2 | * Copyright (c) 2017, Max Filippov, Open Source and Linux Lab. |
| 3 | * All rights reserved. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions are met: |
| 7 | * * Redistributions of source code must retain the above copyright |
| 8 | * notice, this list of conditions and the following disclaimer. |
| 9 | * * Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * * Neither the name of the Open Source and Linux Lab nor the |
| 13 | * names of its contributors may be used to endorse or promote products |
| 14 | * derived from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
| 20 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 21 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 22 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| 23 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 24 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 25 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #include "qemu/osdep.h" |
| 29 | #include "qapi/error.h" |
| 30 | #include "system/memory.h" |
| 31 | #include "qemu/error-report.h" |
| 32 | #include "xtensa_memory.h" |
| 33 | |
| 34 | void xtensa_create_memory_regions(const XtensaMemory *memory, |
| 35 | const char *name, |
| 36 | MemoryRegion *super) |
| 37 | { |
| 38 | unsigned i; |
| 39 | GString *num_name = g_string_new(NULL); |
| 40 | |
| 41 | for (i = 0; i < memory->num; ++i) { |
| 42 | MemoryRegion *m; |
| 43 | |
| 44 | g_string_printf(num_name, "%s%u", name, i); |
| 45 | m = g_new(MemoryRegion, 1); |
| 46 | memory_region_init_ram(m, NULL, num_name->str, |
| 47 | memory->location[i].size, &error_fatal); |
| 48 | memory_region_add_subregion(super, memory->location[i].addr, m); |
| 49 | } |
| 50 | g_string_free(num_name, true); |
| 51 | } |