⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 spectrum.c

📁 ralink最新rt3070 usb wifi 无线网卡驱动程序
💻 C
📖 第 1 页 / 共 4 页
字号:
/* ************************************************************************* * Ralink Tech Inc. * 5F., No.36, Taiyuan St., Jhubei City, * Hsinchu County 302, * Taiwan, R.O.C. * * (c) Copyright 2002-2007, Ralink Technology, Inc. * * 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, write to the                         *  * Free Software Foundation, Inc.,                                       *  * 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *  *                                                                       *  *************************************************************************    Module Name:	action.c     Abstract:    Handle association related requests either from WSTA or from local MLME     Revision History:    Who          When          What    ---------    ----------    ----------------------------------------------	Fonchi Wu    2008	  	   created for 802.11h */#include "rt_config.h"#include "action.h"VOID MeasureReqTabInit(	IN PRTMP_ADAPTER pAd){	NdisAllocateSpinLock(&pAd->CommonCfg.MeasureReqTabLock);	pAd->CommonCfg.pMeasureReqTab = kmalloc(sizeof(MEASURE_REQ_TAB), GFP_ATOMIC);	if (pAd->CommonCfg.pMeasureReqTab)		NdisZeroMemory(pAd->CommonCfg.pMeasureReqTab, sizeof(MEASURE_REQ_TAB));	else		DBGPRINT(RT_DEBUG_ERROR, ("%s Fail to alloc memory for pAd->CommonCfg.pMeasureReqTab.\n", __FUNCTION__));	return;}VOID MeasureReqTabExit(	IN PRTMP_ADAPTER pAd){	NdisFreeSpinLock(pAd->CommonCfg.MeasureReqTabLock);	if (pAd->CommonCfg.pMeasureReqTab)		kfree(pAd->CommonCfg.pMeasureReqTab);	pAd->CommonCfg.pMeasureReqTab = NULL;	return;}static PMEASURE_REQ_ENTRY MeasureReqLookUp(	IN PRTMP_ADAPTER	pAd,	IN UINT8			DialogToken){	UINT HashIdx;	PMEASURE_REQ_TAB pTab = pAd->CommonCfg.pMeasureReqTab;	PMEASURE_REQ_ENTRY pEntry = NULL;	PMEASURE_REQ_ENTRY pPrevEntry = NULL;	if (pTab == NULL)	{		DBGPRINT(RT_DEBUG_ERROR, ("%s: pMeasureReqTab doesn't exist.\n", __FUNCTION__));		return NULL;	}	RTMP_SEM_LOCK(&pAd->CommonCfg.MeasureReqTabLock);	HashIdx = MQ_DIALOGTOKEN_HASH_INDEX(DialogToken);	pEntry = pTab->Hash[HashIdx];	while (pEntry)	{		if (pEntry->DialogToken == DialogToken) 			break;		else		{			pPrevEntry = pEntry;			pEntry = pEntry->pNext;		}	}	RTMP_SEM_UNLOCK(&pAd->CommonCfg.MeasureReqTabLock);		return pEntry;}static PMEASURE_REQ_ENTRY MeasureReqInsert(	IN PRTMP_ADAPTER	pAd,	IN UINT8			DialogToken){	INT i;	ULONG HashIdx;	PMEASURE_REQ_TAB pTab = pAd->CommonCfg.pMeasureReqTab;	PMEASURE_REQ_ENTRY pEntry = NULL, pCurrEntry;	ULONG Now;	if(pTab == NULL)	{		DBGPRINT(RT_DEBUG_ERROR, ("%s: pMeasureReqTab doesn't exist.\n", __FUNCTION__));		return NULL;	}	pEntry = MeasureReqLookUp(pAd, DialogToken);	if (pEntry == NULL)	{		RTMP_SEM_LOCK(&pAd->CommonCfg.MeasureReqTabLock);		for (i = 0; i < MAX_MEASURE_REQ_TAB_SIZE; i++)		{			NdisGetSystemUpTime(&Now);			pEntry = &pTab->Content[i]; 			if ((pEntry->Valid == TRUE)				&& RTMP_TIME_AFTER((unsigned long)Now, (unsigned long)(pEntry->lastTime + MQ_REQ_AGE_OUT)))			{				PMEASURE_REQ_ENTRY pPrevEntry = NULL;				ULONG HashIdx = MQ_DIALOGTOKEN_HASH_INDEX(pEntry->DialogToken);				PMEASURE_REQ_ENTRY pProbeEntry = pTab->Hash[HashIdx];				// update Hash list				do				{					if (pProbeEntry == pEntry)					{						if (pPrevEntry == NULL)						{							pTab->Hash[HashIdx] = pEntry->pNext;						}						else						{							pPrevEntry->pNext = pEntry->pNext;						}						break;					}					pPrevEntry = pProbeEntry;					pProbeEntry = pProbeEntry->pNext;				} while (pProbeEntry);				NdisZeroMemory(pEntry, sizeof(MEASURE_REQ_ENTRY));				pTab->Size--;				break;			} 			if (pEntry->Valid == FALSE)				break;		}		if (i < MAX_MEASURE_REQ_TAB_SIZE)		{			NdisGetSystemUpTime(&Now);			pEntry->lastTime = Now;			pEntry->Valid = TRUE;			pEntry->DialogToken = DialogToken;			pTab->Size++;		}		else		{			pEntry = NULL;			DBGPRINT(RT_DEBUG_ERROR, ("%s: pMeasureReqTab tab full.\n", __FUNCTION__));		}		// add this Neighbor entry into HASH table		if (pEntry)		{			HashIdx = MQ_DIALOGTOKEN_HASH_INDEX(DialogToken);			if (pTab->Hash[HashIdx] == NULL)			{				pTab->Hash[HashIdx] = pEntry;			}			else			{				pCurrEntry = pTab->Hash[HashIdx];				while (pCurrEntry->pNext != NULL)					pCurrEntry = pCurrEntry->pNext;				pCurrEntry->pNext = pEntry;			}		}		RTMP_SEM_UNLOCK(&pAd->CommonCfg.MeasureReqTabLock);	} 	return pEntry;}static VOID MeasureReqDelete(	IN PRTMP_ADAPTER	pAd,	IN UINT8			DialogToken){	PMEASURE_REQ_TAB pTab = pAd->CommonCfg.pMeasureReqTab;	PMEASURE_REQ_ENTRY pEntry = NULL;	if(pTab == NULL)	{		DBGPRINT(RT_DEBUG_ERROR, ("%s: pMeasureReqTab doesn't exist.\n", __FUNCTION__));		return;	}	// if empty, return	if (pTab->Size == 0) 	{		DBGPRINT(RT_DEBUG_ERROR, ("pMeasureReqTab empty.\n"));		return;	}	pEntry = MeasureReqLookUp(pAd, DialogToken);	if (pEntry != NULL)	{		PMEASURE_REQ_ENTRY pPrevEntry = NULL;		ULONG HashIdx = MQ_DIALOGTOKEN_HASH_INDEX(pEntry->DialogToken);		PMEASURE_REQ_ENTRY pProbeEntry = pTab->Hash[HashIdx];		RTMP_SEM_LOCK(&pAd->CommonCfg.MeasureReqTabLock);		// update Hash list		do		{			if (pProbeEntry == pEntry)			{				if (pPrevEntry == NULL)				{					pTab->Hash[HashIdx] = pEntry->pNext;				}				else				{					pPrevEntry->pNext = pEntry->pNext;				}				break;			}			pPrevEntry = pProbeEntry;			pProbeEntry = pProbeEntry->pNext;		} while (pProbeEntry);		NdisZeroMemory(pEntry, sizeof(MEASURE_REQ_ENTRY));		pTab->Size--;		RTMP_SEM_UNLOCK(&pAd->CommonCfg.MeasureReqTabLock);	}	return;}VOID TpcReqTabInit(	IN PRTMP_ADAPTER pAd){	NdisAllocateSpinLock(&pAd->CommonCfg.TpcReqTabLock);	pAd->CommonCfg.pTpcReqTab = kmalloc(sizeof(TPC_REQ_TAB), GFP_ATOMIC);	if (pAd->CommonCfg.pTpcReqTab)		NdisZeroMemory(pAd->CommonCfg.pTpcReqTab, sizeof(TPC_REQ_TAB));	else		DBGPRINT(RT_DEBUG_ERROR, ("%s Fail to alloc memory for pAd->CommonCfg.pTpcReqTab.\n", __FUNCTION__));	return;}VOID TpcReqTabExit(	IN PRTMP_ADAPTER pAd){	NdisFreeSpinLock(pAd->CommonCfg.TpcReqTabLock);	if (pAd->CommonCfg.pTpcReqTab)		kfree(pAd->CommonCfg.pTpcReqTab);	pAd->CommonCfg.pTpcReqTab = NULL;	return;}static PTPC_REQ_ENTRY TpcReqLookUp(	IN PRTMP_ADAPTER	pAd,	IN UINT8			DialogToken){	UINT HashIdx;	PTPC_REQ_TAB pTab = pAd->CommonCfg.pTpcReqTab;	PTPC_REQ_ENTRY pEntry = NULL;	PTPC_REQ_ENTRY pPrevEntry = NULL;	if (pTab == NULL)	{		DBGPRINT(RT_DEBUG_ERROR, ("%s: pTpcReqTab doesn't exist.\n", __FUNCTION__));		return NULL;	}	RTMP_SEM_LOCK(&pAd->CommonCfg.TpcReqTabLock);	HashIdx = TPC_DIALOGTOKEN_HASH_INDEX(DialogToken);	pEntry = pTab->Hash[HashIdx];	while (pEntry)	{		if (pEntry->DialogToken == DialogToken) 			break;		else		{			pPrevEntry = pEntry;			pEntry = pEntry->pNext;		}	}	RTMP_SEM_UNLOCK(&pAd->CommonCfg.TpcReqTabLock);		return pEntry;}static PTPC_REQ_ENTRY TpcReqInsert(	IN PRTMP_ADAPTER	pAd,	IN UINT8			DialogToken){	INT i;	ULONG HashIdx;	PTPC_REQ_TAB pTab = pAd->CommonCfg.pTpcReqTab;	PTPC_REQ_ENTRY pEntry = NULL, pCurrEntry;	ULONG Now;	if(pTab == NULL)	{		DBGPRINT(RT_DEBUG_ERROR, ("%s: pTpcReqTab doesn't exist.\n", __FUNCTION__));		return NULL;	}	pEntry = TpcReqLookUp(pAd, DialogToken);	if (pEntry == NULL)	{		RTMP_SEM_LOCK(&pAd->CommonCfg.TpcReqTabLock);		for (i = 0; i < MAX_TPC_REQ_TAB_SIZE; i++)		{			NdisGetSystemUpTime(&Now);			pEntry = &pTab->Content[i]; 			if ((pEntry->Valid == TRUE)				&& RTMP_TIME_AFTER((unsigned long)Now, (unsigned long)(pEntry->lastTime + TPC_REQ_AGE_OUT)))			{				PTPC_REQ_ENTRY pPrevEntry = NULL;				ULONG HashIdx = TPC_DIALOGTOKEN_HASH_INDEX(pEntry->DialogToken);				PTPC_REQ_ENTRY pProbeEntry = pTab->Hash[HashIdx];				// update Hash list				do				{					if (pProbeEntry == pEntry)					{						if (pPrevEntry == NULL)						{							pTab->Hash[HashIdx] = pEntry->pNext;						}						else						{							pPrevEntry->pNext = pEntry->pNext;						}						break;					}					pPrevEntry = pProbeEntry;					pProbeEntry = pProbeEntry->pNext;				} while (pProbeEntry);				NdisZeroMemory(pEntry, sizeof(TPC_REQ_ENTRY));				pTab->Size--;				break;			} 			if (pEntry->Valid == FALSE)				break;		}		if (i < MAX_TPC_REQ_TAB_SIZE)		{			NdisGetSystemUpTime(&Now);			pEntry->lastTime = Now;			pEntry->Valid = TRUE;			pEntry->DialogToken = DialogToken;			pTab->Size++;		}		else		{			pEntry = NULL;			DBGPRINT(RT_DEBUG_ERROR, ("%s: pTpcReqTab tab full.\n", __FUNCTION__));		}		// add this Neighbor entry into HASH table		if (pEntry)		{			HashIdx = TPC_DIALOGTOKEN_HASH_INDEX(DialogToken);			if (pTab->Hash[HashIdx] == NULL)			{				pTab->Hash[HashIdx] = pEntry;			}			else			{				pCurrEntry = pTab->Hash[HashIdx];				while (pCurrEntry->pNext != NULL)					pCurrEntry = pCurrEntry->pNext;				pCurrEntry->pNext = pEntry;			}		}		RTMP_SEM_UNLOCK(&pAd->CommonCfg.TpcReqTabLock);	} 	return pEntry;}static VOID TpcReqDelete(	IN PRTMP_ADAPTER	pAd,	IN UINT8			DialogToken){	PTPC_REQ_TAB pTab = pAd->CommonCfg.pTpcReqTab;	PTPC_REQ_ENTRY pEntry = NULL;	if(pTab == NULL)	{		DBGPRINT(RT_DEBUG_ERROR, ("%s: pTpcReqTab doesn't exist.\n", __FUNCTION__));		return;	}	// if empty, return	if (pTab->Size == 0) 	{		DBGPRINT(RT_DEBUG_ERROR, ("pTpcReqTab empty.\n"));		return;	}	pEntry = TpcReqLookUp(pAd, DialogToken);	if (pEntry != NULL)	{		PTPC_REQ_ENTRY pPrevEntry = NULL;		ULONG HashIdx = TPC_DIALOGTOKEN_HASH_INDEX(pEntry->DialogToken);		PTPC_REQ_ENTRY pProbeEntry = pTab->Hash[HashIdx];		RTMP_SEM_LOCK(&pAd->CommonCfg.TpcReqTabLock);		// update Hash list		do		{			if (pProbeEntry == pEntry)			{				if (pPrevEntry == NULL)				{					pTab->Hash[HashIdx] = pEntry->pNext;				}				else				{					pPrevEntry->pNext = pEntry->pNext;				}				break;			}			pPrevEntry = pProbeEntry;			pProbeEntry = pProbeEntry->pNext;		} while (pProbeEntry);		NdisZeroMemory(pEntry, sizeof(TPC_REQ_ENTRY));

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -