3316 	for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)  in __mem_cgroup_threshold()
3317 		eventfd_signal(t->entries[i].eventfd, 1);  in __mem_cgroup_threshold()
3328 	for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)  in __mem_cgroup_threshold()
3329 		eventfd_signal(t->entries[i].eventfd, 1);  in __mem_cgroup_threshold()
3424 		memcpy(new->entries, thresholds->primary->entries, (size - 1) *  in __mem_cgroup_usage_register_event()
3429 	new->entries[size - 1].eventfd = eventfd;  in __mem_cgroup_usage_register_event()
3430 	new->entries[size - 1].threshold = threshold;  in __mem_cgroup_usage_register_event()
3433 	sort(new->entries, size, sizeof(struct mem_cgroup_threshold),  in __mem_cgroup_usage_register_event()
3439 		if (new->entries[i].threshold <= usage) {  in __mem_cgroup_usage_register_event()
3483 	int i, j, size, entries;  in __mem_cgroup_usage_unregister_event()  local
3503 	size = entries = 0;  in __mem_cgroup_usage_unregister_event()
3505 		if (thresholds->primary->entries[i].eventfd != eventfd)  in __mem_cgroup_usage_unregister_event()
3508 			entries++;  in __mem_cgroup_usage_unregister_event()
3514 	if (!entries)  in __mem_cgroup_usage_unregister_event()
3529 		if (thresholds->primary->entries[i].eventfd == eventfd)  in __mem_cgroup_usage_unregister_event()
3532 		new->entries[j] = thresholds->primary->entries[i];  in __mem_cgroup_usage_unregister_event()
3533 		if (new->entries[j].threshold <= usage) {  in __mem_cgroup_usage_unregister_event()