Lines Matching defs:count
56 u8 count = 0;
89 if (unlikely(!++count))
139 * The merging is controlled by "count", the number of elements in the
142 * Each time we increment "count", we set one bit (bit k) and clear
144 * for each bit, when count increments to 2^k), we merge two lists of
147 * This merge happens exactly when the count reaches an odd multiple of
156 * state of bit k of "count" plus two extra pieces of information:
160 * is count >= 2^(k+1)).
188 size_t count = 0; /* Count of pending */
207 * each time count reaches an odd multiple of that size).
211 * which flips when count is incremented, and
218 /* Find the least-significant clear bit in count */
219 for (bits = count; bits & 1; bits >>= 1)
236 count++;