Lines Matching defs:entries
159 /* Size of entries[] */
162 struct mem_cgroup_threshold entries[0];
171 * It must be able to store at least primary->size - 1 entries.
3568 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
3569 eventfd_signal(t->entries[i].eventfd, 1);
3580 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
3581 eventfd_signal(t->entries[i].eventfd, 1);
3664 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
3669 new->entries[size - 1].eventfd = eventfd;
3670 new->entries[size - 1].threshold = threshold;
3673 sort(new->entries, size, sizeof(struct mem_cgroup_threshold),
3679 if (new->entries[i].threshold < usage) {
3736 if (thresholds->primary->entries[i].eventfd != eventfd)
3754 if (thresholds->primary->entries[i].eventfd == eventfd)
3757 new->entries[j] = thresholds->primary->entries[i];
3758 if (new->entries[j].threshold < usage) {