Lines Matching defs:count
95 deflist_size(cur_blksz, work_list.header.count) *
97 for (i = 0; i < work_list.header.count; i++)
108 work_list.header.count);
160 work_list.header.count);
234 work_list.header.count);
244 work_list.header.count);
351 work_list.header.count = 0;
378 int i, count, num;
387 count = work_list.header.count;
388 if (work_list.list == NULL || count == 0) {
397 ioparam.io_bounds.upper = count;
418 for (i = num; i < count - 1; i++)
424 if (deflist_size(cur_blksz, count - 1) <
425 deflist_size(cur_blksz, count))
428 deflist_size(cur_blksz, count - 1) * cur_blksz);
430 * Decrement the defect count.
432 work_list.header.count--;
481 if (work_list.header.count != 0)
487 for (i = 0; i < work_list.header.count; i++) {
577 * Print a header containing the magic number, count, and checksum.
581 work_list.header.count, work_list.header.cksum);
586 for (i = 0; i < work_list.header.count; i++) {
614 int i, items, status = 0, count, cksum;
669 &count, (uint_t *)&cksum);
673 if (items != 3 || count < 0 ||
691 work_list.header.count = count;
697 deflist_size(cur_blksz, count) * cur_blksz);
705 for (i = 0; i < count; i++) {
810 work_list.header.count = 0;
819 deflist_size(cur_blksz, cur_list.header.count) * cur_blksz);
820 for (i = 0; i < cur_list.header.count; i++)
834 cur_list.header.count);
837 cur_list.header.count);