They are in table.c: route_node_match and route_node_lookup. I suspect there will need to be some fairly serious rewrite of the code in order to take advantage of GPU's.
The reality though is that I don't think these are the current bottlenecks in handling large #'s of routes and peers in the code. I would point you towards perf as a starting point here. donald On Mon, Dec 21, 2015 at 3:18 AM, M.Saeed Ansari <[email protected]> wrote: > Dear Friends, > > I want to do some of CPU consumer task of Quagga with GPU. > I need to know where are longest prefix match and other data-flow task > functions and how can i change their code? > I want to mix OpenCL with Quagga code to do tasks with GPU in this project. > > Regards, > Saeed > > _______________________________________________ > Quagga-dev mailing list > [email protected] > https://lists.quagga.net/mailman/listinfo/quagga-dev >
_______________________________________________ Quagga-dev mailing list [email protected] https://lists.quagga.net/mailman/listinfo/quagga-dev
