| 1 | /******************************************************************************* |
| 2 | Copyright (C) Marvell International Ltd. and its affiliates |
| 3 | |
| 4 | This software file (the "File") is owned and distributed by Marvell |
| 5 | International Ltd. and/or its affiliates ("Marvell") under the following |
| 6 | alternative licensing terms. Once you have made an election to distribute the |
| 7 | File under one of the following license alternatives, please (i) delete this |
| 8 | introductory statement regarding license alternatives, (ii) delete the two |
| 9 | license alternatives that you have not elected to use and (iii) preserve the |
| 10 | Marvell copyright notice above. |
| 11 | |
| 12 | ******************************************************************************** |
| 13 | Marvell Commercial License Option |
| 14 | |
| 15 | If you received this File from Marvell and you have entered into a commercial |
| 16 | license agreement (a "Commercial License") with Marvell, the File is licensed |
| 17 | to you under the terms of the applicable Commercial License. |
| 18 | |
| 19 | ******************************************************************************** |
| 20 | Marvell GPL License Option |
| 21 | |
| 22 | If you received this File from Marvell, you may opt to use, redistribute and/or |
| 23 | modify this File in accordance with the terms and conditions of the General |
| 24 | Public License Version 2, June 1991 (the "GPL License"), a copy of which is |
| 25 | available along with the File in the license.txt file or by writing to the Free |
| 26 | Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or |
| 27 | on the worldwide web at http://www.gnu.org/licenses/gpl.txt. |
| 28 | |
| 29 | THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED |
| 30 | WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY |
| 31 | DISCLAIMED. The GPL License provides additional details about this warranty |
| 32 | disclaimer. |
| 33 | ******************************************************************************** |
| 34 | Marvell BSD License Option |
| 35 | |
| 36 | If you received this File from Marvell, you may opt to use, redistribute and/or |
| 37 | modify this File under the following licensing terms. |
| 38 | Redistribution and use in source and binary forms, with or without modification, |
| 39 | are permitted provided that the following conditions are met: |
| 40 | |
| 41 | * Redistributions of source code must retain the above copyright notice, |
| 42 | this list of conditions and the following disclaimer. |
| 43 | |
| 44 | * Redistributions in binary form must reproduce the above copyright |
| 45 | notice, this list of conditions and the following disclaimer in the |
| 46 | documentation and/or other materials provided with the distribution. |
| 47 | |
| 48 | * Neither the name of Marvell nor the names of its contributors may be |
| 49 | used to endorse or promote products derived from this software without |
| 50 | specific prior written permission. |
| 51 | |
| 52 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
| 53 | ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| 54 | WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 55 | DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR |
| 56 | ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 57 | (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 58 | LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON |
| 59 | ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 60 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 61 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 62 | |
| 63 | *******************************************************************************/ |
| 64 | |
| 65 | #include "mvOs.h" |
| 66 | #include "mvLru.h" |
| 67 | /* LRU Cache support */ |
| 68 | |
| 69 | |
| 70 | /* Init LRU cache database */ |
| 71 | MV_LRU_CACHE* mvLruCacheInit(int numOfEntries) |
| 72 | { |
| 73 | int i; |
| 74 | MV_LRU_CACHE* pLruCache; |
| 75 | |
| 76 | pLruCache = mvOsMalloc(sizeof(MV_LRU_CACHE)); |
| 77 | if(pLruCache == NULL) |
| 78 | { |
| 79 | return NULL; |
| 80 | } |
| 81 | memset(pLruCache, 0, sizeof(MV_LRU_CACHE)); |
| 82 | |
| 83 | pLruCache->table = mvOsMalloc(numOfEntries*sizeof(MV_LRU_ENTRY)); |
| 84 | if(pLruCache->table == NULL) |
| 85 | { |
| 86 | mvOsFree(pLruCache); |
| 87 | return NULL; |
| 88 | } |
| 89 | memset(pLruCache->table, 0, numOfEntries*sizeof(MV_LRU_ENTRY)); |
| 90 | pLruCache->tableSize = numOfEntries; |
| 91 | |
| 92 | for(i=0; i<numOfEntries; i++) |
| 93 | { |
| 94 | pLruCache->table[i].next = i+1; |
| 95 | pLruCache->table[i].prev = i-1; |
| 96 | } |
| 97 | pLruCache->least = 0; |
| 98 | pLruCache->most = numOfEntries-1; |
| 99 | |
| 100 | return pLruCache; |
| 101 | } |
| 102 | |
| 103 | void mvLruCacheFinish(MV_LRU_CACHE* pLruCache) |
| 104 | { |
| 105 | mvOsFree(pLruCache->table); |
| 106 | mvOsFree(pLruCache); |
| 107 | } |
| 108 | |
| 109 | /* Update LRU cache database after using cache Index */ |
| 110 | void mvLruCacheIdxUpdate(MV_LRU_CACHE* pLruHndl, int cacheIdx) |
| 111 | { |
| 112 | int prev, next; |
| 113 | |
| 114 | if(cacheIdx == pLruHndl->most) |
| 115 | return; |
| 116 | |
| 117 | next = pLruHndl->table[cacheIdx].next; |
| 118 | if(cacheIdx == pLruHndl->least) |
| 119 | { |
| 120 | pLruHndl->least = next; |
| 121 | } |
| 122 | else |
| 123 | { |
| 124 | prev = pLruHndl->table[cacheIdx].prev; |
| 125 | |
| 126 | pLruHndl->table[next].prev = prev; |
| 127 | pLruHndl->table[prev].next = next; |
| 128 | } |
| 129 | |
| 130 | pLruHndl->table[pLruHndl->most].next = cacheIdx; |
| 131 | pLruHndl->table[cacheIdx].prev = pLruHndl->most; |
| 132 | pLruHndl->most = cacheIdx; |
| 133 | } |
| 134 | |
| 135 | /* Delete LRU cache entry */ |
| 136 | void mvLruCacheIdxDelete(MV_LRU_CACHE* pLruHndl, int cacheIdx) |
| 137 | { |
| 138 | int prev, next; |
| 139 | |
| 140 | if(cacheIdx == pLruHndl->least) |
| 141 | return; |
| 142 | |
| 143 | prev = pLruHndl->table[cacheIdx].prev; |
| 144 | if(cacheIdx == pLruHndl->most) |
| 145 | { |
| 146 | pLruHndl->most = prev; |
| 147 | } |
| 148 | else |
| 149 | { |
| 150 | next = pLruHndl->table[cacheIdx].next; |
| 151 | |
| 152 | pLruHndl->table[next].prev = prev; |
| 153 | pLruHndl->table[prev].next = next; |
| 154 | } |
| 155 | pLruHndl->table[pLruHndl->least].prev = cacheIdx; |
| 156 | pLruHndl->table[cacheIdx].next = pLruHndl->least; |
| 157 | pLruHndl->least = cacheIdx; |
| 158 | } |
| 159 | |
