Lines Matching defs:count

1370 		 * another error because the object count is now wrong.
1448 slab_err(s, slab, "Wrong object count. Counter is %d but counted were %d",
1451 slab_fix(s, "Object count adjusted");
2282 unsigned int count = oo_objects(s->oo);
2289 err = cache_random_seq_create(s, count, GFP_KERNEL);
2300 for (i = 0; i < count; i++)
3334 * For a long list, approximate the total count of objects in
4364 * count (cnt). Bulk free indicated by tail pointer being set.
5918 unsigned long count = 0;
5926 count++;
5928 if (count != n->nr_partial) {
5930 s->name, count, n->nr_partial);
5939 count++;
5941 if (count != node_nr_slabs(n)) {
5943 s->name, count, node_nr_slabs(n));
5949 return count;
5955 unsigned long count = 0;
5965 count += validate_slab_node(s, n, obj_map);
5969 return count;
5981 unsigned long count;
5995 unsigned long count;
6020 if (t->count) {
6021 memcpy(l, t->loc, sizeof(struct location) * t->count);
6044 end = t->count;
6063 l->count++;
6097 if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC))
6101 if (pos < t->count)
6103 (t->count - pos) * sizeof(struct location));
6104 t->count++;
6105 l->count = 1;
6273 ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count);
7033 if (idx < t->count) {
7036 seq_printf(seq, "%7ld ", l->count);
7045 l->count * l->waste, l->waste);
7049 l->min_time, div_u64(l->sum_time, l->count),
7086 if (!idx && !t->count)
7101 if (*ppos <= t->count)
7112 if (loc1->count > loc2->count)
7179 /* Sort locations by count */
7180 sort_r(t->loc, t->count, sizeof(struct location),