Lines Matching defs:count
206 * This algorithm tries to count things in as big a chunk as possible,
207 * first aligning to a byte offset, then trying to count longs, a short,
215 u_long count;
225 count = 0;
238 count++;
253 count += sizeof(*valPtr) * NBBY;
267 count += sizeof(*valPtr) * NBBY;
277 count += NBBY;
290 count++;
304 count++;
309 return (count);
359 * Return the first offset within the range position..(position + count)
654 u_long count;
683 if (requests[i].count == 0) {
687 resid = requests[i].count;