woaidongmao

文章均收錄自他人博客，但不喜標(biāo)題前加-[轉(zhuǎn)貼]，因其丑陋，見諒！~

隨筆 - 1469, 文章 - 0, 評(píng)論 - 661, 引用 - 0

數(shù)據(jù)加載中……

內(nèi)存搜索與解析

char*            MemFind(const void* src_buf, int src_len, const void* find_buf, int find_len);
BOOL            ParserMem(const void* src_buf, int src_len, const vector< vector<char> >& vec_par, vector< vector<char> >& vec_result);//---- 多重二進(jìn)制分割
BOOL            ParserMem(const void* src_buf, int src_len, const vector<char>& vec_par, vector< vector<char> >& vec_result);//---- 單層二進(jìn)制分割
BOOL            ParserMem(const void* src_buf, int src_len, const char* par_buf, vector< vector<char> >& vec_result);//---- 字符分割
BOOL            ParserMem(const void* src_buf, int src_len, const char* par_buf, vector<string>& vec_result);//---- 字符分割

char* Glob_Fun::MemFind(const void* src_buf, int src_len, const void* find_buf, int find_len)
{
    if ((NULL == src_buf) || (NULL == find_buf)
        || (src_len <= 0) || (find_len <= 0))
        return NULL;

    char*cp = (char*)src_buf;
    char*src_end = (char*)src_buf + src_len;
    char*find_end = (char*)find_buf + find_len;
    char*s_src = NULL, *s_find = NULL;
    while (cp < src_end)
    {
        s_src = cp;
        s_find = (char*)find_buf;
        while (s_src < src_end && s_find < find_end && *s_src == *s_find)
            ++s_src, ++s_find;
        if (s_find == find_end)
            return(cp);
        ++cp;
    }
    return(NULL);
}

BOOL Glob_Fun::ParserMem(
                         const void*                    src_buf,
                         int                            src_len,
                         const vector< vector<char> >&    vec_par,
                         vector< vector<char> >&        vec_result)
{
    if ((NULL == src_buf) || (src_len <= 0) || vec_par.size() <= 0)
        return FALSE;
    for (size_t t = 0; t < vec_par.size(); ++t)
    {
        if(0 >= vec_par[t].size())
            return FALSE;
    }

vec_result.clear();

    vector<char> vec_tmp;
    BOOL bMatched = FALSE;
    int nParCount = vec_par.size();
    int nParTick = 0;
    char*cp = (char*)src_buf;
    char*src_end = (char*)src_buf + src_len;
    int nParLen = (int)vec_par[0].size();
    char*find_buf = (char*)&(vec_par[0][0]);
    char*find_end = find_buf + nParLen;
    char*s_src = NULL, *s_find = NULL;

    while (cp < src_end)
    {
        s_src = cp;
        s_find = (char*)find_buf;
        while (s_src < src_end && s_find < find_end && *s_src == *s_find)
            ++s_src,++s_find;
        if (s_find == find_end)
        {
            bMatched = TRUE;
            cp += nParLen;
            vec_result.push_back(vec_tmp);
            vec_tmp.clear();
            ++nParTick;
            if(nParCount == nParTick)
                nParTick = 0;
            nParLen = (int)(vec_par[nParTick].size());
            find_buf = (char*)&(vec_par[nParTick][0]);
            find_end = find_buf + nParLen;
        }
        else
        {
            vec_tmp.push_back(*cp);
            ++cp;
        }
    }
    if(TRUE == bMatched)
        vec_result.push_back(vec_tmp);
    return(bMatched);
}

BOOL Glob_Fun::ParserMem(
                         const void*                    src_buf,
                         int                            src_len,
                         const vector<char>&            vec_par,
                         vector< vector<char> >&        vec_result)
{
    if ((NULL == src_buf) || (src_len <= 0) || vec_par.size() <= 0)
        return FALSE;
    vec_result.clear();

    vector<char> vec_tmp;
    BOOL bMatched = FALSE;
    char*cp = (char*)src_buf;
    char*src_end = (char*)src_buf + src_len;
    int nParLen = (int)vec_par.size();
    char*find_buf = (char*)&(vec_par[0]);
    char*find_end = find_buf + nParLen;
    char*s_src = NULL, *s_find = NULL;

    while (cp < src_end)
    {
        s_src = cp;
        s_find = (char*)find_buf;
        while (s_src < src_end && s_find < find_end && *s_src == *s_find)
            ++s_src, ++s_find;
        if (s_find == find_end)
        {
            bMatched = TRUE;
            cp += nParLen;
            vec_result.push_back(vec_tmp);
            vec_tmp.clear();
        }
        else
        {
            vec_tmp.push_back(*cp);
            ++cp;
        }
    }
    if(TRUE == bMatched)
        vec_result.push_back(vec_tmp);
    return(bMatched);
}

BOOL Glob_Fun::ParserMem(
                         const void*                    src_buf,
                         int                            src_len,
                         const char*                    par_buf,
                         vector< vector<char> >&        vec_result)
{
    if ((NULL == src_buf) || (src_len <= 0) || strlen(par_buf) <= 0)
        return FALSE;
    vec_result.clear();

    vector<char> vec_tmp;
    BOOL bMatched = FALSE;
    char*cp = (char*)src_buf;
    char*src_end = (char*)src_buf + src_len;
    int nParLen = strlen(par_buf);
    char*find_buf = (char*)par_buf;
    char*find_end = find_buf + nParLen;
    char*s_src = NULL, *s_find = NULL;

    while (cp < src_end)
    {
        s_src = cp;
        s_find = (char*)find_buf;
        while (s_src < src_end && s_find < find_end && *s_src == *s_find)
            ++s_src, ++s_find;
        if (s_find == find_end)
        {
            bMatched = TRUE;
            cp += nParLen;
            vec_result.push_back(vec_tmp);
            vec_tmp.clear();
        }
        else
        {
            vec_tmp.push_back(*cp);
            ++cp;
        }
    }
    if(TRUE == bMatched)
        vec_result.push_back(vec_tmp);
    return(bMatched);
}

BOOL Glob_Fun::ParserMem(
                         const void*                    src_buf,
                         int                            src_len,
                         const char*                    par_buf,
                         vector<string>&                vec_result)
{
    if ((NULL == src_buf) || (src_len <= 0) || strlen(par_buf) <= 0)
        return FALSE;
    vec_result.clear();

    string vec_tmp;
    BOOL bMatched = FALSE;
    char*cp = (char*)src_buf;
    char*src_end = (char*)src_buf + src_len;
    int nParLen = strlen(par_buf);
    char*find_buf = (char*)par_buf;
    char*find_end = find_buf + nParLen;
    char*s_src = NULL, *s_find = NULL;

    while (cp < src_end)
    {
        s_src = cp;
        s_find = (char*)find_buf;
        while (s_src < src_end && s_find < find_end && *s_src == *s_find)
            ++s_src, ++s_find;
        if (s_find == find_end)
        {
            bMatched = TRUE;
            cp += nParLen;
            vec_result.push_back(vec_tmp);
            vec_tmp.clear();
        }
        else
        {
            vec_tmp.push_back(*cp);
            ++cp;
        }
    }
    if(TRUE == bMatched)
        vec_result.push_back(vec_tmp);
    return(bMatched);
}

posted on 2008-06-23 15:43 肥仔閱讀(1696) 評(píng)論(1) 編輯收藏引用所屬分類: 庫(kù) & 代碼段

評(píng)論

# re: 內(nèi)存搜索與解析[未登錄] 回復(fù) 更多評(píng)論

good

2009-04-20 16:38 | a

刷新評(píng)論列表

只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
【推薦】100%開源！大型工業(yè)跨平臺(tái)軟件C++源碼提供，建模，組態(tài)！

相關(guān)文章: 支持gzip的爬蟲 gzip zlib deflate 相關(guān)介紹 zlib用法簡(jiǎn)單說明利用 VC 編譯 Pcre 怎么使用PCRE庫(kù)？ VC++中使用Zlib的一個(gè)例子 vc下zlib編譯出現(xiàn)問題 Zlib與GZip Zlib與GZip Intel TBB::Pipeline，按序處理數(shù)據(jù) Intel TBB:Pipeline,軟件流水線的威力

網(wǎng)站導(dǎo)航: 博客園 IT新聞 BlogJava 博問 Chat2DB 管理

# re: 內(nèi)存搜索與解析[未登錄] 回復(fù) 更多評(píng)論

woaidongmao

內(nèi)存搜索與解析

評(píng)論

導(dǎo)航

常用鏈接

留言簿(10)

隨筆分類

隨筆檔案

搜索

最新評(píng)論

閱讀排行榜

評(píng)論排行榜