Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
cache.h
Go to the documentation of this file.
1 /* MN103E010 Cache specification
2  *
3  * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
4  * Written by David Howells ([email protected])
5  *
6  * This program is free software; you can redistribute it and/or
7  * modify it under the terms of the GNU General Public Licence
8  * as published by the Free Software Foundation; either version
9  * 2 of the Licence, or (at your option) any later version.
10  */
11 #ifndef _ASM_PROC_CACHE_H
12 #define _ASM_PROC_CACHE_H
13 
14 /* L1 cache */
15 
16 #define L1_CACHE_NWAYS 4 /* number of ways in caches */
17 #define L1_CACHE_NENTRIES 256 /* number of entries in each way */
18 #define L1_CACHE_BYTES 16 /* bytes per entry */
19 #define L1_CACHE_SHIFT 4 /* shift for bytes per entry */
20 #define L1_CACHE_WAYDISP 0x1000 /* displacement of one way from the next */
21 
22 #define L1_CACHE_TAG_VALID 0x00000001 /* cache tag valid bit */
23 #define L1_CACHE_TAG_DIRTY 0x00000008 /* data cache tag dirty bit */
24 #define L1_CACHE_TAG_ENTRY 0x00000ff0 /* cache tag entry address mask */
25 #define L1_CACHE_TAG_ADDRESS 0xfffff000 /* cache tag line address mask */
26 #define L1_CACHE_TAG_MASK +(L1_CACHE_TAG_ADDRESS|L1_CACHE_TAG_ENTRY)
27 
28 /*
29  * specification of the interval between interrupt checking intervals whilst
30  * managing the cache with the interrupts disabled
31  */
32 #define MN10300_DCACHE_INV_RANGE_INTR_LOG2_INTERVAL 4
33 
34 /*
35  * The size of range at which it becomes more economical to just flush the
36  * whole cache rather than trying to flush the specified range.
37  */
38 #define MN10300_DCACHE_FLUSH_BORDER \
39  +(L1_CACHE_NWAYS * L1_CACHE_NENTRIES * L1_CACHE_BYTES)
40 #define MN10300_DCACHE_FLUSH_INV_BORDER \
41  +(L1_CACHE_NWAYS * L1_CACHE_NENTRIES * L1_CACHE_BYTES)
42 
43 #endif /* _ASM_PROC_CACHE_H */