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()
77 			  round_up(htab->map.key_size, 8) +  in htab_map_alloc()
129 					 void *key, u32 key_size)  in lookup_elem_raw()  argument
134 		if (l->hash == hash && !memcmp(&l->key, key, key_size))  in lookup_elem_raw()
146 	u32 hash, key_size;  in htab_map_lookup_elem()  local
151 	key_size = map->key_size;  in htab_map_lookup_elem()
153 	hash = htab_map_hash(key, key_size);  in htab_map_lookup_elem()
157 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_lookup_elem()
160 		return l->key + round_up(map->key_size, 8);  in htab_map_lookup_elem()
171 	u32 hash, key_size;  in htab_map_get_next_key()  local
176 	key_size = map->key_size;  in htab_map_get_next_key()
178 	hash = htab_map_hash(key, key_size);  in htab_map_get_next_key()
183 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_get_next_key()
196 		memcpy(next_key, next_l->key, key_size);  in htab_map_get_next_key()
214 			memcpy(next_key, next_l->key, key_size);  in htab_map_get_next_key()
231 	u32 key_size;  in htab_map_update_elem()  local
245 	key_size = map->key_size;  in htab_map_update_elem()
247 	memcpy(l_new->key, key, key_size);  in htab_map_update_elem()
248 	memcpy(l_new->key + round_up(key_size, 8), value, map->value_size);  in htab_map_update_elem()
250 	l_new->hash = htab_map_hash(l_new->key, key_size);  in htab_map_update_elem()
257 	l_old = lookup_elem_raw(head, l_new->hash, key, key_size);  in htab_map_update_elem()
305 	u32 hash, key_size;  in htab_map_delete_elem()  local
310 	key_size = map->key_size;  in htab_map_delete_elem()
312 	hash = htab_map_hash(key, key_size);  in htab_map_delete_elem()
318 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_delete_elem()