L3switch(l3fwd)

[bdevierno1]

Layer 3 forwarding application.

Summary:

Based on DPDK's layer 3 forwarding example. There are two modes longest prefix match table as well as hash table lookup. There are a few differences between this version and DPDK's. Use of openNetVM's flow API was broadly used. This allows data to be stored with each rule or flow when added to the table. This is in contrast to DPDK's version where it uses the key value to get an index. The index value is then used to perform a lookup in an array.

Usage: -p : number of packets between each print, e.g. -p 1 prints every packets. Default is every 1000000 packets. -e : Enables exact match mode. -h : Sets the hash entry number.

For example: ./go.sh 1 -e -h 7

Will enable exact match mode with hash entry number set to 7. Hash entry number will default to 4 if not manually set or not running in exact match mode.

This PR includes
Resolves issues
Breaking API changes
Internal API changes
Usability improvements
Bug fixes
New functionality
New NF/onvm_mgr args	👍
Changes to starting NFs
Dependency updates
Web stats updates

Merging notes:

• Dependencies: None

TODO before merging :

• [X] PR is ready for review

Test Plan:

Use Pktgen. Configure the src and destination address to match your desired flow. Check if traffic is correctly sent out of the correct port.

Review:

NF Checklist:

• [x] Documentation describes purpose of NF, all arguments, and basic usage
• [x] NF stores all non-global state in a struct referenced by nf->data
• [x] NF performs initialization in a function_table->setup function and frees dynamic memory before exiting

[bdevierno1]

Updated hash pointers to be global variables instead after @sreyanalla review. Originally used nf->data but this will be freed by the manager upon NF shutdown therefore it would not be possible to deallocate hash table memory. Thanks @sreyanalla

[twood02]

@sreyanalla will test again