summaryrefslogtreecommitdiff
path: root/target/linux/generic-2.4/files/crypto/ocf/kirkwood/cesa/mvLru.c
diff options
context:
space:
mode:
Diffstat (limited to 'target/linux/generic-2.4/files/crypto/ocf/kirkwood/cesa/mvLru.c')
-rw-r--r--target/linux/generic-2.4/files/crypto/ocf/kirkwood/cesa/mvLru.c158
1 files changed, 0 insertions, 158 deletions
diff --git a/target/linux/generic-2.4/files/crypto/ocf/kirkwood/cesa/mvLru.c b/target/linux/generic-2.4/files/crypto/ocf/kirkwood/cesa/mvLru.c
deleted file mode 100644
index 9ab29a883a..0000000000
--- a/target/linux/generic-2.4/files/crypto/ocf/kirkwood/cesa/mvLru.c
+++ /dev/null
@@ -1,158 +0,0 @@
-/*******************************************************************************
-Copyright (C) Marvell International Ltd. and its affiliates
-
-This software file (the "File") is owned and distributed by Marvell
-International Ltd. and/or its affiliates ("Marvell") under the following
-alternative licensing terms. Once you have made an election to distribute the
-File under one of the following license alternatives, please (i) delete this
-introductory statement regarding license alternatives, (ii) delete the two
-license alternatives that you have not elected to use and (iii) preserve the
-Marvell copyright notice above.
-
-********************************************************************************
-Marvell Commercial License Option
-
-If you received this File from Marvell and you have entered into a commercial
-license agreement (a "Commercial License") with Marvell, the File is licensed
-to you under the terms of the applicable Commercial License.
-
-********************************************************************************
-Marvell GPL License Option
-
-If you received this File from Marvell, you may opt to use, redistribute and/or
-modify this File in accordance with the terms and conditions of the General
-Public License Version 2, June 1991 (the "GPL License"), a copy of which is
-available along with the File in the license.txt file or by writing to the Free
-Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 or
-on the worldwide web at http://www.gnu.org/licenses/gpl.txt.
-
-THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE IMPLIED
-WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE ARE EXPRESSLY
-DISCLAIMED. The GPL License provides additional details about this warranty
-disclaimer.
-********************************************************************************
-Marvell BSD License Option
-
-If you received this File from Marvell, you may opt to use, redistribute and/or
-modify this File under the following licensing terms.
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
- * Redistributions of source code must retain the above copyright notice,
- this list of conditions and the following disclaimer.
-
- * Redistributions in binary form must reproduce the above copyright
- notice, this list of conditions and the following disclaimer in the
- documentation and/or other materials provided with the distribution.
-
- * Neither the name of Marvell nor the names of its contributors may be
- used to endorse or promote products derived from this software without
- specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-*******************************************************************************/
-
-#include "mvOs.h"
-#include "mvLru.h"
-/* LRU Cache support */
-
-
-/* Init LRU cache database */
-MV_LRU_CACHE* mvLruCacheInit(int numOfEntries)
-{
- int i;
- MV_LRU_CACHE* pLruCache;
-
- pLruCache = mvOsMalloc(sizeof(MV_LRU_CACHE));
- if(pLruCache == NULL)
- {
- return NULL;
- }
- memset(pLruCache, 0, sizeof(MV_LRU_CACHE));
-
- pLruCache->table = mvOsMalloc(numOfEntries*sizeof(MV_LRU_ENTRY));
- if(pLruCache->table == NULL)
- {
- mvOsFree(pLruCache);
- return NULL;
- }
- memset(pLruCache->table, 0, numOfEntries*sizeof(MV_LRU_ENTRY));
- pLruCache->tableSize = numOfEntries;
-
- for(i=0; i<numOfEntries; i++)
- {
- pLruCache->table[i].next = i+1;
- pLruCache->table[i].prev = i-1;
- }
- pLruCache->least = 0;
- pLruCache->most = numOfEntries-1;
-
- return pLruCache;
-}
-
-void mvLruCacheFinish(MV_LRU_CACHE* pLruCache)
-{
- mvOsFree(pLruCache->table);
- mvOsFree(pLruCache);
-}
-
-/* Update LRU cache database after using cache Index */
-void mvLruCacheIdxUpdate(MV_LRU_CACHE* pLruHndl, int cacheIdx)
-{
- int prev, next;
-
- if(cacheIdx == pLruHndl->most)
- return;
-
- next = pLruHndl->table[cacheIdx].next;
- if(cacheIdx == pLruHndl->least)
- {
- pLruHndl->least = next;
- }
- else
- {
- prev = pLruHndl->table[cacheIdx].prev;
-
- pLruHndl->table[next].prev = prev;
- pLruHndl->table[prev].next = next;
- }
-
- pLruHndl->table[pLruHndl->most].next = cacheIdx;
- pLruHndl->table[cacheIdx].prev = pLruHndl->most;
- pLruHndl->most = cacheIdx;
-}
-
-/* Delete LRU cache entry */
-void mvLruCacheIdxDelete(MV_LRU_CACHE* pLruHndl, int cacheIdx)
-{
- int prev, next;
-
- if(cacheIdx == pLruHndl->least)
- return;
-
- prev = pLruHndl->table[cacheIdx].prev;
- if(cacheIdx == pLruHndl->most)
- {
- pLruHndl->most = prev;
- }
- else
- {
- next = pLruHndl->table[cacheIdx].next;
-
- pLruHndl->table[next].prev = prev;
- pLruHndl->table[prev].next = next;
- }
- pLruHndl->table[pLruHndl->least].prev = cacheIdx;
- pLruHndl->table[cacheIdx].next = pLruHndl->least;
- pLruHndl->least = cacheIdx;
-}