45 	htab->map.key_size = attr->key_size;  in htab_map_alloc()
53 	if (htab->map.max_entries == 0 || htab->map.key_size == 0 ||  in htab_map_alloc()
61 	if (htab->map.key_size > MAX_BPF_STACK)  in htab_map_alloc()
89 			  round_up(htab->map.key_size, 8) +  in htab_map_alloc()
109 					 void *key, u32 key_size)  in lookup_elem_raw()  argument
114 		if (l->hash == hash && !memcmp(&l->key, key, key_size))  in lookup_elem_raw()
126 	u32 hash, key_size;  in htab_map_lookup_elem()  local
131 	key_size = map->key_size;  in htab_map_lookup_elem()
133 	hash = htab_map_hash(key, key_size);  in htab_map_lookup_elem()
137 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_lookup_elem()
140 		return l->key + round_up(map->key_size, 8);  in htab_map_lookup_elem()
151 	u32 hash, key_size;  in htab_map_get_next_key()  local
156 	key_size = map->key_size;  in htab_map_get_next_key()
158 	hash = htab_map_hash(key, key_size);  in htab_map_get_next_key()
163 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_get_next_key()
176 		memcpy(next_key, next_l->key, key_size);  in htab_map_get_next_key()
194 			memcpy(next_key, next_l->key, key_size);  in htab_map_get_next_key()
211 	u32 key_size;  in htab_map_update_elem()  local
225 	key_size = map->key_size;  in htab_map_update_elem()
227 	memcpy(l_new->key, key, key_size);  in htab_map_update_elem()
228 	memcpy(l_new->key + round_up(key_size, 8), value, map->value_size);  in htab_map_update_elem()
230 	l_new->hash = htab_map_hash(l_new->key, key_size);  in htab_map_update_elem()
237 	l_old = lookup_elem_raw(head, l_new->hash, key, key_size);  in htab_map_update_elem()
285 	u32 hash, key_size;  in htab_map_delete_elem()  local
290 	key_size = map->key_size;  in htab_map_delete_elem()
292 	hash = htab_map_hash(key, key_size);  in htab_map_delete_elem()
298 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_delete_elem()