Hi,

Can someone let me know which trie algorithm is used in dpdk for lpm.
Is it a simple trie, without any level or path compression or a different
trie.


I saw this code :

struct rte_lpm_tbl_entry {
        uint32_t depth       :6;
        uint32_t valid_group :1;
        uint32_t valid       :1;
        uint32_t next_hop    :24;

};


Thanks,

Pragash Vijayaragavan
Grad Student at Rochester Institute of Technology
email : pxv3...@rit.edu
ph : 585 764 4662

Reply via email to