37 	size_t				data_size;  member
180 	if (trie->data_size >= 8) {  in longest_prefix_match()
193 	while (trie->data_size >= i + 4) {  in longest_prefix_match()
205 	if (trie->data_size >= i + 2) {  in longest_prefix_match()
217 	if (trie->data_size >= i + 1) {  in longest_prefix_match()
279 	return found->data + trie->data_size;  in trie_lookup_elem()
286 	size_t size = sizeof(struct lpm_trie_node) + trie->data_size;  in lpm_trie_node_alloc()
299 		memcpy(node->data + trie->data_size, value,  in lpm_trie_node_alloc()
344 	memcpy(new_node->data, key->data, trie->data_size);  in trie_update_elem()
408 	memcpy(im_node->data, node->data, trie->data_size);  in trie_update_elem()
567 	trie->data_size = attr->key_size -  in trie_alloc()
569 	trie->max_prefixlen = trie->data_size * 8;  in trie_alloc()
707 	       next_node->data, trie->data_size);  in trie_get_next_key()
728 	elem_size = sizeof(struct lpm_trie_node) + trie->data_size +  in trie_mem_usage()