• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            woaidongmao

            文章均收錄自他人博客,但不喜標題前加-[轉貼],因其丑陋,見諒!~
            隨筆 - 1469, 文章 - 0, 評論 - 661, 引用 - 0
            數據加載中……

            內存搜索與解析

            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);//---- 多重二進制分割
            BOOL            ParserMem(const void* src_buf, int src_len, const vector<char>& vec_par, vector< vector<char> >& vec_result);//---- 單層二進制分割
            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 肥仔 閱讀(1695) 評論(1)  編輯 收藏 引用 所屬分類: 庫 & 代碼段

            評論

            # re: 內存搜索與解析[未登錄]  回復  更多評論   

            good
            2009-04-20 16:38 | a
            久久91精品国产91| 久久精品99久久香蕉国产色戒 | 亚洲女久久久噜噜噜熟女| 久久人人爽人人爽人人片av麻烦 | 午夜视频久久久久一区 | 久久久久久久尹人综合网亚洲| 亚洲乱亚洲乱淫久久| 午夜福利91久久福利| 精品久久久无码人妻中文字幕豆芽 | 狠狠狠色丁香婷婷综合久久五月| 伊人久久大香线焦综合四虎| 久久久久久免费视频| 久久久青草青青亚洲国产免观| 最新久久免费视频| 99久久99久久精品国产| 色欲久久久天天天综合网| 9191精品国产免费久久| 久久午夜伦鲁片免费无码| 美女久久久久久| 久久se精品一区二区影院| 久久国产精品一国产精品金尊| 国内精品久久久久影院老司| 久久精品女人天堂AV麻| 日韩一区二区久久久久久| 国产精品女同久久久久电影院| 久久这里都是精品| 久久99热这里只频精品6| 久久久久一级精品亚洲国产成人综合AV区| 无码国内精品久久人妻| 99蜜桃臀久久久欧美精品网站 | 久久久久久精品无码人妻| 亚洲国产婷婷香蕉久久久久久 | 精品久久人妻av中文字幕| 18岁日韩内射颜射午夜久久成人| 午夜肉伦伦影院久久精品免费看国产一区二区三区 | 91麻精品国产91久久久久| 久久青青草原精品影院| 狠色狠色狠狠色综合久久| 97精品伊人久久大香线蕉app| a高清免费毛片久久| 狠狠狠色丁香婷婷综合久久五月 |