Lines Matching refs:data
30 u8 data[]; member
154 static inline int extract_bit(const u8 *data, size_t index) in extract_bit() argument
156 return !!(data[index / 8] & (1 << (7 - (index % 8)))); in extract_bit()
175 BUILD_BUG_ON(offsetof(struct lpm_trie_node, data) % sizeof(u32)); in __longest_prefix_match()
176 BUILD_BUG_ON(offsetof(struct bpf_lpm_trie_key_u8, data) % sizeof(u32)); in __longest_prefix_match()
184 u64 diff = be64_to_cpu(*(__be64 *)node->data ^ in __longest_prefix_match()
185 *(__be64 *)key->data); in __longest_prefix_match()
197 u32 diff = be32_to_cpu(*(__be32 *)&node->data[i] ^ in __longest_prefix_match()
198 *(__be32 *)&key->data[i]); in __longest_prefix_match()
209 u16 diff = be16_to_cpu(*(__be16 *)&node->data[i] ^ in __longest_prefix_match()
210 *(__be16 *)&key->data[i]); in __longest_prefix_match()
221 prefixlen += 8 - fls(node->data[i] ^ key->data[i]); in __longest_prefix_match()
281 next_bit = extract_bit(key->data, node->prefixlen); in trie_lookup_elem()
289 return found->data + trie->data_size; in trie_lookup_elem()
305 memcpy(node->data + trie->data_size, value, in lpm_trie_node_alloc()
353 memcpy(new_node->data, key->data, trie->data_size); in trie_update_elem()
369 next_bit = extract_bit(key->data, node->prefixlen); in trie_update_elem()
417 next_bit = extract_bit(node->data, matchlen); in trie_update_elem()
432 memcpy(im_node->data, node->data, trie->data_size); in trie_update_elem()
435 if (extract_bit(key->data, matchlen)) { in trie_update_elem()
494 next_bit = extract_bit(key->data, node->prefixlen); in trie_delete_elem()
595 offsetof(struct bpf_lpm_trie_key_u8, data); in trie_alloc()
700 next_bit = extract_bit(key->data, node->prefixlen); in trie_get_next_key()
747 memcpy((void *)next_key + offsetof(struct bpf_lpm_trie_key_u8, data), in trie_get_next_key()
748 next_node->data, trie->data_size); in trie_get_next_key()