src/dpdk/lib/librte_graph/graph_ops.c
static inline int
node_has_loop_edge(struct node *node)
{
	rte_edge_t i;
	char *name;
	int rc = 0;

	for (i = 0; i < node->nb_edges; i++) {
		if (strncmp(node->name, node->next_nodes[i],
			    RTE_NODE_NAMESIZE) == 0) {
			name = node->name;
			rc = 1;
			SET_ERR_JMP(EINVAL, fail, "Node %s has loop to self",
				    name);
		}
	}
fail:
	return rc;
}
/* Check whether a node has next_node to itself */
Check whether a node has next_node to itself
Check whether a node has next_node to itself
static inline int
node_has_loop_edge(struct node *node)
{
	rte_edge_t i;
	char *name;
	int rc = 0;
	for (i = 0; i < node->nb_edges; i++) {
		if (strncmp(node->name, node->next_nodes[i],
			    RTE_NODE_NAMESIZE) == 0) {
			name = node->name;
			rc = 1;
			SET_ERR_JMP(EINVAL, fail, "Node %s has loop to self",
				    name);
		}
	}
fail:
	return rc;
}
static inline int node_has_loop_edge ( struct node * node ) { rte_edge_t i ; char * name ; int rc = 0 ; for ( i = 0 ; i < node -> nb_edges ; i ++ ) { if ( strncmp ( node -> name , node -> next_nodes [ i ] , RTE_NODE_NAMESIZE ) == 0 ) { name = node -> name ; rc = 1 ; SET_ERR_JMP ( EINVAL , fail , " " , name ) ; } } fail : return rc ; }
Check whether a node has next_node to itself
Check whether a node has next_node to itself