2898 	memcg_cachep = READ_ONCE(arr->entries[kmemcg_id]);  in memcg_kmem_get_cache()
3986 	for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)  in __mem_cgroup_threshold()
3987 		eventfd_signal(t->entries[i].eventfd, 1);  in __mem_cgroup_threshold()
3998 	for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)  in __mem_cgroup_threshold()
3999 		eventfd_signal(t->entries[i].eventfd, 1);  in __mem_cgroup_threshold()
4084 	new = kmalloc(struct_size(new, entries, size), GFP_KERNEL);  in __mem_cgroup_usage_register_event()
4093 		memcpy(new->entries, thresholds->primary->entries, (size - 1) *  in __mem_cgroup_usage_register_event()
4098 	new->entries[size - 1].eventfd = eventfd;  in __mem_cgroup_usage_register_event()
4099 	new->entries[size - 1].threshold = threshold;  in __mem_cgroup_usage_register_event()
4102 	sort(new->entries, size, sizeof(struct mem_cgroup_threshold),  in __mem_cgroup_usage_register_event()
4108 		if (new->entries[i].threshold <= usage) {  in __mem_cgroup_usage_register_event()
4174 		if (thresholds->primary->entries[i].eventfd != eventfd)  in __mem_cgroup_usage_unregister_event()
4192 		if (thresholds->primary->entries[i].eventfd == eventfd)  in __mem_cgroup_usage_unregister_event()
4195 		new->entries[j] = thresholds->primary->entries[i];  in __mem_cgroup_usage_unregister_event()
4196 		if (new->entries[j].threshold <= usage) {  in __mem_cgroup_usage_unregister_event()