Vikram Kanigiri | 40d468c | 2014-12-23 01:00:22 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2015, ARM Limited and Contributors. All rights reserved. |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions are met: |
| 6 | * |
| 7 | * Redistributions of source code must retain the above copyright notice, this |
| 8 | * list of conditions and the following disclaimer. |
| 9 | * |
| 10 | * Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * |
| 14 | * Neither the name of ARM nor the names of its contributors may be used |
| 15 | * to endorse or promote products derived from this software without specific |
| 16 | * prior written permission. |
| 17 | * |
| 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
| 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 28 | * POSSIBILITY OF SUCH DAMAGE. |
| 29 | */ |
| 30 | |
| 31 | #include <arch.h> |
| 32 | #include <assert.h> |
| 33 | #include <cci.h> |
| 34 | #include <debug.h> |
| 35 | #include <mmio.h> |
Juan Castillo | 7f1f062 | 2014-09-09 09:49:23 +0100 | [diff] [blame] | 36 | #include <stdint.h> |
Vikram Kanigiri | 40d468c | 2014-12-23 01:00:22 +0000 | [diff] [blame] | 37 | |
Juan Castillo | 7f1f062 | 2014-09-09 09:49:23 +0100 | [diff] [blame] | 38 | static uintptr_t g_cci_base; |
Vikram Kanigiri | 40d468c | 2014-12-23 01:00:22 +0000 | [diff] [blame] | 39 | static unsigned int g_max_master_id; |
| 40 | static const int *g_cci_slave_if_map; |
| 41 | |
| 42 | #if DEBUG |
| 43 | static int validate_cci_map(const int *map) |
| 44 | { |
| 45 | unsigned int valid_cci_map = 0; |
| 46 | int slave_if_id; |
| 47 | int i; |
| 48 | |
| 49 | /* Validate the map */ |
| 50 | for (i = 0; i <= g_max_master_id; i++) { |
| 51 | slave_if_id = map[i]; |
| 52 | |
| 53 | if (slave_if_id < 0) |
| 54 | continue; |
| 55 | |
| 56 | if (slave_if_id >= CCI_SLAVE_INTERFACE_COUNT) { |
| 57 | tf_printf("Slave interface ID is invalid\n"); |
| 58 | return 0; |
| 59 | } |
| 60 | |
| 61 | if (valid_cci_map & (1 << slave_if_id)) { |
| 62 | tf_printf("Multiple masters are assigned same" |
| 63 | " slave interface ID\n"); |
| 64 | return 0; |
| 65 | } |
| 66 | valid_cci_map |= 1 << slave_if_id; |
| 67 | } |
| 68 | |
| 69 | if (!valid_cci_map) { |
| 70 | tf_printf("No master is assigned a valid slave interface\n"); |
| 71 | return 0; |
| 72 | } |
| 73 | |
| 74 | return 1; |
| 75 | } |
| 76 | #endif /* DEBUG */ |
| 77 | |
Juan Castillo | 7f1f062 | 2014-09-09 09:49:23 +0100 | [diff] [blame] | 78 | void cci_init(uintptr_t cci_base, |
Vikram Kanigiri | 40d468c | 2014-12-23 01:00:22 +0000 | [diff] [blame] | 79 | const int *map, |
| 80 | unsigned int num_cci_masters) |
| 81 | { |
| 82 | assert(map); |
| 83 | assert(cci_base); |
| 84 | |
| 85 | g_cci_base = cci_base; |
| 86 | |
| 87 | /* |
| 88 | * Master Id's are assigned from zero, So in an array of size n |
| 89 | * the max master id is (n - 1). |
| 90 | */ |
| 91 | g_max_master_id = num_cci_masters - 1; |
| 92 | |
| 93 | assert(validate_cci_map(map)); |
| 94 | g_cci_slave_if_map = map; |
| 95 | } |
| 96 | |
| 97 | void cci_enable_snoop_dvm_reqs(unsigned int master_id) |
| 98 | { |
| 99 | int slave_if_id; |
| 100 | |
| 101 | assert(g_cci_base); |
| 102 | assert(master_id <= g_max_master_id); |
| 103 | |
| 104 | slave_if_id = g_cci_slave_if_map[master_id]; |
| 105 | assert((slave_if_id < CCI_SLAVE_INTERFACE_COUNT) && (slave_if_id >= 0)); |
| 106 | |
| 107 | /* |
| 108 | * Enable Snoops and DVM messages, no need for Read/Modify/Write as |
| 109 | * rest of bits are write ignore |
| 110 | */ |
| 111 | mmio_write_32(g_cci_base + |
| 112 | SLAVE_IFACE_OFFSET(slave_if_id) + |
| 113 | SNOOP_CTRL_REG, DVM_EN_BIT | SNOOP_EN_BIT); |
| 114 | |
| 115 | /* Wait for the dust to settle down */ |
| 116 | while (mmio_read_32(g_cci_base + STATUS_REG) & CHANGE_PENDING_BIT) |
| 117 | ; |
| 118 | } |
| 119 | |
| 120 | void cci_disable_snoop_dvm_reqs(unsigned int master_id) |
| 121 | { |
| 122 | int slave_if_id; |
| 123 | |
| 124 | assert(g_cci_base); |
| 125 | assert(master_id <= g_max_master_id); |
| 126 | |
| 127 | slave_if_id = g_cci_slave_if_map[master_id]; |
| 128 | assert((slave_if_id < CCI_SLAVE_INTERFACE_COUNT) && (slave_if_id >= 0)); |
| 129 | |
| 130 | /* |
| 131 | * Disable Snoops and DVM messages, no need for Read/Modify/Write as |
| 132 | * rest of bits are write ignore. |
| 133 | */ |
| 134 | mmio_write_32(g_cci_base + |
| 135 | SLAVE_IFACE_OFFSET(slave_if_id) + |
| 136 | SNOOP_CTRL_REG, ~(DVM_EN_BIT | SNOOP_EN_BIT)); |
| 137 | |
| 138 | /* Wait for the dust to settle down */ |
| 139 | while (mmio_read_32(g_cci_base + STATUS_REG) & CHANGE_PENDING_BIT) |
| 140 | ; |
| 141 | } |
| 142 | |