dbdf20db53
This is a mixture ofcMichael McTernan's patch and the existing cplb-mpu code.
We ditch the old cplb-nompu implementation, which is a good example of
why a good algorithm in a HLL is preferrable to a bad algorithm written in
assembly. Rather than try to construct a table of all posible CPLBs and
search it, we just create a (smaller) table of memory regions and
their attributes. Some of the data structures are now unified for both
the mpu and nompu cases. A lot of needless complexity in cplbinit.c is
removed.
Further optimizations:
* compile cplbmgr.c with a lot of -ffixed-reg options, and omit saving
these registers on the stack when entering a CPLB exception.
* lose cli/nop/nop/sti sequences for some workarounds - these don't
* make
sense in an exception context
Additional code unification should be possible after this.
[Mike Frysinger <vapier.adi@gmail.com>:
- convert CPP if statements to C if statements
- remove redundant statements
- use a do...while loop rather than a for loop to get slightly better
optimization and to avoid gcc "may be used uninitialized" warnings ...
we know that the [id]cplb_nr_bounds variables will never be 0, so this
is OK
- the no-mpu code was the last user of MAX_MEM_SIZE and with that rewritten,
we can punt it
- add some BUG_ON() checks to make sure we dont overflow the small
cplb_bounds array
- add i/d cplb entries for the bootrom because there is functions/data in
there we want to access
- we do not need a NULL trailing entry as any time we access the bounds
arrays, we use the nr_bounds variable
]
Signed-off-by: Michael McTernan <mmcternan@airvana.com>
Signed-off-by: Mike Frysinger <vapier.adi@gmail.com>
Signed-off-by: Bernd Schmidt <bernds_cb1@t-online.de>
Signed-off-by: Bryan Wu <cooloney@kernel.org>
113 lines
3.3 KiB
C
113 lines
3.3 KiB
C
/*
|
|
* Blackfin CPLB initialization
|
|
*
|
|
* Copyright 2004-2007 Analog Devices Inc.
|
|
*
|
|
* Bugs: Enter bugs at http://blackfin.uclinux.org/
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, see the file COPYING, or write
|
|
* to the Free Software Foundation, Inc.,
|
|
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
#include <linux/module.h>
|
|
|
|
#include <asm/blackfin.h>
|
|
#include <asm/cplb.h>
|
|
#include <asm/cplbinit.h>
|
|
#include <asm/mem_map.h>
|
|
|
|
#if ANOMALY_05000263
|
|
# error the MPU will not function safely while Anomaly 05000263 applies
|
|
#endif
|
|
|
|
struct cplb_entry icplb_tbl[NR_CPUS][MAX_CPLBS];
|
|
struct cplb_entry dcplb_tbl[NR_CPUS][MAX_CPLBS];
|
|
|
|
int first_switched_icplb, first_switched_dcplb;
|
|
int first_mask_dcplb;
|
|
|
|
void __init generate_cplb_tables_cpu(unsigned int cpu)
|
|
{
|
|
int i_d, i_i;
|
|
unsigned long addr;
|
|
unsigned long d_data, i_data;
|
|
unsigned long d_cache = 0, i_cache = 0;
|
|
|
|
printk(KERN_INFO "MPU: setting up cplb tables with memory protection\n");
|
|
|
|
#ifdef CONFIG_BFIN_ICACHE
|
|
i_cache = CPLB_L1_CHBL | ANOMALY_05000158_WORKAROUND;
|
|
#endif
|
|
|
|
#ifdef CONFIG_BFIN_DCACHE
|
|
d_cache = CPLB_L1_CHBL;
|
|
#ifdef CONFIG_BFIN_WT
|
|
d_cache |= CPLB_L1_AOW | CPLB_WT;
|
|
#endif
|
|
#endif
|
|
|
|
i_d = i_i = 0;
|
|
|
|
/* Set up the zero page. */
|
|
dcplb_tbl[cpu][i_d].addr = 0;
|
|
dcplb_tbl[cpu][i_d++].data = SDRAM_OOPS | PAGE_SIZE_1KB;
|
|
|
|
#if 0
|
|
icplb_tbl[cpu][i_i].addr = 0;
|
|
icplb_tbl[cpu][i_i++].data = i_cache | CPLB_USER_RD | PAGE_SIZE_4KB;
|
|
#endif
|
|
|
|
/* Cover kernel memory with 4M pages. */
|
|
addr = 0;
|
|
d_data = d_cache | CPLB_SUPV_WR | CPLB_VALID | PAGE_SIZE_4MB | CPLB_DIRTY;
|
|
i_data = i_cache | CPLB_VALID | CPLB_PORTPRIO | PAGE_SIZE_4MB;
|
|
|
|
for (; addr < memory_start; addr += 4 * 1024 * 1024) {
|
|
dcplb_tbl[cpu][i_d].addr = addr;
|
|
dcplb_tbl[cpu][i_d++].data = d_data;
|
|
icplb_tbl[cpu][i_i].addr = addr;
|
|
icplb_tbl[cpu][i_i++].data = i_data | (addr == 0 ? CPLB_USER_RD : 0);
|
|
}
|
|
|
|
/* Cover L1 memory. One 4M area for code and data each is enough. */
|
|
#if L1_DATA_A_LENGTH > 0 || L1_DATA_B_LENGTH > 0
|
|
dcplb_tbl[cpu][i_d].addr = get_l1_data_a_start_cpu(cpu);
|
|
dcplb_tbl[cpu][i_d++].data = L1_DMEMORY | PAGE_SIZE_4MB;
|
|
#endif
|
|
#if L1_CODE_LENGTH > 0
|
|
icplb_tbl[cpu][i_i].addr = get_l1_code_start_cpu(cpu);
|
|
icplb_tbl[cpu][i_i++].data = L1_IMEMORY | PAGE_SIZE_4MB;
|
|
#endif
|
|
|
|
/* Cover L2 memory */
|
|
#if L2_LENGTH > 0
|
|
dcplb_tbl[cpu][i_d].addr = L2_START;
|
|
dcplb_tbl[cpu][i_d++].data = L2_DMEMORY | PAGE_SIZE_1MB;
|
|
icplb_tbl[cpu][i_i].addr = L2_START;
|
|
icplb_tbl[cpu][i_i++].data = L2_IMEMORY | PAGE_SIZE_1MB;
|
|
#endif
|
|
|
|
first_mask_dcplb = i_d;
|
|
first_switched_dcplb = i_d + (1 << page_mask_order);
|
|
first_switched_icplb = i_i;
|
|
|
|
while (i_d < MAX_CPLBS)
|
|
dcplb_tbl[cpu][i_d++].data = 0;
|
|
while (i_i < MAX_CPLBS)
|
|
icplb_tbl[cpu][i_i++].data = 0;
|
|
}
|
|
|
|
void generate_cplb_tables_all(void)
|
|
{
|
|
}
|