root@localhost:~# cat trie.cpp
#include <stdio.h>
#include <unordered_map>
#include <map>
#include <vector>
#include <iostream>

#include <iostream>
#include <iomanip>
#include <functional>
#include <string>
#include <unordered_set>

#define     RuleOpcode  "=="

struct http_recoder
{
   const char* http_method;
   const char* http_uri;
   const char* http_version;
   const char* http_cookie;
   const char* http_paylaod;
   const char* http_paylaod_len;
   const char* http_host;
   const char* http_connect;
   const char* http_accept;
   const char* http_useragent;
   const char* http_origin;
   const char* http_referer;
   const char* http_acceptencoding;
   const char* http_acceptlanguage;

   const char* http_code;
   const char* http_contenttype;
   const char* http_contentlength;
   const char* http_contentencode;
   const char* http_content;
   const char* http_server;
   const char* http_date;
   const char* http_location;
};



// 规则结构
class RuleUnit
{
public:
    RuleUnit(){}
   ~RuleUnit(){}

public:
    std::string field;  //字段名
    std::string value;  //匹配值
    int         weight; //权重
};

//前缀树结构
class TrieNode
{
public:
    TrieNode(){}
   ~TrieNode(){}

public:
    std::string field;  //字段名
    std::string opcode; //操作码
    std::string value;  //匹配值
    int         is_end; //终结符
    int         ruleid; //规则ID号
    int         index;  //索引

    TrieNode    *fail;  //回溯
    TrieNode    *next;  //前进
    std::map<std::string, TrieNode*>    child;
};


int RuleTrieBuildFail(TrieNode *TrieRoot)
{
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        if(TrieRoot->child.size() > 1)
        {
            it++;
            if(it != TrieRoot->child.end())
            {
                Node->fail  =   it->second;
            }
            else
            {
                Node->fail  =   TrieRoot->fail;
            }
            it--;
        }
        else
        {
            Node->fail  =   TrieRoot->fail;
        }

        RuleTrieBuildFail(Node);
    }
    return 0;
}

int RuleTrieBuildNext(TrieNode *TrieRoot)
{
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;

        if(it == TrieRoot->child.begin())
        {
            TrieRoot->next  =   Node;
        }

        RuleTrieBuildNext(Node);
    }

    if(0 == TrieRoot->child.size())
    {
        TrieRoot->next  =   TrieRoot->fail;
    }

    return 0;
}


int RuleTrieBuildIndex(TrieNode *TrieRoot)
{
    static int index   =   0;
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        Node->index     =   index++;
        RuleTrieBuildIndex(Node);
    }
    return index;
}

int RuleTrieBuildShow(TrieNode *TrieRoot)
{
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        printf("索引 %02d 当前节点:%p 父节点:%p 前进节点:%p 失败节点:%p ", Node->index, Node, TrieRoot, Node->next, Node->fail);
        std::cout << Node->field << Node->opcode << Node->value << "\n";
        RuleTrieBuildShow(Node);
    }

    return 0;
}


int RuleTrieDraw_init_terminal(TrieNode *TrieRoot, FILE *FileTrie)
{
    if(1 == TrieRoot->is_end)
    {
        std::string label =  TrieRoot->field + TrieRoot->opcode + TrieRoot->value ;
        fprintf(FileTrie,"    \"%p\" [label=\"id=%d \\n %s\"]\n", TrieRoot, TrieRoot->ruleid, label.c_str());
    }

    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        RuleTrieDraw_init_terminal(Node, FileTrie);
    }

    return 0;
}

int RuleTrieDraw_init_unit(TrieNode *TrieRoot, FILE *FileTrie)
{
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        if(Node->child.size() && 0 == Node->is_end)
        {
            std::string label = Node->field + Node->opcode + Node->value;
            fprintf(FileTrie,"    \"%p\" [label=\"%s\"]\n", Node, label.c_str());
        }
        RuleTrieDraw_init_unit(Node, FileTrie);
    }
    return 0;
}

int RuleTrieDraw_init(TrieNode *TrieRoot, FILE *FileTrie)
{
    fprintf(FileTrie, "//画图命令: dot -Tpdf trie.dot  -o trie.pdf\n");
    fprintf(FileTrie, "digraph G {\n");
    fprintf(FileTrie, "charset=\"UTF-8\"\n");
    fprintf(FileTrie, "fontname=\"Helvetica,Arial,sans-serif\"\n");
    fprintf(FileTrie, "node [fontname=\"Helvetica,Arial,sans-serif\"]\n");
    fprintf(FileTrie, "edge [fontname=\"Helvetica,Arial,sans-serif\"]\n");
    fprintf(FileTrie, "node [shape=\"box\"]\n");

    fprintf(FileTrie, "{ node [shape=circle style=filled color=\"#FF0000\"]\n");
    fprintf(FileTrie, "    \"%p\" [label=\"\"]\n", TrieRoot);
    fprintf(FileTrie, "}\n");

    fprintf(FileTrie, "{ node [style=filled color=\"#000000\" fillcolor=\"#00FF00\"]\n");
    RuleTrieDraw_init_terminal(TrieRoot, FileTrie);
    fprintf(FileTrie, "}\n");

    fprintf(FileTrie, "{ node []\n");
    RuleTrieDraw_init_unit(TrieRoot, FileTrie);
    fprintf(FileTrie, "}\n");

    return 0;
}


int RuleTrieDraw_Fail(TrieNode *TrieRoot, FILE *FileTrie)
{
    fprintf(FileTrie, "    \"%p\" -> \"%p\" [color=\"#FF0000\" style=dotted]\n", TrieRoot, TrieRoot->fail);

    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        RuleTrieDraw_Fail(Node, FileTrie);
    }

    return 0;
}

int RuleTrieDraw_Next(TrieNode *TrieRoot, FILE *FileTrie)
{
    if(TrieRoot->next != TrieRoot->fail)
    {
        fprintf(FileTrie, "    \"%p\" -> \"%p\" [color=\"#00FF00\"]\n", TrieRoot, TrieRoot->next);
    }

    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        RuleTrieDraw_Next(Node, FileTrie);
    }

    return 0;
}

int RuleTrieDraw_Fork(TrieNode *TrieRoot, FILE *FileTrie)
{
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        if(it != TrieRoot->child.begin())
        {
            fprintf(FileTrie, "    \"%p\" -> \"%p\" [color=\"#00FF00\" style=dashed]\n", TrieRoot, Node);
        }
        RuleTrieDraw_Fork(Node, FileTrie);
    }

    return 0;
}


int RuleTrieDraw_Refe_(TrieNode *TrieRoot, std::map<std::string, std::vector<TrieNode *> >     &ref)
{
    for(auto it = TrieRoot->child.begin(); it != TrieRoot->child.end(); it++)
    {
        TrieNode *Node  =  it->second;
        std::string node_function    =   Node->field         + Node->opcode          + Node->value;
        ref[node_function].push_back(Node);
        RuleTrieDraw_Refe_(Node, ref);
    }

    return 0;
}


int RuleTrieDraw_Refe(TrieNode *TrieRoot, FILE *FileTrie)
{
    std::map<std::string, std::vector<TrieNode *> >     ref;
    RuleTrieDraw_Refe_(TrieRoot, ref);

    for(auto it = ref.begin(); it != ref.end(); it++)
    {
        if(it->second.size() > 1)
        {
            auto &value_ref = it->second;
            TrieNode    *prev = value_ref[0];
            for(size_t i = 1; i < value_ref.size(); i++)
            {
                TrieNode    *pos = value_ref[i];
                fprintf(FileTrie, "    ");
                fprintf(FileTrie, "\"%p\" -> \"%p\" [color=\"#0000FF\" style=dotted dir=both]\n", prev, pos);
                prev = pos;
            }
        }
    }

    return 0;
}

int RuleTrieDraw_fini(TrieNode *TrieRoot, FILE *FileTrie)
{
    fprintf(FileTrie, "}\n");
    return 0;
}


TrieNode* RuleTrieBuild(std::vector<std::map<std::string, std::string>* > *RuleManeger)
{
    // 计算 HASH, 累计
    std::unordered_map<std::string, int>  RuleNodeHash;   //存储节点统计
    for(size_t i = 0 ; i < RuleManeger->size(); i++)
    {
        printf("规则 %zd ", i);
        for(auto it = RuleManeger->at(i)->begin(); it != RuleManeger->at(i)->end(); it++)
        {
            std::cout << " "<<it->first << RuleOpcode << it->second;
            RuleNodeHash[it->first + RuleOpcode + it->second]++;   //HASH累计
        }
        printf("\n");
    }
    printf("\n");

    //序列结构转换
    std::vector<  std::vector<RuleUnit>*  >  RuleRoot;
    for(size_t i = 0 ; i < RuleManeger->size(); i++)
    {
        std::vector<RuleUnit> *newRuleList = new std::vector<RuleUnit>;
        for(auto it = RuleManeger->at(i)->begin(); it != RuleManeger->at(i)->end(); it++)
        {
            RuleUnit newRuleUnit;
            newRuleUnit.field   =   it->first;
            newRuleUnit.value   =   it->second;
            newRuleUnit.weight  =   RuleNodeHash[it->first + RuleOpcode + it->second];
            newRuleList->push_back(newRuleUnit);
        }
        RuleRoot.push_back(newRuleList);
    }

    //基于序列 内部排序
    for(size_t i = 0 ; i < RuleRoot.size(); i++)
    {
        std::vector<RuleUnit>* list = RuleRoot.at(i);
        for(size_t j = 0; j < list->size(); j++)
        {
            for(size_t k = 0; k < list->size(); k++)
            {
                // 根据权重移动
                if(list->at(k).weight < list->at(j).weight)
                {
                    RuleUnit Unit   =   list->at(k);
                    list->at(k)     =   list->at(j);
                    list->at(j)     =   Unit;
                }

                // 如果权重一样大
                std::hash<std::string> str_hash;
                if(list->at(k).weight == list->at(j).weight &&
                        str_hash(list->at(k).field + list->at(k).value) > str_hash(list->at(j).field + list->at(j).value))
                {
                    RuleUnit Unit   =   list->at(k);
                    list->at(k)     =   list->at(j);
                    list->at(j)     =   Unit;
                }
            }
        }
    }

    //打印输出 内部排序
    printf("规则内排序\n");
    for(size_t i = 0 ; i < RuleRoot.size(); i++)
    {
        std::vector<RuleUnit>* list = RuleRoot.at(i);
        for(size_t j = 0; j < list->size(); j++)
        {
            std::cout << list->at(j).weight <<" "<< list->at(j).field << RuleOpcode << list->at(j).value << " ";
        }
        printf("\n");
    }
    printf("\n");


    //构造前缀树
    printf("构造前缀树\n");
    TrieNode *TrieRoot  =   new TrieNode;
    TrieRoot->fail      =   TrieRoot;

    for(size_t i = 0 ; i < RuleRoot.size(); i++)
    {
        TrieNode *TrieUnit  =   TrieRoot;
        std::vector<RuleUnit>* list = RuleRoot.at(i);
        for(size_t j = 0; j < list->size(); j++)
        {
            std::string  TrieNodeKey = list->at(j).field + RuleOpcode + list->at(j).value;
            if(TrieUnit->child.find(TrieNodeKey) != TrieUnit->child.end())
            {
                TrieUnit = TrieUnit->child.at(TrieNodeKey);
                std::cout << "复用!!"<< TrieNodeKey << std::endl;
                continue;
            }

            std::cout << "构造: "<< TrieNodeKey << std::endl;
            TrieNode *NewTrieNode   =   new TrieNode;
            NewTrieNode->field      =   list->at(j).field;
            NewTrieNode->opcode     =   RuleOpcode;
            NewTrieNode->value      =   list->at(j).value;

            TrieUnit->child[TrieNodeKey] = NewTrieNode;
            TrieUnit = NewTrieNode;
        }

        if(TrieUnit != TrieRoot)
        {
            TrieUnit->is_end    = 1;
            TrieUnit->ruleid    = i+1;
        }
        printf("\n");
    }


    //构造索引
    int indexMax = RuleTrieBuildIndex(TrieRoot);
    printf("有效节点 %d\n", indexMax);

    //构造回溯指针
    RuleTrieBuildFail(TrieRoot);

    //构造前进指针
    RuleTrieBuildNext(TrieRoot);

    //打印显示前缀树
    printf("打印前缀树 Root %p\n", TrieRoot);
    RuleTrieBuildShow(TrieRoot);

    FILE *FileTrie = fopen("trie.dot", "w+");
    if(FileTrie)
    {
        RuleTrieDraw_init(TrieRoot, FileTrie);
        RuleTrieDraw_Fail(TrieRoot, FileTrie);
        RuleTrieDraw_Next(TrieRoot, FileTrie);
        RuleTrieDraw_Fork(TrieRoot, FileTrie);
        RuleTrieDraw_Refe(TrieRoot, FileTrie);
        RuleTrieDraw_fini(TrieRoot, FileTrie);
        fclose(FileTrie);
    }

    return TrieRoot;
}

int RuleTrieMatch(TrieNode* TrieRoot, std::map<std::string, std::string> &recoder)
{
    printf("开始执行\n");
    int  cnt = 0;
    TrieNode    *Node   =   TrieRoot->next;
    while(Node != TrieRoot)
    {
        cnt++;
        printf("路过 %p %s %s ", Node, Node->field.c_str(), Node->value.c_str());
        if(recoder[Node->field] == Node->value)
        {
            if(Node->is_end)
            {
                printf("[命中 id=%d]", Node->ruleid);
            }
            else
            {
                printf("[真]");
            }
            Node    =   Node->next;
        }
        else
        {
            printf("[假]");
            Node    =   Node->fail;
        }
        printf("\n");
    }

    printf("计算次数累计: %d\n", cnt);
    return 0;
}


int main()
{
    std::map<std::string, std::string> recoder;
    recoder["http_method"]         = "GET";
    recoder["http_uri"]            = "/fast-cgi";
    recoder["http_version"]        = "HTTP/1.1";
    recoder["http_cookie"]         = "uuid is 1234abcd";
    recoder["http_paylaod"]        = "success";
    recoder["http_paylaod_len"]    = "7";
    recoder["http_useragent"]      = "Windows Chrome 7.0";
    recoder["http_host"]           = "www.baidu.com";
    recoder["http_accept"]         = "text, png, jpeg";
    recoder["http_referer"]        = "video.hao123.com";
    recoder["http_acceptencoding"] = "gzip";
    recoder["http_acceptlanguage"] = "gbk,utf8";
    recoder["http_code"]           = "200 OK";
    recoder["http_contenttype"]    = "html/text";
    recoder["http_contentlength"]  = "20";
    recoder["http_content"]        = "message send success";
    recoder["http_server"]         = "Nginx 1.2";
    recoder["http_date"]           = "2022-02-18 12:08";
    recoder["http_location"]       = "http://www.baidu.com/";

    std::map<std::string, std::string>  rule1;
    rule1["http_host"]       = "music.baidu.com";
    rule1["http_method"]     = "get";
    rule1["http_uri"]        = "/upload";
    rule1["http_code"]       = "200";

    std::map<std::string, std::string>  rule2;
    rule2["http_host"]       = "music.baidu.com";
    rule2["http_method"]     = "post";
    rule2["http_uri"]        = "/upload";

    std::map<std::string, std::string>  rule3;
    rule3["http_uri"]        = "/upload";
    rule3["http_referer"]    = "music.hao123.com";

    std::map<std::string, std::string>  rule4;
    rule4["http_uri"]        = "/fast-cgi";
    rule4["http_referer"]    = "video.hao123.com";

    std::map<std::string, std::string>  rule5;
    rule5["http_accept"]     = "text, png, jpeg";
    rule5["http_cookie"]     = "uuid is 1234abcd";
    rule5["http_referer"]    = "video.hao123.com";

    std::map<std::string, std::string>  rule6;
    rule6["http_accept"]     = "text, png, jpeg";
    rule6["http_referer"]    = "hao123.com";

    std::map<std::string, std::string>  rule7;
    rule7["http_uri"]        = "/img/2022/view/123.png";
    rule7["http_referer"]    = "i.qiyi.com";

    std::map<std::string, std::string>  rule8;
    rule8["http_host"]       = "www.baidu.com";
    rule8["http_cookie"]     = "uuid is 1234abcd";

    std::vector<std::map<std::string, std::string>* >  RuleManager;
    RuleManager.push_back(&rule1);
    RuleManager.push_back(&rule2);
    RuleManager.push_back(&rule3);
    RuleManager.push_back(&rule4);
    RuleManager.push_back(&rule5);
    RuleManager.push_back(&rule6);
    RuleManager.push_back(&rule7);
    RuleManager.push_back(&rule8);

    TrieNode * TrieRoot = RuleTrieBuild(&RuleManager);
    RuleTrieMatch(TrieRoot, recoder);

    return 0;
}

root@localhost:~#

root@localhost:~# g++ -std=c++11 trie.cpp

root@localhost:~# ./a.out
规则 0  http_code==200 http_host==music.baidu.com http_method==get http_uri==/upload
规则 1  http_host==music.baidu.com http_method==post http_uri==/upload
规则 2  http_referer==music.hao123.com http_uri==/upload
规则 3  http_referer==video.hao123.com http_uri==/fast-cgi
规则 4  http_accept==text, png, jpeg http_cookie==uuid is 1234abcd http_referer==video.hao123.com
规则 5  http_accept==text, png, jpeg http_referer==hao123.com
规则 6  http_referer==i.qiyi.com http_uri==/img/2022/view/123.png
规则 7  http_cookie==uuid is 1234abcd http_host==www.baidu.com

规则内排序
3 http_uri==/upload 2 http_host==music.baidu.com 1 http_code==200 1 http_method==get
3 http_uri==/upload 2 http_host==music.baidu.com 1 http_method==post
3 http_uri==/upload 1 http_referer==music.hao123.com
2 http_referer==video.hao123.com 1 http_uri==/fast-cgi
2 http_referer==video.hao123.com 2 http_accept==text, png, jpeg 2 http_cookie==uuid is 1234abcd
2 http_accept==text, png, jpeg 1 http_referer==hao123.com
1 http_uri==/img/2022/view/123.png 1 http_referer==i.qiyi.com
2 http_cookie==uuid is 1234abcd 1 http_host==www.baidu.com

构造前缀树
构造: http_uri==/upload
构造: http_host==music.baidu.com
构造: http_code==200
构造: http_method==get

复用!!http_uri==/upload
复用!!http_host==music.baidu.com
构造: http_method==post

复用!!http_uri==/upload
构造: http_referer==music.hao123.com

构造: http_referer==video.hao123.com
构造: http_uri==/fast-cgi

复用!!http_referer==video.hao123.com
构造: http_accept==text, png, jpeg
构造: http_cookie==uuid is 1234abcd

构造: http_accept==text, png, jpeg
构造: http_referer==hao123.com

构造: http_uri==/img/2022/view/123.png
构造: http_referer==i.qiyi.com

构造: http_cookie==uuid is 1234abcd
构造: http_host==www.baidu.com

有效节点 16
打印前缀树 Root 0x1406720
索引 00 当前节点:0x1407290 父节点:0x1406720 前进节点:0x1407370 失败节点:0x1407730 http_accept==text, png, jpeg
索引 01 当前节点:0x1407370 父节点:0x1407290 前进节点:0x1407730 失败节点:0x1407730 http_referer==hao123.com
索引 02 当前节点:0x1407730 父节点:0x1406720 前进节点:0x1407860 失败节点:0x1406dc0 http_cookie==uuid is 1234abcd
索引 03 当前节点:0x1407860 父节点:0x1407730 前进节点:0x1406dc0 失败节点:0x1406dc0 http_host==www.baidu.com
索引 04 当前节点:0x1406dc0 父节点:0x1406720 前进节点:0x1407030 失败节点:0x14074e0 http_referer==video.hao123.com
索引 05 当前节点:0x1407030 父节点:0x1406dc0 前进节点:0x1407160 失败节点:0x1406ea0 http_accept==text, png, jpeg
索引 06 当前节点:0x1407160 父节点:0x1407030 前进节点:0x1406ea0 失败节点:0x1406ea0 http_cookie==uuid is 1234abcd
索引 07 当前节点:0x1406ea0 父节点:0x1406dc0 前进节点:0x14074e0 失败节点:0x14074e0 http_uri==/fast-cgi
索引 08 当前节点:0x14074e0 父节点:0x1406720 前进节点:0x14075c0 失败节点:0x1406790 http_uri==/img/2022/view/123.png
索引 09 当前节点:0x14075c0 父节点:0x14074e0 前进节点:0x1406790 失败节点:0x1406790 http_referer==i.qiyi.com
索引 10 当前节点:0x1406790 父节点:0x1406720 前进节点:0x1406850 失败节点:0x1406720 http_uri==/upload
索引 11 当前节点:0x1406850 父节点:0x1406790 前进节点:0x1406930 失败节点:0x1406ce0 http_host==music.baidu.com
索引 12 当前节点:0x1406930 父节点:0x1406850 前进节点:0x1406a50 失败节点:0x1406bc0 http_code==200
索引 13 当前节点:0x1406a50 父节点:0x1406930 前进节点:0x1406bc0 失败节点:0x1406bc0 http_method==get
索引 14 当前节点:0x1406bc0 父节点:0x1406850 前进节点:0x1406ce0 失败节点:0x1406ce0 http_method==post
索引 15 当前节点:0x1406ce0 父节点:0x1406790 前进节点:0x1406720 失败节点:0x1406720 http_referer==music.hao123.com
开始执行
路过 0x1407290 http_accept text, png, jpeg [真]
路过 0x1407370 http_referer hao123.com [假]
路过 0x1407730 http_cookie uuid is 1234abcd [真]
路过 0x1407860 http_host www.baidu.com [命中 id=8]
路过 0x1406dc0 http_referer video.hao123.com [真]
路过 0x1407030 http_accept text, png, jpeg [真]
路过 0x1407160 http_cookie uuid is 1234abcd [命中 id=5]
路过 0x1406ea0 http_uri /fast-cgi [命中 id=4]
路过 0x14074e0 http_uri /img/2022/view/123.png [假]
路过 0x1406790 http_uri /upload [假]
计算次数累计: 10
root@localhost:~#

root@localhost:~# cat trie.dot
//画图命令: dot -Tpdf trie.dot  -o trie.pdf
digraph G {
charset="UTF-8"
fontname="Helvetica,Arial,sans-serif"
node [fontname="Helvetica,Arial,sans-serif"]
edge [fontname="Helvetica,Arial,sans-serif"]
node [shape="box"]
{ node [shape=circle style=filled color="#FF0000"]
    "0x1406720" [label=""]
}
{ node [style=filled color="#000000" fillcolor="#00FF00"]
    "0x1407370" [label="id=6 \n http_referer==hao123.com"]
    "0x1407860" [label="id=8 \n http_host==www.baidu.com"]
    "0x1407160" [label="id=5 \n http_cookie==uuid is 1234abcd"]
    "0x1406ea0" [label="id=4 \n http_uri==/fast-cgi"]
    "0x14075c0" [label="id=7 \n http_referer==i.qiyi.com"]
    "0x1406a50" [label="id=1 \n http_method==get"]
    "0x1406bc0" [label="id=2 \n http_method==post"]
    "0x1406ce0" [label="id=3 \n http_referer==music.hao123.com"]
}
{ node []
    "0x1407290" [label="http_accept==text, png, jpeg"]
    "0x1407730" [label="http_cookie==uuid is 1234abcd"]
    "0x1406dc0" [label="http_referer==video.hao123.com"]
    "0x1407030" [label="http_accept==text, png, jpeg"]
    "0x14074e0" [label="http_uri==/img/2022/view/123.png"]
    "0x1406790" [label="http_uri==/upload"]
    "0x1406850" [label="http_host==music.baidu.com"]
    "0x1406930" [label="http_code==200"]
}
    "0x1406720" -> "0x1406720" [color="#FF0000" style=dotted]
    "0x1407290" -> "0x1407730" [color="#FF0000" style=dotted]
    "0x1407370" -> "0x1407730" [color="#FF0000" style=dotted]
    "0x1407730" -> "0x1406dc0" [color="#FF0000" style=dotted]
    "0x1407860" -> "0x1406dc0" [color="#FF0000" style=dotted]
    "0x1406dc0" -> "0x14074e0" [color="#FF0000" style=dotted]
    "0x1407030" -> "0x1406ea0" [color="#FF0000" style=dotted]
    "0x1407160" -> "0x1406ea0" [color="#FF0000" style=dotted]
    "0x1406ea0" -> "0x14074e0" [color="#FF0000" style=dotted]
    "0x14074e0" -> "0x1406790" [color="#FF0000" style=dotted]
    "0x14075c0" -> "0x1406790" [color="#FF0000" style=dotted]
    "0x1406790" -> "0x1406720" [color="#FF0000" style=dotted]
    "0x1406850" -> "0x1406ce0" [color="#FF0000" style=dotted]
    "0x1406930" -> "0x1406bc0" [color="#FF0000" style=dotted]
    "0x1406a50" -> "0x1406bc0" [color="#FF0000" style=dotted]
    "0x1406bc0" -> "0x1406ce0" [color="#FF0000" style=dotted]
    "0x1406ce0" -> "0x1406720" [color="#FF0000" style=dotted]
    "0x1406720" -> "0x1407290" [color="#00FF00"]
    "0x1407290" -> "0x1407370" [color="#00FF00"]
    "0x1407730" -> "0x1407860" [color="#00FF00"]
    "0x1406dc0" -> "0x1407030" [color="#00FF00"]
    "0x1407030" -> "0x1407160" [color="#00FF00"]
    "0x14074e0" -> "0x14075c0" [color="#00FF00"]
    "0x1406790" -> "0x1406850" [color="#00FF00"]
    "0x1406850" -> "0x1406930" [color="#00FF00"]
    "0x1406930" -> "0x1406a50" [color="#00FF00"]
    "0x1406720" -> "0x1407730" [color="#00FF00" style=dashed]
    "0x1406720" -> "0x1406dc0" [color="#00FF00" style=dashed]
    "0x1406dc0" -> "0x1406ea0" [color="#00FF00" style=dashed]
    "0x1406720" -> "0x14074e0" [color="#00FF00" style=dashed]
    "0x1406720" -> "0x1406790" [color="#00FF00" style=dashed]
    "0x1406850" -> "0x1406bc0" [color="#00FF00" style=dashed]
    "0x1406790" -> "0x1406ce0" [color="#00FF00" style=dashed]
    "0x1407290" -> "0x1407030" [color="#0000FF" style=dotted dir=both]
    "0x1407730" -> "0x1407160" [color="#0000FF" style=dotted dir=both]
}
root@localhost:~#

dot工具 需要自行安装
root@localhost:~# dot -Tpdf trie.dot  -o trie.pdf