Lines Matching refs:max_entries
85 return BITS_TO_LONGS((u64) attr->max_entries) * sizeof(unsigned long); in dev_map_bitmap_size()
98 if (attr->max_entries == 0 || attr->key_size != 4 || in dev_map_alloc()
109 cost = (u64) dtab->map.max_entries * sizeof(struct bpf_dtab_netdev *); in dev_map_alloc()
130 dtab->netdev_map = bpf_map_area_alloc(dtab->map.max_entries * in dev_map_alloc()
175 while (!bitmap_empty(bitmap, dtab->map.max_entries)) in dev_map_free()
179 for (i = 0; i < dtab->map.max_entries; i++) { in dev_map_free()
201 if (index >= dtab->map.max_entries) { in dev_map_get_next_key()
206 if (index == dtab->map.max_entries - 1) in dev_map_get_next_key()
281 for_each_set_bit(bit, bitmap, map->max_entries) { in __dev_map_flush()
307 if (key >= map->max_entries) in __dev_map_lookup_elem()
415 if (k >= map->max_entries) in dev_map_delete_elem()
444 if (unlikely(i >= dtab->map.max_entries)) in dev_map_update_elem()
511 for (i = 0; i < dtab->map.max_entries; i++) { in dev_map_notification()