Ipaddressfilter_src
#include "stdafx.h"
#include "IPAddressFilter.h"
/*
Routine Description:
Looks up the ip address and confirms the host with that address is allowed
access to the server
Arguments:
pszIPAddress - The IP address to validate
pfValid - Set to TRUE if the client should be allowed
Return Value:
TRUE on success, FALSE on failure
*/
BOOL CIPAddressFilter::ValidateIPAddress(const CHAR* pszIPAddress, OUT BOOL* pfValid)
{
// Assume we're going to fail validation
*pfValid = FALSE;
BOOL fFound;
// Lookup the address in the cache, if that fails, get the address from the
// database and add the retrieved address to the cache
if ( !LookupIPAddressInCache( pszIPAddress, &fFound ))
return FALSE;
if ( !fFound )
{
if ( !LookupIPAddressInDb( pszIPAddress, &fFound ))
return FALSE;
if ( fFound )
AddIPAddressToCache( pszIPAddress );
}
if ( !fFound )
{
ISAPITRACE1("[ValidatepIPAddress] Failed to find address %s\n", pszIPAddress );
return TRUE;
}
*pfValid = TRUE;
return TRUE;
}
/*
Routine Description:
Retrieves the ip address list from the file. If the addressess were coming from a
database, this routine would connect to the database.
Return Value:
TRUE on success, FALSE on failure
*/
BOOL CIPAddressFilter::InitializeIPAddressDatabase()
{
DWORD cbRead;
// Open and read the file. The System account must have access to the file.
HANDLE hFile = CreateFile( IP_LIST_FILE, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, 0, NULL);
if ( hFile == INVALID_HANDLE_VALUE )
{
ISAPITRACE2("[InitializepIPAddressDatabase] Error %d openning %s\n", GetLastError(), IP_LIST_FILE );
return FALSE;
}
DWORD cbFile = GetFileSize( hFile, NULL );
if ( cbFile == (DWORD) -1 )
{
CloseHandle( hFile );
return FALSE;
}
m_pszIPAddressFile = (CHAR *)LocalAlloc( LPTR, cbFile + 1 );
if ( !m_pszIPAddressFile )
{
SetLastError( ERROR_NOT_ENOUGH_MEMORY );
CloseHandle( hFile );
return FALSE;
}
if ( !ReadFile( hFile, m_pszIPAddressFile, cbFile, &cbRead, NULL ))
{
CloseHandle( hFile );
LocalFree( m_pszIPAddressFile );
return FALSE;
}
CloseHandle( hFile );
// Zero terminate the file data
m_pszIPAddressFile[cbRead] = '\0';
return TRUE;
}
/*
Routine Description:
Looks up the IP address in the database
The file data is not sorted to simulate the cost of an external database
lookup.
Arguments:
pszIPAddress - The address to find in the database
pfFound - Set to TRUE if the specified address name was found in the
database
Return Value:
TRUE on success, FALSE on failure
*/
BOOL CIPAddressFilter::LookupIPAddressInDb(const CHAR* pszIPAddress, OUT BOOL* pfFound)
{
*pfFound = FALSE;
// Find the external ip address. We're expecting one address per line
CHAR* pch = m_pszIPAddressFile;
DWORD cchIPAddress = strlen( pszIPAddress );
while ( pch && *pch )
{
while ( ISWHITE( *pch ) )
pch++;
CHAR* pchend = strchr( pch+1, '\n' );
if (pchend && *(pchend-2) == '*') // -2 because of \r and \n
{
DWORD cchaddr = pchend-pch-2;
if (!cchaddr) // * alone in a line?
goto Found;
if ( *pch == *pszIPAddress && !strnicmp( pszIPAddress, pch, cchaddr ) )
goto Found;
}
else
if ( *pch == *pszIPAddress && !strnicmp( pszIPAddress, pch, cchIPAddress ) )
goto Found;
pch = pchend;
}
// Not found
return TRUE;
Found:
*pfFound = TRUE;
return TRUE;
}
/*
Routine Description:
Shutsdown the IP address database.
*/
VOID CIPAddressFilter::TerminateIPAddressDatabase()
{
if ( m_pszIPAddressFile )
LocalFree(m_pszIPAddressFile );
}
// IPADDRESSFILTER.CPP - Implementation file for your Internet Server
// IP Address Sample Filter
#include "stdafx.h"
#include "IPAddressFilter.h"
///////////////////////////////////////////////////////////////////////
// The one and only CWinApp object
// NOTE: You may remove this object if you alter your project to no
// longer use MFC in a DLL.
CWinApp theApp;
///////////////////////////////////////////////////////////////////////
// The one and only CIPAddressFilter object
CIPAddressFilter theFilter;
///////////////////////////////////////////////////////////////////////
// CIPAddressFilter static members
DWORD CIPAddressFilter::m_cCacheItems = 0;
CHAR* CIPAddressFilter::m_pszIPAddressFile = NULL;
LIST_ENTRY CIPAddressFilter::m_CacheListHead;
CRITICAL_SECTION CIPAddressFilter::m_csCacheLock;
///////////////////////////////////////////////////////////////////////
// CIPAddressFilter implementation
CIPAddressFilter::CIPAddressFilter()
{
m_fCacheInitialized = FALSE;
}
CIPAddressFilter::~CIPAddressFilter()
{
TerminateCache();
TerminateIPAddressDatabase();
}
BOOL CIPAddressFilter::Initialize()
{
return (InitializeIPAddressDatabase() && InitializeCache());
}
BOOL CIPAddressFilter::GetFilterVersion(PHTTP_FILTER_VERSION pVer)
{
ISAPITRACE2( "[GetFilterVersion] Server filter version is %d.%d\n",
HIWORD( pVer->dwServerFilterVersion ),
LOWORD( pVer->dwServerFilterVersion ) );
if ( !Initialize() )
{
ISAPITRACE1("[GetFilterVersion] Database or cache failed, error %d\n", GetLastError() );
return FALSE;
}
// Call default implementation for initialization
CHttpFilter::GetFilterVersion(pVer);
// Set the flags we are interested in
pVer->dwFlags = SF_NOTIFY_ORDER_DEFAULT |
SF_NOTIFY_SECURE_PORT | SF_NOTIFY_NONSECURE_PORT |
SF_NOTIFY_URL_MAP;
// Load description string
TCHAR sz[SF_MAX_FILTER_DESC_LEN+1];
ISAPIVERIFY(::LoadString(AfxGetResourceHandle(),
IDS_FILTER, sz, SF_MAX_FILTER_DESC_LEN));
_tcscpy(pVer->lpszFilterDesc, sz);
return TRUE;
}
DWORD CIPAddressFilter::OnUrlMap(CHttpFilterContext* pCtxt, PHTTP_FILTER_URL_MAP pMapInfo)
{
char szAddress[80];
DWORD dwSize = sizeof(szAddress);
if (pCtxt->GetServerVariable("REMOTE_ADDR", szAddress, &dwSize))
{
// Make sure this address is a valid address
BOOL fAllowed;
if ( !ValidateIPAddress(szAddress, &fAllowed ))
{
ISAPITRACE2("[OnUrlMap] Error %d validating address %s\n", GetLastError(), szAddress );
return SF_STATUS_REQ_ERROR;
}
if ( !fAllowed )
{
// This ip address isn't allowed access. Map to information URL
strncpy(pMapInfo->pszPhysicalPath, NO_ACCESS, pMapInfo->cbPathBuff-1);
}
}
return SF_STATUS_REQ_NEXT_NOTIFICATION;
}
// Do not edit the following lines, which are needed by ClassWizard.
#if 0
BEGIN_MESSAGE_MAP(CIPAddressFilter, CHttpFilter)
//{{AFX_MSG_MAP(CIPAddressFilter)
//}}AFX_MSG_MAP
END_MESSAGE_MAP()
#endif // 0
///////////////////////////////////////////////////////////////////////
// If your extension will not use MFC, you'll need this code to make
// sure the extension objects can find the resource handle for the
// module. If you convert your extension to not be dependent on MFC,
// remove the comments arounn the following AfxGetResourceHandle()
// and DllMain() functions, as well as the g_hInstance global.
/****
static HINSTANCE g_hInstance;
HINSTANCE AFXISAPI AfxGetResourceHandle()
{
return g_hInstance;
}
BOOL WINAPI DllMain(HINSTANCE hInst, ULONG ulReason,
LPVOID lpReserved)
{
if (ulReason == DLL_PROCESS_ATTACH)
{
g_hInstance = hInst;
}
return TRUE;
}
****/
相关推荐
无人机手势控制数据集46176张VOC+YOLO格式.zip
数据集格式:VOC格式+YOLO格式 压缩包内含:3个文件夹,分别存储图片、xml、txt文件 JPEGImages文件夹中jpg图片总计:46176 Annotations文件夹中xml文件总计:46176 labels文件夹中txt文件总计:46176 标签种类数:8 标签名称:["follow","follow_hand","land","land_hand","null","object","takeoff","takeoff-hand"] 每个标签的框数(注意yolo格式类别顺序不和这个对应,而以labels文件夹classes.txt为准): follow 框数 = 22056 follow_hand 框数 = 4038 land 框数 = 7609 land_hand 框数 = 3300 null 框数 = 2642 object 框数 = 2 takeoff 框数 = 3494 takeoff-hand 框数 = 3645 总框数:46786 图片清晰度(分辨率:像素):清晰 图片是否增强:否 标签形状:矩形框,用于目标检测识别 重要说明:暂无 特别声明:本数据集不对训练的模型或者权重文件精度作任何保证,数据集只提供准确且合理标注
三相光伏发电系统中MPPT和并网控制策略的研究(Simulink仿真实现)
内容概要:本文系统研究了三相光伏发电系统中的最大功率点跟踪(MPPT)与并网控制策略,深入分析光伏阵列在不同光照和温度条件下的输出特性,设计并实现了基于Simulink的完整仿真模型。该模型涵盖光伏阵列、DC-DC变换器、MPPT控制器、逆变器及锁相环等关键模块,重点验证了系统在动态环境变化下实现高效能量转换的能力,并确保并网电流符合电能质量标准。研究对比了多种MPPT算法的动态响应与稳定性表现,优化了并网控制策略以提升整体系统性能,为光伏系统的设计与控制提供了理论依据与仿真支持。; 适合人群:具备电力电子、自动控制或新能源发电基础知识的高校研究生、科研人员及从事光伏系统设计与仿真的工程技术人员。; 使用场景及目标:①用于教学与科研中深入理解光伏发电系统的MPPT原理与并网控制机制;②指导实际工程项目中光伏逆变器控制策略的设计与仿真验证;③为撰写相关学术论文或完成课程设计提供可复现的Simulink模型与理论支持。; 阅读建议:建议读者结合文中提供的Simulink仿真文件,逐步搭建系统模型,调试MPPT与并网控制参数,观察关键波形如光伏电压、电流、功率及并网电流的变化,加深对控制逻辑的理解。同时可尝试改进算法以进一步提升系统动态响应与鲁棒性。
无人驾驶网约车服务:全球市场规模、竞争格局与未来发展趋势.docx
无人驾驶网约车服务:全球市场规模、竞争格局与未来发展趋势
开绕组永磁同步电机模型FOC矢量控制SVPWM仿真Simulink模型
内容概要:本文系统解读了一套完整的多机器人路径规划(MAPF)MATLAB代码库,聚焦于优先级规划算法的工程实现。该框架采用四层架构设计(几何、拓扑、调度与呈现),实现了从地图解析、Petri网建模、基于动态边权膨胀的路径规划,到时间同步冲突消解及动画可视化的全流程。核心创新包括动态边权膨胀机制、节点预留历史查表优化、几何惩罚驱动的局部同步策略以及Petri网双阶段优化方法,有效提升了大规模场景下的求解效率与可行性。文章详细阐述了各模块之间的接口契约与不变量,对比分析了三种时间同步策略的适用场景,并强调了信息前移、模块解耦与可维护性设计的重要性,为MAPF的研究与教学提供了可复现、可批判的参考文本。; 适合人群:具备一定MATLAB编程基础,从事机器人路径规划、智能调度、自动化控制等相关领域的科研人员与研究生。; 使用场景及目标:① 学习并复现多机器人路径规划中的优先级规划算法及其工程实现细节;② 深入理解动态边权膨胀、节点预留历史、局部同步等核心机制的设计原理与性能优化策略;③ 掌握Petri网建模与整数规划在路径调度中的应用,以及多智能体系统冲突消解与可视化的方法。; 阅读建议:此资源以工程化框架形式呈现,不仅关注算法逻辑,更重视模块化设计与系统集成。建议读者按照数据流顺序逐步学习,结合代码调试理解各层交互,并尝试替换不同同步策略以评估其对效率与解质量的影响,从而深入掌握大规模MAPF问题的求解范式。
高校技术转移办公室人员如何高效完成科技成果评价与推介?.docx
科易网基于40亿+科创知识图谱数据库,深度探索AI技术在技术转移、成果转化、技术经纪、知识产权、产业创新、科技招商等垂直领域的多样化应用场景,研究科技创新领域的AI+数智化解决方案,推动科技创新与产业创新智能化发展。


