* [dpdk-users] lpm trie
@ 2017-12-13 19:56 Pragash Vijayaragavan
0 siblings, 0 replies; only message in thread
From: Pragash Vijayaragavan @ 2017-12-13 19:56 UTC (permalink / raw)
To: users
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 : pxv3620@rit.edu
ph : 585 764 4662
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2017-12-13 19:56 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2017-12-13 19:56 [dpdk-users] lpm trie Pragash Vijayaragavan
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).