DPDK Graph Pipeline 框架简介与实现原理
, dst); } 复制代码 Graph 遍历 node的流程 /** * @file lib/graph/rte_graph_worker.h:rte_graph_walk */ /* * Walk on the source node(s) ((cir_start - head) -> cir_start) and then * on the pending streams (cir_start -> (cir_start + mask) -> cir_start) * in a circular buffer fashion. * * +-----+ <= cir_start - head [number of source nodes] * | | * | ... | <= source...阅读全文